_ZNK5Botan7AES_1284nameEv: 28| 4| std::string name() const override { return "AES-128"; } _ZNK5Botan7AES_2564nameEv: 119| 56| std::string name() const override { return "AES-256"; } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 9.23k| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 9.23k| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 21.7k| void clear() { 72| 21.7k| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 21.7k| m_position = 0; 74| 21.7k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 474| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 1.80k| void clear() { 72| 1.80k| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 1.80k| m_position = 0; 74| 1.80k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 474| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 16.3k| [[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| 16.3k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 16.3k] ------------------ 171| | 172| 16.3k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 16.0k, False: 256] | Branch (172:31): [True: 3.54k, False: 12.5k] ------------------ 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| 3.54k| return std::nullopt; 177| 3.54k| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 12.7k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 12.7k| 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| 12.7k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 102, False: 12.6k] | Branch (188:36): [True: 102, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 102| return consume(); 190| 12.6k| } else { 191| 12.6k| return std::nullopt; 192| 12.6k| } 193| 12.7k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 20.0k| constexpr bool defers_final_block() const { 234| 20.0k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 20.0k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 25.2k| void append(std::span elements) { 91| 25.2k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 77| 25.2k| do { \ | | 78| 25.2k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 25.2k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 25.2k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 25.2k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 25.2k] | | ------------------ ------------------ 92| 25.2k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 25.2k| m_position += elements.size(); 94| 25.2k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 62.5k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 50.2k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 12.5k| [[nodiscard]] std::span consume() { 201| 12.5k| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 77| 12.5k| do { \ | | 78| 12.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 12.5k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 12.5k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.5k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.5k] | | ------------------ ------------------ 202| 12.5k| m_position = 0; 203| 12.5k| return m_buffer; 204| 12.5k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 36.3k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 3.64k| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 3.64k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 77| 3.64k| do { \ | | 78| 3.64k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 3.64k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 3.64k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 3.64k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 3.64k] | | ------------------ ------------------ 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| 3.64k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 3.64k] ------------------ 132| 3.64k| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 3.64k| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 3.64k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 12.4k| void fill_up_with_zeros() { 80| 12.4k| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 12.4k, False: 0] ------------------ 81| 12.4k| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 12.4k| m_position = m_buffer.size(); 83| 12.4k| } 84| 12.4k| } _ZN5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 12.4k| std::span directly_modify_last(size_t elements) { 114| 12.4k| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 77| 12.4k| do { \ | | 78| 12.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 12.4k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 12.4k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.4k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.4k] | | ------------------ ------------------ 115| 12.4k| return std::span(m_buffer).last(elements); 116| 12.4k| } _ZNK5Botan15AlignmentBufferIhLm64ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 12.4k| constexpr size_t size() const { return m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 2.89k| [[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| 2.89k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 2.89k] ------------------ 171| | 172| 2.89k| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 2.49k, False: 399] | Branch (172:31): [True: 1.31k, False: 1.18k] ------------------ 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| 1.31k| return std::nullopt; 177| 1.31k| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 1.58k| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 1.58k| append(slicer.take(elements_to_consume)); 183| | 184| | // If we collected enough data, we push out one full block. When 185| | // deferring the final block is enabled, we additionally check that 186| | // more input data is available to continue processing a consecutive 187| | // block. 188| 1.58k| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 1, False: 1.58k] | Branch (188:36): [True: 1, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 1| return consume(); 190| 1.58k| } else { 191| 1.58k| return std::nullopt; 192| 1.58k| } 193| 1.58k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 4.20k| constexpr bool defers_final_block() const { 234| 4.20k| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 4.20k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 2.77k| void append(std::span elements) { 91| 2.77k| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 77| 2.77k| do { \ | | 78| 2.77k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2.77k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 2.77k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 2.77k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 2.77k] | | ------------------ ------------------ 92| 2.77k| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 2.77k| m_position += elements.size(); 94| 2.77k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 6.49k| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 5.45k| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 1.33k| [[nodiscard]] std::span consume() { 201| 1.33k| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 77| 1.33k| do { \ | | 78| 1.33k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.33k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.33k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.33k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.33k] | | ------------------ ------------------ 202| 1.33k| m_position = 0; 203| 1.33k| return m_buffer; 204| 1.33k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 7.09k| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 1.31k| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 1.31k| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 77| 1.31k| do { \ | | 78| 1.31k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.31k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.31k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.31k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.31k] | | ------------------ ------------------ 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| 1.31k| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 1.31k] ------------------ 132| 1.31k| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 1.31k| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 1.31k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 1.33k| void fill_up_with_zeros() { 80| 1.33k| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 1.33k, False: 2] ------------------ 81| 1.33k| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 1.33k| m_position = m_buffer.size(); 83| 1.33k| } 84| 1.33k| } _ZN5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE20directly_modify_lastEm: 113| 1.19k| std::span directly_modify_last(size_t elements) { 114| 1.19k| BOTAN_ASSERT_NOMSG(size() >= elements); ------------------ | | 77| 1.19k| do { \ | | 78| 1.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.19k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.19k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.19k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.19k] | | ------------------ ------------------ 115| 1.19k| return std::span(m_buffer).last(elements); 116| 1.19k| } _ZNK5Botan15AlignmentBufferIhLm128ELNS_25AlignmentBufferFinalBlockE0EE4sizeEv: 217| 1.19k| constexpr size_t size() const { return m_buffer.size(); } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EEC2Ev: 62| 32| AlignmentBuffer() = default; _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EED2Ev: 64| 32| ~AlignmentBuffer() { secure_zeroize_buffer(m_buffer.data(), sizeof(T) * m_buffer.size()); } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE5clearEv: 71| 37| void clear() { 72| 37| zeroize_buffer(m_buffer.data(), m_buffer.size()); 73| 37| m_position = 0; 74| 37| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE21handle_unaligned_dataERNS_12BufferSlicerE: 166| 74| [[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| 74| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (170:31): [True: 0, False: 74] ------------------ 171| | 172| 74| if(in_alignment() && slicer.remaining() >= m_buffer.size() + defer) { ------------------ | Branch (172:13): [True: 74, False: 0] | Branch (172:31): [True: 32, False: 42] ------------------ 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| 32| return std::nullopt; 177| 32| } 178| | 179| | // Fill the buffer with as much input data as needed to reach alignment 180| | // or until the input source is depleted. 181| 42| const auto elements_to_consume = std::min(m_buffer.size() - m_position, slicer.remaining()); 182| 42| 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| 42| if(ready_to_consume() && (!defers_final_block() || !slicer.empty())) { ------------------ | Branch (188:13): [True: 0, False: 42] | Branch (188:36): [True: 0, False: 0] | Branch (188:61): [True: 0, False: 0] ------------------ 189| 0| return consume(); 190| 42| } else { 191| 42| return std::nullopt; 192| 42| } 193| 42| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE18defers_final_blockEv: 233| 106| constexpr bool defers_final_block() const { 234| 106| return FINAL_BLOCK_STRATEGY == AlignmentBufferFinalBlock::must_be_deferred; 235| 106| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE16ready_to_consumeEv: 231| 126| bool ready_to_consume() const { return m_position == m_buffer.size(); } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE12in_alignmentEv: 226| 291| bool in_alignment() const { return m_position == 0; } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE23aligned_data_to_processERNS_12BufferSlicerE: 126| 32| [[nodiscard]] std::tuple, size_t> aligned_data_to_process(BufferSlicer& slicer) const { 127| 32| BOTAN_ASSERT_NOMSG(in_alignment()); ------------------ | | 77| 32| do { \ | | 78| 32| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 32| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 32] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 32| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 32] | | ------------------ ------------------ 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| 32| const size_t defer = (defers_final_block()) ? 1 : 0; ------------------ | Branch (131:31): [True: 0, False: 32] ------------------ 132| 32| const size_t full_blocks_to_process = (slicer.remaining() - defer) / m_buffer.size(); 133| 32| return {slicer.take(full_blocks_to_process * m_buffer.size()), full_blocks_to_process}; 134| 32| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE6appendENSt3__14spanIKhLm18446744073709551615EEE: 90| 42| void append(std::span elements) { 91| 42| BOTAN_ASSERT_NOMSG(elements.size() <= elements_until_alignment()); ------------------ | | 77| 42| do { \ | | 78| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 42| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 42] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 42| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 42] | | ------------------ ------------------ 92| 42| std::copy(elements.begin(), elements.end(), m_buffer.begin() + m_position); 93| 42| m_position += elements.size(); 94| 42| } _ZNK5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE24elements_until_alignmentEv: 221| 84| size_t elements_until_alignment() const { return m_buffer.size() - m_position; } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE18fill_up_with_zerosEv: 79| 42| void fill_up_with_zeros() { 80| 42| if(!ready_to_consume()) { ------------------ | Branch (80:13): [True: 42, False: 0] ------------------ 81| 42| zeroize_buffer(&m_buffer[m_position], elements_until_alignment()); 82| 42| m_position = m_buffer.size(); 83| 42| } 84| 42| } _ZN5Botan15AlignmentBufferIhLm16ELNS_25AlignmentBufferFinalBlockE0EE7consumeEv: 200| 42| [[nodiscard]] std::span consume() { 201| 42| BOTAN_ASSERT_NOMSG(ready_to_consume()); ------------------ | | 77| 42| do { \ | | 78| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 42| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 42] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 42| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 42] | | ------------------ ------------------ 202| 42| m_position = 0; 203| 42| return m_buffer; 204| 42| } _ZNK5Botan17Barrett_Reduction4cubeERKNS_6BigIntE: 66| 7| BigInt cube(const BigInt& x) const { return this->multiply(x, this->square(x)); } _ZNK5Botan17Barrett_Reduction12modulus_bitsEv: 71| 39| size_t modulus_bits() const { return m_modulus_bits; } _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEhEET_S2_: 37| 197k|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 197k| return ct_expand_top_bit(~x & (x - 1)); 39| 197k|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEhEET_S2_: 28| 197k|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 197k| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 197k| return static_cast(0) - top; 31| 197k|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEmEET_S2_: 28| 347M|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 347M| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 347M| return static_cast(0) - top; 31| 347M|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEmEET_S2_: 37| 271M|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 271M| return ct_expand_top_bit(~x & (x - 1)); 39| 271M|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 216| 847M|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 217| | //return (mask & a) | (~mask & b); 218| 847M| return (b ^ (mask & (a ^ b))); 219| 847M|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEjEEmT_m: 45| 9.26k|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| 9.26k| const T a = ~x & (x - 1); 51| 9.26k| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 9.26k| const size_t mask = static_cast(0) - a_top; 53| 9.26k| return mask & s; 54| 9.26k|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEjEEmT_: 73| 1.85k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 1.85k| size_t hb = 0; 75| | 76| 11.1k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 9.26k, False: 1.85k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 9.26k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 9.26k| hb += z; 80| 9.26k| n >>= z; 81| 9.26k| } 82| | 83| 1.85k| hb += n; 84| | 85| 1.85k| return hb; 86| 1.85k|} _ZN5Botan17significant_bytesITkNSt3__117unsigned_integralEmEEmT_: 94| 4.19k|BOTAN_FORCE_INLINE constexpr size_t significant_bytes(T n) { 95| 4.19k| size_t b = 0; 96| | 97| 16.7k| for(size_t s = 8 * sizeof(T) / 2; s >= 8; s /= 2) { ------------------ | Branch (97:38): [True: 12.5k, False: 4.19k] ------------------ 98| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 99| 12.5k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 100| 12.5k| b += z / 8; 101| 12.5k| n >>= z; 102| 12.5k| } 103| | 104| 4.19k| b += (n != 0); 105| | 106| 4.19k| return b; 107| 4.19k|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEmEEmT_m: 45| 983k|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| 983k| const T a = ~x & (x - 1); 51| 983k| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 983k| const size_t mask = static_cast(0) - a_top; 53| 983k| return mask & s; 54| 983k|} _ZN5Botan9swap_bitsITkNSt3__117unsigned_integralEmEEvRT_S3_S2_m: 202| 2.08k|BOTAN_FORCE_INLINE constexpr void swap_bits(T& x, T& y, T mask, size_t shift) { 203| 2.08k| const T swap = ((x >> shift) ^ y) & mask; 204| 2.08k| x ^= swap << shift; 205| 2.08k| y ^= swap; 206| 2.08k|} _ZN5Botan13is_power_of_2ITkNSt3__117unsigned_integralEmEEbT_: 62| 505|BOTAN_FORCE_INLINE constexpr bool is_power_of_2(T arg) { 63| 505| return (arg != 0) && (arg != 1) && ((arg & static_cast(arg - 1)) == 0); ------------------ | Branch (63:11): [True: 505, False: 0] | Branch (63:25): [True: 505, False: 0] | Branch (63:39): [True: 274, False: 231] ------------------ 64| 505|} _ZN5Botan8majorityITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 222| 428k|BOTAN_FORCE_INLINE constexpr T majority(T a, T b, T c) { 223| | /* 224| | Considering each bit of a, b, c individually 225| | 226| | If a xor b is set, then c is the deciding vote. 227| | 228| | If a xor b is not set then either a and b are both set or both unset. 229| | In either case the value of c doesn't matter, and examining b (or a) 230| | allows us to determine which case we are in. 231| | */ 232| 428k| return choose(a ^ b, c, b); 233| 428k|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEmEEmT_: 73| 21.2k|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 21.2k| size_t hb = 0; 75| | 76| 148k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 127k, False: 21.2k] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 127k| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 127k| hb += z; 80| 127k| n >>= z; 81| 127k| } 82| | 83| 21.2k| hb += n; 84| | 85| 21.2k| return hb; 86| 21.2k|} _ZN5Botan6chooseITkNSt3__117unsigned_integralEhEET_S2_S2_S2_: 216| 169k|BOTAN_FORCE_INLINE constexpr T choose(T mask, T a, T b) { 217| | //return (mask & a) | (~mask & b); 218| 169k| return (b ^ (mask & (a ^ b))); 219| 169k|} _ZN5Botan12ceil_tobytesITkNSt3__117unsigned_integralEmEET_S2_: 175| 14|BOTAN_FORCE_INLINE constexpr T ceil_tobytes(T bits) { 176| 14| return (bits + 7) / 8; 177| 14|} _ZN5Botan17ct_expand_top_bitITkNSt3__117unsigned_integralEtEET_S2_: 28| 618|BOTAN_FORCE_INLINE constexpr T ct_expand_top_bit(T a) { 29| 618| const T top = CT::value_barrier(a >> (sizeof(T) * 8 - 1)); 30| 618| return static_cast(0) - top; 31| 618|} _ZN5Botan3ctzITkNSt3__117unsigned_integralEmEEmT_: 115| 120k|BOTAN_FORCE_INLINE constexpr size_t ctz(T n) { 116| | /* 117| | * If n == 0 then this function will compute 8*sizeof(T)-1, so 118| | * initialize lb to 1 if n == 0 to produce the expected result. 119| | */ 120| 120k| size_t lb = ct_if_is_zero_ret(n, 1); 121| | 122| 843k| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (122:38): [True: 723k, False: 120k] ------------------ 123| 723k| const T range = (static_cast(1) << s) - 1; 124| | // Equivalent to: ((n & range) == 0) ? s : 0; 125| 723k| const size_t z = ct_if_is_zero_ret(n & range, s); 126| 723k| lb += z; 127| 723k| n >>= z; 128| 723k| } 129| | 130| 120k| return lb; 131| 120k|} _ZN5Botan10ct_is_zeroITkNSt3__117unsigned_integralEtEET_S2_: 37| 310|BOTAN_FORCE_INLINE constexpr T ct_is_zero(T x) { 38| 310| return ct_expand_top_bit(~x & (x - 1)); 39| 310|} _ZN5Botan8high_bitITkNSt3__117unsigned_integralEhEEmT_: 73| 9|BOTAN_FORCE_INLINE constexpr size_t high_bit(T n) { 74| 9| size_t hb = 0; 75| | 76| 36| for(size_t s = 8 * sizeof(T) / 2; s > 0; s /= 2) { ------------------ | Branch (76:38): [True: 27, False: 9] ------------------ 77| | // Equivalent to: ((n >> s) == 0) ? 0 : s; 78| 27| const size_t z = s - ct_if_is_zero_ret(n >> s, s); 79| 27| hb += z; 80| 27| n >>= z; 81| 27| } 82| | 83| 9| hb += n; 84| | 85| 9| return hb; 86| 9|} _ZN5Botan17ct_if_is_zero_retITkNSt3__117unsigned_integralEhEEmT_m: 45| 27|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| 27| const T a = ~x & (x - 1); 51| 27| const size_t a_top = static_cast(CT::value_barrier(a >> (sizeof(T) * 8 - 1))); 52| 27| const size_t mask = static_cast(0) - a_top; 53| 27| return mask & s; 54| 27|} _ZN5Botan7BlinderD2Ev: 80| 38| ~Blinder() = default; _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEmQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 27| 238k|inline constexpr T reverse_bytes(T x) { 28| | if constexpr(sizeof(T) == 1) { 29| | return x; 30| | } else if constexpr(sizeof(T) == 2) { 31| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 32| | return static_cast(__builtin_bswap16(x)); 33| |#else 34| | return static_cast((x << 8) | (x >> 8)); 35| |#endif 36| | } else if constexpr(sizeof(T) == 4) { 37| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 38| | return static_cast(__builtin_bswap32(x)); 39| |#else 40| | // MSVC at least recognizes this as a bswap 41| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 42| | ((x & 0xFF000000) >> 24)); 43| |#endif 44| 238k| } else if constexpr(sizeof(T) == 8) { 45| 238k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 46| 238k| return static_cast(__builtin_bswap64(x)); 47| |#else 48| | uint32_t hi = static_cast(x >> 32); 49| | uint32_t lo = static_cast(x); 50| | 51| | hi = reverse_bytes(hi); 52| | lo = reverse_bytes(lo); 53| | 54| | return (static_cast(lo) << 32) | hi; 55| |#endif 56| 238k| } 57| 238k|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEtQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 27| 168|inline constexpr T reverse_bytes(T x) { 28| | if constexpr(sizeof(T) == 1) { 29| | return x; 30| 168| } else if constexpr(sizeof(T) == 2) { 31| 168|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 32| 168| return static_cast(__builtin_bswap16(x)); 33| |#else 34| | return static_cast((x << 8) | (x >> 8)); 35| |#endif 36| | } else if constexpr(sizeof(T) == 4) { 37| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 38| | return static_cast(__builtin_bswap32(x)); 39| |#else 40| | // MSVC at least recognizes this as a bswap 41| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 42| | ((x & 0xFF000000) >> 24)); 43| |#endif 44| | } else if constexpr(sizeof(T) == 8) { 45| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 46| | return static_cast(__builtin_bswap64(x)); 47| |#else 48| | uint32_t hi = static_cast(x >> 32); 49| | uint32_t lo = static_cast(x); 50| | 51| | hi = reverse_bytes(hi); 52| | lo = reverse_bytes(lo); 53| | 54| | return (static_cast(lo) << 32) | hi; 55| |#endif 56| | } 57| 168|} _ZN5Botan13reverse_bytesITkNSt3__117unsigned_integralEjQooooooeqstT_Li1EeqstS2_Li2EeqstS2_Li4EeqstS2_Li8EEES2_S2_: 27| 102k|inline constexpr T reverse_bytes(T x) { 28| | if constexpr(sizeof(T) == 1) { 29| | return x; 30| | } else if constexpr(sizeof(T) == 2) { 31| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap16) 32| | return static_cast(__builtin_bswap16(x)); 33| |#else 34| | return static_cast((x << 8) | (x >> 8)); 35| |#endif 36| 102k| } else if constexpr(sizeof(T) == 4) { 37| 102k|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap32) 38| 102k| return static_cast(__builtin_bswap32(x)); 39| |#else 40| | // MSVC at least recognizes this as a bswap 41| | return static_cast(((x & 0x000000FF) << 24) | ((x & 0x0000FF00) << 8) | ((x & 0x00FF0000) >> 8) | 42| | ((x & 0xFF000000) >> 24)); 43| |#endif 44| | } else if constexpr(sizeof(T) == 8) { 45| |#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_bswap64) 46| | return static_cast(__builtin_bswap64(x)); 47| |#else 48| | uint32_t hi = static_cast(x >> 32); 49| | uint32_t lo = static_cast(x); 50| | 51| | hi = reverse_bytes(hi); 52| | lo = reverse_bytes(lo); 53| | 54| | return (static_cast(lo) << 32) | hi; 55| |#endif 56| | } 57| 102k|} _ZN5Botan12BufferSlicerC2ENSt3__14spanIKhLm18446744073709551615EEE: 25| 36.8k| explicit BufferSlicer(std::span buffer) : m_remaining(buffer) {} _ZN5Botan12BufferSlicer4takeEm: 37| 130k| std::span take(const size_t count) { 38| 130k| BOTAN_STATE_CHECK(remaining() >= count); ------------------ | | 51| 130k| do { \ | | 52| 130k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 130k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 130k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 130k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 130k] | | ------------------ ------------------ 39| 130k| auto result = m_remaining.first(count); 40| 130k| m_remaining = m_remaining.subspan(count); 41| 130k| return result; 42| 130k| } _ZNK5Botan12BufferSlicer9remainingEv: 66| 169k| size_t remaining() const { return m_remaining.size(); } _ZN5Botan12BufferSlicer9take_byteEv: 57| 111k| uint8_t take_byte() { return take(1)[0]; } _ZNK5Botan12BufferSlicer5emptyEv: 68| 257k| bool empty() const { return m_remaining.empty(); } _ZN5Botan13BufferStufferC2ENSt3__14spanIhLm18446744073709551615EEE: 26| 459| constexpr explicit BufferStuffer(std::span buffer) : m_buffer(buffer) {} _ZN5Botan13BufferStuffer4nextEm: 32| 2.32k| constexpr std::span next(size_t bytes) { 33| 2.32k| BOTAN_STATE_CHECK(m_buffer.size() >= bytes); ------------------ | | 51| 2.32k| do { \ | | 52| 2.32k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 2.32k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 2.32k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2.32k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2.32k] | | ------------------ ------------------ 34| | 35| 2.32k| auto result = m_buffer.first(bytes); 36| 2.32k| m_buffer = m_buffer.subspan(bytes); 37| 2.32k| return result; 38| 2.32k| } _ZN5Botan13BufferStuffer6appendENSt3__14spanIKhLm18446744073709551615EEE: 59| 572| constexpr void append(std::span buffer) { 60| 572| auto sink = next(buffer.size()); 61| 572| std::copy(buffer.begin(), buffer.end(), sink.begin()); 62| 572| } _ZN5Botan13BufferStuffer6appendEhm: 64| 1.47k| constexpr void append(uint8_t b, size_t repeat = 1) { 65| 1.47k| auto sink = next(repeat); 66| 1.47k| std::fill(sink.begin(), sink.end(), b); 67| 1.47k| } _ZNK5Botan13BufferStuffer4fullEv: 69| 735| constexpr bool full() const { return m_buffer.empty(); } _ZNK5Botan13BufferStuffer18remaining_capacityEv: 71| 568| constexpr size_t remaining_capacity() const { return m_buffer.size(); } _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| 7| CBC_Mode(std::move(cipher), std::move(padding)), m_tempbuf(ideal_granularity()) {} _ZNK5Botan8CBC_Mode6cipherEv: 45| 193| const BlockCipher& cipher() const { return *m_cipher; } _ZNK5Botan8CBC_Mode10block_sizeEv: 52| 88| size_t block_size() const { return m_block_size; } _ZN5Botan8CBC_Mode5stateEv: 54| 86| secure_vector& state() { return m_state; } _ZN5Botan8CBC_Mode9state_ptrEv: 56| 48| uint8_t* state_ptr() { return m_state.data(); } _ZN5Botan14CCM_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEmm: 95| 1| CCM_Mode(std::move(cipher), tag_size, L) {} _ZNK5Botan8CCM_Mode8tag_sizeEv: 47| 3| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan8CCM_Mode1LEv: 54| 6| size_t L() const { return m_L; } _ZNK5Botan8CCM_Mode6cipherEv: 56| 1| const BlockCipher& cipher() const { return *m_cipher; } _ZNK5Botan8CCM_Mode6ad_bufEv: 62| 1| const secure_vector& ad_buf() const { return m_ad_buf; } _ZN5Botan8CCM_Mode7msg_bufEv: 64| 2| secure_vector& msg_buf() { return m_msg_buf; } _ZNK5Botan14CCM_Encryption13output_lengthEm: 97| 1| size_t output_length(size_t input_length) const override { return input_length + tag_size(); } _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: 92| 170|{ 93| | if constexpr(std::same_as) { 94| | // Try to auto-detect a reasonable output type given the input ranges 95| | static_assert(sizeof...(Rs) > 0, "Cannot auto-detect the output type if not a single input range is provided."); 96| | using candidate_result_t = std::remove_cvref_t>>; 97| | using result_range_value_t = std::remove_cvref_t>; 98| | 99| | if constexpr((ranges::statically_spanable_range && ...)) { 100| | // If all input ranges have a static extent, we can calculate the total size at compile time 101| | // and therefore can use a statically sized output container. This is constexpr. 102| | constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 103| | using out_array_t = std::array; 104| | return detail::concatenate(std::forward(ranges)...); 105| | } else { 106| | // If at least one input range has a dynamic extent, we must use a dynamically allocated output container. 107| | // We assume that the user wants to use the first input range's container type as output type. 108| | static_assert( 109| | concepts::reservable_container, 110| | "First input range has static extent, but a dynamically allocated output range is required. Please explicitly specify a dynamically allocatable output type."); 111| | return detail::concatenate(std::forward(ranges)...); 112| | } 113| 170| } else { 114| | // The caller has explicitly specified the output type 115| 170| return detail::concatenate(std::forward(ranges)...); 116| 170| } 117| 170|} _ZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_E: 33| 170|{ 34| 170| OutR result{}; 35| | 36| | // Prepare and validate the output range and construct a lambda that does the 37| | // actual filling of the result buffer. 38| | // (if no input ranges are given, GCC claims that fill_fn is unused) 39| 170| [[maybe_unused]] auto fill_fn = [&] { 40| 170| if constexpr(concepts::reservable_container) { 41| | // dynamically allocate the correct result byte length 42| 170| const size_t total_size = (ranges.size() + ... + 0); 43| 170| result.reserve(total_size); 44| | 45| | // fill the result buffer using a back-inserter 46| 170| return [&result](auto&& range) { 47| 170| std::copy( 48| 170| std::ranges::begin(range), std::ranges::end(range), std::back_inserter(unwrap_strong_type(result))); 49| 170| }; 50| 170| } else { 51| 170| if constexpr((ranges::statically_spanable_range && ... && true)) { 52| | // all input ranges have a static extent, so check the total size at compile time 53| | // (work around an issue in MSVC that warns `total_size` is unused) 54| 170| [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 55| 170| static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 56| 170| } else { 57| | // at least one input range has a dynamic extent, so check the total size at runtime 58| 170| const size_t total_size = (ranges.size() + ... + 0); 59| 170| BOTAN_ARG_CHECK(result.size() == total_size, 60| 170| "result buffer has static extent that does not match the sum of input buffers"); 61| 170| } 62| | 63| | // fill the result buffer and hold the current output-iterator position 64| 170| return [itr = std::ranges::begin(result)](auto&& range) mutable { 65| 170| std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 66| 170| std::advance(itr, std::ranges::size(range)); 67| 170| }; 68| 170| } 69| 170| }(); 70| | 71| | // perform the actual concatenation 72| 170| (fill_fn(std::forward(ranges)), ...); 73| | 74| 170| return result; 75| 170|} _ZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_EENKUlvE_clEv: 39| 170| [[maybe_unused]] auto fill_fn = [&] { 40| 170| if constexpr(concepts::reservable_container) { 41| | // dynamically allocate the correct result byte length 42| 170| const size_t total_size = (ranges.size() + ... + 0); 43| 170| result.reserve(total_size); 44| | 45| | // fill the result buffer using a back-inserter 46| 170| return [&result](auto&& range) { 47| 170| std::copy( 48| 170| std::ranges::begin(range), std::ranges::end(range), std::back_inserter(unwrap_strong_type(result))); 49| 170| }; 50| | } else { 51| | if constexpr((ranges::statically_spanable_range && ... && true)) { 52| | // all input ranges have a static extent, so check the total size at compile time 53| | // (work around an issue in MSVC that warns `total_size` is unused) 54| | [[maybe_unused]] constexpr size_t total_size = (decltype(std::span{ranges})::extent + ... + 0); 55| | static_assert(result.size() == total_size, "size of result buffer does not match the sum of input buffers"); 56| | } else { 57| | // at least one input range has a dynamic extent, so check the total size at runtime 58| | const size_t total_size = (ranges.size() + ... + 0); 59| | BOTAN_ARG_CHECK(result.size() == total_size, 60| | "result buffer has static extent that does not match the sum of input buffers"); 61| | } 62| | 63| | // fill the result buffer and hold the current output-iterator position 64| | return [itr = std::ranges::begin(result)](auto&& range) mutable { 65| | std::copy(std::ranges::begin(range), std::ranges::end(range), itr); 66| | std::advance(itr, std::ranges::size(range)); 67| | }; 68| | } 69| 170| }(); _ZZZN5Botan6detail11concatenateITkNS_6ranges14spanable_rangeENSt3__16vectorIhNS_16secure_allocatorIhEEEETpTkNS2_14spanable_rangeEJRNS3_4spanIKhLm18446744073709551615EEESB_EEET_DpOT0_Qoosr8conceptsE20reservable_containerISC_Esr6rangesE25statically_spanable_rangeISC_EENKUlvE_clEvENKUlOSC_E_clISB_EEDaSH_: 46| 340| return [&result](auto&& range) { 47| 340| std::copy( 48| 340| std::ranges::begin(range), std::ranges::end(range), std::back_inserter(unwrap_strong_type(result))); 49| 340| }; _ZN5Botan5CPUID3hasENS_10CPUFeatureE: 94| 27.8k| static bool has(CPUID::Feature feat) { return state().has_bit(feat.as_u32()); } _ZN5Botan5CPUID3hasENS_10CPUFeatureES1_: 99| 5.30k| static bool has(CPUID::Feature feat1, CPUID::Feature feat2) { 100| 5.30k| return state().has_bit(feat1.as_u32() | feat2.as_u32()); 101| 5.30k| } _ZN5Botan5CPUID6is_setEjNS_10CPUFeatureE: 127| 4| static inline bool is_set(uint32_t allowed, CPUID::Feature bit) { 128| 4| const uint32_t feat_bit = bit.as_u32(); 129| 4| return ((allowed & feat_bit) == feat_bit); 130| 4| } _ZNK5Botan5CPUID10CPUID_Data7has_bitEj: 144| 33.1k| bool has_bit(uint32_t bit) const { return (m_processor_features & bit) == bit; } _ZN5Botan5CPUID5stateEv: 156| 33.1k| static CPUID_Data& state() { 157| 33.1k| static CPUID::CPUID_Data g_cpuid; 158| 33.1k| return g_cpuid; 159| 33.1k| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_1_bitsEEjmT_NS_10CPUFeatureEj: 117| 6| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 118| 6| const uint64_t flag64 = static_cast(flag); 119| 6| if((cpuid & flag64) == flag64) { ------------------ | Branch (119:13): [True: 6, False: 0] ------------------ 120| 6| return (bit.as_u32() & allowed); 121| 6| } else { 122| 0| return 0; 123| 0| } 124| 6| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE16x86_CPUID_7_bitsEEjmT_NS_10CPUFeatureEj: 117| 8| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 118| 8| const uint64_t flag64 = static_cast(flag); 119| 8| if((cpuid & flag64) == flag64) { ------------------ | Branch (119:13): [True: 5, False: 3] ------------------ 120| 5| return (bit.as_u32() & allowed); 121| 5| } else { 122| 3| return 0; 123| 3| } 124| 8| } cpuid_x86.cpp:_ZN5Botan5CPUID6if_setIZNS0_10CPUID_Data19detect_cpu_featuresEjE18x86_CPUID_7_1_bitsEEjmT_NS_10CPUFeatureEj: 117| 3| static inline uint32_t if_set(uint64_t cpuid, T flag, CPUID::Feature bit, uint32_t allowed) { 118| 3| const uint64_t flag64 = static_cast(flag); 119| 3| if((cpuid & flag64) == flag64) { ------------------ | Branch (119:13): [True: 0, False: 3] ------------------ 120| 0| return (bit.as_u32() & allowed); 121| 3| } else { 122| 3| return 0; 123| 3| } 124| 3| } _ZN5Botan10CPUFeatureC2ENS0_3BitE: 51| 38.4k| CPUFeature(Bit b) : m_bit(b) {} // NOLINT(*-explicit-conversions) _ZNK5Botan10CPUFeature6as_u32Ev: 53| 38.4k| uint32_t as_u32() const { return static_cast(m_bit); } _ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EEPKS3_S6_m: 798| 17.7k|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 17.7k| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 17.7k] ------------------ 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| 17.7k| } else { 808| 17.7k| volatile T difference = 0; 809| | 810| 310k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 292k, False: 17.7k] ------------------ 811| 292k| difference = difference | (x[i] ^ y[i]); 812| 292k| } 813| | 814| 17.7k| return CT::Mask::is_zero(difference); 815| 17.7k| } 816| 17.7k|} _ZN5Botan2CT4MaskIhE7is_zeroEh: 437| 197k| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZN5Botan2CT4MaskIhEC2Eh: 637| 365k| constexpr explicit Mask(T m) : m_mask(m) {} _ZNK5Botan2CT4MaskIhE7as_boolEv: 614| 17.4k| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskIhE16unpoisoned_valueEv: 598| 17.4k| constexpr T unpoisoned_value() const { 599| 17.4k| T r = value(); 600| 17.4k| CT::unpoison(r); 601| 17.4k| return r; 602| 17.4k| } _ZNK5Botan2CT4MaskIhE5valueEv: 630| 376k| constexpr T value() const { return value_barrier(m_mask); } _ZN5Botan2CT8unpoisonITkNSt3__18integralEhEEvRKT_: 112| 17.5k|constexpr void unpoison(const T& p) { 113| 17.5k| unpoison(&p, 1); 114| 17.5k|} _ZN5Botan2CT8unpoisonIhEEvPKT_m: 67| 17.6k|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| 17.6k| BOTAN_UNUSED(p, n); ------------------ | | 144| 17.6k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 17.6k|} _ZN5Botan2CT6Choice9from_maskEm: 303| 1.37M| constexpr static Choice from_mask(underlying_type v) { return Choice(v); } _ZN5Botan2CT6Choice3yesEv: 305| 38| constexpr static Choice yes() { return !no(); } _ZN5Botan2CT6Choice2noEv: 307| 43| constexpr static Choice no() { return Choice(0); } _ZNK5Botan2CT6ChoicentEv: 309| 1.17M| constexpr Choice operator!() const { return Choice(~value()); } _ZNK5Botan2CT6ChoiceaaERKS1_: 311| 1.18M| constexpr Choice operator&&(const Choice& other) const { return Choice(value() & other.value()); } _ZNK5Botan2CT6ChoiceooERKS1_: 313| 9.56k| constexpr Choice operator||(const Choice& other) const { return Choice(value() | other.value()); } _ZNK5Botan2CT6Choice7as_boolEv: 329| 1.17M| constexpr bool as_bool() const { return m_value != 0; } _ZNK5Botan2CT6Choice5valueEv: 332| 3.58M| constexpr underlying_type value() const { return value_barrier(m_value); } _ZN5Botan2CT6ChoiceC2Em: 341| 4.75M| constexpr explicit Choice(underlying_type v) : m_value(CT::value_barrier(v)) {} _ZN5Botan2CT4MaskImE7is_zeroEm: 437| 136M| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZNK5Botan2CT4MaskImE5valueEv: 630| 1.31G| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskImEcoEv: 533| 37.6M| constexpr Mask operator~() const { return Mask(~value()); } _ZN5Botan2CT4MaskImE6expandEm: 392| 31.0M| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZNK5Botan2CT4MaskImE6selectEmm: 548| 209M| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZN5Botan2CT6poisonIhEEvPKT_m: 56| 86|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| 86| BOTAN_UNUSED(p, n); ------------------ | | 144| 86|#define BOTAN_UNUSED Botan::ignore_params ------------------ 64| 86|} _ZN5Botan2CT8unpoisonItEEvPKT_m: 67| 6|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| 6| BOTAN_UNUSED(p, n); ------------------ | | 144| 6|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 6|} _ZN5Botan2CT4MaskImE14expand_top_bitEm: 415| 75.5M| static constexpr Mask expand_top_bit(T v) { return Mask(ct_expand_top_bit(v)); } _ZN5Botan2CT4MaskImEC2Em: 637| 287M| constexpr explicit Mask(T m) : m_mask(m) {} _ZN5Botan2CT4MaskImE5is_ltEmm: 450| 75.5M| static constexpr Mask is_lt(T x, T y) { 451| 75.5M| T u = x ^ ((x ^ y) | ((x - y) ^ x)); 452| 75.5M| return Mask::expand_top_bit(u); 453| 75.5M| } _ZNK5Botan2CT4MaskImE13if_set_returnEm: 538| 957M| constexpr T if_set_return(T x) const { return value() & x; } _ZN5Botan2CT4MaskImE8is_equalEmm: 442| 102M| static constexpr Mask is_equal(T x, T y) { 443| 102M| const T diff = value_barrier(x) ^ value_barrier(y); 444| 102M| return Mask::is_zero(diff); 445| 102M| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEmEEvRKT_: 112| 4.87M|constexpr void unpoison(const T& p) { 113| 4.87M| unpoison(&p, 1); 114| 4.87M|} _ZN5Botan2CT8unpoisonImEEvPKT_m: 67| 10.6M|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| 10.6M| BOTAN_UNUSED(p, n); ------------------ | | 144| 10.6M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 75| 10.6M|} _ZNK5Botan2CT4MaskImE7as_boolEv: 614| 444k| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskImE16unpoisoned_valueEv: 598| 1.81M| constexpr T unpoisoned_value() const { 599| 1.81M| T r = value(); 600| 1.81M| CT::unpoison(r); 601| 1.81M| return r; 602| 1.81M| } _ZNK5Botan2CT4MaskImE11select_maskES2_S2_: 559| 33.6M| Mask select_mask(Mask x, Mask y) const { return Mask(select(x.value(), y.value())); } _ZN5Botan2CT4MaskImEoRES2_: 510| 238k| Mask& operator|=(Mask o) { 511| 238k| m_mask |= o.value(); 512| 238k| return (*this); 513| 238k| } _ZN5Botan2CT4MaskImEaNES2_: 494| 901k| Mask& operator&=(Mask o) { 495| 901k| m_mask &= o.value(); 496| 901k| return (*this); 497| 901k| } _ZNK5Botan2CT4MaskImE8select_nEPmPKmS5_m: 565| 22.9M| constexpr void select_n(T output[], const T x[], const T y[], size_t len) const { 566| 22.9M| const T mask = value(); 567| 659M| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (567:28): [True: 636M, False: 22.9M] ------------------ 568| 636M| output[i] = choose(mask, x[i], y[i]); 569| 636M| } 570| 22.9M| } _ZN5Botan2CT4MaskImE11expand_boolEb: 397| 168k| static constexpr Mask expand_bool(bool v) { return Mask::expand(static_cast(v)); } _ZN5Botan2CT4MaskIhE11expand_boolEb: 397| 168k| static constexpr Mask expand_bool(bool v) { return Mask::expand(static_cast(v)); } _ZN5Botan2CT4MaskIhE6expandEh: 392| 168k| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZNK5Botan2CT4MaskIhEcoEv: 533| 168k| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskIhE6selectEhh: 548| 169k| constexpr T select(T x, T y) const { return choose(value(), x, y); } _ZNK5Botan2CT4MaskImE9as_choiceEv: 619| 1.37M| constexpr CT::Choice as_choice() const { 620| 1.37M| if constexpr(sizeof(T) >= sizeof(Choice::underlying_type)) { 621| 1.37M| return CT::Choice::from_mask(static_cast(unpoisoned_value())); 622| | } else { 623| | return CT::Choice::from_int(unpoisoned_value()); 624| | } 625| 1.37M| } _ZN5Botan2CT6poisonImEEvPKT_m: 56| 1.13M|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| 1.13M| BOTAN_UNUSED(p, n); ------------------ | | 144| 1.13M|#define BOTAN_UNUSED Botan::ignore_params ------------------ 64| 1.13M|} _ZN5Botan2CT4MaskImE6is_gteEmm: 468| 97.4k| static constexpr Mask is_gte(T x, T y) { return ~Mask::is_lt(x, y); } _ZN5Botan2CTorENS0_4MaskImEES2_: 528| 96.8k| friend Mask operator|(Mask x, Mask y) { return Mask(x.value() | y.value()); } _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES3_PS3_PKS3_S7_m: 738| 11.9M|constexpr inline Mask conditional_copy_mem(T cnd, T* dest, const T* if_set, const T* if_unset, size_t elems) { 739| 11.9M| const auto mask = CT::Mask::expand(cnd); 740| 11.9M| return CT::conditional_copy_mem(mask, dest, if_set, if_unset, elems); 741| 11.9M|} _ZN5Botan2CT20conditional_copy_memImEENS0_4MaskIT_EES4_PS3_PKS3_S7_m: 732| 11.9M|constexpr inline Mask conditional_copy_mem(Mask mask, T* dest, const T* if_set, const T* if_unset, size_t elems) { 733| 11.9M| mask.select_n(dest, if_set, if_unset, elems); 734| 11.9M| return mask; 735| 11.9M|} _ZN5Botan2CTeoENS0_4MaskImEES2_: 523| 3.28M| friend Mask operator^(Mask x, Mask y) { return Mask(x.value() ^ y.value()); } _ZN5Botan2CT8is_equalIhEENS0_4MaskIT_EENSt3__14spanIKS3_Lm18446744073709551615EEES8_: 825| 17.4k|constexpr inline CT::Mask is_equal(std::span x, std::span y) { 826| 17.4k| if(x.size() != y.size()) { ------------------ | Branch (826:7): [True: 4, False: 17.4k] ------------------ 827| 4| return CT::Mask::cleared(); 828| 4| } 829| | 830| 17.4k| return is_equal(x.data(), y.data(), x.size()); 831| 17.4k|} _ZN5Botan2CT4MaskIhE7clearedEv: 387| 4| static constexpr Mask cleared() { return Mask(0); } _ZN5Botan2CT4MaskImE7clearedEv: 387| 3.09k| static constexpr Mask cleared() { return Mask(0); } _ZN5Botan2CT6poisonITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEnt17custom_poisonableISC_EEEvRKSC_: 121| 47.6k|constexpr void poison(const R& r) { 122| 47.6k| const std::span s{r}; 123| 47.6k| poison(s.data(), s.size()); 124| 47.6k|} _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| 3.27M|constexpr void unpoison(const R& r) { 129| 3.27M| const std::span s{r}; 130| 3.27M| unpoison(s.data(), s.size()); 131| 3.27M|} _ZN5Botan2CT9all_zerosImEENS0_4MaskIT_EEPKS3_m: 785| 33.4k|constexpr inline CT::Mask all_zeros(const T elem[], size_t len) { 786| 33.4k| T sum = 0; 787| 248k| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (787:22): [True: 215k, False: 33.4k] ------------------ 788| 215k| sum |= elem[i]; 789| 215k| } 790| 33.4k| return CT::Mask::is_zero(sum); 791| 33.4k|} _ZN5Botan2CTanENS0_4MaskImEES2_: 518| 607| friend Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZN5Botan2CT8unpoisonITkNS_6ranges14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS3_11conditionalIXsr21__is_primary_templateINS3_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS3_26indirectly_readable_traitsISD_EESE_E4type10value_typeEEnt19custom_unpoisonableISA_EEEvRKSA_: 128| 38|constexpr void unpoison(const R& r) { 129| 38| const std::span s{r}; 130| 38| unpoison(s.data(), s.size()); 131| 38|} _ZN5Botan2CT4MaskItEC2Et: 637| 1.54k| constexpr explicit Mask(T m) : m_mask(m) {} _ZN5Botan2CT4MaskItE14expand_top_bitEt: 415| 308| static constexpr Mask expand_top_bit(T v) { return Mask(ct_expand_top_bit(v)); } _ZNK5Botan2CT4MaskItEcoEv: 533| 614| constexpr Mask operator~() const { return Mask(~value()); } _ZNK5Botan2CT4MaskItE5valueEv: 630| 1.54k| constexpr T value() const { return value_barrier(m_mask); } _ZNK5Botan2CT4MaskItE7as_boolEv: 614| 2| constexpr bool as_bool() const { return unpoisoned_value() != 0; } _ZNK5Botan2CT4MaskItE16unpoisoned_valueEv: 598| 2| constexpr T unpoisoned_value() const { 599| 2| T r = value(); 600| 2| CT::unpoison(r); 601| 2| return r; 602| 2| } _ZN5Botan2CT8unpoisonITkNSt3__18integralEtEEvRKT_: 112| 6|constexpr void unpoison(const T& p) { 113| 6| unpoison(&p, 1); 114| 6|} _ZNK5Botan2CT4MaskIhE13if_set_returnEh: 538| 10.5k| constexpr T if_set_return(T x) const { return value() & x; } _ZNK5Botan2CT6OptionImE8value_orEmQsr3stdE17unsigned_integralIT_E: 701| 38| { 702| 38| auto mask = CT::Mask::from_choice(m_has_value); 703| 38| return mask.select(m_value, other); 704| 38| } _ZN5Botan2CT4MaskImE11from_choiceENS0_6ChoiceE: 402| 76| static constexpr Mask from_choice(Choice c) { 403| 76| if constexpr(sizeof(T) <= sizeof(Choice::underlying_type)) { 404| | // Take advantage of the fact that Choice's mask is always 405| | // either |0| or |1| 406| 76| return Mask(static_cast(c.value())); 407| | } else { 408| | return ~Mask::is_zero(c.value()); 409| | } 410| 76| } _ZN5Botan2CT4MaskIhEC2ImEENS1_IT_EE: 375| 648| constexpr explicit Mask(Mask o) : m_mask(static_cast(o.value())) { 376| 648| static_assert(sizeof(U) > sizeof(T), "sizes ok"); 377| 648| } _ZN5Botan2CT4MaskIhEaNES2_: 494| 10.5k| Mask& operator&=(Mask o) { 495| 10.5k| m_mask &= o.value(); 496| 10.5k| return (*this); 497| 10.5k| } _ZN5Botan2CT4MaskImE6is_lteEmm: 463| 321| static constexpr Mask is_lte(T x, T y) { return ~Mask::is_gt(x, y); } _ZN5Botan2CT4MaskImE5is_gtEmm: 458| 321| static constexpr Mask is_gt(T x, T y) { return Mask::is_lt(y, x); } _ZN5Botan2CT4MaskImE6expandIhEES2_NS1_IT_EE: 429| 283| static constexpr Mask expand(Mask m) { 430| 283| static_assert(sizeof(U) < sizeof(T), "sizes ok"); 431| 283| return ~Mask::is_zero(m.value()); 432| 283| } _ZN5Botan2CT6Choice8from_intIjQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES1_S3_: 268| 1.00M| constexpr static Choice from_int(T v) { 269| 1.00M| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 270| 1.00M| 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.00M| } _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| 1.09M|constexpr void poison(const R& r) { 122| 1.09M| const std::span s{r}; 123| 1.09M| poison(s.data(), s.size()); 124| 1.09M|} _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| 1.09M|constexpr void unpoison(const R& r) { 129| 1.09M| const std::span s{r}; 130| 1.09M| unpoison(s.data(), s.size()); 131| 1.09M|} _ZN5Botan2CT4MaskImE15if_set_zero_outEPmm: 575| 5.25k| constexpr void if_set_zero_out(T buf[], size_t elems) { 576| 53.5k| for(size_t i = 0; i != elems; ++i) { ------------------ | Branch (576:28): [True: 48.2k, False: 5.25k] ------------------ 577| 48.2k| buf[i] = this->if_not_set_return(buf[i]); 578| 48.2k| } 579| 5.25k| } _ZNK5Botan2CT4MaskImE17if_not_set_returnEm: 543| 168k| constexpr T if_not_set_return(T x) const { return ~value() & x; } _ZN5Botan2CT22conditional_assign_memImEENS0_4MaskIT_EES3_PS3_PKS3_m: 749| 7.73M|constexpr inline Mask conditional_assign_mem(T cnd, T* dest, const T* src, size_t elems) { 750| 7.73M| const auto mask = CT::Mask::expand(cnd); 751| 7.73M| mask.select_n(dest, src, dest, elems); 752| 7.73M| return mask; 753| 7.73M|} _ZN5Botan2CT12poison_rangeITkNSt3__16ranges5rangeENS2_6vectorINS_14Montgomery_IntENS2_9allocatorIS5_EEEEQ10poisonableINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS3_5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEEEvRKSC_: 181| 2.97k|constexpr void poison_range(const R& r) { 182| 47.6k| for(const auto& v : r) { ------------------ | Branch (182:22): [True: 47.6k, False: 2.97k] ------------------ 183| 47.6k| poison(v); 184| 47.6k| } 185| 2.97k|} _ZN5Botan2CT6poisonITkNS0_17custom_poisonableENS_14Montgomery_IntEEEvRKT_: 138| 47.6k|constexpr void poison(const T& x) { 139| 47.6k| x._const_time_poison(); 140| 47.6k|} _ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS_14Montgomery_IntEEEvRKT_: 143| 6.78k|constexpr void unpoison(const T& x) { 144| 6.78k| x._const_time_unpoison(); 145| 6.78k|} _ZN5Botan2CT16driveby_unpoisonITkNS0_12unpoisonableEmEEDcOT_Qsr3stdE21is_rvalue_reference_vIDtfp_EE: 245| 2.64k|{ 246| 2.64k| unpoison(v); 247| 2.64k| return std::forward(v); 248| 2.64k|} _ZNK5Botan2CT6Choice12into_bitmaskImQaasr3stdE17unsigned_integralIT_Entsr3stdE7same_asIbS3_EEES3_v: 291| 8.97k| constexpr T into_bitmask() const { 292| 8.97k| if constexpr(sizeof(T) <= sizeof(underlying_type)) { 293| | // The inner mask is already |0| or |1| so just truncate 294| 8.97k| return static_cast(value()); 295| | } else { 296| | return ~ct_is_zero(value()); 297| | } 298| 8.97k| } _ZN5Botan2CT8is_equalImEENS0_4MaskIT_EEPKS3_S6_m: 798| 24|constexpr inline CT::Mask is_equal(const T x[], const T y[], size_t len) { 799| 24| if(std::is_constant_evaluated()) { ------------------ | Branch (799:7): [Folded, False: 24] ------------------ 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| 24| } else { 808| 24| volatile T difference = 0; 809| | 810| 230| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (810:25): [True: 206, False: 24] ------------------ 811| 206| difference = difference | (x[i] ^ y[i]); 812| 206| } 813| | 814| 24| return CT::Mask::is_zero(difference); 815| 24| } 816| 24|} _ZN5Botan2CT4MaskItE5is_ltEtt: 450| 308| static constexpr Mask is_lt(T x, T y) { 451| 308| T u = x ^ ((x ^ y) | ((x - y) ^ x)); 452| 308| return Mask::expand_top_bit(u); 453| 308| } _ZNK5Botan2CT4MaskItE13if_set_returnEt: 538| 4| constexpr T if_set_return(T x) const { return value() & x; } _ZN5Botan2CT4MaskItE6is_lteEtt: 463| 306| static constexpr Mask is_lte(T x, T y) { return ~Mask::is_gt(x, y); } _ZN5Botan2CT4MaskItE5is_gtEtt: 458| 306| static constexpr Mask is_gt(T x, T y) { return Mask::is_lt(y, x); } _ZN5Botan2CT4MaskItE8is_equalEtt: 442| 306| static constexpr Mask is_equal(T x, T y) { 443| 306| const T diff = value_barrier(x) ^ value_barrier(y); 444| 306| return Mask::is_zero(diff); 445| 306| } _ZN5Botan2CT4MaskItE7is_zeroEt: 437| 310| static constexpr Mask is_zero(T x) { return Mask(ct_is_zero(value_barrier(x))); } _ZNK5Botan2CT4MaskItE17if_not_set_returnEt: 543| 2| constexpr T if_not_set_return(T x) const { return ~value() & x; } _ZN5Botan2CT4MaskItE6expandIhEES2_NS1_IT_EE: 429| 2| static constexpr Mask expand(Mask m) { 430| 2| static_assert(sizeof(U) < sizeof(T), "sizes ok"); 431| 2| return ~Mask::is_zero(m.value()); 432| 2| } _ZN5Botan2CT4MaskItE6expandEt: 392| 2| static constexpr Mask expand(T v) { return ~Mask::is_zero(value_barrier(v)); } _ZN5Botan2CT8unpoisonITkNS0_19custom_unpoisonableENS0_4MaskItEEEEvRKT_: 143| 2|constexpr void unpoison(const T& x) { 144| 2| x._const_time_unpoison(); 145| 2|} _ZNK5Botan2CT4MaskItE20_const_time_unpoisonEv: 634| 2| constexpr void _const_time_unpoison() const { CT::unpoison(m_mask); } _ZN5Botan2CTanENS0_4MaskItEES2_: 518| 308| friend Mask operator&(Mask x, Mask y) { return Mask(x.value() & y.value()); } _ZN5Botan2CT4MaskItEoRES2_: 510| 304| Mask& operator|=(Mask o) { 511| 304| m_mask |= o.value(); 512| 304| return (*this); 513| 304| } _ZN5Botan2CT6poisonITkNSt3__18integralEmEEvRKT_: 107| 38|constexpr void poison(const T& p) { 108| 38| poison(&p, 1); 109| 38|} _ZN5Botan2CT12unpoison_allITpTkNS0_12unpoisonableEJNSt3__14spanIhLm18446744073709551615EEEmEQgtsZT_Li0EEEvDpRKT_: 207| 38|constexpr void unpoison_all(const Ts&... ts) { 208| 38| (unpoison(ts), ...); 209| 38|} _ZN5Botan2CT6OptionImEC2EmNS0_6ChoiceE: 653| 38| constexpr Option(T v, Choice valid) : m_has_value(valid), m_value(std::move(v)) {} _ZN5Botan2CT4MaskIhE3setEv: 382| 38| static constexpr Mask set() { return Mask(static_cast(~0)); } _ZNK5Botan9TripleDES4nameEv: 50| 2| std::string name() const override { return "TripleDES"; } _ZNK5Botan13DL_PrivateKey11private_keyEv: 72| 114| const BigInt& private_key() const { return m_private_key; } _ZNK5Botan13DL_PrivateKey5groupEv: 67| 228| const DL_Group& group() const { return m_group; } _ZNK5Botan13EC_Group_Data3oidEv: 165| 92| const OID& oid() const { return m_oid; } _ZNK5Botan13EC_Group_Data1pEv: 169| 581| const BigInt& p() const { return m_p; } _ZNK5Botan13EC_Group_Data1aEv: 171| 1| const BigInt& a() const { return m_a; } _ZNK5Botan13EC_Group_Data1bEv: 173| 1| const BigInt& b() const { return m_b; } _ZNK5Botan13EC_Group_Data5montyEv: 184| 11.1k| const Montgomery_Params& monty() const { return m_monty; } _ZNK5Botan13EC_Group_Data7p_wordsEv: 201| 899| size_t p_words() const { return m_p_words; } _ZNK5Botan13EC_Group_Data12a_is_minus_3Ev: 211| 243| bool a_is_minus_3() const { return m_a_is_minus_3; } _ZNK5Botan13EC_Group_Data9a_is_zeroEv: 213| 243| bool a_is_zero() const { return m_a_is_zero; } _ZN5Botan17EC_PublicKey_DataC2ERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 29| 37| EC_PublicKey_Data(group, EC_AffinePoint(group, bytes)) {} _ZN5Botan3fmtIJNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEEES7_NS1_17basic_string_viewIcS4_EEDpRKT_: 53| 1.26k|std::string fmt(std::string_view format, const T&... args) { 54| 1.26k| std::ostringstream oss; 55| 1.26k| oss.imbue(std::locale::classic()); 56| 1.26k| fmt_detail::do_fmt(oss, format, args...); 57| 1.26k| return oss.str(); 58| 1.26k|} _ZN5Botan10fmt_detail6do_fmtINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_S7_EENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 1.26k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 1.26k| size_t i = 0; 27| | 28| 26.8k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 26.8k, False: 0] ------------------ 29| 26.8k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 1.26k, False: 25.5k] | Branch (29:30): [True: 1.26k, False: 0] | Branch (29:59): [True: 1.26k, False: 0] ------------------ 30| 1.26k| oss << val; 31| 1.26k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 25.5k| } else { 33| 25.5k| oss << format[i]; 34| 25.5k| } 35| | 36| 25.5k| i += 1; 37| 25.5k| } 38| 1.26k|} _ZN5Botan10fmt_detail6do_fmtERNSt3__119basic_ostringstreamIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 20| 12.5k|inline void do_fmt(std::ostringstream& oss, std::string_view format) { 21| 12.5k| oss << format; 22| 12.5k|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 7.37k|std::string fmt(std::string_view format, const T&... args) { 54| 7.37k| std::ostringstream oss; 55| 7.37k| oss.imbue(std::locale::classic()); 56| 7.37k| fmt_detail::do_fmt(oss, format, args...); 57| 7.37k| return oss.str(); 58| 7.37k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 7.53k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 7.53k| size_t i = 0; 27| | 28| 86.7k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 86.7k, False: 0] ------------------ 29| 86.7k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 7.53k, False: 79.1k] | Branch (29:30): [True: 7.53k, False: 0] | Branch (29:59): [True: 7.53k, False: 0] ------------------ 30| 7.53k| oss << val; 31| 7.53k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 79.1k| } else { 33| 79.1k| oss << format[i]; 34| 79.1k| } 35| | 36| 79.1k| i += 1; 37| 79.1k| } 38| 7.53k|} _ZN5Botan3fmtIJPKcS2_S2_EEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 5|std::string fmt(std::string_view format, const T&... args) { 54| 5| std::ostringstream oss; 55| 5| oss.imbue(std::locale::classic()); 56| 5| fmt_detail::do_fmt(oss, format, args...); 57| 5| return oss.str(); 58| 5|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_S3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 5|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 5| size_t i = 0; 27| | 28| 5| while(i < format.size()) { ------------------ | Branch (28:10): [True: 5, False: 0] ------------------ 29| 5| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 5, False: 0] | Branch (29:30): [True: 5, False: 0] | Branch (29:59): [True: 5, False: 0] ------------------ 30| 5| oss << val; 31| 5| return do_fmt(oss, format.substr(i + 2), rest...); 32| 5| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 5|} _ZN5Botan10fmt_detail6do_fmtIPKcJS3_EEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 5|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 5| size_t i = 0; 27| | 28| 25| while(i < format.size()) { ------------------ | Branch (28:10): [True: 25, False: 0] ------------------ 29| 25| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 5, False: 20] | Branch (29:30): [True: 5, False: 0] | Branch (29:59): [True: 5, False: 0] ------------------ 30| 5| oss << val; 31| 5| return do_fmt(oss, format.substr(i + 2), rest...); 32| 20| } else { 33| 20| oss << format[i]; 34| 20| } 35| | 36| 20| i += 1; 37| 20| } 38| 5|} _ZN5Botan10fmt_detail6do_fmtIPKcJEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 3.28k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 3.28k| size_t i = 0; 27| | 28| 46.0k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 46.0k, False: 0] ------------------ 29| 46.0k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 3.28k, False: 42.7k] | Branch (29:30): [True: 3.28k, False: 0] | Branch (29:59): [True: 3.28k, False: 0] ------------------ 30| 3.28k| oss << val; 31| 3.28k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 42.7k| } else { 33| 42.7k| oss << format[i]; 34| 42.7k| } 35| | 36| 42.7k| i += 1; 37| 42.7k| } 38| 3.28k|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPKcEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 3.27k|std::string fmt(std::string_view format, const T&... args) { 54| 3.27k| std::ostringstream oss; 55| 3.27k| oss.imbue(std::locale::classic()); 56| 3.27k| fmt_detail::do_fmt(oss, format, args...); 57| 3.27k| return oss.str(); 58| 3.27k|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJPKcEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 3.27k|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 3.27k| size_t i = 0; 27| | 28| 3.27k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 3.27k, False: 0] ------------------ 29| 3.27k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 3.27k, False: 0] | Branch (29:30): [True: 3.27k, False: 0] | Branch (29:59): [True: 3.27k, False: 0] ------------------ 30| 3.27k| oss << val; 31| 3.27k| return do_fmt(oss, format.substr(i + 2), rest...); 32| 3.27k| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 3.27k|} _ZN5Botan3fmtIJPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEENS3_12basic_stringIcS6_NS3_9allocatorIcEEEES7_DpRKT_: 53| 162|std::string fmt(std::string_view format, const T&... args) { 54| 162| std::ostringstream oss; 55| 162| oss.imbue(std::locale::classic()); 56| 162| fmt_detail::do_fmt(oss, format, args...); 57| 162| return oss.str(); 58| 162|} _ZN5Botan10fmt_detail6do_fmtIPKcJNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEvRNS4_19basic_ostringstreamIcS7_NS4_9allocatorIcEEEES8_RKT_DpRKT0_: 25| 162|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 162| size_t i = 0; 27| | 28| 1.45k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 1.45k, False: 0] ------------------ 29| 1.45k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 162, False: 1.28k] | Branch (29:30): [True: 162, False: 0] | Branch (29:59): [True: 162, False: 0] ------------------ 30| 162| oss << val; 31| 162| return do_fmt(oss, format.substr(i + 2), rest...); 32| 1.28k| } else { 33| 1.28k| oss << format[i]; 34| 1.28k| } 35| | 36| 1.28k| i += 1; 37| 1.28k| } 38| 162|} _ZN5Botan10fmt_detail6do_fmtImJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 285|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 285| size_t i = 0; 27| | 28| 6.23k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 6.23k, False: 0] ------------------ 29| 6.23k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 285, False: 5.94k] | Branch (29:30): [True: 285, False: 0] | Branch (29:59): [True: 285, False: 0] ------------------ 30| 285| oss << val; 31| 285| return do_fmt(oss, format.substr(i + 2), rest...); 32| 5.94k| } else { 33| 5.94k| oss << format[i]; 34| 5.94k| } 35| | 36| 5.94k| i += 1; 37| 5.94k| } 38| 285|} _ZN5Botan3fmtIJmmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 237|std::string fmt(std::string_view format, const T&... args) { 54| 237| std::ostringstream oss; 55| 237| oss.imbue(std::locale::classic()); 56| 237| fmt_detail::do_fmt(oss, format, args...); 57| 237| return oss.str(); 58| 237|} _ZN5Botan10fmt_detail6do_fmtImJmEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 237|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 237| size_t i = 0; 27| | 28| 3.84k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 3.84k, False: 0] ------------------ 29| 3.84k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 237, False: 3.60k] | Branch (29:30): [True: 237, False: 0] | Branch (29:59): [True: 237, False: 0] ------------------ 30| 237| oss << val; 31| 237| return do_fmt(oss, format.substr(i + 2), rest...); 32| 3.60k| } else { 33| 3.60k| oss << format[i]; 34| 3.60k| } 35| | 36| 3.60k| i += 1; 37| 3.60k| } 38| 237|} _ZN5Botan3fmtIJmEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_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|} _ZN5Botan3fmtIJjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 15|std::string fmt(std::string_view format, const T&... args) { 54| 15| std::ostringstream oss; 55| 15| oss.imbue(std::locale::classic()); 56| 15| fmt_detail::do_fmt(oss, format, args...); 57| 15| return oss.str(); 58| 15|} _ZN5Botan10fmt_detail6do_fmtIjJEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 162|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 162| size_t i = 0; 27| | 28| 821| while(i < format.size()) { ------------------ | Branch (28:10): [True: 821, False: 0] ------------------ 29| 821| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 162, False: 659] | Branch (29:30): [True: 162, False: 0] | Branch (29:59): [True: 162, False: 0] ------------------ 30| 162| oss << val; 31| 162| return do_fmt(oss, format.substr(i + 2), rest...); 32| 659| } else { 33| 659| oss << format[i]; 34| 659| } 35| | 36| 659| i += 1; 37| 659| } 38| 162|} _ZN5Botan3fmtIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEjEEENS1_12basic_stringIcS4_NS1_9allocatorIcEEEES5_DpRKT_: 53| 50|std::string fmt(std::string_view format, const T&... args) { 54| 50| std::ostringstream oss; 55| 50| oss.imbue(std::locale::classic()); 56| 50| fmt_detail::do_fmt(oss, format, args...); 57| 50| return oss.str(); 58| 50|} _ZN5Botan10fmt_detail6do_fmtINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEJjEEEvRNS2_19basic_ostringstreamIcS5_NS2_9allocatorIcEEEES6_RKT_DpRKT0_: 25| 50|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 50| size_t i = 0; 27| | 28| 50| while(i < format.size()) { ------------------ | Branch (28:10): [True: 50, False: 0] ------------------ 29| 50| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 50, False: 0] | Branch (29:30): [True: 50, False: 0] | Branch (29:59): [True: 50, False: 0] ------------------ 30| 50| oss << val; 31| 50| return do_fmt(oss, format.substr(i + 2), rest...); 32| 50| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 50|} _ZN5Botan3fmtIJjjEEENSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEDpRKT_: 53| 97|std::string fmt(std::string_view format, const T&... args) { 54| 97| std::ostringstream oss; 55| 97| oss.imbue(std::locale::classic()); 56| 97| fmt_detail::do_fmt(oss, format, args...); 57| 97| return oss.str(); 58| 97|} _ZN5Botan10fmt_detail6do_fmtIjJjEEEvRNSt3__119basic_ostringstreamIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EERKT_DpRKT0_: 25| 97|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 97| size_t i = 0; 27| | 28| 3.19k| while(i < format.size()) { ------------------ | Branch (28:10): [True: 3.19k, False: 0] ------------------ 29| 3.19k| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 97, False: 3.09k] | Branch (29:30): [True: 97, False: 0] | Branch (29:59): [True: 97, False: 0] ------------------ 30| 97| oss << val; 31| 97| return do_fmt(oss, format.substr(i + 2), rest...); 32| 3.09k| } else { 33| 3.09k| oss << format[i]; 34| 3.09k| } 35| | 36| 3.09k| i += 1; 37| 3.09k| } 38| 97|} _ZN5Botan3fmtIJPKcEEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 10|std::string fmt(std::string_view format, const T&... args) { 54| 10| std::ostringstream oss; 55| 10| oss.imbue(std::locale::classic()); 56| 10| fmt_detail::do_fmt(oss, format, args...); 57| 10| return oss.str(); 58| 10|} _ZN5Botan3fmtIJPKcmEEENSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS3_17basic_string_viewIcS6_EEDpRKT_: 53| 46|std::string fmt(std::string_view format, const T&... args) { 54| 46| std::ostringstream oss; 55| 46| oss.imbue(std::locale::classic()); 56| 46| fmt_detail::do_fmt(oss, format, args...); 57| 46| return oss.str(); 58| 46|} _ZN5Botan10fmt_detail6do_fmtIPKcJmEEEvRNSt3__119basic_ostringstreamIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS4_17basic_string_viewIcS7_EERKT_DpRKT0_: 25| 46|void do_fmt(std::ostringstream& oss, std::string_view format, const T& val, const Ts&... rest) { 26| 46| size_t i = 0; 27| | 28| 46| while(i < format.size()) { ------------------ | Branch (28:10): [True: 46, False: 0] ------------------ 29| 46| if(format[i] == '{' && (format.size() > (i + 1)) && format.at(i + 1) == '}') { ------------------ | Branch (29:10): [True: 46, False: 0] | Branch (29:30): [True: 46, False: 0] | Branch (29:59): [True: 46, False: 0] ------------------ 30| 46| oss << val; 31| 46| return do_fmt(oss, format.substr(i + 2), rest...); 32| 46| } else { 33| 0| oss << format[i]; 34| 0| } 35| | 36| 0| i += 1; 37| 0| } 38| 46|} _ZN5Botan14GCM_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 79| 32| GCM_Mode(std::move(cipher), tag_size) {} _ZNK5Botan8GCM_Mode8tag_sizeEv: 40| 111| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan14GCM_Encryption13output_lengthEm: 81| 37| size_t output_length(size_t input_length) const override { return input_length + tag_size(); } _ZNK5Botan5GHASH8key_specEv: 42| 32| Key_Length_Specification key_spec() const override { return Key_Length_Specification(16); } _ZN5Botan7swar_ltITkNSt3__117unsigned_integralEtEET_S2_S2_: 91| 48.0k|constexpr T swar_lt(T a, T b) { 92| | // The constant 0x808080... as a T 93| 48.0k| constexpr T hi1 = (static_cast(-1) / 255) << 7; 94| | // The constant 0x7F7F7F... as a T 95| 48.0k| constexpr T lo7 = static_cast(~hi1); 96| 48.0k| T r = (lo7 - a + b) & hi1; 97| | // Currently the mask is 80 if lt, otherwise 00. Convert to FF/00 98| 48.0k| return (r << 1) - (r >> 7); 99| 48.0k|} _ZN5Botan13swar_in_rangeITkNSt3__117unsigned_integralEmEET_S2_S2_S2_: 114| 27.0k|constexpr T swar_in_range(T v, T lower, T upper) { 115| | // The constant 0x808080... as a T 116| 27.0k| constexpr T hi1 = (static_cast(-1) / 255) << 7; 117| | // The constant 0x7F7F7F... as a T 118| 27.0k| constexpr T lo7 = ~hi1; 119| | 120| 27.0k| const T sub = ((v | hi1) - (lower & lo7)) ^ ((v ^ (~lower)) & hi1); 121| 27.0k| const T a_lo = sub & lo7; 122| 27.0k| const T a_hi = sub & hi1; 123| 27.0k| return (lo7 - a_lo + upper) & hi1 & ~a_hi; 124| 27.0k|} _ZN5Botan23index_of_first_set_byteITkNSt3__117unsigned_integralEmEEmT_: 130| 27.0k|constexpr size_t index_of_first_set_byte(T v) { 131| | // The constant 0x010101... as a T 132| 27.0k| constexpr T lo1 = (static_cast(-1) / 255); 133| | // The constant 0x808080... as a T 134| 27.0k| constexpr T hi1 = lo1 << 7; 135| | // How many bits to shift in order to get the top byte 136| 27.0k| constexpr size_t bits = (sizeof(T) * 8) - 8; 137| | 138| 27.0k| return static_cast((((((v & hi1) - 1) & lo1) * lo1) >> bits) - 1); 139| 27.0k|} _ZN5Botan11checked_mulITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 46| 6.72M|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| 6.72M| 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| 6.72M| if(a != 0 && r / a != b) { ------------------ | Branch (53:7): [True: 6.72M, False: 0] | Branch (53:17): [True: 0, False: 6.72M] ------------------ 54| 0| return {}; 55| 0| } 56| 6.72M| return r; 57| 6.72M|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEjEENS1_8optionalIT_EES3_S3_: 19| 930|constexpr inline std::optional checked_add(T a, T b) { 20| 930| const T r = a + b; 21| 930| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 930] | Branch (21:16): [True: 0, False: 930] ------------------ 22| 0| return {}; 23| 0| } 24| 930| return r; 25| 930|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 19| 1.83k|constexpr inline std::optional checked_add(T a, T b) { 20| 1.83k| const T r = a + b; 21| 1.83k| if(r < a || r < b) { ------------------ | Branch (21:7): [True: 0, False: 1.83k] | Branch (21:16): [True: 0, False: 1.83k] ------------------ 22| 0| return {}; 23| 0| } 24| 1.83k| return r; 25| 1.83k|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_addITkNSt3__117unsigned_integralEmTpTkNS1_17unsigned_integralEJmmmEQ10all_same_vIT_DpT0_EEENS1_8optionalIS2_EES2_S2_S4_: 37| 262|constexpr inline std::optional checked_add(T a, T b, Ts... rest) { 38| 262| if(auto r = checked_add(a, b)) { ------------------ | Branch (38:12): [True: 262, False: 0] ------------------ 39| 262| return checked_add(r.value(), rest...); 40| 262| } else { 41| 0| return {}; 42| 0| } 43| 262|} _ZN5Botan11checked_subITkNSt3__117unsigned_integralEmEENS1_8optionalIT_EES3_S3_: 28| 3|constexpr std::optional checked_sub(T a, T b) { 29| 3| if(b > a) { ------------------ | Branch (29:7): [True: 0, False: 3] ------------------ 30| 0| return {}; 31| 0| } 32| 3| return a - b; 33| 3|} _ZN5Botan8get_byteILm0EtEEhT0_QltT_stS1_: 81| 317k|{ 82| 317k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 317k| return static_cast((input >> shift) & 0xFF); 84| 317k|} _ZN5Botan8get_byteILm1EtEEhT0_QltT_stS1_: 81| 317k|{ 82| 317k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 317k| return static_cast((input >> shift) & 0xFF); 84| 317k|} _ZN5Botan11make_uint16Ehh: 92| 59.1k|inline constexpr uint16_t make_uint16(uint8_t i0, uint8_t i1) { 93| 59.1k| return static_cast((static_cast(i0) << 8) | i1); 94| 59.1k|} _ZN5Botan11make_uint32Ehhhh: 104| 17.6k|inline constexpr uint32_t make_uint32(uint8_t i0, uint8_t i1, uint8_t i2, uint8_t i3) { 105| 17.6k| return ((static_cast(i0) << 24) | (static_cast(i1) << 16) | (static_cast(i2) << 8) | 106| 17.6k| (static_cast(i3))); 107| 17.6k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRKmPhEEEDaDpOT0_: 745| 29.1k|inline constexpr auto store_be(ParamTs&&... params) { 746| 29.1k| return detail::store_any(std::forward(params)...); 747| 29.1k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 29.2k|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 29.2k| store_any(in, std::span(out, sizeof(T))); 714| 29.2k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 29.2k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 29.2k| store_any(in, std::forward(out_range)); 648| 29.2k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 37.1k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 37.1k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 37.1k| using InT = decltype(in); 528| 37.1k| ranges::assert_exact_byte_length(out_range); 529| 37.1k| 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| 37.1k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 37.1k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 37.1k| } 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| 37.1k| } else { 542| 37.1k| static_assert(opposite(endianness) == std::endian::native); 543| 37.1k| typecast_copy(out, reverse_bytes(in)); 544| 37.1k| } 545| 37.1k| } 546| 37.1k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEmEEDaT_: 190| 37.1k|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| 37.1k| } else { 195| 37.1k| return Botan::unwrap_strong_type(t); 196| 37.1k| } 197| 37.1k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEET0_PKhm: 454| 695|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| 695| constexpr size_t out_size = sizeof(OutT); 457| 695| return load_any(std::span(in + off * out_size, out_size)); 458| 695|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 192k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 192k| using OutT = detail::wrapped_type; 280| 192k| ranges::assert_exact_byte_length(in_range); 281| | 282| 192k| 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| 192k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 192k| return fallback_load_any(std::forward(in_range)); 288| 192k| } else { 289| 192k| const std::span in{in_range}; 290| 192k| if constexpr(sizeof(OutT) == 1) { 291| 192k| return static_cast(in[0]); 292| 192k| } else if constexpr(endianness == std::endian::native) { 293| 192k| return typecast_copy(in); 294| 192k| } else { 295| 192k| static_assert(opposite(endianness) == std::endian::native); 296| 192k| return reverse_bytes(typecast_copy(in)); 297| 192k| } 298| 192k| } 299| 192k| }()); 300| 192k|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEmTkNSt3__117unsigned_integralEmEEDaT0_: 200| 201k|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 201k| } else { 204| 201k| return Botan::wrap_strong_type(t); 205| 201k| } 206| 201k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 192k| 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| 192k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 192k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 192k| } else { 289| 192k| 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| 192k| } else { 295| 192k| static_assert(opposite(endianness) == std::endian::native); 296| 192k| return reverse_bytes(typecast_copy(in)); 297| 192k| } 298| 192k| } 299| 192k| }()); _ZN5Botan7load_beItJRPKhRmEEEDaDpOT0_: 504| 24|inline constexpr auto load_be(ParamTs&&... params) { 505| 24| return detail::load_any(std::forward(params)...); 506| 24|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtEET0_PKhm: 454| 168|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| 168| constexpr size_t out_size = sizeof(OutT); 457| 168| return load_any(std::span(in + off * out_size, out_size)); 458| 168|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 168|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 168| using OutT = detail::wrapped_type; 280| 168| ranges::assert_exact_byte_length(in_range); 281| | 282| 168| 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| 168| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 168| return fallback_load_any(std::forward(in_range)); 288| 168| } else { 289| 168| const std::span in{in_range}; 290| 168| if constexpr(sizeof(OutT) == 1) { 291| 168| return static_cast(in[0]); 292| 168| } else if constexpr(endianness == std::endian::native) { 293| 168| return typecast_copy(in); 294| 168| } else { 295| 168| static_assert(opposite(endianness) == std::endian::native); 296| 168| return reverse_bytes(typecast_copy(in)); 297| 168| } 298| 168| } 299| 168| }()); 300| 168|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEtTkNSt3__117unsigned_integralEtEEDaT0_: 200| 168|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 168| } else { 204| 168| return Botan::wrap_strong_type(t); 205| 168| } 206| 168|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEtTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm2EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 168| 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| 168| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 168] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 168| } else { 289| 168| 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| 168| } else { 295| 168| static_assert(opposite(endianness) == std::endian::native); 296| 168| return reverse_bytes(typecast_copy(in)); 297| 168| } 298| 168| } 299| 168| }()); _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEET0_PKhm: 454| 119|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| 119| constexpr size_t out_size = sizeof(OutT); 457| 119| return load_any(std::span(in + off * out_size, out_size)); 458| 119|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 119|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 119| using OutT = detail::wrapped_type; 280| 119| ranges::assert_exact_byte_length(in_range); 281| | 282| 119| 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| 119| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 119| return fallback_load_any(std::forward(in_range)); 288| 119| } else { 289| 119| const std::span in{in_range}; 290| 119| if constexpr(sizeof(OutT) == 1) { 291| 119| return static_cast(in[0]); 292| 119| } else if constexpr(endianness == std::endian::native) { 293| 119| return typecast_copy(in); 294| 119| } else { 295| 119| static_assert(opposite(endianness) == std::endian::native); 296| 119| return reverse_bytes(typecast_copy(in)); 297| 119| } 298| 119| } 299| 119| }()); 300| 119|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEjTkNSt3__117unsigned_integralEjEEDaT0_: 200| 119|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 119| } else { 204| 119| return Botan::wrap_strong_type(t); 205| 119| } 206| 119|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm4EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 119| 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| 119| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 119] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 119| } else { 289| 119| 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| 119| } else { 295| 119| static_assert(opposite(endianness) == std::endian::native); 296| 119| return reverse_bytes(typecast_copy(in)); 297| 119| } 298| 119| } 299| 119| }()); _ZN5Botan8get_byteILm1EjEEhT0_QltT_stS1_: 81| 18.0k|{ 82| 18.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 18.0k| return static_cast((input >> shift) & 0xFF); 84| 18.0k|} _ZN5Botan8get_byteILm2EjEEhT0_QltT_stS1_: 81| 18.0k|{ 82| 18.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 18.0k| return static_cast((input >> shift) & 0xFF); 84| 18.0k|} _ZN5Botan8get_byteILm3EjEEhT0_QltT_stS1_: 81| 18.0k|{ 82| 18.0k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 18.0k| return static_cast((input >> shift) & 0xFF); 84| 18.0k|} _ZN5Botan12get_byte_varImEEhmT_: 69| 56.9k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 56.9k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 56.9k|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRjRA4_hEEEDaDpOT0_: 745| 44|inline constexpr auto store_be(ParamTs&&... params) { 746| 44| return detail::store_any(std::forward(params)...); 747| 44|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjQoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_EEEvS6_Ph: 711| 8.84k|inline constexpr void store_any(T in, uint8_t out[]) { 712| | // asserts that *out points to enough bytes to write into 713| 8.84k| store_any(in, std::span(out, sizeof(T))); 714| 8.84k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQsr3stdE7same_asIS4_T0_EEEvT1_OT2_: 646| 8.84k|inline constexpr void store_any(T in, OutR&& out_range) { 647| 8.84k| store_any(in, std::forward(out_range)); 648| 8.84k|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEEQnt15custom_storableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEEvS9_OT1_: 525| 102k|inline constexpr void store_any(WrappedInT wrapped_in, OutR&& out_range) { 526| 102k| const auto in = detail::unwrap_strong_type_or_enum(wrapped_in); 527| 102k| using InT = decltype(in); 528| 102k| ranges::assert_exact_byte_length(out_range); 529| 102k| 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| 102k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (534:7): [Folded, False: 102k] ------------------ 535| 0| return fallback_store_any(in, std::forward(out_range)); 536| 102k| } 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| 102k| } else { 542| 102k| static_assert(opposite(endianness) == std::endian::native); 543| 102k| typecast_copy(out, reverse_bytes(in)); 544| 102k| } 545| 102k| } 546| 102k|} _ZN5Botan6detail26unwrap_strong_type_or_enumITkNS0_20unsigned_integralishEjEEDaT_: 190| 102k|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| 102k| } else { 195| 102k| return Botan::unwrap_strong_type(t); 196| 102k| } 197| 102k|} _ZN5Botan7load_beImJPKhiEEEDaDpOT0_: 504| 251|inline constexpr auto load_be(ParamTs&&... params) { 505| 251| return detail::load_any(std::forward(params)...); 506| 251|} _ZN5Botan7load_beImJRA32_mRPKhRmEEEDaDpOT0_: 504| 13|inline constexpr auto load_be(ParamTs&&... params) { 505| 13| return detail::load_any(std::forward(params)...); 506| 13|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS0_20unsigned_integralishEmQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 13|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| 13| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 13|} _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| 13|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 13| ranges::assert_equal_byte_lengths(out, in); 357| 13| using element_type = std::ranges::range_value_t; 358| | 359| 13| auto load_elementwise = [&] { 360| 13| constexpr size_t bytes_per_element = sizeof(element_type); 361| 13| std::span in_s(in); 362| 13| for(auto& out_elem : out) { 363| 13| out_elem = load_any(in_s.template first()); 364| 13| in_s = in_s.subspan(bytes_per_element); 365| 13| } 366| 13| }; 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| 13| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 13] ------------------ 372| 0| load_elementwise(); 373| 13| } else { 374| | if constexpr(endianness == std::endian::native && !custom_loadable) { 375| | typecast_copy(out, in); 376| 13| } else { 377| 13| load_elementwise(); 378| 13| } 379| 13| } 380| 13|} _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| 13| auto load_elementwise = [&] { 360| 13| constexpr size_t bytes_per_element = sizeof(element_type); 361| 13| std::span in_s(in); 362| 13| for(auto& out_elem : out) { ------------------ | Branch (362:26): [True: 13, False: 13] ------------------ 363| 13| out_elem = load_any(in_s.template first()); 364| 13| in_s = in_s.subspan(bytes_per_element); 365| 13| } 366| 13| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJPhRmEEEDaDpOT0_: 745| 13|inline constexpr auto store_be(ParamTs&&... params) { 746| 13| return detail::store_any(std::forward(params)...); 747| 13|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS0_20unsigned_integralishEmTpTkNS0_20unsigned_integralishEJEQaaoosr3stdE7same_asIS4_T0_Esr3stdE7same_asIT1_S5_E10all_same_vIS6_DpT2_EEEvPhS6_S8_: 723| 13|inline constexpr void store_any(uint8_t out[], T0 in0, Ts... ins) { 724| 13| constexpr auto bytes = sizeof(in0) + (sizeof(ins) + ... + 0); 725| | // asserts that *out points to the correct amount of memory 726| 13| store_any(std::span(out, bytes), in0, ins...); 727| 13|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm8EEETpTkNS0_20unsigned_integralishEJmEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 7.84k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 7.84k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 7.84k| auto store_one = [off = 0](auto o, T i) mutable { 585| 7.84k| store_any(i, o.subspan(off).template first()); 586| 7.84k| off += sizeof(T); 587| 7.84k| }; 588| | 589| 7.84k| (store_one(std::span{out}, ins), ...); 590| 7.84k|} _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| 7.84k| auto store_one = [off = 0](auto o, T i) mutable { 585| 7.84k| store_any(i, o.subspan(off).template first()); 586| 7.84k| off += sizeof(T); 587| 7.84k| }; _ZN5Botan7load_beIjJPKhiEEEDaDpOT0_: 504| 18|inline constexpr auto load_be(ParamTs&&... params) { 505| 18| return detail::load_any(std::forward(params)...); 506| 18|} _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorIjNS_16secure_allocatorIjEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 12.4k|inline void copy_out_be(std::span out, const InR& in) { 774| 12.4k| using T = std::ranges::range_value_t; 775| 12.4k| std::span in_s{in}; 776| 12.4k| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 12.4k| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 12.4k] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 12.4k|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEjEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 12.4k|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 12.4k| const size_t full_words = out.size() / sizeof(T); 754| 12.4k| const size_t full_word_bytes = full_words * sizeof(T); 755| 12.4k| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 12.4k| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 77| 12.4k| do { \ | | 78| 12.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 12.4k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 12.4k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.4k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.4k] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 12.4k| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 12.4k| out = out.subspan(full_word_bytes); 761| 12.4k| in = in.subspan(full_words); 762| | 763| 12.4k| return remaining_bytes; 764| 12.4k|} _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| 12.4k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 12.4k| ranges::assert_equal_byte_lengths(out, in); 605| 12.4k| using element_type = std::ranges::range_value_t; 606| | 607| 12.4k| auto store_elementwise = [&] { 608| 12.4k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 12.4k| std::span out_s(out); 610| 12.4k| for(auto in_elem : in) { 611| 12.4k| store_any(out_s.template first(), in_elem); 612| 12.4k| out_s = out_s.subspan(bytes_per_element); 613| 12.4k| } 614| 12.4k| }; 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| 12.4k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 12.4k] ------------------ 620| 0| store_elementwise(); 621| 12.4k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 12.4k| } else { 625| 12.4k| store_elementwise(); 626| 12.4k| } 627| 12.4k| } 628| 12.4k|} _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| 12.4k| auto store_elementwise = [&] { 608| 12.4k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 12.4k| std::span out_s(out); 610| 93.8k| for(auto in_elem : in) { ------------------ | Branch (610:24): [True: 93.8k, False: 12.4k] ------------------ 611| 93.8k| store_any(out_s.template first(), in_elem); 612| 93.8k| out_s = out_s.subspan(bytes_per_element); 613| 93.8k| } 614| 12.4k| }; _ZN5Botan6detail9store_anyILNSt3__16endianE64206EjTkNS_6ranges23contiguous_output_rangeIhEENS2_4spanIhLm4EEETpTkNS0_20unsigned_integralishEJjEQaagtsZT2_Li0Eooaasr3stdE7same_asINS0_10AutoDetectET0_E10all_same_vIDpT2_Eaa20unsigned_integralishIS9_E10all_same_vIS9_SB_EEEvOT1_SB_: 582| 93.8k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, Ts... ins) { 583| 93.8k| ranges::assert_exact_byte_length<(sizeof(Ts) + ...)>(out); 584| 93.8k| auto store_one = [off = 0](auto o, T i) mutable { 585| 93.8k| store_any(i, o.subspan(off).template first()); 586| 93.8k| off += sizeof(T); 587| 93.8k| }; 588| | 589| 93.8k| (store_one(std::span{out}, ins), ...); 590| 93.8k|} _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| 93.8k| auto store_one = [off = 0](auto o, T i) mutable { 585| 93.8k| store_any(i, o.subspan(off).template first()); 586| 93.8k| off += sizeof(T); 587| 93.8k| }; _ZN5Botan11copy_out_beITkNS_6ranges14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEEEvNS2_4spanIhLm18446744073709551615EEERKT_: 773| 1.19k|inline void copy_out_be(std::span out, const InR& in) { 774| 1.19k| using T = std::ranges::range_value_t; 775| 1.19k| std::span in_s{in}; 776| 1.19k| const auto remaining_bytes = detail::copy_out_any_word_aligned_portion(out, in_s); 777| | 778| | // copy remaining bytes as a partial word 779| 1.19k| for(size_t i = 0; i < remaining_bytes; ++i) { ------------------ | Branch (779:22): [True: 0, False: 1.19k] ------------------ 780| 0| out[i] = get_byte_var(i, in_s.front()); 781| 0| } 782| 1.19k|} _ZN5Botan6detail33copy_out_any_word_aligned_portionILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmEEmRNS2_4spanIhLm18446744073709551615EEERNS4_IKT0_Lm18446744073709551615EEE: 752| 1.19k|inline size_t copy_out_any_word_aligned_portion(std::span& out, std::span& in) { 753| 1.19k| const size_t full_words = out.size() / sizeof(T); 754| 1.19k| const size_t full_word_bytes = full_words * sizeof(T); 755| 1.19k| const size_t remaining_bytes = out.size() - full_word_bytes; 756| 1.19k| BOTAN_ASSERT_NOMSG(in.size_bytes() >= full_word_bytes + remaining_bytes); ------------------ | | 77| 1.19k| do { \ | | 78| 1.19k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.19k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.19k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.19k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.19k] | | ------------------ ------------------ 757| | 758| | // copy full words 759| 1.19k| store_any(out.first(full_word_bytes), in.first(full_words)); 760| 1.19k| out = out.subspan(full_word_bytes); 761| 1.19k| in = in.subspan(full_words); 762| | 763| 1.19k| return remaining_bytes; 764| 1.19k|} _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| 1.19k|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 1.19k| ranges::assert_equal_byte_lengths(out, in); 605| 1.19k| using element_type = std::ranges::range_value_t; 606| | 607| 1.19k| auto store_elementwise = [&] { 608| 1.19k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.19k| std::span out_s(out); 610| 1.19k| for(auto in_elem : in) { 611| 1.19k| store_any(out_s.template first(), in_elem); 612| 1.19k| out_s = out_s.subspan(bytes_per_element); 613| 1.19k| } 614| 1.19k| }; 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.19k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 1.19k] ------------------ 620| 0| store_elementwise(); 621| 1.19k| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 1.19k| } else { 625| 1.19k| store_elementwise(); 626| 1.19k| } 627| 1.19k| } 628| 1.19k|} _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| 1.19k| auto store_elementwise = [&] { 608| 1.19k| constexpr size_t bytes_per_element = sizeof(element_type); 609| 1.19k| std::span out_s(out); 610| 7.76k| for(auto in_elem : in) { ------------------ | Branch (610:24): [True: 7.76k, False: 1.19k] ------------------ 611| 7.76k| store_any(out_s.template first(), in_elem); 612| 7.76k| out_s = out_s.subspan(bytes_per_element); 613| 7.76k| } 614| 1.19k| }; _ZN5Botan7load_beImJNSt3__14spanIKhLm8EEEEEEDaDpOT0_: 504| 192k|inline constexpr auto load_be(ParamTs&&... params) { 505| 192k| return detail::load_any(std::forward(params)...); 506| 192k|} _ZN5Botan7load_beImJRNSt3__15arrayIhLm8EEEEEEDaDpOT0_: 504| 8.28k|inline constexpr auto load_be(ParamTs&&... params) { 505| 8.28k| return detail::load_any(std::forward(params)...); 506| 8.28k|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 8.28k|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 8.28k| using OutT = detail::wrapped_type; 280| 8.28k| ranges::assert_exact_byte_length(in_range); 281| | 282| 8.28k| 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| 8.28k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 8.28k| return fallback_load_any(std::forward(in_range)); 288| 8.28k| } else { 289| 8.28k| const std::span in{in_range}; 290| 8.28k| if constexpr(sizeof(OutT) == 1) { 291| 8.28k| return static_cast(in[0]); 292| 8.28k| } else if constexpr(endianness == std::endian::native) { 293| 8.28k| return typecast_copy(in); 294| 8.28k| } else { 295| 8.28k| static_assert(opposite(endianness) == std::endian::native); 296| 8.28k| return reverse_bytes(typecast_copy(in)); 297| 8.28k| } 298| 8.28k| } 299| 8.28k| }()); 300| 8.28k|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEmTkNS_6ranges16contiguous_rangeIhEERNS2_5arrayIhLm8EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 8.28k| 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| 8.28k| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 8.28k] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 8.28k| } else { 289| 8.28k| 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| 8.28k| } else { 295| 8.28k| static_assert(opposite(endianness) == std::endian::native); 296| 8.28k| return reverse_bytes(typecast_copy(in)); 297| 8.28k| } 298| 8.28k| } 299| 8.28k| }()); _ZN5Botan8store_beINS_6detail10AutoDetectEJRmPhEEEDaDpOT0_: 745| 120|inline constexpr auto store_be(ParamTs&&... params) { 746| 120| return detail::store_any(std::forward(params)...); 747| 120|} _ZN5Botan7load_leIjJPjPKhmEEEDaDpOT0_: 495| 2|inline constexpr auto load_le(ParamTs&&... params) { 496| 2| return detail::load_any(std::forward(params)...); 497| 2|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS0_20unsigned_integralishEjQoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asIT1_S5_EEEvPS6_PKhm: 483| 2|inline constexpr void load_any(T out[], const uint8_t in[], size_t count) { 484| | // asserts that *in and *out point to the correct amount of memory 485| 2| load_any(std::span(out, count), std::span(in, count * sizeof(T))); 486| 2|} _ZN5Botan6detail8load_anyILNSt3__16endianE57005EjTkNS_6ranges23contiguous_output_rangeENS2_4spanIjLm18446744073709551615EEETkNS4_16contiguous_rangeIhEENS5_IKhLm18446744073709551615EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISH_EESI_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISP_SN_EEEvOSE_RKT2_: 355| 2|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 2| ranges::assert_equal_byte_lengths(out, in); 357| 2| using element_type = std::ranges::range_value_t; 358| | 359| 2| auto load_elementwise = [&] { 360| 2| constexpr size_t bytes_per_element = sizeof(element_type); 361| 2| std::span in_s(in); 362| 2| for(auto& out_elem : out) { 363| 2| out_elem = load_any(in_s.template first()); 364| 2| in_s = in_s.subspan(bytes_per_element); 365| 2| } 366| 2| }; 367| | 368| | // At compile time we cannot use `typecast_copy` as it uses `std::memcpy` 369| | // internally to copy ranges on a byte-by-byte basis, which is not allowed 370| | // in a `constexpr` context. 371| 2| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 2] ------------------ 372| 0| load_elementwise(); 373| 2| } else { 374| 2| if constexpr(endianness == std::endian::native && !custom_loadable) { 375| 2| typecast_copy(out, in); 376| | } else { 377| | load_elementwise(); 378| | } 379| 2| } 380| 2|} _ZN5Botan7load_beIjJPhiEEEDaDpOT0_: 504| 101|inline constexpr auto load_be(ParamTs&&... params) { 505| 101| return detail::load_any(std::forward(params)...); 506| 101|} _ZN5Botan8store_beINS_6detail10AutoDetectEJRKjPhEEEDaDpOT0_: 745| 8.80k|inline constexpr auto store_be(ParamTs&&... params) { 746| 8.80k| return detail::store_any(std::forward(params)...); 747| 8.80k|} _ZN5Botan7load_beIhJPKhRmEEEDaDpOT0_: 504| 1.28M|inline constexpr auto load_be(ParamTs&&... params) { 505| 1.28M| return detail::load_any(std::forward(params)...); 506| 1.28M|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhEET0_PKhm: 454| 1.28M|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| 1.28M| constexpr size_t out_size = sizeof(OutT); 457| 1.28M| return load_any(std::span(in + off * out_size, out_size)); 458| 1.28M|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm1EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_: 278| 1.28M|inline constexpr WrappedOutT load_any(InR&& in_range) { 279| 1.28M| using OutT = detail::wrapped_type; 280| 1.28M| ranges::assert_exact_byte_length(in_range); 281| | 282| 1.28M| 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| 1.28M| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { 287| 1.28M| return fallback_load_any(std::forward(in_range)); 288| 1.28M| } else { 289| 1.28M| const std::span in{in_range}; 290| 1.28M| if constexpr(sizeof(OutT) == 1) { 291| 1.28M| return static_cast(in[0]); 292| 1.28M| } else if constexpr(endianness == std::endian::native) { 293| 1.28M| return typecast_copy(in); 294| 1.28M| } else { 295| 1.28M| static_assert(opposite(endianness) == std::endian::native); 296| 1.28M| return reverse_bytes(typecast_copy(in)); 297| 1.28M| } 298| 1.28M| } 299| 1.28M| }()); 300| 1.28M|} _ZN5Botan6detail24wrap_strong_type_or_enumITkNS0_20unsigned_integralishEhTkNSt3__117unsigned_integralEhEEDaT0_: 200| 1.28M|constexpr auto wrap_strong_type_or_enum(T t) { 201| | if constexpr(std::is_enum_v) { 202| | return static_cast(t); 203| 1.28M| } else { 204| 1.28M| return Botan::wrap_strong_type(t); 205| 1.28M| } 206| 1.28M|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ETkNS0_20unsigned_integralishEhTkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm1EEEQnt15custom_loadableINS0_19wrapped_type_helperIu14__remove_cvrefIT0_EE4typeEEEESA_OT1_ENKUlvE_clEv: 282| 1.28M| 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| 1.28M| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (286:10): [Folded, False: 1.28M] ------------------ 287| 0| return fallback_load_any(std::forward(in_range)); 288| 1.28M| } else { 289| 1.28M| const std::span in{in_range}; 290| 1.28M| if constexpr(sizeof(OutT) == 1) { 291| 1.28M| 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| 1.28M| } 299| 1.28M| }()); _ZN5Botan12get_byte_varIhEEhmT_: 69| 19.1k|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 19.1k| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 19.1k|} _ZN5Botan8get_byteILm0ENS_3TLS16Signature_Scheme4CodeEEEhT0_QltT_stS4_: 81| 65.5k|{ 82| 65.5k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 65.5k| return static_cast((input >> shift) & 0xFF); 84| 65.5k|} _ZN5Botan8get_byteILm1ENS_3TLS16Signature_Scheme4CodeEEEhT0_QltT_stS4_: 81| 65.5k|{ 82| 65.5k| const size_t shift = ((~B) & (sizeof(T) - 1)) << 3; 83| 65.5k| return static_cast((input >> shift) & 0xFF); 84| 65.5k|} _ZN5Botan7load_beItJPKhRmEEEDaDpOT0_: 504| 144|inline constexpr auto load_be(ParamTs&&... params) { 505| 144| return detail::load_any(std::forward(params)...); 506| 144|} _ZN5Botan7load_beINSt3__15arrayImLm2EEEJNS1_4spanIKhLm16EEEEEEDaDpOT0_: 504| 32|inline constexpr auto load_be(ParamTs&&... params) { 505| 32| return detail::load_any(std::forward(params)...); 506| 32|} _ZN5Botan6detail8load_anyILNSt3__16endianE64206ENS2_5arrayImLm2EEETkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm16EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Eaaoosr6rangesE25statically_spanable_rangeISC_Esr8conceptsE19resizable_containerISC_E20unsigned_integralishINSC_10value_typeEEEEDaOT1_: 397| 32|inline constexpr auto load_any(InR&& in_range) { 398| 32| auto out = []([[maybe_unused]] const auto& in) { 399| 32| if constexpr(std::same_as) { 400| 32| if constexpr(ranges::statically_spanable_range) { 401| 32| constexpr size_t extent = decltype(std::span{in})::extent; 402| | 403| | // clang-format off 404| 32| using type = 405| 32| std::conditional_t>>>; 409| | // clang-format on 410| | 411| 32| static_assert( 412| 32| !std::is_void_v, 413| 32| "Cannot determine the output type based on a statically sized bytearray with length other than those: 1, 2, 4, 8"); 414| | 415| 32| return type{}; 416| 32| } else { 417| 32| static_assert( 418| 32| !std::same_as, 419| 32| "cannot infer return type from a dynamic range at compile time, please specify it explicitly"); 420| 32| } 421| 32| } else if constexpr(concepts::resizable_container) { 422| 32| const size_t in_bytes = std::span{in}.size_bytes(); 423| 32| constexpr size_t out_elem_bytes = sizeof(typename OutT::value_type); 424| 32| BOTAN_ARG_CHECK(in_bytes % out_elem_bytes == 0, 425| 32| "Input range is not word-aligned with the requested output range"); 426| 32| return OutT(in_bytes / out_elem_bytes); 427| 32| } else { 428| 32| return OutT{}; 429| 32| } 430| 32| }(in_range); 431| | 432| 32| using out_type = decltype(out); 433| | if constexpr(unsigned_integralish) { 434| | out = load_any(std::forward(in_range)); 435| 32| } else { 436| 32| static_assert(ranges::contiguous_range); 437| 32| using out_range_type = std::ranges::range_value_t; 438| 32| load_any(out, std::forward(in_range)); 439| 32| } 440| 32| return out; 441| 32|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206ENS2_5arrayImLm2EEETkNS_6ranges16contiguous_rangeIhEENS2_4spanIKhLm16EEEQoosr3stdE7same_asINS0_10AutoDetectET0_Eaaoosr6rangesE25statically_spanable_rangeISC_Esr8conceptsE19resizable_containerISC_E20unsigned_integralishINSC_10value_typeEEEEDaOT1_ENKUlRKT_E_clISA_EEDaSI_: 398| 32| auto out = []([[maybe_unused]] const auto& in) { 399| | if constexpr(std::same_as) { 400| | if constexpr(ranges::statically_spanable_range) { 401| | constexpr size_t extent = decltype(std::span{in})::extent; 402| | 403| | // clang-format off 404| | using type = 405| | std::conditional_t>>>; 409| | // clang-format on 410| | 411| | static_assert( 412| | !std::is_void_v, 413| | "Cannot determine the output type based on a statically sized bytearray with length other than those: 1, 2, 4, 8"); 414| | 415| | 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| 32| } else { 428| 32| return OutT{}; 429| 32| } 430| 32| }(in_range); _ZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeERNS2_5arrayImLm2EEETkNS4_16contiguous_rangeIhEENS2_4spanIKhLm16EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISR_SP_EEEvOSG_RKT2_: 355| 32|inline constexpr void load_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 356| 32| ranges::assert_equal_byte_lengths(out, in); 357| 32| using element_type = std::ranges::range_value_t; 358| | 359| 32| auto load_elementwise = [&] { 360| 32| constexpr size_t bytes_per_element = sizeof(element_type); 361| 32| std::span in_s(in); 362| 32| for(auto& out_elem : out) { 363| 32| out_elem = load_any(in_s.template first()); 364| 32| in_s = in_s.subspan(bytes_per_element); 365| 32| } 366| 32| }; 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| 32| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (371:7): [Folded, False: 32] ------------------ 372| 0| load_elementwise(); 373| 32| } else { 374| | if constexpr(endianness == std::endian::native && !custom_loadable) { 375| | typecast_copy(out, in); 376| 32| } else { 377| 32| load_elementwise(); 378| 32| } 379| 32| } 380| 32|} _ZZN5Botan6detail8load_anyILNSt3__16endianE64206EmTkNS_6ranges23contiguous_output_rangeERNS2_5arrayImLm2EEETkNS4_16contiguous_rangeIhEENS2_4spanIKhLm16EEEQaa20unsigned_integralishINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT1_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISJ_EESK_E4type10value_typeEEoosr3stdE7same_asINS0_10AutoDetectET0_Esr3stdE7same_asISR_SP_EEEvOSG_RKT2_ENKUlvE_clEv: 359| 32| auto load_elementwise = [&] { 360| 32| constexpr size_t bytes_per_element = sizeof(element_type); 361| 32| std::span in_s(in); 362| 64| for(auto& out_elem : out) { ------------------ | Branch (362:26): [True: 64, False: 32] ------------------ 363| 64| out_elem = load_any(in_s.template first()); 364| 64| in_s = in_s.subspan(bytes_per_element); 365| 64| } 366| 32| }; _ZN5Botan8store_beINS_6detail10AutoDetectEJmmEEEDaDpOT0_: 745| 37|inline constexpr auto store_be(ParamTs&&... params) { 746| 37| return detail::store_any(std::forward(params)...); 747| 37|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETpTkNS0_20unsigned_integralishEJmmEQ10all_same_vIDpT1_EEEDaS6_: 696| 37|inline constexpr auto store_any(Ts... ins) { 697| 37| return store_any(std::array{ins...}); 698| 37|} _ZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm2EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_: 663| 37|inline constexpr auto store_any(InR&& in_range) { 664| 37| auto out = []([[maybe_unused]] const auto& in) { 665| 37| if constexpr(std::same_as) { 666| 37| if constexpr(ranges::statically_spanable_range) { 667| 37| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 37| return std::array(); 669| 37| } else { 670| 37| static_assert( 671| 37| !std::same_as, 672| 37| "cannot infer a suitable result container type from the given parameters at compile time, please specify it explicitly"); 673| 37| } 674| 37| } else if constexpr(concepts::resizable_byte_buffer) { 675| 37| return OutR(std::span{in}.size_bytes()); 676| 37| } else { 677| 37| return OutR{}; 678| 37| } 679| 37| }(in_range); 680| | 681| 37| store_any>(out, std::forward(in_range)); 682| 37| return out; 683| 37|} _ZZN5Botan6detail9store_anyILNSt3__16endianE64206ENS0_10AutoDetectETkNS_6ranges14spanable_rangeENS2_5arrayImLm2EEEQoooosr3stdE7same_asIS4_T0_Eaasr6rangesE25statically_spanable_rangeIS8_Esr3stdE21default_initializableIS8_Esr8conceptsE21resizable_byte_bufferIS8_EEEDaOT1_ENKUlRKT_E_clIS7_EEDaSD_: 664| 37| auto out = []([[maybe_unused]] const auto& in) { 665| 37| if constexpr(std::same_as) { 666| 37| if constexpr(ranges::statically_spanable_range) { 667| 37| constexpr size_t bytes = decltype(std::span{in})::extent * sizeof(std::ranges::range_value_t); 668| 37| 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| 37| }(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| 37|inline constexpr void store_any(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 604| 37| ranges::assert_equal_byte_lengths(out, in); 605| 37| using element_type = std::ranges::range_value_t; 606| | 607| 37| auto store_elementwise = [&] { 608| 37| constexpr size_t bytes_per_element = sizeof(element_type); 609| 37| std::span out_s(out); 610| 37| for(auto in_elem : in) { 611| 37| store_any(out_s.template first(), in_elem); 612| 37| out_s = out_s.subspan(bytes_per_element); 613| 37| } 614| 37| }; 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| 37| if(std::is_constant_evaluated()) /* TODO: C++23: if consteval {} */ { ------------------ | Branch (619:7): [Folded, False: 37] ------------------ 620| 0| store_elementwise(); 621| 37| } else { 622| | if constexpr(endianness == std::endian::native && !custom_storable) { 623| | typecast_copy(out, in); 624| 37| } else { 625| 37| store_elementwise(); 626| 37| } 627| 37| } 628| 37|} _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| 37| auto store_elementwise = [&] { 608| 37| constexpr size_t bytes_per_element = sizeof(element_type); 609| 37| std::span out_s(out); 610| 74| for(auto in_elem : in) { ------------------ | Branch (610:24): [True: 74, False: 37] ------------------ 611| 74| store_any(out_s.template first(), in_elem); 612| 74| out_s = out_s.subspan(bytes_per_element); 613| 74| } 614| 37| }; _ZN5Botan7load_beImJPKhmEEEDaDpOT0_: 504| 444|inline constexpr auto load_be(ParamTs&&... params) { 505| 444| return detail::load_any(std::forward(params)...); 506| 444|} _ZN5Botan12get_byte_varItEEhmT_: 69| 1.29M|inline constexpr uint8_t get_byte_var(size_t byte_num, T input) { 70| 1.29M| return static_cast(input >> (((~byte_num) & (sizeof(T) - 1)) << 3)); 71| 1.29M|} _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EEC2Ev: 42| 940| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5clearEv: 70| 2.84k| void clear() { 71| 2.84k| MD::init(m_digest); 72| 2.84k| m_buffer.clear(); 73| 2.84k| m_count = 0; 74| 2.84k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EEC2Ev: 42| 8.29k| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5clearEv: 70| 18.8k| void clear() { 71| 18.8k| MD::init(m_digest); 72| 18.8k| m_buffer.clear(); 73| 18.8k| m_count = 0; 74| 18.8k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EEC2Ev: 42| 181| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5clearEv: 70| 1.20k| void clear() { 71| 1.20k| MD::init(m_digest); 72| 1.20k| m_buffer.clear(); 73| 1.20k| m_count = 0; 74| 1.20k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EEC2Ev: 42| 293| MerkleDamgard_Hash() { clear(); } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE5clearEv: 70| 592| void clear() { 71| 592| MD::init(m_digest); 72| 592| m_buffer.clear(); 73| 592| m_count = 0; 74| 592| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 1.96k| void update(std::span input) { 45| 1.96k| BufferSlicer in(input); 46| | 47| 5.75k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 3.79k, False: 1.96k] ------------------ 48| 3.79k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 1, False: 3.79k] ------------------ 49| 1| MD::compress_n(m_digest, one_block.value(), 1); 50| 1| } 51| | 52| 3.79k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 1.88k, False: 1.90k] ------------------ 53| 1.88k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 1.88k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 1.88k, False: 0] ------------------ 55| 1.88k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 1.88k| } 57| 1.88k| } 58| 3.79k| } 59| | 60| 1.96k| m_count += input.size(); 61| 1.96k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 1.88k| void final(std::span output) { 64| 1.88k| append_padding_bit(); 65| 1.88k| append_counter_and_finalize(); 66| 1.88k| copy_output(output); 67| 1.88k| clear(); 68| 1.88k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE18append_padding_bitEv: 77| 1.88k| void append_padding_bit() { 78| 1.88k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 77| 1.88k| do { \ | | 78| 1.88k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.88k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.88k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.88k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.88k] | | ------------------ ------------------ 79| 1.88k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 1.88k| const uint8_t final_byte = 0x80; 81| 1.88k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 1.88k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE27append_counter_and_finalizeEv: 88| 1.88k| 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| 1.88k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 21, False: 1.86k] ------------------ 92| 21| m_buffer.fill_up_with_zeros(); 93| 21| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 21| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 1.88k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 77| 1.88k| do { \ | | 78| 1.88k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.88k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.88k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.88k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.88k] | | ------------------ ------------------ 98| 1.88k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 1.88k| const uint64_t bit_count = m_count * 8; 102| 1.88k| auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 1.88k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 1.88k| 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| 1.88k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 1.88k| } _ZN5Botan18MerkleDamgard_HashINS_5SHA_1EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 1.88k| void copy_output(std::span output) { 114| 1.88k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 77| 1.88k| do { \ | | 78| 1.88k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.88k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.88k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.88k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.88k] | | ------------------ ------------------ 115| | 116| 1.88k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 1.88k| 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| 1.88k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 11.2k| void update(std::span input) { 45| 11.2k| BufferSlicer in(input); 46| | 47| 23.8k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 12.5k, False: 11.2k] ------------------ 48| 12.5k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 101, False: 12.4k] ------------------ 49| 101| MD::compress_n(m_digest, one_block.value(), 1); 50| 101| } 51| | 52| 12.5k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 1.75k, False: 10.7k] ------------------ 53| 1.75k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 1.75k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 1.65k, False: 100] ------------------ 55| 1.65k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 1.65k| } 57| 1.75k| } 58| 12.5k| } 59| | 60| 11.2k| m_count += input.size(); 61| 11.2k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 10.5k| void final(std::span output) { 64| 10.5k| append_padding_bit(); 65| 10.5k| append_counter_and_finalize(); 66| 10.5k| copy_output(output); 67| 10.5k| clear(); 68| 10.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE18append_padding_bitEv: 77| 10.5k| void append_padding_bit() { 78| 10.5k| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 77| 10.5k| do { \ | | 78| 10.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 10.5k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 10.5k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 10.5k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 10.5k] | | ------------------ ------------------ 79| 10.5k| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 10.5k| const uint8_t final_byte = 0x80; 81| 10.5k| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 10.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE27append_counter_and_finalizeEv: 88| 10.5k| void append_counter_and_finalize() { 89| | // Compress the remaining data if the final data block does not provide 90| | // enough space for the counter bytes. 91| 10.5k| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 12, False: 10.5k] ------------------ 92| 12| m_buffer.fill_up_with_zeros(); 93| 12| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 12| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 10.5k| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 77| 10.5k| do { \ | | 78| 10.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 10.5k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 10.5k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 10.5k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 10.5k] | | ------------------ ------------------ 98| 10.5k| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 10.5k| const uint64_t bit_count = m_count * 8; 102| 10.5k| auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 10.5k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 10.5k| store_be(bit_count, last_bytes.data()); 105| | } else { 106| | store_le(bit_count, last_bytes.data()); 107| | } 108| | 109| | // Compress the very last block. 110| 10.5k| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 10.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_256EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 10.5k| void copy_output(std::span output) { 114| 10.5k| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 77| 10.5k| do { \ | | 78| 10.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 10.5k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 10.5k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 10.5k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 10.5k] | | ------------------ ------------------ 115| | 116| 10.5k| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 10.5k| copy_out_be(output.first(MD::output_bytes), m_digest); 118| | } else { 119| | copy_out_le(output.first(MD::output_bytes), m_digest); 120| | } 121| 10.5k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 2.18k| void update(std::span input) { 45| 2.18k| BufferSlicer in(input); 46| | 47| 4.48k| while(!in.empty()) { ------------------ | Branch (47:16): [True: 2.29k, False: 2.18k] ------------------ 48| 2.29k| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 1, False: 2.29k] ------------------ 49| 1| MD::compress_n(m_digest, one_block.value(), 1); 50| 1| } 51| | 52| 2.29k| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 1.01k, False: 1.27k] ------------------ 53| 1.01k| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 1.01k| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 1.01k, False: 0] ------------------ 55| 1.01k| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 1.01k| } 57| 1.01k| } 58| 2.29k| } 59| | 60| 2.18k| m_count += input.size(); 61| 2.18k| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE6updateENSt3__14spanIKhLm18446744073709551615EEE: 44| 305| void update(std::span input) { 45| 305| BufferSlicer in(input); 46| | 47| 903| while(!in.empty()) { ------------------ | Branch (47:16): [True: 598, False: 305] ------------------ 48| 598| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (48:27): [True: 0, False: 598] ------------------ 49| 0| MD::compress_n(m_digest, one_block.value(), 1); 50| 0| } 51| | 52| 598| if(m_buffer.in_alignment()) { ------------------ | Branch (52:16): [True: 293, False: 305] ------------------ 53| 293| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 54| 293| if(full_blocks > 0) { ------------------ | Branch (54:19): [True: 293, False: 0] ------------------ 55| 293| MD::compress_n(m_digest, aligned_data, full_blocks); 56| 293| } 57| 293| } 58| 598| } 59| | 60| 305| m_count += input.size(); 61| 305| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 895| void final(std::span output) { 64| 895| append_padding_bit(); 65| 895| append_counter_and_finalize(); 66| 895| copy_output(output); 67| 895| clear(); 68| 895| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE18append_padding_bitEv: 77| 895| void append_padding_bit() { 78| 895| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 77| 895| do { \ | | 78| 895| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 895| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 895] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 895| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 895] | | ------------------ ------------------ 79| 895| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 895| const uint8_t final_byte = 0x80; 81| 895| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 895| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE27append_counter_and_finalizeEv: 88| 895| 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| 895| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 144, False: 751] ------------------ 92| 144| m_buffer.fill_up_with_zeros(); 93| 144| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 144| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 895| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 77| 895| do { \ | | 78| 895| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 895| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 895] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 895| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 895] | | ------------------ ------------------ 98| 895| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 895| const uint64_t bit_count = m_count * 8; 102| 895| auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 895| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 895| 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| 895| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 895| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_384EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 895| void copy_output(std::span output) { 114| 895| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 77| 895| do { \ | | 78| 895| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 895| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 895] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 895| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 895] | | ------------------ ------------------ 115| | 116| 895| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 895| 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| 895| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE5finalENSt3__14spanIhLm18446744073709551615EEE: 63| 299| void final(std::span output) { 64| 299| append_padding_bit(); 65| 299| append_counter_and_finalize(); 66| 299| copy_output(output); 67| 299| clear(); 68| 299| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE18append_padding_bitEv: 77| 299| void append_padding_bit() { 78| 299| BOTAN_ASSERT_NOMSG(!m_buffer.ready_to_consume()); ------------------ | | 77| 299| do { \ | | 78| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 299| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 299] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 299| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 299] | | ------------------ ------------------ 79| 299| if constexpr(MD::bit_endianness == MD_Endian::Big) { 80| 299| const uint8_t final_byte = 0x80; 81| 299| m_buffer.append({&final_byte, 1}); 82| | } else { 83| | const uint8_t final_byte = 0x01; 84| | m_buffer.append({&final_byte, 1}); 85| | } 86| 299| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE27append_counter_and_finalizeEv: 88| 299| 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| 299| if(m_buffer.elements_until_alignment() < MD::ctr_bytes) { ------------------ | Branch (91:13): [True: 0, False: 299] ------------------ 92| 0| m_buffer.fill_up_with_zeros(); 93| 0| MD::compress_n(m_digest, m_buffer.consume(), 1); 94| 0| } 95| | 96| | // Make sure that any remaining bytes in the very last block are zero. 97| 299| BOTAN_ASSERT_NOMSG(m_buffer.elements_until_alignment() >= MD::ctr_bytes); ------------------ | | 77| 299| do { \ | | 78| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 299| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 299] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 299| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 299] | | ------------------ ------------------ 98| 299| m_buffer.fill_up_with_zeros(); 99| | 100| | // Replace a bunch of the right-most zero-padding with the counter bytes. 101| 299| const uint64_t bit_count = m_count * 8; 102| 299| auto last_bytes = m_buffer.directly_modify_last(sizeof(bit_count)); 103| 299| if constexpr(MD::byte_endianness == MD_Endian::Big) { 104| 299| 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| 299| MD::compress_n(m_digest, m_buffer.consume(), 1); 111| 299| } _ZN5Botan18MerkleDamgard_HashINS_7SHA_512EE11copy_outputENSt3__14spanIhLm18446744073709551615EEE: 113| 299| void copy_output(std::span output) { 114| 299| BOTAN_ASSERT_NOMSG(output.size() >= MD::output_bytes); ------------------ | | 77| 299| do { \ | | 78| 299| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 299| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 299] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 299| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 299] | | ------------------ ------------------ 115| | 116| 299| if constexpr(MD::byte_endianness == MD_Endian::Big) { 117| 299| 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| 299| } _ZN5Botan16as_span_of_bytesENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 68| 38|inline std::span as_span_of_bytes(std::string_view s) { 69| 38| return as_span_of_bytes(s.data(), s.size()); 70| 38|} _ZN5Botan16as_span_of_bytesEPKcm: 59| 7.34k|inline std::span as_span_of_bytes(const char* s, size_t len) { 60| 7.34k| const uint8_t* b = reinterpret_cast(s); 61| 7.34k| return std::span{b, len}; 62| 7.34k|} _ZN5Botan16as_span_of_bytesERKNSt3__112basic_stringIcNS0_11char_traitsIcEENS0_9allocatorIcEEEE: 64| 7.30k|inline std::span as_span_of_bytes(const std::string& s) { 65| 7.30k| return as_span_of_bytes(s.data(), s.size()); 66| 7.30k|} _ZN5Botan15bytes_to_stringENSt3__14spanIKhLm18446744073709551615EEE: 76| 16.0k|inline std::string bytes_to_string(std::span bytes) { 77| 16.0k| return std::string(reinterpret_cast(bytes.data()), bytes.size()); 78| 16.0k|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEhEEvPT_m: 37| 37.4k|inline void zeroize_buffer(T buf[], size_t n) { 38| 37.4k| if(n > 0) { ------------------ | Branch (38:7): [True: 37.4k, False: 0] ------------------ 39| 37.4k| std::memset(buf, 0, sizeof(T) * n); 40| 37.4k| } 41| 37.4k|} _ZN5Botan21unchecked_copy_memoryITkNSt3__117unsigned_integralEmEEvPT_PKS2_m: 44| 1.25M|inline void unchecked_copy_memory(T* out, const T* in, size_t n) { 45| 1.25M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (45:7): [True: 1.25M, False: 0] | Branch (45:24): [True: 1.25M, False: 0] | Branch (45:42): [True: 1.25M, False: 0] ------------------ 46| 1.25M| std::memmove(out, in, sizeof(T) * n); 47| 1.25M| } 48| 1.25M|} _ZN5Botan14zeroize_bufferITkNSt3__117unsigned_integralEmEEvPT_m: 37| 44.9M|inline void zeroize_buffer(T buf[], size_t n) { 38| 44.9M| if(n > 0) { ------------------ | Branch (38:7): [True: 43.6M, False: 1.22M] ------------------ 39| 43.6M| std::memset(buf, 0, sizeof(T) * n); 40| 43.6M| } 41| 44.9M|} _ZNK5Botan12Null_Padding15valid_blocksizeEm: 172| 30| bool valid_blocksize(size_t /*block_size*/) const override { return true; } _ZN5Botan28BlockCipherModePaddingMethodD2Ev: 78| 30| virtual ~BlockCipherModePaddingMethod() = default; _ZNK5Botan17Montgomery_Params1pEv: 41| 7.63M| const BigInt& p() const { return m_data->p(); } _ZNK5Botan17Montgomery_Params2R1Ev: 43| 3.28k| const BigInt& R1() const { return m_data->r1(); } _ZNK5Botan17Montgomery_Params2R2Ev: 45| 3.30k| const BigInt& R2() const { return m_data->r2(); } _ZNK5Botan17Montgomery_Params2R3Ev: 47| 2| const BigInt& R3() const { return m_data->r3(); } _ZNK5Botan17Montgomery_Params6p_dashEv: 49| 7.62M| word p_dash() const { return m_data->p_dash(); } _ZNK5Botan17Montgomery_Params7p_wordsEv: 51| 3.15M| size_t p_words() const { return m_data->p_size(); } _ZNK5Botan17Montgomery_Params4Data1pEv: 76| 7.63M| const BigInt& p() const { return m_p; } _ZNK5Botan17Montgomery_Params4Data2r1Ev: 78| 3.28k| const BigInt& r1() const { return m_r1; } _ZNK5Botan17Montgomery_Params4Data2r2Ev: 80| 3.30k| const BigInt& r2() const { return m_r2; } _ZNK5Botan17Montgomery_Params4Data2r3Ev: 82| 2| const BigInt& r3() const { return m_r3; } _ZNK5Botan17Montgomery_Params4Data6p_dashEv: 84| 7.62M| word p_dash() const { return m_p_dash; } _ZNK5Botan17Montgomery_Params4Data6p_sizeEv: 86| 3.15M| size_t p_size() const { return m_p_words; } _ZNK5Botan14Montgomery_Int4reprEv: 143| 24.1M| const secure_vector& repr() const { return m_v; } _ZNK5Botan14Montgomery_Int18_const_time_poisonEv: 159| 47.6k| void _const_time_poison() const { CT::poison(m_v); } _ZNK5Botan14Montgomery_Int20_const_time_unpoisonEv: 161| 6.78k| void _const_time_unpoison() const { CT::unpoison(m_v); } _ZNK5Botan14Montgomery_Int7_paramsEv: 163| 3.27k| const Montgomery_Params& _params() const { return m_params; } _ZN5Botan9monty_expERKNS_17Montgomery_ParamsERKNS_6BigIntES5_m: 49| 76| size_t max_k_bits) { 50| 76| auto precomputed = monty_precompute(params_p, g, 4, true); 51| 76| return monty_execute(*precomputed, k, max_k_bits); 52| 76|} _ZN5Botan10word8_add3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 294| 33.4M|inline constexpr auto word8_add3(W z[8], const W x[8], const W y[8], W carry) -> W { 295| 33.4M|#if defined(BOTAN_MP_USE_X86_64_ASM) 296| 33.4M| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (296:7): [True: 0, Folded] | Branch (296:36): [True: 0, Folded] ------------------ 297| 33.4M| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "adcq")) 298| 33.4M| : [carry] "=r"(carry) 299| 33.4M| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 300| 33.4M| : "cc", "memory"); 301| 33.4M| return carry; 302| 33.4M| } 303| 0|#endif 304| | 305| 0| z[0] = word_add(x[0], y[0], &carry); 306| 0| z[1] = word_add(x[1], y[1], &carry); 307| 0| z[2] = word_add(x[2], y[2], &carry); 308| 0| z[3] = word_add(x[3], y[3], &carry); 309| 0| z[4] = word_add(x[4], y[4], &carry); 310| 0| z[5] = word_add(x[5], y[5], &carry); 311| 0| z[6] = word_add(x[6], y[6], &carry); 312| 0| z[7] = word_add(x[7], y[7], &carry); 313| 0| return carry; 314| 33.4M|} _ZN5Botan8word_addITkNS_8WordTypeEmEET_S1_S1_PS1_: 231| 520M|inline constexpr auto word_add(W x, W y, W* carry) -> W { 232| 520M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_addc) 233| 520M| if(!std::is_constant_evaluated()) { ------------------ | Branch (233:7): [True: 520M, Folded] ------------------ 234| | if constexpr(std::same_as) { 235| | return __builtin_addc(x, y, *carry & 1, carry); 236| 520M| } else if constexpr(std::same_as) { 237| 520M| return __builtin_addcl(x, y, *carry & 1, carry); 238| | } else if constexpr(std::same_as) { 239| | return __builtin_addcll(x, y, *carry & 1, carry); 240| | } 241| 520M| } 242| 0|#endif 243| | 244| | if constexpr(WordInfo::dword_is_native && use_dword_for_word_add) { 245| | /* 246| | TODO(Botan4) this is largely a performance hack for GCCs that don't 247| | support __builtin_addc, if we increase the minimum supported version of 248| | GCC to GCC 14 then we can remove this and not worry about it 249| | */ 250| | const W cb = *carry & 1; 251| | const auto s = typename WordInfo::dword(x) + y + cb; 252| | *carry = static_cast(s >> WordInfo::bits); 253| | return static_cast(s); 254| 520M| } else { 255| 520M| const W cb = *carry & 1; 256| 520M| W z = x + y; 257| 520M| W c1 = (z < x); 258| 520M| z += cb; 259| 520M| *carry = c1 | (z < cb); 260| 520M| return z; 261| 520M| } 262| 520M|} _ZN5Botan10word8_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_S4_S1_: 371| 86.7M|inline constexpr auto word8_sub3(W z[8], const W x[8], const W y[8], W carry) -> W { 372| 86.7M|#if defined(BOTAN_MP_USE_X86_64_ASM) 373| 86.7M| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (373:7): [True: 0, Folded] | Branch (373:36): [True: 0, Folded] ------------------ 374| 86.7M| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB3_OP, "sbbq")) 375| 86.7M| : [carry] "=r"(carry) 376| 86.7M| : [x] "r"(x), [y] "r"(y), [z] "r"(z), "0"(carry) 377| 86.7M| : "cc", "memory"); 378| 86.7M| return carry; 379| 86.7M| } 380| 0|#endif 381| | 382| 0| z[0] = word_sub(x[0], y[0], &carry); 383| 0| z[1] = word_sub(x[1], y[1], &carry); 384| 0| z[2] = word_sub(x[2], y[2], &carry); 385| 0| z[3] = word_sub(x[3], y[3], &carry); 386| 0| z[4] = word_sub(x[4], y[4], &carry); 387| 0| z[5] = word_sub(x[5], y[5], &carry); 388| 0| z[6] = word_sub(x[6], y[6], &carry); 389| 0| z[7] = word_sub(x[7], y[7], &carry); 390| 0| return carry; 391| 86.7M|} _ZN5Botan8word_subITkNS_8WordTypeEmEET_S1_S1_PS1_: 320| 447M|inline constexpr auto word_sub(W x, W y, W* carry) -> W { 321| 447M|#if BOTAN_COMPILER_HAS_BUILTIN(__builtin_subc) 322| 447M| if(!std::is_constant_evaluated()) { ------------------ | Branch (322:7): [True: 447M, Folded] ------------------ 323| | if constexpr(std::same_as) { 324| | return __builtin_subc(x, y, *carry & 1, carry); 325| 447M| } else if constexpr(std::same_as) { 326| 447M| return __builtin_subcl(x, y, *carry & 1, carry); 327| | } else if constexpr(std::same_as) { 328| | return __builtin_subcll(x, y, *carry & 1, carry); 329| | } 330| 447M| } 331| 0|#endif 332| | 333| 0| const W cb = *carry & 1; 334| 447M| W t0 = x - y; 335| 447M| W c1 = (t0 > x); 336| 447M| W z = t0 - cb; 337| 447M| *carry = c1 | (z > t0); 338| 447M| return z; 339| 447M|} _ZN5Botan13word8_linmul3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_: 397| 171k|inline constexpr auto word8_linmul3(W z[8], const W x[8], W y, W carry) -> W { 398| 171k|#if defined(BOTAN_MP_USE_X86_64_ASM) 399| 171k| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (399:7): [True: 0, Folded] | Branch (399:36): [True: 0, Folded] ------------------ 400| 171k| asm(DO_8_TIMES(LINMUL_OP, "z") 401| 171k| : [carry] "=r"(carry) 402| 171k| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 403| 171k| : "cc", "%rax", "%rdx", "memory"); 404| 171k| return carry; 405| 171k| } 406| 0|#endif 407| | 408| 0| z[0] = word_madd2(x[0], y, &carry); 409| 0| z[1] = word_madd2(x[1], y, &carry); 410| 0| z[2] = word_madd2(x[2], y, &carry); 411| 0| z[3] = word_madd2(x[3], y, &carry); 412| 0| z[4] = word_madd2(x[4], y, &carry); 413| 0| z[5] = word_madd2(x[5], y, &carry); 414| 0| z[6] = word_madd2(x[6], y, &carry); 415| 0| z[7] = word_madd2(x[7], y, &carry); 416| 0| return carry; 417| 171k|} _ZN5Botan10word_madd2ITkNS_8WordTypeEmEET_S1_S1_PS1_: 90| 199k|inline constexpr auto word_madd2(W a, W b, W* c) -> W { 91| 199k|#if defined(BOTAN_MP_USE_X86_64_ASM) 92| 199k| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (92:7): [True: 0, Folded] | Branch (92:36): [True: 0, Folded] ------------------ 93| 199k| asm(R"( 94| 199k| mulq %[b] 95| 199k| addq %[c],%[a] 96| 199k| adcq $0,%[carry] 97| 199k| )" 98| 199k| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*c) 99| 199k| : "0"(a), "1"(b), [c] "g"(*c) 100| 199k| : "cc"); 101| | 102| 199k| return a; 103| 199k| } 104| |#elif defined(BOTAN_MP_USE_AARCH64_ASM) 105| | if(std::same_as && !std::is_constant_evaluated()) { 106| | W lo = 0; 107| | W hi = 0; 108| | asm(R"( 109| | mul %[lo], %[a], %[b] 110| | umulh %[hi], %[a], %[b] 111| | adds %[lo], %[lo], %[c] 112| | adc %[hi], %[hi], xzr 113| | )" 114| | : [lo] "=&r"(lo), [hi] "=&r"(hi) 115| | : [a] "r"(a), [b] "r"(b), [c] "r"(*c) 116| | : "cc"); 117| | 118| | *c = hi; 119| | return lo; 120| | } 121| |#endif 122| | 123| 0| typedef typename WordInfo::dword dword; 124| 0| const dword s = dword(a) * b + *c; 125| 0| *c = static_cast(s >> WordInfo::bits); 126| 0| return static_cast(s); 127| 199k|} _ZN5Botan11word8_madd3ITkNS_8WordTypeEmEET_PS1_PKS1_S1_S1_: 423| 1.01G|inline constexpr auto word8_madd3(W z[8], const W x[8], W y, W carry) -> W { 424| 1.01G|#if defined(BOTAN_MP_USE_X86_64_ASM) 425| 1.01G| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (425:7): [True: 0, Folded] | Branch (425:36): [True: 0, Folded] ------------------ 426| 1.01G| asm(DO_8_TIMES(MULADD_OP, "") 427| 1.01G| : [carry] "=r"(carry) 428| 1.01G| : [z] "r"(z), [x] "r"(x), [y] "rm"(y), "0"(carry) 429| 1.01G| : "cc", "%rax", "%rdx", "memory"); 430| 1.01G| return carry; 431| 1.01G| } 432| 0|#endif 433| | 434| 0| z[0] = word_madd3(x[0], y, z[0], &carry); 435| 0| z[1] = word_madd3(x[1], y, z[1], &carry); 436| 0| z[2] = word_madd3(x[2], y, z[2], &carry); 437| 0| z[3] = word_madd3(x[3], y, z[3], &carry); 438| 0| z[4] = word_madd3(x[4], y, z[4], &carry); 439| 0| z[5] = word_madd3(x[5], y, z[5], &carry); 440| 0| z[6] = word_madd3(x[6], y, z[6], &carry); 441| 0| z[7] = word_madd3(x[7], y, z[7], &carry); 442| 0| return carry; 443| 1.01G|} _ZN5Botan10word_madd3ITkNS_8WordTypeEmEET_S1_S1_S1_PS1_: 133| 965M|inline constexpr auto word_madd3(W a, W b, W c, W* d) -> W { 134| 965M|#if defined(BOTAN_MP_USE_X86_64_ASM) 135| 965M| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (135:7): [True: 0, Folded] | Branch (135:36): [True: 0, Folded] ------------------ 136| 965M| asm(R"( 137| 965M| mulq %[b] 138| 965M| 139| 965M| addq %[c],%[a] 140| 965M| adcq $0,%[carry] 141| 965M| 142| 965M| addq %[d],%[a] 143| 965M| adcq $0,%[carry] 144| 965M| )" 145| 965M| : [a] "=a"(a), [b] "=rm"(b), [carry] "=&d"(*d) 146| 965M| : "0"(a), "1"(b), [c] "g"(c), [d] "g"(*d) 147| 965M| : "cc"); 148| | 149| 965M| return a; 150| 965M| } 151| |#elif defined(BOTAN_MP_USE_AARCH64_ASM) 152| | if(std::same_as && !std::is_constant_evaluated()) { 153| | W lo = 0; 154| | W hi = 0; 155| | asm(R"( 156| | mul %[lo], %[a], %[b] 157| | umulh %[hi], %[a], %[b] 158| | adds %[lo], %[lo], %[c] 159| | adc %[hi], %[hi], xzr 160| | adds %[lo], %[lo], %[d] 161| | adc %[hi], %[hi], xzr 162| | )" 163| | : [lo] "=&r"(lo), [hi] "=&r"(hi) 164| | : [a] "r"(a), [b] "r"(b), [c] "r"(c), [d] "r"(*d) 165| | : "cc"); 166| | 167| | *d = hi; 168| | return lo; 169| | } 170| |#endif 171| | 172| 0| typedef typename WordInfo::dword dword; 173| 0| const dword s = dword(a) * b + c + *d; 174| 0| *d = static_cast(s >> WordInfo::bits); 175| 0| return static_cast(s); 176| 965M|} _ZN5Botan10word8_add2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 268| 32.3M|inline constexpr auto word8_add2(W x[8], const W y[8], W carry) -> W { 269| 32.3M|#if defined(BOTAN_MP_USE_X86_64_ASM) 270| 32.3M| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (270:7): [True: 0, Folded] | Branch (270:36): [True: 0, Folded] ------------------ 271| 32.3M| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "adcq")) 272| 32.3M| : [carry] "=r"(carry) 273| 32.3M| : [x] "r"(x), [y] "r"(y), "0"(carry) 274| 32.3M| : "cc", "memory"); 275| 32.3M| return carry; 276| 32.3M| } 277| 0|#endif 278| | 279| 0| x[0] = word_add(x[0], y[0], &carry); 280| 0| x[1] = word_add(x[1], y[1], &carry); 281| 0| x[2] = word_add(x[2], y[2], &carry); 282| 0| x[3] = word_add(x[3], y[3], &carry); 283| 0| x[4] = word_add(x[4], y[4], &carry); 284| 0| x[5] = word_add(x[5], y[5], &carry); 285| 0| x[6] = word_add(x[6], y[6], &carry); 286| 0| x[7] = word_add(x[7], y[7], &carry); 287| 0| return carry; 288| 32.3M|} _ZN5Botan10word8_sub2ITkNS_8WordTypeEmEET_PS1_PKS1_S1_: 345| 23.0M|inline constexpr auto word8_sub2(W x[8], const W y[8], W carry) -> W { 346| 23.0M|#if defined(BOTAN_MP_USE_X86_64_ASM) 347| 23.0M| if(std::same_as && !std::is_constant_evaluated()) { ------------------ | Branch (347:7): [True: 0, Folded] | Branch (347:36): [True: 0, Folded] ------------------ 348| 23.0M| asm volatile(ADD_OR_SUBTRACT(DO_8_TIMES(ADDSUB2_OP, "sbbq")) 349| 23.0M| : [carry] "=r"(carry) 350| 23.0M| : [x] "r"(x), [y] "r"(y), "0"(carry) 351| 23.0M| : "cc", "memory"); 352| 23.0M| return carry; 353| 23.0M| } 354| 0|#endif 355| | 356| 0| x[0] = word_sub(x[0], y[0], &carry); 357| 0| x[1] = word_sub(x[1], y[1], &carry); 358| 0| x[2] = word_sub(x[2], y[2], &carry); 359| 0| x[3] = word_sub(x[3], y[3], &carry); 360| 0| x[4] = word_sub(x[4], y[4], &carry); 361| 0| x[5] = word_sub(x[5], y[5], &carry); 362| 0| x[6] = word_sub(x[6], y[6], &carry); 363| 0| x[7] = word_sub(x[7], y[7], &carry); 364| 0| return carry; 365| 23.0M|} _ZN5Botan5word3ImEC2Ev: 458| 18.8M| constexpr word3() : m_w(0) {} _ZN5Botan5word3ImE3mulEmm: 460| 11.4G| inline constexpr void mul(W x, W y) { m_w += static_cast(x) * y; } _ZN5Botan5word3ImE7extractEv: 466| 649M| inline constexpr W extract() { 467| 649M| W r = static_cast(m_w); 468| 649M| m_w >>= WordInfo::bits; 469| 649M| return r; 470| 649M| } _ZN5Botan5word3ImE6mul_x2Emm: 462| 1.05G| inline constexpr void mul_x2(W x, W y) { m_w += static_cast(x) * y * 2; } _ZN5Botan5word3ImE3addEm: 464| 558M| inline constexpr void add(W x) { m_w += x; } _ZN5Botan5word3ImE10monty_stepEmm: 472| 279M| inline constexpr W monty_step(W p0, W p_dash) { 473| 279M| const W w0 = static_cast(m_w); 474| 279M| const W r = w0 * p_dash; 475| 279M| mul(r, p0); 476| 279M| m_w >>= WordInfo::bits; 477| 279M| return r; 478| 279M| } _ZN5Botan11bigint_add3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 120| 7.81M|inline constexpr auto bigint_add3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 121| 7.81M| if(x_size < y_size) { ------------------ | Branch (121:7): [True: 6.24k, False: 7.80M] ------------------ 122| 6.24k| return bigint_add3(z, y, y_size, x, x_size); 123| 6.24k| } 124| | 125| 7.80M| W carry = 0; 126| | 127| 7.80M| const size_t blocks = y_size - (y_size % 8); 128| | 129| 41.2M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (129:22): [True: 33.4M, False: 7.80M] ------------------ 130| 33.4M| carry = word8_add3(z + i, x + i, y + i, carry); 131| 33.4M| } 132| | 133| 20.0M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (133:27): [True: 12.2M, False: 7.80M] ------------------ 134| 12.2M| z[i] = word_add(x[i], y[i], &carry); 135| 12.2M| } 136| | 137| 7.92M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (137:27): [True: 111k, False: 7.80M] ------------------ 138| 111k| z[i] = word_add(x[i], static_cast(0), &carry); 139| 111k| } 140| | 141| 7.80M| return carry; 142| 7.81M|} _ZN5Botan10bigint_cmpITkNS_8WordTypeEmEEiPKT_mS3_m: 439| 1.14M|inline constexpr int32_t bigint_cmp(const W x[], size_t x_size, const W y[], size_t y_size) { 440| 1.14M| static_assert(sizeof(W) >= sizeof(uint32_t), "Size assumption"); 441| | 442| 1.14M| const W LT = static_cast(-1); 443| 1.14M| const W EQ = 0; 444| 1.14M| const W GT = 1; 445| | 446| 1.14M| const size_t common_elems = std::min(x_size, y_size); 447| | 448| 1.14M| W result = EQ; // until found otherwise 449| | 450| 42.8M| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (450:22): [True: 41.7M, False: 1.14M] ------------------ 451| 41.7M| const auto is_eq = CT::Mask::is_equal(x[i], y[i]); 452| 41.7M| const auto is_lt = CT::Mask::is_lt(x[i], y[i]); 453| | 454| 41.7M| result = is_eq.select(result, is_lt.select(LT, GT)); 455| 41.7M| } 456| | 457| 1.14M| if(x_size < y_size) { ------------------ | Branch (457:7): [True: 4.13k, False: 1.13M] ------------------ 458| 4.13k| W mask = 0; 459| 34.4k| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (459:30): [True: 30.3k, False: 4.13k] ------------------ 460| 30.3k| mask |= y[i]; 461| 30.3k| } 462| | 463| | // If any bits were set in high part of y, then x < y 464| 4.13k| result = CT::Mask::is_zero(mask).select(result, LT); 465| 1.13M| } else if(y_size < x_size) { ------------------ | Branch (465:14): [True: 15.1k, False: 1.12M] ------------------ 466| 15.1k| W mask = 0; 467| 565k| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (467:30): [True: 550k, False: 15.1k] ------------------ 468| 550k| mask |= x[i]; 469| 550k| } 470| | 471| | // If any bits were set in high part of x, then x > y 472| 15.1k| result = CT::Mask::is_zero(mask).select(result, GT); 473| 15.1k| } 474| | 475| 1.14M| CT::unpoison(result); 476| 1.14M| BOTAN_DEBUG_ASSERT(result == LT || result == GT || result == EQ); ------------------ | | 130| 1.14M| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 1.14M| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 1.14M] | | ------------------ ------------------ 477| 1.14M| return static_cast(result); 478| 1.14M|} _ZN5Botan11bigint_sub3ITkNS_8WordTypeEmEET_PS1_PKS1_mS4_m: 192| 2.83M|inline constexpr auto bigint_sub3(W z[], const W x[], size_t x_size, const W y[], size_t y_size) -> W { 193| 2.83M| W borrow = 0; 194| | 195| 2.83M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 64| 2.83M| do { \ | | 65| 2.83M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 2.83M| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 2.83M] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 2.83M| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 2.83M] | | ------------------ ------------------ 196| | 197| 2.83M| const size_t blocks = y_size - (y_size % 8); 198| | 199| 15.6M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (199:22): [True: 12.8M, False: 2.83M] ------------------ 200| 12.8M| borrow = word8_sub3(z + i, x + i, y + i, borrow); 201| 12.8M| } 202| | 203| 8.61M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (203:27): [True: 5.78M, False: 2.83M] ------------------ 204| 5.78M| z[i] = word_sub(x[i], y[i], &borrow); 205| 5.78M| } 206| | 207| 8.18M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (207:27): [True: 5.35M, False: 2.83M] ------------------ 208| 5.35M| z[i] = word_sub(x[i], static_cast(0), &borrow); 209| 5.35M| } 210| | 211| 2.83M| return borrow; 212| 2.83M|} _ZN5Botan14bigint_linmul3ITkNS_8WordTypeEmEEvPT_PKS1_mS1_: 416| 26.3k|inline constexpr void bigint_linmul3(W z[], const W x[], size_t x_size, W y) { 417| 26.3k| const size_t blocks = x_size - (x_size % 8); 418| | 419| 26.3k| W carry = 0; 420| | 421| 197k| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (421:22): [True: 171k, False: 26.3k] ------------------ 422| 171k| carry = word8_linmul3(z + i, x + i, y, carry); 423| 171k| } 424| | 425| 117k| for(size_t i = blocks; i != x_size; ++i) { ------------------ | Branch (425:27): [True: 91.0k, False: 26.3k] ------------------ 426| 91.0k| z[i] = word_madd2(x[i], y, &carry); 427| 91.0k| } 428| | 429| 26.3k| z[x_size] = carry; 430| 26.3k|} _ZN5Botan14divide_precompImEC2Em: 574| 1.14k| explicit constexpr divide_precomp(W divisor) : m_divisor(divisor) { 575| 1.14k| BOTAN_ARG_CHECK(m_divisor != 0, "Division by zero"); ------------------ | | 35| 1.14k| do { \ | | 36| 1.14k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.14k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.14k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.14k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.14k] | | ------------------ ------------------ 576| 1.14k| } _ZNK5Botan14divide_precompImE16vartime_mod_2to1Emm: 644| 5.53k| inline constexpr W vartime_mod_2to1(W n1, W n0) const { 645| 5.53k| BOTAN_ASSERT_NOMSG(n1 < m_divisor); ------------------ | | 77| 5.53k| do { \ | | 78| 5.53k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 5.53k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 5.53k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 5.53k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 5.53k] | | ------------------ ------------------ 646| 5.53k| W q = this->vartime_div_2to1(n1, n0); 647| 5.53k| W carry = 0; 648| 5.53k| q = word_madd2(q, m_divisor, &carry); 649| 5.53k| return (n0 - q); 650| 5.53k| } _ZNK5Botan14divide_precompImE16vartime_div_2to1Emm: 581| 32.3k| inline constexpr W vartime_div_2to1(W n1, W n0) const { 582| 32.3k| BOTAN_ASSERT_NOMSG(n1 < m_divisor); ------------------ | | 77| 32.3k| do { \ | | 78| 32.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 32.3k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 32.3k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 32.3k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 32.3k] | | ------------------ ------------------ 583| | 584| 32.3k| if(m_divisor == WordInfo::max) { ------------------ | Branch (584:13): [True: 3.33k, False: 29.0k] ------------------ 585| 3.33k| return vartime_div_2to1_max_d(n1, n0); 586| 3.33k| } 587| | 588| 29.0k| if(m_divisor == WordInfo::top_bit) { ------------------ | Branch (588:13): [True: 2.62k, False: 26.4k] ------------------ 589| | // Simply a shift by N-1 bits 590| 2.62k| return (n1 << 1) | (n0 >> (WordInfo::bits - 1)); 591| 2.62k| } 592| | 593| 26.4k| if(!std::is_constant_evaluated()) { ------------------ | Branch (593:13): [True: 26.4k, Folded] ------------------ 594| 26.4k|#if defined(BOTAN_MP_USE_X86_64_ASM) 595| 26.4k| if constexpr(std::same_as) { 596| 26.4k| W quotient = 0; 597| 26.4k| W remainder = 0; 598| | // NOLINTNEXTLINE(*-no-assembler) 599| 26.4k| asm("divq %[v]" : "=a"(quotient), "=d"(remainder) : [v] "r"(m_divisor), "a"(n0), "d"(n1) : "cc"); 600| 26.4k| return quotient; 601| 26.4k| } 602| 0|#endif 603| | 604| 0|#if !defined(BOTAN_BUILD_COMPILER_IS_CLANGCL) 605| | 606| | /* clang-cl has a bug where on encountering a 128/64 division it emits 607| | * a call to __udivti3() but then fails to link the relevant builtin into 608| | * the binary, causing a link failure. Work around this by simply omitting 609| | * such code for clang-cl 610| | * 611| | * See https://github.com/llvm/llvm-project/issues/25679 612| | */ 613| 26.4k| if constexpr(WordInfo::dword_is_native) { 614| 26.4k| typename WordInfo::dword n = n1; 615| 26.4k| n <<= WordInfo::bits; 616| 26.4k| n |= n0; 617| 26.4k| return static_cast(n / m_divisor); 618| 26.4k| } 619| 26.4k|#endif 620| 26.4k| } 621| | 622| 0| W high = n1; 623| 26.4k| W quotient = 0; 624| | 625| 26.4k| for(size_t i = 0; i != WordInfo::bits; ++i) { ------------------ | Branch (625:28): [True: 0, False: 26.4k] ------------------ 626| 0| const W high_top_bit = high >> (WordInfo::bits - 1); 627| | 628| 0| high <<= 1; 629| 0| high |= (n0 >> (WordInfo::bits - 1 - i)) & 1; 630| 0| quotient <<= 1; 631| | 632| 0| if(high_top_bit || high >= m_divisor) { ------------------ | Branch (632:16): [True: 0, False: 0] | Branch (632:32): [True: 0, False: 0] ------------------ 633| 0| high -= m_divisor; 634| 0| quotient |= 1; 635| 0| } 636| 0| } 637| | 638| 26.4k| return quotient; 639| 29.0k| } _ZN5Botan14divide_precompImE22vartime_div_2to1_max_dEmm: 657| 3.33k| static inline constexpr W vartime_div_2to1_max_d(W n1, W n0) { 658| | /* 659| | Use k to refer to WordInfo::bits 660| | 661| | We are dividing n = (n1 * 2^k) + n0 by 2^k - 1 662| | 663| | Recall that 2^k = 1 (mod 2^k - 1) 664| | 665| | Rewrite n = n1*2^k + n0 as n1*(2^k - 1) + n1 + n0 666| | 667| | The result of dividing n by (2^k - 1) will be equal to 668| | (n1*(2^k-1) + n1 + n0) / (2^k-1) = 669| | n1 + ((n1 + n0) / (2^k-1) 670| | 671| | Use c to refer to ((n1 + n0) / (2^k-1)) 672| | 673| | If (n1 + n0) < (2^k - 1) then c is 0 674| | If (n1 + n0) >= (2^k - 1) then c is 1 675| | 676| | Since n1 < 2^k - 1 [*] and n0 <= 2^k - 1 it is impossible for (n1 + n0) / (2^k -1) 677| | to be greater than 1. 678| | 679| | [*] We require n1 be strictly less than the divisor to ensure that the 680| | output fits in a single word; this is checked at the start of vartime_div_2to1. 681| | */ 682| | 683| 3.33k| const W s = n0 + n1; 684| | // did n0 + n1 overflow? or does (n0 + n1) == 2^k - 1? if either, c == 1 685| 3.33k| if(s < n0 || s == WordInfo::max) { ------------------ | Branch (685:13): [True: 1.54k, False: 1.79k] | Branch (685:23): [True: 0, False: 1.79k] ------------------ 686| 1.54k| n1 += 1; 687| 1.54k| } 688| | 689| 3.33k| return n1; 690| 3.33k| } _ZN5Botan11bigint_shl2ITkNS_8WordTypeEmEEvPT_mPKS1_mm: 355| 910|inline constexpr void bigint_shl2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) { 356| 910| const size_t word_shift = shift / WordInfo::bits; 357| 910| const size_t bit_shift = shift % WordInfo::bits; 358| | 359| 910| BOTAN_ASSERT_NOMSG(word_shift <= y_size); ------------------ | | 77| 910| do { \ | | 78| 910| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 910| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 910] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 910| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 910] | | ------------------ ------------------ 360| 910| BOTAN_ASSERT_NOMSG(x_size < y_size - word_shift); ------------------ | | 77| 910| do { \ | | 78| 910| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 910| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 910] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 910| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 910] | | ------------------ ------------------ 361| | 362| 910| unchecked_copy_memory(y + word_shift, x, x_size); 363| 910| zeroize_buffer(y, word_shift); 364| 910| zeroize_buffer(y + word_shift + x_size, y_size - word_shift - x_size); 365| | 366| 910| const auto carry_mask = CT::Mask::expand(bit_shift); 367| 910| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 368| | 369| 910| W carry = 0; 370| 32.6k| for(size_t i = word_shift; i != x_size + word_shift + 1; ++i) { ------------------ | Branch (370:31): [True: 31.7k, False: 910] ------------------ 371| 31.7k| const W w = y[i]; 372| 31.7k| y[i] = (w << bit_shift) | carry; 373| 31.7k| carry = carry_mask.if_set_return(w >> carry_shift); 374| 31.7k| } 375| 910|} _ZN5Botan11bigint_shr2ITkNS_8WordTypeEmEEvPT_mPKS1_mm: 378| 2.64k|inline constexpr void bigint_shr2(W y[], size_t y_size, const W x[], size_t x_size, size_t shift) { 379| 2.64k| const size_t word_shift = shift / WordInfo::bits; 380| 2.64k| const size_t bit_shift = shift % WordInfo::bits; 381| 2.64k| const size_t new_size = x_size < word_shift ? 0 : (x_size - word_shift); ------------------ | Branch (381:28): [True: 0, False: 2.64k] ------------------ 382| | 383| 2.64k| BOTAN_ASSERT_NOMSG(new_size <= y_size); ------------------ | | 77| 2.64k| do { \ | | 78| 2.64k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2.64k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 2.64k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 2.64k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 2.64k] | | ------------------ ------------------ 384| | 385| 2.64k| if(new_size > 0) { ------------------ | Branch (385:7): [True: 2.64k, False: 0] ------------------ 386| 2.64k| unchecked_copy_memory(y, x + word_shift, new_size); 387| 2.64k| } 388| 2.64k| zeroize_buffer(y + new_size, y_size - new_size); 389| | 390| 2.64k| const auto carry_mask = CT::Mask::expand(bit_shift); 391| 2.64k| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 392| | 393| 2.64k| W carry = 0; 394| 92.5k| for(size_t i = new_size; i > 0; --i) { ------------------ | Branch (394:29): [True: 89.9k, False: 2.64k] ------------------ 395| 89.9k| W w = y[i - 1]; 396| 89.9k| y[i - 1] = (w >> bit_shift) | carry; 397| 89.9k| carry = carry_mask.if_set_return(w << carry_shift); 398| 89.9k| } 399| 2.64k|} _ZN5Botan17bigint_monty_redcEPmPKmS2_mmS0_m: 924| 7.64M| word r[], const word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 925| 7.64M| const size_t z_size = 2 * p_size; 926| | 927| 7.64M| BOTAN_ARG_CHECK(ws_size >= p_size, "Montgomery reduction workspace too small"); ------------------ | | 35| 7.64M| do { \ | | 36| 7.64M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 7.64M| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 7.64M] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 7.64M| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.64M] | | ------------------ ------------------ 928| | 929| 7.64M| if(p_size == 4) { ------------------ | Branch (929:7): [True: 8, False: 7.64M] ------------------ 930| 8| bigint_monty_redc_4(r, z, p, p_dash, ws); 931| 7.64M| } else if(p_size == 6) { ------------------ | Branch (931:14): [True: 4, False: 7.64M] ------------------ 932| 4| bigint_monty_redc_6(r, z, p, p_dash, ws); 933| 7.64M| } else if(p_size == 8) { ------------------ | Branch (933:14): [True: 0, False: 7.64M] ------------------ 934| 0| bigint_monty_redc_8(r, z, p, p_dash, ws); 935| 7.64M| } else if(p_size == 12) { ------------------ | Branch (935:14): [True: 0, False: 7.64M] ------------------ 936| 0| bigint_monty_redc_12(r, z, p, p_dash, ws); 937| 7.64M| } else if(p_size == 16) { ------------------ | Branch (937:14): [True: 0, False: 7.64M] ------------------ 938| 0| bigint_monty_redc_16(r, z, p, p_dash, ws); 939| 7.64M| } else if(p_size == 24) { ------------------ | Branch (939:14): [True: 0, False: 7.64M] ------------------ 940| 0| bigint_monty_redc_24(r, z, p, p_dash, ws); 941| 7.64M| } else if(p_size == 32) { ------------------ | Branch (941:14): [True: 3.38M, False: 4.26M] ------------------ 942| 3.38M| bigint_monty_redc_32(r, z, p, p_dash, ws); 943| 4.26M| } else { 944| 4.26M| bigint_monty_redc_generic(r, z, z_size, p, p_size, p_dash, ws); 945| 4.26M| } 946| 7.64M|} _ZN5Botan25bigint_monty_redc_inplaceEPmPKmmmS0_m: 948| 7.62M|inline void bigint_monty_redc_inplace(word z[], const word p[], size_t p_size, word p_dash, word ws[], size_t ws_size) { 949| 7.62M| bigint_monty_redc(z, z, p, p_size, p_dash, ws, ws_size); 950| 7.62M| zeroize_buffer(z + p_size, p_size); 951| 7.62M|} _ZN5Botan15bigint_ct_is_eqITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_m: 519| 332k|inline constexpr auto bigint_ct_is_eq(const W x[], size_t x_size, const W y[], size_t y_size) -> CT::Mask { 520| 332k| const size_t common_elems = std::min(x_size, y_size); 521| | 522| 332k| W diff = 0; 523| | 524| 14.6M| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (524:22): [True: 14.3M, False: 332k] ------------------ 525| 14.3M| diff |= (x[i] ^ y[i]); 526| 14.3M| } 527| | 528| | // If any bits were set in high part of x/y, then they are not equal 529| 332k| if(x_size < y_size) { ------------------ | Branch (529:7): [True: 2, False: 332k] ------------------ 530| 18| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (530:30): [True: 16, False: 2] ------------------ 531| 16| diff |= y[i]; 532| 16| } 533| 332k| } else if(y_size < x_size) { ------------------ | Branch (533:14): [True: 332k, False: 59] ------------------ 534| 11.6M| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (534:30): [True: 11.3M, False: 332k] ------------------ 535| 11.3M| diff |= x[i]; 536| 11.3M| } 537| 332k| } 538| | 539| 332k| return CT::Mask::is_zero(diff); 540| 332k|} _ZN5Botan15bigint_ct_is_ltITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPKS3_mS6_mb: 487| 1.02M| -> CT::Mask { 488| 1.02M| const size_t common_elems = std::min(x_size, y_size); 489| | 490| 1.02M| auto is_lt = CT::Mask::expand(lt_or_equal); 491| | 492| 34.7M| for(size_t i = 0; i != common_elems; i++) { ------------------ | Branch (492:22): [True: 33.6M, False: 1.02M] ------------------ 493| 33.6M| const auto eq = CT::Mask::is_equal(x[i], y[i]); 494| 33.6M| const auto lt = CT::Mask::is_lt(x[i], y[i]); 495| 33.6M| is_lt = eq.select_mask(is_lt, lt); 496| 33.6M| } 497| | 498| 1.02M| if(x_size < y_size) { ------------------ | Branch (498:7): [True: 117k, False: 902k] ------------------ 499| 117k| W mask = 0; 500| 3.12M| for(size_t i = x_size; i != y_size; i++) { ------------------ | Branch (500:30): [True: 3.00M, False: 117k] ------------------ 501| 3.00M| mask |= y[i]; 502| 3.00M| } 503| | // If any bits were set in high part of y, then is_lt should be forced true 504| 117k| is_lt |= CT::Mask::expand(mask); 505| 902k| } else if(y_size < x_size) { ------------------ | Branch (505:14): [True: 900k, False: 2.46k] ------------------ 506| 900k| W mask = 0; 507| 36.2M| for(size_t i = y_size; i != x_size; i++) { ------------------ | Branch (507:30): [True: 35.3M, False: 900k] ------------------ 508| 35.3M| mask |= x[i]; 509| 35.3M| } 510| | 511| | // If any bits were set in high part of x, then is_lt should be false 512| 900k| is_lt &= CT::Mask::is_zero(mask); 513| 900k| } 514| | 515| 1.02M| return is_lt; 516| 1.02M|} _ZN5Botan15bigint_cnd_swapITkNS_8WordTypeEmEEvT_PS1_S2_m: 29| 801k|inline constexpr void bigint_cnd_swap(W cnd, W x[], W y[], size_t size) { 30| 801k| const auto mask = CT::Mask::expand(cnd); 31| | 32| 37.4M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (32:22): [True: 36.6M, False: 801k] ------------------ 33| 36.6M| const W a = x[i]; 34| 36.6M| const W b = y[i]; 35| 36.6M| x[i] = mask.select(b, a); 36| 36.6M| y[i] = mask.select(a, b); 37| 36.6M| } 38| 801k|} _ZN5Botan11bigint_shl1ITkNS_8WordTypeEmEEvPT_mmm: 309| 632k|inline constexpr void bigint_shl1(W x[], size_t x_size, size_t x_words, size_t shift) { 310| 632k| const size_t word_shift = shift / WordInfo::bits; 311| 632k| const size_t bit_shift = shift % WordInfo::bits; 312| | 313| 632k| BOTAN_ASSERT_NOMSG(word_shift <= x_size); ------------------ | | 77| 632k| do { \ | | 78| 632k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 632k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 632k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 632k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 632k] | | ------------------ ------------------ 314| 632k| BOTAN_ASSERT_NOMSG(x_words <= x_size - word_shift); ------------------ | | 77| 632k| do { \ | | 78| 632k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 632k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 632k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 632k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 632k] | | ------------------ ------------------ 315| | 316| 632k| unchecked_copy_memory(x + word_shift, x, x_words); 317| 632k| zeroize_buffer(x, word_shift); 318| | 319| 632k| const auto carry_mask = CT::Mask::expand(bit_shift); 320| 632k| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 321| | 322| 632k| W carry = 0; 323| 33.7M| for(size_t i = word_shift; i != x_size; ++i) { ------------------ | Branch (323:31): [True: 33.0M, False: 632k] ------------------ 324| 33.0M| const W w = x[i]; 325| 33.0M| x[i] = (w << bit_shift) | carry; 326| 33.0M| carry = carry_mask.if_set_return(w >> carry_shift); 327| 33.0M| } 328| 632k|} _ZN5Botan14bigint_sub_absITkNS_8WordTypeEmEENS_2CT4MaskIT_EEPS3_PKS3_S7_mS5_: 279| 11.9M|inline constexpr auto bigint_sub_abs(W z[], const W x[], const W y[], size_t N, W ws[]) -> CT::Mask { 280| | // Subtract in both direction then conditional copy out the result 281| | 282| 11.9M| W* ws0 = ws; 283| 11.9M| W* ws1 = ws + N; 284| | 285| 11.9M| W borrow0 = 0; 286| 11.9M| W borrow1 = 0; 287| | 288| 11.9M| const size_t blocks = N - (N % 8); 289| | 290| 39.0M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (290:22): [True: 27.1M, False: 11.9M] ------------------ 291| 27.1M| borrow0 = word8_sub3(ws0 + i, x + i, y + i, borrow0); 292| 27.1M| borrow1 = word8_sub3(ws1 + i, y + i, x + i, borrow1); 293| 27.1M| } 294| | 295| 30.5M| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (295:27): [True: 18.5M, False: 11.9M] ------------------ 296| 18.5M| ws0[i] = word_sub(x[i], y[i], &borrow0); 297| 18.5M| ws1[i] = word_sub(y[i], x[i], &borrow1); 298| 18.5M| } 299| | 300| 11.9M| return CT::conditional_copy_mem(borrow0, z, ws1, ws0, N); 301| 11.9M|} _ZN5Botan11bigint_add2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 94| 22.6M|inline constexpr auto bigint_add2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 95| 22.6M| W carry = 0; 96| | 97| 22.6M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 64| 22.6M| do { \ | | 65| 22.6M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 22.6M| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 22.6M] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 22.6M| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 22.6M] | | ------------------ ------------------ 98| | 99| 22.6M| const size_t blocks = y_size - (y_size % 8); 100| | 101| 55.0M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (101:22): [True: 32.3M, False: 22.6M] ------------------ 102| 32.3M| carry = word8_add2(x + i, y + i, carry); 103| 32.3M| } 104| | 105| 49.6M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (105:27): [True: 27.0M, False: 22.6M] ------------------ 106| 27.0M| x[i] = word_add(x[i], y[i], &carry); 107| 27.0M| } 108| | 109| 278M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (109:27): [True: 255M, False: 22.6M] ------------------ 110| 255M| x[i] = word_add(x[i], static_cast(0), &carry); 111| 255M| } 112| | 113| 22.6M| return carry; 114| 22.6M|} _ZN5Botan14bigint_cnd_addITkNS_8WordTypeEmEET_S1_PS1_PKS1_m: 45| 3.79M|inline constexpr W bigint_cnd_add(W cnd, W x[], const W y[], size_t size) { 46| 3.79M| const auto mask = CT::Mask::expand(cnd).value(); 47| | 48| 3.79M| W carry = 0; 49| | 50| 202M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (50:22): [True: 198M, False: 3.79M] ------------------ 51| 198M| x[i] = word_add(x[i], y[i] & mask, &carry); 52| 198M| } 53| | 54| 3.79M| return (mask & carry); 55| 3.79M|} _ZN5Botan14bigint_cnd_subITkNS_8WordTypeEmEET_S1_PS1_PKS1_m: 62| 3.61M|inline constexpr auto bigint_cnd_sub(W cnd, W x[], const W y[], size_t size) -> W { 63| 3.61M| const auto mask = CT::Mask::expand(cnd).value(); 64| | 65| 3.61M| W carry = 0; 66| | 67| 195M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (67:22): [True: 192M, False: 3.61M] ------------------ 68| 192M| x[i] = word_sub(x[i], y[i] & mask, &carry); 69| 192M| } 70| | 71| 3.61M| return (mask & carry); 72| 3.61M|} _ZN5Botan11bigint_sub2ITkNS_8WordTypeEmEET_PS1_mPKS1_m: 148| 5.38M|inline constexpr auto bigint_sub2(W x[], size_t x_size, const W y[], size_t y_size) -> W { 149| 5.38M| W borrow = 0; 150| | 151| 5.38M| BOTAN_ASSERT(x_size >= y_size, "Expected sizes"); ------------------ | | 64| 5.38M| do { \ | | 65| 5.38M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 5.38M| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 5.38M] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 5.38M| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 5.38M] | | ------------------ ------------------ 152| | 153| 5.38M| const size_t blocks = y_size - (y_size % 8); 154| | 155| 28.4M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (155:22): [True: 23.0M, False: 5.38M] ------------------ 156| 23.0M| borrow = word8_sub2(x + i, y + i, borrow); 157| 23.0M| } 158| | 159| 13.7M| for(size_t i = blocks; i != y_size; ++i) { ------------------ | Branch (159:27): [True: 8.33M, False: 5.38M] ------------------ 160| 8.33M| x[i] = word_sub(x[i], y[i], &borrow); 161| 8.33M| } 162| | 163| 80.5M| for(size_t i = y_size; i != x_size; ++i) { ------------------ | Branch (163:27): [True: 75.1M, False: 5.38M] ------------------ 164| 75.1M| x[i] = word_sub(x[i], static_cast(0), &borrow); 165| 75.1M| } 166| | 167| 5.38M| return borrow; 168| 5.38M|} _ZN5Botan15bigint_sub2_revITkNS_8WordTypeEmEEvPT_PKS1_m: 174| 196|inline constexpr void bigint_sub2_rev(W x[], const W y[], size_t y_size) { 175| 196| W borrow = 0; 176| | 177| 10.0k| for(size_t i = 0; i != y_size; ++i) { ------------------ | Branch (177:22): [True: 9.89k, False: 196] ------------------ 178| 9.89k| x[i] = word_sub(y[i], x[i], &borrow); 179| 9.89k| } 180| | 181| 196| BOTAN_ASSERT(borrow == 0, "y must be greater than x"); ------------------ | | 64| 196| do { \ | | 65| 196| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 196| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 196] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 196| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 196] | | ------------------ ------------------ 182| 196|} _ZN5Botan14bigint_linmul2ITkNS_8WordTypeEmEET_PS1_mS1_: 405| 972|[[nodiscard]] inline constexpr auto bigint_linmul2(W x[], size_t x_size, W y) -> W { 406| 972| W carry = 0; 407| | 408| 8.41k| for(size_t i = 0; i != x_size; ++i) { ------------------ | Branch (408:22): [True: 7.44k, False: 972] ------------------ 409| 7.44k| x[i] = word_madd2(x[i], y, &carry); 410| 7.44k| } 411| | 412| 972| return carry; 413| 972|} _ZN5Botan11bigint_shr1ITkNS_8WordTypeEmEEvPT_mm: 331| 617k|inline constexpr void bigint_shr1(W x[], size_t x_size, size_t shift) { 332| 617k| const size_t word_shift = shift / WordInfo::bits; 333| 617k| const size_t bit_shift = shift % WordInfo::bits; 334| | 335| 617k| const size_t top = x_size >= word_shift ? (x_size - word_shift) : 0; ------------------ | Branch (335:23): [True: 617k, False: 0] ------------------ 336| | 337| 617k| if(top > 0) { ------------------ | Branch (337:7): [True: 617k, False: 0] ------------------ 338| 617k| unchecked_copy_memory(x, x + word_shift, top); 339| 617k| } 340| 617k| zeroize_buffer(x + top, std::min(word_shift, x_size)); 341| | 342| 617k| const auto carry_mask = CT::Mask::expand(bit_shift); 343| 617k| const W carry_shift = carry_mask.if_set_return(WordInfo::bits - bit_shift); 344| | 345| 617k| W carry = 0; 346| | 347| 34.7M| for(size_t i = 0; i != top; ++i) { ------------------ | Branch (347:22): [True: 34.1M, False: 617k] ------------------ 348| 34.1M| const W w = x[top - i - 1]; 349| 34.1M| x[top - i - 1] = (w >> bit_shift) | carry; 350| 34.1M| carry = carry_mask.if_set_return(w << carry_shift); 351| 34.1M| } 352| 617k|} _ZN5Botan14bigint_cnd_absITkNS_8WordTypeEmEEvT_PS1_m: 80| 168k|inline constexpr void bigint_cnd_abs(W cnd, W x[], size_t size) { 81| 168k| const auto mask = CT::Mask::expand(cnd); 82| | 83| 168k| W carry = mask.if_set_return(1); 84| 6.14M| for(size_t i = 0; i != size; ++i) { ------------------ | Branch (84:22): [True: 5.97M, False: 168k] ------------------ 85| 5.97M| const W z = word_add(~x[i], static_cast(0), &carry); 86| 5.97M| x[i] = mask.select(z, x[i]); 87| 5.97M| } 88| 168k|} _ZN5Botan13monty_inverseITkNS_8WordTypeEmEET_S1_: 703| 842|inline constexpr auto monty_inverse(W a) -> W { 704| 842| BOTAN_ARG_CHECK(a % 2 == 1, "Cannot compute Montgomery inverse of an even integer"); ------------------ | | 35| 842| do { \ | | 36| 842| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 842| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 842] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 842| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 842] | | ------------------ ------------------ 705| | 706| | // Newton's Method, following https://lemire.me/blog/2017/09/18/computing-the-inverse-of-odd-integers/ 707| | 708| 842| constexpr size_t iter = WordInfo::bits == 64 ? 4 : 3; ------------------ | Branch (708:28): [True: 0, Folded] ------------------ 709| | 710| | // Initial guess provides 5 bits of accuracy 711| 842| W r = (3 * a) ^ 2; 712| | 713| | // Each iteration doubles the accuracy 714| 4.21k| for(size_t i = 0; i != iter; ++i) { ------------------ | Branch (714:22): [True: 3.36k, False: 842] ------------------ 715| 3.36k| r = r * (2 - r * a); 716| 3.36k| } 717| | 718| | // Now invert in addition space 719| 842| r = (WordInfo::max - r) + 1; 720| | 721| 842| return r; 722| 842|} _ZN5Botan22bigint_monty_maybe_subITkNS_8WordTypeEmEEvmPT_S1_PKS1_S4_: 225| 4.26M|inline constexpr void bigint_monty_maybe_sub(size_t N, W z[], W x0, const W x[], const W p[]) { 226| 4.26M| W borrow = 0; 227| | 228| 4.26M| const size_t blocks = N - (N % 8); 229| | 230| 23.9M| for(size_t i = 0; i != blocks; i += 8) { ------------------ | Branch (230:22): [True: 19.7M, False: 4.26M] ------------------ 231| 19.7M| borrow = word8_sub3(z + i, x + i, p + i, borrow); 232| 19.7M| } 233| | 234| 17.8M| for(size_t i = blocks; i != N; ++i) { ------------------ | Branch (234:27): [True: 13.6M, False: 4.26M] ------------------ 235| 13.6M| z[i] = word_sub(x[i], p[i], &borrow); 236| 13.6M| } 237| | 238| 4.26M| borrow = (x0 - borrow) > x0; 239| | 240| 4.26M| CT::conditional_assign_mem(borrow, z, x, N); 241| 4.26M|} _ZN5Botan9comba_sqrILm4ETkNS_8WordTypeEmEEvPT0_PKS1_: 854| 14.7k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 855| 14.7k| if(!std::is_constant_evaluated()) { ------------------ | Branch (855:7): [True: 14.7k, Folded] ------------------ 856| 14.7k| if constexpr(std::same_as && N == 4) { 857| 14.7k| return bigint_comba_sqr4(z, x); 858| 14.7k| } 859| | if constexpr(std::same_as && N == 6) { 860| | return bigint_comba_sqr6(z, x); 861| | } 862| | if constexpr(std::same_as && N == 7) { 863| | return bigint_comba_sqr7(z, x); 864| | } 865| | if constexpr(std::same_as && N == 8) { 866| | return bigint_comba_sqr8(z, x); 867| | } 868| | if constexpr(std::same_as && N == 9) { 869| | return bigint_comba_sqr9(z, x); 870| | } 871| | if constexpr(std::same_as && N == 16) { 872| | return bigint_comba_sqr16(z, x); 873| | } 874| 14.7k| } 875| | 876| 0| word3 accum; 877| | 878| 14.7k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (878:22): [True: 0, False: 14.7k] ------------------ 879| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (879:28): [True: 0, False: 0] ------------------ 880| 0| const size_t end = std::min(N, i + 1); 881| | 882| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (882:29): [True: 0, False: 0] ------------------ 883| 0| accum.mul(x[j], x[i - j]); 884| 0| } 885| 0| z[i] = accum.extract(); 886| 0| } 887| 14.7k|} _ZN5Botan22bigint_monty_maybe_subILm4ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 254| 16.5k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 255| 16.5k| W borrow = 0; 256| | 257| 82.6k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (257:22): [True: 66.1k, False: 16.5k] ------------------ 258| 66.1k| z[i] = word_sub(x[i], y[i], &borrow); 259| 66.1k| } 260| | 261| 16.5k| borrow = (x0 - borrow) > x0; 262| | 263| 16.5k| CT::conditional_assign_mem(borrow, z, x, N); 264| 16.5k|} _ZN5Botan9comba_mulILm4ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 818| 39.6k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 819| 39.6k| if(!std::is_constant_evaluated()) { ------------------ | Branch (819:7): [True: 39.6k, Folded] ------------------ 820| 39.6k| if constexpr(std::same_as && N == 4) { 821| 39.6k| return bigint_comba_mul4(z, x, y); 822| 39.6k| } 823| | if constexpr(std::same_as && N == 6) { 824| | return bigint_comba_mul6(z, x, y); 825| | } 826| | if constexpr(std::same_as && N == 7) { 827| | return bigint_comba_mul7(z, x, y); 828| | } 829| | if constexpr(std::same_as && N == 8) { 830| | return bigint_comba_mul8(z, x, y); 831| | } 832| | if constexpr(std::same_as && N == 9) { 833| | return bigint_comba_mul9(z, x, y); 834| | } 835| | if constexpr(std::same_as && N == 16) { 836| | return bigint_comba_mul16(z, x, y); 837| | } 838| 39.6k| } 839| | 840| 0| word3 accum; 841| | 842| 39.6k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (842:22): [True: 0, False: 39.6k] ------------------ 843| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (843:28): [True: 0, False: 0] ------------------ 844| 0| const size_t end = std::min(N, i + 1); 845| | 846| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (846:29): [True: 0, False: 0] ------------------ 847| 0| accum.mul(x[j], y[i - j]); 848| 0| } 849| 0| z[i] = accum.extract(); 850| 0| } 851| 39.6k|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 725| 12.5k|inline constexpr W shift_left(std::array& x) { 726| 12.5k| static_assert(N >= 1, "Invalid input size"); 727| 12.5k| static_assert(S > 0, "Zero shift not supported"); 728| 12.5k| static_assert(S < WordInfo::bits, "Shift too large"); 729| | 730| 12.5k| const W carry = x[N - 1] >> (WordInfo::bits - S); 731| | 732| 50.0k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (732:26): [True: 37.5k, False: 12.5k] ------------------ 733| 37.5k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 734| 37.5k| } 735| 12.5k| x[0] <<= S; 736| | 737| 12.5k| return carry; 738| 12.5k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 741| 1.37k|inline constexpr W shift_right(std::array& x) { 742| 1.37k| static_assert(N >= 1, "Invalid input size"); 743| 1.37k| static_assert(S > 0, "Zero shift not supported"); 744| 1.37k| static_assert(S < WordInfo::bits, "Shift too large"); 745| | 746| 1.37k| const W carry = x[0] << (WordInfo::bits - S); 747| | 748| 5.51k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (748:22): [True: 4.13k, False: 1.37k] ------------------ 749| 4.13k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 750| 4.13k| } 751| 1.37k| x[N - 1] >>= S; 752| | 753| 1.37k| return carry; 754| 1.37k|} _ZN5Botan9comba_sqrILm6ETkNS_8WordTypeEmEEvPT0_PKS1_: 854| 11.6k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 855| 11.6k| if(!std::is_constant_evaluated()) { ------------------ | Branch (855:7): [True: 11.6k, Folded] ------------------ 856| | if constexpr(std::same_as && N == 4) { 857| | return bigint_comba_sqr4(z, x); 858| | } 859| 11.6k| if constexpr(std::same_as && N == 6) { 860| 11.6k| return bigint_comba_sqr6(z, x); 861| 11.6k| } 862| | if constexpr(std::same_as && N == 7) { 863| | return bigint_comba_sqr7(z, x); 864| | } 865| | if constexpr(std::same_as && N == 8) { 866| | return bigint_comba_sqr8(z, x); 867| | } 868| | if constexpr(std::same_as && N == 9) { 869| | return bigint_comba_sqr9(z, x); 870| | } 871| | if constexpr(std::same_as && N == 16) { 872| | return bigint_comba_sqr16(z, x); 873| | } 874| 11.6k| } 875| | 876| 0| word3 accum; 877| | 878| 11.6k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (878:22): [True: 0, False: 11.6k] ------------------ 879| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (879:28): [True: 0, False: 0] ------------------ 880| 0| const size_t end = std::min(N, i + 1); 881| | 882| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (882:29): [True: 0, False: 0] ------------------ 883| 0| accum.mul(x[j], x[i - j]); 884| 0| } 885| 0| z[i] = accum.extract(); 886| 0| } 887| 11.6k|} _ZN5Botan22bigint_monty_maybe_subILm6ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 254| 13.7k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 255| 13.7k| W borrow = 0; 256| | 257| 96.3k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (257:22): [True: 82.5k, False: 13.7k] ------------------ 258| 82.5k| z[i] = word_sub(x[i], y[i], &borrow); 259| 82.5k| } 260| | 261| 13.7k| borrow = (x0 - borrow) > x0; 262| | 263| 13.7k| CT::conditional_assign_mem(borrow, z, x, N); 264| 13.7k|} _ZN5Botan9comba_mulILm6ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 818| 32.1k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 819| 32.1k| if(!std::is_constant_evaluated()) { ------------------ | Branch (819:7): [True: 32.1k, Folded] ------------------ 820| | if constexpr(std::same_as && N == 4) { 821| | return bigint_comba_mul4(z, x, y); 822| | } 823| 32.1k| if constexpr(std::same_as && N == 6) { 824| 32.1k| return bigint_comba_mul6(z, x, y); 825| 32.1k| } 826| | if constexpr(std::same_as && N == 7) { 827| | return bigint_comba_mul7(z, x, y); 828| | } 829| | if constexpr(std::same_as && N == 8) { 830| | return bigint_comba_mul8(z, x, y); 831| | } 832| | if constexpr(std::same_as && N == 9) { 833| | return bigint_comba_mul9(z, x, y); 834| | } 835| | if constexpr(std::same_as && N == 16) { 836| | return bigint_comba_mul16(z, x, y); 837| | } 838| 32.1k| } 839| | 840| 0| word3 accum; 841| | 842| 32.1k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (842:22): [True: 0, False: 32.1k] ------------------ 843| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (843:28): [True: 0, False: 0] ------------------ 844| 0| const size_t end = std::min(N, i + 1); 845| | 846| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (846:29): [True: 0, False: 0] ------------------ 847| 0| accum.mul(x[j], y[i - j]); 848| 0| } 849| 0| z[i] = accum.extract(); 850| 0| } 851| 32.1k|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 725| 9.92k|inline constexpr W shift_left(std::array& x) { 726| 9.92k| static_assert(N >= 1, "Invalid input size"); 727| 9.92k| static_assert(S > 0, "Zero shift not supported"); 728| 9.92k| static_assert(S < WordInfo::bits, "Shift too large"); 729| | 730| 9.92k| const W carry = x[N - 1] >> (WordInfo::bits - S); 731| | 732| 59.5k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (732:26): [True: 49.6k, False: 9.92k] ------------------ 733| 49.6k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 734| 49.6k| } 735| 9.92k| x[0] <<= S; 736| | 737| 9.92k| return carry; 738| 9.92k|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm6EEET0_RNSt3__15arrayIS1_XT1_EEE: 741| 1.11k|inline constexpr W shift_right(std::array& x) { 742| 1.11k| static_assert(N >= 1, "Invalid input size"); 743| 1.11k| static_assert(S > 0, "Zero shift not supported"); 744| 1.11k| static_assert(S < WordInfo::bits, "Shift too large"); 745| | 746| 1.11k| const W carry = x[0] << (WordInfo::bits - S); 747| | 748| 6.67k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (748:22): [True: 5.56k, False: 1.11k] ------------------ 749| 5.56k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 750| 5.56k| } 751| 1.11k| x[N - 1] >>= S; 752| | 753| 1.11k| return carry; 754| 1.11k|} _ZN5Botan10shift_leftILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 725| 18.2k|inline constexpr W shift_left(std::array& x) { 726| 18.2k| static_assert(N >= 1, "Invalid input size"); 727| 18.2k| static_assert(S > 0, "Zero shift not supported"); 728| 18.2k| static_assert(S < WordInfo::bits, "Shift too large"); 729| | 730| 18.2k| const W carry = x[N - 1] >> (WordInfo::bits - S); 731| | 732| 164k| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (732:26): [True: 145k, False: 18.2k] ------------------ 733| 145k| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 734| 145k| } 735| 18.2k| x[0] <<= S; 736| | 737| 18.2k| return carry; 738| 18.2k|} _ZN5Botan22bigint_monty_maybe_subILm9ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 254| 23.3k|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 255| 23.3k| W borrow = 0; 256| | 257| 233k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (257:22): [True: 210k, False: 23.3k] ------------------ 258| 210k| z[i] = word_sub(x[i], y[i], &borrow); 259| 210k| } 260| | 261| 23.3k| borrow = (x0 - borrow) > x0; 262| | 263| 23.3k| CT::conditional_assign_mem(borrow, z, x, N); 264| 23.3k|} _ZN5Botan16read_window_bitsILm4EmLm18446744073709551615EEEmNSt3__14spanIKT0_XT1_EEEm: 1071| 48|constexpr size_t read_window_bits(std::span words, size_t offset) { 1072| 48| static_assert(WindowBits >= 1 && WindowBits <= 7); 1073| | 1074| 48| constexpr uint8_t WindowMask = static_cast(1 << WindowBits) - 1; 1075| | 1076| 48| constexpr size_t W_bits = sizeof(W) * 8; 1077| 48| const auto bit_shift = offset % W_bits; 1078| 48| const auto word_offset = words.size() - 1 - (offset / W_bits); 1079| | 1080| 48| const bool single_byte_window = bit_shift <= (W_bits - WindowBits) || word_offset == 0; ------------------ | Branch (1080:36): [True: 48, False: 0] | Branch (1080:74): [True: 0, False: 0] ------------------ 1081| | 1082| 48| const auto w0 = words[word_offset]; 1083| | 1084| 48| if(single_byte_window) { ------------------ | Branch (1084:7): [True: 48, False: 0] ------------------ 1085| 48| return (w0 >> bit_shift) & WindowMask; 1086| 48| } else { 1087| | // Otherwise we must join two words and extract the result 1088| 0| const auto w1 = words[word_offset - 1]; 1089| 0| const auto combined = ((w0 >> bit_shift) | (w1 << (W_bits - bit_shift))); 1090| 0| return combined & WindowMask; 1091| 0| } 1092| 48|} _ZN5Botan11shift_rightILm1ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 741| 1.48k|inline constexpr W shift_right(std::array& x) { 742| 1.48k| static_assert(N >= 1, "Invalid input size"); 743| 1.48k| static_assert(S > 0, "Zero shift not supported"); 744| 1.48k| static_assert(S < WordInfo::bits, "Shift too large"); 745| | 746| 1.48k| const W carry = x[0] << (WordInfo::bits - S); 747| | 748| 13.3k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (748:22): [True: 11.8k, False: 1.48k] ------------------ 749| 11.8k| x[i] = (x[i] >> S) | (x[i + 1] << (WordInfo::bits - S)); 750| 11.8k| } 751| 1.48k| x[N - 1] >>= S; 752| | 753| 1.48k| return carry; 754| 1.48k|} _ZN5Botan10shift_leftILm32ETkNS_8WordTypeEmLm4EEET0_RNSt3__15arrayIS1_XT1_EEE: 725| 4|inline constexpr W shift_left(std::array& x) { 726| 4| static_assert(N >= 1, "Invalid input size"); 727| 4| static_assert(S > 0, "Zero shift not supported"); 728| 4| static_assert(S < WordInfo::bits, "Shift too large"); 729| | 730| 4| const W carry = x[N - 1] >> (WordInfo::bits - S); 731| | 732| 16| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (732:26): [True: 12, False: 4] ------------------ 733| 12| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 734| 12| } 735| 4| x[0] <<= S; 736| | 737| 4| return carry; 738| 4|} _ZN5Botan13redc_crandallITkNS_8WordTypeEmLm4ETnT_Lm4294968273EEENSt3__15arrayIS1_XT0_EEENS2_4spanIKS1_XmlLi2ET0_EEE: 992| 28.5k|constexpr std::array redc_crandall(std::span z) { 993| 28.5k| static_assert(N >= 2); 994| | 995| 28.5k| std::array hi = {}; 996| | 997| | // hi = hi * c + lo 998| | 999| 28.5k| W carry = 0; 1000| 142k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (1000:22): [True: 114k, False: 28.5k] ------------------ 1001| 114k| hi[i] = word_madd3(z[i + N], C, z[i], &carry); 1002| 114k| } 1003| | 1004| | // hi += carry * C 1005| 28.5k| word carry_c[2] = {0}; 1006| 28.5k| carry_c[0] = word_madd2(carry, C, &carry_c[1]); 1007| | 1008| 28.5k| carry = bigint_add2(hi.data(), N, carry_c, 2); 1009| | 1010| 28.5k| constexpr W P0 = WordInfo::max - (C - 1); 1011| | 1012| 28.5k| std::array r = {}; 1013| | 1014| 28.5k| W borrow = 0; 1015| | 1016| | /* 1017| | * For undetermined reasons, on GCC (only) removing this asm block causes 1018| | * massive (up to 20%) performance regressions in secp256k1. 1019| | * 1020| | * The generated code without the asm seems quite reasonable, and timing 1021| | * repeated calls to redc_crandall with the cycle counter show that GCC 1022| | * computes it in about the same number of cycles with or without the asm. 1023| | * 1024| | * So the cause of the regression is unclear. But it is reproducible across 1025| | * machines and GCC versions. 1026| | */ 1027| |#if defined(BOTAN_MP_USE_X86_64_ASM) && defined(__GNUC__) && !defined(__clang__) 1028| | if constexpr(N == 4 && std::same_as) { 1029| | if(!std::is_constant_evaluated()) { 1030| | asm volatile(R"( 1031| | movq 0(%[x]), %[borrow] 1032| | subq %[p0], %[borrow] 1033| | movq %[borrow], 0(%[r]) 1034| | movq 8(%[x]), %[borrow] 1035| | sbbq $-1, %[borrow] 1036| | movq %[borrow], 8(%[r]) 1037| | movq 16(%[x]), %[borrow] 1038| | sbbq $-1, %[borrow] 1039| | movq %[borrow], 16(%[r]) 1040| | movq 24(%[x]), %[borrow] 1041| | sbbq $-1, %[borrow] 1042| | movq %[borrow], 24(%[r]) 1043| | sbbq %[borrow],%[borrow] 1044| | negq %[borrow] 1045| | )" 1046| | : [borrow] "=r"(borrow) 1047| | : [x] "r"(hi.data()), [p0] "r"(P0), [r] "r"(r.data()), "0"(borrow) 1048| | : "cc", "memory"); 1049| | 1050| | borrow = (carry - borrow) > carry; 1051| | CT::conditional_assign_mem(borrow, r.data(), hi.data(), N); 1052| | return r; 1053| | } 1054| | } 1055| |#endif 1056| | 1057| 28.5k| r[0] = word_sub(hi[0], P0, &borrow); 1058| 114k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (1058:22): [True: 85.6k, False: 28.5k] ------------------ 1059| 85.6k| r[i] = word_sub(hi[i], WordInfo::max, &borrow); 1060| 85.6k| } 1061| | 1062| 28.5k| borrow = (carry - borrow) > carry; 1063| | 1064| 28.5k| CT::conditional_assign_mem(borrow, r.data(), hi.data(), N); 1065| | 1066| 28.5k| return r; 1067| 28.5k|} _ZN5Botan9comba_sqrILm9ETkNS_8WordTypeEmEEvPT0_PKS1_: 854| 15.5k|constexpr inline void comba_sqr(W z[2 * N], const W x[N]) { 855| 15.5k| if(!std::is_constant_evaluated()) { ------------------ | Branch (855:7): [True: 15.5k, Folded] ------------------ 856| | if constexpr(std::same_as && N == 4) { 857| | return bigint_comba_sqr4(z, x); 858| | } 859| | if constexpr(std::same_as && N == 6) { 860| | return bigint_comba_sqr6(z, x); 861| | } 862| | if constexpr(std::same_as && N == 7) { 863| | return bigint_comba_sqr7(z, x); 864| | } 865| | if constexpr(std::same_as && N == 8) { 866| | return bigint_comba_sqr8(z, x); 867| | } 868| 15.5k| if constexpr(std::same_as && N == 9) { 869| 15.5k| return bigint_comba_sqr9(z, x); 870| 15.5k| } 871| | if constexpr(std::same_as && N == 16) { 872| | return bigint_comba_sqr16(z, x); 873| | } 874| 15.5k| } 875| | 876| 0| word3 accum; 877| | 878| 15.5k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (878:22): [True: 0, False: 15.5k] ------------------ 879| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (879:28): [True: 0, False: 0] ------------------ 880| 0| const size_t end = std::min(N, i + 1); 881| | 882| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (882:29): [True: 0, False: 0] ------------------ 883| 0| accum.mul(x[j], x[i - j]); 884| 0| } 885| 0| z[i] = accum.extract(); 886| 0| } 887| 15.5k|} _ZN5Botan9comba_mulILm9ETkNS_8WordTypeEmEEvPT0_PKS1_S4_: 818| 42.6k|constexpr inline void comba_mul(W z[2 * N], const W x[N], const W y[N]) { 819| 42.6k| if(!std::is_constant_evaluated()) { ------------------ | Branch (819:7): [True: 42.6k, Folded] ------------------ 820| | if constexpr(std::same_as && N == 4) { 821| | return bigint_comba_mul4(z, x, y); 822| | } 823| | if constexpr(std::same_as && N == 6) { 824| | return bigint_comba_mul6(z, x, y); 825| | } 826| | if constexpr(std::same_as && N == 7) { 827| | return bigint_comba_mul7(z, x, y); 828| | } 829| | if constexpr(std::same_as && N == 8) { 830| | return bigint_comba_mul8(z, x, y); 831| | } 832| 42.6k| if constexpr(std::same_as && N == 9) { 833| 42.6k| return bigint_comba_mul9(z, x, y); 834| 42.6k| } 835| | if constexpr(std::same_as && N == 16) { 836| | return bigint_comba_mul16(z, x, y); 837| | } 838| 42.6k| } 839| | 840| 0| word3 accum; 841| | 842| 42.6k| for(size_t i = 0; i != 2 * N; ++i) { ------------------ | Branch (842:22): [True: 0, False: 42.6k] ------------------ 843| 0| const size_t start = i + 1 < N ? 0 : i + 1 - N; ------------------ | Branch (843:28): [True: 0, False: 0] ------------------ 844| 0| const size_t end = std::min(N, i + 1); 845| | 846| 0| for(size_t j = start; j != end; ++j) { ------------------ | Branch (846:29): [True: 0, False: 0] ------------------ 847| 0| accum.mul(x[j], y[i - j]); 848| 0| } 849| 0| z[i] = accum.extract(); 850| 0| } 851| 42.6k|} _ZN5Botan10shift_leftILm16ETkNS_8WordTypeEmLm9EEET0_RNSt3__15arrayIS1_XT1_EEE: 725| 54|inline constexpr W shift_left(std::array& x) { 726| 54| static_assert(N >= 1, "Invalid input size"); 727| 54| static_assert(S > 0, "Zero shift not supported"); 728| 54| static_assert(S < WordInfo::bits, "Shift too large"); 729| | 730| 54| const W carry = x[N - 1] >> (WordInfo::bits - S); 731| | 732| 486| for(size_t i = N - 1; i != 0; --i) { ------------------ | Branch (732:26): [True: 432, False: 54] ------------------ 733| 432| x[i] = (x[i] << S) | (x[i - 1] >> (WordInfo::bits - S)); 734| 432| } 735| 54| x[0] <<= S; 736| | 737| 54| return carry; 738| 54|} _ZN5Botan22bigint_monty_maybe_subILm32ETkNS_8WordTypeEmEEvPT0_S1_PKS1_S4_: 254| 3.38M|inline constexpr void bigint_monty_maybe_sub(W z[N], W x0, const W x[N], const W y[N]) { 255| 3.38M| W borrow = 0; 256| | 257| 111M| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (257:22): [True: 108M, False: 3.38M] ------------------ 258| 108M| z[i] = word_sub(x[i], y[i], &borrow); 259| 108M| } 260| | 261| 3.38M| borrow = (x0 - borrow) > x0; 262| | 263| 3.38M| CT::conditional_assign_mem(borrow, z, x, N); 264| 3.38M|} _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointD2Ev: 100| 1| ~AffinePoint() = default; _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint6_curveEv: 104| 1| const auto& _curve() const { return m_curve; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_xEv: 106| 1| const auto& _x() const { return m_x; } _ZNK5Botan6PCurve15PrimeOrderCurve11AffinePoint2_yEv: 108| 1| const auto& _y() const { return m_y; } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePoint7_createENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 110| 1| static AffinePoint _create(CurvePtr curve, StorageUnit x, StorageUnit y) { 111| 1| return AffinePoint(std::move(curve), x, y); 112| 1| } _ZN5Botan6PCurve15PrimeOrderCurve11AffinePointC2ENSt3__110shared_ptrIKS1_EENS3_5arrayImLm9EEES8_: 115| 1| AffinePoint(CurvePtr curve, StorageUnit x, StorageUnit y) : m_curve(std::move(curve)), m_x(x), m_y(y) {} _ZN5Botan6PCurve15PrimeOrderCurveD2Ev: 163| 5| virtual ~PrimeOrderCurve() = default; _ZN5Botan10dbl_a_zeroINS_6PCurve22GenericProjectivePointEEET_RKS3_: 381| 629|inline constexpr ProjectivePoint dbl_a_zero(const ProjectivePoint& pt) { 382| | // If a == 0 then 3*x^2 + a*z^4 == 3*x^2 383| | // Cost: 1S + 1*3 384| 629| const auto m = pt.x().square().mul3(); 385| | 386| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 387| 629| const auto y2 = pt.y().square(); 388| 629| const auto s = pt.x().mul4() * y2; 389| 629| const auto nx = m.square() - s.mul2(); 390| 629| const auto ny = m * (s - nx) - y2.square().mul8(); 391| 629| const auto nz = pt.y().mul2() * pt.z(); 392| | 393| 629| return ProjectivePoint(nx, ny, nz); 394| 629|} pcurves_generic.cpp:_ZN5Botan9point_addINS_6PCurve22GenericProjectivePointENS1_12_GLOBAL__N_112GenericFieldEEET_RKS5_S7_: 187| 555|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 188| 555| const auto a_is_identity = a.is_identity(); 189| 555| const auto b_is_identity = b.is_identity(); 190| | 191| 555| const auto Z1Z1 = a.z().square(); 192| 555| const auto Z2Z2 = b.z().square(); 193| 555| const auto U1 = a.x() * Z2Z2; 194| 555| const auto U2 = b.x() * Z1Z1; 195| 555| const auto S1 = a.y() * b.z() * Z2Z2; 196| 555| const auto S2 = b.y() * a.z() * Z1Z1; 197| 555| const auto H = U2 - U1; 198| 555| const auto r = S2 - S1; 199| | 200| | /* Risky conditional 201| | * 202| | * This implementation uses projective coordinates, which do not have an efficient complete 203| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 204| | * 205| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 206| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 207| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 208| | * output (the identity element) 209| | */ 210| 555| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (210:7): [True: 0, False: 555] ------------------ 211| 0| return a.dbl(); 212| 0| } 213| | 214| 555| const auto HH = H.square(); 215| 555| const auto HHH = H * HH; 216| 555| const auto V = U1 * HH; 217| 555| const auto t2 = r.square(); 218| 555| const auto t3 = V + V; 219| 555| const auto t4 = t2 - HHH; 220| 555| auto X3 = t4 - t3; 221| 555| const auto t5 = V - X3; 222| 555| const auto t6 = S1 * HHH; 223| 555| const auto t7 = r * t5; 224| 555| auto Y3 = t7 - t6; 225| 555| const auto t8 = b.z() * H; 226| 555| auto Z3 = a.z() * t8; 227| | 228| | // if a is identity then return b 229| 555| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 230| | 231| | // if b is identity then return a 232| 555| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 233| | 234| 555| return ProjectivePoint(X3, Y3, Z3); 235| 555|} pcurves_generic.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_112GenericCurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 107| 1|auto to_affine_batch(std::span projective) { 108| 1| using AffinePoint = typename C::AffinePoint; 109| | 110| 1| const size_t N = projective.size(); 111| 1| std::vector affine; 112| 1| affine.reserve(N); 113| | 114| 1| CT::Choice any_identity = CT::Choice::no(); 115| | 116| 1.18k| for(const auto& pt : projective) { ------------------ | Branch (116:23): [True: 1.18k, False: 1] ------------------ 117| 1.18k| any_identity = any_identity || pt.is_identity(); 118| 1.18k| } 119| | 120| | // Conditional acceptable: N is public. State of points is not necessarily 121| | // public, but we don't leak which point was the identity. In practice with 122| | // the algorithms currently in use, the only time an identity can occur is 123| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 124| | // some k < 16) 125| | 126| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (126:7): [True: 0, False: 1] | Branch (126:17): [True: 0, False: 1] ------------------ 127| | // If there are identity elements, using the batch inversion gets 128| | // tricky. It can be done, but this should be a rare situation so 129| | // just punt to the serial conversion if it occurs 130| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (130:25): [True: 0, False: 0] ------------------ 131| 0| affine.push_back(to_affine(projective[i])); 132| 0| } 133| 1| } else { 134| 1| std::vector c; 135| 1| c.reserve(N); 136| | 137| | /* 138| | Batch projective->affine using Montgomery's trick 139| | 140| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 141| | (Hankerson, Menezes, Vanstone) 142| | */ 143| | 144| 1| c.push_back(projective[0].z()); 145| 1.18k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (145:25): [True: 1.18k, False: 1] ------------------ 146| 1.18k| c.push_back(c[i - 1] * projective[i].z()); 147| 1.18k| } 148| | 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| 1| } else { 153| 1| return invert_field_element(c[N - 1]); 154| 1| } 155| 1| }(); 156| | 157| 1.18k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (157:29): [True: 1.18k, False: 1] ------------------ 158| 1.18k| const auto& p = projective[i]; 159| | 160| 1.18k| const auto z_inv = s_inv * c[i - 1]; 161| 1.18k| const auto z2_inv = z_inv.square(); 162| 1.18k| const auto z3_inv = z_inv * z2_inv; 163| | 164| 1.18k| s_inv = s_inv * p.z(); 165| | 166| 1.18k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 167| 1.18k| } 168| | 169| 1| const auto z2_inv = s_inv.square(); 170| 1| const auto z3_inv = s_inv * z2_inv; 171| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 172| 1| std::reverse(affine.begin(), affine.end()); 173| 1| return affine; 174| 1| } 175| | 176| 0| return affine; 177| 1|} pcurves_generic.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_112GenericCurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| | } else { 153| | return invert_field_element(c[N - 1]); 154| | } 155| 1| }(); pcurves_secp224r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 362| 731|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 363| | /* 364| | if a == -3 then 365| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 366| | */ 367| 731| const auto z2 = pt.z().square(); 368| 731| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 369| | 370| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 371| 731| const auto y2 = pt.y().square(); 372| 731| const auto s = pt.x().mul4() * y2; 373| 731| const auto nx = m.square() - s.mul2(); 374| 731| const auto ny = m * (s - nx) - y2.square().mul8(); 375| 731| const auto nz = pt.y().mul2() * pt.z(); 376| | 377| 731| return ProjectivePoint(nx, ny, nz); 378| 731|} pcurves_secp224r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 187| 645|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 188| 645| const auto a_is_identity = a.is_identity(); 189| 645| const auto b_is_identity = b.is_identity(); 190| | 191| 645| const auto Z1Z1 = a.z().square(); 192| 645| const auto Z2Z2 = b.z().square(); 193| 645| const auto U1 = a.x() * Z2Z2; 194| 645| const auto U2 = b.x() * Z1Z1; 195| 645| const auto S1 = a.y() * b.z() * Z2Z2; 196| 645| const auto S2 = b.y() * a.z() * Z1Z1; 197| 645| const auto H = U2 - U1; 198| 645| const auto r = S2 - S1; 199| | 200| | /* Risky conditional 201| | * 202| | * This implementation uses projective coordinates, which do not have an efficient complete 203| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 204| | * 205| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 206| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 207| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 208| | * output (the identity element) 209| | */ 210| 645| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (210:7): [True: 0, False: 645] ------------------ 211| 0| return a.dbl(); 212| 0| } 213| | 214| 645| const auto HH = H.square(); 215| 645| const auto HHH = H * HH; 216| 645| const auto V = U1 * HH; 217| 645| const auto t2 = r.square(); 218| 645| const auto t3 = V + V; 219| 645| const auto t4 = t2 - HHH; 220| 645| auto X3 = t4 - t3; 221| 645| const auto t5 = V - X3; 222| 645| const auto t6 = S1 * HHH; 223| 645| const auto t7 = r * t5; 224| 645| auto Y3 = t7 - t6; 225| 645| const auto t8 = b.z() * H; 226| 645| auto Z3 = a.z() * t8; 227| | 228| | // if a is identity then return b 229| 645| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 230| | 231| | // if b is identity then return a 232| 645| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 233| | 234| 645| return ProjectivePoint(X3, Y3, Z3); 235| 645|} pcurves_secp224r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp224r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 107| 1|auto to_affine_batch(std::span projective) { 108| 1| using AffinePoint = typename C::AffinePoint; 109| | 110| 1| const size_t N = projective.size(); 111| 1| std::vector affine; 112| 1| affine.reserve(N); 113| | 114| 1| CT::Choice any_identity = CT::Choice::no(); 115| | 116| 1.37k| for(const auto& pt : projective) { ------------------ | Branch (116:23): [True: 1.37k, False: 1] ------------------ 117| 1.37k| any_identity = any_identity || pt.is_identity(); 118| 1.37k| } 119| | 120| | // Conditional acceptable: N is public. State of points is not necessarily 121| | // public, but we don't leak which point was the identity. In practice with 122| | // the algorithms currently in use, the only time an identity can occur is 123| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 124| | // some k < 16) 125| | 126| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (126:7): [True: 0, False: 1] | Branch (126:17): [True: 0, False: 1] ------------------ 127| | // If there are identity elements, using the batch inversion gets 128| | // tricky. It can be done, but this should be a rare situation so 129| | // just punt to the serial conversion if it occurs 130| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (130:25): [True: 0, False: 0] ------------------ 131| 0| affine.push_back(to_affine(projective[i])); 132| 0| } 133| 1| } else { 134| 1| std::vector c; 135| 1| c.reserve(N); 136| | 137| | /* 138| | Batch projective->affine using Montgomery's trick 139| | 140| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 141| | (Hankerson, Menezes, Vanstone) 142| | */ 143| | 144| 1| c.push_back(projective[0].z()); 145| 1.37k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (145:25): [True: 1.37k, False: 1] ------------------ 146| 1.37k| c.push_back(c[i - 1] * projective[i].z()); 147| 1.37k| } 148| | 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| 1| } else { 153| 1| return invert_field_element(c[N - 1]); 154| 1| } 155| 1| }(); 156| | 157| 1.37k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (157:29): [True: 1.37k, False: 1] ------------------ 158| 1.37k| const auto& p = projective[i]; 159| | 160| 1.37k| const auto z_inv = s_inv * c[i - 1]; 161| 1.37k| const auto z2_inv = z_inv.square(); 162| 1.37k| const auto z3_inv = z_inv * z2_inv; 163| | 164| 1.37k| s_inv = s_inv * p.z(); 165| | 166| 1.37k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 167| 1.37k| } 168| | 169| 1| const auto z2_inv = s_inv.square(); 170| 1| const auto z3_inv = s_inv * z2_inv; 171| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 172| 1| std::reverse(affine.begin(), affine.end()); 173| 1| return affine; 174| 1| } 175| | 176| 0| return affine; 177| 1|} pcurves_secp224r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp224r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| | } else { 153| | return invert_field_element(c[N - 1]); 154| | } 155| 1| }(); pcurves_secp256k1.cpp:_ZN5Botan10dbl_a_zeroINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 381| 833|inline constexpr ProjectivePoint dbl_a_zero(const ProjectivePoint& pt) { 382| | // If a == 0 then 3*x^2 + a*z^4 == 3*x^2 383| | // Cost: 1S + 1*3 384| 833| const auto m = pt.x().square().mul3(); 385| | 386| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 387| 833| const auto y2 = pt.y().square(); 388| 833| const auto s = pt.x().mul4() * y2; 389| 833| const auto nx = m.square() - s.mul2(); 390| 833| const auto ny = m * (s - nx) - y2.square().mul8(); 391| 833| const auto nz = pt.y().mul2() * pt.z(); 392| | 393| 833| return ProjectivePoint(nx, ny, nz); 394| 833|} pcurves_secp256k1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 187| 735|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 188| 735| const auto a_is_identity = a.is_identity(); 189| 735| const auto b_is_identity = b.is_identity(); 190| | 191| 735| const auto Z1Z1 = a.z().square(); 192| 735| const auto Z2Z2 = b.z().square(); 193| 735| const auto U1 = a.x() * Z2Z2; 194| 735| const auto U2 = b.x() * Z1Z1; 195| 735| const auto S1 = a.y() * b.z() * Z2Z2; 196| 735| const auto S2 = b.y() * a.z() * Z1Z1; 197| 735| const auto H = U2 - U1; 198| 735| const auto r = S2 - S1; 199| | 200| | /* Risky conditional 201| | * 202| | * This implementation uses projective coordinates, which do not have an efficient complete 203| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 204| | * 205| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 206| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 207| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 208| | * output (the identity element) 209| | */ 210| 735| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (210:7): [True: 0, False: 735] ------------------ 211| 0| return a.dbl(); 212| 0| } 213| | 214| 735| const auto HH = H.square(); 215| 735| const auto HHH = H * HH; 216| 735| const auto V = U1 * HH; 217| 735| const auto t2 = r.square(); 218| 735| const auto t3 = V + V; 219| 735| const auto t4 = t2 - HHH; 220| 735| auto X3 = t4 - t3; 221| 735| const auto t5 = V - X3; 222| 735| const auto t6 = S1 * HHH; 223| 735| const auto t7 = r * t5; 224| 735| auto Y3 = t7 - t6; 225| 735| const auto t8 = b.z() * H; 226| 735| auto Z3 = a.z() * t8; 227| | 228| | // if a is identity then return b 229| 735| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 230| | 231| | // if b is identity then return a 232| 735| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 233| | 234| 735| return ProjectivePoint(X3, Y3, Z3); 235| 735|} pcurves_secp256k1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256k15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 107| 1|auto to_affine_batch(std::span projective) { 108| 1| using AffinePoint = typename C::AffinePoint; 109| | 110| 1| const size_t N = projective.size(); 111| 1| std::vector affine; 112| 1| affine.reserve(N); 113| | 114| 1| CT::Choice any_identity = CT::Choice::no(); 115| | 116| 1.56k| for(const auto& pt : projective) { ------------------ | Branch (116:23): [True: 1.56k, False: 1] ------------------ 117| 1.56k| any_identity = any_identity || pt.is_identity(); 118| 1.56k| } 119| | 120| | // Conditional acceptable: N is public. State of points is not necessarily 121| | // public, but we don't leak which point was the identity. In practice with 122| | // the algorithms currently in use, the only time an identity can occur is 123| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 124| | // some k < 16) 125| | 126| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (126:7): [True: 0, False: 1] | Branch (126:17): [True: 0, False: 1] ------------------ 127| | // If there are identity elements, using the batch inversion gets 128| | // tricky. It can be done, but this should be a rare situation so 129| | // just punt to the serial conversion if it occurs 130| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (130:25): [True: 0, False: 0] ------------------ 131| 0| affine.push_back(to_affine(projective[i])); 132| 0| } 133| 1| } else { 134| 1| std::vector c; 135| 1| c.reserve(N); 136| | 137| | /* 138| | Batch projective->affine using Montgomery's trick 139| | 140| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 141| | (Hankerson, Menezes, Vanstone) 142| | */ 143| | 144| 1| c.push_back(projective[0].z()); 145| 1.56k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (145:25): [True: 1.56k, False: 1] ------------------ 146| 1.56k| c.push_back(c[i - 1] * projective[i].z()); 147| 1.56k| } 148| | 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| 1| } else { 153| 1| return invert_field_element(c[N - 1]); 154| 1| } 155| 1| }(); 156| | 157| 1.56k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (157:29): [True: 1.56k, False: 1] ------------------ 158| 1.56k| const auto& p = projective[i]; 159| | 160| 1.56k| const auto z_inv = s_inv * c[i - 1]; 161| 1.56k| const auto z2_inv = z_inv.square(); 162| 1.56k| const auto z3_inv = z_inv * z2_inv; 163| | 164| 1.56k| s_inv = s_inv * p.z(); 165| | 166| 1.56k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 167| 1.56k| } 168| | 169| 1| const auto z2_inv = s_inv.square(); 170| 1| const auto z3_inv = s_inv * z2_inv; 171| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 172| 1| std::reverse(affine.begin(), affine.end()); 173| 1| return affine; 174| 1| } 175| | 176| 0| return affine; 177| 1|} pcurves_secp256k1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp256k15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| | } else { 153| | return invert_field_element(c[N - 1]); 154| | } 155| 1| }(); pcurves_secp384r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EEEET_RKSE_: 362| 1.24k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 363| | /* 364| | if a == -3 then 365| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 366| | */ 367| 1.24k| const auto z2 = pt.z().square(); 368| 1.24k| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 369| | 370| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 371| 1.24k| const auto y2 = pt.y().square(); 372| 1.24k| const auto s = pt.x().mul4() * y2; 373| 1.24k| const auto nx = m.square() - s.mul2(); 374| 1.24k| const auto ny = m * (s - nx) - y2.square().mul8(); 375| 1.24k| const auto nz = pt.y().mul2() * pt.z(); 376| | 377| 1.24k| return ProjectivePoint(nx, ny, nz); 378| 1.24k|} pcurves_secp384r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS4_9secp384r16ParamsES5_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 187| 1.09k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 188| 1.09k| const auto a_is_identity = a.is_identity(); 189| 1.09k| const auto b_is_identity = b.is_identity(); 190| | 191| 1.09k| const auto Z1Z1 = a.z().square(); 192| 1.09k| const auto Z2Z2 = b.z().square(); 193| 1.09k| const auto U1 = a.x() * Z2Z2; 194| 1.09k| const auto U2 = b.x() * Z1Z1; 195| 1.09k| const auto S1 = a.y() * b.z() * Z2Z2; 196| 1.09k| const auto S2 = b.y() * a.z() * Z1Z1; 197| 1.09k| const auto H = U2 - U1; 198| 1.09k| const auto r = S2 - S1; 199| | 200| | /* Risky conditional 201| | * 202| | * This implementation uses projective coordinates, which do not have an efficient complete 203| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 204| | * 205| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 206| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 207| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 208| | * output (the identity element) 209| | */ 210| 1.09k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (210:7): [True: 0, False: 1.09k] ------------------ 211| 0| return a.dbl(); 212| 0| } 213| | 214| 1.09k| const auto HH = H.square(); 215| 1.09k| const auto HHH = H * HH; 216| 1.09k| const auto V = U1 * HH; 217| 1.09k| const auto t2 = r.square(); 218| 1.09k| const auto t3 = V + V; 219| 1.09k| const auto t4 = t2 - HHH; 220| 1.09k| auto X3 = t4 - t3; 221| 1.09k| const auto t5 = V - X3; 222| 1.09k| const auto t6 = S1 * HHH; 223| 1.09k| const auto t7 = r * t5; 224| 1.09k| auto Y3 = t7 - t6; 225| 1.09k| const auto t8 = b.z() * H; 226| 1.09k| auto Z3 = a.z() * t8; 227| | 228| | // if a is identity then return b 229| 1.09k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 230| | 231| | // if b is identity then return a 232| 1.09k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 233| | 234| 1.09k| return ProjectivePoint(X3, Y3, Z3); 235| 1.09k|} pcurves_secp384r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 107| 1|auto to_affine_batch(std::span projective) { 108| 1| using AffinePoint = typename C::AffinePoint; 109| | 110| 1| const size_t N = projective.size(); 111| 1| std::vector affine; 112| 1| affine.reserve(N); 113| | 114| 1| CT::Choice any_identity = CT::Choice::no(); 115| | 116| 2.33k| for(const auto& pt : projective) { ------------------ | Branch (116:23): [True: 2.33k, False: 1] ------------------ 117| 2.33k| any_identity = any_identity || pt.is_identity(); 118| 2.33k| } 119| | 120| | // Conditional acceptable: N is public. State of points is not necessarily 121| | // public, but we don't leak which point was the identity. In practice with 122| | // the algorithms currently in use, the only time an identity can occur is 123| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 124| | // some k < 16) 125| | 126| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (126:7): [True: 0, False: 1] | Branch (126:17): [True: 0, False: 1] ------------------ 127| | // If there are identity elements, using the batch inversion gets 128| | // tricky. It can be done, but this should be a rare situation so 129| | // just punt to the serial conversion if it occurs 130| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (130:25): [True: 0, False: 0] ------------------ 131| 0| affine.push_back(to_affine(projective[i])); 132| 0| } 133| 1| } else { 134| 1| std::vector c; 135| 1| c.reserve(N); 136| | 137| | /* 138| | Batch projective->affine using Montgomery's trick 139| | 140| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 141| | (Hankerson, Menezes, Vanstone) 142| | */ 143| | 144| 1| c.push_back(projective[0].z()); 145| 2.33k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (145:25): [True: 2.33k, False: 1] ------------------ 146| 2.33k| c.push_back(c[i - 1] * projective[i].z()); 147| 2.33k| } 148| | 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| 1| } else { 153| 1| return invert_field_element(c[N - 1]); 154| 1| } 155| 1| }(); 156| | 157| 2.33k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (157:29): [True: 2.33k, False: 1] ------------------ 158| 2.33k| const auto& p = projective[i]; 159| | 160| 2.33k| const auto z_inv = s_inv * c[i - 1]; 161| 2.33k| const auto z2_inv = z_inv.square(); 162| 2.33k| const auto z3_inv = z_inv * z2_inv; 163| | 164| 2.33k| s_inv = s_inv * p.z(); 165| | 166| 2.33k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 167| 2.33k| } 168| | 169| 1| const auto z2_inv = s_inv.square(); 170| 1| const auto z3_inv = s_inv * z2_inv; 171| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 172| 1| std::reverse(affine.begin(), affine.end()); 173| 1| return affine; 174| 1| } 175| | 176| 0| return affine; 177| 1|} pcurves_secp384r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp384r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| | } else { 153| | return invert_field_element(c[N - 1]); 154| | } 155| 1| }(); pcurves_secp521r1.cpp:_ZN5Botan13dbl_a_minus_3INS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EEEET_RKSE_: 362| 1.64k|inline constexpr ProjectivePoint dbl_a_minus_3(const ProjectivePoint& pt) { 363| | /* 364| | if a == -3 then 365| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 366| | */ 367| 1.64k| const auto z2 = pt.z().square(); 368| 1.64k| const auto m = (pt.x() - z2).mul3() * (pt.x() + z2); 369| | 370| | // Remaining cost: 3M + 3S + 3A + 2*2 + 1*4 + 1*8 371| 1.64k| const auto y2 = pt.y().square(); 372| 1.64k| const auto s = pt.x().mul4() * y2; 373| 1.64k| const auto nx = m.square() - s.mul2(); 374| 1.64k| const auto ny = m * (s - nx) - y2.square().mul8(); 375| 1.64k| const auto nz = pt.y().mul2() * pt.z(); 376| | 377| 1.64k| return ProjectivePoint(nx, ny, nz); 378| 1.64k|} pcurves_secp521r1.cpp:_ZN5Botan9point_addINS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS5_6ParamsES6_E11FieldParamsEEEEES8_EESC_EET_RKSE_SG_: 187| 1.45k|inline constexpr ProjectivePoint point_add(const ProjectivePoint& a, const ProjectivePoint& b) { 188| 1.45k| const auto a_is_identity = a.is_identity(); 189| 1.45k| const auto b_is_identity = b.is_identity(); 190| | 191| 1.45k| const auto Z1Z1 = a.z().square(); 192| 1.45k| const auto Z2Z2 = b.z().square(); 193| 1.45k| const auto U1 = a.x() * Z2Z2; 194| 1.45k| const auto U2 = b.x() * Z1Z1; 195| 1.45k| const auto S1 = a.y() * b.z() * Z2Z2; 196| 1.45k| const auto S2 = b.y() * a.z() * Z1Z1; 197| 1.45k| const auto H = U2 - U1; 198| 1.45k| const auto r = S2 - S1; 199| | 200| | /* Risky conditional 201| | * 202| | * This implementation uses projective coordinates, which do not have an efficient complete 203| | * addition formula. We rely on the design of the multiplication algorithms to avoid doublings. 204| | * 205| | * This conditional only comes into play for the actual doubling case, not x + (-x) which 206| | * is another exceptional case in some circumstances. Here if a == -b then H == 0 && r != 0, 207| | * in which case at the end we'll set z to a.z * b.z * H = 0, resulting in the correct 208| | * output (the identity element) 209| | */ 210| 1.45k| if((r.is_zero() && H.is_zero() && !(a_is_identity && b_is_identity)).as_bool()) { ------------------ | Branch (210:7): [True: 0, False: 1.45k] ------------------ 211| 0| return a.dbl(); 212| 0| } 213| | 214| 1.45k| const auto HH = H.square(); 215| 1.45k| const auto HHH = H * HH; 216| 1.45k| const auto V = U1 * HH; 217| 1.45k| const auto t2 = r.square(); 218| 1.45k| const auto t3 = V + V; 219| 1.45k| const auto t4 = t2 - HHH; 220| 1.45k| auto X3 = t4 - t3; 221| 1.45k| const auto t5 = V - X3; 222| 1.45k| const auto t6 = S1 * HHH; 223| 1.45k| const auto t7 = r * t5; 224| 1.45k| auto Y3 = t7 - t6; 225| 1.45k| const auto t8 = b.z() * H; 226| 1.45k| auto Z3 = a.z() * t8; 227| | 228| | // if a is identity then return b 229| 1.45k| FieldElement::conditional_assign(X3, Y3, Z3, a_is_identity, b.x(), b.y(), b.z()); 230| | 231| | // if b is identity then return a 232| 1.45k| FieldElement::conditional_assign(X3, Y3, Z3, b_is_identity, a.x(), a.y(), a.z()); 233| | 234| 1.45k| return ProjectivePoint(X3, Y3, Z3); 235| 1.45k|} pcurves_secp521r1.cpp:_ZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEE: 107| 1|auto to_affine_batch(std::span projective) { 108| 1| using AffinePoint = typename C::AffinePoint; 109| | 110| 1| const size_t N = projective.size(); 111| 1| std::vector affine; 112| 1| affine.reserve(N); 113| | 114| 1| CT::Choice any_identity = CT::Choice::no(); 115| | 116| 3.10k| for(const auto& pt : projective) { ------------------ | Branch (116:23): [True: 3.10k, False: 1] ------------------ 117| 3.10k| any_identity = any_identity || pt.is_identity(); 118| 3.10k| } 119| | 120| | // Conditional acceptable: N is public. State of points is not necessarily 121| | // public, but we don't leak which point was the identity. In practice with 122| | // the algorithms currently in use, the only time an identity can occur is 123| | // during mul2 where the two points g/h have a small relation (ie h = g*k for 124| | // some k < 16) 125| | 126| 1| if(N <= 2 || any_identity.as_bool()) { ------------------ | Branch (126:7): [True: 0, False: 1] | Branch (126:17): [True: 0, False: 1] ------------------ 127| | // If there are identity elements, using the batch inversion gets 128| | // tricky. It can be done, but this should be a rare situation so 129| | // just punt to the serial conversion if it occurs 130| 0| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (130:25): [True: 0, False: 0] ------------------ 131| 0| affine.push_back(to_affine(projective[i])); 132| 0| } 133| 1| } else { 134| 1| std::vector c; 135| 1| c.reserve(N); 136| | 137| | /* 138| | Batch projective->affine using Montgomery's trick 139| | 140| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 141| | (Hankerson, Menezes, Vanstone) 142| | */ 143| | 144| 1| c.push_back(projective[0].z()); 145| 3.10k| for(size_t i = 1; i != N; ++i) { ------------------ | Branch (145:25): [True: 3.10k, False: 1] ------------------ 146| 3.10k| c.push_back(c[i - 1] * projective[i].z()); 147| 3.10k| } 148| | 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| 1| } else { 153| 1| return invert_field_element(c[N - 1]); 154| 1| } 155| 1| }(); 156| | 157| 3.10k| for(size_t i = N - 1; i > 0; --i) { ------------------ | Branch (157:29): [True: 3.10k, False: 1] ------------------ 158| 3.10k| const auto& p = projective[i]; 159| | 160| 3.10k| const auto z_inv = s_inv * c[i - 1]; 161| 3.10k| const auto z2_inv = z_inv.square(); 162| 3.10k| const auto z3_inv = z_inv * z2_inv; 163| | 164| 3.10k| s_inv = s_inv * p.z(); 165| | 166| 3.10k| affine.push_back(AffinePoint(p.x() * z2_inv, p.y() * z3_inv)); 167| 3.10k| } 168| | 169| 1| const auto z2_inv = s_inv.square(); 170| 1| const auto z3_inv = s_inv * z2_inv; 171| 1| affine.push_back(AffinePoint(projective[0].x() * z2_inv, projective[0].y() * z3_inv)); 172| 1| std::reverse(affine.begin(), affine.end()); 173| 1| return affine; 174| 1| } 175| | 176| 0| return affine; 177| 1|} pcurves_secp521r1.cpp:_ZZN5Botan15to_affine_batchINS_6PCurve12_GLOBAL__N_19secp521r15CurveELb1EEEDaNSt3__14spanIKNT_15ProjectivePointELm18446744073709551615EEEENKUlvE_clEv: 149| 1| auto s_inv = [&]() { 150| 1| if constexpr(VariableTime) { 151| 1| return c[N - 1].invert_vartime(); 152| | } else { 153| | return invert_field_element(c[N - 1]); 154| | } 155| 1| }(); _ZNK5Botan6PCurve22GenericPrimeOrderCurve7_paramsEv: 113| 114k| const GenericCurveParams& _params() const { return *m_params; } pcurves_secp224r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp224r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_12Secp224r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1405| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1016| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1017| | /* 1018| | * If the point is the identity element (x=0, y=0) then instead of 1019| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1020| | * encoding of (0, 1, 0) 1021| | * 1022| | * Which we can achieve by a conditional swap of y and z if the 1023| | * affine point is the identity. 1024| | */ 1025| | 1026| 1| auto x = pt.x(); 1027| 1| auto y = pt.y(); 1028| 1| auto z = FieldElement::one(); 1029| | 1030| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1031| | 1032| 1| return ProjectiveCurvePoint(x, y, z); 1033| 1| } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 971| 2| constexpr const FieldElement& x() const { return m_x; } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 976| 2| constexpr const FieldElement& y() const { return m_y; } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 200| 1| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 898| 40.7k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 410| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 411| 1| const W mask = cond.into_bitmask(); 412| | 413| 5| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (413:28): [True: 4, False: 1] ------------------ 414| 4| auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 415| 4| auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 416| 4| x.m_val[i] = nx; 417| 4| y.m_val[i] = ny; 418| 4| } 419| 1| } pcurves_secp224r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 928| 1| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv: 225| 3.95k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1056| 1.37k| m_x(x), m_y(y), m_z(z) {} pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1121| 731| constexpr Self dbl() const { 1122| 731| if constexpr(Self::A_is_minus_3) { 1123| 731| return dbl_a_minus_3(*this); 1124| | } else if constexpr(Self::A_is_zero) { 1125| | return dbl_a_zero(*this); 1126| | } else { 1127| | return dbl_generic(*this, A); 1128| | } 1129| 731| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1172| 12.0k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 426| 6.88k| constexpr BOTAN_FORCE_INLINE Self square() const { 427| 6.88k| std::array z; // NOLINT(*-member-init) 428| 6.88k| comba_sqr(z.data(), this->data()); 429| 6.88k| return Self(Rep::redc(z)); 430| 6.88k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 896| 45.1k| constexpr const W* data() const { return m_val.data(); } pcurves_secp224r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 346| 18.9k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 347| 18.9k| std::array z; // NOLINT(*-member-init) 348| 18.9k| comba_mul(z.data(), a.data(), b.data()); 349| 18.9k| return Self(Rep::redc(z)); 350| 18.9k| } pcurves_secp224r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 281| 6.79k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 282| 6.79k| std::array r; // NOLINT(*-member-init) 283| 6.79k| W carry = 0; 284| 33.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (284:28): [True: 27.1k, False: 6.79k] ------------------ 285| 27.1k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 286| 27.1k| } 287| | 288| 6.79k| const auto mask = CT::Mask::expand(carry).value(); 289| | 290| 6.79k| carry = 0; 291| | 292| 33.9k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (292:28): [True: 27.1k, False: 6.79k] ------------------ 293| 27.1k| r[i] = word_add(r[i], P[i] & mask, &carry); 294| 27.1k| } 295| | 296| 6.79k| return Self(r); 297| 6.79k| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1162| 6.14k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 335| 731| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp224r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 265| 2.26k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 266| 2.26k| std::array t; // NOLINT(*-member-init) 267| | 268| 2.26k| W carry = 0; 269| 11.3k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (269:28): [True: 9.05k, False: 2.26k] ------------------ 270| 9.05k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 271| 9.05k| } 272| | 273| 2.26k| std::array r; // NOLINT(*-member-init) 274| 2.26k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 275| 2.26k| return Self(r); 276| 2.26k| } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1167| 5.41k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 338| 731| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 325| 5.84k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 326| 5.84k| std::array t = value(); 327| 5.84k| const W carry = shift_left<1>(t); 328| | 329| 5.84k| std::array r; // NOLINT(*-member-init) 330| 5.84k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 331| 5.84k| return Self(r); 332| 5.84k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 894| 5.84k| constexpr const std::array& value() const { return m_val; } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 341| 731| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp224r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1064| 645| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp224r1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1103| 645| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp224r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv: 1082| 2.66k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 395| 1.29k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 396| 1.29k| const W mask = cond.into_bitmask(); 397| | 398| 6.45k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (398:28): [True: 5.16k, False: 1.29k] ------------------ 399| 5.16k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 400| 5.16k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 401| 5.16k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 402| 5.16k| } 403| 1.29k| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 598| 1| constexpr Self invert_vartime() const { 599| | // Conditional ok: this function is variable time 600| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (600:13): [True: 0, False: 1] ------------------ 601| 0| return Self::zero(); 602| 0| } 603| | 604| 1| auto x = Self(std::array{1}); // 1 in standard domain 605| 1| auto b = Self(this->to_words()); // *this in standard domain 606| | 607| | // First loop iteration 608| 1| Self::_invert_vartime_div2_helper(b, x); 609| | 610| 1| auto a = b.negate(); 611| | // y += x but y is zero at the outset 612| 1| auto y = x; 613| | 614| | // First half of second loop iteration 615| 1| Self::_invert_vartime_div2_helper(a, y); 616| | 617| 153| for(;;) { 618| | // Conditional ok: this function is variable time 619| 153| if(a.m_val == b.m_val) { ------------------ | Branch (619:16): [True: 1, False: 152] ------------------ 620| | // At this point it should be that a == b == 1 621| 1| auto r = y.negate(); 622| | 623| | // Convert back to Montgomery if required 624| 1| r.m_val = Rep::to_rep(r.m_val); 625| 1| return r; 626| 1| } 627| | 628| 152| auto nx = x + y; 629| | 630| | /* 631| | * Otherwise either b > a or a > b 632| | * 633| | * If b > a we want to set b to b - a 634| | * Otherwise we want to set a to a - b 635| | * 636| | * Compute r = b - a and check if it underflowed 637| | * If it did not then we are in the b > a path 638| | */ 639| 152| std::array r; // NOLINT(*-member-init) 640| 152| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 641| | 642| | // Conditional ok: this function is variable time 643| 152| if(carry == 0) { ------------------ | Branch (643:16): [True: 81, False: 71] ------------------ 644| | // b > a 645| 81| b.m_val = r; 646| 81| x = nx; 647| 81| Self::_invert_vartime_div2_helper(b, x); 648| 81| } else { 649| | // We know this can't underflow because a > b 650| 71| bigint_sub3(r.data(), a.data(), N, b.data(), N); 651| 71| a.m_val = r; 652| 71| y = nx; 653| 71| Self::_invert_vartime_div2_helper(a, y); 654| 71| } 655| 152| } 656| 1| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 734| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 547| 154| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 548| 154| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 549| | 550| | // Conditional ok: this function is variable time 551| 479| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (551:16): [True: 325, False: 154] ------------------ 552| 325| shift_right<1>(a.m_val); 553| | 554| 325| const W borrow = shift_right<1>(x.m_val); 555| | 556| | // Conditional ok: this function is variable time 557| 325| if(borrow) { ------------------ | Branch (557:16): [True: 200, False: 125] ------------------ 558| 200| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 559| 200| } 560| 325| } 561| 154| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 452| 2| constexpr Self negate() const { 453| 2| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 454| | 455| 2| std::array r; // NOLINT(*-member-init) 456| 2| W carry = 0; 457| 10| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (457:28): [True: 8, False: 2] ------------------ 458| 8| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 459| 8| } 460| | 461| 2| return Self(r); 462| 2| } pcurves_secp224r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 917| 1.37k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 792| 4| static std::optional deserialize(std::span bytes) { 793| | // Conditional ok: input length is public 794| 4| if(bytes.size() != Self::BYTES) { ------------------ | Branch (794:13): [True: 0, False: 4] ------------------ 795| 0| return {}; 796| 0| } 797| | 798| 4| const auto words = bytes_to_words(bytes.first()); 799| | 800| | // Conditional acceptable: std::optional is implicitly not constant time 801| 4| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (801:13): [True: 0, False: 4] ------------------ 802| 0| return {}; 803| 0| } 804| | 805| | // Safe because we checked above that words is an integer < P 806| 4| return Self::from_words(words); 807| 4| } pcurves_secp224r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm4EEESA_NSt3__15arrayImXT_EEE: 211| 4| static constexpr Self from_words(std::array w) { 212| 4| if constexpr(L == N) { 213| 4| return Self(Rep::to_rep(w)); 214| | } else { 215| | static_assert(L < N); 216| | std::array ew = {}; 217| | copy_mem(std::span{ew}.template first(), w); 218| | return Self(Rep::to_rep(ew)); 219| | } 220| 4| } pcurves_secp224r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_: 722| 2| constexpr CT::Choice operator==(const Self& other) const { 723| 2| return CT::is_equal(this->data(), other.data(), N).as_choice(); 724| 2| } pcurves_secp224r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp224r16ParamsENS3_12Secp224r1RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1275| 2| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } pcurves_secp256k1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp256k15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_12Secp256k1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1405| 1| m_table(basemul_booth_setup(p, BlindedScalar::Bits + 1)) {} pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11from_affineERKNS_16AffineCurvePointISB_EE: 1016| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1017| | /* 1018| | * If the point is the identity element (x=0, y=0) then instead of 1019| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1020| | * encoding of (0, 1, 0) 1021| | * 1022| | * Which we can achieve by a conditional swap of y and z if the 1023| | * affine point is the identity. 1024| | */ 1025| | 1026| 1| auto x = pt.x(); 1027| 1| auto y = pt.y(); 1028| 1| auto z = FieldElement::one(); 1029| | 1030| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1031| | 1032| 1| return ProjectiveCurvePoint(x, y, z); 1033| 1| } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 971| 2| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 976| 2| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 200| 1| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm4EEE: 898| 43.8k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 410| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 411| 1| const W mask = cond.into_bitmask(); 412| | 413| 5| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (413:28): [True: 4, False: 1] ------------------ 414| 4| auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 415| 4| auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 416| 4| x.m_val[i] = nx; 417| 4| y.m_val[i] = ny; 418| 4| } 419| 1| } pcurves_secp256k1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 928| 1| constexpr CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE7is_zeroEv: 225| 4.51k| constexpr CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_val.size()).as_choice(); } pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EC2ERKSB_SE_SE_: 1056| 1.56k| m_x(x), m_y(y), m_z(z) {} pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1121| 833| constexpr Self dbl() const { 1122| | if constexpr(Self::A_is_minus_3) { 1123| | return dbl_a_minus_3(*this); 1124| 833| } else if constexpr(Self::A_is_zero) { 1125| 833| return dbl_a_zero(*this); 1126| | } else { 1127| | return dbl_generic(*this, A); 1128| | } 1129| 833| } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1162| 6.17k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 426| 7.84k| constexpr BOTAN_FORCE_INLINE Self square() const { 427| 7.84k| std::array z; // NOLINT(*-member-init) 428| 7.84k| comba_sqr(z.data(), this->data()); 429| 7.84k| return Self(Rep::redc(z)); 430| 7.84k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 896| 49.7k| constexpr const W* data() const { return m_val.data(); } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 335| 833| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp256k1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 265| 1.74k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 266| 1.74k| std::array t; // NOLINT(*-member-init) 267| | 268| 1.74k| W carry = 0; 269| 8.71k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (269:28): [True: 6.97k, False: 1.74k] ------------------ 270| 6.97k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 271| 6.97k| } 272| | 273| 1.74k| std::array r; // NOLINT(*-member-init) 274| 1.74k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 275| 1.74k| return Self(r); 276| 1.74k| } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1167| 6.17k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp256k1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 346| 20.7k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 347| 20.7k| std::array z; // NOLINT(*-member-init) 348| 20.7k| comba_mul(z.data(), a.data(), b.data()); 349| 20.7k| return Self(Rep::redc(z)); 350| 20.7k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 338| 833| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp256k1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 281| 6.90k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 282| 6.90k| std::array r; // NOLINT(*-member-init) 283| 6.90k| W carry = 0; 284| 34.5k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (284:28): [True: 27.6k, False: 6.90k] ------------------ 285| 27.6k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 286| 27.6k| } 287| | 288| 6.90k| const auto mask = CT::Mask::expand(carry).value(); 289| | 290| 6.90k| carry = 0; 291| | 292| 34.5k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (292:28): [True: 27.6k, False: 6.90k] ------------------ 293| 27.6k| r[i] = word_add(r[i], P[i] & mask, &carry); 294| 27.6k| } 295| | 296| 6.90k| return Self(r); 297| 6.90k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 325| 6.66k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 326| 6.66k| std::array t = value(); 327| 6.66k| const W carry = shift_left<1>(t); 328| | 329| 6.66k| std::array r; // NOLINT(*-member-init) 330| 6.66k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 331| 6.66k| return Self(r); 332| 6.66k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 894| 6.66k| constexpr const std::array& value() const { return m_val; } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 341| 833| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1172| 12.8k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp256k1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1064| 735| friend constexpr Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } pcurves_secp256k1.cpp:_ZN5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3addERKSC_SE_: 1103| 735| constexpr static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_secp256k1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E11is_identityEv: 1082| 3.03k| constexpr CT::Choice is_identity() const { return z().is_zero(); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE18conditional_assignERSA_SB_SB_NS_2CT6ChoiceERKSA_SF_SF_: 395| 1.47k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 396| 1.47k| const W mask = cond.into_bitmask(); 397| | 398| 7.35k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (398:28): [True: 5.88k, False: 1.47k] ------------------ 399| 5.88k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 400| 5.88k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 401| 5.88k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 402| 5.88k| } 403| 1.47k| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 598| 1| constexpr Self invert_vartime() const { 599| | // Conditional ok: this function is variable time 600| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (600:13): [True: 0, False: 1] ------------------ 601| 0| return Self::zero(); 602| 0| } 603| | 604| 1| auto x = Self(std::array{1}); // 1 in standard domain 605| 1| auto b = Self(this->to_words()); // *this in standard domain 606| | 607| | // First loop iteration 608| 1| Self::_invert_vartime_div2_helper(b, x); 609| | 610| 1| auto a = b.negate(); 611| | // y += x but y is zero at the outset 612| 1| auto y = x; 613| | 614| | // First half of second loop iteration 615| 1| Self::_invert_vartime_div2_helper(a, y); 616| | 617| 176| for(;;) { 618| | // Conditional ok: this function is variable time 619| 176| if(a.m_val == b.m_val) { ------------------ | Branch (619:16): [True: 1, False: 175] ------------------ 620| | // At this point it should be that a == b == 1 621| 1| auto r = y.negate(); 622| | 623| | // Convert back to Montgomery if required 624| 1| r.m_val = Rep::to_rep(r.m_val); 625| 1| return r; 626| 1| } 627| | 628| 175| auto nx = x + y; 629| | 630| | /* 631| | * Otherwise either b > a or a > b 632| | * 633| | * If b > a we want to set b to b - a 634| | * Otherwise we want to set a to a - b 635| | * 636| | * Compute r = b - a and check if it underflowed 637| | * If it did not then we are in the b > a path 638| | */ 639| 175| std::array r; // NOLINT(*-member-init) 640| 175| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 641| | 642| | // Conditional ok: this function is variable time 643| 175| if(carry == 0) { ------------------ | Branch (643:16): [True: 105, False: 70] ------------------ 644| | // b > a 645| 105| b.m_val = r; 646| 105| x = nx; 647| 105| Self::_invert_vartime_div2_helper(b, x); 648| 105| } else { 649| | // We know this can't underflow because a > b 650| 70| bigint_sub3(r.data(), a.data(), N, b.data(), N); 651| 70| a.m_val = r; 652| 70| y = nx; 653| 70| Self::_invert_vartime_div2_helper(a, y); 654| 70| } 655| 175| } 656| 1| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 734| 1| constexpr std::array to_words() const { return Rep::from_rep(m_val); } pcurves_secp256k1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE27_invert_vartime_div2_helperERSA_SB_: 547| 177| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 548| 177| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 549| | 550| | // Conditional ok: this function is variable time 551| 541| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (551:16): [True: 364, False: 177] ------------------ 552| 364| shift_right<1>(a.m_val); 553| | 554| 364| const W borrow = shift_right<1>(x.m_val); 555| | 556| | // Conditional ok: this function is variable time 557| 364| if(borrow) { ------------------ | Branch (557:16): [True: 186, False: 178] ------------------ 558| 186| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 559| 186| } 560| 364| } 561| 177| } pcurves_secp256k1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 452| 2| constexpr Self negate() const { 453| 2| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 454| | 455| 2| std::array r; // NOLINT(*-member-init) 456| 2| W carry = 0; 457| 10| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (457:28): [True: 8, False: 2] ------------------ 458| 8| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 459| 8| } 460| | 461| 2| return Self(r); 462| 2| } pcurves_secp256k1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 917| 1.56k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp384r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS2_12Secp384r1RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1405| 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: 1016| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1017| | /* 1018| | * If the point is the identity element (x=0, y=0) then instead of 1019| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1020| | * encoding of (0, 1, 0) 1021| | * 1022| | * Which we can achieve by a conditional swap of y and z if the 1023| | * affine point is the identity. 1024| | */ 1025| | 1026| 1| auto x = pt.x(); 1027| 1| auto y = pt.y(); 1028| 1| auto z = FieldElement::one(); 1029| | 1030| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1031| | 1032| 1| return ProjectiveCurvePoint(x, y, z); 1033| 1| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1xEv: 971| 2| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE1yEv: 976| 2| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE3oneEv: 200| 1| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEC2ENSt3__15arrayImLm6EEE: 898| 69.0k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp384r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 410| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 411| 1| const W mask = cond.into_bitmask(); 412| | 413| 7| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (413:28): [True: 6, False: 1] ------------------ 414| 6| auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 415| 6| auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 416| 6| x.m_val[i] = nx; 417| 6| y.m_val[i] = ny; 418| 6| } 419| 1| } pcurves_secp384r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEE11is_identityEv: 928| 1| 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: 225| 6.71k| 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_: 1056| 2.33k| m_x(x), m_y(y), m_z(z) {} pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E3dblEv: 1121| 1.24k| constexpr Self dbl() const { 1122| 1.24k| if constexpr(Self::A_is_minus_3) { 1123| 1.24k| return dbl_a_minus_3(*this); 1124| | } else if constexpr(Self::A_is_zero) { 1125| | return dbl_a_zero(*this); 1126| | } else { 1127| | return dbl_generic(*this, A); 1128| | } 1129| 1.24k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1zEv: 1172| 20.4k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6squareEv: 426| 11.6k| constexpr BOTAN_FORCE_INLINE Self square() const { 427| 11.6k| std::array z; // NOLINT(*-member-init) 428| 11.6k| comba_sqr(z.data(), this->data()); 429| 11.6k| return Self(Rep::redc(z)); 430| 11.6k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4dataEv: 896| 76.6k| constexpr const W* data() const { return m_val.data(); } pcurves_secp384r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 346| 32.1k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 347| 32.1k| std::array z; // NOLINT(*-member-init) 348| 32.1k| comba_mul(z.data(), a.data(), b.data()); 349| 32.1k| return Self(Rep::redc(z)); 350| 32.1k| } pcurves_secp384r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 281| 11.5k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 282| 11.5k| std::array r; // NOLINT(*-member-init) 283| 11.5k| W carry = 0; 284| 80.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (284:28): [True: 69.2k, False: 11.5k] ------------------ 285| 69.2k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 286| 69.2k| } 287| | 288| 11.5k| const auto mask = CT::Mask::expand(carry).value(); 289| | 290| 11.5k| carry = 0; 291| | 292| 80.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (292:28): [True: 69.2k, False: 11.5k] ------------------ 293| 69.2k| r[i] = word_add(r[i], P[i] & mask, &carry); 294| 69.2k| } 295| | 296| 11.5k| return Self(r); 297| 11.5k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1xEv: 1162| 10.4k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul3Ev: 335| 1.24k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEEESC_: 265| 3.82k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 266| 3.82k| std::array t; // NOLINT(*-member-init) 267| | 268| 3.82k| W carry = 0; 269| 26.7k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (269:28): [True: 22.9k, False: 3.82k] ------------------ 270| 22.9k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 271| 22.9k| } 272| | 273| 3.82k| std::array r; // NOLINT(*-member-init) 274| 3.82k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 275| 3.82k| return Self(r); 276| 3.82k| } pcurves_secp384r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_E1yEv: 1167| 9.19k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul4Ev: 338| 1.24k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul2Ev: 325| 9.92k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 326| 9.92k| std::array t = value(); 327| 9.92k| const W carry = shift_left<1>(t); 328| | 329| 9.92k| std::array r; // NOLINT(*-member-init) 330| 9.92k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 331| 9.92k| return Self(r); 332| 9.92k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE5valueEv: 894| 9.92k| constexpr const std::array& value() const { return m_val; } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE4mul8Ev: 341| 1.24k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp384r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEES7_EESE_: 1064| 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_: 1103| 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: 1082| 4.52k| 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_: 395| 2.19k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 396| 2.19k| const W mask = cond.into_bitmask(); 397| | 398| 15.3k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (398:28): [True: 13.1k, False: 2.19k] ------------------ 399| 13.1k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 400| 13.1k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 401| 13.1k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 402| 13.1k| } 403| 2.19k| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE14invert_vartimeEv: 598| 1| constexpr Self invert_vartime() const { 599| | // Conditional ok: this function is variable time 600| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (600:13): [True: 0, False: 1] ------------------ 601| 0| return Self::zero(); 602| 0| } 603| | 604| 1| auto x = Self(std::array{1}); // 1 in standard domain 605| 1| auto b = Self(this->to_words()); // *this in standard domain 606| | 607| | // First loop iteration 608| 1| Self::_invert_vartime_div2_helper(b, x); 609| | 610| 1| auto a = b.negate(); 611| | // y += x but y is zero at the outset 612| 1| auto y = x; 613| | 614| | // First half of second loop iteration 615| 1| Self::_invert_vartime_div2_helper(a, y); 616| | 617| 252| for(;;) { 618| | // Conditional ok: this function is variable time 619| 252| if(a.m_val == b.m_val) { ------------------ | Branch (619:16): [True: 1, False: 251] ------------------ 620| | // At this point it should be that a == b == 1 621| 1| auto r = y.negate(); 622| | 623| | // Convert back to Montgomery if required 624| 1| r.m_val = Rep::to_rep(r.m_val); 625| 1| return r; 626| 1| } 627| | 628| 251| auto nx = x + y; 629| | 630| | /* 631| | * Otherwise either b > a or a > b 632| | * 633| | * If b > a we want to set b to b - a 634| | * Otherwise we want to set a to a - b 635| | * 636| | * Compute r = b - a and check if it underflowed 637| | * If it did not then we are in the b > a path 638| | */ 639| 251| std::array r; // NOLINT(*-member-init) 640| 251| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 641| | 642| | // Conditional ok: this function is variable time 643| 251| if(carry == 0) { ------------------ | Branch (643:16): [True: 118, False: 133] ------------------ 644| | // b > a 645| 118| b.m_val = r; 646| 118| x = nx; 647| 118| Self::_invert_vartime_div2_helper(b, x); 648| 133| } else { 649| | // We know this can't underflow because a > b 650| 133| bigint_sub3(r.data(), a.data(), N, b.data(), N); 651| 133| a.m_val = r; 652| 133| y = nx; 653| 133| Self::_invert_vartime_div2_helper(a, y); 654| 133| } 655| 251| } 656| 1| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE8to_wordsEv: 734| 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_: 547| 253| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 548| 253| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 549| | 550| | // Conditional ok: this function is variable time 551| 809| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (551:16): [True: 556, False: 253] ------------------ 552| 556| shift_right<1>(a.m_val); 553| | 554| 556| const W borrow = shift_right<1>(x.m_val); 555| | 556| | // Conditional ok: this function is variable time 557| 556| if(borrow) { ------------------ | Branch (557:16): [True: 248, False: 308] ------------------ 558| 248| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 559| 248| } 560| 556| } 561| 253| } pcurves_secp384r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS2_9secp384r16ParamsES3_E11FieldParamsEEEE6negateEv: 452| 2| constexpr Self negate() const { 453| 2| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 454| | 455| 2| std::array r; // NOLINT(*-member-init) 456| 2| W carry = 0; 457| 14| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (457:28): [True: 12, False: 2] ------------------ 458| 12| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 459| 12| } 460| | 461| 2| return Self(r); 462| 2| } pcurves_secp384r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS3_9secp384r16ParamsES4_E11FieldParamsEEEEEEC2ERKSB_SE_: 917| 2.33k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp521r1.cpp:_ZN5Botan23PrecomputedBaseMulTableINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEC2ERKNS_16AffineCurvePointINS_6IntModINS3_7P521RepINS_13EllipticCurveINS3_6ParamsES8_E11FieldParamsEEEEEEE: 1405| 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: 1016| 1| static constexpr Self from_affine(const AffinePoint& pt) { 1017| | /* 1018| | * If the point is the identity element (x=0, y=0) then instead of 1019| | * creating (x, y, 1) = (0, 0, 1) we want our projective identity 1020| | * encoding of (0, 1, 0) 1021| | * 1022| | * Which we can achieve by a conditional swap of y and z if the 1023| | * affine point is the identity. 1024| | */ 1025| | 1026| 1| auto x = pt.x(); 1027| 1| auto y = pt.y(); 1028| 1| auto z = FieldElement::one(); 1029| | 1030| 1| FieldElement::conditional_swap(pt.is_identity(), y, z); 1031| | 1032| 1| return ProjectiveCurvePoint(x, y, z); 1033| 1| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1xEv: 971| 2| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE1yEv: 976| 2| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE3oneEv: 200| 1| static constexpr Self one() { return Self(Rep::one()); } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEC2ENSt3__15arrayImLm9EEE: 898| 91.9k| explicit constexpr IntMod(std::array v) : m_val(v) {} pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE16conditional_swapENS_2CT6ChoiceERSA_SD_: 410| 1| static constexpr void conditional_swap(CT::Choice cond, Self& x, Self& y) { 411| 1| const W mask = cond.into_bitmask(); 412| | 413| 10| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (413:28): [True: 9, False: 1] ------------------ 414| 9| auto nx = Botan::choose(mask, y.m_val[i], x.m_val[i]); 415| 9| auto ny = Botan::choose(mask, x.m_val[i], y.m_val[i]); 416| 9| x.m_val[i] = nx; 417| 9| y.m_val[i] = ny; 418| 9| } 419| 1| } pcurves_secp521r1.cpp:_ZNK5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEE11is_identityEv: 928| 1| 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: 225| 8.92k| 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_: 1056| 3.10k| m_x(x), m_y(y), m_z(z) {} pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E3dblEv: 1121| 1.64k| constexpr Self dbl() const { 1122| 1.64k| if constexpr(Self::A_is_minus_3) { 1123| 1.64k| return dbl_a_minus_3(*this); 1124| | } else if constexpr(Self::A_is_zero) { 1125| | return dbl_a_zero(*this); 1126| | } else { 1127| | return dbl_generic(*this, A); 1128| | } 1129| 1.64k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1zEv: 1172| 27.1k| constexpr const FieldElement& z() const { return m_z; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6squareEv: 426| 15.5k| constexpr BOTAN_FORCE_INLINE Self square() const { 427| 15.5k| std::array z; // NOLINT(*-member-init) 428| 15.5k| comba_sqr(z.data(), this->data()); 429| 15.5k| return Self(Rep::redc(z)); 430| 15.5k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4dataEv: 896| 102k| constexpr const W* data() const { return m_val.data(); } pcurves_secp521r1.cpp:_ZN5BotanmlERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 346| 42.6k| friend constexpr BOTAN_FORCE_INLINE Self operator*(const Self& a, const Self& b) { 347| 42.6k| std::array z; // NOLINT(*-member-init) 348| 42.6k| comba_mul(z.data(), a.data(), b.data()); 349| 42.6k| return Self(Rep::redc(z)); 350| 42.6k| } pcurves_secp521r1.cpp:_ZN5BotanmiERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 281| 15.3k| friend constexpr BOTAN_FORCE_INLINE Self operator-(const Self& a, const Self& b) { 282| 15.3k| std::array r; // NOLINT(*-member-init) 283| 15.3k| W carry = 0; 284| 153k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (284:28): [True: 137k, False: 15.3k] ------------------ 285| 137k| r[i] = word_sub(a.m_val[i], b.m_val[i], &carry); 286| 137k| } 287| | 288| 15.3k| const auto mask = CT::Mask::expand(carry).value(); 289| | 290| 15.3k| carry = 0; 291| | 292| 153k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (292:28): [True: 137k, False: 15.3k] ------------------ 293| 137k| r[i] = word_add(r[i], P[i] & mask, &carry); 294| 137k| } 295| | 296| 15.3k| return Self(r); 297| 15.3k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1xEv: 1162| 13.8k| constexpr const FieldElement& x() const { return m_x; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul3Ev: 335| 1.64k| constexpr inline Self mul3() const { return mul2() + (*this); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEESC_: 265| 5.14k| friend constexpr BOTAN_FORCE_INLINE Self operator+(const Self& a, const Self& b) { 266| 5.14k| std::array t; // NOLINT(*-member-init) 267| | 268| 5.14k| W carry = 0; 269| 51.4k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (269:28): [True: 46.3k, False: 5.14k] ------------------ 270| 46.3k| t[i] = word_add(a.m_val[i], b.m_val[i], &carry); 271| 46.3k| } 272| | 273| 5.14k| std::array r; // NOLINT(*-member-init) 274| 5.14k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 275| 5.14k| return Self(r); 276| 5.14k| } pcurves_secp521r1.cpp:_ZNK5Botan20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_E1yEv: 1167| 12.2k| constexpr const FieldElement& y() const { return m_y; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul4Ev: 338| 1.64k| constexpr inline Self mul4() const { return mul2().mul2(); } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul2Ev: 325| 13.1k| constexpr BOTAN_FORCE_INLINE Self mul2() const { 326| 13.1k| std::array t = value(); 327| 13.1k| const W carry = shift_left<1>(t); 328| | 329| 13.1k| std::array r; // NOLINT(*-member-init) 330| 13.1k| bigint_monty_maybe_sub(r.data(), carry, t.data(), P.data()); 331| 13.1k| return Self(r); 332| 13.1k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE5valueEv: 894| 13.1k| constexpr const std::array& value() const { return m_val; } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE4mul8Ev: 341| 1.64k| constexpr inline Self mul8() const { return mul2().mul2().mul2(); } pcurves_secp521r1.cpp:_ZN5BotanplERKNS_20ProjectiveCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEES7_EESE_: 1064| 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_: 1103| 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: 1082| 6.01k| 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_: 395| 2.91k| Self& x, Self& y, Self& z, CT::Choice cond, const Self& nx, const Self& ny, const Self& nz) { 396| 2.91k| const W mask = cond.into_bitmask(); 397| | 398| 29.1k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (398:28): [True: 26.1k, False: 2.91k] ------------------ 399| 26.1k| x.m_val[i] = Botan::choose(mask, nx.m_val[i], x.m_val[i]); 400| 26.1k| y.m_val[i] = Botan::choose(mask, ny.m_val[i], y.m_val[i]); 401| 26.1k| z.m_val[i] = Botan::choose(mask, nz.m_val[i], z.m_val[i]); 402| 26.1k| } 403| 2.91k| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE14invert_vartimeEv: 598| 1| constexpr Self invert_vartime() const { 599| | // Conditional ok: this function is variable time 600| 1| if(this->is_zero().as_bool()) { ------------------ | Branch (600:13): [True: 0, False: 1] ------------------ 601| 0| return Self::zero(); 602| 0| } 603| | 604| 1| auto x = Self(std::array{1}); // 1 in standard domain 605| 1| auto b = Self(this->to_words()); // *this in standard domain 606| | 607| | // First loop iteration 608| 1| Self::_invert_vartime_div2_helper(b, x); 609| | 610| 1| auto a = b.negate(); 611| | // y += x but y is zero at the outset 612| 1| auto y = x; 613| | 614| | // First half of second loop iteration 615| 1| Self::_invert_vartime_div2_helper(a, y); 616| | 617| 350| for(;;) { 618| | // Conditional ok: this function is variable time 619| 350| if(a.m_val == b.m_val) { ------------------ | Branch (619:16): [True: 1, False: 349] ------------------ 620| | // At this point it should be that a == b == 1 621| 1| auto r = y.negate(); 622| | 623| | // Convert back to Montgomery if required 624| 1| r.m_val = Rep::to_rep(r.m_val); 625| 1| return r; 626| 1| } 627| | 628| 349| auto nx = x + y; 629| | 630| | /* 631| | * Otherwise either b > a or a > b 632| | * 633| | * If b > a we want to set b to b - a 634| | * Otherwise we want to set a to a - b 635| | * 636| | * Compute r = b - a and check if it underflowed 637| | * If it did not then we are in the b > a path 638| | */ 639| 349| std::array r; // NOLINT(*-member-init) 640| 349| const word carry = bigint_sub3(r.data(), b.data(), N, a.data(), N); 641| | 642| | // Conditional ok: this function is variable time 643| 349| if(carry == 0) { ------------------ | Branch (643:16): [True: 170, False: 179] ------------------ 644| | // b > a 645| 170| b.m_val = r; 646| 170| x = nx; 647| 170| Self::_invert_vartime_div2_helper(b, x); 648| 179| } else { 649| | // We know this can't underflow because a > b 650| 179| bigint_sub3(r.data(), a.data(), N, b.data(), N); 651| 179| a.m_val = r; 652| 179| y = nx; 653| 179| Self::_invert_vartime_div2_helper(a, y); 654| 179| } 655| 349| } 656| 1| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE8to_wordsEv: 734| 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_: 547| 351| static constexpr void _invert_vartime_div2_helper(Self& a, Self& x) { 548| 351| constexpr auto INV_2 = p_div_2_plus_1(Rep::P); 549| | 550| | // Conditional ok: this function is variable time 551| 1.09k| while((a.m_val[0] & 1) != 1) { ------------------ | Branch (551:16): [True: 742, False: 351] ------------------ 552| 742| shift_right<1>(a.m_val); 553| | 554| 742| const W borrow = shift_right<1>(x.m_val); 555| | 556| | // Conditional ok: this function is variable time 557| 742| if(borrow) { ------------------ | Branch (557:16): [True: 109, False: 633] ------------------ 558| 109| bigint_add2(x.m_val.data(), N, INV_2.data(), N); 559| 109| } 560| 742| } 561| 351| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE6negateEv: 452| 2| constexpr Self negate() const { 453| 2| const W x_is_zero = ~CT::all_zeros(this->data(), N).value(); 454| | 455| 2| std::array r; // NOLINT(*-member-init) 456| 2| W carry = 0; 457| 20| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (457:28): [True: 18, False: 2] ------------------ 458| 18| r[i] = word_sub(P[i] & x_is_zero, m_val[i], &carry); 459| 18| } 460| | 461| 2| return Self(r); 462| 2| } pcurves_secp521r1.cpp:_ZN5Botan16AffineCurvePointINS_6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS4_6ParamsES5_E11FieldParamsEEEEEEC2ERKSB_SE_: 917| 3.10k| constexpr AffineCurvePoint(const FieldElement& x, const FieldElement& y) : m_x(x), m_y(y) {} pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE11deserializeENSt3__14spanIKhLm18446744073709551615EEE: 792| 54| static std::optional deserialize(std::span bytes) { 793| | // Conditional ok: input length is public 794| 54| if(bytes.size() != Self::BYTES) { ------------------ | Branch (794:13): [True: 0, False: 54] ------------------ 795| 0| return {}; 796| 0| } 797| | 798| 54| const auto words = bytes_to_words(bytes.first()); 799| | 800| | // Conditional acceptable: std::optional is implicitly not constant time 801| 54| if(!bigint_ct_is_lt(words.data(), N, P.data(), N).as_bool()) { ------------------ | Branch (801:13): [True: 6, False: 48] ------------------ 802| 6| return {}; 803| 6| } 804| | 805| | // Safe because we checked above that words is an integer < P 806| 48| return Self::from_words(words); 807| 54| } pcurves_secp521r1.cpp:_ZN5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEE10from_wordsILm9EEESA_NSt3__15arrayImXT_EEE: 211| 48| static constexpr Self from_words(std::array w) { 212| 48| if constexpr(L == N) { 213| 48| return Self(Rep::to_rep(w)); 214| | } else { 215| | static_assert(L < N); 216| | std::array ew = {}; 217| | copy_mem(std::span{ew}.template first(), w); 218| | return Self(Rep::to_rep(ew)); 219| | } 220| 48| } pcurves_secp521r1.cpp:_ZNK5Botan6IntModINS_6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS3_6ParamsES4_E11FieldParamsEEEEeqERKSA_: 722| 22| constexpr CT::Choice operator==(const Self& other) const { 723| 22| return CT::is_equal(this->data(), other.data(), N).as_choice(); 724| 22| } pcurves_secp521r1.cpp:_ZN5Botan13EllipticCurveINS_6PCurve12_GLOBAL__N_19secp521r16ParamsENS3_7P521RepEE7x3_ax_bERKNS_6IntModINS5_INS6_11FieldParamsEEEEE: 1275| 22| static constexpr FieldElement x3_ax_b(const FieldElement& x) { return (x.square() + A) * x + B; } _ZN5Botan20scalar_blinding_bitsEm: 41| 1|constexpr size_t scalar_blinding_bits(size_t scalar_bits) { 42| | // For blinding use 1/8 the order length for most curves; for P-521 we round down a bit 43| | // so the masked scalar fits exactly in 9 or 18 words. 44| | 45| 1| if(scalar_bits == 521) { ------------------ | Branch (45:7): [True: 0, False: 1] ------------------ 46| 0| return 55; 47| 1| } else { 48| 1| return scalar_bits / 8; 49| 1| } 50| 1|} pcurves_generic.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_112GenericCurveELm6EEENSt3__16vectorINT_11AffinePointENS4_9allocatorIS7_EEEERKS7_m: 254| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 255| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 256| | 257| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 258| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 259| | 260| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 261| | 262| 1| const size_t TableSize = Windows * WindowElements; 263| | 264| 1| std::vector table; 265| 1| table.reserve(TableSize); 266| | 267| 1| auto accum = C::ProjectivePoint::from_affine(p); 268| | 269| 38| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (269:22): [True: 37, False: 1] ------------------ 270| 37| table.push_back(accum); 271| | 272| 1.18k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (272:25): [True: 1.14k, False: 37] ------------------ 273| | // Conditional ok: loop iteration count is public 274| 1.14k| if(j % 2 == 1) { ------------------ | Branch (274:13): [True: 592, False: 555] ------------------ 275| 592| table.emplace_back(table[i + j / 2].dbl()); 276| 592| } else { 277| 555| table.emplace_back(table[i + j - 1] + table[i]); 278| 555| } 279| 1.14k| } 280| | 281| | // Advance to next window's base: 2^W * current_base 282| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 283| 37| accum = table[i + WindowElements - 1].dbl(); 284| 37| } 285| | 286| | // Variable time batch conversion is fine since generator is public 287| 1| return to_affine_batch(table); 288| 1|} pcurves_secp224r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp224r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 254| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 255| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 256| | 257| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 258| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 259| | 260| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 261| | 262| 1| const size_t TableSize = Windows * WindowElements; 263| | 264| 1| std::vector table; 265| 1| table.reserve(TableSize); 266| | 267| 1| auto accum = C::ProjectivePoint::from_affine(p); 268| | 269| 44| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (269:22): [True: 43, False: 1] ------------------ 270| 43| table.push_back(accum); 271| | 272| 1.37k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (272:25): [True: 1.33k, False: 43] ------------------ 273| | // Conditional ok: loop iteration count is public 274| 1.33k| if(j % 2 == 1) { ------------------ | Branch (274:13): [True: 688, False: 645] ------------------ 275| 688| table.emplace_back(table[i + j / 2].dbl()); 276| 688| } else { 277| 645| table.emplace_back(table[i + j - 1] + table[i]); 278| 645| } 279| 1.33k| } 280| | 281| | // Advance to next window's base: 2^W * current_base 282| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 283| 43| accum = table[i + WindowElements - 1].dbl(); 284| 43| } 285| | 286| | // Variable time batch conversion is fine since generator is public 287| 1| return to_affine_batch(table); 288| 1|} pcurves_secp256k1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp256k15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 254| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 255| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 256| | 257| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 258| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 259| | 260| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 261| | 262| 1| const size_t TableSize = Windows * WindowElements; 263| | 264| 1| std::vector table; 265| 1| table.reserve(TableSize); 266| | 267| 1| auto accum = C::ProjectivePoint::from_affine(p); 268| | 269| 50| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (269:22): [True: 49, False: 1] ------------------ 270| 49| table.push_back(accum); 271| | 272| 1.56k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (272:25): [True: 1.51k, False: 49] ------------------ 273| | // Conditional ok: loop iteration count is public 274| 1.51k| if(j % 2 == 1) { ------------------ | Branch (274:13): [True: 784, False: 735] ------------------ 275| 784| table.emplace_back(table[i + j / 2].dbl()); 276| 784| } else { 277| 735| table.emplace_back(table[i + j - 1] + table[i]); 278| 735| } 279| 1.51k| } 280| | 281| | // Advance to next window's base: 2^W * current_base 282| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 283| 49| accum = table[i + WindowElements - 1].dbl(); 284| 49| } 285| | 286| | // Variable time batch conversion is fine since generator is public 287| 1| return to_affine_batch(table); 288| 1|} pcurves_secp384r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp384r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 254| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 255| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 256| | 257| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 258| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 259| | 260| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 261| | 262| 1| const size_t TableSize = Windows * WindowElements; 263| | 264| 1| std::vector table; 265| 1| table.reserve(TableSize); 266| | 267| 1| auto accum = C::ProjectivePoint::from_affine(p); 268| | 269| 74| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (269:22): [True: 73, False: 1] ------------------ 270| 73| table.push_back(accum); 271| | 272| 2.33k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (272:25): [True: 2.26k, False: 73] ------------------ 273| | // Conditional ok: loop iteration count is public 274| 2.26k| if(j % 2 == 1) { ------------------ | Branch (274:13): [True: 1.16k, False: 1.09k] ------------------ 275| 1.16k| table.emplace_back(table[i + j / 2].dbl()); 276| 1.16k| } else { 277| 1.09k| table.emplace_back(table[i + j - 1] + table[i]); 278| 1.09k| } 279| 2.26k| } 280| | 281| | // Advance to next window's base: 2^W * current_base 282| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 283| 73| accum = table[i + WindowElements - 1].dbl(); 284| 73| } 285| | 286| | // Variable time batch conversion is fine since generator is public 287| 1| return to_affine_batch(table); 288| 1|} pcurves_secp521r1.cpp:_ZN5Botan19basemul_booth_setupINS_6PCurve12_GLOBAL__N_19secp521r15CurveELm6EEENSt3__16vectorINT_11AffinePointENS5_9allocatorIS8_EEEERKS8_m: 254| 1|std::vector basemul_booth_setup(const typename C::AffinePoint& p, size_t max_scalar_bits) { 255| 1| static_assert(WindowBits >= 1 && WindowBits <= 8); 256| | 257| | // 2^(W-1) elements per window [1*base .. 2^(W-1)*base] 258| 1| constexpr size_t WindowElements = 1 << (WindowBits - 1); 259| | 260| 1| const size_t Windows = (max_scalar_bits + WindowBits - 1) / WindowBits; 261| | 262| 1| const size_t TableSize = Windows * WindowElements; 263| | 264| 1| std::vector table; 265| 1| table.reserve(TableSize); 266| | 267| 1| auto accum = C::ProjectivePoint::from_affine(p); 268| | 269| 98| for(size_t i = 0; i != TableSize; i += WindowElements) { ------------------ | Branch (269:22): [True: 97, False: 1] ------------------ 270| 97| table.push_back(accum); 271| | 272| 3.10k| for(size_t j = 1; j != WindowElements; ++j) { ------------------ | Branch (272:25): [True: 3.00k, False: 97] ------------------ 273| | // Conditional ok: loop iteration count is public 274| 3.00k| if(j % 2 == 1) { ------------------ | Branch (274:13): [True: 1.55k, False: 1.45k] ------------------ 275| 1.55k| table.emplace_back(table[i + j / 2].dbl()); 276| 1.55k| } else { 277| 1.45k| table.emplace_back(table[i + j - 1] + table[i]); 278| 1.45k| } 279| 3.00k| } 280| | 281| | // Advance to next window's base: 2^W * current_base 282| | // The last entry is 2^(W-1) * base, so doubling gives 2^W * base 283| 97| accum = table[i + WindowElements - 1].dbl(); 284| 97| } 285| | 286| | // Variable time batch conversion is fine since generator is public 287| 1| return to_affine_batch(table); 288| 1|} _ZN5Botan10get_uint32ITkNS_8WordTypeEmEEjPKT_m: 33| 1.41M|constexpr uint32_t get_uint32(const W xw[], size_t i) { 34| 1.41M| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 35| | 36| | if constexpr(WordInfo::bits == 32) { 37| | return xw[i]; 38| 1.41M| } else { 39| 1.41M| return static_cast(xw[i / 2] >> ((i % 2) * 32)); 40| 1.41M| } 41| 1.41M|} _ZN5Botan12SolinasAccumImLm4EEC2ERNSt3__15arrayImLm4EEE: 50| 25.8k| constexpr explicit SolinasAccum(std::array& r) : m_r(r) {} _ZN5Botan12SolinasAccumImLm4EE5accumEl: 52| 180k| constexpr void accum(int64_t v) { 53| 180k| BOTAN_DEBUG_ASSERT(m_idx < N32); ------------------ | | 130| 180k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 180k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 180k] | | ------------------ ------------------ 54| | 55| 180k| m_S += v; 56| 180k| const uint32_t r = static_cast(m_S); 57| 180k| m_S >>= 32; 58| | 59| | if constexpr(WordInfo::bits == 32) { 60| | m_r[m_idx] = r; 61| 180k| } else { 62| 180k| m_r[m_idx / 2] |= static_cast(r) << (32 * (m_idx % 2)); 63| 180k| } 64| | 65| 180k| m_idx += 1; 66| 180k| } _ZN5Botan12SolinasAccumImLm4EE11final_carryEl: 68| 25.8k| constexpr W final_carry(int64_t C) { 69| 25.8k| m_S += C; 70| 25.8k| BOTAN_DEBUG_ASSERT(m_S >= 0); ------------------ | | 130| 25.8k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 25.8k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 25.8k] | | ------------------ ------------------ 71| 25.8k| return static_cast(m_S); 72| 25.8k| } _ZN5Botan20solinas_correct_redcILm4ETkNS_8WordTypeEmEEvRNSt3__15arrayIT0_XT_EEERKS4_S7_: 84| 25.8k|constexpr inline void solinas_correct_redc(std::array& r, const std::array& P, const std::array& C) { 85| 25.8k| W borrow = 0; 86| 129k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (86:22): [True: 103k, False: 25.8k] ------------------ 87| 103k| r[i] = word_sub(r[i], C[i], &borrow); 88| 103k| } 89| | 90| | // borrow is either 0 or 1, perfect for setting up a mask without extra work 91| 25.8k| const W mask = CT::value_barrier(0 - borrow); 92| | 93| 25.8k| W carry = 0; 94| | 95| 129k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (95:22): [True: 103k, False: 25.8k] ------------------ 96| 103k| r[i] = word_add(r[i], P[i] & mask, &carry); 97| 103k| } 98| 25.8k|} _ZN5Botan12SolinasAccumImLm6EEC2ERNSt3__15arrayImLm6EEE: 50| 43.7k| constexpr explicit SolinasAccum(std::array& r) : m_r(r) {} _ZN5Botan12SolinasAccumImLm6EE5accumEl: 52| 525k| constexpr void accum(int64_t v) { 53| 525k| BOTAN_DEBUG_ASSERT(m_idx < N32); ------------------ | | 130| 525k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 525k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 525k] | | ------------------ ------------------ 54| | 55| 525k| m_S += v; 56| 525k| const uint32_t r = static_cast(m_S); 57| 525k| m_S >>= 32; 58| | 59| | if constexpr(WordInfo::bits == 32) { 60| | m_r[m_idx] = r; 61| 525k| } else { 62| 525k| m_r[m_idx / 2] |= static_cast(r) << (32 * (m_idx % 2)); 63| 525k| } 64| | 65| 525k| m_idx += 1; 66| 525k| } _ZN5Botan12SolinasAccumImLm6EE11final_carryEl: 68| 43.7k| constexpr W final_carry(int64_t C) { 69| 43.7k| m_S += C; 70| 43.7k| BOTAN_DEBUG_ASSERT(m_S >= 0); ------------------ | | 130| 43.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 43.7k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 43.7k] | | ------------------ ------------------ 71| 43.7k| return static_cast(m_S); 72| 43.7k| } _ZN5Botan20solinas_correct_redcILm6ETkNS_8WordTypeEmEEvRNSt3__15arrayIT0_XT_EEERKS4_S7_: 84| 43.7k|constexpr inline void solinas_correct_redc(std::array& r, const std::array& P, const std::array& C) { 85| 43.7k| W borrow = 0; 86| 306k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (86:22): [True: 262k, False: 43.7k] ------------------ 87| 262k| r[i] = word_sub(r[i], C[i], &borrow); 88| 262k| } 89| | 90| | // borrow is either 0 or 1, perfect for setting up a mask without extra work 91| 43.7k| const W mask = CT::value_barrier(0 - borrow); 92| | 93| 43.7k| W carry = 0; 94| | 95| 306k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (95:22): [True: 262k, False: 43.7k] ------------------ 96| 262k| r[i] = word_add(r[i], P[i] & mask, &carry); 97| 262k| } 98| 43.7k|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm4ELm28EEEDaNSt3__14spanIKhXT1_EEE: 287| 4|inline constexpr auto bytes_to_words(std::span bytes) { 288| 4| static_assert(L <= WordInfo::bytes * N); 289| | 290| 4| std::array r = {}; 291| | 292| 4| constexpr size_t full_words = L / WordInfo::bytes; 293| 4| constexpr size_t extra_bytes = L % WordInfo::bytes; 294| | 295| 4| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 296| | 297| 16| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (297:22): [True: 12, False: 4] ------------------ 298| 12| r[i] = load_be(bytes.data(), full_words - 1 - i); 299| 12| } 300| | 301| 4| if constexpr(extra_bytes > 0) { 302| 4| constexpr size_t shift = extra_bytes * 8; 303| 4| shift_left(r); 304| | 305| 20| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (305:25): [True: 16, False: 4] ------------------ 306| 16| const W b0 = bytes[WordInfo::bytes * full_words + i]; 307| 16| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 308| 16| } 309| 4| } 310| | 311| 4| return r; 312| 4|} _ZN5Botan14bytes_to_wordsITkNS_8WordTypeEmLm9ELm66EEEDaNSt3__14spanIKhXT1_EEE: 287| 54|inline constexpr auto bytes_to_words(std::span bytes) { 288| 54| static_assert(L <= WordInfo::bytes * N); 289| | 290| 54| std::array r = {}; 291| | 292| 54| constexpr size_t full_words = L / WordInfo::bytes; 293| 54| constexpr size_t extra_bytes = L % WordInfo::bytes; 294| | 295| 54| static_assert(full_words + (extra_bytes ? 1 : 0) <= N); 296| | 297| 486| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (297:22): [True: 432, False: 54] ------------------ 298| 432| r[i] = load_be(bytes.data(), full_words - 1 - i); 299| 432| } 300| | 301| 54| if constexpr(extra_bytes > 0) { 302| 54| constexpr size_t shift = extra_bytes * 8; 303| 54| shift_left(r); 304| | 305| 162| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (305:25): [True: 108, False: 54] ------------------ 306| 108| const W b0 = bytes[WordInfo::bytes * full_words + i]; 307| 108| r[0] |= (b0 << (8 * (extra_bytes - 1 - i))); 308| 108| } 309| 54| } 310| | 311| 54| return r; 312| 54|} pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE8instanceEv: 338| 1| static std::shared_ptr instance() { 339| 1| static auto g_curve = std::make_shared>(); 340| 1| return g_curve; 341| 1| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEEC2Ev: 336| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp224r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp224r15CurveEE17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE: 242| 4| std::optional deserialize_point(std::span bytes) const override { 243| | // The identity element (see SEC1 section 2.3.4) 244| | // TODO(Botan4) remove this - we should reject the identity encoding 245| 4| if(bytes.size() == 1 && bytes[0] == 0x00) { ------------------ | Branch (245:13): [True: 0, False: 4] | Branch (245:34): [True: 0, False: 0] ------------------ 246| 0| return stash(C::AffinePoint::identity()); 247| 0| } 248| | 249| 4| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 250| 4| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 251| 4| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 252| | 253| 4| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (253:13): [True: 2, False: 2] | Branch (253:50): [True: 2, False: 0] ------------------ 254| 2| const auto encoded_point = bytes.subspan(1); 255| 2| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 256| 2| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 257| | 258| 2| if(x && y) { ------------------ | Branch (258:16): [True: 2, False: 0] | Branch (258:21): [True: 2, False: 0] ------------------ 259| | // Check that y^2 = x^3 + ax + b 260| 2| const auto lhs = (*y).square(); 261| 2| const auto rhs = C::x3_ax_b(*x); 262| 2| const auto valid = (lhs == rhs); 263| 2| if(valid.as_bool()) { ------------------ | Branch (263:19): [True: 0, False: 2] ------------------ 264| 0| return stash(typename C::AffinePoint(*x, *y)); 265| 0| } 266| 2| } 267| 2| } else if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (267:20): [True: 0, False: 2] | Branch (267:56): [True: 0, False: 0] | Branch (267:76): [True: 0, False: 0] ------------------ 268| 0| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 269| | 270| 0| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (270:21): [True: 0, False: 0] ------------------ 271| 0| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (271:24): [True: 0, False: 0] ------------------ 272| 0| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 273| 0| } 274| 0| } 275| 0| } 276| | 277| 4| return {}; 278| 4| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256k15CurveEE8instanceEv: 338| 1| static std::shared_ptr instance() { 339| 1| static auto g_curve = std::make_shared>(); 340| 1| return g_curve; 341| 1| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256k15CurveEEC2Ev: 336| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp256k1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp256k15CurveEE17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE: 242| 1| std::optional deserialize_point(std::span bytes) const override { 243| | // The identity element (see SEC1 section 2.3.4) 244| | // TODO(Botan4) remove this - we should reject the identity encoding 245| 1| if(bytes.size() == 1 && bytes[0] == 0x00) { ------------------ | Branch (245:13): [True: 0, False: 1] | Branch (245:34): [True: 0, False: 0] ------------------ 246| 0| return stash(C::AffinePoint::identity()); 247| 0| } 248| | 249| 1| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 250| 1| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 251| 1| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 252| | 253| 1| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (253:13): [True: 0, False: 1] | Branch (253:50): [True: 0, False: 0] ------------------ 254| 0| const auto encoded_point = bytes.subspan(1); 255| 0| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 256| 0| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 257| | 258| 0| if(x && y) { ------------------ | Branch (258:16): [True: 0, False: 0] | Branch (258:21): [True: 0, False: 0] ------------------ 259| | // Check that y^2 = x^3 + ax + b 260| 0| const auto lhs = (*y).square(); 261| 0| const auto rhs = C::x3_ax_b(*x); 262| 0| const auto valid = (lhs == rhs); 263| 0| if(valid.as_bool()) { ------------------ | Branch (263:19): [True: 0, False: 0] ------------------ 264| 0| return stash(typename C::AffinePoint(*x, *y)); 265| 0| } 266| 0| } 267| 1| } else if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (267:20): [True: 0, False: 1] | Branch (267:56): [True: 0, False: 0] | Branch (267:76): [True: 0, False: 0] ------------------ 268| 0| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 269| | 270| 0| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (270:21): [True: 0, False: 0] ------------------ 271| 0| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (271:24): [True: 0, False: 0] ------------------ 272| 0| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 273| 0| } 274| 0| } 275| 0| } 276| | 277| 1| return {}; 278| 1| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE8instanceEv: 338| 1| static std::shared_ptr instance() { 339| 1| static auto g_curve = std::make_shared>(); 340| 1| return g_curve; 341| 1| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEEC2Ev: 336| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp384r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp384r15CurveEE17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE: 242| 1| std::optional deserialize_point(std::span bytes) const override { 243| | // The identity element (see SEC1 section 2.3.4) 244| | // TODO(Botan4) remove this - we should reject the identity encoding 245| 1| if(bytes.size() == 1 && bytes[0] == 0x00) { ------------------ | Branch (245:13): [True: 0, False: 1] | Branch (245:34): [True: 0, False: 0] ------------------ 246| 0| return stash(C::AffinePoint::identity()); 247| 0| } 248| | 249| 1| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 250| 1| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 251| 1| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 252| | 253| 1| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (253:13): [True: 0, False: 1] | Branch (253:50): [True: 0, False: 0] ------------------ 254| 0| const auto encoded_point = bytes.subspan(1); 255| 0| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 256| 0| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 257| | 258| 0| if(x && y) { ------------------ | Branch (258:16): [True: 0, False: 0] | Branch (258:21): [True: 0, False: 0] ------------------ 259| | // Check that y^2 = x^3 + ax + b 260| 0| const auto lhs = (*y).square(); 261| 0| const auto rhs = C::x3_ax_b(*x); 262| 0| const auto valid = (lhs == rhs); 263| 0| if(valid.as_bool()) { ------------------ | Branch (263:19): [True: 0, False: 0] ------------------ 264| 0| return stash(typename C::AffinePoint(*x, *y)); 265| 0| } 266| 0| } 267| 1| } else if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (267:20): [True: 0, False: 1] | Branch (267:56): [True: 0, False: 0] | Branch (267:76): [True: 0, False: 0] ------------------ 268| 0| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 269| | 270| 0| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (270:21): [True: 0, False: 0] ------------------ 271| 0| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (271:24): [True: 0, False: 0] ------------------ 272| 0| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 273| 0| } 274| 0| } 275| 0| } 276| | 277| 1| return {}; 278| 1| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE8instanceEv: 338| 1| static std::shared_ptr instance() { 339| 1| static auto g_curve = std::make_shared>(); 340| 1| return g_curve; 341| 1| } pcurves_secp521r1.cpp:_ZN5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEEC2Ev: 336| 1| PrimeOrderCurveImpl() : m_mul_by_g(C::G) {} pcurves_secp521r1.cpp:_ZNK5Botan6PCurve19PrimeOrderCurveImplINS0_12_GLOBAL__N_19secp521r15CurveEE17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE: 242| 29| std::optional deserialize_point(std::span bytes) const override { 243| | // The identity element (see SEC1 section 2.3.4) 244| | // TODO(Botan4) remove this - we should reject the identity encoding 245| 29| if(bytes.size() == 1 && bytes[0] == 0x00) { ------------------ | Branch (245:13): [True: 0, False: 29] | Branch (245:34): [True: 0, False: 0] ------------------ 246| 0| return stash(C::AffinePoint::identity()); 247| 0| } 248| | 249| 29| constexpr size_t FieldElementBytes = C::FieldElement::BYTES; 250| 29| constexpr size_t CompressedBytes = C::FieldElement::BYTES + 1; 251| 29| constexpr size_t UncompressedBytes = 2 * C::FieldElement::BYTES + 1; 252| | 253| 29| if(bytes.size() == UncompressedBytes && bytes[0] == 0x04) { ------------------ | Branch (253:13): [True: 28, False: 1] | Branch (253:50): [True: 27, False: 1] ------------------ 254| 27| const auto encoded_point = bytes.subspan(1); 255| 27| auto x = C::FieldElement::deserialize(encoded_point.first(FieldElementBytes)); 256| 27| auto y = C::FieldElement::deserialize(encoded_point.last(FieldElementBytes)); 257| | 258| 27| if(x && y) { ------------------ | Branch (258:16): [True: 25, False: 2] | Branch (258:21): [True: 22, False: 3] ------------------ 259| | // Check that y^2 = x^3 + ax + b 260| 22| const auto lhs = (*y).square(); 261| 22| const auto rhs = C::x3_ax_b(*x); 262| 22| const auto valid = (lhs == rhs); 263| 22| if(valid.as_bool()) { ------------------ | Branch (263:19): [True: 0, False: 22] ------------------ 264| 0| return stash(typename C::AffinePoint(*x, *y)); 265| 0| } 266| 22| } 267| 27| } else if(bytes.size() == CompressedBytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (267:20): [True: 0, False: 2] | Branch (267:56): [True: 0, False: 0] | Branch (267:76): [True: 0, False: 0] ------------------ 268| 0| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 269| | 270| 0| if(auto x = C::FieldElement::deserialize(bytes.subspan(1, FieldElementBytes))) { ------------------ | Branch (270:21): [True: 0, False: 0] ------------------ 271| 0| if(auto y = sqrt_field_element(C::x3_ax_b(*x)).as_optional_vartime()) { ------------------ | Branch (271:24): [True: 0, False: 0] ------------------ 272| 0| return stash(typename C::AffinePoint(*x, y->correct_sign(y_is_even))); 273| 0| } 274| 0| } 275| 0| } 276| | 277| 29| return {}; 278| 29| } _ZN5Botan12mulx_polyvalERKNS_9SIMD_4x32E: 92| 32|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 mulx_polyval(const SIMD_4x32& h) { 93| 32| const auto V = SIMD_4x32(0x00000001, 0x00000000, 0x00000000, 0xc2000000); 94| | 95| | // Bitmask set iff the top bit of h is set 96| 32| const auto mask = h.top_bit_mask(); 97| | 98| | // Extract the top bits of the words and move them into place as the low bit of the next word 99| 32| auto top_bits = h.shr<31>().shift_elems_left<1>(); 100| | 101| | // The main shift, adding back in the top bits that are otherwise lost 102| 32| auto shifted_h = h.shl<1>() | top_bits; 103| | 104| 32| return shifted_h ^ (mask & V); 105| 32|} _ZN5Botan14reverse_vectorERKNS_9SIMD_4x32E: 16| 365|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 reverse_vector(const SIMD_4x32& in) { 17| 365|#if defined(BOTAN_SIMD_USE_SSSE3) 18| 365| const __m128i BSWAP_MASK = _mm_set_epi8(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15); 19| 365| return SIMD_4x32(_mm_shuffle_epi8(in.raw(), BSWAP_MASK)); 20| |#elif defined(BOTAN_SIMD_USE_NEON) 21| | const uint8_t maskb[16] = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 22| | const uint8x16_t mask = vld1q_u8(maskb); 23| | return SIMD_4x32(vreinterpretq_u32_u8(vqtbl1q_u8(vreinterpretq_u8_u32(in.raw()), mask))); 24| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 25| | const __vector unsigned char mask = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 26| | return SIMD_4x32(vec_perm(in.raw(), in.raw(), mask)); 27| |#endif 28| 365|} _ZN5Botan16polyval_multiplyERKNS_9SIMD_4x32ES2_: 128| 207|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_CLMUL polyval_multiply(const SIMD_4x32& H, const SIMD_4x32& x) { 129| 207| SIMD_4x32 hi = clmul<0x11>(H, x); 130| 207| const SIMD_4x32 mid = clmul<0x10>(H, x) ^ clmul<0x01>(H, x); 131| 207| SIMD_4x32 lo = clmul<0x00>(H, x); 132| | 133| 207| hi ^= mid.shift_elems_right<2>(); 134| 207| lo ^= mid.shift_elems_left<2>(); 135| | 136| 207| return polyval_reduce(hi, lo); 137| 207|} _ZN5Botan5clmulILi17EEENS_9SIMD_4x32ERKS1_S3_: 31| 207|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 32| 207| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 33| | 34| 207|#if defined(BOTAN_SIMD_USE_SSSE3) 35| 207| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 36| |#elif defined(BOTAN_SIMD_USE_NEON) 37| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 38| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 39| | 40| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 41| | __n64 a1 = {a}, b1 = {b}; 42| | return SIMD_4x32(vmull_p64(a1, b1)); 43| | #else 44| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 45| | #endif 46| | 47| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 48| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 49| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 50| | 51| | SIMD_4x32 i1 = x; 52| | SIMD_4x32 i2 = H; 53| | 54| | if constexpr(std::endian::native == std::endian::big) { 55| | i1 = reverse_vector(i1).bswap(); 56| | i2 = reverse_vector(i2).bswap(); 57| | } 58| | 59| | if constexpr(M == (0x11 ^ flip)) { 60| | i1 &= mask_lo; 61| | i2 &= mask_lo; 62| | } else if constexpr(M == (0x10 ^ flip)) { 63| | i1 = i1.shift_elems_left<2>(); 64| | } else if constexpr(M == (0x01 ^ flip)) { 65| | i2 = i2.shift_elems_left<2>(); 66| | } else if constexpr(M == (0x00 ^ flip)) { 67| | i1 = mask_lo.andc(i1); 68| | i2 = mask_lo.andc(i2); 69| | } 70| | 71| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 72| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 73| | 74| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 75| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 76| | #else 77| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 78| | #endif 79| | 80| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 81| | 82| | if constexpr(std::endian::native == std::endian::big) { 83| | z = reverse_vector(z).bswap(); 84| | } 85| | 86| | return z; 87| |#endif 88| 207|} _ZN5Botan5clmulILi16EEENS_9SIMD_4x32ERKS1_S3_: 31| 207|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 32| 207| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 33| | 34| 207|#if defined(BOTAN_SIMD_USE_SSSE3) 35| 207| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 36| |#elif defined(BOTAN_SIMD_USE_NEON) 37| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 38| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 39| | 40| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 41| | __n64 a1 = {a}, b1 = {b}; 42| | return SIMD_4x32(vmull_p64(a1, b1)); 43| | #else 44| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 45| | #endif 46| | 47| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 48| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 49| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 50| | 51| | SIMD_4x32 i1 = x; 52| | SIMD_4x32 i2 = H; 53| | 54| | if constexpr(std::endian::native == std::endian::big) { 55| | i1 = reverse_vector(i1).bswap(); 56| | i2 = reverse_vector(i2).bswap(); 57| | } 58| | 59| | if constexpr(M == (0x11 ^ flip)) { 60| | i1 &= mask_lo; 61| | i2 &= mask_lo; 62| | } else if constexpr(M == (0x10 ^ flip)) { 63| | i1 = i1.shift_elems_left<2>(); 64| | } else if constexpr(M == (0x01 ^ flip)) { 65| | i2 = i2.shift_elems_left<2>(); 66| | } else if constexpr(M == (0x00 ^ flip)) { 67| | i1 = mask_lo.andc(i1); 68| | i2 = mask_lo.andc(i2); 69| | } 70| | 71| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 72| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 73| | 74| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 75| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 76| | #else 77| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 78| | #endif 79| | 80| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 81| | 82| | if constexpr(std::endian::native == std::endian::big) { 83| | z = reverse_vector(z).bswap(); 84| | } 85| | 86| | return z; 87| |#endif 88| 207|} _ZN5Botan5clmulILi1EEENS_9SIMD_4x32ERKS1_S3_: 31| 207|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 32| 207| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 33| | 34| 207|#if defined(BOTAN_SIMD_USE_SSSE3) 35| 207| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 36| |#elif defined(BOTAN_SIMD_USE_NEON) 37| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 38| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 39| | 40| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 41| | __n64 a1 = {a}, b1 = {b}; 42| | return SIMD_4x32(vmull_p64(a1, b1)); 43| | #else 44| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 45| | #endif 46| | 47| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 48| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 49| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 50| | 51| | SIMD_4x32 i1 = x; 52| | SIMD_4x32 i2 = H; 53| | 54| | if constexpr(std::endian::native == std::endian::big) { 55| | i1 = reverse_vector(i1).bswap(); 56| | i2 = reverse_vector(i2).bswap(); 57| | } 58| | 59| | if constexpr(M == (0x11 ^ flip)) { 60| | i1 &= mask_lo; 61| | i2 &= mask_lo; 62| | } else if constexpr(M == (0x10 ^ flip)) { 63| | i1 = i1.shift_elems_left<2>(); 64| | } else if constexpr(M == (0x01 ^ flip)) { 65| | i2 = i2.shift_elems_left<2>(); 66| | } else if constexpr(M == (0x00 ^ flip)) { 67| | i1 = mask_lo.andc(i1); 68| | i2 = mask_lo.andc(i2); 69| | } 70| | 71| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 72| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 73| | 74| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 75| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 76| | #else 77| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 78| | #endif 79| | 80| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 81| | 82| | if constexpr(std::endian::native == std::endian::big) { 83| | z = reverse_vector(z).bswap(); 84| | } 85| | 86| | return z; 87| |#endif 88| 207|} _ZN5Botan5clmulILi0EEENS_9SIMD_4x32ERKS1_S3_: 31| 621|BOTAN_FORCE_INLINE BOTAN_FN_ISA_CLMUL SIMD_4x32 clmul(const SIMD_4x32& H, const SIMD_4x32& x) { 32| 621| static_assert(M == 0x00 || M == 0x01 || M == 0x10 || M == 0x11, "Valid clmul mode"); 33| | 34| 621|#if defined(BOTAN_SIMD_USE_SSSE3) 35| 621| return SIMD_4x32(_mm_clmulepi64_si128(x.raw(), H.raw(), M)); 36| |#elif defined(BOTAN_SIMD_USE_NEON) 37| | const uint64_t a = vgetq_lane_u64(vreinterpretq_u64_u32(x.raw()), M & 0x01); 38| | const uint64_t b = vgetq_lane_u64(vreinterpretq_u64_u32(H.raw()), (M & 0x10) >> 4); 39| | 40| | #if defined(BOTAN_BUILD_COMPILER_IS_MSVC) 41| | __n64 a1 = {a}, b1 = {b}; 42| | return SIMD_4x32(vmull_p64(a1, b1)); 43| | #else 44| | return SIMD_4x32(reinterpret_cast(vmull_p64(a, b))); 45| | #endif 46| | 47| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 48| | const SIMD_4x32 mask_lo = SIMD_4x32(0, 0, 0xFFFFFFFF, 0xFFFFFFFF); 49| | constexpr uint8_t flip = (std::endian::native == std::endian::big) ? 0x11 : 0x00; 50| | 51| | SIMD_4x32 i1 = x; 52| | SIMD_4x32 i2 = H; 53| | 54| | if constexpr(std::endian::native == std::endian::big) { 55| | i1 = reverse_vector(i1).bswap(); 56| | i2 = reverse_vector(i2).bswap(); 57| | } 58| | 59| | if constexpr(M == (0x11 ^ flip)) { 60| | i1 &= mask_lo; 61| | i2 &= mask_lo; 62| | } else if constexpr(M == (0x10 ^ flip)) { 63| | i1 = i1.shift_elems_left<2>(); 64| | } else if constexpr(M == (0x01 ^ flip)) { 65| | i2 = i2.shift_elems_left<2>(); 66| | } else if constexpr(M == (0x00 ^ flip)) { 67| | i1 = mask_lo.andc(i1); 68| | i2 = mask_lo.andc(i2); 69| | } 70| | 71| | auto i1v = reinterpret_cast<__vector unsigned long long>(i1.raw()); 72| | auto i2v = reinterpret_cast<__vector unsigned long long>(i2.raw()); 73| | 74| | #if BOTAN_COMPILER_HAS_BUILTIN(__builtin_crypto_vpmsumd) 75| | auto rv = __builtin_crypto_vpmsumd(i1v, i2v); 76| | #else 77| | auto rv = __builtin_altivec_crypto_vpmsumd(i1v, i2v); 78| | #endif 79| | 80| | auto z = SIMD_4x32(reinterpret_cast<__vector unsigned int>(rv)); 81| | 82| | if constexpr(std::endian::native == std::endian::big) { 83| | z = reverse_vector(z).bswap(); 84| | } 85| | 86| | return z; 87| |#endif 88| 621|} _ZN5Botan14polyval_reduceERKNS_9SIMD_4x32ES2_: 107| 207|BOTAN_FORCE_INLINE SIMD_4x32 BOTAN_FN_ISA_CLMUL polyval_reduce(const SIMD_4x32& hi, const SIMD_4x32& lo) { 108| 207| const SIMD_4x32 V(0, 0xC2000000, 0, 0); 109| | 110| | /* 111| | Montgomery reduction 112| | Input: 256-bit operand [X3 : X2 : X1 : X0] 113| | [A1 : A0] = X0 • 0xc200000000000000 114| | [B1 : B0] = [X0 ⨁ A1 : X1 ⨁ A0] 115| | [C1 : C0] = B0 • 0xc200000000000000 116| | [D1 : D0] = [B0 ⨁ C1 : B1 ⨁ C0] 117| | Output: [D1 ⨁ X3 : D0 ⨁ X2] 118| | */ 119| | 120| 207| const auto A = clmul<0x00>(lo, V); 121| 207| const auto B = A ^ lo.swap_halves(); 122| 207| const auto C = clmul<0x00>(B, V); 123| 207| const auto D = C ^ B.swap_halves(); 124| | 125| 207| return D ^ hi; 126| 207|} _ZN5Botan10TLS_12_PRFC2ENSt3__110unique_ptrINS_25MessageAuthenticationCodeENS1_14default_deleteIS3_EEEE: 28| 114| explicit TLS_12_PRF(std::unique_ptr mac) : m_mac(std::move(mac)) {} _ZN5Botan4rotrILm39ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan4rotrILm34ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan4rotrILm14ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan3rhoILm14ELm18ELm41ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 428k|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 428k| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 428k|} _ZN5Botan4rotrILm18ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan4rotrILm41ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan3rhoILm28ELm34ELm39ETkNSt3__117unsigned_integralEmEET2_S2_: 53| 428k|BOTAN_FORCE_INLINE constexpr T rho(T x) { 54| 428k| return rotr(x) ^ rotr(x) ^ rotr(x); 55| 428k|} _ZN5Botan4rotrILm28ETkNSt3__117unsigned_integralEmEET0_S2_QaagtT_Li0EltT_mlLi8EstS2_: 37| 428k|{ 38| 428k| return static_cast((input >> ROT) | (input << (8 * sizeof(T) - ROT))); 39| 428k|} _ZN5Botan8round_upEmm: 26| 19.8k|constexpr inline size_t round_up(size_t n, size_t align_to) { 27| | // Arguably returning n in this case would also be sensible 28| 19.8k| BOTAN_ARG_CHECK(align_to != 0, "align_to must not be 0"); ------------------ | | 35| 19.8k| do { \ | | 36| 19.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 19.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 19.8k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 19.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 19.8k] | | ------------------ ------------------ 29| | 30| 19.8k| if(n % align_to > 0) { ------------------ | Branch (30:7): [True: 12.4k, False: 7.42k] ------------------ 31| 12.4k| const size_t adj = align_to - (n % align_to); 32| 12.4k| BOTAN_ARG_CHECK(n + adj >= n, "Integer overflow during rounding"); ------------------ | | 35| 12.4k| do { \ | | 36| 12.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 12.4k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 12.4k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 12.4k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 12.4k] | | ------------------ ------------------ 33| 12.4k| n += adj; 34| 12.4k| } 35| 19.8k| return n; 36| 19.8k|} _ZNK5Botan9SCAN_Name9algo_nameEv: 44| 2.13k| const std::string& algo_name() const { return m_alg_name; } _ZNK5Botan9SCAN_Name17arg_count_betweenEmm: 56| 14| bool arg_count_between(size_t lower, size_t upper) const { 57| 14| return ((arg_count() >= lower) && (arg_count() <= upper)); ------------------ | Branch (57:18): [True: 14, False: 0] | Branch (57:44): [True: 14, False: 0] ------------------ 58| 14| } _ZNK5Botan9SCAN_Name9arg_countEv: 49| 1.88k| size_t arg_count() const { return m_args.size(); } _ZNK5Botan5SHA_14nameEv: 32| 17| std::string name() const override { return "SHA-1"; } _ZNK5Botan5SHA_113output_lengthEv: 34| 1.90k| size_t output_length() const override { return 20; } _ZNK5Botan5SHA_115hash_block_sizeEv: 36| 16| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan5SHA_15clearEv: 44| 16| void clear() override { m_md.clear(); } _ZNK5Botan7SHA_2564nameEv: 73| 8| std::string name() const override { return "SHA-256"; } _ZNK5Botan7SHA_25613output_lengthEv: 75| 10.6k| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_25615hash_block_sizeEv: 77| 37| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan7SHA_2565clearEv: 83| 53| void clear() override { m_md.clear(); } _ZNK5Botan7SHA_3844nameEv: 32| 13| std::string name() const override { return "SHA-384"; } _ZNK5Botan7SHA_38413output_lengthEv: 34| 995| size_t output_length() const override { return output_bytes; } _ZNK5Botan7SHA_38415hash_block_sizeEv: 36| 92| size_t hash_block_size() const override { return block_bytes; } _ZN5Botan7SHA_3845clearEv: 44| 133| void clear() override { m_md.clear(); } _ZNK5Botan7SHA_5124nameEv: 72| 290| std::string name() const override { return "SHA-512"; } _ZNK5Botan7SHA_51213output_lengthEv: 74| 582| size_t output_length() const override { return output_bytes; } _ZN5Botan9SHA2_64_FEmmmRmmmmS0_m: 42| 428k| 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) { 43| 428k| H += rho<14, 18, 41>(E) + choose(E, F, G) + M; 44| 428k| D += H; 45| 428k| H += rho<28, 34, 39>(A) + majority(A, B, C); 46| 428k|} _ZN5Botan22SignaturePaddingSchemeD2Ev: 27| 310| virtual ~SignaturePaddingScheme() = default; _ZN5Botan9SIMD_2x64C2Ev: 50| 18.5k| m_simd(_mm_setzero_si128()) 51| |#elif defined(BOTAN_SIMD_USE_SIMD128) 52| | m_simd(wasm_u64x2_const_splat(0)) 53| |#endif 54| 18.5k| { 55| 18.5k| } _ZN5Botan9SIMD_2x647load_beEPKv: 90| 18.5k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_be(const void* in) { return SIMD_2x64::load_le(in).bswap(); } _ZNK5Botan9SIMD_2x645bswapEv: 100| 18.5k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 bswap() const { 101| 18.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 102| 18.5k| const auto idx = _mm_set_epi8(8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7); 103| 18.5k| return SIMD_2x64(_mm_shuffle_epi8(m_simd, idx)); 104| |#elif defined(BOTAN_SIMD_USE_SIMD128) 105| | 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)); 106| |#endif 107| 18.5k| } _ZN5Botan9SIMD_2x64C2EDv2_x: 316| 721k| explicit BOTAN_FN_ISA_SIMD_2X64 SIMD_2x64(native_simd_type x) : m_simd(x) {} _ZNK5Botan9SIMD_2x64plERKS0_: 144| 314k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator+(const SIMD_2x64& other) const { 145| 314k| SIMD_2x64 retval(*this); 146| 314k| retval += other; 147| 314k| return retval; 148| 314k| } _ZN5Botan9SIMD_2x64pLERKS0_: 156| 314k| void BOTAN_FN_ISA_SIMD_2X64 operator+=(const SIMD_2x64& other) { 157| 314k|#if defined(BOTAN_SIMD_USE_SSSE3) 158| 314k| m_simd = _mm_add_epi64(m_simd, other.m_simd); 159| |#elif defined(BOTAN_SIMD_USE_SIMD128) 160| | m_simd = wasm_i64x2_add(m_simd, other.m_simd); 161| |#endif 162| 314k| } _ZN5Botan9SIMD_2x647load_leEPKv: 82| 111k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 load_le(const void* in) { 83| 111k|#if defined(BOTAN_SIMD_USE_SSSE3) 84| 111k| return SIMD_2x64(_mm_loadu_si128(reinterpret_cast(in))); 85| |#elif defined(BOTAN_SIMD_USE_SIMD128) 86| | return SIMD_2x64(wasm_v128_load(in)); 87| |#endif 88| 111k| } _ZNK5Botan9SIMD_2x648store_leEPm: 126| 92.5k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint64_t out[2]) const { this->store_le(reinterpret_cast(out)); } _ZNK5Botan9SIMD_2x648store_leEPh: 128| 92.5k| void BOTAN_FN_ISA_SIMD_2X64 store_le(uint8_t out[]) const { 129| 92.5k|#if defined(BOTAN_SIMD_USE_SSSE3) 130| 92.5k| _mm_storeu_si128(reinterpret_cast<__m128i*>(out), m_simd); 131| |#elif defined(BOTAN_SIMD_USE_SIMD128) 132| | wasm_v128_store(out, m_simd); 133| |#endif 134| 92.5k| } _ZN5Botan9SIMD_2x647alignr8ERKS0_S2_: 240| 148k| static SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 alignr8(const SIMD_2x64& a, const SIMD_2x64& b) { 241| 148k|#if defined(BOTAN_SIMD_USE_SSSE3) 242| 148k| return SIMD_2x64(_mm_alignr_epi8(a.m_simd, b.m_simd, 8)); 243| |#elif defined(BOTAN_SIMD_USE_SIMD128) 244| | return SIMD_2x64( 245| | 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)); 246| |#endif 247| 148k| } _ZNK5Botan9SIMD_2x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 184| 74.0k| { 185| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 186| | if constexpr(ROT == 8) { 187| | auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 188| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 189| | } else if constexpr(ROT == 16) { 190| | auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 191| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 192| | } else if constexpr(ROT == 24) { 193| | auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 194| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 195| | } else if constexpr(ROT == 32) { 196| | auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 197| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 198| 74.0k| } else { 199| 74.0k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 200| 74.0k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 201| 74.0k| } 202| |#elif defined(BOTAN_SIMD_USE_SIMD128) 203| | if constexpr(ROT == 8) { 204| | 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)); 205| | } else if constexpr(ROT == 16) { 206| | 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)); 207| | } else if constexpr(ROT == 24) { 208| | 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)); 209| | } else if constexpr(ROT == 32) { 210| | 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)); 211| | } else { 212| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 213| | } 214| |#endif 215| 74.0k| } _ZNK5Botan9SIMD_2x64eoERKS0_: 150| 296k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 operator^(const SIMD_2x64& other) const { 151| 296k| SIMD_2x64 retval(*this); 152| 296k| retval ^= other; 153| 296k| return retval; 154| 296k| } _ZN5Botan9SIMD_2x64eOERKS0_: 164| 296k| void BOTAN_FN_ISA_SIMD_2X64 operator^=(const SIMD_2x64& other) { 165| 296k|#if defined(BOTAN_SIMD_USE_SSSE3) 166| 296k| m_simd = _mm_xor_si128(m_simd, other.m_simd); 167| |#elif defined(BOTAN_SIMD_USE_SIMD128) 168| | m_simd = wasm_v128_xor(m_simd, other.m_simd); 169| |#endif 170| 296k| } _ZNK5Botan9SIMD_2x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 184| 74.0k| { 185| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 186| 74.0k| if constexpr(ROT == 8) { 187| 74.0k| auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 188| 74.0k| return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 189| | } else if constexpr(ROT == 16) { 190| | auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 191| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 192| | } else if constexpr(ROT == 24) { 193| | auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 194| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 195| | } else if constexpr(ROT == 32) { 196| | auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 197| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 198| | } else { 199| | return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 200| | _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 201| | } 202| |#elif defined(BOTAN_SIMD_USE_SIMD128) 203| | if constexpr(ROT == 8) { 204| | 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)); 205| | } else if constexpr(ROT == 16) { 206| | 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)); 207| | } else if constexpr(ROT == 24) { 208| | 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)); 209| | } else if constexpr(ROT == 32) { 210| | 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)); 211| | } else { 212| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 213| | } 214| |#endif 215| 74.0k| } _ZNK5Botan9SIMD_2x643shrILi7EEES0_v: 223| 74.0k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 224| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 225| 74.0k| return SIMD_2x64(_mm_srli_epi64(m_simd, SHIFT)); 226| |#elif defined(BOTAN_SIMD_USE_SIMD128) 227| | return SIMD_2x64(wasm_u64x2_shr(m_simd, SHIFT)); 228| |#endif 229| 74.0k| } _ZNK5Botan9SIMD_2x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 184| 74.0k| { 185| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 186| | if constexpr(ROT == 8) { 187| | auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 188| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 189| | } else if constexpr(ROT == 16) { 190| | auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 191| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 192| | } else if constexpr(ROT == 24) { 193| | auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 194| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 195| | } else if constexpr(ROT == 32) { 196| | auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 197| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 198| 74.0k| } else { 199| 74.0k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 200| 74.0k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 201| 74.0k| } 202| |#elif defined(BOTAN_SIMD_USE_SIMD128) 203| | if constexpr(ROT == 8) { 204| | 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)); 205| | } else if constexpr(ROT == 16) { 206| | 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)); 207| | } else if constexpr(ROT == 24) { 208| | 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)); 209| | } else if constexpr(ROT == 32) { 210| | 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)); 211| | } else { 212| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 213| | } 214| |#endif 215| 74.0k| } _ZNK5Botan9SIMD_2x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 184| 74.0k| { 185| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 186| | if constexpr(ROT == 8) { 187| | auto tab = _mm_setr_epi8(1, 2, 3, 4, 5, 6, 7, 0, 9, 10, 11, 12, 13, 14, 15, 8); 188| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 189| | } else if constexpr(ROT == 16) { 190| | auto tab = _mm_setr_epi8(2, 3, 4, 5, 6, 7, 0, 1, 10, 11, 12, 13, 14, 15, 8, 9); 191| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 192| | } else if constexpr(ROT == 24) { 193| | auto tab = _mm_setr_epi8(3, 4, 5, 6, 7, 0, 1, 2, 11, 12, 13, 14, 15, 8, 9, 10); 194| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 195| | } else if constexpr(ROT == 32) { 196| | auto tab = _mm_setr_epi8(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11); 197| | return SIMD_2x64(_mm_shuffle_epi8(m_simd, tab)); 198| 74.0k| } else { 199| 74.0k| return SIMD_2x64(_mm_or_si128(_mm_srli_epi64(m_simd, static_cast(ROT)), 200| 74.0k| _mm_slli_epi64(m_simd, static_cast(64 - ROT)))); 201| 74.0k| } 202| |#elif defined(BOTAN_SIMD_USE_SIMD128) 203| | if constexpr(ROT == 8) { 204| | 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)); 205| | } else if constexpr(ROT == 16) { 206| | 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)); 207| | } else if constexpr(ROT == 24) { 208| | 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)); 209| | } else if constexpr(ROT == 32) { 210| | 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)); 211| | } else { 212| | return SIMD_2x64(wasm_v128_or(wasm_u64x2_shr(m_simd, ROT), wasm_i64x2_shl(m_simd, 64 - ROT))); 213| | } 214| |#endif 215| 74.0k| } _ZNK5Botan9SIMD_2x643shrILi6EEES0_v: 223| 74.0k| SIMD_2x64 BOTAN_FN_ISA_SIMD_2X64 shr() const noexcept { 224| 74.0k|#if defined(BOTAN_SIMD_USE_SSSE3) 225| 74.0k| return SIMD_2x64(_mm_srli_epi64(m_simd, SHIFT)); 226| |#elif defined(BOTAN_SIMD_USE_SIMD128) 227| | return SIMD_2x64(wasm_u64x2_shr(m_simd, SHIFT)); 228| |#endif 229| 74.0k| } _ZNK5Botan9SIMD_4x323rawEv: 942| 7.21M| native_simd_type BOTAN_FN_ISA_SIMD_4X32 raw() const noexcept { return m_simd; } _ZN5Botan9SIMD_4x32C2EDv2_x: 944| 4.10M| explicit BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(native_simd_type x) noexcept : m_simd(x) {} _ZN5Botan9SIMD_4x327load_leEPKv: 162| 561k| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_le(const void* in) noexcept { 163| 561k|#if defined(BOTAN_SIMD_USE_SSSE3) 164| 561k| return SIMD_4x32(_mm_loadu_si128(reinterpret_cast(in))); 165| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 166| | uint32_t R0 = Botan::load_le(reinterpret_cast(in), 0); 167| | uint32_t R1 = Botan::load_le(reinterpret_cast(in), 1); 168| | uint32_t R2 = Botan::load_le(reinterpret_cast(in), 2); 169| | uint32_t R3 = Botan::load_le(reinterpret_cast(in), 3); 170| | __vector unsigned int val = {R0, R1, R2, R3}; 171| | return SIMD_4x32(val); 172| |#elif defined(BOTAN_SIMD_USE_NEON) 173| | SIMD_4x32 l(vld1q_u32(static_cast(in))); 174| | if constexpr(std::endian::native == std::endian::big) { 175| | return l.bswap(); 176| | } else { 177| | return l; 178| | } 179| |#elif defined(BOTAN_SIMD_USE_LSX) 180| | return SIMD_4x32(__lsx_vld(in, 0)); 181| |#elif defined(BOTAN_SIMD_USE_SIMD128) 182| | return SIMD_4x32(wasm_v128_load(in)); 183| |#endif 184| 561k| } _ZN5Botan9SIMD_4x32C2Ejjjj: 103| 4.03k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32(uint32_t B0, uint32_t B1, uint32_t B2, uint32_t B3) noexcept { 104| 4.03k|#if defined(BOTAN_SIMD_USE_SSSE3) 105| 4.03k| m_simd = _mm_set_epi32(B3, B2, B1, B0); 106| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 107| | __vector unsigned int val = {B0, B1, B2, B3}; 108| | m_simd = val; 109| |#elif defined(BOTAN_SIMD_USE_NEON) 110| | // Better way to do this? 111| | const uint32_t B[4] = {B0, B1, B2, B3}; 112| | m_simd = vld1q_u32(B); 113| |#elif defined(BOTAN_SIMD_USE_LSX) 114| | // Better way to do this? 115| | const uint32_t B[4] = {B0, B1, B2, B3}; 116| | m_simd = __lsx_vld(B, 0); 117| |#elif defined(BOTAN_SIMD_USE_SIMD128) 118| | m_simd = wasm_u32x4_make(B0, B1, B2, B3); 119| |#endif 120| 4.03k| } _ZNK5Botan9SIMD_4x32anERKS0_: 421| 32| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator&(const SIMD_4x32& other) const noexcept { 422| 32| SIMD_4x32 retval(*this); 423| 32| retval &= other; 424| 32| return retval; 425| 32| } _ZN5Botan9SIMD_4x32aNERKS0_: 485| 32| void BOTAN_FN_ISA_SIMD_4X32 operator&=(const SIMD_4x32& other) noexcept { 486| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 487| 32| m_simd = _mm_and_si128(m_simd, other.m_simd); 488| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 489| | m_simd = vec_and(m_simd, other.m_simd); 490| |#elif defined(BOTAN_SIMD_USE_NEON) 491| | m_simd = vandq_u32(m_simd, other.m_simd); 492| |#elif defined(BOTAN_SIMD_USE_LSX) 493| | m_simd = __lsx_vand_v(m_simd, other.m_simd); 494| |#elif defined(BOTAN_SIMD_USE_SIMD128) 495| | m_simd = wasm_v128_and(m_simd, other.m_simd); 496| |#endif 497| 32| } _ZNK5Botan9SIMD_4x32eoERKS0_: 403| 860| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator^(const SIMD_4x32& other) const noexcept { 404| 860| SIMD_4x32 retval(*this); 405| 860| retval ^= other; 406| 860| return retval; 407| 860| } _ZNK5Botan9SIMD_4x3211swap_halvesEv: 934| 414| inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 swap_halves() const { 935| 414|#if defined(BOTAN_SIMD_USE_SSSE3) 936| 414| return SIMD_4x32(_mm_shuffle_epi32(raw(), 0b01001110)); 937| |#else 938| | return SIMD_4x32::alignr8(*this, *this); 939| |#endif 940| 414| } _ZN5Botan9SIMD_4x32eOERKS0_: 455| 279k| void BOTAN_FN_ISA_SIMD_4X32 operator^=(const SIMD_4x32& other) noexcept { 456| 279k|#if defined(BOTAN_SIMD_USE_SSSE3) 457| 279k| m_simd = _mm_xor_si128(m_simd, other.m_simd); 458| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 459| | m_simd = vec_xor(m_simd, other.m_simd); 460| |#elif defined(BOTAN_SIMD_USE_NEON) 461| | m_simd = veorq_u32(m_simd, other.m_simd); 462| |#elif defined(BOTAN_SIMD_USE_LSX) 463| | m_simd = __lsx_vxor_v(m_simd, other.m_simd); 464| |#elif defined(BOTAN_SIMD_USE_SIMD128) 465| | m_simd = wasm_v128_xor(m_simd, other.m_simd); 466| |#endif 467| 279k| } _ZNK5Botan9SIMD_4x32orERKS0_: 412| 32| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator|(const SIMD_4x32& other) const noexcept { 413| 32| SIMD_4x32 retval(*this); 414| 32| retval |= other; 415| 32| return retval; 416| 32| } _ZN5Botan9SIMD_4x32oRERKS0_: 471| 32| void BOTAN_FN_ISA_SIMD_4X32 operator|=(const SIMD_4x32& other) noexcept { 472| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 473| 32| m_simd = _mm_or_si128(m_simd, other.m_simd); 474| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 475| | m_simd = vec_or(m_simd, other.m_simd); 476| |#elif defined(BOTAN_SIMD_USE_NEON) 477| | m_simd = vorrq_u32(m_simd, other.m_simd); 478| |#elif defined(BOTAN_SIMD_USE_LSX) 479| | m_simd = __lsx_vor_v(m_simd, other.m_simd); 480| |#elif defined(BOTAN_SIMD_USE_SIMD128) 481| | m_simd = wasm_v128_or(m_simd, other.m_simd); 482| |#endif 483| 32| } _ZNK5Botan9SIMD_4x328store_leEPh: 234| 30.4k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint8_t out[]) const noexcept { 235| 30.4k|#if defined(BOTAN_SIMD_USE_SSSE3) 236| | 237| 30.4k| _mm_storeu_si128(reinterpret_cast<__m128i*>(out), raw()); 238| | 239| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 240| | 241| | union { 242| | __vector unsigned int V; 243| | uint32_t R[4]; 244| | } vec{}; 245| | 246| | // NOLINTNEXTLINE(*-union-access) 247| | vec.V = raw(); 248| | // NOLINTNEXTLINE(*-union-access) 249| | Botan::store_le(out, vec.R[0], vec.R[1], vec.R[2], vec.R[3]); 250| | 251| |#elif defined(BOTAN_SIMD_USE_NEON) 252| | if constexpr(std::endian::native == std::endian::little) { 253| | vst1q_u8(out, vreinterpretq_u8_u32(m_simd)); 254| | } else { 255| | vst1q_u8(out, vreinterpretq_u8_u32(bswap().m_simd)); 256| | } 257| |#elif defined(BOTAN_SIMD_USE_LSX) 258| | __lsx_vst(raw(), out, 0); 259| |#elif defined(BOTAN_SIMD_USE_SIMD128) 260| | wasm_v128_store(out, m_simd); 261| |#endif 262| 30.4k| } _ZN5Botan9SIMD_4x327load_beEPKv: 189| 157k| static SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 load_be(const void* in) noexcept { 190| 157k|#if defined(BOTAN_SIMD_USE_SSSE3) || defined(BOTAN_SIMD_USE_LSX) || defined(BOTAN_SIMD_USE_SIMD128) 191| 157k| return load_le(in).bswap(); 192| | 193| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 194| | uint32_t R0 = Botan::load_be(reinterpret_cast(in), 0); 195| | uint32_t R1 = Botan::load_be(reinterpret_cast(in), 1); 196| | uint32_t R2 = Botan::load_be(reinterpret_cast(in), 2); 197| | uint32_t R3 = Botan::load_be(reinterpret_cast(in), 3); 198| | __vector unsigned int val = {R0, R1, R2, R3}; 199| | return SIMD_4x32(val); 200| | 201| |#elif defined(BOTAN_SIMD_USE_NEON) 202| | SIMD_4x32 l(vld1q_u32(static_cast(in))); 203| | if constexpr(std::endian::native == std::endian::little) { 204| | return l.bswap(); 205| | } else { 206| | return l; 207| | } 208| |#endif 209| 157k| } _ZNK5Botan9SIMD_4x328store_leEPj: 219| 28.4k| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint32_t out[4]) const noexcept { 220| 28.4k| this->store_le(reinterpret_cast(out)); 221| 28.4k| } _ZNK5Botan9SIMD_4x328store_leEPm: 227| 128| void BOTAN_FN_ISA_SIMD_4X32 store_le(uint64_t out[2]) const noexcept { 228| 128| this->store_le(reinterpret_cast(out)); 229| 128| } _ZNK5Botan9SIMD_4x32plERKS0_: 385| 386k| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 operator+(const SIMD_4x32& other) const noexcept { 386| 386k| SIMD_4x32 retval(*this); 387| 386k| retval += other; 388| 386k| return retval; 389| 386k| } _ZN5Botan9SIMD_4x32pLERKS0_: 427| 725k| void BOTAN_FN_ISA_SIMD_4X32 operator+=(const SIMD_4x32& other) noexcept { 428| 725k|#if defined(BOTAN_SIMD_USE_SSSE3) 429| 725k| m_simd = _mm_add_epi32(m_simd, other.m_simd); 430| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 431| | m_simd = vec_add(m_simd, other.m_simd); 432| |#elif defined(BOTAN_SIMD_USE_NEON) 433| | m_simd = vaddq_u32(m_simd, other.m_simd); 434| |#elif defined(BOTAN_SIMD_USE_LSX) 435| | m_simd = __lsx_vadd_w(m_simd, other.m_simd); 436| |#elif defined(BOTAN_SIMD_USE_SIMD128) 437| | m_simd = wasm_i32x4_add(m_simd, other.m_simd); 438| |#endif 439| 725k| } _ZNK5Botan9SIMD_4x325bswapEv: 576| 157k| BOTAN_FN_ISA_SIMD_4X32 SIMD_4x32 bswap() const noexcept { 577| 157k|#if defined(BOTAN_SIMD_USE_SSSE3) 578| 157k| const auto idx = _mm_set_epi8(12, 13, 14, 15, 8, 9, 10, 11, 4, 5, 6, 7, 0, 1, 2, 3); 579| | 580| 157k| return SIMD_4x32(_mm_shuffle_epi8(raw(), idx)); 581| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 582| | #ifdef BOTAN_SIMD_USE_VSX 583| | return SIMD_4x32(vec_revb(m_simd)); 584| | #else 585| | const __vector unsigned char rev[1] = { 586| | {3, 2, 1, 0, 7, 6, 5, 4, 11, 10, 9, 8, 15, 14, 13, 12}, 587| | }; 588| | 589| | return SIMD_4x32(vec_perm(m_simd, m_simd, rev[0])); 590| | #endif 591| | 592| |#elif defined(BOTAN_SIMD_USE_NEON) 593| | return SIMD_4x32(vreinterpretq_u32_u8(vrev32q_u8(vreinterpretq_u8_u32(m_simd)))); 594| |#elif defined(BOTAN_SIMD_USE_LSX) 595| | return SIMD_4x32(__lsx_vshuf4i_b(m_simd, 0b00011011)); 596| |#elif defined(BOTAN_SIMD_USE_SIMD128) 597| | return SIMD_4x32(wasm_i8x16_shuffle(m_simd, m_simd, 3, 2, 1, 0, 7, 6, 5, 4, 11, 10, 9, 8, 15, 14, 13, 12)); 598| |#endif 599| 157k| } _ZN5Botan9SIMD_4x327alignr4ERKS0_S2_: 869| 277k| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr4(const SIMD_4x32& a, const SIMD_4x32& b) { 870| 277k|#if defined(BOTAN_SIMD_USE_SSSE3) 871| 277k| return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 4)); 872| |#elif defined(BOTAN_SIMD_USE_NEON) 873| | return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 1)); 874| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 875| | const __vector unsigned char mask = {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}; 876| | return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask)); 877| |#elif defined(BOTAN_SIMD_USE_LSX) 878| | const auto mask = SIMD_4x32(0x07060504, 0x0B0A0908, 0x0F0E0D0C, 0x13121110); 879| | return SIMD_4x32(__lsx_vshuf_b(a.raw(), b.raw(), mask.raw())); 880| |#elif defined(BOTAN_SIMD_USE_SIMD128) 881| | return SIMD_4x32( 882| | wasm_i8x16_shuffle(b.raw(), a.raw(), 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)); 883| |#endif 884| 277k| } _ZN5Botan9SIMD_4x327alignr8ERKS0_S2_: 886| 24.6k| static inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 alignr8(const SIMD_4x32& a, const SIMD_4x32& b) { 887| 24.6k|#if defined(BOTAN_SIMD_USE_SSSE3) 888| 24.6k| return SIMD_4x32(_mm_alignr_epi8(a.raw(), b.raw(), 8)); 889| |#elif defined(BOTAN_SIMD_USE_NEON) 890| | return SIMD_4x32(vextq_u32(b.raw(), a.raw(), 2)); 891| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 892| | const __vector unsigned char mask = {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}; 893| | return SIMD_4x32(vec_perm(b.raw(), a.raw(), mask)); 894| |#elif defined(BOTAN_SIMD_USE_LSX) 895| | return SIMD_4x32(__lsx_vshuf4i_d(a.raw(), b.raw(), 0b0011)); 896| |#elif defined(BOTAN_SIMD_USE_SIMD128) 897| | return SIMD_4x32( 898| | wasm_i8x16_shuffle(b.raw(), a.raw(), 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)); 899| |#endif 900| 24.6k| } _ZNK5Botan9SIMD_4x3212top_bit_maskEv: 909| 32| inline SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 top_bit_mask() const { 910| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 911| 32| return SIMD_4x32(_mm_shuffle_epi32(_mm_srai_epi32(raw(), 31), 0b11111111)); 912| |#elif defined(BOTAN_SIMD_USE_NEON) 913| | #if defined(BOTAN_TARGET_ARCH_IS_ARM32) 914| | int32x4_t v = vshrq_n_s32(vreinterpretq_s32_u32(raw()), 31); 915| | int32x2_t hi = vget_high_s32(v); 916| | return SIMD_4x32(vreinterpretq_u32_s32(vdupq_lane_s32(hi, 1))); 917| | #else 918| | return SIMD_4x32(vreinterpretq_u32_s32(vdupq_laneq_s32(vshrq_n_s32(vreinterpretq_s32_u32(raw()), 31), 3))); 919| | #endif 920| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 921| | const __vector unsigned int shift = vec_splats(31U); 922| | const __vector signed int shifted = vec_sra(reinterpret_cast<__vector signed int>(raw()), shift); 923| | return SIMD_4x32(reinterpret_cast<__vector unsigned int>(vec_splat(shifted, 3))); 924| |#elif defined(BOTAN_SIMD_USE_LSX) 925| | return SIMD_4x32(__lsx_vshuf4i_w(__lsx_vsrai_w(raw(), 31), 0xFF)); 926| |#elif defined(BOTAN_SIMD_USE_SIMD128) 927| | return SIMD_4x32(wasm_i32x4_splat(wasm_i32x4_extract_lane(wasm_i32x4_shr(raw(), 31), 3))); 928| |#endif 929| 32| } _ZNK5Botan9SIMD_4x3217shift_elems_rightILm2EEES0_vQleT_Li3E: 641| 370k| { 642| 370k|#if defined(BOTAN_SIMD_USE_SSSE3) 643| 370k| return SIMD_4x32(_mm_srli_si128(raw(), 4 * I)); 644| |#elif defined(BOTAN_SIMD_USE_NEON) 645| | return SIMD_4x32(vextq_u32(raw(), vdupq_n_u32(0), I)); 646| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 647| | const __vector unsigned int zero = vec_splat_u32(0); 648| | 649| | const __vector unsigned char shuf[3] = { 650| | {4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}, 651| | {8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}, 652| | {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27}, 653| | }; 654| | 655| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 656| |#elif defined(BOTAN_SIMD_USE_LSX) 657| | return SIMD_4x32(__lsx_vbsrl_v(raw(), 4 * I)); 658| |#elif defined(BOTAN_SIMD_USE_SIMD128) 659| | if constexpr(I == 0) { 660| | return SIMD_4x32(m_simd); 661| | } 662| | 663| | const auto zero = wasm_u32x4_const_splat(0); 664| | if constexpr(I == 1) { 665| | return SIMD_4x32( 666| | wasm_i8x16_shuffle(m_simd, zero, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16)); 667| | } 668| | if constexpr(I == 2) { 669| | return SIMD_4x32( 670| | wasm_i8x16_shuffle(m_simd, zero, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16)); 671| | } 672| | 673| | return SIMD_4x32( 674| | wasm_i8x16_shuffle(m_simd, zero, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16)); 675| |#endif 676| 370k| } _ZNK5Botan9SIMD_4x323shrILi31EEES0_v: 520| 32| SIMD_4x32 BOTAN_FN_ISA_SIMD_4X32 shr() const noexcept { 521| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 522| 32| return SIMD_4x32(_mm_srli_epi32(m_simd, SHIFT)); 523| | 524| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 525| | const unsigned int s = static_cast(SHIFT); 526| | const __vector unsigned int shifts = {s, s, s, s}; 527| | return SIMD_4x32(vec_sr(m_simd, shifts)); 528| |#elif defined(BOTAN_SIMD_USE_NEON) 529| | return SIMD_4x32(vshrq_n_u32(m_simd, SHIFT)); 530| |#elif defined(BOTAN_SIMD_USE_LSX) 531| | return SIMD_4x32(__lsx_vsrli_w(m_simd, SHIFT)); 532| |#elif defined(BOTAN_SIMD_USE_SIMD128) 533| | return SIMD_4x32(wasm_u32x4_shr(m_simd, SHIFT)); 534| |#endif 535| 32| } _ZNK5Botan9SIMD_4x3216shift_elems_leftILm1EEES0_vQleT_Li3E: 604| 32| { 605| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 606| 32| return SIMD_4x32(_mm_slli_si128(raw(), 4 * I)); 607| |#elif defined(BOTAN_SIMD_USE_NEON) 608| | return SIMD_4x32(vextq_u32(vdupq_n_u32(0), raw(), 4 - I)); 609| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 610| | const __vector unsigned int zero = vec_splat_u32(0); 611| | 612| | const __vector unsigned char shuf[3] = { 613| | {16, 17, 18, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, 614| | {16, 17, 18, 19, 20, 21, 22, 23, 0, 1, 2, 3, 4, 5, 6, 7}, 615| | {16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 1, 2, 3}, 616| | }; 617| | 618| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 619| |#elif defined(BOTAN_SIMD_USE_LSX) 620| | return SIMD_4x32(__lsx_vbsll_v(raw(), 4 * I)); 621| |#elif defined(BOTAN_SIMD_USE_SIMD128) 622| | if constexpr(I == 0) { 623| | return SIMD_4x32(m_simd); 624| | } 625| | 626| | const auto zero = wasm_u32x4_const_splat(0); 627| | if constexpr(I == 1) { 628| | 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)); 629| | } 630| | if constexpr(I == 2) { 631| | 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)); 632| | } 633| | 634| | 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)); 635| |#endif 636| 32| } _ZNK5Botan9SIMD_4x323shlILi1EEES0_vQaagtT_Li0EltT_Li32E: 502| 32| { 503| 32|#if defined(BOTAN_SIMD_USE_SSSE3) 504| 32| return SIMD_4x32(_mm_slli_epi32(m_simd, SHIFT)); 505| | 506| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 507| | const unsigned int s = static_cast(SHIFT); 508| | const __vector unsigned int shifts = {s, s, s, s}; 509| | return SIMD_4x32(vec_sl(m_simd, shifts)); 510| |#elif defined(BOTAN_SIMD_USE_NEON) 511| | return SIMD_4x32(vshlq_n_u32(m_simd, SHIFT)); 512| |#elif defined(BOTAN_SIMD_USE_LSX) 513| | return SIMD_4x32(__lsx_vslli_w(m_simd, SHIFT)); 514| |#elif defined(BOTAN_SIMD_USE_SIMD128) 515| | return SIMD_4x32(wasm_i32x4_shl(m_simd, SHIFT)); 516| |#endif 517| 32| } _ZNK5Botan9SIMD_4x3216shift_elems_leftILm2EEES0_vQleT_Li3E: 604| 207| { 605| 207|#if defined(BOTAN_SIMD_USE_SSSE3) 606| 207| return SIMD_4x32(_mm_slli_si128(raw(), 4 * I)); 607| |#elif defined(BOTAN_SIMD_USE_NEON) 608| | return SIMD_4x32(vextq_u32(vdupq_n_u32(0), raw(), 4 - I)); 609| |#elif defined(BOTAN_SIMD_USE_ALTIVEC) 610| | const __vector unsigned int zero = vec_splat_u32(0); 611| | 612| | const __vector unsigned char shuf[3] = { 613| | {16, 17, 18, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, 614| | {16, 17, 18, 19, 20, 21, 22, 23, 0, 1, 2, 3, 4, 5, 6, 7}, 615| | {16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 1, 2, 3}, 616| | }; 617| | 618| | return SIMD_4x32(vec_perm(raw(), zero, shuf[I - 1])); 619| |#elif defined(BOTAN_SIMD_USE_LSX) 620| | return SIMD_4x32(__lsx_vbsll_v(raw(), 4 * I)); 621| |#elif defined(BOTAN_SIMD_USE_SIMD128) 622| | if constexpr(I == 0) { 623| | return SIMD_4x32(m_simd); 624| | } 625| | 626| | const auto zero = wasm_u32x4_const_splat(0); 627| | if constexpr(I == 1) { 628| | 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)); 629| | } 630| | if constexpr(I == 2) { 631| | 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)); 632| | } 633| | 634| | 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)); 635| |#endif 636| 207| } _ZN5Botan9SIMD_4x64C2Ev: 34| 12.1k| BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64() : m_simd(_mm256_setzero_si256()) {} _ZNK5Botan9SIMD_4x645bswapEv: 56| 12.1k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 bswap() const { 57| 12.1k| const auto idx = _mm256_set_epi8( 58| 12.1k| 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); 59| | 60| 12.1k| return SIMD_4x64(_mm256_shuffle_epi8(m_simd, idx)); 61| 12.1k| } _ZN5Botan9SIMD_4x64C2EDv4_x: 196| 475k| explicit BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64(__m256i x) : m_simd(x) {} _ZN5Botan9SIMD_4x64eOERKS0_: 103| 194k| BOTAN_FN_ISA_SIMD_4X64 void operator^=(const SIMD_4x64& other) { 104| 194k| m_simd = _mm256_xor_si256(m_simd, other.m_simd); 105| 194k| } _ZNK5Botan9SIMD_4x64eoERKS0_: 81| 194k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator^(const SIMD_4x64& other) const { 82| 194k| SIMD_4x64 retval(*this); 83| 194k| retval ^= other; 84| 194k| return retval; 85| 194k| } _ZN5Botan9SIMD_4x648load_le2EPKvS2_: 37| 12.1k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_le2(const void* lo, const void* hi) { 38| 12.1k| return SIMD_4x64( 39| 12.1k| _mm256_loadu2_m128i(reinterpret_cast(lo), reinterpret_cast(hi))); 40| 12.1k| } _ZN5Botan9SIMD_4x648load_be2EPKvS2_: 42| 12.1k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 load_be2(const void* lo, const void* hi) { 43| 12.1k| return SIMD_4x64::load_le2(lo, hi).bswap(); 44| 12.1k| } _ZN5Botan9SIMD_4x6414broadcast_2x64EPKm: 52| 60.9k| static BOTAN_FN_ISA_SIMD_4X64 SIMD_4x64 broadcast_2x64(const uint64_t* in) { 53| 60.9k| return SIMD_4x64(_mm256_broadcastsi128_si256(_mm_loadu_si128(reinterpret_cast(in)))); 54| 60.9k| } _ZN5Botan9SIMD_4x649store_le2EPvS1_: 69| 60.9k| BOTAN_FN_ISA_SIMD_4X64 void store_le2(void* outh, void* outl) { 70| 60.9k| _mm256_storeu2_m128i(reinterpret_cast<__m128i*>(outh), reinterpret_cast<__m128i*>(outl), m_simd); 71| 60.9k| } _ZNK5Botan9SIMD_4x64plERKS0_: 75| 207k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 operator+(const SIMD_4x64& other) const { 76| 207k| SIMD_4x64 retval(*this); 77| 207k| retval += other; 78| 207k| return retval; 79| 207k| } _ZN5Botan9SIMD_4x64pLERKS0_: 99| 207k| BOTAN_FN_ISA_SIMD_4X64 void operator+=(const SIMD_4x64& other) { 100| 207k| m_simd = _mm256_add_epi64(m_simd, other.m_simd); 101| 207k| } _ZN5Botan9SIMD_4x647alignr8ERKS0_S2_: 162| 97.4k| static SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 alignr8(const SIMD_4x64& a, const SIMD_4x64& b) { 163| | return SIMD_4x64(_mm256_alignr_epi8(a.m_simd, b.m_simd, 8)); 164| 97.4k| } _ZNK5Botan9SIMD_4x644rotrILm1EEES0_vQaagtT_Li0EltT_Li64E: 116| 48.7k| { 117| |#if defined(__AVX512VL__) 118| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 119| |#else 120| | if constexpr(ROT == 8) { 121| | auto shuf_rot_8 = 122| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 123| | 124| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 125| | } else if constexpr(ROT == 16) { 126| | auto shuf_rot_16 = 127| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 128| | 129| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 130| | } else if constexpr(ROT == 24) { 131| | auto shuf_rot_24 = 132| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 133| | 134| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 135| | } else if constexpr(ROT == 32) { 136| | auto shuf_rot_32 = 137| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 138| | 139| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 140| 48.7k| } else { 141| 48.7k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 142| 48.7k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 143| 48.7k| } 144| 48.7k|#endif 145| 48.7k| } _ZNK5Botan9SIMD_4x644rotrILm8EEES0_vQaagtT_Li0EltT_Li64E: 116| 48.7k| { 117| |#if defined(__AVX512VL__) 118| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 119| |#else 120| 48.7k| if constexpr(ROT == 8) { 121| 48.7k| auto shuf_rot_8 = 122| 48.7k| _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 123| | 124| 48.7k| return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 125| | } else if constexpr(ROT == 16) { 126| | auto shuf_rot_16 = 127| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 128| | 129| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 130| | } else if constexpr(ROT == 24) { 131| | auto shuf_rot_24 = 132| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 133| | 134| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 135| | } else if constexpr(ROT == 32) { 136| | auto shuf_rot_32 = 137| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 138| | 139| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 140| | } else { 141| | return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 142| | _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 143| | } 144| 48.7k|#endif 145| 48.7k| } _ZNK5Botan9SIMD_4x643shrILi7EEES0_v: 153| 48.7k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 154| 48.7k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 155| 48.7k| } _ZNK5Botan9SIMD_4x644rotrILm19EEES0_vQaagtT_Li0EltT_Li64E: 116| 48.7k| { 117| |#if defined(__AVX512VL__) 118| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 119| |#else 120| | if constexpr(ROT == 8) { 121| | auto shuf_rot_8 = 122| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 123| | 124| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 125| | } else if constexpr(ROT == 16) { 126| | auto shuf_rot_16 = 127| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 128| | 129| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 130| | } else if constexpr(ROT == 24) { 131| | auto shuf_rot_24 = 132| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 133| | 134| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 135| | } else if constexpr(ROT == 32) { 136| | auto shuf_rot_32 = 137| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 138| | 139| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 140| 48.7k| } else { 141| 48.7k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 142| 48.7k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 143| 48.7k| } 144| 48.7k|#endif 145| 48.7k| } _ZNK5Botan9SIMD_4x644rotrILm61EEES0_vQaagtT_Li0EltT_Li64E: 116| 48.7k| { 117| |#if defined(__AVX512VL__) 118| | return SIMD_4x64(_mm256_ror_epi64(m_simd, ROT)); 119| |#else 120| | if constexpr(ROT == 8) { 121| | auto shuf_rot_8 = 122| | _mm256_set_epi64x(0x080f0e0d0c0b0a09, 0x0007060504030201, 0x080f0e0d0c0b0a09, 0x0007060504030201); 123| | 124| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_8)); 125| | } else if constexpr(ROT == 16) { 126| | auto shuf_rot_16 = 127| | _mm256_set_epi64x(0x09080f0e0d0c0b0a, 0x0100070605040302, 0x09080f0e0d0c0b0a, 0x0100070605040302); 128| | 129| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_16)); 130| | } else if constexpr(ROT == 24) { 131| | auto shuf_rot_24 = 132| | _mm256_set_epi64x(0x0a09080f0e0d0c0b, 0x0201000706050403, 0x0a09080f0e0d0c0b, 0x0201000706050403); 133| | 134| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_24)); 135| | } else if constexpr(ROT == 32) { 136| | auto shuf_rot_32 = 137| | _mm256_set_epi64x(0x0b0a09080f0e0d0c, 0x0302010007060504, 0x0b0a09080f0e0d0c, 0x0302010007060504); 138| | 139| | return SIMD_4x64(_mm256_shuffle_epi8(m_simd, shuf_rot_32)); 140| 48.7k| } else { 141| 48.7k| return SIMD_4x64(_mm256_or_si256(_mm256_srli_epi64(m_simd, static_cast(ROT)), 142| 48.7k| _mm256_slli_epi64(m_simd, static_cast(64 - ROT)))); 143| 48.7k| } 144| 48.7k|#endif 145| 48.7k| } _ZNK5Botan9SIMD_4x643shrILi6EEES0_v: 153| 48.7k| SIMD_4x64 BOTAN_FN_ISA_SIMD_4X64 shr() const noexcept { 154| 48.7k| return SIMD_4x64(_mm256_srli_epi64(m_simd, SHIFT)); 155| 48.7k| } _ZN5Botan9SIMD_8x32C2Ejjjjjjjj: 46| 5.40k| uint32_t B7) noexcept { 47| | // NOLINTNEXTLINE(*-prefer-member-initializer) 48| 5.40k| m_avx2 = _mm256_set_epi32(B7, B6, B5, B4, B3, B2, B1, B0); 49| 5.40k| } _ZN5Botan9SIMD_8x325splatEj: 58| 86.4k| static SIMD_8x32 splat(uint32_t B) noexcept { return SIMD_8x32(_mm256_set1_epi32(B)); } _ZNK5Botan9SIMD_8x328store_leEPh: 84| 43.2k| void store_le(uint8_t out[]) const noexcept { _mm256_storeu_si256(reinterpret_cast<__m256i*>(out), m_avx2); } _ZNK5Botan9SIMD_8x32plERKS0_: 164| 10.8k| SIMD_8x32 operator+(const SIMD_8x32& other) const noexcept { 165| 10.8k| SIMD_8x32 retval(*this); 166| 10.8k| retval += other; 167| 10.8k| return retval; 168| 10.8k| } _ZN5Botan9SIMD_8x32pLERKS0_: 199| 919k| void operator+=(const SIMD_8x32& other) { m_avx2 = _mm256_add_epi32(m_avx2, other.m_avx2); } _ZN5Botan9SIMD_8x32eOERKS0_: 205| 864k| void operator^=(const SIMD_8x32& other) { m_avx2 = _mm256_xor_si256(m_avx2, other.m_avx2); } _ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_: 264| 10.8k| static void transpose(SIMD_8x32& B0, SIMD_8x32& B1, SIMD_8x32& B2, SIMD_8x32& B3) noexcept { 265| 10.8k| const __m256i T0 = _mm256_unpacklo_epi32(B0.m_avx2, B1.m_avx2); 266| 10.8k| const __m256i T1 = _mm256_unpacklo_epi32(B2.m_avx2, B3.m_avx2); 267| 10.8k| const __m256i T2 = _mm256_unpackhi_epi32(B0.m_avx2, B1.m_avx2); 268| 10.8k| const __m256i T3 = _mm256_unpackhi_epi32(B2.m_avx2, B3.m_avx2); 269| | 270| 10.8k| B0.m_avx2 = _mm256_unpacklo_epi64(T0, T1); 271| 10.8k| B1.m_avx2 = _mm256_unpackhi_epi64(T0, T1); 272| 10.8k| B2.m_avx2 = _mm256_unpacklo_epi64(T2, T3); 273| 10.8k| B3.m_avx2 = _mm256_unpackhi_epi64(T2, T3); 274| 10.8k| } _ZN5Botan9SIMD_8x329transposeERS0_S1_S1_S1_S1_S1_S1_S1_: 302| 5.40k| SIMD_8x32& B7) noexcept { 303| 5.40k| transpose(B0, B1, B2, B3); 304| 5.40k| transpose(B4, B5, B6, B7); 305| | 306| 5.40k| swap_tops(B0, B4); 307| 5.40k| swap_tops(B1, B5); 308| 5.40k| swap_tops(B2, B6); 309| 5.40k| swap_tops(B3, B7); 310| 5.40k| } _ZN5Botan9SIMD_8x3215reset_registersEv: 335| 2.70k| static void reset_registers() noexcept { _mm256_zeroupper(); } _ZN5Botan9SIMD_8x3214zero_registersEv: 338| 2.70k| static void zero_registers() noexcept { _mm256_zeroall(); } _ZNK5Botan9SIMD_8x323rawEv: 340| 86.4k| __m256i BOTAN_FN_ISA_AVX2 raw() const noexcept { return m_avx2; } _ZN5Botan9SIMD_8x32C2EDv4_x: 343| 994k| explicit SIMD_8x32(__m256i x) noexcept : m_avx2(x) {} _ZN5Botan9SIMD_8x329swap_topsERS0_S1_: 347| 21.6k| static void swap_tops(SIMD_8x32& A, SIMD_8x32& B) { 348| 21.6k| auto T0 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 0 + (2 << 4))); 349| | auto T1 = SIMD_8x32(_mm256_permute2x128_si256(A.raw(), B.raw(), 1 + (3 << 4))); 350| 21.6k| A = T0; 351| 21.6k| B = T1; 352| 21.6k| } _ZNK5Botan9SIMD_8x324rotlILm7EEES0_vQaagtT_Li0EltT_Li32E: 118| 216k| { 119| |#if defined(__AVX512VL__) 120| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 121| |#else 122| | if constexpr(ROT == 8) { 123| | const __m256i shuf_rotl_8 = 124| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 125| | 126| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 127| | } else if constexpr(ROT == 16) { 128| | const __m256i shuf_rotl_16 = 129| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 130| | 131| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 132| | } else if constexpr(ROT == 24) { 133| | const __m256i shuf_rotl_24 = 134| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 137| 216k| } else { 138| 216k| return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 139| 216k| _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 140| 216k| } 141| 216k|#endif 142| 216k| } _ZNK5Botan9SIMD_8x324rotlILm16EEES0_vQaagtT_Li0EltT_Li32E: 118| 216k| { 119| |#if defined(__AVX512VL__) 120| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 121| |#else 122| | if constexpr(ROT == 8) { 123| | const __m256i shuf_rotl_8 = 124| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 125| | 126| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 127| 216k| } else if constexpr(ROT == 16) { 128| 216k| const __m256i shuf_rotl_16 = 129| 216k| _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 130| | 131| 216k| return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 132| | } else if constexpr(ROT == 24) { 133| | const __m256i shuf_rotl_24 = 134| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 137| | } else { 138| | return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 139| | _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 140| | } 141| 216k|#endif 142| 216k| } _ZNK5Botan9SIMD_8x324rotlILm12EEES0_vQaagtT_Li0EltT_Li32E: 118| 216k| { 119| |#if defined(__AVX512VL__) 120| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 121| |#else 122| | if constexpr(ROT == 8) { 123| | const __m256i shuf_rotl_8 = 124| | _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 125| | 126| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 127| | } else if constexpr(ROT == 16) { 128| | const __m256i shuf_rotl_16 = 129| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 130| | 131| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 132| | } else if constexpr(ROT == 24) { 133| | const __m256i shuf_rotl_24 = 134| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 137| 216k| } else { 138| 216k| return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 139| 216k| _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 140| 216k| } 141| 216k|#endif 142| 216k| } _ZNK5Botan9SIMD_8x324rotlILm8EEES0_vQaagtT_Li0EltT_Li32E: 118| 216k| { 119| |#if defined(__AVX512VL__) 120| | return SIMD_8x32(_mm256_rol_epi32(m_avx2, ROT)); 121| |#else 122| 216k| if constexpr(ROT == 8) { 123| 216k| const __m256i shuf_rotl_8 = 124| 216k| _mm256_set_epi64x(0x0e0d0c0f'0a09080b, 0x06050407'02010003, 0x0e0d0c0f'0a09080b, 0x06050407'02010003); 125| | 126| 216k| return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_8)); 127| | } else if constexpr(ROT == 16) { 128| | const __m256i shuf_rotl_16 = 129| | _mm256_set_epi64x(0x0d0c0f0e'09080b0a, 0x05040706'01000302, 0x0d0c0f0e'09080b0a, 0x05040706'01000302); 130| | 131| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_16)); 132| | } else if constexpr(ROT == 24) { 133| | const __m256i shuf_rotl_24 = 134| | _mm256_set_epi64x(0x0c0f0e0d'080b0a09, 0x04070605'00030201, 0x0c0f0e0d'080b0a09, 0x04070605'00030201); 135| | 136| | return SIMD_8x32(_mm256_shuffle_epi8(m_avx2, shuf_rotl_24)); 137| | } else { 138| | return SIMD_8x32(_mm256_xor_si256(_mm256_slli_epi32(m_avx2, static_cast(ROT)), 139| | _mm256_srli_epi32(m_avx2, static_cast(32 - ROT)))); 140| | } 141| 216k|#endif 142| 216k| } _ZN5Botan12value_existsINSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EEEEbRKNS1_6vectorIT_NS5_ISB_EEEERKT0_: 44| 131k|bool value_exists(const std::vector& vec, const V& val) { 45| 241k| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 241k, False: 0] ------------------ 46| 241k| if(elem == val) { ------------------ | Branch (46:10): [True: 131k, False: 109k] ------------------ 47| 131k| return true; 48| 131k| } 49| 241k| } 50| 0| return false; 51| 131k|} _ZN5Botan12value_existsINS_3TLS16Signature_SchemeES2_EEbRKNSt3__16vectorIT_NS3_9allocatorIS5_EEEERKT0_: 44| 621|bool value_exists(const std::vector& vec, const V& val) { 45| 3.02k| for(const auto& elem : vec) { ------------------ | Branch (45:25): [True: 3.02k, False: 0] ------------------ 46| 3.02k| if(elem == val) { ------------------ | Branch (46:10): [True: 621, False: 2.40k] ------------------ 47| 621| return true; 48| 621| } 49| 3.02k| } 50| 0| return false; 51| 621|} 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| 4|void map_remove_if(Pred pred, T& assoc) { 55| 4| auto i = assoc.begin(); 56| 12| while(i != assoc.end()) { ------------------ | Branch (56:10): [True: 8, False: 4] ------------------ 57| 8| if(pred(i->first)) { ------------------ | Branch (57:10): [True: 4, False: 4] ------------------ 58| 4| assoc.erase(i++); 59| 4| } else { 60| 4| i++; 61| 4| } 62| 8| } 63| 4|} _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode8tag_sizeEv: 43| 228| size_t tag_size() const final { return m_tag_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode7iv_sizeEv: 74| 19| size_t iv_size() const { return m_iv_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode10block_sizeEv: 76| 199| size_t block_size() const { return m_block_size; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode20use_encrypt_then_macEv: 78| 214| bool use_encrypt_then_mac() const { return m_use_encrypt_then_mac; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode20is_datagram_protocolEv: 80| 2| bool is_datagram_protocol() const { return m_is_datagram; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3cbcEv: 82| 118| Cipher_Mode& cbc() const { return *m_cbc; } _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3macEv: 84| 166| MessageAuthenticationCode& mac() const { return *m_mac; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode9cbc_stateEv: 86| 88| secure_vector& cbc_state() { return m_cbc_state; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode10assoc_dataEv: 88| 42| std::vector& assoc_data() { return m_ad; } _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode3msgEv: 90| 88| secure_vector& msg() { return m_msg; } _ZNK5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption18minimum_final_sizeEv: 159| 2| size_t minimum_final_size() const override { return tag_size(); } _ZNK5Botan3TLS12Channel_Impl14is_downgradingEv: 269| 155| bool is_downgrading() const { return m_downgrade_info && m_downgrade_info->will_downgrade; } ------------------ | Branch (269:44): [True: 0, False: 155] | Branch (269:64): [True: 0, False: 0] ------------------ _ZN5Botan3TLS12Channel_Impl18send_warning_alertENS0_9AlertTypeE: 66| 423| void send_warning_alert(Alert::Type type) { send_alert(Alert(type, false)); } _ZN5Botan3TLS12Channel_Impl16send_fatal_alertENS0_9AlertTypeE: 71| 7.13k| void send_fatal_alert(Alert::Type type) { send_alert(Alert(type, true)); } _ZN5Botan3TLS12Channel_ImplC2Ev: 185| 7.28k| Channel_Impl() = default; _ZN5Botan3TLS12Channel_ImplD2Ev: 36| 7.28k| virtual ~Channel_Impl() = default; _ZNK5Botan3TLS15Channel_Impl_1212active_stateEv: 153| 4.05k| const std::optional& active_state() const { return m_active_state; } _ZN5Botan3TLS15Channel_Impl_123rngEv: 179| 7.68k| RandomNumberGenerator& rng() { return *m_rng; } _ZN5Botan3TLS15Channel_Impl_1215session_managerEv: 181| 7.28k| Session_Manager& session_manager() { return *m_session_manager; } _ZNK5Botan3TLS15Channel_Impl_126policyEv: 183| 42.6k| const Policy& policy() const { return *m_policy; } _ZNK5Botan3TLS15Channel_Impl_129callbacksEv: 185| 44.3k| Callbacks& callbacks() const { return *m_callbacks; } _ZNK5Botan3TLS15Channel_Impl_1213pending_stateEv: 209| 32.5k| const Handshake_State* pending_state() const { return m_pending_state.get(); } _ZNK5Botan3TLS14Client_Impl_1220application_protocolEv: 64| 2| std::string application_protocol() const override { return m_application_protocol; } _ZNK5Botan3TLS26Active_Connection_State_127versionEv: 47| 2| Protocol_Version version() const { return m_version; } _ZNK5Botan3TLS26Active_Connection_State_1210session_idEv: 61| 2| const Session_ID& session_id() const { return m_session_id; } _ZN5Botan3TLS14Handshake_Hash6updateERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 23| 18.0k| void update(const std::vector& in) { m_data += in; } _ZN5Botan3TLS12Handshake_IOC2Ev: 69| 7.28k| Handshake_IO() = default; _ZN5Botan3TLS12Handshake_IOD2Ev: 76| 7.28k| virtual ~Handshake_IO() = default; _ZN5Botan3TLS19Stream_Handshake_IOC2ENSt3__18functionIFvNS0_11Record_TypeERKNS2_6vectorIhNS2_9allocatorIhEEEEEEE: 86| 7.28k| explicit Stream_Handshake_IO(writer_fn writer) : m_send_hs(std::move(writer)) {} _ZNK5Botan3TLS19Stream_Handshake_IO14have_more_dataEv: 92| 317| bool have_more_data() const override { return !m_queue.empty(); } _ZN5Botan3TLS15Handshake_State12handshake_ioEv: 71| 30.3k| Handshake_IO& handshake_io() { return *m_handshake_io; } _ZNK5Botan3TLS15Handshake_State12server_helloEv: 137| 103k| const Server_Hello_12* server_hello() const { return m_server_hello.get(); } _ZNK5Botan3TLS15Handshake_State7versionEv: 110| 38.5k| Protocol_Version version() const { return m_version; } _ZNK5Botan3TLS15Handshake_State12session_keysEv: 169| 125| const Session_Keys& session_keys() const { return m_session_keys; } _ZNK5Botan3TLS15Handshake_State12client_helloEv: 135| 38.0k| const Client_Hello_12* client_hello() const { return m_client_hello.get(); } _ZNK5Botan3TLS15Handshake_State12server_certsEv: 139| 1.23k| const Certificate_12* server_certs() const { return m_server_certs.get(); } _ZNK5Botan3TLS15Handshake_State10server_kexEv: 141| 919| const Server_Key_Exchange* server_kex() const { return m_server_kex.get(); } _ZNK5Botan3TLS15Handshake_State10client_kexEv: 149| 112| const Client_Key_Exchange* client_kex() const { return m_client_kex.get(); } _ZNK5Botan3TLS15Handshake_State18new_session_ticketEv: 157| 8| const New_Session_Ticket_12* new_session_ticket() const { return m_new_session_ticket.get(); } _ZNK5Botan3TLS15Handshake_State15server_finishedEv: 159| 4| const Finished_12* server_finished() const { return m_server_finished.get(); } _ZNK5Botan3TLS15Handshake_State15client_finishedEv: 161| 4| const Finished_12* client_finished() const { return m_client_finished.get(); } _ZNK5Botan3TLS15Handshake_State9callbacksEv: 171| 386| Callbacks& callbacks() const { return m_callbacks; } _ZN5Botan3TLS15Handshake_State4hashEv: 177| 18.0k| Handshake_Hash& hash() { return m_handshake_hash; } _ZNK5Botan3TLS15Handshake_State4hashEv: 179| 114| const Handshake_Hash& hash() const { return m_handshake_hash; } _ZNK5Botan3TLS21Server_Hello_Internal10extensionsEv: 144| 5.61k| const Extensions& extensions() const { return m_extensions; } _ZNK5Botan3TLS21Server_Hello_Internal14legacy_versionEv: 132| 24.8k| Protocol_Version legacy_version() const { return m_legacy_version; } _ZNK5Botan3TLS21Server_Hello_Internal6randomEv: 136| 619| const std::vector& random() const { return m_random; } _ZNK5Botan3TLS21Server_Hello_Internal10session_idEv: 134| 3.19k| const Session_ID& session_id() const { return m_session_id; } _ZNK5Botan3TLS21Server_Hello_Internal11ciphersuiteEv: 138| 21.9k| uint16_t ciphersuite() const { return m_ciphersuite; } _ZNK5Botan3TLS21Server_Hello_Internal11comp_methodEv: 140| 5.51k| uint8_t comp_method() const { return m_comp_method; } _ZN5Botan3TLS21Server_Hello_Internal10extensionsEv: 146| 44.5k| Extensions& extensions() { return m_extensions; } _ZN5Botan3TLS21Client_Hello_InternalC2Ev: 59| 7.28k| Client_Hello_Internal() : m_comp_methods({0}) {} _ZNK5Botan3TLS21Client_Hello_Internal14legacy_versionEv: 74| 55.4k| Protocol_Version legacy_version() const { return m_legacy_version; } _ZNK5Botan3TLS21Client_Hello_Internal10session_idEv: 76| 7.35k| const Session_ID& session_id() const { return m_session_id; } _ZNK5Botan3TLS21Client_Hello_Internal6randomEv: 78| 7.65k| const std::vector& random() const { return m_random; } _ZNK5Botan3TLS21Client_Hello_Internal12ciphersuitesEv: 80| 23.7k| const std::vector& ciphersuites() const { return m_suites; } _ZNK5Botan3TLS21Client_Hello_Internal12comp_methodsEv: 82| 7.28k| const std::vector& comp_methods() const { return m_comp_methods; } _ZN5Botan3TLS21Client_Hello_Internal10extensionsEv: 90| 107k| Extensions& extensions() { return m_extensions; } _ZN5Botan3TLS15TLS_Data_ReaderC2EPKcNSt3__14spanIKhLm18446744073709551615EEE: 27| 21.1k| m_typename(type), m_buf(buf_in), m_offset(0) {} _ZN5Botan3TLS15TLS_Data_Reader8get_byteEv: 83| 35.7k| uint8_t get_byte() { 84| 35.7k| assert_at_least(1); 85| 35.7k| const uint8_t result = m_buf[m_offset]; 86| 35.7k| m_offset += 1; 87| 35.7k| return result; 88| 35.7k| } _ZN5Botan3TLS15TLS_Data_Reader12get_uint16_tEv: 71| 44.9k| uint16_t get_uint16_t() { 72| 44.9k| assert_at_least(2); 73| 44.9k| const uint16_t result = make_uint16(m_buf[m_offset], m_buf[m_offset + 1]); 74| 44.9k| m_offset += 2; 75| 44.9k| return result; 76| 44.9k| } _ZN5Botan3TLS15TLS_Data_Reader9get_fixedIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEm: 129| 22.6k| std::vector get_fixed(size_t size) { 130| 22.6k| return get_elem>(size); 131| 22.6k| } _ZN5Botan3TLS15TLS_Data_Reader8get_elemIhNSt3__16vectorIhNS3_9allocatorIhEEEEEET0_m: 91| 42.7k| Container get_elem(size_t num_elems) { 92| 42.7k| assert_at_least(num_elems * sizeof(T)); 93| | 94| 42.7k| Container result(num_elems); 95| | 96| 1.32M| for(size_t i = 0; i != num_elems; ++i) { ------------------ | Branch (96:28): [True: 1.28M, False: 42.7k] ------------------ 97| 1.28M| result[i] = load_be(&m_buf[m_offset], i); 98| 1.28M| } 99| | 100| 42.7k| m_offset += num_elems * sizeof(T); 101| | 102| 42.7k| return result; 103| 42.7k| } _ZN5Botan3TLS15TLS_Data_Reader9get_rangeIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 110| 13.1k| std::vector get_range(size_t len_bytes, size_t min_elems, size_t max_elems) { 111| 13.1k| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 112| | 113| 13.1k| return get_elem>(num_elems); 114| 13.1k| } _ZN5Botan3TLS15TLS_Data_Reader13get_num_elemsEmmmm: 148| 17.0k| size_t get_num_elems(size_t len_bytes, size_t T_size, size_t min_elems, size_t max_elems) { 149| 17.0k| const size_t byte_length = get_length_field(len_bytes); 150| | 151| 17.0k| if(byte_length % T_size != 0) { ------------------ | Branch (151:13): [True: 0, False: 17.0k] ------------------ 152| 0| throw_decode_error("Size isn't multiple of T"); 153| 0| } 154| | 155| 17.0k| const size_t num_elems = byte_length / T_size; 156| | 157| 17.0k| if(num_elems < min_elems || num_elems > max_elems) { ------------------ | Branch (157:13): [True: 22, False: 17.0k] | Branch (157:38): [True: 19, False: 17.0k] ------------------ 158| 37| throw_decode_error("Length field outside parameters"); 159| 37| } 160| | 161| 17.0k| return num_elems; 162| 17.0k| } _ZN5Botan3TLS15TLS_Data_Reader16get_length_fieldEm: 134| 17.0k| size_t get_length_field(size_t len_bytes) { 135| 17.0k| assert_at_least(len_bytes); 136| | 137| 17.0k| if(len_bytes == 1) { ------------------ | Branch (137:13): [True: 14.1k, False: 2.97k] ------------------ 138| 14.1k| return get_byte(); 139| 14.1k| } else if(len_bytes == 2) { ------------------ | Branch (139:20): [True: 2.97k, False: 4] ------------------ 140| 2.97k| return get_uint16_t(); 141| 2.97k| } else if(len_bytes == 3) { ------------------ | Branch (141:20): [True: 0, False: 4] ------------------ 142| 0| return get_uint24_t(); 143| 0| } 144| | 145| 4| throw_decode_error("Bad length size"); 146| 4| } _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEES4_EEvRNS2_6vectorIhT0_EERKNS5_IT_T1_EEm: 209| 21.9k| size_t tag_size) { 210| 21.9k| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 21.9k|} _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EENS2_4spanIKT_Lm18446744073709551615EEEm: 202| 21.9k|inline void append_tls_length_value(std::vector& buf, std::span vals, size_t tag_size) { 203| 21.9k| append_tls_length_value(buf, vals.data(), vals.size(), tag_size); 204| 21.9k|} _ZN5Botan3TLS23append_tls_length_valueIhNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EEPKT_mm: 180| 21.9k| size_t tag_size) { 181| 21.9k| const size_t T_size = sizeof(T); 182| 21.9k| const size_t val_bytes = T_size * vals_size; 183| | 184| 21.9k| BOTAN_ARG_CHECK(tag_size == 1 || tag_size == 2 || tag_size == 3, "Invalid TLS tag size"); ------------------ | | 35| 21.9k| do { \ | | 36| 21.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 43.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 21.8k, False: 56] | | | Branch (37:12): [True: 56, 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| 21.9k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 21.9k] | | ------------------ ------------------ 185| | 186| 21.9k| const size_t max_possible_size = (1 << (8 * tag_size)) - 1; 187| | 188| 21.9k| BOTAN_ARG_CHECK(val_bytes <= max_possible_size, "Value too large to encode"); ------------------ | | 35| 21.9k| do { \ | | 36| 21.9k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 21.9k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 21.9k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 21.9k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 21.9k] | | ------------------ ------------------ 189| | 190| 43.8k| for(size_t i = 0; i != tag_size; ++i) { ------------------ | Branch (190:22): [True: 21.9k, False: 21.9k] ------------------ 191| 21.9k| buf.push_back(get_byte_var(sizeof(val_bytes) - tag_size + i, val_bytes)); 192| 21.9k| } 193| | 194| 40.5k| for(size_t i = 0; i != vals_size; ++i) { ------------------ | Branch (194:22): [True: 18.6k, False: 21.9k] ------------------ 195| 37.3k| for(size_t j = 0; j != T_size; ++j) { ------------------ | Branch (195:25): [True: 18.6k, False: 18.6k] ------------------ 196| 18.6k| buf.push_back(get_byte_var(j, vals[i])); 197| 18.6k| } 198| 18.6k| } 199| 21.9k|} _ZNK5Botan3TLS15TLS_Data_Reader11assert_doneEv: 29| 12.8k| void assert_done() const { 30| 12.8k| if(has_remaining()) { ------------------ | Branch (30:13): [True: 10, False: 12.8k] ------------------ 31| 10| throw_decode_error("Extra bytes at end of message"); 32| 10| } 33| 12.8k| } _ZNK5Botan3TLS15TLS_Data_Reader11read_so_farEv: 35| 319| size_t read_so_far() const { return m_offset; } _ZNK5Botan3TLS15TLS_Data_Reader15remaining_bytesEv: 37| 198k| size_t remaining_bytes() const { return m_buf.size() - m_offset; } _ZNK5Botan3TLS15TLS_Data_Reader13has_remainingEv: 39| 37.7k| bool has_remaining() const { return (remaining_bytes() > 0); } _ZN5Botan3TLS15TLS_Data_Reader12discard_nextEm: 51| 342| void discard_next(size_t bytes) { 52| 342| assert_at_least(bytes); 53| 342| m_offset += bytes; 54| 342| } _ZN5Botan3TLS15TLS_Data_Reader12get_uint32_tEv: 56| 6| uint32_t get_uint32_t() { 57| 6| assert_at_least(4); 58| 6| const uint32_t result = 59| 6| make_uint32(m_buf[m_offset], m_buf[m_offset + 1], m_buf[m_offset + 2], m_buf[m_offset + 3]); 60| 6| m_offset += 4; 61| 6| return result; 62| 6| } _ZN5Botan3TLS15TLS_Data_Reader10get_stringEmmm: 123| 3.84k| std::string get_string(size_t len_bytes, size_t min_bytes, size_t max_bytes) { 124| 3.84k| std::vector v = get_range_vector(len_bytes, min_bytes, max_bytes); 125| 3.84k| return bytes_to_string(v); 126| 3.84k| } _ZN5Botan3TLS15TLS_Data_Reader16get_range_vectorIhEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 117| 3.91k| std::vector get_range_vector(size_t len_bytes, size_t min_elems, size_t max_elems) { 118| 3.91k| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 119| | 120| 3.91k| return get_elem>(num_elems); 121| 3.91k| } _ZN5Botan3TLS15TLS_Data_Reader9get_rangeItEENSt3__16vectorIT_NS3_9allocatorIS5_EEEEmmm: 110| 22| std::vector get_range(size_t len_bytes, size_t min_elems, size_t max_elems) { 111| 22| const size_t num_elems = get_num_elems(len_bytes, sizeof(T), min_elems, max_elems); 112| | 113| 22| return get_elem>(num_elems); 114| 22| } _ZN5Botan3TLS15TLS_Data_Reader8get_elemItNSt3__16vectorItNS3_9allocatorItEEEEEET0_m: 91| 7| Container get_elem(size_t num_elems) { 92| 7| assert_at_least(num_elems * sizeof(T)); 93| | 94| 7| Container result(num_elems); 95| | 96| 151| for(size_t i = 0; i != num_elems; ++i) { ------------------ | Branch (96:28): [True: 144, False: 7] ------------------ 97| 144| result[i] = load_be(&m_buf[m_offset], i); 98| 144| } 99| | 100| 7| m_offset += num_elems * sizeof(T); 101| | 102| 7| return result; 103| 7| } _ZN5Botan3TLS23append_tls_length_valueItNSt3__19allocatorIhEENS3_ItEEEEvRNS2_6vectorIhT0_EERKNS6_IT_T1_EEm: 209| 7.28k| size_t tag_size) { 210| 7.28k| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 7.28k|} _ZN5Botan3TLS23append_tls_length_valueItNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EENS2_4spanIKT_Lm18446744073709551615EEEm: 202| 7.28k|inline void append_tls_length_value(std::vector& buf, std::span vals, size_t tag_size) { 203| 7.28k| append_tls_length_value(buf, vals.data(), vals.size(), tag_size); 204| 7.28k|} _ZN5Botan3TLS23append_tls_length_valueItNSt3__19allocatorIhEEEEvRNS2_6vectorIhT0_EEPKT_mm: 180| 7.28k| size_t tag_size) { 181| 7.28k| const size_t T_size = sizeof(T); 182| 7.28k| const size_t val_bytes = T_size * vals_size; 183| | 184| 7.28k| BOTAN_ARG_CHECK(tag_size == 1 || tag_size == 2 || tag_size == 3, "Invalid TLS tag size"); ------------------ | | 35| 7.28k| do { \ | | 36| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 21.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 7.28k] | | | Branch (37:12): [True: 7.28k, 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.28k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.28k] | | ------------------ ------------------ 185| | 186| 7.28k| const size_t max_possible_size = (1 << (8 * tag_size)) - 1; 187| | 188| 7.28k| BOTAN_ARG_CHECK(val_bytes <= max_possible_size, "Value too large to encode"); ------------------ | | 35| 7.28k| do { \ | | 36| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 7.28k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 7.28k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.28k] | | ------------------ ------------------ 189| | 190| 21.8k| for(size_t i = 0; i != tag_size; ++i) { ------------------ | Branch (190:22): [True: 14.5k, False: 7.28k] ------------------ 191| 14.5k| buf.push_back(get_byte_var(sizeof(val_bytes) - tag_size + i, val_bytes)); 192| 14.5k| } 193| | 194| 655k| for(size_t i = 0; i != vals_size; ++i) { ------------------ | Branch (194:22): [True: 648k, False: 7.28k] ------------------ 195| 1.94M| for(size_t j = 0; j != T_size; ++j) { ------------------ | Branch (195:25): [True: 1.29M, False: 648k] ------------------ 196| 1.29M| buf.push_back(get_byte_var(j, vals[i])); 197| 1.29M| } 198| 648k| } 199| 7.28k|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEENSt3__19allocatorIhEEEEvRNS4_6vectorIhT0_EERKNS7_IT_T1_EEm: 209| 15| size_t tag_size) { 210| 15| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 15|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT0_EENS4_4spanIKT_Lm18446744073709551615EEEm: 202| 30|inline void append_tls_length_value(std::vector& buf, std::span vals, size_t tag_size) { 203| 30| append_tls_length_value(buf, vals.data(), vals.size(), tag_size); 204| 30|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIhT0_EEPKT_mm: 180| 30| size_t tag_size) { 181| 30| const size_t T_size = sizeof(T); 182| 30| const size_t val_bytes = T_size * vals_size; 183| | 184| 30| BOTAN_ARG_CHECK(tag_size == 1 || tag_size == 2 || tag_size == 3, "Invalid TLS tag size"); ------------------ | | 35| 30| do { \ | | 36| 30| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 90| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 30] | | | Branch (37:12): [True: 30, 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| 30| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 30] | | ------------------ ------------------ 185| | 186| 30| const size_t max_possible_size = (1 << (8 * tag_size)) - 1; 187| | 188| 30| BOTAN_ARG_CHECK(val_bytes <= max_possible_size, "Value too large to encode"); ------------------ | | 35| 30| do { \ | | 36| 30| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 30| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 30] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 30| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 30] | | ------------------ ------------------ 189| | 190| 90| for(size_t i = 0; i != tag_size; ++i) { ------------------ | Branch (190:22): [True: 60, False: 30] ------------------ 191| 60| buf.push_back(get_byte_var(sizeof(val_bytes) - tag_size + i, val_bytes)); 192| 60| } 193| | 194| 510| for(size_t i = 0; i != vals_size; ++i) { ------------------ | Branch (194:22): [True: 480, False: 30] ------------------ 195| 960| for(size_t j = 0; j != T_size; ++j) { ------------------ | Branch (195:25): [True: 480, False: 480] ------------------ 196| 480| buf.push_back(get_byte_var(j, vals[i])); 197| 480| } 198| 480| } 199| 30|} _ZN5Botan3TLS23append_tls_length_valueIhNS_16secure_allocatorIhEES3_EEvRNSt3__16vectorIhT0_EERKNS5_IT_T1_EEm: 209| 15| size_t tag_size) { 210| 15| append_tls_length_value(buf, std::span{vals}, tag_size); 211| 15|} _ZNK5Botan3TLS13Record_Header6neededEv: 91| 13.5k| size_t needed() const { return m_needed; } _ZNK5Botan3TLS13Record_Header4typeEv: 105| 57.5k| Record_Type type() const { 106| 57.5k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 77| 57.5k| do { \ | | 78| 57.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 57.5k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 57.5k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 57.5k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 57.5k] | | ------------------ ------------------ 107| 57.5k| return m_type; 108| 57.5k| } _ZNK5Botan3TLS13Record_Header7versionEv: 93| 15.4k| Protocol_Version version() const { 94| 15.4k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 77| 15.4k| do { \ | | 78| 15.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 15.4k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 15.4k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 15.4k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 15.4k] | | ------------------ ------------------ 95| 15.4k| return m_version; 96| 15.4k| } _ZNK5Botan3TLS13Record_Header8sequenceEv: 98| 11.6k| uint64_t sequence() const { 99| 11.6k| BOTAN_ASSERT_NOMSG(m_needed == 0); ------------------ | | 77| 11.6k| do { \ | | 78| 11.6k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 11.6k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 11.6k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 11.6k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 11.6k] | | ------------------ ------------------ 100| 11.6k| return m_sequence; 101| 11.6k| } _ZN5Botan3TLS23Connection_Cipher_State4aeadEv: 58| 82| AEAD_Mode& aead() { 59| 82| BOTAN_ASSERT_NONNULL(m_aead.get()); ------------------ | | 116| 82| do { \ | | 117| 82| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 82] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 82| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 82] | | ------------------ ------------------ 60| 82| return *m_aead; 61| 82| } _ZNK5Botan3TLS23Connection_Cipher_State26nonce_bytes_from_handshakeEv: 69| 76| size_t nonce_bytes_from_handshake() const { return m_nonce_bytes_from_handshake; } _ZNK5Botan3TLS23Connection_Cipher_State23nonce_bytes_from_recordEv: 71| 248| size_t nonce_bytes_from_record() const { return m_nonce_bytes_from_record; } _ZNK5Botan3TLS23Connection_Cipher_State12nonce_formatEv: 73| 176| Nonce_Format nonce_format() const { return m_nonce_format; } _ZN5Botan3TLS13Record_HeaderC2EmNS0_16Protocol_VersionENS0_11Record_TypeE: 87| 13.4k| m_needed(0), m_sequence(sequence), m_version(version), m_type(type) {} _ZN5Botan3TLS13Record_HeaderC2Em: 89| 87| explicit Record_Header(size_t needed) : m_needed(needed), m_sequence(0), m_type(Record_Type::Invalid) {} _ZN5Botan3TLS27Connection_Sequence_NumbersD2Ev: 20| 7.28k| virtual ~Connection_Sequence_Numbers() = default; _ZN5Botan3TLS23Stream_Sequence_NumbersC2Ev: 39| 7.28k| 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| 7| void new_read_cipher_state() override { 49| 7| m_read_seq_no = 0; 50| 7| m_read_epoch++; 51| 7| } _ZN5Botan3TLS23Stream_Sequence_Numbers22new_write_cipher_stateEv: 53| 56| void new_write_cipher_state() override { 54| 56| m_write_seq_no = 0; 55| 56| m_write_epoch++; 56| 56| } _ZNK5Botan3TLS23Stream_Sequence_Numbers18current_read_epochEv: 58| 13.4k| uint16_t current_read_epoch() const override { return m_read_epoch; } _ZNK5Botan3TLS23Stream_Sequence_Numbers19current_write_epochEv: 60| 14.6k| uint16_t current_write_epoch() const override { return m_write_epoch; } _ZN5Botan3TLS23Stream_Sequence_Numbers19next_write_sequenceEt: 62| 14.5k| uint64_t next_write_sequence(uint16_t /*epoch*/) override { 63| 14.5k| if(m_write_seq_no == std::numeric_limits::max()) { ------------------ | Branch (63:13): [True: 0, False: 14.5k] ------------------ 64| 0| throw Invalid_State("TLS 1.2 write sequence number overflow"); 65| 0| } 66| 14.5k| return m_write_seq_no++; 67| 14.5k| } _ZN5Botan3TLS23Stream_Sequence_Numbers18next_read_sequenceEv: 69| 13.4k| uint64_t next_read_sequence() override { return m_read_seq_no; } _ZNK5Botan3TLS12Session_Keys15client_aead_keyEv: 26| 56| const secure_vector& client_aead_key() const { return m_c_aead; } _ZNK5Botan3TLS12Session_Keys15server_aead_keyEv: 31| 7| const secure_vector& server_aead_key() const { return m_s_aead; } _ZNK5Botan3TLS12Session_Keys12client_nonceEv: 36| 56| const std::vector& client_nonce() const { return m_c_nonce; } _ZNK5Botan3TLS12Session_Keys12server_nonceEv: 41| 7| const std::vector& server_nonce() const { return m_s_nonce; } _ZNK5Botan3TLS12Session_Keys13master_secretEv: 46| 62| const secure_vector& master_secret() const { return m_master_sec; } _ZNK5Botan3TLS12Session_Keys8aead_keyENS0_15Connection_SideE: 48| 63| const secure_vector& aead_key(Connection_Side side) const { 49| 63| return (side == Connection_Side::Client) ? client_aead_key() : server_aead_key(); ------------------ | Branch (49:17): [True: 56, False: 7] ------------------ 50| 63| } _ZNK5Botan3TLS12Session_Keys5nonceENS0_15Connection_SideE: 52| 63| const std::vector& nonce(Connection_Side side) const { 53| 63| return (side == Connection_Side::Client) ? client_nonce() : server_nonce(); ------------------ | Branch (53:17): [True: 56, False: 7] ------------------ 54| 63| } _ZN5Botan3TLS12Session_KeysC2Ev: 56| 7.28k| Session_Keys() = default; _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEhQntsr3stdE7same_asIbT_EEES3_S3_: 43| 939k|constexpr inline T value_barrier(T x) { 44| 939k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 939k] ------------------ 45| 0| return x; 46| 939k| } else { 47| 939k|#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| 939k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 939k| 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| 939k| } 64| 939k|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEmQntsr3stdE7same_asIbT_EEES3_S3_: 43| 2.04G|constexpr inline T value_barrier(T x) { 44| 2.04G| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 2.04G] ------------------ 45| 0| return x; 46| 2.04G| } else { 47| 2.04G|#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| 2.04G| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 2.04G| 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| 2.04G| } 64| 2.04G|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEjQntsr3stdE7same_asIbT_EEES3_S3_: 43| 9.26k|constexpr inline T value_barrier(T x) { 44| 9.26k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 9.26k] ------------------ 45| 0| return x; 46| 9.26k| } else { 47| 9.26k|#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| 9.26k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 9.26k| 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| 9.26k| } 64| 9.26k|} _ZN5Botan2CT13value_barrierITkNSt3__117unsigned_integralEtQntsr3stdE7same_asIbT_EEES3_S3_: 43| 3.08k|constexpr inline T value_barrier(T x) { 44| 3.08k| if(std::is_constant_evaluated()) { ------------------ | Branch (44:7): [Folded, False: 3.08k] ------------------ 45| 0| return x; 46| 3.08k| } else { 47| 3.08k|#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| 3.08k| asm("" : "+r"(x) : /* no input */); // NOLINT(*-no-assembler) 56| 3.08k| 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| 3.08k| } 64| 3.08k|} _ZN5Botan17is_sub_element_ofERKNS_3OIDESt16initializer_listIjE: 16| 4.59k|inline std::optional is_sub_element_of(const OID& oid, std::initializer_list prefix) { 17| 4.59k| const auto& c = oid.get_components(); 18| | 19| 4.59k| if(c.size() != prefix.size() + 1) { ------------------ | Branch (19:7): [True: 548, False: 4.04k] ------------------ 20| 548| return {}; 21| 548| } 22| | 23| 4.04k| if(!std::equal(c.begin(), c.end() - 1, prefix.begin(), prefix.end())) { ------------------ | Branch (23:7): [True: 249, False: 3.79k] ------------------ 24| 249| return {}; 25| 249| } 26| | 27| 3.79k| return c[c.size() - 1]; 28| 4.04k|} _ZN5Botan9AEAD_Mode19set_associated_dataENSt3__14spanIKhLm18446744073709551615EEE: 59| 82| void set_associated_data(std::span ad) { set_associated_data_n(0, ad); } _ZN5Botan21Allocator_InitializerC2Ev: 50| 1| Allocator_Initializer() { initialize_allocator(); } _ZNK5Botan10BER_Object6is_setEv: 138| 289k| bool is_set() const { return m_type_tag != ASN1_Type::NoObject; } _ZNK5Botan10BER_Object7taggingEv: 140| 126k| uint32_t tagging() const { return type_tag() | class_tag(); } _ZNK5Botan10BER_Object8type_tagEv: 142| 126k| ASN1_Type type_tag() const { return m_type_tag; } _ZNK5Botan10BER_Object9class_tagEv: 144| 136k| ASN1_Class class_tag() const { return m_class_tag; } _ZNK5Botan10BER_Object4typeEv: 146| 23.8k| ASN1_Type type() const { return m_type_tag; } _ZNK5Botan10BER_Object9get_classEv: 148| 12.0k| ASN1_Class get_class() const { return m_class_tag; } _ZNK5Botan10BER_Object4bitsEv: 150| 1.82M| const uint8_t* bits() const { return m_value.data(); } _ZNK5Botan10BER_Object6lengthEv: 152| 3.79M| size_t length() const { return m_value.size(); } _ZNK5Botan10BER_Object4dataEv: 154| 43.8k| std::span data() const { return std::span{m_value}; } _ZN5Botan10BER_Object12mutable_bitsEm: 171| 105k| uint8_t* mutable_bits(size_t length) { 172| 105k| m_value.resize(length); 173| 105k| return m_value.data(); 174| 105k| } _ZNK5Botan3OID5emptyEv: 265| 984| bool empty() const { return m_id.empty(); } _ZNK5Botan3OID9has_valueEv: 271| 978| bool has_value() const { return !empty(); } _ZNK5Botan3OIDeqERKS0_: 301| 3.36k| bool operator==(const OID& other) const { return m_id == other.m_id; } _ZNK5Botan3OID14get_componentsEv: 321| 94.2k| const std::vector& get_components() const { 322| 94.2k| return m_id; 323| 94.2k| } _ZNK5Botan11ASN1_String5valueEv: 365| 2.26k| const std::string& value() const { return m_utf8_str; } _ZNK5Botan11ASN1_String5emptyEv: 369| 6.65k| bool empty() const { return m_utf8_str.empty(); } _ZNK5Botan19AlgorithmIdentifier3oidEv: 407| 4.77k| const OID& oid() const { return m_oid; } _ZNK5Botan19AlgorithmIdentifier10parametersEv: 409| 1.00k| const std::vector& parameters() const { return m_parameters; } _ZNK5Botan19AlgorithmIdentifier20parameters_are_emptyEv: 419| 2.92k| bool parameters_are_empty() const { return m_parameters.empty(); } _ZNK5Botan19AlgorithmIdentifier28parameters_are_null_or_emptyEv: 421| 2.92k| bool parameters_are_null_or_empty() const { return parameters_are_empty() || parameters_are_null(); } ------------------ | Branch (421:58): [True: 294, False: 2.63k] | Branch (421:84): [True: 2.62k, False: 10] ------------------ _ZN5BotanorENS_10ASN1_ClassES0_: 78| 58.0k|inline ASN1_Class operator|(ASN1_Class x, ASN1_Class y) { 79| 58.0k| return static_cast(static_cast(x) | static_cast(y)); 80| 58.0k|} _ZN5BotanorENS_9ASN1_TypeENS_10ASN1_ClassE: 82| 126k|inline uint32_t operator|(ASN1_Type x, ASN1_Class y) { 83| 126k| return static_cast(x) | static_cast(y); 84| 126k|} _ZN5BotanorENS_10ASN1_ClassENS_9ASN1_TypeE: 86| 21.0k|inline uint32_t operator|(ASN1_Class x, ASN1_Type y) { 87| 21.0k| return static_cast(x) | static_cast(y); 88| 21.0k|} _ZN5BotanneERKNS_3OIDES2_: 342| 2.55k|inline bool operator!=(const OID& a, const OID& b) { 343| 2.55k| return !(a == b); 344| 2.55k|} _ZNKSt3__14hashIN5Botan3OIDEEclERKS2_: 441| 362| size_t operator()(const Botan::OID& oid) const noexcept { return static_cast(oid.hash_code()); } _ZN5Botan11ASN1_ObjectD2Ev: 122| 135k| virtual ~ASN1_Object() = default; _ZN5Botan11ASN1_ObjectC2EOS0_: 120| 28.2k| ASN1_Object(ASN1_Object&&) = default; _ZN5Botan11ASN1_ObjectC2ERKS0_: 118| 28.3k| ASN1_Object(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectaSERKS0_: 119| 235| ASN1_Object& operator=(const ASN1_Object&) = default; _ZN5Botan11ASN1_ObjectC2Ev: 117| 78.8k| ASN1_Object() = default; _ZN5Botan19AlgorithmIdentifierC2Ev: 399| 10.0k| AlgorithmIdentifier() = default; _ZN5Botan3OIDC2Ev: 220| 23.0k| explicit OID() = default; _ZN5Botan10BER_ObjectC2Ev: 130| 189k| BER_Object() = default; _ZN5Botan10BER_ObjectaSEOS0_: 135| 26.2k| BER_Object& operator=(BER_Object&& other) = default; _ZN5Botan10BER_ObjectC2EOS0_: 133| 53.3k| BER_Object(BER_Object&& other) = default; _ZN5Botan9ASN1_TimeC2Ev: 39| 5.99k| ASN1_Time() = default; _ZN5Botan13ignore_paramsIJNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEEEEvDpRKT_: 142| 68|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS15Session_SummaryEEEEvDpRKT_: 142| 2|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS16Protocol_VersionEEEEvDpRKT_: 142| 388|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKhmEEEvDpRKT_: 142| 17.6k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJbEEEvDpRKT_: 142| 310|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJjEEEvDpRKT_: 142| 23.7k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKtmEEEvDpRKT_: 142| 6|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJPKmmEEEvDpRKT_: 142| 11.8M|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJmEEEvDpRKT_: 142| 243|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan13ignore_paramsIJNS_3TLS16Protocol_VersionENS1_6PolicyEEEEvDpRKT_: 142| 7.28k|constexpr void ignore_params([[maybe_unused]] const T&... args) {} _ZN5Botan11BER_Decoder6Limits3DEREv: 35| 14.4k| static Limits DER() { return Limits(false, 0); } _ZN5Botan11BER_Decoder6LimitsC2Ebm: 54| 14.4k| m_allow_ber(allow_ber), m_max_nested_indef(max_nested_indef) {} _ZN5Botan11BER_Decoder14start_sequenceEv: 160| 38.6k| BER_Decoder start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeERm: 225| 2.97k| BER_Decoder& decode(size_t& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder6decodeINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeE: 242| 9.59k| BER_Decoder& decode(std::vector& out, ASN1_Type real_type) { 243| 9.59k| return decode(out, real_type, real_type, ASN1_Class::Universal); 244| 9.59k| } _ZN5Botan11BER_Decoder16decode_and_checkImEERS0_RKT_NSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 327| 2| BER_Decoder& decode_and_check(const T& expected, std::string_view error_msg) { 328| 2| T actual; 329| 2| decode(actual); 330| | 331| 2| if(actual != expected) { ------------------ | Branch (331:13): [True: 0, False: 2] ------------------ 332| 0| throw Decoding_Error(error_msg); 333| 0| } 334| | 335| 2| return (*this); 336| 2| } _ZNK5Botan11BER_Decoder6Limits18allow_ber_encodingEv: 44| 232k| bool allow_ber_encoding() const { return m_allow_ber; } _ZNK5Botan11BER_Decoder6Limits20require_der_encodingEv: 46| 125k| bool require_der_encoding() const { return !allow_ber_encoding(); } _ZN5Botan11BER_DecoderC2ERKNS_10BER_ObjectENS0_6LimitsE: 81| 4.08k| BER_Decoder(obj.data(), limits) {} _ZNK5Botan11BER_Decoder6limitsEv: 98| 50.9k| Limits limits() const { return m_limits; } _ZN5Botan11BER_Decoder8get_nextERNS_10BER_ObjectE: 106| 2.96k| BER_Decoder& get_next(BER_Object& ber) { 107| 2.96k| ber = get_next_object(); 108| 2.96k| return (*this); 109| 2.96k| } _ZN5Botan11BER_Decoder9start_setEv: 162| 7.96k| BER_Decoder start_set() { return start_cons(ASN1_Type::Set, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder22start_context_specificEj: 164| 55| BER_Decoder start_context_specific(uint32_t tag) { 165| 55| return start_cons(ASN1_Type(tag), ASN1_Class::ContextSpecific); 166| 55| } _ZN5Botan11BER_Decoder6decodeERNS_6BigIntE: 230| 3.76k| BER_Decoder& decode(BigInt& out) { return decode(out, ASN1_Type::Integer, ASN1_Class::Universal); } _ZN5Botan11BER_Decoder9raw_bytesINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EE: 203| 16.1k| BER_Decoder& raw_bytes(std::vector& out) { 204| 16.1k| out.clear(); 205| 1.55M| for(;;) { 206| 1.55M| if(auto next = this->read_next_byte()) { ------------------ | Branch (206:21): [True: 1.53M, False: 16.1k] ------------------ 207| 1.53M| out.push_back(*next); 208| 1.53M| } else { 209| 16.1k| break; 210| 16.1k| } 211| 1.55M| } 212| 16.1k| return (*this); 213| 16.1k| } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 285| 2.99k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 286| 2.99k| std::optional optval; 287| 2.99k| this->decode_optional(optval, type_tag, class_tag); 288| 2.99k| out = optval ? *optval : default_value; ------------------ | Branch (288:16): [True: 2.96k, False: 37] ------------------ 289| 2.99k| return (*this); 290| 2.99k| } _ZN5Botan11BER_Decoder15decode_optionalImEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 394| 3.69k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 395| 3.69k| BER_Object obj = get_next_object(); 396| | 397| 3.69k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (397:7): [True: 2.96k, False: 726] ------------------ 398| 2.96k| T out{}; 399| 2.96k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (399:10): [True: 2.96k, False: 3] ------------------ 400| 2.96k| BER_Decoder(obj, m_limits).decode(out).verify_end(); 401| 2.96k| } else { 402| 3| this->push_back(std::move(obj)); 403| 3| this->decode(out, type_tag, class_tag); 404| 3| } 405| 2.96k| optval = std::move(out); 406| 2.96k| } else { 407| 726| this->push_back(std::move(obj)); 408| 726| optval = std::nullopt; 409| 726| } 410| | 411| 3.69k| return (*this); 412| 3.69k|} _ZN5Botan11BER_Decoder22decode_optional_stringINSt3__19allocatorIhEEEERS0_RNS2_6vectorIhT_EENS_9ASN1_TypeEjNS_10ASN1_ClassE: 345| 2.99k| ASN1_Class class_tag = ASN1_Class::ContextSpecific) { 346| 2.99k| BER_Object obj = get_next_object(); 347| | 348| 2.99k| const ASN1_Type type_tag = static_cast(expected_tag); 349| | 350| 2.99k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (350:13): [True: 27, False: 2.97k] ------------------ 351| 27| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (351:16): [True: 0, False: 27] ------------------ 352| 0| BER_Decoder(obj, m_limits).decode(out, real_type).verify_end(); 353| 27| } else { 354| 27| push_back(std::move(obj)); 355| 27| decode(out, real_type, type_tag, class_tag); 356| 27| } 357| 2.97k| } else { 358| 2.97k| out.clear(); 359| 2.97k| push_back(std::move(obj)); 360| 2.97k| } 361| | 362| 2.99k| return (*this); 363| 2.99k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassERKS3_: 285| 4.86k| BER_Decoder& decode_optional(T& out, ASN1_Type type_tag, ASN1_Class class_tag, const T& default_value = T()) { 286| 4.86k| std::optional optval; 287| 4.86k| this->decode_optional(optval, type_tag, class_tag); 288| 4.86k| out = optval ? *optval : default_value; ------------------ | Branch (288:16): [True: 1.85k, False: 3.01k] ------------------ 289| 4.86k| return (*this); 290| 4.86k| } _ZN5Botan11BER_Decoder15decode_optionalIbEERS0_RNSt3__18optionalIT_EENS_9ASN1_TypeENS_10ASN1_ClassE: 394| 4.86k|BER_Decoder& BER_Decoder::decode_optional(std::optional& optval, ASN1_Type type_tag, ASN1_Class class_tag) { 395| 4.86k| BER_Object obj = get_next_object(); 396| | 397| 4.86k| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (397:7): [True: 1.86k, False: 3.00k] ------------------ 398| 1.86k| T out{}; 399| 1.86k| if(class_tag == ASN1_Class::ExplicitContextSpecific) { ------------------ | Branch (399:10): [True: 0, False: 1.86k] ------------------ 400| 0| BER_Decoder(obj, m_limits).decode(out).verify_end(); 401| 1.86k| } else { 402| 1.86k| this->push_back(std::move(obj)); 403| 1.86k| this->decode(out, type_tag, class_tag); 404| 1.86k| } 405| 1.86k| optval = std::move(out); 406| 3.00k| } else { 407| 3.00k| this->push_back(std::move(obj)); 408| 3.00k| optval = std::nullopt; 409| 3.00k| } 410| | 411| 4.86k| return (*this); 412| 4.86k|} _ZN5Botan11BER_Decoder11decode_listINS_3OIDEEERS0_RNSt3__16vectorIT_NS4_9allocatorIS6_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 443| 844|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 444| 844| BER_Decoder list = start_cons(type_tag, class_tag); 445| | 446| 1.64k| while(list.more_items()) { ------------------ | Branch (446:10): [True: 799, False: 844] ------------------ 447| 799| T value; 448| 799| list.decode(value); 449| 799| vec.push_back(std::move(value)); 450| 799| } 451| | 452| 844| list.end_cons(); 453| | 454| 844| return (*this); 455| 844|} _ZN5Botan11BER_Decoder20decode_optional_listINS_14GeneralSubtreeEEEbRNSt3__16vectorIT_NS3_9allocatorIS5_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 461| 12|bool BER_Decoder::decode_optional_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 462| 12| if(peek_next_object().is_a(type_tag, class_tag)) { ------------------ | Branch (462:7): [True: 0, False: 12] ------------------ 463| 0| decode_list(vec, type_tag, class_tag); 464| 0| return true; 465| 0| } 466| | 467| 12| return false; 468| 12|} x509_ext.cpp:_ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension12_GLOBAL__N_118Policy_InformationEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 443| 31|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 444| 31| BER_Decoder list = start_cons(type_tag, class_tag); 445| | 446| 43| while(list.more_items()) { ------------------ | Branch (446:10): [True: 12, False: 31] ------------------ 447| 12| T value; 448| 12| list.decode(value); 449| 12| vec.push_back(std::move(value)); 450| 12| } 451| | 452| 31| list.end_cons(); 453| | 454| 31| return (*this); 455| 31|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension23CRL_Distribution_Points18Distribution_PointEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 443| 108|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 444| 108| BER_Decoder list = start_cons(type_tag, class_tag); 445| | 446| 204| while(list.more_items()) { ------------------ | Branch (446:10): [True: 96, False: 108] ------------------ 447| 96| T value; 448| 96| list.decode(value); 449| 96| vec.push_back(std::move(value)); 450| 96| } 451| | 452| 108| list.end_cons(); 453| | 454| 108| return (*this); 455| 108|} _ZN5Botan11BER_Decoder24decode_optional_implicitINS_15AlternativeNameEEERS0_RT_NS_9ASN1_TypeENS_10ASN1_ClassES6_S7_RKS4_: 423| 41| const T& default_value) { 424| 41| BER_Object obj = get_next_object(); 425| | 426| 41| if(obj.is_a(type_tag, class_tag)) { ------------------ | Branch (426:7): [True: 32, False: 9] ------------------ 427| 32| obj.set_tagging(real_type, real_class); 428| 32| push_back(std::move(obj)); 429| 32| decode(out, real_type, real_class); 430| 32| } else { 431| | // Not what we wanted, push it back on the stream 432| 9| out = default_value; 433| 9| push_back(std::move(obj)); 434| 9| } 435| | 436| 41| return (*this); 437| 41|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension10TNAuthList5EntryEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 443| 11|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 444| 11| BER_Decoder list = start_cons(type_tag, class_tag); 445| | 446| 22| while(list.more_items()) { ------------------ | Branch (446:10): [True: 11, False: 11] ------------------ 447| 11| T value; 448| 11| list.decode(value); 449| 11| vec.push_back(std::move(value)); 450| 11| } 451| | 452| 11| list.end_cons(); 453| | 454| 11| return (*this); 455| 11|} _ZN5Botan11BER_Decoder11decode_listINS_14Cert_Extension15IPAddressBlocks15IPAddressFamilyEEERS0_RNSt3__16vectorIT_NS6_9allocatorIS8_EEEENS_9ASN1_TypeENS_10ASN1_ClassE: 443| 7|BER_Decoder& BER_Decoder::decode_list(std::vector& vec, ASN1_Type type_tag, ASN1_Class class_tag) { 444| 7| BER_Decoder list = start_cons(type_tag, class_tag); 445| | 446| 13| while(list.more_items()) { ------------------ | Branch (446:10): [True: 6, False: 7] ------------------ 447| 6| T value; 448| 6| list.decode(value); 449| 6| vec.push_back(std::move(value)); 450| 6| } 451| | 452| 7| list.end_cons(); 453| | 454| 7| return (*this); 455| 7|} _ZN5BotanleERKNS_6BigIntEm: 1194| 691|inline bool operator<=(const BigInt& a, word b) { 1195| 691| return (a.cmp_word(b) <= 0); 1196| 691|} _ZN5BotangeERKNS_6BigIntES2_: 1174| 5.09k|inline bool operator>=(const BigInt& a, const BigInt& b) { 1175| 5.09k| return (a.cmp(b) >= 0); 1176| 5.09k|} _ZN5BotanmiERKNS_6BigIntEm: 1141| 2.78k|inline BigInt operator-(const BigInt& x, word y) { 1142| 2.78k| return BigInt::add2(x, &y, 1, BigInt::Negative); 1143| 2.78k|} _ZN5Botan6BigIntD2Ev: 185| 1.42M| ~BigInt() { _const_time_unpoison(); } _ZN5Botan6BigInt4zeroEv: 50| 3.56k| static BigInt zero() { return BigInt(); } _ZN5Botan6BigInt3oneEv: 55| 76| static BigInt one() { return BigInt::from_u64(1); } _ZN5Botan6BigIntC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 98| 128| explicit BigInt(std::string_view str) { *this = BigInt::from_string(str); } _ZN5Botan6BigIntC2EPKhm: 133| 310| BigInt(const uint8_t buf[], size_t length) { assign_from_bytes(std::span{buf, length}); } _ZN5Botan6BigIntC2ENSt3__14spanIKhLm18446744073709551615EEE: 139| 3| explicit BigInt(std::span bytes) { assign_from_bytes(bytes); } _ZN5Botan6BigIntC2EOS0_: 183| 2.03k| BigInt(BigInt&& other) noexcept { this->swap(other); } _ZN5Botan6BigIntaSEOS0_: 190| 756k| BigInt& operator=(BigInt&& other) noexcept { 191| 756k| if(this != &other) { ------------------ | Branch (191:13): [True: 756k, False: 0] ------------------ 192| 756k| this->swap(other); 193| 756k| } 194| | 195| 756k| return (*this); 196| 756k| } _ZN5Botan6BigInt4swapERS0_: 207| 760k| void swap(BigInt& other) noexcept { 208| 760k| m_data.swap(other.m_data); 209| 760k| std::swap(m_signedness, other.m_signedness); 210| 760k| } _ZN5Botan6BigInt8swap_regERNSt3__16vectorImNS_16secure_allocatorImEEEE: 214| 1.69k| BOTAN_DEPRECATED("Deprecated no replacement") void swap_reg(secure_vector& reg) { 215| 1.69k| m_data.swap(reg); 216| | // sign left unchanged 217| 1.69k| } _ZN5Botan6BigIntpLEm: 229| 120| BigInt& operator+=(word y) { return add(&y, 1, Positive); } _ZN5Botan6BigIntmIEm: 241| 66| BigInt& operator-=(word y) { return sub(&y, 1, Positive); } _ZN5Botan6BigInt3subEPKmmNS0_4SignE: 332| 26.7k| BigInt& sub(const word y[], size_t y_words, Sign sign) { 333| 26.7k| return add(y, y_words, sign == Positive ? Negative : Positive); ------------------ | Branch (333:33): [True: 26.7k, False: 0] ------------------ 334| 26.7k| } _ZN5Botan6BigInt5clearEv: 415| 11.7k| void clear() { 416| 11.7k| m_data.set_to_zero(); 417| 11.7k| m_signedness = Positive; 418| 11.7k| } _ZNK5Botan6BigInt7is_evenEv: 455| 4.98k| bool is_even() const { return !get_bit(0); } _ZNK5Botan6BigInt6is_oddEv: 461| 253k| bool is_odd() const { return get_bit(0); } _ZNK5Botan6BigInt6signumEv: 467| 2.37M| int signum() const { 468| 2.37M| if(sig_words() == 0) { ------------------ | Branch (468:13): [True: 25.9k, False: 2.35M] ------------------ 469| 25.9k| return 0; 470| 25.9k| } 471| 2.35M| return (sign() == Negative) ? -1 : 1; ------------------ | Branch (471:17): [True: 443, False: 2.35M] ------------------ 472| 2.37M| } _ZNK5Botan6BigInt7is_zeroEv: 484| 3.54k| bool is_zero() const { return sig_words() == 0; } _ZN5Botan6BigInt7set_bitEm: 490| 1.76k| void set_bit(size_t n) { conditionally_set_bit(n, true); } _ZN5Botan6BigInt21conditionally_set_bitEmb: 500| 730k| void conditionally_set_bit(size_t n, bool set_it) { 501| 730k| const size_t which = n / (sizeof(word) * 8); 502| 730k| const word mask = static_cast(set_it) << (n % (sizeof(word) * 8)); 503| 730k| m_data.set_word_at(which, word_at(which) | mask); 504| 730k| } _ZNK5Botan6BigInt7get_bitEm: 523| 439k| bool get_bit(size_t n) const { return ((word_at(n / (sizeof(word) * 8)) >> (n % (sizeof(word) * 8))) & 1) == 1; } _ZNK5Botan6BigInt7word_atEm: 574| 29.7M| word word_at(size_t n) const { return m_data.get_word_at(n); } _ZN5Botan6BigInt11set_word_atEmm: 576| 13.3M| BOTAN_DEPRECATED("Deprecated no replacement") void set_word_at(size_t i, word w) { m_data.set_word_at(i, w); } _ZN5Botan6BigInt9set_wordsEPKmm: 578| 243| BOTAN_DEPRECATED("Deprecated no replacement") void set_words(const word w[], size_t len) { 579| 243| m_data.set_words(w, len); 580| 243| } _ZNK5Botan6BigInt4signEv: 604| 4.38M| Sign sign() const { return (m_signedness); } _ZNK5Botan6BigInt12reverse_signEv: 609| 2.91k| Sign reverse_sign() const { 610| 2.91k| if(sign() == Positive) { ------------------ | Branch (610:13): [True: 2.86k, False: 54] ------------------ 611| 2.86k| return Negative; 612| 2.86k| } 613| 54| return Positive; 614| 2.91k| } _ZN5Botan6BigInt9flip_signEv: 619| 205| BOTAN_DEPRECATED("Deprecated no replacement") void flip_sign() { set_sign(reverse_sign()); } _ZN5Botan6BigInt8set_signENS0_4SignE: 625| 464k| void set_sign(Sign sign) { 626| 464k| if(sign == Negative && is_zero()) { ------------------ | Branch (626:13): [True: 342, False: 464k] | Branch (626:33): [True: 66, False: 276] ------------------ 627| 66| sign = Positive; 628| 66| } 629| | 630| 464k| m_signedness = sign; 631| 464k| } _ZNK5Botan6BigInt4sizeEv: 642| 19.9M| size_t size() const { return m_data.size(); } _ZNK5Botan6BigInt9sig_wordsEv: 648| 7.44M| size_t sig_words() const { return m_data.sig_words(); } _ZN5Botan6BigInt12mutable_dataEv: 673| 3.38M| BOTAN_DEPRECATED("Deprecated no replacement") word* mutable_data() { return m_data.mutable_data(); } _ZNK5Botan6BigInt4dataEv: 679| 10.9k| BOTAN_DEPRECATED("Deprecated no replacement") const word* data() const { return m_data.const_data(); } _ZN5Botan6BigInt15get_word_vectorEv: 684| 1.14k| BOTAN_DEPRECATED("Deprecated no replacement") secure_vector& get_word_vector() { 685| 1.14k| return m_data.mutable_vector(); 686| 1.14k| } _ZNK5Botan6BigInt7grow_toEm: 699| 1.08M| BOTAN_DEPRECATED("Deprecated no replacement") void grow_to(size_t n) const { m_data.grow_to(n); } _ZN5Botan6BigInt10power_of_2Em: 856| 862| static BigInt power_of_2(size_t n) { 857| 862| BigInt b; 858| 862| b.set_bit(n); 859| 862| return b; 860| 862| } _ZNK5Botan6BigInt8_as_spanEv: 962| 347k| std::span _as_span() const { return m_data.const_span(); } _ZNK5Botan6BigInt5_dataEv: 972| 18.0M| const word* _data() const { return m_data.const_data(); } _ZN5Botan6BigInt18_assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 983| 6.55k| void _assign_from_bytes(std::span bytes) { assign_from_bytes(bytes); } _ZN5Botan6BigInt11_from_wordsERNSt3__16vectorImNS_16secure_allocatorImEEEE: 991| 1.09M| static BigInt _from_words(secure_vector& words) { 992| 1.09M| BigInt bn; 993| 1.09M| bn.m_data.swap(words); 994| 1.09M| return bn; 995| 1.09M| } _ZN5Botan6BigInt4Data12mutable_dataEv: 1022| 3.66M| word* mutable_data() { 1023| 3.66M| invalidate_sig_words(); 1024| 3.66M| return m_reg.data(); 1025| 3.66M| } _ZNK5Botan6BigInt4Data10const_dataEv: 1027| 19.4M| const word* const_data() const { return m_reg.data(); } _ZNK5Botan6BigInt4Data10const_spanEv: 1029| 347k| std::span const_span() const { return std::span{m_reg}; } _ZN5Botan6BigInt4Data14mutable_vectorEv: 1031| 1.14k| secure_vector& mutable_vector() { 1032| 1.14k| invalidate_sig_words(); 1033| 1.14k| return m_reg; 1034| 1.14k| } _ZNK5Botan6BigInt4Data11get_word_atEm: 1038| 29.7M| word get_word_at(size_t n) const { 1039| 29.7M| if(n < m_reg.size()) { ------------------ | Branch (1039:19): [True: 29.6M, False: 37.6k] ------------------ 1040| 29.6M| return m_reg[n]; 1041| 29.6M| } 1042| 37.6k| return 0; 1043| 29.7M| } _ZN5Botan6BigInt4Data11set_word_atEmm: 1045| 14.0M| void set_word_at(size_t i, word w) { 1046| 14.0M| invalidate_sig_words(); 1047| 14.0M| if(i >= m_reg.size()) { ------------------ | Branch (1047:19): [True: 9.24k, False: 14.0M] ------------------ 1048| 9.24k| if(w == 0) { ------------------ | Branch (1048:22): [True: 972, False: 8.26k] ------------------ 1049| 972| return; 1050| 972| } 1051| 8.26k| grow_to(i + 1); 1052| 8.26k| } 1053| 14.0M| m_reg[i] = w; 1054| 14.0M| } _ZN5Botan6BigInt4Data9set_wordsEPKmm: 1056| 243| void set_words(const word w[], size_t len) { 1057| 243| invalidate_sig_words(); 1058| 243| m_reg.assign(w, w + len); 1059| 243| } _ZNK5Botan6BigInt4Data7grow_toEm: 1065| 1.09M| void grow_to(size_t n) const { 1066| 1.09M| if(n > size()) { ------------------ | Branch (1066:19): [True: 978k, False: 120k] ------------------ 1067| 978k| if(n <= m_reg.capacity()) { ------------------ | Branch (1067:22): [True: 168k, False: 809k] ------------------ 1068| 168k| m_reg.resize(n); 1069| 809k| } else { 1070| 809k| m_reg.resize(n + (8 - (n % 8))); 1071| 809k| } 1072| 978k| } 1073| 1.09M| } _ZNK5Botan6BigInt4Data4sizeEv: 1075| 22.7M| size_t size() const { return m_reg.size(); } _ZN5Botan6BigInt4Data4swapERS1_: 1090| 760k| void swap(Data& other) noexcept { 1091| 760k| m_reg.swap(other.m_reg); 1092| 760k| std::swap(m_sig_words, other.m_sig_words); 1093| 760k| } _ZN5Botan6BigInt4Data4swapERNSt3__16vectorImNS_16secure_allocatorImEEEE: 1095| 1.11M| void swap(secure_vector& reg) noexcept { 1096| 1.11M| m_reg.swap(reg); 1097| 1.11M| invalidate_sig_words(); 1098| 1.11M| } _ZNK5Botan6BigInt4Data20invalidate_sig_wordsEv: 1100| 18.8M| void invalidate_sig_words() const noexcept { m_sig_words = sig_words_npos; } _ZNK5Botan6BigInt4Data9sig_wordsEv: 1102| 7.44M| size_t sig_words() const { 1103| 7.44M| if(m_sig_words == sig_words_npos) { ------------------ | Branch (1103:19): [True: 1.89M, False: 5.55M] ------------------ 1104| 1.89M| m_sig_words = calc_sig_words(); 1105| 1.89M| } 1106| 7.44M| return m_sig_words; 1107| 7.44M| } _ZN5BotanplERKNS_6BigIntES2_: 1125| 255k|inline BigInt operator+(const BigInt& x, const BigInt& y) { 1126| 255k| return BigInt::add2(x, y._data(), y.sig_words(), y.sign()); 1127| 255k|} _ZN5BotanplERKNS_6BigIntEm: 1129| 42|inline BigInt operator+(const BigInt& x, word y) { 1130| 42| return BigInt::add2(x, &y, 1, BigInt::Positive); 1131| 42|} _ZN5BotanmiERKNS_6BigIntES2_: 1137| 2.70k|inline BigInt operator-(const BigInt& x, const BigInt& y) { 1138| 2.70k| return BigInt::add2(x, y._data(), y.sig_words(), y.reverse_sign()); 1139| 2.70k|} _ZN5BotanmlEmRKNS_6BigIntE: 1148| 26.3k|inline BigInt operator*(word x, const BigInt& y) { 1149| 26.3k| return y * x; 1150| 26.3k|} _ZN5BotaneqERKNS_6BigIntES2_: 1162| 332k|inline bool operator==(const BigInt& a, const BigInt& b) { 1163| 332k| return a.is_equal(b); 1164| 332k|} _ZN5BotanneERKNS_6BigIntES2_: 1166| 7|inline bool operator!=(const BigInt& a, const BigInt& b) { 1167| 7| return !a.is_equal(b); 1168| 7|} _ZN5BotanleERKNS_6BigIntES2_: 1170| 5.28k|inline bool operator<=(const BigInt& a, const BigInt& b) { 1171| 5.28k| return (a.cmp(b) <= 0); 1172| 5.28k|} _ZN5BotanltERKNS_6BigIntES2_: 1178| 14.3k|inline bool operator<(const BigInt& a, const BigInt& b) { 1179| 14.3k| return a.is_less_than(b); 1180| 14.3k|} _ZN5BotaneqERKNS_6BigIntEm: 1186| 337k|inline bool operator==(const BigInt& a, word b) { 1187| 337k| return (a.cmp_word(b) == 0); 1188| 337k|} _ZN5BotanneERKNS_6BigIntEm: 1190| 44|inline bool operator!=(const BigInt& a, word b) { 1191| 44| return (a.cmp_word(b) != 0); 1192| 44|} _ZN5BotangeERKNS_6BigIntEm: 1198| 203|inline bool operator>=(const BigInt& a, word b) { 1199| 203| return (a.cmp_word(b) >= 0); 1200| 203|} _ZN5BotanltERKNS_6BigIntEm: 1202| 4.76k|inline bool operator<(const BigInt& a, word b) { 1203| 4.76k| return (a.cmp_word(b) < 0); 1204| 4.76k|} _ZN5BotangtERKNS_6BigIntEm: 1206| 8.04k|inline bool operator>(const BigInt& a, word b) { 1207| 8.04k| return (a.cmp_word(b) > 0); 1208| 8.04k|} _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS2_9allocatorIhEEEEEET_m: 747| 1.83k| T serialize(size_t len) const { 748| | // TODO this supports std::vector and secure_vector 749| | // it would be nice if this also could work with std::array as in 750| | // bn.serialize_to>(32); 751| 1.83k| T out(len); 752| 1.83k| this->serialize_to(out); 753| 1.83k| return out; 754| 1.83k| } _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_m: 747| 38| T serialize(size_t len) const { 748| | // TODO this supports std::vector and secure_vector 749| | // it would be nice if this also could work with std::array as in 750| | // bn.serialize_to>(32); 751| 38| T out(len); 752| 38| this->serialize_to(out); 753| 38| return out; 754| 38| } _ZNK5Botan6BigInt9serializeINSt3__16vectorIhNS2_9allocatorIhEEEEEET_v: 760| 1.75k| T serialize() const { 761| 1.75k| return serialize(this->bytes()); 762| 1.75k| } _ZN5Botan6BigIntC2ERKS0_: 88| 4.12k| BigInt(const BigInt& other) = default; _ZN5Botan6BigIntC2Ev: 45| 1.42M| BigInt() = default; _ZN5Botan6BigIntaSERKS0_: 201| 171k| BigInt& operator=(const BigInt&) = default; _ZNK5Botan11BlockCipher14parallel_bytesEv: 67| 71| size_t parallel_bytes() const { return parallelism() * block_size() * BlockCipher::ParallelismMult; } _ZNK5Botan11BlockCipher7encryptEPh: 99| 153| void encrypt(uint8_t block[]) const { encrypt_n(block, block, 1); } _ZNK5Botan11BlockCipher7encryptENSt3__14spanIhLm18446744073709551615EEE: 113| 2| void encrypt(std::span block) const { 114| 2| return encrypt_n(block.data(), block.data(), block.size() / block_size()); 115| 2| } _ZNK5Botan11BlockCipher7encryptENSt3__14spanIKhLm18446744073709551615EEENS2_IhLm18446744073709551615EEE: 130| 3| void encrypt(std::span in, std::span out) const { 131| 3| return encrypt_n(in.data(), out.data(), in.size() / block_size()); 132| 3| } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm16ELm0ELm1ENS_11BlockCipherEE8key_specEv: 216| 12| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm16ELm0ELm1ENS_11BlockCipherEE10block_sizeEv: 214| 8| size_t block_size() const final { return BS; } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm32ELm0ELm1ENS_11BlockCipherEE8key_specEv: 216| 170| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm16ELm32ELm0ELm1ENS_11BlockCipherEE10block_sizeEv: 214| 189| size_t block_size() const final { return BS; } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm8ELm16ELm24ELm8ENS_11BlockCipherEE8key_specEv: 216| 6| Key_Length_Specification key_spec() const final { return Key_Length_Specification(KMIN, KMAX, KMOD); } _ZNK5Botan25Block_Cipher_Fixed_ParamsILm8ELm16ELm24ELm8ENS_11BlockCipherEE10block_sizeEv: 214| 4| size_t block_size() const final { return BS; } _ZN5Botan20Buffered_Computation6updateEPKhm: 34| 356| void update(const uint8_t in[], size_t length) { add_data({in, length}); } _ZN5Botan20Buffered_Computation6updateENSt3__14spanIKhLm18446744073709551615EEE: 40| 16.5k| void update(std::span in) { add_data(in); } _ZN5Botan20Buffered_Computation5finalEPh: 69| 82| void final(uint8_t out[]) { final_result({out, output_length()}); } _ZN5Botan20Buffered_Computation12final_stdvecEv: 83| 3.08k| std::vector final_stdvec() { return final>(); } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEET_v: 77| 3.08k| T final() { 78| 3.08k| T output(output_length()); 79| 3.08k| final_result(output); 80| 3.08k| return output; 81| 3.08k| } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_v: 77| 398| T final() { 78| 398| T output(output_length()); 79| 398| final_result(output); 80| 398| return output; 81| 398| } _ZN5Botan20Buffered_ComputationD2Ev: 130| 9.84k| virtual ~Buffered_Computation() = default; _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRT_: 88| 282| void final(T& out) { 89| 282| out.resize(output_length()); 90| 282| final_result(out); 91| 282| } _ZN5Botan20Buffered_Computation7processITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_NS3_4spanIKhLm18446744073709551615EEE: 125| 282| T process(std::span in) { 126| 282| update(in); 127| 282| return final(); 128| 282| } _ZN5Botan20Buffered_Computation5finalITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEEvRT_: 88| 7.33k| void final(T& out) { 89| 7.33k| out.resize(output_length()); 90| 7.33k| final_result(out); 91| 7.33k| } _ZNK5Botan10ChaCha_RNG31max_number_of_bytes_per_requestEv: 108| 12.0k| size_t max_number_of_bytes_per_request() const override { return 0; } _ZN5Botan11Cipher_Mode5startENSt3__14spanIKhLm18446744073709551615EEE: 97| 126| void start(std::span nonce) { start_msg(nonce.data(), nonce.size()); } _ZN5Botan11Cipher_Mode6finishERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 178| 82| void finish(secure_vector& final_block, size_t offset = 0) { finish_msg(final_block, offset); } _ZN5Botan11Cipher_Mode7processENSt3__14spanIhLm18446744073709551615EEE: 131| 44| size_t process(std::span msg) { return this->process_msg(msg.data(), msg.size()); } _ZN5Botan11Cipher_Mode7processEPhm: 133| 44| 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: 148| 44| void update(T& buffer, size_t offset = 0) { 149| 44| const size_t written = process(std::span(buffer).subspan(offset)); 150| 44| buffer.resize(offset + written); 151| 44| } _ZN5Botan19Credentials_ManagerD2Ev: 42| 7.28k| virtual ~Credentials_Manager() = default; _ZN5Botan8CurveGFp4swapERS0_: 69| 492| void swap(CurveGFp& other) noexcept { std::swap(m_group, other.m_group); } _ZNK5Botan8CurveGFpeqERKS0_: 71| 324| bool operator==(const CurveGFp& other) const { return (m_group == other.m_group); } _ZN5Botan8CurveGFpC2Ev: 62| 581| CurveGFp() = default; _ZN5Botan17DataSource_MemoryC2ERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 147| 914| explicit DataSource_Memory(const std::vector& in) : m_source(in.begin(), in.end()), m_offset(0) {} _ZN5Botan10DataSourceC2Ev: 100| 68.4k| DataSource() = default; _ZN5Botan10DataSourceD2Ev: 101| 68.4k| virtual ~DataSource() = default; _ZN5Botan17DataSource_MemoryC2EPKhm: 129| 3.09k| DataSource_Memory(const uint8_t in[], size_t length) : m_source(in, in + length), m_offset(0) {} _ZN5Botan17DataSource_MemoryC2ENSt3__14spanIKhLm18446744073709551615EEE: 141| 18.2k| explicit DataSource_Memory(std::span in) : m_source(in.begin(), in.end()), m_offset(0) {} _ZN5Botan11DER_Encoder14start_sequenceEv: 67| 7.14k| DER_Encoder& start_sequence() { return start_cons(ASN1_Type::Sequence, ASN1_Class::Universal); } _ZN5Botan11DER_Encoder12DER_SequenceD2Ev: 244| 22.3k| ~DER_Sequence() = default; _ZN5Botan11DER_Encoder6encodeINSt3__19allocatorIhEEEERS0_RKNS2_6vectorIhT_EENS_9ASN1_TypeE: 98| 924| DER_Encoder& encode(const std::vector& vec, ASN1_Type real_type) { 99| 924| return encode(vec.data(), vec.size(), real_type); 100| 924| } _ZN5Botan11DER_Encoder9raw_bytesENSt3__14spanIKhLm18446744073709551615EEE: 89| 1.84k| DER_Encoder& raw_bytes(std::span val) { return raw_bytes(val.data(), val.size()); } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassENSt3__14spanIKhLm18446744073709551615EEE: 185| 1.85k| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, std::span rep) { 186| 1.85k| return add_object(type_tag, class_tag, rep.data(), rep.size()); 187| 1.85k| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS3_9allocatorIhEEEE: 189| 930| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const std::vector& rep) { 190| 930| return add_object(type_tag, class_tag, std::span{rep}); 191| 930| } _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 193| 924| DER_Encoder& add_object(ASN1_Type type_tag, ASN1_Class class_tag, const secure_vector& rep) { 194| 924| return add_object(type_tag, class_tag, std::span{rep}); 195| 924| } _ZN5Botan11DER_Encoder12DER_SequenceC2EOS1_: 229| 15.2k| m_type_tag(seq.m_type_tag), 230| 15.2k| m_class_tag(seq.m_class_tag), 231| 15.2k| m_contents(std::move(seq.m_contents)), 232| 15.2k| m_set_contents(std::move(seq.m_set_contents)) {} _ZNK5Botan12DH_PublicKey9algo_nameEv: 55| 38| std::string algo_name() const override { return "DH"; } _ZN5Botan12DH_PublicKeyC2Ev: 68| 38| DH_PublicKey() = default; _ZN5Botan8DL_GroupC2ENSt3__110shared_ptrINS_13DL_Group_DataEEE: 385| 46| explicit DL_Group(std::shared_ptr data) : m_data(std::move(data)) {} _ZNK5Botan8EC_Group5_dataEv: 458| 37| const std::shared_ptr& _data() const { return m_data; } _ZN5Botan8EC_PointaSEOS0_: 72| 411| EC_Point& operator=(EC_Point&& other) noexcept { 73| 411| if(this != &other) { ------------------ | Branch (73:13): [True: 411, False: 0] ------------------ 74| 411| this->swap(other); 75| 411| } 76| 411| return (*this); 77| 411| } _ZNK5Botan8EC_Point7is_zeroEv: 163| 1.13k| bool is_zero() const { return m_z.is_zero(); } _ZNK5Botan8EC_Point5get_xEv: 238| 567| BOTAN_DEPRECATED("Use affine coordinates only") const BigInt& get_x() const { return m_x; } _ZNK5Botan8EC_Point5get_yEv: 245| 567| BOTAN_DEPRECATED("Use affine coordinates only") const BigInt& get_y() const { return m_y; } _ZNK5Botan8EC_Point4plusERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 338| 324| EC_Point plus(const EC_Point& other, std::vector& workspace) const { 339| 324| EC_Point x = (*this); 340| 324| x.add(other, workspace); 341| 324| return x; 342| 324| } _ZNK5Botan8EC_Point9get_curveEv: 361| 1| BOTAN_DEPRECATED("Deprecated no replacement") const CurveGFp& get_curve() const { return m_curve; } _ZN5Botan8EC_PointD2Ev: 79| 906| ~EC_Point() = default; _ZN5Botan8EC_PointC2Ev: 46| 575| EC_Point() = default; _ZN5Botan8EC_PointC2ERKS0_: 57| 325| EC_Point(const EC_Point&) = default; _ZN5Botan8EC_PointaSERKS0_: 67| 324| EC_Point& operator=(const EC_Point&) = default; _ZN5Botan15ECDSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 44| 60| EC_PublicKey(alg_id, key_bits) {} _ZNK5Botan9Exception4whatEv: 94| 5.45k| const char* what() const noexcept override { return m_msg.c_str(); } _ZN5Botan10hex_encodeENSt3__14spanIKhLm18446744073709551615EEEb: 43| 1.84k|inline std::string hex_encode(std::span input, bool uppercase = true) { 44| 1.84k| return hex_encode(input.data(), input.size(), uppercase); 45| 1.84k|} _ZNK5Botan11IPv6AddressssERKS0_: 52| 8| auto operator<=>(const IPv6Address&) const = default; _ZN5Botan3KDFD2Ev: 27| 114| virtual ~KDF() = default; _ZNK5Botan3KDF10derive_keyITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_mNS3_4spanIKhLm18446744073709551615EEESB_SB_: 143| 170| std::span label) const { 144| 170| T key(key_len); 145| 170| perform_kdf(key, secret, salt, label); 146| 170| return key; 147| 170| } _ZNK5Botan3KDF10derive_keyITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_mPKhmSA_mSA_m: 97| 56| size_t label_len = 0) const { 98| 56| return derive_key(key_len, {secret, secret_len}, {salt, salt_len}, {label, label_len}); 99| 56| } _ZN5Botan9clear_memIhEEvPT_m: 118| 589|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 589| clear_bytes(ptr, sizeof(T) * n); 120| 589|} _ZN5Botan11clear_bytesEPvm: 101| 3.72M|inline constexpr void clear_bytes(void* ptr, size_t bytes) { 102| 3.72M| if(bytes > 0) { ------------------ | Branch (102:7): [True: 3.71M, False: 11.7k] ------------------ 103| 3.71M| std::memset(ptr, 0, bytes); 104| 3.71M| } 105| 3.72M|} _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| 211|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 211| ranges::assert_equal_byte_lengths(out, in); 178| 211| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 211|} _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| 211|inline constexpr ToT typecast_copy(const FromR& src) { 211| 211| ToT dst; // NOLINT(*-member-init) 212| 211| typecast_copy(dst, src); 213| 211| return dst; 214| 211|} _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| 211|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 211| ranges::assert_equal_byte_lengths(out, in); 178| 211| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 211|} _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| 211|inline constexpr ToT typecast_copy(const FromR& src) { 211| 211| ToT dst; // NOLINT(*-member-init) 212| 211| typecast_copy(dst, src); 213| 211| return dst; 214| 211|} _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| 211|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 211| ranges::assert_equal_byte_lengths(out, in); 178| 211| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 211|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEENS4_IKhLm18446744073709551615EEEEEvOT_OT0_: 342| 162| ranges::contiguous_range auto&& in) { 343| 162| ranges::assert_equal_byte_lengths(out, in); 344| | 345| 162| std::span o(out); 346| 162| std::span i(in); 347| | 348| 170| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (348:10): [True: 8, False: 162] ------------------ 349| 8| auto x = typecast_copy>(o.template first<32>()); 350| 8| const auto y = typecast_copy>(i.template first<32>()); 351| | 352| 8| x[0] ^= y[0]; 353| 8| x[1] ^= y[1]; 354| 8| x[2] ^= y[2]; 355| 8| x[3] ^= y[3]; 356| | 357| 8| typecast_copy(o.template first<32>(), x); 358| 8| } 359| | 360| 2.63k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (360:24): [True: 2.47k, False: 162] ------------------ 361| 2.47k| o[off] ^= i[off]; 362| 2.47k| } 363| 162|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEENS4_IKhLm18446744073709551615EEETkNS6_IhEES8_EEvOT_OT0_OT1_: 373| 106| ranges::contiguous_range auto&& in2) { 374| 106| ranges::assert_equal_byte_lengths(out, in1, in2); 375| | 376| 106| std::span o{out}; 377| 106| std::span i1{in1}; 378| 106| std::span i2{in2}; 379| | 380| 106| for(; o.size_bytes() >= 32; o = o.subspan(32), i1 = i1.subspan(32), i2 = i2.subspan(32)) { ------------------ | Branch (380:10): [True: 0, False: 106] ------------------ 381| 0| auto x = typecast_copy>(i1.template first<32>()); 382| 0| const auto y = typecast_copy>(i2.template first<32>()); 383| | 384| 0| x[0] ^= y[0]; 385| 0| x[1] ^= y[1]; 386| 0| x[2] ^= y[2]; 387| 0| x[3] ^= y[3]; 388| | 389| 0| typecast_copy(o.template first<32>(), x); 390| 0| } 391| | 392| 1.73k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (392:24): [True: 1.62k, False: 106] ------------------ 393| 1.62k| o[off] = i1[off] ^ i2[off]; 394| 1.62k| } 395| 106|} _ZN5Botan7xor_bufEPhPKhm: 403| 162|inline void xor_buf(uint8_t out[], const uint8_t in[], size_t length) { 404| | // simply assumes that *out and *in point to "length" allocated bytes at least 405| 162| xor_buf(std::span{out, length}, std::span{in, length}); 406| 162|} _ZN5Botan7xor_bufEPhPKhS2_m: 415| 106|inline void xor_buf(uint8_t out[], const uint8_t in[], const uint8_t in2[], size_t length) { 416| | // simply assumes that *out, *in, and *in2 point to "length" allocated bytes at least 417| 106| xor_buf(std::span{out, length}, std::span{in, length}, std::span{in2, length}); 418| 106|} _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| 37.1k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 37.1k| typecast_copy(out, std::span(&in, 1)); 201| 37.1k|} _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| 37.1k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 37.1k| ranges::assert_equal_byte_lengths(out, in); 178| 37.1k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 37.1k|} _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| 192k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 192k| ToT dst; // NOLINT(*-member-init) 212| 192k| typecast_copy(dst, src); 213| 192k| return dst; 214| 192k|} _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| 192k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 192k| typecast_copy(std::span(&out, 1), in); 190| 192k|} _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| 192k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 192k| ranges::assert_equal_byte_lengths(out, in); 178| 192k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 192k|} _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| 168|inline constexpr ToT typecast_copy(const FromR& src) { 211| 168| ToT dst; // NOLINT(*-member-init) 212| 168| typecast_copy(dst, src); 213| 168| return dst; 214| 168|} _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| 168|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 168| typecast_copy(std::span(&out, 1), in); 190| 168|} _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| 168|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 168| ranges::assert_equal_byte_lengths(out, in); 178| 168| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 168|} _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| 119|inline constexpr ToT typecast_copy(const FromR& src) { 211| 119| ToT dst; // NOLINT(*-member-init) 212| 119| typecast_copy(dst, src); 213| 119| return dst; 214| 119|} _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| 119|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 119| typecast_copy(std::span(&out, 1), in); 190| 119|} _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| 119|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 119| ranges::assert_equal_byte_lengths(out, in); 178| 119| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 119|} _ZN5Botan8copy_memIhQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 1.95M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 1.95M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 103| 1.95M| do { \ | | 104| 1.95M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 105| 3.87M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (105:10): [True: 1.93M, False: 18.7k] | | | Branch (105:23): [True: 1.93M, False: 0] | | | Branch (105:23): [True: 1.93M, False: 0] | | ------------------ | | 106| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 107| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 108| 0| } \ | | 109| 1.95M| } while(0) | | ------------------ | | | Branch (109:12): [Folded, False: 1.95M] | | ------------------ ------------------ 146| | 147| 1.95M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 1.95M, False: 1.35k] | Branch (147:24): [True: 1.95M, False: 1.06k] | Branch (147:42): [True: 1.93M, False: 16.3k] ------------------ 148| 1.93M| std::memmove(out, in, sizeof(T) * n); 149| 1.93M| } 150| 1.95M|} _ZN5Botan19secure_scrub_memoryITkNS_6ranges23contiguous_output_rangeERNSt3__16vectorIhNS2_9allocatorIhEEEEEEvOT_: 59| 243k|void secure_scrub_memory(ranges::contiguous_output_range auto&& data) { 60| 243k| secure_scrub_memory(std::ranges::data(data), ranges::size_bytes(data)); 61| 243k|} _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| 102k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromT& in) { 200| 102k| typecast_copy(out, std::span(&in, 1)); 201| 102k|} _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| 102k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 102k| ranges::assert_equal_byte_lengths(out, in); 178| 102k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 102k|} _ZN5Botan9clear_memIjEEvPT_m: 118| 6|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 6| clear_bytes(ptr, sizeof(T) * n); 120| 6|} _ZN5Botan8copy_memImQsr3stdE12is_trivial_vIu7__decayIT_EEEEvPS1_PKS1_m: 144| 1.09M|inline constexpr void copy_mem(T* out, const T* in, size_t n) { 145| 1.09M| BOTAN_ASSERT_IMPLICATION(n > 0, in != nullptr && out != nullptr, "If n > 0 then args are not null"); ------------------ | | 103| 1.09M| do { \ | | 104| 1.09M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 105| 2.18M| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (105:10): [True: 1.09M, False: 0] | | | Branch (105:23): [True: 1.09M, False: 0] | | | Branch (105:23): [True: 1.09M, False: 0] | | ------------------ | | 106| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 107| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 108| 0| } \ | | 109| 1.09M| } while(0) | | ------------------ | | | Branch (109:12): [Folded, False: 1.09M] | | ------------------ ------------------ 146| | 147| 1.09M| if(in != nullptr && out != nullptr && n > 0) { ------------------ | Branch (147:7): [True: 1.09M, False: 0] | Branch (147:24): [True: 1.09M, False: 0] | Branch (147:42): [True: 1.09M, False: 0] ------------------ 148| 1.09M| std::memmove(out, in, sizeof(T) * n); 149| 1.09M| } 150| 1.09M|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEES5_EEvOT_OT0_: 342| 326| ranges::contiguous_range auto&& in) { 343| 326| ranges::assert_equal_byte_lengths(out, in); 344| | 345| 326| std::span o(out); 346| 326| std::span i(in); 347| | 348| 529| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (348:10): [True: 203, False: 326] ------------------ 349| 203| auto x = typecast_copy>(o.template first<32>()); 350| 203| const auto y = typecast_copy>(i.template first<32>()); 351| | 352| 203| x[0] ^= y[0]; 353| 203| x[1] ^= y[1]; 354| 203| x[2] ^= y[2]; 355| 203| x[3] ^= y[3]; 356| | 357| 203| typecast_copy(o.template first<32>(), x); 358| 203| } 359| | 360| 4.11k| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (360:24): [True: 3.78k, False: 326] ------------------ 361| 3.78k| o[off] ^= i[off]; 362| 3.78k| } 363| 326|} _ZN5Botan9clear_memImEEvPT_m: 118| 2.61M|inline constexpr void clear_mem(T* ptr, size_t n) { 119| 2.61M| clear_bytes(ptr, sizeof(T) * n); 120| 2.61M|} _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| 8.44k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 8.44k| ranges::assert_equal_byte_lengths(out, in); 162| 8.44k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 8.44k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 8.44k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 8.44k, False: 0] ------------------ 165| 8.44k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 8.44k| } 167| 8.44k|} _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| 8.28k|inline constexpr ToT typecast_copy(const FromR& src) { 211| 8.28k| ToT dst; // NOLINT(*-member-init) 212| 8.28k| typecast_copy(dst, src); 213| 8.28k| return dst; 214| 8.28k|} _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| 8.28k|inline constexpr void typecast_copy(ToT& out, const FromR& in) { 189| 8.28k| typecast_copy(std::span(&out, 1), in); 190| 8.28k|} _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| 8.28k|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 8.28k| ranges::assert_equal_byte_lengths(out, in); 178| 8.28k| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 8.28k|} _ZN5BotaneOINS_16secure_allocatorIhEES2_EERNSt3__16vectorIhT_EES7_RKNS4_IhT0_EE: 445| 1|std::vector& operator^=(std::vector& out, const std::vector& in) { 446| 1| if(out.size() < in.size()) { ------------------ | Branch (446:7): [True: 0, False: 1] ------------------ 447| 0| out.resize(in.size()); 448| 0| } 449| | 450| 1| xor_buf(std::span{out}.first(in.size()), in); 451| 1| return out; 452| 1|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEENSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEERKNS3_6vectorIhNS_16secure_allocatorIhEEEEEEvOT_OT0_: 342| 1| ranges::contiguous_range auto&& in) { 343| 1| ranges::assert_equal_byte_lengths(out, in); 344| | 345| 1| std::span o(out); 346| 1| std::span i(in); 347| | 348| 1| for(; o.size_bytes() >= 32; o = o.subspan(32), i = i.subspan(32)) { ------------------ | Branch (348:10): [True: 0, False: 1] ------------------ 349| 0| auto x = typecast_copy>(o.template first<32>()); 350| 0| const auto y = typecast_copy>(i.template first<32>()); 351| | 352| 0| x[0] ^= y[0]; 353| 0| x[1] ^= y[1]; 354| 0| x[2] ^= y[2]; 355| 0| x[3] ^= y[3]; 356| | 357| 0| typecast_copy(o.template first<32>(), x); 358| 0| } 359| | 360| 17| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (360:24): [True: 16, False: 1] ------------------ 361| 16| o[off] ^= i[off]; 362| 16| } 363| 1|} _ZN5Botan19secure_scrub_memoryITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayIhLm16EEEEEvOT_: 59| 74|void secure_scrub_memory(ranges::contiguous_output_range auto&& data) { 60| 74| secure_scrub_memory(std::ranges::data(data), ranges::size_bytes(data)); 61| 74|} _ZN5Botan13typecast_copyITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIjLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKhLm18446744073709551615EEEQaasr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISF_EESG_E4type10value_typeEEsr3stdE23is_trivially_copyable_vINS8_IXsr21__is_primary_templateINS9_Iu14__remove_cvrefIDTclL_ZNSB_5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENSH_ISP_EESQ_E4type10value_typeEEEEvOSM_RKSC_: 176| 2|inline constexpr void typecast_copy(ToR&& out /* NOLINT(*-std-forward) */, const FromR& in) { 177| 2| ranges::assert_equal_byte_lengths(out, in); 178| 2| std::memcpy(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 179| 2|} _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| 37|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 37| ranges::assert_equal_byte_lengths(out, in); 162| 37| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 37] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 37| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 37, False: 0] ------------------ 165| 37| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 37| } 167| 37|} _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| 37|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 37| ranges::assert_equal_byte_lengths(out, in); 162| 37| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 37] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 37| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 37, False: 0] ------------------ 165| 37| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 37| } 167| 37|} _ZN5Botan7xor_bufITkNS_6ranges23contiguous_output_rangeIhEERNSt3__14spanIhLm18446744073709551615EEETkNS1_16contiguous_rangeIhEES5_TkNS7_IhEES5_EEvOT_OT0_OT1_: 373| 37| ranges::contiguous_range auto&& in2) { 374| 37| ranges::assert_equal_byte_lengths(out, in1, in2); 375| | 376| 37| std::span o{out}; 377| 37| std::span i1{in1}; 378| 37| std::span i2{in2}; 379| | 380| 37| for(; o.size_bytes() >= 32; o = o.subspan(32), i1 = i1.subspan(32), i2 = i2.subspan(32)) { ------------------ | Branch (380:10): [True: 0, False: 37] ------------------ 381| 0| auto x = typecast_copy>(i1.template first<32>()); 382| 0| const auto y = typecast_copy>(i2.template first<32>()); 383| | 384| 0| x[0] ^= y[0]; 385| 0| x[1] ^= y[1]; 386| 0| x[2] ^= y[2]; 387| 0| x[3] ^= y[3]; 388| | 389| 0| typecast_copy(o.template first<32>(), x); 390| 0| } 391| | 392| 629| for(size_t off = 0; off != o.size_bytes(); ++off) { ------------------ | Branch (392:24): [True: 592, False: 37] ------------------ 393| 592| o[off] = i1[off] ^ i2[off]; 394| 592| } 395| 37|} _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| 1.09M|{ 133| 1.09M| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 1.09M|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeENSt3__14spanImLm18446744073709551615EEETkNS1_16contiguous_rangeENS3_IKmLm18446744073709551615EEEQaasr3stdE9is_same_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRT_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeENS7_IXsr21__is_primary_templateINS8_Iu14__remove_cvrefIDTclL_ZNSA_5beginEEclsr3stdE7declvalIRT0_EEEEEEEEE5valueENSG_ISO_EESP_E4type10value_typeEEsr3stdE23is_trivially_copyable_vIST_EEEvOSB_RKSL_: 160| 6.56k|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 6.56k| ranges::assert_equal_byte_lengths(out, in); 162| 6.56k| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 6.56k] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 6.56k| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 6.56k, False: 1] ------------------ 165| 6.56k| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 6.56k| } 167| 6.56k|} _ZN5Botan8copy_memITkNS_6ranges23contiguous_output_rangeERNSt3__16vectorImNS_16secure_allocatorImEEEETkNS1_16contiguous_rangeENS2_4spanImLm18446744073709551615EEEQaasr3stdE9is_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| 7.58M|inline constexpr void copy_mem(OutR&& out /* NOLINT(*-std-forward) */, const InR& in) { 161| 7.58M| ranges::assert_equal_byte_lengths(out, in); 162| 7.58M| if(std::is_constant_evaluated()) { ------------------ | Branch (162:7): [Folded, False: 7.58M] ------------------ 163| 0| std::copy(std::ranges::begin(in), std::ranges::end(in), std::ranges::begin(out)); 164| 7.58M| } else if(ranges::size_bytes(out) > 0) { ------------------ | Branch (164:14): [True: 7.58M, False: 0] ------------------ 165| 7.58M| std::memmove(std::ranges::data(out), std::ranges::data(in), ranges::size_bytes(out)); 166| 7.58M| } 167| 7.58M|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeERNSt3__15arrayImLm18EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS6_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEE: 132| 21.8k|{ 133| 21.8k| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 21.8k|} _ZN5Botan9clear_memITkNS_6ranges23contiguous_output_rangeERNSt3__14spanIhLm18446744073709551615EEEEEvOT_Qsr3stdE23is_trivially_copyable_vINS2_11conditionalIXsr21__is_primary_templateINS2_15iterator_traitsIu14__remove_cvrefIDTclL_ZNS2_6ranges5__cpo5beginEEclsr3stdE7declvalIRS6_EEEEEEEEE5valueENS2_26indirectly_readable_traitsISE_EESF_E4type10value_typeEE: 132| 38|{ 133| 38| clear_bytes(std::ranges::data(mem), ranges::size_bytes(mem)); 134| 38|} _ZNK5Botan14Asymmetric_Key40_signature_element_size_for_DER_encodingEv: 144| 310| virtual std::optional _signature_element_size_for_DER_encoding() const { return {}; } _ZN5Botan14Asymmetric_KeyD2Ev: 62| 556| virtual ~Asymmetric_Key() = default; _ZN5Botan6PK_Ops10EncryptionD2Ev: 59| 3| virtual ~Encryption() = default; _ZN5Botan6PK_Ops13Key_AgreementD2Ev: 147| 38| virtual ~Key_Agreement() = default; _ZN5Botan6PK_Ops12VerificationD2Ev: 96| 310| virtual ~Verification() = default; _ZN5Botan15Key_ConstraintsC2ENS0_4BitsE: 154| 1.14k| Key_Constraints(Key_Constraints::Bits bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ej: 156| 695| explicit Key_Constraints(uint32_t bits) : m_value(bits) {} _ZN5Botan15Key_ConstraintsC2Ev: 158| 2.99k| Key_Constraints() : m_value(0) {} _ZNK5Botan15Key_Constraints8includesENS0_4BitsE: 178| 43| bool includes(Key_Constraints::Bits other) const { return (m_value & other) == other; } _ZNK5Botan15Key_Constraints5emptyEv: 185| 647| bool empty() const { return m_value == 0; } _ZNK5Botan15Key_ConstraintseqERKS0_: 173| 366| bool operator==(const Key_Constraints&) const = default; _ZNK5Botan15Key_Constraints12includes_anyIJNS0_4BitsES2_EEEbDpOT_: 183| 318| bool includes_any(auto&&... bits) const { return (m_value & (bits | ...)) > 0; } _ZNK5Botan7X509_DN8get_bitsEv: 84| 2.91k| const std::vector& get_bits() const { return m_dn_bits; } _ZN5Botan10Extensions15Extensions_InfoC2EbRKNSt3__16vectorIhNS2_9allocatorIhEEEENS2_10unique_ptrINS_21Certificate_ExtensionENS2_14default_deleteISA_EEEE: 743| 4.11k| m_obj(std::move(ext)), m_bits(encoding), m_critical(critical) {} _ZN5Botan10ExtensionsC2Ev: 720| 2.99k| Extensions() = default; _ZN5Botan10ExtensionsD2Ev: 728| 2.99k| ~Extensions() override = default; _ZN5Botan7X509_DNC2Ev: 45| 6.73k| X509_DN() = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Authority_Key_IDEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 56, False: 868] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 56| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 18, False: 38] ------------------ 598| 18| return nullptr; 599| 38| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 38, False: 0] ------------------ 600| 38| return extn_as_T; 601| 38| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 56| } 605| | 606| 868| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23CRL_Distribution_PointsEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 10, False: 914] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 10| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 10, False: 0] ------------------ 598| 10| return nullptr; 599| 10| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 0, False: 0] ------------------ 600| 0| return extn_as_T; 601| 0| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 10| } 605| | 606| 914| return nullptr; 607| 924| } _ZN5Botan15NameConstraintsC2Ev: 479| 3.00k| NameConstraints() = default; _ZN5Botan21Certificate_ExtensionD2Ev: 568| 5.53k| virtual ~Certificate_Extension() = default; _ZN5Botan15AlternativeNameC2Ev: 176| 7.02k| AlternativeName() = default; _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension17Basic_ConstraintsEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 821, False: 103] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 821| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 137, False: 684] ------------------ 598| 137| return nullptr; 599| 684| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 684, False: 0] ------------------ 600| 684| return extn_as_T; 601| 684| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 821| } 605| | 606| 103| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension28Authority_Information_AccessEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 0, False: 924] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 0| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 0, False: 0] ------------------ 598| 0| return nullptr; 599| 0| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 0, False: 0] ------------------ 600| 0| return extn_as_T; 601| 0| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 0| } 605| | 606| 924| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension9Key_UsageEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 672, False: 252] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 672| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 66, False: 606] ------------------ 598| 66| return nullptr; 599| 606| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 606, False: 0] ------------------ 600| 606| return extn_as_T; 601| 606| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 672| } 605| | 606| 252| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension14Subject_Key_IDEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 60, False: 864] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 60| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 45, False: 15] ------------------ 598| 45| return nullptr; 599| 45| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 15, False: 0] ------------------ 600| 15| return extn_as_T; 601| 15| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 60| } 605| | 606| 864| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension16Name_ConstraintsEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 3, False: 921] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 3| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 3, False: 0] ------------------ 598| 3| return nullptr; 599| 3| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 0, False: 0] ------------------ 600| 0| return extn_as_T; 601| 0| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 3| } 605| | 606| 921| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension18Extended_Key_UsageEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 724, False: 200] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 724| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 166, False: 558] ------------------ 598| 166| return nullptr; 599| 558| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 558, False: 0] ------------------ 600| 558| return extn_as_T; 601| 558| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 724| } 605| | 606| 200| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension23Issuer_Alternative_NameEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 37, False: 887] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 37| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 37, False: 0] ------------------ 598| 37| return nullptr; 599| 37| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 0, False: 0] ------------------ 600| 0| return extn_as_T; 601| 0| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 37| } 605| | 606| 887| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension24Subject_Alternative_NameEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 790, False: 134] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 790| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 563, False: 227] ------------------ 598| 563| return nullptr; 599| 563| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 227, False: 0] ------------------ 600| 227| return extn_as_T; 601| 227| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 790| } 605| | 606| 134| return nullptr; 607| 924| } _ZNK5Botan10Extensions23get_extension_object_asINS_14Cert_Extension20Certificate_PoliciesEEEPKT_RKNS_3OIDE: 594| 924| const T* get_extension_object_as(const OID& oid = T::static_oid()) const { 595| 924| if(const Certificate_Extension* extn = get_extension_object(oid)) { ------------------ | Branch (595:42): [True: 15, False: 909] ------------------ 596| | // Unknown_Extension oid_name is empty 597| 15| if(extn->oid_name().empty()) { ------------------ | Branch (597:16): [True: 15, False: 0] ------------------ 598| 15| return nullptr; 599| 15| } else if(const T* extn_as_T = dynamic_cast(extn)) { ------------------ | Branch (599:32): [True: 0, False: 0] ------------------ 600| 0| return extn_as_T; 601| 0| } else { 602| 0| throw Decoding_Error("Exception::get_extension_object_as dynamic_cast failed"); 603| 0| } 604| 15| } 605| | 606| 909| return nullptr; 607| 924| } _ZNK5Botan12PK_Encryptor7encryptENSt3__14spanIKhLm18446744073709551615EEERNS_21RandomNumberGeneratorE: 46| 3| std::vector encrypt(std::span in, RandomNumberGenerator& rng) const { 47| 3| return enc(in.data(), in.size(), rng); 48| 3| } _ZN5Botan11PK_Verifier14verify_messageENSt3__14spanIKhLm18446744073709551615EEES4_: 324| 310| bool verify_message(std::span msg, std::span sig) { 325| 310| return verify_message(msg.data(), msg.size(), sig.data(), sig.size()); 326| 310| } _ZN5Botan12PK_EncryptorC2Ev: 61| 3| PK_Encryptor() = default; _ZN5Botan12PK_EncryptorD2Ev: 62| 3| virtual ~PK_Encryptor() = default; _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEvRKT0_: 77| 211|inline constexpr void assert_exact_byte_length(const R& r) { 78| 211| const std::span s{r}; 79| 211| if constexpr(statically_spanable_range) { 80| 211| 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| 211|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 211|{ 101| 211| const std::span s0{r0}; 102| | 103| 211| if constexpr(statically_spanable_range) { 104| 211| constexpr size_t expected_size = s0.size_bytes(); 105| 211| (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| 211|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEmRKT_: 59| 422|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 422| return std::span{r}.size_bytes(); 61| 422|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__14spanIKhLm32EEEEEvRKT0_: 77| 211|inline constexpr void assert_exact_byte_length(const R& r) { 78| 211| const std::span s{r}; 79| 211| if constexpr(statically_spanable_range) { 80| 211| 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| 211|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm4EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm32EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 211|{ 101| 211| const std::span s0{r0}; 102| | 103| 211| if constexpr(statically_spanable_range) { 104| 211| constexpr size_t expected_size = s0.size_bytes(); 105| 211| (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| 211|} _ZN5Botan6ranges24assert_exact_byte_lengthILm32ETkNS0_14spanable_rangeENSt3__15arrayImLm4EEEEEvRKT0_: 77| 211|inline constexpr void assert_exact_byte_length(const R& r) { 78| 211| const std::span s{r}; 79| 211| if constexpr(statically_spanable_range) { 80| 211| 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| 211|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm32EEETpTkNS0_14spanable_rangeEJNS2_5arrayImLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 211|{ 101| 211| const std::span s0{r0}; 102| | 103| 211| if constexpr(statically_spanable_range) { 104| 211| constexpr size_t expected_size = s0.size_bytes(); 105| 211| (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| 211|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm32EEEEEmRKT_: 59| 211|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 211| return std::span{r}.size_bytes(); 61| 211|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 8.60k|{ 101| 8.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| 8.60k| } else { 107| 8.60k| const size_t expected_size = s0.size_bytes(); 108| 8.60k| const bool correct_size = 109| 8.60k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 8.60k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 8.60k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 8.60k| } 115| 8.60k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEES6_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 106|{ 101| 106| 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| 106| } else { 107| 106| const size_t expected_size = s0.size_bytes(); 108| 106| const bool correct_size = 109| 212| ((std::span>{rs}.size_bytes() == expected_size) && ...); ------------------ | Branch (109:11): [True: 106, False: 0] | Branch (109:11): [True: 106, False: 0] ------------------ 110| | 111| 106| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 106] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 106| } 115| 106|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEvRKT0_: 77| 53.2k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 53.2k| const std::span s{r}; 79| 53.2k| if constexpr(statically_spanable_range) { 80| 53.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| 53.2k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm8EEETpTkNS0_14spanable_rangeEJNS3_IKmLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 37.1k|{ 101| 37.1k| const std::span s0{r0}; 102| | 103| 37.1k| if constexpr(statically_spanable_range) { 104| 37.1k| constexpr size_t expected_size = s0.size_bytes(); 105| 37.1k| (assert_exact_byte_length(rs), ...); 106| | } else { 107| | const size_t expected_size = s0.size_bytes(); 108| | const bool correct_size = 109| | ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| | if(!correct_size) { 112| | memory_region_size_violation(); 113| | } 114| | } 115| 37.1k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKmLm1EEEEEvRKT0_: 77| 37.1k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 37.1k| const std::span s{r}; 79| 37.1k| if constexpr(statically_spanable_range) { 80| 37.1k| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 37.1k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm8EEEEEmRKT_: 59| 37.1k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 37.1k| return std::span{r}.size_bytes(); 61| 37.1k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__14spanIKhLm8EEEEEvRKT0_: 77| 385k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 385k| const std::span s{r}; 79| 385k| if constexpr(statically_spanable_range) { 80| 385k| 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| 385k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm8EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 192k|{ 101| 192k| const std::span s0{r0}; 102| | 103| 192k| if constexpr(statically_spanable_range) { 104| 192k| constexpr size_t expected_size = s0.size_bytes(); 105| 192k| (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| 192k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm1EEEEEmRKT_: 59| 201k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 201k| return std::span{r}.size_bytes(); 61| 201k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm2ETkNS0_14spanable_rangeENSt3__14spanIKhLm2EEEEEvRKT0_: 77| 336|inline constexpr void assert_exact_byte_length(const R& r) { 78| 336| const std::span s{r}; 79| 336| if constexpr(statically_spanable_range) { 80| 336| 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| 336|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanItLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm2EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 168|{ 101| 168| const std::span s0{r0}; 102| | 103| 168| if constexpr(statically_spanable_range) { 104| 168| constexpr size_t expected_size = s0.size_bytes(); 105| 168| (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| 168|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanItLm1EEEEEmRKT_: 59| 168|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 168| return std::span{r}.size_bytes(); 61| 168|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKhLm4EEEEEvRKT0_: 77| 238|inline constexpr void assert_exact_byte_length(const R& r) { 78| 238| const std::span s{r}; 79| 238| if constexpr(statically_spanable_range) { 80| 238| 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| 238|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm1EEETpTkNS0_14spanable_rangeEJNS3_IKhLm4EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 119|{ 101| 119| const std::span s0{r0}; 102| | 103| 119| if constexpr(statically_spanable_range) { 104| 119| constexpr size_t expected_size = s0.size_bytes(); 105| 119| (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| 119|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm1EEEEEmRKT_: 59| 119|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 119| return std::span{r}.size_bytes(); 61| 119|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__16vectorIhNS2_9allocatorIhEEEEEEmRKT_: 59| 243k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 243k| return std::span{r}.size_bytes(); 61| 243k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEvRKT0_: 77| 196k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 196k| const std::span s{r}; 79| 196k| if constexpr(statically_spanable_range) { 80| 196k| 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| 196k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm4EEETpTkNS0_14spanable_rangeEJNS3_IKjLm1EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 102k|{ 101| 102k| const std::span s0{r0}; 102| | 103| 102k| if constexpr(statically_spanable_range) { 104| 102k| constexpr size_t expected_size = s0.size_bytes(); 105| 102k| (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| 102k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm4ETkNS0_14spanable_rangeENSt3__14spanIKjLm1EEEEEvRKT0_: 77| 102k|inline constexpr void assert_exact_byte_length(const R& r) { 78| 102k| const std::span s{r}; 79| 102k| if constexpr(statically_spanable_range) { 80| 102k| 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| 102k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm4EEEEEmRKT_: 59| 102k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 102k| return std::span{r}.size_bytes(); 61| 102k|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__14spanIKhLm16EEEEEvRKT0_: 77| 32|inline constexpr void assert_exact_byte_length(const R& r) { 78| 32| const std::span s{r}; 79| 32| if constexpr(statically_spanable_range) { 80| 32| static_assert(s.size_bytes() == expected, "memory region does not have expected byte lengths"); 81| | } else { 82| | if(s.size_bytes() != expected) { 83| | memory_region_size_violation(); 84| | } 85| | } 86| 32|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 13|{ 101| 13| 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| 13| } else { 107| 13| const size_t expected_size = s0.size_bytes(); 108| 13| const bool correct_size = 109| 13| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 13| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 13] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 13| } 115| 13|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 4|{ 101| 4| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 4| } else { 107| 4| const size_t expected_size = s0.size_bytes(); 108| 4| const bool correct_size = 109| 4| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 4| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 4] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 4| } 115| 4|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKjLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 12.4k|{ 101| 12.4k| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 12.4k| } else { 107| 12.4k| const size_t expected_size = s0.size_bytes(); 108| 12.4k| const bool correct_size = 109| 12.4k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 12.4k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 12.4k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 12.4k| } 115| 12.4k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEEEEmRKT_: 59| 16.9k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 16.9k| return std::span{r}.size_bytes(); 61| 16.9k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1.19k|{ 101| 1.19k| 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.19k| } else { 107| 1.19k| const size_t expected_size = s0.size_bytes(); 108| 1.19k| const bool correct_size = 109| 1.19k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 1.19k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 1.19k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 1.19k| } 115| 1.19k|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEEEEmRKT_: 59| 1.10M|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 1.10M| return std::span{r}.size_bytes(); 61| 1.10M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJS4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 326|{ 101| 326| 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| 326| } else { 107| 326| const size_t expected_size = s0.size_bytes(); 108| 326| const bool correct_size = 109| 326| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 326| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 326] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 326| } 115| 326|} _ZN5Botan6ranges24assert_exact_byte_lengthILm8ETkNS0_14spanable_rangeENSt3__15arrayIhLm8EEEEEvRKT0_: 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|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm1EEETpTkNS0_14spanable_rangeEJNS3_IhLm8EEEEEEvRKT_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|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayImLm2EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm16EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 32|{ 101| 32| const std::span s0{r0}; 102| | 103| 32| if constexpr(statically_spanable_range) { 104| 32| constexpr size_t expected_size = s0.size_bytes(); 105| 32| (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| 32|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEEEEmRKT_: 59| 222|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 222| return std::span{r}.size_bytes(); 61| 222|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS2_6vectorIhNS_16secure_allocatorIhEEEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 1|{ 101| 1| 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| } else { 107| 1| const size_t expected_size = s0.size_bytes(); 108| 1| const bool correct_size = 109| 1| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 1| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 1] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 1| } 115| 1|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJNS3_ImLm2EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 37|{ 101| 37| const std::span s0{r0}; 102| | 103| 37| if constexpr(statically_spanable_range) { 104| 37| constexpr size_t expected_size = s0.size_bytes(); 105| 37| (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| 37|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__15arrayImLm2EEEEEvRKT0_: 77| 37|inline constexpr void assert_exact_byte_length(const R& r) { 78| 37| const std::span s{r}; 79| 37| if constexpr(statically_spanable_range) { 80| 37| 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| 37|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__15arrayIhLm16EEEEEvRKT0_: 77| 37|inline constexpr void assert_exact_byte_length(const R& r) { 78| 37| const std::span s{r}; 79| 37| if constexpr(statically_spanable_range) { 80| 37| 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| 37|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__14spanIjLm18446744073709551615EEEEEmRKT_: 59| 2|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 2| return std::span{r}.size_bytes(); 61| 2|} _ZN5Botan6ranges24assert_exact_byte_lengthILm1ETkNS0_14spanable_rangeENSt3__14spanIKhLm1EEEEEvRKT0_: 77| 1.28M|inline constexpr void assert_exact_byte_length(const R& r) { 78| 1.28M| const std::span s{r}; 79| 1.28M| if constexpr(statically_spanable_range) { 80| 1.28M| 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.28M|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJNS2_4spanIKhLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 37|{ 101| 37| const std::span s0{r0}; 102| | 103| 37| if constexpr(statically_spanable_range) { 104| 37| constexpr size_t expected_size = s0.size_bytes(); 105| 37| (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| 37|} _ZN5Botan6ranges24assert_exact_byte_lengthILm16ETkNS0_14spanable_rangeENSt3__14spanIKhLm18446744073709551615EEEEEvRKT0_: 77| 37|inline constexpr void assert_exact_byte_length(const R& r) { 78| 37| 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| 37| } else { 82| 37| if(s.size_bytes() != expected) { ------------------ | Branch (82:10): [True: 0, False: 37] ------------------ 83| 0| memory_region_size_violation(); 84| 0| } 85| 37| } 86| 37|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__15arrayIhLm16EEETpTkNS0_14spanable_rangeEJS4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 37|{ 101| 37| const std::span s0{r0}; 102| | 103| 37| if constexpr(statically_spanable_range) { 104| 37| constexpr size_t expected_size = s0.size_bytes(); 105| 37| (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| 37|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanIhLm18446744073709551615EEETpTkNS0_14spanable_rangeEJS4_S4_EEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 37|{ 101| 37| 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| 37| } else { 107| 37| const size_t expected_size = s0.size_bytes(); 108| 37| const bool correct_size = 109| 74| ((std::span>{rs}.size_bytes() == expected_size) && ...); ------------------ | Branch (109:11): [True: 37, False: 0] | Branch (109:11): [True: 37, False: 0] ------------------ 110| | 111| 37| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 37] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 37| } 115| 37|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__14spanImLm18446744073709551615EEETpTkNS0_14spanable_rangeEJNS3_IKmLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 6.56k|{ 101| 6.56k| const std::span s0{r0}; 102| | 103| | if constexpr(statically_spanable_range) { 104| | constexpr size_t expected_size = s0.size_bytes(); 105| | (assert_exact_byte_length(rs), ...); 106| 6.56k| } else { 107| 6.56k| const size_t expected_size = s0.size_bytes(); 108| 6.56k| const bool correct_size = 109| 6.56k| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 6.56k| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 6.56k] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 6.56k| } 115| 6.56k|} _ZN5Botan6ranges25assert_equal_byte_lengthsITkNS0_14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEETpTkNS0_14spanable_rangeEJNS2_4spanImLm18446744073709551615EEEEEEvRKT_DpRKT0_QgtsZT0_Li0E: 100| 7.58M|{ 101| 7.58M| 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| 7.58M| } else { 107| 7.58M| const size_t expected_size = s0.size_bytes(); 108| 7.58M| const bool correct_size = 109| 7.58M| ((std::span>{rs}.size_bytes() == expected_size) && ...); 110| | 111| 7.58M| if(!correct_size) { ------------------ | Branch (111:10): [True: 0, False: 7.58M] ------------------ 112| 0| memory_region_size_violation(); 113| 0| } 114| 7.58M| } 115| 7.58M|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__16vectorImNS_16secure_allocatorImEEEEEEmRKT_: 59| 15.1M|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 15.1M| return std::span{r}.size_bytes(); 61| 15.1M|} _ZN5Botan6ranges10size_bytesITkNS0_14spanable_rangeENSt3__15arrayImLm18EEEEEmRKT_: 59| 21.8k|inline constexpr size_t size_bytes(const spanable_range auto& r) { 60| 21.8k| return std::span{r}.size_bytes(); 61| 21.8k|} _ZN5Botan21RandomNumberGeneratorD2Ev: 52| 7.28k| virtual ~RandomNumberGenerator() = default; _ZN5Botan21RandomNumberGenerator9randomizeENSt3__14spanIhLm18446744073709551615EEE: 75| 11.3k| void randomize(std::span output) { this->fill_bytes_with_input(output, {}); } _ZN5Botan21RandomNumberGenerator9randomizeEPhm: 77| 42| void randomize(uint8_t output[], size_t length) { this->randomize(std::span(output, length)); } _ZN5Botan21RandomNumberGenerator11add_entropyENSt3__14spanIKhLm18446744073709551615EEE: 98| 1| void add_entropy(std::span input) { this->fill_bytes_with_input({}, input); } _ZN5Botan21RandomNumberGenerator10random_vecENSt3__14spanIhLm18446744073709551615EEE: 204| 11.3k| void random_vec(std::span v) { this->randomize(v); } _ZN5Botan21RandomNumberGenerator9next_byteEv: 252| 617| uint8_t next_byte() { 253| 617| uint8_t b = 0; 254| 617| this->fill_bytes_with_input(std::span(&b, 1), {}); 255| 617| return b; 256| 617| } _ZN5Botan21RandomNumberGenerator17next_nonzero_byteEv: 263| 615| uint8_t next_nonzero_byte() { 264| 615| uint8_t b = this->next_byte(); 265| 617| while(b == 0) { ------------------ | Branch (265:16): [True: 2, False: 615] ------------------ 266| 2| b = this->next_byte(); 267| 2| } 268| 615| return b; 269| 615| } _ZN5Botan21RandomNumberGeneratorC2Ev: 54| 7.28k| RandomNumberGenerator() = default; _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEEEvRT_m: 215| 7.28k| void random_vec(T& v, size_t bytes) { 216| 7.28k| v.resize(bytes); 217| 7.28k| random_vec(v); 218| 7.28k| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEQsr3stdE21default_initializableIT_EEES8_m: 230| 4.05k| T random_vec(size_t bytes) { 231| 4.05k| T result; 232| 4.05k| random_vec(result, bytes); 233| 4.05k| return result; 234| 4.05k| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEEvRT_m: 215| 4.05k| void random_vec(T& v, size_t bytes) { 216| 4.05k| v.resize(bytes); 217| 4.05k| random_vec(v); 218| 4.05k| } _ZN5Botan21RandomNumberGenerator10random_vecITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS3_9allocatorIhEEEEQsr3stdE21default_initializableIT_EEES8_m: 230| 7.28k| T random_vec(size_t bytes) { 231| 7.28k| T result; 232| 7.28k| random_vec(result, bytes); 233| 7.28k| return result; 234| 7.28k| } _ZNK5Botan13RSA_PublicKey9algo_nameEv: 41| 988| std::string algo_name() const override { return "RSA"; } _ZN5Botan16secure_allocatorIhE8allocateEm: 52| 70.1k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan16secure_allocatorIhE10deallocateEPhm: 54| 70.1k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5BotanneIhhEEbRKNS_16secure_allocatorIT_EERKNS1_IT0_EE: 63| 687|inline bool operator!=(const secure_allocator& /*a*/, const secure_allocator& /*b*/) { 64| 687| return false; 65| 687|} _ZN5Botan16secure_allocatorIjE10deallocateEPjm: 54| 9.35k| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE10deallocateEPmm: 54| 6.64M| void deallocate(T* p, std::size_t n) { deallocate_memory(p, n, sizeof(T)); } _ZN5Botan16secure_allocatorImE8allocateEm: 52| 6.64M| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan7zeroiseIhNSt3__19allocatorIhEEEEvRNS1_6vectorIT_T0_EE: 137| 101|void zeroise(std::vector& vec) { 138| 1.71k| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (138:22): [True: 1.61k, False: 101] ------------------ 139| 1.61k| vec[i] = static_cast(0); 140| 1.61k| } 141| 101|} _ZN5BotanpLIhNSt3__19allocatorIhEES3_EERNS1_6vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 92| 106k|std::vector& operator+=(std::vector& out, const std::vector& in) { 93| 106k| out.insert(out.end(), in.begin(), in.end()); 94| 106k| return out; 95| 106k|} _ZN5BotanpLIhNSt3__19allocatorIhEENS_16secure_allocatorIhEEEERNS1_6vectorIT_T0_EESA_RKNS6_IS7_T1_EE: 92| 114|std::vector& operator+=(std::vector& out, const std::vector& in) { 93| 114| out.insert(out.end(), in.begin(), in.end()); 94| 114| return out; 95| 114|} _ZN5BotanpLIhNS_16secure_allocatorIhEES2_EERNSt3__16vectorIT_T0_EES8_RKNS4_IS5_T1_EE: 92| 5|std::vector& operator+=(std::vector& out, const std::vector& in) { 93| 5| out.insert(out.end(), in.begin(), in.end()); 94| 5| return out; 95| 5|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPKS5_T1_EE: 110| 14.6k|std::vector& operator+=(std::vector& out, const std::pair& in) { 111| 14.6k| out.insert(out.end(), in.first, in.first + in.second); 112| 14.6k| return out; 113| 14.6k|} _ZN5BotanpLIhNS_16secure_allocatorIhEENSt3__19allocatorIhEEEERNS3_6vectorIT_T0_EESA_RKNS6_IS7_T1_EE: 92| 42|std::vector& operator+=(std::vector& out, const std::vector& in) { 93| 42| out.insert(out.end(), in.begin(), in.end()); 94| 42| return out; 95| 42|} _ZN5Botan16secure_allocatorIjE8allocateEm: 52| 9.35k| T* allocate(std::size_t n) { return static_cast(allocate_memory(n, sizeof(T))); } _ZN5Botan3zapImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 157| 32|void zap(std::vector& vec) { 158| 32| zeroise(vec); 159| 32| vec.clear(); 160| 32| vec.shrink_to_fit(); 161| 32|} _ZN5Botan7zeroiseImNS_16secure_allocatorImEEEEvRNSt3__16vectorIT_T0_EE: 137| 32|void zeroise(std::vector& vec) { 138| 32| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (138:22): [True: 0, False: 32] ------------------ 139| 0| vec[i] = static_cast(0); 140| 0| } 141| 32|} _ZN5Botan7zeroiseIhNS_16secure_allocatorIhEEEEvRNSt3__16vectorIT_T0_EE: 137| 101|void zeroise(std::vector& vec) { 138| 25.9k| for(size_t i = 0; i != vec.size(); ++i) { ------------------ | Branch (138:22): [True: 25.8k, False: 101] ------------------ 139| 25.8k| vec[i] = static_cast(0); 140| 25.8k| } 141| 101|} _ZN5BotanpLIhNS_16secure_allocatorIhEEmEERNSt3__16vectorIT_T0_EES8_RKNS3_4pairIPS5_T1_EE: 116| 38|std::vector& operator+=(std::vector& out, const std::pair& in) { 117| 38| out.insert(out.end(), in.first, in.first + in.second); 118| 38| return out; 119| 38|} _ZN5Botan6unlockIhEENSt3__16vectorIT_NS1_9allocatorIS3_EEEERKNS2_IS3_NS_16secure_allocatorIS3_EEEE: 85| 58|std::vector unlock(const secure_vector& in) { 86| 58| return std::vector(in.begin(), in.end()); 87| 58|} _ZN5BotanpLIhNSt3__19allocatorIhEEmEERNS1_6vectorIT_T0_EES8_RKNS1_4pairIPKS5_T1_EE: 110| 58|std::vector& operator+=(std::vector& out, const std::pair& in) { 111| 58| out.insert(out.end(), in.first, in.first + in.second); 112| 58| return out; 113| 58|} _ZN5BotanpLIhNSt3__19allocatorIhEEEERNS1_6vectorIT_T0_EES8_NS1_4spanIKS5_Lm18446744073709551615EEE: 98| 7.28k|std::vector& operator+=(std::vector& out, std::span in) { 99| 7.28k| out.insert(out.end(), in.begin(), in.end()); 100| 7.28k| return out; 101| 7.28k|} _ZN5Botan12Stateful_RNGC2Ev: 58| 1| Stateful_RNG() : m_reseed_interval(0) {} _ZN5Botan12StreamCipher6cipherEPKhPhm: 59| 106| void cipher(const uint8_t in[], uint8_t out[], size_t len) { cipher_bytes(in, out, len); } _ZN5Botan12StreamCipher15write_keystreamENSt3__14spanIhLm18446744073709551615EEE: 86| 12.0k| void write_keystream(std::span out) { generate_keystream(out.data(), out.size()); } _ZN5Botan12StreamCipher8encipherENSt3__14spanIhLm18446744073709551615EEE: 122| 69| void encipher(std::span inout) { cipher(inout.data(), inout.data(), inout.size()); } _ZN5Botan12StreamCipher6set_ivEPKhm: 166| 71| void set_iv(const uint8_t iv[], size_t iv_len) { set_iv_bytes(iv, iv_len); } _ZN5Botan12StreamCipher6set_ivENSt3__14spanIKhLm18446744073709551615EEE: 173| 32| void set_iv(std::span iv) { set_iv_bytes(iv.data(), iv.size()); } _ZN5Botan12StreamCipher15keystream_bytesITkNS_8concepts21resizable_byte_bufferENSt3__16vectorIhNS_16secure_allocatorIhEEEEEET_m: 96| 1| T keystream_bytes(size_t bytes) { 97| 1| T out(bytes); 98| 1| write_keystream(out); 99| 1| return out; 100| 1| } _ZNKR5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE3getEv: 87| 17.8k| constexpr const T& get() const& { return m_value; } _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE4sizeEv: 141| 2| size_type size() const noexcept(noexcept(this->get().size())) { return this->get().size(); } _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEED2Ev: 81| 34.5k| ~Strong_Base() = default; _ZNK5Botan6detail29Container_Strong_Adapter_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEE5emptyEvQsr8conceptsE9has_emptyIT_E: 145| 3.13k| { 146| 3.13k| return this->get().empty(); 147| 3.13k| } _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ES6_: 83| 9.93k| constexpr explicit Strong_Base(T v) : m_value(std::move(v)) {} _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2EOS7_: 78| 8| Strong_Base(Strong_Base&&) noexcept = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2ERKS7_: 77| 8| Strong_Base(const Strong_Base&) = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEC2Ev: 76| 24.5k| Strong_Base() = default; _ZN5Botan6detail11Strong_BaseINSt3__16vectorIhNS2_9allocatorIhEEEEEaSEOS7_: 80| 9.93k| Strong_Base& operator=(Strong_Base&&) noexcept = default; _ZN5Botan18unwrap_strong_typeIRmEEDcOT_: 243| 37.1k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 244| 37.1k| if constexpr(!concepts::strong_type>) { 245| | // If the parameter type isn't a strong type, return it as is. 246| 37.1k| return std::forward(t); 247| | } else { 248| | // Unwrap the strong type and return the underlying value. 249| | return std::forward(t).get(); 250| | } 251| 37.1k|} _ZN5Botan16wrap_strong_typeImRmQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 268| 201k|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 269| 201k| if constexpr(std::same_as, T>) { 270| | // Noop, if the parameter type already is the desired return type. 271| 201k| return std::forward(t); 272| | } else if constexpr(std::constructible_from) { 273| | // Implicit conversion from the parameter type to the return type. 274| | return T{std::forward(t)}; 275| | } else { 276| | // Explicitly calling the wrapped type's constructor to support 277| | // implicit conversions on types that mark their constructors as explicit. 278| | static_assert(concepts::strong_type && std::constructible_from); 279| | return T{typename T::wrapped_type{std::forward(t)}}; 280| | } 281| 201k|} _ZN5Botan16wrap_strong_typeItRtQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 268| 168|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 269| 168| if constexpr(std::same_as, T>) { 270| | // Noop, if the parameter type already is the desired return type. 271| 168| return std::forward(t); 272| | } else if constexpr(std::constructible_from) { 273| | // Implicit conversion from the parameter type to the return type. 274| | return T{std::forward(t)}; 275| | } else { 276| | // Explicitly calling the wrapped type's constructor to support 277| | // implicit conversions on types that mark their constructors as explicit. 278| | static_assert(concepts::strong_type && std::constructible_from); 279| | return T{typename T::wrapped_type{std::forward(t)}}; 280| | } 281| 168|} _ZN5Botan16wrap_strong_typeIjRjQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 268| 119|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 269| 119| if constexpr(std::same_as, T>) { 270| | // Noop, if the parameter type already is the desired return type. 271| 119| return std::forward(t); 272| | } else if constexpr(std::constructible_from) { 273| | // Implicit conversion from the parameter type to the return type. 274| | return T{std::forward(t)}; 275| | } else { 276| | // Explicitly calling the wrapped type's constructor to support 277| | // implicit conversions on types that mark their constructors as explicit. 278| | static_assert(concepts::strong_type && std::constructible_from); 279| | return T{typename T::wrapped_type{std::forward(t)}}; 280| | } 281| 119|} _ZN5Botan18unwrap_strong_typeIRjEEDcOT_: 243| 102k|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 244| 102k| if constexpr(!concepts::strong_type>) { 245| | // If the parameter type isn't a strong type, return it as is. 246| 102k| return std::forward(t); 247| | } else { 248| | // Unwrap the strong type and return the underlying value. 249| | return std::forward(t).get(); 250| | } 251| 102k|} _ZN5Botan18unwrap_strong_typeIRNSt3__16vectorIhNS_16secure_allocatorIhEEEEEEDcOT_: 243| 340|[[nodiscard]] constexpr decltype(auto) unwrap_strong_type(T&& t) { 244| 340| if constexpr(!concepts::strong_type>) { 245| | // If the parameter type isn't a strong type, return it as is. 246| 340| return std::forward(t); 247| | } else { 248| | // Unwrap the strong type and return the underlying value. 249| | return std::forward(t).get(); 250| | } 251| 340|} _ZN5Botan16wrap_strong_typeIhRhQoosr3stdE18constructible_fromIT_T0_Eaasr8conceptsE11strong_typeIS2_Esr3stdE18constructible_fromINS2_12wrapped_typeES3_EEEDcOS3_: 268| 1.28M|[[nodiscard]] constexpr decltype(auto) wrap_strong_type(ParamT&& t) { 269| 1.28M| if constexpr(std::same_as, T>) { 270| | // Noop, if the parameter type already is the desired return type. 271| 1.28M| return std::forward(t); 272| | } else if constexpr(std::constructible_from) { 273| | // Implicit conversion from the parameter type to the return type. 274| | return T{std::forward(t)}; 275| | } else { 276| | // Explicitly calling the wrapped type's constructor to support 277| | // implicit conversions on types that mark their constructors as explicit. 278| | static_assert(concepts::strong_type && std::constructible_from); 279| | return T{typename T::wrapped_type{std::forward(t)}}; 280| | } 281| 1.28M|} _ZN5BotaneqINSt3__16vectorIhNS1_9allocatorIhEEEEJNS_3TLS11Session_ID_EEQsr3stdE19equality_comparableIT_EEEbRKNS_6StrongIS8_DpT0_EESE_: 317| 65|bool operator==(const Strong& lhs, const Strong& rhs) { 318| 65| return lhs.get() == rhs.get(); 319| 65|} _ZN5Botan24Key_Length_SpecificationC2Em: 28| 62| explicit Key_Length_Specification(size_t keylen) : m_min_keylen(keylen), m_max_keylen(keylen), m_keylen_mod(1) {} _ZN5Botan24Key_Length_SpecificationC2Emmm: 37| 422| m_min_keylen(min_k), m_max_keylen(max_k > 0 ? max_k : min_k), m_keylen_mod(k_mod) {} ------------------ | Branch (37:47): [True: 240, False: 182] ------------------ _ZNK5Botan24Key_Length_Specification15valid_keylengthEm: 43| 484| bool valid_keylength(size_t length) const { 44| 484| return ((length >= m_min_keylen) && (length <= m_max_keylen) && (length % m_keylen_mod == 0)); ------------------ | Branch (44:18): [True: 484, False: 0] | Branch (44:46): [True: 484, False: 0] | Branch (44:74): [True: 484, False: 0] ------------------ 45| 484| } _ZNK5Botan18SymmetricAlgorithm15valid_keylengthEm: 113| 484| bool valid_keylength(size_t length) const { return key_spec().valid_keylength(length); } _ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEv: 145| 14.4k| void assert_key_material_set() const { assert_key_material_set(has_keying_material()); } _ZNK5Botan18SymmetricAlgorithm23assert_key_material_setEb: 147| 14.4k| void assert_key_material_set(bool predicate) const { 148| 14.4k| if(!predicate) { ------------------ | Branch (148:13): [True: 0, False: 14.4k] ------------------ 149| 0| throw_key_not_set_error(); 150| 0| } 151| 14.4k| } _ZN5Botan18SymmetricAlgorithmD2Ev: 81| 366| virtual ~SymmetricAlgorithm() = default; _ZN5Botan18SymmetricAlgorithmC2Ev: 80| 366| SymmetricAlgorithm() = default; _ZNK5Botan11OctetString6lengthEv: 27| 15| size_t length() const { return m_data.size(); } _ZNK5Botan11OctetString5emptyEv: 31| 15| bool empty() const { return m_data.empty(); } _ZNK5Botan11OctetString7bits_ofEv: 36| 53| secure_vector bits_of() const { return m_data; } _ZN5Botan11OctetStringC2ENSt3__16vectorIhNS_16secure_allocatorIhEEEE: 99| 53| explicit OctetString(secure_vector in) : m_data(std::move(in)) {} _ZNK5Botan3TLS5Alert8is_validEv: 78| 7.55k| bool is_valid() const { return (m_type_code != AlertType::None); } _ZNK5Botan3TLS5Alert8is_fatalEv: 93| 24.9k| bool is_fatal() const { return m_fatal; } _ZNK5Botan3TLS5Alert4typeEv: 100| 27.6k| Type type() const { return m_type_code; } _ZN5Botan3TLS5AlertC2ENS0_9AlertTypeEb: 126| 7.55k| m_fatal(fatal), m_type_code(type_code) {} _ZN5Botan3TLS12Group_ParamsC2Ev: 141| 25| constexpr Group_Params() : m_code(Group_Params_Code::NONE) {} _ZN5Botan3TLS12Group_ParamsC2Et: 147| 1.09k| constexpr Group_Params(uint16_t code) : m_code(static_cast(code)) {} _ZNK5Botan3TLS12Group_Params9wire_codeEv: 162| 73.9k| constexpr uint16_t wire_code() const { return static_cast(m_code); } _ZNK5Botan3TLS12Group_Params9is_x25519Ev: 169| 72.8k| constexpr bool is_x25519() const { return m_code == Group_Params_Code::X25519; } _ZNK5Botan3TLS12Group_Params7is_x448Ev: 171| 65.5k| constexpr bool is_x448() const { return m_code == Group_Params_Code::X448; } _ZNK5Botan3TLS12Group_Params19is_ecdh_named_curveEv: 173| 58.2k| constexpr bool is_ecdh_named_curve() const { 174| 58.2k| return m_code == Group_Params_Code::SECP256R1 || m_code == Group_Params_Code::SECP384R1 || ------------------ | Branch (174:17): [True: 7.28k, False: 51.0k] | Branch (174:59): [True: 7.28k, False: 43.7k] ------------------ 175| 43.7k| m_code == Group_Params_Code::SECP521R1 || m_code == Group_Params_Code::BRAINPOOL256R1 || ------------------ | Branch (175:17): [True: 7.28k, False: 36.4k] | Branch (175:59): [True: 7.28k, False: 29.1k] ------------------ 176| 29.1k| m_code == Group_Params_Code::BRAINPOOL384R1 || m_code == Group_Params_Code::BRAINPOOL512R1; ------------------ | Branch (176:17): [True: 7.28k, False: 21.8k] | Branch (176:64): [True: 7.28k, False: 14.5k] ------------------ 177| 58.2k| } _ZNK5Botan3TLS12Group_Params14is_pure_ml_kemEv: 190| 94.7k| constexpr bool is_pure_ml_kem() const { 191| 94.7k| return m_code == Group_Params_Code::ML_KEM_512 || m_code == Group_Params_Code::ML_KEM_768 || ------------------ | Branch (191:17): [True: 0, False: 94.7k] | Branch (191:60): [True: 0, False: 94.7k] ------------------ 192| 94.7k| m_code == Group_Params_Code::ML_KEM_1024; ------------------ | Branch (192:17): [True: 0, False: 94.7k] ------------------ 193| 94.7k| } _ZNK5Botan3TLS12Group_Params16is_pure_frodokemEv: 195| 94.7k| constexpr bool is_pure_frodokem() const { 196| 94.7k| return m_code == Group_Params_Code::eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (196:17): [True: 0, False: 94.7k] ------------------ 197| 94.7k| m_code == Group_Params_Code::eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (197:17): [True: 0, False: 94.7k] ------------------ 198| 94.7k| m_code == Group_Params_Code::eFRODOKEM_1344_SHAKE_OQS || ------------------ | Branch (198:17): [True: 0, False: 94.7k] ------------------ 199| 94.7k| m_code == Group_Params_Code::eFRODOKEM_640_AES_OQS || ------------------ | Branch (199:17): [True: 0, False: 94.7k] ------------------ 200| 94.7k| m_code == Group_Params_Code::eFRODOKEM_976_AES_OQS || ------------------ | Branch (200:17): [True: 0, False: 94.7k] ------------------ 201| 94.7k| m_code == Group_Params_Code::eFRODOKEM_1344_AES_OQS; ------------------ | Branch (201:17): [True: 0, False: 94.7k] ------------------ 202| 94.7k| } _ZNK5Botan3TLS12Group_Params17is_pure_ecc_groupEv: 204| 72.8k| constexpr bool is_pure_ecc_group() const { return is_x25519() || is_x448() || is_ecdh_named_curve(); } ------------------ | Branch (204:57): [True: 7.28k, False: 65.5k] | Branch (204:72): [True: 7.28k, False: 58.2k] | Branch (204:85): [True: 43.7k, False: 14.5k] ------------------ _ZNK5Botan3TLS12Group_Params15is_post_quantumEv: 206| 94.7k| constexpr bool is_post_quantum() const { 207| 94.7k| BOTAN_DIAGNOSTIC_PUSH 208| 94.7k| BOTAN_DIAGNOSTIC_IGNORE_DEPRECATED_DECLARATIONS 209| | 210| 94.7k| return is_pure_ml_kem() || is_pure_frodokem() || is_pqc_hybrid(); ------------------ | Branch (210:17): [True: 0, False: 94.7k] | Branch (210:37): [True: 0, False: 94.7k] | Branch (210:59): [True: 21.8k, False: 72.8k] ------------------ 211| | 212| 94.7k| BOTAN_DIAGNOSTIC_POP 213| 94.7k| } _ZNK5Botan3TLS12Group_Params20is_pqc_hybrid_ml_kemEv: 215| 94.7k| constexpr bool is_pqc_hybrid_ml_kem() const { 216| 94.7k| return m_code == Group_Params_Code::HYBRID_SECP256R1_ML_KEM_768 || ------------------ | Branch (216:17): [True: 7.28k, False: 87.4k] ------------------ 217| 87.4k| m_code == Group_Params_Code::HYBRID_SECP384R1_ML_KEM_1024 || ------------------ | Branch (217:17): [True: 7.28k, False: 80.1k] ------------------ 218| 80.1k| m_code == Group_Params_Code::HYBRID_X25519_ML_KEM_768; ------------------ | Branch (218:17): [True: 7.28k, False: 72.8k] ------------------ 219| 94.7k| } _ZNK5Botan3TLS12Group_Params22is_pqc_hybrid_frodokemEv: 221| 72.8k| constexpr bool is_pqc_hybrid_frodokem() const { 222| 72.8k| return m_code == Group_Params_Code::HYBRID_X25519_eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (222:17): [True: 0, False: 72.8k] ------------------ 223| 72.8k| m_code == Group_Params_Code::HYBRID_X25519_eFRODOKEM_640_AES_OQS || ------------------ | Branch (223:17): [True: 0, False: 72.8k] ------------------ 224| 72.8k| m_code == Group_Params_Code::HYBRID_X448_eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (224:17): [True: 0, False: 72.8k] ------------------ 225| 72.8k| m_code == Group_Params_Code::HYBRID_X448_eFRODOKEM_976_AES_OQS || ------------------ | Branch (225:17): [True: 0, False: 72.8k] ------------------ 226| 72.8k| m_code == Group_Params_Code::HYBRID_SECP256R1_eFRODOKEM_640_SHAKE_OQS || ------------------ | Branch (226:17): [True: 0, False: 72.8k] ------------------ 227| 72.8k| m_code == Group_Params_Code::HYBRID_SECP256R1_eFRODOKEM_640_AES_OQS || ------------------ | Branch (227:17): [True: 0, False: 72.8k] ------------------ 228| 72.8k| m_code == Group_Params_Code::HYBRID_SECP384R1_eFRODOKEM_976_SHAKE_OQS || ------------------ | Branch (228:17): [True: 0, False: 72.8k] ------------------ 229| 72.8k| m_code == Group_Params_Code::HYBRID_SECP384R1_eFRODOKEM_976_AES_OQS || ------------------ | Branch (229:17): [True: 0, False: 72.8k] ------------------ 230| 72.8k| m_code == Group_Params_Code::HYBRID_SECP521R1_eFRODOKEM_1344_SHAKE_OQS || ------------------ | Branch (230:17): [True: 0, False: 72.8k] ------------------ 231| 72.8k| m_code == Group_Params_Code::HYBRID_SECP521R1_eFRODOKEM_1344_AES_OQS; ------------------ | Branch (231:17): [True: 0, False: 72.8k] ------------------ 232| 72.8k| } _ZNK5Botan3TLS12Group_Params13is_pqc_hybridEv: 234| 94.7k| constexpr bool is_pqc_hybrid() const { return is_pqc_hybrid_ml_kem() || is_pqc_hybrid_frodokem(); } ------------------ | Branch (234:53): [True: 21.8k, False: 72.8k] | Branch (234:79): [True: 0, False: 72.8k] ------------------ _ZN5Botan3TLS9CallbacksD2Ev: 59| 7.28k| virtual ~Callbacks() = default; _ZN5Botan3TLS9Callbacks21tls_session_activatedEv: 154| 2| virtual void tls_session_activated() {} _ZN5Botan3TLS9Callbacks26tls_peer_closed_connectionEv: 176| 423| virtual bool tls_peer_closed_connection() { return true; } _ZNK5Botan3TLS9Callbacks34tls_verify_cert_chain_ocsp_timeoutEv: 275| 361| virtual std::chrono::milliseconds tls_verify_cert_chain_ocsp_timeout() const { 276| 361| return std::chrono::milliseconds(0); 277| 361| } _ZN5Botan3TLS7Channel13received_dataENSt3__14spanIKhLm18446744073709551615EEE: 58| 7.28k| size_t received_data(std::span data) { return this->from_peer(data); } _ZN5Botan3TLS7ChannelC2Ev: 47| 7.28k| Channel() = default; _ZN5Botan3TLS7ChannelD2Ev: 39| 7.28k| virtual ~Channel() = default; _ZNK5Botan3TLS11Ciphersuite5validEv: 141| 743k| bool valid() const { return m_usable; } _ZNK5Botan3TLS11Ciphersuite16ciphersuite_codeEv: 62| 1.42M| uint16_t ciphersuite_code() const { return m_ciphersuite_code; } _ZNK5Botan3TLS11Ciphersuite8kex_algoEv: 102| 2| std::string kex_algo() const { return kex_method_to_string(kex_method()); } _ZNK5Botan3TLS11Ciphersuite10kex_methodEv: 104| 2.23k| Kex_Algo kex_method() const { return m_kex_algo; } _ZNK5Botan3TLS11Ciphersuite8sig_algoEv: 109| 333| std::string sig_algo() const { return auth_method_to_string(auth_method()); } _ZNK5Botan3TLS11Ciphersuite11auth_methodEv: 111| 4.45k| Auth_Method auth_method() const { return m_auth_method; } _ZNK5Botan3TLS11Ciphersuite11cipher_algoEv: 116| 93| std::string cipher_algo() const { return m_cipher_algo; } _ZNK5Botan3TLS11Ciphersuite8mac_algoEv: 121| 5.48k| std::string mac_algo() const { return m_mac_algo; } _ZNK5Botan3TLS11Ciphersuite8prf_algoEv: 123| 230| std::string prf_algo() const { return kdf_algo_to_string(m_prf_algo); } _ZNK5Botan3TLS11Ciphersuite13cipher_keylenEv: 128| 86| size_t cipher_keylen() const { return m_cipher_keylen; } _ZNK5Botan3TLS11Ciphersuite12nonce_formatEv: 134| 63| Nonce_Format nonce_format() const { return m_nonce_format; } _ZNK5Botan3TLS11Ciphersuite10mac_keylenEv: 136| 86| size_t mac_keylen() const { return m_mac_keylen; } _ZNK5Botan3TLS11CiphersuiteltEt: 147| 76.0k| bool operator<(const uint16_t c) const { return ciphersuite_code() < c; } _ZN5Botan3TLS11CiphersuiteC2EtPKcNS0_11Auth_MethodENS0_8Kex_AlgoES3_mS3_mNS0_8KDF_AlgoENS0_12Nonce_FormatE: 162| 102| m_ciphersuite_code(ciphersuite_code), 163| 102| m_iana_id(iana_id), 164| 102| m_auth_method(auth_method), 165| 102| m_kex_algo(kex_algo), 166| 102| m_prf_algo(prf_algo), 167| 102| m_nonce_format(nonce_format), 168| 102| m_cipher_algo(cipher_algo), 169| 102| m_mac_algo(mac_algo), 170| 102| m_cipher_keylen(cipher_keylen), 171| 102| m_mac_keylen(mac_keylen), 172| 102| m_usable(is_known_usable(ciphersuite_code)) {} _ZN5Botan3TLS13TLS_ExceptionC2ENS0_9AlertTypeENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 24| 5.67k| Exception(err_msg), m_alert_type(type) {} _ZNK5Botan3TLS13TLS_Exception4typeEv: 21| 5.31k| Alert::Type type() const { return m_alert_type; } _ZN5Botan3TLS18Unexpected_MessageC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 39| 35| explicit Unexpected_Message(std::string_view err) : TLS_Exception(AlertType::UnexpectedMessage, err) {} _ZN5Botan3TLS21Server_Name_Indicator11static_typeEv: 110| 7.57k| static Extension_Code static_type() { return Extension_Code::ServerNameIndication; } _ZNK5Botan3TLS21Server_Name_Indicator4typeEv: 112| 7.57k| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS21Server_Name_IndicatorC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 114| 7.28k| explicit Server_Name_Indicator(std::string_view host_name) : m_sni_host_name(host_name) {} _ZNK5Botan3TLS21Server_Name_Indicator5emptyEv: 122| 12.9k| bool empty() const override { return false; } _ZN5Botan3TLS39Application_Layer_Protocol_Notification11static_typeEv: 135| 10.6k| static Extension_Code static_type() { return Extension_Code::ApplicationLayerProtocolNegotiation; } _ZNK5Botan3TLS39Application_Layer_Protocol_Notification4typeEv: 137| 4| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS21Certificate_Type_Base5emptyEv: 189| 5| bool empty() const override { 190| | // RFC 7250 4.1 191| | // If the client has no remaining certificate types to send in the 192| | // client hello, other than the default X.509 type, it MUST omit the 193| | // entire client[/server]_certificate_type extension [...]. 194| 5| return m_from == Connection_Side::Client && m_certificate_types.size() == 1 && ------------------ | Branch (194:17): [True: 0, False: 5] | Branch (194:54): [True: 0, False: 0] ------------------ 195| 0| m_certificate_types.front() == Certificate_Type::X509; ------------------ | Branch (195:17): [True: 0, False: 0] ------------------ 196| 5| } _ZN5Botan3TLS23Client_Certificate_Type11static_typeEv: 212| 11| static Extension_Code static_type() { return Extension_Code::ClientCertificateType; } _ZNK5Botan3TLS23Client_Certificate_Type4typeEv: 214| 11| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Server_Certificate_Type11static_typeEv: 226| 11| static Extension_Code static_type() { return Extension_Code::ServerCertificateType; } _ZNK5Botan3TLS23Server_Certificate_Type4typeEv: 228| 11| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS16Supported_Groups11static_typeEv: 236| 7.31k| static Extension_Code static_type() { return Extension_Code::SupportedGroups; } _ZNK5Botan3TLS16Supported_Groups4typeEv: 238| 7.31k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS16Supported_Groups5emptyEv: 254| 12.7k| bool empty() const override { return m_groups.empty(); } _ZN5Botan3TLS20Signature_Algorithms11static_typeEv: 265| 7.60k| static Extension_Code static_type() { return Extension_Code::SignatureAlgorithms; } _ZNK5Botan3TLS20Signature_Algorithms4typeEv: 267| 7.29k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS20Signature_Algorithms17supported_schemesEv: 269| 311| const std::vector& supported_schemes() const { return m_schemes; } _ZNK5Botan3TLS20Signature_Algorithms5emptyEv: 273| 12.7k| bool empty() const override { return m_schemes.empty(); } _ZN5Botan3TLS20Signature_AlgorithmsC2ENSt3__16vectorINS0_16Signature_SchemeENS2_9allocatorIS4_EEEE: 275| 7.28k| explicit Signature_Algorithms(std::vector schemes) : m_schemes(std::move(schemes)) {} _ZN5Botan3TLS25Signature_Algorithms_Cert11static_typeEv: 298| 17| static Extension_Code static_type() { return Extension_Code::CertSignatureAlgorithms; } _ZNK5Botan3TLS25Signature_Algorithms_Cert4typeEv: 300| 17| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS25Signature_Algorithms_Cert5emptyEv: 306| 2| bool empty() const override { return m_schemes.empty(); } _ZN5Botan3TLS24SRTP_Protection_Profiles11static_typeEv: 321| 5.31k| static Extension_Code static_type() { return Extension_Code::UseSrtp; } _ZNK5Botan3TLS24SRTP_Protection_Profiles4typeEv: 323| 1| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS26Certificate_Status_Request11static_typeEv: 348| 7.99k| static Extension_Code static_type() { return Extension_Code::CertificateStatusRequest; } _ZNK5Botan3TLS26Certificate_Status_Request4typeEv: 350| 7.33k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS26Certificate_Status_Request5emptyEv: 354| 12.7k| bool empty() const override { return false; } _ZN5Botan3TLS18Supported_Versions11static_typeEv: 386| 12.9k| static Extension_Code static_type() { return Extension_Code::SupportedVersions; } _ZNK5Botan3TLS18Supported_Versions4typeEv: 388| 7.30k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS18Supported_Versions5emptyEv: 392| 12.7k| bool empty() const override { return m_versions.empty(); } _ZN5Botan3TLS17Record_Size_Limit11static_typeEv: 417| 24| static Extension_Code static_type() { return Extension_Code::RecordSizeLimit; } _ZNK5Botan3TLS17Record_Size_Limit4typeEv: 419| 24| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS17Record_Size_Limit5emptyEv: 429| 2| bool empty() const override { return m_limit == 0; } _ZNK5Botan3TLS17Unknown_Extension5emptyEv: 446| 901| bool empty() const override { return false; } _ZNK5Botan3TLS17Unknown_Extension4typeEv: 448| 2.05k| Extension_Code type() const override { return m_type; } _ZN5Botan3TLS10Extensions3addEPNS0_9ExtensionE: 482| 65.5k| void add(Extension* extn) { add(std::unique_ptr(extn)); } _ZN5Botan3TLS10ExtensionsC2Ev: 535| 14.1k| Extensions() = default; _ZNK5Botan3TLS10Extensions3hasINS0_18Supported_VersionsEEEbv: 470| 5.61k| bool has() const { 471| 5.61k| return get() != nullptr; 472| 5.61k| } _ZNK5Botan3TLS10Extensions3getINS0_18Supported_VersionsEEEPT_v: 465| 5.61k| T* get() const { 466| 5.61k| return dynamic_cast(get(T::static_type())); 467| 5.61k| } _ZNK5Botan3TLS10Extensions3hasINS0_39Application_Layer_Protocol_NotificationEEEbv: 470| 5.31k| bool has() const { 471| 5.31k| return get() != nullptr; 472| 5.31k| } _ZNK5Botan3TLS10Extensions3getINS0_39Application_Layer_Protocol_NotificationEEEPT_v: 465| 10.6k| T* get() const { 466| 10.6k| return dynamic_cast(get(T::static_type())); 467| 10.6k| } _ZN5Botan3TLS9ExtensionD2Ev: 102| 86.5k| virtual ~Extension() = default; _ZNK5Botan3TLS10Extensions3hasINS0_26Certificate_Status_RequestEEEbv: 470| 659| bool has() const { 471| 659| return get() != nullptr; 472| 659| } _ZNK5Botan3TLS10Extensions3getINS0_26Certificate_Status_RequestEEEPT_v: 465| 659| T* get() const { 466| 659| return dynamic_cast(get(T::static_type())); 467| 659| } _ZNK5Botan3TLS10Extensions3getINS0_20Signature_AlgorithmsEEEPT_v: 465| 311| T* get() const { 466| 311| return dynamic_cast(get(T::static_type())); 467| 311| } _ZNK5Botan3TLS10Extensions3getINS0_24SRTP_Protection_ProfilesEEEPT_v: 465| 5.31k| T* get() const { 466| 5.31k| return dynamic_cast(get(T::static_type())); 467| 5.31k| } _ZNK5Botan3TLS10Extensions3hasINS0_23Renegotiation_ExtensionEEEbv: 470| 12.6k| bool has() const { 471| 12.6k| return get() != nullptr; 472| 12.6k| } _ZNK5Botan3TLS10Extensions3getINS0_23Renegotiation_ExtensionEEEPT_v: 465| 23.2k| T* get() const { 466| 23.2k| return dynamic_cast(get(T::static_type())); 467| 23.2k| } _ZNK5Botan3TLS10Extensions3hasINS0_24Session_Ticket_ExtensionEEEbv: 470| 56| bool has() const { 471| 56| return get() != nullptr; 472| 56| } _ZNK5Botan3TLS10Extensions3getINS0_24Session_Ticket_ExtensionEEEPT_v: 465| 56| T* get() const { 466| 56| return dynamic_cast(get(T::static_type())); 467| 56| } _ZNK5Botan3TLS10Extensions3hasINS0_22Extended_Master_SecretEEEbv: 470| 5.37k| bool has() const { 471| 5.37k| return get() != nullptr; 472| 5.37k| } _ZNK5Botan3TLS10Extensions3getINS0_22Extended_Master_SecretEEEPT_v: 465| 5.37k| T* get() const { 466| 5.37k| return dynamic_cast(get(T::static_type())); 467| 5.37k| } _ZNK5Botan3TLS10Extensions3hasINS0_16Encrypt_then_MACEEEbv: 470| 3.16k| bool has() const { 471| 3.16k| return get() != nullptr; 472| 3.16k| } _ZNK5Botan3TLS10Extensions3getINS0_16Encrypt_then_MACEEEPT_v: 465| 3.16k| T* get() const { 466| 3.16k| return dynamic_cast(get(T::static_type())); 467| 3.16k| } _ZN5Botan3TLS23Renegotiation_Extension11static_typeEv: 31| 33.8k| static Extension_Code static_type() { return Extension_Code::SafeRenegotiation; } _ZNK5Botan3TLS23Renegotiation_Extension4typeEv: 33| 10.6k| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Renegotiation_ExtensionC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 37| 7.28k| explicit Renegotiation_Extension(const std::vector& bits) : m_reneg_data(bits) {} _ZNK5Botan3TLS23Renegotiation_Extension18renegotiation_infoEv: 41| 10.5k| const std::vector& renegotiation_info() const { return m_reneg_data; } _ZNK5Botan3TLS23Renegotiation_Extension5emptyEv: 45| 16.0k| bool empty() const override { return false; } // always send this _ZN5Botan3TLS24Session_Ticket_Extension11static_typeEv: 56| 10.4k| static Extension_Code static_type() { return Extension_Code::SessionTicket; } _ZNK5Botan3TLS24Session_Ticket_Extension4typeEv: 58| 10.3k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS24Session_Ticket_Extension9serializeENS0_15Connection_SideE: 80| 7.28k| std::vector serialize(Connection_Side /*whoami*/) const override { return m_ticket.get(); } _ZNK5Botan3TLS24Session_Ticket_Extension5emptyEv: 82| 15.7k| bool empty() const override { return false; } _ZN5Botan3TLS23Supported_Point_Formats11static_typeEv: 99| 7.63k| static Extension_Code static_type() { return Extension_Code::EcPointFormats; } _ZNK5Botan3TLS23Supported_Point_Formats4typeEv: 101| 7.63k| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS23Supported_Point_FormatsC2Eb: 105| 7.28k| explicit Supported_Point_Formats(bool prefer_compressed) : m_prefers_compressed(prefer_compressed) {} _ZNK5Botan3TLS23Supported_Point_Formats5emptyEv: 109| 13.0k| bool empty() const override { return false; } _ZN5Botan3TLS22Extended_Master_Secret11static_typeEv: 122| 15.8k| static Extension_Code static_type() { return Extension_Code::ExtendedMasterSecret; } _ZNK5Botan3TLS22Extended_Master_Secret4typeEv: 124| 10.4k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS22Extended_Master_Secret5emptyEv: 128| 15.8k| bool empty() const override { return false; } _ZN5Botan3TLS16Encrypt_then_MAC11static_typeEv: 140| 10.4k| static Extension_Code static_type() { return Extension_Code::EncryptThenMac; } _ZNK5Botan3TLS16Encrypt_then_MAC4typeEv: 142| 7.32k| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS16Encrypt_then_MAC5emptyEv: 146| 12.7k| bool empty() const override { return false; } _ZN5Botan3TLS22Extended_Master_SecretC2Ev: 130| 7.28k| Extended_Master_Secret() = default; _ZN5Botan3TLS16Encrypt_then_MACC2Ev: 148| 7.28k| Encrypt_then_MAC() = default; _ZN5Botan3TLS24Session_Ticket_ExtensionC2Ev: 68| 7.28k| Session_Ticket_Extension() = default; _ZN5Botan3TLS9Key_Share11static_typeEv: 212| 13| static Extension_Code static_type() { return Extension_Code::KeyShare; } _ZN5Botan3TLS6Cookie11static_typeEv: 44| 11| static Extension_Code static_type() { return Extension_Code::Cookie; } _ZNK5Botan3TLS6Cookie4typeEv: 46| 11| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS22PSK_Key_Exchange_Modes11static_typeEv: 67| 8| static Extension_Code static_type() { return Extension_Code::PskKeyExchangeModes; } _ZNK5Botan3TLS22PSK_Key_Exchange_Modes4typeEv: 69| 8| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS22PSK_Key_Exchange_Modes5emptyEv: 73| 2| bool empty() const override { return m_modes.empty(); } _ZN5Botan3TLS3PSK11static_typeEv: 112| 12| static Extension_Code static_type() { return Extension_Code::PresharedKey; } _ZNK5Botan3TLS3PSK4typeEv: 114| 12| Extension_Code type() const override { return static_type(); } _ZNK5Botan3TLS9Key_Share4typeEv: 214| 13| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS19EarlyDataIndication11static_typeEv: 306| 24| static Extension_Code static_type() { return Extension_Code::EarlyData; } _ZNK5Botan3TLS19EarlyDataIndication4typeEv: 308| 24| Extension_Code type() const override { return static_type(); } _ZN5Botan3TLS11ExternalPSKC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEES6_NS2_6vectorIhNS_16secure_allocatorIhEEEE: 31| 15| m_identity(identity), m_prf_algo(prf_algo), m_master_secret(std::move(psk)), m_is_imported(false) {} _ZN5Botan3TLS11ExternalPSKD2Ev: 28| 15| ~ExternalPSK() = default; _ZN5Botan3TLS17Handshake_MessageD2Ev: 50| 17.1k| virtual ~Handshake_Message() = default; _ZNK5Botan3TLS17Handshake_Message9wire_typeEv: 39| 7.39k| virtual Handshake_Type wire_type() const { 40| | // Usually equal to the Handshake_Type enum value, 41| | // with the exception of TLS 1.3 Hello Retry Request. 42| 7.39k| return type(); 43| 7.39k| } _ZN5Botan3TLS17Handshake_MessageC2Ev: 51| 17.1k| Handshake_Message() = default; _ZNK5Botan3TLS8Finished4typeEv: 274| 112| Handshake_Type type() const override { return Handshake_Type::Finished; } _ZNK5Botan3TLS8Finished9serializeEv: 278| 56| std::vector serialize() const override { return m_verification_data; } _ZN5Botan3TLS8FinishedC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 272| 2| explicit Finished(const std::vector& buf) : m_verification_data(buf) {} _ZNK5Botan3TLS8Finished11verify_dataEv: 276| 4| std::vector verify_data() const { return m_verification_data; } _ZN5Botan3TLS15Client_Hello_128SettingsC2ENS0_16Protocol_VersionENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE: 26| 7.28k| m_new_session_version(version), m_hostname(hostname) {} _ZNK5Botan3TLS15Client_Hello_128Settings16protocol_versionEv: 28| 14.5k| Protocol_Version protocol_version() const { return m_new_session_version; } _ZNK5Botan3TLS15Client_Hello_128Settings8hostnameEv: 30| 14.5k| const std::string& hostname() const { return m_hostname; } _ZNK5Botan3TLS19Client_Key_Exchange4typeEv: 172| 112| Handshake_Type type() const override { return Handshake_Type::ClientKeyExchange; } _ZNK5Botan3TLS19Client_Key_Exchange17pre_master_secretEv: 174| 56| const secure_vector& pre_master_secret() const { return m_pre_master; } _ZNK5Botan3TLS19Client_Key_Exchange12psk_identityEv: 179| 4| const std::optional& psk_identity() const { return m_psk_identity; } _ZNK5Botan3TLS19Client_Key_Exchange9serializeEv: 197| 56| std::vector serialize() const override { return m_key_material; } _ZNK5Botan3TLS14Certificate_1210cert_chainEv: 211| 918| const std::vector& cert_chain() const { return m_certs; } _ZNK5Botan3TLS19Server_Key_Exchange6paramsEv: 326| 605| const std::vector& params() const { return m_params; } _ZNK5Botan3TLS21New_Session_Ticket_1220ticket_lifetime_hintEv: 391| 2| uint32_t ticket_lifetime_hint() const { return m_ticket_lifetime_hint; } _ZNK5Botan3TLS21New_Session_Ticket_126ticketEv: 393| 6| const Session_Ticket& ticket() const { return m_ticket; } _ZNK5Botan3TLS18Change_Cipher_Spec4typeEv: 416| 56| Handshake_Type type() const override { return Handshake_Type::HandshakeCCS; } _ZNK5Botan3TLS18Change_Cipher_Spec9serializeEv: 418| 56| std::vector serialize() const override { return std::vector(1, 1); } _ZN5Botan3TLS6PolicyD2Ev: 610| 7.28k| virtual ~Policy() = default; _ZN5Botan3TLS18Server_InformationC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEt: 32| 7.28k| m_hostname(hostname), m_port(port) {} _ZNK5Botan3TLS18Server_Information8hostnameEv: 47| 8.32k| std::string hostname() const { return m_hostname; } _ZNK5Botan3TLS18Server_Information5emptyEv: 63| 7.28k| bool empty() const { return m_hostname.empty(); } _ZNK5Botan3TLS7Session13lifetime_hintEv: 350| 2| std::chrono::seconds lifetime_hint() const { return m_lifetime_hint; } _ZNK5Botan3TLS12Session_Base7versionEv: 74| 2| Protocol_Version version() const { return m_version; } _ZN5Botan3TLS15Session_Summary14set_session_idENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_11Session_ID_EJEEE: 220| 2| void set_session_id(Session_ID id) { m_session_id = std::move(id); } _ZN5Botan3TLS15Session_Summary18set_session_ticketENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_15Session_Ticket_EJEEE: 222| 2| void set_session_ticket(Session_Ticket ticket) { m_session_ticket = std::move(ticket); } _ZN5Botan3TLS14Session_HandleC2ENS_6StrongINSt3__16vectorIhNS3_9allocatorIhEEEENS0_15Session_Ticket_EJEEE: 70| 2| Session_Handle(Session_Ticket ticket) : m_handle(std::move(ticket)) { validate_constraints(); } _ZN5Botan3TLS15Session_ManagerD2Ev: 217| 7.28k| virtual ~Session_Manager() = default; _ZN5Botan3TLS15Session_Manager5mutexEv: 268| 7.28k| recursive_mutex_type& mutex() { return m_mutex; } _ZN5Botan3TLS20Session_Manager_Noop5storeERKNS0_7SessionERKNS0_14Session_HandleE: 31| 2| void store(const Session& /*session*/, const Session_Handle& /*handle*/) override {} _ZNK5Botan3TLS16Signature_Scheme9wire_codeEv: 74| 131k| Signature_Scheme::Code wire_code() const noexcept { return m_code; } _ZNK5Botan3TLS16Signature_SchemeeqERKS1_: 106| 4.53k| bool operator==(const Signature_Scheme& rhs) const { return m_code == rhs.m_code; } _ZN5Botan3TLS16Protocol_VersionC2ENS0_12Version_CodeE: 62| 797k| Protocol_Version(static_cast(named_version)) {} _ZN5Botan3TLS16Protocol_VersionC2Et: 56| 818k| explicit Protocol_Version(uint16_t code) : m_version(code) {} _ZN5Botan3TLS16Protocol_VersionC2Ev: 54| 14.2k| Protocol_Version() : m_version(0) {} _ZN5Botan3TLS16Protocol_VersionC2Ehh: 69| 20.4k| Protocol_Version(static_cast((static_cast(major) << 8) | minor)) {} _ZNK5Botan3TLS16Protocol_Version13major_versionEv: 84| 883k| uint8_t major_version() const { return static_cast(m_version >> 8); } _ZNK5Botan3TLS16Protocol_Version13minor_versionEv: 89| 37.9k| uint8_t minor_version() const { return static_cast(m_version & 0xFF); } _ZNK5Botan3TLS16Protocol_VersioneqERKS1_: 123| 761k| bool operator==(const Protocol_Version& other) const { return (m_version == other.m_version); } _ZNK5Botan3TLS16Protocol_VersionneERKS1_: 128| 3.75k| bool operator!=(const Protocol_Version& other) const { return (m_version != other.m_version); } _ZNK5Botan3TLS16Protocol_VersiongeERKS1_: 138| 15.2k| bool operator>=(const Protocol_Version& other) const { return (*this == other || *this > other); } ------------------ | Branch (138:70): [True: 7.28k, False: 7.95k] | Branch (138:88): [True: 87, False: 7.86k] ------------------ _ZNK5Botan3TLS16Protocol_VersionltERKS1_: 143| 665| bool operator<(const Protocol_Version& other) const { return !(*this >= other); } _ZNK5Botan3TLS16Protocol_VersionleERKS1_: 148| 703k| bool operator<=(const Protocol_Version& other) const { return (*this == other || *this < other); } ------------------ | Branch (148:70): [True: 702k, False: 665] | Branch (148:88): [True: 578, False: 87] ------------------ _ZNK5Botan14Cert_Extension17Basic_Constraints5is_caEv: 51| 684| bool is_ca() const { return m_is_ca; } _ZNK5Botan14Cert_Extension17Basic_Constraints22path_length_constraintEv: 53| 42| std::optional path_length_constraint() const { return m_path_length_constraint; } _ZN5Botan14Cert_Extension17Basic_Constraints10static_oidEv: 55| 924| static OID static_oid() { return OID({2, 5, 29, 19}); } _ZNK5Botan14Cert_Extension17Basic_Constraints8oid_nameEv: 60| 684| std::string oid_name() const override { return "X509v3.BasicConstraints"; } _ZN5Botan14Cert_Extension9Key_UsageC2Ev: 80| 774| explicit Key_Usage() : m_constraints(Key_Constraints::None) {} _ZNK5Botan14Cert_Extension9Key_Usage15get_constraintsEv: 82| 606| Key_Constraints get_constraints() const { return m_constraints; } _ZN5Botan14Cert_Extension9Key_Usage10static_oidEv: 84| 924| static OID static_oid() { return OID({2, 5, 29, 15}); } _ZNK5Botan14Cert_Extension9Key_Usage8oid_nameEv: 89| 606| std::string oid_name() const override { return "X509v3.KeyUsage"; } _ZNK5Botan14Cert_Extension14Subject_Key_ID10get_key_idEv: 114| 15| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension14Subject_Key_ID10static_oidEv: 116| 924| static OID static_oid() { return OID({2, 5, 29, 14}); } _ZNK5Botan14Cert_Extension14Subject_Key_ID8oid_nameEv: 121| 15| std::string oid_name() const override { return "X509v3.SubjectKeyIdentifier"; } _ZNK5Botan14Cert_Extension16Authority_Key_ID10get_key_idEv: 144| 38| const std::vector& get_key_id() const { return m_key_id; } _ZN5Botan14Cert_Extension16Authority_Key_ID10static_oidEv: 146| 924| static OID static_oid() { return OID({2, 5, 29, 35}); } _ZNK5Botan14Cert_Extension16Authority_Key_ID8oid_nameEv: 151| 38| std::string oid_name() const override { return "X509v3.AuthorityKeyIdentifier"; } _ZNK5Botan14Cert_Extension24Subject_Alternative_Name12get_alt_nameEv: 166| 227| const AlternativeName& get_alt_name() const { return m_alt_name; } _ZN5Botan14Cert_Extension24Subject_Alternative_Name10static_oidEv: 168| 924| static OID static_oid() { return OID({2, 5, 29, 17}); } _ZN5Botan14Cert_Extension24Subject_Alternative_NameC2ERKNS_15AlternativeNameE: 176| 797| explicit Subject_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension24Subject_Alternative_Name8oid_nameEv: 179| 227| std::string oid_name() const override { return "X509v3.SubjectAlternativeName"; } _ZN5Botan14Cert_Extension23Issuer_Alternative_Name10static_oidEv: 196| 924| static OID static_oid() { return OID({2, 5, 29, 18}); } _ZN5Botan14Cert_Extension23Issuer_Alternative_NameC2ERKNS_15AlternativeNameE: 204| 77| explicit Issuer_Alternative_Name(const AlternativeName& name = AlternativeName()) : m_alt_name(name) {} _ZNK5Botan14Cert_Extension18Extended_Key_Usage18object_identifiersEv: 230| 558| const std::vector& object_identifiers() const { return m_oids; } _ZN5Botan14Cert_Extension18Extended_Key_Usage10static_oidEv: 232| 924| static OID static_oid() { return OID({2, 5, 29, 37}); } _ZNK5Botan14Cert_Extension18Extended_Key_Usage8oid_nameEv: 237| 558| std::string oid_name() const override { return "X509v3.ExtendedKeyUsage"; } _ZN5Botan14Cert_Extension16Name_Constraints10static_oidEv: 268| 924| static OID static_oid() { return OID({2, 5, 29, 30}); } _ZN5Botan14Cert_Extension20Certificate_Policies10static_oidEv: 298| 924| static OID static_oid() { return OID({2, 5, 29, 32}); } _ZN5Botan14Cert_Extension28Authority_Information_Access10static_oidEv: 348| 924| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 1, 1}); } _ZN5Botan14Cert_Extension10CRL_NumberC2Ev: 373| 6| CRL_Number() : m_has_value(false), m_crl_number(0) {} _ZN5Botan14Cert_Extension14CRL_ReasonCodeC2ENS_8CRL_CodeE: 404| 16| explicit CRL_ReasonCode(CRL_Code r = CRL_Code::Unspecified) : m_reason(r) {} _ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_PointC2ERKNS_15AlternativeNameE: 434| 111| explicit Distribution_Point(const AlternativeName& name = AlternativeName()) : m_point(name) {} _ZN5Botan14Cert_Extension23CRL_Distribution_Points10static_oidEv: 454| 924| static OID static_oid() { return OID({2, 5, 29, 31}); } _ZN5Botan14Cert_Extension12OCSP_NoCheck10static_oidEv: 519| 424| static OID static_oid() { return OID({1, 3, 6, 1, 5, 5, 7, 48, 1, 5}); } _ZN5Botan14Cert_Extension17Unknown_ExtensionC2ERKNS_3OIDEbb: 985| 1.84k| m_oid(oid), m_critical(critical), m_failed_to_decode(failed_to_decode) {} _ZNK5Botan14Cert_Extension17Unknown_Extension8oid_nameEv: 1027| 1.06k| std::string oid_name() const override { return ""; } _ZN5Botan14Cert_Extension14Subject_Key_IDC2Ev: 104| 69| Subject_Key_ID() = default; _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_PointC2Ev: 476| 15| CRL_Issuing_Distribution_Point() = default; _ZN5Botan14Cert_Extension16Name_ConstraintsC2Ev: 256| 9| Name_Constraints() = default; _ZN5Botan14Cert_Extension23CRL_Distribution_PointsC2Ev: 446| 108| CRL_Distribution_Points() = default; _ZN5Botan14Cert_Extension20Certificate_PoliciesC2Ev: 292| 31| Certificate_Policies() = default; _ZN5Botan14Cert_Extension16Authority_Key_IDC2Ev: 140| 60| Authority_Key_ID() = default; _ZN5Botan14Cert_Extension18Extended_Key_UsageC2Ev: 226| 844| Extended_Key_Usage() = default; _ZN5Botan14Cert_Extension28Authority_Information_AccessC2Ev: 328| 29| Authority_Information_Access() = default; _ZN5Botan14Cert_Extension15IPAddressBlocksC2Ev: 772| 7| IPAddressBlocks() = default; _ZN5Botan14Cert_Extension8ASBlocksC2Ev: 913| 5| ASBlocks() = default; _ZN5Botan14Cert_Extension8ASBlocks13ASIdentifiersC2Ev: 907| 5| ASIdentifiers() = default; _ZN5Botan14Cert_Extension10TNAuthListC2Ev: 615| 11| TNAuthList() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressChoiceILNS1_7VersionE4EEC2Ev: 734| 6| IPAddressChoice() = default; _ZN5Botan14Cert_Extension8ASBlocks18ASIdentifierChoiceC2Ev: 878| 2| ASIdentifierChoice() = default; _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressFamilyC2Ev: 749| 6| IPAddressFamily() = default; _ZN5Botan4X5098load_keyERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 59| 914|inline std::unique_ptr load_key(const std::vector& enc) { 60| 914| DataSource_Memory source(enc); 61| 914| return X509::load_key(source); 62| 914|} _ZN5Botan11X509_ObjectC2Ev: 120| 3.09k| X509_Object() = default; _ZN5Botan16X509_Certificate3TagC2ENSt3__15arrayIhLm32EEE: 404| 361| explicit Tag(std::array tag) : m_tag(tag) {} _ZN5Botan16X509_CertificateC2ERKS0_: 477| 1.28k| X509_Certificate(const X509_Certificate& other) = default; _ZN5Botan16X509_CertificateC2EOS0_: 478| 1.65k| X509_Certificate(X509_Certificate&& other) = default; _ZNK5Botan28Path_Validation_Restrictions33require_self_signed_trust_anchorsEv: 159| 361| bool require_self_signed_trust_anchors() const { return m_require_self_signed_trust_anchors; } _ZNK5Botan22Path_Validation_Result6resultEv: 204| 1.44k| Certificate_Status_Code result() const { return m_overall; } _ZN5Botan22Path_Validation_ResultC2ENS_23Certificate_Status_CodeE: 243| 361| explicit Path_Validation_Result(Certificate_Status_Code status) : m_overall(status) {} LLVMFuzzerInitialize: 28| 2|extern "C" int LLVMFuzzerInitialize(int* /*argc*/, char*** /*argv*/) { 29| | /* 30| | * This disables the mlock pool, as overwrites within the pool are 31| | * opaque to ASan or other instrumentation. 32| | */ 33| 2| ::setenv("BOTAN_MLOCK_POOL_SIZE", "0", 1); 34| 2| return 0; 35| 2|} LLVMFuzzerTestOneInput: 39| 7.29k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t in[], size_t len) { 40| 7.29k| if(len <= max_fuzzer_input_size) { ------------------ | Branch (40:7): [True: 7.28k, False: 7] ------------------ 41| 7.28k| try { 42| 7.28k| fuzz(std::span(in, len)); 43| 7.28k| } 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| 7.28k| } 51| 7.29k| return 0; 52| 7.29k|} _Z20fuzzer_rng_as_sharedv: 56| 7.28k|inline std::shared_ptr fuzzer_rng_as_shared() { 57| 7.28k| static const std::shared_ptr rng = 58| 7.28k| std::make_shared(Botan::secure_vector(32)); 59| 7.28k| return rng; 60| 7.28k|} _Z4fuzzNSt3__14spanIKhLm18446744073709551615EEE: 97| 7.28k|void fuzz(std::span in) { 98| 7.28k| if(in.empty()) { ------------------ | Branch (98:7): [True: 0, False: 7.28k] ------------------ 99| 0| return; 100| 0| } 101| | 102| 7.28k| auto session_manager = std::make_shared(); 103| 7.28k| auto policy = std::make_shared(); 104| 7.28k| const Botan::TLS::Protocol_Version client_offer = Botan::TLS::Protocol_Version::TLS_V12; 105| 7.28k| const Botan::TLS::Server_Information info("server.name", 443); 106| 7.28k| auto callbacks = std::make_shared(); 107| 7.28k| auto creds = std::make_shared(); 108| | 109| 7.28k| Botan::TLS::Client client(callbacks, session_manager, creds, policy, fuzzer_rng_as_shared(), info, client_offer); 110| | 111| 7.28k| try { 112| 7.28k| client.received_data(in); 113| 7.28k| } catch(const std::exception& e) {} 114| 7.28k|} _ZNK17Fuzzer_TLS_Policy16ciphersuite_listEN5Botan3TLS16Protocol_VersionE: 54| 7.28k| std::vector ciphersuite_list(Botan::TLS::Protocol_Version version) const override { 55| 7.28k| std::vector ciphersuites; 56| | 57| 743k| for(auto&& suite : Botan::TLS::Ciphersuite::all_known_ciphersuites()) { ------------------ | Branch (57:27): [True: 743k, False: 7.28k] ------------------ 58| 743k| if(suite.valid() && suite.usable_in_version(version)) { ------------------ | Branch (58:16): [True: 684k, False: 58.2k] | Branch (58:33): [True: 648k, False: 36.4k] ------------------ 59| 648k| ciphersuites.push_back(suite.ciphersuite_code()); 60| 648k| } 61| 743k| } 62| | 63| 7.28k| return ciphersuites; 64| 7.28k| } _ZN27Fuzzer_TLS_Client_Callbacks13tls_emit_dataENSt3__14spanIKhLm18446744073709551615EEE: 69| 14.5k| void tls_emit_data(std::span /*data*/) override { 70| | // discard 71| 14.5k| } _ZN27Fuzzer_TLS_Client_Callbacks9tls_alertEN5Botan3TLS5AlertE: 77| 1.78k| void tls_alert(Botan::TLS::Alert /*alert*/) override { 78| | // ignore alert 79| 1.78k| } _ZN27Fuzzer_TLS_Client_Callbacks21tls_verify_cert_chainERKNSt3__16vectorIN5Botan16X509_CertificateENS0_9allocatorIS3_EEEERKNS1_INS0_8optionalINS2_4OCSP8ResponseEEENS4_ISC_EEEERKNS1_IPNS2_17Certificate_StoreENS4_ISI_EEEENS2_10Usage_TypeENS0_17basic_string_viewIcNS0_11char_traitsIcEEEERKNS2_3TLS6PolicyE: 86| 361| const Botan::TLS::Policy& policy) override { 87| 361| try { 88| | // try to validate to exercise those code paths 89| 361| Botan::TLS::Callbacks::tls_verify_cert_chain( 90| 361| cert_chain, ocsp_responses, trusted_roots, usage, hostname, policy); 91| 361| } catch(...) { 92| | // ignore validation result 93| 361| } 94| 361| } _ZN23Fuzzer_TLS_Client_Creds12psk_identityERKNSt3__112basic_stringIcNS0_11char_traitsIcEENS0_9allocatorIcEEEES8_S8_: 25| 15| const std::string& /*hint*/) override { 26| 15| return "psk_id"; 27| 15| } _ZN23Fuzzer_TLS_Client_Creds19find_preshared_keysENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEN5Botan3TLS15Connection_SideERKNS0_6vectorINS0_12basic_stringIcS3_NS0_9allocatorIcEEEENSA_ISC_EEEERKNS0_8optionalISC_EE: 41| 15| const std::optional& prf = std::nullopt) override { 42| 15| if(!identities.empty() && std::find(identities.begin(), identities.end(), "psk_id") == identities.end()) { ------------------ | Branch (42:13): [True: 15, False: 0] | Branch (42:13): [True: 0, False: 15] | Branch (42:36): [True: 0, False: 15] ------------------ 43| 0| return Botan::Credentials_Manager::find_preshared_keys(host, whoami, identities, prf); 44| 0| } 45| | 46| 15| std::vector psks; 47| 15| psks.emplace_back("psk_id", "SHA-256", Botan::hex_decode_locked("AABBCCDDEEFF00112233445566778899")); 48| 15| return psks; 49| 15| } _ZNK5Botan19AlgorithmIdentifier19parameters_are_nullEv: 49| 2.63k|bool AlgorithmIdentifier::parameters_are_null() const { 50| 2.63k| return (m_parameters.size() == 2 && (m_parameters[0] == 0x05) && (m_parameters[1] == 0x00)); ------------------ | Branch (50:12): [True: 2.62k, False: 4] | Branch (50:40): [True: 2.62k, False: 6] | Branch (50:69): [True: 2.62k, False: 0] ------------------ 51| 2.63k|} _ZN5BotaneqERKNS_19AlgorithmIdentifierES2_: 53| 1.46k|bool operator==(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) { 54| 1.46k| if(a1.oid() != a2.oid()) { ------------------ | Branch (54:7): [True: 3, False: 1.46k] ------------------ 55| 3| return false; 56| 3| } 57| | 58| | /* 59| | * Treat NULL and empty as equivalent 60| | */ 61| 1.46k| if(a1.parameters_are_null_or_empty() && a2.parameters_are_null_or_empty()) { ------------------ | Branch (61:7): [True: 1.45k, False: 6] | Branch (61:44): [True: 1.45k, False: 4] ------------------ 62| 1.45k| return true; 63| 1.45k| } 64| | 65| 10| return (a1.parameters() == a2.parameters()); 66| 1.46k|} _ZN5BotanneERKNS_19AlgorithmIdentifierES2_: 68| 1.46k|bool operator!=(const AlgorithmIdentifier& a1, const AlgorithmIdentifier& a2) { 69| 1.46k| return !(a1 == a2); 70| 1.46k|} _ZNK5Botan19AlgorithmIdentifier11encode_intoERNS_11DER_EncoderE: 75| 924|void AlgorithmIdentifier::encode_into(DER_Encoder& codec) const { 76| 924| codec.start_sequence().encode(oid()).raw_bytes(parameters()).end_cons(); 77| 924|} _ZN5Botan19AlgorithmIdentifier11decode_fromERNS_11BER_DecoderE: 82| 8.27k|void AlgorithmIdentifier::decode_from(BER_Decoder& codec) { 83| 8.27k| codec.start_sequence().decode(m_oid).raw_bytes(m_parameters).end_cons(); 84| 8.27k|} _ZNK5Botan11ASN1_Object10BER_encodeEv: 20| 924|std::vector ASN1_Object::BER_encode() const { 21| 924| std::vector output; 22| 924| DER_Encoder der(output); 23| 924| this->encode_into(der); 24| 924| return output; 25| 924|} _ZN5Botan10BER_ObjectD2Ev: 27| 243k|BER_Object::~BER_Object() { 28| 243k| secure_scrub_memory(m_value); 29| 243k|} _ZNK5Botan10BER_Object11assert_is_aENS_9ASN1_TypeENS_10ASN1_ClassENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 34| 66.8k|void BER_Object::assert_is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag, std::string_view descr) const { 35| 66.8k| if(!this->is_a(expected_type_tag, expected_class_tag)) { ------------------ | Branch (35:7): [True: 457, False: 66.4k] ------------------ 36| 457| std::stringstream msg; 37| | 38| 457| msg << "Tag mismatch when decoding " << descr << " got "; 39| | 40| 457| if(m_class_tag == ASN1_Class::NoObject && m_type_tag == ASN1_Type::NoObject) { ------------------ | Branch (40:10): [True: 6, False: 451] | Branch (40:49): [True: 6, False: 0] ------------------ 41| 6| msg << "EOF"; 42| 451| } else { 43| 451| if(m_class_tag == ASN1_Class::Universal || m_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (43:13): [True: 190, False: 261] | Branch (43:53): [True: 216, False: 45] ------------------ 44| 406| msg << asn1_tag_to_string(m_type_tag); 45| 406| } else { 46| 45| msg << std::to_string(static_cast(m_type_tag)); 47| 45| } 48| | 49| 451| msg << "/" << asn1_class_to_string(m_class_tag); 50| 451| } 51| | 52| 457| msg << " expected "; 53| | 54| 457| if(expected_class_tag == ASN1_Class::Universal || expected_class_tag == ASN1_Class::Constructed) { ------------------ | Branch (54:10): [True: 52, False: 405] | Branch (54:57): [True: 395, False: 10] ------------------ 55| 447| msg << asn1_tag_to_string(expected_type_tag); 56| 447| } else { 57| 10| msg << std::to_string(static_cast(expected_type_tag)); 58| 10| } 59| | 60| 457| msg << "/" << asn1_class_to_string(expected_class_tag); 61| | 62| 457| throw BER_Decoding_Error(msg.str()); 63| 457| } 64| 66.8k|} _ZNK5Botan10BER_Object4is_aENS_9ASN1_TypeENS_10ASN1_ClassE: 66| 82.3k|bool BER_Object::is_a(ASN1_Type expected_type_tag, ASN1_Class expected_class_tag) const { 67| 82.3k| return (m_type_tag == expected_type_tag && m_class_tag == expected_class_tag); ------------------ | Branch (67:12): [True: 73.0k, False: 9.27k] | Branch (67:47): [True: 72.9k, False: 130] ------------------ 68| 82.3k|} _ZNK5Botan10BER_Object4is_aEiNS_10ASN1_ClassE: 70| 3.95k|bool BER_Object::is_a(int expected_type_tag, ASN1_Class expected_class_tag) const { 71| 3.95k| return is_a(ASN1_Type(expected_type_tag), expected_class_tag); 72| 3.95k|} _ZN5Botan10BER_Object11set_taggingENS_9ASN1_TypeENS_10ASN1_ClassE: 74| 108k|void BER_Object::set_tagging(ASN1_Type type_tag, ASN1_Class class_tag) { 75| 108k| m_type_tag = type_tag; 76| 108k| m_class_tag = class_tag; 77| 108k|} _ZN5Botan20asn1_class_to_stringENS_10ASN1_ClassE: 79| 908|std::string asn1_class_to_string(ASN1_Class type) { 80| 908| switch(type) { 81| 242| case ASN1_Class::Universal: ------------------ | Branch (81:7): [True: 242, False: 666] ------------------ 82| 242| return "UNIVERSAL"; 83| 611| case ASN1_Class::Constructed: ------------------ | Branch (83:7): [True: 611, False: 297] ------------------ 84| 611| return "CONSTRUCTED"; 85| 9| case ASN1_Class::ContextSpecific: ------------------ | Branch (85:7): [True: 9, False: 899] ------------------ 86| 9| return "CONTEXT_SPECIFIC"; 87| 11| case ASN1_Class::Application: ------------------ | Branch (87:7): [True: 11, False: 897] ------------------ 88| 11| return "APPLICATION"; 89| 9| case ASN1_Class::Private: ------------------ | Branch (89:7): [True: 9, False: 899] ------------------ 90| 9| return "PRIVATE"; 91| 0| case ASN1_Class::NoObject: ------------------ | Branch (91:7): [True: 0, False: 908] ------------------ 92| 0| return "NO_OBJECT"; 93| 26| default: ------------------ | Branch (93:7): [True: 26, False: 882] ------------------ 94| 26| return "CLASS(" + std::to_string(static_cast(type)) + ")"; 95| 908| } 96| 908|} _ZN5Botan18asn1_tag_to_stringENS_9ASN1_TypeE: 98| 2.04k|std::string asn1_tag_to_string(ASN1_Type type) { 99| 2.04k| switch(type) { 100| 407| case ASN1_Type::Sequence: ------------------ | Branch (100:7): [True: 407, False: 1.64k] ------------------ 101| 407| return "SEQUENCE"; 102| | 103| 39| case ASN1_Type::Set: ------------------ | Branch (103:7): [True: 39, False: 2.01k] ------------------ 104| 39| return "SET"; 105| | 106| 650| case ASN1_Type::PrintableString: ------------------ | Branch (106:7): [True: 650, False: 1.39k] ------------------ 107| 650| return "PRINTABLE STRING"; 108| | 109| 13| case ASN1_Type::NumericString: ------------------ | Branch (109:7): [True: 13, False: 2.03k] ------------------ 110| 13| return "NUMERIC STRING"; 111| | 112| 6| case ASN1_Type::Ia5String: ------------------ | Branch (112:7): [True: 6, False: 2.04k] ------------------ 113| 6| return "IA5 STRING"; 114| | 115| 3| case ASN1_Type::TeletexString: ------------------ | Branch (115:7): [True: 3, False: 2.04k] ------------------ 116| 3| return "T61 STRING"; 117| | 118| 566| case ASN1_Type::Utf8String: ------------------ | Branch (118:7): [True: 566, False: 1.48k] ------------------ 119| 566| return "UTF8 STRING"; 120| | 121| 4| case ASN1_Type::VisibleString: ------------------ | Branch (121:7): [True: 4, False: 2.04k] ------------------ 122| 4| return "VISIBLE STRING"; 123| | 124| 10| case ASN1_Type::BmpString: ------------------ | Branch (124:7): [True: 10, False: 2.03k] ------------------ 125| 10| return "BMP STRING"; 126| | 127| 0| case ASN1_Type::UniversalString: ------------------ | Branch (127:7): [True: 0, False: 2.04k] ------------------ 128| 0| return "UNIVERSAL STRING"; 129| | 130| 1| case ASN1_Type::UtcTime: ------------------ | Branch (130:7): [True: 1, False: 2.04k] ------------------ 131| 1| return "UTC TIME"; 132| | 133| 1| case ASN1_Type::GeneralizedTime: ------------------ | Branch (133:7): [True: 1, False: 2.04k] ------------------ 134| 1| return "GENERALIZED TIME"; 135| | 136| 8| case ASN1_Type::OctetString: ------------------ | Branch (136:7): [True: 8, False: 2.04k] ------------------ 137| 8| return "OCTET STRING"; 138| | 139| 46| case ASN1_Type::BitString: ------------------ | Branch (139:7): [True: 46, False: 2.00k] ------------------ 140| 46| return "BIT STRING"; 141| | 142| 20| case ASN1_Type::Enumerated: ------------------ | Branch (142:7): [True: 20, False: 2.02k] ------------------ 143| 20| return "ENUMERATED"; 144| | 145| 12| case ASN1_Type::Integer: ------------------ | Branch (145:7): [True: 12, False: 2.03k] ------------------ 146| 12| return "INTEGER"; 147| | 148| 3| case ASN1_Type::Null: ------------------ | Branch (148:7): [True: 3, False: 2.04k] ------------------ 149| 3| return "NULL"; 150| | 151| 41| case ASN1_Type::ObjectId: ------------------ | Branch (151:7): [True: 41, False: 2.00k] ------------------ 152| 41| return "OBJECT"; 153| | 154| 93| case ASN1_Type::Boolean: ------------------ | Branch (154:7): [True: 93, False: 1.95k] ------------------ 155| 93| return "BOOLEAN"; 156| | 157| 0| case ASN1_Type::NoObject: ------------------ | Branch (157:7): [True: 0, False: 2.04k] ------------------ 158| 0| return "NO_OBJECT"; 159| | 160| 126| default: ------------------ | Branch (160:7): [True: 126, False: 1.92k] ------------------ 161| 126| return "TAG(" + std::to_string(static_cast(type)) + ")"; 162| 2.04k| } 163| 2.04k|} _ZN5Botan18BER_Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 168| 2.72k|BER_Decoding_Error::BER_Decoding_Error(std::string_view err) : Decoding_Error(fmt("BER: {}", err)) {} _ZN5Botan11BER_Bad_TagC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEj: 170| 50|BER_Bad_Tag::BER_Bad_Tag(std::string_view str, uint32_t tagging) : BER_Decoding_Error(fmt("{}: {}", str, tagging)) {} _ZN5Botan4ASN115put_in_sequenceERKNSt3__16vectorIhNS1_9allocatorIhEEEE: 177| 4.36k|std::vector put_in_sequence(const std::vector& contents) { 178| 4.36k| return ASN1::put_in_sequence(contents.data(), contents.size()); 179| 4.36k|} _ZN5Botan4ASN115put_in_sequenceEPKhm: 181| 4.36k|std::vector put_in_sequence(const uint8_t bits[], size_t len) { 182| 4.36k| std::vector output; 183| 4.36k| DER_Encoder(output).start_sequence().raw_bytes(bits, len).end_cons(); 184| 4.36k| return output; 185| 4.36k|} _ZN5Botan4ASN19to_stringERKNS_10BER_ObjectE: 190| 12.2k|std::string to_string(const BER_Object& obj) { 191| 12.2k| return bytes_to_string(obj.data()); 192| 12.2k|} _ZN5Botan4ASN19maybe_BERERNS_10DataSourceE: 197| 4.01k|bool maybe_BER(DataSource& source) { 198| 4.01k| uint8_t first_u8 = 0; 199| 4.01k| if(source.peek_byte(first_u8) == 0) { ------------------ | Branch (199:7): [True: 1, False: 4.01k] ------------------ 200| 1| BOTAN_ASSERT_EQUAL(source.read_byte(first_u8), 0, "Expected EOF"); ------------------ | | 90| 1| do { \ | | 91| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 92| 1| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (92:10): [True: 0, False: 1] | | ------------------ | | 93| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 94| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 95| 0| } \ | | 96| 1| } while(0) | | ------------------ | | | Branch (96:12): [Folded, False: 1] | | ------------------ ------------------ 201| 1| throw Stream_IO_Error("ASN1::maybe_BER: Source was empty"); 202| 1| } 203| | 204| 4.01k| const auto cons_seq = static_cast(ASN1_Class::Constructed) | static_cast(ASN1_Type::Sequence); 205| 4.01k| return first_u8 == cons_seq; 206| 4.01k|} _ZN5Botan3OID11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 86| 972|OID OID::from_string(std::string_view str) { 87| 972| if(str.empty()) { ------------------ | Branch (87:7): [True: 0, False: 972] ------------------ 88| 0| throw Invalid_Argument("OID::from_string argument must be non-empty"); 89| 0| } 90| | 91| 972| OID o = OID_Map::global_registry().str2oid(str); 92| 972| if(o.has_value()) { ------------------ | Branch (92:7): [True: 972, False: 0] ------------------ 93| 972| return o; 94| 972| } 95| | 96| | // Try to parse as a dotted decimal 97| 0| try { 98| 0| return OID(str); 99| 0| } catch(...) {} 100| | 101| 0| throw Lookup_Error(fmt("No OID associated with name '{}'", str)); 102| 0|} _ZN5Botan3OIDC2ESt16initializer_listIjE: 104| 11.8k|OID::OID(std::initializer_list init) : m_id(init) { 105| 11.8k| oid_valid_check(m_id); 106| 11.8k|} _ZNK5Botan3OID9to_stringEv: 125| 364|std::string OID::to_string() const { 126| 364| std::ostringstream out; 127| | 128| 2.90k| for(size_t i = 0; i != m_id.size(); ++i) { ------------------ | Branch (128:22): [True: 2.53k, False: 364] ------------------ 129| | // avoid locale issues with integer formatting 130| 2.53k| out << std::to_string(m_id[i]); 131| 2.53k| if(i != m_id.size() - 1) { ------------------ | Branch (131:10): [True: 2.17k, False: 364] ------------------ 132| 2.17k| out << "."; 133| 2.17k| } 134| 2.53k| } 135| | 136| 364| return out.str(); 137| 364|} _ZNK5Botan3OID19to_formatted_stringEv: 139| 914|std::string OID::to_formatted_string() const { 140| 914| std::string s = this->human_name_or_empty(); 141| 914| if(!s.empty()) { ------------------ | Branch (141:7): [True: 556, False: 358] ------------------ 142| 556| return s; 143| 556| } 144| 358| return this->to_string(); 145| 914|} _ZNK5Botan3OID19human_name_or_emptyEv: 147| 920|std::string OID::human_name_or_empty() const { 148| 920| return OID_Map::global_registry().oid2str(*this); 149| 920|} _ZNK5Botan3OID7matchesESt16initializer_listIjE: 155| 859|bool OID::matches(std::initializer_list other) const { 156| | // TODO: once all target compilers support it, use std::ranges::equal 157| 859| return std::equal(m_id.begin(), m_id.end(), other.begin(), other.end()); 158| 859|} _ZNK5Botan3OID9hash_codeEv: 160| 1.28k|uint64_t OID::hash_code() const { 161| | // If this is changed also update gen_oids.py to match 162| 1.28k| uint64_t hash = 0x621F302327D9A49A; 163| 8.83k| for(auto id : m_id) { ------------------ | Branch (163:16): [True: 8.83k, False: 1.28k] ------------------ 164| 8.83k| hash *= 193; 165| 8.83k| hash += id; 166| 8.83k| } 167| 1.28k| return hash; 168| 1.28k|} _ZN5BotanltERKNS_3OIDES2_: 173| 44.8k|bool operator<(const OID& a, const OID& b) { 174| 44.8k| const std::vector& oid1 = a.get_components(); 175| 44.8k| const std::vector& oid2 = b.get_components(); 176| | 177| 44.8k| return std::lexicographical_compare(oid1.begin(), oid1.end(), oid2.begin(), oid2.end()); 178| 44.8k|} _ZNK5Botan3OID11encode_intoERNS_11DER_EncoderE: 183| 930|void OID::encode_into(DER_Encoder& der) const { 184| 930| if(m_id.size() < 2) { ------------------ | Branch (184:7): [True: 0, False: 930] ------------------ 185| 0| throw Invalid_Argument("OID::encode_into: OID is invalid"); 186| 0| } 187| | 188| 930| auto append = [](std::vector& encoding, uint32_t z) { 189| 930| if(z <= 0x7F) { 190| 930| encoding.push_back(static_cast(z)); 191| 930| } else { 192| 930| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 193| | 194| 930| for(size_t j = 0; j != z7; ++j) { 195| 930| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 196| | 197| 930| if(j != z7 - 1) { 198| 930| zp |= 0x80; 199| 930| } 200| | 201| 930| encoding.push_back(zp); 202| 930| } 203| 930| } 204| 930| }; 205| | 206| 930| std::vector encoding; 207| | 208| | // We know 40 * root can't overflow because root is between 0 and 2 209| 930| auto first = checked_add(40 * m_id[0], m_id[1]); 210| 930| BOTAN_ASSERT_NOMSG(first.has_value()); ------------------ | | 77| 930| do { \ | | 78| 930| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 930| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 930] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 930| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 930] | | ------------------ ------------------ 211| | 212| 930| append(encoding, *first); 213| | 214| 5.48k| for(size_t i = 2; i != m_id.size(); ++i) { ------------------ | Branch (214:22): [True: 4.55k, False: 930] ------------------ 215| 4.55k| append(encoding, m_id[i]); 216| 4.55k| } 217| 930| der.add_object(ASN1_Type::ObjectId, ASN1_Class::Universal, encoding); 218| 930|} _ZN5Botan3OID11decode_fromERNS_11BER_DecoderE: 223| 21.2k|void OID::decode_from(BER_Decoder& decoder) { 224| 21.2k| const BER_Object obj = decoder.get_next_object(); 225| 21.2k| if(obj.tagging() != (ASN1_Class::Universal | ASN1_Type::ObjectId)) { ------------------ | Branch (225:7): [True: 49, False: 21.1k] ------------------ 226| 49| throw BER_Bad_Tag("Error decoding OID, unknown tag", obj.tagging()); 227| 49| } 228| | 229| 21.1k| if(obj.length() == 0) { ------------------ | Branch (229:7): [True: 1, False: 21.1k] ------------------ 230| 1| throw BER_Decoding_Error("OID encoding is too short"); 231| 1| } 232| | 233| 21.1k| auto consume = [](BufferSlicer& data) -> uint32_t { 234| 21.1k| BOTAN_ASSERT_NOMSG(!data.empty()); 235| 21.1k| uint32_t b = data.take_byte(); 236| | 237| 21.1k| if(b > 0x7F) { 238| 21.1k| b &= 0x7F; 239| | 240| | // Even BER requires that the OID have minimal length, ie that 241| | // the first byte of a multibyte encoding cannot be zero 242| | // See X.690 section 8.19.2 243| 21.1k| if(b == 0) { 244| 21.1k| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 245| 21.1k| } 246| | 247| 21.1k| while(true) { 248| 21.1k| if(data.empty()) { 249| 21.1k| throw Decoding_Error("Truncated OID value"); 250| 21.1k| } 251| | 252| 21.1k| const uint8_t next = data.take_byte(); 253| 21.1k| const bool more = (next & 0x80) == 0x80; 254| 21.1k| const uint8_t value = next & 0x7F; 255| | 256| 21.1k| if((b >> (32 - 7)) != 0) { 257| 21.1k| throw Decoding_Error("OID component overflow"); 258| 21.1k| } 259| | 260| 21.1k| b = (b << 7) | value; 261| | 262| 21.1k| if(!more) { 263| 21.1k| break; 264| 21.1k| } 265| 21.1k| } 266| 21.1k| } 267| | 268| 21.1k| return b; 269| 21.1k| }; 270| | 271| 21.1k| BufferSlicer data(obj.data()); 272| 21.1k| std::vector parts; 273| 110k| while(!data.empty()) { ------------------ | Branch (273:10): [True: 89.3k, False: 21.1k] ------------------ 274| 89.3k| const uint32_t comp = consume(data); 275| | 276| 89.3k| if(parts.empty()) { ------------------ | Branch (276:10): [True: 21.0k, False: 68.3k] ------------------ 277| | // divide into root and second arc 278| | 279| 21.0k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 280| 21.0k| if(b0 < 40) { 281| 21.0k| return 0; 282| 21.0k| } else if(b0 < 80) { 283| 21.0k| return 1; 284| 21.0k| } else { 285| 21.0k| return 2; 286| 21.0k| } 287| 21.0k| }(comp); 288| | 289| 21.0k| parts.push_back(root_arc); 290| 21.0k| BOTAN_ASSERT_NOMSG(comp >= 40 * root_arc); ------------------ | | 77| 21.0k| do { \ | | 78| 21.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 21.0k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 21.0k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 21.0k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 21.0k] | | ------------------ ------------------ 291| 21.0k| parts.push_back(comp - 40 * root_arc); 292| 68.3k| } else { 293| 68.3k| parts.push_back(comp); 294| 68.3k| } 295| 89.3k| } 296| | 297| 21.1k| m_id = parts; 298| 21.1k|} asn1_oid.cpp:_ZN5Botan12_GLOBAL__N_115oid_valid_checkENSt3__14spanIKjLm18446744073709551615EEE: 26| 11.8k|void oid_valid_check(std::span oid) { 27| 11.8k| BOTAN_ARG_CHECK(oid.size() >= 2, "OID too short to be valid"); ------------------ | | 35| 11.8k| do { \ | | 36| 11.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 11.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 11.8k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 11.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 11.8k] | | ------------------ ------------------ 28| 11.8k| BOTAN_ARG_CHECK(oid[0] <= 2, "OID root out of range"); ------------------ | | 35| 11.8k| do { \ | | 36| 11.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 11.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 11.8k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 11.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 11.8k] | | ------------------ ------------------ 29| 11.8k| BOTAN_ARG_CHECK(oid[1] <= 39 || oid[0] == 2, "OID second arc too large"); ------------------ | | 35| 11.8k| do { \ | | 36| 11.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 11.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 11.8k, 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| 11.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 11.8k] | | ------------------ ------------------ 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| 11.8k| BOTAN_ARG_CHECK(oid[1] <= 0xFFFFFFAF, "OID second arc too large"); ------------------ | | 35| 11.8k| do { \ | | 36| 11.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 11.8k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 11.8k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 11.8k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 11.8k] | | ------------------ ------------------ 33| 11.8k|} asn1_oid.cpp:_ZZNK5Botan3OID11encode_intoERNS_11DER_EncoderEENK3$_0clERNSt3__16vectorIhNS4_9allocatorIhEEEEj: 188| 5.48k| auto append = [](std::vector& encoding, uint32_t z) { 189| 5.48k| if(z <= 0x7F) { ------------------ | Branch (189:10): [True: 3.63k, False: 1.85k] ------------------ 190| 3.63k| encoding.push_back(static_cast(z)); 191| 3.63k| } else { 192| 1.85k| const size_t z7 = (high_bit(z) + 7 - 1) / 7; 193| | 194| 6.38k| for(size_t j = 0; j != z7; ++j) { ------------------ | Branch (194:28): [True: 4.53k, False: 1.85k] ------------------ 195| 4.53k| uint8_t zp = static_cast(z >> (7 * (z7 - j - 1)) & 0x7F); 196| | 197| 4.53k| if(j != z7 - 1) { ------------------ | Branch (197:16): [True: 2.68k, False: 1.85k] ------------------ 198| 2.68k| zp |= 0x80; 199| 2.68k| } 200| | 201| 4.53k| encoding.push_back(zp); 202| 4.53k| } 203| 1.85k| } 204| 5.48k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_0clERNS_12BufferSlicerE: 233| 89.3k| auto consume = [](BufferSlicer& data) -> uint32_t { 234| 89.3k| BOTAN_ASSERT_NOMSG(!data.empty()); ------------------ | | 77| 89.3k| do { \ | | 78| 89.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 89.3k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 89.3k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 89.3k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 89.3k] | | ------------------ ------------------ 235| 89.3k| uint32_t b = data.take_byte(); 236| | 237| 89.3k| if(b > 0x7F) { ------------------ | Branch (237:10): [True: 16.1k, False: 73.1k] ------------------ 238| 16.1k| b &= 0x7F; 239| | 240| | // Even BER requires that the OID have minimal length, ie that 241| | // the first byte of a multibyte encoding cannot be zero 242| | // See X.690 section 8.19.2 243| 16.1k| if(b == 0) { ------------------ | Branch (243:13): [True: 6, False: 16.1k] ------------------ 244| 6| throw Decoding_Error("Leading zero byte in multibyte OID encoding"); 245| 6| } 246| | 247| 22.2k| while(true) { ------------------ | Branch (247:16): [True: 22.2k, Folded] ------------------ 248| 22.2k| if(data.empty()) { ------------------ | Branch (248:16): [True: 6, False: 22.2k] ------------------ 249| 6| throw Decoding_Error("Truncated OID value"); 250| 6| } 251| | 252| 22.2k| const uint8_t next = data.take_byte(); 253| 22.2k| const bool more = (next & 0x80) == 0x80; 254| 22.2k| const uint8_t value = next & 0x7F; 255| | 256| 22.2k| if((b >> (32 - 7)) != 0) { ------------------ | Branch (256:16): [True: 11, False: 22.1k] ------------------ 257| 11| throw Decoding_Error("OID component overflow"); 258| 11| } 259| | 260| 22.1k| b = (b << 7) | value; 261| | 262| 22.1k| if(!more) { ------------------ | Branch (262:16): [True: 16.1k, False: 6.02k] ------------------ 263| 16.1k| break; 264| 16.1k| } 265| 22.1k| } 266| 16.1k| } 267| | 268| 89.3k| return b; 269| 89.3k| }; asn1_oid.cpp:_ZZN5Botan3OID11decode_fromERNS_11BER_DecoderEENK3$_1clEj: 279| 21.0k| const uint32_t root_arc = [](uint32_t b0) -> uint32_t { 280| 21.0k| if(b0 < 40) { ------------------ | Branch (280:16): [True: 173, False: 20.8k] ------------------ 281| 173| return 0; 282| 20.8k| } else if(b0 < 80) { ------------------ | Branch (282:23): [True: 9.06k, False: 11.8k] ------------------ 283| 9.06k| return 1; 284| 11.8k| } else { 285| 11.8k| return 2; 286| 11.8k| } 287| 21.0k| }(comp); _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 135| 7.94k|ASN1_String::ASN1_String(std::string_view str, ASN1_Type t) : m_utf8_str(str), m_tag(t) { 136| 7.94k| if(!is_utf8_subset_string_type(m_tag)) { ------------------ | Branch (136:7): [True: 0, False: 7.94k] ------------------ 137| 0| throw Invalid_Argument("ASN1_String only supports encoding to UTF-8 or a UTF-8 subset"); 138| 0| } 139| | 140| 7.94k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (140:7): [True: 0, False: 7.94k] ------------------ 141| 0| throw Invalid_Argument(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 142| 0| } 143| 7.94k|} _ZN5Botan11ASN1_StringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 145| 7.94k|ASN1_String::ASN1_String(std::string_view str) : ASN1_String(str, choose_encoding(str)) {} _ZN5Botan11ASN1_String11decode_fromERNS_11BER_DecoderE: 162| 7.93k|void ASN1_String::decode_from(BER_Decoder& source) { 163| 7.93k| const BER_Object obj = source.get_next_object(); 164| | 165| 7.93k| if(obj.get_class() != ASN1_Class::Universal || !is_asn1_string_type(obj.type())) { ------------------ | Branch (165:7): [True: 84, False: 7.84k] | Branch (165:51): [True: 0, False: 7.84k] ------------------ 166| 82| auto typ = static_cast(obj.type()); 167| 82| auto cls = static_cast(obj.get_class()); 168| 82| throw Decoding_Error(fmt("ASN1_String: Unknown string type {}/{}", typ, cls)); 169| 82| } 170| | 171| 7.84k| m_tag = obj.type(); 172| 7.84k| m_data.assign(obj.bits(), obj.bits() + obj.length()); 173| | 174| 7.84k| if(m_tag == ASN1_Type::BmpString) { ------------------ | Branch (174:7): [True: 24, False: 7.82k] ------------------ 175| 24| m_utf8_str = ucs2_to_utf8(m_data.data(), m_data.size()); 176| 7.82k| } else if(m_tag == ASN1_Type::UniversalString) { ------------------ | Branch (176:14): [True: 0, False: 7.82k] ------------------ 177| 0| m_utf8_str = ucs4_to_utf8(m_data.data(), m_data.size()); 178| 7.82k| } else if(m_tag == ASN1_Type::TeletexString) { ------------------ | Branch (178:14): [True: 17, False: 7.80k] ------------------ 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| 17| m_utf8_str = latin1_to_utf8(m_data.data(), m_data.size()); 184| 7.80k| } else { 185| | // All other supported string types are UTF-8 or some subset thereof 186| 7.80k| m_utf8_str = ASN1::to_string(obj); 187| | 188| 7.80k| if(!is_valid_asn1_string_content(m_utf8_str, m_tag)) { ------------------ | Branch (188:10): [True: 1.19k, False: 6.61k] ------------------ 189| 1.19k| throw Decoding_Error(fmt("ASN1_String: Invalid {} encoding", asn1_tag_to_string(m_tag))); 190| 1.19k| } 191| 7.80k| } 192| 7.84k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_119is_asn1_string_typeENS_9ASN1_TypeE: 99| 7.84k|bool is_asn1_string_type(ASN1_Type tag) { 100| 7.84k| return (is_utf8_subset_string_type(tag) || tag == ASN1_Type::TeletexString || tag == ASN1_Type::BmpString || ------------------ | Branch (100:12): [True: 7.80k, False: 41] | Branch (100:47): [True: 17, False: 24] | Branch (100:82): [True: 24, False: 0] ------------------ 101| 0| tag == ASN1_Type::UniversalString); ------------------ | Branch (101:12): [True: 0, False: 0] ------------------ 102| 7.84k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_126is_utf8_subset_string_typeENS_9ASN1_TypeE: 94| 31.5k|bool is_utf8_subset_string_type(ASN1_Type tag) { 95| 31.5k| return (tag == ASN1_Type::NumericString || tag == ASN1_Type::PrintableString || tag == ASN1_Type::VisibleString || ------------------ | Branch (95:12): [True: 14, False: 31.5k] | Branch (95:47): [True: 27.7k, False: 3.74k] | Branch (95:84): [True: 2, False: 3.73k] ------------------ 96| 3.73k| tag == ASN1_Type::Ia5String || tag == ASN1_Type::Utf8String); ------------------ | Branch (96:12): [True: 10, False: 3.72k] | Branch (96:43): [True: 3.68k, False: 41] ------------------ 97| 31.5k|} asn1_str.cpp:_ZN5Botan12_GLOBAL__N_128is_valid_asn1_string_contentERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS_9ASN1_TypeE: 104| 15.7k|bool is_valid_asn1_string_content(const std::string& str, ASN1_Type tag) { 105| 15.7k| BOTAN_ASSERT_NOMSG(is_utf8_subset_string_type(tag)); ------------------ | | 77| 15.7k| do { \ | | 78| 15.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 15.7k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 15.7k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 15.7k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 15.7k] | | ------------------ ------------------ 106| | 107| 15.7k| switch(tag) { 108| 1.84k| case ASN1_Type::Utf8String: ------------------ | Branch (108:7): [True: 1.84k, False: 13.9k] ------------------ 109| 1.84k| return is_valid_utf8(str); 110| 7| case ASN1_Type::NumericString: ------------------ | Branch (110:7): [True: 7, False: 15.7k] ------------------ 111| 13.9k| case ASN1_Type::PrintableString: ------------------ | Branch (111:7): [True: 13.8k, False: 1.85k] ------------------ 112| 13.9k| case ASN1_Type::Ia5String: ------------------ | Branch (112:7): [True: 5, False: 15.7k] ------------------ 113| 13.9k| case ASN1_Type::VisibleString: ------------------ | Branch (113:7): [True: 1, False: 15.7k] ------------------ 114| 13.9k| return g_char_validator.valid_encoding(str, tag); 115| 0| default: ------------------ | Branch (115:7): [True: 0, False: 15.7k] ------------------ 116| 0| return false; 117| 15.7k| } 118| 15.7k|} asn1_str.cpp:_ZNK5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator14valid_encodingENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEENS_9ASN1_TypeE: 25| 21.8k| constexpr bool valid_encoding(std::string_view str, ASN1_Type tag) const { 26| 21.8k| const uint8_t mask = mask_for(tag); 27| 38.1k| for(const char c : str) { ------------------ | Branch (27:27): [True: 38.1k, False: 21.2k] ------------------ 28| 38.1k| const uint8_t codepoint = static_cast(c); 29| 38.1k| const bool is_valid = (m_table[codepoint] & mask) != 0; 30| | 31| 38.1k| if(!is_valid) { ------------------ | Branch (31:16): [True: 651, False: 37.5k] ------------------ 32| 651| return false; 33| 651| } 34| 38.1k| } 35| | 36| 21.2k| return true; 37| 21.8k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_131ASN1_String_Codepoint_Validator8mask_forENS_9ASN1_TypeE: 45| 21.8k| static constexpr uint8_t mask_for(ASN1_Type tag) { 46| 21.8k| switch(tag) { 47| 7| case ASN1_Type::NumericString: ------------------ | Branch (47:13): [True: 7, False: 21.8k] ------------------ 48| 7| return Numeric_String; 49| 21.8k| case ASN1_Type::PrintableString: ------------------ | Branch (49:13): [True: 21.8k, False: 13] ------------------ 50| 21.8k| return Printable_String; 51| 5| case ASN1_Type::Ia5String: ------------------ | Branch (51:13): [True: 5, False: 21.8k] ------------------ 52| 5| return IA5_String; 53| 1| case ASN1_Type::VisibleString: ------------------ | Branch (53:13): [True: 1, False: 21.8k] ------------------ 54| 1| return Visible_String; 55| 0| default: ------------------ | Branch (55:13): [True: 0, False: 21.8k] ------------------ 56| 0| return 0; 57| 21.8k| } 58| 21.8k| } asn1_str.cpp:_ZN5Botan12_GLOBAL__N_115choose_encodingENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 120| 7.94k|ASN1_Type choose_encoding(std::string_view str) { 121| 7.94k| if(g_char_validator.valid_encoding(str, ASN1_Type::PrintableString)) { ------------------ | Branch (121:7): [True: 7.94k, False: 0] ------------------ 122| 7.94k| return ASN1_Type::PrintableString; 123| 7.94k| } else { 124| 0| return ASN1_Type::Utf8String; 125| 0| } 126| 7.94k|} _ZN5Botan9ASN1_Time11decode_fromERNS_11BER_DecoderE: 59| 4.03k|void ASN1_Time::decode_from(BER_Decoder& source) { 60| 4.03k| const BER_Object ber_time = source.get_next_object(); 61| | 62| 4.03k| if(ber_time.get_class() != ASN1_Class::Universal || ------------------ | Branch (62:7): [True: 14, False: 4.01k] ------------------ 63| 4.01k| (ber_time.type() != ASN1_Type::UtcTime && ber_time.type() != ASN1_Type::GeneralizedTime)) { ------------------ | Branch (63:8): [True: 3, False: 4.01k] | Branch (63:49): [True: 2, False: 1] ------------------ 64| 15| throw Decoding_Error(fmt("ASN1_Time: Unexpected tag {}/{}", 65| 15| static_cast(ber_time.type()), 66| 15| static_cast(ber_time.get_class()))); 67| 15| } 68| | 69| 4.01k| try { 70| 4.01k| set_to(ASN1::to_string(ber_time), ber_time.type()); 71| 4.01k| } catch(Invalid_Argument& e) { 72| 10| throw Decoding_Error(fmt("Invalid ASN1_Time encoding: {}", e.what())); 73| 10| } 74| 4.01k|} _ZN5Botan9ASN1_Time6set_toENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_9ASN1_TypeE: 176| 4.01k|void ASN1_Time::set_to(std::string_view t_spec, ASN1_Type spec_tag) { 177| 4.01k| BOTAN_ARG_CHECK(spec_tag == ASN1_Type::UtcTime || spec_tag == ASN1_Type::GeneralizedTime, ------------------ | | 35| 4.01k| do { \ | | 36| 4.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4.01k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 4.01k, False: 1] | | | Branch (37:12): [True: 1, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 4.01k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.01k] | | ------------------ ------------------ 178| 4.01k| "Invalid tag for ASN1_Time"); 179| | 180| 4.01k| if(spec_tag == ASN1_Type::GeneralizedTime) { ------------------ | Branch (180:7): [True: 1, False: 4.01k] ------------------ 181| 1| BOTAN_ARG_CHECK(t_spec.size() == 15, "Invalid GeneralizedTime input string"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 1, False: 0] | | ------------------ | | 38| 1| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 1| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 1| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 182| 4.01k| } else if(spec_tag == ASN1_Type::UtcTime) { ------------------ | Branch (182:14): [True: 4.01k, False: 0] ------------------ 183| 4.01k| BOTAN_ARG_CHECK(t_spec.size() == 13, "Invalid UTCTime input string"); ------------------ | | 35| 4.01k| do { \ | | 36| 4.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4.01k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 2, False: 4.01k] | | ------------------ | | 38| 2| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 2| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 2| } \ | | 41| 4.01k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.01k] | | ------------------ ------------------ 184| 4.01k| } 185| | 186| 4.01k| BOTAN_ARG_CHECK(t_spec.back() == 'Z', "Botan does not support ASN1 times with timezones other than Z"); ------------------ | | 35| 4.01k| do { \ | | 36| 4.01k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4.01k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 2, False: 4.01k] | | ------------------ | | 38| 2| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 2| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 2| } \ | | 41| 4.01k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.01k] | | ------------------ ------------------ 187| | 188| 4.01k| const size_t field_len = 2; 189| | 190| 4.01k| const size_t year_start = 0; 191| 4.01k| const size_t year_len = (spec_tag == ASN1_Type::UtcTime) ? 2 : 4; ------------------ | Branch (191:28): [True: 4.01k, False: 5] ------------------ 192| 4.01k| const size_t month_start = year_start + year_len; 193| 4.01k| const size_t day_start = month_start + field_len; 194| 4.01k| const size_t hour_start = day_start + field_len; 195| 4.01k| const size_t min_start = hour_start + field_len; 196| 4.01k| const size_t sec_start = min_start + field_len; 197| | 198| 4.01k| m_year = to_u32bit(t_spec.substr(year_start, year_len)); 199| 4.01k| m_month = to_u32bit(t_spec.substr(month_start, field_len)); 200| 4.01k| m_day = to_u32bit(t_spec.substr(day_start, field_len)); 201| 4.01k| m_hour = to_u32bit(t_spec.substr(hour_start, field_len)); 202| 4.01k| m_minute = to_u32bit(t_spec.substr(min_start, field_len)); 203| 4.01k| m_second = to_u32bit(t_spec.substr(sec_start, field_len)); 204| 4.01k| m_tag = spec_tag; 205| | 206| 4.01k| if(spec_tag == ASN1_Type::UtcTime) { ------------------ | Branch (206:7): [True: 4.00k, False: 6] ------------------ 207| 4.00k| if(m_year >= 50) { ------------------ | Branch (207:10): [True: 35, False: 3.97k] ------------------ 208| 35| m_year += 1900; 209| 3.97k| } else { 210| 3.97k| m_year += 2000; 211| 3.97k| } 212| 4.00k| } 213| | 214| 4.01k| if(!passes_sanity_check()) { ------------------ | Branch (214:7): [True: 4, False: 4.01k] ------------------ 215| 4| throw Invalid_Argument(fmt("ASN1_Time string '{}' does not seem to be valid", t_spec)); 216| 4| } 217| 4.01k|} _ZNK5Botan9ASN1_Time19passes_sanity_checkEv: 222| 4.00k|bool ASN1_Time::passes_sanity_check() const { 223| | // AppVeyor's trust store includes a cert with expiration date in 3016 ... 224| 4.00k| if(m_year < 1950 || m_year > 3100) { ------------------ | Branch (224:7): [True: 0, False: 4.00k] | Branch (224:24): [True: 0, False: 4.00k] ------------------ 225| 0| return false; 226| 0| } 227| 4.00k| if(m_month == 0 || m_month > 12) { ------------------ | Branch (227:7): [True: 0, False: 4.00k] | Branch (227:23): [True: 2, False: 4.00k] ------------------ 228| 2| return false; 229| 2| } 230| | 231| 4.00k| const uint32_t days_in_month[12] = {31, 28 + 1, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 232| | 233| 4.00k| if(m_day == 0 || m_day > days_in_month[m_month - 1]) { ------------------ | Branch (233:7): [True: 0, False: 4.00k] | Branch (233:21): [True: 0, False: 4.00k] ------------------ 234| 0| return false; 235| 0| } 236| | 237| 4.00k| if(m_month == 2 && m_day == 29) { ------------------ | Branch (237:7): [True: 653, False: 3.35k] | Branch (237:23): [True: 1, False: 652] ------------------ 238| 1| if(m_year % 4 != 0) { ------------------ | Branch (238:10): [True: 0, False: 1] ------------------ 239| 0| return false; // not a leap year 240| 0| } 241| | 242| 1| if(m_year % 100 == 0 && m_year % 400 != 0) { ------------------ | Branch (242:10): [True: 0, False: 1] | Branch (242:31): [True: 0, False: 0] ------------------ 243| 0| return false; 244| 0| } 245| 1| } 246| | 247| 4.00k| if(m_hour >= 24 || m_minute >= 60 || m_second > 60) { ------------------ | Branch (247:7): [True: 2, False: 4.00k] | Branch (247:23): [True: 0, False: 4.00k] | Branch (247:41): [True: 0, False: 4.00k] ------------------ 248| 2| return false; 249| 2| } 250| | 251| 4.00k| if(m_tag == ASN1_Type::UtcTime) { ------------------ | Branch (251:7): [True: 4.00k, False: 0] ------------------ 252| | /* 253| | UTCTime limits the value of components such that leap seconds 254| | are not covered. See "UNIVERSAL 23" in "Information technology 255| | Abstract Syntax Notation One (ASN.1): Specification of basic notation" 256| | 257| | http://www.itu.int/ITU-T/studygroups/com17/languages/ 258| | */ 259| 4.00k| if(m_second > 59) { ------------------ | Branch (259:10): [True: 0, False: 4.00k] ------------------ 260| 0| return false; 261| 0| } 262| 4.00k| } 263| | 264| 4.00k| return true; 265| 4.00k|} _ZN5Botan11BER_DecoderD2Ev: 366| 68.4k|BER_Decoder::~BER_Decoder() = default; _ZNK5Botan11BER_Decoder10more_itemsEv: 371| 33.8k|bool BER_Decoder::more_items() const { 372| 33.8k| if(m_source->end_of_data() && !m_pushed.is_set()) { ------------------ | Branch (372:7): [True: 12.0k, False: 21.8k] | Branch (372:34): [True: 12.0k, False: 0] ------------------ 373| 12.0k| return false; 374| 12.0k| } 375| 21.8k| return true; 376| 33.8k|} _ZN5Botan11BER_Decoder10verify_endEv: 381| 9.53k|BER_Decoder& BER_Decoder::verify_end() { 382| 9.53k| return verify_end("BER_Decoder::verify_end called, but data remains"); 383| 9.53k|} _ZN5Botan11BER_Decoder10verify_endENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 388| 10.9k|BER_Decoder& BER_Decoder::verify_end(std::string_view err) { 389| 10.9k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (389:7): [True: 21, False: 10.9k] | Branch (389:35): [True: 0, False: 10.9k] ------------------ 390| 21| throw Decoding_Error(err); 391| 21| } 392| 10.9k| return (*this); 393| 10.9k|} _ZN5Botan11BER_Decoder17discard_remainingEv: 398| 39|BER_Decoder& BER_Decoder::discard_remaining() { 399| 39| m_pushed = BER_Object(); 400| 39| uint8_t buf = 0; 401| 1.97k| while(m_source->read_byte(buf) != 0) {} ------------------ | Branch (401:10): [True: 1.93k, False: 39] ------------------ 402| 39| return (*this); 403| 39|} _ZN5Botan11BER_Decoder14read_next_byteEv: 405| 1.55M|std::optional BER_Decoder::read_next_byte() { 406| 1.55M| BOTAN_ASSERT_NOMSG(m_source != nullptr); ------------------ | | 77| 1.55M| do { \ | | 78| 1.55M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.55M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.55M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.55M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.55M] | | ------------------ ------------------ 407| 1.55M| uint8_t b = 0; 408| 1.55M| if(m_source->read_byte(b) != 0) { ------------------ | Branch (408:7): [True: 1.53M, False: 16.1k] ------------------ 409| 1.53M| return b; 410| 1.53M| } else { 411| 16.1k| return {}; 412| 16.1k| } 413| 1.55M|} _ZN5Botan11BER_Decoder16peek_next_objectEv: 415| 131|const BER_Object& BER_Decoder::peek_next_object() { 416| 131| if(!m_pushed.is_set()) { ------------------ | Branch (416:7): [True: 127, False: 4] ------------------ 417| 127| m_pushed = get_next_object(); 418| 127| } 419| | 420| 131| return m_pushed; 421| 131|} _ZN5Botan11BER_Decoder15get_next_objectEv: 426| 115k|BER_Object BER_Decoder::get_next_object() { 427| 115k| BER_Object next; 428| | 429| 115k| if(m_pushed.is_set()) { ------------------ | Branch (429:7): [True: 7.28k, False: 108k] ------------------ 430| 7.28k| std::swap(next, m_pushed); 431| 7.28k| return next; 432| 7.28k| } 433| | 434| 108k| for(;;) { 435| 108k| ASN1_Type type_tag = ASN1_Type::NoObject; 436| 108k| ASN1_Class class_tag = ASN1_Class::NoObject; 437| 108k| decode_tag(m_source, type_tag, class_tag); 438| 108k| next.set_tagging(type_tag, class_tag); 439| 108k| if(next.is_set() == false) { // no more objects ------------------ | Branch (439:10): [True: 1.33k, False: 106k] ------------------ 440| 1.33k| return next; 441| 1.33k| } 442| | 443| 106k| const size_t allow_indef = m_limits.allow_ber_encoding() ? m_limits.max_nested_indefinite_length() : 0; ------------------ | Branch (443:34): [True: 0, False: 106k] ------------------ 444| 106k| const bool der_mode = m_limits.require_der_encoding(); 445| 106k| const auto dl = decode_length(m_source, allow_indef, der_mode, is_constructed(class_tag)); 446| | 447| | // Per X.690 8.1.5 the only valid EOC encoding is the two-octet 448| | // sequence 0x00 0x00. Reject any other length encoding on a tag of 449| | // (Eoc, Universal) before we consume the "content" bytes. 450| 106k| if(type_tag == ASN1_Type::Eoc && class_tag == ASN1_Class::Universal && ------------------ | Branch (450:10): [True: 3.53k, False: 103k] | Branch (450:40): [True: 426, False: 3.10k] ------------------ 451| 426| (dl.content_length() != 0 || dl.indefinite_length())) { ------------------ | Branch (451:11): [True: 289, False: 137] | Branch (451:39): [True: 0, False: 137] ------------------ 452| 289| throw BER_Decoding_Error("EOC marker with non-zero length"); 453| 289| } 454| | 455| 106k| if(!m_source->check_available(dl.total_length())) { ------------------ | Branch (455:10): [True: 456, False: 106k] ------------------ 456| 456| throw BER_Decoding_Error("Value truncated"); 457| 456| } 458| | 459| 106k| uint8_t* out = next.mutable_bits(dl.content_length()); 460| 106k| if(m_source->read(out, dl.content_length()) != dl.content_length()) { ------------------ | Branch (460:10): [True: 0, False: 106k] ------------------ 461| 0| throw BER_Decoding_Error("Value truncated"); 462| 0| } 463| | 464| 106k| if(dl.indefinite_length()) { ------------------ | Branch (464:10): [True: 0, False: 106k] ------------------ 465| | // After reading the data consume the 2-byte EOC 466| 0| uint8_t eoc[2] = {0xFF, 0xFF}; 467| 0| if(m_source->read(eoc, 2) != 2 || eoc[0] != 0x00 || eoc[1] != 0x00) { ------------------ | Branch (467:13): [True: 0, False: 0] | Branch (467:44): [True: 0, False: 0] | Branch (467:62): [True: 0, False: 0] ------------------ 468| 0| throw BER_Decoding_Error("Missing or malformed EOC marker"); 469| 0| } 470| 0| } 471| | 472| 106k| if(next.tagging() == static_cast(ASN1_Type::Eoc)) { ------------------ | Branch (472:10): [True: 137, False: 105k] ------------------ 473| 137| if(m_limits.require_der_encoding()) { ------------------ | Branch (473:13): [True: 137, False: 0] ------------------ 474| 137| throw BER_Decoding_Error("Detected EOC marker in DER structure"); 475| 137| } 476| 0| continue; 477| 105k| } else { 478| 105k| break; 479| 105k| } 480| 106k| } 481| | 482| 105k| return next; 483| 108k|} _ZN5Botan11BER_Decoder9push_backEONS_10BER_ObjectE: 507| 8.53k|void BER_Decoder::push_back(BER_Object&& obj) { 508| 8.53k| if(m_pushed.is_set()) { ------------------ | Branch (508:7): [True: 0, False: 8.53k] ------------------ 509| 0| throw Invalid_State("BER_Decoder: Only one push back is allowed"); 510| 0| } 511| 8.53k| m_pushed = std::move(obj); 512| 8.53k|} _ZN5Botan11BER_Decoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 514| 47.6k|BER_Decoder BER_Decoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 515| 47.6k| BER_Object obj = get_next_object(); 516| 47.6k| obj.assert_is_a(type_tag, class_tag | ASN1_Class::Constructed); 517| 47.6k| BER_Decoder child(std::move(obj), this); 518| 47.6k| return child; 519| 47.6k|} _ZN5Botan11BER_Decoder8end_consEv: 524| 34.5k|BER_Decoder& BER_Decoder::end_cons() { 525| 34.5k| if(m_parent == nullptr) { ------------------ | Branch (525:7): [True: 0, False: 34.5k] ------------------ 526| 0| throw Invalid_State("BER_Decoder::end_cons called with null parent"); 527| 0| } 528| 34.5k| if(!m_source->end_of_data() || m_pushed.is_set()) { ------------------ | Branch (528:7): [True: 3, False: 34.5k] | Branch (528:35): [True: 16, False: 34.5k] ------------------ 529| 19| throw Decoding_Error("BER_Decoder::end_cons called with data left"); 530| 19| } 531| 34.5k| return (*m_parent); 532| 34.5k|} _ZN5Botan11BER_DecoderC2EONS_10BER_ObjectEPS0_: 535| 46.1k| m_limits(parent != nullptr ? parent->limits() : BER_Decoder::Limits::BER()), m_parent(parent) { ------------------ | Branch (535:16): [True: 46.1k, False: 0] ------------------ 536| 46.1k| m_data_src = std::make_unique(std::move(obj)); 537| 46.1k| m_source = m_data_src.get(); 538| 46.1k|} _ZN5Botan11BER_DecoderC2ERNS_10DataSourceENS0_6LimitsE: 543| 4.00k|BER_Decoder::BER_Decoder(DataSource& src, Limits limits) : m_limits(limits), m_source(&src) {} _ZN5Botan11BER_DecoderC2ENSt3__14spanIKhLm18446744073709551615EEENS0_6LimitsE: 548| 18.2k|BER_Decoder::BER_Decoder(std::span buf, Limits limits) : m_limits(limits) { 549| 18.2k| m_data_src = std::make_unique(buf); 550| 18.2k| m_source = m_data_src.get(); 551| 18.2k|} _ZN5Botan11BER_Decoder6decodeERNS_11ASN1_ObjectENS_9ASN1_TypeENS_10ASN1_ClassE: 560| 49.1k|BER_Decoder& BER_Decoder::decode(ASN1_Object& obj, ASN1_Type /*unused*/, ASN1_Class /*unused*/) { 561| 49.1k| obj.decode_from(*this); 562| 49.1k| return (*this); 563| 49.1k|} _ZN5Botan11BER_Decoder11decode_nullEv: 568| 1|BER_Decoder& BER_Decoder::decode_null() { 569| 1| const BER_Object obj = get_next_object(); 570| 1| obj.assert_is_a(ASN1_Type::Null, ASN1_Class::Universal); 571| 1| if(obj.length() > 0) { ------------------ | Branch (571:7): [True: 1, False: 0] ------------------ 572| 1| throw BER_Decoding_Error("NULL object had nonzero size"); 573| 1| } 574| 0| return (*this); 575| 1|} _ZN5Botan11BER_Decoder6decodeERbNS_9ASN1_TypeENS_10ASN1_ClassE: 587| 1.86k|BER_Decoder& BER_Decoder::decode(bool& out, ASN1_Type type_tag, ASN1_Class class_tag) { 588| 1.86k| const BER_Object obj = get_next_object(); 589| 1.86k| obj.assert_is_a(type_tag, class_tag); 590| | 591| 1.86k| if(obj.length() != 1) { ------------------ | Branch (591:7): [True: 0, False: 1.86k] ------------------ 592| 0| throw BER_Decoding_Error("BER boolean value had invalid size"); 593| 0| } 594| | 595| 1.86k| const uint8_t val = obj.bits()[0]; 596| | 597| | // DER requires boolean values to be exactly 0x00 or 0xFF 598| 1.86k| if(m_limits.require_der_encoding() && val != 0x00 && val != 0xFF) { ------------------ | Branch (598:7): [True: 1.86k, False: 0] | Branch (598:42): [True: 1.86k, False: 3] | Branch (598:57): [True: 14, False: 1.84k] ------------------ 599| 14| throw BER_Decoding_Error("Detected non-canonical boolean encoding in DER structure"); 600| 14| } 601| | 602| 1.85k| out = (val != 0) ? true : false; ------------------ | Branch (602:10): [True: 1.84k, False: 3] ------------------ 603| | 604| 1.85k| return (*this); 605| 1.86k|} _ZN5Botan11BER_Decoder6decodeERmNS_9ASN1_TypeENS_10ASN1_ClassE: 610| 2.98k|BER_Decoder& BER_Decoder::decode(size_t& out, ASN1_Type type_tag, ASN1_Class class_tag) { 611| 2.98k| BigInt integer; 612| 2.98k| decode(integer, type_tag, class_tag); 613| | 614| 2.98k| if(integer.signum() < 0) { ------------------ | Branch (614:7): [True: 2, False: 2.98k] ------------------ 615| 2| throw BER_Decoding_Error("Decoded small integer value was negative"); 616| 2| } 617| | 618| 2.98k| if(integer.bits() > 32) { ------------------ | Branch (618:7): [True: 1, False: 2.98k] ------------------ 619| 1| throw BER_Decoding_Error("Decoded integer value larger than expected"); 620| 1| } 621| | 622| 2.98k| out = 0; 623| 14.8k| for(size_t i = 0; i != 4; ++i) { ------------------ | Branch (623:22): [True: 11.8k, False: 2.98k] ------------------ 624| 11.8k| out = (out << 8) | integer.byte_at(3 - i); 625| 11.8k| } 626| | 627| 2.98k| return (*this); 628| 2.98k|} _ZN5Botan11BER_Decoder6decodeERNS_6BigIntENS_9ASN1_TypeENS_10ASN1_ClassE: 660| 6.75k|BER_Decoder& BER_Decoder::decode(BigInt& out, ASN1_Type type_tag, ASN1_Class class_tag) { 661| 6.75k| const BER_Object obj = get_next_object(); 662| 6.75k| obj.assert_is_a(type_tag, class_tag); 663| | 664| | // DER requires minimal INTEGER encoding (X.690 section 8.3.2) 665| 6.75k| if(m_limits.require_der_encoding()) { ------------------ | Branch (665:7): [True: 6.70k, False: 43] ------------------ 666| 6.70k| if(obj.length() == 0) { ------------------ | Branch (666:10): [True: 4, False: 6.70k] ------------------ 667| 4| throw BER_Decoding_Error("Detected empty INTEGER encoding in DER structure"); 668| 4| } 669| 6.70k| if(obj.length() > 1) { ------------------ | Branch (669:10): [True: 3.23k, False: 3.47k] ------------------ 670| 3.23k| if(obj.bits()[0] == 0x00 && (obj.bits()[1] & 0x80) == 0) { ------------------ | Branch (670:13): [True: 2.13k, False: 1.09k] | Branch (670:38): [True: 98, False: 2.03k] ------------------ 671| 98| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 672| 98| } 673| 3.13k| if(obj.bits()[0] == 0xFF && (obj.bits()[1] & 0x80) != 0) { ------------------ | Branch (673:13): [True: 51, False: 3.08k] | Branch (673:38): [True: 49, False: 2] ------------------ 674| 49| throw BER_Decoding_Error("Detected non-minimal INTEGER encoding in DER structure"); 675| 49| } 676| 3.13k| } 677| 6.70k| } 678| | 679| 6.60k| if(obj.length() == 0) { ------------------ | Branch (679:7): [True: 0, False: 6.60k] ------------------ 680| 0| out.clear(); 681| 6.60k| } else { 682| 6.60k| const uint8_t first = obj.bits()[0]; 683| 6.60k| const bool negative = (first & 0x80) == 0x80; 684| | 685| 6.60k| if(negative) { ------------------ | Branch (685:10): [True: 85, False: 6.51k] ------------------ 686| 85| secure_vector vec(obj.bits(), obj.bits() + obj.length()); 687| 95| for(size_t i = obj.length(); i > 0; --i) { ------------------ | Branch (687:39): [True: 95, False: 0] ------------------ 688| 95| const bool gt0 = (vec[i - 1] > 0); 689| 95| vec[i - 1] -= 1; 690| 95| if(gt0) { ------------------ | Branch (690:16): [True: 85, False: 10] ------------------ 691| 85| break; 692| 85| } 693| 95| } 694| 1.65k| for(size_t i = 0; i != obj.length(); ++i) { ------------------ | Branch (694:28): [True: 1.57k, False: 85] ------------------ 695| 1.57k| vec[i] = ~vec[i]; 696| 1.57k| } 697| 85| out._assign_from_bytes(vec); 698| 85| out.flip_sign(); 699| 6.51k| } else { 700| 6.51k| out._assign_from_bytes(obj.data()); 701| 6.51k| } 702| 6.60k| } 703| | 704| 6.60k| return (*this); 705| 6.75k|} _ZN5Botan11BER_Decoder6decodeERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeES7_NS_10ASN1_ClassE: 782| 10.3k| ASN1_Class class_tag) { 783| 10.3k| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (783:7): [True: 6.17k, False: 4.21k] | Branch (783:46): [True: 0, False: 6.17k] ------------------ 784| 0| throw BER_Bad_Tag("Bad tag for {BIT,OCTET} STRING", static_cast(real_type)); 785| 0| } 786| | 787| 10.3k| asn1_decode_binary_string( 788| 10.3k| buffer, get_next_object(), real_type, type_tag, class_tag, m_limits.require_der_encoding()); 789| 10.3k| return (*this); 790| 10.3k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_110decode_tagEPNS_10DataSourceERNS_9ASN1_TypeERNS_10ASN1_ClassE: 27| 108k|size_t decode_tag(DataSource* ber, ASN1_Type& type_tag, ASN1_Class& class_tag) { 28| 108k| auto b = ber->read_byte(); 29| | 30| 108k| if(!b) { ------------------ | Branch (30:7): [True: 1.33k, False: 106k] ------------------ 31| 1.33k| type_tag = ASN1_Type::NoObject; 32| 1.33k| class_tag = ASN1_Class::NoObject; 33| 1.33k| return 0; 34| 1.33k| } 35| | 36| 106k| if((*b & 0x1F) != 0x1F) { ------------------ | Branch (36:7): [True: 106k, False: 133] ------------------ 37| 106k| type_tag = ASN1_Type(*b & 0x1F); 38| 106k| class_tag = ASN1_Class(*b & 0xE0); 39| 106k| return 1; 40| 106k| } 41| | 42| 133| size_t tag_bytes = 1; 43| 133| class_tag = ASN1_Class(*b & 0xE0); 44| | 45| 133| uint32_t tag_buf = 0; 46| 386| while(true) { ------------------ | Branch (46:10): [True: 386, Folded] ------------------ 47| 386| b = ber->read_byte(); 48| 386| if(!b) { ------------------ | Branch (48:10): [True: 14, False: 372] ------------------ 49| 14| throw BER_Decoding_Error("Long-form tag truncated"); 50| 14| } 51| 372| if((tag_buf >> 24) != 0) { ------------------ | Branch (51:10): [True: 8, False: 364] ------------------ 52| 8| throw BER_Decoding_Error("Long-form tag overflowed 32 bits"); 53| 8| } 54| | // This is required even by BER (see X.690 section 8.1.2.4.2 sentence c). 55| | // Bits 7-1 of the first subsequent octet must not be all zero; this rules 56| | // out both 0x80 (continuation with no data) and 0x00 (a long-form encoding 57| | // of tag value 0, which collides with the EOC marker). 58| 364| if(tag_bytes == 1 && (*b & 0x7F) == 0) { ------------------ | Branch (58:10): [True: 121, False: 243] | Branch (58:28): [True: 1, False: 120] ------------------ 59| 1| throw BER_Decoding_Error("Long form tag with leading zero"); 60| 1| } 61| 363| ++tag_bytes; 62| 363| tag_buf = (tag_buf << 7) | (*b & 0x7F); 63| 363| if((*b & 0x80) == 0) { ------------------ | Branch (63:10): [True: 110, False: 253] ------------------ 64| 110| break; 65| 110| } 66| 363| } 67| | // Per X.690 8.1.2.2, tag values 0-30 shall be encoded in the short form. 68| | // Long-form encoding is reserved for tag values >= 31 (X.690 8.1.2.3). 69| | // This is unconditional and applies to BER as well as DER. 70| 110| if(tag_buf <= 30) { ------------------ | Branch (70:7): [True: 17, False: 93] ------------------ 71| 17| throw BER_Decoding_Error("Long-form tag encoding used for small tag value"); 72| 17| } 73| | 74| 93| if(tag_buf == static_cast(ASN1_Type::NoObject)) { ------------------ | Branch (74:7): [True: 1, False: 92] ------------------ 75| 1| throw BER_Decoding_Error("Tag value collides with internal sentinel"); 76| 1| } 77| | 78| | // NOLINTNEXTLINE(clang-analyzer-optin.core.EnumCastOutOfRange) 79| 92| type_tag = ASN1_Type(tag_buf); 80| 92| return tag_bytes; 81| 93|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_113decode_lengthEPNS_10DataSourceEmbb: 126| 106k|BerDecodedLength decode_length(DataSource* ber, size_t allow_indef, bool der_mode, bool constructed) { 127| 106k| uint8_t b = 0; 128| 106k| if(ber->read_byte(b) == 0) { ------------------ | Branch (128:7): [True: 11, False: 106k] ------------------ 129| 11| throw BER_Decoding_Error("Length field not found"); 130| 11| } 131| 106k| if((b & 0x80) == 0) { ------------------ | Branch (131:7): [True: 91.7k, False: 15.0k] ------------------ 132| 91.7k| return BerDecodedLength(b, 1); 133| 91.7k| } 134| | 135| 15.0k| const size_t num_length_bytes = (b & 0x7F); 136| 15.0k| if(num_length_bytes > 4) { ------------------ | Branch (136:7): [True: 161, False: 14.8k] ------------------ 137| 161| throw BER_Decoding_Error("Length field is too large"); 138| 161| } 139| | 140| 14.8k| const size_t field_size = 1 + num_length_bytes; 141| | 142| 14.8k| if(num_length_bytes == 0) { ------------------ | Branch (142:7): [True: 507, False: 14.3k] ------------------ 143| 507| if(der_mode) { ------------------ | Branch (143:10): [True: 507, False: 0] ------------------ 144| 507| throw BER_Decoding_Error("Detected indefinite-length encoding in DER structure"); 145| 507| } else if(!constructed) { ------------------ | Branch (145:17): [True: 0, False: 0] ------------------ 146| | // Indefinite length is only valid for constructed types (X.690 8.1.3.2) 147| 0| throw BER_Decoding_Error("Indefinite-length encoding used with non-constructed type"); 148| 0| } else if(allow_indef == 0) { ------------------ | Branch (148:17): [True: 0, False: 0] ------------------ 149| 0| throw BER_Decoding_Error("Nested EOC markers too deep, rejecting to avoid stack exhaustion"); 150| 0| } else { 151| | // find_eoc returns bytes up to and including the EOC marker. 152| | // Return the content length; the caller consumes the EOC separately. 153| 0| const size_t eoc_len = find_eoc(ber, /*base_offset=*/0, allow_indef - 1); 154| 0| if(eoc_len < 2) { ------------------ | Branch (154:13): [True: 0, False: 0] ------------------ 155| 0| throw BER_Decoding_Error("Invalid EOC encoding"); 156| 0| } 157| 0| return BerDecodedLength::indefinite(eoc_len - 2, field_size); 158| 0| } 159| 507| } 160| | 161| 14.3k| size_t length = 0; 162| | 163| 40.8k| for(size_t i = 0; i != num_length_bytes; ++i) { ------------------ | Branch (163:22): [True: 26.4k, False: 14.3k] ------------------ 164| 26.4k| if(ber->read_byte(b) == 0) { ------------------ | Branch (164:10): [True: 8, False: 26.4k] ------------------ 165| 8| throw BER_Decoding_Error("Corrupted length field"); 166| 8| } 167| | // Can't overflow since we already checked that num_length_bytes <= 4 168| 26.4k| length = (length << 8) | b; 169| 26.4k| } 170| | 171| | // DER requires shortest possible length encoding 172| 14.3k| if(der_mode) { ------------------ | Branch (172:7): [True: 14.3k, False: 0] ------------------ 173| 14.3k| if(length < 128) { ------------------ | Branch (173:10): [True: 18, False: 14.3k] ------------------ 174| 18| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 175| 18| } 176| 14.3k| if(num_length_bytes > 1 && length < (size_t(1) << ((num_length_bytes - 1) * 8))) { ------------------ | Branch (176:10): [True: 12.0k, False: 2.21k] | Branch (176:34): [True: 0, False: 12.0k] ------------------ 177| 0| throw BER_Decoding_Error("Detected non-canonical length encoding in DER structure"); 178| 0| } 179| 14.3k| } 180| | 181| 14.3k| return BerDecodedLength(length, field_size); 182| 14.3k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emm: 99| 106k| BerDecodedLength(content_length, field_length, false) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_116BerDecodedLengthC2Emmb: 116| 106k| m_content_length(content_length), m_field_length(field_length), m_indefinite(indefinite) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedENS_10ASN1_ClassE: 20| 117k|bool is_constructed(ASN1_Class class_tag) { 21| 117k| return (static_cast(class_tag) & static_cast(ASN1_Class::Constructed)) != 0; 22| 117k|} ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength14content_lengthEv: 105| 316k| size_t content_length() const { return m_content_length; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength17indefinite_lengthEv: 112| 105k| bool indefinite_length() const { return m_indefinite; } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_116BerDecodedLength12total_lengthEv: 108| 105k| size_t total_length() const { return m_indefinite ? m_content_length + 2 : m_content_length; } ------------------ | Branch (108:44): [True: 0, False: 105k] ------------------ ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObjectC2EONS_10BER_ObjectE: 357| 46.1k| explicit DataSource_BERObject(BER_Object&& obj) : m_obj(std::move(obj)) {} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject4readEPhm: 327| 1.76M| size_t read(uint8_t out[], size_t length) override { 328| 1.76M| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 77| 1.76M| do { \ | | 78| 1.76M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.76M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.76M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.76M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.76M] | | ------------------ ------------------ 329| 1.76M| const size_t got = std::min(m_obj.length() - m_offset, length); 330| 1.76M| copy_mem(out, m_obj.bits() + m_offset, got); 331| 1.76M| m_offset += got; 332| 1.76M| return got; 333| 1.76M| } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_120DataSource_BERObject15check_availableEm: 348| 64.0k| bool check_available(size_t n) override { 349| 64.0k| BOTAN_ASSERT_NOMSG(m_offset <= m_obj.length()); ------------------ | | 77| 64.0k| do { \ | | 78| 64.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 64.0k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 64.0k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 64.0k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 64.0k] | | ------------------ ------------------ 350| 64.0k| return (n <= (m_obj.length() - m_offset)); 351| 64.0k| } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject11end_of_dataEv: 353| 57.8k| bool end_of_data() const override { return get_bytes_read() == m_obj.length(); } ber_dec.cpp:_ZNK5Botan12_GLOBAL__N_120DataSource_BERObject14get_bytes_readEv: 355| 57.8k| size_t get_bytes_read() const override { return m_offset; } ber_dec.cpp:_ZN5Botan12_GLOBAL__N_114is_constructedERKNS_10BER_ObjectE: 709| 10.2k|bool is_constructed(const BER_Object& obj) { 710| 10.2k| return is_constructed(obj.class_tag()); 711| 10.2k|} ber_dec.cpp:_ZN5Botan12_GLOBAL__N_125asn1_decode_binary_stringINSt3__19allocatorIhEEEEvRNS2_6vectorIhT_EERKNS_10BER_ObjectENS_9ASN1_TypeESC_NS_10ASN1_ClassEb: 719| 10.3k| bool require_der) { 720| 10.3k| obj.assert_is_a(type_tag, class_tag); 721| | 722| | // DER requires BIT STRING and OCTET STRING to use primitive encoding 723| 10.3k| if(require_der && is_constructed(obj)) { ------------------ | Branch (723:7): [True: 10.2k, False: 37] | Branch (723:22): [True: 0, False: 10.2k] ------------------ 724| 0| throw BER_Decoding_Error("Detected constructed string encoding in DER structure"); 725| 0| } 726| | 727| 10.3k| if(real_type == ASN1_Type::OctetString) { ------------------ | Branch (727:7): [True: 4.16k, False: 6.16k] ------------------ 728| 4.16k| buffer.assign(obj.bits(), obj.bits() + obj.length()); 729| 6.16k| } else { 730| 6.16k| if(obj.length() == 0) { ------------------ | Branch (730:10): [True: 3, False: 6.16k] ------------------ 731| 3| throw BER_Decoding_Error("Invalid BIT STRING"); 732| 3| } 733| | 734| 6.16k| const uint8_t unused_bits = obj.bits()[0]; 735| | 736| 6.16k| if(unused_bits >= 8) { ------------------ | Branch (736:10): [True: 13, False: 6.14k] ------------------ 737| 13| throw BER_Decoding_Error("Bad number of unused bits in BIT STRING"); 738| 13| } 739| | 740| | // Empty BIT STRING with unused bits > 0 ... 741| 6.14k| if(unused_bits > 0 && obj.length() < 2) { ------------------ | Branch (741:10): [True: 1.13k, False: 5.01k] | Branch (741:29): [True: 0, False: 1.13k] ------------------ 742| 0| throw BER_Decoding_Error("Invalid BIT STRING"); 743| 0| } 744| | 745| | // DER requires unused bits in BIT STRING to be zero (X.690 section 11.2.2) 746| 6.14k| if(require_der && unused_bits > 0) { ------------------ | Branch (746:10): [True: 6.11k, False: 37] | Branch (746:25): [True: 1.13k, False: 4.97k] ------------------ 747| 1.13k| const uint8_t last_byte = obj.bits()[obj.length() - 1]; 748| 1.13k| if((last_byte & ((1 << unused_bits) - 1)) != 0) { ------------------ | Branch (748:13): [True: 402, False: 731] ------------------ 749| 402| throw BER_Decoding_Error("Detected non-zero padding bits in BIT STRING in DER structure"); 750| 402| } 751| 1.13k| } 752| | 753| 5.74k| buffer.resize(obj.length() - 1); 754| | 755| 5.74k| if(obj.length() > 1) { ------------------ | Branch (755:10): [True: 5.70k, False: 37] ------------------ 756| 5.70k| copy_mem(buffer.data(), obj.bits() + 1, obj.length() - 1); 757| 5.70k| } 758| 5.74k| } 759| 10.3k|} _ZN5Botan11DER_EncoderC2ERNSt3__16vectorIhNS1_9allocatorIhEEEE: 72| 5.29k|DER_Encoder::DER_Encoder(std::vector& vec) { 73| 5.29k| m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); }; 74| 5.29k|} _ZN5Botan11DER_Encoder12DER_Sequence13push_contentsERS0_: 79| 7.14k|void DER_Encoder::DER_Sequence::push_contents(DER_Encoder& der) { 80| 7.14k| const auto real_class_tag = m_class_tag | ASN1_Class::Constructed; 81| | 82| 7.14k| if(m_type_tag == ASN1_Type::Set && m_class_tag == ASN1_Class::Universal) { ------------------ | Branch (82:7): [True: 0, False: 7.14k] | Branch (82:39): [True: 0, False: 0] ------------------ 83| 0| std::sort(m_set_contents.begin(), m_set_contents.end()); 84| 0| for(const auto& set_elem : m_set_contents) { ------------------ | Branch (84:32): [True: 0, False: 0] ------------------ 85| 0| m_contents += set_elem; 86| 0| } 87| 0| m_set_contents.clear(); 88| 0| } 89| | 90| 7.14k| der.add_object(m_type_tag, real_class_tag, m_contents.data(), m_contents.size()); 91| 7.14k| m_contents.clear(); 92| 7.14k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhm: 97| 6.21k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t data[], size_t length) { 98| 6.21k| if(m_type_tag == ASN1_Type::Set && m_class_tag == ASN1_Class::Universal) { ------------------ | Branch (98:7): [True: 0, False: 6.21k] | Branch (98:39): [True: 0, False: 0] ------------------ 99| 0| m_set_contents.push_back(secure_vector(data, data + length)); 100| 6.21k| } else { 101| 6.21k| m_contents += std::make_pair(data, length); 102| 6.21k| } 103| 6.21k|} _ZN5Botan11DER_Encoder12DER_Sequence9add_bytesEPKhmS3_m: 105| 3.69k|void DER_Encoder::DER_Sequence::add_bytes(const uint8_t hdr[], size_t hdr_len, const uint8_t val[], size_t val_len) { 106| 3.69k| if(m_type_tag == ASN1_Type::Set && m_class_tag == ASN1_Class::Universal) { ------------------ | Branch (106:7): [True: 0, False: 3.69k] | Branch (106:39): [True: 0, False: 0] ------------------ 107| 0| secure_vector m; 108| 0| m.reserve(hdr_len + val_len); 109| 0| m += std::make_pair(hdr, hdr_len); 110| 0| m += std::make_pair(val, val_len); 111| 0| m_set_contents.push_back(std::move(m)); 112| 3.69k| } else { 113| 3.69k| m_contents += std::make_pair(hdr, hdr_len); 114| 3.69k| m_contents += std::make_pair(val, val_len); 115| 3.69k| } 116| 3.69k|} _ZN5Botan11DER_Encoder12DER_SequenceC2ENS_9ASN1_TypeENS_10ASN1_ClassE: 129| 7.14k| m_type_tag(type_tag), m_class_tag(class_tag) {} _ZN5Botan11DER_Encoder10start_consENS_9ASN1_TypeENS_10ASN1_ClassE: 165| 7.14k|DER_Encoder& DER_Encoder::start_cons(ASN1_Type type_tag, ASN1_Class class_tag) { 166| 7.14k| m_subsequences.push_back(DER_Sequence(type_tag, class_tag)); 167| 7.14k| return (*this); 168| 7.14k|} _ZN5Botan11DER_Encoder8end_consEv: 173| 7.14k|DER_Encoder& DER_Encoder::end_cons() { 174| 7.14k| if(m_subsequences.empty()) { ------------------ | Branch (174:7): [True: 0, False: 7.14k] ------------------ 175| 0| throw Invalid_State("DER_Encoder::end_cons: No such sequence"); 176| 0| } 177| | 178| 7.14k| DER_Sequence last_seq = std::move(m_subsequences[m_subsequences.size() - 1]); 179| 7.14k| m_subsequences.pop_back(); 180| 7.14k| last_seq.push_contents(*this); 181| | 182| 7.14k| return (*this); 183| 7.14k|} _ZN5Botan11DER_Encoder9raw_bytesEPKhm: 202| 6.21k|DER_Encoder& DER_Encoder::raw_bytes(const uint8_t bytes[], size_t length) { 203| 6.21k| if(!m_subsequences.empty()) { ------------------ | Branch (203:7): [True: 6.21k, False: 0] ------------------ 204| 6.21k| m_subsequences[m_subsequences.size() - 1].add_bytes(bytes, length); 205| 6.21k| } else if(m_append_output) { ------------------ | Branch (205:14): [True: 0, False: 0] ------------------ 206| 0| m_append_output(bytes, length); 207| 0| } else { 208| 0| m_default_outbuf += std::make_pair(bytes, length); 209| 0| } 210| | 211| 6.21k| return (*this); 212| 6.21k|} _ZN5Botan11DER_Encoder10add_objectENS_9ASN1_TypeENS_10ASN1_ClassEPKhm: 244| 8.99k|DER_Encoder& DER_Encoder::add_object(ASN1_Type type_tag, ASN1_Class class_tag, const uint8_t rep[], size_t length) { 245| 8.99k| std::vector hdr; 246| 8.99k| encode_tag(hdr, type_tag, class_tag); 247| 8.99k| encode_length(hdr, length); 248| | 249| 8.99k| if(!m_subsequences.empty()) { ------------------ | Branch (249:7): [True: 3.69k, False: 5.29k] ------------------ 250| 3.69k| m_subsequences[m_subsequences.size() - 1].add_bytes(hdr.data(), hdr.size(), rep, length); 251| 5.29k| } else if(m_append_output) { ------------------ | Branch (251:14): [True: 5.29k, False: 0] ------------------ 252| 5.29k| m_append_output(hdr.data(), hdr.size()); 253| 5.29k| m_append_output(rep, length); 254| 5.29k| } else { 255| 0| m_default_outbuf += hdr; 256| 0| m_default_outbuf += std::make_pair(rep, length); 257| 0| } 258| | 259| 8.99k| return (*this); 260| 8.99k|} _ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeE: 293| 924|DER_Encoder& DER_Encoder::encode(const uint8_t bytes[], size_t length, ASN1_Type real_type) { 294| 924| return encode(bytes, length, real_type, real_type, ASN1_Class::Universal); 295| 924|} _ZN5Botan11DER_Encoder6encodeEPKhmNS_9ASN1_TypeES3_NS_10ASN1_ClassE: 350| 924| const uint8_t bytes[], size_t length, ASN1_Type real_type, ASN1_Type type_tag, ASN1_Class class_tag) { 351| 924| if(real_type != ASN1_Type::OctetString && real_type != ASN1_Type::BitString) { ------------------ | Branch (351:7): [True: 924, False: 0] | Branch (351:46): [True: 0, False: 924] ------------------ 352| 0| throw Invalid_Argument("DER_Encoder: Invalid tag for byte/bit string"); 353| 0| } 354| | 355| 924| if(real_type == ASN1_Type::BitString) { ------------------ | Branch (355:7): [True: 924, False: 0] ------------------ 356| 924| secure_vector encoded; 357| 924| encoded.push_back(0); 358| 924| encoded += std::make_pair(bytes, length); 359| 924| return add_object(type_tag, class_tag, encoded); 360| 924| } else { 361| 0| return add_object(type_tag, class_tag, bytes, length); 362| 0| } 363| 924|} _ZN5Botan11DER_Encoder6encodeERKNS_11ASN1_ObjectE: 365| 1.85k|DER_Encoder& DER_Encoder::encode(const ASN1_Object& obj) { 366| 1.85k| obj.encode_into(*this); 367| 1.85k| return (*this); 368| 1.85k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_110encode_tagERNSt3__16vectorIhNS1_9allocatorIhEEEENS_9ASN1_TypeENS_10ASN1_ClassE: 25| 8.99k|void encode_tag(std::vector& encoded_tag, ASN1_Type type_tag_e, ASN1_Class class_tag_e) { 26| 8.99k| const uint32_t type_tag = static_cast(type_tag_e); 27| 8.99k| const uint32_t class_tag = static_cast(class_tag_e); 28| | 29| 8.99k| if((class_tag | 0xE0) != 0xE0) { ------------------ | Branch (29:7): [True: 0, False: 8.99k] ------------------ 30| 0| throw Encoding_Error(fmt("DER_Encoder: Invalid class tag {}", std::to_string(class_tag))); 31| 0| } 32| | 33| 8.99k| if(type_tag <= 30) { ------------------ | Branch (33:7): [True: 8.99k, False: 0] ------------------ 34| 8.99k| encoded_tag.push_back(static_cast(type_tag | class_tag)); 35| 8.99k| } else { 36| 0| size_t blocks = high_bit(static_cast(type_tag)) + 6; 37| 0| blocks = (blocks - (blocks % 7)) / 7; 38| | 39| 0| BOTAN_ASSERT_NOMSG(blocks > 0); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 40| | 41| 0| encoded_tag.push_back(static_cast(class_tag | 0x1F)); 42| 0| for(size_t i = 0; i != blocks - 1; ++i) { ------------------ | Branch (42:25): [True: 0, False: 0] ------------------ 43| 0| encoded_tag.push_back(0x80 | ((type_tag >> 7 * (blocks - i - 1)) & 0x7F)); 44| 0| } 45| 0| encoded_tag.push_back(type_tag & 0x7F); 46| 0| } 47| 8.99k|} der_enc.cpp:_ZN5Botan12_GLOBAL__N_113encode_lengthERNSt3__16vectorIhNS1_9allocatorIhEEEEm: 52| 8.99k|void encode_length(std::vector& encoded_length, size_t length) { 53| 8.99k| if(length <= 127) { ------------------ | Branch (53:7): [True: 4.79k, False: 4.19k] ------------------ 54| 4.79k| encoded_length.push_back(static_cast(length)); 55| 4.79k| } else { 56| 4.19k| const size_t bytes_needed = significant_bytes(length); 57| | 58| 4.19k| encoded_length.push_back(static_cast(0x80 | bytes_needed)); 59| | 60| 12.0k| for(size_t i = sizeof(length) - bytes_needed; i < sizeof(length); ++i) { ------------------ | Branch (60:53): [True: 7.83k, False: 4.19k] ------------------ 61| 7.83k| encoded_length.push_back(get_byte_var(i, length)); 62| 7.83k| } 63| 4.19k| } 64| 8.99k|} der_enc.cpp:_ZZN5Botan11DER_EncoderC1ERNSt3__16vectorIhNS1_9allocatorIhEEEEENK3$_0clEPKhm: 73| 10.5k| m_append_output = [&vec](const uint8_t b[], size_t l) { vec.insert(vec.end(), b, b + l); }; _ZN5Botan7OID_MapC2Ev: 11| 1|OID_Map::OID_Map() { 12| 1| m_str2oid = OID_Map::load_str2oid_map(); 13| 1| m_oid2str = OID_Map::load_oid2str_map(); 14| 1|} _ZN5Botan7OID_Map15global_registryEv: 16| 1.89k|OID_Map& OID_Map::global_registry() { 17| 1.89k| static OID_Map g_map; 18| 1.89k| return g_map; 19| 1.89k|} _ZN5Botan7OID_Map7oid2strERKNS_3OIDE: 69| 920|std::string OID_Map::oid2str(const OID& oid) { 70| 920| if(auto name = lookup_static_oid(oid)) { ------------------ | Branch (70:12): [True: 562, False: 358] ------------------ 71| 562| return std::string(*name); 72| 562| } 73| | 74| 358| const lock_guard_type lock(m_mutex); 75| | 76| 358| auto i = m_oid2str.find(oid); 77| 358| if(i != m_oid2str.end()) { ------------------ | Branch (77:7): [True: 0, False: 358] ------------------ 78| 0| return i->second; 79| 0| } 80| | 81| 358| return ""; 82| 358|} _ZN5Botan7OID_Map7str2oidENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 84| 972|OID OID_Map::str2oid(std::string_view str) { 85| 972| if(auto oid = lookup_static_oid_name(str)) { ------------------ | Branch (85:12): [True: 972, False: 0] ------------------ 86| 972| return std::move(*oid); 87| 972| } 88| | 89| 0| const lock_guard_type lock(m_mutex); 90| 0| auto i = m_str2oid.find(std::string(str)); 91| 0| if(i != m_str2oid.end()) { ------------------ | Branch (91:7): [True: 0, False: 0] ------------------ 92| 0| return i->second; 93| 0| } 94| | 95| 0| return OID(); 96| 0|} _ZN5Botan7OID_Map17lookup_static_oidERKNS_3OIDE: 48| 920|std::optional OID_Map::lookup_static_oid(const OID& oid) { 49| 920| const uint32_t hc = static_cast(oid.hash_code() % 858701); 50| | 51| 920| switch(hc) { 52| 1| case 0x01506: ------------------ | Branch (52:7): [True: 1, False: 919] ------------------ 53| 1| return if_match(oid, {1, 2, 840, 10045, 4, 3, 1}, "ECDSA/SHA-224"); 54| 2| case 0x01507: ------------------ | Branch (54:7): [True: 2, False: 918] ------------------ 55| 2| return if_match(oid, {1, 2, 840, 10045, 4, 3, 2}, "ECDSA/SHA-256"); 56| 2| case 0x01508: ------------------ | Branch (56:7): [True: 2, False: 918] ------------------ 57| 2| return if_match(oid, {1, 2, 840, 10045, 4, 3, 3}, "ECDSA/SHA-384"); 58| 3| case 0x01509: ------------------ | Branch (58:7): [True: 3, False: 917] ------------------ 59| 3| return if_match(oid, {1, 2, 840, 10045, 4, 3, 4}, "ECDSA/SHA-512"); 60| 1| case 0x04C1E: ------------------ | Branch (60:7): [True: 1, False: 919] ------------------ 61| 1| 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: 920] ------------------ 63| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}, "OpenPGP.Curve25519"); 64| 1| case 0x0779B: ------------------ | Branch (64:7): [True: 1, False: 919] ------------------ 65| 1| return if_match(oid, {1, 2, 840, 113549, 2, 5}, "MD5"); 66| 3| case 0x0779D: ------------------ | Branch (66:7): [True: 3, False: 917] ------------------ 67| 3| return if_match(oid, {1, 2, 840, 113549, 2, 7}, "HMAC(SHA-1)"); 68| 2| case 0x0779E: ------------------ | Branch (68:7): [True: 2, False: 918] ------------------ 69| 2| return if_match(oid, {1, 2, 840, 113549, 2, 8}, "HMAC(SHA-224)"); 70| 3| case 0x0779F: ------------------ | Branch (70:7): [True: 3, False: 917] ------------------ 71| 3| return if_match(oid, {1, 2, 840, 113549, 2, 9}, "HMAC(SHA-256)"); 72| 3| case 0x077A0: ------------------ | Branch (72:7): [True: 3, False: 917] ------------------ 73| 3| return if_match(oid, {1, 2, 840, 113549, 2, 10}, "HMAC(SHA-384)"); 74| 2| case 0x077A1: ------------------ | Branch (74:7): [True: 2, False: 918] ------------------ 75| 2| return if_match(oid, {1, 2, 840, 113549, 2, 11}, "HMAC(SHA-512)"); 76| 2| case 0x077A3: ------------------ | Branch (76:7): [True: 2, False: 918] ------------------ 77| 2| return if_match(oid, {1, 2, 840, 113549, 2, 13}, "HMAC(SHA-512-256)"); 78| 2| case 0x0785E: ------------------ | Branch (78:7): [True: 2, False: 918] ------------------ 79| 2| return if_match(oid, {1, 2, 840, 113549, 3, 7}, "TripleDES/CBC"); 80| 0| case 0x0C904: ------------------ | Branch (80:7): [True: 0, False: 920] ------------------ 81| 0| return if_match(oid, {1, 0, 14888, 3, 0, 5}, "ECKCDSA"); 82| 0| case 0x11547: ------------------ | Branch (82:7): [True: 0, False: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 87| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}, "SphincsPlus-shake-192s-r3.1"); 88| 2| case 0x1154A: ------------------ | Branch (88:7): [True: 2, False: 918] ------------------ 89| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}, "SphincsPlus-shake-192f-r3.1"); 90| 1| case 0x1154B: ------------------ | Branch (90:7): [True: 1, False: 919] ------------------ 91| 1| 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: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 101| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}, "SphincsPlus-sha2-192f-r3.1"); 102| 2| case 0x1160C: ------------------ | Branch (102:7): [True: 2, False: 918] ------------------ 103| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}, "SphincsPlus-sha2-256s-r3.1"); 104| 2| case 0x1160D: ------------------ | Branch (104:7): [True: 2, False: 918] ------------------ 105| 2| 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: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 111| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}, "SphincsPlus-haraka-192s-r3.1"); 112| 2| case 0x116CC: ------------------ | Branch (112:7): [True: 2, False: 918] ------------------ 113| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}, "SphincsPlus-haraka-192f-r3.1"); 114| 1| case 0x116CD: ------------------ | Branch (114:7): [True: 1, False: 919] ------------------ 115| 1| 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: 920] ------------------ 117| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}, "SphincsPlus-haraka-256f-r3.1"); 118| 1| case 0x1533B: ------------------ | Branch (118:7): [True: 1, False: 919] ------------------ 119| 1| return if_match(oid, {1, 2, 156, 10197, 1, 104, 2}, "SM4/CBC"); 120| 1| case 0x15341: ------------------ | Branch (120:7): [True: 1, False: 919] ------------------ 121| 1| return if_match(oid, {1, 2, 156, 10197, 1, 104, 8}, "SM4/GCM"); 122| 0| case 0x1539D: ------------------ | Branch (122:7): [True: 0, False: 920] ------------------ 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: 920] ------------------ 125| 0| return if_match(oid, {1, 3, 14, 3, 2, 7}, "DES/CBC"); 126| 0| case 0x187EA: ------------------ | Branch (126:7): [True: 0, False: 920] ------------------ 127| 0| return if_match(oid, {1, 3, 14, 3, 2, 26}, "SHA-1"); 128| 1| case 0x19933: ------------------ | Branch (128:7): [True: 1, False: 919] ------------------ 129| 1| return if_match(oid, {1, 3, 132, 0, 8}, "secp160r1"); 130| 0| case 0x19934: ------------------ | Branch (130:7): [True: 0, False: 920] ------------------ 131| 0| return if_match(oid, {1, 3, 132, 0, 9}, "secp160k1"); 132| 2| case 0x19935: ------------------ | Branch (132:7): [True: 2, False: 918] ------------------ 133| 2| return if_match(oid, {1, 3, 132, 0, 10}, "secp256k1"); 134| 1| case 0x19949: ------------------ | Branch (134:7): [True: 1, False: 919] ------------------ 135| 1| return if_match(oid, {1, 3, 132, 0, 30}, "secp160r2"); 136| 2| case 0x1994A: ------------------ | Branch (136:7): [True: 2, False: 918] ------------------ 137| 2| return if_match(oid, {1, 3, 132, 0, 31}, "secp192k1"); 138| 0| case 0x1994B: ------------------ | Branch (138:7): [True: 0, False: 920] ------------------ 139| 0| return if_match(oid, {1, 3, 132, 0, 32}, "secp224k1"); 140| 2| case 0x1994C: ------------------ | Branch (140:7): [True: 2, False: 918] ------------------ 141| 2| return if_match(oid, {1, 3, 132, 0, 33}, "secp224r1"); 142| 2| case 0x1994D: ------------------ | Branch (142:7): [True: 2, False: 918] ------------------ 143| 2| return if_match(oid, {1, 3, 132, 0, 34}, "secp384r1"); 144| 2| case 0x1994E: ------------------ | Branch (144:7): [True: 2, False: 918] ------------------ 145| 2| return if_match(oid, {1, 3, 132, 0, 35}, "secp521r1"); 146| 0| case 0x199F8: ------------------ | Branch (146:7): [True: 0, False: 920] ------------------ 147| 0| return if_match(oid, {1, 3, 132, 1, 12}, "ECDH"); 148| 1| case 0x1E7BF: ------------------ | Branch (148:7): [True: 1, False: 919] ------------------ 149| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 1}, "SM2"); 150| 1| case 0x1E7C0: ------------------ | Branch (150:7): [True: 1, False: 919] ------------------ 151| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 2}, "SM2_Kex"); 152| 1| case 0x1E7C1: ------------------ | Branch (152:7): [True: 1, False: 919] ------------------ 153| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301, 3}, "SM2_Enc"); 154| 0| case 0x21960: ------------------ | Branch (154:7): [True: 0, False: 920] ------------------ 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: 920] ------------------ 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: 920] ------------------ 159| 0| return if_match(oid, {1, 2, 840, 113533, 7, 66, 15}, "KeyWrap.CAST-128"); 160| 2| case 0x227C0: ------------------ | Branch (160:7): [True: 2, False: 918] ------------------ 161| 2| return if_match(oid, {1, 3, 101, 110}, "X25519"); 162| 1| case 0x227C1: ------------------ | Branch (162:7): [True: 1, False: 919] ------------------ 163| 1| return if_match(oid, {1, 3, 101, 111}, "X448"); 164| 1| case 0x227C2: ------------------ | Branch (164:7): [True: 1, False: 919] ------------------ 165| 1| return if_match(oid, {1, 3, 101, 112}, "Ed25519"); 166| 2| case 0x227C3: ------------------ | Branch (166:7): [True: 2, False: 918] ------------------ 167| 2| return if_match(oid, {1, 3, 101, 113}, "Ed448"); 168| 2| case 0x27565: ------------------ | Branch (168:7): [True: 2, False: 918] ------------------ 169| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}, "PKIX.OCSP.BasicResponse"); 170| 1| case 0x27569: ------------------ | Branch (170:7): [True: 1, False: 919] ------------------ 171| 1| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}, "PKIX.OCSP.NoCheck"); 172| 0| case 0x29F7C: ------------------ | Branch (172:7): [True: 0, False: 920] ------------------ 173| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 3}, "ECKCDSA/SHA-1"); 174| 0| case 0x29F7D: ------------------ | Branch (174:7): [True: 0, False: 920] ------------------ 175| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 4}, "ECKCDSA/SHA-224"); 176| 0| case 0x29F7E: ------------------ | Branch (176:7): [True: 0, False: 920] ------------------ 177| 0| return if_match(oid, {1, 2, 410, 200004, 1, 100, 4, 5}, "ECKCDSA/SHA-256"); 178| 0| case 0x2AC3B: ------------------ | Branch (178:7): [True: 0, False: 920] ------------------ 179| 0| return if_match(oid, {2, 5, 29, 32, 0}, "X509v3.AnyPolicy"); 180| 0| case 0x2B000: ------------------ | Branch (180:7): [True: 0, False: 920] ------------------ 181| 0| return if_match(oid, {2, 5, 29, 37, 0}, "X509v3.AnyExtendedKeyUsage"); 182| 57| case 0x2B5C9: ------------------ | Branch (182:7): [True: 57, False: 863] ------------------ 183| 57| return if_match(oid, {1, 2, 840, 10045, 2, 1}, "ECDSA"); 184| 2| case 0x2B74B: ------------------ | Branch (184:7): [True: 2, False: 918] ------------------ 185| 2| return if_match(oid, {1, 2, 840, 10045, 4, 1}, "ECDSA/SHA-1"); 186| 1| case 0x3474A: ------------------ | Branch (186:7): [True: 1, False: 919] ------------------ 187| 1| return if_match(oid, {1, 2, 840, 10046, 2, 1}, "DH"); 188| 2| case 0x38D6D: ------------------ | Branch (188:7): [True: 2, False: 918] ------------------ 189| 2| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 1}, "gost_256A"); 190| 2| case 0x38D6E: ------------------ | Branch (190:7): [True: 2, False: 918] ------------------ 191| 2| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 1, 2}, "gost_256B"); 192| 1| case 0x38E2E: ------------------ | Branch (192:7): [True: 1, False: 919] ------------------ 193| 1| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 1}, "gost_512A"); 194| 2| case 0x38E2F: ------------------ | Branch (194:7): [True: 2, False: 918] ------------------ 195| 2| return if_match(oid, {1, 2, 643, 7, 1, 2, 1, 2, 2}, "gost_512B"); 196| 0| case 0x38F2C: ------------------ | Branch (196:7): [True: 0, False: 920] ------------------ 197| 0| return if_match(oid, {1, 2, 643, 2, 2, 3}, "GOST-34.10/GOST-R-34.11-94"); 198| 0| case 0x38F3C: ------------------ | Branch (198:7): [True: 0, False: 920] ------------------ 199| 0| return if_match(oid, {1, 2, 643, 2, 2, 19}, "GOST-34.10"); 200| 0| case 0x3D7B8: ------------------ | Branch (200:7): [True: 0, False: 920] ------------------ 201| 0| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 6}, "Camellia-128/GCM"); 202| 2| case 0x3D7CC: ------------------ | Branch (202:7): [True: 2, False: 918] ------------------ 203| 2| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 26}, "Camellia-192/GCM"); 204| 2| case 0x3D7E0: ------------------ | Branch (204:7): [True: 2, False: 918] ------------------ 205| 2| return if_match(oid, {0, 3, 4401, 5, 3, 1, 9, 46}, "Camellia-256/GCM"); 206| 0| case 0x3F20F: ------------------ | Branch (206:7): [True: 0, False: 920] ------------------ 207| 0| return if_match(oid, {1, 3, 36, 3, 2, 1}, "RIPEMD-160"); 208| 0| case 0x4266E: ------------------ | Branch (208:7): [True: 0, False: 920] ------------------ 209| 0| return if_match(oid, {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}, "XMSS"); 210| 2| case 0x478C4: ------------------ | Branch (210:7): [True: 2, False: 918] ------------------ 211| 2| return if_match(oid, {1, 2, 410, 200004, 1, 4}, "SEED/CBC"); 212| 1| case 0x47D98: ------------------ | Branch (212:7): [True: 1, False: 919] ------------------ 213| 1| return if_match(oid, {1, 2, 156, 10197, 1, 301}, "sm2p256v1"); 214| 0| case 0x47DFC: ------------------ | Branch (214:7): [True: 0, False: 920] ------------------ 215| 0| return if_match(oid, {1, 2, 156, 10197, 1, 401}, "SM3"); 216| 0| case 0x47E60: ------------------ | Branch (216:7): [True: 0, False: 920] ------------------ 217| 0| return if_match(oid, {1, 2, 156, 10197, 1, 501}, "SM2_Sig/SM3"); 218| 0| case 0x47E63: ------------------ | Branch (218:7): [True: 0, False: 920] ------------------ 219| 0| return if_match(oid, {1, 2, 156, 10197, 1, 504}, "RSA/PKCS1v15(SM3)"); 220| 1| case 0x52B13: ------------------ | Branch (220:7): [True: 1, False: 919] ------------------ 221| 1| return if_match(oid, {1, 2, 643, 3, 131, 1, 1}, "GOST.INN"); 222| 0| case 0x635AE: ------------------ | Branch (222:7): [True: 0, False: 920] ------------------ 223| 0| return if_match(oid, {1, 2, 250, 1, 223, 101, 256, 1}, "frp256v1"); 224| 0| case 0x6A784: ------------------ | Branch (224:7): [True: 0, False: 920] ------------------ 225| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 1}, "PKCS12.KeyBag"); 226| 0| case 0x6A785: ------------------ | Branch (226:7): [True: 0, False: 920] ------------------ 227| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 2}, "PKCS12.PKCS8ShroudedKeyBag"); 228| 0| case 0x6A786: ------------------ | Branch (228:7): [True: 0, False: 920] ------------------ 229| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 3}, "PKCS12.CertBag"); 230| 0| case 0x6A787: ------------------ | Branch (230:7): [True: 0, False: 920] ------------------ 231| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 4}, "PKCS12.CRLBag"); 232| 0| case 0x6A788: ------------------ | Branch (232:7): [True: 0, False: 920] ------------------ 233| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 5}, "PKCS12.SecretBag"); 234| 0| case 0x6A789: ------------------ | Branch (234:7): [True: 0, False: 920] ------------------ 235| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 10, 1, 6}, "PKCS12.SafeContentsBag"); 236| 2| case 0x6EB86: ------------------ | Branch (236:7): [True: 2, False: 918] ------------------ 237| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}, "GOST-34.10-2012-256/SHA-256"); 238| 1| case 0x6EC47: ------------------ | Branch (238:7): [True: 1, False: 919] ------------------ 239| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}, "Kyber-512-r3"); 240| 1| case 0x6EC48: ------------------ | Branch (240:7): [True: 1, False: 919] ------------------ 241| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}, "Kyber-768-r3"); 242| 1| case 0x6EC49: ------------------ | Branch (242:7): [True: 1, False: 919] ------------------ 243| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}, "Kyber-1024-r3"); 244| 2| case 0x6EDC9: ------------------ | Branch (244:7): [True: 2, False: 918] ------------------ 245| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}, "Dilithium-4x4-r3"); 246| 2| case 0x6EDCA: ------------------ | Branch (246:7): [True: 2, False: 918] ------------------ 247| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}, "Dilithium-6x5-r3"); 248| 2| case 0x6EDCB: ------------------ | Branch (248:7): [True: 2, False: 918] ------------------ 249| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}, "Dilithium-8x7-r3"); 250| 2| case 0x6EE8A: ------------------ | Branch (250:7): [True: 2, False: 918] ------------------ 251| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}, "Dilithium-4x4-AES-r3"); 252| 1| case 0x6EE8B: ------------------ | Branch (252:7): [True: 1, False: 919] ------------------ 253| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}, "Dilithium-6x5-AES-r3"); 254| 2| case 0x6EE8C: ------------------ | Branch (254:7): [True: 2, False: 918] ------------------ 255| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}, "Dilithium-8x7-AES-r3"); 256| 2| case 0x6EF4B: ------------------ | Branch (256:7): [True: 2, False: 918] ------------------ 257| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}, "Kyber-512-90s-r3"); 258| 1| case 0x6EF4C: ------------------ | Branch (258:7): [True: 1, False: 919] ------------------ 259| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}, "Kyber-768-90s-r3"); 260| 2| case 0x6EF4D: ------------------ | Branch (260:7): [True: 2, False: 918] ------------------ 261| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}, "Kyber-1024-90s-r3"); 262| 2| case 0x6F18E: ------------------ | Branch (262:7): [True: 2, False: 918] ------------------ 263| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}, "FrodoKEM-640-SHAKE"); 264| 0| case 0x6F18F: ------------------ | Branch (264:7): [True: 0, False: 920] ------------------ 265| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}, "FrodoKEM-976-SHAKE"); 266| 0| case 0x6F190: ------------------ | Branch (266:7): [True: 0, False: 920] ------------------ 267| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}, "FrodoKEM-1344-SHAKE"); 268| 0| case 0x6F24F: ------------------ | Branch (268:7): [True: 0, False: 920] ------------------ 269| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}, "FrodoKEM-640-AES"); 270| 0| case 0x6F250: ------------------ | Branch (270:7): [True: 0, False: 920] ------------------ 271| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}, "FrodoKEM-976-AES"); 272| 0| case 0x6F251: ------------------ | Branch (272:7): [True: 0, False: 920] ------------------ 273| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}, "FrodoKEM-1344-AES"); 274| 1| case 0x6F310: ------------------ | Branch (274:7): [True: 1, False: 919] ------------------ 275| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}, "eFrodoKEM-640-SHAKE"); 276| 0| case 0x6F311: ------------------ | Branch (276:7): [True: 0, False: 920] ------------------ 277| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}, "eFrodoKEM-976-SHAKE"); 278| 1| case 0x6F312: ------------------ | Branch (278:7): [True: 1, False: 919] ------------------ 279| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}, "eFrodoKEM-1344-SHAKE"); 280| 0| case 0x6F3D1: ------------------ | Branch (280:7): [True: 0, False: 920] ------------------ 281| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}, "eFrodoKEM-640-AES"); 282| 0| case 0x6F3D2: ------------------ | Branch (282:7): [True: 0, False: 920] ------------------ 283| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}, "eFrodoKEM-976-AES"); 284| 2| case 0x6F3D3: ------------------ | Branch (284:7): [True: 2, False: 918] ------------------ 285| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}, "eFrodoKEM-1344-AES"); 286| 1| case 0x6F492: ------------------ | Branch (286:7): [True: 1, False: 919] ------------------ 287| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}, "ClassicMcEliece_6688128pc"); 288| 0| case 0x6F493: ------------------ | Branch (288:7): [True: 0, False: 920] ------------------ 289| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}, "ClassicMcEliece_6688128pcf"); 290| 0| case 0x6F494: ------------------ | Branch (290:7): [True: 0, False: 920] ------------------ 291| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}, "ClassicMcEliece_6960119pc"); 292| 2| case 0x6F495: ------------------ | Branch (292:7): [True: 2, False: 918] ------------------ 293| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}, "ClassicMcEliece_6960119pcf"); 294| 2| case 0x6F496: ------------------ | Branch (294:7): [True: 2, False: 918] ------------------ 295| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}, "ClassicMcEliece_8192128pc"); 296| 0| case 0x6F497: ------------------ | Branch (296:7): [True: 0, False: 920] ------------------ 297| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}, "ClassicMcEliece_8192128pcf"); 298| 0| case 0x6F79D: ------------------ | Branch (298:7): [True: 0, False: 920] ------------------ 299| 0| return if_match(oid, {2, 16, 840, 1, 113730, 1, 13}, "Certificate Comment"); 300| 1| case 0x701A0: ------------------ | Branch (300:7): [True: 1, False: 919] ------------------ 301| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 2, 1}, "ECGDSA"); 302| 2| case 0x70322: ------------------ | Branch (302:7): [True: 2, False: 918] ------------------ 303| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 1}, "ECGDSA/RIPEMD-160"); 304| 2| case 0x70323: ------------------ | Branch (304:7): [True: 2, False: 918] ------------------ 305| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 2}, "ECGDSA/SHA-1"); 306| 2| case 0x70324: ------------------ | Branch (306:7): [True: 2, False: 918] ------------------ 307| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 3}, "ECGDSA/SHA-224"); 308| 2| case 0x70325: ------------------ | Branch (308:7): [True: 2, False: 918] ------------------ 309| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 4}, "ECGDSA/SHA-256"); 310| 2| case 0x70326: ------------------ | Branch (310:7): [True: 2, False: 918] ------------------ 311| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 5}, "ECGDSA/SHA-384"); 312| 2| case 0x70327: ------------------ | Branch (312:7): [True: 2, False: 918] ------------------ 313| 2| return if_match(oid, {1, 3, 36, 3, 3, 2, 5, 4, 6}, "ECGDSA/SHA-512"); 314| 0| case 0x72B21: ------------------ | Branch (314:7): [True: 0, False: 920] ------------------ 315| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 1}, "GOST-34.10-2012-256"); 316| 0| case 0x72B22: ------------------ | Branch (316:7): [True: 0, False: 920] ------------------ 317| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 1, 2}, "GOST-34.10-2012-512"); 318| 0| case 0x72BE3: ------------------ | Branch (318:7): [True: 0, False: 920] ------------------ 319| 0| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 2}, "Streebog-256"); 320| 2| case 0x72BE4: ------------------ | Branch (320:7): [True: 2, False: 918] ------------------ 321| 2| return if_match(oid, {1, 2, 643, 7, 1, 1, 2, 3}, "Streebog-512"); 322| 2| case 0x72CA4: ------------------ | Branch (322:7): [True: 2, False: 918] ------------------ 323| 2| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 2}, "GOST-34.10-2012-256/Streebog-256"); 324| 1| case 0x72CA5: ------------------ | Branch (324:7): [True: 1, False: 919] ------------------ 325| 1| return if_match(oid, {1, 2, 643, 7, 1, 1, 3, 3}, "GOST-34.10-2012-512/Streebog-512"); 326| 0| case 0x7C7C7: ------------------ | Branch (326:7): [True: 0, False: 920] ------------------ 327| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 1}, "PKCS9.X509Certificate"); 328| 0| case 0x7C7C8: ------------------ | Branch (328:7): [True: 0, False: 920] ------------------ 329| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 22, 2}, "PKCS9.SDSICertificate"); 330| 0| case 0x7C888: ------------------ | Branch (330:7): [True: 0, False: 920] ------------------ 331| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 23, 1}, "PKCS9.X509CRL"); 332| 3| case 0x7E10F: ------------------ | Branch (332:7): [True: 3, False: 917] ------------------ 333| 3| return if_match(oid, {2, 5, 4, 3}, "X520.CommonName"); 334| 3| case 0x7E110: ------------------ | Branch (334:7): [True: 3, False: 917] ------------------ 335| 3| return if_match(oid, {2, 5, 4, 4}, "X520.Surname"); 336| 3| case 0x7E111: ------------------ | Branch (336:7): [True: 3, False: 917] ------------------ 337| 3| return if_match(oid, {2, 5, 4, 5}, "X520.SerialNumber"); 338| 2| case 0x7E112: ------------------ | Branch (338:7): [True: 2, False: 918] ------------------ 339| 2| return if_match(oid, {2, 5, 4, 6}, "X520.Country"); 340| 3| case 0x7E113: ------------------ | Branch (340:7): [True: 3, False: 917] ------------------ 341| 3| return if_match(oid, {2, 5, 4, 7}, "X520.Locality"); 342| 2| case 0x7E114: ------------------ | Branch (342:7): [True: 2, False: 918] ------------------ 343| 2| return if_match(oid, {2, 5, 4, 8}, "X520.State"); 344| 3| case 0x7E115: ------------------ | Branch (344:7): [True: 3, False: 917] ------------------ 345| 3| return if_match(oid, {2, 5, 4, 9}, "X520.StreetAddress"); 346| 4| case 0x7E116: ------------------ | Branch (346:7): [True: 4, False: 916] ------------------ 347| 4| return if_match(oid, {2, 5, 4, 10}, "X520.Organization"); 348| 2| case 0x7E117: ------------------ | Branch (348:7): [True: 2, False: 918] ------------------ 349| 2| return if_match(oid, {2, 5, 4, 11}, "X520.OrganizationalUnit"); 350| 3| case 0x7E118: ------------------ | Branch (350:7): [True: 3, False: 917] ------------------ 351| 3| return if_match(oid, {2, 5, 4, 12}, "X520.Title"); 352| 2| case 0x7E136: ------------------ | Branch (352:7): [True: 2, False: 918] ------------------ 353| 2| return if_match(oid, {2, 5, 4, 42}, "X520.GivenName"); 354| 2| case 0x7E137: ------------------ | Branch (354:7): [True: 2, False: 918] ------------------ 355| 2| return if_match(oid, {2, 5, 4, 43}, "X520.Initials"); 356| 2| case 0x7E138: ------------------ | Branch (356:7): [True: 2, False: 918] ------------------ 357| 2| return if_match(oid, {2, 5, 4, 44}, "X520.GenerationalQualifier"); 358| 3| case 0x7E13A: ------------------ | Branch (358:7): [True: 3, False: 917] ------------------ 359| 3| return if_match(oid, {2, 5, 4, 46}, "X520.DNQualifier"); 360| 2| case 0x7E14D: ------------------ | Branch (360:7): [True: 2, False: 918] ------------------ 361| 2| return if_match(oid, {2, 5, 4, 65}, "X520.Pseudonym"); 362| 0| case 0x7F3F3: ------------------ | Branch (362:7): [True: 0, False: 920] ------------------ 363| 0| return if_match(oid, {2, 5, 29, 14}, "X509v3.SubjectKeyIdentifier"); 364| 2| case 0x7F3F4: ------------------ | Branch (364:7): [True: 2, False: 918] ------------------ 365| 2| return if_match(oid, {2, 5, 29, 15}, "X509v3.KeyUsage"); 366| 2| case 0x7F3F5: ------------------ | Branch (366:7): [True: 2, False: 918] ------------------ 367| 2| return if_match(oid, {2, 5, 29, 16}, "X509v3.PrivateKeyUsagePeriod"); 368| 2| case 0x7F3F6: ------------------ | Branch (368:7): [True: 2, False: 918] ------------------ 369| 2| return if_match(oid, {2, 5, 29, 17}, "X509v3.SubjectAlternativeName"); 370| 1| case 0x7F3F7: ------------------ | Branch (370:7): [True: 1, False: 919] ------------------ 371| 1| return if_match(oid, {2, 5, 29, 18}, "X509v3.IssuerAlternativeName"); 372| 2| case 0x7F3F8: ------------------ | Branch (372:7): [True: 2, False: 918] ------------------ 373| 2| return if_match(oid, {2, 5, 29, 19}, "X509v3.BasicConstraints"); 374| 2| case 0x7F3F9: ------------------ | Branch (374:7): [True: 2, False: 918] ------------------ 375| 2| return if_match(oid, {2, 5, 29, 20}, "X509v3.CRLNumber"); 376| 4| case 0x7F3FA: ------------------ | Branch (376:7): [True: 4, False: 916] ------------------ 377| 4| return if_match(oid, {2, 5, 29, 21}, "X509v3.ReasonCode"); 378| 4| case 0x7F3FC: ------------------ | Branch (378:7): [True: 4, False: 916] ------------------ 379| 4| return if_match(oid, {2, 5, 29, 23}, "X509v3.HoldInstructionCode"); 380| 3| case 0x7F3FD: ------------------ | Branch (380:7): [True: 3, False: 917] ------------------ 381| 3| return if_match(oid, {2, 5, 29, 24}, "X509v3.InvalidityDate"); 382| 1| case 0x7F401: ------------------ | Branch (382:7): [True: 1, False: 919] ------------------ 383| 1| return if_match(oid, {2, 5, 29, 28}, "X509v3.CRLIssuingDistributionPoint"); 384| 2| case 0x7F403: ------------------ | Branch (384:7): [True: 2, False: 918] ------------------ 385| 2| return if_match(oid, {2, 5, 29, 30}, "X509v3.NameConstraints"); 386| 4| case 0x7F404: ------------------ | Branch (386:7): [True: 4, False: 916] ------------------ 387| 4| return if_match(oid, {2, 5, 29, 31}, "X509v3.CRLDistributionPoints"); 388| 3| case 0x7F405: ------------------ | Branch (388:7): [True: 3, False: 917] ------------------ 389| 3| return if_match(oid, {2, 5, 29, 32}, "X509v3.CertificatePolicies"); 390| 2| case 0x7F408: ------------------ | Branch (390:7): [True: 2, False: 918] ------------------ 391| 2| return if_match(oid, {2, 5, 29, 35}, "X509v3.AuthorityKeyIdentifier"); 392| 1| case 0x7F409: ------------------ | Branch (392:7): [True: 1, False: 919] ------------------ 393| 1| return if_match(oid, {2, 5, 29, 36}, "X509v3.PolicyConstraints"); 394| 0| case 0x7F40A: ------------------ | Branch (394:7): [True: 0, False: 920] ------------------ 395| 0| return if_match(oid, {2, 5, 29, 37}, "X509v3.ExtendedKeyUsage"); 396| 0| case 0x7F41D: ------------------ | Branch (396:7): [True: 0, False: 920] ------------------ 397| 0| return if_match(oid, {2, 5, 29, 56}, "X509v3.NoRevocationAvailable"); 398| 1| case 0x80B84: ------------------ | Branch (398:7): [True: 1, False: 919] ------------------ 399| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}, "AES-128/OCB"); 400| 2| case 0x80B85: ------------------ | Branch (400:7): [True: 2, False: 918] ------------------ 401| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}, "AES-192/OCB"); 402| 2| case 0x80B86: ------------------ | Branch (402:7): [True: 2, False: 918] ------------------ 403| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}, "AES-256/OCB"); 404| 2| case 0x80B87: ------------------ | Branch (404:7): [True: 2, False: 918] ------------------ 405| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}, "Serpent/OCB"); 406| 2| case 0x80B88: ------------------ | Branch (406:7): [True: 2, False: 918] ------------------ 407| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}, "Twofish/OCB"); 408| 1| case 0x80B89: ------------------ | Branch (408:7): [True: 1, False: 919] ------------------ 409| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}, "Camellia-128/OCB"); 410| 2| case 0x80B8A: ------------------ | Branch (410:7): [True: 2, False: 918] ------------------ 411| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}, "Camellia-192/OCB"); 412| 1| case 0x80B8B: ------------------ | Branch (412:7): [True: 1, False: 919] ------------------ 413| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}, "Camellia-256/OCB"); 414| 1| case 0x80D06: ------------------ | Branch (414:7): [True: 1, False: 919] ------------------ 415| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}, "AES-128/SIV"); 416| 2| case 0x80D07: ------------------ | Branch (416:7): [True: 2, False: 918] ------------------ 417| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}, "AES-192/SIV"); 418| 1| case 0x80D08: ------------------ | Branch (418:7): [True: 1, False: 919] ------------------ 419| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}, "AES-256/SIV"); 420| 1| case 0x80D09: ------------------ | Branch (420:7): [True: 1, False: 919] ------------------ 421| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}, "Serpent/SIV"); 422| 2| case 0x80D0A: ------------------ | Branch (422:7): [True: 2, False: 918] ------------------ 423| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}, "Twofish/SIV"); 424| 1| case 0x80D0B: ------------------ | Branch (424:7): [True: 1, False: 919] ------------------ 425| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}, "Camellia-128/SIV"); 426| 2| case 0x80D0C: ------------------ | Branch (426:7): [True: 2, False: 918] ------------------ 427| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}, "Camellia-192/SIV"); 428| 2| case 0x80D0D: ------------------ | Branch (428:7): [True: 2, False: 918] ------------------ 429| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}, "Camellia-256/SIV"); 430| 3| case 0x80D0E: ------------------ | Branch (430:7): [True: 3, False: 917] ------------------ 431| 3| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}, "SM4/SIV"); 432| 0| case 0x84C6A: ------------------ | Branch (432:7): [True: 0, False: 920] ------------------ 433| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 2}, "Camellia-128/CBC"); 434| 0| case 0x84C6B: ------------------ | Branch (434:7): [True: 0, False: 920] ------------------ 435| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 3}, "Camellia-192/CBC"); 436| 0| case 0x84C6C: ------------------ | Branch (436:7): [True: 0, False: 920] ------------------ 437| 0| return if_match(oid, {1, 2, 392, 200011, 61, 1, 1, 1, 4}, "Camellia-256/CBC"); 438| 2| case 0x88CD3: ------------------ | Branch (438:7): [True: 2, False: 918] ------------------ 439| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 6}, "KeyWrap.TripleDES"); 440| 1| case 0x88CD5: ------------------ | Branch (440:7): [True: 1, False: 919] ------------------ 441| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 8}, "Compression.Zlib"); 442| 2| case 0x88CDE: ------------------ | Branch (442:7): [True: 2, False: 918] ------------------ 443| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 17}, "HSS-LMS"); 444| 1| case 0x88CDF: ------------------ | Branch (444:7): [True: 1, False: 919] ------------------ 445| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 16, 3, 18}, "ChaCha20Poly1305"); 446| 0| case 0x92296: ------------------ | Branch (446:7): [True: 0, False: 920] ------------------ 447| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 2}, "AES-128/CBC"); 448| 0| case 0x92299: ------------------ | Branch (448:7): [True: 0, False: 920] ------------------ 449| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 5}, "KeyWrap.AES-128"); 450| 0| case 0x9229A: ------------------ | Branch (450:7): [True: 0, False: 920] ------------------ 451| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 6}, "AES-128/GCM"); 452| 0| case 0x9229B: ------------------ | Branch (452:7): [True: 0, False: 920] ------------------ 453| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 7}, "AES-128/CCM"); 454| 0| case 0x922AA: ------------------ | Branch (454:7): [True: 0, False: 920] ------------------ 455| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 22}, "AES-192/CBC"); 456| 0| case 0x922AD: ------------------ | Branch (456:7): [True: 0, False: 920] ------------------ 457| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 25}, "KeyWrap.AES-192"); 458| 0| case 0x922AE: ------------------ | Branch (458:7): [True: 0, False: 920] ------------------ 459| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 26}, "AES-192/GCM"); 460| 0| case 0x922AF: ------------------ | Branch (460:7): [True: 0, False: 920] ------------------ 461| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 27}, "AES-192/CCM"); 462| 0| case 0x922BE: ------------------ | Branch (462:7): [True: 0, False: 920] ------------------ 463| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 42}, "AES-256/CBC"); 464| 0| case 0x922C1: ------------------ | Branch (464:7): [True: 0, False: 920] ------------------ 465| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 45}, "KeyWrap.AES-256"); 466| 1| case 0x922C2: ------------------ | Branch (466:7): [True: 1, False: 919] ------------------ 467| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 46}, "AES-256/GCM"); 468| 1| case 0x922C3: ------------------ | Branch (468:7): [True: 1, False: 919] ------------------ 469| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 1, 47}, "AES-256/CCM"); 470| 0| case 0x92356: ------------------ | Branch (470:7): [True: 0, False: 920] ------------------ 471| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 1}, "SHA-256"); 472| 0| case 0x92357: ------------------ | Branch (472:7): [True: 0, False: 920] ------------------ 473| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 2}, "SHA-384"); 474| 1| case 0x92358: ------------------ | Branch (474:7): [True: 1, False: 919] ------------------ 475| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 3}, "SHA-512"); 476| 2| case 0x92359: ------------------ | Branch (476:7): [True: 2, False: 918] ------------------ 477| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 4}, "SHA-224"); 478| 0| case 0x9235B: ------------------ | Branch (478:7): [True: 0, False: 920] ------------------ 479| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 6}, "SHA-512-256"); 480| 2| case 0x9235C: ------------------ | Branch (480:7): [True: 2, False: 918] ------------------ 481| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 7}, "SHA-3(224)"); 482| 1| case 0x9235D: ------------------ | Branch (482:7): [True: 1, False: 919] ------------------ 483| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 8}, "SHA-3(256)"); 484| 1| case 0x9235E: ------------------ | Branch (484:7): [True: 1, False: 919] ------------------ 485| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 9}, "SHA-3(384)"); 486| 0| case 0x9235F: ------------------ | Branch (486:7): [True: 0, False: 920] ------------------ 487| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 10}, "SHA-3(512)"); 488| 0| case 0x92360: ------------------ | Branch (488:7): [True: 0, False: 920] ------------------ 489| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 11}, "SHAKE-128"); 490| 1| case 0x92361: ------------------ | Branch (490:7): [True: 1, False: 919] ------------------ 491| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 2, 12}, "SHAKE-256"); 492| 0| case 0x92417: ------------------ | Branch (492:7): [True: 0, False: 920] ------------------ 493| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 1}, "DSA/SHA-224"); 494| 0| case 0x92418: ------------------ | Branch (494:7): [True: 0, False: 920] ------------------ 495| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 2}, "DSA/SHA-256"); 496| 0| case 0x92419: ------------------ | Branch (496:7): [True: 0, False: 920] ------------------ 497| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 3}, "DSA/SHA-384"); 498| 0| case 0x9241A: ------------------ | Branch (498:7): [True: 0, False: 920] ------------------ 499| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 4}, "DSA/SHA-512"); 500| 0| case 0x9241B: ------------------ | Branch (500:7): [True: 0, False: 920] ------------------ 501| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 5}, "DSA/SHA-3(224)"); 502| 0| case 0x9241C: ------------------ | Branch (502:7): [True: 0, False: 920] ------------------ 503| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 6}, "DSA/SHA-3(256)"); 504| 0| case 0x9241D: ------------------ | Branch (504:7): [True: 0, False: 920] ------------------ 505| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 7}, "DSA/SHA-3(384)"); 506| 2| case 0x9241E: ------------------ | Branch (506:7): [True: 2, False: 918] ------------------ 507| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 8}, "DSA/SHA-3(512)"); 508| 1| case 0x9241F: ------------------ | Branch (508:7): [True: 1, False: 919] ------------------ 509| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 9}, "ECDSA/SHA-3(224)"); 510| 0| case 0x92420: ------------------ | Branch (510:7): [True: 0, False: 920] ------------------ 511| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 10}, "ECDSA/SHA-3(256)"); 512| 1| case 0x92421: ------------------ | Branch (512:7): [True: 1, False: 919] ------------------ 513| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 11}, "ECDSA/SHA-3(384)"); 514| 2| case 0x92422: ------------------ | Branch (514:7): [True: 2, False: 918] ------------------ 515| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 12}, "ECDSA/SHA-3(512)"); 516| 2| case 0x92423: ------------------ | Branch (516:7): [True: 2, False: 918] ------------------ 517| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 13}, "RSA/PKCS1v15(SHA-3(224))"); 518| 2| case 0x92424: ------------------ | Branch (518:7): [True: 2, False: 918] ------------------ 519| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 14}, "RSA/PKCS1v15(SHA-3(256))"); 520| 1| case 0x92425: ------------------ | Branch (520:7): [True: 1, False: 919] ------------------ 521| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 15}, "RSA/PKCS1v15(SHA-3(384))"); 522| 2| case 0x92426: ------------------ | Branch (522:7): [True: 2, False: 918] ------------------ 523| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 16}, "RSA/PKCS1v15(SHA-3(512))"); 524| 2| case 0x92427: ------------------ | Branch (524:7): [True: 2, False: 918] ------------------ 525| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 17}, "ML-DSA-4x4"); 526| 1| case 0x92428: ------------------ | Branch (526:7): [True: 1, False: 919] ------------------ 527| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 18}, "ML-DSA-6x5"); 528| 1| case 0x92429: ------------------ | Branch (528:7): [True: 1, False: 919] ------------------ 529| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 19}, "ML-DSA-8x7"); 530| 2| case 0x9242A: ------------------ | Branch (530:7): [True: 2, False: 918] ------------------ 531| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 20}, "SLH-DSA-SHA2-128s"); 532| 0| case 0x9242B: ------------------ | Branch (532:7): [True: 0, False: 920] ------------------ 533| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 21}, "SLH-DSA-SHA2-128f"); 534| 0| case 0x9242C: ------------------ | Branch (534:7): [True: 0, False: 920] ------------------ 535| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 22}, "SLH-DSA-SHA2-192s"); 536| 0| case 0x9242D: ------------------ | Branch (536:7): [True: 0, False: 920] ------------------ 537| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 23}, "SLH-DSA-SHA2-192f"); 538| 0| case 0x9242E: ------------------ | Branch (538:7): [True: 0, False: 920] ------------------ 539| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 24}, "SLH-DSA-SHA2-256s"); 540| 0| case 0x9242F: ------------------ | Branch (540:7): [True: 0, False: 920] ------------------ 541| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 25}, "SLH-DSA-SHA2-256f"); 542| 0| case 0x92430: ------------------ | Branch (542:7): [True: 0, False: 920] ------------------ 543| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 26}, "SLH-DSA-SHAKE-128s"); 544| 1| case 0x92431: ------------------ | Branch (544:7): [True: 1, False: 919] ------------------ 545| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 27}, "SLH-DSA-SHAKE-128f"); 546| 2| case 0x92432: ------------------ | Branch (546:7): [True: 2, False: 918] ------------------ 547| 2| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 28}, "SLH-DSA-SHAKE-192s"); 548| 1| case 0x92433: ------------------ | Branch (548:7): [True: 1, False: 919] ------------------ 549| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 29}, "SLH-DSA-SHAKE-192f"); 550| 0| case 0x92434: ------------------ | Branch (550:7): [True: 0, False: 920] ------------------ 551| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 30}, "SLH-DSA-SHAKE-256s"); 552| 1| case 0x92435: ------------------ | Branch (552:7): [True: 1, False: 919] ------------------ 553| 1| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 3, 31}, "SLH-DSA-SHAKE-256f"); 554| 0| case 0x924D8: ------------------ | Branch (554:7): [True: 0, False: 920] ------------------ 555| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 1}, "ML-KEM-512"); 556| 0| case 0x924D9: ------------------ | Branch (556:7): [True: 0, False: 920] ------------------ 557| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 2}, "ML-KEM-768"); 558| 0| case 0x924DA: ------------------ | Branch (558:7): [True: 0, False: 920] ------------------ 559| 0| return if_match(oid, {2, 16, 840, 1, 101, 3, 4, 4, 3}, "ML-KEM-1024"); 560| 4| case 0x9479F: ------------------ | Branch (560:7): [True: 4, False: 916] ------------------ 561| 4| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 1}, "PKIX.AuthorityInformationAccess"); 562| 3| case 0x947A5: ------------------ | Branch (562:7): [True: 3, False: 917] ------------------ 563| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 7}, "PKIX.IpAddrBlocks"); 564| 3| case 0x947A6: ------------------ | Branch (564:7): [True: 3, False: 917] ------------------ 565| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 8}, "PKIX.AutonomousSysIds"); 566| 0| case 0x947B8: ------------------ | Branch (566:7): [True: 0, False: 920] ------------------ 567| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 1, 26}, "PKIX.TNAuthList"); 568| 3| case 0x94921: ------------------ | Branch (568:7): [True: 3, False: 917] ------------------ 569| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 1}, "PKIX.ServerAuth"); 570| 2| case 0x94922: ------------------ | Branch (570:7): [True: 2, False: 918] ------------------ 571| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 2}, "PKIX.ClientAuth"); 572| 3| case 0x94923: ------------------ | Branch (572:7): [True: 3, False: 917] ------------------ 573| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 3}, "PKIX.CodeSigning"); 574| 3| case 0x94924: ------------------ | Branch (574:7): [True: 3, False: 917] ------------------ 575| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 4}, "PKIX.EmailProtection"); 576| 2| case 0x94925: ------------------ | Branch (576:7): [True: 2, False: 918] ------------------ 577| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 5}, "PKIX.IPsecEndSystem"); 578| 3| case 0x94926: ------------------ | Branch (578:7): [True: 3, False: 917] ------------------ 579| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 6}, "PKIX.IPsecTunnel"); 580| 3| case 0x94927: ------------------ | Branch (580:7): [True: 3, False: 917] ------------------ 581| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 7}, "PKIX.IPsecUser"); 582| 3| case 0x94928: ------------------ | Branch (582:7): [True: 3, False: 917] ------------------ 583| 3| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 8}, "PKIX.TimeStamping"); 584| 2| case 0x94929: ------------------ | Branch (584:7): [True: 2, False: 918] ------------------ 585| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 3, 9}, "PKIX.OCSPSigning"); 586| 2| case 0x94CEA: ------------------ | Branch (586:7): [True: 2, False: 918] ------------------ 587| 2| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 8, 5}, "PKIX.XMPPAddr"); 588| 0| case 0x954DB: ------------------ | Branch (588:7): [True: 0, False: 920] ------------------ 589| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}, "Microsoft SmartcardLogon"); 590| 0| case 0x954DC: ------------------ | Branch (590:7): [True: 0, False: 920] ------------------ 591| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}, "Microsoft UPN"); 592| 0| case 0x96B0E: ------------------ | Branch (592:7): [True: 0, False: 920] ------------------ 593| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 1}, "PKIX.OCSP"); 594| 0| case 0x96B0F: ------------------ | Branch (594:7): [True: 0, False: 920] ------------------ 595| 0| return if_match(oid, {1, 3, 6, 1, 5, 5, 7, 48, 2}, "PKIX.CertificateAuthorityIssuers"); 596| 0| case 0x96C77: ------------------ | Branch (596:7): [True: 0, False: 920] ------------------ 597| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 3}, "PBE-SHA1-3DES"); 598| 0| case 0x96C78: ------------------ | Branch (598:7): [True: 0, False: 920] ------------------ 599| 0| return if_match(oid, {1, 2, 840, 113549, 1, 12, 1, 4}, "PBE-SHA1-2DES"); 600| 0| case 0x9A008: ------------------ | Branch (600:7): [True: 0, False: 920] ------------------ 601| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}, "brainpool160r1"); 602| 0| case 0x9A00A: ------------------ | Branch (602:7): [True: 0, False: 920] ------------------ 603| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}, "brainpool192r1"); 604| 0| case 0x9A00C: ------------------ | Branch (604:7): [True: 0, False: 920] ------------------ 605| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 5}, "brainpool224r1"); 606| 0| case 0x9A00E: ------------------ | Branch (606:7): [True: 0, False: 920] ------------------ 607| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}, "brainpool256r1"); 608| 0| case 0x9A010: ------------------ | Branch (608:7): [True: 0, False: 920] ------------------ 609| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 9}, "brainpool320r1"); 610| 1| case 0x9A012: ------------------ | Branch (610:7): [True: 1, False: 919] ------------------ 611| 1| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 11}, "brainpool384r1"); 612| 0| case 0x9A014: ------------------ | Branch (612:7): [True: 0, False: 920] ------------------ 613| 0| return if_match(oid, {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}, "brainpool512r1"); 614| 1| case 0xA0D61: ------------------ | Branch (614:7): [True: 1, False: 919] ------------------ 615| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 3}, "McEliece"); 616| 1| case 0xA0D63: ------------------ | Branch (616:7): [True: 1, False: 919] ------------------ 617| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 5}, "XMSS-draft6"); 618| 1| case 0xA0D66: ------------------ | Branch (618:7): [True: 1, False: 919] ------------------ 619| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 8}, "XMSS-draft12"); 620| 2| case 0xA0D6B: ------------------ | Branch (620:7): [True: 2, False: 918] ------------------ 621| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 1, 13}, "HSS-LMS-Private-Key"); 622| 0| case 0xA0EE1: ------------------ | Branch (622:7): [True: 0, False: 920] ------------------ 623| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 1}, "Serpent/CBC"); 624| 0| case 0xA0EE2: ------------------ | Branch (624:7): [True: 0, False: 920] ------------------ 625| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 2}, "Threefish-512/CBC"); 626| 0| case 0xA0EE3: ------------------ | Branch (626:7): [True: 0, False: 920] ------------------ 627| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 3}, "Twofish/CBC"); 628| 0| case 0xA0F45: ------------------ | Branch (628:7): [True: 0, False: 920] ------------------ 629| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 101}, "Serpent/GCM"); 630| 0| case 0xA0F46: ------------------ | Branch (630:7): [True: 0, False: 920] ------------------ 631| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 3, 102}, "Twofish/GCM"); 632| 1| case 0xA0FA2: ------------------ | Branch (632:7): [True: 1, False: 919] ------------------ 633| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 1}, "numsp256d1"); 634| 2| case 0xA0FA3: ------------------ | Branch (634:7): [True: 2, False: 918] ------------------ 635| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 2}, "numsp384d1"); 636| 2| case 0xA0FA4: ------------------ | Branch (636:7): [True: 2, False: 918] ------------------ 637| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 25258, 4, 3}, "numsp512d1"); 638| 0| case 0xA244B: ------------------ | Branch (638:7): [True: 0, False: 920] ------------------ 639| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}, "ClassicMcEliece_348864"); 640| 0| case 0xA244C: ------------------ | Branch (640:7): [True: 0, False: 920] ------------------ 641| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}, "ClassicMcEliece_348864f"); 642| 0| case 0xA244D: ------------------ | Branch (642:7): [True: 0, False: 920] ------------------ 643| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}, "ClassicMcEliece_460896"); 644| 0| case 0xA244E: ------------------ | Branch (644:7): [True: 0, False: 920] ------------------ 645| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}, "ClassicMcEliece_460896f"); 646| 0| case 0xA244F: ------------------ | Branch (646:7): [True: 0, False: 920] ------------------ 647| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}, "ClassicMcEliece_6688128"); 648| 0| case 0xA2450: ------------------ | Branch (648:7): [True: 0, False: 920] ------------------ 649| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}, "ClassicMcEliece_6688128f"); 650| 0| case 0xA2451: ------------------ | Branch (650:7): [True: 0, False: 920] ------------------ 651| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}, "ClassicMcEliece_6960119"); 652| 0| case 0xA2452: ------------------ | Branch (652:7): [True: 0, False: 920] ------------------ 653| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}, "ClassicMcEliece_6960119f"); 654| 1| case 0xA2453: ------------------ | Branch (654:7): [True: 1, False: 919] ------------------ 655| 1| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}, "ClassicMcEliece_8192128"); 656| 2| case 0xA2454: ------------------ | Branch (656:7): [True: 2, False: 918] ------------------ 657| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}, "ClassicMcEliece_8192128f"); 658| 398| case 0xAF989: ------------------ | Branch (658:7): [True: 398, False: 522] ------------------ 659| 398| return if_match(oid, {1, 2, 840, 113549, 1, 1, 1}, "RSA"); 660| 1| case 0xAF98A: ------------------ | Branch (660:7): [True: 1, False: 919] ------------------ 661| 1| return if_match(oid, {1, 2, 840, 113549, 1, 1, 2}, "RSA/PKCS1v15(MD2)"); 662| 2| case 0xAF98C: ------------------ | Branch (662:7): [True: 2, False: 918] ------------------ 663| 2| return if_match(oid, {1, 2, 840, 113549, 1, 1, 4}, "RSA/PKCS1v15(MD5)"); 664| 15| case 0xAF98D: ------------------ | Branch (664:7): [True: 15, False: 905] ------------------ 665| 15| return if_match(oid, {1, 2, 840, 113549, 1, 1, 5}, "RSA/PKCS1v15(SHA-1)"); 666| 2| case 0xAF98F: ------------------ | Branch (666:7): [True: 2, False: 918] ------------------ 667| 2| return if_match(oid, {1, 2, 840, 113549, 1, 1, 7}, "RSA/OAEP"); 668| 1| case 0xAF990: ------------------ | Branch (668:7): [True: 1, False: 919] ------------------ 669| 1| return if_match(oid, {1, 2, 840, 113549, 1, 1, 8}, "MGF1"); 670| 8| case 0xAF992: ------------------ | Branch (670:7): [True: 8, False: 912] ------------------ 671| 8| return if_match(oid, {1, 2, 840, 113549, 1, 1, 10}, "RSA/PSS"); 672| 2| case 0xAF993: ------------------ | Branch (672:7): [True: 2, False: 918] ------------------ 673| 2| return if_match(oid, {1, 2, 840, 113549, 1, 1, 11}, "RSA/PKCS1v15(SHA-256)"); 674| 2| case 0xAF994: ------------------ | Branch (674:7): [True: 2, False: 918] ------------------ 675| 2| return if_match(oid, {1, 2, 840, 113549, 1, 1, 12}, "RSA/PKCS1v15(SHA-384)"); 676| 1| case 0xAF995: ------------------ | Branch (676:7): [True: 1, False: 919] ------------------ 677| 1| return if_match(oid, {1, 2, 840, 113549, 1, 1, 13}, "RSA/PKCS1v15(SHA-512)"); 678| 2| case 0xAF996: ------------------ | Branch (678:7): [True: 2, False: 918] ------------------ 679| 2| return if_match(oid, {1, 2, 840, 113549, 1, 1, 14}, "RSA/PKCS1v15(SHA-224)"); 680| 3| case 0xAF998: ------------------ | Branch (680:7): [True: 3, False: 917] ------------------ 681| 3| return if_match(oid, {1, 2, 840, 113549, 1, 1, 16}, "RSA/PKCS1v15(SHA-512-256)"); 682| 4| case 0xAFC98: ------------------ | Branch (682:7): [True: 4, False: 916] ------------------ 683| 4| return if_match(oid, {1, 2, 840, 113549, 1, 5, 12}, "PKCS5.PBKDF2"); 684| 2| case 0xAFC99: ------------------ | Branch (684:7): [True: 2, False: 918] ------------------ 685| 2| return if_match(oid, {1, 2, 840, 113549, 1, 5, 13}, "PBE-PKCS5v20"); 686| 0| case 0xAFE0F: ------------------ | Branch (686:7): [True: 0, False: 920] ------------------ 687| 0| return if_match(oid, {1, 2, 840, 113549, 1, 7, 1}, "PKCS7.Data"); 688| 0| case 0xAFE14: ------------------ | Branch (688:7): [True: 0, False: 920] ------------------ 689| 0| return if_match(oid, {1, 2, 840, 113549, 1, 7, 6}, "PKCS7.EncryptedData"); 690| 2| case 0xAFF91: ------------------ | Branch (690:7): [True: 2, False: 918] ------------------ 691| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 1}, "PKCS9.EmailAddress"); 692| 2| case 0xAFF92: ------------------ | Branch (692:7): [True: 2, False: 918] ------------------ 693| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 2}, "PKCS9.UnstructuredName"); 694| 3| case 0xAFF93: ------------------ | Branch (694:7): [True: 3, False: 917] ------------------ 695| 3| return if_match(oid, {1, 2, 840, 113549, 1, 9, 3}, "PKCS9.ContentType"); 696| 2| case 0xAFF94: ------------------ | Branch (696:7): [True: 2, False: 918] ------------------ 697| 2| return if_match(oid, {1, 2, 840, 113549, 1, 9, 4}, "PKCS9.MessageDigest"); 698| 1| case 0xAFF97: ------------------ | Branch (698:7): [True: 1, False: 919] ------------------ 699| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 7}, "PKCS9.ChallengePassword"); 700| 1| case 0xAFF9E: ------------------ | Branch (700:7): [True: 1, False: 919] ------------------ 701| 1| return if_match(oid, {1, 2, 840, 113549, 1, 9, 14}, "PKCS9.ExtensionRequest"); 702| 0| case 0xAFFA4: ------------------ | Branch (702:7): [True: 0, False: 920] ------------------ 703| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 20}, "PKCS9.FriendlyName"); 704| 0| case 0xAFFA5: ------------------ | Branch (704:7): [True: 0, False: 920] ------------------ 705| 0| return if_match(oid, {1, 2, 840, 113549, 1, 9, 21}, "PKCS9.LocalKeyId"); 706| 0| case 0xC0226: ------------------ | Branch (706:7): [True: 0, False: 920] ------------------ 707| 0| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 4, 11}, "Scrypt"); 708| 2| case 0xC0A67: ------------------ | Branch (708:7): [True: 2, False: 918] ------------------ 709| 2| return if_match(oid, {1, 3, 6, 1, 4, 1, 11591, 15, 1}, "OpenPGP.Ed25519"); 710| 1| case 0xC4CE5: ------------------ | Branch (710:7): [True: 1, False: 919] ------------------ 711| 1| return if_match(oid, {1, 2, 643, 100, 1}, "GOST.OGRN"); 712| 1| case 0xC4D53: ------------------ | Branch (712:7): [True: 1, False: 919] ------------------ 713| 1| return if_match(oid, {1, 2, 643, 100, 111}, "GOST.SubjectSigningTool"); 714| 1| case 0xC4D54: ------------------ | Branch (714:7): [True: 1, False: 919] ------------------ 715| 1| return if_match(oid, {1, 2, 643, 100, 112}, "GOST.IssuerSigningTool"); 716| 2| case 0xC9C50: ------------------ | Branch (716:7): [True: 2, False: 918] ------------------ 717| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 1}, "secp192r1"); 718| 2| case 0xC9C51: ------------------ | Branch (718:7): [True: 2, False: 918] ------------------ 719| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 2}, "x962_p192v2"); 720| 2| case 0xC9C52: ------------------ | Branch (720:7): [True: 2, False: 918] ------------------ 721| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 3}, "x962_p192v3"); 722| 2| case 0xC9C53: ------------------ | Branch (722:7): [True: 2, False: 918] ------------------ 723| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 4}, "x962_p239v1"); 724| 2| case 0xC9C54: ------------------ | Branch (724:7): [True: 2, False: 918] ------------------ 725| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 5}, "x962_p239v2"); 726| 2| case 0xC9C55: ------------------ | Branch (726:7): [True: 2, False: 918] ------------------ 727| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 6}, "x962_p239v3"); 728| 2| case 0xC9C56: ------------------ | Branch (728:7): [True: 2, False: 918] ------------------ 729| 2| return if_match(oid, {1, 2, 840, 10045, 3, 1, 7}, "secp256r1"); 730| 3| case 0xCFA13: ------------------ | Branch (730:7): [True: 3, False: 917] ------------------ 731| 3| return if_match(oid, {1, 2, 840, 10040, 4, 1}, "DSA"); 732| 3| case 0xCFA15: ------------------ | Branch (732:7): [True: 3, False: 917] ------------------ 733| 3| return if_match(oid, {1, 2, 840, 10040, 4, 3}, "DSA/SHA-1"); 734| 61| default: ------------------ | Branch (734:7): [True: 61, False: 859] ------------------ 735| 61| return {}; 736| 920| } 737| 920|} _ZN5Botan7OID_Map22lookup_static_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 740| 972|std::optional OID_Map::lookup_static_oid_name(std::string_view req) { 741| 972| const uint32_t hc = hash_oid_name(req); 742| | 743| 972| switch(hc) { 744| 0| case 0x00545: ------------------ | Branch (744:7): [True: 0, False: 972] ------------------ 745| 0| return if_match(req, "Twofish/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 102}); 746| 0| case 0x00CF3: ------------------ | Branch (746:7): [True: 0, False: 972] ------------------ 747| 0| return if_match(req, "SphincsPlus-sha2-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 4}); 748| 0| case 0x015FE: ------------------ | Branch (748:7): [True: 0, False: 972] ------------------ 749| 0| return if_match(req, "FrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 1}); 750| 0| case 0x01F9E: ------------------ | Branch (750:7): [True: 0, False: 972] ------------------ 751| 0| return if_match(req, "MD5", {1, 2, 840, 113549, 2, 5}); 752| 0| case 0x02293: ------------------ | Branch (752:7): [True: 0, False: 972] ------------------ 753| 0| return if_match(req, "SphincsPlus-shake-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 4}); 754| 0| case 0x02B93: ------------------ | Branch (754:7): [True: 0, False: 972] ------------------ 755| 0| return if_match(req, "Microsoft SmartcardLogon", {1, 3, 6, 1, 4, 1, 311, 20, 2, 2}); 756| 0| case 0x041D5: ------------------ | Branch (756:7): [True: 0, False: 972] ------------------ 757| 0| return if_match(req, "secp160k1", {1, 3, 132, 0, 9}); 758| 0| case 0x044B3: ------------------ | Branch (758:7): [True: 0, False: 972] ------------------ 759| 0| return if_match(req, "Camellia-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 8}); 760| 0| case 0x048B2: ------------------ | Branch (760:7): [True: 0, False: 972] ------------------ 761| 0| return if_match(req, "secp160r1", {1, 3, 132, 0, 8}); 762| 0| case 0x048B3: ------------------ | Branch (762:7): [True: 0, False: 972] ------------------ 763| 0| return if_match(req, "secp160r2", {1, 3, 132, 0, 30}); 764| 0| case 0x05CDA: ------------------ | Branch (764:7): [True: 0, False: 972] ------------------ 765| 0| return if_match(req, "X520.Country", {2, 5, 4, 6}); 766| 0| case 0x07783: ------------------ | Branch (766:7): [True: 0, False: 972] ------------------ 767| 0| return if_match(req, "PKIX.ServerAuth", {1, 3, 6, 1, 5, 5, 7, 3, 1}); 768| 0| case 0x086C7: ------------------ | Branch (768:7): [True: 0, False: 972] ------------------ 769| 0| return if_match(req, "numsp384d1", {1, 3, 6, 1, 4, 1, 25258, 4, 2}); 770| 0| case 0x08A92: ------------------ | Branch (770:7): [True: 0, False: 972] ------------------ 771| 0| return if_match(req, "RSA/PKCS1v15(SHA-1)", {1, 2, 840, 113549, 1, 1, 5}); 772| 0| case 0x09EA0: ------------------ | Branch (772:7): [True: 0, False: 972] ------------------ 773| 0| return if_match(req, "DES/CBC", {1, 3, 14, 3, 2, 7}); 774| 0| case 0x0B2D6: ------------------ | Branch (774:7): [True: 0, False: 972] ------------------ 775| 0| return if_match(req, "ECDSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 12}); 776| 0| case 0x0BA72: ------------------ | Branch (776:7): [True: 0, False: 972] ------------------ 777| 0| return if_match(req, "SphincsPlus-sha2-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 1}); 778| 0| case 0x0BE23: ------------------ | Branch (778:7): [True: 0, False: 972] ------------------ 779| 0| return if_match(req, "ECGDSA", {1, 3, 36, 3, 3, 2, 5, 2, 1}); 780| 0| case 0x0C109: ------------------ | Branch (780:7): [True: 0, False: 972] ------------------ 781| 0| return if_match(req, "PKCS9.FriendlyName", {1, 2, 840, 113549, 1, 9, 20}); 782| 0| case 0x0D012: ------------------ | Branch (782:7): [True: 0, False: 972] ------------------ 783| 0| return if_match(req, "SphincsPlus-shake-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 1}); 784| 0| case 0x0DCE9: ------------------ | Branch (784:7): [True: 0, False: 972] ------------------ 785| 0| return if_match(req, "ClassicMcEliece_8192128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 10}); 786| 0| case 0x0E52A: ------------------ | Branch (786:7): [True: 0, False: 972] ------------------ 787| 0| return if_match(req, "numsp512d1", {1, 3, 6, 1, 4, 1, 25258, 4, 3}); 788| 0| case 0x0F9CC: ------------------ | Branch (788:7): [True: 0, False: 972] ------------------ 789| 0| return if_match(req, "PKCS9.UnstructuredName", {1, 2, 840, 113549, 1, 9, 2}); 790| 0| case 0x0FF45: ------------------ | Branch (790:7): [True: 0, False: 972] ------------------ 791| 0| return if_match(req, "Camellia-256/GCM", {0, 3, 4401, 5, 3, 1, 9, 46}); 792| 0| case 0x1033D: ------------------ | Branch (792:7): [True: 0, False: 972] ------------------ 793| 0| return if_match(req, "DSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 7}); 794| 0| case 0x1139D: ------------------ | Branch (794:7): [True: 0, False: 972] ------------------ 795| 0| return if_match(req, "secp192k1", {1, 3, 132, 0, 31}); 796| 0| case 0x113D6: ------------------ | Branch (796:7): [True: 0, False: 972] ------------------ 797| 0| return if_match(req, "X520.DNQualifier", {2, 5, 4, 46}); 798| 0| case 0x11A7A: ------------------ | Branch (798:7): [True: 0, False: 972] ------------------ 799| 0| return if_match(req, "secp192r1", {1, 2, 840, 10045, 3, 1, 1}); 800| 0| case 0x12096: ------------------ | Branch (800:7): [True: 0, False: 972] ------------------ 801| 0| return if_match(req, "SM2_Kex", {1, 2, 156, 10197, 1, 301, 2}); 802| 0| case 0x13FC1: ------------------ | Branch (802:7): [True: 0, False: 972] ------------------ 803| 0| return if_match(req, "X520.GenerationalQualifier", {2, 5, 4, 44}); 804| 0| case 0x1445B: ------------------ | Branch (804:7): [True: 0, False: 972] ------------------ 805| 0| return if_match(req, "PKCS5.PBKDF2", {1, 2, 840, 113549, 1, 5, 12}); 806| 0| case 0x1495D: ------------------ | Branch (806:7): [True: 0, False: 972] ------------------ 807| 0| return if_match(req, "eFrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 3}); 808| 0| case 0x14E30: ------------------ | Branch (808:7): [True: 0, False: 972] ------------------ 809| 0| return if_match(req, "ClassicMcEliece_460896", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 3}); 810| 0| case 0x14FB1: ------------------ | Branch (810:7): [True: 0, False: 972] ------------------ 811| 0| return if_match(req, "XMSS-draft12", {1, 3, 6, 1, 4, 1, 25258, 1, 8}); 812| 0| case 0x156E3: ------------------ | Branch (812:7): [True: 0, False: 972] ------------------ 813| 0| return if_match(req, "Compression.Zlib", {1, 2, 840, 113549, 1, 9, 16, 3, 8}); 814| 0| case 0x1579E: ------------------ | Branch (814:7): [True: 0, False: 972] ------------------ 815| 0| return if_match(req, "Streebog-512", {1, 2, 643, 7, 1, 1, 2, 3}); 816| 0| case 0x1701A: ------------------ | Branch (816:7): [True: 0, False: 972] ------------------ 817| 0| return if_match(req, "X509v3.AnyExtendedKeyUsage", {2, 5, 29, 37, 0}); 818| 0| case 0x175EF: ------------------ | Branch (818:7): [True: 0, False: 972] ------------------ 819| 0| return if_match(req, "Kyber-1024-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 3}); 820| 0| case 0x17709: ------------------ | Branch (820:7): [True: 0, False: 972] ------------------ 821| 0| return if_match(req, "X520.GivenName", {2, 5, 4, 42}); 822| 0| case 0x17AD9: ------------------ | Branch (822:7): [True: 0, False: 972] ------------------ 823| 0| return if_match(req, "RSA/PKCS1v15(SM3)", {1, 2, 156, 10197, 1, 504}); 824| 0| case 0x17CE2: ------------------ | Branch (824:7): [True: 0, False: 972] ------------------ 825| 0| return if_match(req, "SLH-DSA-SHA2-256f", {2, 16, 840, 1, 101, 3, 4, 3, 25}); 826| 0| case 0x17CEF: ------------------ | Branch (826:7): [True: 0, False: 972] ------------------ 827| 0| return if_match(req, "SLH-DSA-SHA2-256s", {2, 16, 840, 1, 101, 3, 4, 3, 24}); 828| 0| case 0x18618: ------------------ | Branch (828:7): [True: 0, False: 972] ------------------ 829| 0| return if_match(req, "FrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 2}); 830| 0| case 0x19480: ------------------ | Branch (830:7): [True: 0, False: 972] ------------------ 831| 0| return if_match(req, "eFrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 3}); 832| 0| case 0x1958A: ------------------ | Branch (832:7): [True: 0, False: 972] ------------------ 833| 0| return if_match(req, "X509v3.InvalidityDate", {2, 5, 29, 24}); 834| 0| case 0x19851: ------------------ | Branch (834:7): [True: 0, False: 972] ------------------ 835| 0| return if_match(req, "DSA/SHA-1", {1, 2, 840, 10040, 4, 3}); 836| 0| case 0x1B2E7: ------------------ | Branch (836:7): [True: 0, False: 972] ------------------ 837| 0| return if_match(req, "KeyWrap.AES-128", {2, 16, 840, 1, 101, 3, 4, 1, 5}); 838| 0| case 0x1B9BE: ------------------ | Branch (838:7): [True: 0, False: 972] ------------------ 839| 0| return if_match(req, "KeyWrap.AES-192", {2, 16, 840, 1, 101, 3, 4, 1, 25}); 840| 0| case 0x1D439: ------------------ | Branch (840:7): [True: 0, False: 972] ------------------ 841| 0| return if_match(req, "SphincsPlus-haraka-192f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 4}); 842| 0| case 0x2065B: ------------------ | Branch (842:7): [True: 0, False: 972] ------------------ 843| 0| return if_match(req, "KeyWrap.CAST-128", {1, 2, 840, 113533, 7, 66, 15}); 844| 0| case 0x216A0: ------------------ | Branch (844:7): [True: 0, False: 972] ------------------ 845| 0| return if_match(req, "ML-KEM-512", {2, 16, 840, 1, 101, 3, 4, 4, 1}); 846| 0| case 0x2216B: ------------------ | Branch (846:7): [True: 0, False: 972] ------------------ 847| 0| return if_match(req, "GOST-34.10-2012-512", {1, 2, 643, 7, 1, 1, 1, 2}); 848| 0| case 0x22C2C: ------------------ | Branch (848:7): [True: 0, False: 972] ------------------ 849| 0| return if_match(req, "ElGamal", {1, 3, 6, 1, 4, 1, 3029, 1, 2, 1}); 850| 0| case 0x2559A: ------------------ | Branch (850:7): [True: 0, False: 972] ------------------ 851| 0| return if_match(req, "X520.Initials", {2, 5, 4, 43}); 852| 0| case 0x271AC: ------------------ | Branch (852:7): [True: 0, False: 972] ------------------ 853| 0| return if_match(req, "PKIX.AutonomousSysIds", {1, 3, 6, 1, 5, 5, 7, 1, 8}); 854| 0| case 0x2808B: ------------------ | Branch (854:7): [True: 0, False: 972] ------------------ 855| 0| return if_match(req, "PKCS7.Data", {1, 2, 840, 113549, 1, 7, 1}); 856| 0| case 0x281B8: ------------------ | Branch (856:7): [True: 0, False: 972] ------------------ 857| 0| return if_match(req, "SphincsPlus-haraka-128s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 1}); 858| 0| case 0x29999: ------------------ | Branch (858:7): [True: 0, False: 972] ------------------ 859| 0| return if_match(req, "DSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 6}); 860| 0| case 0x2A83D: ------------------ | Branch (860:7): [True: 0, False: 972] ------------------ 861| 0| return if_match(req, "SHA-224", {2, 16, 840, 1, 101, 3, 4, 2, 4}); 862| 0| case 0x2AB30: ------------------ | Branch (862:7): [True: 0, False: 972] ------------------ 863| 0| return if_match(req, "SHA-256", {2, 16, 840, 1, 101, 3, 4, 2, 1}); 864| 0| case 0x2ABEF: ------------------ | Branch (864:7): [True: 0, False: 972] ------------------ 865| 0| return if_match(req, "KeyWrap.AES-256", {2, 16, 840, 1, 101, 3, 4, 1, 45}); 866| 0| case 0x2BAEF: ------------------ | Branch (866:7): [True: 0, False: 972] ------------------ 867| 0| return if_match(req, "SM2_Sig/SM3", {1, 2, 156, 10197, 1, 501}); 868| 0| case 0x2C39A: ------------------ | Branch (868:7): [True: 0, False: 972] ------------------ 869| 0| return if_match(req, "ECGDSA/RIPEMD-160", {1, 3, 36, 3, 3, 2, 5, 4, 1}); 870| 0| case 0x2C54F: ------------------ | Branch (870:7): [True: 0, False: 972] ------------------ 871| 0| return if_match(req, "ECDSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 9}); 872| 0| case 0x2EEA6: ------------------ | Branch (872:7): [True: 0, False: 972] ------------------ 873| 0| return if_match(req, "RSA/PKCS1v15(RIPEMD-160)", {1, 3, 36, 3, 3, 1, 2}); 874| 0| case 0x2EFBA: ------------------ | Branch (874:7): [True: 0, False: 972] ------------------ 875| 0| return if_match(req, "Kyber-512-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 1}); 876| 0| case 0x2F0AD: ------------------ | Branch (876:7): [True: 0, False: 972] ------------------ 877| 0| return if_match(req, "PKCS7.EncryptedData", {1, 2, 840, 113549, 1, 7, 6}); 878| 0| case 0x2F219: ------------------ | Branch (878:7): [True: 0, False: 972] ------------------ 879| 0| return if_match(req, "PBE-SHA1-2DES", {1, 2, 840, 113549, 1, 12, 1, 4}); 880| 0| case 0x3133E: ------------------ | Branch (880:7): [True: 0, False: 972] ------------------ 881| 0| return if_match(req, "SLH-DSA-SHA2-128f", {2, 16, 840, 1, 101, 3, 4, 3, 21}); 882| 0| case 0x3134B: ------------------ | Branch (882:7): [True: 0, False: 972] ------------------ 883| 0| return if_match(req, "SLH-DSA-SHA2-128s", {2, 16, 840, 1, 101, 3, 4, 3, 20}); 884| 0| case 0x3160D: ------------------ | Branch (884:7): [True: 0, False: 972] ------------------ 885| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(224))", {2, 16, 840, 1, 101, 3, 4, 3, 13}); 886| 0| case 0x319E0: ------------------ | Branch (886:7): [True: 0, False: 972] ------------------ 887| 0| return if_match(req, "GOST-34.10-2012-256/Streebog-256", {1, 2, 643, 7, 1, 1, 3, 2}); 888| 0| case 0x31B3D: ------------------ | Branch (888:7): [True: 0, False: 972] ------------------ 889| 0| return if_match(req, "HMAC(SHA-512)", {1, 2, 840, 113549, 2, 11}); 890| 0| case 0x31C6D: ------------------ | Branch (890:7): [True: 0, False: 972] ------------------ 891| 0| return if_match(req, "secp384r1", {1, 3, 132, 0, 34}); 892| 0| case 0x32899: ------------------ | Branch (892:7): [True: 0, False: 972] ------------------ 893| 0| return if_match(req, "TripleDES/CBC", {1, 2, 840, 113549, 3, 7}); 894| 0| case 0x33D04: ------------------ | Branch (894:7): [True: 0, False: 972] ------------------ 895| 0| return if_match(req, "PKCS12.SecretBag", {1, 2, 840, 113549, 1, 12, 10, 1, 5}); 896| 0| case 0x3615D: ------------------ | Branch (896:7): [True: 0, False: 972] ------------------ 897| 0| return if_match(req, "FrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 2}); 898| 0| case 0x361B8: ------------------ | Branch (898:7): [True: 0, False: 972] ------------------ 899| 0| return if_match(req, "Ed25519", {1, 3, 101, 112}); 900| 0| case 0x3649D: ------------------ | Branch (900:7): [True: 0, False: 972] ------------------ 901| 0| return if_match(req, "SHAKE-128", {2, 16, 840, 1, 101, 3, 4, 2, 11}); 902| 0| case 0x36693: ------------------ | Branch (902:7): [True: 0, False: 972] ------------------ 903| 0| return if_match(req, "ClassicMcEliece_348864", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 1}); 904| 0| case 0x373C7: ------------------ | Branch (904:7): [True: 0, False: 972] ------------------ 905| 0| return if_match(req, "ML-DSA-4x4", {2, 16, 840, 1, 101, 3, 4, 3, 17}); 906| 0| case 0x3750B: ------------------ | Branch (906:7): [True: 0, False: 972] ------------------ 907| 0| return if_match(req, "ClassicMcEliece_8192128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 9}); 908| 0| case 0x39890: ------------------ | Branch (908:7): [True: 0, False: 972] ------------------ 909| 0| return if_match(req, "Ed448", {1, 3, 101, 113}); 910| 0| case 0x3A438: ------------------ | Branch (910:7): [True: 0, False: 972] ------------------ 911| 0| return if_match(req, "SHA-384", {2, 16, 840, 1, 101, 3, 4, 2, 2}); 912| 0| case 0x3A963: ------------------ | Branch (912:7): [True: 0, False: 972] ------------------ 913| 0| return if_match(req, "DH", {1, 2, 840, 10046, 2, 1}); 914| 0| case 0x3AC83: ------------------ | Branch (914:7): [True: 0, False: 972] ------------------ 915| 0| return if_match(req, "MGF1", {1, 2, 840, 113549, 1, 1, 8}); 916| 0| case 0x3ACBA: ------------------ | Branch (916:7): [True: 0, False: 972] ------------------ 917| 0| return if_match(req, "X509v3.IssuerAlternativeName", {2, 5, 29, 18}); 918| 0| case 0x3B273: ------------------ | Branch (918:7): [True: 0, False: 972] ------------------ 919| 0| return if_match(req, "KeyWrap.TripleDES", {1, 2, 840, 113549, 1, 9, 16, 3, 6}); 920| 0| case 0x3B91E: ------------------ | Branch (920:7): [True: 0, False: 972] ------------------ 921| 0| return if_match(req, "X509v3.PrivateKeyUsagePeriod", {2, 5, 29, 16}); 922| 0| case 0x3BC8A: ------------------ | Branch (922:7): [True: 0, False: 972] ------------------ 923| 0| return if_match(req, "SLH-DSA-SHAKE-192f", {2, 16, 840, 1, 101, 3, 4, 3, 29}); 924| 0| case 0x3BC97: ------------------ | Branch (924:7): [True: 0, False: 972] ------------------ 925| 0| return if_match(req, "SLH-DSA-SHAKE-192s", {2, 16, 840, 1, 101, 3, 4, 3, 28}); 926| 0| case 0x3D127: ------------------ | Branch (926:7): [True: 0, False: 972] ------------------ 927| 0| return if_match(req, "DSA", {1, 2, 840, 10040, 4, 1}); 928| 0| case 0x3E249: ------------------ | Branch (928:7): [True: 0, False: 972] ------------------ 929| 0| return if_match(req, "HSS-LMS", {1, 2, 840, 113549, 1, 9, 16, 3, 17}); 930| 0| case 0x3E7D5: ------------------ | Branch (930:7): [True: 0, False: 972] ------------------ 931| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(256))", {2, 16, 840, 1, 101, 3, 4, 3, 14}); 932| 0| case 0x3F748: ------------------ | Branch (932:7): [True: 0, False: 972] ------------------ 933| 0| return if_match(req, "GOST.OGRN", {1, 2, 643, 100, 1}); 934| 0| case 0x3F99F: ------------------ | Branch (934:7): [True: 0, False: 972] ------------------ 935| 0| return if_match(req, "X509v3.BasicConstraints", {2, 5, 29, 19}); 936| 0| case 0x40726: ------------------ | Branch (936:7): [True: 0, False: 972] ------------------ 937| 0| return if_match(req, "SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 2, 10}); 938| 0| case 0x407BF: ------------------ | Branch (938:7): [True: 0, False: 972] ------------------ 939| 0| return if_match(req, "ML-KEM-768", {2, 16, 840, 1, 101, 3, 4, 4, 2}); 940| 0| case 0x41334: ------------------ | Branch (940:7): [True: 0, False: 972] ------------------ 941| 0| return if_match(req, "ECDSA/SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 3, 11}); 942| 0| case 0x42DF3: ------------------ | Branch (942:7): [True: 0, False: 972] ------------------ 943| 0| return if_match(req, "X509v3.CRLDistributionPoints", {2, 5, 29, 31}); 944| 0| case 0x437FB: ------------------ | Branch (944:7): [True: 0, False: 972] ------------------ 945| 0| return if_match(req, "brainpool160r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 1}); 946| 0| case 0x441F5: ------------------ | Branch (946:7): [True: 0, False: 972] ------------------ 947| 0| return if_match(req, "gost_256A", {1, 2, 643, 7, 1, 2, 1, 1, 1}); 948| 0| case 0x441F6: ------------------ | Branch (948:7): [True: 0, False: 972] ------------------ 949| 0| return if_match(req, "gost_256B", {1, 2, 643, 7, 1, 2, 1, 1, 2}); 950| 0| case 0x44221: ------------------ | Branch (950:7): [True: 0, False: 972] ------------------ 951| 0| return if_match(req, "GOST-34.10-2012-512/Streebog-512", {1, 2, 643, 7, 1, 1, 3, 3}); 952| 0| case 0x44322: ------------------ | Branch (952:7): [True: 0, False: 972] ------------------ 953| 0| return if_match(req, "ClassicMcEliece_6960119pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 3}); 954| 0| case 0x44973: ------------------ | Branch (954:7): [True: 0, False: 972] ------------------ 955| 0| return if_match(req, "Kyber-512-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 1}); 956| 0| case 0x45C27: ------------------ | Branch (956:7): [True: 0, False: 972] ------------------ 957| 0| return if_match(req, "RSA/PKCS1v15(SHA-512-256)", {1, 2, 840, 113549, 1, 1, 16}); 958| 0| case 0x45C85: ------------------ | Branch (958:7): [True: 0, False: 972] ------------------ 959| 0| return if_match(req, "X509v3.ReasonCode", {2, 5, 29, 21}); 960| 0| case 0x45DA5: ------------------ | Branch (960:7): [True: 0, False: 972] ------------------ 961| 0| return if_match(req, "SHAKE-256", {2, 16, 840, 1, 101, 3, 4, 2, 12}); 962| 0| case 0x4663C: ------------------ | Branch (962:7): [True: 0, False: 972] ------------------ 963| 0| return if_match(req, "X509v3.PolicyConstraints", {2, 5, 29, 36}); 964| 0| case 0x480F7: ------------------ | Branch (964:7): [True: 0, False: 972] ------------------ 965| 0| return if_match(req, "Serpent/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 4}); 966| 0| case 0x48627: ------------------ | Branch (966:7): [True: 0, False: 972] ------------------ 967| 0| return if_match(req, "Dilithium-4x4-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 1}); 968| 0| case 0x48861: ------------------ | Branch (968:7): [True: 0, False: 972] ------------------ 969| 0| return if_match(req, "ChaCha20Poly1305", {1, 2, 840, 113549, 1, 9, 16, 3, 18}); 970| 0| case 0x4A292: ------------------ | Branch (970:7): [True: 0, False: 972] ------------------ 971| 0| return if_match(req, "frp256v1", {1, 2, 250, 1, 223, 101, 256, 1}); 972| 0| case 0x4A9EE: ------------------ | Branch (972:7): [True: 0, False: 972] ------------------ 973| 0| return if_match(req, "ClassicMcEliece_6960119f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 8}); 974| 0| case 0x4BF87: ------------------ | Branch (974:7): [True: 0, False: 972] ------------------ 975| 0| return if_match(req, "PKIX.TNAuthList", {1, 3, 6, 1, 5, 5, 7, 1, 26}); 976| 0| case 0x4C088: ------------------ | Branch (976:7): [True: 0, False: 972] ------------------ 977| 0| return if_match(req, "eFrodoKEM-976-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 2}); 978| 0| case 0x4C513: ------------------ | Branch (978:7): [True: 0, False: 972] ------------------ 979| 0| return if_match(req, "DSA/SHA-224", {2, 16, 840, 1, 101, 3, 4, 3, 1}); 980| 0| case 0x4C806: ------------------ | Branch (980:7): [True: 0, False: 972] ------------------ 981| 0| return if_match(req, "DSA/SHA-256", {2, 16, 840, 1, 101, 3, 4, 3, 2}); 982| 0| case 0x4D740: ------------------ | Branch (982:7): [True: 0, False: 972] ------------------ 983| 0| return if_match(req, "X509v3.AnyPolicy", {2, 5, 29, 32, 0}); 984| 0| case 0x4DE49: ------------------ | Branch (984:7): [True: 0, False: 972] ------------------ 985| 0| return if_match(req, "RSA/PKCS1v15(SHA-512)", {1, 2, 840, 113549, 1, 1, 13}); 986| 0| case 0x4ED5D: ------------------ | Branch (986:7): [True: 0, False: 972] ------------------ 987| 0| return if_match(req, "CAST-128/CBC", {1, 2, 840, 113533, 7, 66, 10}); 988| 0| case 0x4FCDC: ------------------ | Branch (988:7): [True: 0, False: 972] ------------------ 989| 0| return if_match(req, "RSA", {1, 2, 840, 113549, 1, 1, 1}); 990| 0| case 0x501CB: ------------------ | Branch (990:7): [True: 0, False: 972] ------------------ 991| 0| return if_match(req, "ECDSA/SHA-224", {1, 2, 840, 10045, 4, 3, 1}); 992| 0| case 0x50395: ------------------ | Branch (992:7): [True: 0, False: 972] ------------------ 993| 0| return if_match(req, "GOST-34.10/GOST-R-34.11-94", {1, 2, 643, 2, 2, 3}); 994| 0| case 0x504BE: ------------------ | Branch (994:7): [True: 0, False: 972] ------------------ 995| 0| return if_match(req, "ECDSA/SHA-256", {1, 2, 840, 10045, 4, 3, 2}); 996| 0| case 0x509C3: ------------------ | Branch (996:7): [True: 0, False: 972] ------------------ 997| 0| return if_match(req, "brainpool192r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 3}); 998| 0| case 0x509F9: ------------------ | Branch (998:7): [True: 0, False: 972] ------------------ 999| 0| return if_match(req, "PKCS9.ContentType", {1, 2, 840, 113549, 1, 9, 3}); 1000| 0| case 0x50B26: ------------------ | Branch (1000:7): [True: 0, False: 972] ------------------ 1001| 0| return if_match(req, "FrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 1}); 1002| 0| case 0x50D78: ------------------ | Branch (1002:7): [True: 0, False: 972] ------------------ 1003| 0| return if_match(req, "x962_p192v2", {1, 2, 840, 10045, 3, 1, 2}); 1004| 0| case 0x50D79: ------------------ | Branch (1004:7): [True: 0, False: 972] ------------------ 1005| 0| return if_match(req, "x962_p192v3", {1, 2, 840, 10045, 3, 1, 3}); 1006| 0| case 0x51DC6: ------------------ | Branch (1006:7): [True: 0, False: 972] ------------------ 1007| 0| return if_match(req, "AES-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 1}); 1008| 0| case 0x52DB6: ------------------ | Branch (1008:7): [True: 0, False: 972] ------------------ 1009| 0| return if_match(req, "HMAC(SHA-224)", {1, 2, 840, 113549, 2, 8}); 1010| 0| case 0x53E11: ------------------ | Branch (1010:7): [True: 0, False: 972] ------------------ 1011| 0| return if_match(req, "FrodoKEM-1344-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 14, 3}); 1012| 0| case 0x54012: ------------------ | Branch (1012:7): [True: 0, False: 972] ------------------ 1013| 0| return if_match(req, "PKIX.TimeStamping", {1, 3, 6, 1, 5, 5, 7, 3, 8}); 1014| 0| case 0x5407A: ------------------ | Branch (1014:7): [True: 0, False: 972] ------------------ 1015| 0| return if_match(req, "Serpent/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 1}); 1016| 0| case 0x5576D: ------------------ | Branch (1016:7): [True: 0, False: 972] ------------------ 1017| 0| return if_match(req, "SphincsPlus-sha2-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 2}); 1018| 0| case 0x55EF6: ------------------ | Branch (1018:7): [True: 0, False: 972] ------------------ 1019| 0| return if_match(req, "AES-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 2}); 1020| 0| case 0x55FFA: ------------------ | Branch (1020:7): [True: 0, False: 972] ------------------ 1021| 0| return if_match(req, "ML-DSA-6x5", {2, 16, 840, 1, 101, 3, 4, 3, 18}); 1022| 0| case 0x56826: ------------------ | Branch (1022:7): [True: 0, False: 972] ------------------ 1023| 0| return if_match(req, "brainpool320r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 9}); 1024| 0| case 0x56D0D: ------------------ | Branch (1024:7): [True: 0, False: 972] ------------------ 1025| 0| return if_match(req, "SphincsPlus-shake-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 2}); 1026| 0| case 0x57077: ------------------ | Branch (1026:7): [True: 0, False: 972] ------------------ 1027| 0| return if_match(req, "XMSS-draft6", {1, 3, 6, 1, 4, 1, 25258, 1, 5}); 1028| 0| case 0x5818B: ------------------ | Branch (1028:7): [True: 0, False: 972] ------------------ 1029| 0| return if_match(req, "ECGDSA/SHA-224", {1, 3, 36, 3, 3, 2, 5, 4, 3}); 1030| 0| case 0x5847E: ------------------ | Branch (1030:7): [True: 0, False: 972] ------------------ 1031| 0| return if_match(req, "ECGDSA/SHA-256", {1, 3, 36, 3, 3, 2, 5, 4, 4}); 1032| 0| case 0x5898B: ------------------ | Branch (1032:7): [True: 0, False: 972] ------------------ 1033| 0| return if_match(req, "SHA-512", {2, 16, 840, 1, 101, 3, 4, 2, 3}); 1034| 0| case 0x58991: ------------------ | Branch (1034:7): [True: 0, False: 972] ------------------ 1035| 0| return if_match(req, "PKIX.OCSP.NoCheck", {1, 3, 6, 1, 5, 5, 7, 48, 1, 5}); 1036| 0| case 0x59717: ------------------ | Branch (1036:7): [True: 0, False: 972] ------------------ 1037| 0| return if_match(req, "X509v3.SubjectKeyIdentifier", {2, 5, 29, 14}); 1038| 0| case 0x5A1E1: ------------------ | Branch (1038:7): [True: 0, False: 972] ------------------ 1039| 0| return if_match(req, "PKCS12.KeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 1}); 1040| 0| case 0x5A570: ------------------ | Branch (1040:7): [True: 0, False: 972] ------------------ 1041| 0| return if_match(req, "X520.CommonName", {2, 5, 4, 3}); 1042| 0| case 0x5A990: ------------------ | Branch (1042:7): [True: 0, False: 972] ------------------ 1043| 0| return if_match(req, "ECDSA/SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 3, 10}); 1044| 0| case 0x5AB0E: ------------------ | Branch (1044:7): [True: 0, False: 972] ------------------ 1045| 0| return if_match(req, "SphincsPlus-sha2-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 5}); 1046| 0| case 0x5AC4A: ------------------ | Branch (1046:7): [True: 0, False: 972] ------------------ 1047| 0| return if_match(req, "X520.Surname", {2, 5, 4, 4}); 1048| 0| case 0x5AF2C: ------------------ | Branch (1048:7): [True: 0, False: 972] ------------------ 1049| 0| return if_match(req, "ClassicMcEliece_8192128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 5}); 1050| 0| case 0x5BC39: ------------------ | Branch (1050:7): [True: 0, False: 972] ------------------ 1051| 0| return if_match(req, "X509v3.KeyUsage", {2, 5, 29, 15}); 1052| 0| case 0x5BDDB: ------------------ | Branch (1052:7): [True: 0, False: 972] ------------------ 1053| 0| return if_match(req, "numsp256d1", {1, 3, 6, 1, 4, 1, 25258, 4, 1}); 1054| 0| case 0x5C0AE: ------------------ | Branch (1054:7): [True: 0, False: 972] ------------------ 1055| 0| return if_match(req, "SphincsPlus-shake-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 5}); 1056| 0| case 0x5C10E: ------------------ | Branch (1056:7): [True: 0, False: 972] ------------------ 1057| 0| return if_match(req, "DSA/SHA-384", {2, 16, 840, 1, 101, 3, 4, 3, 3}); 1058| 0| case 0x5CFE5: ------------------ | Branch (1058:7): [True: 0, False: 972] ------------------ 1059| 0| return if_match(req, "PKCS9.X509Certificate", {1, 2, 840, 113549, 1, 9, 22, 1}); 1060| 0| case 0x5D1CF: ------------------ | Branch (1060:7): [True: 0, False: 972] ------------------ 1061| 0| return if_match(req, "X520.SerialNumber", {2, 5, 4, 5}); 1062| 0| case 0x5D375: ------------------ | Branch (1062:7): [True: 0, False: 972] ------------------ 1063| 0| return if_match(req, "SM4/OCB", {1, 2, 156, 10197, 1, 104, 100}); 1064| 0| case 0x5DD49: ------------------ | Branch (1064:7): [True: 0, False: 972] ------------------ 1065| 0| return if_match(req, "AES-128/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 2}); 1066| 0| case 0x5DE4E: ------------------ | Branch (1066:7): [True: 0, False: 972] ------------------ 1067| 0| return if_match(req, "AES-128/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 7}); 1068| 0| case 0x5DF23: ------------------ | Branch (1068:7): [True: 0, False: 972] ------------------ 1069| 0| return if_match(req, "HMAC(SHA-512-256)", {1, 2, 840, 113549, 2, 13}); 1070| 0| case 0x5ED04: ------------------ | Branch (1070:7): [True: 0, False: 972] ------------------ 1071| 0| return if_match(req, "SM2", {1, 2, 156, 10197, 1, 301, 1}); 1072| 0| case 0x5ED05: ------------------ | Branch (1072:7): [True: 0, False: 972] ------------------ 1073| 0| return if_match(req, "SM3", {1, 2, 156, 10197, 1, 401}); 1074| 0| case 0x5FDC6: ------------------ | Branch (1074:7): [True: 0, False: 972] ------------------ 1075| 0| return if_match(req, "ECDSA/SHA-384", {1, 2, 840, 10045, 4, 3, 3}); 1076| 0| case 0x6199F: ------------------ | Branch (1076:7): [True: 0, False: 972] ------------------ 1077| 0| return if_match(req, "SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 2, 7}); 1078| 0| case 0x61E79: ------------------ | Branch (1078:7): [True: 0, False: 972] ------------------ 1079| 0| return if_match(req, "AES-192/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 22}); 1080| 0| case 0x61F7E: ------------------ | Branch (1080:7): [True: 0, False: 972] ------------------ 1081| 0| return if_match(req, "AES-192/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 27}); 1082| 0| case 0x64947: ------------------ | Branch (1082:7): [True: 0, False: 972] ------------------ 1083| 0| return if_match(req, "OpenPGP.Ed25519", {1, 3, 6, 1, 4, 1, 11591, 15, 1}); 1084| 0| case 0x652E7: ------------------ | Branch (1084:7): [True: 0, False: 972] ------------------ 1085| 0| return if_match(req, "sm2p256v1", {1, 2, 156, 10197, 1, 301}); 1086| 0| case 0x6697B: ------------------ | Branch (1086:7): [True: 0, False: 972] ------------------ 1087| 0| return if_match(req, "FrodoKEM-1344-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 15, 3}); 1088| 0| case 0x67B2C: ------------------ | Branch (1088:7): [True: 0, False: 972] ------------------ 1089| 0| return if_match(req, "X520.State", {2, 5, 4, 8}); 1090| 0| case 0x67B9B: ------------------ | Branch (1090:7): [True: 0, False: 972] ------------------ 1091| 0| return if_match(req, "HMAC(SHA-384)", {1, 2, 840, 113549, 2, 10}); 1092| 0| case 0x67D86: ------------------ | Branch (1092:7): [True: 0, False: 972] ------------------ 1093| 0| return if_match(req, "ECGDSA/SHA-384", {1, 3, 36, 3, 3, 2, 5, 4, 5}); 1094| 0| case 0x68A0B: ------------------ | Branch (1094:7): [True: 0, False: 972] ------------------ 1095| 0| return if_match(req, "Camellia-128/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 6}); 1096| 0| case 0x68E33: ------------------ | Branch (1096:7): [True: 0, False: 972] ------------------ 1097| 0| return if_match(req, "PKCS9.ExtensionRequest", {1, 2, 840, 113549, 1, 9, 14}); 1098| 924| case 0x69126: ------------------ | Branch (1098:7): [True: 924, False: 48] ------------------ 1099| 924| return if_match(req, "X509v3.SubjectAlternativeName", {2, 5, 29, 17}); 1100| 0| case 0x692F8: ------------------ | Branch (1100:7): [True: 0, False: 972] ------------------ 1101| 0| return if_match(req, "SM4/CBC", {1, 2, 156, 10197, 1, 104, 2}); 1102| 0| case 0x695E1: ------------------ | Branch (1102:7): [True: 0, False: 972] ------------------ 1103| 0| return if_match(req, "Dilithium-4x4-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 1}); 1104| 0| case 0x696DC: ------------------ | Branch (1104:7): [True: 0, False: 972] ------------------ 1105| 0| return if_match(req, "PKIX.IpAddrBlocks", {1, 3, 6, 1, 5, 5, 7, 1, 7}); 1106| 0| case 0x6A7CA: ------------------ | Branch (1106:7): [True: 0, False: 972] ------------------ 1107| 0| return if_match(req, "ECDSA", {1, 2, 840, 10045, 2, 1}); 1108| 0| case 0x6BD26: ------------------ | Branch (1108:7): [True: 0, False: 972] ------------------ 1109| 0| return if_match(req, "GOST.INN", {1, 2, 643, 3, 131, 1, 1}); 1110| 0| case 0x6CB3B: ------------------ | Branch (1110:7): [True: 0, False: 972] ------------------ 1111| 0| return if_match(req, "Camellia-192/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 7}); 1112| 0| case 0x6E602: ------------------ | Branch (1112:7): [True: 0, False: 972] ------------------ 1113| 0| return if_match(req, "Dilithium-8x7-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 3}); 1114| 0| case 0x6F0C2: ------------------ | Branch (1114:7): [True: 0, False: 972] ------------------ 1115| 0| return if_match(req, "RSA/PKCS1v15(SHA-224)", {1, 2, 840, 113549, 1, 1, 14}); 1116| 0| case 0x6F9F8: ------------------ | Branch (1116:7): [True: 0, False: 972] ------------------ 1117| 0| return if_match(req, "PKCS12.SafeContentsBag", {1, 2, 840, 113549, 1, 12, 10, 1, 6}); 1118| 0| case 0x6FB26: ------------------ | Branch (1118:7): [True: 0, False: 972] ------------------ 1119| 0| return if_match(req, "PKIX.AuthorityInformationAccess", {1, 3, 6, 1, 5, 5, 7, 1, 1}); 1120| 0| case 0x70BB6: ------------------ | Branch (1120:7): [True: 0, False: 972] ------------------ 1121| 0| return if_match(req, "brainpool384r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 11}); 1122| 0| case 0x70EA6: ------------------ | Branch (1122:7): [True: 0, False: 972] ------------------ 1123| 0| return if_match(req, "PKCS12.PKCS8ShroudedKeyBag", {1, 2, 840, 113549, 1, 12, 10, 1, 2}); 1124| 0| case 0x71EB3: ------------------ | Branch (1124:7): [True: 0, False: 972] ------------------ 1125| 0| return if_match(req, "SphincsPlus-haraka-128f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 2}); 1126| 0| case 0x7382C: ------------------ | Branch (1126:7): [True: 0, False: 972] ------------------ 1127| 0| return if_match(req, "ML-KEM-1024", {2, 16, 840, 1, 101, 3, 4, 4, 3}); 1128| 0| case 0x743BD: ------------------ | Branch (1128:7): [True: 0, False: 972] ------------------ 1129| 0| return if_match(req, "AES-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 3}); 1130| 0| case 0x7498E: ------------------ | Branch (1130:7): [True: 0, False: 972] ------------------ 1131| 0| return if_match(req, "Camellia-128/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 2}); 1132| 0| case 0x74C2E: ------------------ | Branch (1132:7): [True: 0, False: 972] ------------------ 1133| 0| return if_match(req, "ML-DSA-8x7", {2, 16, 840, 1, 101, 3, 4, 3, 19}); 1134| 0| case 0x7505F: ------------------ | Branch (1134:7): [True: 0, False: 972] ------------------ 1135| 0| return if_match(req, "PKIX.XMPPAddr", {1, 3, 6, 1, 5, 5, 7, 8, 5}); 1136| 0| case 0x7517A: ------------------ | Branch (1136:7): [True: 0, False: 972] ------------------ 1137| 0| return if_match(req, "RSA/PKCS1v15(MD2)", {1, 2, 840, 113549, 1, 1, 2}); 1138| 0| case 0x7546B: ------------------ | Branch (1138:7): [True: 0, False: 972] ------------------ 1139| 0| return if_match(req, "RSA/PKCS1v15(MD5)", {1, 2, 840, 113549, 1, 1, 4}); 1140| 0| case 0x75921: ------------------ | Branch (1140:7): [True: 0, False: 972] ------------------ 1141| 0| return if_match(req, "ClassicMcEliece_348864f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 2}); 1142| 0| case 0x76784: ------------------ | Branch (1142:7): [True: 0, False: 972] ------------------ 1143| 0| return if_match(req, "SHA-3(384)", {2, 16, 840, 1, 101, 3, 4, 2, 9}); 1144| 0| case 0x768FD: ------------------ | Branch (1144:7): [True: 0, False: 972] ------------------ 1145| 0| return if_match(req, "PKCS9.LocalKeyId", {1, 2, 840, 113549, 1, 9, 21}); 1146| 0| case 0x76A19: ------------------ | Branch (1146:7): [True: 0, False: 972] ------------------ 1147| 0| return if_match(req, "brainpool512r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 13}); 1148| 0| case 0x77254: ------------------ | Branch (1148:7): [True: 0, False: 972] ------------------ 1149| 0| return if_match(req, "SphincsPlus-haraka-256s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 5}); 1150| 0| case 0x77ADC: ------------------ | Branch (1150:7): [True: 0, False: 972] ------------------ 1151| 0| return if_match(req, "secp224k1", {1, 3, 132, 0, 32}); 1152| 0| case 0x781B9: ------------------ | Branch (1152:7): [True: 0, False: 972] ------------------ 1153| 0| return if_match(req, "secp224r1", {1, 3, 132, 0, 33}); 1154| 0| case 0x78ABE: ------------------ | Branch (1154:7): [True: 0, False: 972] ------------------ 1155| 0| return if_match(req, "Camellia-192/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 3}); 1156| 0| case 0x792F2: ------------------ | Branch (1156:7): [True: 0, False: 972] ------------------ 1157| 0| return if_match(req, "ClassicMcEliece_6688128pc", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 1}); 1158| 0| case 0x7A661: ------------------ | Branch (1158:7): [True: 0, False: 972] ------------------ 1159| 0| return if_match(req, "DSA/SHA-512", {2, 16, 840, 1, 101, 3, 4, 3, 4}); 1160| 0| case 0x7A977: ------------------ | Branch (1160:7): [True: 0, False: 972] ------------------ 1161| 0| return if_match(req, "X509v3.ExtendedKeyUsage", {2, 5, 29, 37}); 1162| 0| case 0x7AE67: ------------------ | Branch (1162:7): [True: 0, False: 972] ------------------ 1163| 0| return if_match(req, "SM2_Enc", {1, 2, 156, 10197, 1, 301, 3}); 1164| 0| case 0x7B602: ------------------ | Branch (1164:7): [True: 0, False: 972] ------------------ 1165| 0| return if_match(req, "Twofish/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 5}); 1166| 0| case 0x7B9A1: ------------------ | Branch (1166:7): [True: 0, False: 972] ------------------ 1167| 0| return if_match(req, "SphincsPlus-sha2-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 3}); 1168| 0| case 0x7BB0A: ------------------ | Branch (1168:7): [True: 0, False: 972] ------------------ 1169| 0| return if_match(req, "SLH-DSA-SHAKE-256f", {2, 16, 840, 1, 101, 3, 4, 3, 31}); 1170| 0| case 0x7BB17: ------------------ | Branch (1170:7): [True: 0, False: 972] ------------------ 1171| 0| return if_match(req, "SLH-DSA-SHAKE-256s", {2, 16, 840, 1, 101, 3, 4, 3, 30}); 1172| 0| case 0x7BCF3: ------------------ | Branch (1172:7): [True: 0, False: 972] ------------------ 1173| 0| return if_match(req, "PKIX.EmailProtection", {1, 3, 6, 1, 5, 5, 7, 3, 4}); 1174| 0| case 0x7CC2C: ------------------ | Branch (1174:7): [True: 0, False: 972] ------------------ 1175| 0| return if_match(req, "SHA-512-256", {2, 16, 840, 1, 101, 3, 4, 2, 6}); 1176| 0| case 0x7CF41: ------------------ | Branch (1176:7): [True: 0, False: 972] ------------------ 1177| 0| return if_match(req, "SphincsPlus-shake-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 3}); 1178| 0| case 0x7DB91: ------------------ | Branch (1178:7): [True: 0, False: 972] ------------------ 1179| 0| return if_match(req, "GOST-34.10", {1, 2, 643, 2, 2, 19}); 1180| 0| case 0x7E319: ------------------ | Branch (1180:7): [True: 0, False: 972] ------------------ 1181| 0| return if_match(req, "ECDSA/SHA-512", {1, 2, 840, 10045, 4, 3, 4}); 1182| 0| case 0x7E874: ------------------ | Branch (1182:7): [True: 0, False: 972] ------------------ 1183| 0| return if_match(req, "ClassicMcEliece_6688128f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 6}); 1184| 0| case 0x7EAAF: ------------------ | Branch (1184:7): [True: 0, False: 972] ------------------ 1185| 0| return if_match(req, "eFrodoKEM-640-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 1}); 1186| 0| case 0x7F51F: ------------------ | Branch (1186:7): [True: 0, False: 972] ------------------ 1187| 0| return if_match(req, "PKIX.IPsecTunnel", {1, 3, 6, 1, 5, 5, 7, 3, 6}); 1188| 0| case 0x80272: ------------------ | Branch (1188:7): [True: 0, False: 972] ------------------ 1189| 0| return if_match(req, "X520.Organization", {2, 5, 4, 10}); 1190| 0| case 0x80340: ------------------ | Branch (1190:7): [True: 0, False: 972] ------------------ 1191| 0| return if_match(req, "AES-256/CBC", {2, 16, 840, 1, 101, 3, 4, 1, 42}); 1192| 0| case 0x80445: ------------------ | Branch (1192:7): [True: 0, False: 972] ------------------ 1193| 0| return if_match(req, "AES-256/CCM", {2, 16, 840, 1, 101, 3, 4, 1, 47}); 1194| 0| case 0x811F7: ------------------ | Branch (1194:7): [True: 0, False: 972] ------------------ 1195| 0| return if_match(req, "HMAC(SHA-256)", {1, 2, 840, 113549, 2, 9}); 1196| 0| case 0x82434: ------------------ | Branch (1196:7): [True: 0, False: 972] ------------------ 1197| 0| return if_match(req, "PKCS9.X509CRL", {1, 2, 840, 113549, 1, 9, 23, 1}); 1198| 0| case 0x82B47: ------------------ | Branch (1198:7): [True: 0, False: 972] ------------------ 1199| 0| return if_match(req, "Threefish-512/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 2}); 1200| 0| case 0x83EA7: ------------------ | Branch (1200:7): [True: 0, False: 972] ------------------ 1201| 0| return if_match(req, "RSA/PKCS1v15(SHA-384)", {1, 2, 840, 113549, 1, 1, 12}); 1202| 0| case 0x84596: ------------------ | Branch (1202:7): [True: 0, False: 972] ------------------ 1203| 0| return if_match(req, "eFrodoKEM-640-AES", {1, 3, 6, 1, 4, 1, 25258, 1, 17, 1}); 1204| 0| case 0x8469F: ------------------ | Branch (1204:7): [True: 0, False: 972] ------------------ 1205| 0| return if_match(req, "ClassicMcEliece_6960119pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 4}); 1206| 0| case 0x84CA4: ------------------ | Branch (1206:7): [True: 0, False: 972] ------------------ 1207| 0| return if_match(req, "secp256k1", {1, 3, 132, 0, 10}); 1208| 0| case 0x85381: ------------------ | Branch (1208:7): [True: 0, False: 972] ------------------ 1209| 0| return if_match(req, "secp256r1", {1, 2, 840, 10045, 3, 1, 7}); 1210| 0| case 0x854FC: ------------------ | Branch (1210:7): [True: 0, False: 972] ------------------ 1211| 0| return if_match(req, "PKIX.IPsecUser", {1, 3, 6, 1, 5, 5, 7, 3, 7}); 1212| 0| case 0x85F51: ------------------ | Branch (1212:7): [True: 0, False: 972] ------------------ 1213| 0| return if_match(req, "Serpent/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 4}); 1214| 0| case 0x862D9: ------------------ | Branch (1214:7): [True: 0, False: 972] ------------------ 1215| 0| return if_match(req, "ECGDSA/SHA-512", {1, 3, 36, 3, 3, 2, 5, 4, 6}); 1216| 0| case 0x87585: ------------------ | Branch (1216:7): [True: 0, False: 972] ------------------ 1217| 0| return if_match(req, "Twofish/CBC", {1, 3, 6, 1, 4, 1, 25258, 3, 3}); 1218| 0| case 0x877D1: ------------------ | Branch (1218:7): [True: 0, False: 972] ------------------ 1219| 0| return if_match(req, "PKCS9.EmailAddress", {1, 2, 840, 113549, 1, 9, 1}); 1220| 24| case 0x87D27: ------------------ | Branch (1220:7): [True: 24, False: 948] ------------------ 1221| 24| return if_match(req, "PKIX.CertificateAuthorityIssuers", {1, 3, 6, 1, 5, 5, 7, 48, 2}); 1222| 0| case 0x87E42: ------------------ | Branch (1222:7): [True: 0, False: 972] ------------------ 1223| 0| return if_match(req, "X509v3.AuthorityKeyIdentifier", {2, 5, 29, 35}); 1224| 0| case 0x889B1: ------------------ | Branch (1224:7): [True: 0, False: 972] ------------------ 1225| 0| return if_match(req, "ECDSA/SHA-1", {1, 2, 840, 10045, 4, 1}); 1226| 0| case 0x89658: ------------------ | Branch (1226:7): [True: 0, False: 972] ------------------ 1227| 0| return if_match(req, "PBE-PKCS5v20", {1, 2, 840, 113549, 1, 5, 13}); 1228| 0| case 0x8976D: ------------------ | Branch (1228:7): [True: 0, False: 972] ------------------ 1229| 0| return if_match(req, "PKCS9.MessageDigest", {1, 2, 840, 113549, 1, 9, 4}); 1230| 0| case 0x8B002: ------------------ | Branch (1230:7): [True: 0, False: 972] ------------------ 1231| 0| return if_match(req, "Camellia-256/OCB", {1, 3, 6, 1, 4, 1, 25258, 3, 2, 8}); 1232| 0| case 0x8B935: ------------------ | Branch (1232:7): [True: 0, False: 972] ------------------ 1233| 0| return if_match(req, "ClassicMcEliece_6688128", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 5}); 1234| 0| case 0x8BB11: ------------------ | Branch (1234:7): [True: 0, False: 972] ------------------ 1235| 0| return if_match(req, "X509v3.NoRevocationAvailable", {2, 5, 29, 56}); 1236| 0| case 0x8CE3D: ------------------ | Branch (1236:7): [True: 0, False: 972] ------------------ 1237| 0| return if_match(req, "PKCS9.ChallengePassword", {1, 2, 840, 113549, 1, 9, 7}); 1238| 0| case 0x8D45C: ------------------ | Branch (1238:7): [True: 0, False: 972] ------------------ 1239| 0| return if_match(req, "ECKCDSA", {1, 0, 14888, 3, 0, 5}); 1240| 0| case 0x8E0C1: ------------------ | Branch (1240:7): [True: 0, False: 972] ------------------ 1241| 0| return if_match(req, "X509v3.CertificatePolicies", {2, 5, 29, 32}); 1242| 0| case 0x8E39A: ------------------ | Branch (1242:7): [True: 0, False: 972] ------------------ 1243| 0| return if_match(req, "HSS-LMS-Private-Key", {1, 3, 6, 1, 4, 1, 25258, 1, 13}); 1244| 0| case 0x8EC51: ------------------ | Branch (1244:7): [True: 0, False: 972] ------------------ 1245| 0| return if_match(req, "Kyber-768-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 2}); 1246| 0| case 0x8F94A: ------------------ | Branch (1246:7): [True: 0, False: 972] ------------------ 1247| 0| return if_match(req, "Dilithium-6x5-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 9, 2}); 1248| 0| case 0x8FC20: ------------------ | Branch (1248:7): [True: 0, False: 972] ------------------ 1249| 0| return if_match(req, "AES-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 1}); 1250| 0| case 0x8FDE0: ------------------ | Branch (1250:7): [True: 0, False: 972] ------------------ 1251| 0| return if_match(req, "SHA-3(256)", {2, 16, 840, 1, 101, 3, 4, 2, 8}); 1252| 0| case 0x919E3: ------------------ | Branch (1252:7): [True: 0, False: 972] ------------------ 1253| 0| return if_match(req, "Serpent/GCM", {1, 3, 6, 1, 4, 1, 25258, 3, 101}); 1254| 0| case 0x91C1A: ------------------ | Branch (1254:7): [True: 0, False: 972] ------------------ 1255| 0| return if_match(req, "X25519", {1, 3, 101, 110}); 1256| 0| case 0x91DC4: ------------------ | Branch (1256:7): [True: 0, False: 972] ------------------ 1257| 0| return if_match(req, "McEliece", {1, 3, 6, 1, 4, 1, 25258, 1, 3}); 1258| 0| case 0x93467: ------------------ | Branch (1258:7): [True: 0, False: 972] ------------------ 1259| 0| return if_match(req, "Dilithium-6x5-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 2}); 1260| 0| case 0x93D50: ------------------ | Branch (1260:7): [True: 0, False: 972] ------------------ 1261| 0| return if_match(req, "AES-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 2}); 1262| 0| case 0x95166: ------------------ | Branch (1262:7): [True: 0, False: 972] ------------------ 1263| 0| return if_match(req, "SLH-DSA-SHAKE-128f", {2, 16, 840, 1, 101, 3, 4, 3, 27}); 1264| 0| case 0x95173: ------------------ | Branch (1264:7): [True: 0, False: 972] ------------------ 1265| 0| return if_match(req, "SLH-DSA-SHAKE-128s", {2, 16, 840, 1, 101, 3, 4, 3, 26}); 1266| 24| case 0x952D6: ------------------ | Branch (1266:7): [True: 24, False: 948] ------------------ 1267| 24| return if_match(req, "PKIX.OCSP", {1, 3, 6, 1, 5, 5, 7, 48, 1}); 1268| 0| case 0x959B9: ------------------ | Branch (1268:7): [True: 0, False: 972] ------------------ 1269| 0| return if_match(req, "PKIX.IPsecEndSystem", {1, 3, 6, 1, 5, 5, 7, 3, 5}); 1270| 0| case 0x96F85: ------------------ | Branch (1270:7): [True: 0, False: 972] ------------------ 1271| 0| return if_match(req, "Camellia-256/CBC", {1, 2, 392, 200011, 61, 1, 1, 1, 4}); 1272| 0| case 0x97D5E: ------------------ | Branch (1272:7): [True: 0, False: 972] ------------------ 1273| 0| return if_match(req, "HMAC(SHA-1)", {1, 2, 840, 113549, 2, 7}); 1274| 0| case 0x9805C: ------------------ | Branch (1274:7): [True: 0, False: 972] ------------------ 1275| 0| return if_match(req, "SEED/CBC", {1, 2, 410, 200004, 1, 4}); 1276| 0| case 0x980E7: ------------------ | Branch (1276:7): [True: 0, False: 972] ------------------ 1277| 0| return if_match(req, "SphincsPlus-haraka-192s-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 3}); 1278| 0| case 0x980F5: ------------------ | Branch (1278:7): [True: 0, False: 972] ------------------ 1279| 0| return if_match(req, "GOST.SubjectSigningTool", {1, 2, 643, 100, 111}); 1280| 0| case 0x98B03: ------------------ | Branch (1280:7): [True: 0, False: 972] ------------------ 1281| 0| return if_match(req, "XMSS", {0, 4, 0, 127, 0, 15, 1, 1, 13, 0}); 1282| 0| case 0x9A6B2: ------------------ | Branch (1282:7): [True: 0, False: 972] ------------------ 1283| 0| return if_match(req, "ECKCDSA/SHA-1", {1, 2, 410, 200004, 1, 100, 4, 3}); 1284| 0| case 0x9B1CF: ------------------ | Branch (1284:7): [True: 0, False: 972] ------------------ 1285| 0| return if_match(req, "SM4/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 9}); 1286| 0| case 0x9B6B2: ------------------ | Branch (1286:7): [True: 0, False: 972] ------------------ 1287| 0| return if_match(req, "AES-128/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 6}); 1288| 0| case 0x9B6BB: ------------------ | Branch (1288:7): [True: 0, False: 972] ------------------ 1289| 0| return if_match(req, "X520.OrganizationalUnit", {2, 5, 4, 11}); 1290| 0| case 0x9B851: ------------------ | Branch (1290:7): [True: 0, False: 972] ------------------ 1291| 0| return if_match(req, "OpenPGP.Curve25519", {1, 3, 6, 1, 4, 1, 3029, 1, 5, 1}); 1292| 0| case 0x9C80B: ------------------ | Branch (1292:7): [True: 0, False: 972] ------------------ 1293| 0| return if_match(req, "SLH-DSA-SHA2-192f", {2, 16, 840, 1, 101, 3, 4, 3, 23}); 1294| 0| case 0x9C818: ------------------ | Branch (1294:7): [True: 0, False: 972] ------------------ 1295| 0| return if_match(req, "SLH-DSA-SHA2-192s", {2, 16, 840, 1, 101, 3, 4, 3, 22}); 1296| 0| case 0x9CD2B: ------------------ | Branch (1296:7): [True: 0, False: 972] ------------------ 1297| 0| return if_match(req, "Scrypt", {1, 3, 6, 1, 4, 1, 11591, 4, 11}); 1298| 0| case 0x9CDE1: ------------------ | Branch (1298:7): [True: 0, False: 972] ------------------ 1299| 0| return if_match(req, "GOST-34.10-2012-256/SHA-256", {1, 3, 6, 1, 4, 1, 25258, 1, 6, 1}); 1300| 0| case 0x9CF73: ------------------ | Branch (1300:7): [True: 0, False: 972] ------------------ 1301| 0| return if_match(req, "ClassicMcEliece_460896f", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 4}); 1302| 0| case 0x9D354: ------------------ | Branch (1302:7): [True: 0, False: 972] ------------------ 1303| 0| return if_match(req, "RIPEMD-160", {1, 3, 36, 3, 2, 1}); 1304| 0| case 0x9D503: ------------------ | Branch (1304:7): [True: 0, False: 972] ------------------ 1305| 0| return if_match(req, "RSA/PKCS1v15(SHA-256)", {1, 2, 840, 113549, 1, 1, 11}); 1306| 0| case 0x9EC88: ------------------ | Branch (1306:7): [True: 0, False: 972] ------------------ 1307| 0| return if_match(req, "DSA/SHA-3(512)", {2, 16, 840, 1, 101, 3, 4, 3, 8}); 1308| 0| case 0x9EF36: ------------------ | Branch (1308:7): [True: 0, False: 972] ------------------ 1309| 0| return if_match(req, "ClassicMcEliece_6960119", {1, 3, 6, 1, 4, 1, 22554, 5, 1, 7}); 1310| 0| case 0x9F764: ------------------ | Branch (1310:7): [True: 0, False: 972] ------------------ 1311| 0| return if_match(req, "X448", {1, 3, 101, 111}); 1312| 0| case 0x9F7E2: ------------------ | Branch (1312:7): [True: 0, False: 972] ------------------ 1313| 0| return if_match(req, "AES-192/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 26}); 1314| 0| case 0x9F9C5: ------------------ | Branch (1314:7): [True: 0, False: 972] ------------------ 1315| 0| return if_match(req, "ClassicMcEliece_6688128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 2}); 1316| 0| case 0xA0805: ------------------ | Branch (1316:7): [True: 0, False: 972] ------------------ 1317| 0| return if_match(req, "PKCS9.SDSICertificate", {1, 2, 840, 113549, 1, 9, 22, 2}); 1318| 0| case 0xA2B5B: ------------------ | Branch (1318:7): [True: 0, False: 972] ------------------ 1319| 0| return if_match(req, "X509v3.CRLNumber", {2, 5, 29, 20}); 1320| 0| case 0xA3005: ------------------ | Branch (1320:7): [True: 0, False: 972] ------------------ 1321| 0| return if_match(req, "X520.Title", {2, 5, 4, 12}); 1322| 0| case 0xA323F: ------------------ | Branch (1322:7): [True: 0, False: 972] ------------------ 1323| 0| return if_match(req, "X509v3.NameConstraints", {2, 5, 29, 30}); 1324| 0| case 0xA3C55: ------------------ | Branch (1324:7): [True: 0, False: 972] ------------------ 1325| 0| return if_match(req, "X520.Pseudonym", {2, 5, 4, 65}); 1326| 0| case 0xA4809: ------------------ | Branch (1326:7): [True: 0, False: 972] ------------------ 1327| 0| return if_match(req, "SphincsPlus-sha2-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 2, 6}); 1328| 0| case 0xA57AF: ------------------ | Branch (1328:7): [True: 0, False: 972] ------------------ 1329| 0| return if_match(req, "secp521r1", {1, 3, 132, 0, 35}); 1330| 0| case 0xA5DA9: ------------------ | Branch (1330:7): [True: 0, False: 972] ------------------ 1331| 0| return if_match(req, "SphincsPlus-shake-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 1, 6}); 1332| 0| case 0xA6865: ------------------ | Branch (1332:7): [True: 0, False: 972] ------------------ 1333| 0| return if_match(req, "Camellia-128/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 6}); 1334| 0| case 0xA6C61: ------------------ | Branch (1334:7): [True: 0, False: 972] ------------------ 1335| 0| return if_match(req, "SM4/GCM", {1, 2, 156, 10197, 1, 104, 8}); 1336| 0| case 0xA8439: ------------------ | Branch (1336:7): [True: 0, False: 972] ------------------ 1337| 0| return if_match(req, "PKCS12.CertBag", {1, 2, 840, 113549, 1, 12, 10, 1, 3}); 1338| 0| case 0xA9061: ------------------ | Branch (1338:7): [True: 0, False: 972] ------------------ 1339| 0| return if_match(req, "Kyber-768-90s-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 11, 2}); 1340| 0| case 0xAA995: ------------------ | Branch (1340:7): [True: 0, False: 972] ------------------ 1341| 0| return if_match(req, "Camellia-192/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 7}); 1342| 0| case 0xAAE2B: ------------------ | Branch (1342:7): [True: 0, False: 972] ------------------ 1343| 0| return if_match(req, "Dilithium-8x7-AES-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 10, 3}); 1344| 0| case 0xABCED: ------------------ | Branch (1344:7): [True: 0, False: 972] ------------------ 1345| 0| return if_match(req, "GOST.IssuerSigningTool", {1, 2, 643, 100, 112}); 1346| 0| case 0xABD24: ------------------ | Branch (1346:7): [True: 0, False: 972] ------------------ 1347| 0| return if_match(req, "RSA/OAEP", {1, 2, 840, 113549, 1, 1, 7}); 1348| 0| case 0xAC2EC: ------------------ | Branch (1348:7): [True: 0, False: 972] ------------------ 1349| 0| return if_match(req, "Streebog-256", {1, 2, 643, 7, 1, 1, 2, 2}); 1350| 0| case 0xAC3DD: ------------------ | Branch (1350:7): [True: 0, False: 972] ------------------ 1351| 0| return if_match(req, "Certificate Comment", {2, 16, 840, 1, 113730, 1, 13}); 1352| 0| case 0xAC511: ------------------ | Branch (1352:7): [True: 0, False: 972] ------------------ 1353| 0| return if_match(req, "PBE-SHA1-3DES", {1, 2, 840, 113549, 1, 12, 1, 3}); 1354| 0| case 0xAE6FE: ------------------ | Branch (1354:7): [True: 0, False: 972] ------------------ 1355| 0| return if_match(req, "PKIX.ClientAuth", {1, 3, 6, 1, 5, 5, 7, 3, 2}); 1356| 0| case 0xAE8D3: ------------------ | Branch (1356:7): [True: 0, False: 972] ------------------ 1357| 0| return if_match(req, "ClassicMcEliece_8192128pcf", {1, 3, 6, 1, 4, 1, 25258, 1, 18, 6}); 1358| 0| case 0xAF476: ------------------ | Branch (1358:7): [True: 0, False: 972] ------------------ 1359| 0| return if_match(req, "ECDH", {1, 3, 132, 1, 12}); 1360| 0| case 0xAFA6A: ------------------ | Branch (1360:7): [True: 0, False: 972] ------------------ 1361| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(384))", {2, 16, 840, 1, 101, 3, 4, 3, 15}); 1362| 0| case 0xB2217: ------------------ | Branch (1362:7): [True: 0, False: 972] ------------------ 1363| 0| return if_match(req, "AES-256/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 3}); 1364| 0| case 0xB22F7: ------------------ | Branch (1364:7): [True: 0, False: 972] ------------------ 1365| 0| return if_match(req, "Camellia-128/GCM", {0, 3, 4401, 5, 3, 1, 9, 6}); 1366| 0| case 0xB23DE: ------------------ | Branch (1366:7): [True: 0, False: 972] ------------------ 1367| 0| return if_match(req, "X520.Locality", {2, 5, 4, 7}); 1368| 0| case 0xB2FBD: ------------------ | Branch (1368:7): [True: 0, False: 972] ------------------ 1369| 0| return if_match(req, "ECKCDSA/SHA-224", {1, 2, 410, 200004, 1, 100, 4, 4}); 1370| 0| case 0xB32B0: ------------------ | Branch (1370:7): [True: 0, False: 972] ------------------ 1371| 0| return if_match(req, "ECKCDSA/SHA-256", {1, 2, 410, 200004, 1, 100, 4, 5}); 1372| 0| case 0xB360E: ------------------ | Branch (1372:7): [True: 0, False: 972] ------------------ 1373| 0| return if_match(req, "eFrodoKEM-976-SHAKE", {1, 3, 6, 1, 4, 1, 25258, 1, 16, 2}); 1374| 0| case 0xB4368: ------------------ | Branch (1374:7): [True: 0, False: 972] ------------------ 1375| 0| return if_match(req, "ECGDSA/SHA-1", {1, 3, 36, 3, 3, 2, 5, 4, 2}); 1376| 0| case 0xB58CD: ------------------ | Branch (1376:7): [True: 0, False: 972] ------------------ 1377| 0| return if_match(req, "RSA/PKCS1v15(SHA-3(512))", {2, 16, 840, 1, 101, 3, 4, 3, 16}); 1378| 0| case 0xB6427: ------------------ | Branch (1378:7): [True: 0, False: 972] ------------------ 1379| 0| return if_match(req, "Camellia-192/GCM", {0, 3, 4401, 5, 3, 1, 9, 26}); 1380| 0| case 0xB7102: ------------------ | Branch (1380:7): [True: 0, False: 972] ------------------ 1381| 0| return if_match(req, "brainpool224r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 5}); 1382| 0| case 0xB710D: ------------------ | Branch (1382:7): [True: 0, False: 972] ------------------ 1383| 0| return if_match(req, "X509v3.CRLIssuingDistributionPoint", {2, 5, 29, 28}); 1384| 0| case 0xB72D4: ------------------ | Branch (1384:7): [True: 0, False: 972] ------------------ 1385| 0| return if_match(req, "Microsoft UPN", {1, 3, 6, 1, 4, 1, 311, 20, 2, 3}); 1386| 0| case 0xB73A5: ------------------ | Branch (1386:7): [True: 0, False: 972] ------------------ 1387| 0| return if_match(req, "RSA/PSS", {1, 2, 840, 113549, 1, 1, 10}); 1388| 0| case 0xB84B3: ------------------ | Branch (1388:7): [True: 0, False: 972] ------------------ 1389| 0| return if_match(req, "PKIX.CodeSigning", {1, 3, 6, 1, 5, 5, 7, 3, 3}); 1390| 0| case 0xB8CB9: ------------------ | Branch (1390:7): [True: 0, False: 972] ------------------ 1391| 0| return if_match(req, "GOST-34.10-2012-256", {1, 2, 643, 7, 1, 1, 1, 1}); 1392| 0| case 0xB945C: ------------------ | Branch (1392:7): [True: 0, False: 972] ------------------ 1393| 0| return if_match(req, "Twofish/SIV", {1, 3, 6, 1, 4, 1, 25258, 3, 4, 5}); 1394| 0| case 0xB94E4: ------------------ | Branch (1394:7): [True: 0, False: 972] ------------------ 1395| 0| return if_match(req, "gost_512A", {1, 2, 643, 7, 1, 2, 1, 2, 1}); 1396| 0| case 0xB94E5: ------------------ | Branch (1396:7): [True: 0, False: 972] ------------------ 1397| 0| return if_match(req, "gost_512B", {1, 2, 643, 7, 1, 2, 1, 2, 2}); 1398| 0| case 0xBA1D8: ------------------ | Branch (1398:7): [True: 0, False: 972] ------------------ 1399| 0| return if_match(req, "X520.StreetAddress", {2, 5, 4, 9}); 1400| 0| case 0xBCB45: ------------------ | Branch (1400:7): [True: 0, False: 972] ------------------ 1401| 0| return if_match(req, "PKCS12.CRLBag", {1, 2, 840, 113549, 1, 12, 10, 1, 4}); 1402| 0| case 0xBCC82: ------------------ | Branch (1402:7): [True: 0, False: 972] ------------------ 1403| 0| return if_match(req, "x962_p239v1", {1, 2, 840, 10045, 3, 1, 4}); 1404| 0| case 0xBCC83: ------------------ | Branch (1404:7): [True: 0, False: 972] ------------------ 1405| 0| return if_match(req, "x962_p239v2", {1, 2, 840, 10045, 3, 1, 5}); 1406| 0| case 0xBCC84: ------------------ | Branch (1406:7): [True: 0, False: 972] ------------------ 1407| 0| return if_match(req, "x962_p239v3", {1, 2, 840, 10045, 3, 1, 6}); 1408| 0| case 0xBD92B: ------------------ | Branch (1408:7): [True: 0, False: 972] ------------------ 1409| 0| return if_match(req, "X509v3.HoldInstructionCode", {2, 5, 29, 23}); 1410| 0| case 0xBDCA9: ------------------ | Branch (1410:7): [True: 0, False: 972] ------------------ 1411| 0| return if_match(req, "AES-256/GCM", {2, 16, 840, 1, 101, 3, 4, 1, 46}); 1412| 0| case 0xBE48D: ------------------ | Branch (1412:7): [True: 0, False: 972] ------------------ 1413| 0| return if_match(req, "PKIX.OCSP.BasicResponse", {1, 3, 6, 1, 5, 5, 7, 48, 1, 1}); 1414| 0| case 0xBF71E: ------------------ | Branch (1414:7): [True: 0, False: 972] ------------------ 1415| 0| return if_match(req, "Kyber-1024-r3", {1, 3, 6, 1, 4, 1, 25258, 1, 7, 3}); 1416| 0| case 0xBFF01: ------------------ | Branch (1416:7): [True: 0, False: 972] ------------------ 1417| 0| return if_match(req, "DSA/SHA-3(224)", {2, 16, 840, 1, 101, 3, 4, 3, 5}); 1418| 0| case 0xC0F4F: ------------------ | Branch (1418:7): [True: 0, False: 972] ------------------ 1419| 0| return if_match(req, "SphincsPlus-haraka-256f-r3.1", {1, 3, 6, 1, 4, 1, 25258, 1, 12, 3, 6}); 1420| 0| case 0xC1875: ------------------ | Branch (1420:7): [True: 0, False: 972] ------------------ 1421| 0| return if_match(req, "SHA-1", {1, 3, 14, 3, 2, 26}); 1422| 0| case 0xC28D1: ------------------ | Branch (1422:7): [True: 0, False: 972] ------------------ 1423| 0| return if_match(req, "PKIX.OCSPSigning", {1, 3, 6, 1, 5, 5, 7, 3, 9}); 1424| 0| case 0xC42CA: ------------------ | Branch (1424:7): [True: 0, False: 972] ------------------ 1425| 0| return if_match(req, "brainpool256r1", {1, 3, 36, 3, 3, 2, 8, 1, 1, 7}); 1426| 0| default: ------------------ | Branch (1426:7): [True: 0, False: 972] ------------------ 1427| 0| return {}; 1428| 972| } 1429| 972|} _ZN5Botan7OID_Map16load_oid2str_mapEv: 1431| 1|std::unordered_map OID_Map::load_oid2str_map() { 1432| 1| return { 1433| 1| {OID{2, 5, 8, 1, 1}, "RSA"}, 1434| 1| {OID{1, 3, 6, 1, 4, 1, 8301, 3, 1, 2, 9, 0, 38}, "secp521r1"}, 1435| 1| {OID{1, 2, 643, 2, 2, 35, 1}, "gost_256A"}, 1436| 1| {OID{1, 2, 643, 2, 2, 36, 0}, "gost_256A"}, 1437| 1| }; 1438| 1|} _ZN5Botan7OID_Map16load_str2oid_mapEv: 1440| 1|std::unordered_map OID_Map::load_str2oid_map() { 1441| 1| return { 1442| 1| {"Curve25519", OID{1, 3, 101, 110}}, 1443| 1| {"SM2_Sig", OID{1, 2, 156, 10197, 1, 301, 1}}, 1444| 1| {"RSA/EMSA3(MD2)", OID{1, 2, 840, 113549, 1, 1, 2}}, 1445| 1| {"RSA/EMSA3(MD5)", OID{1, 2, 840, 113549, 1, 1, 4}}, 1446| 1| {"RSA/EMSA3(SHA-1)", OID{1, 2, 840, 113549, 1, 1, 5}}, 1447| 1| {"RSA/EMSA3(SHA-256)", OID{1, 2, 840, 113549, 1, 1, 11}}, 1448| 1| {"RSA/EMSA3(SHA-384)", OID{1, 2, 840, 113549, 1, 1, 12}}, 1449| 1| {"RSA/EMSA3(SHA-512)", OID{1, 2, 840, 113549, 1, 1, 13}}, 1450| 1| {"RSA/EMSA3(SHA-224)", OID{1, 2, 840, 113549, 1, 1, 14}}, 1451| 1| {"RSA/EMSA3(SHA-512-256)", OID{1, 2, 840, 113549, 1, 1, 16}}, 1452| 1| {"RSA/EMSA3(SHA-3(224))", OID{2, 16, 840, 1, 101, 3, 4, 3, 13}}, 1453| 1| {"RSA/EMSA3(SHA-3(256))", OID{2, 16, 840, 1, 101, 3, 4, 3, 14}}, 1454| 1| {"RSA/EMSA3(SHA-3(384))", OID{2, 16, 840, 1, 101, 3, 4, 3, 15}}, 1455| 1| {"RSA/EMSA3(SHA-3(512))", OID{2, 16, 840, 1, 101, 3, 4, 3, 16}}, 1456| 1| {"RSA/EMSA3(SM3)", OID{1, 2, 156, 10197, 1, 504}}, 1457| 1| {"RSA/EMSA3(RIPEMD-160)", OID{1, 3, 36, 3, 3, 1, 2}}, 1458| 1| {"RSA/EMSA4", OID{1, 2, 840, 113549, 1, 1, 10}}, 1459| 1| {"PBES2", OID{1, 2, 840, 113549, 1, 5, 13}}, 1460| 1| }; 1461| 1|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchERKNS_3OIDESt16initializer_listIjENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE: 18| 859|std::optional if_match(const OID& oid, std::initializer_list val, std::string_view name) { 19| 859| if(oid.matches(val)) { ------------------ | Branch (19:7): [True: 562, False: 297] ------------------ 20| 562| return name; 21| 562| } else { 22| 297| return {}; 23| 297| } 24| 859|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_113hash_oid_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 34| 972|uint32_t hash_oid_name(std::string_view s) { 35| 972| uint64_t hash = 0x8188B31879A4879A; 36| | 37| 27.7k| for(const char c : s) { ------------------ | Branch (37:21): [True: 27.7k, False: 972] ------------------ 38| 27.7k| hash *= 251; 39| 27.7k| hash += c; 40| 27.7k| } 41| | 42| 972| return static_cast(hash % 805289); 43| 972|} static_oids.cpp:_ZN5Botan12_GLOBAL__N_18if_matchENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_St16initializer_listIjE: 26| 972|std::optional if_match(std::string_view req, std::string_view actual, std::initializer_list oid) { 27| 972| if(req == actual) { ------------------ | Branch (27:7): [True: 972, False: 0] ------------------ 28| 972| return OID(oid); 29| 972| } else { 30| 0| return {}; 31| 0| } 32| 972|} _ZN5Botan20Buffered_Computation9update_beEj: 24| 44|void Buffered_Computation::update_be(uint32_t val) { 25| 44| uint8_t inb[sizeof(val)]; 26| 44| store_be(val, inb); 27| 44| add_data({inb, sizeof(inb)}); 28| 44|} _ZN5Botan20Buffered_Computation5finalENSt3__14spanIhLm18446744073709551615EEE: 54| 3.06k|void Buffered_Computation::final(std::span out) { 55| 3.06k| BOTAN_ARG_CHECK(out.size() >= output_length(), "provided output buffer has insufficient capacity"); ------------------ | | 35| 3.06k| do { \ | | 36| 3.06k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3.06k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3.06k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.06k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.06k] | | ------------------ ------------------ 56| 3.06k| final_result(out); 57| 3.06k|} _ZN5Botan18SymmetricAlgorithm7set_keyENSt3__14spanIKhLm18446744073709551615EEE: 22| 424|void SymmetricAlgorithm::set_key(std::span key) { 23| 424| if(!valid_keylength(key.size())) { ------------------ | Branch (23:7): [True: 0, False: 424] ------------------ 24| 0| throw Invalid_Key_Length(name(), key.size()); 25| 0| } 26| 424| key_schedule(key); 27| 424|} _ZN5Botan11OctetStringC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 27| 295|OctetString::OctetString(std::string_view hex_string) { 28| 295| if(!hex_string.empty()) { ------------------ | Branch (28:7): [True: 0, False: 295] ------------------ 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| 295|} _ZNK5Botan7AES_25611parallelismEv: 815| 71|size_t AES_256::parallelism() const { 816| 71| return aes_parallelism(); 817| 71|} _ZNK5Botan7AES_12819has_keying_materialEv: 819| 25|bool AES_128::has_keying_material() const { 820| 25| return !m_EK.empty(); 821| 25|} _ZNK5Botan7AES_25619has_keying_materialEv: 827| 431|bool AES_256::has_keying_material() const { 828| 431| return !m_EK.empty(); 829| 431|} _ZNK5Botan7AES_1289encrypt_nEPKhPhm: 831| 25|void AES_128::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 832| 25| assert_key_material_set(); 833| | 834| 25|#if defined(BOTAN_HAS_AES_VAES) 835| 25| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (835:7): [True: 0, False: 25] ------------------ 836| 0| return x86_vaes_encrypt_n(in, out, blocks); 837| 0| } 838| 25|#endif 839| | 840| 25|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 841| 25| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (841:7): [True: 25, False: 0] ------------------ 842| 25| return hw_aes_encrypt_n(in, out, blocks); 843| 25| } 844| 0|#endif 845| | 846| 0|#if defined(BOTAN_HAS_AES_VPERM) 847| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (847:7): [True: 0, False: 0] ------------------ 848| 0| return vperm_encrypt_n(in, out, blocks); 849| 0| } 850| 0|#endif 851| | 852| 0| aes_encrypt_n(in, out, blocks, m_EK); 853| 0|} _ZN5Botan7AES_12812key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 879| 4|void AES_128::key_schedule(std::span key) { 880| 4|#if defined(BOTAN_HAS_AES_NI) 881| 4| if(CPUID::has(CPUID::Feature::AESNI)) { ------------------ | Branch (881:7): [True: 4, False: 0] ------------------ 882| 4| return aesni_key_schedule(key.data(), key.size()); 883| 4| } 884| 0|#endif 885| | 886| 0|#if defined(BOTAN_HAS_AES_VAES) 887| 0| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (887:7): [True: 0, False: 0] ------------------ 888| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, true); 889| 0| } 890| 0|#endif 891| | 892| 0|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 893| 0| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (893:7): [True: 0, False: 0] ------------------ 894| 0| constexpr bool is_little_endian = std::endian::native == std::endian::little; 895| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, is_little_endian); 896| 0| } 897| 0|#endif 898| | 899| 0|#if defined(BOTAN_HAS_AES_VPERM) 900| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (900:7): [True: 0, False: 0] ------------------ 901| 0| return vperm_key_schedule(key.data(), key.size()); 902| 0| } 903| 0|#endif 904| | 905| 0| aes_key_schedule(key.data(), key.size(), m_EK, m_DK); 906| 0|} _ZNK5Botan7AES_2569encrypt_nEPKhPhm: 995| 221|void AES_256::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 996| 221| assert_key_material_set(); 997| | 998| 221|#if defined(BOTAN_HAS_AES_VAES) 999| 221| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (999:7): [True: 0, False: 221] ------------------ 1000| 0| return x86_vaes_encrypt_n(in, out, blocks); 1001| 0| } 1002| 221|#endif 1003| | 1004| 221|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1005| 221| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1005:7): [True: 221, False: 0] ------------------ 1006| 221| return hw_aes_encrypt_n(in, out, blocks); 1007| 221| } 1008| 0|#endif 1009| | 1010| 0|#if defined(BOTAN_HAS_AES_VPERM) 1011| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1011:7): [True: 0, False: 0] ------------------ 1012| 0| return vperm_encrypt_n(in, out, blocks); 1013| 0| } 1014| 0|#endif 1015| | 1016| 0| aes_encrypt_n(in, out, blocks, m_EK); 1017| 0|} _ZNK5Botan7AES_2569decrypt_nEPKhPhm: 1019| 3|void AES_256::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 1020| 3| assert_key_material_set(); 1021| | 1022| 3|#if defined(BOTAN_HAS_AES_VAES) 1023| 3| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (1023:7): [True: 0, False: 3] ------------------ 1024| 0| return x86_vaes_decrypt_n(in, out, blocks); 1025| 0| } 1026| 3|#endif 1027| | 1028| 3|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1029| 3| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1029:7): [True: 3, False: 0] ------------------ 1030| 3| return hw_aes_decrypt_n(in, out, blocks); 1031| 3| } 1032| 0|#endif 1033| | 1034| 0|#if defined(BOTAN_HAS_AES_VPERM) 1035| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1035:7): [True: 0, False: 0] ------------------ 1036| 0| return vperm_decrypt_n(in, out, blocks); 1037| 0| } 1038| 0|#endif 1039| | 1040| 0| aes_decrypt_n(in, out, blocks, m_DK); 1041| 0|} _ZN5Botan7AES_25612key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 1043| 57|void AES_256::key_schedule(std::span key) { 1044| 57|#if defined(BOTAN_HAS_AES_NI) 1045| 57| if(CPUID::has(CPUID::Feature::AESNI)) { ------------------ | Branch (1045:7): [True: 57, False: 0] ------------------ 1046| 57| return aesni_key_schedule(key.data(), key.size()); 1047| 57| } 1048| 0|#endif 1049| | 1050| 0|#if defined(BOTAN_HAS_AES_VAES) 1051| 0| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (1051:7): [True: 0, False: 0] ------------------ 1052| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, true); 1053| 0| } 1054| 0|#endif 1055| | 1056| 0|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 1057| 0| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (1057:7): [True: 0, False: 0] ------------------ 1058| 0| constexpr bool is_little_endian = std::endian::native == std::endian::little; 1059| 0| return aes_key_schedule(key.data(), key.size(), m_EK, m_DK, is_little_endian); 1060| 0| } 1061| 0|#endif 1062| | 1063| 0|#if defined(BOTAN_HAS_AES_VPERM) 1064| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (1064:7): [True: 0, False: 0] ------------------ 1065| 0| return vperm_key_schedule(key.data(), key.size()); 1066| 0| } 1067| 0|#endif 1068| | 1069| 0| aes_key_schedule(key.data(), key.size(), m_EK, m_DK); 1070| 0|} aes.cpp:_ZN5Botan12_GLOBAL__N_115aes_parallelismEv: 748| 71|size_t aes_parallelism() { 749| 71|#if defined(BOTAN_HAS_AES_VAES) 750| 71| if(CPUID::has(CPUID::Feature::AVX2_AES)) { ------------------ | Branch (750:7): [True: 0, False: 71] ------------------ 751| 0| return 8; // pipelined 752| 0| } 753| 71|#endif 754| | 755| 71|#if defined(BOTAN_HAS_HW_AES_SUPPORT) 756| 71| if(CPUID::has(CPUID::Feature::HW_AES)) { ------------------ | Branch (756:7): [True: 71, False: 0] ------------------ 757| 71| return 4; // pipelined 758| 71| } 759| 0|#endif 760| | 761| 0|#if defined(BOTAN_HAS_AES_VPERM) 762| 0| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (762:7): [True: 0, False: 0] ------------------ 763| 0| return 2; // pipelined 764| 0| } 765| 0|#endif 766| | 767| | // bitsliced: 768| 0| return 2; 769| 0|} _ZNK5Botan7AES_12816hw_aes_encrypt_nEPKhPhm: 134| 25|BOTAN_FN_ISA_AESNI void AES_128::hw_aes_encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 135| 25| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_EK[4 * 0]); 136| 25| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_EK[4 * 1]); 137| 25| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_EK[4 * 2]); 138| 25| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_EK[4 * 3]); 139| 25| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_EK[4 * 4]); 140| 25| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_EK[4 * 5]); 141| 25| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_EK[4 * 6]); 142| 25| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_EK[4 * 7]); 143| 25| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_EK[4 * 8]); 144| 25| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_EK[4 * 9]); 145| 25| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_EK[4 * 10]); 146| | 147| 25| while(blocks >= 4) { ------------------ | Branch (147:10): [True: 0, False: 25] ------------------ 148| 0| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 149| 0| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 150| 0| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 151| 0| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 152| | 153| 0| keyxor(K0, B0, B1, B2, B3); 154| 0| aesenc(K1, B0, B1, B2, B3); 155| 0| aesenc(K2, B0, B1, B2, B3); 156| 0| aesenc(K3, B0, B1, B2, B3); 157| 0| aesenc(K4, B0, B1, B2, B3); 158| 0| aesenc(K5, B0, B1, B2, B3); 159| 0| aesenc(K6, B0, B1, B2, B3); 160| 0| aesenc(K7, B0, B1, B2, B3); 161| 0| aesenc(K8, B0, B1, B2, B3); 162| 0| aesenc(K9, B0, B1, B2, B3); 163| 0| aesenclast(K10, B0, B1, B2, B3); 164| | 165| 0| B0.store_le(out + 16 * 0); 166| 0| B1.store_le(out + 16 * 1); 167| 0| B2.store_le(out + 16 * 2); 168| 0| B3.store_le(out + 16 * 3); 169| | 170| 0| blocks -= 4; 171| 0| in += 4 * 16; 172| 0| out += 4 * 16; 173| 0| } 174| | 175| 50| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (175:22): [True: 25, False: 25] ------------------ 176| 25| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 177| | 178| 25| B0 ^= K0; 179| 25| aesenc(K1, B0); 180| 25| aesenc(K2, B0); 181| 25| aesenc(K3, B0); 182| 25| aesenc(K4, B0); 183| 25| aesenc(K5, B0); 184| 25| aesenc(K6, B0); 185| 25| aesenc(K7, B0); 186| 25| aesenc(K8, B0); 187| 25| aesenc(K9, B0); 188| 25| aesenclast(K10, B0); 189| | 190| 25| B0.store_le(out + 16 * i); 191| 25| } 192| 25|} _ZN5Botan7AES_12818aesni_key_scheduleEPKhm: 260| 4|BOTAN_FN_ISA_AESNI void AES_128::aesni_key_schedule(const uint8_t key[], size_t /*length*/) { 261| 4| m_EK.resize(44); 262| 4| m_DK.resize(44); 263| | 264| | // NOLINTBEGIN(portability-simd-intrinsics) TODO convert to using SIMD_4x32 265| | 266| 4| const __m128i K0 = _mm_loadu_si128(reinterpret_cast(key)); 267| 4| const __m128i K1 = aes_128_key_expansion<0x01>(K0, K0); 268| 4| const __m128i K2 = aes_128_key_expansion<0x02>(K1, K1); 269| 4| const __m128i K3 = aes_128_key_expansion<0x04>(K2, K2); 270| 4| const __m128i K4 = aes_128_key_expansion<0x08>(K3, K3); 271| 4| const __m128i K5 = aes_128_key_expansion<0x10>(K4, K4); 272| 4| const __m128i K6 = aes_128_key_expansion<0x20>(K5, K5); 273| 4| const __m128i K7 = aes_128_key_expansion<0x40>(K6, K6); 274| 4| const __m128i K8 = aes_128_key_expansion<0x80>(K7, K7); 275| 4| const __m128i K9 = aes_128_key_expansion<0x1B>(K8, K8); 276| 4| const __m128i K10 = aes_128_key_expansion<0x36>(K9, K9); 277| | 278| 4| __m128i* EK_mm = reinterpret_cast<__m128i*>(m_EK.data()); 279| 4| _mm_storeu_si128(EK_mm, K0); 280| 4| _mm_storeu_si128(EK_mm + 1, K1); 281| 4| _mm_storeu_si128(EK_mm + 2, K2); 282| 4| _mm_storeu_si128(EK_mm + 3, K3); 283| 4| _mm_storeu_si128(EK_mm + 4, K4); 284| 4| _mm_storeu_si128(EK_mm + 5, K5); 285| 4| _mm_storeu_si128(EK_mm + 6, K6); 286| 4| _mm_storeu_si128(EK_mm + 7, K7); 287| 4| _mm_storeu_si128(EK_mm + 8, K8); 288| 4| _mm_storeu_si128(EK_mm + 9, K9); 289| 4| _mm_storeu_si128(EK_mm + 10, K10); 290| | 291| | // Now generate decryption keys 292| | 293| 4| __m128i* DK_mm = reinterpret_cast<__m128i*>(m_DK.data()); 294| 4| _mm_storeu_si128(DK_mm, K10); 295| 4| _mm_storeu_si128(DK_mm + 1, _mm_aesimc_si128(K9)); 296| 4| _mm_storeu_si128(DK_mm + 2, _mm_aesimc_si128(K8)); 297| 4| _mm_storeu_si128(DK_mm + 3, _mm_aesimc_si128(K7)); 298| 4| _mm_storeu_si128(DK_mm + 4, _mm_aesimc_si128(K6)); 299| 4| _mm_storeu_si128(DK_mm + 5, _mm_aesimc_si128(K5)); 300| 4| _mm_storeu_si128(DK_mm + 6, _mm_aesimc_si128(K4)); 301| 4| _mm_storeu_si128(DK_mm + 7, _mm_aesimc_si128(K3)); 302| 4| _mm_storeu_si128(DK_mm + 8, _mm_aesimc_si128(K2)); 303| 4| _mm_storeu_si128(DK_mm + 9, _mm_aesimc_si128(K1)); 304| 4| _mm_storeu_si128(DK_mm + 10, K0); 305| | 306| | // NOLINTEND(portability-simd-intrinsics) 307| 4|} _ZNK5Botan7AES_25616hw_aes_encrypt_nEPKhPhm: 497| 221|BOTAN_FN_ISA_AESNI void AES_256::hw_aes_encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 498| 221| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_EK[4 * 0]); 499| 221| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_EK[4 * 1]); 500| 221| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_EK[4 * 2]); 501| 221| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_EK[4 * 3]); 502| 221| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_EK[4 * 4]); 503| 221| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_EK[4 * 5]); 504| 221| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_EK[4 * 6]); 505| 221| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_EK[4 * 7]); 506| 221| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_EK[4 * 8]); 507| 221| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_EK[4 * 9]); 508| 221| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_EK[4 * 10]); 509| 221| const SIMD_4x32 K11 = SIMD_4x32::load_le(&m_EK[4 * 11]); 510| 221| const SIMD_4x32 K12 = SIMD_4x32::load_le(&m_EK[4 * 12]); 511| 221| const SIMD_4x32 K13 = SIMD_4x32::load_le(&m_EK[4 * 13]); 512| 221| const SIMD_4x32 K14 = SIMD_4x32::load_le(&m_EK[4 * 14]); 513| | 514| 625| while(blocks >= 4) { ------------------ | Branch (514:10): [True: 404, False: 221] ------------------ 515| 404| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 516| 404| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 517| 404| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 518| 404| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 519| | 520| 404| keyxor(K0, B0, B1, B2, B3); 521| 404| aesenc(K1, B0, B1, B2, B3); 522| 404| aesenc(K2, B0, B1, B2, B3); 523| 404| aesenc(K3, B0, B1, B2, B3); 524| 404| aesenc(K4, B0, B1, B2, B3); 525| 404| aesenc(K5, B0, B1, B2, B3); 526| 404| aesenc(K6, B0, B1, B2, B3); 527| 404| aesenc(K7, B0, B1, B2, B3); 528| 404| aesenc(K8, B0, B1, B2, B3); 529| 404| aesenc(K9, B0, B1, B2, B3); 530| 404| aesenc(K10, B0, B1, B2, B3); 531| 404| aesenc(K11, B0, B1, B2, B3); 532| 404| aesenc(K12, B0, B1, B2, B3); 533| 404| aesenc(K13, B0, B1, B2, B3); 534| 404| aesenclast(K14, B0, B1, B2, B3); 535| | 536| 404| B0.store_le(out + 16 * 0); 537| 404| B1.store_le(out + 16 * 1); 538| 404| B2.store_le(out + 16 * 2); 539| 404| B3.store_le(out + 16 * 3); 540| | 541| 404| blocks -= 4; 542| 404| in += 4 * 16; 543| 404| out += 4 * 16; 544| 404| } 545| | 546| 341| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (546:22): [True: 120, False: 221] ------------------ 547| 120| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 548| | 549| 120| B0 ^= K0; 550| | 551| 120| aesenc(K1, B0); 552| 120| aesenc(K2, B0); 553| 120| aesenc(K3, B0); 554| 120| aesenc(K4, B0); 555| 120| aesenc(K5, B0); 556| 120| aesenc(K6, B0); 557| 120| aesenc(K7, B0); 558| 120| aesenc(K8, B0); 559| 120| aesenc(K9, B0); 560| 120| aesenc(K10, B0); 561| 120| aesenc(K11, B0); 562| 120| aesenc(K12, B0); 563| 120| aesenc(K13, B0); 564| 120| aesenclast(K14, B0); 565| | 566| 120| B0.store_le(out + 16 * i); 567| 120| } 568| 221|} _ZNK5Botan7AES_25616hw_aes_decrypt_nEPKhPhm: 573| 3|BOTAN_FN_ISA_AESNI void AES_256::hw_aes_decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 574| 3| const SIMD_4x32 K0 = SIMD_4x32::load_le(&m_DK[4 * 0]); 575| 3| const SIMD_4x32 K1 = SIMD_4x32::load_le(&m_DK[4 * 1]); 576| 3| const SIMD_4x32 K2 = SIMD_4x32::load_le(&m_DK[4 * 2]); 577| 3| const SIMD_4x32 K3 = SIMD_4x32::load_le(&m_DK[4 * 3]); 578| 3| const SIMD_4x32 K4 = SIMD_4x32::load_le(&m_DK[4 * 4]); 579| 3| const SIMD_4x32 K5 = SIMD_4x32::load_le(&m_DK[4 * 5]); 580| 3| const SIMD_4x32 K6 = SIMD_4x32::load_le(&m_DK[4 * 6]); 581| 3| const SIMD_4x32 K7 = SIMD_4x32::load_le(&m_DK[4 * 7]); 582| 3| const SIMD_4x32 K8 = SIMD_4x32::load_le(&m_DK[4 * 8]); 583| 3| const SIMD_4x32 K9 = SIMD_4x32::load_le(&m_DK[4 * 9]); 584| 3| const SIMD_4x32 K10 = SIMD_4x32::load_le(&m_DK[4 * 10]); 585| 3| const SIMD_4x32 K11 = SIMD_4x32::load_le(&m_DK[4 * 11]); 586| 3| const SIMD_4x32 K12 = SIMD_4x32::load_le(&m_DK[4 * 12]); 587| 3| const SIMD_4x32 K13 = SIMD_4x32::load_le(&m_DK[4 * 13]); 588| 3| const SIMD_4x32 K14 = SIMD_4x32::load_le(&m_DK[4 * 14]); 589| | 590| 7| while(blocks >= 4) { ------------------ | Branch (590:10): [True: 4, False: 3] ------------------ 591| 4| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * 0); 592| 4| SIMD_4x32 B1 = SIMD_4x32::load_le(in + 16 * 1); 593| 4| SIMD_4x32 B2 = SIMD_4x32::load_le(in + 16 * 2); 594| 4| SIMD_4x32 B3 = SIMD_4x32::load_le(in + 16 * 3); 595| | 596| 4| keyxor(K0, B0, B1, B2, B3); 597| 4| aesdec(K1, B0, B1, B2, B3); 598| 4| aesdec(K2, B0, B1, B2, B3); 599| 4| aesdec(K3, B0, B1, B2, B3); 600| 4| aesdec(K4, B0, B1, B2, B3); 601| 4| aesdec(K5, B0, B1, B2, B3); 602| 4| aesdec(K6, B0, B1, B2, B3); 603| 4| aesdec(K7, B0, B1, B2, B3); 604| 4| aesdec(K8, B0, B1, B2, B3); 605| 4| aesdec(K9, B0, B1, B2, B3); 606| 4| aesdec(K10, B0, B1, B2, B3); 607| 4| aesdec(K11, B0, B1, B2, B3); 608| 4| aesdec(K12, B0, B1, B2, B3); 609| 4| aesdec(K13, B0, B1, B2, B3); 610| 4| aesdeclast(K14, B0, B1, B2, B3); 611| | 612| 4| B0.store_le(out + 16 * 0); 613| 4| B1.store_le(out + 16 * 1); 614| 4| B2.store_le(out + 16 * 2); 615| 4| B3.store_le(out + 16 * 3); 616| | 617| 4| blocks -= 4; 618| 4| in += 4 * 16; 619| 4| out += 4 * 16; 620| 4| } 621| | 622| 8| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (622:22): [True: 5, False: 3] ------------------ 623| 5| SIMD_4x32 B0 = SIMD_4x32::load_le(in + 16 * i); 624| | 625| 5| B0 ^= K0; 626| | 627| 5| aesdec(K1, B0); 628| 5| aesdec(K2, B0); 629| 5| aesdec(K3, B0); 630| 5| aesdec(K4, B0); 631| 5| aesdec(K5, B0); 632| 5| aesdec(K6, B0); 633| 5| aesdec(K7, B0); 634| 5| aesdec(K8, B0); 635| 5| aesdec(K9, B0); 636| 5| aesdec(K10, B0); 637| 5| aesdec(K11, B0); 638| 5| aesdec(K12, B0); 639| 5| aesdec(K13, B0); 640| 5| aesdeclast(K14, B0); 641| | 642| 5| B0.store_le(out + 16 * i); 643| 5| } 644| 3|} _ZN5Botan7AES_25618aesni_key_scheduleEPKhm: 649| 57|BOTAN_FN_ISA_AESNI void AES_256::aesni_key_schedule(const uint8_t key[], size_t /*length*/) { 650| 57| m_EK.resize(60); 651| 57| m_DK.resize(60); 652| | 653| | // NOLINTBEGIN(portability-simd-intrinsics) TODO convert to using SIMD_4x32 654| | 655| 57| const __m128i K0 = _mm_loadu_si128(reinterpret_cast(key)); 656| 57| const __m128i K1 = _mm_loadu_si128(reinterpret_cast(key + 16)); 657| | 658| 57| const __m128i K2 = aes_128_key_expansion<0x01>(K0, K1); 659| 57| const __m128i K3 = aes_256_key_expansion(K1, K2); 660| | 661| 57| const __m128i K4 = aes_128_key_expansion<0x02>(K2, K3); 662| 57| const __m128i K5 = aes_256_key_expansion(K3, K4); 663| | 664| 57| const __m128i K6 = aes_128_key_expansion<0x04>(K4, K5); 665| 57| const __m128i K7 = aes_256_key_expansion(K5, K6); 666| | 667| 57| const __m128i K8 = aes_128_key_expansion<0x08>(K6, K7); 668| 57| const __m128i K9 = aes_256_key_expansion(K7, K8); 669| | 670| 57| const __m128i K10 = aes_128_key_expansion<0x10>(K8, K9); 671| 57| const __m128i K11 = aes_256_key_expansion(K9, K10); 672| | 673| 57| const __m128i K12 = aes_128_key_expansion<0x20>(K10, K11); 674| 57| const __m128i K13 = aes_256_key_expansion(K11, K12); 675| | 676| 57| const __m128i K14 = aes_128_key_expansion<0x40>(K12, K13); 677| | 678| 57| __m128i* EK_mm = reinterpret_cast<__m128i*>(m_EK.data()); 679| 57| _mm_storeu_si128(EK_mm, K0); 680| 57| _mm_storeu_si128(EK_mm + 1, K1); 681| 57| _mm_storeu_si128(EK_mm + 2, K2); 682| 57| _mm_storeu_si128(EK_mm + 3, K3); 683| 57| _mm_storeu_si128(EK_mm + 4, K4); 684| 57| _mm_storeu_si128(EK_mm + 5, K5); 685| 57| _mm_storeu_si128(EK_mm + 6, K6); 686| 57| _mm_storeu_si128(EK_mm + 7, K7); 687| 57| _mm_storeu_si128(EK_mm + 8, K8); 688| 57| _mm_storeu_si128(EK_mm + 9, K9); 689| 57| _mm_storeu_si128(EK_mm + 10, K10); 690| 57| _mm_storeu_si128(EK_mm + 11, K11); 691| 57| _mm_storeu_si128(EK_mm + 12, K12); 692| 57| _mm_storeu_si128(EK_mm + 13, K13); 693| 57| _mm_storeu_si128(EK_mm + 14, K14); 694| | 695| | // Now generate decryption keys 696| 57| __m128i* DK_mm = reinterpret_cast<__m128i*>(m_DK.data()); 697| 57| _mm_storeu_si128(DK_mm, K14); 698| 57| _mm_storeu_si128(DK_mm + 1, _mm_aesimc_si128(K13)); 699| 57| _mm_storeu_si128(DK_mm + 2, _mm_aesimc_si128(K12)); 700| 57| _mm_storeu_si128(DK_mm + 3, _mm_aesimc_si128(K11)); 701| 57| _mm_storeu_si128(DK_mm + 4, _mm_aesimc_si128(K10)); 702| 57| _mm_storeu_si128(DK_mm + 5, _mm_aesimc_si128(K9)); 703| 57| _mm_storeu_si128(DK_mm + 6, _mm_aesimc_si128(K8)); 704| 57| _mm_storeu_si128(DK_mm + 7, _mm_aesimc_si128(K7)); 705| 57| _mm_storeu_si128(DK_mm + 8, _mm_aesimc_si128(K6)); 706| 57| _mm_storeu_si128(DK_mm + 9, _mm_aesimc_si128(K5)); 707| 57| _mm_storeu_si128(DK_mm + 10, _mm_aesimc_si128(K4)); 708| 57| _mm_storeu_si128(DK_mm + 11, _mm_aesimc_si128(K3)); 709| 57| _mm_storeu_si128(DK_mm + 12, _mm_aesimc_si128(K2)); 710| 57| _mm_storeu_si128(DK_mm + 13, _mm_aesimc_si128(K1)); 711| 57| _mm_storeu_si128(DK_mm + 14, K0); 712| | 713| | // NOLINTEND(portability-simd-intrinsics) 714| 57|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16keyxorENS_9SIMD_4x32ERS1_S2_S2_S2_: 72| 408| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 73| 408| B0 ^= K; 74| 408| B1 ^= K; 75| 408| B2 ^= K; 76| 408| B3 ^= K; 77| 408|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesencENS_9SIMD_4x32ERS1_S2_S2_S2_: 84| 5.25k| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 85| 5.25k| B0 = SIMD_4x32(_mm_aesenc_si128(B0.raw(), K.raw())); 86| 5.25k| B1 = SIMD_4x32(_mm_aesenc_si128(B1.raw(), K.raw())); 87| 5.25k| B2 = SIMD_4x32(_mm_aesenc_si128(B2.raw(), K.raw())); 88| 5.25k| B3 = SIMD_4x32(_mm_aesenc_si128(B3.raw(), K.raw())); 89| 5.25k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesenclastENS_9SIMD_4x32ERS1_S2_S2_S2_: 96| 404| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 97| 404| B0 = SIMD_4x32(_mm_aesenclast_si128(B0.raw(), K.raw())); 98| 404| B1 = SIMD_4x32(_mm_aesenclast_si128(B1.raw(), K.raw())); 99| 404| B2 = SIMD_4x32(_mm_aesenclast_si128(B2.raw(), K.raw())); 100| 404| B3 = SIMD_4x32(_mm_aesenclast_si128(B3.raw(), K.raw())); 101| 404|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesencENS_9SIMD_4x32ERS1_: 79| 1.78k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesenc(SIMD_4x32 K, SIMD_4x32& B) { 80| 1.78k| B = SIMD_4x32(_mm_aesenc_si128(B.raw(), K.raw())); 81| 1.78k|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesenclastENS_9SIMD_4x32ERS1_: 91| 145|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesenclast(SIMD_4x32 K, SIMD_4x32& B) { 92| 145| B = SIMD_4x32(_mm_aesenclast_si128(B.raw(), K.raw())); 93| 145|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesdecENS_9SIMD_4x32ERS1_S2_S2_S2_: 108| 52| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 109| 52| B0 = SIMD_4x32(_mm_aesdec_si128(B0.raw(), K.raw())); 110| 52| B1 = SIMD_4x32(_mm_aesdec_si128(B1.raw(), K.raw())); 111| 52| B2 = SIMD_4x32(_mm_aesdec_si128(B2.raw(), K.raw())); 112| 52| B3 = SIMD_4x32(_mm_aesdec_si128(B3.raw(), K.raw())); 113| 52|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesdeclastENS_9SIMD_4x32ERS1_S2_S2_S2_: 120| 4| SIMD_4x32 K, SIMD_4x32& B0, SIMD_4x32& B1, SIMD_4x32& B2, SIMD_4x32& B3) { 121| 4| B0 = SIMD_4x32(_mm_aesdeclast_si128(B0.raw(), K.raw())); 122| 4| B1 = SIMD_4x32(_mm_aesdeclast_si128(B1.raw(), K.raw())); 123| 4| B2 = SIMD_4x32(_mm_aesdeclast_si128(B2.raw(), K.raw())); 124| 4| B3 = SIMD_4x32(_mm_aesdeclast_si128(B3.raw(), K.raw())); 125| 4|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_16aesdecENS_9SIMD_4x32ERS1_: 103| 65|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesdec(SIMD_4x32 K, SIMD_4x32& B) { 104| 65| B = SIMD_4x32(_mm_aesdec_si128(B.raw(), K.raw())); 105| 65|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_110aesdeclastENS_9SIMD_4x32ERS1_: 115| 5|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AESNI void aesdeclast(SIMD_4x32 K, SIMD_4x32& B) { 116| 5| B = SIMD_4x32(_mm_aesdeclast_si128(B.raw(), K.raw())); 117| 5|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_256_key_expansionEDv2_xS1_: 61| 342|BOTAN_FN_ISA_AESNI __m128i aes_256_key_expansion(__m128i key, __m128i key2) { 62| 342| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key2, 0x00); 63| 342| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(2, 2, 2, 2)); 64| | 65| 342| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 66| 342| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 67| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 68| 342| return _mm_xor_si128(key, key_with_rcon); 69| 342|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh1EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh2EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh4EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh8EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh16EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh32EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh64EEEDv2_xS2_S2_: 22| 61|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 61| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 61| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 61| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 61| return _mm_xor_si128(key, key_with_rcon); 29| 61|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh128EEEDv2_xS2_S2_: 22| 4|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 4| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 4| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 4| return _mm_xor_si128(key, key_with_rcon); 29| 4|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh27EEEDv2_xS2_S2_: 22| 4|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 4| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 4| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 4| return _mm_xor_si128(key, key_with_rcon); 29| 4|} aes_ni.cpp:_ZN5Botan12_GLOBAL__N_121aes_128_key_expansionILh54EEEDv2_xS2_S2_: 22| 4|BOTAN_FN_ISA_AESNI inline __m128i aes_128_key_expansion(__m128i key, __m128i key_getting_rcon) { 23| 4| __m128i key_with_rcon = _mm_aeskeygenassist_si128(key_getting_rcon, RC); 24| 4| key_with_rcon = _mm_shuffle_epi32(key_with_rcon, _MM_SHUFFLE(3, 3, 3, 3)); 25| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 26| 4| key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 27| | key = _mm_xor_si128(key, _mm_slli_si128(key, 4)); 28| 4| return _mm_xor_si128(key, key_with_rcon); 29| 4|} _ZN5Botan11BlockCipher6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 96| 63|std::unique_ptr BlockCipher::create(std::string_view algo, std::string_view provider) { 97| |#if defined(BOTAN_HAS_COMMONCRYPTO) 98| | if(provider.empty() || provider == "commoncrypto") { 99| | if(auto bc = make_commoncrypto_block_cipher(algo)) 100| | return bc; 101| | 102| | if(!provider.empty()) 103| | return nullptr; 104| | } 105| |#endif 106| | 107| | // TODO: CryptoAPI 108| | // TODO: /dev/crypto 109| | 110| | // Only base providers from here on out 111| 63| if(provider.empty() == false && provider != "base") { ------------------ | Branch (111:7): [True: 0, False: 63] | Branch (111:36): [True: 0, False: 0] ------------------ 112| 0| return nullptr; 113| 0| } 114| | 115| 63|#if defined(BOTAN_HAS_AES) 116| 63| if(algo == "AES-128") { ------------------ | Branch (116:7): [True: 4, False: 59] ------------------ 117| 4| return std::make_unique(); 118| 4| } 119| | 120| 59| if(algo == "AES-192") { ------------------ | Branch (120:7): [True: 0, False: 59] ------------------ 121| 0| return std::make_unique(); 122| 0| } 123| | 124| 59| if(algo == "AES-256") { ------------------ | Branch (124:7): [True: 57, False: 2] ------------------ 125| 57| return std::make_unique(); 126| 57| } 127| 2|#endif 128| | 129| 2|#if defined(BOTAN_HAS_ARIA) 130| 2| if(algo == "ARIA-128") { ------------------ | Branch (130:7): [True: 0, False: 2] ------------------ 131| 0| return std::make_unique(); 132| 0| } 133| | 134| 2| if(algo == "ARIA-192") { ------------------ | Branch (134:7): [True: 0, False: 2] ------------------ 135| 0| return std::make_unique(); 136| 0| } 137| | 138| 2| if(algo == "ARIA-256") { ------------------ | Branch (138:7): [True: 0, False: 2] ------------------ 139| 0| return std::make_unique(); 140| 0| } 141| 2|#endif 142| | 143| 2|#if defined(BOTAN_HAS_SERPENT) 144| 2| if(algo == "Serpent") { ------------------ | Branch (144:7): [True: 0, False: 2] ------------------ 145| 0| return std::make_unique(); 146| 0| } 147| 2|#endif 148| | 149| 2|#if defined(BOTAN_HAS_SHACAL2) 150| 2| if(algo == "SHACAL2") { ------------------ | Branch (150:7): [True: 0, False: 2] ------------------ 151| 0| return std::make_unique(); 152| 0| } 153| 2|#endif 154| | 155| 2|#if defined(BOTAN_HAS_TWOFISH) 156| 2| if(algo == "Twofish") { ------------------ | Branch (156:7): [True: 0, False: 2] ------------------ 157| 0| return std::make_unique(); 158| 0| } 159| 2|#endif 160| | 161| 2|#if defined(BOTAN_HAS_THREEFISH_512) 162| 2| if(algo == "Threefish-512") { ------------------ | Branch (162:7): [True: 0, False: 2] ------------------ 163| 0| return std::make_unique(); 164| 0| } 165| 2|#endif 166| | 167| 2|#if defined(BOTAN_HAS_BLOWFISH) 168| 2| if(algo == "Blowfish") { ------------------ | Branch (168:7): [True: 0, False: 2] ------------------ 169| 0| return std::make_unique(); 170| 0| } 171| 2|#endif 172| | 173| 2|#if defined(BOTAN_HAS_CAMELLIA) 174| 2| if(algo == "Camellia-128") { ------------------ | Branch (174:7): [True: 0, False: 2] ------------------ 175| 0| return std::make_unique(); 176| 0| } 177| | 178| 2| if(algo == "Camellia-192") { ------------------ | Branch (178:7): [True: 0, False: 2] ------------------ 179| 0| return std::make_unique(); 180| 0| } 181| | 182| 2| if(algo == "Camellia-256") { ------------------ | Branch (182:7): [True: 0, False: 2] ------------------ 183| 0| return std::make_unique(); 184| 0| } 185| 2|#endif 186| | 187| 2|#if defined(BOTAN_HAS_DES) 188| 2| if(algo == "DES") { ------------------ | Branch (188:7): [True: 0, False: 2] ------------------ 189| 0| return std::make_unique(); 190| 0| } 191| | 192| 2| if(algo == "TripleDES" || algo == "3DES" || algo == "DES-EDE") { ------------------ | Branch (192:7): [True: 0, False: 2] | Branch (192:30): [True: 2, False: 0] | Branch (192:48): [True: 0, False: 0] ------------------ 193| 2| return std::make_unique(); 194| 2| } 195| 0|#endif 196| | 197| 0|#if defined(BOTAN_HAS_NOEKEON) 198| 0| if(algo == "Noekeon") { ------------------ | Branch (198:7): [True: 0, False: 0] ------------------ 199| 0| return std::make_unique(); 200| 0| } 201| 0|#endif 202| | 203| 0|#if defined(BOTAN_HAS_CAST_128) 204| 0| if(algo == "CAST-128" || algo == "CAST5") { ------------------ | Branch (204:7): [True: 0, False: 0] | Branch (204:29): [True: 0, False: 0] ------------------ 205| 0| return std::make_unique(); 206| 0| } 207| 0|#endif 208| | 209| 0|#if defined(BOTAN_HAS_IDEA) 210| 0| if(algo == "IDEA") { ------------------ | Branch (210:7): [True: 0, False: 0] ------------------ 211| 0| return std::make_unique(); 212| 0| } 213| 0|#endif 214| | 215| 0|#if defined(BOTAN_HAS_KUZNYECHIK) 216| 0| if(algo == "Kuznyechik") { ------------------ | Branch (216:7): [True: 0, False: 0] ------------------ 217| 0| return std::make_unique(); 218| 0| } 219| 0|#endif 220| | 221| 0|#if defined(BOTAN_HAS_SEED) 222| 0| if(algo == "SEED") { ------------------ | Branch (222:7): [True: 0, False: 0] ------------------ 223| 0| return std::make_unique(); 224| 0| } 225| 0|#endif 226| | 227| 0|#if defined(BOTAN_HAS_SM4) 228| 0| if(algo == "SM4") { ------------------ | Branch (228:7): [True: 0, False: 0] ------------------ 229| 0| return std::make_unique(); 230| 0| } 231| 0|#endif 232| | 233| 0| const SCAN_Name req(algo); 234| | 235| 0|#if defined(BOTAN_HAS_GOST_28147_89) 236| 0| if(req.algo_name() == "GOST-28147-89") { ------------------ | Branch (236:7): [True: 0, False: 0] ------------------ 237| 0| return std::make_unique(req.arg(0, "R3411_94_TestParam")); 238| 0| } 239| 0|#endif 240| | 241| 0|#if defined(BOTAN_HAS_CASCADE) 242| 0| if(req.algo_name() == "Cascade" && req.arg_count() == 2) { ------------------ | Branch (242:7): [True: 0, False: 0] | Branch (242:39): [True: 0, False: 0] ------------------ 243| 0| auto c1 = BlockCipher::create(req.arg(0)); 244| 0| auto c2 = BlockCipher::create(req.arg(1)); 245| | 246| 0| if(c1 && c2) { ------------------ | Branch (246:10): [True: 0, False: 0] | Branch (246:16): [True: 0, False: 0] ------------------ 247| 0| return std::make_unique(std::move(c1), std::move(c2)); 248| 0| } 249| 0| } 250| 0|#endif 251| | 252| 0|#if defined(BOTAN_HAS_LION) 253| 0| if(req.algo_name() == "Lion" && req.arg_count_between(2, 3)) { ------------------ | Branch (253:7): [True: 0, False: 0] | Branch (253:36): [True: 0, False: 0] ------------------ 254| 0| auto hash = HashFunction::create(req.arg(0)); 255| 0| auto stream = StreamCipher::create(req.arg(1)); 256| | 257| 0| if(hash && stream) { ------------------ | Branch (257:10): [True: 0, False: 0] | Branch (257:18): [True: 0, False: 0] ------------------ 258| 0| const size_t block_size = req.arg_as_integer(2, 1024); 259| 0| return std::make_unique(std::move(hash), std::move(stream), block_size); 260| 0| } 261| 0| } 262| 0|#endif 263| | 264| 0| BOTAN_UNUSED(req); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 265| 0| BOTAN_UNUSED(provider); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 266| | 267| 0| return nullptr; 268| 0|} _ZN5Botan11BlockCipher15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 271| 30|std::unique_ptr BlockCipher::create_or_throw(std::string_view algo, std::string_view provider) { 272| 30| if(auto bc = BlockCipher::create(algo, provider)) { ------------------ | Branch (272:12): [True: 30, False: 0] ------------------ 273| 30| return bc; 274| 30| } 275| 0| throw Lookup_Error("Block cipher", algo, provider); 276| 30|} _ZNK5Botan9TripleDES9encrypt_nEPKhPhm: 769| 13|void TripleDES::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const { 770| 13| assert_key_material_set(); 771| | 772| 13| const uint32_t* k1 = m_round_key.data(); 773| 13| const uint32_t* k2 = k1 + 16 * 48; 774| 13| const uint32_t* k3 = k2 + 16 * 48; 775| | 776| 13| uint32_t B[64]; 777| | 778| 13| while(blocks >= 32) { ------------------ | Branch (778:10): [True: 0, False: 13] ------------------ 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| 13| if(blocks > 0) { ------------------ | Branch (790:7): [True: 13, False: 0] ------------------ 791| 13| transpose_in(B, in, blocks); 792| 13| des_encrypt(&B[0], &B[32], k1); 793| 13| des_decrypt(&B[32], &B[0], k2); 794| 13| des_encrypt(&B[0], &B[32], k3); 795| 13| transpose_out(out, B, blocks); 796| 13| } 797| 13|} _ZNK5Botan9TripleDES19has_keying_materialEv: 832| 13|bool TripleDES::has_keying_material() const { 833| 13| return !m_round_key.empty(); 834| 13|} _ZN5Botan9TripleDES12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 839| 2|void TripleDES::key_schedule(std::span key) { 840| 2| m_round_key.resize(3 * 16 * 48); 841| 2| des_key_schedule(m_round_key.data(), key.first(8).data()); 842| 2| des_key_schedule(m_round_key.data() + 16 * 48, key.subspan(8, 8).data()); 843| | 844| 2| if(key.size() == 24) { ------------------ | Branch (844:7): [True: 2, False: 0] ------------------ 845| 2| des_key_schedule(m_round_key.data() + 2 * 16 * 48, key.last(8).data()); 846| 2| } else { 847| 0| copy_mem(m_round_key.data() + 2 * 16 * 48, m_round_key.data(), 16 * 48); 848| 0| } 849| 2|} des.cpp:_ZN5Botan12_GLOBAL__N_112transpose_inEPjPKhm: 537| 13|void transpose_in(uint32_t B[64], const uint8_t in[], size_t n_blocks) { 538| 13| uint64_t M[32] = {}; 539| | 540| 13| load_be(M, in, n_blocks); 541| | 542| 13| des_transpose(M); 543| | 544| | // clang-format off 545| 13| static constexpr uint8_t IP[64] = { 546| 13| 57, 49, 41, 33, 25, 17, 9, 1, 547| 13| 59, 51, 43, 35, 27, 19, 11, 3, 548| 13| 61, 53, 45, 37, 29, 21, 13, 5, 549| 13| 63, 55, 47, 39, 31, 23, 15, 7, 550| 13| 56, 48, 40, 32, 24, 16, 8, 0, 551| 13| 58, 50, 42, 34, 26, 18, 10, 2, 552| 13| 60, 52, 44, 36, 28, 20, 12, 4, 553| 13| 62, 54, 46, 38, 30, 22, 14, 6 554| 13| }; 555| | // clang-format on 556| | 557| 845| for(size_t i = 0; i < 64; ++i) { ------------------ | Branch (557:22): [True: 832, False: 13] ------------------ 558| 832| const uint8_t src = IP[i]; 559| 832| if(src < 32) { ------------------ | Branch (559:10): [True: 416, False: 416] ------------------ 560| 416| B[i] = static_cast(M[31 - src] >> 32); 561| 416| } else { 562| 416| B[i] = static_cast(M[63 - src]); 563| 416| } 564| 832| } 565| 13|} des.cpp:_ZN5Botan12_GLOBAL__N_113des_transposeEPm: 509| 26|void des_transpose(uint64_t M[32]) { 510| 442| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (510:22): [True: 416, False: 26] ------------------ 511| 416| swap_bits(M[i], M[i + 16], 0x0000FFFF0000FFFF, 16); 512| 416| } 513| | 514| 78| for(size_t i = 0; i != 32; i += 16) { ------------------ | Branch (514:22): [True: 52, False: 26] ------------------ 515| 468| for(size_t j = 0; j != 8; ++j) { ------------------ | Branch (515:25): [True: 416, False: 52] ------------------ 516| 416| swap_bits(M[i + j], M[i + j + 8], 0x00FF00FF00FF00FF, 8); 517| 416| } 518| 52| } 519| | 520| 130| for(size_t i = 0; i != 32; i += 8) { ------------------ | Branch (520:22): [True: 104, False: 26] ------------------ 521| 520| for(size_t j = 0; j != 4; ++j) { ------------------ | Branch (521:25): [True: 416, False: 104] ------------------ 522| 416| swap_bits(M[i + j + 0], M[i + j + 4], 0x0F0F0F0F0F0F0F0F, 4); 523| 416| } 524| 104| } 525| | 526| 234| for(size_t i = 0; i != 32; i += 4) { ------------------ | Branch (526:22): [True: 208, False: 26] ------------------ 527| 624| for(size_t j = 0; j != 2; ++j) { ------------------ | Branch (527:25): [True: 416, False: 208] ------------------ 528| 416| swap_bits(M[i + j + 0], M[i + j + 2], 0x3333333333333333, 2); 529| 416| } 530| 208| } 531| | 532| 442| for(size_t i = 0; i != 32; i += 2) { ------------------ | Branch (532:22): [True: 416, False: 26] ------------------ 533| 416| swap_bits(M[i], M[i + 1], 0x5555555555555555, 1); 534| 416| } 535| 26|} des.cpp:_ZN5Botan12_GLOBAL__N_111des_encryptEPjS1_PKj: 638| 26|void des_encrypt(uint32_t L[32], uint32_t R[32], const uint32_t round_key[]) { 639| 234| for(size_t round = 0; round < 16; round += 2) { ------------------ | Branch (639:26): [True: 208, False: 26] ------------------ 640| 208| des_round(L, R, &round_key[round * 48]); 641| 208| des_round(R, L, &round_key[(round + 1) * 48]); 642| 208| } 643| 26|} des.cpp:_ZN5Botan12_GLOBAL__N_19des_roundEPjPKjS3_: 602| 624|void des_round(uint32_t L[32], const uint32_t R[32], const uint32_t RK[48]) { 603| | // clang-format off 604| 624| SBox1(R[31] ^ RK[ 0], R[ 0] ^ RK[ 1], R[ 1] ^ RK[ 2], 605| 624| R[ 2] ^ RK[ 3], R[ 3] ^ RK[ 4], R[ 4] ^ RK[ 5], 606| 624| L[ 8], L[16], L[22], L[30]); 607| | 608| 624| SBox2(R[ 3] ^ RK[ 6], R[ 4] ^ RK[ 7], R[ 5] ^ RK[ 8], 609| 624| R[ 6] ^ RK[ 9], R[ 7] ^ RK[10], R[ 8] ^ RK[11], 610| 624| L[12], L[27], L[ 1], L[17]); 611| | 612| 624| SBox3(R[ 7] ^ RK[12], R[ 8] ^ RK[13], R[ 9] ^ RK[14], 613| 624| R[10] ^ RK[15], R[11] ^ RK[16], R[12] ^ RK[17], 614| 624| L[23], L[15], L[29], L[ 5]); 615| | 616| 624| SBox4(R[11] ^ RK[18], R[12] ^ RK[19], R[13] ^ RK[20], 617| 624| R[14] ^ RK[21], R[15] ^ RK[22], R[16] ^ RK[23], 618| 624| L[25], L[19], L[ 9], L[ 0]); 619| | 620| 624| SBox5(R[15] ^ RK[24], R[16] ^ RK[25], R[17] ^ RK[26], 621| 624| R[18] ^ RK[27], R[19] ^ RK[28], R[20] ^ RK[29], 622| 624| L[ 7], L[13], L[24], L[ 2]); 623| | 624| 624| SBox6(R[19] ^ RK[30], R[20] ^ RK[31], R[21] ^ RK[32], 625| 624| R[22] ^ RK[33], R[23] ^ RK[34], R[24] ^ RK[35], 626| 624| L[ 3], L[28], L[10], L[18]); 627| | 628| 624| SBox7(R[23] ^ RK[36], R[24] ^ RK[37], R[25] ^ RK[38], 629| 624| R[26] ^ RK[39], R[27] ^ RK[40], R[28] ^ RK[41], 630| 624| L[31], L[11], L[21], L[ 6]); 631| | 632| 624| SBox8(R[27] ^ RK[42], R[28] ^ RK[43], R[29] ^ RK[44], 633| 624| R[30] ^ RK[45], R[31] ^ RK[46], R[ 0] ^ RK[47], 634| 624| L[ 4], L[26], L[14], L[20]); 635| | // clang-format on 636| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox1ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 38| 624|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| 624| const T x1 = a1 & ~a5; 40| 624| const T x2 = a4 ^ x1; 41| 624| const T x3 = a3 | a6; 42| 624| const T x4 = a1 ^ a3; 43| 624| const T x5 = x3 & x4; 44| 624| const T x6 = a4 ^ x5; 45| 624| const T x7 = x6 & ~x2; 46| | 47| 624| const T x8 = a5 ^ a6; 48| 624| const T x9 = a3 ^ x8; 49| 624| const T x10 = x2 & ~x9; 50| 624| const T x11 = a6 | x5; 51| 624| const T x12 = x10 ^ x11; 52| 624| const T x13 = x12 & ~x7; 53| | 54| 624| const T x14 = a1 | a6; 55| 624| const T x15 = x12 | x14; 56| 624| const T x16 = a5 & ~x6; 57| 624| const T x17 = x15 ^ x16; 58| | 59| 624| const T x18 = a4 & ~x14; 60| 624| const T x19 = x16 ^ x18; 61| 624| const T x20 = x8 & ~x4; 62| 624| const T x21 = x19 | x20; 63| | 64| 624| const T x22 = a3 & ~x1; 65| 624| const T x23 = x2 ^ x15; 66| 624| const T x24 = x23 & ~x22; 67| 624| const T x25 = ~x24; 68| 624| const T x26 = x3 & x12; 69| 624| const T x27 = x25 ^ x26; 70| 624| const T x28 = x17 & ~a2; 71| 624| const T x29 = x28 ^ x27; 72| 624| out3 ^= x29; 73| | 74| 624| const T x30 = x8 ^ x24; 75| 624| const T x31 = x16 | x30; 76| 624| const T x32 = x3 ^ x31; 77| 624| const T x33 = a1 ^ x32; 78| 624| const T x34 = x27 ^ x33; 79| 624| const T x35 = x7 | a2; 80| 624| const T x36 = x35 ^ x34; 81| 624| out1 ^= x36; 82| | 83| 624| const T x37 = x2 & ~x21; 84| 624| const T x38 = x30 ^ x37; 85| 624| const T x39 = x16 ^ x32; 86| 624| const T x40 = x34 & ~x39; 87| 624| const T x41 = x38 ^ x40; 88| 624| const T x42 = a2 & ~x13; 89| 624| const T x43 = x42 ^ x41; 90| 624| out2 ^= x43; 91| | 92| 624| const T x44 = x9 ^ x20; 93| 624| const T x45 = x14 ^ x40; 94| 624| const T x46 = x45 & ~x44; 95| 624| const T x47 = x41 ^ x46; 96| 624| const T x48 = x47 | a2; 97| 624| const T x49 = x48 ^ x21; 98| 624| out4 ^= x49; 99| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox2ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 102| 624|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| 624| const T x1 = a2 ^ a5; 104| | 105| 624| const T x2 = a1 & ~a6; 106| 624| const T x3 = a5 & ~x2; 107| 624| const T x4 = a2 | x3; 108| | 109| 624| const T x5 = x1 & ~a6; 110| 624| const T x6 = a1 & x1; 111| 624| const T x7 = a5 ^ x6; 112| 624| const T x8 = x7 & ~x5; 113| | 114| 624| const T x9 = a3 & a6; 115| 624| const T x10 = x3 ^ x5; 116| 624| const T x11 = x4 & x10; 117| 624| const T x12 = x11 & ~x9; 118| | 119| 624| const T x13 = a3 & x11; 120| 624| const T x14 = ~a1; 121| 624| const T x15 = x13 ^ x14; 122| 624| const T x16 = a6 ^ x1; 123| 624| const T x17 = x16 & ~x9; 124| 624| const T x18 = x15 ^ x17; 125| 624| const T x19 = a4 & ~x12; 126| 624| const T x20 = x19 ^ x18; 127| 624| out2 ^= x20; 128| | 129| 624| const T x21 = a2 & ~x17; 130| 624| const T x22 = x7 ^ x21; 131| 624| const T x23 = x15 & ~x22; 132| 624| const T x24 = a3 ^ x16; 133| 624| const T x25 = x23 ^ x24; 134| 624| const T x26 = x4 & ~a4; 135| 624| const T x27 = x26 ^ x25; 136| 624| out1 ^= x27; 137| | 138| 624| const T x28 = a2 & ~x9; 139| 624| const T x29 = x24 | x28; 140| 624| const T x30 = x4 ^ x18; 141| 624| const T x31 = x9 | x30; 142| 624| const T x32 = x29 ^ x31; 143| | 144| 624| const T x33 = x11 ^ x18; 145| 624| const T x34 = x25 ^ x33; 146| 624| const T x35 = x31 & x34; 147| 624| const T x36 = x1 & x29; 148| 624| const T x37 = x35 ^ x36; 149| 624| const T x38 = x37 | a4; 150| 624| const T x39 = x38 ^ x32; 151| 624| out3 ^= x39; 152| | 153| 624| const T x40 = x37 & ~x22; 154| 624| const T x41 = x16 | x30; 155| 624| const T x42 = x40 ^ x41; 156| 624| const T x43 = x8 | a4; 157| 624| const T x44 = x43 ^ x42; 158| 624| out4 ^= x44; 159| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox3ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 162| 624|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| 624| const T x1 = a1 & ~a2; 164| 624| const T x2 = a3 ^ a6; 165| 624| const T x3 = x1 | x2; 166| 624| const T x4 = a4 ^ a6; 167| 624| const T x5 = x4 & ~a1; 168| 624| const T x6 = x3 ^ x5; 169| | 170| 624| const T x7 = a2 ^ x2; 171| 624| const T x8 = x7 & ~a6; 172| 624| const T x9 = x3 ^ x8; 173| 624| const T x10 = x6 & ~x9; 174| | 175| 624| const T x11 = a6 & x6; 176| 624| const T x12 = a4 | x11; 177| 624| const T x13 = a1 & x12; 178| 624| const T x14 = x7 ^ x13; 179| 624| const T x15 = x6 & ~a5; 180| 624| const T x16 = x15 ^ x14; 181| 624| out4 ^= x16; 182| | 183| 624| const T x17 = x2 & x4; 184| 624| const T x18 = a1 ^ a4; 185| 624| const T x19 = x9 ^ x18; 186| 624| const T x20 = a3 | x19; 187| 624| const T x21 = x20 & ~x17; 188| | 189| 624| const T x22 = x5 | x18; 190| 624| const T x23 = x14 & ~x22; 191| 624| const T x24 = a4 & a6; 192| 624| const T x25 = x24 & ~a2; 193| 624| const T x26 = x23 ^ x25; 194| | 195| 624| const T x27 = x9 & x26; 196| 624| const T x28 = x7 | x24; 197| 624| const T x29 = x28 & ~x27; 198| 624| const T x30 = a1 ^ x29; 199| 624| const T x31 = x21 & a5; 200| 624| const T x32 = x31 ^ x30; 201| 624| out2 ^= x32; 202| | 203| 624| const T x33 = x6 & ~a2; 204| 624| const T x34 = x33 & ~a3; 205| 624| const T x35 = ~x7; 206| 624| const T x36 = x22 ^ x35; 207| 624| const T x37 = x34 ^ x36; 208| 624| const T x38 = a5 & ~x10; 209| 624| const T x39 = x38 ^ x37; 210| 624| out1 ^= x39; 211| | 212| 624| const T x40 = x34 | x36; 213| 624| const T x41 = x5 | x33; 214| 624| const T x42 = x40 ^ x41; 215| 624| const T x43 = a4 & ~x6; 216| 624| const T x44 = x42 | x43; 217| 624| const T x45 = a5 & ~x26; 218| 624| const T x46 = x45 ^ x44; 219| 624| out3 ^= x46; 220| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox4ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 223| 624|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| 624| const T x1 = a1 ^ a3; 225| 624| const T x2 = a3 ^ a5; 226| 624| const T x3 = a2 | a4; 227| 624| const T x4 = a5 ^ x3; 228| 624| const T x5 = x2 & ~x4; 229| 624| const T x6 = x2 & ~a2; 230| 624| const T x7 = a4 ^ x6; 231| 624| const T x8 = x1 | x7; 232| 624| const T x9 = x8 & ~x5; 233| 624| const T x10 = a2 ^ x9; 234| | 235| 624| const T x11 = x7 & x10; 236| 624| const T x12 = x2 & ~x11; 237| 624| const T x13 = x1 ^ x10; 238| 624| const T x14 = x13 & ~x12; 239| 624| const T x15 = x5 ^ x14; 240| | 241| 624| const T x16 = a2 ^ a4; 242| 624| const T x17 = a5 | x6; 243| 624| const T x18 = x13 ^ x17; 244| 624| const T x19 = x18 & ~x16; 245| 624| const T x20 = x9 ^ x19; 246| 624| const T x21 = a6 & ~x15; 247| 624| const T x22 = x21 ^ x20; 248| 624| out1 ^= x22; 249| | 250| 624| const T x23 = ~x20; 251| 624| const T x24 = x15 & ~a6; 252| 624| const T x25 = x24 ^ x23; 253| 624| out2 ^= x25; 254| | 255| 624| const T x26 = x15 ^ x23; 256| 624| const T x27 = x26 & ~x16; 257| 624| const T x28 = x11 | x27; 258| 624| const T x29 = x18 ^ x28; 259| 624| const T x30 = x10 | a6; 260| 624| const T x31 = x30 ^ x29; 261| 624| out3 ^= x31; 262| | 263| 624| const T x32 = a6 & x10; 264| 624| const T x33 = x32 ^ x29; 265| 624| out4 ^= x33; 266| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox5ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 269| 624|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| 624| const T x1 = a1 | a3; 271| 624| const T x2 = x1 & ~a6; 272| 624| const T x3 = a1 ^ x2; 273| 624| const T x4 = a3 ^ x3; 274| 624| const T x5 = a4 | x4; 275| | 276| 624| const T x6 = x2 & ~a4; 277| 624| const T x7 = a3 ^ x6; 278| 624| const T x8 = a5 & x7; 279| 624| const T x9 = a1 | x4; 280| 624| const T x10 = x8 ^ x9; 281| 624| const T x11 = a4 ^ x10; 282| | 283| 624| const T x12 = a6 ^ x11; 284| 624| const T x13 = x3 | x12; 285| 624| const T x14 = a5 & x13; 286| 624| const T x15 = x3 ^ x14; 287| 624| const T x16 = a4 & x9; 288| 624| const T x17 = x15 ^ x16; 289| | 290| 624| const T x18 = x13 & ~a1; 291| 624| const T x19 = x7 ^ x18; 292| 624| const T x20 = a5 ^ x5; 293| 624| const T x21 = x20 & ~x19; 294| 624| const T x22 = ~x21; 295| 624| const T x23 = x22 & ~a2; 296| 624| const T x24 = x23 ^ x11; 297| 624| out3 ^= x24; 298| | 299| 624| const T x25 = x7 & ~x14; 300| 624| const T x26 = x18 ^ x20; 301| 624| const T x27 = x17 | x26; 302| 624| const T x28 = x27 & ~x25; 303| 624| const T x29 = x5 & ~x28; 304| | 305| 624| const T x30 = x12 & x28; 306| 624| const T x31 = x20 ^ x30; 307| 624| const T x32 = x7 & x9; 308| 624| const T x33 = x31 | x32; 309| 624| const T x34 = x14 ^ x33; 310| 624| const T x35 = x34 & a2; 311| 624| const T x36 = x35 ^ x17; 312| 624| out4 ^= x36; 313| | 314| 624| const T x37 = x1 ^ x28; 315| 624| const T x38 = a1 ^ x37; 316| 624| const T x39 = a4 & x31; 317| 624| const T x40 = x38 ^ x39; 318| 624| const T x41 = x29 | a2; 319| 624| const T x42 = x41 ^ x40; 320| 624| out1 ^= x42; 321| | 322| 624| const T x43 = x5 ^ x7; 323| 624| const T x44 = x43 & ~x40; 324| 624| const T x45 = x3 ^ x31; 325| 624| const T x46 = x44 ^ x45; 326| 624| const T x47 = x5 & a2; 327| 624| const T x48 = x47 ^ x46; 328| 624| out2 ^= x48; 329| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox6ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 332| 624|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| 624| const T x1 = a2 ^ a5; 334| | 335| 624| const T x2 = a2 | a6; 336| 624| const T x3 = a1 & x2; 337| 624| const T x4 = x1 ^ x3; 338| 624| const T x5 = a6 ^ x4; 339| 624| const T x6 = a5 & ~x5; 340| | 341| 624| const T x7 = a1 & x5; 342| 624| const T x8 = a2 ^ x7; 343| 624| const T x9 = a1 ^ a3; 344| 624| const T x10 = x8 | x9; 345| 624| const T x11 = x4 ^ x10; 346| | 347| 624| const T x12 = a3 & x11; 348| 624| const T x13 = x12 & ~a6; 349| 624| const T x14 = x6 | x8; 350| 624| const T x15 = x13 ^ x14; 351| 624| const T x16 = x15 & a4; 352| 624| const T x17 = x16 ^ x11; 353| 624| out4 ^= x17; 354| | 355| 624| const T x18 = a2 ^ x10; 356| 624| const T x19 = a6 & ~x18; 357| 624| const T x20 = a3 ^ x19; 358| 624| const T x21 = a5 & ~x12; 359| 624| const T x22 = x20 | x21; 360| | 361| 624| const T x23 = a2 | x9; 362| 624| const T x24 = x15 ^ x23; 363| 624| const T x25 = x3 | x22; 364| 624| const T x26 = x24 ^ x25; 365| | 366| 624| const T x27 = a1 | x11; 367| 624| const T x28 = x14 & x27; 368| 624| const T x29 = x20 ^ x28; 369| 624| const T x30 = x29 & ~x13; 370| 624| const T x31 = x6 | a4; 371| 624| const T x32 = x31 ^ x30; 372| 624| out3 ^= x32; 373| | 374| 624| const T x33 = x4 ^ x29; 375| 624| const T x34 = a5 & ~x33; 376| 624| const T x35 = ~x23; 377| 624| const T x36 = x18 ^ x35; 378| 624| const T x37 = x34 ^ x36; 379| 624| const T x38 = x37 & ~a4; 380| 624| const T x39 = x38 ^ x26; 381| 624| out2 ^= x39; 382| | 383| 624| const T x40 = a6 ^ x7; 384| 624| const T x41 = a1 ^ x20; 385| 624| const T x42 = x40 & x41; 386| 624| const T x43 = x12 ^ x36; 387| 624| const T x44 = x42 ^ x43; 388| 624| const T x45 = x22 & ~a4; 389| 624| const T x46 = x45 ^ x44; 390| 624| out1 ^= x46; 391| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox7ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 394| 624|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| 624| const T x1 = a4 ^ a5; 396| 624| const T x2 = a3 ^ x1; 397| 624| const T x3 = a6 & x2; 398| 624| const T x4 = a4 & x1; 399| 624| const T x5 = a2 ^ x4; 400| 624| const T x6 = x3 & x5; 401| | 402| 624| const T x7 = a6 & x4; 403| 624| const T x8 = a3 ^ x7; 404| 624| const T x9 = x5 | x8; 405| 624| const T x10 = a6 ^ x1; 406| 624| const T x11 = x9 ^ x10; 407| 624| const T x12 = a1 & ~x6; 408| 624| const T x13 = x12 ^ x11; 409| 624| out4 ^= x13; 410| | 411| 624| const T x14 = a5 & ~x2; 412| 624| const T x15 = x5 | x14; 413| 624| const T x16 = x3 ^ x8; 414| 624| const T x17 = x15 ^ x16; 415| | 416| 624| const T x18 = x3 ^ x10; 417| 624| const T x19 = a4 & ~x18; 418| 624| const T x20 = x5 & ~x19; 419| 624| const T x21 = a5 ^ x16; 420| 624| const T x22 = x20 ^ x21; 421| | 422| 624| const T x23 = x18 & ~x7; 423| 624| const T x24 = x19 | x23; 424| 624| const T x25 = a2 ^ x9; 425| 624| const T x26 = x22 & x25; 426| 624| const T x27 = x24 ^ x26; 427| 624| const T x28 = x27 & a1; 428| 624| const T x29 = x28 ^ x22; 429| 624| out3 ^= x29; 430| | 431| 624| const T x30 = x5 & ~a3; 432| 624| const T x31 = x23 | x30; 433| 624| const T x32 = x4 | x22; 434| 624| const T x33 = x31 & x32; 435| 624| const T x34 = x27 ^ x33; 436| | 437| 624| const T x35 = x17 | x24; 438| 624| const T x36 = x14 ^ x35; 439| 624| const T x37 = a6 & x36; 440| 624| const T x38 = x33 ^ x37; 441| 624| const T x39 = x38 & ~a1; 442| 624| const T x40 = x39 ^ x17; 443| 624| out1 ^= x40; 444| | 445| 624| const T x41 = ~x37; 446| 624| const T x42 = a2 | x41; 447| 624| const T x43 = x17 ^ x33; 448| 624| const T x44 = x42 ^ x43; 449| 624| const T x45 = x34 | a1; 450| 624| const T x46 = x45 ^ x44; 451| 624| out2 ^= x46; 452| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_15SBox8ITkNS0_9BitsliceTEjEEvT_S2_S2_S2_S2_S2_RS2_S3_S3_S3_: 455| 624|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| 624| const T x1 = a3 & ~a2; 457| 624| const T x2 = a5 & ~a3; 458| 624| const T x3 = a4 ^ x2; 459| 624| const T x4 = a1 & x3; 460| 624| const T x5 = x4 & ~x1; 461| | 462| 624| const T x6 = a2 & ~x3; 463| 624| const T x7 = a1 | x6; 464| 624| const T x8 = a2 & ~a3; 465| 624| const T x9 = a5 ^ x8; 466| 624| const T x10 = x7 & x9; 467| 624| const T x11 = x4 | x10; 468| | 469| 624| const T x12 = ~x3; 470| 624| const T x13 = x10 ^ x12; 471| 624| const T x14 = a3 & ~x7; 472| 624| const T x15 = x13 ^ x14; 473| 624| const T x16 = x1 ^ x15; 474| 624| const T x17 = x5 | a6; 475| 624| const T x18 = x17 ^ x16; 476| 624| out2 ^= x18; 477| | 478| 624| const T x19 = a1 ^ x16; 479| 624| const T x20 = a5 & x19; 480| 624| const T x21 = a2 ^ x15; 481| 624| const T x22 = x20 ^ x21; 482| 624| const T x23 = x6 ^ x22; 483| | 484| 624| const T x24 = x11 ^ x22; 485| 624| const T x25 = a2 | x24; 486| 624| const T x26 = a5 ^ x19; 487| 624| const T x27 = x25 ^ x26; 488| 624| const T x28 = x11 & a6; 489| 624| const T x29 = x28 ^ x27; 490| 624| out3 ^= x29; 491| | 492| 624| const T x30 = x9 ^ x23; 493| 624| const T x31 = a4 | x21; 494| 624| const T x32 = x30 ^ x31; 495| 624| const T x33 = a1 ^ x32; 496| 624| const T x34 = x33 & a6; 497| 624| const T x35 = x34 ^ x23; 498| 624| out4 ^= x35; 499| | 500| 624| const T x36 = x30 & ~a4; 501| 624| const T x37 = x27 & x36; 502| 624| const T x38 = x5 ^ x32; 503| 624| const T x39 = x37 ^ x38; 504| 624| const T x40 = x39 | a6; 505| 624| const T x41 = x40 ^ x23; 506| 624| out1 ^= x41; 507| 624|} des.cpp:_ZN5Botan12_GLOBAL__N_113transpose_outEPhPKjm: 567| 13|void transpose_out(uint8_t out[], const uint32_t B[64], size_t n_blocks) { 568| | // clang-format off 569| 13| static constexpr uint8_t FP[64] = { 570| 13| 39, 7, 47, 15, 55, 23, 63, 31, 571| 13| 38, 6, 46, 14, 54, 22, 62, 30, 572| 13| 37, 5, 45, 13, 53, 21, 61, 29, 573| 13| 36, 4, 44, 12, 52, 20, 60, 28, 574| 13| 35, 3, 43, 11, 51, 19, 59, 27, 575| 13| 34, 2, 42, 10, 50, 18, 58, 26, 576| 13| 33, 1, 41, 9, 49, 17, 57, 25, 577| 13| 32, 0, 40, 8, 48, 16, 56, 24 578| 13| }; 579| | // clang-format on 580| | 581| 13| uint64_t M[32]; 582| 429| for(size_t i = 0; i != 32; ++i) { ------------------ | Branch (582:22): [True: 416, False: 13] ------------------ 583| | // XOR with 32 here absorbs the DES output swap into the FP 584| 416| M[i] = (static_cast(B[FP[31 - i] ^ 32]) << 32) | B[FP[63 - i] ^ 32]; 585| 416| } 586| | 587| 13| des_transpose(M); 588| | 589| 26| for(size_t i = 0; i != n_blocks; ++i) { ------------------ | Branch (589:22): [True: 13, False: 13] ------------------ 590| 13| store_be(out + i * 8, M[i]); 591| 13| } 592| 13|} des.cpp:_ZN5Botan12_GLOBAL__N_111des_decryptEPjS1_PKj: 645| 13|void des_decrypt(uint32_t L[32], uint32_t R[32], const uint32_t round_key[]) { 646| 117| for(size_t round = 16; round > 0; round -= 2) { ------------------ | Branch (646:27): [True: 104, False: 13] ------------------ 647| 104| des_round(L, R, &round_key[(round - 1) * 48]); 648| 104| des_round(R, L, &round_key[(round - 2) * 48]); 649| 104| } 650| 13|} des.cpp:_ZN5Botan12_GLOBAL__N_116des_key_scheduleEPjPKh: 656| 6|void des_key_schedule(uint32_t round_key[], const uint8_t key[8]) { 657| 6| static const uint8_t ROT[16] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1}; 658| | 659| 6| uint32_t C = ((key[7] & 0x80) << 20) | ((key[6] & 0x80) << 19) | ((key[5] & 0x80) << 18) | ((key[4] & 0x80) << 17) | 660| 6| ((key[3] & 0x80) << 16) | ((key[2] & 0x80) << 15) | ((key[1] & 0x80) << 14) | ((key[0] & 0x80) << 13) | 661| 6| ((key[7] & 0x40) << 13) | ((key[6] & 0x40) << 12) | ((key[5] & 0x40) << 11) | ((key[4] & 0x40) << 10) | 662| 6| ((key[3] & 0x40) << 9) | ((key[2] & 0x40) << 8) | ((key[1] & 0x40) << 7) | ((key[0] & 0x40) << 6) | 663| 6| ((key[7] & 0x20) << 6) | ((key[6] & 0x20) << 5) | ((key[5] & 0x20) << 4) | ((key[4] & 0x20) << 3) | 664| 6| ((key[3] & 0x20) << 2) | ((key[2] & 0x20) << 1) | ((key[1] & 0x20)) | ((key[0] & 0x20) >> 1) | 665| 6| ((key[7] & 0x10) >> 1) | ((key[6] & 0x10) >> 2) | ((key[5] & 0x10) >> 3) | ((key[4] & 0x10) >> 4); 666| 6| uint32_t D = ((key[7] & 0x02) << 26) | ((key[6] & 0x02) << 25) | ((key[5] & 0x02) << 24) | ((key[4] & 0x02) << 23) | 667| 6| ((key[3] & 0x02) << 22) | ((key[2] & 0x02) << 21) | ((key[1] & 0x02) << 20) | ((key[0] & 0x02) << 19) | 668| 6| ((key[7] & 0x04) << 17) | ((key[6] & 0x04) << 16) | ((key[5] & 0x04) << 15) | ((key[4] & 0x04) << 14) | 669| 6| ((key[3] & 0x04) << 13) | ((key[2] & 0x04) << 12) | ((key[1] & 0x04) << 11) | ((key[0] & 0x04) << 10) | 670| 6| ((key[7] & 0x08) << 8) | ((key[6] & 0x08) << 7) | ((key[5] & 0x08) << 6) | ((key[4] & 0x08) << 5) | 671| 6| ((key[3] & 0x08) << 4) | ((key[2] & 0x08) << 3) | ((key[1] & 0x08) << 2) | ((key[0] & 0x08) << 1) | 672| 6| ((key[3] & 0x10) >> 1) | ((key[2] & 0x10) >> 2) | ((key[1] & 0x10) >> 3) | ((key[0] & 0x10) >> 4); 673| | 674| 6| static const uint8_t PC2_C[24] = {13, 16, 10, 23, 0, 4, 2, 27, 14, 5, 20, 9, 675| 6| 22, 18, 11, 3, 25, 7, 15, 6, 26, 19, 12, 1}; 676| | 677| 6| static const uint8_t PC2_D[24] = {12, 23, 2, 8, 18, 26, 1, 11, 22, 16, 4, 19, 678| 6| 15, 20, 10, 27, 5, 24, 17, 13, 21, 7, 0, 3}; 679| | 680| 102| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (680:22): [True: 96, False: 6] ------------------ 681| 96| C = ((C << ROT[i]) | (C >> (28 - ROT[i]))) & 0x0FFFFFFF; 682| 96| D = ((D << ROT[i]) | (D >> (28 - ROT[i]))) & 0x0FFFFFFF; 683| | 684| 96| uint32_t* rk = &round_key[i * 48]; 685| | 686| 2.40k| for(size_t j = 0; j < 24; ++j) { ------------------ | Branch (686:25): [True: 2.30k, False: 96] ------------------ 687| 2.30k| const uint32_t bit = (C >> (27 - PC2_C[j])) & 1; 688| 2.30k| rk[j] = static_cast(0) - bit; 689| 2.30k| } 690| | 691| 2.40k| for(size_t j = 0; j < 24; ++j) { ------------------ | Branch (691:25): [True: 2.30k, False: 96] ------------------ 692| 2.30k| const uint32_t bit = (D >> (27 - PC2_D[j])) & 1; 693| 2.30k| rk[24 + j] = static_cast(0) - bit; 694| 2.30k| } 695| 96| } 696| 6|} _ZN5Botan10hex_encodeEPcPKhmb: 34| 1.84k|void hex_encode(char output[], const uint8_t input[], size_t input_length, bool uppercase) { 35| 49.8k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (35:22): [True: 48.0k, False: 1.84k] ------------------ 36| 48.0k| const uint16_t h = hex_encode_2nibble(input[i], uppercase); 37| 48.0k| output[2 * i] = get_byte<0>(h); 38| 48.0k| output[2 * i + 1] = get_byte<1>(h); 39| 48.0k| } 40| 1.84k|} _ZN5Botan10hex_encodeEPKhmb: 42| 1.84k|std::string hex_encode(const uint8_t input[], size_t input_length, bool uppercase) { 43| 1.84k| std::string output(2 * input_length, 0); 44| | 45| 1.84k| if(input_length > 0) { ------------------ | Branch (45:7): [True: 1.84k, False: 0] ------------------ 46| 1.84k| hex_encode(&output.front(), input, input_length, uppercase); 47| 1.84k| } 48| | 49| 1.84k| return output; 50| 1.84k|} _ZN5Botan10hex_decodeEPhPKcmRmb: 72| 148|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, size_t& input_consumed, bool ignore_ws) { 73| 148| uint8_t* out_ptr = output; 74| 148| bool top_nibble = true; 75| | 76| 148| clear_mem(output, input_length / 2); 77| | 78| 27.1k| for(size_t i = 0; i != input_length; ++i) { ------------------ | Branch (78:22): [True: 27.0k, False: 148] ------------------ 79| 27.0k| const uint8_t bin = hex_char_to_bin(input[i]); 80| | 81| 27.0k| if(bin >= 0x10) { ------------------ | Branch (81:10): [True: 0, False: 27.0k] ------------------ 82| 0| if(bin == 0x80 && ignore_ws) { ------------------ | Branch (82:13): [True: 0, False: 0] | Branch (82:28): [True: 0, False: 0] ------------------ 83| 0| continue; 84| 0| } 85| | 86| 0| throw Invalid_Argument(fmt("hex_decode: invalid character '{}'", format_char_for_display(input[i]))); 87| 0| } 88| | 89| 27.0k| if(top_nibble) { ------------------ | Branch (89:10): [True: 13.5k, False: 13.5k] ------------------ 90| 13.5k| *out_ptr |= bin << 4; 91| 13.5k| } else { 92| 13.5k| *out_ptr |= bin; 93| 13.5k| } 94| | 95| 27.0k| top_nibble = !top_nibble; 96| 27.0k| if(top_nibble) { ------------------ | Branch (96:10): [True: 13.5k, False: 13.5k] ------------------ 97| 13.5k| ++out_ptr; 98| 13.5k| } 99| 27.0k| } 100| | 101| 148| input_consumed = input_length; 102| 148| const size_t written = (out_ptr - output); 103| | 104| | /* 105| | * We only got half of a uint8_t at the end; zap the half-written 106| | * output and mark it as unread 107| | */ 108| 148| if(!top_nibble) { ------------------ | Branch (108:7): [True: 0, False: 148] ------------------ 109| 0| *out_ptr = 0; 110| 0| input_consumed -= 1; 111| 0| } 112| | 113| 148| return written; 114| 148|} _ZN5Botan10hex_decodeEPhPKcmb: 116| 148|size_t hex_decode(uint8_t output[], const char input[], size_t input_length, bool ignore_ws) { 117| 148| size_t consumed = 0; 118| 148| const size_t written = hex_decode(output, input, input_length, consumed, ignore_ws); 119| | 120| 148| if(consumed != input_length) { ------------------ | Branch (120:7): [True: 0, False: 148] ------------------ 121| 0| throw Invalid_Argument("hex_decode: input did not have full bytes"); 122| 0| } 123| | 124| 148| return written; 125| 148|} _ZN5Botan17hex_decode_lockedEPKcmb: 135| 148|secure_vector hex_decode_locked(const char input[], size_t input_length, bool ignore_ws) { 136| 148| secure_vector bin(1 + input_length / 2); 137| | 138| 148| const size_t written = hex_decode(bin.data(), input, input_length, ignore_ws); 139| | 140| 148| bin.resize(written); 141| 148| return bin; 142| 148|} _ZN5Botan17hex_decode_lockedENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEb: 144| 88|secure_vector hex_decode_locked(std::string_view input, bool ignore_ws) { 145| 88| return hex_decode_locked(input.data(), input.size(), ignore_ws); 146| 88|} hex.cpp:_ZN5Botan12_GLOBAL__N_118hex_encode_2nibbleEhb: 21| 48.0k|uint16_t hex_encode_2nibble(uint8_t n8, bool uppercase) { 22| | // Offset for upper or lower case 'a' resp 23| 48.0k| const uint16_t a_mask = uppercase ? 0x0707 : 0x2727; ------------------ | Branch (23:28): [True: 48.0k, False: 0] ------------------ 24| | 25| 48.0k| const uint16_t n = (static_cast(n8 & 0xF0) << 4) | (n8 & 0x0F); 26| | // n >= 10? If so add offset 27| 48.0k| const uint16_t diff = swar_lt(0x0909, n) & a_mask; 28| | // Can't overflow between bytes, so don't need explicit SWAR addition: 29| 48.0k| return n + 0x3030 + diff; 30| 48.0k|} hex.cpp:_ZN5Botan12_GLOBAL__N_115hex_char_to_binEc: 54| 27.0k|uint8_t hex_char_to_bin(char input) { 55| | // Starts of valid value ranges (v_lo) and their lengths (v_range) 56| 27.0k| constexpr uint64_t v_lo = make_uint64(0, '0', 'a', 'A', ' ', '\n', '\t', '\r'); 57| 27.0k| constexpr uint64_t v_range = make_uint64(0, 10, 6, 6, 1, 1, 1, 1); 58| | 59| 27.0k| const uint8_t x = static_cast(input); 60| 27.0k| const uint64_t x8 = x * 0x0101010101010101; 61| | 62| 27.0k| const uint64_t v_mask = swar_in_range(x8, v_lo, v_range) ^ 0x8000000000000000; 63| | 64| | // This is the offset added to x to get the value we need 65| 27.0k| const uint64_t val_v = 0xd0a9c960767773 ^ static_cast(0xFF - x) << 56; 66| | 67| 27.0k| return x + static_cast(val_v >> (8 * index_of_first_set_byte(v_mask))); 68| 27.0k|} _ZN5Botan12HashFunction6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 111| 9.70k|std::unique_ptr HashFunction::create(std::string_view algo_spec, std::string_view provider) { 112| |#if defined(BOTAN_HAS_COMMONCRYPTO) 113| | if(provider.empty() || provider == "commoncrypto") { 114| | if(auto hash = make_commoncrypto_hash(algo_spec)) 115| | return hash; 116| | 117| | if(!provider.empty()) 118| | return nullptr; 119| | } 120| |#endif 121| | 122| 9.70k| if(provider.empty() == false && provider != "base") { ------------------ | Branch (122:7): [True: 0, False: 9.70k] | Branch (122:36): [True: 0, False: 0] ------------------ 123| 0| return nullptr; // unknown provider 124| 0| } 125| | 126| 9.70k|#if defined(BOTAN_HAS_SHA1) 127| 9.70k| if(algo_spec == "SHA-1") { ------------------ | Branch (127:7): [True: 940, False: 8.76k] ------------------ 128| 940| return std::make_unique(); 129| 940| } 130| 8.76k|#endif 131| | 132| 8.76k|#if defined(BOTAN_HAS_SHA2_32) 133| 8.76k| if(algo_spec == "SHA-224") { ------------------ | Branch (133:7): [True: 0, False: 8.76k] ------------------ 134| 0| return std::make_unique(); 135| 0| } 136| | 137| 8.76k| if(algo_spec == "SHA-256") { ------------------ | Branch (137:7): [True: 8.29k, False: 474] ------------------ 138| 8.29k| return std::make_unique(); 139| 8.29k| } 140| 474|#endif 141| | 142| 474|#if defined(BOTAN_HAS_SHA2_64) 143| 474| if(algo_spec == "SHA-384") { ------------------ | Branch (143:7): [True: 181, False: 293] ------------------ 144| 181| return std::make_unique(); 145| 181| } 146| | 147| 293| if(algo_spec == "SHA-512") { ------------------ | Branch (147:7): [True: 293, False: 0] ------------------ 148| 293| return std::make_unique(); 149| 293| } 150| | 151| 0| if(algo_spec == "SHA-512-256") { ------------------ | Branch (151:7): [True: 0, False: 0] ------------------ 152| 0| return std::make_unique(); 153| 0| } 154| 0|#endif 155| | 156| 0|#if defined(BOTAN_HAS_RIPEMD_160) 157| 0| if(algo_spec == "RIPEMD-160") { ------------------ | Branch (157:7): [True: 0, False: 0] ------------------ 158| 0| return std::make_unique(); 159| 0| } 160| 0|#endif 161| | 162| 0|#if defined(BOTAN_HAS_WHIRLPOOL) 163| 0| if(algo_spec == "Whirlpool") { ------------------ | Branch (163:7): [True: 0, False: 0] ------------------ 164| 0| return std::make_unique(); 165| 0| } 166| 0|#endif 167| | 168| 0|#if defined(BOTAN_HAS_MD5) 169| 0| if(algo_spec == "MD5") { ------------------ | Branch (169:7): [True: 0, False: 0] ------------------ 170| 0| return std::make_unique(); 171| 0| } 172| 0|#endif 173| | 174| 0|#if defined(BOTAN_HAS_MD4) 175| 0| if(algo_spec == "MD4") { ------------------ | Branch (175:7): [True: 0, False: 0] ------------------ 176| 0| return std::make_unique(); 177| 0| } 178| 0|#endif 179| | 180| 0|#if defined(BOTAN_HAS_GOST_34_11) 181| 0| if(algo_spec == "GOST-R-34.11-94" || algo_spec == "GOST-34.11") { ------------------ | Branch (181:7): [True: 0, False: 0] | Branch (181:41): [True: 0, False: 0] ------------------ 182| 0| return std::make_unique(); 183| 0| } 184| 0|#endif 185| | 186| 0|#if defined(BOTAN_HAS_ADLER32) 187| 0| if(algo_spec == "Adler32") { ------------------ | Branch (187:7): [True: 0, False: 0] ------------------ 188| 0| return std::make_unique(); 189| 0| } 190| 0|#endif 191| | 192| 0|#if defined(BOTAN_HAS_ASCON_HASH256) 193| 0| if(algo_spec == "Ascon-Hash256") { ------------------ | Branch (193:7): [True: 0, False: 0] ------------------ 194| 0| return std::make_unique(); 195| 0| } 196| 0|#endif 197| | 198| 0|#if defined(BOTAN_HAS_CRC24) 199| 0| if(algo_spec == "CRC24") { ------------------ | Branch (199:7): [True: 0, False: 0] ------------------ 200| 0| return std::make_unique(); 201| 0| } 202| 0|#endif 203| | 204| 0|#if defined(BOTAN_HAS_CRC32) 205| 0| if(algo_spec == "CRC32") { ------------------ | Branch (205:7): [True: 0, False: 0] ------------------ 206| 0| return std::make_unique(); 207| 0| } 208| 0|#endif 209| | 210| 0|#if defined(BOTAN_HAS_STREEBOG) 211| 0| if(algo_spec == "Streebog-256") { ------------------ | Branch (211:7): [True: 0, False: 0] ------------------ 212| 0| return std::make_unique(256); 213| 0| } 214| 0| if(algo_spec == "Streebog-512") { ------------------ | Branch (214:7): [True: 0, False: 0] ------------------ 215| 0| return std::make_unique(512); 216| 0| } 217| 0|#endif 218| | 219| 0|#if defined(BOTAN_HAS_SM3) 220| 0| if(algo_spec == "SM3") { ------------------ | Branch (220:7): [True: 0, False: 0] ------------------ 221| 0| return std::make_unique(); 222| 0| } 223| 0|#endif 224| | 225| 0| const SCAN_Name req(algo_spec); 226| | 227| 0|#if defined(BOTAN_HAS_SKEIN_512) 228| 0| if(req.algo_name() == "Skein-512") { ------------------ | Branch (228:7): [True: 0, False: 0] ------------------ 229| 0| return std::make_unique(req.arg_as_integer(0, 512), req.arg(1, "")); 230| 0| } 231| 0|#endif 232| | 233| 0|#if defined(BOTAN_HAS_BLAKE2B) 234| 0| if(req.algo_name() == "Blake2b" || req.algo_name() == "BLAKE2b") { ------------------ | Branch (234:7): [True: 0, False: 0] | Branch (234:39): [True: 0, False: 0] ------------------ 235| 0| return std::make_unique(req.arg_as_integer(0, 512)); 236| 0| } 237| 0|#endif 238| | 239| 0|#if defined(BOTAN_HAS_BLAKE2S) 240| 0| if(req.algo_name() == "Blake2s" || req.algo_name() == "BLAKE2s") { ------------------ | Branch (240:7): [True: 0, False: 0] | Branch (240:39): [True: 0, False: 0] ------------------ 241| 0| return std::make_unique(req.arg_as_integer(0, 256)); 242| 0| } 243| 0|#endif 244| | 245| 0|#if defined(BOTAN_HAS_KECCAK) 246| 0| if(req.algo_name() == "Keccak-1600") { ------------------ | Branch (246:7): [True: 0, False: 0] ------------------ 247| 0| return std::make_unique(req.arg_as_integer(0, 512)); 248| 0| } 249| 0|#endif 250| | 251| 0|#if defined(BOTAN_HAS_SHA3) 252| 0| if(req.algo_name() == "SHA-3") { ------------------ | Branch (252:7): [True: 0, False: 0] ------------------ 253| 0| return std::make_unique(req.arg_as_integer(0, 512)); 254| 0| } 255| 0|#endif 256| | 257| 0|#if defined(BOTAN_HAS_SHAKE) 258| 0| if(req.algo_name() == "SHAKE-128" && req.arg_count() == 1) { ------------------ | Branch (258:7): [True: 0, False: 0] | Branch (258:41): [True: 0, False: 0] ------------------ 259| 0| return std::make_unique(req.arg_as_integer(0)); 260| 0| } 261| 0| if(req.algo_name() == "SHAKE-256" && req.arg_count() == 1) { ------------------ | Branch (261:7): [True: 0, False: 0] | Branch (261:41): [True: 0, False: 0] ------------------ 262| 0| return std::make_unique(req.arg_as_integer(0)); 263| 0| } 264| 0|#endif 265| | 266| 0|#if defined(BOTAN_HAS_PARALLEL_HASH) 267| 0| if(req.algo_name() == "Parallel") { ------------------ | Branch (267:7): [True: 0, False: 0] ------------------ 268| 0| std::vector> hashes; 269| | 270| 0| for(size_t i = 0; i != req.arg_count(); ++i) { ------------------ | Branch (270:25): [True: 0, False: 0] ------------------ 271| 0| auto h = HashFunction::create(req.arg(i)); 272| 0| if(!h) { ------------------ | Branch (272:13): [True: 0, False: 0] ------------------ 273| 0| return nullptr; 274| 0| } 275| 0| hashes.push_back(std::move(h)); 276| 0| } 277| | 278| 0| return std::make_unique(hashes); 279| 0| } 280| 0|#endif 281| | 282| 0|#if defined(BOTAN_HAS_TRUNCATED_HASH) 283| 0| if(req.algo_name() == "Truncated" && req.arg_count() == 2) { ------------------ | Branch (283:7): [True: 0, False: 0] | Branch (283:41): [True: 0, False: 0] ------------------ 284| 0| auto hash = HashFunction::create(req.arg(0)); 285| 0| if(!hash) { ------------------ | Branch (285:10): [True: 0, False: 0] ------------------ 286| 0| return nullptr; 287| 0| } 288| | 289| 0| return std::make_unique(std::move(hash), req.arg_as_integer(1)); 290| 0| } 291| 0|#endif 292| | 293| 0|#if defined(BOTAN_HAS_COMB4P) 294| 0| if(req.algo_name() == "Comb4P" && req.arg_count() == 2) { ------------------ | Branch (294:7): [True: 0, False: 0] | Branch (294:38): [True: 0, False: 0] ------------------ 295| 0| auto h1 = HashFunction::create(req.arg(0)); 296| 0| auto h2 = HashFunction::create(req.arg(1)); 297| | 298| 0| if(h1 && h2) { ------------------ | Branch (298:10): [True: 0, False: 0] | Branch (298:16): [True: 0, False: 0] ------------------ 299| 0| return std::make_unique(std::move(h1), std::move(h2)); 300| 0| } 301| 0| } 302| 0|#endif 303| | 304| 0| return nullptr; 305| 0|} _ZN5Botan12HashFunction15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 308| 8.32k|std::unique_ptr HashFunction::create_or_throw(std::string_view algo, std::string_view provider) { 309| 8.32k| if(auto hash = HashFunction::create(algo, provider)) { ------------------ | Branch (309:12): [True: 8.32k, False: 0] ------------------ 310| 8.32k| return hash; 311| 8.32k| } 312| 0| throw Lookup_Error("Hash", algo, provider); 313| 8.32k|} _ZN5Botan5SHA_110compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 24| 3.79k|void SHA_1::compress_n(digest_type& digest, std::span input, size_t blocks) { 25| 3.79k| using namespace SHA1_F; 26| | 27| 3.79k|#if defined(BOTAN_HAS_SHA1_X86_SHA_NI) 28| 3.79k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (28:7): [True: 3.79k, False: 0] ------------------ 29| 3.79k| return sha1_compress_x86(digest, input, blocks); 30| 3.79k| } 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| 2.84k|void SHA_1::init(digest_type& digest) { 175| 2.84k| digest.assign({0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0}); 176| 2.84k|} _ZN5Botan5SHA_18add_dataENSt3__14spanIKhLm18446744073709551615EEE: 214| 1.96k|void SHA_1::add_data(std::span input) { 215| 1.96k| m_md.update(input); 216| 1.96k|} _ZN5Botan5SHA_112final_resultENSt3__14spanIhLm18446744073709551615EEE: 218| 1.88k|void SHA_1::final_result(std::span output) { 219| 1.88k| m_md.final(output); 220| 1.88k|} _ZN5Botan5SHA_117sha1_compress_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 76| 3.79k| size_t blocks) { 77| 3.79k| const uint8_t* input = input_span.data(); 78| | 79| 3.79k| SIMD_4x32 ABCD = rev_words(SIMD_4x32::load_le(&digest[0])); // NOLINT(*-container-data-pointer) 80| 3.79k| SIMD_4x32 E0 = SIMD_4x32(0, 0, 0, digest[4]); 81| | 82| 20.0k| while(blocks > 0) { ------------------ | Branch (82:10): [True: 16.2k, False: 3.79k] ------------------ 83| | // Save current hash 84| 16.2k| const auto ABCD_SAVE = ABCD; 85| 16.2k| const auto E0_SAVE = E0; 86| | 87| 16.2k| auto W0 = rev_words(SIMD_4x32::load_be(input)); 88| 16.2k| auto W1 = rev_words(SIMD_4x32::load_be(input + 16)); 89| 16.2k| auto W2 = rev_words(SIMD_4x32::load_be(input + 32)); 90| 16.2k| auto W3 = rev_words(SIMD_4x32::load_be(input + 48)); 91| | 92| 16.2k| sha1_x86_first8<0>(ABCD, E0, W0, W1); 93| 16.2k| sha1_x86_rnds8<0>(ABCD, E0, W2, W3); 94| | 95| 16.2k| W0 = sha1_x86_msg1(W0, W1); 96| 16.2k| W1 = sha1_x86_msg1(W1, W2); 97| 16.2k| W0 ^= W2; 98| | 99| 16.2k| sha1_x86_next_msg(W3, W0, W1, W2); 100| 16.2k| sha1_x86_next_msg(W0, W1, W2, W3); 101| 16.2k| sha1_x86_rnds8<0, 1>(ABCD, E0, W0, W1); 102| | 103| 16.2k| sha1_x86_next_msg(W1, W2, W3, W0); 104| 16.2k| sha1_x86_next_msg(W2, W3, W0, W1); 105| 16.2k| sha1_x86_rnds8<1>(ABCD, E0, W2, W3); 106| | 107| 16.2k| sha1_x86_next_msg(W3, W0, W1, W2); 108| 16.2k| sha1_x86_next_msg(W0, W1, W2, W3); 109| 16.2k| sha1_x86_rnds8<1>(ABCD, E0, W0, W1); 110| | 111| 16.2k| sha1_x86_next_msg(W1, W2, W3, W0); 112| 16.2k| sha1_x86_next_msg(W2, W3, W0, W1); 113| 16.2k| sha1_x86_rnds8<2>(ABCD, E0, W2, W3); 114| | 115| 16.2k| sha1_x86_next_msg(W3, W0, W1, W2); 116| 16.2k| sha1_x86_next_msg(W0, W1, W2, W3); 117| 16.2k| sha1_x86_rnds8<2>(ABCD, E0, W0, W1); 118| | 119| 16.2k| sha1_x86_next_msg(W1, W2, W3, W0); 120| 16.2k| sha1_x86_next_msg(W2, W3, W0, W1); 121| 16.2k| sha1_x86_rnds8<2, 3>(ABCD, E0, W2, W3); 122| | 123| 16.2k| sha1_x86_next_msg(W3, W0, W1, W2); 124| 16.2k| sha1_x86_next_msg(W0, W1, W2, W3); 125| 16.2k| sha1_x86_rnds8<3>(ABCD, E0, W0, W1); 126| | 127| 16.2k| sha1_x86_next_msg(W1, W2, W3, W0); 128| 16.2k| sha1_x86_next_msg(W2, W3, W0, W1); 129| 16.2k| sha1_x86_rnds8<3>(ABCD, E0, W2, W3); 130| | 131| 16.2k| ABCD += ABCD_SAVE; 132| 16.2k| E0 = sha1_x86_nexte(E0, E0_SAVE); 133| | 134| 16.2k| input += 64; 135| 16.2k| blocks--; 136| 16.2k| } 137| | 138| 3.79k| rev_words(ABCD).store_le(&digest[0]); // NOLINT(*-container-data-pointer) 139| | digest[4] = _mm_extract_epi32(E0.raw(), 3); 140| 3.79k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_19rev_wordsERKNS_9SIMD_4x32E: 66| 72.6k|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| 72.6k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_113sha1_x86_msg1ERKNS_9SIMD_4x32ES3_: 29| 32.5k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_msg1(const SIMD_4x32& W0, const SIMD_4x32& W1) { 30| 32.5k| return SIMD_4x32(_mm_sha1msg1_epu32(W0.raw(), W1.raw())); 31| 32.5k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_117sha1_x86_next_msgERKNS_9SIMD_4x32ERS1_S4_S4_: 36| 260k| SIMD_4x32& W3) { 37| 260k| W3 = SIMD_4x32(_mm_sha1msg1_epu32(W3.raw(), W0.raw())); 38| 260k| W1 = SIMD_4x32(_mm_sha1msg2_epu32(W1.raw(), W0.raw())); 39| 260k| W2 ^= W0; 40| 260k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_nexteERKNS_9SIMD_4x32ES3_: 25| 325k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI SIMD_4x32 sha1_x86_nexte(const SIMD_4x32& x, const SIMD_4x32& y) { 26| 325k| return SIMD_4x32(_mm_sha1nexte_epu32(x.raw(), y.raw())); 27| 325k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_115sha1_x86_first8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 46| 16.2k| const SIMD_4x32& W1) { 47| 16.2k| auto TE = ABCD; 48| 16.2k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), (E + W0).raw(), R1)); 49| | 50| 16.2k| E = ABCD; 51| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 52| 16.2k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh0EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 16.2k| const SIMD_4x32& W1) { 59| 16.2k| auto TE = ABCD; 60| 16.2k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 16.2k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 16.2k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh0ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 16.2k| const SIMD_4x32& W1) { 59| 16.2k| auto TE = ABCD; 60| 16.2k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 16.2k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 16.2k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh1ELh1EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 32.5k| const SIMD_4x32& W1) { 59| 32.5k| auto TE = ABCD; 60| 32.5k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 32.5k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 32.5k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh2EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 32.5k| const SIMD_4x32& W1) { 59| 32.5k| auto TE = ABCD; 60| 32.5k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 32.5k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 32.5k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh2ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 16.2k| const SIMD_4x32& W1) { 59| 16.2k| auto TE = ABCD; 60| 16.2k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 16.2k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 16.2k|} sha1_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha1_x86_rnds8ILh3ELh3EEEvRNS_9SIMD_4x32ES3_RKS2_S5_: 58| 32.5k| const SIMD_4x32& W1) { 59| 32.5k| auto TE = ABCD; 60| 32.5k| ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(E, W0).raw(), R1)); 61| | 62| 32.5k| E = ABCD; 63| | ABCD = SIMD_4x32(_mm_sha1rnds4_epu32(ABCD.raw(), sha1_x86_nexte(TE, W1).raw(), R2)); 64| 32.5k|} _ZN5Botan7SHA_25615compress_digestERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 59| 12.3k| size_t blocks) { 60| 12.3k|#if defined(BOTAN_HAS_SHA2_32_X86) 61| 12.3k| if(CPUID::has(CPUID::Feature::SHA)) { ------------------ | Branch (61:7): [True: 12.3k, False: 0] ------------------ 62| 12.3k| return SHA_256::compress_digest_x86(digest, input, blocks); 63| 12.3k| } 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], 0x428A2F98); 103| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x71374491); 104| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0xB5C0FBCF); 105| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0xE9B5DBA5); 106| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x3956C25B); 107| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x59F111F1); 108| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x923F82A4); 109| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0xAB1C5ED5); 110| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xD807AA98); 111| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x12835B01); 112| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x243185BE); 113| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x550C7DC3); 114| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x72BE5D74); 115| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0x80DEB1FE); 116| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x9BDC06A7); 117| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC19BF174); 118| | 119| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0xE49B69C1); 120| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0xEFBE4786); 121| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x0FC19DC6); 122| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x240CA1CC); 123| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x2DE92C6F); 124| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4A7484AA); 125| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5CB0A9DC); 126| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x76F988DA); 127| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x983E5152); 128| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA831C66D); 129| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xB00327C8); 130| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xBF597FC7); 131| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xC6E00BF3); 132| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD5A79147); 133| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x06CA6351); 134| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x14292967); 135| | 136| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x27B70A85); 137| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x2E1B2138); 138| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x4D2C6DFC); 139| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x53380D13); 140| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x650A7354); 141| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x766A0ABB); 142| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x81C2C92E); 143| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x92722C85); 144| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xA2BFE8A1); 145| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA81A664B); 146| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xC24B8B70); 147| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xC76C51A3); 148| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xD192E819); 149| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD6990624); 150| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xF40E3585); 151| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x106AA070); 152| | 153| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x19A4C116); 154| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x1E376C08); 155| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x2748774C); 156| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x34B0BCB5); 157| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x391C0CB3); 158| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4ED8AA4A); 159| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5B9CCA4F); 160| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x682E6FF3); 161| 0| SHA2_32_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x748F82EE); 162| 0| SHA2_32_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x78A5636F); 163| 0| SHA2_32_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x84C87814); 164| 0| SHA2_32_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x8CC70208); 165| 0| SHA2_32_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x90BEFFFA); 166| 0| SHA2_32_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xA4506CEB); 167| 0| SHA2_32_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xBEF9A3F7); 168| 0| SHA2_32_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC67178F2); 169| | 170| | // clang-format on 171| | 172| 0| A = (digest[0] += A); 173| 0| B = (digest[1] += B); 174| 0| C = (digest[2] += C); 175| 0| D = (digest[3] += D); 176| 0| E = (digest[4] += E); 177| 0| F = (digest[5] += F); 178| 0| G = (digest[6] += G); 179| 0| H = (digest[7] += H); 180| 0| } 181| 0|} _ZN5Botan7SHA_25610compress_nERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 215| 12.3k|void SHA_256::compress_n(digest_type& digest, std::span input, size_t blocks) { 216| 12.3k| SHA_256::compress_digest(digest, input, blocks); 217| 12.3k|} _ZN5Botan7SHA_2564initERNSt3__16vectorIjNS_16secure_allocatorIjEEEE: 219| 18.8k|void SHA_256::init(digest_type& digest) { 220| 18.8k| digest.assign({0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A, 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19}); 221| 18.8k|} _ZN5Botan7SHA_2568add_dataENSt3__14spanIKhLm18446744073709551615EEE: 231| 11.2k|void SHA_256::add_data(std::span input) { 232| 11.2k| m_md.update(input); 233| 11.2k|} _ZN5Botan7SHA_25612final_resultENSt3__14spanIhLm18446744073709551615EEE: 235| 10.5k|void SHA_256::final_result(std::span output) { 236| 10.5k| m_md.final(output); 237| 10.5k|} _ZN5Botan7SHA_25619compress_digest_x86ERNSt3__16vectorIjNS_16secure_allocatorIjEEEENS1_4spanIKhLm18446744073709551615EEEm: 58| 12.3k| size_t blocks) { 59| 12.3k| alignas(64) static const uint32_t K[] = { 60| 12.3k| 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, 61| 12.3k| 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 62| 12.3k| 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, 63| 12.3k| 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967, 64| 12.3k| 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 65| 12.3k| 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, 66| 12.3k| 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, 67| 12.3k| 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2, 68| 12.3k| }; 69| | 70| 12.3k| const uint8_t* input = input_span.data(); 71| | 72| 12.3k| SIMD_4x32 S0 = SIMD_4x32::load_le(&digest[0]); // NOLINT(*container-data-pointer) 73| 12.3k| SIMD_4x32 S1 = SIMD_4x32::load_le(&digest[4]); 74| | 75| 12.3k| sha256_permute_state(S0, S1); 76| | 77| 35.4k| while(blocks > 0) { ------------------ | Branch (77:10): [True: 23.1k, False: 12.3k] ------------------ 78| 23.1k| const auto S0_SAVE = S0; 79| 23.1k| const auto S1_SAVE = S1; 80| | 81| 23.1k| auto W0 = SIMD_4x32::load_be(input); 82| 23.1k| auto W1 = SIMD_4x32::load_be(input + 16); 83| 23.1k| auto W2 = SIMD_4x32::load_be(input + 32); 84| 23.1k| auto W3 = SIMD_4x32::load_be(input + 48); 85| | 86| 23.1k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[0])); 87| 23.1k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4])); 88| 23.1k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[8])); 89| 23.1k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[12])); 90| | 91| 23.1k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 92| 23.1k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 93| | 94| 23.1k| sha256_msg_exp(W2, W3, W0, W1); 95| | 96| 23.1k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 4])); 97| 23.1k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 5])); 98| | 99| 23.1k| sha256_msg_exp(W0, W1, W2, W3); 100| | 101| 23.1k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 6])); 102| 23.1k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 7])); 103| | 104| 23.1k| sha256_msg_exp(W2, W3, W0, W1); 105| | 106| 23.1k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 8])); 107| 23.1k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 9])); 108| | 109| 23.1k| sha256_msg_exp(W0, W1, W2, W3); 110| | 111| 23.1k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 10])); 112| 23.1k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 11])); 113| | 114| 23.1k| sha256_msg_exp(W2, W3, W0, W1); 115| | 116| 23.1k| sha256_rnds4(S0, S1, W0, SIMD_4x32::load_le(&K[4 * 12])); 117| 23.1k| sha256_rnds4(S0, S1, W1, SIMD_4x32::load_le(&K[4 * 13])); 118| | 119| 23.1k| sha256_msg_exp(W0, W1, W2, W3); 120| | 121| 23.1k| sha256_rnds4(S0, S1, W2, SIMD_4x32::load_le(&K[4 * 14])); 122| 23.1k| sha256_rnds4(S0, S1, W3, SIMD_4x32::load_le(&K[4 * 15])); 123| | 124| | // Add values back to state 125| 23.1k| S0 += S0_SAVE; 126| 23.1k| S1 += S1_SAVE; 127| | 128| 23.1k| input += 64; 129| 23.1k| blocks--; 130| 23.1k| } 131| | 132| 12.3k| sha256_permute_state(S1, S0); 133| | 134| 12.3k| S0.store_le(&digest[0]); // NOLINT(*container-data-pointer) 135| 12.3k| S1.store_le(&digest[4]); 136| 12.3k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_120sha256_permute_stateERNS_9SIMD_4x32ES2_: 43| 24.6k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_permute_state(SIMD_4x32& S0, SIMD_4x32& S1) { 44| 24.6k| S0 = SIMD_4x32(_mm_shuffle_epi32(S0.raw(), 0b10110001)); // CDAB 45| 24.6k| S1 = SIMD_4x32(_mm_shuffle_epi32(S1.raw(), 0b00011011)); // EFGH 46| | 47| 24.6k| const auto T = SIMD_4x32::alignr8(S0, S1); // ABEF 48| | S1 = SIMD_4x32(_mm_blend_epi16(S1.raw(), S0.raw(), 0xF0)); // CDGH 49| 24.6k| S0 = T; 50| 24.6k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_112sha256_rnds4ERNS_9SIMD_4x32ES2_RKS1_S4_: 27| 369k| const SIMD_4x32& k) { 28| 369k| const auto mk = msg + k; 29| 369k| S1 = SIMD_4x32(_mm_sha256rnds2_epu32(S1.raw(), S0.raw(), mk.raw())); 30| 369k| S0 = SIMD_4x32(_mm_sha256rnds2_epu32(S0.raw(), S1.raw(), mk.shift_elems_right<2>().raw())); 31| 369k|} sha2_32_x86.cpp:_ZN5Botan12_GLOBAL__N_114sha256_msg_expERNS_9SIMD_4x32ES2_S2_S2_: 33| 138k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_SHANI void sha256_msg_exp(SIMD_4x32& W0, SIMD_4x32& W1, SIMD_4x32& W2, SIMD_4x32& W3) { 34| 138k| W2 += SIMD_4x32::alignr4(W1, W0); 35| 138k| W0 = SIMD_4x32(_mm_sha256msg1_epu32(W0.raw(), W1.raw())); 36| 138k| W2 = SIMD_4x32(_mm_sha256msg2_epu32(W2.raw(), W1.raw())); 37| | 38| 138k| W3 += SIMD_4x32::alignr4(W2, W1); 39| 138k| W1 = SIMD_4x32(_mm_sha256msg1_epu32(W1.raw(), W2.raw())); 40| 138k| W3 = SIMD_4x32(_mm_sha256msg2_epu32(W3.raw(), W2.raw())); 41| 138k|} _ZN5Botan7SHA_51215compress_digestERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 56| 2.65k|void SHA_512::compress_digest(digest_type& digest, std::span input, size_t blocks) { 57| 2.65k|#if defined(BOTAN_HAS_SHA2_64_X86) 58| 2.65k| if(CPUID::has(CPUID::Feature::SHA512)) { ------------------ | Branch (58:7): [True: 0, False: 2.65k] ------------------ 59| 0| return compress_digest_x86(digest, input, blocks); 60| 0| } 61| 2.65k|#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| 2.65k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX512) 70| 2.65k| if(CPUID::has(CPUID::Feature::AVX512, CPUID::Feature::BMI)) { ------------------ | Branch (70:7): [True: 0, False: 2.65k] ------------------ 71| 0| return compress_digest_x86_avx512(digest, input, blocks); 72| 0| } 73| 2.65k|#endif 74| | 75| 2.65k|#if defined(BOTAN_HAS_SHA2_64_X86_AVX2) 76| 2.65k| if(CPUID::has(CPUID::Feature::AVX2, CPUID::Feature::BMI)) { ------------------ | Branch (76:7): [True: 2.65k, False: 0] ------------------ 77| 2.65k| return compress_digest_x86_avx2(digest, input, blocks); 78| 2.65k| } 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], 0x428A2F98D728AE22); 100| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x7137449123EF65CD); 101| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0xB5C0FBCFEC4D3B2F); 102| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0xE9B5DBA58189DBBC); 103| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x3956C25BF348B538); 104| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x59F111F1B605D019); 105| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x923F82A4AF194F9B); 106| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0xAB1C5ED5DA6D8118); 107| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xD807AA98A3030242); 108| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x12835B0145706FBE); 109| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x243185BE4EE4B28C); 110| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x550C7DC3D5FFB4E2); 111| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x72BE5D74F27B896F); 112| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0x80DEB1FE3B1696B1); 113| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x9BDC06A725C71235); 114| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC19BF174CF692694); 115| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0xE49B69C19EF14AD2); 116| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0xEFBE4786384F25E3); 117| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x0FC19DC68B8CD5B5); 118| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x240CA1CC77AC9C65); 119| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x2DE92C6F592B0275); 120| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4A7484AA6EA6E483); 121| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5CB0A9DCBD41FBD4); 122| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x76F988DA831153B5); 123| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x983E5152EE66DFAB); 124| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA831C66D2DB43210); 125| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xB00327C898FB213F); 126| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xBF597FC7BEEF0EE4); 127| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xC6E00BF33DA88FC2); 128| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD5A79147930AA725); 129| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x06CA6351E003826F); 130| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x142929670A0E6E70); 131| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x27B70A8546D22FFC); 132| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x2E1B21385C26C926); 133| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x4D2C6DFC5AC42AED); 134| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x53380D139D95B3DF); 135| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x650A73548BAF63DE); 136| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x766A0ABB3C77B2A8); 137| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x81C2C92E47EDAEE6); 138| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x92722C851482353B); 139| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0xA2BFE8A14CF10364); 140| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0xA81A664BBC423001); 141| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0xC24B8B70D0F89791); 142| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0xC76C51A30654BE30); 143| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0xD192E819D6EF5218); 144| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xD69906245565A910); 145| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xF40E35855771202A); 146| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x106AA07032BBD1B8); 147| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0x19A4C116B8D2D0C8); 148| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0x1E376C085141AB53); 149| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0x2748774CDF8EEB99); 150| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0x34B0BCB5E19B48A8); 151| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x391C0CB3C5C95A63); 152| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x4ED8AA4AE3418ACB); 153| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x5B9CCA4F7763E373); 154| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x682E6FF3D6B2B8A3); 155| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x748F82EE5DEFB2FC); 156| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x78A5636F43172F60); 157| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x84C87814A1F0AB72); 158| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x8CC702081A6439EC); 159| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x90BEFFFA23631E28); 160| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0xA4506CEBDE82BDE9); 161| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0xBEF9A3F7B2C67915); 162| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0xC67178F2E372532B); 163| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 0], W[14], W[ 9], W[ 1], 0xCA273ECEEA26619C); 164| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 1], W[15], W[10], W[ 2], 0xD186B8C721C0C207); 165| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[ 2], W[ 0], W[11], W[ 3], 0xEADA7DD6CDE0EB1E); 166| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[ 3], W[ 1], W[12], W[ 4], 0xF57D4F7FEE6ED178); 167| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[ 4], W[ 2], W[13], W[ 5], 0x06F067AA72176FBA); 168| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[ 5], W[ 3], W[14], W[ 6], 0x0A637DC5A2C898A6); 169| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[ 6], W[ 4], W[15], W[ 7], 0x113F9804BEF90DAE); 170| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[ 7], W[ 5], W[ 0], W[ 8], 0x1B710B35131C471B); 171| 0| SHA2_64_F(A, B, C, D, E, F, G, H, W[ 8], W[ 6], W[ 1], W[ 9], 0x28DB77F523047D84); 172| 0| SHA2_64_F(H, A, B, C, D, E, F, G, W[ 9], W[ 7], W[ 2], W[10], 0x32CAAB7B40C72493); 173| 0| SHA2_64_F(G, H, A, B, C, D, E, F, W[10], W[ 8], W[ 3], W[11], 0x3C9EBE0A15C9BEBC); 174| 0| SHA2_64_F(F, G, H, A, B, C, D, E, W[11], W[ 9], W[ 4], W[12], 0x431D67C49C100D4C); 175| 0| SHA2_64_F(E, F, G, H, A, B, C, D, W[12], W[10], W[ 5], W[13], 0x4CC5D4BECB3E42B6); 176| 0| SHA2_64_F(D, E, F, G, H, A, B, C, W[13], W[11], W[ 6], W[14], 0x597F299CFC657E2A); 177| 0| SHA2_64_F(C, D, E, F, G, H, A, B, W[14], W[12], W[ 7], W[15], 0x5FCB6FAB3AD6FAEC); 178| 0| SHA2_64_F(B, C, D, E, F, G, H, A, W[15], W[13], W[ 8], W[ 0], 0x6C44198C4A475817); 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| 2.05k|void SHA_384::compress_n(digest_type& digest, std::span input, size_t blocks) { 210| 2.05k| SHA_512::compress_digest(digest, input, blocks); 211| 2.05k|} _ZN5Botan7SHA_51210compress_nERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 213| 592|void SHA_512::compress_n(digest_type& digest, std::span input, size_t blocks) { 214| 592| SHA_512::compress_digest(digest, input, blocks); 215| 592|} _ZN5Botan7SHA_3844initERNSt3__16vectorImNS_16secure_allocatorImEEEE: 228| 1.20k|void SHA_384::init(digest_type& digest) { 229| 1.20k| digest.assign({0xCBBB9D5DC1059ED8, 230| 1.20k| 0x629A292A367CD507, 231| 1.20k| 0x9159015A3070DD17, 232| 1.20k| 0x152FECD8F70E5939, 233| 1.20k| 0x67332667FFC00B31, 234| 1.20k| 0x8EB44A8768581511, 235| 1.20k| 0xDB0C2E0D64F98FA7, 236| 1.20k| 0x47B5481DBEFA4FA4}); 237| 1.20k|} _ZN5Botan7SHA_5124initERNSt3__16vectorImNS_16secure_allocatorImEEEE: 239| 592|void SHA_512::init(digest_type& digest) { 240| 592| digest.assign({0x6A09E667F3BCC908, 241| 592| 0xBB67AE8584CAA73B, 242| 592| 0x3C6EF372FE94F82B, 243| 592| 0xA54FF53A5F1D36F1, 244| 592| 0x510E527FADE682D1, 245| 592| 0x9B05688C2B3E6C1F, 246| 592| 0x1F83D9ABFB41BD6B, 247| 592| 0x5BE0CD19137E2179}); 248| 592|} _ZN5Botan7SHA_3848add_dataENSt3__14spanIKhLm18446744073709551615EEE: 274| 2.18k|void SHA_384::add_data(std::span input) { 275| 2.18k| m_md.update(input); 276| 2.18k|} _ZN5Botan7SHA_5128add_dataENSt3__14spanIKhLm18446744073709551615EEE: 278| 305|void SHA_512::add_data(std::span input) { 279| 305| m_md.update(input); 280| 305|} _ZN5Botan7SHA_38412final_resultENSt3__14spanIhLm18446744073709551615EEE: 286| 895|void SHA_384::final_result(std::span output) { 287| 895| m_md.final(output); 288| 895|} _ZN5Botan7SHA_51212final_resultENSt3__14spanIhLm18446744073709551615EEE: 290| 299|void SHA_512::final_result(std::span output) { 291| 299| m_md.final(output); 292| 299|} _ZN5Botan7SHA_51224compress_digest_x86_avx2ERNSt3__16vectorImNS_16secure_allocatorImEEEENS1_4spanIKhLm18446744073709551615EEEm: 44| 2.65k| size_t blocks) { 45| | // clang-format off 46| 2.65k| alignas(64) const uint64_t K[80] = { 47| 2.65k| 0x428A2F98D728AE22, 0x7137449123EF65CD, 0xB5C0FBCFEC4D3B2F, 0xE9B5DBA58189DBBC, 48| 2.65k| 0x3956C25BF348B538, 0x59F111F1B605D019, 0x923F82A4AF194F9B, 0xAB1C5ED5DA6D8118, 49| 2.65k| 0xD807AA98A3030242, 0x12835B0145706FBE, 0x243185BE4EE4B28C, 0x550C7DC3D5FFB4E2, 50| 2.65k| 0x72BE5D74F27B896F, 0x80DEB1FE3B1696B1, 0x9BDC06A725C71235, 0xC19BF174CF692694, 51| 2.65k| 0xE49B69C19EF14AD2, 0xEFBE4786384F25E3, 0x0FC19DC68B8CD5B5, 0x240CA1CC77AC9C65, 52| 2.65k| 0x2DE92C6F592B0275, 0x4A7484AA6EA6E483, 0x5CB0A9DCBD41FBD4, 0x76F988DA831153B5, 53| 2.65k| 0x983E5152EE66DFAB, 0xA831C66D2DB43210, 0xB00327C898FB213F, 0xBF597FC7BEEF0EE4, 54| 2.65k| 0xC6E00BF33DA88FC2, 0xD5A79147930AA725, 0x06CA6351E003826F, 0x142929670A0E6E70, 55| 2.65k| 0x27B70A8546D22FFC, 0x2E1B21385C26C926, 0x4D2C6DFC5AC42AED, 0x53380D139D95B3DF, 56| 2.65k| 0x650A73548BAF63DE, 0x766A0ABB3C77B2A8, 0x81C2C92E47EDAEE6, 0x92722C851482353B, 57| 2.65k| 0xA2BFE8A14CF10364, 0xA81A664BBC423001, 0xC24B8B70D0F89791, 0xC76C51A30654BE30, 58| 2.65k| 0xD192E819D6EF5218, 0xD69906245565A910, 0xF40E35855771202A, 0x106AA07032BBD1B8, 59| 2.65k| 0x19A4C116B8D2D0C8, 0x1E376C085141AB53, 0x2748774CDF8EEB99, 0x34B0BCB5E19B48A8, 60| 2.65k| 0x391C0CB3C5C95A63, 0x4ED8AA4AE3418ACB, 0x5B9CCA4F7763E373, 0x682E6FF3D6B2B8A3, 61| 2.65k| 0x748F82EE5DEFB2FC, 0x78A5636F43172F60, 0x84C87814A1F0AB72, 0x8CC702081A6439EC, 62| 2.65k| 0x90BEFFFA23631E28, 0xA4506CEBDE82BDE9, 0xBEF9A3F7B2C67915, 0xC67178F2E372532B, 63| 2.65k| 0xCA273ECEEA26619C, 0xD186B8C721C0C207, 0xEADA7DD6CDE0EB1E, 0xF57D4F7FEE6ED178, 64| 2.65k| 0x06F067AA72176FBA, 0x0A637DC5A2C898A6, 0x113F9804BEF90DAE, 0x1B710B35131C471B, 65| 2.65k| 0x28DB77F523047D84, 0x32CAAB7B40C72493, 0x3C9EBE0A15C9BEBC, 0x431D67C49C100D4C, 66| 2.65k| 0x4CC5D4BECB3E42B6, 0x597F299CFC657E2A, 0x5FCB6FAB3AD6FAEC, 0x6C44198C4A475817, 67| 2.65k| }; 68| | // clang-format on 69| | 70| 2.65k| alignas(64) uint64_t W[16] = {0}; 71| 2.65k| alignas(64) uint64_t W2[80]; 72| | 73| 2.65k| uint64_t A = digest[0]; 74| 2.65k| uint64_t B = digest[1]; 75| 2.65k| uint64_t C = digest[2]; 76| 2.65k| uint64_t D = digest[3]; 77| 2.65k| uint64_t E = digest[4]; 78| 2.65k| uint64_t F = digest[5]; 79| 2.65k| uint64_t G = digest[6]; 80| 2.65k| uint64_t H = digest[7]; 81| | 82| 2.65k| const uint8_t* data = input.data(); 83| | 84| 4.17k| while(blocks >= 2) { ------------------ | Branch (84:10): [True: 1.52k, False: 2.65k] ------------------ 85| 1.52k| SIMD_4x64 WS[8]; 86| | 87| 13.7k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (87:25): [True: 12.1k, False: 1.52k] ------------------ 88| 12.1k| WS[i] = SIMD_4x64::load_be2(&data[16 * i], &data[128 + 16 * i]); 89| 12.1k| auto WK = WS[i] + SIMD_4x64::broadcast_2x64(&K[2 * i]); 90| 12.1k| WK.store_le2(&W[2 * i], &W2[2 * i]); 91| 12.1k| } 92| | 93| 1.52k| data += 2 * 128; 94| 1.52k| blocks -= 2; 95| | 96| | // First 64 rounds of SHA-512 97| 7.61k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (97:25): [True: 6.09k, False: 1.52k] ------------------ 98| 6.09k| auto w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 16]); 99| 6.09k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 100| 6.09k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 101| 6.09k| w.store_le2(&W[0], &W2[r + 16]); 102| | 103| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 18]); 104| 6.09k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 105| 6.09k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 106| 6.09k| w.store_le2(&W[2], &W2[r + 18]); 107| | 108| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 20]); 109| 6.09k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 110| 6.09k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 111| 6.09k| w.store_le2(&W[4], &W2[r + 20]); 112| | 113| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 22]); 114| 6.09k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 115| 6.09k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 116| 6.09k| w.store_le2(&W[6], &W2[r + 22]); 117| | 118| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 24]); 119| 6.09k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 120| 6.09k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 121| 6.09k| w.store_le2(&W[8], &W2[r + 24]); 122| | 123| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 26]); 124| 6.09k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 125| 6.09k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 126| 6.09k| w.store_le2(&W[10], &W2[r + 26]); 127| | 128| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 28]); 129| 6.09k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 130| 6.09k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 131| 6.09k| w.store_le2(&W[12], &W2[r + 28]); 132| | 133| 6.09k| w = sha512_next_w(WS) + SIMD_4x64::broadcast_2x64(&K[r + 30]); 134| 6.09k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 135| 6.09k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 136| 6.09k| w.store_le2(&W[14], &W2[r + 30]); 137| 6.09k| } 138| | 139| | // Final 16 rounds of SHA-512 140| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 141| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 142| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 143| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 144| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 145| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 146| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 147| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 148| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 149| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 150| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 151| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 152| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 153| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 154| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 155| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 156| | 157| 1.52k| A = (digest[0] += A); 158| 1.52k| B = (digest[1] += B); 159| 1.52k| C = (digest[2] += C); 160| 1.52k| D = (digest[3] += D); 161| 1.52k| E = (digest[4] += E); 162| 1.52k| F = (digest[5] += F); 163| 1.52k| G = (digest[6] += G); 164| 1.52k| H = (digest[7] += H); 165| | 166| | // Second block of SHA-512 compression, with pre-expanded message 167| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[0]); 168| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[1]); 169| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[2]); 170| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[3]); 171| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[4]); 172| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[5]); 173| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[6]); 174| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[7]); 175| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[8]); 176| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[9]); 177| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[10]); 178| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[11]); 179| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[12]); 180| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[13]); 181| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[14]); 182| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[15]); 183| | 184| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[16]); 185| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[17]); 186| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[18]); 187| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[19]); 188| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[20]); 189| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[21]); 190| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[22]); 191| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[23]); 192| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[24]); 193| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[25]); 194| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[26]); 195| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[27]); 196| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[28]); 197| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[29]); 198| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[30]); 199| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[31]); 200| | 201| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[32]); 202| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[33]); 203| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[34]); 204| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[35]); 205| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[36]); 206| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[37]); 207| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[38]); 208| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[39]); 209| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[40]); 210| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[41]); 211| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[42]); 212| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[43]); 213| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[44]); 214| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[45]); 215| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[46]); 216| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[47]); 217| | 218| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[48]); 219| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[49]); 220| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[50]); 221| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[51]); 222| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[52]); 223| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[53]); 224| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[54]); 225| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[55]); 226| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[56]); 227| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[57]); 228| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[58]); 229| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[59]); 230| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[60]); 231| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[61]); 232| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[62]); 233| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[63]); 234| | 235| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[64]); 236| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[65]); 237| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[66]); 238| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[67]); 239| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[68]); 240| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[69]); 241| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[70]); 242| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[71]); 243| 1.52k| SHA2_64_F(A, B, C, D, E, F, G, H, W2[72]); 244| 1.52k| SHA2_64_F(H, A, B, C, D, E, F, G, W2[73]); 245| 1.52k| SHA2_64_F(G, H, A, B, C, D, E, F, W2[74]); 246| 1.52k| SHA2_64_F(F, G, H, A, B, C, D, E, W2[75]); 247| 1.52k| SHA2_64_F(E, F, G, H, A, B, C, D, W2[76]); 248| 1.52k| SHA2_64_F(D, E, F, G, H, A, B, C, W2[77]); 249| 1.52k| SHA2_64_F(C, D, E, F, G, H, A, B, W2[78]); 250| 1.52k| SHA2_64_F(B, C, D, E, F, G, H, A, W2[79]); 251| | 252| 1.52k| A = (digest[0] += A); 253| 1.52k| B = (digest[1] += B); 254| 1.52k| C = (digest[2] += C); 255| 1.52k| D = (digest[3] += D); 256| 1.52k| E = (digest[4] += E); 257| 1.52k| F = (digest[5] += F); 258| 1.52k| G = (digest[6] += G); 259| 1.52k| H = (digest[7] += H); 260| 1.52k| } 261| | 262| 4.96k| while(blocks > 0) { ------------------ | Branch (262:10): [True: 2.31k, False: 2.65k] ------------------ 263| 2.31k| SIMD_2x64 WS[8]; 264| | 265| 20.8k| for(size_t i = 0; i < 8; i++) { ------------------ | Branch (265:25): [True: 18.5k, False: 2.31k] ------------------ 266| 18.5k| WS[i] = SIMD_2x64::load_be(&data[16 * i]); 267| 18.5k| auto WK = WS[i] + SIMD_2x64::load_le(&K[2 * i]); 268| 18.5k| WK.store_le(&W[2 * i]); 269| 18.5k| } 270| | 271| 2.31k| data += 128; 272| 2.31k| blocks -= 1; 273| | 274| | // First 64 rounds of SHA-512 275| 11.5k| for(size_t r = 0; r != 64; r += 16) { ------------------ | Branch (275:25): [True: 9.25k, False: 2.31k] ------------------ 276| 9.25k| auto w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 16]); 277| 9.25k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 278| 9.25k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 279| 9.25k| w.store_le(&W[0]); 280| | 281| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 18]); 282| 9.25k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 283| 9.25k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 284| 9.25k| w.store_le(&W[2]); 285| | 286| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 20]); 287| 9.25k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 288| 9.25k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 289| 9.25k| w.store_le(&W[4]); 290| | 291| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 22]); 292| 9.25k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 293| 9.25k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 294| 9.25k| w.store_le(&W[6]); 295| | 296| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 24]); 297| 9.25k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 298| 9.25k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 299| 9.25k| w.store_le(&W[8]); 300| | 301| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 26]); 302| 9.25k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 303| 9.25k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 304| 9.25k| w.store_le(&W[10]); 305| | 306| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 28]); 307| 9.25k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 308| 9.25k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 309| 9.25k| w.store_le(&W[12]); 310| | 311| 9.25k| w = sha512_next_w(WS) + SIMD_2x64::load_le(&K[r + 30]); 312| 9.25k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 313| 9.25k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 314| 9.25k| w.store_le(&W[14]); 315| 9.25k| } 316| | 317| | // Final 16 rounds of SHA-512 318| 2.31k| SHA2_64_F(A, B, C, D, E, F, G, H, W[0]); 319| 2.31k| SHA2_64_F(H, A, B, C, D, E, F, G, W[1]); 320| 2.31k| SHA2_64_F(G, H, A, B, C, D, E, F, W[2]); 321| 2.31k| SHA2_64_F(F, G, H, A, B, C, D, E, W[3]); 322| 2.31k| SHA2_64_F(E, F, G, H, A, B, C, D, W[4]); 323| 2.31k| SHA2_64_F(D, E, F, G, H, A, B, C, W[5]); 324| 2.31k| SHA2_64_F(C, D, E, F, G, H, A, B, W[6]); 325| 2.31k| SHA2_64_F(B, C, D, E, F, G, H, A, W[7]); 326| 2.31k| SHA2_64_F(A, B, C, D, E, F, G, H, W[8]); 327| 2.31k| SHA2_64_F(H, A, B, C, D, E, F, G, W[9]); 328| 2.31k| SHA2_64_F(G, H, A, B, C, D, E, F, W[10]); 329| 2.31k| SHA2_64_F(F, G, H, A, B, C, D, E, W[11]); 330| 2.31k| SHA2_64_F(E, F, G, H, A, B, C, D, W[12]); 331| 2.31k| SHA2_64_F(D, E, F, G, H, A, B, C, W[13]); 332| 2.31k| SHA2_64_F(C, D, E, F, G, H, A, B, W[14]); 333| 2.31k| SHA2_64_F(B, C, D, E, F, G, H, A, W[15]); 334| | 335| 2.31k| A = (digest[0] += A); 336| 2.31k| B = (digest[1] += B); 337| 2.31k| C = (digest[2] += C); 338| 2.31k| D = (digest[3] += D); 339| 2.31k| E = (digest[4] += E); 340| 2.31k| F = (digest[5] += F); 341| 2.31k| G = (digest[6] += G); 342| 2.31k| H = (digest[7] += H); 343| 2.31k| } 344| 2.65k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_4x64EEET_PS3_: 19| 48.7k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 48.7k| auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 48.7k| auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 48.7k| auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 48.7k| auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 48.7k| auto nx = x[0] + s0 + s1 + t1; 27| | 28| 48.7k| x[0] = x[1]; 29| 48.7k| x[1] = x[2]; 30| 48.7k| x[2] = x[3]; 31| 48.7k| x[3] = x[4]; 32| 48.7k| x[4] = x[5]; 33| 48.7k| x[5] = x[6]; 34| 48.7k| x[6] = x[7]; 35| 48.7k| x[7] = nx; 36| | 37| 48.7k| return x[7]; 38| 48.7k|} sha2_64_avx2.cpp:_ZN5Botan12_GLOBAL__N_113sha512_next_wINS_9SIMD_2x64EEET_PS3_: 19| 74.0k|BOTAN_FORCE_INLINE BOTAN_FN_ISA_AVX2_BMI2 SIMD_T sha512_next_w(SIMD_T x[8]) { 20| 74.0k| auto t0 = SIMD_T::alignr8(x[1], x[0]); 21| 74.0k| auto t1 = SIMD_T::alignr8(x[5], x[4]); 22| | 23| 74.0k| auto s0 = t0.template rotr<1>() ^ t0.template rotr<8>() ^ t0.template shr<7>(); 24| 74.0k| auto s1 = x[7].template rotr<19>() ^ x[7].template rotr<61>() ^ x[7].template shr<6>(); 25| | 26| 74.0k| auto nx = x[0] + s0 + s1 + t1; 27| | 28| 74.0k| x[0] = x[1]; 29| 74.0k| x[1] = x[2]; 30| 74.0k| x[2] = x[3]; 31| 74.0k| x[3] = x[4]; 32| 74.0k| x[4] = x[5]; 33| 74.0k| x[5] = x[6]; 34| 74.0k| x[6] = x[7]; 35| 74.0k| x[7] = nx; 36| | 37| 74.0k| return x[7]; 38| 74.0k|} _ZN5Botan3KDF6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 73| 114|std::unique_ptr KDF::create(std::string_view algo_spec, std::string_view provider) { 74| 114| const SCAN_Name req(algo_spec); 75| | 76| 114|#if defined(BOTAN_HAS_HKDF) 77| 114| if(req.algo_name() == "HKDF" && req.arg_count() == 1) { ------------------ | Branch (77:7): [True: 0, False: 114] | Branch (77:36): [True: 0, False: 0] ------------------ 78| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (78:10): [True: 0, False: 0] | Branch (78:30): [True: 0, False: 0] ------------------ 79| 0| return kdf_create_mac_or_hash(req.arg(0)); 80| 0| } 81| 0| } 82| | 83| 114| if(req.algo_name() == "HKDF-Extract" && req.arg_count() == 1) { ------------------ | Branch (83:7): [True: 0, False: 114] | Branch (83:44): [True: 0, False: 0] ------------------ 84| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (84:10): [True: 0, False: 0] | Branch (84:30): [True: 0, False: 0] ------------------ 85| 0| return kdf_create_mac_or_hash(req.arg(0)); 86| 0| } 87| 0| } 88| | 89| 114| if(req.algo_name() == "HKDF-Expand" && req.arg_count() == 1) { ------------------ | Branch (89:7): [True: 0, False: 114] | Branch (89:43): [True: 0, False: 0] ------------------ 90| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (90:10): [True: 0, False: 0] | Branch (90:30): [True: 0, False: 0] ------------------ 91| 0| return kdf_create_mac_or_hash(req.arg(0)); 92| 0| } 93| 0| } 94| 114|#endif 95| | 96| 114|#if defined(BOTAN_HAS_KDF2) 97| 114| if(req.algo_name() == "KDF2" && req.arg_count() == 1) { ------------------ | Branch (97:7): [True: 0, False: 114] | Branch (97:36): [True: 0, False: 0] ------------------ 98| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (98:10): [True: 0, False: 0] | Branch (98:30): [True: 0, False: 0] ------------------ 99| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (99:18): [True: 0, False: 0] ------------------ 100| 0| return std::make_unique(std::move(hash)); 101| 0| } 102| 0| } 103| 0| } 104| 114|#endif 105| | 106| 114|#if defined(BOTAN_HAS_KDF1_18033) 107| 114| if(req.algo_name() == "KDF1-18033" && req.arg_count() == 1) { ------------------ | Branch (107:7): [True: 0, False: 114] | Branch (107:42): [True: 0, False: 0] ------------------ 108| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (108:10): [True: 0, False: 0] | Branch (108:30): [True: 0, False: 0] ------------------ 109| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (109:18): [True: 0, False: 0] ------------------ 110| 0| return std::make_unique(std::move(hash)); 111| 0| } 112| 0| } 113| 0| } 114| 114|#endif 115| | 116| 114|#if defined(BOTAN_HAS_KDF1) 117| 114| if(req.algo_name() == "KDF1" && req.arg_count() == 1) { ------------------ | Branch (117:7): [True: 0, False: 114] | Branch (117:36): [True: 0, False: 0] ------------------ 118| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (118:10): [True: 0, False: 0] | Branch (118:30): [True: 0, False: 0] ------------------ 119| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (119:18): [True: 0, False: 0] ------------------ 120| 0| return std::make_unique(std::move(hash)); 121| 0| } 122| 0| } 123| 0| } 124| 114|#endif 125| | 126| 114|#if defined(BOTAN_HAS_TLS_V12_PRF) 127| 114| if(req.algo_name() == "TLS-12-PRF" && req.arg_count() == 1) { ------------------ | Branch (127:7): [True: 114, False: 0] | Branch (127:42): [True: 114, False: 0] ------------------ 128| 114| if(provider.empty() || provider == "base") { ------------------ | Branch (128:10): [True: 114, False: 0] | Branch (128:30): [True: 0, False: 0] ------------------ 129| 114| return kdf_create_mac_or_hash(req.arg(0)); 130| 114| } 131| 114| } 132| 0|#endif 133| | 134| 0|#if defined(BOTAN_HAS_X942_PRF) 135| 0| if(req.algo_name() == "X9.42-PRF" && req.arg_count() == 1) { ------------------ | Branch (135:7): [True: 0, False: 0] | Branch (135:41): [True: 0, False: 0] ------------------ 136| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (136:10): [True: 0, False: 0] | Branch (136:30): [True: 0, False: 0] ------------------ 137| 0| return std::make_unique(req.arg(0)); 138| 0| } 139| 0| } 140| 0|#endif 141| | 142| 0|#if defined(BOTAN_HAS_SP800_108) 143| 0| if(req.algo_name() == "SP800-108-Counter" && req.arg_count_between(1, 3)) { ------------------ | Branch (143:7): [True: 0, False: 0] | Branch (143:49): [True: 0, False: 0] ------------------ 144| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (144:10): [True: 0, False: 0] | Branch (144:30): [True: 0, False: 0] ------------------ 145| 0| return kdf_create_mac_or_hash( 146| 0| req.arg(0), req.arg_as_integer(1, 32), req.arg_as_integer(2, 32)); 147| 0| } 148| 0| } 149| | 150| 0| if(req.algo_name() == "SP800-108-Feedback" && req.arg_count_between(1, 3)) { ------------------ | Branch (150:7): [True: 0, False: 0] | Branch (150:50): [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( 153| 0| req.arg(0), req.arg_as_integer(1, 32), req.arg_as_integer(2, 32)); 154| 0| } 155| 0| } 156| | 157| 0| if(req.algo_name() == "SP800-108-Pipeline" && req.arg_count_between(1, 3)) { ------------------ | Branch (157:7): [True: 0, False: 0] | Branch (157:50): [True: 0, False: 0] ------------------ 158| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (158:10): [True: 0, False: 0] | Branch (158:30): [True: 0, False: 0] ------------------ 159| 0| return kdf_create_mac_or_hash( 160| 0| req.arg(0), req.arg_as_integer(1, 32), req.arg_as_integer(2, 32)); 161| 0| } 162| 0| } 163| 0|#endif 164| | 165| 0|#if defined(BOTAN_HAS_SP800_56A) 166| 0| if(req.algo_name() == "SP800-56A" && req.arg_count() == 1) { ------------------ | Branch (166:7): [True: 0, False: 0] | Branch (166:41): [True: 0, False: 0] ------------------ 167| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (167:15): [True: 0, False: 0] ------------------ 168| 0| return std::make_unique(std::move(hash)); 169| 0| } 170| 0| if(req.arg(0) == "KMAC-128") { ------------------ | Branch (170:10): [True: 0, False: 0] ------------------ 171| 0| return std::make_unique(); 172| 0| } 173| 0| if(req.arg(0) == "KMAC-256") { ------------------ | Branch (173:10): [True: 0, False: 0] ------------------ 174| 0| return std::make_unique(); 175| 0| } 176| 0| if(auto mac = MessageAuthenticationCode::create(req.arg(0))) { ------------------ | Branch (176:15): [True: 0, False: 0] ------------------ 177| 0| return std::make_unique(std::move(mac)); 178| 0| } 179| 0| } 180| 0|#endif 181| | 182| 0|#if defined(BOTAN_HAS_SP800_56C) 183| 0| if(req.algo_name() == "SP800-56C" && req.arg_count() == 1) { ------------------ | Branch (183:7): [True: 0, False: 0] | Branch (183:41): [True: 0, False: 0] ------------------ 184| 0| std::unique_ptr exp(kdf_create_mac_or_hash(req.arg(0), 32, 32)); 185| 0| if(exp) { ------------------ | Branch (185:10): [True: 0, False: 0] ------------------ 186| 0| if(auto mac = MessageAuthenticationCode::create(req.arg(0))) { ------------------ | Branch (186:18): [True: 0, False: 0] ------------------ 187| 0| return std::make_unique(std::move(mac), std::move(exp)); 188| 0| } 189| | 190| 0| if(auto mac = MessageAuthenticationCode::create(fmt("HMAC({})", req.arg(0)))) { ------------------ | Branch (190:18): [True: 0, False: 0] ------------------ 191| 0| return std::make_unique(std::move(mac), std::move(exp)); 192| 0| } 193| 0| } 194| 0| } 195| 0|#endif 196| | 197| 0| BOTAN_UNUSED(req); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 198| 0| BOTAN_UNUSED(provider); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 199| | 200| 0| return nullptr; 201| 0|} _ZN5Botan3KDF15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 204| 114|std::unique_ptr KDF::create_or_throw(std::string_view algo, std::string_view provider) { 205| 114| if(auto kdf = KDF::create(algo, provider)) { ------------------ | Branch (205:12): [True: 114, False: 0] ------------------ 206| 114| return kdf; 207| 114| } 208| 0| throw Lookup_Error("KDF", algo, provider); 209| 114|} kdf.cpp:_ZN5Botan12_GLOBAL__N_122kdf_create_mac_or_hashINS_10TLS_12_PRFEJEEENSt3__110unique_ptrINS_3KDFENS3_14default_deleteIS5_EEEENS3_17basic_string_viewIcNS3_11char_traitsIcEEEEDpOT0_: 59| 114|std::unique_ptr kdf_create_mac_or_hash(std::string_view nm, ParamTs&&... params) { 60| 114| if(auto mac = MessageAuthenticationCode::create(fmt("HMAC({})", nm))) { ------------------ | Branch (60:12): [True: 114, False: 0] ------------------ 61| 114| return std::make_unique(std::move(mac), std::forward(params)...); 62| 114| } 63| | 64| 0| if(auto mac = MessageAuthenticationCode::create(nm)) { ------------------ | Branch (64:12): [True: 0, False: 0] ------------------ 65| 0| return std::make_unique(std::move(mac), std::forward(params)...); 66| 0| } 67| | 68| 0| return nullptr; 69| 0|} _ZNK5Botan10TLS_12_PRF11perform_kdfENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEES5_S5_: 25| 170| std::span label) const { 26| 170| try { 27| 170| m_mac->set_key(secret); 28| 170| } catch(Invalid_Key_Length&) { 29| 0| throw Internal_Error(fmt("The premaster secret of {} bytes is too long for TLS-PRF", secret.size())); 30| 0| } 31| | 32| 170| auto A = concat>(label, salt); 33| 170| secure_vector h; 34| | 35| 170| BufferStuffer o(key); 36| 452| while(!o.full()) { ------------------ | Branch (36:10): [True: 282, False: 170] ------------------ 37| 282| A = m_mac->process(A); 38| | 39| 282| m_mac->update(A); 40| 282| m_mac->update(label); 41| 282| m_mac->update(salt); 42| 282| m_mac->final(h); 43| | 44| 282| const size_t writing = std::min(h.size(), o.remaining_capacity()); 45| 282| xor_buf(o.next(writing), std::span{h}.first(writing)); 46| 282| } 47| 170|} _ZN5Botan4HMAC8add_dataENSt3__14spanIKhLm18446744073709551615EEE: 20| 1.21k|void HMAC::add_data(std::span input) { 21| 1.21k| assert_key_material_set(); 22| 1.21k| m_hash->update(input); 23| 1.21k|} _ZN5Botan4HMAC12final_resultENSt3__14spanIhLm18446744073709551615EEE: 28| 610|void HMAC::final_result(std::span mac) { 29| 610| assert_key_material_set(); 30| 610| m_hash->final(mac); 31| 610| m_hash->update(m_okey); 32| 610| m_hash->update(mac.first(m_hash_output_length)); 33| 610| m_hash->final(mac); 34| 610| m_hash->update(m_ikey); 35| 610|} _ZNK5Botan4HMAC8key_specEv: 37| 232|Key_Length_Specification HMAC::key_spec() const { 38| | // Support very long lengths for things like PBKDF2 and the TLS PRF 39| 232| return Key_Length_Specification(0, 8192); 40| 232|} _ZNK5Botan4HMAC13output_lengthEv: 42| 642|size_t HMAC::output_length() const { 43| 642| return m_hash_output_length; 44| 642|} _ZNK5Botan4HMAC19has_keying_materialEv: 46| 1.82k|bool HMAC::has_keying_material() const { 47| 1.82k| return !m_okey.empty(); 48| 1.82k|} _ZN5Botan4HMAC12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 53| 202|void HMAC::key_schedule(std::span key) { 54| 202| const uint8_t ipad = 0x36; 55| 202| const uint8_t opad = 0x5C; 56| | 57| 202| m_hash->clear(); 58| | 59| 202| m_ikey.resize(m_hash_block_size); 60| 202| m_okey.resize(m_hash_block_size); 61| | 62| 202| clear_mem(m_ikey.data(), m_ikey.size()); 63| 202| clear_mem(m_okey.data(), m_okey.size()); 64| | 65| | /* 66| | * Sometimes the HMAC key length itself is sensitive, as with PBKDF2 where it 67| | * reveals the length of the passphrase. Make some attempt to hide this to 68| | * side channels. Clearly if the secret is longer than the block size then the 69| | * branch to hash first reveals that. In addition, counting the number of 70| | * compression functions executed reveals the size at the granularity of the 71| | * hash function's block size. 72| | * 73| | * The greater concern is for smaller keys; being able to detect when a 74| | * passphrase is say 4 bytes may assist choosing weaker targets. Even though 75| | * the loop bounds are constant, we can only actually read key[0..length] so 76| | * it doesn't seem possible to make this computation truly constant time. 77| | * 78| | * We don't mind leaking if the length is exactly zero since that's 79| | * trivial to simply check. 80| | */ 81| | 82| 202| if(key.size() > m_hash_block_size) { ------------------ | Branch (82:7): [True: 38, False: 164] ------------------ 83| 38| m_hash->update(key); 84| 38| m_hash->final(m_ikey.data()); 85| 164| } else if(key.size() >= 20) { ------------------ | Branch (85:14): [True: 164, False: 0] ------------------ 86| | // For long keys we just leak the length either it is a cryptovariable 87| | // or a long enough password that just the length is not a useful signal 88| 164| copy_mem(std::span{m_ikey}.first(key.size()), key); 89| 164| } else if(!key.empty()) { ------------------ | Branch (89:14): [True: 0, False: 0] ------------------ 90| 0| for(size_t i = 0, i_mod_length = 0; i != m_hash_block_size; ++i) { ------------------ | Branch (90:43): [True: 0, False: 0] ------------------ 91| | /* 92| | access key[i % length] but avoiding division due to variable 93| | time computation on some processors. 94| | */ 95| 0| auto needs_reduction = CT::Mask::is_lte(key.size(), i_mod_length); 96| 0| i_mod_length = needs_reduction.select(0, i_mod_length); 97| 0| const uint8_t kb = key[i_mod_length]; 98| | 99| 0| auto in_range = CT::Mask::is_lt(i, key.size()); 100| 0| m_ikey[i] = static_cast(in_range.if_set_return(kb)); 101| 0| i_mod_length += 1; 102| 0| } 103| 0| } 104| | 105| 21.6k| for(size_t i = 0; i != m_hash_block_size; ++i) { ------------------ | Branch (105:22): [True: 21.4k, False: 202] ------------------ 106| 21.4k| m_ikey[i] ^= ipad; 107| 21.4k| m_okey[i] = m_ikey[i] ^ ipad ^ opad; 108| 21.4k| } 109| | 110| 202| m_hash->update(m_ikey); 111| 202|} _ZNK5Botan4HMAC4nameEv: 125| 32|std::string HMAC::name() const { 126| 32| return fmt("HMAC({})", m_hash->name()); 127| 32|} _ZN5Botan4HMACC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE: 140| 145| m_hash(std::move(hash)), 141| 145| m_hash_output_length(m_hash->output_length()), 142| 145| m_hash_block_size(m_hash->hash_block_size()) { 143| 145| BOTAN_ARG_CHECK(m_hash_block_size >= m_hash_output_length, "HMAC is not compatible with this hash function"); ------------------ | | 35| 145| do { \ | | 36| 145| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 145| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 145] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 145| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 145] | | ------------------ ------------------ 144| 145|} _ZN5Botan25MessageAuthenticationCode6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 51| 145| std::string_view provider) { 52| 145| const SCAN_Name req(algo_spec); 53| | 54| 145|#if defined(BOTAN_HAS_BLAKE2BMAC) 55| 145| if(req.algo_name() == "Blake2b" || req.algo_name() == "BLAKE2b") { ------------------ | Branch (55:7): [True: 0, False: 145] | Branch (55:39): [True: 0, False: 145] ------------------ 56| 0| return std::make_unique(req.arg_as_integer(0, 512)); 57| 0| } 58| 145|#endif 59| | 60| 145|#if defined(BOTAN_HAS_GMAC) 61| 145| if(req.algo_name() == "GMAC" && req.arg_count() == 1) { ------------------ | Branch (61:7): [True: 0, False: 145] | Branch (61:36): [True: 0, False: 0] ------------------ 62| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (62:10): [True: 0, False: 0] | Branch (62:30): [True: 0, False: 0] ------------------ 63| 0| if(auto bc = BlockCipher::create(req.arg(0))) { ------------------ | Branch (63:18): [True: 0, False: 0] ------------------ 64| 0| return std::make_unique(std::move(bc)); 65| 0| } 66| 0| } 67| 0| } 68| 145|#endif 69| | 70| 145|#if defined(BOTAN_HAS_HMAC) 71| 145| if(req.algo_name() == "HMAC" && req.arg_count() == 1) { ------------------ | Branch (71:7): [True: 145, False: 0] | Branch (71:36): [True: 145, False: 0] ------------------ 72| 145| if(provider.empty() || provider == "base") { ------------------ | Branch (72:10): [True: 145, False: 0] | Branch (72:30): [True: 0, False: 0] ------------------ 73| 145| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (73:18): [True: 145, False: 0] ------------------ 74| 145| return std::make_unique(std::move(hash)); 75| 145| } 76| 145| } 77| 145| } 78| 0|#endif 79| | 80| 0|#if defined(BOTAN_HAS_POLY1305) 81| 0| if(req.algo_name() == "Poly1305" && req.arg_count() == 0) { ------------------ | Branch (81:7): [True: 0, False: 0] | Branch (81:40): [True: 0, False: 0] ------------------ 82| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (82:10): [True: 0, False: 0] | Branch (82:30): [True: 0, False: 0] ------------------ 83| 0| return std::make_unique(); 84| 0| } 85| 0| } 86| 0|#endif 87| | 88| 0|#if defined(BOTAN_HAS_SIPHASH) 89| 0| if(req.algo_name() == "SipHash") { ------------------ | Branch (89:7): [True: 0, False: 0] ------------------ 90| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (90:10): [True: 0, False: 0] | Branch (90:30): [True: 0, False: 0] ------------------ 91| 0| return std::make_unique(req.arg_as_integer(0, 2), req.arg_as_integer(1, 4)); 92| 0| } 93| 0| } 94| 0|#endif 95| | 96| 0|#if defined(BOTAN_HAS_CMAC) 97| 0| if((req.algo_name() == "CMAC" || req.algo_name() == "OMAC") && req.arg_count() == 1) { ------------------ | Branch (97:8): [True: 0, False: 0] | Branch (97:37): [True: 0, False: 0] | Branch (97:67): [True: 0, False: 0] ------------------ 98| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (98:10): [True: 0, False: 0] | Branch (98:30): [True: 0, False: 0] ------------------ 99| 0| if(auto bc = BlockCipher::create(req.arg(0))) { ------------------ | Branch (99:18): [True: 0, False: 0] ------------------ 100| 0| return std::make_unique(std::move(bc)); 101| 0| } 102| 0| } 103| 0| } 104| 0|#endif 105| | 106| 0|#if defined(BOTAN_HAS_ANSI_X919_MAC) 107| 0| if(req.algo_name() == "X9.19-MAC") { ------------------ | Branch (107:7): [True: 0, False: 0] ------------------ 108| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (108:10): [True: 0, False: 0] | Branch (108:30): [True: 0, False: 0] ------------------ 109| 0| return std::make_unique(); 110| 0| } 111| 0| } 112| 0|#endif 113| | 114| 0|#if defined(BOTAN_HAS_KMAC) 115| 0| if(req.algo_name() == "KMAC-128") { ------------------ | Branch (115:7): [True: 0, False: 0] ------------------ 116| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (116:10): [True: 0, False: 0] | Branch (116:30): [True: 0, False: 0] ------------------ 117| 0| if(req.arg_count() != 1) { ------------------ | Branch (117:13): [True: 0, False: 0] ------------------ 118| 0| throw Invalid_Argument( 119| 0| "invalid algorithm specification for KMAC-128: need exactly one argument for output bit length"); 120| 0| } 121| 0| return std::make_unique(req.arg_as_integer(0)); 122| 0| } 123| 0| } 124| | 125| 0| if(req.algo_name() == "KMAC-256") { ------------------ | Branch (125:7): [True: 0, False: 0] ------------------ 126| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (126:10): [True: 0, False: 0] | Branch (126:30): [True: 0, False: 0] ------------------ 127| 0| if(req.arg_count() != 1) { ------------------ | Branch (127:13): [True: 0, False: 0] ------------------ 128| 0| throw Invalid_Argument( 129| 0| "invalid algorithm specification for KMAC-256: need exactly one argument for output bit length"); 130| 0| } 131| 0| return std::make_unique(req.arg_as_integer(0)); 132| 0| } 133| 0| } 134| 0|#endif 135| | 136| 0| BOTAN_UNUSED(req); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 137| 0| BOTAN_UNUSED(provider); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 138| | 139| 0| return nullptr; 140| 0|} _ZN5Botan25MessageAuthenticationCode15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 148| 31| std::string_view provider) { 149| 31| if(auto mac = MessageAuthenticationCode::create(algo, provider)) { ------------------ | Branch (149:12): [True: 31, False: 0] ------------------ 150| 31| return mac; 151| 31| } 152| 0| throw Lookup_Error("MAC", algo, provider); 153| 31|} _ZN5Botan6BigInt17from_radix_digitsENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEm: 125| 128|BigInt BigInt::from_radix_digits(std::string_view digits, size_t radix) { 126| 128| if(radix == 16) { ------------------ | Branch (126:7): [True: 128, False: 0] ------------------ 127| 128| secure_vector binary; 128| | 129| 128| if(digits.size() % 2 == 1) { ------------------ | Branch (129:10): [True: 55, False: 73] ------------------ 130| | // Handle lack of leading 0 131| 55| const char buf0_with_leading_0[2] = {'0', digits[0]}; 132| | 133| 55| binary = hex_decode_locked(buf0_with_leading_0, 2); 134| | 135| 55| if(digits.size() > 1) { ------------------ | Branch (135:13): [True: 5, False: 50] ------------------ 136| 5| binary += hex_decode_locked(&digits[1], digits.size() - 1, false); 137| 5| } 138| 73| } else { 139| 73| binary = hex_decode_locked(digits, false); 140| 73| } 141| | 142| 128| return BigInt::from_bytes(binary); 143| 128| } else if(radix == 10) { ------------------ | Branch (143:14): [True: 0, False: 0] ------------------ 144| | // Use the largest power of 10 that fits in a word, accumulating 145| | // groups of digits into word-sized chunks to minimize the number 146| | // of multiprecision multiplications. 147| 0| constexpr word conversion_radix = decimal_conversion_radix(); 148| 0| constexpr size_t radix_digits = decimal_conversion_radix_digits(); 149| | 150| 0| BigInt r; 151| | 152| | // Handle the initial partial block (if digit count is not a multiple of radix_digits) 153| 0| const size_t partial_block = digits.size() % radix_digits; 154| | 155| 0| if(partial_block > 0) { ------------------ | Branch (155:10): [True: 0, False: 0] ------------------ 156| 0| word acc = 0; 157| 0| for(size_t i = 0; i < partial_block; ++i) { ------------------ | Branch (157:28): [True: 0, False: 0] ------------------ 158| 0| const char c = digits[i]; 159| 0| BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character"); ------------------ | | 35| 0| do { \ | | 36| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 0| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 0| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 0] | | ------------------ ------------------ 160| 0| acc = acc * 10 + static_cast(c - '0'); 161| 0| } 162| 0| r += acc; 163| 0| } 164| | 165| | // Process full blocks of radix_digits 166| 0| for(size_t i = partial_block; i != digits.size(); i += radix_digits) { ------------------ | Branch (166:37): [True: 0, False: 0] ------------------ 167| 0| word acc = 0; 168| 0| for(size_t j = 0; j < radix_digits; ++j) { ------------------ | Branch (168:28): [True: 0, False: 0] ------------------ 169| 0| const char c = digits[i + j]; 170| 0| BOTAN_ARG_CHECK(c >= '0' && c <= '9', "Invalid decimal character"); ------------------ | | 35| 0| do { \ | | 36| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 0| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 0] | | | Branch (37:12): [True: 0, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 0| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 0] | | ------------------ ------------------ 171| 0| acc = acc * 10 + static_cast(c - '0'); 172| 0| } 173| 0| r *= conversion_radix; 174| 0| r += acc; 175| 0| } 176| | 177| 0| return r; 178| 0| } else { 179| 0| throw Invalid_Argument("BigInt::from_radix_digits unknown radix"); 180| 0| } 181| 128|} _ZN5Botan6BigIntpLERKS0_: 16| 71|BigInt& BigInt::operator+=(const BigInt& y) { 17| 71| if(&y == this) { ------------------ | Branch (17:7): [True: 0, False: 71] ------------------ 18| 0| return *this <<= 1; 19| 0| } 20| 71| return add(y._data(), y.sig_words(), y.sign()); 21| 71|} _ZN5Botan6BigIntmIERKS0_: 23| 26.6k|BigInt& BigInt::operator-=(const BigInt& y) { 24| 26.6k| if(&y == this) { ------------------ | Branch (24:7): [True: 0, False: 26.6k] ------------------ 25| 0| this->clear(); 26| 0| this->set_sign(Positive); 27| 0| return *this; 28| 0| } 29| 26.6k| return sub(y._data(), y.sig_words(), y.sign()); 30| 26.6k|} _ZN5Botan6BigInt3addEPKmmNS0_4SignE: 32| 26.9k|BigInt& BigInt::add(const word y[], size_t y_words, Sign y_sign) { 33| 26.9k| const size_t x_sw = sig_words(); 34| | 35| 26.9k| grow_to(std::max(x_sw, y_words) + 1); 36| | 37| 26.9k| if(sign() == y_sign) { ------------------ | Branch (37:7): [True: 120, False: 26.7k] ------------------ 38| 120| const word carry = bigint_add2(mutable_data(), size() - 1, y, y_words); 39| 120| mutable_data()[size() - 1] += carry; 40| 26.7k| } else { 41| 26.7k| const int32_t relative_size = bigint_cmp(_data(), x_sw, y, y_words); 42| | 43| 26.7k| if(relative_size >= 0) { ------------------ | Branch (43:10): [True: 26.5k, False: 196] ------------------ 44| | // *this >= y 45| 26.5k| bigint_sub2(mutable_data(), x_sw, y, y_words); 46| 26.5k| } else { 47| | // *this < y: compute *this = y - *this 48| 196| bigint_sub2_rev(mutable_data(), y, y_words); 49| 196| } 50| | 51| 26.7k| if(relative_size < 0) { ------------------ | Branch (51:10): [True: 196, False: 26.5k] ------------------ 52| 196| set_sign(y_sign); 53| 26.5k| } else if(relative_size == 0) { ------------------ | Branch (53:17): [True: 0, False: 26.5k] ------------------ 54| 0| set_sign(Positive); 55| 0| } 56| 26.7k| } 57| | 58| 26.9k| return (*this); 59| 26.9k|} _ZN5Botan6BigInt7mod_addERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 61| 243|BigInt& BigInt::mod_add(const BigInt& s, const BigInt& mod, secure_vector& ws) { 62| 243| if(this->signum() < 0 || s.signum() < 0 || mod.signum() < 0) { ------------------ | Branch (62:7): [True: 0, False: 243] | Branch (62:29): [True: 0, False: 243] | Branch (62:47): [True: 0, False: 243] ------------------ 63| 0| throw Invalid_Argument("BigInt::mod_add expects all arguments are positive"); 64| 0| } 65| | 66| 243| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 130| 243| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 243| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 243] | | ------------------ ------------------ 67| 243| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 130| 243| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 243| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 243] | | ------------------ ------------------ 68| | 69| | /* 70| | t + s or t + s - p == t - (p - s) 71| | 72| | So first compute ws = p - s 73| | 74| | Then compute t + s and t - ws 75| | 76| | If t - ws does not borrow, then that is the correct valued 77| | */ 78| | 79| 243| const size_t mod_sw = mod.sig_words(); 80| 243| BOTAN_ARG_CHECK(mod_sw > 0, "BigInt::mod_add modulus must be positive"); ------------------ | | 35| 243| do { \ | | 36| 243| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 243| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 243] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 243| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 243] | | ------------------ ------------------ 81| | 82| 243| this->grow_to(mod_sw); 83| 243| s.grow_to(mod_sw); 84| | 85| | // First mod_sw for p - s, 2*mod_sw for bigint_addsub workspace 86| 243| if(ws.size() < 3 * mod_sw) { ------------------ | Branch (86:7): [True: 192, False: 51] ------------------ 87| 192| ws.resize(3 * mod_sw); 88| 192| } 89| | 90| | // NOLINTBEGIN(readability-container-data-pointer) 91| | 92| 243| word borrow = bigint_sub3(&ws[0], mod._data(), mod_sw, s._data(), mod_sw); 93| 243| BOTAN_DEBUG_ASSERT(borrow == 0); ------------------ | | 130| 243| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 243| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 243] | | ------------------ ------------------ 94| 243| BOTAN_UNUSED(borrow); ------------------ | | 144| 243|#define BOTAN_UNUSED Botan::ignore_params ------------------ 95| | 96| | // Compute t - ws 97| 243| borrow = bigint_sub3(&ws[mod_sw], this->_data(), mod_sw, &ws[0], mod_sw); 98| | 99| | // Compute t + s 100| 243| bigint_add3(&ws[mod_sw * 2], this->_data(), mod_sw, s._data(), mod_sw); 101| | 102| 243| CT::conditional_copy_mem(borrow, &ws[0], &ws[mod_sw * 2], &ws[mod_sw], mod_sw); 103| 243| set_words(&ws[0], mod_sw); 104| | 105| | // NOLINTEND(readability-container-data-pointer) 106| | 107| 243| return (*this); 108| 243|} _ZN5Botan6BigInt7mod_subERKS0_S2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 110| 3.48k|BigInt& BigInt::mod_sub(const BigInt& s, const BigInt& mod, secure_vector& ws) { 111| 3.48k| if(this->signum() < 0 || s.signum() < 0 || mod.signum() < 0) { ------------------ | Branch (111:7): [True: 0, False: 3.48k] | Branch (111:29): [True: 0, False: 3.48k] | Branch (111:47): [True: 0, False: 3.48k] ------------------ 112| 0| throw Invalid_Argument("BigInt::mod_sub expects all arguments are positive"); 113| 0| } 114| | 115| | // We are assuming in this function that *this and s are no more than mod_sw words long 116| 3.48k| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 130| 3.48k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 3.48k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 3.48k] | | ------------------ ------------------ 117| 3.48k| BOTAN_DEBUG_ASSERT(s < mod); ------------------ | | 130| 3.48k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 3.48k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 3.48k] | | ------------------ ------------------ 118| | 119| 3.48k| const size_t mod_sw = mod.sig_words(); 120| | 121| 3.48k| this->grow_to(mod_sw); 122| 3.48k| s.grow_to(mod_sw); 123| | 124| 3.48k| if(ws.size() < mod_sw) { ------------------ | Branch (124:7): [True: 0, False: 3.48k] ------------------ 125| 0| ws.resize(mod_sw); 126| 0| } 127| | 128| 3.48k| const word borrow = bigint_sub3(ws.data(), mutable_data(), mod_sw, s._data(), mod_sw); 129| | 130| | // Conditionally add back the modulus 131| 3.48k| bigint_cnd_add(borrow, ws.data(), mod._data(), mod_sw); 132| | 133| 3.48k| unchecked_copy_memory(mutable_data(), ws.data(), mod_sw); 134| | 135| 3.48k| return (*this); 136| 3.48k|} _ZN5Botan6BigInt7mod_mulEhRKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 138| 972|BigInt& BigInt::mod_mul(uint8_t y, const BigInt& mod, secure_vector& ws) { 139| 972| BOTAN_ARG_CHECK(this->signum() >= 0, "*this must be positive"); ------------------ | | 35| 972| do { \ | | 36| 972| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 972| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 972] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 972| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 972] | | ------------------ ------------------ 140| 972| BOTAN_ARG_CHECK(y < 16, "y too large"); ------------------ | | 35| 972| do { \ | | 36| 972| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 972| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 972] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 972| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 972] | | ------------------ ------------------ 141| | 142| 972| BOTAN_DEBUG_ASSERT(*this < mod); ------------------ | | 130| 972| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 972| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 972] | | ------------------ ------------------ 143| | 144| 972| *this *= static_cast(y); 145| 972| this->reduce_below(mod, ws); 146| 972| return (*this); 147| 972|} _ZN5Botan6BigIntmLEm: 205| 972|BigInt& BigInt::operator*=(word y) { 206| 972| if(y == 0) { ------------------ | Branch (206:7): [True: 0, False: 972] ------------------ 207| 0| clear(); 208| 0| set_sign(Positive); 209| 0| } 210| | 211| 972| const word carry = bigint_linmul2(mutable_data(), size(), y); 212| 972| set_word_at(size(), carry); 213| | 214| 972| return (*this); 215| 972|} _ZN5Botan6BigIntrMERKS0_: 232| 363|BigInt& BigInt::operator%=(const BigInt& mod) { 233| 363| return (*this = (*this) % mod); 234| 363|} _ZN5Botan6BigIntlSEm: 269| 671|BigInt& BigInt::operator<<=(size_t shift) { 270| 671| if(shift >= 65536) { ------------------ | Branch (270:7): [True: 0, False: 671] ------------------ 271| 0| throw Invalid_Argument("BigInt left shift count too large"); 272| 0| } 273| | 274| 671| const size_t sw = sig_words(); 275| 671| const size_t new_size = sw + (shift + WordInfo::bits - 1) / WordInfo::bits; 276| | 277| 671| m_data.grow_to(new_size); 278| | 279| 671| bigint_shl1(m_data.mutable_data(), new_size, sw, shift); 280| | 281| 671| return (*this); 282| 671|} _ZN5Botan6BigIntrSEm: 287| 280k|BigInt& BigInt::operator>>=(size_t shift) { 288| 280k| bigint_shr1(m_data.mutable_data(), m_data.size(), shift); 289| | 290| 280k| if(sig_words() == 0 && m_signedness == Negative) { ------------------ | Branch (290:7): [True: 38, False: 280k] | Branch (290:27): [True: 0, False: 38] ------------------ 291| 0| m_signedness = Positive; 292| 0| } 293| | 294| 280k| return (*this); 295| 280k|} _ZN5Botan6BigInt4add2ERKS0_PKmmNS0_4SignE: 20| 260k|BigInt BigInt::add2(const BigInt& x, const word y[], size_t y_size, BigInt::Sign y_sign) { 21| 260k| const size_t x_sw = x.sig_words(); 22| | 23| 260k| BigInt z = BigInt::with_capacity(std::max(x_sw, y_size) + 1); 24| | 25| 260k| if(x.sign() == y_sign) { ------------------ | Branch (25:7): [True: 255k, False: 5.49k] ------------------ 26| 255k| const word carry = bigint_add3(z.mutable_data(), x._data(), x_sw, y, y_size); 27| 255k| z.mutable_data()[std::max(x_sw, y_size)] += carry; 28| 255k| z.set_sign(x.sign()); 29| 255k| } else { 30| 5.49k| const int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_size); 31| | 32| 5.49k| if(relative_size < 0) { ------------------ | Branch (32:10): [True: 0, False: 5.49k] ------------------ 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| 5.49k| } else if(relative_size == 0) { ------------------ | Branch (37:17): [True: 0, False: 5.49k] ------------------ 38| | // Positive zero (nothing to do in this case) 39| 5.49k| } 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| 5.49k| y_size = std::min(x_sw, y_size); 46| 5.49k| bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_size); 47| 5.49k| z.set_sign(x.sign()); 48| 5.49k| } 49| 5.49k| } 50| | 51| 260k| return z; 52| 260k|} _ZN5BotanmlERKNS_6BigIntES2_: 57| 100|BigInt operator*(const BigInt& x, const BigInt& y) { 58| 100| const size_t x_sw = x.sig_words(); 59| 100| const size_t y_sw = y.sig_words(); 60| | 61| 100| BigInt z = BigInt::with_capacity(x.size() + y.size()); 62| | 63| 100| if(x_sw == 1 && y_sw > 0) { ------------------ | Branch (63:7): [True: 0, False: 100] | Branch (63:20): [True: 0, False: 0] ------------------ 64| 0| bigint_linmul3(z.mutable_data(), y._data(), y_sw, x.word_at(0)); 65| 100| } else if(y_sw == 1 && x_sw > 0) { ------------------ | Branch (65:14): [True: 0, False: 100] | Branch (65:27): [True: 0, False: 0] ------------------ 66| 0| bigint_linmul3(z.mutable_data(), x._data(), x_sw, y.word_at(0)); 67| 100| } else if(x_sw > 0 && y_sw > 0) { ------------------ | Branch (67:14): [True: 100, False: 0] | Branch (67:26): [True: 100, False: 0] ------------------ 68| 100| secure_vector workspace(z.size()); 69| | 70| 100| bigint_mul(z.mutable_data(), 71| 100| z.size(), 72| 100| x._data(), 73| 100| x.size(), 74| 100| x_sw, 75| 100| y._data(), 76| 100| y.size(), 77| 100| y_sw, 78| 100| workspace.data(), 79| 100| workspace.size()); 80| 100| } 81| | 82| 100| z.cond_flip_sign(x_sw > 0 && y_sw > 0 && x.sign() != y.sign()); ------------------ | Branch (82:21): [True: 100, False: 0] | Branch (82:33): [True: 100, False: 0] | Branch (82:45): [True: 0, False: 100] ------------------ 83| | 84| 100| return z; 85| 100|} _ZN5BotanmlERKNS_6BigIntEm: 90| 26.3k|BigInt operator*(const BigInt& x, word y) { 91| 26.3k| const size_t x_sw = x.sig_words(); 92| | 93| 26.3k| BigInt z = BigInt::with_capacity(x_sw + 1); 94| | 95| 26.3k| if(x_sw > 0 && y > 0) { ------------------ | Branch (95:7): [True: 26.3k, False: 0] | Branch (95:19): [True: 26.3k, False: 0] ------------------ 96| 26.3k| bigint_linmul3(z.mutable_data(), x._data(), x_sw, y); 97| 26.3k| z.set_sign(x.sign()); 98| 26.3k| } 99| | 100| 26.3k| return z; 101| 26.3k|} _ZN5BotandvERKNS_6BigIntES2_: 106| 90|BigInt operator/(const BigInt& x, const BigInt& y) { 107| 90| if(y.sig_words() == 1 && y.signum() >= 0) { ------------------ | Branch (107:7): [True: 0, False: 90] | Branch (107:29): [True: 0, False: 0] ------------------ 108| 0| return x / y.word_at(0); 109| 0| } 110| | 111| 90| BigInt q; 112| 90| BigInt r; 113| 90| vartime_divide(x, y, q, r); 114| 90| return q; 115| 90|} _ZN5BotandvERKNS_6BigIntEm: 120| 49|BigInt operator/(const BigInt& x, word y) { 121| 49| if(y == 0) { ------------------ | Branch (121:7): [True: 0, False: 49] ------------------ 122| 0| throw Invalid_Argument("BigInt::operator/ divide by zero"); 123| 0| } 124| | 125| 49| BigInt q; 126| 49| word r = 0; 127| 49| ct_divide_word(x, y, q, r); 128| 49| return q; 129| 49|} _ZN5BotanrmERKNS_6BigIntES2_: 134| 363|BigInt operator%(const BigInt& n, const BigInt& mod) { 135| 363| if(mod.is_zero()) { ------------------ | Branch (135:7): [True: 0, False: 363] ------------------ 136| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 137| 0| } 138| 363| if(mod.signum() < 0) { ------------------ | Branch (138:7): [True: 0, False: 363] ------------------ 139| 0| throw Invalid_Argument("BigInt::operator% modulus must be > 0"); 140| 0| } 141| 363| if(n.signum() >= 0 && mod.signum() >= 0 && n < mod) { ------------------ | Branch (141:7): [True: 297, False: 66] | Branch (141:26): [True: 297, False: 0] | Branch (141:47): [True: 0, False: 297] ------------------ 142| 0| return n; 143| 0| } 144| | 145| 363| if(mod.sig_words() == 1) { ------------------ | Branch (145:7): [True: 231, False: 132] ------------------ 146| 231| return BigInt::from_word(n % mod.word_at(0)); 147| 231| } 148| | 149| 132| BigInt q; 150| 132| BigInt r; 151| 132| vartime_divide(n, mod, q, r); 152| 132| return r; 153| 363|} _ZN5BotanrmERKNS_6BigIntEm: 158| 404|word operator%(const BigInt& n, word mod) { 159| 404| if(mod == 0) { ------------------ | Branch (159:7): [True: 0, False: 404] ------------------ 160| 0| throw Invalid_Argument("BigInt::operator% divide by zero"); 161| 0| } 162| | 163| 404| if(mod == 1) { ------------------ | Branch (163:7): [True: 0, False: 404] ------------------ 164| 0| return 0; 165| 0| } 166| | 167| 404| word remainder = 0; 168| | 169| 404| if(n.signum() >= 0 && is_power_of_2(mod)) { ------------------ | Branch (169:7): [True: 404, False: 0] | Branch (169:26): [True: 173, False: 231] ------------------ 170| 173| remainder = (n.word_at(0) & (mod - 1)); 171| 231| } else { 172| 231| const divide_precomp redc_mod(mod); 173| 231| const size_t sw = n.sig_words(); 174| 5.76k| for(size_t i = sw; i > 0; --i) { ------------------ | Branch (174:26): [True: 5.53k, False: 231] ------------------ 175| 5.53k| remainder = redc_mod.vartime_mod_2to1(remainder, n.word_at(i - 1)); 176| 5.53k| } 177| 231| } 178| | 179| 404| if(remainder != 0 && n.sign() == BigInt::Negative) { ------------------ | Branch (179:7): [True: 404, False: 0] | Branch (179:25): [True: 0, False: 404] ------------------ 180| 0| return mod - remainder; 181| 0| } 182| 404| return remainder; 183| 404|} _ZN5BotanlsERKNS_6BigIntEm: 188| 910|BigInt operator<<(const BigInt& x, size_t shift) { 189| 910| if(shift >= 65536) { ------------------ | Branch (189:7): [True: 0, False: 910] ------------------ 190| 0| throw Invalid_Argument("BigInt left shift count too large"); 191| 0| } 192| | 193| 910| if(x.is_zero()) { ------------------ | Branch (193:7): [True: 0, False: 910] ------------------ 194| 0| return BigInt::zero(); 195| 0| } 196| | 197| 910| const size_t x_sw = x.sig_words(); 198| | 199| 910| const size_t new_size = x_sw + shift / WordInfo::bits + 1; 200| 910| BigInt y = BigInt::with_capacity(new_size); 201| 910| bigint_shl2(y.mutable_data(), new_size, x._data(), x_sw, shift); 202| 910| y.set_sign(x.sign()); 203| 910| return y; 204| 910|} _ZN5BotanrsERKNS_6BigIntEm: 209| 2.64k|BigInt operator>>(const BigInt& x, size_t shift) { 210| 2.64k| const size_t shift_words = shift / WordInfo::bits; 211| 2.64k| const size_t x_sw = x.sig_words(); 212| | 213| 2.64k| if(shift_words >= x_sw) { ------------------ | Branch (213:7): [True: 0, False: 2.64k] ------------------ 214| 0| return BigInt::zero(); 215| 0| } 216| | 217| 2.64k| const size_t new_size = x_sw - shift_words; 218| 2.64k| BigInt y = BigInt::with_capacity(new_size); 219| 2.64k| bigint_shr2(y.mutable_data(), new_size, x._data(), x_sw, shift); 220| | 221| 2.64k| if(x.signum() < 0 && y.is_zero()) { ------------------ | Branch (221:7): [True: 0, False: 2.64k] | Branch (221:25): [True: 0, False: 0] ------------------ 222| 0| y.set_sign(BigInt::Positive); 223| 2.64k| } else { 224| 2.64k| y.set_sign(x.sign()); 225| 2.64k| } 226| | 227| 2.64k| return y; 228| 2.64k|} _ZN5Botan6BigInt9randomizeERNS_21RandomNumberGeneratorEmb: 19| 4.05k|void BigInt::randomize(RandomNumberGenerator& rng, size_t bitsize, bool set_high_bit) { 20| 4.05k| set_sign(Positive); 21| | 22| 4.05k| if(bitsize == 0) { ------------------ | Branch (22:7): [True: 0, False: 4.05k] ------------------ 23| 0| clear(); 24| 4.05k| } else { 25| 4.05k| secure_vector array = rng.random_vec(round_up(bitsize, 8) / 8); 26| | 27| | // Always cut unwanted bits 28| 4.05k| if(bitsize % 8 > 0) { ------------------ | Branch (28:10): [True: 1.64k, False: 2.41k] ------------------ 29| 1.64k| array[0] &= 0xFF >> (8 - (bitsize % 8)); 30| 1.64k| } 31| | 32| | // Set the highest bit if wanted 33| 4.05k| if(set_high_bit) { ------------------ | Branch (33:10): [True: 76, False: 3.97k] ------------------ 34| 76| array[0] |= 0x80 >> ((bitsize % 8) > 0 ? (8 - bitsize % 8) : 0); ------------------ | Branch (34:31): [True: 37, False: 39] ------------------ 35| 76| } 36| | 37| 4.05k| assign_from_bytes(array); 38| 4.05k| } 39| 4.05k|} _ZN5Botan6BigInt14random_integerERNS_21RandomNumberGeneratorERKS0_S4_: 44| 5.28k|BigInt BigInt::random_integer(RandomNumberGenerator& rng, const BigInt& min, const BigInt& max) { 45| 5.28k| if(min.signum() < 0 || max.signum() < 0 || max <= min) { ------------------ | Branch (45:7): [True: 0, False: 5.28k] | Branch (45:27): [True: 0, False: 5.28k] | Branch (45:47): [True: 0, False: 5.28k] ------------------ 46| 0| throw Invalid_Argument("BigInt::random_integer invalid range"); 47| 0| } 48| | 49| | /* 50| | If min is > 1 then we generate a random number `r` in [0,max-min) 51| | and return min + r. 52| | 53| | This same logic could also be reasonably chosen for min == 1, but 54| | that breaks certain tests which expect stability of this function 55| | when generating within [1,n) 56| | */ 57| 5.28k| if(min > 1) { ------------------ | Branch (57:7): [True: 2.64k, False: 2.64k] ------------------ 58| 2.64k| const BigInt diff = max - min; 59| | // This call is recursive, but will not recurse further 60| 2.64k| return min + BigInt::random_integer(rng, BigInt::zero(), diff); 61| 2.64k| } 62| | 63| 2.64k| BOTAN_DEBUG_ASSERT(min <= 1); ------------------ | | 130| 2.64k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 2.64k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 2.64k] | | ------------------ ------------------ 64| | 65| 2.64k| const size_t bits = max.bits(); 66| | 67| 3.97k| for(;;) { 68| 3.97k| BigInt r; 69| 3.97k| r.randomize(rng, bits, false); 70| 3.97k| if(r >= min && r < max) { ------------------ | Branch (70:10): [True: 3.97k, False: 0] | Branch (70:22): [True: 2.64k, False: 1.33k] ------------------ 71| 2.64k| return r; 72| 2.64k| } 73| 3.97k| } 74| 2.64k|} _ZN5Botan6BigIntC2Em: 20| 82|BigInt::BigInt(uint64_t n) { 21| 82| if constexpr(sizeof(word) == 8) { 22| 82| m_data.set_word_at(0, static_cast(n)); 23| | } else { 24| | m_data.set_word_at(1, static_cast(n >> 32)); 25| | m_data.set_word_at(0, static_cast(n)); 26| | } 27| 82|} _ZN5Botan6BigInt8from_u64Em: 30| 76|BigInt BigInt::from_u64(uint64_t n) { 31| 76| return BigInt(n); 32| 76|} _ZN5Botan6BigInt9from_wordEm: 35| 6.63k|BigInt BigInt::from_word(word n) { 36| 6.63k| BigInt bn; 37| 6.63k| bn.set_word_at(0, n); 38| 6.63k| return bn; 39| 6.63k|} _ZN5Botan6BigInt13with_capacityEm: 51| 293k|BigInt BigInt::with_capacity(size_t size) { 52| 293k| BigInt bn; 53| 293k| bn.grow_to(size); 54| 293k| return bn; 55| 293k|} _ZN5Botan6BigInt11from_stringENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 57| 128|BigInt BigInt::from_string(std::string_view str) { 58| 128| size_t prefix_bytes = 0; 59| 128| bool negative = false; 60| 128| size_t radix = 10; 61| | 62| 128| if(!str.empty() && str[0] == '-') { ------------------ | Branch (62:7): [True: 128, False: 0] | Branch (62:23): [True: 0, False: 128] ------------------ 63| 0| prefix_bytes += 1; 64| 0| negative = true; 65| 0| } 66| | 67| 128| if(str.length() > prefix_bytes + 2 && str[prefix_bytes] == '0' && str[prefix_bytes + 1] == 'x') { ------------------ | Branch (67:7): [True: 128, False: 0] | Branch (67:42): [True: 128, False: 0] | Branch (67:70): [True: 128, False: 0] ------------------ 68| 128| prefix_bytes += 2; 69| 128| radix = 16; 70| 128| } 71| | 72| 128| BigInt r = BigInt::from_radix_digits(str.substr(prefix_bytes), radix); 73| | 74| 128| if(negative) { ------------------ | Branch (74:7): [True: 0, False: 128] ------------------ 75| 0| r.set_sign(Negative); 76| 128| } else { 77| 128| r.set_sign(Positive); 78| 128| } 79| | 80| 128| return r; 81| 128|} _ZN5Botan6BigInt10from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 83| 794|BigInt BigInt::from_bytes(std::span input) { 84| 794| BigInt r; 85| 794| r.assign_from_bytes(input); 86| 794| return r; 87| 794|} _ZN5Botan6BigIntC2ERNS_21RandomNumberGeneratorEmb: 114| 76|BigInt::BigInt(RandomNumberGenerator& rng, size_t bits, bool set_high_bit) { 115| 76| randomize(rng, bits, set_high_bit); 116| 76|} _ZNK5Botan6BigInt7byte_atEm: 118| 11.8k|uint8_t BigInt::byte_at(size_t n) const { 119| 11.8k| return get_byte_var(sizeof(word) - (n % sizeof(word)) - 1, word_at(n / sizeof(word))); 120| 11.8k|} _ZNK5Botan6BigInt8cmp_wordEm: 122| 351k|int32_t BigInt::cmp_word(word other) const { 123| 351k| if(signum() < 0) { ------------------ | Branch (123:7): [True: 132, False: 351k] ------------------ 124| 132| return -1; // other is positive ... 125| 132| } 126| | 127| 351k| const size_t sw = this->sig_words(); 128| 351k| if(sw > 1) { ------------------ | Branch (128:7): [True: 344k, False: 7.29k] ------------------ 129| 344k| return 1; // must be larger since other is just one word ... 130| 344k| } 131| | 132| 7.29k| return bigint_cmp(this->_data(), sw, &other, 1); 133| 351k|} _ZNK5Botan6BigInt3cmpERKS0_b: 138| 10.3k|int32_t BigInt::cmp(const BigInt& other, bool check_signs) const { 139| 10.3k| if(check_signs) { ------------------ | Branch (139:7): [True: 10.3k, False: 0] ------------------ 140| 10.3k| if(other.signum() >= 0 && this->signum() < 0) { ------------------ | Branch (140:10): [True: 10.3k, False: 0] | Branch (140:33): [True: 0, False: 10.3k] ------------------ 141| 0| return -1; 142| 0| } 143| | 144| 10.3k| if(other.signum() < 0 && this->signum() >= 0) { ------------------ | Branch (144:10): [True: 0, False: 10.3k] | Branch (144:32): [True: 0, False: 0] ------------------ 145| 0| return 1; 146| 0| } 147| | 148| 10.3k| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (148:10): [True: 0, False: 10.3k] | Branch (148:32): [True: 0, False: 0] ------------------ 149| 0| return (-bigint_cmp(this->_data(), this->size(), other._data(), other.size())); 150| 0| } 151| 10.3k| } 152| | 153| 10.3k| return bigint_cmp(this->_data(), this->size(), other._data(), other.size()); 154| 10.3k|} _ZNK5Botan6BigInt8is_equalERKS0_: 156| 332k|bool BigInt::is_equal(const BigInt& other) const { 157| 332k| if(this->sign() != other.sign()) { ------------------ | Branch (157:7): [True: 0, False: 332k] ------------------ 158| 0| return false; 159| 0| } 160| | 161| 332k| return bigint_ct_is_eq(this->_data(), this->size(), other._data(), other.size()).as_bool(); 162| 332k|} _ZNK5Botan6BigInt12is_less_thanERKS0_: 164| 14.3k|bool BigInt::is_less_than(const BigInt& other) const { 165| 14.3k| if(this->signum() < 0 && other.signum() >= 0) { ------------------ | Branch (165:7): [True: 0, False: 14.3k] | Branch (165:29): [True: 0, False: 0] ------------------ 166| 0| return true; 167| 0| } 168| | 169| 14.3k| if(this->signum() >= 0 && other.signum() < 0) { ------------------ | Branch (169:7): [True: 14.3k, False: 0] | Branch (169:30): [True: 0, False: 14.3k] ------------------ 170| 0| return false; 171| 0| } 172| | 173| 14.3k| if(other.signum() < 0 && this->signum() < 0) { ------------------ | Branch (173:7): [True: 0, False: 14.3k] | Branch (173:29): [True: 0, False: 0] ------------------ 174| 0| return bigint_ct_is_lt(other._data(), other.size(), this->_data(), this->size()).as_bool(); 175| 0| } 176| | 177| 14.3k| return bigint_ct_is_lt(this->_data(), this->size(), other._data(), other.size()).as_bool(); 178| 14.3k|} _ZNK5Botan6BigInt12encode_wordsEPmm: 180| 1.13k|void BigInt::encode_words(word out[], size_t size) const { 181| 1.13k| const size_t words = sig_words(); 182| | 183| 1.13k| if(words > size) { ------------------ | Branch (183:7): [True: 0, False: 1.13k] ------------------ 184| 0| throw Encoding_Error("BigInt::encode_words value too large to encode"); 185| 0| } 186| | 187| 1.13k| clear_mem(out, size); 188| 1.13k| copy_mem(out, _data(), words); 189| 1.13k|} _ZN5Botan6BigInt4Data11set_to_zeroEv: 191| 11.7k|void BigInt::Data::set_to_zero() { 192| 11.7k| m_reg.resize(m_reg.capacity()); 193| 11.7k| clear_mem(m_reg.data(), m_reg.size()); 194| 11.7k| m_sig_words = 0; 195| 11.7k|} _ZNK5Botan6BigInt4Data14calc_sig_wordsEv: 215| 1.89M|size_t BigInt::Data::calc_sig_words() const { 216| 1.89M| const size_t sz = m_reg.size(); 217| 1.89M| size_t sig = sz; 218| | 219| 1.89M| word sub = 1; 220| | 221| 135M| for(size_t i = 0; i != sz; ++i) { ------------------ | Branch (221:22): [True: 133M, False: 1.89M] ------------------ 222| 133M| const word w = m_reg[sz - i - 1]; 223| 133M| sub &= ct_is_zero(w); 224| 133M| sig -= sub; 225| 133M| } 226| | 227| | /* 228| | * This depends on the data so is poisoned, but unpoison it here as 229| | * later conditionals are made on the size. 230| | */ 231| 1.89M| CT::unpoison(sig); 232| | 233| 1.89M| return sig; 234| 1.89M|} _ZNK5Botan6BigInt13get_substringEmm: 239| 1.52M|uint32_t BigInt::get_substring(size_t offset, size_t length) const { 240| 1.52M| if(length == 0 || length > 32) { ------------------ | Branch (240:7): [True: 0, False: 1.52M] | Branch (240:22): [True: 0, False: 1.52M] ------------------ 241| 0| throw Invalid_Argument("BigInt::get_substring invalid substring length"); 242| 0| } 243| | 244| 1.52M| const uint32_t mask = 0xFFFFFFFF >> (32 - length); 245| | 246| 1.52M| const size_t word_offset = offset / WordInfo::bits; 247| 1.52M| const size_t wshift = (offset % WordInfo::bits); 248| | 249| | /* 250| | * The substring is contained within one or at most two words. The 251| | * offset and length are not secret, so we can perform conditional 252| | * operations on those values. 253| | */ 254| 1.52M| const word w0 = word_at(word_offset); 255| | 256| 1.52M| if(wshift == 0 || (offset + length) / WordInfo::bits == word_offset) { ------------------ | Branch (256:7): [True: 99.1k, False: 1.42M] | Branch (256:22): [True: 1.32M, False: 93.8k] ------------------ 257| 1.42M| return static_cast(w0 >> wshift) & mask; 258| 1.42M| } else { 259| 93.8k| const word w1 = word_at(word_offset + 1); 260| 93.8k| return static_cast((w0 >> wshift) | (w1 << (WordInfo::bits - wshift))) & mask; 261| 93.8k| } 262| 1.52M|} _ZNK5Botan6BigInt5bytesEv: 294| 3.99k|size_t BigInt::bytes() const { 295| 3.99k| return round_up(bits(), 8) / 8; 296| 3.99k|} _ZNK5Botan6BigInt13top_bits_freeEv: 298| 21.2k|size_t BigInt::top_bits_free() const { 299| 21.2k| const size_t words = sig_words(); 300| | 301| 21.2k| const word top_word = word_at(words - 1); 302| 21.2k| const size_t bits_used = high_bit(CT::value_barrier(top_word)); 303| 21.2k| CT::unpoison(bits_used); 304| 21.2k| return WordInfo::bits - bits_used; 305| 21.2k|} _ZNK5Botan6BigInt4bitsEv: 307| 20.9k|size_t BigInt::bits() const { 308| 20.9k| const size_t words = sig_words(); 309| | 310| 20.9k| if(words == 0) { ------------------ | Branch (310:7): [True: 582, False: 20.3k] ------------------ 311| 582| return 0; 312| 582| } 313| | 314| 20.3k| const size_t full_words = (words - 1) * WordInfo::bits; 315| 20.3k| const size_t top_bits = WordInfo::bits - top_bits_free(); 316| | 317| 20.3k| return full_words + top_bits; 318| 20.9k|} _ZN5Botan6BigInt12reduce_belowERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 329| 1.88k|size_t BigInt::reduce_below(const BigInt& p, secure_vector& ws) { 330| 1.88k| if(p.signum() < 0 || this->signum() < 0) { ------------------ | Branch (330:7): [True: 0, False: 1.88k] | Branch (330:25): [True: 0, False: 1.88k] ------------------ 331| 0| throw Invalid_Argument("BigInt::reduce_below both values must be positive"); 332| 0| } 333| | 334| 1.88k| const size_t p_words = p.sig_words(); 335| | 336| 1.88k| if(size() < p_words + 1) { ------------------ | Branch (336:7): [True: 66, False: 1.81k] ------------------ 337| 66| grow_to(p_words + 1); 338| 66| } 339| | 340| 1.88k| if(ws.size() < p_words + 1) { ------------------ | Branch (340:7): [True: 910, False: 972] ------------------ 341| 910| ws.resize(p_words + 1); 342| 910| } 343| | 344| 1.88k| clear_mem(ws.data(), ws.size()); 345| | 346| 1.88k| size_t reductions = 0; 347| | 348| 3.53k| for(;;) { 349| 3.53k| const word borrow = bigint_sub3(ws.data(), _data(), p_words + 1, p._data(), p_words); 350| 3.53k| if(borrow > 0) { ------------------ | Branch (350:10): [True: 1.88k, False: 1.65k] ------------------ 351| 1.88k| break; 352| 1.88k| } 353| | 354| 1.65k| ++reductions; 355| 1.65k| swap_reg(ws); 356| 1.65k| } 357| | 358| 1.88k| return reductions; 359| 1.88k|} _ZNK5Botan6BigInt3absEv: 386| 66|BigInt BigInt::abs() const { 387| 66| BigInt x = (*this); 388| 66| x.set_sign(Positive); 389| 66| return x; 390| 66|} _ZNK5Botan6BigInt12serialize_toENSt3__14spanIhLm18446744073709551615EEE: 395| 1.87k|void BigInt::serialize_to(std::span output) const { 396| 1.87k| BOTAN_ARG_CHECK(this->bytes() <= output.size(), "Insufficient output space"); ------------------ | | 35| 1.87k| do { \ | | 36| 1.87k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.87k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.87k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.87k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.87k] | | ------------------ ------------------ 397| | 398| 1.87k| this->binary_encode(output.data(), output.size()); 399| 1.87k|} _ZNK5Botan6BigInt13binary_encodeEPhm: 404| 1.87k|void BigInt::binary_encode(uint8_t output[], size_t len) const { 405| 1.87k| const size_t full_words = len / sizeof(word); 406| 1.87k| const size_t extra_bytes = len % sizeof(word); 407| | 408| 17.3k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (408:22): [True: 15.5k, False: 1.87k] ------------------ 409| 15.5k| const word w = word_at(i); 410| 15.5k| store_be(w, output + (len - (i + 1) * sizeof(word))); 411| 15.5k| } 412| | 413| 1.87k| if(extra_bytes > 0) { ------------------ | Branch (413:7): [True: 512, False: 1.35k] ------------------ 414| 512| const word w = word_at(full_words); 415| | 416| 1.13k| for(size_t i = 0; i != extra_bytes; ++i) { ------------------ | Branch (416:25): [True: 626, False: 512] ------------------ 417| 626| output[extra_bytes - i - 1] = get_byte_var(sizeof(word) - i - 1, w); 418| 626| } 419| 512| } 420| 1.87k|} _ZN5Botan6BigInt17assign_from_bytesENSt3__14spanIKhLm18446744073709551615EEE: 425| 11.7k|void BigInt::assign_from_bytes(std::span bytes) { 426| 11.7k| clear(); 427| | 428| 11.7k| const size_t length = bytes.size(); 429| 11.7k| const size_t full_words = length / sizeof(word); 430| 11.7k| const size_t extra_bytes = length % sizeof(word); 431| | 432| 11.7k| secure_vector reg((round_up(full_words + (extra_bytes > 0 ? 1 : 0), 8))); ------------------ | Branch (432:52): [True: 8.28k, False: 3.44k] ------------------ 433| | 434| 203k| for(size_t i = 0; i != full_words; ++i) { ------------------ | Branch (434:22): [True: 192k, False: 11.7k] ------------------ 435| 192k| reg[i] = load_be(bytes.last()); 436| 192k| bytes = bytes.first(bytes.size() - sizeof(word)); 437| 192k| } 438| | 439| 11.7k| if(!bytes.empty()) { ------------------ | Branch (439:7): [True: 8.28k, False: 3.44k] ------------------ 440| 8.28k| BOTAN_ASSERT_NOMSG(extra_bytes == bytes.size()); ------------------ | | 77| 8.28k| do { \ | | 78| 8.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 8.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 8.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 8.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 8.28k] | | ------------------ ------------------ 441| 8.28k| std::array last_partial_word = {0}; 442| 8.28k| copy_mem(std::span{last_partial_word}.last(extra_bytes), bytes); 443| 8.28k| reg[full_words] = load_be(last_partial_word); 444| 8.28k| } 445| | 446| 11.7k| m_data.swap(reg); 447| 11.7k|} _ZN5Botan6BigInt11ct_cond_addEbRKS0_: 449| 252k|void BigInt::ct_cond_add(bool predicate, const BigInt& value) { 450| 252k| if(this->signum() < 0 || value.signum() < 0) { ------------------ | Branch (450:7): [True: 0, False: 252k] | Branch (450:29): [True: 0, False: 252k] ------------------ 451| 0| throw Invalid_Argument("BigInt::ct_cond_add requires both values to be positive"); 452| 0| } 453| 252k| const size_t v_words = value.sig_words(); 454| | 455| | // The carry can propagate through every existing word of *this, so the 456| | // output needs one slot above whichever input is wider. 457| 252k| this->grow_to(std::max(this->size(), v_words) + 1); 458| | 459| 252k| const auto mask = CT::Mask::expand(static_cast(predicate)).value(); 460| | 461| 252k| word carry = 0; 462| | 463| 252k| word* x = this->mutable_data(); 464| 252k| const word* y = value._data(); 465| | 466| 9.20M| for(size_t i = 0; i != v_words; ++i) { ------------------ | Branch (466:22): [True: 8.95M, False: 252k] ------------------ 467| 8.95M| x[i] = word_add(x[i], y[i] & mask, &carry); 468| 8.95M| } 469| | 470| 11.3M| for(size_t i = v_words; i != size(); ++i) { ------------------ | Branch (470:28): [True: 11.0M, False: 252k] ------------------ 471| 11.0M| x[i] = word_add(x[i], static_cast(0), &carry); 472| 11.0M| } 473| 252k|} _ZN5Botan6BigInt14cond_flip_signEb: 521| 168k|void BigInt::cond_flip_sign(bool predicate) { 522| | // This code is assuming Negative == 0, Positive == 1 523| | 524| 168k| const auto mask = CT::Mask::expand_bool(predicate); 525| | 526| 168k| const uint8_t current_sign = static_cast(sign()); 527| | 528| 168k| const uint8_t new_sign = mask.select(current_sign ^ 1, current_sign); 529| | 530| 168k| set_sign(static_cast(new_sign)); 531| 168k|} _ZN5Botan6BigInt14ct_cond_assignEbRKS0_: 533| 168k|void BigInt::ct_cond_assign(bool predicate, const BigInt& other) { 534| 168k| const size_t t_words = size(); 535| 168k| const size_t o_words = other.size(); 536| | 537| 168k| if(t_words < o_words) { ------------------ | Branch (537:7): [True: 168k, False: 0] ------------------ 538| 168k| grow_to(o_words); 539| 168k| } 540| | 541| 168k| const size_t r_words = std::max(t_words, o_words); 542| | 543| 168k| const auto mask = CT::Mask::expand_bool(predicate); 544| | 545| 13.5M| for(size_t i = 0; i != r_words; ++i) { ------------------ | Branch (545:22): [True: 13.3M, False: 168k] ------------------ 546| 13.3M| const word o_word = other.word_at(i); 547| 13.3M| const word t_word = this->word_at(i); 548| 13.3M| this->set_word_at(i, mask.select(o_word, t_word)); 549| 13.3M| } 550| | 551| 168k| const auto same_sign = CT::Mask::is_equal(sign(), other.sign()).as_choice(); 552| 168k| cond_flip_sign((mask.as_choice() && !same_sign).as_bool()); 553| 168k|} _ZNK5Botan6BigInt20_const_time_unpoisonEv: 559| 1.42M|void BigInt::_const_time_unpoison() const { 560| 1.42M| CT::unpoison(m_data.const_data(), m_data.size()); 561| 1.42M|} _ZN5Botan15ct_divide_pow2kEmRKNS_6BigIntE: 89| 213|BigInt ct_divide_pow2k(size_t k, const BigInt& y) { 90| 213| BOTAN_ARG_CHECK(y.signum() != 0, "Cannot divide by zero"); ------------------ | | 35| 213| do { \ | | 36| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 213| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 213] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 213| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 213] | | ------------------ ------------------ 91| 213| BOTAN_ARG_CHECK(y.signum() >= 0, "Negative divisor not supported"); ------------------ | | 35| 213| do { \ | | 36| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 213| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 213] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 213| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 213] | | ------------------ ------------------ 92| 213| BOTAN_ARG_CHECK(k > 1, "Invalid k"); ------------------ | | 35| 213| do { \ | | 36| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 213| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 213] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 213| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 213] | | ------------------ ------------------ 93| | 94| 213| const size_t x_bits = k + 1; 95| 213| const size_t y_bits = y.bits(); 96| | 97| 213| if(x_bits < y_bits) { ------------------ | Branch (97:7): [True: 0, False: 213] ------------------ 98| 0| return BigInt::zero(); 99| 0| } 100| | 101| 213| BOTAN_ASSERT_NOMSG(y_bits >= 1); ------------------ | | 77| 213| do { \ | | 78| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 213| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 213] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 213| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 213] | | ------------------ ------------------ 102| 213| const size_t x_words = (x_bits + WordInfo::bits - 1) / WordInfo::bits; 103| 213| const size_t y_words = y.sig_words(); 104| | 105| 213| BigInt q = BigInt::with_capacity(x_words); 106| 213| BigInt r = BigInt::with_capacity(y_words + 1); 107| 213| BigInt t = BigInt::with_capacity(y_words + 1); // a temporary 108| | 109| 213| r.set_bit(y_bits - 1); 110| 632k| for(size_t i = y_bits - 1; i != x_bits; ++i) { ------------------ | Branch (110:31): [True: 632k, False: 213] ------------------ 111| 632k| const size_t b = x_bits - 1 - i; 112| | 113| 632k| if(i >= y_bits) { ------------------ | Branch (113:10): [True: 632k, False: 213] ------------------ 114| 632k| bigint_shl1(r.mutable_data(), r.size(), r.size(), 1); 115| 632k| } 116| | 117| 632k| const bool r_gte_y = bigint_sub3(t.mutable_data(), r._data(), r.size(), y._data(), y_words) == 0; 118| | 119| 632k| q.conditionally_set_bit(b, r_gte_y); 120| | 121| 632k| bigint_cnd_swap(static_cast(r_gte_y), r.mutable_data(), t.mutable_data(), y_words + 1); 122| 632k| } 123| | 124| | // No need for sign fixup 125| | 126| 213| return q; 127| 213|} _ZN5Botan14ct_divide_wordERKNS_6BigIntEmRS0_Rm: 129| 49|void ct_divide_word(const BigInt& x, word y, BigInt& q_out, word& r_out) { 130| 49| if(y == 0) { ------------------ | Branch (130:7): [True: 0, False: 49] ------------------ 131| 0| throw Invalid_Argument("ct_divide_word: cannot divide by zero"); 132| 0| } 133| | 134| 49| const size_t x_words = x.sig_words(); 135| 49| const size_t x_bits = x.bits(); 136| | 137| 49| BigInt q = BigInt::with_capacity(x_words); 138| 49| word r = 0; 139| | 140| 96.8k| for(size_t i = 0; i != x_bits; ++i) { ------------------ | Branch (140:22): [True: 96.8k, False: 49] ------------------ 141| 96.8k| const size_t b = x_bits - 1 - i; 142| 96.8k| const bool x_b = x.get_bit(b); 143| | 144| 96.8k| const auto r_carry = CT::Mask::expand_top_bit(r); 145| | 146| 96.8k| r <<= 1; 147| 96.8k| r += static_cast(x_b); 148| | 149| 96.8k| const auto r_gte_y = CT::Mask::is_gte(r, y) | r_carry; 150| 96.8k| q.conditionally_set_bit(b, r_gte_y.as_bool()); 151| 96.8k| r = r_gte_y.select(r - y, r); 152| 96.8k| } 153| | 154| 49| if(x.signum() < 0) { ------------------ | Branch (154:7): [True: 0, False: 49] ------------------ 155| 0| q.flip_sign(); 156| 0| if(r != 0) { ------------------ | Branch (156:10): [True: 0, False: 0] ------------------ 157| 0| --q; 158| 0| r = y - r; 159| 0| } 160| 0| } 161| | 162| 49| r_out = r; 163| 49| q_out = q; 164| 49|} _ZN5Botan20vartime_divide_pow2kEmRKNS_6BigIntE: 232| 688|BigInt vartime_divide_pow2k(size_t k, const BigInt& y_arg) { 233| 688| constexpr size_t WB = WordInfo::bits; 234| | 235| 688| BOTAN_ARG_CHECK(y_arg.signum() != 0, "Cannot divide by zero"); ------------------ | | 35| 688| do { \ | | 36| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 688| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 688] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 688| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 688] | | ------------------ ------------------ 236| 688| BOTAN_ARG_CHECK(y_arg.signum() >= 0, "Negative divisor not supported"); ------------------ | | 35| 688| do { \ | | 36| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 688| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 688] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 688| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 688] | | ------------------ ------------------ 237| 688| BOTAN_ARG_CHECK(k > 1, "Invalid k"); ------------------ | | 35| 688| do { \ | | 36| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 688| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 688] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 688| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 688] | | ------------------ ------------------ 238| | 239| 688| BigInt y = y_arg; 240| | 241| 688| const size_t y_words = y.sig_words(); 242| | 243| 688| BOTAN_ASSERT_NOMSG(y_words > 0); ------------------ | | 77| 688| do { \ | | 78| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 688| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 688] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 688| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 688] | | ------------------ ------------------ 244| | 245| | // Calculate shifts needed to normalize y with high bit set 246| 688| const size_t shifts = y.top_bits_free(); 247| | 248| 688| if(shifts > 0) { ------------------ | Branch (248:7): [True: 329, False: 359] ------------------ 249| 329| y <<= shifts; 250| 329| } 251| | 252| 688| BigInt r; 253| 688| r.set_bit(k + shifts); // (2^k) << shifts 254| | 255| | // we know y has not changed size, since we only shifted up to set high bit 256| 688| const size_t t = y_words - 1; 257| 688| const size_t n = std::max(y_words, r.sig_words()) - 1; 258| | 259| 688| BOTAN_ASSERT_NOMSG(n >= t); ------------------ | | 77| 688| do { \ | | 78| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 688| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 688] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 688| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 688] | | ------------------ ------------------ 260| | 261| 688| BigInt q = BigInt::zero(); 262| 688| q.grow_to(n - t + 1); 263| | 264| 688| word* q_words = q.mutable_data(); 265| | 266| 688| BigInt shifted_y = y << (WB * (n - t)); 267| | 268| | // Set q_{n-t} to number of times r > shifted_y 269| 688| secure_vector ws; 270| 688| q_words[n - t] = r.reduce_below(shifted_y, ws); 271| | 272| 688| const word y_t0 = y.word_at(t); 273| 688| const word y_t1 = y.word_at(t - 1); 274| 688| BOTAN_DEBUG_ASSERT((y_t0 >> (WB - 1)) == 1); ------------------ | | 130| 688| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 688| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 688] | | ------------------ ------------------ 275| | 276| 688| const divide_precomp div_y_t0(y_t0); 277| | 278| 26.0k| for(size_t i = n; i != t; --i) { ------------------ | Branch (278:22): [True: 25.3k, False: 688] ------------------ 279| 25.3k| const word x_i0 = r.word_at(i); 280| 25.3k| const word x_i1 = r.word_at(i - 1); 281| 25.3k| const word x_i2 = r.word_at(i - 2); 282| | 283| 25.3k| word qit = (x_i0 == y_t0) ? WordInfo::max : div_y_t0.vartime_div_2to1(x_i0, x_i1); ------------------ | Branch (283:18): [True: 68, False: 25.3k] ------------------ 284| | 285| | // Per HAC 14.23, this operation is required at most twice 286| 31.6k| for(size_t j = 0; j != 2; ++j) { ------------------ | Branch (286:25): [True: 31.5k, False: 122] ------------------ 287| 31.5k| if(division_check_vartime(qit, y_t0, y_t1, x_i0, x_i1, x_i2)) { ------------------ | Branch (287:13): [True: 6.30k, False: 25.2k] ------------------ 288| 6.30k| BOTAN_ASSERT_NOMSG(qit > 0); ------------------ | | 77| 6.30k| do { \ | | 78| 6.30k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 6.30k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 6.30k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 6.30k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 6.30k] | | ------------------ ------------------ 289| 6.30k| qit--; 290| 25.2k| } else { 291| 25.2k| break; 292| 25.2k| } 293| 31.5k| } 294| | 295| 25.3k| shifted_y >>= WB; 296| | // Now shifted_y == y << (WB * (i-t-1)) 297| | 298| | /* 299| | * Special case qit == 0 and qit == 1 which occurs relatively often here due to a 300| | * combination of the fixed 2^k and in many cases the typical structure of 301| | * public moduli (as this function is called by Barrett_Reduction::for_public_modulus). 302| | * 303| | * Over the test suite, about 5% of loop iterations have qit == 1 and 10% have qit == 0 304| | */ 305| | 306| 25.3k| if(qit != 0) { ------------------ | Branch (306:10): [True: 25.1k, False: 275] ------------------ 307| 25.1k| if(qit == 1) { ------------------ | Branch (307:13): [True: 369, False: 24.7k] ------------------ 308| 369| r -= shifted_y; 309| 24.7k| } else { 310| 24.7k| r -= qit * shifted_y; 311| 24.7k| } 312| | 313| 25.1k| if(r.signum() < 0) { ------------------ | Branch (313:13): [True: 57, False: 25.0k] ------------------ 314| 57| BOTAN_ASSERT_NOMSG(qit > 0); ------------------ | | 77| 57| do { \ | | 78| 57| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 57| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 57] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 57| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 57] | | ------------------ ------------------ 315| 57| qit--; 316| 57| r += shifted_y; 317| 57| BOTAN_ASSERT_NOMSG(r.signum() >= 0); ------------------ | | 77| 57| do { \ | | 78| 57| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 57| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 57] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 57| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 57] | | ------------------ ------------------ 318| 57| } 319| 25.1k| } 320| | 321| 25.3k| q_words[i - t - 1] = qit; 322| 25.3k| } 323| | 324| 688| return q; 325| 688|} _ZN5Botan14vartime_divideERKNS_6BigIntES2_RS0_S3_: 332| 222|void vartime_divide(const BigInt& x, const BigInt& y_arg, BigInt& q_out, BigInt& r_out) { 333| 222| constexpr size_t WB = WordInfo::bits; 334| | 335| 222| if(y_arg.is_zero()) { ------------------ | Branch (335:7): [True: 0, False: 222] ------------------ 336| 0| throw Invalid_Argument("vartime_divide: cannot divide by zero"); 337| 0| } 338| | 339| 222| const size_t y_words = y_arg.sig_words(); 340| | 341| 222| BOTAN_ASSERT_NOMSG(y_words > 0); ------------------ | | 77| 222| do { \ | | 78| 222| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 222| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 222] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 222| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 222] | | ------------------ ------------------ 342| | 343| 222| BigInt y = y_arg; 344| | 345| 222| BigInt r = x; 346| 222| BigInt q = BigInt::zero(); 347| 222| secure_vector ws; 348| | 349| 222| r.set_sign(BigInt::Positive); 350| 222| y.set_sign(BigInt::Positive); 351| | 352| | // Calculate shifts needed to normalize y with high bit set 353| 222| const size_t shifts = y.top_bits_free(); 354| | 355| 222| if(shifts > 0) { ------------------ | Branch (355:7): [True: 171, False: 51] ------------------ 356| 171| y <<= shifts; 357| 171| r <<= shifts; 358| 171| } 359| | 360| | // we know y has not changed size, since we only shifted up to set high bit 361| 222| const size_t t = y_words - 1; 362| 222| const size_t n = std::max(y_words, r.sig_words()) - 1; // r may have changed size however 363| | 364| 222| BOTAN_ASSERT_NOMSG(n >= t); ------------------ | | 77| 222| do { \ | | 78| 222| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 222| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 222] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 222| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 222] | | ------------------ ------------------ 365| | 366| 222| q.grow_to(n - t + 1); 367| | 368| 222| word* q_words = q.mutable_data(); 369| | 370| 222| BigInt shifted_y = y << (WB * (n - t)); 371| | 372| | // Set q_{n-t} to number of times r > shifted_y 373| 222| q_words[n - t] = r.reduce_below(shifted_y, ws); 374| | 375| 222| const word y_t0 = y.word_at(t); 376| 222| const word y_t1 = y.word_at(t - 1); 377| 222| BOTAN_DEBUG_ASSERT((y_t0 >> (WB - 1)) == 1); ------------------ | | 130| 222| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 222| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 222] | | ------------------ ------------------ 378| | 379| 222| const divide_precomp div_y_t0(y_t0); 380| | 381| 1.81k| for(size_t i = n; i != t; --i) { ------------------ | Branch (381:22): [True: 1.59k, False: 222] ------------------ 382| 1.59k| const word x_i0 = r.word_at(i); 383| 1.59k| const word x_i1 = r.word_at(i - 1); 384| 1.59k| const word x_i2 = r.word_at(i - 2); 385| | 386| 1.59k| word qit = (x_i0 == y_t0) ? WordInfo::max : div_y_t0.vartime_div_2to1(x_i0, x_i1); ------------------ | Branch (386:18): [True: 39, False: 1.55k] ------------------ 387| | 388| | // Per HAC 14.23, this operation is required at most twice 389| 2.03k| for(size_t j = 0; j != 2; ++j) { ------------------ | Branch (389:25): [True: 2.01k, False: 19] ------------------ 390| 2.01k| if(division_check_vartime(qit, y_t0, y_t1, x_i0, x_i1, x_i2)) { ------------------ | Branch (390:13): [True: 440, False: 1.57k] ------------------ 391| 440| BOTAN_ASSERT_NOMSG(qit > 0); ------------------ | | 77| 440| do { \ | | 78| 440| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 440| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 440] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 440| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 440] | | ------------------ ------------------ 392| 440| qit--; 393| 1.57k| } else { 394| 1.57k| break; 395| 1.57k| } 396| 2.01k| } 397| | 398| 1.59k| shifted_y >>= WB; 399| | // Now shifted_y == y << (WB * (i-t-1)) 400| | 401| 1.59k| if(qit != 0) { ------------------ | Branch (401:10): [True: 1.55k, False: 40] ------------------ 402| 1.55k| r -= qit * shifted_y; 403| 1.55k| if(r.signum() < 0) { ------------------ | Branch (403:13): [True: 2, False: 1.55k] ------------------ 404| 2| BOTAN_ASSERT_NOMSG(qit > 0); ------------------ | | 77| 2| do { \ | | 78| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 2] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 2| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 2] | | ------------------ ------------------ 405| 2| qit--; 406| 2| r += shifted_y; 407| 2| BOTAN_ASSERT_NOMSG(r.signum() >= 0); ------------------ | | 77| 2| do { \ | | 78| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 2] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 2| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 2] | | ------------------ ------------------ 408| 2| } 409| 1.55k| } 410| | 411| 1.59k| q_words[i - t - 1] = qit; 412| 1.59k| } 413| | 414| 222| if(shifts > 0) { ------------------ | Branch (414:7): [True: 171, False: 51] ------------------ 415| 171| r >>= shifts; 416| 171| } 417| | 418| 222| sign_fixup(x, y_arg, q, r); 419| | 420| 222| r_out = r; 421| 222| q_out = q; 422| 222|} divide.cpp:_ZN5Botan12_GLOBAL__N_110sign_fixupERKNS_6BigIntES3_RS1_S4_: 21| 222|void sign_fixup(const BigInt& x, const BigInt& y, BigInt& q, BigInt& r) { 22| 222| q.cond_flip_sign(x.sign() != y.sign()); 23| | 24| 222| if(x.signum() < 0 && r.signum() != 0) { ------------------ | Branch (24:7): [True: 66, False: 156] | Branch (24:25): [True: 66, False: 0] ------------------ 25| 66| if(y.signum() > 0) { ------------------ | Branch (25:10): [True: 66, False: 0] ------------------ 26| 66| q -= 1; 27| 66| } else { 28| 0| q += 1; 29| 0| } 30| 66| r = y.abs() - r; 31| 66| } 32| 222|} divide.cpp:_ZN5Botan12_GLOBAL__N_122division_check_vartimeEmmmmmm: 34| 33.5k|inline bool division_check_vartime(word q, word y2, word y1, word x3, word x2, word x1) { 35| | /* 36| | Compute (y3,y2,y1) = (y2,y1) * q 37| | and return true if (y3,y2,y1) > (x3,x2,x1) 38| | */ 39| | 40| 33.5k| word y3 = 0; 41| 33.5k| y1 = word_madd2(q, y1, &y3); 42| 33.5k| y2 = word_madd2(q, y2, &y3); 43| | 44| 33.5k| if(x3 != y3) { ------------------ | Branch (44:7): [True: 11.6k, False: 21.9k] ------------------ 45| 11.6k| return (y3 > x3); 46| 11.6k| } 47| 21.9k| if(x2 != y2) { ------------------ | Branch (47:7): [True: 21.5k, False: 348] ------------------ 48| 21.5k| return (y2 > x2); 49| 21.5k| } 50| 348| return (y1 > x1); 51| 21.9k|} _ZN5Botan17bigint_comba_sqr4EPmPKm: 17| 16.2k|void bigint_comba_sqr4(word z[8], const word x[4]) { 18| 16.2k| word3 accum; 19| | 20| 16.2k| accum.mul(x[0], x[0]); 21| 16.2k| z[0] = accum.extract(); 22| 16.2k| accum.mul_x2(x[0], x[1]); 23| 16.2k| z[1] = accum.extract(); 24| 16.2k| accum.mul_x2(x[0], x[2]); 25| 16.2k| accum.mul(x[1], x[1]); 26| 16.2k| z[2] = accum.extract(); 27| 16.2k| accum.mul_x2(x[0], x[3]); 28| 16.2k| accum.mul_x2(x[1], x[2]); 29| 16.2k| z[3] = accum.extract(); 30| 16.2k| accum.mul_x2(x[1], x[3]); 31| 16.2k| accum.mul(x[2], x[2]); 32| 16.2k| z[4] = accum.extract(); 33| 16.2k| accum.mul_x2(x[2], x[3]); 34| 16.2k| z[5] = accum.extract(); 35| 16.2k| accum.mul(x[3], x[3]); 36| 16.2k| z[6] = accum.extract(); 37| 16.2k| z[7] = accum.extract(); 38| 16.2k|} _ZN5Botan17bigint_comba_mul4EPmPKmS2_: 43| 45.0k|void bigint_comba_mul4(word z[8], const word x[4], const word y[4]) { 44| 45.0k| word3 accum; 45| | 46| 45.0k| accum.mul(x[0], y[0]); 47| 45.0k| z[0] = accum.extract(); 48| 45.0k| accum.mul(x[0], y[1]); 49| 45.0k| accum.mul(x[1], y[0]); 50| 45.0k| z[1] = accum.extract(); 51| 45.0k| accum.mul(x[0], y[2]); 52| 45.0k| accum.mul(x[1], y[1]); 53| 45.0k| accum.mul(x[2], y[0]); 54| 45.0k| z[2] = accum.extract(); 55| 45.0k| accum.mul(x[0], y[3]); 56| 45.0k| accum.mul(x[1], y[2]); 57| 45.0k| accum.mul(x[2], y[1]); 58| 45.0k| accum.mul(x[3], y[0]); 59| 45.0k| z[3] = accum.extract(); 60| 45.0k| accum.mul(x[1], y[3]); 61| 45.0k| accum.mul(x[2], y[2]); 62| 45.0k| accum.mul(x[3], y[1]); 63| 45.0k| z[4] = accum.extract(); 64| 45.0k| accum.mul(x[2], y[3]); 65| 45.0k| accum.mul(x[3], y[2]); 66| 45.0k| z[5] = accum.extract(); 67| 45.0k| accum.mul(x[3], y[3]); 68| 45.0k| z[6] = accum.extract(); 69| 45.0k| z[7] = accum.extract(); 70| 45.0k|} _ZN5Botan17bigint_comba_sqr6EPmPKm: 75| 11.6k|void bigint_comba_sqr6(word z[12], const word x[6]) { 76| 11.6k| word3 accum; 77| | 78| 11.6k| accum.mul(x[0], x[0]); 79| 11.6k| z[0] = accum.extract(); 80| 11.6k| accum.mul_x2(x[0], x[1]); 81| 11.6k| z[1] = accum.extract(); 82| 11.6k| accum.mul_x2(x[0], x[2]); 83| 11.6k| accum.mul(x[1], x[1]); 84| 11.6k| z[2] = accum.extract(); 85| 11.6k| accum.mul_x2(x[0], x[3]); 86| 11.6k| accum.mul_x2(x[1], x[2]); 87| 11.6k| z[3] = accum.extract(); 88| 11.6k| accum.mul_x2(x[0], x[4]); 89| 11.6k| accum.mul_x2(x[1], x[3]); 90| 11.6k| accum.mul(x[2], x[2]); 91| 11.6k| z[4] = accum.extract(); 92| 11.6k| accum.mul_x2(x[0], x[5]); 93| 11.6k| accum.mul_x2(x[1], x[4]); 94| 11.6k| accum.mul_x2(x[2], x[3]); 95| 11.6k| z[5] = accum.extract(); 96| 11.6k| accum.mul_x2(x[1], x[5]); 97| 11.6k| accum.mul_x2(x[2], x[4]); 98| 11.6k| accum.mul(x[3], x[3]); 99| 11.6k| z[6] = accum.extract(); 100| 11.6k| accum.mul_x2(x[2], x[5]); 101| 11.6k| accum.mul_x2(x[3], x[4]); 102| 11.6k| z[7] = accum.extract(); 103| 11.6k| accum.mul_x2(x[3], x[5]); 104| 11.6k| accum.mul(x[4], x[4]); 105| 11.6k| z[8] = accum.extract(); 106| 11.6k| accum.mul_x2(x[4], x[5]); 107| 11.6k| z[9] = accum.extract(); 108| 11.6k| accum.mul(x[5], x[5]); 109| 11.6k| z[10] = accum.extract(); 110| 11.6k| z[11] = accum.extract(); 111| 11.6k|} _ZN5Botan17bigint_comba_mul6EPmPKmS2_: 116| 32.1k|void bigint_comba_mul6(word z[12], const word x[6], const word y[6]) { 117| 32.1k| word3 accum; 118| | 119| 32.1k| accum.mul(x[0], y[0]); 120| 32.1k| z[0] = accum.extract(); 121| 32.1k| accum.mul(x[0], y[1]); 122| 32.1k| accum.mul(x[1], y[0]); 123| 32.1k| z[1] = accum.extract(); 124| 32.1k| accum.mul(x[0], y[2]); 125| 32.1k| accum.mul(x[1], y[1]); 126| 32.1k| accum.mul(x[2], y[0]); 127| 32.1k| z[2] = accum.extract(); 128| 32.1k| accum.mul(x[0], y[3]); 129| 32.1k| accum.mul(x[1], y[2]); 130| 32.1k| accum.mul(x[2], y[1]); 131| 32.1k| accum.mul(x[3], y[0]); 132| 32.1k| z[3] = accum.extract(); 133| 32.1k| accum.mul(x[0], y[4]); 134| 32.1k| accum.mul(x[1], y[3]); 135| 32.1k| accum.mul(x[2], y[2]); 136| 32.1k| accum.mul(x[3], y[1]); 137| 32.1k| accum.mul(x[4], y[0]); 138| 32.1k| z[4] = accum.extract(); 139| 32.1k| accum.mul(x[0], y[5]); 140| 32.1k| accum.mul(x[1], y[4]); 141| 32.1k| accum.mul(x[2], y[3]); 142| 32.1k| accum.mul(x[3], y[2]); 143| 32.1k| accum.mul(x[4], y[1]); 144| 32.1k| accum.mul(x[5], y[0]); 145| 32.1k| z[5] = accum.extract(); 146| 32.1k| accum.mul(x[1], y[5]); 147| 32.1k| accum.mul(x[2], y[4]); 148| 32.1k| accum.mul(x[3], y[3]); 149| 32.1k| accum.mul(x[4], y[2]); 150| 32.1k| accum.mul(x[5], y[1]); 151| 32.1k| z[6] = accum.extract(); 152| 32.1k| accum.mul(x[2], y[5]); 153| 32.1k| accum.mul(x[3], y[4]); 154| 32.1k| accum.mul(x[4], y[3]); 155| 32.1k| accum.mul(x[5], y[2]); 156| 32.1k| z[7] = accum.extract(); 157| 32.1k| accum.mul(x[3], y[5]); 158| 32.1k| accum.mul(x[4], y[4]); 159| 32.1k| accum.mul(x[5], y[3]); 160| 32.1k| z[8] = accum.extract(); 161| 32.1k| accum.mul(x[4], y[5]); 162| 32.1k| accum.mul(x[5], y[4]); 163| 32.1k| z[9] = accum.extract(); 164| 32.1k| accum.mul(x[5], y[5]); 165| 32.1k| z[10] = accum.extract(); 166| 32.1k| z[11] = accum.extract(); 167| 32.1k|} _ZN5Botan17bigint_comba_sqr8EPmPKm: 293| 76|void bigint_comba_sqr8(word z[16], const word x[8]) { 294| 76| word3 accum; 295| | 296| 76| accum.mul(x[0], x[0]); 297| 76| z[0] = accum.extract(); 298| 76| accum.mul_x2(x[0], x[1]); 299| 76| z[1] = accum.extract(); 300| 76| accum.mul_x2(x[0], x[2]); 301| 76| accum.mul(x[1], x[1]); 302| 76| z[2] = accum.extract(); 303| 76| accum.mul_x2(x[0], x[3]); 304| 76| accum.mul_x2(x[1], x[2]); 305| 76| z[3] = accum.extract(); 306| 76| accum.mul_x2(x[0], x[4]); 307| 76| accum.mul_x2(x[1], x[3]); 308| 76| accum.mul(x[2], x[2]); 309| 76| z[4] = accum.extract(); 310| 76| accum.mul_x2(x[0], x[5]); 311| 76| accum.mul_x2(x[1], x[4]); 312| 76| accum.mul_x2(x[2], x[3]); 313| 76| z[5] = accum.extract(); 314| 76| accum.mul_x2(x[0], x[6]); 315| 76| accum.mul_x2(x[1], x[5]); 316| 76| accum.mul_x2(x[2], x[4]); 317| 76| accum.mul(x[3], x[3]); 318| 76| z[6] = accum.extract(); 319| 76| accum.mul_x2(x[0], x[7]); 320| 76| accum.mul_x2(x[1], x[6]); 321| 76| accum.mul_x2(x[2], x[5]); 322| 76| accum.mul_x2(x[3], x[4]); 323| 76| z[7] = accum.extract(); 324| 76| accum.mul_x2(x[1], x[7]); 325| 76| accum.mul_x2(x[2], x[6]); 326| 76| accum.mul_x2(x[3], x[5]); 327| 76| accum.mul(x[4], x[4]); 328| 76| z[8] = accum.extract(); 329| 76| accum.mul_x2(x[2], x[7]); 330| 76| accum.mul_x2(x[3], x[6]); 331| 76| accum.mul_x2(x[4], x[5]); 332| 76| z[9] = accum.extract(); 333| 76| accum.mul_x2(x[3], x[7]); 334| 76| accum.mul_x2(x[4], x[6]); 335| 76| accum.mul(x[5], x[5]); 336| 76| z[10] = accum.extract(); 337| 76| accum.mul_x2(x[4], x[7]); 338| 76| accum.mul_x2(x[5], x[6]); 339| 76| z[11] = accum.extract(); 340| 76| accum.mul_x2(x[5], x[7]); 341| 76| accum.mul(x[6], x[6]); 342| 76| z[12] = accum.extract(); 343| 76| accum.mul_x2(x[6], x[7]); 344| 76| z[13] = accum.extract(); 345| 76| accum.mul(x[7], x[7]); 346| 76| z[14] = accum.extract(); 347| 76| z[15] = accum.extract(); 348| 76|} _ZN5Botan17bigint_comba_mul8EPmPKmS2_: 353| 54|void bigint_comba_mul8(word z[16], const word x[8], const word y[8]) { 354| 54| word3 accum; 355| | 356| 54| accum.mul(x[0], y[0]); 357| 54| z[0] = accum.extract(); 358| 54| accum.mul(x[0], y[1]); 359| 54| accum.mul(x[1], y[0]); 360| 54| z[1] = accum.extract(); 361| 54| accum.mul(x[0], y[2]); 362| 54| accum.mul(x[1], y[1]); 363| 54| accum.mul(x[2], y[0]); 364| 54| z[2] = accum.extract(); 365| 54| accum.mul(x[0], y[3]); 366| 54| accum.mul(x[1], y[2]); 367| 54| accum.mul(x[2], y[1]); 368| 54| accum.mul(x[3], y[0]); 369| 54| z[3] = accum.extract(); 370| 54| accum.mul(x[0], y[4]); 371| 54| accum.mul(x[1], y[3]); 372| 54| accum.mul(x[2], y[2]); 373| 54| accum.mul(x[3], y[1]); 374| 54| accum.mul(x[4], y[0]); 375| 54| z[4] = accum.extract(); 376| 54| accum.mul(x[0], y[5]); 377| 54| accum.mul(x[1], y[4]); 378| 54| accum.mul(x[2], y[3]); 379| 54| accum.mul(x[3], y[2]); 380| 54| accum.mul(x[4], y[1]); 381| 54| accum.mul(x[5], y[0]); 382| 54| z[5] = accum.extract(); 383| 54| accum.mul(x[0], y[6]); 384| 54| accum.mul(x[1], y[5]); 385| 54| accum.mul(x[2], y[4]); 386| 54| accum.mul(x[3], y[3]); 387| 54| accum.mul(x[4], y[2]); 388| 54| accum.mul(x[5], y[1]); 389| 54| accum.mul(x[6], y[0]); 390| 54| z[6] = accum.extract(); 391| 54| accum.mul(x[0], y[7]); 392| 54| accum.mul(x[1], y[6]); 393| 54| accum.mul(x[2], y[5]); 394| 54| accum.mul(x[3], y[4]); 395| 54| accum.mul(x[4], y[3]); 396| 54| accum.mul(x[5], y[2]); 397| 54| accum.mul(x[6], y[1]); 398| 54| accum.mul(x[7], y[0]); 399| 54| z[7] = accum.extract(); 400| 54| accum.mul(x[1], y[7]); 401| 54| accum.mul(x[2], y[6]); 402| 54| accum.mul(x[3], y[5]); 403| 54| accum.mul(x[4], y[4]); 404| 54| accum.mul(x[5], y[3]); 405| 54| accum.mul(x[6], y[2]); 406| 54| accum.mul(x[7], y[1]); 407| 54| z[8] = accum.extract(); 408| 54| accum.mul(x[2], y[7]); 409| 54| accum.mul(x[3], y[6]); 410| 54| accum.mul(x[4], y[5]); 411| 54| accum.mul(x[5], y[4]); 412| 54| accum.mul(x[6], y[3]); 413| 54| accum.mul(x[7], y[2]); 414| 54| z[9] = accum.extract(); 415| 54| accum.mul(x[3], y[7]); 416| 54| accum.mul(x[4], y[6]); 417| 54| accum.mul(x[5], y[5]); 418| 54| accum.mul(x[6], y[4]); 419| 54| accum.mul(x[7], y[3]); 420| 54| z[10] = accum.extract(); 421| 54| accum.mul(x[4], y[7]); 422| 54| accum.mul(x[5], y[6]); 423| 54| accum.mul(x[6], y[5]); 424| 54| accum.mul(x[7], y[4]); 425| 54| z[11] = accum.extract(); 426| 54| accum.mul(x[5], y[7]); 427| 54| accum.mul(x[6], y[6]); 428| 54| accum.mul(x[7], y[5]); 429| 54| z[12] = accum.extract(); 430| 54| accum.mul(x[6], y[7]); 431| 54| accum.mul(x[7], y[6]); 432| 54| z[13] = accum.extract(); 433| 54| accum.mul(x[7], y[7]); 434| 54| z[14] = accum.extract(); 435| 54| z[15] = accum.extract(); 436| 54|} _ZN5Botan17bigint_comba_sqr9EPmPKm: 441| 15.5k|void bigint_comba_sqr9(word z[18], const word x[9]) { 442| 15.5k| word3 accum; 443| | 444| 15.5k| accum.mul(x[0], x[0]); 445| 15.5k| z[0] = accum.extract(); 446| 15.5k| accum.mul_x2(x[0], x[1]); 447| 15.5k| z[1] = accum.extract(); 448| 15.5k| accum.mul_x2(x[0], x[2]); 449| 15.5k| accum.mul(x[1], x[1]); 450| 15.5k| z[2] = accum.extract(); 451| 15.5k| accum.mul_x2(x[0], x[3]); 452| 15.5k| accum.mul_x2(x[1], x[2]); 453| 15.5k| z[3] = accum.extract(); 454| 15.5k| accum.mul_x2(x[0], x[4]); 455| 15.5k| accum.mul_x2(x[1], x[3]); 456| 15.5k| accum.mul(x[2], x[2]); 457| 15.5k| z[4] = accum.extract(); 458| 15.5k| accum.mul_x2(x[0], x[5]); 459| 15.5k| accum.mul_x2(x[1], x[4]); 460| 15.5k| accum.mul_x2(x[2], x[3]); 461| 15.5k| z[5] = accum.extract(); 462| 15.5k| accum.mul_x2(x[0], x[6]); 463| 15.5k| accum.mul_x2(x[1], x[5]); 464| 15.5k| accum.mul_x2(x[2], x[4]); 465| 15.5k| accum.mul(x[3], x[3]); 466| 15.5k| z[6] = accum.extract(); 467| 15.5k| accum.mul_x2(x[0], x[7]); 468| 15.5k| accum.mul_x2(x[1], x[6]); 469| 15.5k| accum.mul_x2(x[2], x[5]); 470| 15.5k| accum.mul_x2(x[3], x[4]); 471| 15.5k| z[7] = accum.extract(); 472| 15.5k| accum.mul_x2(x[0], x[8]); 473| 15.5k| accum.mul_x2(x[1], x[7]); 474| 15.5k| accum.mul_x2(x[2], x[6]); 475| 15.5k| accum.mul_x2(x[3], x[5]); 476| 15.5k| accum.mul(x[4], x[4]); 477| 15.5k| z[8] = accum.extract(); 478| 15.5k| accum.mul_x2(x[1], x[8]); 479| 15.5k| accum.mul_x2(x[2], x[7]); 480| 15.5k| accum.mul_x2(x[3], x[6]); 481| 15.5k| accum.mul_x2(x[4], x[5]); 482| 15.5k| z[9] = accum.extract(); 483| 15.5k| accum.mul_x2(x[2], x[8]); 484| 15.5k| accum.mul_x2(x[3], x[7]); 485| 15.5k| accum.mul_x2(x[4], x[6]); 486| 15.5k| accum.mul(x[5], x[5]); 487| 15.5k| z[10] = accum.extract(); 488| 15.5k| accum.mul_x2(x[3], x[8]); 489| 15.5k| accum.mul_x2(x[4], x[7]); 490| 15.5k| accum.mul_x2(x[5], x[6]); 491| 15.5k| z[11] = accum.extract(); 492| 15.5k| accum.mul_x2(x[4], x[8]); 493| 15.5k| accum.mul_x2(x[5], x[7]); 494| 15.5k| accum.mul(x[6], x[6]); 495| 15.5k| z[12] = accum.extract(); 496| 15.5k| accum.mul_x2(x[5], x[8]); 497| 15.5k| accum.mul_x2(x[6], x[7]); 498| 15.5k| z[13] = accum.extract(); 499| 15.5k| accum.mul_x2(x[6], x[8]); 500| 15.5k| accum.mul(x[7], x[7]); 501| 15.5k| z[14] = accum.extract(); 502| 15.5k| accum.mul_x2(x[7], x[8]); 503| 15.5k| z[15] = accum.extract(); 504| 15.5k| accum.mul(x[8], x[8]); 505| 15.5k| z[16] = accum.extract(); 506| 15.5k| z[17] = accum.extract(); 507| 15.5k|} _ZN5Botan17bigint_comba_mul9EPmPKmS2_: 512| 42.7k|void bigint_comba_mul9(word z[18], const word x[9], const word y[9]) { 513| 42.7k| word3 accum; 514| | 515| 42.7k| accum.mul(x[0], y[0]); 516| 42.7k| z[0] = accum.extract(); 517| 42.7k| accum.mul(x[0], y[1]); 518| 42.7k| accum.mul(x[1], y[0]); 519| 42.7k| z[1] = accum.extract(); 520| 42.7k| accum.mul(x[0], y[2]); 521| 42.7k| accum.mul(x[1], y[1]); 522| 42.7k| accum.mul(x[2], y[0]); 523| 42.7k| z[2] = accum.extract(); 524| 42.7k| accum.mul(x[0], y[3]); 525| 42.7k| accum.mul(x[1], y[2]); 526| 42.7k| accum.mul(x[2], y[1]); 527| 42.7k| accum.mul(x[3], y[0]); 528| 42.7k| z[3] = accum.extract(); 529| 42.7k| accum.mul(x[0], y[4]); 530| 42.7k| accum.mul(x[1], y[3]); 531| 42.7k| accum.mul(x[2], y[2]); 532| 42.7k| accum.mul(x[3], y[1]); 533| 42.7k| accum.mul(x[4], y[0]); 534| 42.7k| z[4] = accum.extract(); 535| 42.7k| accum.mul(x[0], y[5]); 536| 42.7k| accum.mul(x[1], y[4]); 537| 42.7k| accum.mul(x[2], y[3]); 538| 42.7k| accum.mul(x[3], y[2]); 539| 42.7k| accum.mul(x[4], y[1]); 540| 42.7k| accum.mul(x[5], y[0]); 541| 42.7k| z[5] = accum.extract(); 542| 42.7k| accum.mul(x[0], y[6]); 543| 42.7k| accum.mul(x[1], y[5]); 544| 42.7k| accum.mul(x[2], y[4]); 545| 42.7k| accum.mul(x[3], y[3]); 546| 42.7k| accum.mul(x[4], y[2]); 547| 42.7k| accum.mul(x[5], y[1]); 548| 42.7k| accum.mul(x[6], y[0]); 549| 42.7k| z[6] = accum.extract(); 550| 42.7k| accum.mul(x[0], y[7]); 551| 42.7k| accum.mul(x[1], y[6]); 552| 42.7k| accum.mul(x[2], y[5]); 553| 42.7k| accum.mul(x[3], y[4]); 554| 42.7k| accum.mul(x[4], y[3]); 555| 42.7k| accum.mul(x[5], y[2]); 556| 42.7k| accum.mul(x[6], y[1]); 557| 42.7k| accum.mul(x[7], y[0]); 558| 42.7k| z[7] = accum.extract(); 559| 42.7k| accum.mul(x[0], y[8]); 560| 42.7k| accum.mul(x[1], y[7]); 561| 42.7k| accum.mul(x[2], y[6]); 562| 42.7k| accum.mul(x[3], y[5]); 563| 42.7k| accum.mul(x[4], y[4]); 564| 42.7k| accum.mul(x[5], y[3]); 565| 42.7k| accum.mul(x[6], y[2]); 566| 42.7k| accum.mul(x[7], y[1]); 567| 42.7k| accum.mul(x[8], y[0]); 568| 42.7k| z[8] = accum.extract(); 569| 42.7k| accum.mul(x[1], y[8]); 570| 42.7k| accum.mul(x[2], y[7]); 571| 42.7k| accum.mul(x[3], y[6]); 572| 42.7k| accum.mul(x[4], y[5]); 573| 42.7k| accum.mul(x[5], y[4]); 574| 42.7k| accum.mul(x[6], y[3]); 575| 42.7k| accum.mul(x[7], y[2]); 576| 42.7k| accum.mul(x[8], y[1]); 577| 42.7k| z[9] = accum.extract(); 578| 42.7k| accum.mul(x[2], y[8]); 579| 42.7k| accum.mul(x[3], y[7]); 580| 42.7k| accum.mul(x[4], y[6]); 581| 42.7k| accum.mul(x[5], y[5]); 582| 42.7k| accum.mul(x[6], y[4]); 583| 42.7k| accum.mul(x[7], y[3]); 584| 42.7k| accum.mul(x[8], y[2]); 585| 42.7k| z[10] = accum.extract(); 586| 42.7k| accum.mul(x[3], y[8]); 587| 42.7k| accum.mul(x[4], y[7]); 588| 42.7k| accum.mul(x[5], y[6]); 589| 42.7k| accum.mul(x[6], y[5]); 590| 42.7k| accum.mul(x[7], y[4]); 591| 42.7k| accum.mul(x[8], y[3]); 592| 42.7k| z[11] = accum.extract(); 593| 42.7k| accum.mul(x[4], y[8]); 594| 42.7k| accum.mul(x[5], y[7]); 595| 42.7k| accum.mul(x[6], y[6]); 596| 42.7k| accum.mul(x[7], y[5]); 597| 42.7k| accum.mul(x[8], y[4]); 598| 42.7k| z[12] = accum.extract(); 599| 42.7k| accum.mul(x[5], y[8]); 600| 42.7k| accum.mul(x[6], y[7]); 601| 42.7k| accum.mul(x[7], y[6]); 602| 42.7k| accum.mul(x[8], y[5]); 603| 42.7k| z[13] = accum.extract(); 604| 42.7k| accum.mul(x[6], y[8]); 605| 42.7k| accum.mul(x[7], y[7]); 606| 42.7k| accum.mul(x[8], y[6]); 607| 42.7k| z[14] = accum.extract(); 608| 42.7k| accum.mul(x[7], y[8]); 609| 42.7k| accum.mul(x[8], y[7]); 610| 42.7k| z[15] = accum.extract(); 611| 42.7k| accum.mul(x[8], y[8]); 612| 42.7k| z[16] = accum.extract(); 613| 42.7k| z[17] = accum.extract(); 614| 42.7k|} _ZN5Botan18bigint_comba_sqr16EPmPKm: 619| 8.34M|void bigint_comba_sqr16(word z[32], const word x[16]) { 620| 8.34M| word3 accum; 621| | 622| 8.34M| accum.mul(x[0], x[0]); 623| 8.34M| z[0] = accum.extract(); 624| 8.34M| accum.mul_x2(x[0], x[1]); 625| 8.34M| z[1] = accum.extract(); 626| 8.34M| accum.mul_x2(x[0], x[2]); 627| 8.34M| accum.mul(x[1], x[1]); 628| 8.34M| z[2] = accum.extract(); 629| 8.34M| accum.mul_x2(x[0], x[3]); 630| 8.34M| accum.mul_x2(x[1], x[2]); 631| 8.34M| z[3] = accum.extract(); 632| 8.34M| accum.mul_x2(x[0], x[4]); 633| 8.34M| accum.mul_x2(x[1], x[3]); 634| 8.34M| accum.mul(x[2], x[2]); 635| 8.34M| z[4] = accum.extract(); 636| 8.34M| accum.mul_x2(x[0], x[5]); 637| 8.34M| accum.mul_x2(x[1], x[4]); 638| 8.34M| accum.mul_x2(x[2], x[3]); 639| 8.34M| z[5] = accum.extract(); 640| 8.34M| accum.mul_x2(x[0], x[6]); 641| 8.34M| accum.mul_x2(x[1], x[5]); 642| 8.34M| accum.mul_x2(x[2], x[4]); 643| 8.34M| accum.mul(x[3], x[3]); 644| 8.34M| z[6] = accum.extract(); 645| 8.34M| accum.mul_x2(x[0], x[7]); 646| 8.34M| accum.mul_x2(x[1], x[6]); 647| 8.34M| accum.mul_x2(x[2], x[5]); 648| 8.34M| accum.mul_x2(x[3], x[4]); 649| 8.34M| z[7] = accum.extract(); 650| 8.34M| accum.mul_x2(x[0], x[8]); 651| 8.34M| accum.mul_x2(x[1], x[7]); 652| 8.34M| accum.mul_x2(x[2], x[6]); 653| 8.34M| accum.mul_x2(x[3], x[5]); 654| 8.34M| accum.mul(x[4], x[4]); 655| 8.34M| z[8] = accum.extract(); 656| 8.34M| accum.mul_x2(x[0], x[9]); 657| 8.34M| accum.mul_x2(x[1], x[8]); 658| 8.34M| accum.mul_x2(x[2], x[7]); 659| 8.34M| accum.mul_x2(x[3], x[6]); 660| 8.34M| accum.mul_x2(x[4], x[5]); 661| 8.34M| z[9] = accum.extract(); 662| 8.34M| accum.mul_x2(x[0], x[10]); 663| 8.34M| accum.mul_x2(x[1], x[9]); 664| 8.34M| accum.mul_x2(x[2], x[8]); 665| 8.34M| accum.mul_x2(x[3], x[7]); 666| 8.34M| accum.mul_x2(x[4], x[6]); 667| 8.34M| accum.mul(x[5], x[5]); 668| 8.34M| z[10] = accum.extract(); 669| 8.34M| accum.mul_x2(x[0], x[11]); 670| 8.34M| accum.mul_x2(x[1], x[10]); 671| 8.34M| accum.mul_x2(x[2], x[9]); 672| 8.34M| accum.mul_x2(x[3], x[8]); 673| 8.34M| accum.mul_x2(x[4], x[7]); 674| 8.34M| accum.mul_x2(x[5], x[6]); 675| 8.34M| z[11] = accum.extract(); 676| 8.34M| accum.mul_x2(x[0], x[12]); 677| 8.34M| accum.mul_x2(x[1], x[11]); 678| 8.34M| accum.mul_x2(x[2], x[10]); 679| 8.34M| accum.mul_x2(x[3], x[9]); 680| 8.34M| accum.mul_x2(x[4], x[8]); 681| 8.34M| accum.mul_x2(x[5], x[7]); 682| 8.34M| accum.mul(x[6], x[6]); 683| 8.34M| z[12] = accum.extract(); 684| 8.34M| accum.mul_x2(x[0], x[13]); 685| 8.34M| accum.mul_x2(x[1], x[12]); 686| 8.34M| accum.mul_x2(x[2], x[11]); 687| 8.34M| accum.mul_x2(x[3], x[10]); 688| 8.34M| accum.mul_x2(x[4], x[9]); 689| 8.34M| accum.mul_x2(x[5], x[8]); 690| 8.34M| accum.mul_x2(x[6], x[7]); 691| 8.34M| z[13] = accum.extract(); 692| 8.34M| accum.mul_x2(x[0], x[14]); 693| 8.34M| accum.mul_x2(x[1], x[13]); 694| 8.34M| accum.mul_x2(x[2], x[12]); 695| 8.34M| accum.mul_x2(x[3], x[11]); 696| 8.34M| accum.mul_x2(x[4], x[10]); 697| 8.34M| accum.mul_x2(x[5], x[9]); 698| 8.34M| accum.mul_x2(x[6], x[8]); 699| 8.34M| accum.mul(x[7], x[7]); 700| 8.34M| z[14] = accum.extract(); 701| 8.34M| accum.mul_x2(x[0], x[15]); 702| 8.34M| accum.mul_x2(x[1], x[14]); 703| 8.34M| accum.mul_x2(x[2], x[13]); 704| 8.34M| accum.mul_x2(x[3], x[12]); 705| 8.34M| accum.mul_x2(x[4], x[11]); 706| 8.34M| accum.mul_x2(x[5], x[10]); 707| 8.34M| accum.mul_x2(x[6], x[9]); 708| 8.34M| accum.mul_x2(x[7], x[8]); 709| 8.34M| z[15] = accum.extract(); 710| 8.34M| accum.mul_x2(x[1], x[15]); 711| 8.34M| accum.mul_x2(x[2], x[14]); 712| 8.34M| accum.mul_x2(x[3], x[13]); 713| 8.34M| accum.mul_x2(x[4], x[12]); 714| 8.34M| accum.mul_x2(x[5], x[11]); 715| 8.34M| accum.mul_x2(x[6], x[10]); 716| 8.34M| accum.mul_x2(x[7], x[9]); 717| 8.34M| accum.mul(x[8], x[8]); 718| 8.34M| z[16] = accum.extract(); 719| 8.34M| accum.mul_x2(x[2], x[15]); 720| 8.34M| accum.mul_x2(x[3], x[14]); 721| 8.34M| accum.mul_x2(x[4], x[13]); 722| 8.34M| accum.mul_x2(x[5], x[12]); 723| 8.34M| accum.mul_x2(x[6], x[11]); 724| 8.34M| accum.mul_x2(x[7], x[10]); 725| 8.34M| accum.mul_x2(x[8], x[9]); 726| 8.34M| z[17] = accum.extract(); 727| 8.34M| accum.mul_x2(x[3], x[15]); 728| 8.34M| accum.mul_x2(x[4], x[14]); 729| 8.34M| accum.mul_x2(x[5], x[13]); 730| 8.34M| accum.mul_x2(x[6], x[12]); 731| 8.34M| accum.mul_x2(x[7], x[11]); 732| 8.34M| accum.mul_x2(x[8], x[10]); 733| 8.34M| accum.mul(x[9], x[9]); 734| 8.34M| z[18] = accum.extract(); 735| 8.34M| accum.mul_x2(x[4], x[15]); 736| 8.34M| accum.mul_x2(x[5], x[14]); 737| 8.34M| accum.mul_x2(x[6], x[13]); 738| 8.34M| accum.mul_x2(x[7], x[12]); 739| 8.34M| accum.mul_x2(x[8], x[11]); 740| 8.34M| accum.mul_x2(x[9], x[10]); 741| 8.34M| z[19] = accum.extract(); 742| 8.34M| accum.mul_x2(x[5], x[15]); 743| 8.34M| accum.mul_x2(x[6], x[14]); 744| 8.34M| accum.mul_x2(x[7], x[13]); 745| 8.34M| accum.mul_x2(x[8], x[12]); 746| 8.34M| accum.mul_x2(x[9], x[11]); 747| 8.34M| accum.mul(x[10], x[10]); 748| 8.34M| z[20] = accum.extract(); 749| 8.34M| accum.mul_x2(x[6], x[15]); 750| 8.34M| accum.mul_x2(x[7], x[14]); 751| 8.34M| accum.mul_x2(x[8], x[13]); 752| 8.34M| accum.mul_x2(x[9], x[12]); 753| 8.34M| accum.mul_x2(x[10], x[11]); 754| 8.34M| z[21] = accum.extract(); 755| 8.34M| accum.mul_x2(x[7], x[15]); 756| 8.34M| accum.mul_x2(x[8], x[14]); 757| 8.34M| accum.mul_x2(x[9], x[13]); 758| 8.34M| accum.mul_x2(x[10], x[12]); 759| 8.34M| accum.mul(x[11], x[11]); 760| 8.34M| z[22] = accum.extract(); 761| 8.34M| accum.mul_x2(x[8], x[15]); 762| 8.34M| accum.mul_x2(x[9], x[14]); 763| 8.34M| accum.mul_x2(x[10], x[13]); 764| 8.34M| accum.mul_x2(x[11], x[12]); 765| 8.34M| z[23] = accum.extract(); 766| 8.34M| accum.mul_x2(x[9], x[15]); 767| 8.34M| accum.mul_x2(x[10], x[14]); 768| 8.34M| accum.mul_x2(x[11], x[13]); 769| 8.34M| accum.mul(x[12], x[12]); 770| 8.34M| z[24] = accum.extract(); 771| 8.34M| accum.mul_x2(x[10], x[15]); 772| 8.34M| accum.mul_x2(x[11], x[14]); 773| 8.34M| accum.mul_x2(x[12], x[13]); 774| 8.34M| z[25] = accum.extract(); 775| 8.34M| accum.mul_x2(x[11], x[15]); 776| 8.34M| accum.mul_x2(x[12], x[14]); 777| 8.34M| accum.mul(x[13], x[13]); 778| 8.34M| z[26] = accum.extract(); 779| 8.34M| accum.mul_x2(x[12], x[15]); 780| 8.34M| accum.mul_x2(x[13], x[14]); 781| 8.34M| z[27] = accum.extract(); 782| 8.34M| accum.mul_x2(x[13], x[15]); 783| 8.34M| accum.mul(x[14], x[14]); 784| 8.34M| z[28] = accum.extract(); 785| 8.34M| accum.mul_x2(x[14], x[15]); 786| 8.34M| z[29] = accum.extract(); 787| 8.34M| accum.mul(x[15], x[15]); 788| 8.34M| z[30] = accum.extract(); 789| 8.34M| z[31] = accum.extract(); 790| 8.34M|} _ZN5Botan18bigint_comba_mul16EPmPKmS2_: 795| 2.20M|void bigint_comba_mul16(word z[32], const word x[16], const word y[16]) { 796| 2.20M| word3 accum; 797| | 798| 2.20M| accum.mul(x[0], y[0]); 799| 2.20M| z[0] = accum.extract(); 800| 2.20M| accum.mul(x[0], y[1]); 801| 2.20M| accum.mul(x[1], y[0]); 802| 2.20M| z[1] = accum.extract(); 803| 2.20M| accum.mul(x[0], y[2]); 804| 2.20M| accum.mul(x[1], y[1]); 805| 2.20M| accum.mul(x[2], y[0]); 806| 2.20M| z[2] = accum.extract(); 807| 2.20M| accum.mul(x[0], y[3]); 808| 2.20M| accum.mul(x[1], y[2]); 809| 2.20M| accum.mul(x[2], y[1]); 810| 2.20M| accum.mul(x[3], y[0]); 811| 2.20M| z[3] = accum.extract(); 812| 2.20M| accum.mul(x[0], y[4]); 813| 2.20M| accum.mul(x[1], y[3]); 814| 2.20M| accum.mul(x[2], y[2]); 815| 2.20M| accum.mul(x[3], y[1]); 816| 2.20M| accum.mul(x[4], y[0]); 817| 2.20M| z[4] = accum.extract(); 818| 2.20M| accum.mul(x[0], y[5]); 819| 2.20M| accum.mul(x[1], y[4]); 820| 2.20M| accum.mul(x[2], y[3]); 821| 2.20M| accum.mul(x[3], y[2]); 822| 2.20M| accum.mul(x[4], y[1]); 823| 2.20M| accum.mul(x[5], y[0]); 824| 2.20M| z[5] = accum.extract(); 825| 2.20M| accum.mul(x[0], y[6]); 826| 2.20M| accum.mul(x[1], y[5]); 827| 2.20M| accum.mul(x[2], y[4]); 828| 2.20M| accum.mul(x[3], y[3]); 829| 2.20M| accum.mul(x[4], y[2]); 830| 2.20M| accum.mul(x[5], y[1]); 831| 2.20M| accum.mul(x[6], y[0]); 832| 2.20M| z[6] = accum.extract(); 833| 2.20M| accum.mul(x[0], y[7]); 834| 2.20M| accum.mul(x[1], y[6]); 835| 2.20M| accum.mul(x[2], y[5]); 836| 2.20M| accum.mul(x[3], y[4]); 837| 2.20M| accum.mul(x[4], y[3]); 838| 2.20M| accum.mul(x[5], y[2]); 839| 2.20M| accum.mul(x[6], y[1]); 840| 2.20M| accum.mul(x[7], y[0]); 841| 2.20M| z[7] = accum.extract(); 842| 2.20M| accum.mul(x[0], y[8]); 843| 2.20M| accum.mul(x[1], y[7]); 844| 2.20M| accum.mul(x[2], y[6]); 845| 2.20M| accum.mul(x[3], y[5]); 846| 2.20M| accum.mul(x[4], y[4]); 847| 2.20M| accum.mul(x[5], y[3]); 848| 2.20M| accum.mul(x[6], y[2]); 849| 2.20M| accum.mul(x[7], y[1]); 850| 2.20M| accum.mul(x[8], y[0]); 851| 2.20M| z[8] = accum.extract(); 852| 2.20M| accum.mul(x[0], y[9]); 853| 2.20M| accum.mul(x[1], y[8]); 854| 2.20M| accum.mul(x[2], y[7]); 855| 2.20M| accum.mul(x[3], y[6]); 856| 2.20M| accum.mul(x[4], y[5]); 857| 2.20M| accum.mul(x[5], y[4]); 858| 2.20M| accum.mul(x[6], y[3]); 859| 2.20M| accum.mul(x[7], y[2]); 860| 2.20M| accum.mul(x[8], y[1]); 861| 2.20M| accum.mul(x[9], y[0]); 862| 2.20M| z[9] = accum.extract(); 863| 2.20M| accum.mul(x[0], y[10]); 864| 2.20M| accum.mul(x[1], y[9]); 865| 2.20M| accum.mul(x[2], y[8]); 866| 2.20M| accum.mul(x[3], y[7]); 867| 2.20M| accum.mul(x[4], y[6]); 868| 2.20M| accum.mul(x[5], y[5]); 869| 2.20M| accum.mul(x[6], y[4]); 870| 2.20M| accum.mul(x[7], y[3]); 871| 2.20M| accum.mul(x[8], y[2]); 872| 2.20M| accum.mul(x[9], y[1]); 873| 2.20M| accum.mul(x[10], y[0]); 874| 2.20M| z[10] = accum.extract(); 875| 2.20M| accum.mul(x[0], y[11]); 876| 2.20M| accum.mul(x[1], y[10]); 877| 2.20M| accum.mul(x[2], y[9]); 878| 2.20M| accum.mul(x[3], y[8]); 879| 2.20M| accum.mul(x[4], y[7]); 880| 2.20M| accum.mul(x[5], y[6]); 881| 2.20M| accum.mul(x[6], y[5]); 882| 2.20M| accum.mul(x[7], y[4]); 883| 2.20M| accum.mul(x[8], y[3]); 884| 2.20M| accum.mul(x[9], y[2]); 885| 2.20M| accum.mul(x[10], y[1]); 886| 2.20M| accum.mul(x[11], y[0]); 887| 2.20M| z[11] = accum.extract(); 888| 2.20M| accum.mul(x[0], y[12]); 889| 2.20M| accum.mul(x[1], y[11]); 890| 2.20M| accum.mul(x[2], y[10]); 891| 2.20M| accum.mul(x[3], y[9]); 892| 2.20M| accum.mul(x[4], y[8]); 893| 2.20M| accum.mul(x[5], y[7]); 894| 2.20M| accum.mul(x[6], y[6]); 895| 2.20M| accum.mul(x[7], y[5]); 896| 2.20M| accum.mul(x[8], y[4]); 897| 2.20M| accum.mul(x[9], y[3]); 898| 2.20M| accum.mul(x[10], y[2]); 899| 2.20M| accum.mul(x[11], y[1]); 900| 2.20M| accum.mul(x[12], y[0]); 901| 2.20M| z[12] = accum.extract(); 902| 2.20M| accum.mul(x[0], y[13]); 903| 2.20M| accum.mul(x[1], y[12]); 904| 2.20M| accum.mul(x[2], y[11]); 905| 2.20M| accum.mul(x[3], y[10]); 906| 2.20M| accum.mul(x[4], y[9]); 907| 2.20M| accum.mul(x[5], y[8]); 908| 2.20M| accum.mul(x[6], y[7]); 909| 2.20M| accum.mul(x[7], y[6]); 910| 2.20M| accum.mul(x[8], y[5]); 911| 2.20M| accum.mul(x[9], y[4]); 912| 2.20M| accum.mul(x[10], y[3]); 913| 2.20M| accum.mul(x[11], y[2]); 914| 2.20M| accum.mul(x[12], y[1]); 915| 2.20M| accum.mul(x[13], y[0]); 916| 2.20M| z[13] = accum.extract(); 917| 2.20M| accum.mul(x[0], y[14]); 918| 2.20M| accum.mul(x[1], y[13]); 919| 2.20M| accum.mul(x[2], y[12]); 920| 2.20M| accum.mul(x[3], y[11]); 921| 2.20M| accum.mul(x[4], y[10]); 922| 2.20M| accum.mul(x[5], y[9]); 923| 2.20M| accum.mul(x[6], y[8]); 924| 2.20M| accum.mul(x[7], y[7]); 925| 2.20M| accum.mul(x[8], y[6]); 926| 2.20M| accum.mul(x[9], y[5]); 927| 2.20M| accum.mul(x[10], y[4]); 928| 2.20M| accum.mul(x[11], y[3]); 929| 2.20M| accum.mul(x[12], y[2]); 930| 2.20M| accum.mul(x[13], y[1]); 931| 2.20M| accum.mul(x[14], y[0]); 932| 2.20M| z[14] = accum.extract(); 933| 2.20M| accum.mul(x[0], y[15]); 934| 2.20M| accum.mul(x[1], y[14]); 935| 2.20M| accum.mul(x[2], y[13]); 936| 2.20M| accum.mul(x[3], y[12]); 937| 2.20M| accum.mul(x[4], y[11]); 938| 2.20M| accum.mul(x[5], y[10]); 939| 2.20M| accum.mul(x[6], y[9]); 940| 2.20M| accum.mul(x[7], y[8]); 941| 2.20M| accum.mul(x[8], y[7]); 942| 2.20M| accum.mul(x[9], y[6]); 943| 2.20M| accum.mul(x[10], y[5]); 944| 2.20M| accum.mul(x[11], y[4]); 945| 2.20M| accum.mul(x[12], y[3]); 946| 2.20M| accum.mul(x[13], y[2]); 947| 2.20M| accum.mul(x[14], y[1]); 948| 2.20M| accum.mul(x[15], y[0]); 949| 2.20M| z[15] = accum.extract(); 950| 2.20M| accum.mul(x[1], y[15]); 951| 2.20M| accum.mul(x[2], y[14]); 952| 2.20M| accum.mul(x[3], y[13]); 953| 2.20M| accum.mul(x[4], y[12]); 954| 2.20M| accum.mul(x[5], y[11]); 955| 2.20M| accum.mul(x[6], y[10]); 956| 2.20M| accum.mul(x[7], y[9]); 957| 2.20M| accum.mul(x[8], y[8]); 958| 2.20M| accum.mul(x[9], y[7]); 959| 2.20M| accum.mul(x[10], y[6]); 960| 2.20M| accum.mul(x[11], y[5]); 961| 2.20M| accum.mul(x[12], y[4]); 962| 2.20M| accum.mul(x[13], y[3]); 963| 2.20M| accum.mul(x[14], y[2]); 964| 2.20M| accum.mul(x[15], y[1]); 965| 2.20M| z[16] = accum.extract(); 966| 2.20M| accum.mul(x[2], y[15]); 967| 2.20M| accum.mul(x[3], y[14]); 968| 2.20M| accum.mul(x[4], y[13]); 969| 2.20M| accum.mul(x[5], y[12]); 970| 2.20M| accum.mul(x[6], y[11]); 971| 2.20M| accum.mul(x[7], y[10]); 972| 2.20M| accum.mul(x[8], y[9]); 973| 2.20M| accum.mul(x[9], y[8]); 974| 2.20M| accum.mul(x[10], y[7]); 975| 2.20M| accum.mul(x[11], y[6]); 976| 2.20M| accum.mul(x[12], y[5]); 977| 2.20M| accum.mul(x[13], y[4]); 978| 2.20M| accum.mul(x[14], y[3]); 979| 2.20M| accum.mul(x[15], y[2]); 980| 2.20M| z[17] = accum.extract(); 981| 2.20M| accum.mul(x[3], y[15]); 982| 2.20M| accum.mul(x[4], y[14]); 983| 2.20M| accum.mul(x[5], y[13]); 984| 2.20M| accum.mul(x[6], y[12]); 985| 2.20M| accum.mul(x[7], y[11]); 986| 2.20M| accum.mul(x[8], y[10]); 987| 2.20M| accum.mul(x[9], y[9]); 988| 2.20M| accum.mul(x[10], y[8]); 989| 2.20M| accum.mul(x[11], y[7]); 990| 2.20M| accum.mul(x[12], y[6]); 991| 2.20M| accum.mul(x[13], y[5]); 992| 2.20M| accum.mul(x[14], y[4]); 993| 2.20M| accum.mul(x[15], y[3]); 994| 2.20M| z[18] = accum.extract(); 995| 2.20M| accum.mul(x[4], y[15]); 996| 2.20M| accum.mul(x[5], y[14]); 997| 2.20M| accum.mul(x[6], y[13]); 998| 2.20M| accum.mul(x[7], y[12]); 999| 2.20M| accum.mul(x[8], y[11]); 1000| 2.20M| accum.mul(x[9], y[10]); 1001| 2.20M| accum.mul(x[10], y[9]); 1002| 2.20M| accum.mul(x[11], y[8]); 1003| 2.20M| accum.mul(x[12], y[7]); 1004| 2.20M| accum.mul(x[13], y[6]); 1005| 2.20M| accum.mul(x[14], y[5]); 1006| 2.20M| accum.mul(x[15], y[4]); 1007| 2.20M| z[19] = accum.extract(); 1008| 2.20M| accum.mul(x[5], y[15]); 1009| 2.20M| accum.mul(x[6], y[14]); 1010| 2.20M| accum.mul(x[7], y[13]); 1011| 2.20M| accum.mul(x[8], y[12]); 1012| 2.20M| accum.mul(x[9], y[11]); 1013| 2.20M| accum.mul(x[10], y[10]); 1014| 2.20M| accum.mul(x[11], y[9]); 1015| 2.20M| accum.mul(x[12], y[8]); 1016| 2.20M| accum.mul(x[13], y[7]); 1017| 2.20M| accum.mul(x[14], y[6]); 1018| 2.20M| accum.mul(x[15], y[5]); 1019| 2.20M| z[20] = accum.extract(); 1020| 2.20M| accum.mul(x[6], y[15]); 1021| 2.20M| accum.mul(x[7], y[14]); 1022| 2.20M| accum.mul(x[8], y[13]); 1023| 2.20M| accum.mul(x[9], y[12]); 1024| 2.20M| accum.mul(x[10], y[11]); 1025| 2.20M| accum.mul(x[11], y[10]); 1026| 2.20M| accum.mul(x[12], y[9]); 1027| 2.20M| accum.mul(x[13], y[8]); 1028| 2.20M| accum.mul(x[14], y[7]); 1029| 2.20M| accum.mul(x[15], y[6]); 1030| 2.20M| z[21] = accum.extract(); 1031| 2.20M| accum.mul(x[7], y[15]); 1032| 2.20M| accum.mul(x[8], y[14]); 1033| 2.20M| accum.mul(x[9], y[13]); 1034| 2.20M| accum.mul(x[10], y[12]); 1035| 2.20M| accum.mul(x[11], y[11]); 1036| 2.20M| accum.mul(x[12], y[10]); 1037| 2.20M| accum.mul(x[13], y[9]); 1038| 2.20M| accum.mul(x[14], y[8]); 1039| 2.20M| accum.mul(x[15], y[7]); 1040| 2.20M| z[22] = accum.extract(); 1041| 2.20M| accum.mul(x[8], y[15]); 1042| 2.20M| accum.mul(x[9], y[14]); 1043| 2.20M| accum.mul(x[10], y[13]); 1044| 2.20M| accum.mul(x[11], y[12]); 1045| 2.20M| accum.mul(x[12], y[11]); 1046| 2.20M| accum.mul(x[13], y[10]); 1047| 2.20M| accum.mul(x[14], y[9]); 1048| 2.20M| accum.mul(x[15], y[8]); 1049| 2.20M| z[23] = accum.extract(); 1050| 2.20M| accum.mul(x[9], y[15]); 1051| 2.20M| accum.mul(x[10], y[14]); 1052| 2.20M| accum.mul(x[11], y[13]); 1053| 2.20M| accum.mul(x[12], y[12]); 1054| 2.20M| accum.mul(x[13], y[11]); 1055| 2.20M| accum.mul(x[14], y[10]); 1056| 2.20M| accum.mul(x[15], y[9]); 1057| 2.20M| z[24] = accum.extract(); 1058| 2.20M| accum.mul(x[10], y[15]); 1059| 2.20M| accum.mul(x[11], y[14]); 1060| 2.20M| accum.mul(x[12], y[13]); 1061| 2.20M| accum.mul(x[13], y[12]); 1062| 2.20M| accum.mul(x[14], y[11]); 1063| 2.20M| accum.mul(x[15], y[10]); 1064| 2.20M| z[25] = accum.extract(); 1065| 2.20M| accum.mul(x[11], y[15]); 1066| 2.20M| accum.mul(x[12], y[14]); 1067| 2.20M| accum.mul(x[13], y[13]); 1068| 2.20M| accum.mul(x[14], y[12]); 1069| 2.20M| accum.mul(x[15], y[11]); 1070| 2.20M| z[26] = accum.extract(); 1071| 2.20M| accum.mul(x[12], y[15]); 1072| 2.20M| accum.mul(x[13], y[14]); 1073| 2.20M| accum.mul(x[14], y[13]); 1074| 2.20M| accum.mul(x[15], y[12]); 1075| 2.20M| z[27] = accum.extract(); 1076| 2.20M| accum.mul(x[13], y[15]); 1077| 2.20M| accum.mul(x[14], y[14]); 1078| 2.20M| accum.mul(x[15], y[13]); 1079| 2.20M| z[28] = accum.extract(); 1080| 2.20M| accum.mul(x[14], y[15]); 1081| 2.20M| accum.mul(x[15], y[14]); 1082| 2.20M| z[29] = accum.extract(); 1083| 2.20M| accum.mul(x[15], y[15]); 1084| 2.20M| z[30] = accum.extract(); 1085| 2.20M| z[31] = accum.extract(); 1086| 2.20M|} _ZN5Botan18bigint_comba_sqr24EPmPKm: 1091| 198k|void bigint_comba_sqr24(word z[48], const word x[24]) { 1092| 198k| word3 accum; 1093| | 1094| 198k| accum.mul(x[0], x[0]); 1095| 198k| z[0] = accum.extract(); 1096| 198k| accum.mul_x2(x[0], x[1]); 1097| 198k| z[1] = accum.extract(); 1098| 198k| accum.mul_x2(x[0], x[2]); 1099| 198k| accum.mul(x[1], x[1]); 1100| 198k| z[2] = accum.extract(); 1101| 198k| accum.mul_x2(x[0], x[3]); 1102| 198k| accum.mul_x2(x[1], x[2]); 1103| 198k| z[3] = accum.extract(); 1104| 198k| accum.mul_x2(x[0], x[4]); 1105| 198k| accum.mul_x2(x[1], x[3]); 1106| 198k| accum.mul(x[2], x[2]); 1107| 198k| z[4] = accum.extract(); 1108| 198k| accum.mul_x2(x[0], x[5]); 1109| 198k| accum.mul_x2(x[1], x[4]); 1110| 198k| accum.mul_x2(x[2], x[3]); 1111| 198k| z[5] = accum.extract(); 1112| 198k| accum.mul_x2(x[0], x[6]); 1113| 198k| accum.mul_x2(x[1], x[5]); 1114| 198k| accum.mul_x2(x[2], x[4]); 1115| 198k| accum.mul(x[3], x[3]); 1116| 198k| z[6] = accum.extract(); 1117| 198k| accum.mul_x2(x[0], x[7]); 1118| 198k| accum.mul_x2(x[1], x[6]); 1119| 198k| accum.mul_x2(x[2], x[5]); 1120| 198k| accum.mul_x2(x[3], x[4]); 1121| 198k| z[7] = accum.extract(); 1122| 198k| accum.mul_x2(x[0], x[8]); 1123| 198k| accum.mul_x2(x[1], x[7]); 1124| 198k| accum.mul_x2(x[2], x[6]); 1125| 198k| accum.mul_x2(x[3], x[5]); 1126| 198k| accum.mul(x[4], x[4]); 1127| 198k| z[8] = accum.extract(); 1128| 198k| accum.mul_x2(x[0], x[9]); 1129| 198k| accum.mul_x2(x[1], x[8]); 1130| 198k| accum.mul_x2(x[2], x[7]); 1131| 198k| accum.mul_x2(x[3], x[6]); 1132| 198k| accum.mul_x2(x[4], x[5]); 1133| 198k| z[9] = accum.extract(); 1134| 198k| accum.mul_x2(x[0], x[10]); 1135| 198k| accum.mul_x2(x[1], x[9]); 1136| 198k| accum.mul_x2(x[2], x[8]); 1137| 198k| accum.mul_x2(x[3], x[7]); 1138| 198k| accum.mul_x2(x[4], x[6]); 1139| 198k| accum.mul(x[5], x[5]); 1140| 198k| z[10] = accum.extract(); 1141| 198k| accum.mul_x2(x[0], x[11]); 1142| 198k| accum.mul_x2(x[1], x[10]); 1143| 198k| accum.mul_x2(x[2], x[9]); 1144| 198k| accum.mul_x2(x[3], x[8]); 1145| 198k| accum.mul_x2(x[4], x[7]); 1146| 198k| accum.mul_x2(x[5], x[6]); 1147| 198k| z[11] = accum.extract(); 1148| 198k| accum.mul_x2(x[0], x[12]); 1149| 198k| accum.mul_x2(x[1], x[11]); 1150| 198k| accum.mul_x2(x[2], x[10]); 1151| 198k| accum.mul_x2(x[3], x[9]); 1152| 198k| accum.mul_x2(x[4], x[8]); 1153| 198k| accum.mul_x2(x[5], x[7]); 1154| 198k| accum.mul(x[6], x[6]); 1155| 198k| z[12] = accum.extract(); 1156| 198k| accum.mul_x2(x[0], x[13]); 1157| 198k| accum.mul_x2(x[1], x[12]); 1158| 198k| accum.mul_x2(x[2], x[11]); 1159| 198k| accum.mul_x2(x[3], x[10]); 1160| 198k| accum.mul_x2(x[4], x[9]); 1161| 198k| accum.mul_x2(x[5], x[8]); 1162| 198k| accum.mul_x2(x[6], x[7]); 1163| 198k| z[13] = accum.extract(); 1164| 198k| accum.mul_x2(x[0], x[14]); 1165| 198k| accum.mul_x2(x[1], x[13]); 1166| 198k| accum.mul_x2(x[2], x[12]); 1167| 198k| accum.mul_x2(x[3], x[11]); 1168| 198k| accum.mul_x2(x[4], x[10]); 1169| 198k| accum.mul_x2(x[5], x[9]); 1170| 198k| accum.mul_x2(x[6], x[8]); 1171| 198k| accum.mul(x[7], x[7]); 1172| 198k| z[14] = accum.extract(); 1173| 198k| accum.mul_x2(x[0], x[15]); 1174| 198k| accum.mul_x2(x[1], x[14]); 1175| 198k| accum.mul_x2(x[2], x[13]); 1176| 198k| accum.mul_x2(x[3], x[12]); 1177| 198k| accum.mul_x2(x[4], x[11]); 1178| 198k| accum.mul_x2(x[5], x[10]); 1179| 198k| accum.mul_x2(x[6], x[9]); 1180| 198k| accum.mul_x2(x[7], x[8]); 1181| 198k| z[15] = accum.extract(); 1182| 198k| accum.mul_x2(x[0], x[16]); 1183| 198k| accum.mul_x2(x[1], x[15]); 1184| 198k| accum.mul_x2(x[2], x[14]); 1185| 198k| accum.mul_x2(x[3], x[13]); 1186| 198k| accum.mul_x2(x[4], x[12]); 1187| 198k| accum.mul_x2(x[5], x[11]); 1188| 198k| accum.mul_x2(x[6], x[10]); 1189| 198k| accum.mul_x2(x[7], x[9]); 1190| 198k| accum.mul(x[8], x[8]); 1191| 198k| z[16] = accum.extract(); 1192| 198k| accum.mul_x2(x[0], x[17]); 1193| 198k| accum.mul_x2(x[1], x[16]); 1194| 198k| accum.mul_x2(x[2], x[15]); 1195| 198k| accum.mul_x2(x[3], x[14]); 1196| 198k| accum.mul_x2(x[4], x[13]); 1197| 198k| accum.mul_x2(x[5], x[12]); 1198| 198k| accum.mul_x2(x[6], x[11]); 1199| 198k| accum.mul_x2(x[7], x[10]); 1200| 198k| accum.mul_x2(x[8], x[9]); 1201| 198k| z[17] = accum.extract(); 1202| 198k| accum.mul_x2(x[0], x[18]); 1203| 198k| accum.mul_x2(x[1], x[17]); 1204| 198k| accum.mul_x2(x[2], x[16]); 1205| 198k| accum.mul_x2(x[3], x[15]); 1206| 198k| accum.mul_x2(x[4], x[14]); 1207| 198k| accum.mul_x2(x[5], x[13]); 1208| 198k| accum.mul_x2(x[6], x[12]); 1209| 198k| accum.mul_x2(x[7], x[11]); 1210| 198k| accum.mul_x2(x[8], x[10]); 1211| 198k| accum.mul(x[9], x[9]); 1212| 198k| z[18] = accum.extract(); 1213| 198k| accum.mul_x2(x[0], x[19]); 1214| 198k| accum.mul_x2(x[1], x[18]); 1215| 198k| accum.mul_x2(x[2], x[17]); 1216| 198k| accum.mul_x2(x[3], x[16]); 1217| 198k| accum.mul_x2(x[4], x[15]); 1218| 198k| accum.mul_x2(x[5], x[14]); 1219| 198k| accum.mul_x2(x[6], x[13]); 1220| 198k| accum.mul_x2(x[7], x[12]); 1221| 198k| accum.mul_x2(x[8], x[11]); 1222| 198k| accum.mul_x2(x[9], x[10]); 1223| 198k| z[19] = accum.extract(); 1224| 198k| accum.mul_x2(x[0], x[20]); 1225| 198k| accum.mul_x2(x[1], x[19]); 1226| 198k| accum.mul_x2(x[2], x[18]); 1227| 198k| accum.mul_x2(x[3], x[17]); 1228| 198k| accum.mul_x2(x[4], x[16]); 1229| 198k| accum.mul_x2(x[5], x[15]); 1230| 198k| accum.mul_x2(x[6], x[14]); 1231| 198k| accum.mul_x2(x[7], x[13]); 1232| 198k| accum.mul_x2(x[8], x[12]); 1233| 198k| accum.mul_x2(x[9], x[11]); 1234| 198k| accum.mul(x[10], x[10]); 1235| 198k| z[20] = accum.extract(); 1236| 198k| accum.mul_x2(x[0], x[21]); 1237| 198k| accum.mul_x2(x[1], x[20]); 1238| 198k| accum.mul_x2(x[2], x[19]); 1239| 198k| accum.mul_x2(x[3], x[18]); 1240| 198k| accum.mul_x2(x[4], x[17]); 1241| 198k| accum.mul_x2(x[5], x[16]); 1242| 198k| accum.mul_x2(x[6], x[15]); 1243| 198k| accum.mul_x2(x[7], x[14]); 1244| 198k| accum.mul_x2(x[8], x[13]); 1245| 198k| accum.mul_x2(x[9], x[12]); 1246| 198k| accum.mul_x2(x[10], x[11]); 1247| 198k| z[21] = accum.extract(); 1248| 198k| accum.mul_x2(x[0], x[22]); 1249| 198k| accum.mul_x2(x[1], x[21]); 1250| 198k| accum.mul_x2(x[2], x[20]); 1251| 198k| accum.mul_x2(x[3], x[19]); 1252| 198k| accum.mul_x2(x[4], x[18]); 1253| 198k| accum.mul_x2(x[5], x[17]); 1254| 198k| accum.mul_x2(x[6], x[16]); 1255| 198k| accum.mul_x2(x[7], x[15]); 1256| 198k| accum.mul_x2(x[8], x[14]); 1257| 198k| accum.mul_x2(x[9], x[13]); 1258| 198k| accum.mul_x2(x[10], x[12]); 1259| 198k| accum.mul(x[11], x[11]); 1260| 198k| z[22] = accum.extract(); 1261| 198k| accum.mul_x2(x[0], x[23]); 1262| 198k| accum.mul_x2(x[1], x[22]); 1263| 198k| accum.mul_x2(x[2], x[21]); 1264| 198k| accum.mul_x2(x[3], x[20]); 1265| 198k| accum.mul_x2(x[4], x[19]); 1266| 198k| accum.mul_x2(x[5], x[18]); 1267| 198k| accum.mul_x2(x[6], x[17]); 1268| 198k| accum.mul_x2(x[7], x[16]); 1269| 198k| accum.mul_x2(x[8], x[15]); 1270| 198k| accum.mul_x2(x[9], x[14]); 1271| 198k| accum.mul_x2(x[10], x[13]); 1272| 198k| accum.mul_x2(x[11], x[12]); 1273| 198k| z[23] = accum.extract(); 1274| 198k| accum.mul_x2(x[1], x[23]); 1275| 198k| accum.mul_x2(x[2], x[22]); 1276| 198k| accum.mul_x2(x[3], x[21]); 1277| 198k| accum.mul_x2(x[4], x[20]); 1278| 198k| accum.mul_x2(x[5], x[19]); 1279| 198k| accum.mul_x2(x[6], x[18]); 1280| 198k| accum.mul_x2(x[7], x[17]); 1281| 198k| accum.mul_x2(x[8], x[16]); 1282| 198k| accum.mul_x2(x[9], x[15]); 1283| 198k| accum.mul_x2(x[10], x[14]); 1284| 198k| accum.mul_x2(x[11], x[13]); 1285| 198k| accum.mul(x[12], x[12]); 1286| 198k| z[24] = accum.extract(); 1287| 198k| accum.mul_x2(x[2], x[23]); 1288| 198k| accum.mul_x2(x[3], x[22]); 1289| 198k| accum.mul_x2(x[4], x[21]); 1290| 198k| accum.mul_x2(x[5], x[20]); 1291| 198k| accum.mul_x2(x[6], x[19]); 1292| 198k| accum.mul_x2(x[7], x[18]); 1293| 198k| accum.mul_x2(x[8], x[17]); 1294| 198k| accum.mul_x2(x[9], x[16]); 1295| 198k| accum.mul_x2(x[10], x[15]); 1296| 198k| accum.mul_x2(x[11], x[14]); 1297| 198k| accum.mul_x2(x[12], x[13]); 1298| 198k| z[25] = accum.extract(); 1299| 198k| accum.mul_x2(x[3], x[23]); 1300| 198k| accum.mul_x2(x[4], x[22]); 1301| 198k| accum.mul_x2(x[5], x[21]); 1302| 198k| accum.mul_x2(x[6], x[20]); 1303| 198k| accum.mul_x2(x[7], x[19]); 1304| 198k| accum.mul_x2(x[8], x[18]); 1305| 198k| accum.mul_x2(x[9], x[17]); 1306| 198k| accum.mul_x2(x[10], x[16]); 1307| 198k| accum.mul_x2(x[11], x[15]); 1308| 198k| accum.mul_x2(x[12], x[14]); 1309| 198k| accum.mul(x[13], x[13]); 1310| 198k| z[26] = accum.extract(); 1311| 198k| accum.mul_x2(x[4], x[23]); 1312| 198k| accum.mul_x2(x[5], x[22]); 1313| 198k| accum.mul_x2(x[6], x[21]); 1314| 198k| accum.mul_x2(x[7], x[20]); 1315| 198k| accum.mul_x2(x[8], x[19]); 1316| 198k| accum.mul_x2(x[9], x[18]); 1317| 198k| accum.mul_x2(x[10], x[17]); 1318| 198k| accum.mul_x2(x[11], x[16]); 1319| 198k| accum.mul_x2(x[12], x[15]); 1320| 198k| accum.mul_x2(x[13], x[14]); 1321| 198k| z[27] = accum.extract(); 1322| 198k| accum.mul_x2(x[5], x[23]); 1323| 198k| accum.mul_x2(x[6], x[22]); 1324| 198k| accum.mul_x2(x[7], x[21]); 1325| 198k| accum.mul_x2(x[8], x[20]); 1326| 198k| accum.mul_x2(x[9], x[19]); 1327| 198k| accum.mul_x2(x[10], x[18]); 1328| 198k| accum.mul_x2(x[11], x[17]); 1329| 198k| accum.mul_x2(x[12], x[16]); 1330| 198k| accum.mul_x2(x[13], x[15]); 1331| 198k| accum.mul(x[14], x[14]); 1332| 198k| z[28] = accum.extract(); 1333| 198k| accum.mul_x2(x[6], x[23]); 1334| 198k| accum.mul_x2(x[7], x[22]); 1335| 198k| accum.mul_x2(x[8], x[21]); 1336| 198k| accum.mul_x2(x[9], x[20]); 1337| 198k| accum.mul_x2(x[10], x[19]); 1338| 198k| accum.mul_x2(x[11], x[18]); 1339| 198k| accum.mul_x2(x[12], x[17]); 1340| 198k| accum.mul_x2(x[13], x[16]); 1341| 198k| accum.mul_x2(x[14], x[15]); 1342| 198k| z[29] = accum.extract(); 1343| 198k| accum.mul_x2(x[7], x[23]); 1344| 198k| accum.mul_x2(x[8], x[22]); 1345| 198k| accum.mul_x2(x[9], x[21]); 1346| 198k| accum.mul_x2(x[10], x[20]); 1347| 198k| accum.mul_x2(x[11], x[19]); 1348| 198k| accum.mul_x2(x[12], x[18]); 1349| 198k| accum.mul_x2(x[13], x[17]); 1350| 198k| accum.mul_x2(x[14], x[16]); 1351| 198k| accum.mul(x[15], x[15]); 1352| 198k| z[30] = accum.extract(); 1353| 198k| accum.mul_x2(x[8], x[23]); 1354| 198k| accum.mul_x2(x[9], x[22]); 1355| 198k| accum.mul_x2(x[10], x[21]); 1356| 198k| accum.mul_x2(x[11], x[20]); 1357| 198k| accum.mul_x2(x[12], x[19]); 1358| 198k| accum.mul_x2(x[13], x[18]); 1359| 198k| accum.mul_x2(x[14], x[17]); 1360| 198k| accum.mul_x2(x[15], x[16]); 1361| 198k| z[31] = accum.extract(); 1362| 198k| accum.mul_x2(x[9], x[23]); 1363| 198k| accum.mul_x2(x[10], x[22]); 1364| 198k| accum.mul_x2(x[11], x[21]); 1365| 198k| accum.mul_x2(x[12], x[20]); 1366| 198k| accum.mul_x2(x[13], x[19]); 1367| 198k| accum.mul_x2(x[14], x[18]); 1368| 198k| accum.mul_x2(x[15], x[17]); 1369| 198k| accum.mul(x[16], x[16]); 1370| 198k| z[32] = accum.extract(); 1371| 198k| accum.mul_x2(x[10], x[23]); 1372| 198k| accum.mul_x2(x[11], x[22]); 1373| 198k| accum.mul_x2(x[12], x[21]); 1374| 198k| accum.mul_x2(x[13], x[20]); 1375| 198k| accum.mul_x2(x[14], x[19]); 1376| 198k| accum.mul_x2(x[15], x[18]); 1377| 198k| accum.mul_x2(x[16], x[17]); 1378| 198k| z[33] = accum.extract(); 1379| 198k| accum.mul_x2(x[11], x[23]); 1380| 198k| accum.mul_x2(x[12], x[22]); 1381| 198k| accum.mul_x2(x[13], x[21]); 1382| 198k| accum.mul_x2(x[14], x[20]); 1383| 198k| accum.mul_x2(x[15], x[19]); 1384| 198k| accum.mul_x2(x[16], x[18]); 1385| 198k| accum.mul(x[17], x[17]); 1386| 198k| z[34] = accum.extract(); 1387| 198k| accum.mul_x2(x[12], x[23]); 1388| 198k| accum.mul_x2(x[13], x[22]); 1389| 198k| accum.mul_x2(x[14], x[21]); 1390| 198k| accum.mul_x2(x[15], x[20]); 1391| 198k| accum.mul_x2(x[16], x[19]); 1392| 198k| accum.mul_x2(x[17], x[18]); 1393| 198k| z[35] = accum.extract(); 1394| 198k| accum.mul_x2(x[13], x[23]); 1395| 198k| accum.mul_x2(x[14], x[22]); 1396| 198k| accum.mul_x2(x[15], x[21]); 1397| 198k| accum.mul_x2(x[16], x[20]); 1398| 198k| accum.mul_x2(x[17], x[19]); 1399| 198k| accum.mul(x[18], x[18]); 1400| 198k| z[36] = accum.extract(); 1401| 198k| accum.mul_x2(x[14], x[23]); 1402| 198k| accum.mul_x2(x[15], x[22]); 1403| 198k| accum.mul_x2(x[16], x[21]); 1404| 198k| accum.mul_x2(x[17], x[20]); 1405| 198k| accum.mul_x2(x[18], x[19]); 1406| 198k| z[37] = accum.extract(); 1407| 198k| accum.mul_x2(x[15], x[23]); 1408| 198k| accum.mul_x2(x[16], x[22]); 1409| 198k| accum.mul_x2(x[17], x[21]); 1410| 198k| accum.mul_x2(x[18], x[20]); 1411| 198k| accum.mul(x[19], x[19]); 1412| 198k| z[38] = accum.extract(); 1413| 198k| accum.mul_x2(x[16], x[23]); 1414| 198k| accum.mul_x2(x[17], x[22]); 1415| 198k| accum.mul_x2(x[18], x[21]); 1416| 198k| accum.mul_x2(x[19], x[20]); 1417| 198k| z[39] = accum.extract(); 1418| 198k| accum.mul_x2(x[17], x[23]); 1419| 198k| accum.mul_x2(x[18], x[22]); 1420| 198k| accum.mul_x2(x[19], x[21]); 1421| 198k| accum.mul(x[20], x[20]); 1422| 198k| z[40] = accum.extract(); 1423| 198k| accum.mul_x2(x[18], x[23]); 1424| 198k| accum.mul_x2(x[19], x[22]); 1425| 198k| accum.mul_x2(x[20], x[21]); 1426| 198k| z[41] = accum.extract(); 1427| 198k| accum.mul_x2(x[19], x[23]); 1428| 198k| accum.mul_x2(x[20], x[22]); 1429| 198k| accum.mul(x[21], x[21]); 1430| 198k| z[42] = accum.extract(); 1431| 198k| accum.mul_x2(x[20], x[23]); 1432| 198k| accum.mul_x2(x[21], x[22]); 1433| 198k| z[43] = accum.extract(); 1434| 198k| accum.mul_x2(x[21], x[23]); 1435| 198k| accum.mul(x[22], x[22]); 1436| 198k| z[44] = accum.extract(); 1437| 198k| accum.mul_x2(x[22], x[23]); 1438| 198k| z[45] = accum.extract(); 1439| 198k| accum.mul(x[23], x[23]); 1440| 198k| z[46] = accum.extract(); 1441| 198k| z[47] = accum.extract(); 1442| 198k|} _ZN5Botan18bigint_comba_mul24EPmPKmS2_: 1447| 274k|void bigint_comba_mul24(word z[48], const word x[24], const word y[24]) { 1448| 274k| word3 accum; 1449| | 1450| 274k| accum.mul(x[0], y[0]); 1451| 274k| z[0] = accum.extract(); 1452| 274k| accum.mul(x[0], y[1]); 1453| 274k| accum.mul(x[1], y[0]); 1454| 274k| z[1] = accum.extract(); 1455| 274k| accum.mul(x[0], y[2]); 1456| 274k| accum.mul(x[1], y[1]); 1457| 274k| accum.mul(x[2], y[0]); 1458| 274k| z[2] = accum.extract(); 1459| 274k| accum.mul(x[0], y[3]); 1460| 274k| accum.mul(x[1], y[2]); 1461| 274k| accum.mul(x[2], y[1]); 1462| 274k| accum.mul(x[3], y[0]); 1463| 274k| z[3] = accum.extract(); 1464| 274k| accum.mul(x[0], y[4]); 1465| 274k| accum.mul(x[1], y[3]); 1466| 274k| accum.mul(x[2], y[2]); 1467| 274k| accum.mul(x[3], y[1]); 1468| 274k| accum.mul(x[4], y[0]); 1469| 274k| z[4] = accum.extract(); 1470| 274k| accum.mul(x[0], y[5]); 1471| 274k| accum.mul(x[1], y[4]); 1472| 274k| accum.mul(x[2], y[3]); 1473| 274k| accum.mul(x[3], y[2]); 1474| 274k| accum.mul(x[4], y[1]); 1475| 274k| accum.mul(x[5], y[0]); 1476| 274k| z[5] = accum.extract(); 1477| 274k| accum.mul(x[0], y[6]); 1478| 274k| accum.mul(x[1], y[5]); 1479| 274k| accum.mul(x[2], y[4]); 1480| 274k| accum.mul(x[3], y[3]); 1481| 274k| accum.mul(x[4], y[2]); 1482| 274k| accum.mul(x[5], y[1]); 1483| 274k| accum.mul(x[6], y[0]); 1484| 274k| z[6] = accum.extract(); 1485| 274k| accum.mul(x[0], y[7]); 1486| 274k| accum.mul(x[1], y[6]); 1487| 274k| accum.mul(x[2], y[5]); 1488| 274k| accum.mul(x[3], y[4]); 1489| 274k| accum.mul(x[4], y[3]); 1490| 274k| accum.mul(x[5], y[2]); 1491| 274k| accum.mul(x[6], y[1]); 1492| 274k| accum.mul(x[7], y[0]); 1493| 274k| z[7] = accum.extract(); 1494| 274k| accum.mul(x[0], y[8]); 1495| 274k| accum.mul(x[1], y[7]); 1496| 274k| accum.mul(x[2], y[6]); 1497| 274k| accum.mul(x[3], y[5]); 1498| 274k| accum.mul(x[4], y[4]); 1499| 274k| accum.mul(x[5], y[3]); 1500| 274k| accum.mul(x[6], y[2]); 1501| 274k| accum.mul(x[7], y[1]); 1502| 274k| accum.mul(x[8], y[0]); 1503| 274k| z[8] = accum.extract(); 1504| 274k| accum.mul(x[0], y[9]); 1505| 274k| accum.mul(x[1], y[8]); 1506| 274k| accum.mul(x[2], y[7]); 1507| 274k| accum.mul(x[3], y[6]); 1508| 274k| accum.mul(x[4], y[5]); 1509| 274k| accum.mul(x[5], y[4]); 1510| 274k| accum.mul(x[6], y[3]); 1511| 274k| accum.mul(x[7], y[2]); 1512| 274k| accum.mul(x[8], y[1]); 1513| 274k| accum.mul(x[9], y[0]); 1514| 274k| z[9] = accum.extract(); 1515| 274k| accum.mul(x[0], y[10]); 1516| 274k| accum.mul(x[1], y[9]); 1517| 274k| accum.mul(x[2], y[8]); 1518| 274k| accum.mul(x[3], y[7]); 1519| 274k| accum.mul(x[4], y[6]); 1520| 274k| accum.mul(x[5], y[5]); 1521| 274k| accum.mul(x[6], y[4]); 1522| 274k| accum.mul(x[7], y[3]); 1523| 274k| accum.mul(x[8], y[2]); 1524| 274k| accum.mul(x[9], y[1]); 1525| 274k| accum.mul(x[10], y[0]); 1526| 274k| z[10] = accum.extract(); 1527| 274k| accum.mul(x[0], y[11]); 1528| 274k| accum.mul(x[1], y[10]); 1529| 274k| accum.mul(x[2], y[9]); 1530| 274k| accum.mul(x[3], y[8]); 1531| 274k| accum.mul(x[4], y[7]); 1532| 274k| accum.mul(x[5], y[6]); 1533| 274k| accum.mul(x[6], y[5]); 1534| 274k| accum.mul(x[7], y[4]); 1535| 274k| accum.mul(x[8], y[3]); 1536| 274k| accum.mul(x[9], y[2]); 1537| 274k| accum.mul(x[10], y[1]); 1538| 274k| accum.mul(x[11], y[0]); 1539| 274k| z[11] = accum.extract(); 1540| 274k| accum.mul(x[0], y[12]); 1541| 274k| accum.mul(x[1], y[11]); 1542| 274k| accum.mul(x[2], y[10]); 1543| 274k| accum.mul(x[3], y[9]); 1544| 274k| accum.mul(x[4], y[8]); 1545| 274k| accum.mul(x[5], y[7]); 1546| 274k| accum.mul(x[6], y[6]); 1547| 274k| accum.mul(x[7], y[5]); 1548| 274k| accum.mul(x[8], y[4]); 1549| 274k| accum.mul(x[9], y[3]); 1550| 274k| accum.mul(x[10], y[2]); 1551| 274k| accum.mul(x[11], y[1]); 1552| 274k| accum.mul(x[12], y[0]); 1553| 274k| z[12] = accum.extract(); 1554| 274k| accum.mul(x[0], y[13]); 1555| 274k| accum.mul(x[1], y[12]); 1556| 274k| accum.mul(x[2], y[11]); 1557| 274k| accum.mul(x[3], y[10]); 1558| 274k| accum.mul(x[4], y[9]); 1559| 274k| accum.mul(x[5], y[8]); 1560| 274k| accum.mul(x[6], y[7]); 1561| 274k| accum.mul(x[7], y[6]); 1562| 274k| accum.mul(x[8], y[5]); 1563| 274k| accum.mul(x[9], y[4]); 1564| 274k| accum.mul(x[10], y[3]); 1565| 274k| accum.mul(x[11], y[2]); 1566| 274k| accum.mul(x[12], y[1]); 1567| 274k| accum.mul(x[13], y[0]); 1568| 274k| z[13] = accum.extract(); 1569| 274k| accum.mul(x[0], y[14]); 1570| 274k| accum.mul(x[1], y[13]); 1571| 274k| accum.mul(x[2], y[12]); 1572| 274k| accum.mul(x[3], y[11]); 1573| 274k| accum.mul(x[4], y[10]); 1574| 274k| accum.mul(x[5], y[9]); 1575| 274k| accum.mul(x[6], y[8]); 1576| 274k| accum.mul(x[7], y[7]); 1577| 274k| accum.mul(x[8], y[6]); 1578| 274k| accum.mul(x[9], y[5]); 1579| 274k| accum.mul(x[10], y[4]); 1580| 274k| accum.mul(x[11], y[3]); 1581| 274k| accum.mul(x[12], y[2]); 1582| 274k| accum.mul(x[13], y[1]); 1583| 274k| accum.mul(x[14], y[0]); 1584| 274k| z[14] = accum.extract(); 1585| 274k| accum.mul(x[0], y[15]); 1586| 274k| accum.mul(x[1], y[14]); 1587| 274k| accum.mul(x[2], y[13]); 1588| 274k| accum.mul(x[3], y[12]); 1589| 274k| accum.mul(x[4], y[11]); 1590| 274k| accum.mul(x[5], y[10]); 1591| 274k| accum.mul(x[6], y[9]); 1592| 274k| accum.mul(x[7], y[8]); 1593| 274k| accum.mul(x[8], y[7]); 1594| 274k| accum.mul(x[9], y[6]); 1595| 274k| accum.mul(x[10], y[5]); 1596| 274k| accum.mul(x[11], y[4]); 1597| 274k| accum.mul(x[12], y[3]); 1598| 274k| accum.mul(x[13], y[2]); 1599| 274k| accum.mul(x[14], y[1]); 1600| 274k| accum.mul(x[15], y[0]); 1601| 274k| z[15] = accum.extract(); 1602| 274k| accum.mul(x[0], y[16]); 1603| 274k| accum.mul(x[1], y[15]); 1604| 274k| accum.mul(x[2], y[14]); 1605| 274k| accum.mul(x[3], y[13]); 1606| 274k| accum.mul(x[4], y[12]); 1607| 274k| accum.mul(x[5], y[11]); 1608| 274k| accum.mul(x[6], y[10]); 1609| 274k| accum.mul(x[7], y[9]); 1610| 274k| accum.mul(x[8], y[8]); 1611| 274k| accum.mul(x[9], y[7]); 1612| 274k| accum.mul(x[10], y[6]); 1613| 274k| accum.mul(x[11], y[5]); 1614| 274k| accum.mul(x[12], y[4]); 1615| 274k| accum.mul(x[13], y[3]); 1616| 274k| accum.mul(x[14], y[2]); 1617| 274k| accum.mul(x[15], y[1]); 1618| 274k| accum.mul(x[16], y[0]); 1619| 274k| z[16] = accum.extract(); 1620| 274k| accum.mul(x[0], y[17]); 1621| 274k| accum.mul(x[1], y[16]); 1622| 274k| accum.mul(x[2], y[15]); 1623| 274k| accum.mul(x[3], y[14]); 1624| 274k| accum.mul(x[4], y[13]); 1625| 274k| accum.mul(x[5], y[12]); 1626| 274k| accum.mul(x[6], y[11]); 1627| 274k| accum.mul(x[7], y[10]); 1628| 274k| accum.mul(x[8], y[9]); 1629| 274k| accum.mul(x[9], y[8]); 1630| 274k| accum.mul(x[10], y[7]); 1631| 274k| accum.mul(x[11], y[6]); 1632| 274k| accum.mul(x[12], y[5]); 1633| 274k| accum.mul(x[13], y[4]); 1634| 274k| accum.mul(x[14], y[3]); 1635| 274k| accum.mul(x[15], y[2]); 1636| 274k| accum.mul(x[16], y[1]); 1637| 274k| accum.mul(x[17], y[0]); 1638| 274k| z[17] = accum.extract(); 1639| 274k| accum.mul(x[0], y[18]); 1640| 274k| accum.mul(x[1], y[17]); 1641| 274k| accum.mul(x[2], y[16]); 1642| 274k| accum.mul(x[3], y[15]); 1643| 274k| accum.mul(x[4], y[14]); 1644| 274k| accum.mul(x[5], y[13]); 1645| 274k| accum.mul(x[6], y[12]); 1646| 274k| accum.mul(x[7], y[11]); 1647| 274k| accum.mul(x[8], y[10]); 1648| 274k| accum.mul(x[9], y[9]); 1649| 274k| accum.mul(x[10], y[8]); 1650| 274k| accum.mul(x[11], y[7]); 1651| 274k| accum.mul(x[12], y[6]); 1652| 274k| accum.mul(x[13], y[5]); 1653| 274k| accum.mul(x[14], y[4]); 1654| 274k| accum.mul(x[15], y[3]); 1655| 274k| accum.mul(x[16], y[2]); 1656| 274k| accum.mul(x[17], y[1]); 1657| 274k| accum.mul(x[18], y[0]); 1658| 274k| z[18] = accum.extract(); 1659| 274k| accum.mul(x[0], y[19]); 1660| 274k| accum.mul(x[1], y[18]); 1661| 274k| accum.mul(x[2], y[17]); 1662| 274k| accum.mul(x[3], y[16]); 1663| 274k| accum.mul(x[4], y[15]); 1664| 274k| accum.mul(x[5], y[14]); 1665| 274k| accum.mul(x[6], y[13]); 1666| 274k| accum.mul(x[7], y[12]); 1667| 274k| accum.mul(x[8], y[11]); 1668| 274k| accum.mul(x[9], y[10]); 1669| 274k| accum.mul(x[10], y[9]); 1670| 274k| accum.mul(x[11], y[8]); 1671| 274k| accum.mul(x[12], y[7]); 1672| 274k| accum.mul(x[13], y[6]); 1673| 274k| accum.mul(x[14], y[5]); 1674| 274k| accum.mul(x[15], y[4]); 1675| 274k| accum.mul(x[16], y[3]); 1676| 274k| accum.mul(x[17], y[2]); 1677| 274k| accum.mul(x[18], y[1]); 1678| 274k| accum.mul(x[19], y[0]); 1679| 274k| z[19] = accum.extract(); 1680| 274k| accum.mul(x[0], y[20]); 1681| 274k| accum.mul(x[1], y[19]); 1682| 274k| accum.mul(x[2], y[18]); 1683| 274k| accum.mul(x[3], y[17]); 1684| 274k| accum.mul(x[4], y[16]); 1685| 274k| accum.mul(x[5], y[15]); 1686| 274k| accum.mul(x[6], y[14]); 1687| 274k| accum.mul(x[7], y[13]); 1688| 274k| accum.mul(x[8], y[12]); 1689| 274k| accum.mul(x[9], y[11]); 1690| 274k| accum.mul(x[10], y[10]); 1691| 274k| accum.mul(x[11], y[9]); 1692| 274k| accum.mul(x[12], y[8]); 1693| 274k| accum.mul(x[13], y[7]); 1694| 274k| accum.mul(x[14], y[6]); 1695| 274k| accum.mul(x[15], y[5]); 1696| 274k| accum.mul(x[16], y[4]); 1697| 274k| accum.mul(x[17], y[3]); 1698| 274k| accum.mul(x[18], y[2]); 1699| 274k| accum.mul(x[19], y[1]); 1700| 274k| accum.mul(x[20], y[0]); 1701| 274k| z[20] = accum.extract(); 1702| 274k| accum.mul(x[0], y[21]); 1703| 274k| accum.mul(x[1], y[20]); 1704| 274k| accum.mul(x[2], y[19]); 1705| 274k| accum.mul(x[3], y[18]); 1706| 274k| accum.mul(x[4], y[17]); 1707| 274k| accum.mul(x[5], y[16]); 1708| 274k| accum.mul(x[6], y[15]); 1709| 274k| accum.mul(x[7], y[14]); 1710| 274k| accum.mul(x[8], y[13]); 1711| 274k| accum.mul(x[9], y[12]); 1712| 274k| accum.mul(x[10], y[11]); 1713| 274k| accum.mul(x[11], y[10]); 1714| 274k| accum.mul(x[12], y[9]); 1715| 274k| accum.mul(x[13], y[8]); 1716| 274k| accum.mul(x[14], y[7]); 1717| 274k| accum.mul(x[15], y[6]); 1718| 274k| accum.mul(x[16], y[5]); 1719| 274k| accum.mul(x[17], y[4]); 1720| 274k| accum.mul(x[18], y[3]); 1721| 274k| accum.mul(x[19], y[2]); 1722| 274k| accum.mul(x[20], y[1]); 1723| 274k| accum.mul(x[21], y[0]); 1724| 274k| z[21] = accum.extract(); 1725| 274k| accum.mul(x[0], y[22]); 1726| 274k| accum.mul(x[1], y[21]); 1727| 274k| accum.mul(x[2], y[20]); 1728| 274k| accum.mul(x[3], y[19]); 1729| 274k| accum.mul(x[4], y[18]); 1730| 274k| accum.mul(x[5], y[17]); 1731| 274k| accum.mul(x[6], y[16]); 1732| 274k| accum.mul(x[7], y[15]); 1733| 274k| accum.mul(x[8], y[14]); 1734| 274k| accum.mul(x[9], y[13]); 1735| 274k| accum.mul(x[10], y[12]); 1736| 274k| accum.mul(x[11], y[11]); 1737| 274k| accum.mul(x[12], y[10]); 1738| 274k| accum.mul(x[13], y[9]); 1739| 274k| accum.mul(x[14], y[8]); 1740| 274k| accum.mul(x[15], y[7]); 1741| 274k| accum.mul(x[16], y[6]); 1742| 274k| accum.mul(x[17], y[5]); 1743| 274k| accum.mul(x[18], y[4]); 1744| 274k| accum.mul(x[19], y[3]); 1745| 274k| accum.mul(x[20], y[2]); 1746| 274k| accum.mul(x[21], y[1]); 1747| 274k| accum.mul(x[22], y[0]); 1748| 274k| z[22] = accum.extract(); 1749| 274k| accum.mul(x[0], y[23]); 1750| 274k| accum.mul(x[1], y[22]); 1751| 274k| accum.mul(x[2], y[21]); 1752| 274k| accum.mul(x[3], y[20]); 1753| 274k| accum.mul(x[4], y[19]); 1754| 274k| accum.mul(x[5], y[18]); 1755| 274k| accum.mul(x[6], y[17]); 1756| 274k| accum.mul(x[7], y[16]); 1757| 274k| accum.mul(x[8], y[15]); 1758| 274k| accum.mul(x[9], y[14]); 1759| 274k| accum.mul(x[10], y[13]); 1760| 274k| accum.mul(x[11], y[12]); 1761| 274k| accum.mul(x[12], y[11]); 1762| 274k| accum.mul(x[13], y[10]); 1763| 274k| accum.mul(x[14], y[9]); 1764| 274k| accum.mul(x[15], y[8]); 1765| 274k| accum.mul(x[16], y[7]); 1766| 274k| accum.mul(x[17], y[6]); 1767| 274k| accum.mul(x[18], y[5]); 1768| 274k| accum.mul(x[19], y[4]); 1769| 274k| accum.mul(x[20], y[3]); 1770| 274k| accum.mul(x[21], y[2]); 1771| 274k| accum.mul(x[22], y[1]); 1772| 274k| accum.mul(x[23], y[0]); 1773| 274k| z[23] = accum.extract(); 1774| 274k| accum.mul(x[1], y[23]); 1775| 274k| accum.mul(x[2], y[22]); 1776| 274k| accum.mul(x[3], y[21]); 1777| 274k| accum.mul(x[4], y[20]); 1778| 274k| accum.mul(x[5], y[19]); 1779| 274k| accum.mul(x[6], y[18]); 1780| 274k| accum.mul(x[7], y[17]); 1781| 274k| accum.mul(x[8], y[16]); 1782| 274k| accum.mul(x[9], y[15]); 1783| 274k| accum.mul(x[10], y[14]); 1784| 274k| accum.mul(x[11], y[13]); 1785| 274k| accum.mul(x[12], y[12]); 1786| 274k| accum.mul(x[13], y[11]); 1787| 274k| accum.mul(x[14], y[10]); 1788| 274k| accum.mul(x[15], y[9]); 1789| 274k| accum.mul(x[16], y[8]); 1790| 274k| accum.mul(x[17], y[7]); 1791| 274k| accum.mul(x[18], y[6]); 1792| 274k| accum.mul(x[19], y[5]); 1793| 274k| accum.mul(x[20], y[4]); 1794| 274k| accum.mul(x[21], y[3]); 1795| 274k| accum.mul(x[22], y[2]); 1796| 274k| accum.mul(x[23], y[1]); 1797| 274k| z[24] = accum.extract(); 1798| 274k| accum.mul(x[2], y[23]); 1799| 274k| accum.mul(x[3], y[22]); 1800| 274k| accum.mul(x[4], y[21]); 1801| 274k| accum.mul(x[5], y[20]); 1802| 274k| accum.mul(x[6], y[19]); 1803| 274k| accum.mul(x[7], y[18]); 1804| 274k| accum.mul(x[8], y[17]); 1805| 274k| accum.mul(x[9], y[16]); 1806| 274k| accum.mul(x[10], y[15]); 1807| 274k| accum.mul(x[11], y[14]); 1808| 274k| accum.mul(x[12], y[13]); 1809| 274k| accum.mul(x[13], y[12]); 1810| 274k| accum.mul(x[14], y[11]); 1811| 274k| accum.mul(x[15], y[10]); 1812| 274k| accum.mul(x[16], y[9]); 1813| 274k| accum.mul(x[17], y[8]); 1814| 274k| accum.mul(x[18], y[7]); 1815| 274k| accum.mul(x[19], y[6]); 1816| 274k| accum.mul(x[20], y[5]); 1817| 274k| accum.mul(x[21], y[4]); 1818| 274k| accum.mul(x[22], y[3]); 1819| 274k| accum.mul(x[23], y[2]); 1820| 274k| z[25] = accum.extract(); 1821| 274k| accum.mul(x[3], y[23]); 1822| 274k| accum.mul(x[4], y[22]); 1823| 274k| accum.mul(x[5], y[21]); 1824| 274k| accum.mul(x[6], y[20]); 1825| 274k| accum.mul(x[7], y[19]); 1826| 274k| accum.mul(x[8], y[18]); 1827| 274k| accum.mul(x[9], y[17]); 1828| 274k| accum.mul(x[10], y[16]); 1829| 274k| accum.mul(x[11], y[15]); 1830| 274k| accum.mul(x[12], y[14]); 1831| 274k| accum.mul(x[13], y[13]); 1832| 274k| accum.mul(x[14], y[12]); 1833| 274k| accum.mul(x[15], y[11]); 1834| 274k| accum.mul(x[16], y[10]); 1835| 274k| accum.mul(x[17], y[9]); 1836| 274k| accum.mul(x[18], y[8]); 1837| 274k| accum.mul(x[19], y[7]); 1838| 274k| accum.mul(x[20], y[6]); 1839| 274k| accum.mul(x[21], y[5]); 1840| 274k| accum.mul(x[22], y[4]); 1841| 274k| accum.mul(x[23], y[3]); 1842| 274k| z[26] = accum.extract(); 1843| 274k| accum.mul(x[4], y[23]); 1844| 274k| accum.mul(x[5], y[22]); 1845| 274k| accum.mul(x[6], y[21]); 1846| 274k| accum.mul(x[7], y[20]); 1847| 274k| accum.mul(x[8], y[19]); 1848| 274k| accum.mul(x[9], y[18]); 1849| 274k| accum.mul(x[10], y[17]); 1850| 274k| accum.mul(x[11], y[16]); 1851| 274k| accum.mul(x[12], y[15]); 1852| 274k| accum.mul(x[13], y[14]); 1853| 274k| accum.mul(x[14], y[13]); 1854| 274k| accum.mul(x[15], y[12]); 1855| 274k| accum.mul(x[16], y[11]); 1856| 274k| accum.mul(x[17], y[10]); 1857| 274k| accum.mul(x[18], y[9]); 1858| 274k| accum.mul(x[19], y[8]); 1859| 274k| accum.mul(x[20], y[7]); 1860| 274k| accum.mul(x[21], y[6]); 1861| 274k| accum.mul(x[22], y[5]); 1862| 274k| accum.mul(x[23], y[4]); 1863| 274k| z[27] = accum.extract(); 1864| 274k| accum.mul(x[5], y[23]); 1865| 274k| accum.mul(x[6], y[22]); 1866| 274k| accum.mul(x[7], y[21]); 1867| 274k| accum.mul(x[8], y[20]); 1868| 274k| accum.mul(x[9], y[19]); 1869| 274k| accum.mul(x[10], y[18]); 1870| 274k| accum.mul(x[11], y[17]); 1871| 274k| accum.mul(x[12], y[16]); 1872| 274k| accum.mul(x[13], y[15]); 1873| 274k| accum.mul(x[14], y[14]); 1874| 274k| accum.mul(x[15], y[13]); 1875| 274k| accum.mul(x[16], y[12]); 1876| 274k| accum.mul(x[17], y[11]); 1877| 274k| accum.mul(x[18], y[10]); 1878| 274k| accum.mul(x[19], y[9]); 1879| 274k| accum.mul(x[20], y[8]); 1880| 274k| accum.mul(x[21], y[7]); 1881| 274k| accum.mul(x[22], y[6]); 1882| 274k| accum.mul(x[23], y[5]); 1883| 274k| z[28] = accum.extract(); 1884| 274k| accum.mul(x[6], y[23]); 1885| 274k| accum.mul(x[7], y[22]); 1886| 274k| accum.mul(x[8], y[21]); 1887| 274k| accum.mul(x[9], y[20]); 1888| 274k| accum.mul(x[10], y[19]); 1889| 274k| accum.mul(x[11], y[18]); 1890| 274k| accum.mul(x[12], y[17]); 1891| 274k| accum.mul(x[13], y[16]); 1892| 274k| accum.mul(x[14], y[15]); 1893| 274k| accum.mul(x[15], y[14]); 1894| 274k| accum.mul(x[16], y[13]); 1895| 274k| accum.mul(x[17], y[12]); 1896| 274k| accum.mul(x[18], y[11]); 1897| 274k| accum.mul(x[19], y[10]); 1898| 274k| accum.mul(x[20], y[9]); 1899| 274k| accum.mul(x[21], y[8]); 1900| 274k| accum.mul(x[22], y[7]); 1901| 274k| accum.mul(x[23], y[6]); 1902| 274k| z[29] = accum.extract(); 1903| 274k| accum.mul(x[7], y[23]); 1904| 274k| accum.mul(x[8], y[22]); 1905| 274k| accum.mul(x[9], y[21]); 1906| 274k| accum.mul(x[10], y[20]); 1907| 274k| accum.mul(x[11], y[19]); 1908| 274k| accum.mul(x[12], y[18]); 1909| 274k| accum.mul(x[13], y[17]); 1910| 274k| accum.mul(x[14], y[16]); 1911| 274k| accum.mul(x[15], y[15]); 1912| 274k| accum.mul(x[16], y[14]); 1913| 274k| accum.mul(x[17], y[13]); 1914| 274k| accum.mul(x[18], y[12]); 1915| 274k| accum.mul(x[19], y[11]); 1916| 274k| accum.mul(x[20], y[10]); 1917| 274k| accum.mul(x[21], y[9]); 1918| 274k| accum.mul(x[22], y[8]); 1919| 274k| accum.mul(x[23], y[7]); 1920| 274k| z[30] = accum.extract(); 1921| 274k| accum.mul(x[8], y[23]); 1922| 274k| accum.mul(x[9], y[22]); 1923| 274k| accum.mul(x[10], y[21]); 1924| 274k| accum.mul(x[11], y[20]); 1925| 274k| accum.mul(x[12], y[19]); 1926| 274k| accum.mul(x[13], y[18]); 1927| 274k| accum.mul(x[14], y[17]); 1928| 274k| accum.mul(x[15], y[16]); 1929| 274k| accum.mul(x[16], y[15]); 1930| 274k| accum.mul(x[17], y[14]); 1931| 274k| accum.mul(x[18], y[13]); 1932| 274k| accum.mul(x[19], y[12]); 1933| 274k| accum.mul(x[20], y[11]); 1934| 274k| accum.mul(x[21], y[10]); 1935| 274k| accum.mul(x[22], y[9]); 1936| 274k| accum.mul(x[23], y[8]); 1937| 274k| z[31] = accum.extract(); 1938| 274k| accum.mul(x[9], y[23]); 1939| 274k| accum.mul(x[10], y[22]); 1940| 274k| accum.mul(x[11], y[21]); 1941| 274k| accum.mul(x[12], y[20]); 1942| 274k| accum.mul(x[13], y[19]); 1943| 274k| accum.mul(x[14], y[18]); 1944| 274k| accum.mul(x[15], y[17]); 1945| 274k| accum.mul(x[16], y[16]); 1946| 274k| accum.mul(x[17], y[15]); 1947| 274k| accum.mul(x[18], y[14]); 1948| 274k| accum.mul(x[19], y[13]); 1949| 274k| accum.mul(x[20], y[12]); 1950| 274k| accum.mul(x[21], y[11]); 1951| 274k| accum.mul(x[22], y[10]); 1952| 274k| accum.mul(x[23], y[9]); 1953| 274k| z[32] = accum.extract(); 1954| 274k| accum.mul(x[10], y[23]); 1955| 274k| accum.mul(x[11], y[22]); 1956| 274k| accum.mul(x[12], y[21]); 1957| 274k| accum.mul(x[13], y[20]); 1958| 274k| accum.mul(x[14], y[19]); 1959| 274k| accum.mul(x[15], y[18]); 1960| 274k| accum.mul(x[16], y[17]); 1961| 274k| accum.mul(x[17], y[16]); 1962| 274k| accum.mul(x[18], y[15]); 1963| 274k| accum.mul(x[19], y[14]); 1964| 274k| accum.mul(x[20], y[13]); 1965| 274k| accum.mul(x[21], y[12]); 1966| 274k| accum.mul(x[22], y[11]); 1967| 274k| accum.mul(x[23], y[10]); 1968| 274k| z[33] = accum.extract(); 1969| 274k| accum.mul(x[11], y[23]); 1970| 274k| accum.mul(x[12], y[22]); 1971| 274k| accum.mul(x[13], y[21]); 1972| 274k| accum.mul(x[14], y[20]); 1973| 274k| accum.mul(x[15], y[19]); 1974| 274k| accum.mul(x[16], y[18]); 1975| 274k| accum.mul(x[17], y[17]); 1976| 274k| accum.mul(x[18], y[16]); 1977| 274k| accum.mul(x[19], y[15]); 1978| 274k| accum.mul(x[20], y[14]); 1979| 274k| accum.mul(x[21], y[13]); 1980| 274k| accum.mul(x[22], y[12]); 1981| 274k| accum.mul(x[23], y[11]); 1982| 274k| z[34] = accum.extract(); 1983| 274k| accum.mul(x[12], y[23]); 1984| 274k| accum.mul(x[13], y[22]); 1985| 274k| accum.mul(x[14], y[21]); 1986| 274k| accum.mul(x[15], y[20]); 1987| 274k| accum.mul(x[16], y[19]); 1988| 274k| accum.mul(x[17], y[18]); 1989| 274k| accum.mul(x[18], y[17]); 1990| 274k| accum.mul(x[19], y[16]); 1991| 274k| accum.mul(x[20], y[15]); 1992| 274k| accum.mul(x[21], y[14]); 1993| 274k| accum.mul(x[22], y[13]); 1994| 274k| accum.mul(x[23], y[12]); 1995| 274k| z[35] = accum.extract(); 1996| 274k| accum.mul(x[13], y[23]); 1997| 274k| accum.mul(x[14], y[22]); 1998| 274k| accum.mul(x[15], y[21]); 1999| 274k| accum.mul(x[16], y[20]); 2000| 274k| accum.mul(x[17], y[19]); 2001| 274k| accum.mul(x[18], y[18]); 2002| 274k| accum.mul(x[19], y[17]); 2003| 274k| accum.mul(x[20], y[16]); 2004| 274k| accum.mul(x[21], y[15]); 2005| 274k| accum.mul(x[22], y[14]); 2006| 274k| accum.mul(x[23], y[13]); 2007| 274k| z[36] = accum.extract(); 2008| 274k| accum.mul(x[14], y[23]); 2009| 274k| accum.mul(x[15], y[22]); 2010| 274k| accum.mul(x[16], y[21]); 2011| 274k| accum.mul(x[17], y[20]); 2012| 274k| accum.mul(x[18], y[19]); 2013| 274k| accum.mul(x[19], y[18]); 2014| 274k| accum.mul(x[20], y[17]); 2015| 274k| accum.mul(x[21], y[16]); 2016| 274k| accum.mul(x[22], y[15]); 2017| 274k| accum.mul(x[23], y[14]); 2018| 274k| z[37] = accum.extract(); 2019| 274k| accum.mul(x[15], y[23]); 2020| 274k| accum.mul(x[16], y[22]); 2021| 274k| accum.mul(x[17], y[21]); 2022| 274k| accum.mul(x[18], y[20]); 2023| 274k| accum.mul(x[19], y[19]); 2024| 274k| accum.mul(x[20], y[18]); 2025| 274k| accum.mul(x[21], y[17]); 2026| 274k| accum.mul(x[22], y[16]); 2027| 274k| accum.mul(x[23], y[15]); 2028| 274k| z[38] = accum.extract(); 2029| 274k| accum.mul(x[16], y[23]); 2030| 274k| accum.mul(x[17], y[22]); 2031| 274k| accum.mul(x[18], y[21]); 2032| 274k| accum.mul(x[19], y[20]); 2033| 274k| accum.mul(x[20], y[19]); 2034| 274k| accum.mul(x[21], y[18]); 2035| 274k| accum.mul(x[22], y[17]); 2036| 274k| accum.mul(x[23], y[16]); 2037| 274k| z[39] = accum.extract(); 2038| 274k| accum.mul(x[17], y[23]); 2039| 274k| accum.mul(x[18], y[22]); 2040| 274k| accum.mul(x[19], y[21]); 2041| 274k| accum.mul(x[20], y[20]); 2042| 274k| accum.mul(x[21], y[19]); 2043| 274k| accum.mul(x[22], y[18]); 2044| 274k| accum.mul(x[23], y[17]); 2045| 274k| z[40] = accum.extract(); 2046| 274k| accum.mul(x[18], y[23]); 2047| 274k| accum.mul(x[19], y[22]); 2048| 274k| accum.mul(x[20], y[21]); 2049| 274k| accum.mul(x[21], y[20]); 2050| 274k| accum.mul(x[22], y[19]); 2051| 274k| accum.mul(x[23], y[18]); 2052| 274k| z[41] = accum.extract(); 2053| 274k| accum.mul(x[19], y[23]); 2054| 274k| accum.mul(x[20], y[22]); 2055| 274k| accum.mul(x[21], y[21]); 2056| 274k| accum.mul(x[22], y[20]); 2057| 274k| accum.mul(x[23], y[19]); 2058| 274k| z[42] = accum.extract(); 2059| 274k| accum.mul(x[20], y[23]); 2060| 274k| accum.mul(x[21], y[22]); 2061| 274k| accum.mul(x[22], y[21]); 2062| 274k| accum.mul(x[23], y[20]); 2063| 274k| z[43] = accum.extract(); 2064| 274k| accum.mul(x[21], y[23]); 2065| 274k| accum.mul(x[22], y[22]); 2066| 274k| accum.mul(x[23], y[21]); 2067| 274k| z[44] = accum.extract(); 2068| 274k| accum.mul(x[22], y[23]); 2069| 274k| accum.mul(x[23], y[22]); 2070| 274k| z[45] = accum.extract(); 2071| 274k| accum.mul(x[23], y[23]); 2072| 274k| z[46] = accum.extract(); 2073| 274k| z[47] = accum.extract(); 2074| 274k|} _ZN5Botan12basecase_mulEPmmPKmmS2_m: 20| 8.06M|void basecase_mul(word z[], size_t z_size, const word x[], size_t x_size, const word y[], size_t y_size) { 21| 8.06M| if(z_size < x_size + y_size) { ------------------ | Branch (21:7): [True: 0, False: 8.06M] ------------------ 22| 0| throw Invalid_Argument("basecase_mul z_size too small"); 23| 0| } 24| | 25| 8.06M| const size_t x_size_8 = x_size - (x_size % 8); 26| | 27| 8.06M| zeroize_buffer(z, z_size); 28| | 29| 171M| for(size_t i = 0; i != y_size; ++i) { ------------------ | Branch (29:22): [True: 163M, False: 8.06M] ------------------ 30| 163M| const word y_i = y[i]; 31| | 32| 163M| word carry = 0; 33| | 34| 563M| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (34:25): [True: 399M, False: 163M] ------------------ 35| 399M| carry = word8_madd3(z + i + j, x + j, y_i, carry); 36| 399M| } 37| | 38| 576M| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (38:32): [True: 413M, False: 163M] ------------------ 39| 413M| z[i + j] = word_madd3(x[j], y_i, z[i + j], &carry); 40| 413M| } 41| | 42| 163M| z[x_size + i] = carry; 43| 163M| } 44| 8.06M|} _ZN5Botan12basecase_sqrEPmmPKmm: 46| 6.56M|void basecase_sqr(word z[], size_t z_size, const word x[], size_t x_size) { 47| 6.56M| if(z_size < 2 * x_size) { ------------------ | Branch (47:7): [True: 0, False: 6.56M] ------------------ 48| 0| throw Invalid_Argument("basecase_sqr z_size too small"); 49| 0| } 50| | 51| 6.56M| const size_t x_size_8 = x_size - (x_size % 8); 52| | 53| 6.56M| zeroize_buffer(z, z_size); 54| | 55| 184M| for(size_t i = 0; i != x_size; ++i) { ------------------ | Branch (55:22): [True: 177M, False: 6.56M] ------------------ 56| 177M| const word x_i = x[i]; 57| | 58| 177M| word carry = 0; 59| | 60| 793M| for(size_t j = 0; j != x_size_8; j += 8) { ------------------ | Branch (60:25): [True: 615M, False: 177M] ------------------ 61| 615M| carry = word8_madd3(z + i + j, x + j, x_i, carry); 62| 615M| } 63| | 64| 730M| for(size_t j = x_size_8; j != x_size; ++j) { ------------------ | Branch (64:32): [True: 552M, False: 177M] ------------------ 65| 552M| z[i + j] = word_madd3(x[j], x_i, z[i + j], &carry); 66| 552M| } 67| | 68| 177M| z[x_size + i] = carry; 69| 177M| } 70| 6.56M|} _ZN5Botan10bigint_mulEPmmPKmmmS2_mmS0_m: 292| 3.99M| size_t ws_size) { 293| 3.99M| zeroize_buffer(z, z_size); 294| | 295| 3.99M| if(x_sw == 1) { ------------------ | Branch (295:7): [True: 0, False: 3.99M] ------------------ 296| 0| bigint_linmul3(z, y, y_sw, x[0]); 297| 3.99M| } else if(y_sw == 1) { ------------------ | Branch (297:14): [True: 0, False: 3.99M] ------------------ 298| 0| bigint_linmul3(z, x, x_sw, y[0]); 299| 3.99M| } else if(sized_for_comba_mul<4>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (299:14): [True: 5.43k, False: 3.98M] ------------------ 300| 5.43k| bigint_comba_mul4(z, x, y); 301| 3.98M| } else if(sized_for_comba_mul<6>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (301:14): [True: 39, False: 3.98M] ------------------ 302| 39| bigint_comba_mul6(z, x, y); 303| 3.98M| } else if(sized_for_comba_mul<8>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (303:14): [True: 54, False: 3.98M] ------------------ 304| 54| bigint_comba_mul8(z, x, y); 305| 3.98M| } else if(sized_for_comba_mul<9>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (305:14): [True: 7, False: 3.98M] ------------------ 306| 7| bigint_comba_mul9(z, x, y); 307| 3.98M| } else if(sized_for_comba_mul<16>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (307:14): [True: 80, False: 3.98M] ------------------ 308| 80| bigint_comba_mul16(z, x, y); 309| 3.98M| } else if(sized_for_comba_mul<24>(x_sw, x_size, y_sw, y_size, z_size)) { ------------------ | Branch (309:14): [True: 20, False: 3.98M] ------------------ 310| 20| bigint_comba_mul24(z, x, y); 311| 3.98M| } else if(x_sw < KARATSUBA_MULTIPLY_THRESHOLD || y_sw < KARATSUBA_MULTIPLY_THRESHOLD || workspace == nullptr) { ------------------ | Branch (311:14): [True: 74.5k, False: 3.91M] | Branch (311:53): [True: 55.8k, False: 3.85M] | Branch (311:92): [True: 0, False: 3.85M] ------------------ 312| 130k| basecase_mul(z, z_size, x, x_sw, y, y_sw); 313| 3.85M| } else { 314| 3.85M| const size_t N = karatsuba_size(z_size, x_size, x_sw, y_size, y_sw); 315| | 316| 3.85M| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (316:10): [True: 3.28M, False: 576k] | Branch (316:19): [True: 3.28M, False: 0] | Branch (316:38): [True: 3.28M, False: 0] ------------------ 317| 3.28M| karatsuba_mul(z, x, y, N, workspace); 318| 3.28M| } else { 319| 576k| basecase_mul(z, z_size, x, x_sw, y, y_sw); 320| 576k| } 321| 3.85M| } 322| 3.99M|} _ZN5Botan10bigint_sqrEPmmPKmmmS0_m: 327| 6.57M|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| 6.57M| zeroize_buffer(z, z_size); 329| | 330| 6.57M| BOTAN_ASSERT(z_size / 2 >= x_sw, "Output size is sufficient"); ------------------ | | 64| 6.57M| do { \ | | 65| 6.57M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 6.57M| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 6.57M] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 6.57M| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 6.57M] | | ------------------ ------------------ 331| | 332| 6.57M| if(x_sw == 1) { ------------------ | Branch (332:7): [True: 0, False: 6.57M] ------------------ 333| 0| bigint_linmul3(z, x, x_sw, x[0]); 334| 6.57M| } else if(sized_for_comba_sqr<4>(x_sw, x_size, z_size)) { ------------------ | Branch (334:14): [True: 1.55k, False: 6.57M] ------------------ 335| 1.55k| bigint_comba_sqr4(z, x); 336| 6.57M| } else if(sized_for_comba_sqr<6>(x_sw, x_size, z_size)) { ------------------ | Branch (336:14): [True: 3, False: 6.57M] ------------------ 337| 3| bigint_comba_sqr6(z, x); 338| 6.57M| } else if(sized_for_comba_sqr<8>(x_sw, x_size, z_size)) { ------------------ | Branch (338:14): [True: 76, False: 6.57M] ------------------ 339| 76| bigint_comba_sqr8(z, x); 340| 6.57M| } else if(sized_for_comba_sqr<9>(x_sw, x_size, z_size)) { ------------------ | Branch (340:14): [True: 3, False: 6.57M] ------------------ 341| 3| bigint_comba_sqr9(z, x); 342| 6.57M| } else if(sized_for_comba_sqr<16>(x_sw, x_size, z_size)) { ------------------ | Branch (342:14): [True: 0, False: 6.57M] ------------------ 343| 0| bigint_comba_sqr16(z, x); 344| 6.57M| } else if(sized_for_comba_sqr<24>(x_sw, x_size, z_size)) { ------------------ | Branch (344:14): [True: 0, False: 6.57M] ------------------ 345| 0| bigint_comba_sqr24(z, x); 346| 6.57M| } else if(x_size < KARATSUBA_SQUARE_THRESHOLD || workspace == nullptr) { ------------------ | Branch (346:14): [True: 7.41k, False: 6.56M] | Branch (346:53): [True: 0, False: 6.56M] ------------------ 347| 7.41k| basecase_sqr(z, z_size, x, x_sw); 348| 6.56M| } else { 349| 6.56M| const size_t N = karatsuba_size(z_size, x_size, x_sw); 350| | 351| 6.56M| if(N > 0 && z_size >= 2 * N && ws_size >= 2 * N) { ------------------ | Branch (351:10): [True: 4.26M, False: 2.30M] | Branch (351:19): [True: 4.26M, False: 0] | Branch (351:38): [True: 4.26M, False: 0] ------------------ 352| 4.26M| karatsuba_sqr(z, x, N, workspace); 353| 4.26M| } else { 354| 2.30M| basecase_sqr(z, z_size, x, x_sw); 355| 2.30M| } 356| 6.56M| } 357| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmmmm: 203| 3.85M|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw, size_t y_size, size_t y_sw) { 204| 3.85M| if(x_sw > x_size || x_sw > y_size || y_sw > x_size || y_sw > y_size) { ------------------ | Branch (204:7): [True: 0, False: 3.85M] | Branch (204:24): [True: 0, False: 3.85M] | Branch (204:41): [True: 0, False: 3.85M] | Branch (204:58): [True: 0, False: 3.85M] ------------------ 205| 0| return 0; 206| 0| } 207| | 208| 3.85M| if(((x_size == x_sw) && (x_size % 2 != 0)) || ((y_size == y_sw) && (y_size % 2 != 0))) { ------------------ | Branch (208:8): [True: 1.53M, False: 2.32M] | Branch (208:28): [True: 522k, False: 1.01M] | Branch (208:51): [True: 1.01M, False: 2.32M] | Branch (208:71): [True: 0, False: 1.01M] ------------------ 209| 522k| return 0; 210| 522k| } 211| | 212| 3.33M| const size_t start = (x_sw > y_sw) ? x_sw : y_sw; ------------------ | Branch (212:25): [True: 1.09M, False: 2.24M] ------------------ 213| 3.33M| const size_t end = (x_size < y_size) ? x_size : y_size; ------------------ | Branch (213:23): [True: 1.90M, False: 1.42M] ------------------ 214| | 215| 3.33M| if(start == end) { ------------------ | Branch (215:7): [True: 1.01M, False: 2.32M] ------------------ 216| 1.01M| if(start % 2 != 0) { ------------------ | Branch (216:10): [True: 0, False: 1.01M] ------------------ 217| 0| return 0; 218| 0| } 219| 1.01M| return start; 220| 1.01M| } 221| | 222| 3.68M| for(size_t j = start; j <= end; ++j) { ------------------ | Branch (222:26): [True: 3.68M, False: 0] ------------------ 223| 3.68M| if(j % 2 != 0) { ------------------ | Branch (223:10): [True: 1.36M, False: 2.32M] ------------------ 224| 1.36M| continue; 225| 1.36M| } 226| | 227| 2.32M| if(2 * j > z_size) { ------------------ | Branch (227:10): [True: 53.8k, False: 2.26M] ------------------ 228| 53.8k| return 0; 229| 53.8k| } 230| | 231| 2.26M| if(x_sw <= j && j <= x_size && y_sw <= j && j <= y_size) { ------------------ | Branch (231:10): [True: 2.26M, False: 0] | Branch (231:23): [True: 2.26M, False: 0] | Branch (231:38): [True: 2.26M, False: 0] | Branch (231:51): [True: 2.26M, False: 0] ------------------ 232| 2.26M| if(j % 4 == 2 && (j + 2) <= x_size && (j + 2) <= y_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (232:13): [True: 1.60M, False: 661k] | Branch (232:27): [True: 1.10M, False: 498k] | Branch (232:48): [True: 1.10M, False: 0] | Branch (232:69): [True: 0, False: 1.10M] ------------------ 233| 0| return j + 2; 234| 0| } 235| 2.26M| return j; 236| 2.26M| } 237| 2.26M| } 238| | 239| 0| return 0; 240| 2.32M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_mulEPmPKmS3_mS1_: 80| 13.1M|void karatsuba_mul(word z[], const word x[], const word y[], size_t N, word workspace[]) { 81| 13.1M| if(N < KARATSUBA_MULTIPLY_THRESHOLD || N % 2 != 0) { ------------------ | Branch (81:7): [True: 9.84M, False: 3.28M] | Branch (81:43): [True: 0, False: 3.28M] ------------------ 82| 9.84M| switch(N) { 83| 0| case 6: ------------------ | Branch (83:10): [True: 0, False: 9.84M] ------------------ 84| 0| return bigint_comba_mul6(z, x, y); 85| 0| case 8: ------------------ | Branch (85:10): [True: 0, False: 9.84M] ------------------ 86| 0| return bigint_comba_mul8(z, x, y); 87| 0| case 9: ------------------ | Branch (87:10): [True: 0, False: 9.84M] ------------------ 88| 0| return bigint_comba_mul9(z, x, y); 89| 2.20M| case 16: ------------------ | Branch (89:10): [True: 2.20M, False: 7.63M] ------------------ 90| 2.20M| return bigint_comba_mul16(z, x, y); 91| 274k| case 24: ------------------ | Branch (91:10): [True: 274k, False: 9.56M] ------------------ 92| 274k| return bigint_comba_mul24(z, x, y); 93| 7.35M| default: ------------------ | Branch (93:10): [True: 7.35M, False: 2.48M] ------------------ 94| 7.35M| return basecase_mul(z, 2 * N, x, N, y, N); 95| 9.84M| } 96| 9.84M| } 97| | 98| 3.28M| const size_t N2 = N / 2; 99| | 100| 3.28M| const word* x0 = x; 101| 3.28M| const word* x1 = x + N2; 102| 3.28M| const word* y0 = y; 103| 3.28M| const word* y1 = y + N2; 104| 3.28M| word* z0 = z; 105| 3.28M| word* z1 = z + N; 106| | 107| 3.28M| word* ws0 = workspace; 108| 3.28M| word* ws1 = workspace + N; 109| | 110| 3.28M| zeroize_buffer(workspace, 2 * N); 111| | 112| | /* 113| | * If either of cmp0 or cmp1 is zero then z0 or z1 resp is zero here, 114| | * resulting in a no-op - z0*z1 will be equal to zero so we don't need to do 115| | * anything, zeroize_buffer above already set the correct result. 116| | * 117| | * However we ignore the result of the comparisons and always perform the 118| | * subtractions and recursively multiply to avoid the timing channel. 119| | */ 120| | 121| | // First compute (X_lo - X_hi)*(Y_hi - Y_lo) 122| 3.28M| const auto cmp0 = bigint_sub_abs(z0, x0, x1, N2, workspace); 123| 3.28M| const auto cmp1 = bigint_sub_abs(z1, y1, y0, N2, workspace); 124| 3.28M| const auto neg_mask = ~(cmp0 ^ cmp1); 125| | 126| 3.28M| karatsuba_mul(ws0, z0, z1, N2, ws1); 127| | 128| | // Compute X_lo * Y_lo 129| 3.28M| karatsuba_mul(z0, x0, y0, N2, ws1); 130| | 131| | // Compute X_hi * Y_hi 132| 3.28M| karatsuba_mul(z1, x1, y1, N2, ws1); 133| | 134| 3.28M| const word ws_carry = bigint_add3(ws1, z0, N, z1, N); 135| 3.28M| word z_carry = bigint_add2(z + N2, N, ws1, N); 136| | 137| 3.28M| z_carry += bigint_add2(z + N + N2, N2, &ws_carry, 1); 138| 3.28M| bigint_add2(z + N + N2, N2, &z_carry, 1); 139| | 140| 3.28M| zeroize_buffer(workspace + N, N2); 141| | 142| 3.28M| bigint_cnd_add(neg_mask.value(), z + N2, workspace, 2 * N - N2); 143| 3.28M| bigint_cnd_sub((~neg_mask).value(), z + N2, workspace, 2 * N - N2); 144| 3.28M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_114karatsuba_sizeEmmm: 245| 6.56M|size_t karatsuba_size(size_t z_size, size_t x_size, size_t x_sw) { 246| 6.56M| if(x_sw == x_size) { ------------------ | Branch (246:7): [True: 6.06M, False: 498k] ------------------ 247| 6.06M| if(x_sw % 2 != 0) { ------------------ | Branch (247:10): [True: 2.06M, False: 3.99M] ------------------ 248| 2.06M| return 0; 249| 2.06M| } 250| 3.99M| return x_sw; 251| 6.06M| } 252| | 253| 731k| for(size_t j = x_sw; j <= x_size; ++j) { ------------------ | Branch (253:25): [True: 731k, False: 0] ------------------ 254| 731k| if(j % 2 != 0) { ------------------ | Branch (254:10): [True: 232k, False: 498k] ------------------ 255| 232k| continue; 256| 232k| } 257| | 258| 498k| if(2 * j > z_size) { ------------------ | Branch (258:10): [True: 232k, False: 266k] ------------------ 259| 232k| return 0; 260| 232k| } 261| | 262| 266k| if(j % 4 == 2 && (j + 2) <= x_size && 2 * (j + 2) <= z_size) { ------------------ | Branch (262:10): [True: 89.3k, False: 177k] | Branch (262:24): [True: 89.3k, False: 0] | Branch (262:45): [True: 0, False: 89.3k] ------------------ 263| 0| return j + 2; 264| 0| } 265| 266k| return j; 266| 266k| } 267| | 268| 0| return 0; 269| 498k|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_113karatsuba_sqrEPmPKmmS1_: 149| 17.0M|void karatsuba_sqr(word z[], const word x[], size_t N, word workspace[]) { 150| 17.0M| if(N < KARATSUBA_SQUARE_THRESHOLD || N % 2 != 0) { ------------------ | Branch (150:7): [True: 12.7M, False: 4.26M] | Branch (150:41): [True: 0, False: 4.26M] ------------------ 151| 12.7M| switch(N) { 152| 0| case 6: ------------------ | Branch (152:10): [True: 0, False: 12.7M] ------------------ 153| 0| return bigint_comba_sqr6(z, x); 154| 0| case 8: ------------------ | Branch (154:10): [True: 0, False: 12.7M] ------------------ 155| 0| return bigint_comba_sqr8(z, x); 156| 0| case 9: ------------------ | Branch (156:10): [True: 0, False: 12.7M] ------------------ 157| 0| return bigint_comba_sqr9(z, x); 158| 8.34M| case 16: ------------------ | Branch (158:10): [True: 8.34M, False: 4.45M] ------------------ 159| 8.34M| return bigint_comba_sqr16(z, x); 160| 198k| case 24: ------------------ | Branch (160:10): [True: 198k, False: 12.6M] ------------------ 161| 198k| return bigint_comba_sqr24(z, x); 162| 4.26M| default: ------------------ | Branch (162:10): [True: 4.26M, False: 8.53M] ------------------ 163| 4.26M| return basecase_sqr(z, 2 * N, x, N); 164| 12.7M| } 165| 12.7M| } 166| | 167| 4.26M| const size_t N2 = N / 2; 168| | 169| 4.26M| const word* x0 = x; 170| 4.26M| const word* x1 = x + N2; 171| 4.26M| word* z0 = z; 172| 4.26M| word* z1 = z + N; 173| | 174| 4.26M| word* ws0 = workspace; 175| 4.26M| word* ws1 = workspace + N; 176| | 177| 4.26M| zeroize_buffer(workspace, 2 * N); 178| | 179| | // See comment in karatsuba_mul 180| 4.26M| bigint_sub_abs(z0, x0, x1, N2, workspace); 181| 4.26M| karatsuba_sqr(ws0, z0, N2, ws1); 182| | 183| 4.26M| karatsuba_sqr(z0, x0, N2, ws1); 184| 4.26M| karatsuba_sqr(z1, x1, N2, ws1); 185| | 186| 4.26M| const word ws_carry = bigint_add3(ws1, z0, N, z1, N); 187| 4.26M| word z_carry = bigint_add2(z + N2, N, ws1, N); 188| | 189| 4.26M| z_carry += bigint_add2(z + N + N2, N2, &ws_carry, 1); 190| 4.26M| bigint_add2(z + N + N2, N2, &z_carry, 1); 191| | 192| | /* 193| | * This is only actually required if cmp (result of bigint_sub_abs) is != 0, 194| | * however if cmp==0 then ws0[0:N] == 0 and avoiding the jump hides a 195| | * timing channel. 196| | */ 197| 4.26M| bigint_sub2(z + N2, 2 * N - N2, ws0, N); 198| 4.26M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm4EEEbmmmmm: 272| 3.99M|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| 3.99M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 24.0k, False: 3.96M] | Branch (273:26): [True: 8.35k, False: 15.7k] | Branch (273:42): [True: 8.35k, False: 0] | Branch (273:56): [True: 6.81k, False: 1.53k] | Branch (273:72): [True: 5.43k, False: 1.38k] ------------------ 274| 3.99M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm6EEEbmmmmm: 272| 3.98M|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| 3.98M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 18.6k, False: 3.96M] | Branch (273:26): [True: 2.95k, False: 15.7k] | Branch (273:42): [True: 2.95k, False: 0] | Branch (273:56): [True: 1.42k, False: 1.53k] | Branch (273:72): [True: 39, False: 1.38k] ------------------ 274| 3.98M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm8EEEbmmmmm: 272| 3.98M|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| 3.98M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 74.5k, False: 3.91M] | Branch (273:26): [True: 57.7k, False: 16.7k] | Branch (273:42): [True: 1.88k, False: 55.8k] | Branch (273:56): [True: 562, False: 1.32k] | Branch (273:72): [True: 54, False: 508] ------------------ 274| 3.98M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm9EEEbmmmmm: 272| 3.98M|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| 3.98M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 74.5k, False: 3.91M] | Branch (273:26): [True: 628, False: 73.8k] | Branch (273:42): [True: 628, False: 0] | Branch (273:56): [True: 133, False: 495] | Branch (273:72): [True: 7, False: 126] ------------------ 274| 3.98M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm16EEEbmmmmm: 272| 3.98M|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| 3.98M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 74.6k, False: 3.91M] | Branch (273:26): [True: 88, False: 74.5k] | Branch (273:42): [True: 88, False: 0] | Branch (273:56): [True: 88, False: 0] | Branch (273:72): [True: 80, False: 8] ------------------ 274| 3.98M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_mulILm24EEEbmmmmm: 272| 3.98M|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| 3.98M| return (x_sw <= SZ && x_size >= SZ && y_sw <= SZ && y_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (273:12): [True: 74.5k, False: 3.91M] | Branch (273:26): [True: 20, False: 74.5k] | Branch (273:42): [True: 20, False: 0] | Branch (273:56): [True: 20, False: 0] | Branch (273:72): [True: 20, False: 0] ------------------ 274| 3.98M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm4EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 8.96k, False: 6.56M] | Branch (278:26): [True: 2.52k, False: 6.43k] | Branch (278:42): [True: 1.55k, False: 977] ------------------ 279| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm6EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 7.41k, False: 6.56M] | Branch (278:26): [True: 980, False: 6.43k] | Branch (278:42): [True: 3, False: 977] ------------------ 279| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm8EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 7.49k, False: 6.56M] | Branch (278:26): [True: 910, False: 6.58k] | Branch (278:42): [True: 76, False: 834] ------------------ 279| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm9EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 7.41k, False: 6.56M] | Branch (278:26): [True: 460, False: 6.95k] | Branch (278:42): [True: 3, False: 457] ------------------ 279| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm16EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 7.41k, False: 6.56M] | Branch (278:26): [True: 0, False: 7.41k] | Branch (278:42): [True: 0, False: 0] ------------------ 279| 6.57M|} mp_karat.cpp:_ZN5Botan12_GLOBAL__N_119sized_for_comba_sqrILm24EEEbmmm: 277| 6.57M|inline bool sized_for_comba_sqr(size_t x_sw, size_t x_size, size_t z_size) { 278| 6.57M| return (x_sw <= SZ && x_size >= SZ && z_size >= 2 * SZ); ------------------ | Branch (278:12): [True: 7.41k, False: 6.56M] | Branch (278:26): [True: 0, False: 7.41k] | Branch (278:42): [True: 0, False: 0] ------------------ 279| 6.57M|} _ZN5Botan25bigint_monty_redc_genericEPmPKmmS2_mmS0_: 91| 4.26M| word r[], const word z[], size_t z_size, const word p[], size_t p_size, word p_dash, word ws[]) { 92| 4.26M| BOTAN_ARG_CHECK(z_size >= 2 * p_size && p_size > 0, "Invalid sizes for bigint_monty_redc_generic"); ------------------ | | 35| 4.26M| do { \ | | 36| 4.26M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 8.52M| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 4.26M, False: 0] | | | Branch (37:12): [True: 4.26M, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 4.26M| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 4.26M] | | ------------------ ------------------ 93| | 94| 4.26M| word3 accum; 95| | 96| 4.26M| accum.add(z[0]); 97| | 98| 4.26M| ws[0] = accum.monty_step(p[0], p_dash); 99| | 100| 171M| for(size_t i = 1; i != p_size; ++i) { ------------------ | Branch (100:22): [True: 166M, False: 4.26M] ------------------ 101| 166M| mul_rev_range(accum, ws, p, i); 102| 166M| accum.add(z[i]); 103| 166M| ws[i] = accum.monty_step(p[0], p_dash); 104| 166M| } 105| | 106| 171M| for(size_t i = 0; i != p_size - 1; ++i) { ------------------ | Branch (106:22): [True: 166M, False: 4.26M] ------------------ 107| 166M| mul_rev_range(accum, &ws[i + 1], &p[i], p_size - (i + 1)); 108| 166M| accum.add(z[p_size + i]); 109| 166M| ws[i] = accum.extract(); 110| 166M| } 111| | 112| 4.26M| accum.add(z[2 * p_size - 1]); 113| | 114| 4.26M| ws[p_size - 1] = accum.extract(); 115| | // w1 is the final part, which is not stored in the workspace 116| 4.26M| const word w1 = accum.extract(); 117| | 118| | /* 119| | * The result might need to be reduced mod p. To avoid a timing 120| | * channel, always perform the subtraction. If in the computation 121| | * of x - p a borrow is required then x was already < p. 122| | * 123| | * x starts at ws[0] and is p_size bytes long plus a possible high 124| | * digit left over in w1. 125| | * 126| | * x - p starts at z[0] and is also p_size bytes long 127| | * 128| | * If borrow was set after the subtraction, then x was already less 129| | * than p and the subtraction was not needed. In that case overwrite 130| | * z[0:p_size] with the original x in ws[0:p_size]. 131| | * 132| | * We only copy out p_size in the final step because we know 133| | * the Montgomery result is < P 134| | */ 135| | 136| 4.26M| bigint_monty_maybe_sub(p_size, r, w1, ws, p); 137| 4.26M|} mp_monty.cpp:_ZN5Botan12_GLOBAL__N_113mul_rev_rangeERNS_5word3ImEEPKmS5_m: 18| 333M|BOTAN_FORCE_INLINE void mul_rev_range(word3& accum, const word ws[], const word p[], size_t bound) { 19| | /* 20| | Unrolled version of: 21| | 22| | for(size_t i = 0; i < bound; ++i) { 23| | accum.mul(ws[i], p[bound - i]); 24| | } 25| | */ 26| | 27| 333M| size_t lower = 0; 28| 1.27G| while(lower < bound) { ------------------ | Branch (28:10): [True: 936M, False: 333M] ------------------ 29| 936M| const size_t upper = bound - lower; 30| | 31| 936M| if(upper >= 16) { ------------------ | Branch (31:10): [True: 282M, False: 653M] ------------------ 32| 282M| accum.mul(ws[lower], p[upper]); 33| 282M| accum.mul(ws[lower + 1], p[upper - 1]); 34| 282M| accum.mul(ws[lower + 2], p[upper - 2]); 35| 282M| accum.mul(ws[lower + 3], p[upper - 3]); 36| 282M| accum.mul(ws[lower + 4], p[upper - 4]); 37| 282M| accum.mul(ws[lower + 5], p[upper - 5]); 38| 282M| accum.mul(ws[lower + 6], p[upper - 6]); 39| 282M| accum.mul(ws[lower + 7], p[upper - 7]); 40| 282M| accum.mul(ws[lower + 8], p[upper - 8]); 41| 282M| accum.mul(ws[lower + 9], p[upper - 9]); 42| 282M| accum.mul(ws[lower + 10], p[upper - 10]); 43| 282M| accum.mul(ws[lower + 11], p[upper - 11]); 44| 282M| accum.mul(ws[lower + 12], p[upper - 12]); 45| 282M| accum.mul(ws[lower + 13], p[upper - 13]); 46| 282M| accum.mul(ws[lower + 14], p[upper - 14]); 47| 282M| accum.mul(ws[lower + 15], p[upper - 15]); 48| 282M| lower += 16; 49| 653M| } else if(upper >= 8) { ------------------ | Branch (49:17): [True: 155M, False: 497M] ------------------ 50| 155M| accum.mul(ws[lower], p[upper]); 51| 155M| accum.mul(ws[lower + 1], p[upper - 1]); 52| 155M| accum.mul(ws[lower + 2], p[upper - 2]); 53| 155M| accum.mul(ws[lower + 3], p[upper - 3]); 54| 155M| accum.mul(ws[lower + 4], p[upper - 4]); 55| 155M| accum.mul(ws[lower + 5], p[upper - 5]); 56| 155M| accum.mul(ws[lower + 6], p[upper - 6]); 57| 155M| accum.mul(ws[lower + 7], p[upper - 7]); 58| 155M| lower += 8; 59| 497M| } else if(upper >= 4) { ------------------ | Branch (59:17): [True: 162M, False: 335M] ------------------ 60| 162M| accum.mul(ws[lower], p[upper]); 61| 162M| accum.mul(ws[lower + 1], p[upper - 1]); 62| 162M| accum.mul(ws[lower + 2], p[upper - 2]); 63| 162M| accum.mul(ws[lower + 3], p[upper - 3]); 64| 162M| lower += 4; 65| 335M| } else if(upper >= 2) { ------------------ | Branch (65:17): [True: 166M, False: 168M] ------------------ 66| 166M| accum.mul(ws[lower], p[upper]); 67| 166M| accum.mul(ws[lower + 1], p[upper - 1]); 68| 166M| lower += 2; 69| 168M| } else { 70| 168M| accum.mul(ws[lower], p[upper]); 71| 168M| lower += 1; 72| 168M| } 73| 936M| } 74| 333M|} _ZN5Botan19bigint_monty_redc_4EPmPKmS2_mS0_: 12| 8|void bigint_monty_redc_4(word r[4], const word z[8], const word p[4], word p_dash, word ws[4]) { 13| 8| word3 accum; 14| 8| accum.add(z[0]); 15| 8| ws[0] = accum.monty_step(p[0], p_dash); 16| 8| accum.mul(ws[0], p[1]); 17| 8| accum.add(z[1]); 18| 8| ws[1] = accum.monty_step(p[0], p_dash); 19| 8| accum.mul(ws[0], p[2]); 20| 8| accum.mul(ws[1], p[1]); 21| 8| accum.add(z[2]); 22| 8| ws[2] = accum.monty_step(p[0], p_dash); 23| 8| accum.mul(ws[0], p[3]); 24| 8| accum.mul(ws[1], p[2]); 25| 8| accum.mul(ws[2], p[1]); 26| 8| accum.add(z[3]); 27| 8| ws[3] = accum.monty_step(p[0], p_dash); 28| 8| accum.mul(ws[1], p[3]); 29| 8| accum.mul(ws[2], p[2]); 30| 8| accum.mul(ws[3], p[1]); 31| 8| accum.add(z[4]); 32| 8| ws[0] = accum.extract(); 33| 8| accum.mul(ws[2], p[3]); 34| 8| accum.mul(ws[3], p[2]); 35| 8| accum.add(z[5]); 36| 8| ws[1] = accum.extract(); 37| 8| accum.mul(ws[3], p[3]); 38| 8| accum.add(z[6]); 39| 8| ws[2] = accum.extract(); 40| 8| accum.add(z[7]); 41| 8| ws[3] = accum.extract(); 42| 8| const word w1 = accum.extract(); 43| 8| bigint_monty_maybe_sub<4>(r, w1, ws, p); 44| 8|} _ZN5Botan19bigint_monty_redc_6EPmPKmS2_mS0_: 46| 4|void bigint_monty_redc_6(word r[6], const word z[12], const word p[6], word p_dash, word ws[6]) { 47| 4| word3 accum; 48| 4| accum.add(z[0]); 49| 4| ws[0] = accum.monty_step(p[0], p_dash); 50| 4| accum.mul(ws[0], p[1]); 51| 4| accum.add(z[1]); 52| 4| ws[1] = accum.monty_step(p[0], p_dash); 53| 4| accum.mul(ws[0], p[2]); 54| 4| accum.mul(ws[1], p[1]); 55| 4| accum.add(z[2]); 56| 4| ws[2] = accum.monty_step(p[0], p_dash); 57| 4| accum.mul(ws[0], p[3]); 58| 4| accum.mul(ws[1], p[2]); 59| 4| accum.mul(ws[2], p[1]); 60| 4| accum.add(z[3]); 61| 4| ws[3] = accum.monty_step(p[0], p_dash); 62| 4| accum.mul(ws[0], p[4]); 63| 4| accum.mul(ws[1], p[3]); 64| 4| accum.mul(ws[2], p[2]); 65| 4| accum.mul(ws[3], p[1]); 66| 4| accum.add(z[4]); 67| 4| ws[4] = accum.monty_step(p[0], p_dash); 68| 4| accum.mul(ws[0], p[5]); 69| 4| accum.mul(ws[1], p[4]); 70| 4| accum.mul(ws[2], p[3]); 71| 4| accum.mul(ws[3], p[2]); 72| 4| accum.mul(ws[4], p[1]); 73| 4| accum.add(z[5]); 74| 4| ws[5] = accum.monty_step(p[0], p_dash); 75| 4| accum.mul(ws[1], p[5]); 76| 4| accum.mul(ws[2], p[4]); 77| 4| accum.mul(ws[3], p[3]); 78| 4| accum.mul(ws[4], p[2]); 79| 4| accum.mul(ws[5], p[1]); 80| 4| accum.add(z[6]); 81| 4| ws[0] = accum.extract(); 82| 4| accum.mul(ws[2], p[5]); 83| 4| accum.mul(ws[3], p[4]); 84| 4| accum.mul(ws[4], p[3]); 85| 4| accum.mul(ws[5], p[2]); 86| 4| accum.add(z[7]); 87| 4| ws[1] = accum.extract(); 88| 4| accum.mul(ws[3], p[5]); 89| 4| accum.mul(ws[4], p[4]); 90| 4| accum.mul(ws[5], p[3]); 91| 4| accum.add(z[8]); 92| 4| ws[2] = accum.extract(); 93| 4| accum.mul(ws[4], p[5]); 94| 4| accum.mul(ws[5], p[4]); 95| 4| accum.add(z[9]); 96| 4| ws[3] = accum.extract(); 97| 4| accum.mul(ws[5], p[5]); 98| 4| accum.add(z[10]); 99| 4| ws[4] = accum.extract(); 100| 4| accum.add(z[11]); 101| 4| ws[5] = accum.extract(); 102| 4| const word w1 = accum.extract(); 103| 4| bigint_monty_maybe_sub<6>(r, w1, ws, p); 104| 4|} _ZN5Botan20bigint_monty_redc_32EPmPKmS2_mS0_: 1350| 3.38M|void bigint_monty_redc_32(word r[32], const word z[64], const word p[32], word p_dash, word ws[32]) { 1351| 3.38M| word3 accum; 1352| 3.38M| accum.add(z[0]); 1353| 3.38M| ws[0] = accum.monty_step(p[0], p_dash); 1354| 3.38M| accum.mul(ws[0], p[1]); 1355| 3.38M| accum.add(z[1]); 1356| 3.38M| ws[1] = accum.monty_step(p[0], p_dash); 1357| 3.38M| accum.mul(ws[0], p[2]); 1358| 3.38M| accum.mul(ws[1], p[1]); 1359| 3.38M| accum.add(z[2]); 1360| 3.38M| ws[2] = accum.monty_step(p[0], p_dash); 1361| 3.38M| accum.mul(ws[0], p[3]); 1362| 3.38M| accum.mul(ws[1], p[2]); 1363| 3.38M| accum.mul(ws[2], p[1]); 1364| 3.38M| accum.add(z[3]); 1365| 3.38M| ws[3] = accum.monty_step(p[0], p_dash); 1366| 3.38M| accum.mul(ws[0], p[4]); 1367| 3.38M| accum.mul(ws[1], p[3]); 1368| 3.38M| accum.mul(ws[2], p[2]); 1369| 3.38M| accum.mul(ws[3], p[1]); 1370| 3.38M| accum.add(z[4]); 1371| 3.38M| ws[4] = accum.monty_step(p[0], p_dash); 1372| 3.38M| accum.mul(ws[0], p[5]); 1373| 3.38M| accum.mul(ws[1], p[4]); 1374| 3.38M| accum.mul(ws[2], p[3]); 1375| 3.38M| accum.mul(ws[3], p[2]); 1376| 3.38M| accum.mul(ws[4], p[1]); 1377| 3.38M| accum.add(z[5]); 1378| 3.38M| ws[5] = accum.monty_step(p[0], p_dash); 1379| 3.38M| accum.mul(ws[0], p[6]); 1380| 3.38M| accum.mul(ws[1], p[5]); 1381| 3.38M| accum.mul(ws[2], p[4]); 1382| 3.38M| accum.mul(ws[3], p[3]); 1383| 3.38M| accum.mul(ws[4], p[2]); 1384| 3.38M| accum.mul(ws[5], p[1]); 1385| 3.38M| accum.add(z[6]); 1386| 3.38M| ws[6] = accum.monty_step(p[0], p_dash); 1387| 3.38M| accum.mul(ws[0], p[7]); 1388| 3.38M| accum.mul(ws[1], p[6]); 1389| 3.38M| accum.mul(ws[2], p[5]); 1390| 3.38M| accum.mul(ws[3], p[4]); 1391| 3.38M| accum.mul(ws[4], p[3]); 1392| 3.38M| accum.mul(ws[5], p[2]); 1393| 3.38M| accum.mul(ws[6], p[1]); 1394| 3.38M| accum.add(z[7]); 1395| 3.38M| ws[7] = accum.monty_step(p[0], p_dash); 1396| 3.38M| accum.mul(ws[0], p[8]); 1397| 3.38M| accum.mul(ws[1], p[7]); 1398| 3.38M| accum.mul(ws[2], p[6]); 1399| 3.38M| accum.mul(ws[3], p[5]); 1400| 3.38M| accum.mul(ws[4], p[4]); 1401| 3.38M| accum.mul(ws[5], p[3]); 1402| 3.38M| accum.mul(ws[6], p[2]); 1403| 3.38M| accum.mul(ws[7], p[1]); 1404| 3.38M| accum.add(z[8]); 1405| 3.38M| ws[8] = accum.monty_step(p[0], p_dash); 1406| 3.38M| accum.mul(ws[0], p[9]); 1407| 3.38M| accum.mul(ws[1], p[8]); 1408| 3.38M| accum.mul(ws[2], p[7]); 1409| 3.38M| accum.mul(ws[3], p[6]); 1410| 3.38M| accum.mul(ws[4], p[5]); 1411| 3.38M| accum.mul(ws[5], p[4]); 1412| 3.38M| accum.mul(ws[6], p[3]); 1413| 3.38M| accum.mul(ws[7], p[2]); 1414| 3.38M| accum.mul(ws[8], p[1]); 1415| 3.38M| accum.add(z[9]); 1416| 3.38M| ws[9] = accum.monty_step(p[0], p_dash); 1417| 3.38M| accum.mul(ws[0], p[10]); 1418| 3.38M| accum.mul(ws[1], p[9]); 1419| 3.38M| accum.mul(ws[2], p[8]); 1420| 3.38M| accum.mul(ws[3], p[7]); 1421| 3.38M| accum.mul(ws[4], p[6]); 1422| 3.38M| accum.mul(ws[5], p[5]); 1423| 3.38M| accum.mul(ws[6], p[4]); 1424| 3.38M| accum.mul(ws[7], p[3]); 1425| 3.38M| accum.mul(ws[8], p[2]); 1426| 3.38M| accum.mul(ws[9], p[1]); 1427| 3.38M| accum.add(z[10]); 1428| 3.38M| ws[10] = accum.monty_step(p[0], p_dash); 1429| 3.38M| accum.mul(ws[0], p[11]); 1430| 3.38M| accum.mul(ws[1], p[10]); 1431| 3.38M| accum.mul(ws[2], p[9]); 1432| 3.38M| accum.mul(ws[3], p[8]); 1433| 3.38M| accum.mul(ws[4], p[7]); 1434| 3.38M| accum.mul(ws[5], p[6]); 1435| 3.38M| accum.mul(ws[6], p[5]); 1436| 3.38M| accum.mul(ws[7], p[4]); 1437| 3.38M| accum.mul(ws[8], p[3]); 1438| 3.38M| accum.mul(ws[9], p[2]); 1439| 3.38M| accum.mul(ws[10], p[1]); 1440| 3.38M| accum.add(z[11]); 1441| 3.38M| ws[11] = accum.monty_step(p[0], p_dash); 1442| 3.38M| accum.mul(ws[0], p[12]); 1443| 3.38M| accum.mul(ws[1], p[11]); 1444| 3.38M| accum.mul(ws[2], p[10]); 1445| 3.38M| accum.mul(ws[3], p[9]); 1446| 3.38M| accum.mul(ws[4], p[8]); 1447| 3.38M| accum.mul(ws[5], p[7]); 1448| 3.38M| accum.mul(ws[6], p[6]); 1449| 3.38M| accum.mul(ws[7], p[5]); 1450| 3.38M| accum.mul(ws[8], p[4]); 1451| 3.38M| accum.mul(ws[9], p[3]); 1452| 3.38M| accum.mul(ws[10], p[2]); 1453| 3.38M| accum.mul(ws[11], p[1]); 1454| 3.38M| accum.add(z[12]); 1455| 3.38M| ws[12] = accum.monty_step(p[0], p_dash); 1456| 3.38M| accum.mul(ws[0], p[13]); 1457| 3.38M| accum.mul(ws[1], p[12]); 1458| 3.38M| accum.mul(ws[2], p[11]); 1459| 3.38M| accum.mul(ws[3], p[10]); 1460| 3.38M| accum.mul(ws[4], p[9]); 1461| 3.38M| accum.mul(ws[5], p[8]); 1462| 3.38M| accum.mul(ws[6], p[7]); 1463| 3.38M| accum.mul(ws[7], p[6]); 1464| 3.38M| accum.mul(ws[8], p[5]); 1465| 3.38M| accum.mul(ws[9], p[4]); 1466| 3.38M| accum.mul(ws[10], p[3]); 1467| 3.38M| accum.mul(ws[11], p[2]); 1468| 3.38M| accum.mul(ws[12], p[1]); 1469| 3.38M| accum.add(z[13]); 1470| 3.38M| ws[13] = accum.monty_step(p[0], p_dash); 1471| 3.38M| accum.mul(ws[0], p[14]); 1472| 3.38M| accum.mul(ws[1], p[13]); 1473| 3.38M| accum.mul(ws[2], p[12]); 1474| 3.38M| accum.mul(ws[3], p[11]); 1475| 3.38M| accum.mul(ws[4], p[10]); 1476| 3.38M| accum.mul(ws[5], p[9]); 1477| 3.38M| accum.mul(ws[6], p[8]); 1478| 3.38M| accum.mul(ws[7], p[7]); 1479| 3.38M| accum.mul(ws[8], p[6]); 1480| 3.38M| accum.mul(ws[9], p[5]); 1481| 3.38M| accum.mul(ws[10], p[4]); 1482| 3.38M| accum.mul(ws[11], p[3]); 1483| 3.38M| accum.mul(ws[12], p[2]); 1484| 3.38M| accum.mul(ws[13], p[1]); 1485| 3.38M| accum.add(z[14]); 1486| 3.38M| ws[14] = accum.monty_step(p[0], p_dash); 1487| 3.38M| accum.mul(ws[0], p[15]); 1488| 3.38M| accum.mul(ws[1], p[14]); 1489| 3.38M| accum.mul(ws[2], p[13]); 1490| 3.38M| accum.mul(ws[3], p[12]); 1491| 3.38M| accum.mul(ws[4], p[11]); 1492| 3.38M| accum.mul(ws[5], p[10]); 1493| 3.38M| accum.mul(ws[6], p[9]); 1494| 3.38M| accum.mul(ws[7], p[8]); 1495| 3.38M| accum.mul(ws[8], p[7]); 1496| 3.38M| accum.mul(ws[9], p[6]); 1497| 3.38M| accum.mul(ws[10], p[5]); 1498| 3.38M| accum.mul(ws[11], p[4]); 1499| 3.38M| accum.mul(ws[12], p[3]); 1500| 3.38M| accum.mul(ws[13], p[2]); 1501| 3.38M| accum.mul(ws[14], p[1]); 1502| 3.38M| accum.add(z[15]); 1503| 3.38M| ws[15] = accum.monty_step(p[0], p_dash); 1504| 3.38M| accum.mul(ws[0], p[16]); 1505| 3.38M| accum.mul(ws[1], p[15]); 1506| 3.38M| accum.mul(ws[2], p[14]); 1507| 3.38M| accum.mul(ws[3], p[13]); 1508| 3.38M| accum.mul(ws[4], p[12]); 1509| 3.38M| accum.mul(ws[5], p[11]); 1510| 3.38M| accum.mul(ws[6], p[10]); 1511| 3.38M| accum.mul(ws[7], p[9]); 1512| 3.38M| accum.mul(ws[8], p[8]); 1513| 3.38M| accum.mul(ws[9], p[7]); 1514| 3.38M| accum.mul(ws[10], p[6]); 1515| 3.38M| accum.mul(ws[11], p[5]); 1516| 3.38M| accum.mul(ws[12], p[4]); 1517| 3.38M| accum.mul(ws[13], p[3]); 1518| 3.38M| accum.mul(ws[14], p[2]); 1519| 3.38M| accum.mul(ws[15], p[1]); 1520| 3.38M| accum.add(z[16]); 1521| 3.38M| ws[16] = accum.monty_step(p[0], p_dash); 1522| 3.38M| accum.mul(ws[0], p[17]); 1523| 3.38M| accum.mul(ws[1], p[16]); 1524| 3.38M| accum.mul(ws[2], p[15]); 1525| 3.38M| accum.mul(ws[3], p[14]); 1526| 3.38M| accum.mul(ws[4], p[13]); 1527| 3.38M| accum.mul(ws[5], p[12]); 1528| 3.38M| accum.mul(ws[6], p[11]); 1529| 3.38M| accum.mul(ws[7], p[10]); 1530| 3.38M| accum.mul(ws[8], p[9]); 1531| 3.38M| accum.mul(ws[9], p[8]); 1532| 3.38M| accum.mul(ws[10], p[7]); 1533| 3.38M| accum.mul(ws[11], p[6]); 1534| 3.38M| accum.mul(ws[12], p[5]); 1535| 3.38M| accum.mul(ws[13], p[4]); 1536| 3.38M| accum.mul(ws[14], p[3]); 1537| 3.38M| accum.mul(ws[15], p[2]); 1538| 3.38M| accum.mul(ws[16], p[1]); 1539| 3.38M| accum.add(z[17]); 1540| 3.38M| ws[17] = accum.monty_step(p[0], p_dash); 1541| 3.38M| accum.mul(ws[0], p[18]); 1542| 3.38M| accum.mul(ws[1], p[17]); 1543| 3.38M| accum.mul(ws[2], p[16]); 1544| 3.38M| accum.mul(ws[3], p[15]); 1545| 3.38M| accum.mul(ws[4], p[14]); 1546| 3.38M| accum.mul(ws[5], p[13]); 1547| 3.38M| accum.mul(ws[6], p[12]); 1548| 3.38M| accum.mul(ws[7], p[11]); 1549| 3.38M| accum.mul(ws[8], p[10]); 1550| 3.38M| accum.mul(ws[9], p[9]); 1551| 3.38M| accum.mul(ws[10], p[8]); 1552| 3.38M| accum.mul(ws[11], p[7]); 1553| 3.38M| accum.mul(ws[12], p[6]); 1554| 3.38M| accum.mul(ws[13], p[5]); 1555| 3.38M| accum.mul(ws[14], p[4]); 1556| 3.38M| accum.mul(ws[15], p[3]); 1557| 3.38M| accum.mul(ws[16], p[2]); 1558| 3.38M| accum.mul(ws[17], p[1]); 1559| 3.38M| accum.add(z[18]); 1560| 3.38M| ws[18] = accum.monty_step(p[0], p_dash); 1561| 3.38M| accum.mul(ws[0], p[19]); 1562| 3.38M| accum.mul(ws[1], p[18]); 1563| 3.38M| accum.mul(ws[2], p[17]); 1564| 3.38M| accum.mul(ws[3], p[16]); 1565| 3.38M| accum.mul(ws[4], p[15]); 1566| 3.38M| accum.mul(ws[5], p[14]); 1567| 3.38M| accum.mul(ws[6], p[13]); 1568| 3.38M| accum.mul(ws[7], p[12]); 1569| 3.38M| accum.mul(ws[8], p[11]); 1570| 3.38M| accum.mul(ws[9], p[10]); 1571| 3.38M| accum.mul(ws[10], p[9]); 1572| 3.38M| accum.mul(ws[11], p[8]); 1573| 3.38M| accum.mul(ws[12], p[7]); 1574| 3.38M| accum.mul(ws[13], p[6]); 1575| 3.38M| accum.mul(ws[14], p[5]); 1576| 3.38M| accum.mul(ws[15], p[4]); 1577| 3.38M| accum.mul(ws[16], p[3]); 1578| 3.38M| accum.mul(ws[17], p[2]); 1579| 3.38M| accum.mul(ws[18], p[1]); 1580| 3.38M| accum.add(z[19]); 1581| 3.38M| ws[19] = accum.monty_step(p[0], p_dash); 1582| 3.38M| accum.mul(ws[0], p[20]); 1583| 3.38M| accum.mul(ws[1], p[19]); 1584| 3.38M| accum.mul(ws[2], p[18]); 1585| 3.38M| accum.mul(ws[3], p[17]); 1586| 3.38M| accum.mul(ws[4], p[16]); 1587| 3.38M| accum.mul(ws[5], p[15]); 1588| 3.38M| accum.mul(ws[6], p[14]); 1589| 3.38M| accum.mul(ws[7], p[13]); 1590| 3.38M| accum.mul(ws[8], p[12]); 1591| 3.38M| accum.mul(ws[9], p[11]); 1592| 3.38M| accum.mul(ws[10], p[10]); 1593| 3.38M| accum.mul(ws[11], p[9]); 1594| 3.38M| accum.mul(ws[12], p[8]); 1595| 3.38M| accum.mul(ws[13], p[7]); 1596| 3.38M| accum.mul(ws[14], p[6]); 1597| 3.38M| accum.mul(ws[15], p[5]); 1598| 3.38M| accum.mul(ws[16], p[4]); 1599| 3.38M| accum.mul(ws[17], p[3]); 1600| 3.38M| accum.mul(ws[18], p[2]); 1601| 3.38M| accum.mul(ws[19], p[1]); 1602| 3.38M| accum.add(z[20]); 1603| 3.38M| ws[20] = accum.monty_step(p[0], p_dash); 1604| 3.38M| accum.mul(ws[0], p[21]); 1605| 3.38M| accum.mul(ws[1], p[20]); 1606| 3.38M| accum.mul(ws[2], p[19]); 1607| 3.38M| accum.mul(ws[3], p[18]); 1608| 3.38M| accum.mul(ws[4], p[17]); 1609| 3.38M| accum.mul(ws[5], p[16]); 1610| 3.38M| accum.mul(ws[6], p[15]); 1611| 3.38M| accum.mul(ws[7], p[14]); 1612| 3.38M| accum.mul(ws[8], p[13]); 1613| 3.38M| accum.mul(ws[9], p[12]); 1614| 3.38M| accum.mul(ws[10], p[11]); 1615| 3.38M| accum.mul(ws[11], p[10]); 1616| 3.38M| accum.mul(ws[12], p[9]); 1617| 3.38M| accum.mul(ws[13], p[8]); 1618| 3.38M| accum.mul(ws[14], p[7]); 1619| 3.38M| accum.mul(ws[15], p[6]); 1620| 3.38M| accum.mul(ws[16], p[5]); 1621| 3.38M| accum.mul(ws[17], p[4]); 1622| 3.38M| accum.mul(ws[18], p[3]); 1623| 3.38M| accum.mul(ws[19], p[2]); 1624| 3.38M| accum.mul(ws[20], p[1]); 1625| 3.38M| accum.add(z[21]); 1626| 3.38M| ws[21] = accum.monty_step(p[0], p_dash); 1627| 3.38M| accum.mul(ws[0], p[22]); 1628| 3.38M| accum.mul(ws[1], p[21]); 1629| 3.38M| accum.mul(ws[2], p[20]); 1630| 3.38M| accum.mul(ws[3], p[19]); 1631| 3.38M| accum.mul(ws[4], p[18]); 1632| 3.38M| accum.mul(ws[5], p[17]); 1633| 3.38M| accum.mul(ws[6], p[16]); 1634| 3.38M| accum.mul(ws[7], p[15]); 1635| 3.38M| accum.mul(ws[8], p[14]); 1636| 3.38M| accum.mul(ws[9], p[13]); 1637| 3.38M| accum.mul(ws[10], p[12]); 1638| 3.38M| accum.mul(ws[11], p[11]); 1639| 3.38M| accum.mul(ws[12], p[10]); 1640| 3.38M| accum.mul(ws[13], p[9]); 1641| 3.38M| accum.mul(ws[14], p[8]); 1642| 3.38M| accum.mul(ws[15], p[7]); 1643| 3.38M| accum.mul(ws[16], p[6]); 1644| 3.38M| accum.mul(ws[17], p[5]); 1645| 3.38M| accum.mul(ws[18], p[4]); 1646| 3.38M| accum.mul(ws[19], p[3]); 1647| 3.38M| accum.mul(ws[20], p[2]); 1648| 3.38M| accum.mul(ws[21], p[1]); 1649| 3.38M| accum.add(z[22]); 1650| 3.38M| ws[22] = accum.monty_step(p[0], p_dash); 1651| 3.38M| accum.mul(ws[0], p[23]); 1652| 3.38M| accum.mul(ws[1], p[22]); 1653| 3.38M| accum.mul(ws[2], p[21]); 1654| 3.38M| accum.mul(ws[3], p[20]); 1655| 3.38M| accum.mul(ws[4], p[19]); 1656| 3.38M| accum.mul(ws[5], p[18]); 1657| 3.38M| accum.mul(ws[6], p[17]); 1658| 3.38M| accum.mul(ws[7], p[16]); 1659| 3.38M| accum.mul(ws[8], p[15]); 1660| 3.38M| accum.mul(ws[9], p[14]); 1661| 3.38M| accum.mul(ws[10], p[13]); 1662| 3.38M| accum.mul(ws[11], p[12]); 1663| 3.38M| accum.mul(ws[12], p[11]); 1664| 3.38M| accum.mul(ws[13], p[10]); 1665| 3.38M| accum.mul(ws[14], p[9]); 1666| 3.38M| accum.mul(ws[15], p[8]); 1667| 3.38M| accum.mul(ws[16], p[7]); 1668| 3.38M| accum.mul(ws[17], p[6]); 1669| 3.38M| accum.mul(ws[18], p[5]); 1670| 3.38M| accum.mul(ws[19], p[4]); 1671| 3.38M| accum.mul(ws[20], p[3]); 1672| 3.38M| accum.mul(ws[21], p[2]); 1673| 3.38M| accum.mul(ws[22], p[1]); 1674| 3.38M| accum.add(z[23]); 1675| 3.38M| ws[23] = accum.monty_step(p[0], p_dash); 1676| 3.38M| accum.mul(ws[0], p[24]); 1677| 3.38M| accum.mul(ws[1], p[23]); 1678| 3.38M| accum.mul(ws[2], p[22]); 1679| 3.38M| accum.mul(ws[3], p[21]); 1680| 3.38M| accum.mul(ws[4], p[20]); 1681| 3.38M| accum.mul(ws[5], p[19]); 1682| 3.38M| accum.mul(ws[6], p[18]); 1683| 3.38M| accum.mul(ws[7], p[17]); 1684| 3.38M| accum.mul(ws[8], p[16]); 1685| 3.38M| accum.mul(ws[9], p[15]); 1686| 3.38M| accum.mul(ws[10], p[14]); 1687| 3.38M| accum.mul(ws[11], p[13]); 1688| 3.38M| accum.mul(ws[12], p[12]); 1689| 3.38M| accum.mul(ws[13], p[11]); 1690| 3.38M| accum.mul(ws[14], p[10]); 1691| 3.38M| accum.mul(ws[15], p[9]); 1692| 3.38M| accum.mul(ws[16], p[8]); 1693| 3.38M| accum.mul(ws[17], p[7]); 1694| 3.38M| accum.mul(ws[18], p[6]); 1695| 3.38M| accum.mul(ws[19], p[5]); 1696| 3.38M| accum.mul(ws[20], p[4]); 1697| 3.38M| accum.mul(ws[21], p[3]); 1698| 3.38M| accum.mul(ws[22], p[2]); 1699| 3.38M| accum.mul(ws[23], p[1]); 1700| 3.38M| accum.add(z[24]); 1701| 3.38M| ws[24] = accum.monty_step(p[0], p_dash); 1702| 3.38M| accum.mul(ws[0], p[25]); 1703| 3.38M| accum.mul(ws[1], p[24]); 1704| 3.38M| accum.mul(ws[2], p[23]); 1705| 3.38M| accum.mul(ws[3], p[22]); 1706| 3.38M| accum.mul(ws[4], p[21]); 1707| 3.38M| accum.mul(ws[5], p[20]); 1708| 3.38M| accum.mul(ws[6], p[19]); 1709| 3.38M| accum.mul(ws[7], p[18]); 1710| 3.38M| accum.mul(ws[8], p[17]); 1711| 3.38M| accum.mul(ws[9], p[16]); 1712| 3.38M| accum.mul(ws[10], p[15]); 1713| 3.38M| accum.mul(ws[11], p[14]); 1714| 3.38M| accum.mul(ws[12], p[13]); 1715| 3.38M| accum.mul(ws[13], p[12]); 1716| 3.38M| accum.mul(ws[14], p[11]); 1717| 3.38M| accum.mul(ws[15], p[10]); 1718| 3.38M| accum.mul(ws[16], p[9]); 1719| 3.38M| accum.mul(ws[17], p[8]); 1720| 3.38M| accum.mul(ws[18], p[7]); 1721| 3.38M| accum.mul(ws[19], p[6]); 1722| 3.38M| accum.mul(ws[20], p[5]); 1723| 3.38M| accum.mul(ws[21], p[4]); 1724| 3.38M| accum.mul(ws[22], p[3]); 1725| 3.38M| accum.mul(ws[23], p[2]); 1726| 3.38M| accum.mul(ws[24], p[1]); 1727| 3.38M| accum.add(z[25]); 1728| 3.38M| ws[25] = accum.monty_step(p[0], p_dash); 1729| 3.38M| accum.mul(ws[0], p[26]); 1730| 3.38M| accum.mul(ws[1], p[25]); 1731| 3.38M| accum.mul(ws[2], p[24]); 1732| 3.38M| accum.mul(ws[3], p[23]); 1733| 3.38M| accum.mul(ws[4], p[22]); 1734| 3.38M| accum.mul(ws[5], p[21]); 1735| 3.38M| accum.mul(ws[6], p[20]); 1736| 3.38M| accum.mul(ws[7], p[19]); 1737| 3.38M| accum.mul(ws[8], p[18]); 1738| 3.38M| accum.mul(ws[9], p[17]); 1739| 3.38M| accum.mul(ws[10], p[16]); 1740| 3.38M| accum.mul(ws[11], p[15]); 1741| 3.38M| accum.mul(ws[12], p[14]); 1742| 3.38M| accum.mul(ws[13], p[13]); 1743| 3.38M| accum.mul(ws[14], p[12]); 1744| 3.38M| accum.mul(ws[15], p[11]); 1745| 3.38M| accum.mul(ws[16], p[10]); 1746| 3.38M| accum.mul(ws[17], p[9]); 1747| 3.38M| accum.mul(ws[18], p[8]); 1748| 3.38M| accum.mul(ws[19], p[7]); 1749| 3.38M| accum.mul(ws[20], p[6]); 1750| 3.38M| accum.mul(ws[21], p[5]); 1751| 3.38M| accum.mul(ws[22], p[4]); 1752| 3.38M| accum.mul(ws[23], p[3]); 1753| 3.38M| accum.mul(ws[24], p[2]); 1754| 3.38M| accum.mul(ws[25], p[1]); 1755| 3.38M| accum.add(z[26]); 1756| 3.38M| ws[26] = accum.monty_step(p[0], p_dash); 1757| 3.38M| accum.mul(ws[0], p[27]); 1758| 3.38M| accum.mul(ws[1], p[26]); 1759| 3.38M| accum.mul(ws[2], p[25]); 1760| 3.38M| accum.mul(ws[3], p[24]); 1761| 3.38M| accum.mul(ws[4], p[23]); 1762| 3.38M| accum.mul(ws[5], p[22]); 1763| 3.38M| accum.mul(ws[6], p[21]); 1764| 3.38M| accum.mul(ws[7], p[20]); 1765| 3.38M| accum.mul(ws[8], p[19]); 1766| 3.38M| accum.mul(ws[9], p[18]); 1767| 3.38M| accum.mul(ws[10], p[17]); 1768| 3.38M| accum.mul(ws[11], p[16]); 1769| 3.38M| accum.mul(ws[12], p[15]); 1770| 3.38M| accum.mul(ws[13], p[14]); 1771| 3.38M| accum.mul(ws[14], p[13]); 1772| 3.38M| accum.mul(ws[15], p[12]); 1773| 3.38M| accum.mul(ws[16], p[11]); 1774| 3.38M| accum.mul(ws[17], p[10]); 1775| 3.38M| accum.mul(ws[18], p[9]); 1776| 3.38M| accum.mul(ws[19], p[8]); 1777| 3.38M| accum.mul(ws[20], p[7]); 1778| 3.38M| accum.mul(ws[21], p[6]); 1779| 3.38M| accum.mul(ws[22], p[5]); 1780| 3.38M| accum.mul(ws[23], p[4]); 1781| 3.38M| accum.mul(ws[24], p[3]); 1782| 3.38M| accum.mul(ws[25], p[2]); 1783| 3.38M| accum.mul(ws[26], p[1]); 1784| 3.38M| accum.add(z[27]); 1785| 3.38M| ws[27] = accum.monty_step(p[0], p_dash); 1786| 3.38M| accum.mul(ws[0], p[28]); 1787| 3.38M| accum.mul(ws[1], p[27]); 1788| 3.38M| accum.mul(ws[2], p[26]); 1789| 3.38M| accum.mul(ws[3], p[25]); 1790| 3.38M| accum.mul(ws[4], p[24]); 1791| 3.38M| accum.mul(ws[5], p[23]); 1792| 3.38M| accum.mul(ws[6], p[22]); 1793| 3.38M| accum.mul(ws[7], p[21]); 1794| 3.38M| accum.mul(ws[8], p[20]); 1795| 3.38M| accum.mul(ws[9], p[19]); 1796| 3.38M| accum.mul(ws[10], p[18]); 1797| 3.38M| accum.mul(ws[11], p[17]); 1798| 3.38M| accum.mul(ws[12], p[16]); 1799| 3.38M| accum.mul(ws[13], p[15]); 1800| 3.38M| accum.mul(ws[14], p[14]); 1801| 3.38M| accum.mul(ws[15], p[13]); 1802| 3.38M| accum.mul(ws[16], p[12]); 1803| 3.38M| accum.mul(ws[17], p[11]); 1804| 3.38M| accum.mul(ws[18], p[10]); 1805| 3.38M| accum.mul(ws[19], p[9]); 1806| 3.38M| accum.mul(ws[20], p[8]); 1807| 3.38M| accum.mul(ws[21], p[7]); 1808| 3.38M| accum.mul(ws[22], p[6]); 1809| 3.38M| accum.mul(ws[23], p[5]); 1810| 3.38M| accum.mul(ws[24], p[4]); 1811| 3.38M| accum.mul(ws[25], p[3]); 1812| 3.38M| accum.mul(ws[26], p[2]); 1813| 3.38M| accum.mul(ws[27], p[1]); 1814| 3.38M| accum.add(z[28]); 1815| 3.38M| ws[28] = accum.monty_step(p[0], p_dash); 1816| 3.38M| accum.mul(ws[0], p[29]); 1817| 3.38M| accum.mul(ws[1], p[28]); 1818| 3.38M| accum.mul(ws[2], p[27]); 1819| 3.38M| accum.mul(ws[3], p[26]); 1820| 3.38M| accum.mul(ws[4], p[25]); 1821| 3.38M| accum.mul(ws[5], p[24]); 1822| 3.38M| accum.mul(ws[6], p[23]); 1823| 3.38M| accum.mul(ws[7], p[22]); 1824| 3.38M| accum.mul(ws[8], p[21]); 1825| 3.38M| accum.mul(ws[9], p[20]); 1826| 3.38M| accum.mul(ws[10], p[19]); 1827| 3.38M| accum.mul(ws[11], p[18]); 1828| 3.38M| accum.mul(ws[12], p[17]); 1829| 3.38M| accum.mul(ws[13], p[16]); 1830| 3.38M| accum.mul(ws[14], p[15]); 1831| 3.38M| accum.mul(ws[15], p[14]); 1832| 3.38M| accum.mul(ws[16], p[13]); 1833| 3.38M| accum.mul(ws[17], p[12]); 1834| 3.38M| accum.mul(ws[18], p[11]); 1835| 3.38M| accum.mul(ws[19], p[10]); 1836| 3.38M| accum.mul(ws[20], p[9]); 1837| 3.38M| accum.mul(ws[21], p[8]); 1838| 3.38M| accum.mul(ws[22], p[7]); 1839| 3.38M| accum.mul(ws[23], p[6]); 1840| 3.38M| accum.mul(ws[24], p[5]); 1841| 3.38M| accum.mul(ws[25], p[4]); 1842| 3.38M| accum.mul(ws[26], p[3]); 1843| 3.38M| accum.mul(ws[27], p[2]); 1844| 3.38M| accum.mul(ws[28], p[1]); 1845| 3.38M| accum.add(z[29]); 1846| 3.38M| ws[29] = accum.monty_step(p[0], p_dash); 1847| 3.38M| accum.mul(ws[0], p[30]); 1848| 3.38M| accum.mul(ws[1], p[29]); 1849| 3.38M| accum.mul(ws[2], p[28]); 1850| 3.38M| accum.mul(ws[3], p[27]); 1851| 3.38M| accum.mul(ws[4], p[26]); 1852| 3.38M| accum.mul(ws[5], p[25]); 1853| 3.38M| accum.mul(ws[6], p[24]); 1854| 3.38M| accum.mul(ws[7], p[23]); 1855| 3.38M| accum.mul(ws[8], p[22]); 1856| 3.38M| accum.mul(ws[9], p[21]); 1857| 3.38M| accum.mul(ws[10], p[20]); 1858| 3.38M| accum.mul(ws[11], p[19]); 1859| 3.38M| accum.mul(ws[12], p[18]); 1860| 3.38M| accum.mul(ws[13], p[17]); 1861| 3.38M| accum.mul(ws[14], p[16]); 1862| 3.38M| accum.mul(ws[15], p[15]); 1863| 3.38M| accum.mul(ws[16], p[14]); 1864| 3.38M| accum.mul(ws[17], p[13]); 1865| 3.38M| accum.mul(ws[18], p[12]); 1866| 3.38M| accum.mul(ws[19], p[11]); 1867| 3.38M| accum.mul(ws[20], p[10]); 1868| 3.38M| accum.mul(ws[21], p[9]); 1869| 3.38M| accum.mul(ws[22], p[8]); 1870| 3.38M| accum.mul(ws[23], p[7]); 1871| 3.38M| accum.mul(ws[24], p[6]); 1872| 3.38M| accum.mul(ws[25], p[5]); 1873| 3.38M| accum.mul(ws[26], p[4]); 1874| 3.38M| accum.mul(ws[27], p[3]); 1875| 3.38M| accum.mul(ws[28], p[2]); 1876| 3.38M| accum.mul(ws[29], p[1]); 1877| 3.38M| accum.add(z[30]); 1878| 3.38M| ws[30] = accum.monty_step(p[0], p_dash); 1879| 3.38M| accum.mul(ws[0], p[31]); 1880| 3.38M| accum.mul(ws[1], p[30]); 1881| 3.38M| accum.mul(ws[2], p[29]); 1882| 3.38M| accum.mul(ws[3], p[28]); 1883| 3.38M| accum.mul(ws[4], p[27]); 1884| 3.38M| accum.mul(ws[5], p[26]); 1885| 3.38M| accum.mul(ws[6], p[25]); 1886| 3.38M| accum.mul(ws[7], p[24]); 1887| 3.38M| accum.mul(ws[8], p[23]); 1888| 3.38M| accum.mul(ws[9], p[22]); 1889| 3.38M| accum.mul(ws[10], p[21]); 1890| 3.38M| accum.mul(ws[11], p[20]); 1891| 3.38M| accum.mul(ws[12], p[19]); 1892| 3.38M| accum.mul(ws[13], p[18]); 1893| 3.38M| accum.mul(ws[14], p[17]); 1894| 3.38M| accum.mul(ws[15], p[16]); 1895| 3.38M| accum.mul(ws[16], p[15]); 1896| 3.38M| accum.mul(ws[17], p[14]); 1897| 3.38M| accum.mul(ws[18], p[13]); 1898| 3.38M| accum.mul(ws[19], p[12]); 1899| 3.38M| accum.mul(ws[20], p[11]); 1900| 3.38M| accum.mul(ws[21], p[10]); 1901| 3.38M| accum.mul(ws[22], p[9]); 1902| 3.38M| accum.mul(ws[23], p[8]); 1903| 3.38M| accum.mul(ws[24], p[7]); 1904| 3.38M| accum.mul(ws[25], p[6]); 1905| 3.38M| accum.mul(ws[26], p[5]); 1906| 3.38M| accum.mul(ws[27], p[4]); 1907| 3.38M| accum.mul(ws[28], p[3]); 1908| 3.38M| accum.mul(ws[29], p[2]); 1909| 3.38M| accum.mul(ws[30], p[1]); 1910| 3.38M| accum.add(z[31]); 1911| 3.38M| ws[31] = accum.monty_step(p[0], p_dash); 1912| 3.38M| accum.mul(ws[1], p[31]); 1913| 3.38M| accum.mul(ws[2], p[30]); 1914| 3.38M| accum.mul(ws[3], p[29]); 1915| 3.38M| accum.mul(ws[4], p[28]); 1916| 3.38M| accum.mul(ws[5], p[27]); 1917| 3.38M| accum.mul(ws[6], p[26]); 1918| 3.38M| accum.mul(ws[7], p[25]); 1919| 3.38M| accum.mul(ws[8], p[24]); 1920| 3.38M| accum.mul(ws[9], p[23]); 1921| 3.38M| accum.mul(ws[10], p[22]); 1922| 3.38M| accum.mul(ws[11], p[21]); 1923| 3.38M| accum.mul(ws[12], p[20]); 1924| 3.38M| accum.mul(ws[13], p[19]); 1925| 3.38M| accum.mul(ws[14], p[18]); 1926| 3.38M| accum.mul(ws[15], p[17]); 1927| 3.38M| accum.mul(ws[16], p[16]); 1928| 3.38M| accum.mul(ws[17], p[15]); 1929| 3.38M| accum.mul(ws[18], p[14]); 1930| 3.38M| accum.mul(ws[19], p[13]); 1931| 3.38M| accum.mul(ws[20], p[12]); 1932| 3.38M| accum.mul(ws[21], p[11]); 1933| 3.38M| accum.mul(ws[22], p[10]); 1934| 3.38M| accum.mul(ws[23], p[9]); 1935| 3.38M| accum.mul(ws[24], p[8]); 1936| 3.38M| accum.mul(ws[25], p[7]); 1937| 3.38M| accum.mul(ws[26], p[6]); 1938| 3.38M| accum.mul(ws[27], p[5]); 1939| 3.38M| accum.mul(ws[28], p[4]); 1940| 3.38M| accum.mul(ws[29], p[3]); 1941| 3.38M| accum.mul(ws[30], p[2]); 1942| 3.38M| accum.mul(ws[31], p[1]); 1943| 3.38M| accum.add(z[32]); 1944| 3.38M| ws[0] = accum.extract(); 1945| 3.38M| accum.mul(ws[2], p[31]); 1946| 3.38M| accum.mul(ws[3], p[30]); 1947| 3.38M| accum.mul(ws[4], p[29]); 1948| 3.38M| accum.mul(ws[5], p[28]); 1949| 3.38M| accum.mul(ws[6], p[27]); 1950| 3.38M| accum.mul(ws[7], p[26]); 1951| 3.38M| accum.mul(ws[8], p[25]); 1952| 3.38M| accum.mul(ws[9], p[24]); 1953| 3.38M| accum.mul(ws[10], p[23]); 1954| 3.38M| accum.mul(ws[11], p[22]); 1955| 3.38M| accum.mul(ws[12], p[21]); 1956| 3.38M| accum.mul(ws[13], p[20]); 1957| 3.38M| accum.mul(ws[14], p[19]); 1958| 3.38M| accum.mul(ws[15], p[18]); 1959| 3.38M| accum.mul(ws[16], p[17]); 1960| 3.38M| accum.mul(ws[17], p[16]); 1961| 3.38M| accum.mul(ws[18], p[15]); 1962| 3.38M| accum.mul(ws[19], p[14]); 1963| 3.38M| accum.mul(ws[20], p[13]); 1964| 3.38M| accum.mul(ws[21], p[12]); 1965| 3.38M| accum.mul(ws[22], p[11]); 1966| 3.38M| accum.mul(ws[23], p[10]); 1967| 3.38M| accum.mul(ws[24], p[9]); 1968| 3.38M| accum.mul(ws[25], p[8]); 1969| 3.38M| accum.mul(ws[26], p[7]); 1970| 3.38M| accum.mul(ws[27], p[6]); 1971| 3.38M| accum.mul(ws[28], p[5]); 1972| 3.38M| accum.mul(ws[29], p[4]); 1973| 3.38M| accum.mul(ws[30], p[3]); 1974| 3.38M| accum.mul(ws[31], p[2]); 1975| 3.38M| accum.add(z[33]); 1976| 3.38M| ws[1] = accum.extract(); 1977| 3.38M| accum.mul(ws[3], p[31]); 1978| 3.38M| accum.mul(ws[4], p[30]); 1979| 3.38M| accum.mul(ws[5], p[29]); 1980| 3.38M| accum.mul(ws[6], p[28]); 1981| 3.38M| accum.mul(ws[7], p[27]); 1982| 3.38M| accum.mul(ws[8], p[26]); 1983| 3.38M| accum.mul(ws[9], p[25]); 1984| 3.38M| accum.mul(ws[10], p[24]); 1985| 3.38M| accum.mul(ws[11], p[23]); 1986| 3.38M| accum.mul(ws[12], p[22]); 1987| 3.38M| accum.mul(ws[13], p[21]); 1988| 3.38M| accum.mul(ws[14], p[20]); 1989| 3.38M| accum.mul(ws[15], p[19]); 1990| 3.38M| accum.mul(ws[16], p[18]); 1991| 3.38M| accum.mul(ws[17], p[17]); 1992| 3.38M| accum.mul(ws[18], p[16]); 1993| 3.38M| accum.mul(ws[19], p[15]); 1994| 3.38M| accum.mul(ws[20], p[14]); 1995| 3.38M| accum.mul(ws[21], p[13]); 1996| 3.38M| accum.mul(ws[22], p[12]); 1997| 3.38M| accum.mul(ws[23], p[11]); 1998| 3.38M| accum.mul(ws[24], p[10]); 1999| 3.38M| accum.mul(ws[25], p[9]); 2000| 3.38M| accum.mul(ws[26], p[8]); 2001| 3.38M| accum.mul(ws[27], p[7]); 2002| 3.38M| accum.mul(ws[28], p[6]); 2003| 3.38M| accum.mul(ws[29], p[5]); 2004| 3.38M| accum.mul(ws[30], p[4]); 2005| 3.38M| accum.mul(ws[31], p[3]); 2006| 3.38M| accum.add(z[34]); 2007| 3.38M| ws[2] = accum.extract(); 2008| 3.38M| accum.mul(ws[4], p[31]); 2009| 3.38M| accum.mul(ws[5], p[30]); 2010| 3.38M| accum.mul(ws[6], p[29]); 2011| 3.38M| accum.mul(ws[7], p[28]); 2012| 3.38M| accum.mul(ws[8], p[27]); 2013| 3.38M| accum.mul(ws[9], p[26]); 2014| 3.38M| accum.mul(ws[10], p[25]); 2015| 3.38M| accum.mul(ws[11], p[24]); 2016| 3.38M| accum.mul(ws[12], p[23]); 2017| 3.38M| accum.mul(ws[13], p[22]); 2018| 3.38M| accum.mul(ws[14], p[21]); 2019| 3.38M| accum.mul(ws[15], p[20]); 2020| 3.38M| accum.mul(ws[16], p[19]); 2021| 3.38M| accum.mul(ws[17], p[18]); 2022| 3.38M| accum.mul(ws[18], p[17]); 2023| 3.38M| accum.mul(ws[19], p[16]); 2024| 3.38M| accum.mul(ws[20], p[15]); 2025| 3.38M| accum.mul(ws[21], p[14]); 2026| 3.38M| accum.mul(ws[22], p[13]); 2027| 3.38M| accum.mul(ws[23], p[12]); 2028| 3.38M| accum.mul(ws[24], p[11]); 2029| 3.38M| accum.mul(ws[25], p[10]); 2030| 3.38M| accum.mul(ws[26], p[9]); 2031| 3.38M| accum.mul(ws[27], p[8]); 2032| 3.38M| accum.mul(ws[28], p[7]); 2033| 3.38M| accum.mul(ws[29], p[6]); 2034| 3.38M| accum.mul(ws[30], p[5]); 2035| 3.38M| accum.mul(ws[31], p[4]); 2036| 3.38M| accum.add(z[35]); 2037| 3.38M| ws[3] = accum.extract(); 2038| 3.38M| accum.mul(ws[5], p[31]); 2039| 3.38M| accum.mul(ws[6], p[30]); 2040| 3.38M| accum.mul(ws[7], p[29]); 2041| 3.38M| accum.mul(ws[8], p[28]); 2042| 3.38M| accum.mul(ws[9], p[27]); 2043| 3.38M| accum.mul(ws[10], p[26]); 2044| 3.38M| accum.mul(ws[11], p[25]); 2045| 3.38M| accum.mul(ws[12], p[24]); 2046| 3.38M| accum.mul(ws[13], p[23]); 2047| 3.38M| accum.mul(ws[14], p[22]); 2048| 3.38M| accum.mul(ws[15], p[21]); 2049| 3.38M| accum.mul(ws[16], p[20]); 2050| 3.38M| accum.mul(ws[17], p[19]); 2051| 3.38M| accum.mul(ws[18], p[18]); 2052| 3.38M| accum.mul(ws[19], p[17]); 2053| 3.38M| accum.mul(ws[20], p[16]); 2054| 3.38M| accum.mul(ws[21], p[15]); 2055| 3.38M| accum.mul(ws[22], p[14]); 2056| 3.38M| accum.mul(ws[23], p[13]); 2057| 3.38M| accum.mul(ws[24], p[12]); 2058| 3.38M| accum.mul(ws[25], p[11]); 2059| 3.38M| accum.mul(ws[26], p[10]); 2060| 3.38M| accum.mul(ws[27], p[9]); 2061| 3.38M| accum.mul(ws[28], p[8]); 2062| 3.38M| accum.mul(ws[29], p[7]); 2063| 3.38M| accum.mul(ws[30], p[6]); 2064| 3.38M| accum.mul(ws[31], p[5]); 2065| 3.38M| accum.add(z[36]); 2066| 3.38M| ws[4] = accum.extract(); 2067| 3.38M| accum.mul(ws[6], p[31]); 2068| 3.38M| accum.mul(ws[7], p[30]); 2069| 3.38M| accum.mul(ws[8], p[29]); 2070| 3.38M| accum.mul(ws[9], p[28]); 2071| 3.38M| accum.mul(ws[10], p[27]); 2072| 3.38M| accum.mul(ws[11], p[26]); 2073| 3.38M| accum.mul(ws[12], p[25]); 2074| 3.38M| accum.mul(ws[13], p[24]); 2075| 3.38M| accum.mul(ws[14], p[23]); 2076| 3.38M| accum.mul(ws[15], p[22]); 2077| 3.38M| accum.mul(ws[16], p[21]); 2078| 3.38M| accum.mul(ws[17], p[20]); 2079| 3.38M| accum.mul(ws[18], p[19]); 2080| 3.38M| accum.mul(ws[19], p[18]); 2081| 3.38M| accum.mul(ws[20], p[17]); 2082| 3.38M| accum.mul(ws[21], p[16]); 2083| 3.38M| accum.mul(ws[22], p[15]); 2084| 3.38M| accum.mul(ws[23], p[14]); 2085| 3.38M| accum.mul(ws[24], p[13]); 2086| 3.38M| accum.mul(ws[25], p[12]); 2087| 3.38M| accum.mul(ws[26], p[11]); 2088| 3.38M| accum.mul(ws[27], p[10]); 2089| 3.38M| accum.mul(ws[28], p[9]); 2090| 3.38M| accum.mul(ws[29], p[8]); 2091| 3.38M| accum.mul(ws[30], p[7]); 2092| 3.38M| accum.mul(ws[31], p[6]); 2093| 3.38M| accum.add(z[37]); 2094| 3.38M| ws[5] = accum.extract(); 2095| 3.38M| accum.mul(ws[7], p[31]); 2096| 3.38M| accum.mul(ws[8], p[30]); 2097| 3.38M| accum.mul(ws[9], p[29]); 2098| 3.38M| accum.mul(ws[10], p[28]); 2099| 3.38M| accum.mul(ws[11], p[27]); 2100| 3.38M| accum.mul(ws[12], p[26]); 2101| 3.38M| accum.mul(ws[13], p[25]); 2102| 3.38M| accum.mul(ws[14], p[24]); 2103| 3.38M| accum.mul(ws[15], p[23]); 2104| 3.38M| accum.mul(ws[16], p[22]); 2105| 3.38M| accum.mul(ws[17], p[21]); 2106| 3.38M| accum.mul(ws[18], p[20]); 2107| 3.38M| accum.mul(ws[19], p[19]); 2108| 3.38M| accum.mul(ws[20], p[18]); 2109| 3.38M| accum.mul(ws[21], p[17]); 2110| 3.38M| accum.mul(ws[22], p[16]); 2111| 3.38M| accum.mul(ws[23], p[15]); 2112| 3.38M| accum.mul(ws[24], p[14]); 2113| 3.38M| accum.mul(ws[25], p[13]); 2114| 3.38M| accum.mul(ws[26], p[12]); 2115| 3.38M| accum.mul(ws[27], p[11]); 2116| 3.38M| accum.mul(ws[28], p[10]); 2117| 3.38M| accum.mul(ws[29], p[9]); 2118| 3.38M| accum.mul(ws[30], p[8]); 2119| 3.38M| accum.mul(ws[31], p[7]); 2120| 3.38M| accum.add(z[38]); 2121| 3.38M| ws[6] = accum.extract(); 2122| 3.38M| accum.mul(ws[8], p[31]); 2123| 3.38M| accum.mul(ws[9], p[30]); 2124| 3.38M| accum.mul(ws[10], p[29]); 2125| 3.38M| accum.mul(ws[11], p[28]); 2126| 3.38M| accum.mul(ws[12], p[27]); 2127| 3.38M| accum.mul(ws[13], p[26]); 2128| 3.38M| accum.mul(ws[14], p[25]); 2129| 3.38M| accum.mul(ws[15], p[24]); 2130| 3.38M| accum.mul(ws[16], p[23]); 2131| 3.38M| accum.mul(ws[17], p[22]); 2132| 3.38M| accum.mul(ws[18], p[21]); 2133| 3.38M| accum.mul(ws[19], p[20]); 2134| 3.38M| accum.mul(ws[20], p[19]); 2135| 3.38M| accum.mul(ws[21], p[18]); 2136| 3.38M| accum.mul(ws[22], p[17]); 2137| 3.38M| accum.mul(ws[23], p[16]); 2138| 3.38M| accum.mul(ws[24], p[15]); 2139| 3.38M| accum.mul(ws[25], p[14]); 2140| 3.38M| accum.mul(ws[26], p[13]); 2141| 3.38M| accum.mul(ws[27], p[12]); 2142| 3.38M| accum.mul(ws[28], p[11]); 2143| 3.38M| accum.mul(ws[29], p[10]); 2144| 3.38M| accum.mul(ws[30], p[9]); 2145| 3.38M| accum.mul(ws[31], p[8]); 2146| 3.38M| accum.add(z[39]); 2147| 3.38M| ws[7] = accum.extract(); 2148| 3.38M| accum.mul(ws[9], p[31]); 2149| 3.38M| accum.mul(ws[10], p[30]); 2150| 3.38M| accum.mul(ws[11], p[29]); 2151| 3.38M| accum.mul(ws[12], p[28]); 2152| 3.38M| accum.mul(ws[13], p[27]); 2153| 3.38M| accum.mul(ws[14], p[26]); 2154| 3.38M| accum.mul(ws[15], p[25]); 2155| 3.38M| accum.mul(ws[16], p[24]); 2156| 3.38M| accum.mul(ws[17], p[23]); 2157| 3.38M| accum.mul(ws[18], p[22]); 2158| 3.38M| accum.mul(ws[19], p[21]); 2159| 3.38M| accum.mul(ws[20], p[20]); 2160| 3.38M| accum.mul(ws[21], p[19]); 2161| 3.38M| accum.mul(ws[22], p[18]); 2162| 3.38M| accum.mul(ws[23], p[17]); 2163| 3.38M| accum.mul(ws[24], p[16]); 2164| 3.38M| accum.mul(ws[25], p[15]); 2165| 3.38M| accum.mul(ws[26], p[14]); 2166| 3.38M| accum.mul(ws[27], p[13]); 2167| 3.38M| accum.mul(ws[28], p[12]); 2168| 3.38M| accum.mul(ws[29], p[11]); 2169| 3.38M| accum.mul(ws[30], p[10]); 2170| 3.38M| accum.mul(ws[31], p[9]); 2171| 3.38M| accum.add(z[40]); 2172| 3.38M| ws[8] = accum.extract(); 2173| 3.38M| accum.mul(ws[10], p[31]); 2174| 3.38M| accum.mul(ws[11], p[30]); 2175| 3.38M| accum.mul(ws[12], p[29]); 2176| 3.38M| accum.mul(ws[13], p[28]); 2177| 3.38M| accum.mul(ws[14], p[27]); 2178| 3.38M| accum.mul(ws[15], p[26]); 2179| 3.38M| accum.mul(ws[16], p[25]); 2180| 3.38M| accum.mul(ws[17], p[24]); 2181| 3.38M| accum.mul(ws[18], p[23]); 2182| 3.38M| accum.mul(ws[19], p[22]); 2183| 3.38M| accum.mul(ws[20], p[21]); 2184| 3.38M| accum.mul(ws[21], p[20]); 2185| 3.38M| accum.mul(ws[22], p[19]); 2186| 3.38M| accum.mul(ws[23], p[18]); 2187| 3.38M| accum.mul(ws[24], p[17]); 2188| 3.38M| accum.mul(ws[25], p[16]); 2189| 3.38M| accum.mul(ws[26], p[15]); 2190| 3.38M| accum.mul(ws[27], p[14]); 2191| 3.38M| accum.mul(ws[28], p[13]); 2192| 3.38M| accum.mul(ws[29], p[12]); 2193| 3.38M| accum.mul(ws[30], p[11]); 2194| 3.38M| accum.mul(ws[31], p[10]); 2195| 3.38M| accum.add(z[41]); 2196| 3.38M| ws[9] = accum.extract(); 2197| 3.38M| accum.mul(ws[11], p[31]); 2198| 3.38M| accum.mul(ws[12], p[30]); 2199| 3.38M| accum.mul(ws[13], p[29]); 2200| 3.38M| accum.mul(ws[14], p[28]); 2201| 3.38M| accum.mul(ws[15], p[27]); 2202| 3.38M| accum.mul(ws[16], p[26]); 2203| 3.38M| accum.mul(ws[17], p[25]); 2204| 3.38M| accum.mul(ws[18], p[24]); 2205| 3.38M| accum.mul(ws[19], p[23]); 2206| 3.38M| accum.mul(ws[20], p[22]); 2207| 3.38M| accum.mul(ws[21], p[21]); 2208| 3.38M| accum.mul(ws[22], p[20]); 2209| 3.38M| accum.mul(ws[23], p[19]); 2210| 3.38M| accum.mul(ws[24], p[18]); 2211| 3.38M| accum.mul(ws[25], p[17]); 2212| 3.38M| accum.mul(ws[26], p[16]); 2213| 3.38M| accum.mul(ws[27], p[15]); 2214| 3.38M| accum.mul(ws[28], p[14]); 2215| 3.38M| accum.mul(ws[29], p[13]); 2216| 3.38M| accum.mul(ws[30], p[12]); 2217| 3.38M| accum.mul(ws[31], p[11]); 2218| 3.38M| accum.add(z[42]); 2219| 3.38M| ws[10] = accum.extract(); 2220| 3.38M| accum.mul(ws[12], p[31]); 2221| 3.38M| accum.mul(ws[13], p[30]); 2222| 3.38M| accum.mul(ws[14], p[29]); 2223| 3.38M| accum.mul(ws[15], p[28]); 2224| 3.38M| accum.mul(ws[16], p[27]); 2225| 3.38M| accum.mul(ws[17], p[26]); 2226| 3.38M| accum.mul(ws[18], p[25]); 2227| 3.38M| accum.mul(ws[19], p[24]); 2228| 3.38M| accum.mul(ws[20], p[23]); 2229| 3.38M| accum.mul(ws[21], p[22]); 2230| 3.38M| accum.mul(ws[22], p[21]); 2231| 3.38M| accum.mul(ws[23], p[20]); 2232| 3.38M| accum.mul(ws[24], p[19]); 2233| 3.38M| accum.mul(ws[25], p[18]); 2234| 3.38M| accum.mul(ws[26], p[17]); 2235| 3.38M| accum.mul(ws[27], p[16]); 2236| 3.38M| accum.mul(ws[28], p[15]); 2237| 3.38M| accum.mul(ws[29], p[14]); 2238| 3.38M| accum.mul(ws[30], p[13]); 2239| 3.38M| accum.mul(ws[31], p[12]); 2240| 3.38M| accum.add(z[43]); 2241| 3.38M| ws[11] = accum.extract(); 2242| 3.38M| accum.mul(ws[13], p[31]); 2243| 3.38M| accum.mul(ws[14], p[30]); 2244| 3.38M| accum.mul(ws[15], p[29]); 2245| 3.38M| accum.mul(ws[16], p[28]); 2246| 3.38M| accum.mul(ws[17], p[27]); 2247| 3.38M| accum.mul(ws[18], p[26]); 2248| 3.38M| accum.mul(ws[19], p[25]); 2249| 3.38M| accum.mul(ws[20], p[24]); 2250| 3.38M| accum.mul(ws[21], p[23]); 2251| 3.38M| accum.mul(ws[22], p[22]); 2252| 3.38M| accum.mul(ws[23], p[21]); 2253| 3.38M| accum.mul(ws[24], p[20]); 2254| 3.38M| accum.mul(ws[25], p[19]); 2255| 3.38M| accum.mul(ws[26], p[18]); 2256| 3.38M| accum.mul(ws[27], p[17]); 2257| 3.38M| accum.mul(ws[28], p[16]); 2258| 3.38M| accum.mul(ws[29], p[15]); 2259| 3.38M| accum.mul(ws[30], p[14]); 2260| 3.38M| accum.mul(ws[31], p[13]); 2261| 3.38M| accum.add(z[44]); 2262| 3.38M| ws[12] = accum.extract(); 2263| 3.38M| accum.mul(ws[14], p[31]); 2264| 3.38M| accum.mul(ws[15], p[30]); 2265| 3.38M| accum.mul(ws[16], p[29]); 2266| 3.38M| accum.mul(ws[17], p[28]); 2267| 3.38M| accum.mul(ws[18], p[27]); 2268| 3.38M| accum.mul(ws[19], p[26]); 2269| 3.38M| accum.mul(ws[20], p[25]); 2270| 3.38M| accum.mul(ws[21], p[24]); 2271| 3.38M| accum.mul(ws[22], p[23]); 2272| 3.38M| accum.mul(ws[23], p[22]); 2273| 3.38M| accum.mul(ws[24], p[21]); 2274| 3.38M| accum.mul(ws[25], p[20]); 2275| 3.38M| accum.mul(ws[26], p[19]); 2276| 3.38M| accum.mul(ws[27], p[18]); 2277| 3.38M| accum.mul(ws[28], p[17]); 2278| 3.38M| accum.mul(ws[29], p[16]); 2279| 3.38M| accum.mul(ws[30], p[15]); 2280| 3.38M| accum.mul(ws[31], p[14]); 2281| 3.38M| accum.add(z[45]); 2282| 3.38M| ws[13] = accum.extract(); 2283| 3.38M| accum.mul(ws[15], p[31]); 2284| 3.38M| accum.mul(ws[16], p[30]); 2285| 3.38M| accum.mul(ws[17], p[29]); 2286| 3.38M| accum.mul(ws[18], p[28]); 2287| 3.38M| accum.mul(ws[19], p[27]); 2288| 3.38M| accum.mul(ws[20], p[26]); 2289| 3.38M| accum.mul(ws[21], p[25]); 2290| 3.38M| accum.mul(ws[22], p[24]); 2291| 3.38M| accum.mul(ws[23], p[23]); 2292| 3.38M| accum.mul(ws[24], p[22]); 2293| 3.38M| accum.mul(ws[25], p[21]); 2294| 3.38M| accum.mul(ws[26], p[20]); 2295| 3.38M| accum.mul(ws[27], p[19]); 2296| 3.38M| accum.mul(ws[28], p[18]); 2297| 3.38M| accum.mul(ws[29], p[17]); 2298| 3.38M| accum.mul(ws[30], p[16]); 2299| 3.38M| accum.mul(ws[31], p[15]); 2300| 3.38M| accum.add(z[46]); 2301| 3.38M| ws[14] = accum.extract(); 2302| 3.38M| accum.mul(ws[16], p[31]); 2303| 3.38M| accum.mul(ws[17], p[30]); 2304| 3.38M| accum.mul(ws[18], p[29]); 2305| 3.38M| accum.mul(ws[19], p[28]); 2306| 3.38M| accum.mul(ws[20], p[27]); 2307| 3.38M| accum.mul(ws[21], p[26]); 2308| 3.38M| accum.mul(ws[22], p[25]); 2309| 3.38M| accum.mul(ws[23], p[24]); 2310| 3.38M| accum.mul(ws[24], p[23]); 2311| 3.38M| accum.mul(ws[25], p[22]); 2312| 3.38M| accum.mul(ws[26], p[21]); 2313| 3.38M| accum.mul(ws[27], p[20]); 2314| 3.38M| accum.mul(ws[28], p[19]); 2315| 3.38M| accum.mul(ws[29], p[18]); 2316| 3.38M| accum.mul(ws[30], p[17]); 2317| 3.38M| accum.mul(ws[31], p[16]); 2318| 3.38M| accum.add(z[47]); 2319| 3.38M| ws[15] = accum.extract(); 2320| 3.38M| accum.mul(ws[17], p[31]); 2321| 3.38M| accum.mul(ws[18], p[30]); 2322| 3.38M| accum.mul(ws[19], p[29]); 2323| 3.38M| accum.mul(ws[20], p[28]); 2324| 3.38M| accum.mul(ws[21], p[27]); 2325| 3.38M| accum.mul(ws[22], p[26]); 2326| 3.38M| accum.mul(ws[23], p[25]); 2327| 3.38M| accum.mul(ws[24], p[24]); 2328| 3.38M| accum.mul(ws[25], p[23]); 2329| 3.38M| accum.mul(ws[26], p[22]); 2330| 3.38M| accum.mul(ws[27], p[21]); 2331| 3.38M| accum.mul(ws[28], p[20]); 2332| 3.38M| accum.mul(ws[29], p[19]); 2333| 3.38M| accum.mul(ws[30], p[18]); 2334| 3.38M| accum.mul(ws[31], p[17]); 2335| 3.38M| accum.add(z[48]); 2336| 3.38M| ws[16] = accum.extract(); 2337| 3.38M| accum.mul(ws[18], p[31]); 2338| 3.38M| accum.mul(ws[19], p[30]); 2339| 3.38M| accum.mul(ws[20], p[29]); 2340| 3.38M| accum.mul(ws[21], p[28]); 2341| 3.38M| accum.mul(ws[22], p[27]); 2342| 3.38M| accum.mul(ws[23], p[26]); 2343| 3.38M| accum.mul(ws[24], p[25]); 2344| 3.38M| accum.mul(ws[25], p[24]); 2345| 3.38M| accum.mul(ws[26], p[23]); 2346| 3.38M| accum.mul(ws[27], p[22]); 2347| 3.38M| accum.mul(ws[28], p[21]); 2348| 3.38M| accum.mul(ws[29], p[20]); 2349| 3.38M| accum.mul(ws[30], p[19]); 2350| 3.38M| accum.mul(ws[31], p[18]); 2351| 3.38M| accum.add(z[49]); 2352| 3.38M| ws[17] = accum.extract(); 2353| 3.38M| accum.mul(ws[19], p[31]); 2354| 3.38M| accum.mul(ws[20], p[30]); 2355| 3.38M| accum.mul(ws[21], p[29]); 2356| 3.38M| accum.mul(ws[22], p[28]); 2357| 3.38M| accum.mul(ws[23], p[27]); 2358| 3.38M| accum.mul(ws[24], p[26]); 2359| 3.38M| accum.mul(ws[25], p[25]); 2360| 3.38M| accum.mul(ws[26], p[24]); 2361| 3.38M| accum.mul(ws[27], p[23]); 2362| 3.38M| accum.mul(ws[28], p[22]); 2363| 3.38M| accum.mul(ws[29], p[21]); 2364| 3.38M| accum.mul(ws[30], p[20]); 2365| 3.38M| accum.mul(ws[31], p[19]); 2366| 3.38M| accum.add(z[50]); 2367| 3.38M| ws[18] = accum.extract(); 2368| 3.38M| accum.mul(ws[20], p[31]); 2369| 3.38M| accum.mul(ws[21], p[30]); 2370| 3.38M| accum.mul(ws[22], p[29]); 2371| 3.38M| accum.mul(ws[23], p[28]); 2372| 3.38M| accum.mul(ws[24], p[27]); 2373| 3.38M| accum.mul(ws[25], p[26]); 2374| 3.38M| accum.mul(ws[26], p[25]); 2375| 3.38M| accum.mul(ws[27], p[24]); 2376| 3.38M| accum.mul(ws[28], p[23]); 2377| 3.38M| accum.mul(ws[29], p[22]); 2378| 3.38M| accum.mul(ws[30], p[21]); 2379| 3.38M| accum.mul(ws[31], p[20]); 2380| 3.38M| accum.add(z[51]); 2381| 3.38M| ws[19] = accum.extract(); 2382| 3.38M| accum.mul(ws[21], p[31]); 2383| 3.38M| accum.mul(ws[22], p[30]); 2384| 3.38M| accum.mul(ws[23], p[29]); 2385| 3.38M| accum.mul(ws[24], p[28]); 2386| 3.38M| accum.mul(ws[25], p[27]); 2387| 3.38M| accum.mul(ws[26], p[26]); 2388| 3.38M| accum.mul(ws[27], p[25]); 2389| 3.38M| accum.mul(ws[28], p[24]); 2390| 3.38M| accum.mul(ws[29], p[23]); 2391| 3.38M| accum.mul(ws[30], p[22]); 2392| 3.38M| accum.mul(ws[31], p[21]); 2393| 3.38M| accum.add(z[52]); 2394| 3.38M| ws[20] = accum.extract(); 2395| 3.38M| accum.mul(ws[22], p[31]); 2396| 3.38M| accum.mul(ws[23], p[30]); 2397| 3.38M| accum.mul(ws[24], p[29]); 2398| 3.38M| accum.mul(ws[25], p[28]); 2399| 3.38M| accum.mul(ws[26], p[27]); 2400| 3.38M| accum.mul(ws[27], p[26]); 2401| 3.38M| accum.mul(ws[28], p[25]); 2402| 3.38M| accum.mul(ws[29], p[24]); 2403| 3.38M| accum.mul(ws[30], p[23]); 2404| 3.38M| accum.mul(ws[31], p[22]); 2405| 3.38M| accum.add(z[53]); 2406| 3.38M| ws[21] = accum.extract(); 2407| 3.38M| accum.mul(ws[23], p[31]); 2408| 3.38M| accum.mul(ws[24], p[30]); 2409| 3.38M| accum.mul(ws[25], p[29]); 2410| 3.38M| accum.mul(ws[26], p[28]); 2411| 3.38M| accum.mul(ws[27], p[27]); 2412| 3.38M| accum.mul(ws[28], p[26]); 2413| 3.38M| accum.mul(ws[29], p[25]); 2414| 3.38M| accum.mul(ws[30], p[24]); 2415| 3.38M| accum.mul(ws[31], p[23]); 2416| 3.38M| accum.add(z[54]); 2417| 3.38M| ws[22] = accum.extract(); 2418| 3.38M| accum.mul(ws[24], p[31]); 2419| 3.38M| accum.mul(ws[25], p[30]); 2420| 3.38M| accum.mul(ws[26], p[29]); 2421| 3.38M| accum.mul(ws[27], p[28]); 2422| 3.38M| accum.mul(ws[28], p[27]); 2423| 3.38M| accum.mul(ws[29], p[26]); 2424| 3.38M| accum.mul(ws[30], p[25]); 2425| 3.38M| accum.mul(ws[31], p[24]); 2426| 3.38M| accum.add(z[55]); 2427| 3.38M| ws[23] = accum.extract(); 2428| 3.38M| accum.mul(ws[25], p[31]); 2429| 3.38M| accum.mul(ws[26], p[30]); 2430| 3.38M| accum.mul(ws[27], p[29]); 2431| 3.38M| accum.mul(ws[28], p[28]); 2432| 3.38M| accum.mul(ws[29], p[27]); 2433| 3.38M| accum.mul(ws[30], p[26]); 2434| 3.38M| accum.mul(ws[31], p[25]); 2435| 3.38M| accum.add(z[56]); 2436| 3.38M| ws[24] = accum.extract(); 2437| 3.38M| accum.mul(ws[26], p[31]); 2438| 3.38M| accum.mul(ws[27], p[30]); 2439| 3.38M| accum.mul(ws[28], p[29]); 2440| 3.38M| accum.mul(ws[29], p[28]); 2441| 3.38M| accum.mul(ws[30], p[27]); 2442| 3.38M| accum.mul(ws[31], p[26]); 2443| 3.38M| accum.add(z[57]); 2444| 3.38M| ws[25] = accum.extract(); 2445| 3.38M| accum.mul(ws[27], p[31]); 2446| 3.38M| accum.mul(ws[28], p[30]); 2447| 3.38M| accum.mul(ws[29], p[29]); 2448| 3.38M| accum.mul(ws[30], p[28]); 2449| 3.38M| accum.mul(ws[31], p[27]); 2450| 3.38M| accum.add(z[58]); 2451| 3.38M| ws[26] = accum.extract(); 2452| 3.38M| accum.mul(ws[28], p[31]); 2453| 3.38M| accum.mul(ws[29], p[30]); 2454| 3.38M| accum.mul(ws[30], p[29]); 2455| 3.38M| accum.mul(ws[31], p[28]); 2456| 3.38M| accum.add(z[59]); 2457| 3.38M| ws[27] = accum.extract(); 2458| 3.38M| accum.mul(ws[29], p[31]); 2459| 3.38M| accum.mul(ws[30], p[30]); 2460| 3.38M| accum.mul(ws[31], p[29]); 2461| 3.38M| accum.add(z[60]); 2462| 3.38M| ws[28] = accum.extract(); 2463| 3.38M| accum.mul(ws[30], p[31]); 2464| 3.38M| accum.mul(ws[31], p[30]); 2465| 3.38M| accum.add(z[61]); 2466| 3.38M| ws[29] = accum.extract(); 2467| 3.38M| accum.mul(ws[31], p[31]); 2468| 3.38M| accum.add(z[62]); 2469| 3.38M| ws[30] = accum.extract(); 2470| 3.38M| accum.add(z[63]); 2471| 3.38M| ws[31] = accum.extract(); 2472| 3.38M| const word w1 = accum.extract(); 2473| 3.38M| bigint_monty_maybe_sub<32>(r, w1, ws, p); 2474| 3.38M|} _ZN5Botan17Barrett_ReductionC2ERKNS_6BigIntES1_m: 17| 901| 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| 901| m_modulus.grow_to(m_mod_words + 8); 20| 901| m_mu.grow_to(m_mod_words + 8); 21| 901|} _ZN5Botan17Barrett_Reduction18for_secret_modulusERKNS_6BigIntE: 23| 213|Barrett_Reduction Barrett_Reduction::for_secret_modulus(const BigInt& mod) { 24| 213| BOTAN_ARG_CHECK(mod.signum() > 0, "Modulus must be positive"); ------------------ | | 35| 213| do { \ | | 36| 213| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 213| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 213] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 213| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 213] | | ------------------ ------------------ 25| | 26| 213| const size_t mod_words = mod.sig_words(); 27| | 28| | // Compute mu = floor(2^{2k} / m) 29| 213| const size_t mu_bits = 2 * WordInfo::bits * mod_words; 30| 213| return Barrett_Reduction(mod, ct_divide_pow2k(mu_bits, mod), mod_words); 31| 213|} _ZN5Botan17Barrett_Reduction18for_public_modulusERKNS_6BigIntE: 33| 688|Barrett_Reduction Barrett_Reduction::for_public_modulus(const BigInt& mod) { 34| 688| BOTAN_ARG_CHECK(mod.signum() > 0, "Modulus must be positive"); ------------------ | | 35| 688| do { \ | | 36| 688| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 688| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 688] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 688| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 688] | | ------------------ ------------------ 35| | 36| 688| const size_t mod_words = mod.sig_words(); 37| | 38| | // Compute mu = floor(2^{2k} / m) 39| 688| const size_t mu_bits = 2 * WordInfo::bits * mod_words; 40| 688| return Barrett_Reduction(mod, vartime_divide_pow2k(mu_bits, mod), mod_words); 41| 688|} _ZNK5Botan17Barrett_Reduction8multiplyERKNS_6BigIntES3_: 159| 253k|BigInt Barrett_Reduction::multiply(const BigInt& x, const BigInt& y) const { 160| 253k| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett multiply"); ------------------ | | 35| 253k| do { \ | | 36| 253k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 253k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 253k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 253k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 253k] | | ------------------ ------------------ 161| 253k| BOTAN_ARG_CHECK(acceptable_barrett_input(y, m_modulus).as_bool(), "Invalid y param for Barrett multiply"); ------------------ | | 35| 253k| do { \ | | 36| 253k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 253k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 253k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 253k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 253k] | | ------------------ ------------------ 162| | 163| 253k| secure_vector ws(2 * (m_mod_words + 2)); 164| 253k| secure_vector xy(2 * m_mod_words); 165| | 166| 253k| bigint_mul(xy.data(), 167| 253k| xy.size(), 168| 253k| x._data(), 169| 253k| x.size(), 170| 253k| std::min(x.size(), m_mod_words), 171| 253k| y._data(), 172| 253k| y.size(), 173| 253k| std::min(y.size(), m_mod_words), 174| 253k| ws.data(), 175| 253k| ws.size()); 176| | 177| 253k| return barrett_reduce(m_mod_words, m_modulus, m_mu, xy, ws); 178| 253k|} _ZNK5Botan17Barrett_Reduction6squareERKNS_6BigIntE: 180| 499k|BigInt Barrett_Reduction::square(const BigInt& x) const { 181| 499k| BOTAN_ARG_CHECK(acceptable_barrett_input(x, m_modulus).as_bool(), "Invalid x param for Barrett square"); ------------------ | | 35| 499k| do { \ | | 36| 499k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 499k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 499k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 499k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 499k] | | ------------------ ------------------ 182| | 183| 499k| secure_vector ws(2 * (m_mod_words + 2)); 184| 499k| secure_vector x2(2 * m_mod_words); 185| | 186| 499k| bigint_sqr(x2.data(), x2.size(), x._data(), x.size(), std::min(x.size(), m_mod_words), ws.data(), ws.size()); 187| | 188| 499k| return barrett_reduce(m_mod_words, m_modulus, m_mu, x2, ws); 189| 499k|} _ZNK5Botan17Barrett_Reduction6reduceERKNS_6BigIntE: 191| 337k|BigInt Barrett_Reduction::reduce(const BigInt& x) const { 192| 337k| BOTAN_ARG_CHECK(x.signum() >= 0, "Argument must be non-negative"); ------------------ | | 35| 337k| do { \ | | 36| 337k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 337k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 337k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 337k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 337k] | | ------------------ ------------------ 193| | 194| 337k| const size_t x_sw = x.sig_words(); 195| 337k| BOTAN_ARG_CHECK(x_sw <= 2 * m_mod_words, "Argument is too large for Barrett reduction"); ------------------ | | 35| 337k| do { \ | | 36| 337k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 337k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 337k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 337k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 337k] | | ------------------ ------------------ 196| | 197| 337k| x.grow_to(2 * m_mod_words); 198| | 199| 337k| secure_vector ws; 200| 337k| return barrett_reduce(m_mod_words, m_modulus, m_mu, x._as_span(), ws); 201| 337k|} barrett.cpp:_ZN5Botan12_GLOBAL__N_124acceptable_barrett_inputERKNS_6BigIntES3_: 151| 1.00M|CT::Choice acceptable_barrett_input(const BigInt& x, const BigInt& modulus) { 152| 1.00M| auto x_is_positive = CT::Choice::from_int(static_cast(x.signum() >= 0)); 153| 1.00M| auto x_lt_mod = bigint_ct_is_lt(x._data(), x.size(), modulus._data(), modulus.sig_words()).as_choice(); 154| 1.00M| return x_is_positive && x_lt_mod; 155| 1.00M|} barrett.cpp:_ZN5Botan12_GLOBAL__N_114barrett_reduceEmRKNS_6BigIntES3_NSt3__14spanIKmLm18446744073709551615EEERNS4_6vectorImNS_16secure_allocatorImEEEE: 54| 1.09M| size_t mod_words, const BigInt& modulus, const BigInt& mu, std::span x_words, secure_vector& ws) { 55| 1.09M| BOTAN_ASSERT_NOMSG(modulus.sig_words() == mod_words); ------------------ | | 77| 1.09M| do { \ | | 78| 1.09M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.09M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.09M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.09M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.09M] | | ------------------ ------------------ 56| | 57| | // Caller must expand input to be at least this size 58| 1.09M| BOTAN_ASSERT_NOMSG(x_words.size() >= 2 * mod_words); ------------------ | | 77| 1.09M| do { \ | | 78| 1.09M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.09M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.09M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.09M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.09M] | | ------------------ ------------------ 59| | 60| | // Normally mod_words + 1 but can be + 2 if the modulus is a power of 2 61| 1.09M| const size_t mu_words = mu.sig_words(); 62| 1.09M| BOTAN_ASSERT_NOMSG(mu_words <= mod_words + 2); ------------------ | | 77| 1.09M| do { \ | | 78| 1.09M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.09M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.09M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.09M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.09M] | | ------------------ ------------------ 63| | 64| 1.09M| if(ws.size() < 2 * (mod_words + 2)) { ------------------ | Branch (64:7): [True: 337k, False: 752k] ------------------ 65| 337k| ws.resize(2 * (mod_words + 2)); 66| 337k| } 67| | 68| 1.09M| CT::poison(x_words); 69| | 70| | /* 71| | * Following the notation of Handbook of Applied Cryptography 72| | * Algorithm 14.42 "Barrett modular reduction", page 604 73| | * 74| | * 75| | * Using `mu` for μ in the code 76| | */ 77| | 78| | // Compute q1 = floor(x / 2^(k - 1)) which is equivalent to ignoring the low (k-1) words 79| | 80| | // 2 * mod_words + 1 is sufficient, extra is to enable Karatsuba 81| 1.09M| secure_vector r(2 * mu_words + 2); 82| | 83| 1.09M| copy_mem(r.data(), x_words.data() + (mod_words - 1), mod_words + 1); 84| | 85| | // Now compute q2 = q1 * μ 86| | 87| | // We allocate more size than required since this allows Karatsuba more often; 88| | // just `mu_words + (mod_words + 1)` is sufficient 89| 1.09M| const size_t q2_size = 2 * mu_words + 2; 90| | 91| 1.09M| secure_vector q2(q2_size); 92| | 93| 1.09M| bigint_mul( 94| 1.09M| q2.data(), q2.size(), r.data(), r.size(), mod_words + 1, mu._data(), mu.size(), mu_words, ws.data(), ws.size()); 95| | 96| | // Compute r2 = (floor(q2 / b^(k+1)) * m) mod 2^(k+1) 97| | // The division/floor is again effected by just ignoring the low k + 1 words 98| 1.09M| bigint_mul(r.data(), 99| 1.09M| r.size(), 100| 1.09M| &q2[mod_words + 1], // ignoring the low mod_words + 1 words of the first product 101| 1.09M| q2.size() - (mod_words + 1), 102| 1.09M| mod_words + 1, 103| 1.09M| modulus._data(), 104| 1.09M| modulus.size(), 105| 1.09M| mod_words, 106| 1.09M| ws.data(), 107| 1.09M| ws.size()); 108| | 109| | // Clear the high words of the product, equivalent to computing mod 2^(k+1) 110| | // TODO add masked mul to avoid computing high bits at all 111| 1.09M| clear_mem(std::span{r}.subspan(mod_words + 1)); 112| | 113| | // Compute r = r1 - r2 114| | 115| | // The return value of bigint_sub_abs isn't quite right for what we need here so first compare 116| 1.09M| const int32_t relative_size = bigint_cmp(r.data(), mod_words + 1, x_words.data(), mod_words + 1); 117| | 118| 1.09M| bigint_sub_abs(r.data(), r.data(), x_words.data(), mod_words + 1, ws.data()); 119| | 120| | /* 121| | If r is negative then we have to set r to r + 2^(k+1) 122| | 123| | However for r negative computing this sum is equivalent to computing 2^(k+1) - abs(r) 124| | */ 125| 1.09M| clear_mem(ws.data(), mod_words + 2); 126| 1.09M| ws[mod_words + 1] = 1; 127| 1.09M| bigint_sub2(ws.data(), mod_words + 2, r.data(), mod_words + 2); 128| | 129| | // If relative_size > 0 then assign r to 2^(k+1) - r 130| 1.09M| CT::Mask::is_equal(static_cast(relative_size), 1).select_n(r.data(), ws.data(), r.data(), mod_words + 2); 131| | 132| | /* 133| | * Per HAC Note 14.44 (ii) "step 4 is repeated at most twice since 0 ≤ r < 3m" 134| | */ 135| 1.09M| const size_t bound = 2; 136| | 137| 1.09M| BOTAN_ASSERT_NOMSG(r.size() >= mod_words + 1); ------------------ | | 77| 1.09M| do { \ | | 78| 1.09M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.09M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.09M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.09M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.09M] | | ------------------ ------------------ 138| 3.27M| for(size_t i = 0; i != bound; ++i) { ------------------ | Branch (138:22): [True: 2.18M, False: 1.09M] ------------------ 139| 2.18M| const word borrow = bigint_sub3(ws.data(), r.data(), mod_words + 1, modulus._data(), mod_words); 140| 2.18M| CT::Mask::is_zero(borrow).select_n(r.data(), ws.data(), r.data(), mod_words + 1); 141| 2.18M| } 142| | 143| 1.09M| CT::unpoison(q2); 144| 1.09M| CT::unpoison(r); 145| 1.09M| CT::unpoison(ws); 146| 1.09M| CT::unpoison(x_words); 147| | 148| 1.09M| return BigInt::_from_words(r); 149| 1.09M|} _ZN5Botan24inverse_mod_public_primeERKNS_6BigIntES2_: 294| 39|BigInt inverse_mod_public_prime(const BigInt& x, const BigInt& p) { 295| 39| BOTAN_ARG_CHECK(p.signum() > 0, "Modulus must be positive"); ------------------ | | 35| 39| do { \ | | 36| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 39| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 39] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 39| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 39] | | ------------------ ------------------ 296| 39| BOTAN_ARG_CHECK(x.signum() > 0, "Input must be positive"); ------------------ | | 35| 39| do { \ | | 36| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 39| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 39] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 39| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 39] | | ------------------ ------------------ 297| 39| BOTAN_ARG_CHECK(x < p, "Input must be less than modulus"); ------------------ | | 35| 39| do { \ | | 36| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 39| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 39] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 39| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 39] | | ------------------ ------------------ 298| 39| BOTAN_ARG_CHECK(p.is_odd() && p > 1, "Primes are odd integers greater than 1"); ------------------ | | 35| 39| do { \ | | 36| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 78| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 39, False: 0] | | | Branch (37:12): [True: 39, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 39| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 39] | | ------------------ ------------------ 299| | 300| | // TODO possibly use FLT, or the algorithm presented for this case in 301| | // Handbook of Elliptic and Hyperelliptic Curve Cryptography 302| | 303| 39| return inverse_mod_odd_modulus(x, p); 304| 39|} mod_inv.cpp:_ZN5Botan12_GLOBAL__N_123inverse_mod_odd_modulusERKNS_6BigIntES3_: 21| 39|BigInt inverse_mod_odd_modulus(const BigInt& n, const BigInt& mod) { 22| | // Caller should assure these preconditions: 23| 39| BOTAN_ASSERT_NOMSG(n.signum() >= 0); ------------------ | | 77| 39| do { \ | | 78| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 39| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 39] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 39| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 39] | | ------------------ ------------------ 24| 39| BOTAN_ASSERT_NOMSG(mod.signum() > 0); ------------------ | | 77| 39| do { \ | | 78| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 39| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 39] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 39| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 39] | | ------------------ ------------------ 25| 39| BOTAN_ASSERT_NOMSG(n < mod); ------------------ | | 77| 39| do { \ | | 78| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 39| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 39] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 39| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 39] | | ------------------ ------------------ 26| 39| BOTAN_ASSERT_NOMSG(mod >= 3 && mod.is_odd()); ------------------ | | 77| 39| do { \ | | 78| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 78| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 39, False: 0] | | | Branch (79:12): [True: 39, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 39| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 39] | | ------------------ ------------------ 27| | 28| | /* 29| | This uses a modular inversion algorithm designed by Niels Möller 30| | and implemented in Nettle. The same algorithm was later also 31| | adapted to GMP in mpn_sec_invert. 32| | 33| | It can be easily implemented in a way that does not depend on 34| | secret branches or memory lookups, providing resistance against 35| | some forms of side channel attack. 36| | 37| | There is also a description of the algorithm in Appendix 5 of "Fast 38| | Software Polynomial Multiplication on ARM Processors using the NEON Engine" 39| | by Danilo Câmara, Conrado P. L. Gouvêa, Julio López, and Ricardo 40| | Dahab in LNCS 8182 41| | https://inria.hal.science/hal-01506572/document 42| | 43| | Thanks to Niels for creating the algorithm, explaining some things 44| | about it, and the reference to the paper. 45| | */ 46| | 47| 39| const size_t mod_words = mod.sig_words(); 48| 39| BOTAN_ASSERT(mod_words > 0, "Not empty"); ------------------ | | 64| 39| do { \ | | 65| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 39| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 39] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 39| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 39] | | ------------------ ------------------ 49| | 50| 39| secure_vector tmp_mem(5 * mod_words); 51| | 52| 39| word* v_w = &tmp_mem[0]; // NOLINT(readability-container-data-pointer) 53| 39| word* u_w = &tmp_mem[1 * mod_words]; 54| 39| word* b_w = &tmp_mem[2 * mod_words]; 55| 39| word* a_w = &tmp_mem[3 * mod_words]; 56| 39| word* mp1o2 = &tmp_mem[4 * mod_words]; 57| | 58| 39| copy_mem(a_w, n._data(), std::min(n.size(), mod_words)); 59| 39| copy_mem(b_w, mod._data(), std::min(mod.size(), mod_words)); 60| 39| u_w[0] = 1; 61| | // v_w = 0 62| | 63| | // compute (mod + 1) / 2 which [because mod is odd] is equal to 64| | // (mod / 2) + 1 65| 39| copy_mem(mp1o2, mod._data(), std::min(mod.size(), mod_words)); 66| 39| bigint_shr1(mp1o2, mod_words, 1); 67| 39| const word carry = bigint_add2(mp1o2, mod_words, u_w, 1); 68| 39| BOTAN_ASSERT_NOMSG(carry == 0); ------------------ | | 77| 39| do { \ | | 78| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 39| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 39] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 39| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 39] | | ------------------ ------------------ 69| | 70| 39| CT::poison(tmp_mem.data(), tmp_mem.size()); 71| | 72| | // Only n.bits() + mod.bits() iterations are required, but avoid leaking the size of n 73| 39| const size_t execs = 2 * mod.bits(); 74| | 75| 168k| for(size_t i = 0; i != execs; ++i) { ------------------ | Branch (75:22): [True: 168k, False: 39] ------------------ 76| 168k| const word odd_a = a_w[0] & 1; 77| | 78| | //if(odd_a) a -= b 79| 168k| const word underflow = bigint_cnd_sub(odd_a, a_w, b_w, mod_words); 80| | 81| | //if(underflow) { b -= a; a = abs(a); swap(u, v); } 82| 168k| bigint_cnd_add(underflow, b_w, a_w, mod_words); 83| 168k| bigint_cnd_abs(underflow, a_w, mod_words); 84| 168k| bigint_cnd_swap(underflow, u_w, v_w, mod_words); 85| | 86| | // a >>= 1 87| 168k| bigint_shr1(a_w, mod_words, 1); 88| | 89| | //if(odd_a) u -= v; 90| 168k| const word borrow = bigint_cnd_sub(odd_a, u_w, v_w, mod_words); 91| | 92| | // if(borrow) u += p 93| 168k| bigint_cnd_add(borrow, u_w, mod._data(), mod_words); 94| | 95| 168k| const word odd_u = u_w[0] & 1; 96| | 97| | // u >>= 1 98| 168k| bigint_shr1(u_w, mod_words, 1); 99| | 100| | //if(odd_u) u += mp1o2; 101| 168k| bigint_cnd_add(odd_u, u_w, mp1o2, mod_words); 102| 168k| } 103| | 104| 39| const auto a_is_0 = CT::all_zeros(a_w, mod_words); 105| | 106| 39| auto b_is_1 = CT::Mask::is_equal(b_w[0], 1); 107| 1.32k| for(size_t i = 1; i != mod_words; ++i) { ------------------ | Branch (107:22): [True: 1.29k, False: 39] ------------------ 108| 1.29k| b_is_1 &= CT::Mask::is_zero(b_w[i]); 109| 1.29k| } 110| | 111| 39| BOTAN_ASSERT(a_is_0.as_bool(), "A is zero"); ------------------ | | 64| 39| do { \ | | 65| 39| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 39| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 39] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 39| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 39] | | ------------------ ------------------ 112| | 113| | // if b != 1 then gcd(n,mod) > 1 and inverse does not exist 114| | // in which case zero out the result to indicate this 115| 39| (~b_is_1).if_set_zero_out(v_w, mod_words); 116| | 117| | /* 118| | * We've placed the result in the lowest words of the temp buffer. 119| | * So just clear out the other values and then give that buffer to a 120| | * BigInt. 121| | */ 122| 39| clear_mem(&tmp_mem[mod_words], 4 * mod_words); 123| | 124| 39| CT::unpoison(tmp_mem.data(), tmp_mem.size()); 125| | 126| 39| BigInt r; 127| 39| r.swap_reg(tmp_mem); 128| 39| return r; 129| 39|} _ZN5Botan17Montgomery_Params4DataC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 40| 842|Montgomery_Params::Data::Data(const BigInt& p, const Barrett_Reduction& mod_p) { 41| 842| if(p.is_even() || p < 3) { ------------------ | Branch (41:7): [True: 0, False: 842] | Branch (41:22): [True: 0, False: 842] ------------------ 42| 0| throw Invalid_Argument("Montgomery_Params invalid modulus"); 43| 0| } 44| | 45| 842| m_p = p; 46| 842| m_p_words = m_p.sig_words(); 47| 842| m_p_dash = monty_inverse(m_p.word_at(0)); 48| | 49| 842| const BigInt r = BigInt::power_of_2(m_p_words * WordInfo::bits); 50| | 51| 842| m_r1 = mod_p.reduce(r); 52| 842| m_r2 = mod_p.square(m_r1); 53| 842| m_r3 = mod_p.multiply(m_r1, m_r2); 54| | 55| | // Barrett should be at least zero prefixing up to modulus size 56| 842| BOTAN_ASSERT_NOMSG(m_r1.size() >= m_p_words); ------------------ | | 77| 842| do { \ | | 78| 842| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 842| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 842] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 842| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 842] | | ------------------ ------------------ 57| 842| BOTAN_ASSERT_NOMSG(m_r2.size() >= m_p_words); ------------------ | | 77| 842| do { \ | | 78| 842| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 842| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 842] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 842| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 842] | | ------------------ ------------------ 58| 842| BOTAN_ASSERT_NOMSG(m_r3.size() >= m_p_words); ------------------ | | 77| 842| do { \ | | 78| 842| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 842| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 842] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 842| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 842] | | ------------------ ------------------ 59| 842|} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntERKNS_17Barrett_ReductionE: 62| 842| m_data(std::make_shared(p, mod_p)) {} _ZN5Botan17Montgomery_ParamsC2ERKNS_6BigIntE: 65| 2| Montgomery_Params(p, Barrett_Reduction::for_secret_modulus(p)) {} _ZNK5Botan17Montgomery_ParamseqERKS0_: 67| 24.1k|bool Montgomery_Params::operator==(const Montgomery_Params& other) const { 68| 24.1k| if(this->m_data == other.m_data) { ------------------ | Branch (68:7): [True: 24.1k, False: 0] ------------------ 69| 24.1k| return true; 70| 24.1k| } 71| | 72| 0| return (this->m_data->p() == other.m_data->p()); 73| 24.1k|} _ZNK5Botan17Montgomery_Params3mulERKNS_6BigIntES3_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 1.71k|BigInt Montgomery_Params::mul(const BigInt& x, const BigInt& y, secure_vector& ws) const { 91| 1.71k| const size_t p_size = this->p_words(); 92| 1.71k| BigInt z = BigInt::with_capacity(2 * p_size); 93| 1.71k| this->mul(z, x, y, ws); 94| 1.71k| return z; 95| 1.71k|} _ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_S4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 97| 6.98k|void Montgomery_Params::mul(BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) const { 98| 6.98k| BOTAN_ARG_CHECK(&z != &x && &z != &y, "Montgomery_Params::mul output must not alias inputs"); ------------------ | | 35| 6.98k| do { \ | | 36| 6.98k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 13.9k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 6.98k, False: 0] | | | Branch (37:12): [True: 6.98k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 6.98k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 6.98k] | | ------------------ ------------------ 99| | 100| 6.98k| const size_t p_size = this->p_words(); 101| | 102| 6.98k| if(ws.size() < 2 * p_size) { ------------------ | Branch (102:7): [True: 7, False: 6.97k] ------------------ 103| 7| ws.resize(2 * p_size); 104| 7| } 105| | 106| 6.98k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 130| 6.98k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 6.98k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 6.98k] | | ------------------ ------------------ 107| 6.98k| BOTAN_DEBUG_ASSERT(y.sig_words() <= p_size); ------------------ | | 130| 6.98k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 6.98k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 6.98k] | | ------------------ ------------------ 108| | 109| 6.98k| if(z.size() < 2 * p_size) { ------------------ | Branch (109:7): [True: 568, False: 6.41k] ------------------ 110| 568| z.grow_to(2 * p_size); 111| 568| } 112| | 113| 6.98k| bigint_mul(z.mutable_data(), 114| 6.98k| z.size(), 115| 6.98k| x._data(), 116| 6.98k| x.size(), 117| 6.98k| std::min(p_size, x.size()), 118| 6.98k| y._data(), 119| 6.98k| y.size(), 120| 6.98k| std::min(p_size, y.size()), 121| 6.98k| ws.data(), 122| 6.98k| ws.size()); 123| | 124| 6.98k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 125| 6.98k|} _ZNK5Botan17Montgomery_Params3mulERNS_6BigIntERKS1_NSt3__14spanIKmLm18446744073709551615EEERNS5_6vectorImNS_16secure_allocatorImEEEE: 127| 1.29k|void Montgomery_Params::mul(BigInt& z, const BigInt& x, std::span y, secure_vector& ws) const { 128| 1.29k| BOTAN_ARG_CHECK(&z != &x, "Montgomery_Params::mul output must not alias x"); ------------------ | | 35| 1.29k| do { \ | | 36| 1.29k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.29k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.29k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.29k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.29k] | | ------------------ ------------------ 129| 1.29k| BOTAN_ARG_CHECK(!ranges_overlap(z._data(), z.size(), y.data(), y.size()), ------------------ | | 35| 1.29k| do { \ | | 36| 1.29k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1.29k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1.29k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1.29k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1.29k] | | ------------------ ------------------ 130| 1.29k| "Montgomery_Params::mul output must not overlap y"); 131| | 132| 1.29k| const size_t p_size = this->p_words(); 133| | 134| 1.29k| if(ws.size() < 2 * p_size) { ------------------ | Branch (134:7): [True: 0, False: 1.29k] ------------------ 135| 0| ws.resize(2 * p_size); 136| 0| } 137| 1.29k| if(z.size() < 2 * p_size) { ------------------ | Branch (137:7): [True: 0, False: 1.29k] ------------------ 138| 0| z.grow_to(2 * p_size); 139| 0| } 140| | 141| 1.29k| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 130| 1.29k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 1.29k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 1.29k] | | ------------------ ------------------ 142| | 143| 1.29k| bigint_mul(z.mutable_data(), 144| 1.29k| z.size(), 145| 1.29k| x._data(), 146| 1.29k| x.size(), 147| 1.29k| std::min(p_size, x.size()), 148| 1.29k| y.data(), 149| 1.29k| y.size(), 150| 1.29k| std::min(p_size, y.size()), 151| 1.29k| ws.data(), 152| 1.29k| ws.size()); 153| | 154| 1.29k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 155| 1.29k|} _ZNK5Botan17Montgomery_Params6mul_byERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 157| 12|void Montgomery_Params::mul_by(BigInt& x, const BigInt& y, secure_vector& ws) const { 158| 12| const size_t p_size = this->p_words(); 159| | 160| 12| if(ws.size() < 4 * p_size) { ------------------ | Branch (160:7): [True: 6, False: 6] ------------------ 161| 6| ws.resize(4 * p_size); 162| 6| } 163| | 164| 12| word* z_data = ws.data(); 165| 12| word* ws_data = &ws[2 * p_size]; 166| | 167| 12| BOTAN_DEBUG_ASSERT(x.sig_words() <= p_size); ------------------ | | 130| 12| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 12| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 12] | | ------------------ ------------------ 168| | 169| 12| bigint_mul(z_data, 170| 12| 2 * p_size, 171| 12| x._data(), 172| 12| x.size(), 173| 12| std::min(p_size, x.size()), 174| 12| y._data(), 175| 12| y.size(), 176| 12| std::min(p_size, y.size()), 177| 12| ws_data, 178| 12| 2 * p_size); 179| | 180| 12| bigint_monty_redc_inplace(z_data, this->p()._data(), p_size, this->p_dash(), ws_data, 2 * p_size); 181| | 182| 12| if(x.size() < 2 * p_size) { ------------------ | Branch (182:7): [True: 4, False: 8] ------------------ 183| 4| x.grow_to(2 * p_size); 184| 4| } 185| 12| copy_mem(x.mutable_data(), z_data, 2 * p_size); 186| 12|} _ZNK5Botan17Montgomery_Params3sqrERNS_6BigIntERKS1_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 200| 2.51k|void Montgomery_Params::sqr(BigInt& z, const BigInt& x, secure_vector& ws) const { 201| 2.51k| BOTAN_ARG_CHECK(&z != &x, "Montgomery_Params::sqr output must not alias input"); ------------------ | | 35| 2.51k| do { \ | | 36| 2.51k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.51k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.51k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.51k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.51k] | | ------------------ ------------------ 202| 2.51k| this->sqr(z, std::span{x._data(), x.size()}, ws); 203| 2.51k|} _ZNK5Botan17Montgomery_Params3sqrERNS_6BigIntENSt3__14spanIKmLm18446744073709551615EEERNS3_6vectorImNS_16secure_allocatorImEEEE: 205| 2.83k|void Montgomery_Params::sqr(BigInt& z, std::span x, secure_vector& ws) const { 206| 2.83k| BOTAN_ARG_CHECK(!ranges_overlap(z._data(), z.size(), x.data(), x.size()), ------------------ | | 35| 2.83k| do { \ | | 36| 2.83k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.83k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.83k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.83k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.83k] | | ------------------ ------------------ 207| 2.83k| "Montgomery_Params::sqr output must not overlap input"); 208| | 209| 2.83k| const size_t p_size = this->p_words(); 210| | 211| 2.83k| if(ws.size() < 2 * p_size) { ------------------ | Branch (211:7): [True: 0, False: 2.83k] ------------------ 212| 0| ws.resize(2 * p_size); 213| 0| } 214| | 215| 2.83k| if(z.size() < 2 * p_size) { ------------------ | Branch (215:7): [True: 244, False: 2.59k] ------------------ 216| 244| z.grow_to(2 * p_size); 217| 244| } 218| | 219| 2.83k| bigint_sqr(z.mutable_data(), z.size(), x.data(), x.size(), std::min(p_size, x.size()), ws.data(), ws.size()); 220| | 221| 2.83k| bigint_monty_redc_inplace(z.mutable_data(), this->p()._data(), p_size, this->p_dash(), ws.data(), ws.size()); 222| 2.83k|} _ZN5Botan14Montgomery_IntC2ERKNS_17Montgomery_ParamsENSt3__16vectorImNS_16secure_allocatorImEEEE: 227| 20.8k| m_params(params), m_v(std::move(words)) { 228| 20.8k| BOTAN_ASSERT_NOMSG(m_v.size() == m_params.p_words()); ------------------ | | 77| 20.8k| do { \ | | 78| 20.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 20.8k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 20.8k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 20.8k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 20.8k] | | ------------------ ------------------ 229| 20.8k|} _ZN5Botan14Montgomery_Int3oneERKNS_17Montgomery_ParamsE: 231| 3.27k|Montgomery_Int Montgomery_Int::one(const Montgomery_Params& params) { 232| 3.27k| return Montgomery_Int(params, params.R1(), false); 233| 3.27k|} _ZN5Botan14Montgomery_IntC2ERKNS_17Montgomery_ParamsERKNS_6BigIntEb: 242| 6.55k| m_params(params), m_v(m_params.p_words()) { 243| 6.55k| BOTAN_ARG_CHECK(v.signum() >= 0 && v < m_params.p(), "Input out of range"); ------------------ | | 35| 6.55k| do { \ | | 36| 6.55k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 13.1k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 6.55k, False: 0] | | | Branch (37:12): [True: 6.55k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 6.55k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 6.55k] | | ------------------ ------------------ 244| | 245| 6.55k| const size_t p_size = m_params.p_words(); 246| | 247| 6.55k| auto v_span = v._as_span(); 248| | 249| 6.55k| if(v_span.size() > p_size) { ------------------ | Branch (249:7): [True: 5.99k, False: 557] ------------------ 250| | // Safe to truncate the span since we already checked v < p 251| 5.99k| v_span = v_span.first(p_size); 252| 5.99k| } 253| | 254| 6.55k| BOTAN_ASSERT_NOMSG(m_v.size() >= v_span.size()); ------------------ | | 77| 6.55k| do { \ | | 78| 6.55k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 6.55k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 6.55k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 6.55k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 6.55k] | | ------------------ ------------------ 255| | 256| 6.55k| copy_mem(std::span{m_v}.first(v_span.size()), v_span); 257| | 258| 6.55k| if(redc_needed) { ------------------ | Branch (258:7): [True: 3.27k, False: 3.27k] ------------------ 259| 3.27k| secure_vector ws; 260| 3.27k| this->mul_by(m_params.R2()._as_span().first(p_size), ws); 261| 3.27k| } 262| 6.55k|} _ZN5Botan14Montgomery_IntC2ERKNS_17Montgomery_ParamsENSt3__14spanIKmLm18446744073709551615EEE: 265| 2.75k| m_params(params), m_v(words.begin(), words.end()) { 266| 2.75k| BOTAN_ARG_CHECK(m_v.size() == m_params.p_words(), "Invalid input span"); ------------------ | | 35| 2.75k| do { \ | | 36| 2.75k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.75k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.75k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.75k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.75k] | | ------------------ ------------------ 267| 2.75k|} _ZNK5Botan14Montgomery_Int5valueEv: 273| 6.78k|BigInt Montgomery_Int::value() const { 274| 6.78k| secure_vector ws(m_params.p_words()); 275| | 276| 6.78k| secure_vector z = m_v; 277| 6.78k| z.resize(2 * m_params.p_words()); // zero extend 278| | 279| 6.78k| bigint_monty_redc_inplace( 280| 6.78k| z.data(), m_params.p()._data(), m_params.p_words(), m_params.p_dash(), ws.data(), ws.size()); 281| | 282| 6.78k| return BigInt::_from_words(z); 283| 6.78k|} _ZNK5Botan14Montgomery_Int3mulERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 320| 20.8k|Montgomery_Int Montgomery_Int::mul(const Montgomery_Int& other, secure_vector& ws) const { 321| 20.8k| BOTAN_STATE_CHECK(other.m_params == m_params); ------------------ | | 51| 20.8k| do { \ | | 52| 20.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 20.8k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 20.8k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 20.8k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 20.8k] | | ------------------ ------------------ 322| | 323| 20.8k| const size_t p_size = m_params.p_words(); 324| 20.8k| BOTAN_ASSERT_NOMSG(m_v.size() == p_size && other.m_v.size() == p_size); ------------------ | | 77| 20.8k| do { \ | | 78| 20.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 41.6k| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 20.8k, False: 0] | | | Branch (79:12): [True: 20.8k, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 20.8k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 20.8k] | | ------------------ ------------------ 325| | 326| 20.8k| if(ws.size() < 2 * p_size) { ------------------ | Branch (326:7): [True: 0, False: 20.8k] ------------------ 327| 0| ws.resize(2 * p_size); 328| 0| } 329| | 330| 20.8k| secure_vector z(2 * p_size); 331| | 332| 20.8k| bigint_mul(z.data(), z.size(), m_v.data(), p_size, p_size, other.m_v.data(), p_size, p_size, ws.data(), ws.size()); 333| | 334| 20.8k| bigint_monty_redc_inplace(z.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 335| 20.8k| z.resize(p_size); // truncate off high zero words 336| | 337| 20.8k| return Montgomery_Int(m_params, std::move(z)); 338| 20.8k|} _ZN5Botan14Montgomery_Int6mul_byERKS0_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 340| 3.36k|Montgomery_Int& Montgomery_Int::mul_by(const Montgomery_Int& other, secure_vector& ws) { 341| 3.36k| BOTAN_STATE_CHECK(other.m_params == m_params); ------------------ | | 51| 3.36k| do { \ | | 52| 3.36k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 3.36k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 3.36k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 3.36k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 3.36k] | | ------------------ ------------------ 342| 3.36k| return this->mul_by(std::span{other.m_v}, ws); 343| 3.36k|} _ZN5Botan14Montgomery_Int6mul_byENSt3__14spanIKmLm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEE: 345| 1.51M|Montgomery_Int& Montgomery_Int::mul_by(std::span other, secure_vector& ws) { 346| 1.51M| const size_t p_size = m_params.p_words(); 347| 1.51M| BOTAN_ASSERT_NOMSG(m_v.size() == p_size && other.size() == p_size); ------------------ | | 77| 1.51M| do { \ | | 78| 1.51M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 3.02M| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 1.51M, False: 0] | | | Branch (79:12): [True: 1.51M, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.51M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.51M] | | ------------------ ------------------ 348| | 349| 1.51M| if(ws.size() < 2 * p_size) { ------------------ | Branch (349:7): [True: 3.27k, False: 1.51M] ------------------ 350| 3.27k| ws.resize(2 * p_size); 351| 3.27k| } 352| | 353| 1.51M| auto do_mul_by = [&](std::span z) { 354| 1.51M| bigint_mul(z.data(), z.size(), m_v.data(), p_size, p_size, other.data(), p_size, p_size, ws.data(), ws.size()); 355| | 356| 1.51M| bigint_monty_redc_inplace(z.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 357| | 358| 1.51M| copy_mem(m_v, z.first(p_size)); 359| 1.51M| }; 360| | 361| 1.51M| if(p_size <= MontgomeryUseStackLimit) { ------------------ | Branch (361:7): [True: 672k, False: 842k] ------------------ 362| 672k| std::array z{}; 363| 672k| do_mul_by(z); 364| 842k| } else { 365| 842k| secure_vector z(2 * p_size); 366| 842k| do_mul_by(z); 367| 842k| } 368| | 369| 1.51M| return (*this); 370| 1.51M|} _ZN5Botan14Montgomery_Int19square_this_n_timesERNSt3__16vectorImNS_16secure_allocatorImEEEEm: 372| 1.53M|Montgomery_Int& Montgomery_Int::square_this_n_times(secure_vector& ws, size_t n) { 373| 1.53M| const size_t p_size = m_params.p_words(); 374| 1.53M| BOTAN_ASSERT_NOMSG(m_v.size() == p_size); ------------------ | | 77| 1.53M| do { \ | | 78| 1.53M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.53M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.53M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.53M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.53M] | | ------------------ ------------------ 375| | 376| 1.53M| if(ws.size() < 2 * p_size) { ------------------ | Branch (376:7): [True: 0, False: 1.53M] ------------------ 377| 0| ws.resize(2 * p_size); 378| 0| } 379| | 380| 1.53M| auto do_sqr_n = [&](std::span z) { 381| 1.53M| for(size_t i = 0; i != n; ++i) { 382| 1.53M| bigint_sqr(z.data(), 2 * p_size, m_v.data(), p_size, p_size, ws.data(), ws.size()); 383| | 384| 1.53M| bigint_monty_redc_inplace(z.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 385| | 386| 1.53M| copy_mem(m_v, std::span{z}.first(p_size)); 387| 1.53M| } 388| 1.53M| }; 389| | 390| 1.53M| if(p_size <= MontgomeryUseStackLimit) { ------------------ | Branch (390:7): [True: 684k, False: 852k] ------------------ 391| 684k| std::array z{}; 392| 684k| do_sqr_n(z); 393| 852k| } else { 394| 852k| secure_vector z(2 * p_size); 395| 852k| do_sqr_n(z); 396| 852k| } 397| | 398| 1.53M| return (*this); 399| 1.53M|} _ZNK5Botan14Montgomery_Int6squareERNSt3__16vectorImNS_16secure_allocatorImEEEE: 401| 20.8k|Montgomery_Int Montgomery_Int::square(secure_vector& ws) const { 402| 20.8k| auto z = (*this); 403| 20.8k| z.square_this_n_times(ws, 1); 404| 20.8k| return z; 405| 20.8k|} monty.cpp:_ZN5Botan12_GLOBAL__N_114ranges_overlapEPKmmS2_m: 30| 4.13k|bool ranges_overlap(const word* a, size_t na, const word* b, size_t nb) { 31| 4.13k| if(na == 0 || nb == 0) { ------------------ | Branch (31:7): [True: 1, False: 4.13k] | Branch (31:18): [True: 0, False: 4.13k] ------------------ 32| 1| return false; 33| 1| } 34| 4.13k| const std::less lt; // NOLINT(modernize-use-transparent-functors) 35| 4.13k| return lt(a, b + nb) && lt(b, a + na); ------------------ | Branch (35:11): [True: 3.13k, False: 991] | Branch (35:28): [True: 0, False: 3.13k] ------------------ 36| 4.13k|} monty.cpp:_ZZN5Botan14Montgomery_Int6mul_byENSt3__14spanIKmLm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEEENK3$_0clENS2_ImLm18446744073709551615EEE: 353| 1.51M| auto do_mul_by = [&](std::span z) { 354| 1.51M| bigint_mul(z.data(), z.size(), m_v.data(), p_size, p_size, other.data(), p_size, p_size, ws.data(), ws.size()); 355| | 356| 1.51M| bigint_monty_redc_inplace(z.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 357| | 358| 1.51M| copy_mem(m_v, z.first(p_size)); 359| 1.51M| }; monty.cpp:_ZZN5Botan14Montgomery_Int19square_this_n_timesERNSt3__16vectorImNS_16secure_allocatorImEEEEmENK3$_0clENS1_4spanImLm18446744073709551615EEE: 380| 1.53M| auto do_sqr_n = [&](std::span z) { 381| 7.60M| for(size_t i = 0; i != n; ++i) { ------------------ | Branch (381:25): [True: 6.06M, False: 1.53M] ------------------ 382| 6.06M| bigint_sqr(z.data(), 2 * p_size, m_v.data(), p_size, p_size, ws.data(), ws.size()); 383| | 384| 6.06M| bigint_monty_redc_inplace(z.data(), m_params.p()._data(), p_size, m_params.p_dash(), ws.data(), ws.size()); 385| | 386| 6.06M| copy_mem(m_v, std::span{z}.first(p_size)); 387| 6.06M| } 388| 1.53M| }; _ZN5Botan31Montgomery_Exponentiation_StateC2ERKNS_14Montgomery_IntEmb: 36| 3.27k| m_params(g._params()), m_window_bits(window_bits == 0 ? 4 : window_bits) { ------------------ | Branch (36:44): [True: 0, False: 3.27k] ------------------ 37| 3.27k| if(m_window_bits < 1 || m_window_bits > 12) { // really even 8 is too large ... ------------------ | Branch (37:7): [True: 0, False: 3.27k] | Branch (37:28): [True: 0, False: 3.27k] ------------------ 38| 0| throw Invalid_Argument("Invalid window bits for Montgomery exponentiation"); 39| 0| } 40| | 41| 3.27k| const size_t window_size = (static_cast(1) << m_window_bits); 42| | 43| 3.27k| m_g.reserve(window_size); 44| | 45| 3.27k| m_g.push_back(Montgomery_Int::one(m_params)); 46| | 47| 3.27k| m_g.push_back(g); 48| | 49| 3.27k| secure_vector ws(2 * m_params.p_words()); 50| | 51| 44.9k| for(size_t i = 2; i != window_size; ++i) { ------------------ | Branch (51:22): [True: 41.6k, False: 3.27k] ------------------ 52| 41.6k| if(i % 2 == 0) { ------------------ | Branch (52:10): [True: 20.8k, False: 20.8k] ------------------ 53| 20.8k| m_g.push_back(m_g[i / 2].square(ws)); 54| 20.8k| } else { 55| 20.8k| m_g.push_back(m_g[1].mul(m_g[i - 1], ws)); 56| 20.8k| } 57| 41.6k| } 58| | 59| 3.27k| if(const_time) { ------------------ | Branch (59:7): [True: 2.97k, False: 300] ------------------ 60| 2.97k| CT::poison_range(m_g); 61| 2.97k| } 62| 3.27k|} _ZNK5Botan31Montgomery_Exponentiation_State14exponentiationERKNS_6BigIntEm: 91| 2.75k|Montgomery_Int Montgomery_Exponentiation_State::exponentiation(const BigInt& scalar, size_t max_k_bits) const { 92| 2.75k| BOTAN_ARG_CHECK(scalar.signum() >= 0, "Invalid scalar for Montgomery exponentiation"); ------------------ | | 35| 2.75k| do { \ | | 36| 2.75k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 2.75k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 2.75k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2.75k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2.75k] | | ------------------ ------------------ 93| 2.75k| BOTAN_DEBUG_ASSERT(scalar.bits() <= max_k_bits); ------------------ | | 130| 2.75k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 2.75k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 2.75k] | | ------------------ ------------------ 94| | // TODO add a const-time implementation of above assert and use it in release builds 95| | 96| 2.75k| const size_t exp_nibbles = (max_k_bits + m_window_bits - 1) / m_window_bits; 97| | 98| 2.75k| if(exp_nibbles == 0) { ------------------ | Branch (98:7): [True: 0, False: 2.75k] ------------------ 99| 0| return Montgomery_Int::one(m_params); 100| 0| } 101| | 102| 2.75k| secure_vector e_bits(m_params.p_words()); 103| 2.75k| secure_vector ws(2 * m_params.p_words()); 104| | 105| 2.75k| const_time_lookup(e_bits, m_g, scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)); 106| 2.75k| Montgomery_Int x(m_params, std::span{e_bits}); 107| | 108| 1.51M| for(size_t i = exp_nibbles - 1; i > 0; --i) { ------------------ | Branch (108:36): [True: 1.50M, False: 2.75k] ------------------ 109| 1.50M| x.square_this_n_times(ws, m_window_bits); 110| 1.50M| const_time_lookup(e_bits, m_g, scalar.get_substring(m_window_bits * (i - 1), m_window_bits)); 111| 1.50M| x.mul_by(e_bits, ws); 112| 1.50M| } 113| | 114| 2.75k| CT::unpoison(x); 115| 2.75k| return x; 116| 2.75k|} _ZNK5Botan31Montgomery_Exponentiation_State22exponentiation_vartimeERKNS_6BigIntE: 118| 4.02k|Montgomery_Int Montgomery_Exponentiation_State::exponentiation_vartime(const BigInt& scalar) const { 119| 4.02k| const size_t exp_nibbles = (scalar.bits() + m_window_bits - 1) / m_window_bits; 120| | 121| 4.02k| secure_vector ws(2 * m_params.p_words()); 122| | 123| 4.02k| if(exp_nibbles == 0) { ------------------ | Branch (123:7): [True: 0, False: 4.02k] ------------------ 124| 0| return Montgomery_Int::one(m_params); 125| 0| } 126| | 127| 4.02k| Montgomery_Int x = m_g[scalar.get_substring(m_window_bits * (exp_nibbles - 1), m_window_bits)]; 128| | 129| 12.0k| for(size_t i = exp_nibbles - 1; i > 0; --i) { ------------------ | Branch (129:36): [True: 8.07k, False: 4.02k] ------------------ 130| 8.07k| x.square_this_n_times(ws, m_window_bits); 131| | 132| 8.07k| const uint32_t nibble = scalar.get_substring(m_window_bits * (i - 1), m_window_bits); 133| 8.07k| if(nibble > 0) { ------------------ | Branch (133:10): [True: 3.36k, False: 4.71k] ------------------ 134| 3.36k| x.mul_by(m_g[nibble], ws); 135| 3.36k| } 136| 8.07k| } 137| | 138| 4.02k| CT::unpoison(x); 139| 4.02k| return x; 140| 4.02k|} _ZN5Botan16monty_precomputeERKNS_14Montgomery_IntEmb: 144| 3.27k| bool const_time) { 145| 3.27k| return std::make_shared(g, window_bits, const_time); 146| 3.27k|} _ZN5Botan16monty_precomputeERKNS_17Montgomery_ParamsERKNS_6BigIntEmb: 151| 3.27k| bool const_time) { 152| 3.27k| BOTAN_ARG_CHECK(g.signum() >= 0 && g < params.p(), "Montgomery exponentiation base integer out of range"); ------------------ | | 35| 3.27k| do { \ | | 36| 3.27k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 6.55k| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 3.27k, False: 0] | | | Branch (37:12): [True: 3.27k, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3.27k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3.27k] | | ------------------ ------------------ 153| 3.27k| const Montgomery_Int monty_g(params, g); 154| 3.27k| return monty_precompute(monty_g, window_bits, const_time); 155| 3.27k|} _ZN5Botan13monty_executeERKNS_31Montgomery_Exponentiation_StateERKNS_6BigIntEm: 159| 2.75k| size_t max_k_bits) { 160| 2.75k| return precomputed_state.exponentiation(k, max_k_bits); 161| 2.75k|} _ZN5Botan21monty_execute_vartimeERKNS_31Montgomery_Exponentiation_StateERKNS_6BigIntE: 163| 4.02k|Montgomery_Int monty_execute_vartime(const Montgomery_Exponentiation_State& precomputed_state, const BigInt& k) { 164| 4.02k| return precomputed_state.exponentiation_vartime(k); 165| 4.02k|} monty_exp.cpp:_ZN5Botan12_GLOBAL__N_117const_time_lookupERNSt3__16vectorImNS_16secure_allocatorImEEEERKNS2_INS_14Montgomery_IntENS1_9allocatorIS7_EEEEm: 66| 1.51M|void const_time_lookup(secure_vector& output, const std::vector& g, size_t nibble) { 67| 1.51M| BOTAN_ASSERT_NOMSG(g.size() % 2 == 0); // actually a power of 2 ------------------ | | 77| 1.51M| do { \ | | 78| 1.51M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 1.51M| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 1.51M] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1.51M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1.51M] | | ------------------ ------------------ 68| | 69| 1.51M| const size_t words = output.size(); 70| | 71| 1.51M| clear_mem(output.data(), output.size()); 72| | 73| 13.5M| for(size_t i = 0; i != g.size(); i += 2) { ------------------ | Branch (73:22): [True: 12.0M, False: 1.51M] ------------------ 74| 12.0M| const secure_vector& vec_0 = g[i].repr(); 75| 12.0M| const secure_vector& vec_1 = g[i + 1].repr(); 76| | 77| 12.0M| BOTAN_ASSERT_NOMSG(vec_0.size() >= words && vec_1.size() >= words); ------------------ | | 77| 12.0M| do { \ | | 78| 12.0M| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 24.1M| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 12.0M, False: 0] | | | Branch (79:12): [True: 12.0M, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.0M| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.0M] | | ------------------ ------------------ 78| | 79| 12.0M| const auto mask_0 = CT::Mask::is_equal(nibble, i); 80| 12.0M| const auto mask_1 = CT::Mask::is_equal(nibble, i + 1); 81| | 82| 455M| for(size_t w = 0; w != words; ++w) { ------------------ | Branch (82:25): [True: 443M, False: 12.0M] ------------------ 83| 443M| output[w] |= mask_0.if_set_return(vec_0[w]); 84| 443M| output[w] |= mask_1.if_set_return(vec_1[w]); 85| 443M| } 86| 12.0M| } 87| 1.51M|} _ZN5Botan6jacobiENS_6BigIntES0_: 119| 158|int32_t jacobi(BigInt a, BigInt n) { 120| 158| BOTAN_ARG_CHECK(n.is_odd() && n >= 3, "Argument n must be an odd integer >= 3"); ------------------ | | 35| 158| do { \ | | 36| 158| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 316| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 158, False: 0] | | | Branch (37:12): [True: 158, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 158| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 158] | | ------------------ ------------------ 121| | 122| 158| if(a < 0 || a >= n) { ------------------ | Branch (122:7): [True: 66, False: 92] | Branch (122:16): [True: 0, False: 92] ------------------ 123| 66| a %= n; 124| 66| } 125| | 126| 158| if(a == 0) { ------------------ | Branch (126:7): [True: 0, False: 158] ------------------ 127| 0| return 0; 128| 0| } 129| 158| if(a == 1) { ------------------ | Branch (129:7): [True: 0, False: 158] ------------------ 130| 0| return 1; 131| 0| } 132| | 133| 158| int32_t s = 1; 134| | 135| 455| for(;;) { 136| 455| const size_t e = low_zero_bits(a); 137| 455| a >>= e; 138| 455| const word n_mod_8 = n.word_at(0) % 8; 139| 455| const word n_mod_4 = n_mod_8 % 4; 140| | 141| 455| if(e % 2 == 1 && (n_mod_8 == 3 || n_mod_8 == 5)) { ------------------ | Branch (141:10): [True: 136, False: 319] | Branch (141:25): [True: 31, False: 105] | Branch (141:41): [True: 22, False: 83] ------------------ 142| 53| s = -s; 143| 53| } 144| | 145| 455| if(n_mod_4 == 3 && a % 4 == 3) { ------------------ | Branch (145:10): [True: 171, False: 284] | Branch (145:26): [True: 35, False: 136] ------------------ 146| 35| s = -s; 147| 35| } 148| | 149| | /* 150| | * The HAC presentation of the algorithm uses recursion, which is not 151| | * desirable or necessary. 152| | * 153| | * Instead we loop accumulating the product of the various jacobi() 154| | * subcomputations into s, until we reach algorithm termination, which 155| | * occurs in one of two ways. 156| | * 157| | * If a == 1 then the recursion has completed; we can return the value of s. 158| | * 159| | * Otherwise, after swapping and reducing, check for a == 0 [this value is 160| | * called `n1` in HAC's presentation]. This would imply that jacobi(n1,a1) 161| | * would have the value 0, due to Line 1 in HAC 2.149, in which case the 162| | * entire product is zero, and we can immediately return that result. 163| | */ 164| | 165| 455| if(a == 1) { ------------------ | Branch (165:10): [True: 158, False: 297] ------------------ 166| 158| return s; 167| 158| } 168| | 169| 297| std::swap(a, n); 170| | 171| 297| BOTAN_ASSERT_NOMSG(n.is_odd()); ------------------ | | 77| 297| do { \ | | 78| 297| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 297| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 297] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 297| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 297] | | ------------------ ------------------ 172| | 173| 297| a %= n; 174| | 175| 297| if(a == 0) { ------------------ | Branch (175:10): [True: 0, False: 297] ------------------ 176| 0| return 0; 177| 0| } 178| 297| } 179| 158|} _ZN5Botan13low_zero_bitsERKNS_6BigIntE: 194| 3.09k|size_t low_zero_bits(const BigInt& n) { 195| 3.09k| size_t low_zero = 0; 196| | 197| 3.09k| auto seen_nonempty_word = CT::Mask::cleared(); 198| | 199| 123k| for(size_t i = 0; i != n.size(); ++i) { ------------------ | Branch (199:22): [True: 120k, False: 3.09k] ------------------ 200| 120k| const word x = n.word_at(i); 201| | 202| | // ctz(0) will return sizeof(word) 203| 120k| const size_t tz_x = ctz(x); 204| | 205| | // if x > 0 we want to count tz_x in total but not any 206| | // further words, so set the mask after the addition 207| 120k| low_zero += seen_nonempty_word.if_not_set_return(tz_x); 208| | 209| 120k| seen_nonempty_word |= CT::Mask::expand(x); 210| 120k| } 211| | 212| | // if we saw no words with x > 0 then n == 0 and the value we have 213| | // computed is meaningless. Instead return BigInt::zero() in that case. 214| 3.09k| return static_cast(seen_nonempty_word.if_set_return(low_zero)); 215| 3.09k|} _ZN5Botan17is_perfect_squareERKNS_6BigIntE: 347| 10|BigInt is_perfect_square(const BigInt& C) { 348| 10| if(C < 1) { ------------------ | Branch (348:7): [True: 0, False: 10] ------------------ 349| 0| throw Invalid_Argument("is_perfect_square requires C >= 1"); 350| 0| } 351| 10| if(C == 1) { ------------------ | Branch (351:7): [True: 0, False: 10] ------------------ 352| 0| return BigInt::one(); 353| 0| } 354| | 355| 10| const size_t n = C.bits(); 356| 10| const size_t m = (n + 1) / 2; 357| 10| const BigInt B = C + BigInt::power_of_2(m); 358| | 359| 10| BigInt X = BigInt::power_of_2(m) - 1; 360| 10| BigInt X2 = (X * X); 361| | 362| 90| for(;;) { 363| 90| X = (X2 + C) / (2 * X); 364| 90| X2 = (X * X); 365| | 366| 90| if(X2 < B) { ------------------ | Branch (366:10): [True: 10, False: 80] ------------------ 367| 10| break; 368| 10| } 369| 90| } 370| | 371| 10| if(X2 == C) { ------------------ | Branch (371:7): [True: 0, False: 10] ------------------ 372| 0| return X; 373| 10| } else { 374| 10| return BigInt::zero(); 375| 10| } 376| 10|} _ZN5Botan8is_primeERKNS_6BigIntERNS_21RandomNumberGeneratorEmb: 381| 211|bool is_prime(const BigInt& n, RandomNumberGenerator& rng, size_t prob, bool is_random) { 382| 211| if(n == 2) { ------------------ | Branch (382:7): [True: 0, False: 211] ------------------ 383| 0| return true; 384| 0| } 385| 211| if(n <= 1 || n.is_even()) { ------------------ | Branch (385:7): [True: 0, False: 211] | Branch (385:17): [True: 0, False: 211] ------------------ 386| 0| return false; 387| 0| } 388| | 389| 211| const size_t n_bits = n.bits(); 390| | 391| | // Fast path testing for small numbers (<= 65521) 392| 211| if(n_bits <= 16) { ------------------ | Branch (392:7): [True: 0, False: 211] ------------------ 393| 0| const uint16_t num = static_cast(n.word_at(0)); 394| | 395| 0| return std::binary_search(PRIMES, PRIMES + PRIME_TABLE_SIZE, num); 396| 0| } 397| | 398| 211| auto mod_n = Barrett_Reduction::for_secret_modulus(n); 399| 211| const Montgomery_Params monty_n(n, mod_n); 400| | 401| 211| if(rng.is_seeded()) { ------------------ | Branch (401:7): [True: 211, False: 0] ------------------ 402| 211| const size_t t = miller_rabin_test_iterations(n_bits, prob, is_random); 403| | 404| 211| if(!is_miller_rabin_probable_prime(n, mod_n, monty_n, rng, t)) { ------------------ | Branch (404:10): [True: 173, False: 38] ------------------ 405| 173| return false; 406| 173| } 407| | 408| 38| if(is_random) { ------------------ | Branch (408:10): [True: 0, False: 38] ------------------ 409| 0| return true; 410| 38| } else { 411| 38| return is_lucas_probable_prime(n, mod_n); 412| 38| } 413| 38| } else { 414| 0| return is_bailie_psw_probable_prime(n, mod_n); 415| 0| } 416| 211|} _ZN5Botan23is_lucas_probable_primeERKNS_6BigIntERKNS_17Barrett_ReductionE: 18| 38|bool is_lucas_probable_prime(const BigInt& C, const Barrett_Reduction& mod_C) { 19| 38| BOTAN_ARG_CHECK(C.signum() >= 0, "Argument must be non-negative"); ------------------ | | 35| 38| do { \ | | 36| 38| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 38| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 38] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 38| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 38] | | ------------------ ------------------ 20| | 21| 38| if(C == 2 || C == 3 || C == 5 || C == 7 || C == 11 || C == 13) { ------------------ | Branch (21:7): [True: 0, False: 38] | Branch (21:17): [True: 0, False: 38] | Branch (21:27): [True: 0, False: 38] | Branch (21:37): [True: 0, False: 38] | Branch (21:47): [True: 0, False: 38] | Branch (21:58): [True: 0, False: 38] ------------------ 22| 0| return true; 23| 0| } 24| | 25| 38| if(C <= 1 || C.is_even()) { ------------------ | Branch (25:7): [True: 0, False: 38] | Branch (25:17): [True: 0, False: 38] ------------------ 26| 0| return false; 27| 0| } 28| | 29| 38| BigInt D = BigInt::from_word(5); 30| | 31| 158| for(;;) { 32| 158| const int32_t j = jacobi(D, C); 33| 158| if(j == 0) { ------------------ | Branch (33:10): [True: 0, False: 158] ------------------ 34| 0| return false; 35| 0| } 36| | 37| 158| if(j == -1) { ------------------ | Branch (37:10): [True: 38, False: 120] ------------------ 38| 38| break; 39| 38| } 40| | 41| | // Check 5, -7, 9, -11, 13, -15, 17, ... 42| 120| if(D.signum() < 0) { ------------------ | Branch (42:10): [True: 54, False: 66] ------------------ 43| 54| D.flip_sign(); 44| 54| D += 2; 45| 66| } else { 46| 66| D += 2; 47| 66| D.flip_sign(); 48| 66| } 49| | 50| 120| if(D == 17 && is_perfect_square(C).signum() != 0) { ------------------ | Branch (50:10): [True: 10, False: 110] | Branch (50:10): [True: 0, False: 120] | Branch (50:21): [True: 0, False: 10] ------------------ 51| 0| return false; 52| 0| } 53| 120| } 54| | 55| 38| if(D.signum() < 0) { ------------------ | Branch (55:7): [True: 12, False: 26] ------------------ 56| 12| D += C; 57| 12| } 58| | 59| 38| const BigInt K = C + 1; 60| 38| const size_t K_bits = K.bits() - 1; 61| | 62| 38| BigInt U = BigInt::one(); 63| 38| BigInt V = BigInt::one(); 64| | 65| 38| BigInt Ut; 66| 38| BigInt Vt; 67| 38| BigInt U2; 68| 38| BigInt V2; 69| | 70| 84.2k| for(size_t i = 0; i != K_bits; ++i) { ------------------ | Branch (70:22): [True: 84.1k, False: 38] ------------------ 71| 84.1k| const bool k_bit = K.get_bit(K_bits - 1 - i); 72| | 73| 84.1k| Ut = mod_C.multiply(U, V); 74| | 75| 84.1k| Vt = mod_C.reduce(mod_C.square(V) + mod_C.multiply(D, mod_C.square(U))); 76| 84.1k| Vt.ct_cond_add(Vt.is_odd(), C); 77| 84.1k| Vt >>= 1; 78| 84.1k| Vt = mod_C.reduce(Vt); 79| | 80| 84.1k| U = Ut; 81| 84.1k| V = Vt; 82| | 83| 84.1k| U2 = mod_C.reduce(Ut + Vt); 84| 84.1k| U2.ct_cond_add(U2.is_odd(), C); 85| 84.1k| U2 >>= 1; 86| | 87| 84.1k| V2 = mod_C.reduce(Vt + mod_C.multiply(Ut, D)); 88| 84.1k| V2.ct_cond_add(V2.is_odd(), C); 89| 84.1k| V2 >>= 1; 90| | 91| 84.1k| U.ct_cond_assign(k_bit, U2); 92| 84.1k| V.ct_cond_assign(k_bit, V2); 93| 84.1k| } 94| | 95| 38| return (U == 0); 96| 38|} _ZN5Botan24passes_miller_rabin_testERKNS_6BigIntERKNS_17Barrett_ReductionERKNS_17Montgomery_ParamsES2_: 113| 2.64k| const BigInt& a) { 114| 2.64k| if(n < 3 || n.is_even()) { ------------------ | Branch (114:7): [True: 0, False: 2.64k] | Branch (114:16): [True: 0, False: 2.64k] ------------------ 115| 0| return false; 116| 0| } 117| | 118| 2.64k| BOTAN_ASSERT_NOMSG(n > 1); ------------------ | | 77| 2.64k| do { \ | | 78| 2.64k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2.64k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 2.64k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 2.64k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 2.64k] | | ------------------ ------------------ 119| | 120| 2.64k| const BigInt n_minus_1 = n - 1; 121| | /* 122| | * This unpoison is not ideal but realistically there is no way to 123| | * hide the number of loop iterations (below). The main user of 124| | * secret primes is RSA and we always generate RSA primes such that 125| | * p == 3 (mod 4), which means s is always 1. 126| | */ 127| 2.64k| const size_t s = CT::driveby_unpoison(low_zero_bits(n_minus_1)); 128| 2.64k| const BigInt nm1_s = n_minus_1 >> s; 129| 2.64k| const size_t n_bits = n.bits(); 130| | 131| 2.64k| const size_t powm_window = 4; 132| | 133| 2.64k| auto powm_a_n = monty_precompute(monty_n, a, powm_window); 134| | 135| 2.64k| BigInt y = monty_execute(*powm_a_n, nm1_s, n_bits).value(); 136| | 137| 2.64k| if(y == 1 || y == n_minus_1) { ------------------ | Branch (137:7): [True: 286, False: 2.35k] | Branch (137:17): [True: 279, False: 2.07k] ------------------ 138| 565| return true; 139| 565| } 140| | 141| 329k| for(size_t i = 1; i != s; ++i) { ------------------ | Branch (141:22): [True: 329k, False: 173] ------------------ 142| 329k| y = mod_n.square(y); 143| | 144| 329k| if(y == 1) { // found a non-trivial square root ------------------ | Branch (144:10): [True: 0, False: 329k] ------------------ 145| 0| return false; 146| 0| } 147| | 148| | /* 149| | -1 is the trivial square root of unity, so ``a`` is not a 150| | witness for this number - give up 151| | */ 152| 329k| if(y == n_minus_1) { ------------------ | Branch (152:10): [True: 1.90k, False: 327k] ------------------ 153| 1.90k| return true; 154| 1.90k| } 155| 329k| } 156| | 157| 173| return false; 158| 2.07k|} _ZN5Botan30is_miller_rabin_probable_primeERKNS_6BigIntERKNS_17Barrett_ReductionERKNS_17Montgomery_ParamsERNS_21RandomNumberGeneratorEm: 164| 211| size_t test_iterations) { 165| 211| if(n < 3 || n.is_even()) { ------------------ | Branch (165:7): [True: 0, False: 211] | Branch (165:16): [True: 0, False: 211] ------------------ 166| 0| return false; 167| 0| } 168| | 169| 2.68k| for(size_t i = 0; i != test_iterations; ++i) { ------------------ | Branch (169:22): [True: 2.64k, False: 38] ------------------ 170| 2.64k| const BigInt a = BigInt::random_integer(rng, BigInt::from_word(2), n); 171| | 172| 2.64k| if(!passes_miller_rabin_test(n, mod_n, monty_n, a)) { ------------------ | Branch (172:10): [True: 173, False: 2.47k] ------------------ 173| 173| return false; 174| 173| } 175| 2.64k| } 176| | 177| | // Failed to find a counterexample 178| 38| return true; 179| 211|} _ZN5Botan28miller_rabin_test_iterationsEmmb: 181| 211|size_t miller_rabin_test_iterations(size_t n_bits, size_t prob, bool random) { 182| 211| const size_t base = (prob + 2) / 2; // worst case 4^-t error rate 183| | 184| | /* 185| | * If the candidate prime was maliciously constructed, we can't rely 186| | * on arguments based on p being random. 187| | */ 188| 211| if(!random) { ------------------ | Branch (188:7): [True: 211, False: 0] ------------------ 189| 211| return base; 190| 211| } 191| | 192| | /* 193| | * For randomly chosen numbers we can use the estimates from 194| | * http://www.math.dartmouth.edu/~carlp/PDF/paper88.pdf 195| | * 196| | * These values are derived from the inequality for p(k,t) given on 197| | * the second page. 198| | */ 199| 0| if(prob <= 128) { ------------------ | Branch (199:7): [True: 0, False: 0] ------------------ 200| 0| if(n_bits >= 1536) { ------------------ | Branch (200:10): [True: 0, False: 0] ------------------ 201| 0| return 4; // < 2^-133 202| 0| } 203| 0| if(n_bits >= 1024) { ------------------ | Branch (203:10): [True: 0, False: 0] ------------------ 204| 0| return 6; // < 2^-133 205| 0| } 206| 0| if(n_bits >= 512) { ------------------ | Branch (206:10): [True: 0, False: 0] ------------------ 207| 0| return 12; // < 2^-129 208| 0| } 209| 0| if(n_bits >= 256) { ------------------ | Branch (209:10): [True: 0, False: 0] ------------------ 210| 0| return 29; // < 2^-128 211| 0| } 212| 0| } 213| | 214| | /* 215| | If the user desires a smaller error probability than we have 216| | precomputed error estimates for, just fall back to using the worst 217| | case error rate. 218| | */ 219| 0| return base; 220| 0|} _ZN5Botan6PCurve15PrimeOrderCurve11from_paramsERKNS_6BigIntES4_S4_S4_S4_S4_: 22| 2| const BigInt& p, const BigInt& a, const BigInt& b, const BigInt& base_x, const BigInt& base_y, const BigInt& order) { 23| 2|#if defined(BOTAN_HAS_PCURVES_GENERIC) 24| 2| return PCurveInstance::from_params(p, a, b, base_x, base_y, order); 25| 0|#endif 26| | 27| 0| BOTAN_UNUSED(p, a, b, base_x, base_y, order); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 28| 0| return {}; 29| 2|} _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: 0, False: 6] ------------------ 35| 0| return PCurveInstance::secp256r1(); 36| 0| } 37| 6|#endif 38| | 39| 6|#if defined(BOTAN_HAS_PCURVES_SECP384R1) 40| 6| if(name == "secp384r1") { ------------------ | Branch (40:7): [True: 1, False: 5] ------------------ 41| 1| return PCurveInstance::secp384r1(); 42| 1| } 43| 5|#endif 44| | 45| 5|#if defined(BOTAN_HAS_PCURVES_SECP521R1) 46| 5| if(name == "secp521r1") { ------------------ | Branch (46:7): [True: 1, False: 4] ------------------ 47| 1| return PCurveInstance::secp521r1(); 48| 1| } 49| 4|#endif 50| | 51| 4|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL256R1) 52| 4| if(name == "brainpool256r1") { ------------------ | Branch (52:7): [True: 0, False: 4] ------------------ 53| 0| return PCurveInstance::brainpool256r1(); 54| 0| } 55| 4|#endif 56| | 57| 4|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL384R1) 58| 4| if(name == "brainpool384r1") { ------------------ | Branch (58:7): [True: 0, False: 4] ------------------ 59| 0| return PCurveInstance::brainpool384r1(); 60| 0| } 61| 4|#endif 62| | 63| 4|#if defined(BOTAN_HAS_PCURVES_BRAINPOOL512R1) 64| 4| if(name == "brainpool512r1") { ------------------ | Branch (64:7): [True: 0, False: 4] ------------------ 65| 0| return PCurveInstance::brainpool512r1(); 66| 0| } 67| 4|#endif 68| | 69| 4|#if defined(BOTAN_HAS_PCURVES_FRP256V1) 70| 4| if(name == "frp256v1") { ------------------ | Branch (70:7): [True: 0, False: 4] ------------------ 71| 0| return PCurveInstance::frp256v1(); 72| 0| } 73| 4|#endif 74| | 75| 4|#if defined(BOTAN_HAS_PCURVES_SECP192R1) 76| 4| if(name == "secp192r1") { ------------------ | Branch (76:7): [True: 0, False: 4] ------------------ 77| 0| return PCurveInstance::secp192r1(); 78| 0| } 79| 4|#endif 80| | 81| 4|#if defined(BOTAN_HAS_PCURVES_SECP224R1) 82| 4| if(name == "secp224r1") { ------------------ | Branch (82:7): [True: 1, False: 3] ------------------ 83| 1| return PCurveInstance::secp224r1(); 84| 1| } 85| 3|#endif 86| | 87| 3|#if defined(BOTAN_HAS_PCURVES_SECP256K1) 88| 3| if(name == "secp256k1") { ------------------ | Branch (88:7): [True: 1, False: 2] ------------------ 89| 1| return PCurveInstance::secp256k1(); 90| 1| } 91| 2|#endif 92| | 93| 2|#if defined(BOTAN_HAS_PCURVES_SM2P256V1) 94| 2| if(name == "sm2p256v1") { ------------------ | Branch (94:7): [True: 0, False: 2] ------------------ 95| 0| return PCurveInstance::sm2p256v1(); 96| 0| } 97| 2|#endif 98| | 99| 2|#if defined(BOTAN_HAS_PCURVES_NUMSP512D1) 100| 2| if(name == "numsp512d1") { ------------------ | Branch (100:7): [True: 0, False: 2] ------------------ 101| 0| return PCurveInstance::numsp512d1(); 102| 0| } 103| 2|#endif 104| | 105| 2| BOTAN_UNUSED(name); ------------------ | | 144| 2|#define BOTAN_UNUSED Botan::ignore_params ------------------ 106| 2| return {}; 107| 2|} _ZN5Botan6PCurve22GenericPrimeOrderCurveC2ERKNS_6BigIntES4_S4_S4_S4_S4_: 1432| 1| m_params(std::make_unique(p, a, b, base_x, base_y, order)) {} _ZN5Botan6PCurve22GenericPrimeOrderCurve20_precompute_base_mulEv: 1434| 1|void GenericPrimeOrderCurve::_precompute_base_mul() { 1435| 1| BOTAN_STATE_CHECK(m_basemul == nullptr); ------------------ | | 51| 1| do { \ | | 52| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 1| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 1] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 1| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 1] | | ------------------ ------------------ 1436| 1| m_basemul = std::make_unique(from_stash(generator())); 1437| 1|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10order_bitsEv: 1439| 1|size_t GenericPrimeOrderCurve::order_bits() const { 1440| 1| return _params().order_bits(); 1441| 1|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve9generatorEv: 1546| 1|PrimeOrderCurve::AffinePoint GenericPrimeOrderCurve::generator() const { 1547| 1| return PrimeOrderCurve::AffinePoint::_create(shared_from_this(), _params().base_x(), _params().base_y()); 1548| 1|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve17deserialize_pointENSt3__14spanIKhLm18446744073709551615EEE: 1604| 1| std::span bytes) const { 1605| 1| if(auto pt = GenericAffinePoint::deserialize(this, bytes)) { ------------------ | Branch (1605:12): [True: 0, False: 1] ------------------ 1606| 0| return stash(pt.value()); 1607| 1| } else { 1608| 1| return {}; 1609| 1| } 1610| 1|} _ZNK5Botan6PCurve22GenericPrimeOrderCurve10from_stashERKNS0_15PrimeOrderCurve11AffinePointE: 1671| 1|GenericAffinePoint GenericPrimeOrderCurve::from_stash(const PrimeOrderCurve::AffinePoint& pt) const { 1672| 1| BOTAN_ARG_CHECK(pt._curve().get() == this, "Curve mismatch"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 1673| 1| auto x = GenericField(this, pt._x()); 1674| 1| auto y = GenericField(this, pt._y()); 1675| 1| return GenericAffinePoint(x, y); 1676| 1|} _ZN5Botan6PCurve14PCurveInstance11from_paramsERKNS_6BigIntES4_S4_S4_S4_S4_: 1706| 2| const BigInt& p, const BigInt& a, const BigInt& b, const BigInt& base_x, const BigInt& base_y, const BigInt& order) { 1707| | // We don't check that p and order are prime here on the assumption this has 1708| | // been checked already by EC_Group 1709| | 1710| 2| BOTAN_ARG_CHECK(a >= 0 && a < p, "a is invalid"); ------------------ | | 35| 2| do { \ | | 36| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 2, False: 0] | | | Branch (37:12): [True: 2, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2] | | ------------------ ------------------ 1711| 2| BOTAN_ARG_CHECK(b > 0 && b < p, "b is invalid"); ------------------ | | 35| 2| do { \ | | 36| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 2, False: 0] | | | Branch (37:12): [True: 2, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2] | | ------------------ ------------------ 1712| 2| BOTAN_ARG_CHECK(base_x >= 0 && base_x < p, "base_x is invalid"); ------------------ | | 35| 2| do { \ | | 36| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 2, False: 0] | | | Branch (37:12): [True: 2, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2] | | ------------------ ------------------ 1713| 2| BOTAN_ARG_CHECK(base_y >= 0 && base_y < p, "base_y is invalid"); ------------------ | | 35| 2| do { \ | | 36| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 2, False: 0] | | | Branch (37:12): [True: 2, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 2| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 2] | | ------------------ ------------------ 1714| | 1715| 2| const size_t p_bits = p.bits(); 1716| | 1717| | // Same size restrictions as EC_Group however here we do not require 1718| | // exactly the primes for the 521 or 239 bit exceptions; this code 1719| | // should work fine with any such prime and we are relying on the higher 1720| | // levels to prevent creating such a group in the first place 1721| | // 1722| | // TODO(Botan4) increase the 128 here to 192 when the corresponding EC_Group constructor is changed 1723| | // 1724| 2| if(p_bits != 521 && p_bits != 239 && (p_bits < 128 || p_bits > 512 || p_bits % 32 != 0)) { ------------------ | Branch (1724:7): [True: 2, False: 0] | Branch (1724:24): [True: 2, False: 0] | Branch (1724:42): [True: 0, False: 2] | Branch (1724:58): [True: 0, False: 2] | Branch (1724:74): [True: 0, False: 2] ------------------ 1725| 0| return {}; 1726| 0| } 1727| | 1728| | // We don't want to deal with Shanks-Tonelli in the generic case 1729| 2| if(p % 4 != 3) { ------------------ | Branch (1729:7): [True: 0, False: 2] ------------------ 1730| 0| return {}; 1731| 0| } 1732| | 1733| | // The bit length of the field and order being the same simplifies things 1734| 2| if(p_bits != order.bits()) { ------------------ | Branch (1734:7): [True: 1, False: 1] ------------------ 1735| 1| return {}; 1736| 1| } 1737| | 1738| | // Check that the (x,y) generator point is on the curve 1739| 1| auto mod_p = Barrett_Reduction::for_public_modulus(p); 1740| 1| const BigInt y2 = mod_p.square(base_y); 1741| 1| const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(base_x) + mod_p.multiply(a, base_x) + b); 1742| 1| if(y2 != x3_ax_b) { ------------------ | Branch (1742:7): [True: 0, False: 1] ------------------ 1743| 0| return {}; 1744| 0| } 1745| | 1746| 1| auto gpoc = std::make_shared(p, a, b, base_x, base_y, order); 1747| | /* 1748| | The implementation of this needs to call shared_from_this which is not usable 1749| | until after the constructor has completed, so we have to do a two-stage 1750| | construction process. This is certainly not so clean but it is contained to 1751| | this single file so seems tolerable. 1752| | 1753| | Alternately we could lazily compute the base mul table but this brings in 1754| | locking issues which seem a worse alternative overall. 1755| | */ 1756| 1| gpoc->_precompute_base_mul(); 1757| 1| return gpoc; 1758| 1|} _ZNK5Botan6PCurve18GenericCurveParams10order_bitsEv: 146| 1| size_t order_bits() const { return m_order_bits; } _ZNK5Botan6PCurve18GenericCurveParams11field_bytesEv: 152| 1| size_t field_bytes() const { return m_field_bytes; } _ZNK5Botan6PCurve18GenericCurveParams5wordsEv: 144| 31.6k| size_t words() const { return m_words; } _ZNK5Botan6PCurve18GenericCurveParams3mulERNSt3__15arrayImLm18EEERKNS3_ImLm9EEES8_: 200| 15.7k| void mul(std::array& z, const std::array& x, const std::array& y) const { 201| 15.7k| clear_mem(z); 202| | 203| 15.7k| if(m_words == 4) { ------------------ | Branch (203:13): [True: 0, False: 15.7k] ------------------ 204| 0| bigint_comba_mul4(z.data(), x.data(), y.data()); 205| 15.7k| } else if(m_words == 6) { ------------------ | Branch (205:20): [True: 0, False: 15.7k] ------------------ 206| 0| bigint_comba_mul6(z.data(), x.data(), y.data()); 207| 15.7k| } else if(m_words == 8) { ------------------ | Branch (207:20): [True: 0, False: 15.7k] ------------------ 208| 0| bigint_comba_mul8(z.data(), x.data(), y.data()); 209| 15.7k| } else if(m_words == 9) { ------------------ | Branch (209:20): [True: 0, False: 15.7k] ------------------ 210| 0| bigint_comba_mul9(z.data(), x.data(), y.data()); 211| 15.7k| } else { 212| 15.7k| bigint_mul(z.data(), z.size(), x.data(), m_words, m_words, y.data(), m_words, m_words, nullptr, 0); 213| 15.7k| } 214| 15.7k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField18conditional_assignERS2_S3_S3_NS_2CT6ChoiceERKS2_S7_S7_: 862| 1.11k| const GenericField& nz) { 863| 1.11k| const W mask = cond.into_bitmask(); 864| | 865| 11.1k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (865:28): [True: 9.99k, False: 1.11k] ------------------ 866| 9.99k| x.m_val[i] = choose(mask, nx.m_val[i], x.m_val[i]); 867| 9.99k| y.m_val[i] = choose(mask, ny.m_val[i], y.m_val[i]); 868| 9.99k| z.m_val[i] = choose(mask, nz.m_val[i], z.m_val[i]); 869| 9.99k| } 870| 1.11k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1miERKNS1_12GenericFieldES4_: 718| 5.21k| friend GenericField operator-(const GenericField& a, const GenericField& b) { return a + b.negate(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField7is_zeroEv: 787| 3.40k| CT::Choice is_zero() const { return CT::all_zeros(m_val.data(), m_curve->_params().words()).as_choice(); } _ZNK5Botan6PCurve22GenericProjectivePoint3dblEv: 1151| 629| Self dbl() const { 1152| 629| if(curve()->_params().a_is_minus_3()) { ------------------ | Branch (1152:13): [True: 0, False: 629] ------------------ 1153| 0| return dbl_a_minus_3(*this); 1154| 629| } else if(curve()->_params().a_is_zero()) { ------------------ | Branch (1154:20): [True: 629, False: 0] ------------------ 1155| 629| return dbl_a_zero(*this); 1156| 629| } else { 1157| 0| const auto A = GenericField::curve_a(curve()); 1158| 0| return dbl_generic(*this, A); 1159| 0| } 1160| 629| } _ZNK5Botan6PCurve18GenericCurveParams12a_is_minus_3Ev: 194| 629| bool a_is_minus_3() const { return m_a_is_minus_3; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul3Ev: 698| 629| GenericField mul3() const { return mul2() + (*this); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul4Ev: 701| 629| GenericField mul4() const { return mul2().mul2(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul2Ev: 688| 5.03k| GenericField mul2() const { 689| 5.03k| StorageUnit t = value(); 690| 5.03k| const W carry = shift_left<1>(t); 691| | 692| 5.03k| StorageUnit r; 693| 5.03k| bigint_monty_maybe_sub(r.data(), carry, t.data(), m_curve->_params().field().data()); 694| 5.03k| return GenericField(m_curve, r); 695| 5.03k| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField5valueEv: 885| 42.5k| const StorageUnit& value() const { return m_val; } _ZNK5Botan6PCurve18GenericCurveParams5fieldEv: 158| 38.4k| const StorageUnit& field() const { return m_field; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4mul8Ev: 704| 629| GenericField mul8() const { return mul2().mul2().mul2(); } _ZNK5Botan6PCurve18GenericCurveParams9a_is_zeroEv: 196| 629| bool a_is_zero() const { return m_a_is_zero; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField3oneEPKNS0_22GenericPrimeOrderCurveE: 635| 2| static GenericField one(const GenericPrimeOrderCurve* curve) { 636| 2| return GenericField(curve, curve->_params().field_monty_r1()); 637| 2| } _ZNK5Botan6PCurve18GenericCurveParams14field_monty_r1Ev: 162| 2| const StorageUnit& field_monty_r1() const { return m_field_monty_r1; } _ZNK5Botan6PCurve22GenericProjectivePoint5curveEv: 1204| 1.25k| const GenericPrimeOrderCurve* curve() const { return m_x.curve(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField5curveEv: 801| 1.26k| const GenericPrimeOrderCurve* curve() const { return m_curve; } _ZNK5Botan6PCurve18GenericAffinePoint5curveEv: 1041| 1| const GenericPrimeOrderCurve* curve() const { return m_x.curve(); } _ZNK5Botan6PCurve18GenericCurveParams10field_bitsEv: 150| 1| size_t field_bits() const { return m_field_bits; } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericFieldmLERKS2_: 728| 47| GenericField& operator*=(const GenericField& other) { 729| 47| const auto* curve = check_curve(*this, other); 730| | 731| 47| std::array z; // NOLINT(*-member-init) 732| 47| curve->_params().mul(z, value(), other.value()); 733| 47| m_val = redc(curve, z); 734| 47| return (*this); 735| 47| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField11check_curveERKS2_S4_: 889| 22.1k| static const GenericPrimeOrderCurve* check_curve(const GenericField& a, const GenericField& b) { 890| 22.1k| BOTAN_STATE_CHECK(a.m_curve == b.m_curve); ------------------ | | 51| 22.1k| do { \ | | 52| 22.1k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 22.1k| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 22.1k] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 22.1k| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 22.1k] | | ------------------ ------------------ 891| 22.1k| return a.m_curve; 892| 22.1k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField4redcEPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm18EEE: 894| 21.8k| static StorageUnit redc(const GenericPrimeOrderCurve* curve, std::array z) { 895| 21.8k| const auto& mod = curve->_params().field(); 896| 21.8k| const size_t words = curve->_params().words(); 897| 21.8k| StorageUnit r{}; 898| 21.8k| StorageUnit ws{}; 899| 21.8k| bigint_monty_redc( 900| 21.8k| r.data(), z.data(), mod.data(), words, curve->_params().field_p_dash(), ws.data(), ws.size()); 901| 21.8k| return r; 902| 21.8k| } _ZNK5Botan6PCurve18GenericCurveParams12field_p_dashEv: 170| 21.8k| word field_p_dash() const { return m_field_p_dash; } _ZNK5Botan6PCurve22GenericProjectivePoint11is_identityEv: 1112| 2.29k| CT::Choice is_identity() const { return z().is_zero(); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6invertEv: 759| 1| GenericField invert() const { return pow_vartime(m_curve->_params().field_minus_2()); } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField11pow_vartimeERKNSt3__15arrayImLm9EEE: 743| 1| GenericField pow_vartime(const StorageUnit& exp) const { 744| 1| auto one = GenericField::one(curve()); 745| 1| auto bits = curve()->_params().field_bits(); 746| 1| auto words = curve()->_params().words(); 747| 1| return impl_pow_vartime(*this, one, bits, std::span{exp}.last(words)); 748| 1| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_116impl_pow_vartimeINS1_12GenericFieldEEET_RKS4_S6_mNSt3__14spanIKmLm18446744073709551615EEE: 56| 1|T impl_pow_vartime(const T& elem, const T& one, size_t bits, std::span exp) { 57| 1| constexpr size_t WindowBits = 4; 58| 1| constexpr size_t WindowElements = (1 << WindowBits) - 1; 59| | 60| 1| const size_t Windows = (bits + WindowBits - 1) / WindowBits; 61| | 62| 1| std::vector tbl; 63| 1| tbl.reserve(WindowElements); 64| | 65| 1| tbl.push_back(elem); 66| | 67| 15| for(size_t i = 1; i != WindowElements; ++i) { ------------------ | Branch (67:22): [True: 14, False: 1] ------------------ 68| 14| if(i % 2 == 1) { ------------------ | Branch (68:10): [True: 7, False: 7] ------------------ 69| 7| tbl.push_back(tbl[i / 2].square()); 70| 7| } else { 71| 7| tbl.push_back(tbl[i - 1] * tbl[0]); 72| 7| } 73| 14| } 74| | 75| 1| auto r = one; 76| | 77| 1| const size_t w0 = read_window_bits(exp, (Windows - 1) * WindowBits); 78| | 79| 1| if(w0 > 0) { ------------------ | Branch (79:7): [True: 1, False: 0] ------------------ 80| 1| r = tbl[w0 - 1]; 81| 1| } 82| | 83| 48| for(size_t i = 1; i != Windows; ++i) { ------------------ | Branch (83:22): [True: 47, False: 1] ------------------ 84| 235| for(size_t j = 0; j != WindowBits; ++j) { ------------------ | Branch (84:25): [True: 188, False: 47] ------------------ 85| 188| r = r.square(); 86| 188| } 87| 47| const size_t w = read_window_bits(exp, (Windows - i - 1) * WindowBits); 88| | 89| 47| if(w > 0) { ------------------ | Branch (89:10): [True: 47, False: 0] ------------------ 90| 47| r *= tbl[w - 1]; 91| 47| } 92| 47| } 93| | 94| 1| return r; 95| 1|} _ZNK5Botan6PCurve18GenericCurveParams13field_minus_2Ev: 160| 1| const StorageUnit& field_minus_2() const { return m_field_minus_2; } _ZN5Botan6PCurveplERKNS0_22GenericProjectivePointES3_: 1096| 555| friend Self operator+(const Self& a, const Self& b) { return Self::add(a, b); } _ZN5Botan6PCurve22GenericProjectivePoint3addERKS1_S3_: 1132| 555| static Self add(const Self& a, const Self& b) { return point_add(a, b); } pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1zEv: 1202| 9.73k| const GenericField& z() const { return m_z; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6squareEv: 737| 6.11k| GenericField square() const { 738| 6.11k| std::array z; // NOLINT(*-member-init) 739| 6.11k| m_curve->_params().sqr(z, value()); 740| 6.11k| return GenericField(m_curve, redc(m_curve, z)); 741| 6.11k| } _ZNK5Botan6PCurve18GenericCurveParams3sqrERNSt3__15arrayImLm18EEERKNS3_ImLm9EEE: 216| 6.11k| void sqr(std::array& z, const std::array& x) const { 217| 6.11k| clear_mem(z); 218| | 219| 6.11k| if(m_words == 4) { ------------------ | Branch (219:13): [True: 0, False: 6.11k] ------------------ 220| 0| bigint_comba_sqr4(z.data(), x.data()); 221| 6.11k| } else if(m_words == 6) { ------------------ | Branch (221:20): [True: 0, False: 6.11k] ------------------ 222| 0| bigint_comba_sqr6(z.data(), x.data()); 223| 6.11k| } else if(m_words == 8) { ------------------ | Branch (223:20): [True: 0, False: 6.11k] ------------------ 224| 0| bigint_comba_sqr8(z.data(), x.data()); 225| 6.11k| } else if(m_words == 9) { ------------------ | Branch (225:20): [True: 0, False: 6.11k] ------------------ 226| 0| bigint_comba_sqr9(z.data(), x.data()); 227| 6.11k| } else { 228| 6.11k| bigint_sqr(z.data(), z.size(), x.data(), m_words, m_words, nullptr, 0); 229| 6.11k| } 230| 6.11k| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1mlERKNS1_12GenericFieldES4_: 720| 15.6k| friend GenericField operator*(const GenericField& a, const GenericField& b) { 721| 15.6k| const auto* curve = check_curve(a, b); 722| | 723| 15.6k| std::array z; // NOLINT(*-member-init) 724| 15.6k| curve->_params().mul(z, a.value(), b.value()); 725| 15.6k| return GenericField(curve, redc(curve, z)); 726| 15.6k| } pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1xEv: 1192| 4.66k| const GenericField& x() const { return m_x; } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField6negateEv: 750| 5.21k| GenericField negate() const { 751| 5.21k| auto x_is_zero = CT::all_zeros(this->data(), N); 752| | 753| 5.21k| StorageUnit r; 754| 5.21k| bigint_sub3(r.data(), m_curve->_params().field().data(), N, this->data(), N); 755| 5.21k| x_is_zero.if_set_zero_out(r.data(), N); 756| 5.21k| return GenericField(m_curve, r); 757| 5.21k| } pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField4dataEv: 887| 23.2k| const W* data() const { return m_val.data(); } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_1plERKNS1_12GenericFieldES4_: 706| 6.40k| friend GenericField operator+(const GenericField& a, const GenericField& b) { 707| 6.40k| const auto* curve = check_curve(a, b); 708| 6.40k| const size_t words = curve->_params().words(); 709| | 710| 6.40k| StorageUnit t{}; 711| 6.40k| const W carry = bigint_add3(t.data(), a.data(), words, b.data(), words); 712| | 713| 6.40k| StorageUnit r{}; 714| 6.40k| bigint_monty_maybe_sub(words, r.data(), carry, t.data(), curve->_params().field().data()); 715| 6.40k| return GenericField(curve, r); 716| 6.40k| } _ZNK5Botan6PCurve18GenericCurveParams6base_xEv: 190| 1| const StorageUnit& base_x() const { return m_base_x; } _ZNK5Botan6PCurve18GenericCurveParams6base_yEv: 192| 1| const StorageUnit& base_y() const { return m_base_y; } pcurves_generic.cpp:_ZNK5Botan6PCurve18GenericAffinePoint1yEv: 1032| 2| const GenericField& y() const { return m_y; } pcurves_generic.cpp:_ZNK5Botan6PCurve18GenericAffinePoint1xEv: 1027| 2| const GenericField& x() const { return m_x; } _ZNK5Botan6PCurve18GenericAffinePoint11is_identityEv: 940| 1| CT::Choice is_identity() const { return x().is_zero() && y().is_zero(); } _ZN5Botan6PCurve22GenericProjectivePoint11from_affineERKNS0_18GenericAffinePointE: 1061| 1| static Self from_affine(const GenericAffinePoint& pt) { 1062| 1| auto x = pt.x(); 1063| 1| auto y = pt.y(); 1064| 1| auto z = GenericField::one(x.curve()); 1065| | 1066| | // If pt is identity (0,0) swap y/z to convert (0,0,1) into (0,1,0) 1067| 1| GenericField::conditional_swap(pt.is_identity(), y, z); 1068| 1| return GenericProjectivePoint(x, y, z); 1069| 1| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericField16conditional_swapENS_2CT6ChoiceERS2_S5_: 817| 1| static void conditional_swap(CT::Choice cond, GenericField& x, GenericField& y) { 818| 1| const W mask = cond.into_bitmask(); 819| | 820| 10| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (820:28): [True: 9, False: 1] ------------------ 821| 9| auto nx = choose(mask, y.m_val[i], x.m_val[i]); 822| 9| auto ny = choose(mask, x.m_val[i], y.m_val[i]); 823| 9| x.m_val[i] = nx; 824| 9| y.m_val[i] = ny; 825| 9| } 826| 1| } _ZN5Botan6PCurve18GenericAffinePoint11deserializeEPKNS0_22GenericPrimeOrderCurveENSt3__14spanIKhLm18446744073709551615EEE: 990| 1| std::span bytes) { 991| 1| const size_t fe_bytes = curve->_params().field_bytes(); 992| | 993| 1| if(bytes.size() == 1 + 2 * fe_bytes && bytes[0] == 0x04) { ------------------ | Branch (993:13): [True: 0, False: 1] | Branch (993:49): [True: 0, False: 0] ------------------ 994| 0| auto x = GenericField::deserialize(curve, bytes.subspan(1, fe_bytes)); 995| 0| auto y = GenericField::deserialize(curve, bytes.subspan(1 + fe_bytes, fe_bytes)); 996| | 997| 0| if(x && y) { ------------------ | Branch (997:16): [True: 0, False: 0] | Branch (997:21): [True: 0, False: 0] ------------------ 998| 0| const auto lhs = (*y).square(); 999| 0| const auto rhs = GenericAffinePoint::x3_ax_b(*x); 1000| 0| if((lhs == rhs).as_bool()) { ------------------ | Branch (1000:19): [True: 0, False: 0] ------------------ 1001| 0| return GenericAffinePoint(*x, *y); 1002| 0| } 1003| 0| } 1004| 1| } else if(bytes.size() == 1 + fe_bytes && (bytes[0] == 0x02 || bytes[0] == 0x03)) { ------------------ | Branch (1004:20): [True: 0, False: 1] | Branch (1004:53): [True: 0, False: 0] | Branch (1004:73): [True: 0, False: 0] ------------------ 1005| 0| const CT::Choice y_is_even = CT::Mask::is_equal(bytes[0], 0x02).as_choice(); 1006| | 1007| 0| if(auto x = GenericField::deserialize(curve, bytes.subspan(1, fe_bytes))) { ------------------ | Branch (1007:21): [True: 0, False: 0] ------------------ 1008| 0| auto [y, is_square] = x3_ax_b(*x).sqrt(); 1009| | 1010| 0| if(is_square.as_bool()) { ------------------ | Branch (1010:19): [True: 0, False: 0] ------------------ 1011| 0| const auto flip_y = y_is_even != y.is_even(); 1012| 0| y.conditional_assign(flip_y, y.negate()); 1013| 0| return GenericAffinePoint(*x, y); 1014| 0| } 1015| 0| } 1016| 1| } else if(bytes.size() == 1 && bytes[0] == 0x00) { ------------------ | Branch (1016:20): [True: 0, False: 1] | Branch (1016:41): [True: 0, False: 0] ------------------ 1017| | // See SEC1 section 2.3.4 1018| 0| return GenericAffinePoint::identity(curve); 1019| 0| } 1020| | 1021| 1| return {}; 1022| 1| } pcurves_generic.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112GenericFieldC2EPKNS0_22GenericPrimeOrderCurveENSt3__15arrayImLm9EEE: 882| 38.4k| GenericField(const GenericPrimeOrderCurve* curve, StorageUnit val) : m_curve(curve), m_val(val) {} pcurves_generic.cpp:_ZN5Botan6PCurve18GenericAffinePointC2ERKNS0_12_GLOBAL__N_112GenericFieldES5_: 929| 1.18k| GenericAffinePoint(const GenericField& x, const GenericField& y) : m_x(x), m_y(y) {} pcurves_generic.cpp:_ZNK5Botan6PCurve22GenericProjectivePoint1yEv: 1197| 4.66k| const GenericField& y() const { return m_y; } pcurves_generic.cpp:_ZN5Botan6PCurve22GenericProjectivePointC2ERKNS0_12_GLOBAL__N_112GenericFieldES5_S5_: 1094| 1.18k| m_x(x), m_y(y), m_z(z) {} _ZN5Botan6PCurve18GenericCurveParamsC2ERKNS_6BigIntES4_S4_S4_S4_S4_: 110| 1| m_words(p.sig_words()), 111| 1| m_order_bits(order.bits()), 112| 1| m_order_bytes(order.bytes()), 113| 1| m_field_bits(p.bits()), 114| 1| m_field_bytes(p.bytes()), 115| 1| m_monty_order(order), 116| 1| m_monty_field(p), 117| 1| m_field(bn_to_fixed(p)), 118| 1| m_field_minus_2(bn_to_fixed_rev(p - 2)), 119| 1| m_field_monty_r1(bn_to_fixed(m_monty_field.R1())), 120| 1| m_field_monty_r2(bn_to_fixed(m_monty_field.R2())), 121| 1| m_field_p_plus_1_over_4(bn_to_fixed_rev((p + 1) / 4)), 122| 1| m_field_inv_2(bn_to_fixed((p / 2) + 1)), 123| 1| m_field_p_dash(m_monty_field.p_dash()), 124| | 125| 1| m_order(bn_to_fixed(order)), 126| 1| m_order_minus_2(bn_to_fixed_rev(order - 2)), 127| 1| m_order_monty_r1(bn_to_fixed(m_monty_order.R1())), 128| 1| m_order_monty_r2(bn_to_fixed(m_monty_order.R2())), 129| 1| m_order_monty_r3(bn_to_fixed(m_monty_order.R3())), 130| 1| m_order_inv_2(bn_to_fixed((order / 2) + 1)), 131| 1| m_order_p_dash(m_monty_order.p_dash()), 132| | 133| 1| m_a_is_minus_3(a + 3 == p), 134| 1| m_a_is_zero(a.is_zero()), 135| 1| m_order_is_lt_field(order < p) { 136| 1| secure_vector ws; 137| 1| m_monty_curve_a = bn_to_fixed(m_monty_field.mul(a, m_monty_field.R2(), ws)); 138| 1| m_monty_curve_b = bn_to_fixed(m_monty_field.mul(b, m_monty_field.R2(), ws)); 139| | 140| 1| m_base_x = bn_to_fixed(m_monty_field.mul(base_x, m_monty_field.R2(), ws)); 141| 1| m_base_y = bn_to_fixed(m_monty_field.mul(base_y, m_monty_field.R2(), ws)); 142| 1| } _ZN5Botan6PCurve18GenericCurveParams11bn_to_fixedERKNS_6BigIntE: 233| 16| static std::array bn_to_fixed(const BigInt& n) { 234| 16| const size_t n_words = n.sig_words(); 235| 16| BOTAN_ASSERT_NOMSG(n_words <= PrimeOrderCurve::StorageWords); ------------------ | | 77| 16| do { \ | | 78| 16| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 16| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 16] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 16| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 16] | | ------------------ ------------------ 236| | 237| 16| std::array r{}; 238| 16| copy_mem(std::span{r}.first(n_words), n._as_span().first(n_words)); 239| 16| return r; 240| 16| } _ZN5Botan6PCurve18GenericCurveParams15bn_to_fixed_revERKNS_6BigIntE: 242| 3| static std::array bn_to_fixed_rev(const BigInt& n) { 243| 3| auto v = bn_to_fixed(n); 244| 3| std::reverse(v.begin(), v.end()); 245| 3| return v; 246| 3| } _ZN5Botan6PCurve19GenericBaseMulTableC2ERKNS0_18GenericAffinePointE: 1338| 1| m_table(basemul_booth_setup(pt, blinded_scalar_bits(*pt.curve()) + 1)) {} pcurves_generic.cpp:_ZNK5Botan6PCurve12_GLOBAL__N_112GenericField14invert_vartimeEv: 761| 1| GenericField invert_vartime() const { 762| | // TODO take advantage of variable time here using eg BEEA 763| | // see IntMod::invert_vartime in pcurves_impl.h 764| 1| return invert(); 765| 1| } _ZN5Botan6PCurve19GenericBaseMulTable19blinded_scalar_bitsERKNS0_22GenericPrimeOrderCurveE: 1347| 1| static size_t blinded_scalar_bits(const GenericPrimeOrderCurve& curve) { 1348| 1| const size_t order_bits = curve.order_bits(); 1349| 1| return order_bits + scalar_blinding_bits(order_bits); 1350| 1| } _ZN5Botan6PCurve14PCurveInstance9secp224r1Ev: 223| 1|std::shared_ptr PCurveInstance::secp224r1() { 224| 1| return PrimeOrderCurveImpl::instance(); 225| 1|} pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 69| 1| constexpr static std::array one() { return std::array{1}; } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 25| 25.8k| constexpr static std::array redc(const std::array& z) { 26| 25.8k| const int64_t X00 = get_uint32(z.data(), 0); 27| 25.8k| const int64_t X01 = get_uint32(z.data(), 1); 28| 25.8k| const int64_t X02 = get_uint32(z.data(), 2); 29| 25.8k| const int64_t X03 = get_uint32(z.data(), 3); 30| 25.8k| const int64_t X04 = get_uint32(z.data(), 4); 31| 25.8k| const int64_t X05 = get_uint32(z.data(), 5); 32| 25.8k| const int64_t X06 = get_uint32(z.data(), 6); 33| 25.8k| const int64_t X07 = get_uint32(z.data(), 7); 34| 25.8k| const int64_t X08 = get_uint32(z.data(), 8); 35| 25.8k| const int64_t X09 = get_uint32(z.data(), 9); 36| 25.8k| const int64_t X10 = get_uint32(z.data(), 10); 37| 25.8k| const int64_t X11 = get_uint32(z.data(), 11); 38| 25.8k| const int64_t X12 = get_uint32(z.data(), 12); 39| 25.8k| const int64_t X13 = get_uint32(z.data(), 13); 40| | 41| 25.8k| const int64_t S0 = 0x00000001 + X00 - X07 - X11; 42| 25.8k| const int64_t S1 = 0x00000000 + X01 - X08 - X12; 43| 25.8k| const int64_t S2 = 0x00000000 + X02 - X09 - X13; 44| 25.8k| const int64_t S3 = 0xFFFFFFFF + X03 + X07 + X11 - X10; 45| 25.8k| const int64_t S4 = 0xFFFFFFFF + X04 + X08 + X12 - X11; 46| 25.8k| const int64_t S5 = 0xFFFFFFFF + X05 + X09 + X13 - X12; 47| 25.8k| const int64_t S6 = 0xFFFFFFFF + X06 + X10 - X13; 48| | 49| 25.8k| std::array r = {}; 50| | 51| 25.8k| SolinasAccum sum(r); 52| | 53| 25.8k| sum.accum(S0); 54| 25.8k| sum.accum(S1); 55| 25.8k| sum.accum(S2); 56| 25.8k| sum.accum(S3); 57| 25.8k| sum.accum(S4); 58| 25.8k| sum.accum(S5); 59| 25.8k| sum.accum(S6); 60| 25.8k| const auto S = sum.final_carry(0); 61| | 62| 25.8k| BOTAN_DEBUG_ASSERT(S <= 2); ------------------ | | 130| 25.8k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 25.8k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 25.8k] | | ------------------ ------------------ 63| | 64| 25.8k| solinas_correct_redc(r, P, p224_mul_mod_224(S)); 65| | 66| 25.8k| return r; 67| 25.8k| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE16p224_mul_mod_224Em: 81| 25.8k| constexpr static std::array p224_mul_mod_224(W i) { 82| 25.8k| static_assert(WordInfo::bits == 32 || WordInfo::bits == 64); 83| | 84| | // For small i, multiples of P-224 have a simple structure so it's faster to 85| | // compute the value directly vs a (constant time) table lookup 86| | 87| 25.8k| auto r = P; 88| | 89| | if constexpr(WordInfo::bits == 32) { 90| | r[3] -= i; 91| | r[0] += i; 92| 25.8k| } else { 93| 25.8k| const W i32 = i << 32; 94| 25.8k| r[1] -= i32; 95| 25.8k| r[0] += i; 96| 25.8k| } 97| 25.8k| return r; 98| 25.8k| } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 75| 1| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp224r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp224r112Secp224r1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 71| 5| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp256k1Ev: 233| 1|std::shared_ptr PCurveInstance::secp256k1() { 234| 1| return PrimeOrderCurveImpl::instance(); 235| 1|} pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 28| 1| constexpr static std::array one() { return std::array{1}; } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm8EEE: 30| 28.5k| constexpr static std::array redc(const std::array& z) { 31| 28.5k| return redc_crandall(std::span{z}); 32| 28.5k| } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm4EEE: 38| 1| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp256k1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp256k112Secp256k1RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE6to_repERKNSt3__15arrayImLm4EEE: 34| 1| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp384r1Ev: 343| 1|std::shared_ptr PCurveInstance::secp384r1() { 344| 1| return PrimeOrderCurveImpl::instance(); 345| 1|} pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE3oneEv: 88| 1| constexpr static std::array one() { return std::array{1}; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE4redcERKNSt3__15arrayImLm12EEE: 23| 43.7k| constexpr static std::array redc(const std::array& z) { 24| 43.7k| const int64_t X00 = get_uint32(z.data(), 0); 25| 43.7k| const int64_t X01 = get_uint32(z.data(), 1); 26| 43.7k| const int64_t X02 = get_uint32(z.data(), 2); 27| 43.7k| const int64_t X03 = get_uint32(z.data(), 3); 28| 43.7k| const int64_t X04 = get_uint32(z.data(), 4); 29| 43.7k| const int64_t X05 = get_uint32(z.data(), 5); 30| 43.7k| const int64_t X06 = get_uint32(z.data(), 6); 31| 43.7k| const int64_t X07 = get_uint32(z.data(), 7); 32| 43.7k| const int64_t X08 = get_uint32(z.data(), 8); 33| 43.7k| const int64_t X09 = get_uint32(z.data(), 9); 34| 43.7k| const int64_t X10 = get_uint32(z.data(), 10); 35| 43.7k| const int64_t X11 = get_uint32(z.data(), 11); 36| 43.7k| const int64_t X12 = get_uint32(z.data(), 12); 37| 43.7k| const int64_t X13 = get_uint32(z.data(), 13); 38| 43.7k| const int64_t X14 = get_uint32(z.data(), 14); 39| 43.7k| const int64_t X15 = get_uint32(z.data(), 15); 40| 43.7k| const int64_t X16 = get_uint32(z.data(), 16); 41| 43.7k| const int64_t X17 = get_uint32(z.data(), 17); 42| 43.7k| const int64_t X18 = get_uint32(z.data(), 18); 43| 43.7k| const int64_t X19 = get_uint32(z.data(), 19); 44| 43.7k| const int64_t X20 = get_uint32(z.data(), 20); 45| 43.7k| const int64_t X21 = get_uint32(z.data(), 21); 46| 43.7k| const int64_t X22 = get_uint32(z.data(), 22); 47| 43.7k| const int64_t X23 = get_uint32(z.data(), 23); 48| | 49| | // One copy of P-384 is added to prevent underflow 50| 43.7k| const int64_t S0 = 0xFFFFFFFF + X00 + X12 + X20 + X21 - X23; 51| 43.7k| const int64_t S1 = 0x00000000 + X01 + X13 + X22 + X23 - X12 - X20; 52| 43.7k| const int64_t S2 = 0x00000000 + X02 + X14 + X23 - X13 - X21; 53| 43.7k| const int64_t S3 = 0xFFFFFFFF + X03 + X12 + X15 + X20 + X21 - X14 - X22 - X23; 54| 43.7k| const int64_t S4 = 0xFFFFFFFE + X04 + X12 + X13 + X16 + X20 + X21 * 2 + X22 - X15 - X23 * 2; 55| 43.7k| const int64_t S5 = 0xFFFFFFFF + X05 + X13 + X14 + X17 + X21 + X22 * 2 + X23 - X16; 56| 43.7k| const int64_t S6 = 0xFFFFFFFF + X06 + X14 + X15 + X18 + X22 + X23 * 2 - X17; 57| 43.7k| const int64_t S7 = 0xFFFFFFFF + X07 + X15 + X16 + X19 + X23 - X18; 58| 43.7k| const int64_t S8 = 0xFFFFFFFF + X08 + X16 + X17 + X20 - X19; 59| 43.7k| const int64_t S9 = 0xFFFFFFFF + X09 + X17 + X18 + X21 - X20; 60| 43.7k| const int64_t SA = 0xFFFFFFFF + X10 + X18 + X19 + X22 - X21; 61| 43.7k| const int64_t SB = 0xFFFFFFFF + X11 + X19 + X20 + X23 - X22; 62| | 63| 43.7k| std::array r = {}; 64| | 65| 43.7k| SolinasAccum sum(r); 66| | 67| 43.7k| sum.accum(S0); 68| 43.7k| sum.accum(S1); 69| 43.7k| sum.accum(S2); 70| 43.7k| sum.accum(S3); 71| 43.7k| sum.accum(S4); 72| 43.7k| sum.accum(S5); 73| 43.7k| sum.accum(S6); 74| 43.7k| sum.accum(S7); 75| 43.7k| sum.accum(S8); 76| 43.7k| sum.accum(S9); 77| 43.7k| sum.accum(SA); 78| 43.7k| sum.accum(SB); 79| 43.7k| const auto S = sum.final_carry(0); 80| | 81| 43.7k| BOTAN_DEBUG_ASSERT(S <= 4); ------------------ | | 130| 43.7k| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 43.7k| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 43.7k] | | ------------------ ------------------ 82| | 83| 43.7k| solinas_correct_redc(r, P, p384_mul_mod_384(S)); 84| | 85| 43.7k| return r; 86| 43.7k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE16p384_mul_mod_384Em: 100| 43.7k| constexpr static std::array p384_mul_mod_384(W i) { 101| 43.7k| 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| 43.7k| 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| 43.7k| } else { 113| 43.7k| const uint64_t i32 = static_cast(i) << 32; 114| 43.7k| r[2] -= i; 115| 43.7k| r[1] -= i32; 116| 43.7k| r[0] += i32; 117| 43.7k| r[0] -= i; 118| 43.7k| } 119| 43.7k| return r; 120| 43.7k| } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE8from_repERKNSt3__15arrayImLm6EEE: 94| 1| constexpr static std::array from_rep(const std::array& z) { return z; } pcurves_secp384r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_112Secp384r1RepINS_13EllipticCurveINS1_9secp384r16ParamsES2_E11FieldParamsEE6to_repERKNSt3__15arrayImLm6EEE: 90| 1| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan6PCurve14PCurveInstance9secp521r1Ev: 291| 1|std::shared_ptr PCurveInstance::secp521r1() { 292| 1| return PrimeOrderCurveImpl::instance(); 293| 1|} pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE3oneEv: 24| 1| constexpr static std::array one() { return std::array{1}; } pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEE: 26| 58.2k| 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| 58.2k| constexpr W TOP_BITS = static_cast(0x1FF); 29| | // The 23 or 55 bits that should be cleared in the top word 30| 58.2k| constexpr W CLEARED_TOP_BITS = WordInfo::max ^ TOP_BITS; 31| | 32| | /* 33| | * Extract the high part of z (z >> 521) 34| | */ 35| 58.2k| std::array t; // NOLINT(*-member-init) 36| | 37| 582k| for(size_t i = 0; i != N; ++i) { ------------------ | Branch (37:28): [True: 524k, False: 58.2k] ------------------ 38| 524k| t[i] = z[(N - 1) + i] >> 9; 39| 524k| } 40| | 41| 524k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (41:28): [True: 466k, False: 58.2k] ------------------ 42| 466k| t[i] |= z[(N - 1) + i + 1] << (WordInfo::bits - 9); 43| 466k| } 44| | 45| | // Now t += z & (2**521-1) 46| 58.2k| W carry = 0; 47| 524k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (47:28): [True: 466k, False: 58.2k] ------------------ 48| 466k| t[i] = word_add(t[i], z[i], &carry); 49| 466k| } 50| | 51| | // Now add the (partial) top words; this can't carry out 52| | // since both inputs are at most 2**9-1 53| 58.2k| 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| 58.2k| 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| 58.2k| const W is_eq_p521 = [&]() { 71| 58.2k| W sum = WordInfo::max; 72| 58.2k| for(size_t i = 0; i != N - 1; ++i) { 73| 58.2k| sum &= t[i]; 74| 58.2k| } 75| 58.2k| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 58.2k| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 58.2k| }(); 79| | 80| 58.2k| const W need_sub = is_over_p521 | is_eq_p521; 81| | 82| 58.2k| W borrow = 0; 83| 524k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (83:28): [True: 466k, False: 58.2k] ------------------ 84| 466k| t[i] = word_sub(t[i], need_sub & WordInfo::max, &borrow); 85| 466k| } 86| 58.2k| t[N - 1] = word_sub(t[N - 1], need_sub & TOP_BITS, &borrow); 87| | 88| 58.2k| return t; 89| 58.2k| } pcurves_secp521r1.cpp:_ZZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE4redcERKNSt3__15arrayImLm18EEEENKUlvE_clEv: 70| 58.2k| const W is_eq_p521 = [&]() { 71| 58.2k| W sum = WordInfo::max; 72| 524k| for(size_t i = 0; i != N - 1; ++i) { ------------------ | Branch (72:31): [True: 466k, False: 58.2k] ------------------ 73| 466k| sum &= t[i]; 74| 466k| } 75| 58.2k| sum &= (CLEARED_TOP_BITS | t[N - 1]); 76| | 77| 58.2k| return CT::Mask::is_zero(sum ^ WordInfo::max).value(); 78| 58.2k| }(); pcurves_secp521r1.cpp:_ZN5Botan6PCurve12_GLOBAL__N_19secp521r17P521RepINS_13EllipticCurveINS2_6ParamsES3_E11FieldParamsEE8from_repERKNSt3__15arrayImLm9EEE: 95| 1| 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| 49| constexpr static std::array to_rep(const std::array& x) { return x; } _ZN5Botan9AEAD_Mode15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_10Cipher_DirES5_: 51| 33| std::string_view provider) { 52| 33| if(auto aead = AEAD_Mode::create(algo, dir, provider)) { ------------------ | Branch (52:12): [True: 33, False: 0] ------------------ 53| 33| return aead; 54| 33| } 55| | 56| 0| throw Lookup_Error("AEAD", algo, provider); 57| 33|} _ZN5Botan9AEAD_Mode6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEENS_10Cipher_DirES5_: 59| 66|std::unique_ptr AEAD_Mode::create(std::string_view algo, Cipher_Dir dir, std::string_view provider) { 60| 66| BOTAN_UNUSED(provider); ------------------ | | 144| 66|#define BOTAN_UNUSED Botan::ignore_params ------------------ 61| 66|#if defined(BOTAN_HAS_AEAD_CHACHA20_POLY1305) 62| 66| if(algo == "ChaCha20Poly1305") { ------------------ | Branch (62:7): [True: 0, False: 66] ------------------ 63| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (63:10): [True: 0, False: 0] ------------------ 64| 0| return std::make_unique(); 65| 0| } else { 66| 0| return std::make_unique(); 67| 0| } 68| 0| } 69| 66|#endif 70| | 71| 66|#if defined(BOTAN_HAS_ASCON_AEAD128) 72| 66| if(algo == "Ascon-AEAD128") { ------------------ | Branch (72:7): [True: 0, False: 66] ------------------ 73| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (73:10): [True: 0, False: 0] ------------------ 74| 0| return std::make_unique(); 75| 0| } else { 76| 0| return std::make_unique(); 77| 0| } 78| 0| } 79| 66|#endif 80| | 81| 66| if(algo.find('/') != std::string::npos) { ------------------ | Branch (81:7): [True: 33, False: 33] ------------------ 82| 33| const std::vector algo_parts = split_on(algo, '/'); 83| 33| const std::string_view cipher_name = algo_parts[0]; 84| 33| const std::vector mode_info = parse_algorithm_name(algo_parts[1]); 85| | 86| 33| if(mode_info.empty()) { ------------------ | Branch (86:10): [True: 0, False: 33] ------------------ 87| 0| return std::unique_ptr(); 88| 0| } 89| | 90| 33| std::ostringstream mode_name; 91| | 92| 33| mode_name << mode_info[0] << '(' << cipher_name; 93| 33| for(size_t i = 1; i < mode_info.size(); ++i) { ------------------ | Branch (93:25): [True: 0, False: 33] ------------------ 94| 0| mode_name << ',' << mode_info[i]; 95| 0| } 96| 33| for(size_t i = 2; i < algo_parts.size(); ++i) { ------------------ | Branch (96:25): [True: 0, False: 33] ------------------ 97| 0| mode_name << ',' << algo_parts[i]; 98| 0| } 99| 33| mode_name << ')'; 100| | 101| 33| return AEAD_Mode::create(mode_name.str(), dir); 102| 33| } 103| | 104| 33|#if defined(BOTAN_HAS_BLOCK_CIPHER) 105| | 106| 33| const SCAN_Name req(algo); 107| | 108| 33| if(req.arg_count() == 0) { ------------------ | Branch (108:7): [True: 0, False: 33] ------------------ 109| 0| return std::unique_ptr(); 110| 0| } 111| | 112| 33| auto bc = BlockCipher::create(req.arg(0), provider); 113| | 114| 33| if(!bc) { ------------------ | Branch (114:7): [True: 0, False: 33] ------------------ 115| 0| return std::unique_ptr(); 116| 0| } 117| | 118| 33| #if defined(BOTAN_HAS_AEAD_CCM) 119| 33| if(req.algo_name() == "CCM") { ------------------ | Branch (119:7): [True: 1, False: 32] ------------------ 120| 1| const size_t tag_len = req.arg_as_integer(1, 16); 121| 1| const size_t L_len = req.arg_as_integer(2, 3); 122| 1| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (122:10): [True: 1, False: 0] ------------------ 123| 1| return std::make_unique(std::move(bc), tag_len, L_len); 124| 1| } else { 125| 0| return std::make_unique(std::move(bc), tag_len, L_len); 126| 0| } 127| 1| } 128| 32| #endif 129| | 130| 32| #if defined(BOTAN_HAS_AEAD_GCM) 131| 32| if(req.algo_name() == "GCM") { ------------------ | Branch (131:7): [True: 32, False: 0] ------------------ 132| 32| const size_t tag_len = req.arg_as_integer(1, 16); 133| 32| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (133:10): [True: 32, False: 0] ------------------ 134| 32| return std::make_unique(std::move(bc), tag_len); 135| 32| } else { 136| 0| return std::make_unique(std::move(bc), tag_len); 137| 0| } 138| 32| } 139| 0| #endif 140| | 141| 0| #if defined(BOTAN_HAS_AEAD_OCB) 142| 0| if(req.algo_name() == "OCB") { ------------------ | Branch (142:7): [True: 0, False: 0] ------------------ 143| 0| const size_t tag_len = req.arg_as_integer(1, 16); 144| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (144:10): [True: 0, False: 0] ------------------ 145| 0| return std::make_unique(std::move(bc), tag_len); 146| 0| } else { 147| 0| return std::make_unique(std::move(bc), tag_len); 148| 0| } 149| 0| } 150| 0| #endif 151| | 152| 0| #if defined(BOTAN_HAS_AEAD_EAX) 153| 0| if(req.algo_name() == "EAX") { ------------------ | Branch (153:7): [True: 0, False: 0] ------------------ 154| 0| const size_t tag_len = req.arg_as_integer(1, bc->block_size()); 155| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (155:10): [True: 0, False: 0] ------------------ 156| 0| return std::make_unique(std::move(bc), tag_len); 157| 0| } else { 158| 0| return std::make_unique(std::move(bc), tag_len); 159| 0| } 160| 0| } 161| 0| #endif 162| | 163| 0| #if defined(BOTAN_HAS_AEAD_SIV) 164| 0| if(req.algo_name() == "SIV") { ------------------ | Branch (164:7): [True: 0, False: 0] ------------------ 165| 0| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (165:10): [True: 0, False: 0] ------------------ 166| 0| return std::make_unique(std::move(bc)); 167| 0| } else { 168| 0| return std::make_unique(std::move(bc)); 169| 0| } 170| 0| } 171| 0| #endif 172| | 173| 0|#endif 174| | 175| 0| return std::unique_ptr(); 176| 0|} _ZN5Botan8CCM_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEmm: 26| 1| m_tag_size(tag_size), m_L(L), m_cipher(std::move(cipher)) { 27| 1| if(m_cipher->block_size() != CCM_BS) { ------------------ | Branch (27:7): [True: 0, False: 1] ------------------ 28| 0| throw Invalid_Argument(m_cipher->name() + " cannot be used with CCM mode"); 29| 0| } 30| | 31| 1| if(L < 2 || L > 8) { ------------------ | Branch (31:7): [True: 0, False: 1] | Branch (31:16): [True: 0, False: 1] ------------------ 32| 0| throw Invalid_Argument(fmt("Invalid CCM L value {}", L)); 33| 0| } 34| | 35| 1| if(tag_size < 4 || tag_size > 16 || tag_size % 2 != 0) { ------------------ | Branch (35:7): [True: 0, False: 1] | Branch (35:23): [True: 0, False: 1] | Branch (35:40): [True: 0, False: 1] ------------------ 36| 0| throw Invalid_Argument(fmt("Invalid CCM tag length {}", tag_size)); 37| 0| } 38| 1|} _ZN5Botan8CCM_Mode5resetEv: 45| 1|void CCM_Mode::reset() { 46| 1| m_nonce.clear(); 47| 1| m_msg_buf.clear(); 48| 1| m_ad_buf.clear(); 49| 1|} _ZNK5Botan8CCM_Mode18valid_nonce_lengthEm: 55| 1|bool CCM_Mode::valid_nonce_length(size_t length) const { 56| 1| return (length == (15 - L())); 57| 1|} _ZNK5Botan8CCM_Mode8key_specEv: 76| 1|Key_Length_Specification CCM_Mode::key_spec() const { 77| 1| return m_cipher->key_spec(); 78| 1|} _ZN5Botan8CCM_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 84| 1|void CCM_Mode::key_schedule(std::span key) { 85| 1| m_cipher->set_key(key); 86| 1|} _ZN5Botan8CCM_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 88| 1|void CCM_Mode::set_associated_data_n(size_t idx, std::span ad) { 89| 1| BOTAN_ARG_CHECK(idx == 0, "CCM: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 90| | 91| 1| m_ad_buf.clear(); 92| | 93| 1| if(!ad.empty()) { ------------------ | Branch (93:7): [True: 1, False: 0] ------------------ 94| | // FIXME: support larger AD using length encoding rules 95| 1| BOTAN_ARG_CHECK(ad.size() < (0xFFFF - 0xFF), "Supported CCM AD length"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 96| | 97| 1| m_ad_buf.push_back(get_byte<0>(static_cast(ad.size()))); 98| 1| m_ad_buf.push_back(get_byte<1>(static_cast(ad.size()))); 99| 1| m_ad_buf.insert(m_ad_buf.end(), ad.begin(), ad.end()); 100| 2| while(m_ad_buf.size() % CCM_BS != 0) { ------------------ | Branch (100:13): [True: 1, False: 1] ------------------ 101| 1| m_ad_buf.push_back(0); // pad with zeros to full block size 102| 1| } 103| 1| } 104| 1|} _ZN5Botan8CCM_Mode9start_msgEPKhm: 106| 1|void CCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 107| 1| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (107:7): [True: 0, False: 1] ------------------ 108| 0| throw Invalid_IV_Length(name(), nonce_len); 109| 0| } 110| | 111| 1| m_nonce.assign(nonce, nonce + nonce_len); 112| 1| m_msg_buf.clear(); 113| 1|} _ZN5Botan8CCM_Mode13encode_lengthEmPh: 130| 1|void CCM_Mode::encode_length(uint64_t len, uint8_t out[]) { 131| 1| const size_t len_bytes = L(); 132| | 133| 1| BOTAN_ASSERT_NOMSG(len_bytes >= 2 && len_bytes <= 8); ------------------ | | 77| 1| do { \ | | 78| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 2| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 1, False: 0] | | | Branch (79:12): [True: 1, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 1| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 1] | | ------------------ ------------------ 134| | 135| 4| for(size_t i = 0; i != len_bytes; ++i) { ------------------ | Branch (135:22): [True: 3, False: 1] ------------------ 136| 3| out[len_bytes - 1 - i] = get_byte_var(sizeof(uint64_t) - 1 - i, len); 137| 3| } 138| | 139| 1| if(len_bytes < 8 && (len >> (len_bytes * 8)) > 0) { ------------------ | Branch (139:7): [True: 1, False: 0] | Branch (139:24): [True: 0, False: 1] ------------------ 140| 0| throw Encoding_Error("CCM message length too long to encode in L field"); 141| 0| } 142| 1|} _ZN5Botan8CCM_Mode3incERNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 144| 2|void CCM_Mode::inc(secure_vector& C) { 145| 2| for(size_t i = 0; i != C.size(); ++i) { ------------------ | Branch (145:22): [True: 2, False: 0] ------------------ 146| 2| uint8_t& b = C[C.size() - i - 1]; 147| 2| b += 1; 148| 2| if(b > 0) { ------------------ | Branch (148:10): [True: 2, False: 0] ------------------ 149| 2| break; 150| 2| } 151| 2| } 152| 2|} _ZN5Botan8CCM_Mode9format_b0Em: 154| 1|secure_vector CCM_Mode::format_b0(size_t sz) { 155| 1| if(m_nonce.size() != 15 - L()) { ------------------ | Branch (155:7): [True: 0, False: 1] ------------------ 156| 0| throw Invalid_State("CCM mode must set nonce"); 157| 0| } 158| 1| secure_vector B0(CCM_BS); 159| | 160| 1| const uint8_t b_flags = 161| 1| static_cast((!m_ad_buf.empty() ? 64 : 0) + (((tag_size() / 2) - 1) << 3) + (L() - 1)); ------------------ | Branch (161:29): [True: 1, False: 0] ------------------ 162| | 163| 1| B0[0] = b_flags; 164| 1| copy_mem(&B0[1], m_nonce.data(), m_nonce.size()); 165| 1| encode_length(sz, &B0[m_nonce.size() + 1]); 166| | 167| 1| return B0; 168| 1|} _ZN5Botan8CCM_Mode9format_c0Ev: 170| 1|secure_vector CCM_Mode::format_c0() { 171| 1| if(m_nonce.size() != 15 - L()) { ------------------ | Branch (171:7): [True: 0, False: 1] ------------------ 172| 0| throw Invalid_State("CCM mode must set nonce"); 173| 0| } 174| 1| secure_vector C(CCM_BS); 175| | 176| 1| const uint8_t a_flags = static_cast(L() - 1); 177| | 178| 1| C[0] = a_flags; 179| 1| copy_mem(&C[1], m_nonce.data(), m_nonce.size()); 180| | 181| 1| return C; 182| 1|} _ZN5Botan14CCM_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 184| 1|void CCM_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 185| 1| BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 186| | 187| 1| buffer.insert(buffer.begin() + offset, msg_buf().begin(), msg_buf().end()); 188| | 189| 1| const size_t sz = buffer.size() - offset; 190| 1| uint8_t* buf = buffer.data() + offset; 191| | 192| 1| const secure_vector& ad = ad_buf(); 193| 1| BOTAN_ARG_CHECK(ad.size() % CCM_BS == 0, "AD is block size multiple"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 1| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 1] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 194| | 195| 1| const BlockCipher& E = cipher(); 196| | 197| 1| secure_vector T(CCM_BS); 198| 1| E.encrypt(format_b0(sz), T); 199| | 200| 2| for(size_t i = 0; i != ad.size(); i += CCM_BS) { ------------------ | Branch (200:22): [True: 1, False: 1] ------------------ 201| 1| xor_buf(T.data(), &ad[i], CCM_BS); 202| 1| E.encrypt(T); 203| 1| } 204| | 205| 1| secure_vector C = format_c0(); 206| 1| secure_vector S0(CCM_BS); 207| 1| E.encrypt(C, S0); 208| 1| inc(C); 209| | 210| 1| secure_vector X(CCM_BS); 211| | 212| 1| const uint8_t* buf_end = &buf[sz]; 213| | 214| 2| while(buf != buf_end) { ------------------ | Branch (214:10): [True: 1, False: 1] ------------------ 215| 1| const size_t to_proc = std::min(CCM_BS, buf_end - buf); 216| | 217| 1| xor_buf(T.data(), buf, to_proc); 218| 1| E.encrypt(T); 219| | 220| 1| E.encrypt(C, X); 221| 1| xor_buf(buf, X.data(), to_proc); 222| 1| inc(C); 223| | 224| 1| buf += to_proc; 225| 1| } 226| | 227| 1| T ^= S0; 228| | 229| 1| buffer += std::make_pair(T.data(), tag_size()); 230| | 231| 1| reset(); 232| 1|} _ZN5Botan8GCM_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 26| 32| m_tag_size(tag_size), m_cipher_name(cipher->name()) { 27| 32| if(cipher->block_size() != GCM_BS) { ------------------ | Branch (27:7): [True: 0, False: 32] ------------------ 28| 0| throw Invalid_Argument("Invalid block cipher for GCM"); 29| 0| } 30| | 31| | /* We allow any of the values 128, 120, 112, 104, or 96 bits as a tag size */ 32| | /* 64 bit tag is still supported but deprecated and will be removed in the future */ 33| 32| if(m_tag_size != 8 && (m_tag_size < 12 || m_tag_size > 16)) { ------------------ | Branch (33:7): [True: 32, False: 0] | Branch (33:27): [True: 0, False: 32] | Branch (33:46): [True: 0, False: 32] ------------------ 34| 0| throw Invalid_Argument(fmt("{} cannot use a tag of {} bytes", name(), m_tag_size)); 35| 0| } 36| | 37| 32| m_ctr = std::make_unique(std::move(cipher), 4); 38| 32| m_ghash = std::make_unique(); 39| 32|} _ZN5Botan8GCM_ModeD2Ev: 41| 32|GCM_Mode::~GCM_Mode() = default; _ZNK5Botan8GCM_Mode18valid_nonce_lengthEm: 69| 37|bool GCM_Mode::valid_nonce_length(size_t len) const { 70| | // GCM does not support empty nonces 71| 37| return (len > 0); 72| 37|} _ZNK5Botan8GCM_Mode8key_specEv: 74| 32|Key_Length_Specification GCM_Mode::key_spec() const { 75| 32| return m_ctr->key_spec(); 76| 32|} _ZN5Botan8GCM_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 82| 32|void GCM_Mode::key_schedule(std::span key) { 83| 32| m_ctr->set_key(key); 84| | 85| 32| std::array zeros{}; 86| 32| m_ctr->set_iv(zeros); 87| | 88| 32| uint8_t H[GCM_BS] = {0}; 89| 32| m_ctr->encipher(H); 90| 32| m_ghash->set_key(H); 91| 32|} _ZN5Botan8GCM_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 93| 37|void GCM_Mode::set_associated_data_n(size_t idx, std::span ad) { 94| 37| BOTAN_ARG_CHECK(idx == 0, "GCM: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 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] | | ------------------ ------------------ 95| 37| m_ghash->set_associated_data(ad); 96| 37|} _ZN5Botan8GCM_Mode9start_msgEPKhm: 98| 37|void GCM_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 99| 37| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (99:7): [True: 0, False: 37] ------------------ 100| 0| throw Invalid_IV_Length(name(), nonce_len); 101| 0| } 102| | 103| 37| std::array y0 = {}; 104| | 105| 37| if(nonce_len == 12) { ------------------ | Branch (105:7): [True: 37, False: 0] ------------------ 106| 37| copy_mem(y0.data(), nonce, nonce_len); 107| 37| y0[15] = 1; 108| 37| } else { 109| 0| m_ghash->nonce_hash(std::span(y0), {nonce, nonce_len}); 110| 0| } 111| | 112| 37| m_ctr->set_iv(y0.data(), y0.size()); 113| | 114| 37| clear_mem(y0.data(), y0.size()); 115| 37| m_ctr->encipher(y0); 116| | 117| 37| m_ghash->start(y0); 118| 37| secure_scrub_memory(y0); 119| 37|} _ZN5Botan14GCM_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 128| 37|void GCM_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 129| 37| BOTAN_ARG_CHECK(offset <= buffer.size(), "Invalid offset"); ------------------ | | 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] | | ------------------ ------------------ 130| 37| const size_t sz = buffer.size() - offset; 131| 37| uint8_t* buf = buffer.data() + offset; 132| | 133| 37| m_ctr->cipher(buf, buf, sz); 134| 37| m_ghash->update({buf, sz}); 135| | 136| 37| std::array mac = {0}; 137| 37| m_ghash->final(std::span(mac).first(tag_size())); 138| 37| buffer += std::make_pair(mac.data(), tag_size()); 139| 37|} _ZN5Botan8CBC_ModeC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEENS2_INS_28BlockCipherModePaddingMethodENS4_IS7_EEEE: 20| 30| m_cipher(std::move(cipher)), m_padding(std::move(padding)), m_block_size(m_cipher->block_size()) { 21| 30| if(m_padding && !m_padding->valid_blocksize(m_block_size)) { ------------------ | Branch (21:7): [True: 30, False: 0] | Branch (21:20): [True: 0, False: 30] ------------------ 22| 0| throw Invalid_Argument(fmt("Padding {} cannot be used with {} in CBC mode", m_padding->name(), m_cipher->name())); 23| 0| } 24| 30|} _ZNK5Botan8CBC_Mode17ideal_granularityEv: 47| 7|size_t CBC_Mode::ideal_granularity() const { 48| 7| return cipher().parallel_bytes(); 49| 7|} _ZNK5Botan8CBC_Mode8key_specEv: 51| 30|Key_Length_Specification CBC_Mode::key_spec() const { 52| 30| return cipher().key_spec(); 53| 30|} _ZNK5Botan8CBC_Mode18valid_nonce_lengthEm: 59| 44|bool CBC_Mode::valid_nonce_length(size_t n) const { 60| 44| return (n == 0 || n == block_size()); ------------------ | Branch (60:12): [True: 0, False: 44] | Branch (60:22): [True: 44, False: 0] ------------------ 61| 44|} _ZN5Botan8CBC_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 67| 30|void CBC_Mode::key_schedule(std::span key) { 68| 30| m_cipher->set_key(key); 69| 30| m_state.clear(); 70| 30|} _ZN5Botan8CBC_Mode9start_msgEPKhm: 72| 44|void CBC_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 73| 44| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (73:7): [True: 0, False: 44] ------------------ 74| 0| throw Invalid_IV_Length(name(), nonce_len); 75| 0| } 76| | 77| | /* 78| | * A nonce of zero length means carry the last ciphertext value over 79| | * as the new IV, as unfortunately some protocols require this. If 80| | * this is the first message then we use an IV of all zeros. 81| | */ 82| 44| if(nonce_len > 0) { ------------------ | Branch (82:7): [True: 44, False: 0] ------------------ 83| 44| m_state.assign(nonce, nonce + nonce_len); 84| 44| } else if(m_state.empty()) { ------------------ | Branch (84:14): [True: 0, False: 0] ------------------ 85| 0| m_state.resize(m_cipher->block_size()); 86| 0| } 87| | // else leave the state alone 88| 44|} _ZN5Botan14CBC_Encryption11process_msgEPhm: 98| 42|size_t CBC_Encryption::process_msg(uint8_t buf[], size_t sz) { 99| 42| BOTAN_STATE_CHECK(state().empty() == false); ------------------ | | 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] | | ------------------ ------------------ 100| 42| const size_t BS = block_size(); 101| | 102| 42| BOTAN_ARG_CHECK(sz % BS == 0, "CBC input is not full blocks"); ------------------ | | 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] | | ------------------ ------------------ 103| 42| const size_t blocks = sz / BS; 104| | 105| 42| if(blocks > 0) { ------------------ | Branch (105:7): [True: 42, False: 0] ------------------ 106| 42| xor_buf(&buf[0], state_ptr(), BS); 107| 42| cipher().encrypt(&buf[0]); 108| | 109| 153| for(size_t i = 1; i != blocks; ++i) { ------------------ | Branch (109:25): [True: 111, False: 42] ------------------ 110| 111| xor_buf(&buf[BS * i], &buf[BS * (i - 1)], BS); 111| 111| cipher().encrypt(&buf[BS * i]); 112| 111| } 113| | 114| 42| state().assign(&buf[BS * (blocks - 1)], &buf[BS * blocks]); 115| 42| } 116| | 117| 42| return sz; 118| 42|} _ZN5Botan14CBC_Decryption11process_msgEPhm: 198| 2|size_t CBC_Decryption::process_msg(uint8_t buf[], size_t sz) { 199| 2| BOTAN_STATE_CHECK(state().empty() == false); ------------------ | | 51| 2| do { \ | | 52| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 2| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 2] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 2| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 2] | | ------------------ ------------------ 200| | 201| 2| const size_t BS = block_size(); 202| | 203| 2| BOTAN_ARG_CHECK(sz % BS == 0, "Input is not full blocks"); ------------------ | | 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] | | ------------------ ------------------ 204| 2| size_t blocks = sz / BS; 205| | 206| 5| while(blocks > 0) { ------------------ | Branch (206:10): [True: 3, False: 2] ------------------ 207| 3| const size_t to_proc = std::min(BS * blocks, m_tempbuf.size()); 208| | 209| 3| cipher().decrypt_n(buf, m_tempbuf.data(), to_proc / BS); 210| | 211| 3| xor_buf(m_tempbuf.data(), state_ptr(), BS); 212| 3| xor_buf(&m_tempbuf[BS], buf, to_proc - BS); 213| 3| copy_mem(state_ptr(), buf + (to_proc - BS), BS); 214| | 215| 3| copy_mem(buf, m_tempbuf.data(), to_proc); 216| | 217| 3| buf += to_proc; 218| 3| blocks -= to_proc / BS; 219| 3| } 220| | 221| 2| return sz; 222| 2|} _ZNK5Botan12EME_PKCS1v153padENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEEmRNS_21RandomNumberGeneratorE: 24| 3| RandomNumberGenerator& rng) const { 25| 3| key_length /= 8; 26| | 27| 3| if(input.size() > maximum_input_size(key_length * 8)) { ------------------ | Branch (27:7): [True: 0, False: 3] ------------------ 28| 0| throw Invalid_Argument("PKCS1: Input is too large"); 29| 0| } 30| | 31| 3| BufferStuffer stuffer(output); 32| | 33| 3| const size_t padding_bytes = [&]() { 34| 3| auto d = checked_sub(key_length, input.size() + 2); 35| 3| BOTAN_ASSERT_NOMSG(d.has_value()); 36| 3| return *d; 37| 3| }(); 38| | 39| 3| stuffer.append(0x02); 40| 618| for(size_t i = 0; i != padding_bytes; ++i) { ------------------ | Branch (40:22): [True: 615, False: 3] ------------------ 41| 615| stuffer.append(rng.next_nonzero_byte()); 42| 615| } 43| 3| stuffer.append(0x00); 44| 3| stuffer.append(input); 45| | 46| 3| return output.size() - stuffer.remaining_capacity(); 47| 3|} _ZNK5Botan12EME_PKCS1v1518maximum_input_sizeEm: 97| 3|size_t EME_PKCS1v15::maximum_input_size(size_t keybits) const { 98| 3| if(keybits / 8 > 10) { ------------------ | Branch (98:7): [True: 3, False: 0] ------------------ 99| 3| return ((keybits / 8) - 10); 100| 3| } else { 101| 0| return 0; 102| 0| } 103| 3|} eme_pkcs.cpp:_ZZNK5Botan12EME_PKCS1v153padENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEEmRNS_21RandomNumberGeneratorEENK3$_0clEv: 33| 3| const size_t padding_bytes = [&]() { 34| 3| auto d = checked_sub(key_length, input.size() + 2); 35| 3| BOTAN_ASSERT_NOMSG(d.has_value()); ------------------ | | 77| 3| do { \ | | 78| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 3| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 3] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 3| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 3] | | ------------------ ------------------ 36| 3| return *d; 37| 3| }(); _ZN5Botan23EncryptionPaddingScheme6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 27| 3|std::unique_ptr EncryptionPaddingScheme::create(std::string_view algo_spec) { 28| 3|#if defined(BOTAN_HAS_EME_RAW) 29| 3| if(algo_spec == "Raw") { ------------------ | Branch (29:7): [True: 0, False: 3] ------------------ 30| 0| return std::make_unique(); 31| 0| } 32| 3|#endif 33| | 34| 3|#if defined(BOTAN_HAS_EME_PKCS1) 35| | // TODO(Botan4) Remove all but "PKCS1v15" 36| 3| if(algo_spec == "PKCS1v15" || algo_spec == "EME-PKCS1-v1_5") { ------------------ | Branch (36:7): [True: 3, False: 0] | Branch (36:34): [True: 0, False: 0] ------------------ 37| 3| return std::make_unique(); 38| 3| } 39| 0|#endif 40| | 41| 0|#if defined(BOTAN_HAS_EME_OAEP) 42| 0| const SCAN_Name req(algo_spec); 43| | 44| | // TODO(Botan4) Remove all but "OAEP" 45| 0| if(req.algo_name() == "OAEP" || req.algo_name() == "EME-OAEP" || req.algo_name() == "EME1") { ------------------ | Branch (45:7): [True: 0, False: 0] | Branch (45:36): [True: 0, False: 0] | Branch (45:69): [True: 0, False: 0] ------------------ 46| 0| if(req.arg_count() == 1 || ((req.arg_count() == 2 || req.arg_count() == 3) && req.arg(1) == "MGF1")) { ------------------ | Branch (46:10): [True: 0, False: 0] | Branch (46:10): [True: 0, False: 0] | Branch (46:36): [True: 0, False: 0] | Branch (46:60): [True: 0, False: 0] | Branch (46:85): [True: 0, False: 0] ------------------ 47| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (47:18): [True: 0, False: 0] ------------------ 48| 0| return std::make_unique(std::move(hash), req.arg(2, "")); 49| 0| } 50| 0| } else if(req.arg_count() == 2 || req.arg_count() == 3) { ------------------ | Branch (50:17): [True: 0, False: 0] | Branch (50:41): [True: 0, False: 0] ------------------ 51| 0| auto mgf_params = parse_algorithm_name(req.arg(1)); 52| | 53| 0| if(mgf_params.size() == 2 && mgf_params[0] == "MGF1") { ------------------ | Branch (53:13): [True: 0, False: 0] | Branch (53:39): [True: 0, False: 0] ------------------ 54| 0| auto hash = HashFunction::create(req.arg(0)); 55| 0| auto mgf1_hash = HashFunction::create(mgf_params[1]); 56| | 57| 0| if(hash && mgf1_hash) { ------------------ | Branch (57:16): [True: 0, False: 0] | Branch (57:24): [True: 0, False: 0] ------------------ 58| 0| return std::make_unique(std::move(hash), std::move(mgf1_hash), req.arg(2, "")); 59| 0| } 60| 0| } 61| 0| } 62| 0| } 63| 0|#endif 64| | 65| 0| throw Algorithm_Not_Found(algo_spec); 66| 0|} _ZN5Botan23EncryptionPaddingSchemeD2Ev: 68| 3|EncryptionPaddingScheme::~EncryptionPaddingScheme() = default; _ZN5Botan12pkcs_hash_idENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 78| 296|std::vector pkcs_hash_id(std::string_view name) { 79| | // Special case for SSL/TLS RSA signatures 80| 296| if(name == "Parallel(MD5,SHA-1)") { ------------------ | Branch (80:7): [True: 0, False: 296] ------------------ 81| 0| return std::vector(); 82| 0| } 83| | 84| | // If you add a value to this function, also update test_hash_id.cpp 85| | 86| 296| if(name == "MD5") { ------------------ | Branch (86:7): [True: 0, False: 296] ------------------ 87| 0| return std::vector(MD5_PKCS_ID, MD5_PKCS_ID + sizeof(MD5_PKCS_ID)); 88| 0| } 89| | 90| 296| if(name == "RIPEMD-160") { ------------------ | Branch (90:7): [True: 0, False: 296] ------------------ 91| 0| return std::vector(RIPEMD_160_PKCS_ID, RIPEMD_160_PKCS_ID + sizeof(RIPEMD_160_PKCS_ID)); 92| 0| } 93| | 94| 296| if(name == "SHA-1") { ------------------ | Branch (94:7): [True: 0, False: 296] ------------------ 95| 0| return std::vector(SHA_1_PKCS_ID, SHA_1_PKCS_ID + sizeof(SHA_1_PKCS_ID)); 96| 0| } 97| | 98| 296| if(name == "SHA-224") { ------------------ | Branch (98:7): [True: 0, False: 296] ------------------ 99| 0| return std::vector(SHA_224_PKCS_ID, SHA_224_PKCS_ID + sizeof(SHA_224_PKCS_ID)); 100| 0| } 101| | 102| 296| if(name == "SHA-256") { ------------------ | Branch (102:7): [True: 4, False: 292] ------------------ 103| 4| return std::vector(SHA_256_PKCS_ID, SHA_256_PKCS_ID + sizeof(SHA_256_PKCS_ID)); 104| 4| } 105| | 106| 292| if(name == "SHA-384") { ------------------ | Branch (106:7): [True: 2, False: 290] ------------------ 107| 2| return std::vector(SHA_384_PKCS_ID, SHA_384_PKCS_ID + sizeof(SHA_384_PKCS_ID)); 108| 2| } 109| | 110| 290| if(name == "SHA-512") { ------------------ | Branch (110:7): [True: 290, False: 0] ------------------ 111| 290| return std::vector(SHA_512_PKCS_ID, SHA_512_PKCS_ID + sizeof(SHA_512_PKCS_ID)); 112| 290| } 113| | 114| 0| if(name == "SHA-512-256") { ------------------ | Branch (114:7): [True: 0, False: 0] ------------------ 115| 0| return std::vector(SHA_512_256_PKCS_ID, SHA_512_256_PKCS_ID + sizeof(SHA_512_256_PKCS_ID)); 116| 0| } 117| | 118| 0| if(name == "SHA-3(224)") { ------------------ | Branch (118:7): [True: 0, False: 0] ------------------ 119| 0| return std::vector(SHA3_224_PKCS_ID, SHA3_224_PKCS_ID + sizeof(SHA3_224_PKCS_ID)); 120| 0| } 121| | 122| 0| if(name == "SHA-3(256)") { ------------------ | Branch (122:7): [True: 0, False: 0] ------------------ 123| 0| return std::vector(SHA3_256_PKCS_ID, SHA3_256_PKCS_ID + sizeof(SHA3_256_PKCS_ID)); 124| 0| } 125| | 126| 0| if(name == "SHA-3(384)") { ------------------ | Branch (126:7): [True: 0, False: 0] ------------------ 127| 0| return std::vector(SHA3_384_PKCS_ID, SHA3_384_PKCS_ID + sizeof(SHA3_384_PKCS_ID)); 128| 0| } 129| | 130| 0| if(name == "SHA-3(512)") { ------------------ | Branch (130:7): [True: 0, False: 0] ------------------ 131| 0| return std::vector(SHA3_512_PKCS_ID, SHA3_512_PKCS_ID + sizeof(SHA3_512_PKCS_ID)); 132| 0| } 133| | 134| 0| if(name == "SM3") { ------------------ | Branch (134:7): [True: 0, False: 0] ------------------ 135| 0| return std::vector(SM3_PKCS_ID, SM3_PKCS_ID + sizeof(SM3_PKCS_ID)); 136| 0| } 137| | 138| 0| throw Invalid_Argument("No PKCS #1 identifier for " + std::string(name)); 139| 0|} _ZN5Botan9mgf1_maskERNS_12HashFunctionENSt3__14spanIKhLm18446744073709551615EEENS3_IhLm18446744073709551615EEE: 15| 8|void mgf1_mask(HashFunction& hash, std::span input, std::span output) { 16| 8| uint32_t counter = 0; 17| | 18| 8| const size_t hlen = hash.output_length(); 19| | 20| 8| BOTAN_ASSERT_NOMSG(hlen > 0); ------------------ | | 77| 8| do { \ | | 78| 8| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 8| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 8] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 8| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 8] | | ------------------ ------------------ 21| | 22| 8| std::vector buffer(hlen); 23| 52| while(!output.empty()) { ------------------ | Branch (23:10): [True: 44, False: 8] ------------------ 24| 44| hash.update(input); 25| 44| hash.update_be(counter); 26| 44| hash.final(buffer); 27| | 28| 44| const size_t xored = std::min(buffer.size(), output.size()); 29| 44| xor_buf(output.first(xored), std::span{buffer}.first(xored)); 30| 44| output = output.subspan(xored); 31| | 32| 44| ++counter; 33| 44| } 34| 8|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme6updateEPKhm: 45| 296|void PKCS1v15_SignaturePaddingScheme::update(const uint8_t input[], size_t length) { 46| 296| m_hash->update(input, length); 47| 296|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme8raw_dataEv: 49| 296|std::vector PKCS1v15_SignaturePaddingScheme::raw_data() { 50| 296| return m_hash->final_stdvec(); 51| 296|} _ZN5Botan31PKCS1v15_SignaturePaddingScheme6verifyENSt3__14spanIKhLm18446744073709551615EEES4_m: 65| 283| size_t key_bits) { 66| 283| if(raw.size() != m_hash->output_length()) { ------------------ | Branch (66:7): [True: 0, False: 283] ------------------ 67| 0| return false; 68| 0| } 69| | 70| 283| try { 71| 283| const auto pkcs1 = pkcs1v15_sig_encoding(raw, key_bits, m_hash_id); 72| 283| return constant_time_compare(coded, pkcs1); 73| 283| } catch(...) { 74| 0| return false; 75| 0| } 76| 283|} _ZN5Botan31PKCS1v15_SignaturePaddingSchemeC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEE: 79| 296| m_hash(std::move(hash)) { 80| 296| m_hash_id = pkcs_hash_id(m_hash->name()); 81| 296|} pkcs1_sig_padding.cpp:_ZN5Botan12_GLOBAL__N_121pkcs1v15_sig_encodingENSt3__14spanIKhLm18446744073709551615EEEmS4_: 23| 283| std::span hash_id) { 24| 283| const size_t output_length = output_bits / 8; 25| | 26| 283| if(output_length < hash_id.size() + msg.size() + 2 + 8) { ------------------ | Branch (26:7): [True: 0, False: 283] ------------------ 27| 0| throw Encoding_Error("pkcs1v15_sig_encoding: Output length is too small"); 28| 0| } 29| | 30| 283| std::vector padded(output_length); 31| 283| BufferStuffer stuffer(padded); 32| | 33| 283| stuffer.append(0x01); 34| 283| stuffer.append(0xFF, stuffer.remaining_capacity() - (1 + hash_id.size() + msg.size())); 35| 283| stuffer.append(0x00); 36| 283| stuffer.append(hash_id); 37| 283| stuffer.append(msg); 38| 283| BOTAN_ASSERT_NOMSG(stuffer.full()); ------------------ | | 77| 283| do { \ | | 78| 283| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 283| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 283] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 283| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 283] | | ------------------ ------------------ 39| | 40| 283| return padded; 41| 283|} _ZN5Botan4PSSRC2ENSt3__110unique_ptrINS_12HashFunctionENS1_14default_deleteIS3_EEEEm: 153| 14| m_hash(std::move(hash)), m_salt_size(salt_size), m_required_salt_len(true) {} _ZN5Botan4PSSR6updateEPKhm: 158| 14|void PSSR::update(const uint8_t input[], size_t length) { 159| 14| m_hash->update(input, length); 160| 14|} _ZN5Botan4PSSR8raw_dataEv: 165| 14|std::vector PSSR::raw_data() { 166| 14| return m_hash->final_stdvec(); 167| 14|} _ZN5Botan4PSSR6verifyENSt3__14spanIKhLm18446744073709551615EEES4_m: 177| 14|bool PSSR::verify(std::span coded, std::span raw, size_t key_bits) { 178| 14| size_t salt_size = 0; 179| 14| const bool ok = pss_verify(*m_hash, coded, raw, key_bits, &salt_size); 180| | 181| 14| if(m_required_salt_len && salt_size != m_salt_size) { ------------------ | Branch (181:7): [True: 14, False: 0] | Branch (181:30): [True: 14, False: 0] ------------------ 182| 14| return false; 183| 14| } 184| | 185| 0| return ok; 186| 14|} pssr.cpp:_ZN5Botan12_GLOBAL__N_110pss_verifyERNS_12HashFunctionENSt3__14spanIKhLm18446744073709551615EEES6_mPm: 70| 14| size_t* out_salt_size) { 71| 14| const size_t HASH_SIZE = hash.output_length(); 72| 14| const size_t key_bytes = ceil_tobytes(key_bits); 73| | 74| 14| if(key_bits < 8 * HASH_SIZE + 9) { ------------------ | Branch (74:7): [True: 0, False: 14] ------------------ 75| 0| return false; 76| 0| } 77| | 78| 14| if(message_hash.size() != HASH_SIZE) { ------------------ | Branch (78:7): [True: 0, False: 14] ------------------ 79| 0| return false; 80| 0| } 81| | 82| 14| if(pss_repr.size() > key_bytes || pss_repr.size() <= 1) { ------------------ | Branch (82:7): [True: 0, False: 14] | Branch (82:38): [True: 0, False: 14] ------------------ 83| 0| return false; 84| 0| } 85| | 86| 14| if(pss_repr[pss_repr.size() - 1] != 0xBC) { ------------------ | Branch (86:7): [True: 5, False: 9] ------------------ 87| 5| return false; 88| 5| } 89| | 90| 9| std::vector coded; 91| 9| if(pss_repr.size() < key_bytes) { ------------------ | Branch (91:7): [True: 3, False: 6] ------------------ 92| 3| coded.resize(key_bytes); 93| 3| BufferStuffer stuffer(coded); 94| 3| stuffer.append(0x00, key_bytes - pss_repr.size()); 95| 3| stuffer.append(pss_repr); 96| 6| } else { 97| 6| coded.assign(pss_repr.begin(), pss_repr.end()); 98| 6| } 99| | 100| | // We have to check this after potential zero padding above 101| 9| const size_t top_bits = 8 * ((key_bits + 7) / 8) - key_bits; 102| 9| if(top_bits > 8 - high_bit(coded[0])) { ------------------ | Branch (102:7): [True: 1, False: 8] ------------------ 103| 1| return false; 104| 1| } 105| | 106| 8| uint8_t* DB = coded.data(); 107| 8| const size_t DB_size = coded.size() - HASH_SIZE - 1; 108| | 109| 8| const uint8_t* H = &coded[DB_size]; 110| 8| const size_t H_size = HASH_SIZE; 111| | 112| 8| mgf1_mask(hash, {H, H_size}, {DB, DB_size}); 113| 8| DB[0] &= 0xFF >> top_bits; 114| | 115| 8| size_t salt_offset = 0; 116| 10| for(size_t j = 0; j != DB_size; ++j) { ------------------ | Branch (116:22): [True: 10, False: 0] ------------------ 117| 10| if(DB[j] == 0x01) { ------------------ | Branch (117:10): [True: 2, False: 8] ------------------ 118| 2| salt_offset = j + 1; 119| 2| break; 120| 2| } 121| 8| if(DB[j] != 0x00) { ------------------ | Branch (121:10): [True: 6, False: 2] ------------------ 122| 6| return false; 123| 6| } 124| 8| } 125| 2| if(salt_offset == 0) { ------------------ | Branch (125:7): [True: 0, False: 2] ------------------ 126| 0| return false; 127| 0| } 128| | 129| 2| const size_t salt_size = DB_size - salt_offset; 130| | 131| 2| std::array padding = {0}; 132| 2| hash.update(padding); 133| 2| hash.update(message_hash); 134| 2| hash.update(&DB[salt_offset], salt_size); 135| | 136| 2| const std::vector H2 = hash.final_stdvec(); 137| | 138| 2| const bool ok = CT::is_equal(H, H2.data(), HASH_SIZE).as_bool(); 139| | 140| 2| if(ok && out_salt_size != nullptr) { ------------------ | Branch (140:7): [True: 0, False: 2] | Branch (140:13): [True: 0, False: 0] ------------------ 141| 0| *out_salt_size = salt_size; 142| 0| } 143| | 144| 2| return ok; 145| 2|} _ZN5Botan22SignaturePaddingScheme6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 35| 310|std::unique_ptr SignaturePaddingScheme::create(std::string_view algo_spec) { 36| 310| const SCAN_Name req(algo_spec); 37| | 38| 310|#if defined(BOTAN_HAS_EMSA_PKCS1) 39| | // TODO(Botan4) Remove all but "PKCS1v15" 40| 310| if(req.algo_name() == "EMSA_PKCS1" || req.algo_name() == "PKCS1v15" || req.algo_name() == "EMSA-PKCS1-v1_5" || ------------------ | Branch (40:7): [True: 0, False: 310] | Branch (40:42): [True: 296, False: 14] | Branch (40:75): [True: 0, False: 14] ------------------ 41| 296| req.algo_name() == "EMSA3") { ------------------ | Branch (41:7): [True: 0, False: 14] ------------------ 42| 296| if(req.arg_count() == 2 && req.arg(0) == "Raw") { ------------------ | Branch (42:10): [True: 0, False: 296] | Branch (42:10): [True: 0, False: 296] | Branch (42:34): [True: 0, False: 0] ------------------ 43| 0| return std::make_unique(req.arg(1)); 44| 296| } else if(req.arg_count() == 1) { ------------------ | Branch (44:17): [True: 296, False: 0] ------------------ 45| 296| if(req.arg(0) == "Raw") { ------------------ | Branch (45:13): [True: 0, False: 296] ------------------ 46| 0| return std::make_unique(); 47| 296| } else { 48| 296| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (48:21): [True: 296, False: 0] ------------------ 49| 296| return std::make_unique(std::move(hash)); 50| 296| } 51| 296| } 52| 296| } 53| 296| } 54| 14|#endif 55| | 56| 14|#if defined(BOTAN_HAS_EMSA_PSSR) 57| | // TODO(Botan4) Remove all but "PSS_Raw" 58| 14| if(req.algo_name() == "PSS_Raw" || req.algo_name() == "PSSR_Raw") { ------------------ | Branch (58:7): [True: 0, False: 14] | Branch (58:39): [True: 0, False: 14] ------------------ 59| 0| if(req.arg_count_between(1, 3) && req.arg(1, "MGF1") == "MGF1") { ------------------ | Branch (59:10): [True: 0, False: 0] | Branch (59:10): [True: 0, False: 0] | Branch (59:41): [True: 0, False: 0] ------------------ 60| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (60:18): [True: 0, False: 0] ------------------ 61| 0| if(req.arg_count() == 3) { ------------------ | Branch (61:16): [True: 0, False: 0] ------------------ 62| 0| const size_t salt_size = req.arg_as_integer(2, 0); 63| 0| return std::make_unique(std::move(hash), salt_size); 64| 0| } else { 65| 0| return std::make_unique(std::move(hash)); 66| 0| } 67| 0| } 68| 0| } 69| 0| } 70| | 71| | // TODO(Botan4) Remove all but "PSS" 72| 14| if(req.algo_name() == "PSS" || req.algo_name() == "PSSR" || req.algo_name() == "EMSA-PSS" || ------------------ | Branch (72:7): [True: 14, False: 0] | Branch (72:35): [True: 0, False: 0] | Branch (72:64): [True: 0, False: 0] ------------------ 73| 14| req.algo_name() == "PSS-MGF1" || req.algo_name() == "EMSA4") { ------------------ | Branch (73:7): [True: 0, False: 0] | Branch (73:40): [True: 0, False: 0] ------------------ 74| 14| if(req.arg_count_between(1, 3) && req.arg(1, "MGF1") == "MGF1") { ------------------ | Branch (74:10): [True: 14, False: 0] | Branch (74:10): [True: 14, False: 0] | Branch (74:41): [True: 14, False: 0] ------------------ 75| 14| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (75:18): [True: 14, False: 0] ------------------ 76| 14| if(req.arg_count() == 3) { ------------------ | Branch (76:16): [True: 14, False: 0] ------------------ 77| 14| const size_t salt_size = req.arg_as_integer(2, 0); 78| 14| return std::make_unique(std::move(hash), salt_size); 79| 14| } else { 80| 0| return std::make_unique(std::move(hash)); 81| 0| } 82| 14| } 83| 14| } 84| 14| } 85| 0|#endif 86| | 87| 0|#if defined(BOTAN_HAS_ISO_9796) 88| 0| if(req.algo_name() == "ISO_9796_DS2") { ------------------ | Branch (88:7): [True: 0, False: 0] ------------------ 89| 0| if(req.arg_count_between(1, 3)) { ------------------ | Branch (89:10): [True: 0, False: 0] ------------------ 90| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (90:18): [True: 0, False: 0] ------------------ 91| 0| const size_t salt_size = req.arg_as_integer(2, hash->output_length()); 92| 0| const bool implicit = req.arg(1, "exp") == "imp"; 93| 0| return std::make_unique(std::move(hash), implicit, salt_size); 94| 0| } 95| 0| } 96| 0| } 97| | //ISO-9796-2 DS 3 is deterministic and DS2 without a salt 98| 0| if(req.algo_name() == "ISO_9796_DS3") { ------------------ | Branch (98:7): [True: 0, False: 0] ------------------ 99| 0| if(req.arg_count_between(1, 2)) { ------------------ | Branch (99:10): [True: 0, False: 0] ------------------ 100| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (100:18): [True: 0, False: 0] ------------------ 101| 0| const bool implicit = req.arg(1, "exp") == "imp"; 102| 0| return std::make_unique(std::move(hash), implicit); 103| 0| } 104| 0| } 105| 0| } 106| 0|#endif 107| | 108| 0|#if defined(BOTAN_HAS_X931_SIGNATURE_PADDING) 109| | // TODO(Botan4) Remove all but "X9.31" 110| 0| if(req.algo_name() == "EMSA_X931" || req.algo_name() == "EMSA2" || req.algo_name() == "X9.31") { ------------------ | Branch (110:7): [True: 0, False: 0] | Branch (110:41): [True: 0, False: 0] | Branch (110:71): [True: 0, False: 0] ------------------ 111| 0| if(req.arg_count() == 1) { ------------------ | Branch (111:10): [True: 0, False: 0] ------------------ 112| 0| if(auto hash = HashFunction::create(req.arg(0))) { ------------------ | Branch (112:18): [True: 0, False: 0] ------------------ 113| 0| return std::make_unique(std::move(hash)); 114| 0| } 115| 0| } 116| 0| } 117| 0|#endif 118| | 119| 0|#if defined(BOTAN_HAS_RAW_SIGNATURE_PADDING) 120| 0| if(req.algo_name() == "Raw") { ------------------ | Branch (120:7): [True: 0, False: 0] ------------------ 121| 0| if(req.arg_count() == 0) { ------------------ | Branch (121:10): [True: 0, False: 0] ------------------ 122| 0| return std::make_unique(); 123| 0| } else { 124| 0| auto hash = HashFunction::create(req.arg(0)); 125| 0| if(hash) { ------------------ | Branch (125:13): [True: 0, False: 0] ------------------ 126| 0| return std::make_unique(hash->output_length()); 127| 0| } 128| 0| } 129| 0| } 130| 0|#endif 131| | 132| 0| return nullptr; 133| 0|} _ZN5Botan22SignaturePaddingScheme15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 135| 310|std::unique_ptr SignaturePaddingScheme::create_or_throw(std::string_view algo_spec) { 136| 310| if(auto padding = SignaturePaddingScheme::create(algo_spec)) { ------------------ | Branch (136:12): [True: 310, False: 0] ------------------ 137| 310| return padding; 138| 310| } else { 139| 0| throw Algorithm_Not_Found(algo_spec); 140| 0| } 141| 310|} _ZN5Botan7BlinderC2ERKNS_17Barrett_ReductionERNS_21RandomNumberGeneratorENSt3__18functionIFNS_6BigIntERKS8_EEESC_: 16| 38| m_reducer(reducer), 17| 38| m_rng(rng), 18| 38| m_fwd_fn(std::move(fwd)), 19| 38| m_inv_fn(std::move(inv)), 20| 38| m_modulus_bits(reducer.modulus_bits()), 21| 38| m_counter{} { 22| 38| const BigInt k = blinding_nonce(); 23| 38| m_e = m_fwd_fn(k); 24| 38| m_d = m_inv_fn(k); 25| 38|} _ZNK5Botan7Blinder14blinding_nonceEv: 27| 38|BigInt Blinder::blinding_nonce() const { 28| 38| return BigInt(m_rng, m_modulus_bits - 1); 29| 38|} _ZNK5Botan7Blinder5blindERKNS_6BigIntE: 31| 38|BigInt Blinder::blind(const BigInt& i) const { 32| 38| ++m_counter; 33| | 34| 38| if((ReinitInterval > 0) && (m_counter > ReinitInterval)) { ------------------ | Branch (34:7): [True: 38, Folded] | Branch (34:31): [True: 0, False: 38] ------------------ 35| 0| const BigInt k = blinding_nonce(); 36| 0| m_e = m_fwd_fn(k); 37| 0| m_d = m_inv_fn(k); 38| 0| m_counter = 0; 39| 38| } else { 40| 38| m_e = m_reducer.square(m_e); 41| 38| m_d = m_reducer.square(m_d); 42| 38| } 43| | 44| 38| return m_reducer.multiply(i, m_e); 45| 38|} _ZNK5Botan7Blinder7unblindERKNS_6BigIntE: 47| 38|BigInt Blinder::unblind(const BigInt& i) const { 48| 38| return m_reducer.multiply(i, m_d); 49| 38|} _ZN5Botan12DH_PublicKeyC1ERKNS_8DL_GroupERKNS_6BigIntE: 20| 38|DH_PublicKey::DH_PublicKey(const DL_Group& group, const BigInt& y) { 21| 38| m_public_key = std::make_shared(group, y); 22| 38|} _ZNK5Botan12DH_PublicKey10key_lengthEv: 28| 38|size_t DH_PublicKey::key_length() const { 29| 38| return m_public_key->p_bits(); 30| 38|} _ZNK5Botan12DH_PublicKey19raw_public_key_bitsEv: 44| 76|std::vector DH_PublicKey::raw_public_key_bits() const { 45| 76| return m_public_key->public_key_as_bytes(); 46| 76|} _ZN5Botan13DH_PrivateKeyC1ERNS_21RandomNumberGeneratorERKNS_8DL_GroupE: 60| 38|DH_PrivateKey::DH_PrivateKey(RandomNumberGenerator& rng, const DL_Group& group) { 61| 38| m_private_key = std::make_shared(group, rng); 62| 38| m_public_key = m_private_key->public_key(); 63| 38|} _ZNK5Botan13DH_PrivateKey12public_valueEv: 83| 38|std::vector DH_PrivateKey::public_value() const { 84| 38| return raw_public_key_bits(); 85| 38|} _ZNK5Botan13DH_PrivateKey23create_key_agreement_opERNS_21RandomNumberGeneratorENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_: 150| 38| std::string_view provider) const { 151| 38| if(provider == "base" || provider.empty()) { ------------------ | Branch (151:7): [True: 0, False: 38] | Branch (151:29): [True: 38, False: 0] ------------------ 152| 38| return std::make_unique(this->m_private_key, params, rng); 153| 38| } 154| 0| throw Provider_Not_Found(algo_name(), provider); 155| 38|} dh.cpp:_ZN5Botan12_GLOBAL__N_115DH_KA_OperationC2ERKNSt3__110shared_ptrIKNS_13DL_PrivateKeyEEENS2_17basic_string_viewIcNS2_11char_traitsIcEEEERNS_21RandomNumberGeneratorE: 109| 38| PK_Ops::Key_Agreement_with_KDF(kdf), 110| 38| m_key(key), 111| 38| m_key_bits(m_key->private_key().bits()), 112| 38| m_blinder( 113| 38| m_key->group()._reducer_mod_p(), 114| 38| rng, 115| 38| [](const BigInt& k) { return k; }, 116| 38| [this](const BigInt& k) { return powermod_x_p(group().inverse_mod_p(k)); }) {} dh.cpp:_ZZN5Botan12_GLOBAL__N_115DH_KA_OperationC1ERKNSt3__110shared_ptrIKNS_13DL_PrivateKeyEEENS2_17basic_string_viewIcNS2_11char_traitsIcEEEERNS_21RandomNumberGeneratorEENKUlRKNS_6BigIntEE_clESH_: 115| 38| [](const BigInt& k) { return k; }, dh.cpp:_ZZN5Botan12_GLOBAL__N_115DH_KA_OperationC1ERKNSt3__110shared_ptrIKNS_13DL_PrivateKeyEEENS2_17basic_string_viewIcNS2_11char_traitsIcEEEERNS_21RandomNumberGeneratorEENKUlRKNS_6BigIntEE0_clESH_: 116| 38| [this](const BigInt& k) { return powermod_x_p(group().inverse_mod_p(k)); }) {} dh.cpp:_ZNK5Botan12_GLOBAL__N_115DH_KA_Operation12powermod_x_pERKNS_6BigIntE: 125| 76| BigInt powermod_x_p(const BigInt& v) const { return group().power_b_p(v, m_key->private_key(), m_key_bits); } dh.cpp:_ZNK5Botan12_GLOBAL__N_115DH_KA_Operation5groupEv: 123| 190| const DL_Group& group() const { return m_key->group(); } dh.cpp:_ZN5Botan12_GLOBAL__N_115DH_KA_Operation9raw_agreeEPKhm: 132| 38|secure_vector DH_KA_Operation::raw_agree(const uint8_t w[], size_t w_len) { 133| 38| BigInt v = BigInt::from_bytes(std::span{w, w_len}); 134| | 135| 38| if(v <= 1 || v >= group().get_p() - 1) { ------------------ | Branch (135:7): [True: 0, False: 38] | Branch (135:7): [True: 0, False: 38] | Branch (135:17): [True: 0, False: 38] ------------------ 136| 0| throw Invalid_Argument("DH agreement - invalid key provided"); 137| 0| } 138| | 139| 38| v = m_blinder.blind(v); 140| 38| v = powermod_x_p(v); 141| 38| v = m_blinder.unblind(v); 142| | 143| 38| return v.serialize>(group().p_bytes()); 144| 38|} _ZN5Botan12DL_PublicKeyC2ERKNS_8DL_GroupERKNS_6BigIntE: 38| 76|DL_PublicKey::DL_PublicKey(const DL_Group& group, const BigInt& public_key) : m_group(group), m_public_key(public_key) { 39| | // The subgroup check (y^q == 1 mod p) is deferred to check_key() since it can be expensive 40| 76| BOTAN_ARG_CHECK(m_public_key > 1 && m_public_key < m_group.get_p(), "Invalid DL public key"); ------------------ | | 35| 76| do { \ | | 36| 76| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 152| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 76, False: 0] | | | Branch (37:12): [True: 76, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 76| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 76] | | ------------------ ------------------ 41| 76|} _ZN5Botan12DL_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE: 46| 3| m_group(alg_id.parameters(), format), m_public_key(decode_single_bigint(key_bits)) { 47| 3| BOTAN_ARG_CHECK(m_public_key > 1 && m_public_key < m_group.get_p(), "Invalid DL public key"); ------------------ | | 35| 3| do { \ | | 36| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 3] | | | 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| 3| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3] | | ------------------ ------------------ 48| 3|} _ZNK5Botan12DL_PublicKey19public_key_as_bytesEv: 50| 76|std::vector DL_PublicKey::public_key_as_bytes() const { 51| 76| return m_public_key.serialize(m_group.p_bytes()); 52| 76|} _ZNK5Botan12DL_PublicKey6p_bitsEv: 68| 38|size_t DL_PublicKey::p_bits() const { 69| 38| return m_group.p_bits(); 70| 38|} _ZN5Botan13DL_PrivateKeyC2ERKNS_8DL_GroupERNS_21RandomNumberGeneratorE: 78| 38| m_group(group), 79| 38| m_private_key(generate_private_dl_key(group, rng)), 80| 38| m_public_key(m_group.power_g_p(m_private_key, m_private_key.bits())) {} _ZNK5Botan13DL_PrivateKey10public_keyEv: 101| 38|std::shared_ptr DL_PrivateKey::public_key() const { 102| 38| return std::make_shared(m_group, m_public_key); 103| 38|} dl_scheme.cpp:_ZN5Botan12_GLOBAL__N_123generate_private_dl_keyERKNS_8DL_GroupERNS_21RandomNumberGeneratorE: 23| 38|BigInt generate_private_dl_key(const DL_Group& group, RandomNumberGenerator& rng) { 24| 38| if(group.has_q() && group.q_bits() >= 160 && group.q_bits() <= 384) { ------------------ | Branch (24:7): [True: 0, False: 38] | Branch (24:24): [True: 0, False: 0] | Branch (24:49): [True: 0, False: 0] ------------------ 25| 0| return BigInt::random_integer(rng, BigInt::from_s32(2), group.get_q()); 26| 38| } else { 27| 38| return BigInt(rng, group.exponent_bits()); 28| 38| } 29| 38|} _ZN5Botan8DL_Group19DER_decode_DL_groupENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatENS_15DL_Group_SourceE: 170| 3| DL_Group_Source source) { 171| 3| BER_Decoder decoder(data, BER_Decoder::Limits::DER()); 172| 3| BER_Decoder inner = decoder.start_sequence(); 173| | 174| 3| if(format == DL_Group_Format::ANSI_X9_57) { ------------------ | Branch (174:7): [True: 2, False: 1] ------------------ 175| | /* 176| | This format is p, q, g with no additional data following 177| | */ 178| 2| BigInt p; 179| 2| BigInt q; 180| 2| BigInt g; 181| 2| inner.decode(p).decode(q).decode(g).verify_end(); 182| 2| return DL_Group_Data::create(p, q, g, source); 183| 2| } else if(format == DL_Group_Format::ANSI_X9_42) { ------------------ | Branch (183:14): [True: 0, False: 1] ------------------ 184| | /* 185| | This format is p, g, q with optional cofactor and seed following 186| | */ 187| 0| BigInt p; 188| 0| BigInt g; 189| 0| BigInt q; 190| 0| inner.decode(p).decode(g).decode(q).discard_remaining(); 191| 0| return DL_Group_Data::create(p, q, g, source); 192| 1| } else if(format == DL_Group_Format::PKCS_3) { ------------------ | Branch (192:14): [True: 0, False: 1] ------------------ 193| | /* 194| | This format is p, g followed by optional privateValueLength (recommended exponent size) 195| | */ 196| 0| BigInt p; 197| 0| BigInt g; 198| 0| inner.decode(p).decode(g).discard_remaining(); 199| 0| return DL_Group_Data::create(p, g, source); 200| 1| } else { 201| 1| throw Invalid_Argument("Unknown DL_Group encoding"); 202| 1| } 203| 3|} _ZN5Botan8DL_Group18load_DL_group_infoEPKcS2_: 219| 46|std::shared_ptr DL_Group::load_DL_group_info(const char* p_str, const char* g_str) { 220| 46| const BigInt p(p_str); 221| 46| const BigInt q = (p - 1) / 2; 222| 46| const BigInt g(g_str); 223| | 224| 46| return DL_Group_Data::create(p, q, g, DL_Group_Source::Builtin); 225| 46|} _ZN5Botan8DL_Group9from_nameENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 265| 46|DL_Group DL_Group::from_name(std::string_view name) { 266| 46| auto data = DL_group_info(name); 267| | 268| 46| if(!data) { ------------------ | Branch (268:7): [True: 0, False: 46] ------------------ 269| 0| throw Invalid_Argument(fmt("DL_Group: Unknown group '{}'", name)); 270| 0| } 271| | 272| 46| return DL_Group(data); 273| 46|} _ZN5Botan8DL_GroupC2ERKNS_6BigIntES3_: 397| 214|DL_Group::DL_Group(const BigInt& p, const BigInt& g) { 398| 214| m_data = DL_Group_Data::create(p, g, DL_Group_Source::ExternalSource); 399| 214|} _ZNK5Botan8DL_Group4dataEv: 412| 5.39k|const DL_Group_Data& DL_Group::data() const { 413| 5.39k| if(m_data) { ------------------ | Branch (413:7): [True: 5.39k, False: 0] ------------------ 414| 5.39k| return *m_data; 415| 5.39k| } 416| | 417| 0| throw Invalid_State("DL_Group uninitialized"); 418| 5.39k|} _ZNK5Botan8DL_Group12verify_groupERNS_21RandomNumberGeneratorEb: 469| 211|bool DL_Group::verify_group(RandomNumberGenerator& rng, bool strong) const { 470| 211| const bool from_builtin = (source() == DL_Group_Source::Builtin); 471| | 472| 211| if(!strong && from_builtin) { ------------------ | Branch (472:7): [True: 211, False: 0] | Branch (472:18): [True: 0, False: 211] ------------------ 473| 0| return true; 474| 0| } 475| | 476| 211| const BigInt& p = get_p(); 477| 211| const BigInt& q = get_q(); 478| 211| const BigInt& g = get_g(); 479| | 480| 211| if(g < 2 || p < 3 || q < 0) { ------------------ | Branch (480:7): [True: 0, False: 211] | Branch (480:16): [True: 0, False: 211] | Branch (480:25): [True: 0, False: 211] ------------------ 481| 0| return false; 482| 0| } 483| | 484| 211| const size_t test_prob = 128; 485| 211| const bool is_randomly_generated = (source() != DL_Group_Source::ExternalSource); 486| | 487| 211| if(!is_prime(p, rng, test_prob, is_randomly_generated)) { ------------------ | Branch (487:7): [True: 173, False: 38] ------------------ 488| 173| return false; 489| 173| } 490| | 491| 38| if(q != 0) { ------------------ | Branch (491:7): [True: 0, False: 38] ------------------ 492| 0| if((p - 1) % q != 0) { ------------------ | Branch (492:10): [True: 0, False: 0] ------------------ 493| 0| return false; 494| 0| } 495| 0| if(data().power_g_p_vartime(q) != 1) { ------------------ | Branch (495:10): [True: 0, False: 0] ------------------ 496| 0| return false; 497| 0| } 498| 0| if(!is_prime(q, rng, test_prob, is_randomly_generated)) { ------------------ | Branch (498:10): [True: 0, False: 0] ------------------ 499| 0| return false; 500| 0| } 501| 38| } else { 502| 38| if(!from_builtin && !is_randomly_generated) { ------------------ | Branch (502:10): [True: 38, False: 0] | Branch (502:27): [True: 38, False: 0] ------------------ 503| | // If we got this p,g from some unknown source, try to verify 504| | // that the group order is not too absurdly small. 505| | 506| 38| const size_t upper_bound = strong ? 1000 : 100; ------------------ | Branch (506:37): [True: 0, False: 38] ------------------ 507| | 508| 3.76k| for(size_t i = 2; i != upper_bound; ++i) { ------------------ | Branch (508:28): [True: 3.72k, False: 38] ------------------ 509| 3.72k| if(data().power_g_p_vartime(BigInt::from_word(i)) == 1) { ------------------ | Branch (509:16): [True: 0, False: 3.72k] ------------------ 510| 0| return false; 511| 0| } 512| 3.72k| } 513| 38| } 514| 38| } 515| | 516| 38| return true; 517| 38|} _ZNK5Botan8DL_Group5get_pEv: 522| 447|const BigInt& DL_Group::get_p() const { 523| 447| return data().p(); 524| 447|} _ZNK5Botan8DL_Group5get_gEv: 529| 211|const BigInt& DL_Group::get_g() const { 530| 211| return data().g(); 531| 211|} _ZNK5Botan8DL_Group5get_qEv: 536| 211|const BigInt& DL_Group::get_q() const { 537| 211| return data().q(); 538| 211|} _ZNK5Botan8DL_Group5has_qEv: 544| 38|bool DL_Group::has_q() const { 545| 38| return data().q_is_set(); 546| 38|} _ZNK5Botan8DL_Group6p_bitsEv: 548| 38|size_t DL_Group::p_bits() const { 549| 38| return data().p_bits(); 550| 38|} _ZNK5Botan8DL_Group7p_bytesEv: 552| 114|size_t DL_Group::p_bytes() const { 553| 114| return data().p_bytes(); 554| 114|} _ZNK5Botan8DL_Group13exponent_bitsEv: 570| 38|size_t DL_Group::exponent_bits() const { 571| 38| return data().exponent_bits(); 572| 38|} _ZNK5Botan8DL_Group13inverse_mod_pERKNS_6BigIntE: 574| 38|BigInt DL_Group::inverse_mod_p(const BigInt& x) const { 575| | // precompute?? 576| 38| return inverse_mod_public_prime(x, get_p()); 577| 38|} _ZNK5Botan8DL_Group14_reducer_mod_pEv: 587| 38|const Barrett_Reduction& DL_Group::_reducer_mod_p() const { 588| 38| return data().reducer_mod_p(); 589| 38|} _ZNK5Botan8DL_Group9power_g_pERKNS_6BigIntEm: 621| 38|BigInt DL_Group::power_g_p(const BigInt& x, size_t max_x_bits) const { 622| 38| return data().power_g_p(x, max_x_bits); 623| 38|} _ZNK5Botan8DL_Group9power_b_pERKNS_6BigIntES3_m: 631| 76|BigInt DL_Group::power_b_p(const BigInt& b, const BigInt& x, size_t max_x_bits) const { 632| 76| return data().power_b_p(b, x, max_x_bits); 633| 76|} _ZNK5Botan8DL_Group6sourceEv: 635| 422|DL_Group_Source DL_Group::source() const { 636| 422| return data().source(); 637| 422|} _ZN5Botan8DL_GroupC2ENSt3__14spanIKhLm18446744073709551615EEENS_15DL_Group_FormatE: 680| 3|DL_Group::DL_Group(std::span der, DL_Group_Format format) { 681| 3| m_data = DER_decode_DL_group(der, format, DL_Group_Source::ExternalSource); 682| 3|} _ZN5Botan13DL_Group_Data6createERKNS_6BigIntES3_S3_NS_15DL_Group_SourceE: 52| 46| DL_Group_Source source) { 53| 46| check_dl_group_params(p, q, g); 54| 46| return std::make_shared(p, q, g, source); 55| 46| } dl_group.cpp:_ZN5Botan12_GLOBAL__N_121check_dl_group_paramsERKNS_6BigIntES3_S3_: 38| 46|void check_dl_group_params(const BigInt& p, const BigInt& q, const BigInt& g) { 39| 46| check_dl_group_params(p, g); 40| 46| if(q.signum() <= 0 || q.is_even() || q.bits() >= p.bits()) { ------------------ | Branch (40:7): [True: 0, False: 46] | Branch (40:26): [True: 0, False: 46] | Branch (40:41): [True: 0, False: 46] ------------------ 41| 0| throw Decoding_Error("Invalid DL group subgroup order"); 42| 0| } 43| 46|} dl_group.cpp:_ZN5Botan12_GLOBAL__N_121check_dl_group_paramsERKNS_6BigIntES3_: 29| 260|void check_dl_group_params(const BigInt& p, const BigInt& g) { 30| 260| if(p.signum() <= 0 || p.is_even() || p.bits() < 3 || p.bits() > 16384) { ------------------ | Branch (30:7): [True: 0, False: 260] | Branch (30:26): [True: 2, False: 258] | Branch (30:41): [True: 0, False: 258] | Branch (30:57): [True: 0, False: 258] ------------------ 31| 2| throw Decoding_Error("Invalid DL group prime"); 32| 2| } 33| 258| if(g.signum() <= 0 || g < 2 || g >= p) { ------------------ | Branch (33:7): [True: 1, False: 257] | Branch (33:26): [True: 0, False: 257] | Branch (33:35): [True: 0, False: 257] ------------------ 34| 1| throw Decoding_Error("Invalid DL group generator"); 35| 1| } 36| 258|} _ZN5Botan13DL_Group_DataC2ERKNS_6BigIntES3_S3_NS_15DL_Group_SourceE: 65| 46| m_p(p), 66| 46| m_q(q), 67| 46| m_g(g), 68| 46| m_mod_p(Barrett_Reduction::for_public_modulus(p)), 69| 46| m_mod_q(Barrett_Reduction::for_public_modulus(q)), 70| 46| m_monty_params(m_p, m_mod_p), 71| 46| m_monty(monty_precompute(m_monty_params, m_g, /*window bits=*/4)), 72| 46| m_p_bits(p.bits()), 73| 46| m_q_bits(q.bits()), 74| | // For DL crypto in a prime-order subgroup, security is bounded by 75| | // both the NFS cost in Z_p* and Pollard rho in the q-order subgroup. 76| 46| m_estimated_strength(std::min(dl_work_factor(m_p_bits), m_q_bits / 2)), 77| 46| m_exponent_bits(dl_exponent_size(m_p_bits)), 78| 46| m_source(source) {} _ZN5Botan13DL_Group_DataD2Ev: 94| 257| ~DL_Group_Data() = default; _ZN5Botan13DL_Group_Data6createERKNS_6BigIntES3_NS_15DL_Group_SourceE: 57| 214| static std::shared_ptr create(const BigInt& p, const BigInt& g, DL_Group_Source source) { 58| 214| check_dl_group_params(p, g); 59| 214| return std::make_shared(p, g, source); 60| 214| } _ZN5Botan13DL_Group_DataC2ERKNS_6BigIntES3_NS_15DL_Group_SourceE: 83| 211| m_p(p), 84| 211| m_g(g), 85| 211| m_mod_p(Barrett_Reduction::for_public_modulus(p)), 86| 211| m_monty_params(m_p, m_mod_p), 87| 211| m_monty(monty_precompute(m_monty_params, m_g, /*window bits=*/4)), 88| 211| m_p_bits(p.bits()), 89| 211| m_q_bits(0), 90| 211| m_estimated_strength(dl_work_factor(m_p_bits)), 91| 211| m_exponent_bits(dl_exponent_size(m_p_bits)), 92| 211| m_source(source) {} _ZNK5Botan13DL_Group_Data17power_g_p_vartimeERKNS_6BigIntE: 132| 3.72k| BigInt power_g_p_vartime(const BigInt& k) const { return monty_execute_vartime(*m_monty, k).value(); } _ZNK5Botan13DL_Group_Data1pEv: 101| 447| const BigInt& p() const { return m_p; } _ZNK5Botan13DL_Group_Data1gEv: 105| 211| const BigInt& g() const { return m_g; } _ZNK5Botan13DL_Group_Data1qEv: 103| 211| const BigInt& q() const { return m_q; } _ZNK5Botan13DL_Group_Data8q_is_setEv: 142| 38| bool q_is_set() const { return m_q_bits > 0; } _ZNK5Botan13DL_Group_Data6p_bitsEv: 116| 38| size_t p_bits() const { return m_p_bits; } _ZNK5Botan13DL_Group_Data7p_bytesEv: 120| 114| size_t p_bytes() const { return (m_p_bits + 7) / 8; } _ZNK5Botan13DL_Group_Data13exponent_bitsEv: 126| 38| size_t exponent_bits() const { return m_exponent_bits; } _ZNK5Botan13DL_Group_Data13reducer_mod_pEv: 107| 38| const Barrett_Reduction& reducer_mod_p() const { return m_mod_p; } _ZNK5Botan13DL_Group_Data9power_g_pERKNS_6BigIntEm: 128| 38| BigInt power_g_p(const BigInt& k, size_t max_k_bits) const { 129| 38| return monty_execute(*m_monty, k, max_k_bits).value(); 130| 38| } _ZNK5Botan13DL_Group_Data9power_b_pERKNS_6BigIntES3_m: 134| 76| BigInt power_b_p(const BigInt& b, const BigInt& k, size_t max_k_bits) const { 135| 76| return monty_exp(m_monty_params, b, k, max_k_bits).value(); 136| 76| } _ZNK5Botan13DL_Group_Data6sourceEv: 150| 422| DL_Group_Source source() const { return m_source; } _ZN5Botan8DL_Group13DL_group_infoENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 13| 46|std::shared_ptr DL_Group::DL_group_info(std::string_view name) { 14| | /* TLS FFDHE groups */ 15| | 16| 46| if(name == "ffdhe/ietf/2048") { ------------------ | Branch (16:7): [True: 22, False: 24] ------------------ 17| 22| return load_DL_group_info( 18| 22| "0xFFFFFFFFFFFFFFFFADF85458A2BB4A9AAFDC5620273D3CF1D8B9C583CE2D3695A9E13641146433FBCC939DCE249B3EF97D2FE363630C75D8F681B202AEC4617AD3DF1ED5D5FD65612433F51F5F066ED0856365553DED1AF3B557135E7F57C935984F0C70E0E68B77E2A689DAF3EFE8721DF158A136ADE73530ACCA4F483A797ABC0AB182B324FB61D108A94BB2C8E3FBB96ADAB760D7F4681D4F42A3DE394DF4AE56EDE76372BB190B07A7C8EE0A6D709E02FCE1CDF7E2ECC03404CD28342F619172FE9CE98583FF8E4F1232EEF28183C3FE3B1B4C6FAD733BB5FCBC2EC22005C58EF1837D1683B2C6F34A26C1B2EFFA886B423861285C97FFFFFFFFFFFFFFFF", 19| 22| "0x2"); 20| 22| } 21| | 22| 24| if(name == "ffdhe/ietf/3072") { ------------------ | Branch (22:7): [True: 1, False: 23] ------------------ 23| 1| return load_DL_group_info( 24| 1| "0xFFFFFFFFFFFFFFFFADF85458A2BB4A9AAFDC5620273D3CF1D8B9C583CE2D3695A9E13641146433FBCC939DCE249B3EF97D2FE363630C75D8F681B202AEC4617AD3DF1ED5D5FD65612433F51F5F066ED0856365553DED1AF3B557135E7F57C935984F0C70E0E68B77E2A689DAF3EFE8721DF158A136ADE73530ACCA4F483A797ABC0AB182B324FB61D108A94BB2C8E3FBB96ADAB760D7F4681D4F42A3DE394DF4AE56EDE76372BB190B07A7C8EE0A6D709E02FCE1CDF7E2ECC03404CD28342F619172FE9CE98583FF8E4F1232EEF28183C3FE3B1B4C6FAD733BB5FCBC2EC22005C58EF1837D1683B2C6F34A26C1B2EFFA886B4238611FCFDCDE355B3B6519035BBC34F4DEF99C023861B46FC9D6E6C9077AD91D2691F7F7EE598CB0FAC186D91CAEFE130985139270B4130C93BC437944F4FD4452E2D74DD364F2E21E71F54BFF5CAE82AB9C9DF69EE86D2BC522363A0DABC521979B0DEADA1DBF9A42D5C4484E0ABCD06BFA53DDEF3C1B20EE3FD59D7C25E41D2B66C62E37FFFFFFFFFFFFFFFF", 25| 1| "0x2"); 26| 1| } 27| | 28| 23| if(name == "ffdhe/ietf/4096") { ------------------ | Branch (28:7): [True: 0, False: 23] ------------------ 29| 0| return load_DL_group_info( 30| 0| "0xFFFFFFFFFFFFFFFFADF85458A2BB4A9AAFDC5620273D3CF1D8B9C583CE2D3695A9E13641146433FBCC939DCE249B3EF97D2FE363630C75D8F681B202AEC4617AD3DF1ED5D5FD65612433F51F5F066ED0856365553DED1AF3B557135E7F57C935984F0C70E0E68B77E2A689DAF3EFE8721DF158A136ADE73530ACCA4F483A797ABC0AB182B324FB61D108A94BB2C8E3FBB96ADAB760D7F4681D4F42A3DE394DF4AE56EDE76372BB190B07A7C8EE0A6D709E02FCE1CDF7E2ECC03404CD28342F619172FE9CE98583FF8E4F1232EEF28183C3FE3B1B4C6FAD733BB5FCBC2EC22005C58EF1837D1683B2C6F34A26C1B2EFFA886B4238611FCFDCDE355B3B6519035BBC34F4DEF99C023861B46FC9D6E6C9077AD91D2691F7F7EE598CB0FAC186D91CAEFE130985139270B4130C93BC437944F4FD4452E2D74DD364F2E21E71F54BFF5CAE82AB9C9DF69EE86D2BC522363A0DABC521979B0DEADA1DBF9A42D5C4484E0ABCD06BFA53DDEF3C1B20EE3FD59D7C25E41D2B669E1EF16E6F52C3164DF4FB7930E9E4E58857B6AC7D5F42D69F6D187763CF1D5503400487F55BA57E31CC7A7135C886EFB4318AED6A1E012D9E6832A907600A918130C46DC778F971AD0038092999A333CB8B7A1A1DB93D7140003C2A4ECEA9F98D0ACC0A8291CDCEC97DCF8EC9B55A7F88A46B4DB5A851F44182E1C68A007E5E655F6AFFFFFFFFFFFFFFFF", 31| 0| "0x2"); 32| 0| } 33| | 34| 23| if(name == "ffdhe/ietf/6144") { ------------------ | Branch (34:7): [True: 0, False: 23] ------------------ 35| 0| return load_DL_group_info( 36| 0| "0xFFFFFFFFFFFFFFFFADF85458A2BB4A9AAFDC5620273D3CF1D8B9C583CE2D3695A9E13641146433FBCC939DCE249B3EF97D2FE363630C75D8F681B202AEC4617AD3DF1ED5D5FD65612433F51F5F066ED0856365553DED1AF3B557135E7F57C935984F0C70E0E68B77E2A689DAF3EFE8721DF158A136ADE73530ACCA4F483A797ABC0AB182B324FB61D108A94BB2C8E3FBB96ADAB760D7F4681D4F42A3DE394DF4AE56EDE76372BB190B07A7C8EE0A6D709E02FCE1CDF7E2ECC03404CD28342F619172FE9CE98583FF8E4F1232EEF28183C3FE3B1B4C6FAD733BB5FCBC2EC22005C58EF1837D1683B2C6F34A26C1B2EFFA886B4238611FCFDCDE355B3B6519035BBC34F4DEF99C023861B46FC9D6E6C9077AD91D2691F7F7EE598CB0FAC186D91CAEFE130985139270B4130C93BC437944F4FD4452E2D74DD364F2E21E71F54BFF5CAE82AB9C9DF69EE86D2BC522363A0DABC521979B0DEADA1DBF9A42D5C4484E0ABCD06BFA53DDEF3C1B20EE3FD59D7C25E41D2B669E1EF16E6F52C3164DF4FB7930E9E4E58857B6AC7D5F42D69F6D187763CF1D5503400487F55BA57E31CC7A7135C886EFB4318AED6A1E012D9E6832A907600A918130C46DC778F971AD0038092999A333CB8B7A1A1DB93D7140003C2A4ECEA9F98D0ACC0A8291CDCEC97DCF8EC9B55A7F88A46B4DB5A851F44182E1C68A007E5E0DD9020BFD64B645036C7A4E677D2C38532A3A23BA4442CAF53EA63BB454329B7624C8917BDD64B1C0FD4CB38E8C334C701C3ACDAD0657FCCFEC719B1F5C3E4E46041F388147FB4CFDB477A52471F7A9A96910B855322EDB6340D8A00EF092350511E30ABEC1FFF9E3A26E7FB29F8C183023C3587E38DA0077D9B4763E4E4B94B2BBC194C6651E77CAF992EEAAC0232A281BF6B3A739C1226116820AE8DB5847A67CBEF9C9091B462D538CD72B03746AE77F5E62292C311562A846505DC82DB854338AE49F5235C95B91178CCF2DD5CACEF403EC9D1810C6272B045B3B71F9DC6B80D63FDD4A8E9ADB1E6962A69526D43161C1A41D570D7938DAD4A40E329CD0E40E65FFFFFFFFFFFFFFFF", 37| 0| "0x2"); 38| 0| } 39| | 40| 23| if(name == "ffdhe/ietf/8192") { ------------------ | Branch (40:7): [True: 0, False: 23] ------------------ 41| 0| return load_DL_group_info( 42| 0| "0xFFFFFFFFFFFFFFFFADF85458A2BB4A9AAFDC5620273D3CF1D8B9C583CE2D3695A9E13641146433FBCC939DCE249B3EF97D2FE363630C75D8F681B202AEC4617AD3DF1ED5D5FD65612433F51F5F066ED0856365553DED1AF3B557135E7F57C935984F0C70E0E68B77E2A689DAF3EFE8721DF158A136ADE73530ACCA4F483A797ABC0AB182B324FB61D108A94BB2C8E3FBB96ADAB760D7F4681D4F42A3DE394DF4AE56EDE76372BB190B07A7C8EE0A6D709E02FCE1CDF7E2ECC03404CD28342F619172FE9CE98583FF8E4F1232EEF28183C3FE3B1B4C6FAD733BB5FCBC2EC22005C58EF1837D1683B2C6F34A26C1B2EFFA886B4238611FCFDCDE355B3B6519035BBC34F4DEF99C023861B46FC9D6E6C9077AD91D2691F7F7EE598CB0FAC186D91CAEFE130985139270B4130C93BC437944F4FD4452E2D74DD364F2E21E71F54BFF5CAE82AB9C9DF69EE86D2BC522363A0DABC521979B0DEADA1DBF9A42D5C4484E0ABCD06BFA53DDEF3C1B20EE3FD59D7C25E41D2B669E1EF16E6F52C3164DF4FB7930E9E4E58857B6AC7D5F42D69F6D187763CF1D5503400487F55BA57E31CC7A7135C886EFB4318AED6A1E012D9E6832A907600A918130C46DC778F971AD0038092999A333CB8B7A1A1DB93D7140003C2A4ECEA9F98D0ACC0A8291CDCEC97DCF8EC9B55A7F88A46B4DB5A851F44182E1C68A007E5E0DD9020BFD64B645036C7A4E677D2C38532A3A23BA4442CAF53EA63BB454329B7624C8917BDD64B1C0FD4CB38E8C334C701C3ACDAD0657FCCFEC719B1F5C3E4E46041F388147FB4CFDB477A52471F7A9A96910B855322EDB6340D8A00EF092350511E30ABEC1FFF9E3A26E7FB29F8C183023C3587E38DA0077D9B4763E4E4B94B2BBC194C6651E77CAF992EEAAC0232A281BF6B3A739C1226116820AE8DB5847A67CBEF9C9091B462D538CD72B03746AE77F5E62292C311562A846505DC82DB854338AE49F5235C95B91178CCF2DD5CACEF403EC9D1810C6272B045B3B71F9DC6B80D63FDD4A8E9ADB1E6962A69526D43161C1A41D570D7938DAD4A40E329CCFF46AAA36AD004CF600C8381E425A31D951AE64FDB23FCEC9509D43687FEB69EDD1CC5E0B8CC3BDF64B10EF86B63142A3AB8829555B2F747C932665CB2C0F1CC01BD70229388839D2AF05E454504AC78B7582822846C0BA35C35F5C59160CC046FD8251541FC68C9C86B022BB7099876A460E7451A8A93109703FEE1C217E6C3826E52C51AA691E0E423CFC99E9E31650C1217B624816CDAD9A95F9D5B8019488D9C0A0A1FE3075A577E23183F81D4A3F2FA4571EFC8CE0BA8A4FE8B6855DFE72B0A66EDED2FBABFBE58A30FAFABE1C5D71A87E2F741EF8C1FE86FEA6BBFDE530677F0D97D11D49F7A8443D0822E506A9F4614E011E2A94838FF88CD68C8BB7C5C6424CFFFFFFFFFFFFFFFF", "0x2"); 43| 0| } 44| | 45| | /* IETF IPsec groups */ 46| | 47| 23| if(name == "modp/ietf/1024") { ------------------ | Branch (47:7): [True: 0, False: 23] ------------------ 48| 0| return load_DL_group_info( 49| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE65381FFFFFFFFFFFFFFFF", 50| 0| "0x2"); 51| 0| } 52| | 53| 23| if(name == "modp/ietf/1536") { ------------------ | Branch (53:7): [True: 0, False: 23] ------------------ 54| 0| return load_DL_group_info( 55| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA237327FFFFFFFFFFFFFFFF", 56| 0| "0x2"); 57| 0| } 58| | 59| 23| if(name == "modp/ietf/2048") { ------------------ | Branch (59:7): [True: 22, False: 1] ------------------ 60| 22| return load_DL_group_info( 61| 22| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AACAA68FFFFFFFFFFFFFFFF", 62| 22| "0x2"); 63| 22| } 64| | 65| 1| if(name == "modp/ietf/3072") { ------------------ | Branch (65:7): [True: 1, False: 0] ------------------ 66| 1| return load_DL_group_info( 67| 1| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A93AD2CAFFFFFFFFFFFFFFFF", 68| 1| "0x2"); 69| 1| } 70| | 71| 0| if(name == "modp/ietf/4096") { ------------------ | Branch (71:7): [True: 0, False: 0] ------------------ 72| 0| return load_DL_group_info( 73| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934063199FFFFFFFFFFFFFFFF", 74| 0| "0x2"); 75| 0| } 76| | 77| 0| if(name == "modp/ietf/6144") { ------------------ | Branch (77:7): [True: 0, False: 0] ------------------ 78| 0| return load_DL_group_info( 79| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C93402849236C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B332051512BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97FBEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AACC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58BB7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E6DCC4024FFFFFFFFFFFFFFFF", 80| 0| "0x2"); 81| 0| } 82| | 83| 0| if(name == "modp/ietf/8192") { ------------------ | Branch (83:7): [True: 0, False: 0] ------------------ 84| 0| return load_DL_group_info( 85| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C93402849236C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B332051512BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97FBEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AACC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58BB7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E6DBE115974A3926F12FEE5E438777CB6A932DF8CD8BEC4D073B931BA3BC832B68D9DD300741FA7BF8AFC47ED2576F6936BA424663AAB639C5AE4F5683423B4742BF1C978238F16CBE39D652DE3FDB8BEFC848AD922222E04A4037C0713EB57A81A23F0C73473FC646CEA306B4BCBC8862F8385DDFA9D4B7FA2C087E879683303ED5BDD3A062B3CF5B3A278A66D2A13F83F44F82DDF310EE074AB6A364597E899A0255DC164F31CC50846851DF9AB48195DED7EA1B1D510BD7EE74D73FAF36BC31ECFA268359046F4EB879F924009438B481C6CD7889A002ED5EE382BC9190DA6FC026E479558E4475677E9AA9E3050E2765694DFC81F56E880B96E7160C980DD98EDD3DFFFFFFFFFFFFFFFFF", "0x2"); 86| 0| } 87| | 88| | /* SRP groups 89| | 90| | SRP groups have a p st (p-1)/2 is prime, but g is not a generator 91| | of subgroup of size q, so set q == 0 to bypass generator check 92| | 93| | Missing q doesn't matter for SRP, and nothing but SRP should be 94| | using these parameters. 95| | */ 96| | 97| 0| if(name == "modp/srp/1024") { ------------------ | Branch (97:7): [True: 0, False: 0] ------------------ 98| 0| return load_DL_group_info( 99| 0| "0xEEAF0AB9ADB38DD69C33F80AFA8FC5E86072618775FF3C0B9EA2314C9C256576D674DF7496EA81D3383B4813D692C6E0E0D5D8E250B98BE48E495C1D6089DAD15DC7D7B46154D6B6CE8EF4AD69B15D4982559B297BCF1885C529F566660E57EC68EDBC3C05726CC02FD4CBF4976EAA9AFD5138FE8376435B9FC61D2FC0EB06E3", 100| 0| "0", 101| 0| "0x2"); 102| 0| } 103| | 104| 0| if(name == "modp/srp/1536") { ------------------ | Branch (104:7): [True: 0, False: 0] ------------------ 105| 0| return load_DL_group_info( 106| 0| "0x9DEF3CAFB939277AB1F12A8617A47BBBDBA51DF499AC4C80BEEEA9614B19CC4D5F4F5F556E27CBDE51C6A94BE4607A291558903BA0D0F84380B655BB9A22E8DCDF028A7CEC67F0D08134B1C8B97989149B609E0BE3BAB63D47548381DBC5B1FC764E3F4B53DD9DA1158BFD3E2B9C8CF56EDF019539349627DB2FD53D24B7C48665772E437D6C7F8CE442734AF7CCB7AE837C264AE3A9BEB87F8A2FE9B8B5292E5A021FFF5E91479E8CE7A28C2442C6F315180F93499A234DCF76E3FED135F9BB", 107| 0| "0", 108| 0| "0x2"); 109| 0| } 110| | 111| 0| if(name == "modp/srp/2048") { ------------------ | Branch (111:7): [True: 0, False: 0] ------------------ 112| 0| return load_DL_group_info( 113| 0| "0xAC6BDB41324A9A9BF166DE5E1389582FAF72B6651987EE07FC3192943DB56050A37329CBB4A099ED8193E0757767A13DD52312AB4B03310DCD7F48A9DA04FD50E8083969EDB767B0CF6095179A163AB3661A05FBD5FAAAE82918A9962F0B93B855F97993EC975EEAA80D740ADBF4FF747359D041D5C33EA71D281E446B14773BCA97B43A23FB801676BD207A436C6481F1D2B9078717461A5B9D32E688F87748544523B524B0D57D5EA77A2775D2ECFA032CFBDBF52FB3786160279004E57AE6AF874E7303CE53299CCC041C7BC308D82A5698F3A8D0C38271AE35F8E9DBFBB694B5C803D89F7AE435DE236D525F54759B65E372FCD68EF20FA7111F9E4AFF73", 114| 0| "0", 115| 0| "0x2"); 116| 0| } 117| | 118| 0| if(name == "modp/srp/3072") { ------------------ | Branch (118:7): [True: 0, False: 0] ------------------ 119| 0| return load_DL_group_info( 120| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A93AD2CAFFFFFFFFFFFFFFFF", 121| 0| "0", 122| 0| "0x5"); 123| 0| } 124| | 125| 0| if(name == "modp/srp/4096") { ------------------ | Branch (125:7): [True: 0, False: 0] ------------------ 126| 0| return load_DL_group_info( 127| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934063199FFFFFFFFFFFFFFFF", 128| 0| "0", 129| 0| "0x5"); 130| 0| } 131| | 132| 0| if(name == "modp/srp/6144") { ------------------ | Branch (132:7): [True: 0, False: 0] ------------------ 133| 0| return load_DL_group_info( 134| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C93402849236C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B332051512BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97FBEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AACC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58BB7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E6DCC4024FFFFFFFFFFFFFFFF", 135| 0| "0", 136| 0| "0x5"); 137| 0| } 138| | 139| 0| if(name == "modp/srp/8192") { ------------------ | Branch (139:7): [True: 0, False: 0] ------------------ 140| 0| return load_DL_group_info( 141| 0| "0xFFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7DB3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D2261AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200CBBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFCE0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B2699C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C93402849236C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B332051512BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97FBEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AACC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58BB7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E6DBE115974A3926F12FEE5E438777CB6A932DF8CD8BEC4D073B931BA3BC832B68D9DD300741FA7BF8AFC47ED2576F6936BA424663AAB639C5AE4F5683423B4742BF1C978238F16CBE39D652DE3FDB8BEFC848AD922222E04A4037C0713EB57A81A23F0C73473FC646CEA306B4BCBC8862F8385DDFA9D4B7FA2C087E879683303ED5BDD3A062B3CF5B3A278A66D2A13F83F44F82DDF310EE074AB6A364597E899A0255DC164F31CC50846851DF9AB48195DED7EA1B1D510BD7EE74D73FAF36BC31ECFA268359046F4EB879F924009438B481C6CD7889A002ED5EE382BC9190DA6FC026E479558E4475677E9AA9E3050E2765694DFC81F56E880B96E7160C980DD98EDD3DFFFFFFFFFFFFFFFFF", "0", "0x13"); 142| 0| } 143| | 144| | /* DSA groups */ 145| | 146| 0| if(name == "dsa/jce/1024") { ------------------ | Branch (146:7): [True: 0, False: 0] ------------------ 147| 0| return load_DL_group_info( 148| 0| "0xFD7F53811D75122952DF4A9C2EECE4E7F611B7523CEF4400C31E3F80B6512669455D402251FB593D8D58FABFC5F5BA30F6CB9B556CD7813B801D346FF26660B76B9950A5A49F9FE8047B1022C24FBBA9D7FEB7C61BF83B57E7C6A8A6150F04FB83F6D3C51EC3023554135A169132F675F3AE2B61D72AEFF22203199DD14801C7", 149| 0| "0x9760508F15230BCCB292B982A2EB840BF0581CF5", 150| 0| "0x469603512E30278CD3947595DB22EEC9826A6322ADC97344F41D740C325724C8F9EFBAA7D4D803FF8C609DCD100EBC5BDFCFAD7C6A425FAEA786EA2050EBE98351EA1FDA1FDF24D6947AA6B9AA23766953802F4D7D4A8ECBA06D19768A2491FFB16D0EF9C43A99B5F71672FF6F0A24B444D0736D04D38A1A1322DAF6CDD88C9D"); 151| 0| } 152| | 153| 0| if(name == "dsa/botan/2048") { ------------------ | Branch (153:7): [True: 0, False: 0] ------------------ 154| 0| return load_DL_group_info( 155| 0| "0x91C48A4FDFBCF7C02AE95E7DA126122B5DD2864F559B87E8E74A286D52F59BD1DE68DFD645D0E00C60C080031891980374EEB594A532BFD67B9A09EAC4B8663A07910E68F39465FB7040D25DF13932EBAC4347A530ECBA61C854F9B880D3C0C3660080587C45566DADE26BD5A394BE093B4C0F24B5AFFEF8EC6C5B3E57FB89025A9BC16769932131E16D3C94EFCAB18D0DF061203CC53E6103BC72D5594BFD40CA65380F44A9A851DCB075495FC033A8A58071A1BD78FE052F66555648EB4B719D2AFE8B4880F8DAD6F15818BA178F89274C870BE9B96EB08C46C40040CC2EFE1DFB1B1868DD319DE3C34A32A63AB6EB1224209A419680CC7902D1728D4DF9E1", 156| 0| "0x8CD7D450F86F0AD94EEE4CE469A8756D1EBD1058241943EAFFB0B354585E924D", 157| 0| "0xD9F5E0761B4DBD1833D6AB1A961A0996C5F22303F72D84C140F67C431D94AB5715BEA81A0C98D39CE4BCF78D6B9EBC895D34FE89D94091D5848615EF15F5E86F11D96F6C969E203DDFA58356420A49CB444B595B901A933CFE0767B594F18A07B7F91DECDBA446B88990F78F2FF91F2FE7CD43FD2E46D18EADA1F7BB6602C617F6EF3A4B284F2FD9BA10A36042DE8FA87A2CA36597FEC81157A1485E44041DF02830111CB880BBE6ED494814886F965CDC3135F5CCF1383728BF65B806F9692C0B10D6C4C09C75A6CA3B4013CB16AB2C105F6BE23AEA9000EAB2178985F972C98057E1C86E44E7218688EA4AE0F3636DCCA745C9DCD4E6AFFB67CCBC13D6131"); 158| 0| } 159| | 160| 0| if(name == "dsa/botan/3072") { ------------------ | Branch (160:7): [True: 0, False: 0] ------------------ 161| 0| return load_DL_group_info("0xE4B50880759663585E142460CA2D9DFF132F8AE4C840DDA3A2666889124FE5638B84E8A29B7AF3FA1209BE6BFC4B5072ED3B2B7387BAF3F857F478A80228EF3600B76B3DCFB61D20D34465B2506D2CAF87DF6E7DC0CE91BD2D167A46F6ADCC31C531E4F9C7ABBDB92ADDF35B0A806C66292A5F5E17E964DD099903733AC428AB35D80EA6F685BFBA8BE4068E5418AE5ECAD9E8FF073DE2B63E4E7EAD35C8A9B70B5BD47CFB88D373B66F37931939B0AB71BD5595809086DA0155337D185A0E4FB36A519B1B6202B8591E6002449CF1CD3A66384F6D2073B1CD73BECA93BAF1E1A6117D0238F222AE1ED7FED185A890E7F67FAB8FEB9753CC134A5183DFE87AE2595F7B5C2D9FBB42249FDD59513E1D3396B3EB2FD86684F285A8448FE757A029881C40760B94EF919BDF9740C38389599EC51A6E9BB519A8E068491E9CE0A2FCFE3CB60D66CF0DFAD20A8EC684048684A61444575BD1724D7352B44A760077B3BD6BD385CE5B0A7250CC0BF768DA82923806EB9CFBB138843731B618208C759B", "0xB3EBD364EC69EF8CF3BAF643B75734B16339B2E49E5CDE1B59C1E9FB40EE0C5B", "0x2BED21EEF83964A230AE89BBA71D9F7C39C52FC8229B4E3BC7E5944D329DA10F010EAC9E7BAF6C009FC4EB2960723E2B56DF4663E4C3AC800E9258DE2F7649D206782893F865EFCA498D2EEF30074EA5E8A7AB262712A4D94A2F3B0B9A92EE400FB38A3CC59A5DC7E436D5C004B22E35028381B51C93407EB32D4AE0FD42CB45E12D0ECEE8A26238EDE2082A7B1522113C66CEF8D745C6CF3CB945F84D2F4DE16D44A71DE198270E13F03553C88B8D323AD0B948A1BF2103A949979B6ED16FB5F3C953D95B7C8E88CA67DCF5A636FB9CA39D924215F7A884ED6C7EE3C96D8D9715427974B7C4351282E13D3773F7D28B452F10892A13C7587328DEA4827B6B369B2A8DC172ADC583F51F2A6598C5483E5BC467B02F91D059C402D18E2C2680F776AA06F49280A2C72C17CC42D5B6E740C5C4B1AB3C51C2ED092BE2A2D8B053AE5773D1425ED2B08F06E2DD50592DF1A478C15591CDFD11564FF88FF38B721D42392FDA473212DCFD8D2D88A976A00AFFE6FFFB430A359E64CA2B351CA2412394"); 162| 0| } 163| | 164| 0| return std::shared_ptr(); 165| 0|} _ZN5Botan13DSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 70| 3|DSA_PublicKey::DSA_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 71| 3| m_public_key = std::make_shared(alg_id, key_bits, DL_Group_Format::ANSI_X9_57); 72| | 73| 3| check_dsa_group(m_public_key->group()); 74| 3|} _ZN5Botan14EC_AffinePointC2ERKNS_8EC_GroupENSt3__14spanIKhLm18446744073709551615EEE: 36| 37|EC_AffinePoint::EC_AffinePoint(const EC_Group& group, std::span bytes) { 37| 37| m_point = group._data()->point_deserialize(bytes); 38| 37| if(!m_point) { ------------------ | Branch (38:7): [True: 37, False: 0] ------------------ 39| 37| throw Decoding_Error("Failed to deserialize elliptic curve point"); 40| 37| } 41| 37|} _ZN5Botan8EC_Group13ec_group_dataEv: 231| 43|EC_Group_Data_Map& EC_Group::ec_group_data() { 232| | /* 233| | * This exists purely to ensure the allocator is constructed before g_ec_data, 234| | * which ensures that its destructor runs after ~g_ec_data is complete. 235| | */ 236| | 237| 43| static const Allocator_Initializer g_init_allocator; 238| 43| static EC_Group_Data_Map g_ec_data; 239| 43| return g_ec_data; 240| 43|} _ZN5Botan8EC_Group18load_EC_group_infoEPKcS2_S2_S2_S2_S2_RKNS_3OIDE: 254| 6| const OID& oid) { 255| 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] | | ------------------ ------------------ 256| | 257| 6| const BigInt p(p_str); 258| 6| const BigInt a(a_str); 259| 6| const BigInt b(b_str); 260| 6| const BigInt g_x(g_x_str); 261| 6| const BigInt g_y(g_y_str); 262| 6| const BigInt order(order_str); 263| 6| const BigInt cofactor(1); // implicit 264| | 265| 6| return EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, oid, EC_Group_Source::Builtin); 266| 6|} _ZN5Botan8EC_Group19DER_decode_EC_groupENSt3__14spanIKhLm18446744073709551615EEENS_15EC_Group_SourceE: 270| 60| EC_Group_Source source) { 271| 60| BER_Decoder dec(der, BER_Decoder::Limits::DER()); 272| | 273| 60| auto next_obj_type = dec.peek_next_object().type_tag(); 274| | 275| 60| if(next_obj_type == ASN1_Type::ObjectId) { ------------------ | Branch (275:7): [True: 49, False: 11] ------------------ 276| 49| OID oid; 277| 49| dec.decode(oid); 278| | 279| 49| auto data = ec_group_data().lookup(oid); 280| 49| if(!data) { ------------------ | Branch (280:10): [True: 6, False: 43] ------------------ 281| 6| throw Decoding_Error(fmt("Unknown namedCurve OID '{}'", oid.to_string())); 282| 6| } 283| | 284| 43| return std::make_pair(data, false); 285| 49| } else if(next_obj_type == ASN1_Type::Sequence) { ------------------ | Branch (285:14): [True: 4, False: 7] ------------------ 286| 4| BigInt p; 287| 4| BigInt a; 288| 4| BigInt b; 289| 4| BigInt order; 290| 4| BigInt cofactor; 291| 4| std::vector base_pt; 292| 4| std::vector seed; 293| | 294| 4| dec.start_sequence() 295| 4| .decode_and_check(1, "Unknown ECC param version code") 296| 4| .start_sequence() 297| 4| .decode_and_check(OID({1, 2, 840, 10045, 1, 1}), "Only prime ECC fields supported") 298| 4| .decode(p) 299| 4| .end_cons() 300| 4| .start_sequence() 301| 4| .decode_octet_string_bigint(a) 302| 4| .decode_octet_string_bigint(b) 303| 4| .decode_optional_string(seed, ASN1_Type::BitString, ASN1_Type::BitString, ASN1_Class::Universal) 304| 4| .end_cons() 305| 4| .decode(base_pt, ASN1_Type::OctetString) 306| 4| .decode(order) 307| 4| .decode(cofactor) 308| 4| .end_cons() 309| 4| .verify_end(); 310| | 311| | // TODO(Botan4) Require cofactor == 1 312| 4| if(cofactor <= 0 || cofactor >= 16) { ------------------ | Branch (312:10): [True: 4, False: 0] | Branch (312:27): [True: 0, False: 0] ------------------ 313| 0| throw Decoding_Error("Invalid ECC cofactor parameter"); 314| 0| } 315| | 316| 4| if(p.bits() < 112 || p.bits() > 521 || p.signum() < 0) { ------------------ | Branch (316:10): [True: 4, False: 0] | Branch (316:28): [True: 0, False: 0] | Branch (316:46): [True: 0, False: 0] ------------------ 317| 0| throw Decoding_Error("ECC p parameter is invalid size"); 318| 0| } 319| | 320| | // A can be zero 321| 4| if(a.signum() < 0 || a >= p) { ------------------ | Branch (321:10): [True: 4, False: 0] | Branch (321:28): [True: 0, False: 0] ------------------ 322| 0| throw Decoding_Error("Invalid ECC a parameter"); 323| 0| } 324| | 325| | // B must be > 0 326| 4| if(b.signum() <= 0 || b >= p) { ------------------ | Branch (326:10): [True: 4, False: 0] | Branch (326:29): [True: 0, False: 0] ------------------ 327| 0| throw Decoding_Error("Invalid ECC b parameter"); 328| 0| } 329| | 330| 4| if(order.signum() <= 0 || order >= 2 * p) { ------------------ | Branch (330:10): [True: 4, False: 0] | Branch (330:10): [True: 0, False: 4] | Branch (330:33): [True: 0, False: 0] ------------------ 331| 0| throw Decoding_Error("Invalid ECC group order"); 332| 0| } 333| | 334| 4| if(auto data = ec_group_data().lookup_from_params(p, a, b, base_pt, order, cofactor)) { ------------------ | Branch (334:15): [True: 0, False: 4] ------------------ 335| 0| return std::make_pair(data, true); 336| 0| } 337| | 338| | /* 339| | TODO(Botan4) the remaining code is used only to handle the case of decoding an EC_Group 340| | which is neither a builtin group nor a group that was registered by the application. 341| | It can all be removed and replaced with a throw 342| | */ 343| | 344| 4| auto mod_p = Barrett_Reduction::for_public_modulus(p); 345| 4| if(!is_bailie_psw_probable_prime(p, mod_p)) { ------------------ | Branch (345:10): [True: 0, False: 4] ------------------ 346| 0| throw Decoding_Error("ECC p parameter is not a prime"); 347| 0| } 348| | 349| 4| auto mod_order = Barrett_Reduction::for_public_modulus(order); 350| 4| if(!is_bailie_psw_probable_prime(order, mod_order)) { ------------------ | Branch (350:10): [True: 0, False: 4] ------------------ 351| 0| throw Decoding_Error("Invalid ECC order parameter"); 352| 0| } 353| | 354| 4| const size_t p_bytes = p.bytes(); 355| 4| if(base_pt.size() != 1 + p_bytes && base_pt.size() != 1 + 2 * p_bytes) { ------------------ | Branch (355:10): [True: 0, False: 4] | Branch (355:43): [True: 0, False: 0] ------------------ 356| 0| throw Decoding_Error("Invalid ECC base point encoding"); 357| 0| } 358| | 359| 4| auto [g_x, g_y] = [&]() { 360| 4| const uint8_t hdr = base_pt[0]; 361| | 362| 4| if(hdr == 0x04 && base_pt.size() == 1 + 2 * p_bytes) { 363| 4| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 364| 4| const BigInt y = BigInt::from_bytes(std::span{base_pt}.subspan(1 + p_bytes, p_bytes)); 365| | 366| 4| if(x < p && y < p) { 367| 4| return std::make_pair(x, y); 368| 4| } 369| 4| } else if((hdr == 0x02 || hdr == 0x03) && base_pt.size() == 1 + p_bytes) { 370| | // TODO(Botan4) remove this branch; we won't support compressed points 371| 4| const BigInt x = BigInt::from_bytes(std::span{base_pt}.subspan(1, p_bytes)); 372| 4| BigInt y = sqrt_modulo_prime(((x * x + a) * x + b) % p, p); 373| | 374| 4| if(x < p && y >= 0) { 375| 4| const bool y_mod_2 = (hdr & 0x01) == 1; 376| 4| if(y.get_bit(0) != y_mod_2) { 377| 4| y = p - y; 378| 4| } 379| | 380| 4| return std::make_pair(x, y); 381| 4| } 382| 4| } 383| | 384| 4| throw Decoding_Error("Invalid ECC base point encoding"); 385| 4| }(); 386| | 387| | // TODO(Botan4) we can remove this check since we'll only accept pre-registered groups 388| 4| auto y2 = mod_p.square(g_y); 389| 4| auto x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 390| 4| if(y2 != x3_ax_b) { ------------------ | Branch (390:10): [True: 0, False: 4] ------------------ 391| 0| throw Decoding_Error("Invalid ECC base point"); 392| 0| } 393| | 394| | /* 395| | * Create the group data without registering it in the global map. 396| | * 397| | * Applications that need persistent custom groups should register them 398| | * via the relevant EC_Group constructor 399| | */ 400| 4| auto data = EC_Group_Data::create(p, a, b, g_x, g_y, order, cofactor, OID(), source); 401| 4| return std::make_pair(data, true); 402| 7| } else if(next_obj_type == ASN1_Type::Null) { ------------------ | Branch (402:14): [True: 0, False: 7] ------------------ 403| 0| throw Decoding_Error("Decoding ImplicitCA ECC parameters is not supported"); 404| 7| } else { 405| 7| throw Decoding_Error( 406| 7| fmt("Unexpected tag {} while decoding ECC domain params", asn1_tag_to_string(next_obj_type))); 407| 7| } 408| 60|} _ZN5Botan8EC_GroupD2Ev: 412| 74|EC_Group::~EC_Group() = default; _ZN5Botan8EC_GroupC2ERKS0_: 414| 37|EC_Group::EC_Group(const EC_Group&) = default; _ZN5Botan8EC_GroupC2ENSt3__14spanIKhLm18446744073709551615EEE: 636| 60|EC_Group::EC_Group(std::span der) { 637| 60| auto data = DER_decode_EC_group(der, EC_Group_Source::ExternalSource); 638| 60| m_data = data.first; 639| 60| m_explicit_encoding = data.second; 640| 60|} _ZN5Botan17EC_Group_Data_Map6lookupERKNS_3OIDE: 54| 43| std::shared_ptr lookup(const OID& oid) { 55| 43| const lock_guard_type lock(m_mutex); 56| | 57| 86| for(auto i : m_registered_curves) { ------------------ | Branch (57:21): [True: 86, False: 12] ------------------ 58| 86| if(i->oid() == oid) { ------------------ | Branch (58:16): [True: 31, False: 55] ------------------ 59| 31| return i; 60| 31| } 61| 86| } 62| | 63| | // Not found, check hardcoded data 64| 12| std::shared_ptr data = EC_Group::EC_group_info(oid); 65| | 66| 12| if(data) { ------------------ | Branch (66:13): [True: 6, False: 6] ------------------ 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| 6| return std::shared_ptr(); 83| 12| } _ZN5Botan13EC_Group_DataD2Ev: 27| 6|EC_Group_Data::~EC_Group_Data() = default; _ZN5Botan13EC_Group_DataC2ERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 39| 6| m_p(p), 40| 6| m_a(a), 41| 6| m_b(b), 42| 6| m_g_x(g_x), 43| 6| m_g_y(g_y), 44| 6| m_order(order), 45| 6| m_cofactor(cofactor), 46| |#if defined(BOTAN_HAS_LEGACY_EC_POINT) 47| 6| m_mod_field(Barrett_Reduction::for_public_modulus(p)), 48| 6| m_mod_order(Barrett_Reduction::for_public_modulus(order)), 49| 6| m_monty(m_p, m_mod_field), 50| |#endif 51| 6| m_oid(oid), 52| 6| m_p_words(p.sig_words()), 53| 6| m_p_bits(p.bits()), 54| 6| m_order_bits(order.bits()), 55| 6| m_order_bytes((m_order_bits + 7) / 8), 56| 6| m_a_is_minus_3(a == p - 3), 57| 6| m_a_is_zero(a.is_zero()), 58| 6| m_has_cofactor(m_cofactor != 1), 59| 6| m_order_is_less_than_p(m_order < p), 60| 6| m_source(source) { 61| | // Verify the generator (x, y) satisfies y^2 = x^3 + a*x + b (mod p) 62| 6| auto mod_p = Barrett_Reduction::for_public_modulus(p); 63| 6| const BigInt y2 = mod_p.square(g_y); 64| 6| const BigInt x3_ax_b = mod_p.reduce(mod_p.cube(g_x) + mod_p.multiply(a, g_x) + b); 65| 6| if(y2 != x3_ax_b) { ------------------ | Branch (65:7): [True: 0, False: 6] ------------------ 66| 0| throw Invalid_Argument("EC_Group generator is not on the curve"); 67| 0| } 68| | 69| | // TODO(Botan4) we can assume/assert the OID is set 70| 6| if(!m_oid.empty()) { ------------------ | Branch (70:7): [True: 6, False: 0] ------------------ 71| 6| DER_Encoder der(m_der_named_curve); 72| 6| der.encode(m_oid); 73| | 74| 6| const std::string name = m_oid.human_name_or_empty(); 75| 6| if(!name.empty()) { ------------------ | Branch (75:10): [True: 6, False: 0] ------------------ 76| | // returns nullptr if unknown or not supported 77| 6| m_pcurve = PCurve::PrimeOrderCurve::for_named_curve(name); 78| 6| } 79| 6| if(m_pcurve) { ------------------ | Branch (79:10): [True: 4, False: 2] ------------------ 80| 4| m_engine = EC_Group_Engine::Optimized; 81| 4| } 82| 6| } 83| | 84| | // Try a generic pcurves instance 85| 6| if(!m_pcurve && !m_has_cofactor) { ------------------ | Branch (85:7): [True: 2, False: 4] | Branch (85:20): [True: 2, False: 0] ------------------ 86| 2| m_pcurve = PCurve::PrimeOrderCurve::from_params(p, a, b, g_x, g_y, order); 87| 2| if(m_pcurve) { ------------------ | Branch (87:10): [True: 1, False: 1] ------------------ 88| 1| m_engine = EC_Group_Engine::Generic; 89| 1| } 90| | // possibly still null here, if parameters unsuitable or if the 91| | // pcurves_generic module wasn't included in the build 92| 2| } 93| | 94| 6|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 95| 6| secure_vector ws; 96| 6| m_a_r = m_monty.mul(a, m_monty.R2(), ws); 97| 6| m_b_r = m_monty.mul(b, m_monty.R2(), ws); 98| 6| if(!m_pcurve) { ------------------ | Branch (98:7): [True: 1, False: 5] ------------------ 99| 1| m_engine = EC_Group_Engine::Legacy; 100| 1| } 101| |#else 102| | if(!m_pcurve) { 103| | if(m_oid.empty()) { 104| | throw Not_Implemented("EC_Group this group is not supported in this build configuration"); 105| | } else { 106| | throw Not_Implemented( 107| | fmt("EC_Group the group {} is not supported in this build configuration", oid.to_string())); 108| | } 109| | } 110| |#endif 111| 6|} _ZN5Botan13EC_Group_Data6createERKNS_6BigIntES3_S3_S3_S3_S3_S3_RKNS_3OIDENS_15EC_Group_SourceE: 121| 6| EC_Group_Source source) { 122| 6| auto group = std::make_shared(p, a, b, g_x, g_y, order, cofactor, oid, source); 123| | 124| 6|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 125| 6| group->m_curve = CurveGFp(group.get()); 126| 6| group->m_base_point = EC_Point(group->m_curve, g_x, g_y); 127| 6| if(!group->m_pcurve) { ------------------ | Branch (127:7): [True: 1, False: 5] ------------------ 128| 1| group->m_base_mult = std::make_unique(group->m_base_point, group->m_mod_order); 129| 1| } 130| 6|#endif 131| | 132| 6| return group; 133| 6|} _ZNK5Botan13EC_Group_Data17point_deserializeENSt3__14spanIKhLm18446744073709551615EEE: 384| 37|std::unique_ptr EC_Group_Data::point_deserialize(std::span bytes) const { 385| | // The deprecated "hybrid" point format 386| | // TODO(Botan4) remove this 387| 37| if(bytes.size() >= 1 + 2 * 4 && (bytes[0] == 0x06 || bytes[0] == 0x07)) { ------------------ | Branch (387:7): [True: 37, False: 0] | Branch (387:37): [True: 1, False: 36] | Branch (387:57): [True: 0, False: 36] ------------------ 388| 1| const bool hdr_y_is_even = bytes[0] == 0x06; 389| 1| const bool y_is_even = (bytes.back() & 0x01) == 0; 390| | 391| 1| if(hdr_y_is_even == y_is_even) { ------------------ | Branch (391:10): [True: 0, False: 1] ------------------ 392| 0| std::vector sec1(bytes.begin(), bytes.end()); 393| 0| sec1[0] = 0x04; 394| 0| return this->point_deserialize(sec1); 395| 0| } 396| 1| } 397| | 398| 37| try { 399| 37| if(m_pcurve) { ------------------ | Branch (399:10): [True: 36, False: 1] ------------------ 400| 36| if(auto pt = m_pcurve->deserialize_point(bytes)) { ------------------ | Branch (400:18): [True: 0, False: 36] ------------------ 401| 0| return std::make_unique(shared_from_this(), std::move(*pt)); 402| 36| } else { 403| 36| return {}; 404| 36| } 405| 36| } else { 406| 1|#if defined(BOTAN_HAS_LEGACY_EC_POINT) 407| 1| auto pt = Botan::OS2ECP(bytes, m_curve); 408| 1| return std::make_unique(shared_from_this(), std::move(pt)); 409| |#else 410| | throw Not_Implemented("Legacy EC interfaces disabled in this build configuration"); 411| |#endif 412| 1| } 413| 37| } catch(...) { 414| 1| return {}; 415| 1| } 416| 37|} _ZN5Botan8EC_Group13EC_group_infoERKNS_3OIDE: 16| 12|std::shared_ptr EC_Group::EC_group_info(const OID& oid) { 17| | // secp256r1 18| 12| if(oid == OID{1, 2, 840, 10045, 3, 1, 7}) { ------------------ | Branch (18:7): [True: 0, False: 12] ------------------ 19| 0| return load_EC_group_info( 20| 0| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF", 21| 0| "0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC", 22| 0| "0x5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B", 23| 0| "0x6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296", 24| 0| "0x4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5", 25| 0| "0xFFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551", 26| 0| oid); 27| 0| } 28| | 29| | // secp384r1 30| 12| if(oid == OID{1, 3, 132, 0, 34}) { ------------------ | Branch (30:7): [True: 1, False: 11] ------------------ 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| 11| if(oid == OID{1, 3, 132, 0, 35}) { ------------------ | Branch (42:7): [True: 1, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 1}) { ------------------ | Branch (54:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 3}) { ------------------ | Branch (66:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 5}) { ------------------ | Branch (78:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 7}) { ------------------ | Branch (90:7): [True: 0, False: 10] ------------------ 91| 0| return load_EC_group_info( 92| 0| "0xA9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377", 93| 0| "0x7D5A0975FC2C3057EEF67530417AFFE7FB8055C126DC5C6CE94A4B44F330B5D9", 94| 0| "0x26DC5C6CE94A4B44F330B5D9BBD77CBF958416295CF7E1CE6BCCDC18FF8C07B6", 95| 0| "0x8BD2AEB9CB7E57CB2C4B482FFC81B7AFB9DE27E1E3BD23C23A4453BD9ACE3262", 96| 0| "0x547EF835C3DAC4FD97F8461A14611DC9C27745132DED8E545C1D54C72F046997", 97| 0| "0xA9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7", 98| 0| oid); 99| 0| } 100| | 101| | // brainpool320r1 102| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 9}) { ------------------ | Branch (102:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 11}) { ------------------ | Branch (114:7): [True: 0, False: 10] ------------------ 115| 0| return load_EC_group_info( 116| 0| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123ACD3A729901D1A71874700133107EC53", 117| 0| "0x7BC382C63D8C150C3C72080ACE05AFA0C2BEA28E4FB22787139165EFBA91F90F8AA5814A503AD4EB04A8C7DD22CE2826", 118| 0| "0x4A8C7DD22CE28268B39B55416F0447C2FB77DE107DCD2A62E880EA53EEB62D57CB4390295DBC9943AB78696FA504C11", 119| 0| "0x1D1C64F068CF45FFA2A63A81B7C13F6B8847A3E77EF14FE3DB7FCAFE0CBD10E8E826E03436D646AAEF87B2E247D4AF1E", 120| 0| "0x8ABE1D7520F9C2A45CB1EB8E95CFD55262B70B29FEEC5864E19C054FF99129280E4646217791811142820341263C5315", 121| 0| "0x8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7CF3AB6AF6B7FC3103B883202E9046565", 122| 0| oid); 123| 0| } 124| | 125| | // brainpool512r1 126| 10| if(oid == OID{1, 3, 36, 3, 3, 2, 8, 1, 1, 13}) { ------------------ | Branch (126:7): [True: 0, False: 10] ------------------ 127| 0| return load_EC_group_info( 128| 0| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA703308717D4D9B009BC66842AECDA12AE6A380E62881FF2F2D82C68528AA6056583A48F3", 129| 0| "0x7830A3318B603B89E2327145AC234CC594CBDD8D3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CA", 130| 0| "0x3DF91610A83441CAEA9863BC2DED5D5AA8253AA10A2EF1C98B9AC8B57F1117A72BF2C7B9E7C1AC4D77FC94CADC083E67984050B75EBAE5DD2809BD638016F723", 131| 0| "0x81AEE4BDD82ED9645A21322E9C4C6A9385ED9F70B5D916C1B43B62EEF4D0098EFF3B1F78E2D0D48D50D1687B93B97D5F7C6D5047406A5E688B352209BCB9F822", 132| 0| "0x7DDE385D566332ECC0EABFA9CF7822FDF209F70024A57B1AA000C55B881F8111B2DCDE494A5F485E5BCA4BD88A2763AED1CA2B2FA8F0540678CD1E0F3AD80892", 133| 0| "0xAADD9DB8DBE9C48B3FD4E6AE33C9FC07CB308DB3B3C9D20ED6639CCA70330870553E5C414CA92619418661197FAC10471DB1D381085DDADDB58796829CA90069", 134| 0| oid); 135| 0| } 136| | 137| | // frp256v1 138| 10| if(oid == OID{1, 2, 250, 1, 223, 101, 256, 1}) { ------------------ | Branch (138:7): [True: 0, False: 10] ------------------ 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| 10| 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: 10] | Branch (150:7): [True: 0, False: 10] | Branch (150:50): [True: 0, False: 10] | Branch (150:88): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 2, 643, 7, 1, 2, 1, 2, 1}) { ------------------ | Branch (162:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 132, 0, 9}) { ------------------ | Branch (174:7): [True: 0, False: 10] ------------------ 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| 10| if(oid == OID{1, 3, 132, 0, 8}) { ------------------ | Branch (186:7): [True: 1, False: 9] ------------------ 187| 1| return load_EC_group_info( 188| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFF", 189| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFC", 190| 1| "0x1C97BEFC54BD7A8B65ACF89F81D4D4ADC565FA45", 191| 1| "0x4A96B5688EF573284664698968C38BB913CBFC82", 192| 1| "0x23A628553168947D59DCC912042351377AC5FB32", 193| 1| "0x100000000000000000001F4C8F927AED3CA752257", 194| 1| oid); 195| 1| } 196| | 197| | // secp160r2 198| 9| if(oid == OID{1, 3, 132, 0, 30}) { ------------------ | Branch (198:7): [True: 0, False: 9] ------------------ 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| 9| if(oid == OID{1, 3, 132, 0, 31}) { ------------------ | Branch (210:7): [True: 1, False: 8] ------------------ 211| 1| return load_EC_group_info( 212| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFEE37", 213| 1| "0x0", 214| 1| "0x3", 215| 1| "0xDB4FF10EC057E9AE26B07D0280B7F4341DA5D1B1EAE06C7D", 216| 1| "0x9B2F2F6D9C5628A7844163D015BE86344082AA88D95E2F9D", 217| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFE26F2FC170F69466A74DEFD8D", 218| 1| oid); 219| 1| } 220| | 221| | // secp192r1 222| 8| if(oid == OID{1, 2, 840, 10045, 3, 1, 1}) { ------------------ | Branch (222:7): [True: 0, False: 8] ------------------ 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| 8| if(oid == OID{1, 3, 132, 0, 32}) { ------------------ | Branch (234:7): [True: 0, False: 8] ------------------ 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| 8| if(oid == OID{1, 3, 132, 0, 33}) { ------------------ | Branch (246:7): [True: 1, False: 7] ------------------ 247| 1| return load_EC_group_info( 248| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001", 249| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE", 250| 1| "0xB4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4", 251| 1| "0xB70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21", 252| 1| "0xBD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34", 253| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D", 254| 1| oid); 255| 1| } 256| | 257| | // secp256k1 258| 7| if(oid == OID{1, 3, 132, 0, 10}) { ------------------ | Branch (258:7): [True: 1, False: 6] ------------------ 259| 1| return load_EC_group_info( 260| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 261| 1| "0x0", 262| 1| "0x7", 263| 1| "0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798", 264| 1| "0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8", 265| 1| "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141", 266| 1| oid); 267| 1| } 268| | 269| | // sm2p256v1 270| 6| if(oid == OID{1, 2, 156, 10197, 1, 301}) { ------------------ | Branch (270:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 2}) { ------------------ | Branch (282:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 3}) { ------------------ | Branch (294:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 4}) { ------------------ | Branch (306:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 5}) { ------------------ | Branch (318:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 2, 840, 10045, 3, 1, 6}) { ------------------ | Branch (330:7): [True: 0, False: 6] ------------------ 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| 6| if(oid == OID{1, 3, 6, 1, 4, 1, 25258, 4, 3}) { ------------------ | Branch (342:7): [True: 0, False: 6] ------------------ 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| 6| return std::shared_ptr(); 354| 6|} _ZN5Botan8CurveGFpC2EPKNS_13EC_Group_DataE: 28| 6|CurveGFp::CurveGFp(const EC_Group_Data* group) : m_group(group) { 29| 6| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 116| 6| do { \ | | 117| 6| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 6] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 6| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 6] | | ------------------ ------------------ 30| 6|} _ZNK5Botan8CurveGFp5groupEv: 32| 908|const EC_Group_Data& CurveGFp::group() const { 33| 908| BOTAN_ASSERT_NONNULL(m_group); ------------------ | | 116| 908| do { \ | | 117| 908| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 908] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 908| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 908] | | ------------------ ------------------ 34| 908| return *m_group; 35| 908|} _ZNK5Botan8CurveGFp5get_aEv: 37| 1|const BigInt& CurveGFp::get_a() const { 38| 1| return this->group().a(); 39| 1|} _ZNK5Botan8CurveGFp5get_bEv: 41| 1|const BigInt& CurveGFp::get_b() const { 42| 1| return this->group().b(); 43| 1|} _ZNK5Botan8CurveGFp5get_pEv: 45| 1|const BigInt& CurveGFp::get_p() const { 46| 1| return this->group().p(); 47| 1|} _ZNK5Botan8CurveGFp11get_p_wordsEv: 49| 325|size_t CurveGFp::get_p_words() const { 50| 325| return this->group().p_words(); 51| 325|} _ZN5Botan8EC_PointC2ERKNS_8CurveGFpENS_6BigIntES4_: 115| 6| m_curve(curve), m_x(std::move(x)), m_y(std::move(y)), m_z(m_curve.group().monty().R1()) { 116| 6| const auto& group = m_curve.group(); 117| | 118| 6| if(m_x < 0 || m_x >= group.p()) { ------------------ | Branch (118:7): [True: 0, False: 6] | Branch (118:18): [True: 0, False: 6] ------------------ 119| 0| throw Invalid_Argument("Invalid EC_Point affine x"); 120| 0| } 121| 6| if(m_y < 0 || m_y >= group.p()) { ------------------ | Branch (121:7): [True: 0, False: 6] | Branch (121:18): [True: 0, False: 6] ------------------ 122| 0| throw Invalid_Argument("Invalid EC_Point affine y"); 123| 0| } 124| | 125| 6| secure_vector monty_ws(monty_ws_size(group)); 126| | 127| 6| to_rep(group, m_x, monty_ws); 128| 6| to_rep(group, m_y, monty_ws); 129| 6|} _ZN5Botan8EC_Point3addERKS0_RNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 266| 324|void EC_Point::add(const EC_Point& other, std::vector& workspace) { 267| 324| BOTAN_ARG_CHECK(m_curve == other.m_curve, "cannot add points on different curves"); ------------------ | | 35| 324| do { \ | | 36| 324| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 324| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 324] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 324| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 324] | | ------------------ ------------------ 268| | 269| 324| const size_t p_words = m_curve.get_p_words(); 270| | 271| 324| add(other.m_x._data(), 272| 324| std::min(p_words, other.m_x.size()), 273| 324| other.m_y._data(), 274| 324| std::min(p_words, other.m_y.size()), 275| 324| other.m_z._data(), 276| 324| std::min(p_words, other.m_z.size()), 277| 324| workspace); 278| 324|} _ZN5Botan8EC_Point3addEPKmmS2_mS2_mRNSt3__16vectorINS_6BigIntENS3_9allocatorIS5_EEEE: 286| 324| std::vector& ws_bn) { 287| 324| if((CT::all_zeros(x_words, x_size) & CT::all_zeros(z_words, z_size)).as_bool()) { ------------------ | Branch (287:7): [True: 0, False: 324] ------------------ 288| 0| return; 289| 0| } 290| | 291| 324| const auto& group = m_curve.group(); 292| | 293| 324| if(is_zero()) { ------------------ | Branch (293:7): [True: 0, False: 324] ------------------ 294| 0| m_x.set_words(x_words, x_size); 295| 0| m_y.set_words(y_words, y_size); 296| 0| m_z.set_words(z_words, z_size); 297| 0| return; 298| 0| } 299| | 300| 324| resize_ws(ws_bn, monty_ws_size(group)); 301| | 302| 324| secure_vector& ws = ws_bn[0].get_word_vector(); 303| 324| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 304| | 305| 324| BigInt& T0 = ws_bn[2]; 306| 324| BigInt& T1 = ws_bn[3]; 307| 324| BigInt& T2 = ws_bn[4]; 308| 324| BigInt& T3 = ws_bn[5]; 309| 324| BigInt& T4 = ws_bn[6]; 310| 324| BigInt& T5 = ws_bn[7]; 311| | 312| | /* 313| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-1998-cmo-2 314| | */ 315| | 316| 324| const BigInt& p = group.p(); 317| | 318| 324| fe_sqr(group, T0, z_words, z_size, ws); // z2^2 319| 324| fe_mul(group, T1, m_x, T0, ws); // x1*z2^2 320| 324| fe_mul(group, T3, z_words, z_size, T0, ws); // z2^3 321| 324| fe_mul(group, T2, m_y, T3, ws); // y1*z2^3 322| | 323| 324| fe_sqr(group, T3, m_z, ws); // z1^2 324| 324| fe_mul(group, T4, x_words, x_size, T3, ws); // x2*z1^2 325| | 326| 324| fe_mul(group, T5, m_z, T3, ws); // z1^3 327| 324| fe_mul(group, T0, y_words, y_size, T5, ws); // y2*z1^3 328| | 329| 324| T4.mod_sub(T1, p, sub_ws); // x2*z1^2 - x1*z2^2 330| | 331| 324| T0.mod_sub(T2, p, sub_ws); 332| | 333| 324| if(T4.is_zero()) { ------------------ | Branch (333:7): [True: 0, False: 324] ------------------ 334| 0| if(T0.is_zero()) { ------------------ | Branch (334:10): [True: 0, False: 0] ------------------ 335| 0| mult2(ws_bn); 336| 0| return; 337| 0| } 338| | 339| | // setting to zero: 340| 0| m_x.clear(); 341| 0| m_y = group.monty().R1(); 342| 0| m_z.clear(); 343| 0| return; 344| 0| } 345| | 346| 324| fe_sqr(group, T5, T4, ws); 347| | 348| 324| fe_mul(group, T3, T1, T5, ws); 349| | 350| 324| fe_mul(group, T1, T5, T4, ws); 351| | 352| 324| fe_sqr(group, m_x, T0, ws); 353| 324| m_x.mod_sub(T1, p, sub_ws); 354| 324| m_x.mod_sub(T3, p, sub_ws); 355| 324| m_x.mod_sub(T3, p, sub_ws); 356| | 357| 324| T3.mod_sub(m_x, p, sub_ws); 358| | 359| 324| fe_mul(group, m_y, T0, T3, ws); 360| 324| fe_mul(group, T3, T2, T1, ws); 361| | 362| 324| m_y.mod_sub(T3, p, sub_ws); 363| | 364| 324| fe_mul(group, T3, z_words, z_size, m_z, ws); 365| 324| fe_mul(group, m_z, T3, T4, ws); 366| 324|} _ZN5Botan8EC_Point5mult2ERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEE: 388| 243|void EC_Point::mult2(std::vector& ws_bn) { 389| 243| if(is_zero()) { ------------------ | Branch (389:7): [True: 0, False: 243] ------------------ 390| 0| return; 391| 0| } 392| | 393| 243| const auto& group = m_curve.group(); 394| | 395| 243| if(m_y.is_zero()) { ------------------ | Branch (395:7): [True: 0, False: 243] ------------------ 396| 0| *this = EC_Point(m_curve); // setting myself to zero 397| 0| return; 398| 0| } 399| | 400| 243| resize_ws(ws_bn, monty_ws_size(group)); 401| | 402| 243| secure_vector& ws = ws_bn[0].get_word_vector(); 403| 243| secure_vector& sub_ws = ws_bn[1].get_word_vector(); 404| | 405| 243| BigInt& T0 = ws_bn[2]; 406| 243| BigInt& T1 = ws_bn[3]; 407| 243| BigInt& T2 = ws_bn[4]; 408| 243| BigInt& T3 = ws_bn[5]; 409| 243| BigInt& T4 = ws_bn[6]; 410| | 411| | /* 412| | https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-1986-cc 413| | */ 414| 243| const BigInt& p = group.p(); 415| | 416| 243| fe_sqr(group, T0, m_y, ws); 417| | 418| 243| fe_mul(group, T1, m_x, T0, ws); 419| 243| fe_smul<4>(T1, p, sub_ws); 420| | 421| 243| if(group.a_is_zero()) { ------------------ | Branch (421:7): [True: 0, False: 243] ------------------ 422| | // if a == 0 then 3*x^2 + a*z^4 is just 3*x^2 423| 0| fe_sqr(group, T4, m_x, ws); // x^2 424| 0| fe_smul<3>(T4, p, sub_ws); // 3*x^2 425| 243| } else if(group.a_is_minus_3()) { ------------------ | Branch (425:14): [True: 243, False: 0] ------------------ 426| | /* 427| | if a == -3 then 428| | 3*x^2 + a*z^4 == 3*x^2 - 3*z^4 == 3*(x^2-z^4) == 3*(x-z^2)*(x+z^2) 429| | */ 430| 243| fe_sqr(group, T3, m_z, ws); // z^2 431| | 432| | // (x-z^2) 433| 243| T2 = m_x; 434| 243| T2.mod_sub(T3, p, sub_ws); 435| | 436| | // (x+z^2) 437| 243| T3.mod_add(m_x, p, sub_ws); 438| | 439| 243| fe_mul(group, T4, T2, T3, ws); // (x-z^2)*(x+z^2) 440| | 441| 243| fe_smul<3>(T4, p, sub_ws); // 3*(x-z^2)*(x+z^2) 442| 243| } else { 443| 0| fe_sqr(group, T3, m_z, ws); // z^2 444| 0| fe_sqr(group, T4, T3, ws); // z^4 445| 0| fe_mul(group, T3, group.monty_a(), T4, ws); // a*z^4 446| | 447| 0| fe_sqr(group, T4, m_x, ws); // x^2 448| 0| fe_smul<3>(T4, p, sub_ws); 449| 0| T4.mod_add(T3, p, sub_ws); // 3*x^2 + a*z^4 450| 0| } 451| | 452| 243| fe_sqr(group, T2, T4, ws); 453| 243| T2.mod_sub(T1, p, sub_ws); 454| 243| T2.mod_sub(T1, p, sub_ws); 455| | 456| 243| fe_sqr(group, T3, T0, ws); 457| 243| fe_smul<8>(T3, p, sub_ws); 458| | 459| 243| T1.mod_sub(T2, p, sub_ws); 460| | 461| 243| fe_mul(group, T0, T4, T1, ws); 462| 243| T0.mod_sub(T3, p, sub_ws); 463| | 464| 243| m_x.swap(T2); 465| | 466| 243| fe_mul(group, T2, m_y, m_z, ws); 467| 243| fe_smul<2>(T2, p, sub_ws); 468| | 469| 243| m_y.swap(T0); 470| 243| m_z.swap(T2); 471| 243|} _ZN5Botan8EC_Point16force_all_affineENSt3__14spanIS0_Lm18446744073709551615EEERNS1_6vectorImNS_16secure_allocatorImEEEE: 520| 1|void EC_Point::force_all_affine(std::span points, secure_vector& ws) { 521| 1| if(points.size() <= 1) { ------------------ | Branch (521:7): [True: 0, False: 1] ------------------ 522| 0| for(auto& point : points) { ------------------ | Branch (522:23): [True: 0, False: 0] ------------------ 523| 0| point.force_affine(); 524| 0| } 525| 0| return; 526| 0| } 527| | 528| 567| for(auto& point : points) { ------------------ | Branch (528:20): [True: 567, False: 1] ------------------ 529| 567| if(point.is_zero()) { ------------------ | Branch (529:10): [True: 0, False: 567] ------------------ 530| 0| throw Invalid_State("Cannot convert zero ECC point to affine"); 531| 0| } 532| 567| } 533| | 534| | /* 535| | For >= 2 points use Montgomery's trick 536| | 537| | See Algorithm 2.26 in "Guide to Elliptic Curve Cryptography" 538| | (Hankerson, Menezes, Vanstone) 539| | 540| | TODO is it really necessary to save all k points in c? 541| | */ 542| | 543| 1| const auto& group = points[0].m_curve.group(); 544| 1| const BigInt& rep_1 = group.monty().R1(); 545| | 546| 1| if(ws.size() < monty_ws_size(group)) { ------------------ | Branch (546:7): [True: 0, False: 1] ------------------ 547| 0| ws.resize(monty_ws_size(group)); 548| 0| } 549| | 550| 1| std::vector c(points.size()); 551| 1| c[0] = points[0].m_z; 552| | 553| 567| for(size_t i = 1; i != points.size(); ++i) { ------------------ | Branch (553:22): [True: 566, False: 1] ------------------ 554| 566| fe_mul(group, c[i], c[i - 1], points[i].m_z, ws); 555| 566| } 556| | 557| 1| BigInt s_inv = invert_element(group, c[c.size() - 1], ws); 558| | 559| 1| BigInt z_inv; 560| 1| BigInt z2_inv; 561| 1| BigInt z3_inv; 562| | 563| 567| for(size_t i = points.size() - 1; i != 0; i--) { ------------------ | Branch (563:38): [True: 566, False: 1] ------------------ 564| 566| EC_Point& point = points[i]; 565| | 566| 566| fe_mul(group, z_inv, s_inv, c[i - 1], ws); 567| | 568| 566| s_inv = fe_mul(group, s_inv, point.m_z, ws); 569| | 570| 566| fe_sqr(group, z2_inv, z_inv, ws); 571| 566| fe_mul(group, z3_inv, z2_inv, z_inv, ws); 572| 566| point.m_x = fe_mul(group, point.m_x, z2_inv, ws); 573| 566| point.m_y = fe_mul(group, point.m_y, z3_inv, ws); 574| 566| point.m_z = rep_1; 575| 566| } 576| | 577| 1| fe_sqr(group, z2_inv, s_inv, ws); 578| 1| fe_mul(group, z3_inv, z2_inv, s_inv, ws); 579| 1| points[0].m_x = fe_mul(group, points[0].m_x, z2_inv, ws); 580| 1| points[0].m_y = fe_mul(group, points[0].m_y, z3_inv, ws); 581| 1| points[0].m_z = rep_1; 582| 1|} _ZN5Botan8EC_Point4swapERS0_: 792| 492|void EC_Point::swap(EC_Point& other) noexcept { 793| 492| m_curve.swap(other.m_curve); 794| 492| m_x.swap(other.m_x); 795| 492| m_y.swap(other.m_y); 796| 492| m_z.swap(other.m_z); 797| 492|} _ZN5Botan6OS2ECPENSt3__14spanIKhLm18446744073709551615EEERKNS_8CurveGFpE: 866| 1|EC_Point OS2ECP(std::span data, const CurveGFp& curve) { 867| 1| return OS2ECP(data.data(), data.size(), curve); 868| 1|} _ZN5Botan6OS2ECPEPKhmRKNS_8CurveGFpE: 870| 1|EC_Point OS2ECP(const uint8_t data[], size_t data_len, const CurveGFp& curve) { 871| 1| if(data_len == 1 && data[0] == 0) { ------------------ | Branch (871:7): [True: 0, False: 1] | Branch (871:24): [True: 0, False: 0] ------------------ 872| | // SEC1 standard representation of the point at infinity 873| 0| return EC_Point(curve); 874| 0| } 875| | 876| 1| const auto [g_x, g_y] = OS2ECP(data, data_len, curve.get_p(), curve.get_a(), curve.get_b()); 877| | 878| 1| EC_Point point(curve, g_x, g_y); 879| | 880| 1| if(!point.on_the_curve()) { ------------------ | Branch (880:7): [True: 0, False: 1] ------------------ 881| 0| throw Decoding_Error("OS2ECP: Decoded point was not on the curve"); 882| 0| } 883| | 884| 1| return point; 885| 1|} _ZN5Botan6OS2ECPEPKhmRKNS_6BigIntES4_S4_: 887| 1|std::pair OS2ECP(const uint8_t pt[], size_t pt_len, const BigInt& p, const BigInt& a, const BigInt& b) { 888| 1| if(pt_len <= 1) { ------------------ | Branch (888:7): [True: 0, False: 1] ------------------ 889| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 890| 0| } 891| | 892| 1| const uint8_t pc = pt[0]; 893| 1| const size_t p_bytes = p.bytes(); 894| | 895| 1| BigInt x; 896| 1| BigInt y; 897| | 898| 1| if(pc == 2 || pc == 3) { ------------------ | Branch (898:7): [True: 0, False: 1] | Branch (898:18): [True: 0, False: 1] ------------------ 899| 0| if(pt_len != 1 + p_bytes) { ------------------ | Branch (899:10): [True: 0, False: 0] ------------------ 900| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 901| 0| } 902| 0| x = BigInt::decode(&pt[1], pt_len - 1); 903| | 904| 0| const bool y_mod_2 = ((pc & 0x01) == 1); 905| 0| y = decompress_point(y_mod_2, x, p, a, b); 906| 1| } else if(pc == 4) { ------------------ | Branch (906:14): [True: 0, False: 1] ------------------ 907| 0| if(pt_len != 1 + 2 * p_bytes) { ------------------ | Branch (907:10): [True: 0, False: 0] ------------------ 908| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 909| 0| } 910| | 911| 0| x = BigInt::decode(&pt[1], p_bytes); 912| 0| y = BigInt::decode(&pt[p_bytes + 1], p_bytes); 913| 1| } else if(pc == 6 || pc == 7) { ------------------ | Branch (913:14): [True: 1, False: 0] | Branch (913:25): [True: 0, False: 0] ------------------ 914| 1| if(pt_len != 1 + 2 * p_bytes) { ------------------ | Branch (914:10): [True: 1, False: 0] ------------------ 915| 1| throw Decoding_Error("OS2ECP invalid point encoding"); 916| 1| } 917| | 918| 0| x = BigInt::decode(&pt[1], p_bytes); 919| 0| y = BigInt::decode(&pt[p_bytes + 1], p_bytes); 920| | 921| 0| const bool y_mod_2 = ((pc & 0x01) == 1); 922| | 923| 0| if(decompress_point(y_mod_2, x, p, a, b) != y) { ------------------ | Branch (923:10): [True: 0, False: 0] ------------------ 924| 0| throw Decoding_Error("OS2ECP: Decoding error in hybrid format"); 925| 0| } 926| 0| } else { 927| 0| throw Decoding_Error("OS2ECP: Unknown format type " + std::to_string(static_cast(pc))); 928| 0| } 929| | 930| 0| if(x >= p || y >= p) { ------------------ | Branch (930:7): [True: 0, False: 0] | Branch (930:17): [True: 0, False: 0] ------------------ 931| 0| throw Decoding_Error("OS2ECP invalid point encoding"); 932| 0| } 933| | 934| 0| return std::make_pair(x, y); 935| 0|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_113monty_ws_sizeERKNS_13EC_Group_DataE: 102| 574|size_t monty_ws_size(const EC_Group_Data& group) { 103| 574| return 2 * group.p_words(); 104| 574|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16to_repERKNS_13EC_Group_DataERNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 55| 12|void to_rep(const EC_Group_Data& group, BigInt& x, secure_vector& ws) { 56| 12| group.monty().mul_by(x, group.monty().R2(), ws); 57| 12|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERKNS_6BigIntES6_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 82| 1.70k|inline BigInt fe_mul(const EC_Group_Data& group, const BigInt& x, const BigInt& y, secure_vector& ws) { 83| 1.70k| return group.monty().mul(x, y, ws); 84| 1.70k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_19resize_wsERNSt3__16vectorINS_6BigIntENS1_9allocatorIS3_EEEEm: 163| 567|inline void resize_ws(std::vector& ws_bn, size_t cap_size) { 164| 567| BOTAN_ASSERT(ws_bn.size() >= EC_Point::WORKSPACE_SIZE, "Expected size for EC_Point workspace"); ------------------ | | 64| 567| do { \ | | 65| 567| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 567| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 567] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 567| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 567] | | ------------------ ------------------ 165| | 166| 4.53k| for(auto& ws : ws_bn) { ------------------ | Branch (166:17): [True: 4.53k, False: 567] ------------------ 167| 4.53k| if(ws.size() < cap_size) { ------------------ | Branch (167:10): [True: 8, False: 4.52k] ------------------ 168| 8| ws.get_word_vector().resize(cap_size); 169| 8| } 170| 4.53k| } 171| 567|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_sqrERKNS_13EC_Group_DataERNS_6BigIntERKS4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 86| 2.51k|void fe_sqr(const EC_Group_Data& group, BigInt& z, const BigInt& x, secure_vector& ws) { 87| 2.51k| group.monty().sqr(z, x, ws); 88| 2.51k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERNS_6BigIntEPKmmRKS4_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 72| 1.29k| const EC_Group_Data& group, BigInt& z, const word x_w[], size_t x_size, const BigInt& y, secure_vector& ws) { 73| 1.29k| group.monty().mul(z, y, std::span{x_w, x_size}, ws); 74| 1.29k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_mulERKNS_13EC_Group_DataERNS_6BigIntERKS4_S7_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 67| 5.26k|inline void fe_mul(const EC_Group_Data& group, BigInt& z, const BigInt& x, const BigInt& y, secure_vector& ws) { 68| 5.26k| group.monty().mul(z, x, y, ws); 69| 5.26k|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_16fe_sqrERKNS_13EC_Group_DataERNS_6BigIntEPKmmRNSt3__16vectorImNS_16secure_allocatorImEEEE: 90| 324|void fe_sqr(const EC_Group_Data& group, BigInt& z, const word x_w[], size_t x_size, secure_vector& ws) { 91| 324| group.monty().sqr(z, std::span{x_w, x_size}, ws); 92| 324|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_114invert_elementERKNS_13EC_Group_DataERKNS_6BigIntERNSt3__16vectorImNS_16secure_allocatorImEEEE: 98| 1|BigInt invert_element(const EC_Group_Data& group, const BigInt& x, secure_vector& ws) { 99| 1| return group.monty().mul(inverse_mod_public_prime(x, group.p()), group.monty().R3(), ws); 100| 1|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm4EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 243|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 243| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 243| z.mod_mul(M, p, ws); 80| 243|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm3EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 243|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 243| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 243| z.mod_mul(M, p, ws); 80| 243|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm8EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 243|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 243| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 243| z.mod_mul(M, p, ws); 80| 243|} ec_point.cpp:_ZN5Botan12_GLOBAL__N_17fe_smulILm2EEEvRNS_6BigIntERKS2_RNSt3__16vectorImNS_16secure_allocatorImEEEE: 77| 243|inline void fe_smul(BigInt& z, const BigInt& p, secure_vector& ws) { 78| 243| static_assert(M == 2 || M == 3 || M == 4 || M == 8); 79| 243| z.mod_mul(M, p, ws); 80| 243|} _ZN5Botan30EC_Point_Base_Point_PrecomputeC2ERKNS_8EC_PointERKNS_17Barrett_ReductionE: 43| 1| m_base_point(base), m_mod_order(mod_order), m_p_words(base.get_curve().get_p_words()) { 44| 1| std::vector ws(EC_Point::WORKSPACE_SIZE); 45| | 46| 1| const size_t order_bits = mod_order.modulus_bits(); 47| | 48| 1| const size_t T_bits = round_up(order_bits + blinding_size(order_bits), WindowBits) / WindowBits; 49| | 50| 1| std::vector T(WindowSize * T_bits); 51| | 52| 1| EC_Point g = base; 53| 1| EC_Point g2; 54| 1| EC_Point g4; 55| | 56| 82| for(size_t i = 0; i != T_bits; i++) { ------------------ | Branch (56:22): [True: 81, False: 1] ------------------ 57| 81| g2 = g; 58| 81| g2.mult2(ws); 59| 81| g4 = g2; 60| 81| g4.mult2(ws); 61| | 62| 81| T[7 * i + 0] = g; 63| 81| T[7 * i + 1] = std::move(g2); 64| 81| T[7 * i + 2] = T[7 * i + 1].plus(T[7 * i + 0], ws); // g2+g 65| 81| T[7 * i + 3] = g4; 66| 81| T[7 * i + 4] = T[7 * i + 3].plus(T[7 * i + 0], ws); // g4+g 67| 81| T[7 * i + 5] = T[7 * i + 3].plus(T[7 * i + 1], ws); // g4+g2 68| 81| T[7 * i + 6] = T[7 * i + 3].plus(T[7 * i + 2], ws); // g4+g2+g 69| | 70| 81| g.swap(g4); 71| 81| g.mult2(ws); 72| 81| } 73| | 74| 1| EC_Point::force_all_affine(T, ws[0].get_word_vector()); 75| | 76| 1| m_W.resize(T.size() * 2 * m_p_words); 77| | 78| 1| word* p = m_W.data(); 79| 567| for(const auto& pt : T) { ------------------ | Branch (79:23): [True: 567, False: 1] ------------------ 80| 567| pt.get_x().encode_words(p, m_p_words); 81| 567| p += m_p_words; 82| 567| pt.get_y().encode_words(p, m_p_words); 83| 567| p += m_p_words; 84| 567| } 85| 1|} point_mul.cpp:_ZN5Botan12_GLOBAL__N_113blinding_sizeEm: 20| 1|size_t blinding_size(size_t order_bits) { 21| 1| return (order_bits + 1) / 2; 22| 1|} _ZN5Botan12EC_PublicKeyC2ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 59| 60|EC_PublicKey::EC_PublicKey(const AlgorithmIdentifier& alg_id, std::span key_bits) { 60| 60| m_public_key = std::make_shared(EC_Group(alg_id.parameters()), key_bits); 61| 60| m_domain_encoding = default_encoding_for(domain()); // NOLINT(*-prefer-member-initializer) 62| 60|} _ZN5Botan8PEM_Code6decodeERNS_10DataSourceERNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE: 62| 8|secure_vector decode(DataSource& source, std::string& label) { 63| 8| const size_t RANDOM_CHAR_LIMIT = 8; 64| | 65| 8| label.clear(); 66| | 67| 8| const std::string PEM_HEADER1 = "-----BEGIN "; 68| 8| const std::string PEM_HEADER2 = "-----"; 69| 8| size_t position = 0; 70| | 71| 900| while(position != PEM_HEADER1.length()) { ------------------ | Branch (71:10): [True: 894, False: 6] ------------------ 72| 894| auto b = source.read_byte(); 73| | 74| 894| if(!b) { ------------------ | Branch (74:10): [True: 2, False: 892] ------------------ 75| 2| throw Decoding_Error("PEM: No PEM header found"); 76| 2| } 77| 892| if(static_cast(*b) == PEM_HEADER1[position]) { ------------------ | Branch (77:10): [True: 75, False: 817] ------------------ 78| 75| ++position; 79| 817| } else if(position >= RANDOM_CHAR_LIMIT) { ------------------ | Branch (79:17): [True: 0, False: 817] ------------------ 80| 0| throw Decoding_Error("PEM: Malformed PEM header"); 81| 817| } else { 82| 817| position = 0; 83| 817| } 84| 892| } 85| 6| position = 0; 86| 689| while(position != PEM_HEADER2.length()) { ------------------ | Branch (86:10): [True: 688, False: 1] ------------------ 87| 688| auto b = source.read_byte(); 88| | 89| 688| if(!b) { ------------------ | Branch (89:10): [True: 0, False: 688] ------------------ 90| 0| throw Decoding_Error("PEM: No PEM header found"); 91| 0| } 92| 688| if(static_cast(*b) == PEM_HEADER2[position]) { ------------------ | Branch (92:10): [True: 6, False: 682] ------------------ 93| 6| ++position; 94| 682| } else if(position > 0) { ------------------ | Branch (94:17): [True: 1, False: 681] ------------------ 95| 1| throw Decoding_Error("PEM: Malformed PEM header"); 96| 1| } 97| | 98| 687| if(position == 0) { ------------------ | Branch (98:10): [True: 681, False: 6] ------------------ 99| 681| if(label.size() >= 128) { ------------------ | Branch (99:13): [True: 4, False: 677] ------------------ 100| 4| throw Decoding_Error("PEM: Label too long"); 101| 4| } 102| 677| label += static_cast(*b); 103| 677| } 104| 687| } 105| | 106| 1| std::vector b64; 107| | 108| 1| const std::string PEM_TRAILER = fmt("-----END {}-----", label); 109| 1| position = 0; 110| 591| while(position != PEM_TRAILER.length()) { ------------------ | Branch (110:10): [True: 591, False: 0] ------------------ 111| 591| auto b = source.read_byte(); 112| | 113| 591| if(!b) { ------------------ | Branch (113:10): [True: 1, False: 590] ------------------ 114| 1| throw Decoding_Error("PEM: No PEM trailer found"); 115| 1| } 116| 590| if(static_cast(*b) == PEM_TRAILER[position]) { ------------------ | Branch (116:10): [True: 0, False: 590] ------------------ 117| 0| ++position; 118| 590| } else if(position > 0) { ------------------ | Branch (118:17): [True: 0, False: 590] ------------------ 119| 0| throw Decoding_Error("PEM: Malformed PEM trailer"); 120| 0| } 121| | 122| 590| if(position == 0) { ------------------ | Branch (122:10): [True: 590, False: 0] ------------------ 123| 590| b64.push_back(*b); 124| 590| } 125| 590| } 126| | 127| 0| return base64_decode(b64.data(), b64.size()); 128| 1|} _ZN5Botan8PEM_Code7matchesERNS_10DataSourceENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm: 143| 4.00k|bool matches(DataSource& source, std::string_view extra, size_t search_range) { 144| 4.00k| const std::string PEM_HEADER = fmt("-----BEGIN {}", extra); 145| | 146| 4.00k| secure_vector search_buf(search_range); 147| 4.00k| const size_t got = source.peek(search_buf.data(), search_buf.size(), 0); 148| | 149| 4.00k| if(got < PEM_HEADER.length()) { ------------------ | Branch (149:7): [True: 0, False: 4.00k] ------------------ 150| 0| return false; 151| 0| } 152| | 153| 4.00k| size_t index = 0; 154| | 155| 2.23M| for(size_t j = 0; j != got; ++j) { ------------------ | Branch (155:22): [True: 2.22M, False: 4.00k] ------------------ 156| 2.22M| if(static_cast(search_buf[j]) == PEM_HEADER[index]) { ------------------ | Branch (156:10): [True: 5.46k, False: 2.22M] ------------------ 157| 5.46k| ++index; 158| 2.22M| } else { 159| 2.22M| index = 0; 160| 2.22M| } 161| | 162| 2.22M| if(index == PEM_HEADER.size()) { ------------------ | Branch (162:10): [True: 2, False: 2.22M] ------------------ 163| 2| return true; 164| 2| } 165| 2.22M| } 166| | 167| 4.00k| return false; 168| 4.00k|} _ZN5Botan15load_public_keyERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 131| 914| [[maybe_unused]] std::span key_bits) { 132| 914| const std::string oid_str = alg_id.oid().to_formatted_string(); 133| 914| const std::vector alg_info = split_on(oid_str, '/'); 134| 914| const std::string_view alg_name = alg_info[0]; 135| | 136| 914|#if defined(BOTAN_HAS_RSA) 137| 914| if(alg_name == "RSA") { ------------------ | Branch (137:7): [True: 417, False: 497] ------------------ 138| 417| return std::make_unique(alg_id, key_bits); 139| 417| } 140| 497|#endif 141| | 142| 497|#if defined(BOTAN_HAS_X25519) 143| 497| if(alg_name == "X25519" || alg_name == "Curve25519") { ------------------ | Branch (143:7): [True: 0, False: 497] | Branch (143:31): [True: 0, False: 497] ------------------ 144| 0| return std::make_unique(alg_id, key_bits); 145| 0| } 146| 497|#endif 147| | 148| 497|#if defined(BOTAN_HAS_X448) 149| 497| if(alg_name == "X448") { ------------------ | Branch (149:7): [True: 0, False: 497] ------------------ 150| 0| return std::make_unique(alg_id, key_bits); 151| 0| } 152| 497|#endif 153| | 154| 497|#if defined(BOTAN_HAS_MCELIECE) 155| 497| if(alg_name == "McEliece") { ------------------ | Branch (155:7): [True: 0, False: 497] ------------------ 156| 0| return std::make_unique(key_bits); 157| 0| } 158| 497|#endif 159| | 160| 497|#if defined(BOTAN_HAS_FRODOKEM) 161| 497| if(alg_name == "FrodoKEM" || alg_name.starts_with("FrodoKEM-") || alg_name.starts_with("eFrodoKEM-")) { ------------------ | Branch (161:7): [True: 0, False: 497] | Branch (161:33): [True: 0, False: 497] | Branch (161:70): [True: 0, False: 497] ------------------ 162| 0| return std::make_unique(alg_id, key_bits); 163| 0| } 164| 497|#endif 165| | 166| 497|#if defined(BOTAN_HAS_KYBER) || defined(BOTAN_HAS_KYBER_90S) 167| 497| if(alg_name == "Kyber" || alg_name.starts_with("Kyber-")) { ------------------ | Branch (167:7): [True: 0, False: 497] | Branch (167:30): [True: 0, False: 497] ------------------ 168| 0| return std::make_unique(alg_id, key_bits); 169| 0| } 170| 497|#endif 171| | 172| 497|#if defined(BOTAN_HAS_ML_KEM) 173| 497| if(alg_name.starts_with("ML-KEM-")) { ------------------ | Branch (173:7): [True: 0, False: 497] ------------------ 174| 0| return std::make_unique(alg_id, key_bits); 175| 0| } 176| 497|#endif 177| | 178| 497|#if defined(BOTAN_HAS_ECDSA) 179| 497| if(alg_name == "ECDSA") { ------------------ | Branch (179:7): [True: 60, False: 437] ------------------ 180| 60| return std::make_unique(alg_id, key_bits); 181| 60| } 182| 437|#endif 183| | 184| 437|#if defined(BOTAN_HAS_ECDH) 185| 437| if(alg_name == "ECDH") { ------------------ | Branch (185:7): [True: 0, False: 437] ------------------ 186| 0| return std::make_unique(alg_id, key_bits); 187| 0| } 188| 437|#endif 189| | 190| 437|#if defined(BOTAN_HAS_DIFFIE_HELLMAN) 191| 437| if(alg_name == "DH") { ------------------ | Branch (191:7): [True: 0, False: 437] ------------------ 192| 0| return std::make_unique(alg_id, key_bits); 193| 0| } 194| 437|#endif 195| | 196| 437|#if defined(BOTAN_HAS_DSA) 197| 437| if(alg_name == "DSA") { ------------------ | Branch (197:7): [True: 3, False: 434] ------------------ 198| 3| return std::make_unique(alg_id, key_bits); 199| 3| } 200| 434|#endif 201| | 202| 434|#if defined(BOTAN_HAS_ELGAMAL) 203| 434| if(alg_name == "ElGamal") { ------------------ | Branch (203:7): [True: 0, False: 434] ------------------ 204| 0| return std::make_unique(alg_id, key_bits); 205| 0| } 206| 434|#endif 207| | 208| 434|#if defined(BOTAN_HAS_ECGDSA) 209| 434| if(alg_name == "ECGDSA") { ------------------ | Branch (209:7): [True: 0, False: 434] ------------------ 210| 0| return std::make_unique(alg_id, key_bits); 211| 0| } 212| 434|#endif 213| | 214| 434|#if defined(BOTAN_HAS_ECKCDSA) 215| 434| if(alg_name == "ECKCDSA") { ------------------ | Branch (215:7): [True: 0, False: 434] ------------------ 216| 0| return std::make_unique(alg_id, key_bits); 217| 0| } 218| 434|#endif 219| | 220| 434|#if defined(BOTAN_HAS_ED25519) 221| 434| if(alg_name == "Ed25519") { ------------------ | Branch (221:7): [True: 0, False: 434] ------------------ 222| 0| return std::make_unique(alg_id, key_bits); 223| 0| } 224| 434|#endif 225| | 226| 434|#if defined(BOTAN_HAS_ED448) 227| 434| if(alg_name == "Ed448") { ------------------ | Branch (227:7): [True: 0, False: 434] ------------------ 228| 0| return std::make_unique(alg_id, key_bits); 229| 0| } 230| 434|#endif 231| | 232| 434|#if defined(BOTAN_HAS_GOST_34_10_2001) 233| 434| if(alg_name == "GOST-34.10" || alg_name == "GOST-34.10-2012-256" || alg_name == "GOST-34.10-2012-512") { ------------------ | Branch (233:7): [True: 0, False: 434] | Branch (233:35): [True: 0, False: 434] | Branch (233:72): [True: 0, False: 434] ------------------ 234| 0| return std::make_unique(alg_id, key_bits); 235| 0| } 236| 434|#endif 237| | 238| 434|#if defined(BOTAN_HAS_SM2) 239| 434| if(alg_name == "SM2" || alg_name == "SM2_Sig" || alg_name == "SM2_Enc") { ------------------ | Branch (239:7): [True: 0, False: 434] | Branch (239:28): [True: 0, False: 434] | Branch (239:53): [True: 0, False: 434] ------------------ 240| 0| return std::make_unique(alg_id, key_bits); 241| 0| } 242| 434|#endif 243| | 244| 434|#if defined(BOTAN_HAS_XMSS_RFC8391) 245| 434| if(alg_name == "XMSS") { ------------------ | Branch (245:7): [True: 0, False: 434] ------------------ 246| 0| return std::make_unique(key_bits); 247| 0| } 248| 434|#endif 249| | 250| 434|#if defined(BOTAN_HAS_DILITHIUM) || defined(BOTAN_HAS_DILITHIUM_AES) 251| 434| if(alg_name == "Dilithium" || alg_name.starts_with("Dilithium-")) { ------------------ | Branch (251:7): [True: 0, False: 434] | Branch (251:34): [True: 0, False: 434] ------------------ 252| 0| return std::make_unique(alg_id, key_bits); 253| 0| } 254| 434|#endif 255| | 256| 434|#if defined(BOTAN_HAS_ML_DSA) 257| 434| if(alg_name.starts_with("ML-DSA-")) { ------------------ | Branch (257:7): [True: 0, False: 434] ------------------ 258| 0| return std::make_unique(alg_id, key_bits); 259| 0| } 260| 434|#endif 261| | 262| 434|#if defined(BOTAN_HAS_HSS_LMS) 263| 434| if(alg_name == "HSS-LMS") { ------------------ | Branch (263:7): [True: 0, False: 434] ------------------ 264| 0| return std::make_unique(key_bits); 265| 0| } 266| 434|#endif 267| | 268| 434|#if defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHA2) || defined(BOTAN_HAS_SPHINCS_PLUS_WITH_SHAKE) 269| 434| if(alg_name == "SPHINCS+" || alg_name.starts_with("SphincsPlus-")) { ------------------ | Branch (269:7): [True: 0, False: 434] | Branch (269:33): [True: 0, False: 434] ------------------ 270| 0| return std::make_unique(alg_id, key_bits); 271| 0| } 272| 434|#endif 273| | 274| 434|#if defined(BOTAN_HAS_SLH_DSA_WITH_SHA2) || defined(BOTAN_HAS_SLH_DSA_WITH_SHAKE) 275| 434| if(alg_name.starts_with("SLH-DSA-") || alg_name.starts_with("Hash-SLH-DSA-")) { ------------------ | Branch (275:7): [True: 0, False: 434] | Branch (275:43): [True: 0, False: 434] ------------------ 276| 0| return std::make_unique(alg_id, key_bits); 277| 0| } 278| 434|#endif 279| | 280| 434|#if defined(BOTAN_HAS_CLASSICMCELIECE) 281| 434| if(alg_name.starts_with("ClassicMcEliece")) { ------------------ | Branch (281:7): [True: 0, False: 434] ------------------ 282| 0| return std::make_unique(alg_id, key_bits); 283| 0| } 284| 434|#endif 285| | 286| 434| throw Decoding_Error(fmt("Unknown or unavailable public key algorithm '{}'", alg_name)); 287| 434|} _ZN5Botan22format_hex_fingerprintENSt3__14spanIKhLm18446744073709551615EEE: 45| 1.84k|std::string format_hex_fingerprint(std::span bits) { 46| 1.84k| const std::string hex = hex_encode(bits); 47| | 48| 1.84k| std::string fprint; 49| 1.84k| fprint.reserve(3 * bits.size()); 50| | 51| 49.8k| for(size_t i = 0; i != hex.size(); i += 2) { ------------------ | Branch (51:22): [True: 48.0k, False: 1.84k] ------------------ 52| 48.0k| if(i != 0) { ------------------ | Branch (52:10): [True: 46.2k, False: 1.84k] ------------------ 53| 46.2k| fprint.push_back(':'); 54| 46.2k| } 55| | 56| 48.0k| fprint.push_back(hex[i]); 57| 48.0k| fprint.push_back(hex[i + 1]); 58| 48.0k| } 59| | 60| 1.84k| return fprint; 61| 1.84k|} _ZN5Botan6PK_Ops23Encryption_with_PaddingC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 31| 3| m_padding(EncryptionPaddingScheme::create(padding)) {} _ZN5Botan6PK_Ops23Encryption_with_PaddingD2Ev: 33| 3|PK_Ops::Encryption_with_Padding::~Encryption_with_Padding() = default; _ZN5Botan6PK_Ops23Encryption_with_Padding7encryptENSt3__14spanIKhLm18446744073709551615EEERNS_21RandomNumberGeneratorE: 40| 3| RandomNumberGenerator& rng) { 41| 3| const size_t max_input_bits = max_ptext_input_bits(); 42| 3| const size_t max_input_bytes = (max_input_bits + 7) / 8; 43| 3| BOTAN_ARG_CHECK(msg.size() <= max_input_bytes, "Plaintext too large"); ------------------ | | 35| 3| do { \ | | 36| 3| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 3| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 3] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 3| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 3] | | ------------------ ------------------ 44| | 45| 3| secure_vector padded_ptext(max_input_bits); 46| 3| const size_t written = m_padding->pad(padded_ptext, msg, max_input_bits, rng); 47| 3| return raw_encrypt(std::span{padded_ptext}.first(written), rng); 48| 3|} _ZN5Botan6PK_Ops22Key_Agreement_with_KDFC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 77| 38|PK_Ops::Key_Agreement_with_KDF::Key_Agreement_with_KDF(std::string_view kdf) { 78| 38| if(kdf != "Raw") { ------------------ | Branch (78:7): [True: 0, False: 38] ------------------ 79| 0| m_kdf = KDF::create_or_throw(kdf); 80| 0| } 81| 38|} _ZN5Botan6PK_Ops22Key_Agreement_with_KDFD2Ev: 83| 38|PK_Ops::Key_Agreement_with_KDF::~Key_Agreement_with_KDF() = default; _ZN5Botan6PK_Ops22Key_Agreement_with_KDF5agreeEmNSt3__14spanIKhLm18446744073709551615EEES5_: 87| 38| std::span salt) { 88| 38| if(!salt.empty() && m_kdf == nullptr) { ------------------ | Branch (88:7): [True: 0, False: 38] | Branch (88:24): [True: 0, False: 0] ------------------ 89| 0| throw Invalid_Argument("PK_Key_Agreement::derive_key requires a KDF to use a salt"); 90| 0| } 91| | 92| 38| secure_vector z = raw_agree(other_key.data(), other_key.size()); 93| 38| if(m_kdf) { ------------------ | Branch (93:7): [True: 0, False: 38] ------------------ 94| 0| return m_kdf->derive_key(key_len, z, salt.data(), salt.size()); 95| 0| } 96| 38| return z; 97| 38|} _ZN5Botan16PK_Encryptor_EMEC2ERKNS_10Public_KeyERNS_21RandomNumberGeneratorENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEESA_: 95| 3| std::string_view provider) { 96| 3| m_op = key.create_encryption_op(rng, padding, provider); 97| 3| if(!m_op) { ------------------ | Branch (97:7): [True: 0, False: 3] ------------------ 98| 0| throw Invalid_Argument(fmt("Key type {} does not support encryption", key.algo_name())); 99| 0| } 100| 3|} _ZN5Botan16PK_Encryptor_EMED2Ev: 102| 3|PK_Encryptor_EME::~PK_Encryptor_EME() = default; _ZNK5Botan16PK_Encryptor_EME3encEPKhmRNS_21RandomNumberGeneratorE: 111| 3|std::vector PK_Encryptor_EME::enc(const uint8_t ptext[], size_t len, RandomNumberGenerator& rng) const { 112| 3| return m_op->encrypt(std::span{ptext, len}, rng); 113| 3|} _ZN5Botan16PK_Key_AgreementC2ERKNS_11Private_KeyERNS_21RandomNumberGeneratorENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEESA_: 216| 38| std::string_view provider) { 217| 38| m_op = key.create_key_agreement_op(rng, kdf, provider); 218| 38| if(!m_op) { ------------------ | Branch (218:7): [True: 0, False: 38] ------------------ 219| 0| throw Invalid_Argument(fmt("Key type {} does not support key agreement", key.algo_name())); 220| 0| } 221| 38|} _ZN5Botan16PK_Key_AgreementD2Ev: 223| 38|PK_Key_Agreement::~PK_Key_Agreement() = default; _ZNK5Botan16PK_Key_Agreement10derive_keyEmNSt3__14spanIKhLm18446744073709551615EEENS1_17basic_string_viewIcNS1_11char_traitsIcEEEE: 241| 38| std::string_view salt) const { 242| 38| return this->derive_key(key_len, peer_key, as_span_of_bytes(salt)); 243| 38|} _ZNK5Botan16PK_Key_Agreement10derive_keyEmNSt3__14spanIKhLm18446744073709551615EEES4_: 247| 38| std::span salt) const { 248| 38| return SymmetricKey(m_op->agree(key_len, peer_key, salt)); 249| 38|} _ZN5Botan11PK_VerifierC2ERKNS_10Public_KeyENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS_16Signature_FormatES8_: 369| 310| std::string_view provider) { 370| 310| m_op = key.create_verification_op(padding, provider); 371| 310| if(!m_op) { ------------------ | Branch (371:7): [True: 0, False: 310] ------------------ 372| 0| throw Invalid_Argument(fmt("Key type {} does not support signature verification", key.algo_name())); 373| 0| } 374| | 375| 310| m_sig_format = format; 376| 310| m_sig_element_size = key._signature_element_size_for_DER_encoding(); 377| | 378| 310| if(m_sig_format == Signature_Format::DerSequence) { ------------------ | Branch (378:7): [True: 0, False: 310] ------------------ 379| 0| BOTAN_ARG_CHECK(m_sig_element_size.has_value(), "This key does not support DER signatures"); ------------------ | | 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] | | ------------------ ------------------ 380| 0| } 381| 310|} _ZN5Botan11PK_VerifierD2Ev: 395| 310|PK_Verifier::~PK_Verifier() = default; _ZN5Botan11PK_Verifier14verify_messageEPKhmS2_m: 411| 310|bool PK_Verifier::verify_message(const uint8_t msg[], size_t msg_length, const uint8_t sig[], size_t sig_length) { 412| 310| update(msg, msg_length); 413| 310| return check_signature(sig, sig_length); 414| 310|} _ZN5Botan11PK_Verifier6updateEPKhm: 420| 310|void PK_Verifier::update(const uint8_t in[], size_t length) { 421| 310| m_op->update({in, length}); 422| 310|} _ZN5Botan11PK_Verifier15check_signatureEPKhm: 451| 310|bool PK_Verifier::check_signature(const uint8_t sig[], size_t length) { 452| 310| try { 453| 310| if(m_sig_format == Signature_Format::Standard) { ------------------ | Branch (453:10): [True: 310, False: 0] ------------------ 454| 310| return m_op->is_valid_signature({sig, length}); 455| 310| } else if(m_sig_format == Signature_Format::DerSequence) { ------------------ | Branch (455:17): [True: 0, False: 0] ------------------ 456| 0| bool decoding_success = false; 457| 0| std::vector real_sig; 458| | 459| 0| BOTAN_ASSERT_NOMSG(m_sig_element_size.has_value()); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 460| | 461| 0| try { 462| 0| real_sig = decode_der_signature_pair({sig, length}, m_sig_element_size.value()); 463| 0| decoding_success = true; 464| 0| } catch(...) {} 465| | 466| | // It is critical that is_valid_signature is called even if DER decoding failed, since 467| | // that is what resets the internal state (message hashes, etc) 468| 0| const bool accept = m_op->is_valid_signature(real_sig); 469| | 470| 0| return accept && decoding_success; ------------------ | Branch (470:17): [True: 0, False: 0] | Branch (470:27): [True: 0, False: 0] ------------------ 471| 0| } else { 472| 0| throw Internal_Error("PK_Verifier: Invalid signature format enum"); 473| 0| } 474| 310| } catch(Invalid_Argument&) { 475| 0| return false; 476| 13| } catch(Decoding_Error&) { 477| 13| return false; 478| 13| } catch(Encoding_Error&) { 479| 0| return false; 480| 0| } 481| 310|} _ZNK5Botan13RSA_PublicKey11public_dataEv: 130| 313|std::shared_ptr RSA_PublicKey::public_data() const { 131| 313| return m_public; 132| 313|} _ZN5Botan13RSA_PublicKey4initEONS_6BigIntES2_: 156| 367|void RSA_PublicKey::init(BigInt&& n, BigInt&& e) { 157| 367| if(n.signum() <= 0 || n.is_even() || n.bits() < 384 || n.bits() > 16384) { ------------------ | Branch (157:7): [True: 0, False: 367] | Branch (157:26): [True: 0, False: 367] | Branch (157:41): [True: 0, False: 367] | Branch (157:59): [True: 0, False: 367] ------------------ 158| 0| throw Decoding_Error("Invalid RSA public key modulus"); 159| 0| } 160| 367| if(e.is_even() || e <= 1 || e >= n || e.bits() > 256) { ------------------ | Branch (160:7): [True: 1, False: 366] | Branch (160:22): [True: 0, False: 366] | Branch (160:32): [True: 0, False: 366] | Branch (160:42): [True: 0, False: 366] ------------------ 161| 1| throw Decoding_Error("Invalid RSA public key exponent"); 162| 1| } 163| 366| m_public = std::make_shared(std::move(n), std::move(e)); 164| 366|} _ZN5Botan13RSA_PublicKeyC1ERKNS_19AlgorithmIdentifierENSt3__14spanIKhLm18446744073709551615EEE: 166| 417|RSA_PublicKey::RSA_PublicKey(const AlgorithmIdentifier& /*unused*/, std::span key_bits) { 167| 417| BigInt n; 168| 417| BigInt e; 169| 417| BER_Decoder(key_bits, BER_Decoder::Limits::DER()).start_sequence().decode(n).decode(e).end_cons().verify_end(); 170| | 171| 417| init(std::move(n), std::move(e)); 172| 417|} _ZNK5Botan13RSA_PublicKey10key_lengthEv: 185| 311|size_t RSA_PublicKey::key_length() const { 186| 311| return m_public->public_modulus_bits(); 187| 311|} _ZNK5Botan13RSA_PublicKey20create_encryption_opERNS_21RandomNumberGeneratorENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_: 817| 3| std::string_view provider) const { 818| 3| if(provider == "base" || provider.empty()) { ------------------ | Branch (818:7): [True: 0, False: 3] | Branch (818:29): [True: 3, False: 0] ------------------ 819| 3| return std::make_unique(*this, params); 820| 3| } 821| 0| throw Provider_Not_Found(algo_name(), provider); 822| 3|} _ZNK5Botan13RSA_PublicKey22create_verification_opENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 833| 310| std::string_view provider) const { 834| 310| if(provider == "base" || provider.empty()) { ------------------ | Branch (834:7): [True: 0, False: 310] | Branch (834:29): [True: 310, False: 0] ------------------ 835| 310| return std::make_unique(*this, params); 836| 310| } 837| | 838| 0| throw Provider_Not_Found(algo_name(), provider); 839| 310|} _ZNK5Botan15RSA_Public_Data5get_nEv: 51| 313| const BigInt& get_n() const { return m_n; } _ZNK5Botan15RSA_Public_Data19public_modulus_bitsEv: 55| 611| size_t public_modulus_bits() const { return m_public_modulus_bits; } _ZN5Botan15RSA_Public_DataC2EONS_6BigIntES2_: 38| 366| m_n(std::move(n)), 39| 366| m_e(std::move(e)), 40| 366| m_mod_n(Barrett_Reduction::for_public_modulus(m_n)), 41| 366| m_monty_n(m_n, m_mod_n), 42| 366| m_public_modulus_bits(m_n.bits()), 43| 366| m_public_modulus_bytes(m_n.bytes()) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_124RSA_Encryption_OperationC2ERKNS_13RSA_PublicKeyENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE: 744| 3| PK_Ops::Encryption_with_Padding(padding), RSA_Public_Operation(rsa) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Public_OperationC2ERKNS_13RSA_PublicKeyE: 719| 313| explicit RSA_Public_Operation(const RSA_PublicKey& rsa) : m_public(rsa.public_data()) {} rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation20public_modulus_bytesEv: 732| 313| size_t public_modulus_bytes() const { return m_public->public_modulus_bytes(); } _ZNK5Botan15RSA_Public_Data20public_modulus_bytesEv: 57| 313| size_t public_modulus_bytes() const { return m_public_modulus_bytes; } rsa.cpp:_ZNK5Botan12_GLOBAL__N_124RSA_Encryption_Operation20max_ptext_input_bitsEv: 748| 3| size_t max_ptext_input_bits() const override { return public_modulus_bits() - 1; } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation19public_modulus_bitsEv: 721| 300| size_t public_modulus_bits() const { return m_public->public_modulus_bits(); } rsa.cpp:_ZN5Botan12_GLOBAL__N_124RSA_Encryption_Operation11raw_encryptENSt3__14spanIKhLm18446744073709551615EEERNS_21RandomNumberGeneratorE: 750| 3| std::vector raw_encrypt(std::span input, RandomNumberGenerator& /*rng*/) override { 751| 3| const BigInt input_bn(input); 752| 3| return public_op(input_bn).serialize(public_modulus_bytes()); 753| 3| } rsa.cpp:_ZNK5Botan12_GLOBAL__N_120RSA_Public_Operation9public_opERKNS_6BigIntE: 724| 313| BigInt public_op(const BigInt& m) const { 725| 313| if(m >= m_public->get_n()) { ------------------ | Branch (725:13): [True: 13, False: 300] ------------------ 726| 13| throw Decoding_Error("RSA public op - input is too large"); 727| 13| } 728| | 729| 300| return m_public->public_op(m); 730| 313| } _ZNK5Botan15RSA_Public_Data9public_opERKNS_6BigIntE: 45| 300| BigInt public_op(const BigInt& m) const { 46| 300| const size_t powm_window = 1; 47| 300| auto powm_m_n = monty_precompute(m_monty_n, m, powm_window, false); 48| 300| return monty_execute_vartime(*powm_m_n, m_e).value(); 49| 300| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_OperationC2ERKNS_13RSA_PublicKeyENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE: 768| 310| RSA_Public_Operation(rsa), m_padding(SignaturePaddingScheme::create_or_throw(padding)) {} rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation6updateENSt3__14spanIKhLm18446744073709551615EEE: 759| 310| void update(std::span msg) override { m_padding->update(msg.data(), msg.size()); } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation18is_valid_signatureENSt3__14spanIKhLm18446744073709551615EEE: 761| 310| bool is_valid_signature(std::span sig) override { 762| 310| const auto msg = m_padding->raw_data(); 763| 310| const auto message_repr = recover_message_repr(sig.data(), sig.size()); 764| 310| return m_padding->verify(message_repr, msg, public_modulus_bits() - 1); 765| 310| } rsa.cpp:_ZN5Botan12_GLOBAL__N_120RSA_Verify_Operation20recover_message_reprEPKhm: 773| 310| std::vector recover_message_repr(const uint8_t input[], size_t input_len) { 774| | // RFC 8017 8.1.2 and 8.2.2 state 775| | // If the length of the signature S is not k octets, 776| | // output "invalid signature" and stop. 777| | // 778| | // However right now TLS-Anvil has a bug which causes it to occasionally send 779| | // short signatures, so accept this for now. 780| | // TODO(Botan4) if this check hasn't been addressed by now, do so for Botan4 781| 310| if(input_len > public_modulus_bytes()) { ------------------ | Branch (781:13): [True: 0, False: 310] ------------------ 782| 0| throw Decoding_Error("RSA signature is an incorrect size for this public key"); 783| 0| } 784| 310| const BigInt input_bn(input, input_len); 785| 310| return public_op(input_bn).serialize(); 786| 310| } _ZN5Botan14if_work_factorEm: 37| 257|size_t if_work_factor(size_t bits) { 38| 257| if(bits < 512) { ------------------ | Branch (38:7): [True: 0, False: 257] ------------------ 39| 0| return 0; 40| 0| } 41| | 42| | // RFC 3766 estimates k at .02 and o(1) to be effectively zero for sizes of interest 43| | 44| 257| const double log2_k = -5.6438; // log2(.02) 45| 257| return nfs_workfactor(bits, log2_k); 46| 257|} _ZN5Botan14dl_work_factorEm: 48| 257|size_t dl_work_factor(size_t bits) { 49| | // Lacking better estimates... 50| 257| return if_work_factor(bits); 51| 257|} _ZN5Botan16dl_exponent_sizeEm: 53| 257|size_t dl_exponent_size(size_t p_bits) { 54| 257| BOTAN_ARG_CHECK(p_bits > 1, "Invalid prime length"); ------------------ | | 35| 257| do { \ | | 36| 257| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 257| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 257] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 257| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 257] | | ------------------ ------------------ 55| | 56| | /* 57| | For relevant sizes we follow the suggestions in 58| | NIST SP 800-56B Rev 2 Appendix D 59| | "Maximum Security Strength Estimates for IFC Modulus Lengths" 60| | 61| | For sizes outside the range considered in the SP we use some sensible values 62| | 63| | Note that we return twice the value given in Table 4 since we are choosing 64| | the exponent size as twice the estimated security strength. 65| | 66| | See also NIST SP 800-56A Rev 3 Appendix D, Tables 25 and 26 67| | */ 68| | 69| 257| if(p_bits <= 256) { ------------------ | Branch (69:7): [True: 0, False: 257] ------------------ 70| | /* 71| | * For stupidly small groups we might return a value larger than the group 72| | * size if we fell into the conditionals below. Just use the maximum 73| | * possible exponent size - for all the good it will do you with a group 74| | * this weak. 75| | */ 76| 0| return p_bits - 1; 77| 257| } else if(p_bits <= 1024) { ------------------ | Branch (77:14): [True: 0, False: 257] ------------------ 78| | /* 79| | Not in the SP, but general estimates are that a 1024 bit group provides at 80| | most 80 bits security, so using an exponent appropriate for 96 bit security 81| | is more than sufficient. 82| | */ 83| 0| return 192; 84| 257| } else if(p_bits <= 2048) { ------------------ | Branch (84:14): [True: 66, False: 191] ------------------ 85| 66| return 224; // SP 800-56B 86| 191| } else if(p_bits <= 3072) { ------------------ | Branch (86:14): [True: 81, False: 110] ------------------ 87| 81| return 256; // SP 800-56B 88| 110| } else if(p_bits <= 4096) { ------------------ | Branch (88:14): [True: 110, False: 0] ------------------ 89| 110| return 304; // SP 800-56B 90| 110| } else if(p_bits <= 6144) { ------------------ | Branch (90:14): [True: 0, False: 0] ------------------ 91| 0| return 352; // SP 800-56B 92| 0| } else if(p_bits <= 8192) { ------------------ | Branch (92:14): [True: 0, False: 0] ------------------ 93| 0| return 400; // SP 800-56B 94| 0| } else { 95| | // For values larger than we know about, just saturate to 256 bit security 96| | // which is Good Enough for FFDH 97| | // 98| | // NIST puts 15360 bit groups at exactly 256 bits security 99| 0| return 512; 100| 0| } 101| 257|} workfactor.cpp:_ZN5Botan12_GLOBAL__N_114nfs_workfactorEmd: 22| 257|size_t nfs_workfactor(size_t bits, double log2_k) { 23| | // approximates natural logarithm of an integer of given bitsize 24| 257| const double log_p = static_cast(bits) / std::numbers::log2e; 25| | 26| 257| const double log_log_p = std::log(log_p); 27| | 28| | // RFC 3766: k * e^((1.92 + o(1)) * cubrt(ln(n) * (ln(ln(n)))^2)) 29| 257| const double est = 1.92 * std::pow(log_p * log_log_p * log_log_p, 1.0 / 3.0); 30| | 31| | // return log2 of the workfactor 32| 257| return static_cast(log2_k + std::numbers::log2e * est); 33| 257|} _ZN5Botan4X5098load_keyERNS_10DataSourceE: 28| 914|std::unique_ptr load_key(DataSource& source) { 29| 914| try { 30| 914| AlgorithmIdentifier alg_id; 31| 914| std::vector key_bits; 32| | 33| 914| if(ASN1::maybe_BER(source) && !PEM_Code::matches(source)) { ------------------ | Branch (33:10): [True: 914, False: 0] | Branch (33:37): [True: 914, False: 0] ------------------ 34| 914| BER_Decoder(source, BER_Decoder::Limits::DER()) 35| 914| .start_sequence() 36| 914| .decode(alg_id) 37| 914| .decode(key_bits, ASN1_Type::BitString) 38| 914| .end_cons() 39| 914| .verify_end(); 40| 914| } else { 41| 0| DataSource_Memory ber(PEM_Code::decode_check_label(source, "PUBLIC KEY")); 42| | 43| 0| BER_Decoder(ber, BER_Decoder::Limits::DER()) 44| 0| .start_sequence() 45| 0| .decode(alg_id) 46| 0| .decode(key_bits, ASN1_Type::BitString) 47| 0| .end_cons() 48| 0| .verify_end(); 49| 0| } 50| | 51| 914| if(key_bits.empty()) { ------------------ | Branch (51:10): [True: 0, False: 914] ------------------ 52| 0| throw Decoding_Error("X.509 public key decoding"); 53| 0| } 54| | 55| 914| return load_public_key(alg_id, key_bits); 56| 914| } catch(Decoding_Error& e) { 57| 548| throw Decoding_Error("X.509 public key decoding", e); 58| 548| } 59| 914|} _ZN5Botan10ChaCha_RNGC2ENSt3__14spanIKhLm18446744073709551615EEE: 20| 1|ChaCha_RNG::ChaCha_RNG(std::span seed) { 21| 1| m_hmac = MessageAuthenticationCode::create_or_throw("HMAC(SHA-256)"); 22| 1| m_chacha = StreamCipher::create_or_throw("ChaCha(20)"); 23| 1| clear(); 24| 1| add_entropy(seed); 25| 1|} _ZN5Botan10ChaCha_RNG11clear_stateEv: 50| 1|void ChaCha_RNG::clear_state() { 51| 1| m_hmac->set_key(std::vector(m_hmac->output_length(), 0x00)); 52| 1| m_chacha->set_key(m_hmac->final()); 53| 1|} _ZN5Botan10ChaCha_RNG15generate_outputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE: 55| 12.0k|void ChaCha_RNG::generate_output(std::span output, std::span input) { 56| 12.0k| BOTAN_ASSERT_NOMSG(!output.empty()); ------------------ | | 77| 12.0k| do { \ | | 78| 12.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 12.0k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 12.0k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.0k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.0k] | | ------------------ ------------------ 57| | 58| 12.0k| if(!input.empty()) { ------------------ | Branch (58:7): [True: 0, False: 12.0k] ------------------ 59| 0| update(input); 60| 0| } 61| | 62| 12.0k| m_chacha->write_keystream(output); 63| 12.0k|} _ZN5Botan10ChaCha_RNG6updateENSt3__14spanIKhLm18446744073709551615EEE: 65| 1|void ChaCha_RNG::update(std::span input) { 66| 1| m_hmac->update(input); 67| 1| m_chacha->set_key(m_hmac->final()); 68| 1| const auto mac_key = m_chacha->keystream_bytes(m_hmac->output_length()); 69| 1| m_hmac->set_key(mac_key); 70| 1|} _ZNK5Botan10ChaCha_RNG14security_levelEv: 72| 1|size_t ChaCha_RNG::security_level() const { 73| 1| return 256; 74| 1|} _ZN5Botan12Stateful_RNG5clearEv: 15| 1|void Stateful_RNG::clear() { 16| 1| const lock_guard_type lock(m_mutex); 17| 1| m_reseed_counter = 0; 18| 1| m_last_pid = 0; 19| 1| clear_state(); 20| 1|} _ZNK5Botan12Stateful_RNG9is_seededEv: 27| 12.2k|bool Stateful_RNG::is_seeded() const { 28| 12.2k| const lock_guard_type lock(m_mutex); 29| 12.2k| return m_reseed_counter > 0; 30| 12.2k|} _ZN5Botan12Stateful_RNG23generate_batched_outputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE: 39| 12.0k|void Stateful_RNG::generate_batched_output(std::span output, std::span input) { 40| 12.0k| BOTAN_ASSERT_NOMSG(!output.empty()); ------------------ | | 77| 12.0k| do { \ | | 78| 12.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 12.0k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 12.0k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 12.0k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 12.0k] | | ------------------ ------------------ 41| | 42| 12.0k| const size_t max_per_request = max_number_of_bytes_per_request(); 43| | 44| 12.0k| if(max_per_request == 0) { ------------------ | Branch (44:7): [True: 12.0k, False: 0] ------------------ 45| | // no limit 46| 12.0k| reseed_check(); 47| 12.0k| this->generate_output(output, input); 48| 12.0k| } else { 49| 0| while(!output.empty()) { ------------------ | Branch (49:13): [True: 0, False: 0] ------------------ 50| 0| const size_t this_req = std::min(max_per_request, output.size()); 51| | 52| 0| reseed_check(); 53| 0| this->generate_output(output.subspan(0, this_req), input); 54| | 55| | // only include the input for the first iteration 56| 0| input = {}; 57| | 58| 0| output = output.subspan(this_req); 59| 0| } 60| 0| } 61| 12.0k|} _ZN5Botan12Stateful_RNG21fill_bytes_with_inputENSt3__14spanIhLm18446744073709551615EEENS2_IKhLm18446744073709551615EEE: 63| 12.0k|void Stateful_RNG::fill_bytes_with_input(std::span output, std::span input) { 64| 12.0k| const lock_guard_type lock(m_mutex); 65| | 66| 12.0k| if(output.empty()) { ------------------ | Branch (66:7): [True: 1, False: 12.0k] ------------------ 67| | // Special case for exclusively adding entropy to the stateful RNG. 68| 1| this->update(input); 69| | 70| 1| if(8 * input.size() >= security_level()) { ------------------ | Branch (70:10): [True: 1, False: 0] ------------------ 71| 1| reset_reseed_counter(); 72| 1| } 73| 12.0k| } else { 74| 12.0k| generate_batched_output(output, input); 75| 12.0k| } 76| 12.0k|} _ZN5Botan12Stateful_RNG20reset_reseed_counterEv: 100| 1|void Stateful_RNG::reset_reseed_counter() { 101| | // Lock is held whenever this function is called 102| 1| m_reseed_counter = 1; 103| 1|} _ZN5Botan12Stateful_RNG12reseed_checkEv: 105| 12.0k|void Stateful_RNG::reseed_check() { 106| | // Lock is held whenever this function is called 107| | 108| 12.0k| const uint32_t cur_pid = OS::get_process_id(); 109| | 110| 12.0k| const bool fork_detected = (m_last_pid > 0) && (cur_pid != m_last_pid); ------------------ | Branch (110:31): [True: 0, False: 12.0k] | Branch (110:51): [True: 0, False: 0] ------------------ 111| | 112| 12.0k| if(is_seeded() == false || fork_detected || (m_reseed_interval > 0 && m_reseed_counter >= m_reseed_interval)) { ------------------ | Branch (112:7): [True: 0, False: 12.0k] | Branch (112:31): [True: 0, False: 12.0k] | Branch (112:49): [True: 0, False: 12.0k] | Branch (112:74): [True: 0, False: 0] ------------------ 113| 0| m_reseed_counter = 0; 114| 0| m_last_pid = cur_pid; 115| | 116| 0| if(m_underlying_rng != nullptr) { ------------------ | Branch (116:10): [True: 0, False: 0] ------------------ 117| 0| reseed_from_rng(*m_underlying_rng, security_level()); 118| 0| } 119| | 120| 0| if(m_entropy_sources != nullptr) { ------------------ | Branch (120:10): [True: 0, False: 0] ------------------ 121| 0| reseed_from_sources(*m_entropy_sources, security_level()); 122| 0| } 123| | 124| 0| if(!is_seeded()) { ------------------ | Branch (124:10): [True: 0, False: 0] ------------------ 125| 0| if(fork_detected) { ------------------ | Branch (125:13): [True: 0, False: 0] ------------------ 126| 0| throw Invalid_State("Detected use of fork but cannot reseed DRBG"); 127| 0| } else { 128| 0| throw PRNG_Unseeded(name()); 129| 0| } 130| 0| } 131| 12.0k| } else { 132| 12.0k| BOTAN_ASSERT(m_reseed_counter != 0, "RNG is seeded"); ------------------ | | 64| 12.0k| do { \ | | 65| 12.0k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 12.0k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 12.0k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 12.0k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 12.0k] | | ------------------ ------------------ 133| 12.0k| m_reseed_counter += 1; 134| 12.0k| } 135| 12.0k|} _ZN5Botan6ChaChaC2Em: 85| 1|ChaCha::ChaCha(size_t rounds) : m_rounds(rounds) { 86| 1| BOTAN_ARG_CHECK(m_rounds == 8 || m_rounds == 12 || m_rounds == 20, "ChaCha only supports 8, 12 or 20 rounds"); ------------------ | | 35| 1| do { \ | | 36| 1| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 4| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 0, False: 1] | | | Branch (37:12): [True: 0, False: 1] | | | Branch (37:12): [True: 1, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 1| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 1] | | ------------------ ------------------ 87| 1|} _ZN5Botan6ChaCha11parallelismEv: 89| 2|size_t ChaCha::parallelism() { 90| 2|#if defined(BOTAN_HAS_CHACHA_AVX512) 91| 2| if(CPUID::has(CPUID::Feature::AVX512)) { ------------------ | Branch (91:7): [True: 0, False: 2] ------------------ 92| 0| return 16; 93| 0| } 94| 2|#endif 95| | 96| 2|#if defined(BOTAN_HAS_CHACHA_AVX2) 97| 2| if(CPUID::has(CPUID::Feature::AVX2)) { ------------------ | Branch (97:7): [True: 2, False: 0] ------------------ 98| 2| return 8; 99| 2| } 100| 0|#endif 101| | 102| 0| return 4; 103| 2|} _ZN5Botan6ChaCha6chachaEPhmPjm: 127| 2.70k|void ChaCha::chacha(uint8_t output[], size_t output_blocks, uint32_t state[16], size_t rounds) { 128| 2.70k| BOTAN_ASSERT(rounds % 2 == 0, "Valid rounds"); ------------------ | | 64| 2.70k| do { \ | | 65| 2.70k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 2.70k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 2.70k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 2.70k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 2.70k] | | ------------------ ------------------ 129| | 130| 2.70k|#if defined(BOTAN_HAS_CHACHA_AVX512) 131| 2.70k| if(CPUID::has(CPUID::Feature::AVX512)) { ------------------ | Branch (131:7): [True: 0, False: 2.70k] ------------------ 132| 0| while(output_blocks >= 16) { ------------------ | Branch (132:13): [True: 0, False: 0] ------------------ 133| 0| ChaCha::chacha_avx512_x16(output, state, rounds); 134| 0| output += 16 * 64; 135| 0| output_blocks -= 16; 136| 0| } 137| 0| } 138| 2.70k|#endif 139| | 140| 2.70k|#if defined(BOTAN_HAS_CHACHA_AVX2) 141| 2.70k| if(CPUID::has(CPUID::Feature::AVX2)) { ------------------ | Branch (141:7): [True: 2.70k, False: 0] ------------------ 142| 5.40k| while(output_blocks >= 8) { ------------------ | Branch (142:13): [True: 2.70k, False: 2.70k] ------------------ 143| 2.70k| ChaCha::chacha_avx2_x8(output, state, rounds); 144| 2.70k| output += 8 * 64; 145| 2.70k| output_blocks -= 8; 146| 2.70k| } 147| 2.70k| } 148| 2.70k|#endif 149| | 150| 2.70k|#if defined(BOTAN_HAS_CHACHA_SIMD32) 151| 2.70k| if(CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (151:7): [True: 2.70k, False: 0] ------------------ 152| 2.70k| while(output_blocks >= 4) { ------------------ | Branch (152:13): [True: 0, False: 2.70k] ------------------ 153| 0| ChaCha::chacha_simd32_x4(output, state, rounds); 154| 0| output += 4 * 64; 155| 0| output_blocks -= 4; 156| 0| } 157| 2.70k| } 158| 2.70k|#endif 159| | 160| | // TODO interleave rounds 161| 2.70k| for(size_t i = 0; i != output_blocks; ++i) { ------------------ | Branch (161:22): [True: 0, False: 2.70k] ------------------ 162| 0| uint32_t x00 = state[0]; 163| 0| uint32_t x01 = state[1]; 164| 0| uint32_t x02 = state[2]; 165| 0| uint32_t x03 = state[3]; 166| 0| uint32_t x04 = state[4]; 167| 0| uint32_t x05 = state[5]; 168| 0| uint32_t x06 = state[6]; 169| 0| uint32_t x07 = state[7]; 170| 0| uint32_t x08 = state[8]; 171| 0| uint32_t x09 = state[9]; 172| 0| uint32_t x10 = state[10]; 173| 0| uint32_t x11 = state[11]; 174| 0| uint32_t x12 = state[12]; 175| 0| uint32_t x13 = state[13]; 176| 0| uint32_t x14 = state[14]; 177| 0| uint32_t x15 = state[15]; 178| | 179| 0| for(size_t r = 0; r != rounds / 2; ++r) { ------------------ | Branch (179:25): [True: 0, False: 0] ------------------ 180| 0| chacha_quarter_round(x00, x04, x08, x12); 181| 0| chacha_quarter_round(x01, x05, x09, x13); 182| 0| chacha_quarter_round(x02, x06, x10, x14); 183| 0| chacha_quarter_round(x03, x07, x11, x15); 184| | 185| 0| chacha_quarter_round(x00, x05, x10, x15); 186| 0| chacha_quarter_round(x01, x06, x11, x12); 187| 0| chacha_quarter_round(x02, x07, x08, x13); 188| 0| chacha_quarter_round(x03, x04, x09, x14); 189| 0| } 190| | 191| 0| x00 += state[0]; 192| 0| x01 += state[1]; 193| 0| x02 += state[2]; 194| 0| x03 += state[3]; 195| 0| x04 += state[4]; 196| 0| x05 += state[5]; 197| 0| x06 += state[6]; 198| 0| x07 += state[7]; 199| 0| x08 += state[8]; 200| 0| x09 += state[9]; 201| 0| x10 += state[10]; 202| 0| x11 += state[11]; 203| 0| x12 += state[12]; 204| 0| x13 += state[13]; 205| 0| x14 += state[14]; 206| 0| x15 += state[15]; 207| | 208| 0| store_le(x00, output + 64 * i + 4 * 0); 209| 0| store_le(x01, output + 64 * i + 4 * 1); 210| 0| store_le(x02, output + 64 * i + 4 * 2); 211| 0| store_le(x03, output + 64 * i + 4 * 3); 212| 0| store_le(x04, output + 64 * i + 4 * 4); 213| 0| store_le(x05, output + 64 * i + 4 * 5); 214| 0| store_le(x06, output + 64 * i + 4 * 6); 215| 0| store_le(x07, output + 64 * i + 4 * 7); 216| 0| store_le(x08, output + 64 * i + 4 * 8); 217| 0| store_le(x09, output + 64 * i + 4 * 9); 218| 0| store_le(x10, output + 64 * i + 4 * 10); 219| 0| store_le(x11, output + 64 * i + 4 * 11); 220| 0| store_le(x12, output + 64 * i + 4 * 12); 221| 0| store_le(x13, output + 64 * i + 4 * 13); 222| 0| store_le(x14, output + 64 * i + 4 * 14); 223| 0| store_le(x15, output + 64 * i + 4 * 15); 224| | 225| 0| state[12]++; 226| 0| if(state[12] == 0) { ------------------ | Branch (226:10): [True: 0, False: 0] ------------------ 227| 0| state[13] += 1; 228| 0| } 229| 0| } 230| 2.70k|} _ZN5Botan6ChaCha18generate_keystreamEPhm: 255| 12.0k|void ChaCha::generate_keystream(uint8_t out[], size_t length) { 256| 12.0k| assert_key_material_set(); 257| | 258| 14.7k| while(length >= m_buffer.size() - m_position) { ------------------ | Branch (258:10): [True: 2.70k, False: 12.0k] ------------------ 259| 2.70k| const size_t available = m_buffer.size() - m_position; 260| | 261| | // TODO: this could write directly to the output buffer 262| | // instead of bouncing it through m_buffer first 263| 2.70k| copy_mem(out, &m_buffer[m_position], available); 264| 2.70k| chacha(m_buffer.data(), m_buffer.size() / 64, m_state.data(), m_rounds); 265| | 266| 2.70k| length -= available; 267| 2.70k| out += available; 268| 2.70k| m_position = 0; 269| 2.70k| } 270| | 271| 12.0k| copy_mem(out, &m_buffer[m_position], length); 272| | 273| 12.0k| m_position += length; 274| 12.0k|} _ZN5Botan6ChaCha16initialize_stateEv: 276| 2|void ChaCha::initialize_state() { 277| 2| static const uint32_t TAU[] = {0x61707865, 0x3120646e, 0x79622d36, 0x6b206574}; 278| | 279| 2| static const uint32_t SIGMA[] = {0x61707865, 0x3320646e, 0x79622d32, 0x6b206574}; 280| | 281| 2| m_state[4] = m_key[0]; 282| 2| m_state[5] = m_key[1]; 283| 2| m_state[6] = m_key[2]; 284| 2| m_state[7] = m_key[3]; 285| | 286| 2| if(m_key.size() == 4) { ------------------ | Branch (286:7): [True: 0, False: 2] ------------------ 287| 0| m_state[0] = TAU[0]; 288| 0| m_state[1] = TAU[1]; 289| 0| m_state[2] = TAU[2]; 290| 0| m_state[3] = TAU[3]; 291| | 292| 0| m_state[8] = m_key[0]; 293| 0| m_state[9] = m_key[1]; 294| 0| m_state[10] = m_key[2]; 295| 0| m_state[11] = m_key[3]; 296| 2| } else { 297| 2| m_state[0] = SIGMA[0]; 298| 2| m_state[1] = SIGMA[1]; 299| 2| m_state[2] = SIGMA[2]; 300| 2| m_state[3] = SIGMA[3]; 301| | 302| 2| m_state[8] = m_key[4]; 303| 2| m_state[9] = m_key[5]; 304| 2| m_state[10] = m_key[6]; 305| 2| m_state[11] = m_key[7]; 306| 2| } 307| | 308| 2| m_state[12] = 0; 309| 2| m_state[13] = 0; 310| 2| m_state[14] = 0; 311| 2| m_state[15] = 0; 312| | 313| 2| m_position = 0; 314| 2|} _ZNK5Botan6ChaCha19has_keying_materialEv: 316| 12.0k|bool ChaCha::has_keying_material() const { 317| 12.0k| return !m_state.empty(); 318| 12.0k|} _ZN5Botan6ChaCha12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 327| 2|void ChaCha::key_schedule(std::span key) { 328| 2| m_key.resize(key.size() / 4); 329| 2| load_le(m_key.data(), key.data(), m_key.size()); 330| | 331| 2| m_state.resize(16); 332| | 333| 2| const size_t chacha_block = 64; 334| 2| m_buffer.resize(parallelism() * chacha_block); 335| | 336| 2| set_iv(nullptr, 0); 337| 2|} _ZNK5Botan6ChaCha8key_specEv: 343| 2|Key_Length_Specification ChaCha::key_spec() const { 344| 2| return Key_Length_Specification(16, 32, 16); 345| 2|} _ZNK5Botan6ChaCha15valid_iv_lengthEm: 351| 2|bool ChaCha::valid_iv_length(size_t iv_len) const { 352| 2| return (iv_len == 0 || iv_len == 8 || iv_len == 12 || iv_len == 24); ------------------ | Branch (352:12): [True: 2, False: 0] | Branch (352:27): [True: 0, False: 0] | Branch (352:42): [True: 0, False: 0] | Branch (352:58): [True: 0, False: 0] ------------------ 353| 2|} _ZN5Botan6ChaCha12set_iv_bytesEPKhm: 355| 2|void ChaCha::set_iv_bytes(const uint8_t iv[], size_t length) { 356| 2| assert_key_material_set(); 357| | 358| 2| if(!valid_iv_length(length)) { ------------------ | Branch (358:7): [True: 0, False: 2] ------------------ 359| 0| throw Invalid_IV_Length(name(), length); 360| 0| } 361| | 362| 2| initialize_state(); 363| | 364| 2| if(length == 0) { ------------------ | Branch (364:7): [True: 2, False: 0] ------------------ 365| | // Treat zero length IV same as an all-zero IV 366| 2| m_state[14] = 0; 367| 2| m_state[15] = 0; 368| 2| } else if(length == 8) { ------------------ | Branch (368:14): [True: 0, False: 0] ------------------ 369| 0| m_state[14] = load_le(iv, 0); 370| 0| m_state[15] = load_le(iv, 1); 371| 0| } else if(length == 12) { ------------------ | Branch (371:14): [True: 0, False: 0] ------------------ 372| 0| m_state[13] = load_le(iv, 0); 373| 0| m_state[14] = load_le(iv, 1); 374| 0| m_state[15] = load_le(iv, 2); 375| 0| } else if(length == 24) { ------------------ | Branch (375:14): [True: 0, False: 0] ------------------ 376| 0| m_state[12] = load_le(iv, 0); 377| 0| m_state[13] = load_le(iv, 1); 378| 0| m_state[14] = load_le(iv, 2); 379| 0| m_state[15] = load_le(iv, 3); 380| | 381| 0| secure_vector hc(8); 382| 0| hchacha(hc.data(), m_state.data(), m_rounds); 383| | 384| 0| m_state[4] = hc[0]; 385| 0| m_state[5] = hc[1]; 386| 0| m_state[6] = hc[2]; 387| 0| m_state[7] = hc[3]; 388| 0| m_state[8] = hc[4]; 389| 0| m_state[9] = hc[5]; 390| 0| m_state[10] = hc[6]; 391| 0| m_state[11] = hc[7]; 392| 0| m_state[12] = 0; 393| 0| m_state[13] = 0; 394| 0| m_state[14] = load_le(iv, 4); 395| 0| m_state[15] = load_le(iv, 5); 396| 0| } 397| | 398| 2| chacha(m_buffer.data(), m_buffer.size() / 64, m_state.data(), m_rounds); 399| 2| m_position = 0; 400| 2|} _ZN5Botan6ChaCha14chacha_avx2_x8EPhPjm: 15| 2.70k|void BOTAN_FN_ISA_AVX2 ChaCha::chacha_avx2_x8(uint8_t output[64 * 8], uint32_t state[16], size_t rounds) { 16| 2.70k| SIMD_8x32::reset_registers(); 17| | 18| 2.70k| BOTAN_ASSERT(rounds % 2 == 0, "Valid rounds"); ------------------ | | 64| 2.70k| do { \ | | 65| 2.70k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 2.70k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 2.70k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 2.70k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 2.70k] | | ------------------ ------------------ 19| 2.70k| const SIMD_8x32 CTR0 = SIMD_8x32(0, 1, 2, 3, 4, 5, 6, 7); 20| | 21| 2.70k| const uint32_t C = 0xFFFFFFFF - state[12]; 22| | // NOLINTNEXTLINE(*-implicit-bool-conversion) 23| 2.70k| const SIMD_8x32 CTR1 = SIMD_8x32(0, C < 1, C < 2, C < 3, C < 4, C < 5, C < 6, C < 7); 24| | 25| 2.70k| SIMD_8x32 R00 = SIMD_8x32::splat(state[0]); 26| 2.70k| SIMD_8x32 R01 = SIMD_8x32::splat(state[1]); 27| 2.70k| SIMD_8x32 R02 = SIMD_8x32::splat(state[2]); 28| 2.70k| SIMD_8x32 R03 = SIMD_8x32::splat(state[3]); 29| 2.70k| SIMD_8x32 R04 = SIMD_8x32::splat(state[4]); 30| 2.70k| SIMD_8x32 R05 = SIMD_8x32::splat(state[5]); 31| 2.70k| SIMD_8x32 R06 = SIMD_8x32::splat(state[6]); 32| 2.70k| SIMD_8x32 R07 = SIMD_8x32::splat(state[7]); 33| 2.70k| SIMD_8x32 R08 = SIMD_8x32::splat(state[8]); 34| 2.70k| SIMD_8x32 R09 = SIMD_8x32::splat(state[9]); 35| 2.70k| SIMD_8x32 R10 = SIMD_8x32::splat(state[10]); 36| 2.70k| SIMD_8x32 R11 = SIMD_8x32::splat(state[11]); 37| 2.70k| SIMD_8x32 R12 = SIMD_8x32::splat(state[12]) + CTR0; 38| 2.70k| SIMD_8x32 R13 = SIMD_8x32::splat(state[13]) + CTR1; 39| 2.70k| SIMD_8x32 R14 = SIMD_8x32::splat(state[14]); 40| 2.70k| SIMD_8x32 R15 = SIMD_8x32::splat(state[15]); 41| | 42| 29.7k| for(size_t r = 0; r != rounds / 2; ++r) { ------------------ | Branch (42:22): [True: 27.0k, False: 2.70k] ------------------ 43| 27.0k| R00 += R04; 44| 27.0k| R01 += R05; 45| 27.0k| R02 += R06; 46| 27.0k| R03 += R07; 47| | 48| 27.0k| R12 ^= R00; 49| 27.0k| R13 ^= R01; 50| 27.0k| R14 ^= R02; 51| 27.0k| R15 ^= R03; 52| | 53| 27.0k| R12 = R12.rotl<16>(); 54| 27.0k| R13 = R13.rotl<16>(); 55| 27.0k| R14 = R14.rotl<16>(); 56| 27.0k| R15 = R15.rotl<16>(); 57| | 58| 27.0k| R08 += R12; 59| 27.0k| R09 += R13; 60| 27.0k| R10 += R14; 61| 27.0k| R11 += R15; 62| | 63| 27.0k| R04 ^= R08; 64| 27.0k| R05 ^= R09; 65| 27.0k| R06 ^= R10; 66| 27.0k| R07 ^= R11; 67| | 68| 27.0k| R04 = R04.rotl<12>(); 69| 27.0k| R05 = R05.rotl<12>(); 70| 27.0k| R06 = R06.rotl<12>(); 71| 27.0k| R07 = R07.rotl<12>(); 72| | 73| 27.0k| R00 += R04; 74| 27.0k| R01 += R05; 75| 27.0k| R02 += R06; 76| 27.0k| R03 += R07; 77| | 78| 27.0k| R12 ^= R00; 79| 27.0k| R13 ^= R01; 80| 27.0k| R14 ^= R02; 81| 27.0k| R15 ^= R03; 82| | 83| 27.0k| R12 = R12.rotl<8>(); 84| 27.0k| R13 = R13.rotl<8>(); 85| 27.0k| R14 = R14.rotl<8>(); 86| 27.0k| R15 = R15.rotl<8>(); 87| | 88| 27.0k| R08 += R12; 89| 27.0k| R09 += R13; 90| 27.0k| R10 += R14; 91| 27.0k| R11 += R15; 92| | 93| 27.0k| R04 ^= R08; 94| 27.0k| R05 ^= R09; 95| 27.0k| R06 ^= R10; 96| 27.0k| R07 ^= R11; 97| | 98| 27.0k| R04 = R04.rotl<7>(); 99| 27.0k| R05 = R05.rotl<7>(); 100| 27.0k| R06 = R06.rotl<7>(); 101| 27.0k| R07 = R07.rotl<7>(); 102| | 103| 27.0k| R00 += R05; 104| 27.0k| R01 += R06; 105| 27.0k| R02 += R07; 106| 27.0k| R03 += R04; 107| | 108| 27.0k| R15 ^= R00; 109| 27.0k| R12 ^= R01; 110| 27.0k| R13 ^= R02; 111| 27.0k| R14 ^= R03; 112| | 113| 27.0k| R15 = R15.rotl<16>(); 114| 27.0k| R12 = R12.rotl<16>(); 115| 27.0k| R13 = R13.rotl<16>(); 116| 27.0k| R14 = R14.rotl<16>(); 117| | 118| 27.0k| R10 += R15; 119| 27.0k| R11 += R12; 120| 27.0k| R08 += R13; 121| 27.0k| R09 += R14; 122| | 123| 27.0k| R05 ^= R10; 124| 27.0k| R06 ^= R11; 125| 27.0k| R07 ^= R08; 126| 27.0k| R04 ^= R09; 127| | 128| 27.0k| R05 = R05.rotl<12>(); 129| 27.0k| R06 = R06.rotl<12>(); 130| 27.0k| R07 = R07.rotl<12>(); 131| 27.0k| R04 = R04.rotl<12>(); 132| | 133| 27.0k| R00 += R05; 134| 27.0k| R01 += R06; 135| 27.0k| R02 += R07; 136| 27.0k| R03 += R04; 137| | 138| 27.0k| R15 ^= R00; 139| 27.0k| R12 ^= R01; 140| 27.0k| R13 ^= R02; 141| 27.0k| R14 ^= R03; 142| | 143| 27.0k| R15 = R15.rotl<8>(); 144| 27.0k| R12 = R12.rotl<8>(); 145| 27.0k| R13 = R13.rotl<8>(); 146| 27.0k| R14 = R14.rotl<8>(); 147| | 148| 27.0k| R10 += R15; 149| 27.0k| R11 += R12; 150| 27.0k| R08 += R13; 151| 27.0k| R09 += R14; 152| | 153| 27.0k| R05 ^= R10; 154| 27.0k| R06 ^= R11; 155| 27.0k| R07 ^= R08; 156| 27.0k| R04 ^= R09; 157| | 158| 27.0k| R05 = R05.rotl<7>(); 159| 27.0k| R06 = R06.rotl<7>(); 160| 27.0k| R07 = R07.rotl<7>(); 161| 27.0k| R04 = R04.rotl<7>(); 162| 27.0k| } 163| | 164| 2.70k| R00 += SIMD_8x32::splat(state[0]); 165| 2.70k| R01 += SIMD_8x32::splat(state[1]); 166| 2.70k| R02 += SIMD_8x32::splat(state[2]); 167| 2.70k| R03 += SIMD_8x32::splat(state[3]); 168| 2.70k| R04 += SIMD_8x32::splat(state[4]); 169| 2.70k| R05 += SIMD_8x32::splat(state[5]); 170| 2.70k| R06 += SIMD_8x32::splat(state[6]); 171| 2.70k| R07 += SIMD_8x32::splat(state[7]); 172| 2.70k| R08 += SIMD_8x32::splat(state[8]); 173| 2.70k| R09 += SIMD_8x32::splat(state[9]); 174| 2.70k| R10 += SIMD_8x32::splat(state[10]); 175| 2.70k| R11 += SIMD_8x32::splat(state[11]); 176| 2.70k| R12 += SIMD_8x32::splat(state[12]) + CTR0; 177| 2.70k| R13 += SIMD_8x32::splat(state[13]) + CTR1; 178| 2.70k| R14 += SIMD_8x32::splat(state[14]); 179| 2.70k| R15 += SIMD_8x32::splat(state[15]); 180| | 181| 2.70k| SIMD_8x32::transpose(R00, R01, R02, R03, R04, R05, R06, R07); 182| 2.70k| SIMD_8x32::transpose(R08, R09, R10, R11, R12, R13, R14, R15); 183| | 184| 2.70k| R00.store_le(output); 185| 2.70k| R08.store_le(output + 32 * 1); 186| 2.70k| R01.store_le(output + 32 * 2); 187| 2.70k| R09.store_le(output + 32 * 3); 188| 2.70k| R02.store_le(output + 32 * 4); 189| 2.70k| R10.store_le(output + 32 * 5); 190| 2.70k| R03.store_le(output + 32 * 6); 191| 2.70k| R11.store_le(output + 32 * 7); 192| 2.70k| R04.store_le(output + 32 * 8); 193| 2.70k| R12.store_le(output + 32 * 9); 194| 2.70k| R05.store_le(output + 32 * 10); 195| 2.70k| R13.store_le(output + 32 * 11); 196| 2.70k| R06.store_le(output + 32 * 12); 197| 2.70k| R14.store_le(output + 32 * 13); 198| 2.70k| R07.store_le(output + 32 * 14); 199| 2.70k| R15.store_le(output + 32 * 15); 200| | 201| 2.70k| SIMD_8x32::zero_registers(); 202| | 203| 2.70k| state[12] += 8; 204| 2.70k| if(state[12] < 8) { ------------------ | Branch (204:7): [True: 0, False: 2.70k] ------------------ 205| 0| state[13]++; 206| 0| } 207| 2.70k|} _ZN5Botan6CTR_BEC2ENSt3__110unique_ptrINS_11BlockCipherENS1_14default_deleteIS3_EEEEm: 31| 32| m_cipher(std::move(cipher)), 32| 32| m_block_size(m_cipher->block_size()), 33| 32| m_ctr_size(ctr_size), 34| 32| m_ctr_blocks(m_cipher->parallel_bytes() / m_block_size), 35| 32| m_counter(m_cipher->parallel_bytes()), 36| 32| m_pad(m_counter.size()), 37| 32| m_pad_pos(0) { 38| 32| BOTAN_ARG_CHECK(m_ctr_size >= 4 && m_ctr_size <= m_block_size, "Invalid CTR-BE counter size"); ------------------ | | 35| 32| do { \ | | 36| 32| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 64| if(!(expr)) { \ | | ------------------ | | | Branch (37:12): [True: 32, False: 0] | | | Branch (37:12): [True: 32, False: 0] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 32| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 32] | | ------------------ ------------------ 39| 32|} _ZNK5Botan6CTR_BE15valid_iv_lengthEm: 53| 101|bool CTR_BE::valid_iv_length(size_t iv_len) const { 54| 101| return (iv_len <= m_block_size); 55| 101|} _ZNK5Botan6CTR_BE8key_specEv: 61| 64|Key_Length_Specification CTR_BE::key_spec() const { 62| 64| return m_cipher->key_spec(); 63| 64|} _ZNK5Botan6CTR_BE19has_keying_materialEv: 69| 207|bool CTR_BE::has_keying_material() const { 70| 207| return m_cipher->has_keying_material(); 71| 207|} _ZN5Botan6CTR_BE12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 73| 32|void CTR_BE::key_schedule(std::span key) { 74| 32| m_cipher->set_key(key); 75| | 76| | // Set a default all-zeros IV 77| 32| set_iv(nullptr, 0); 78| 32|} _ZN5Botan6CTR_BE12cipher_bytesEPKhPhm: 88| 106|void CTR_BE::cipher_bytes(const uint8_t in[], uint8_t out[], size_t length) { 89| 106| assert_key_material_set(); 90| | 91| 106| const uint8_t* pad_bits = m_pad.data(); 92| 106| const size_t pad_size = m_pad.size(); 93| | 94| | /* Consume any already computed keystream in m_pad */ 95| | 96| 106| if(m_pad_pos > 0) { ------------------ | Branch (96:7): [True: 37, False: 69] ------------------ 97| 37| const size_t avail = pad_size - m_pad_pos; 98| 37| const size_t take = std::min(length, avail); 99| 37| xor_buf(out, in, pad_bits + m_pad_pos, take); 100| 37| length -= take; 101| 37| in += take; 102| 37| out += take; 103| 37| m_pad_pos += take; 104| | 105| 37| if(take == avail) { ------------------ | Branch (105:10): [True: 0, False: 37] ------------------ 106| 0| add_counter(m_ctr_blocks); 107| 0| m_cipher->encrypt_n(m_counter.data(), m_pad.data(), m_ctr_blocks); 108| 0| m_pad_pos = 0; 109| 0| } 110| 37| } 111| | 112| | /* Bulk processing */ 113| | 114| 106| [[maybe_unused]] const bool can_use_bs16_ctr4_fastpath = m_block_size == 16 && m_ctr_size == 4 && pad_size % 64 == 0; ------------------ | Branch (114:61): [True: 106, False: 0] | Branch (114:83): [True: 106, False: 0] | Branch (114:102): [True: 106, False: 0] ------------------ 115| | 116| 106|#if defined(BOTAN_HAS_CTR_BE_AVX2) 117| 106| if(length >= pad_size && can_use_bs16_ctr4_fastpath && CPUID::has(CPUID::Feature::AVX2)) { ------------------ | Branch (117:7): [True: 0, False: 106] | Branch (117:29): [True: 0, False: 0] | Branch (117:59): [True: 0, False: 0] ------------------ 118| 0| const size_t consumed = ctr_proc_bs16_ctr4_avx2(in, out, length); 119| 0| in += consumed; 120| 0| out += consumed; 121| 0| length -= consumed; 122| 0| } 123| 106|#endif 124| | 125| 106|#if defined(BOTAN_HAS_CTR_BE_SIMD32) 126| 106| if(length >= pad_size && can_use_bs16_ctr4_fastpath && CPUID::has(CPUID::Feature::SIMD_4X32)) { ------------------ | Branch (126:7): [True: 0, False: 106] | Branch (126:29): [True: 0, False: 0] | Branch (126:59): [True: 0, False: 0] ------------------ 127| 0| const size_t consumed = ctr_proc_bs16_ctr4_simd32(in, out, length); 128| 0| in += consumed; 129| 0| out += consumed; 130| 0| length -= consumed; 131| 0| } 132| 106|#endif 133| | 134| 106| while(length >= pad_size) { ------------------ | Branch (134:10): [True: 0, False: 106] ------------------ 135| 0| xor_buf(out, in, pad_bits, pad_size); 136| 0| length -= pad_size; 137| 0| in += pad_size; 138| 0| out += pad_size; 139| | 140| 0| add_counter(m_ctr_blocks); 141| 0| m_cipher->encrypt_n(m_counter.data(), m_pad.data(), m_ctr_blocks); 142| 0| } 143| | 144| | /* Now if length > 0 then we have some remaining text, and m_pad is full - consume as required */ 145| 106| if(length > 0) { ------------------ | Branch (145:7): [True: 69, False: 37] ------------------ 146| 69| xor_buf(out, in, pad_bits, length); 147| 69| m_pad_pos = length; 148| 69| } 149| 106|} _ZN5Botan6CTR_BE12set_iv_bytesEPKhm: 180| 101|void CTR_BE::set_iv_bytes(const uint8_t iv[], size_t iv_len) { 181| 101| if(!valid_iv_length(iv_len)) { ------------------ | Branch (181:7): [True: 0, False: 101] ------------------ 182| 0| throw Invalid_IV_Length(name(), iv_len); 183| 0| } 184| | 185| 101| m_iv.resize(m_block_size); 186| 101| zeroise(m_iv); 187| 101| copy_mem(m_iv.data(), iv, iv_len); 188| | 189| 101| seek(0); 190| 101|} _ZN5Botan6CTR_BE4seekEm: 241| 101|void CTR_BE::seek(uint64_t offset) { 242| 101| assert_key_material_set(); 243| | 244| 101| const uint64_t base_counter = m_ctr_blocks * (offset / m_counter.size()); 245| | 246| 101| zeroise(m_counter); 247| 101| BOTAN_ASSERT_NOMSG(m_counter.size() >= m_iv.size()); ------------------ | | 77| 101| do { \ | | 78| 101| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 101| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 101] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 101| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 101] | | ------------------ ------------------ 248| 101| copy_mem(m_counter.data(), m_iv.data(), m_iv.size()); 249| | 250| 101| const size_t BS = m_block_size; 251| | 252| | // Set m_counter blocks to IV, IV + 1, ... IV + n 253| | 254| 101| if(m_ctr_size == 4 && BS >= 8) { ------------------ | Branch (254:7): [True: 101, False: 0] | Branch (254:26): [True: 101, False: 0] ------------------ 255| 101| const uint32_t low32 = load_be(&m_counter[BS - 4], 0); 256| | 257| 101| if(m_ctr_blocks >= 4 && is_power_of_2(m_ctr_blocks)) { ------------------ | Branch (257:10): [True: 101, False: 0] | Branch (257:31): [True: 101, False: 0] ------------------ 258| 101| size_t written = 1; 259| 505| while(written < m_ctr_blocks) { ------------------ | Branch (259:16): [True: 404, False: 101] ------------------ 260| 404| copy_mem(&m_counter[written * BS], &m_counter[0], BS * written); // NOLINT(*container-data-pointer) 261| 404| written *= 2; 262| 404| } 263| 101| } else { 264| 0| for(size_t i = 1; i != m_ctr_blocks; ++i) { ------------------ | Branch (264:28): [True: 0, False: 0] ------------------ 265| 0| copy_mem(&m_counter[i * BS], &m_counter[0], BS - 4); // NOLINT(*container-data-pointer) 266| 0| } 267| 0| } 268| | 269| 1.61k| for(size_t i = 1; i != m_ctr_blocks; ++i) { ------------------ | Branch (269:25): [True: 1.51k, False: 101] ------------------ 270| 1.51k| const uint32_t c = static_cast(low32 + i); 271| 1.51k| store_be(c, &m_counter[(BS - 4) + i * BS]); 272| 1.51k| } 273| 101| } else { 274| | // do everything sequentially: 275| 0| for(size_t i = 1; i != m_ctr_blocks; ++i) { ------------------ | Branch (275:25): [True: 0, False: 0] ------------------ 276| 0| copy_mem(&m_counter[i * BS], &m_counter[(i - 1) * BS], BS); 277| | 278| 0| for(size_t j = 0; j != m_ctr_size; ++j) { ------------------ | Branch (278:28): [True: 0, False: 0] ------------------ 279| 0| uint8_t& c = m_counter[i * BS + (BS - 1 - j)]; 280| 0| c += 1; 281| 0| if(c > 0) { ------------------ | Branch (281:16): [True: 0, False: 0] ------------------ 282| 0| break; 283| 0| } 284| 0| } 285| 0| } 286| 0| } 287| | 288| 101| if(base_counter > 0) { ------------------ | Branch (288:7): [True: 0, False: 101] ------------------ 289| 0| add_counter(base_counter); 290| 0| } 291| | 292| 101| m_cipher->encrypt_n(m_counter.data(), m_pad.data(), m_ctr_blocks); 293| 101| m_pad_pos = offset % m_counter.size(); 294| 101|} _ZN5Botan12StreamCipher6createENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 40| 1|std::unique_ptr StreamCipher::create(std::string_view algo_spec, std::string_view provider) { 41| 1|#if defined(BOTAN_HAS_SHAKE_CIPHER) 42| 1| if(algo_spec == "SHAKE-128" || algo_spec == "SHAKE-128-XOF") { ------------------ | Branch (42:7): [True: 0, False: 1] | Branch (42:35): [True: 0, False: 1] ------------------ 43| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (43:10): [True: 0, False: 0] | Branch (43:30): [True: 0, False: 0] ------------------ 44| 0| return std::make_unique(); 45| 0| } 46| 0| } 47| | 48| 1| if(algo_spec == "SHAKE-256" || algo_spec == "SHAKE-256-XOF") { ------------------ | Branch (48:7): [True: 0, False: 1] | Branch (48:35): [True: 0, False: 1] ------------------ 49| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (49:10): [True: 0, False: 0] | Branch (49:30): [True: 0, False: 0] ------------------ 50| 0| return std::make_unique(); 51| 0| } 52| 0| } 53| 1|#endif 54| | 55| 1|#if defined(BOTAN_HAS_CHACHA) 56| 1| if(algo_spec == "ChaCha20") { ------------------ | Branch (56:7): [True: 0, False: 1] ------------------ 57| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (57:10): [True: 0, False: 0] | Branch (57:30): [True: 0, False: 0] ------------------ 58| 0| return std::make_unique(20); 59| 0| } 60| 0| } 61| 1|#endif 62| | 63| 1|#if defined(BOTAN_HAS_SALSA20) 64| 1| if(algo_spec == "Salsa20") { ------------------ | Branch (64:7): [True: 0, False: 1] ------------------ 65| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (65:10): [True: 0, False: 0] | Branch (65:30): [True: 0, False: 0] ------------------ 66| 0| return std::make_unique(); 67| 0| } 68| 0| } 69| 1|#endif 70| | 71| 1| const SCAN_Name req(algo_spec); 72| | 73| 1|#if defined(BOTAN_HAS_CTR_BE) 74| 1| if((req.algo_name() == "CTR-BE" || req.algo_name() == "CTR") && req.arg_count_between(1, 2)) { ------------------ | Branch (74:8): [True: 0, False: 1] | Branch (74:39): [True: 0, False: 1] | Branch (74:68): [True: 0, False: 0] ------------------ 75| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (75:10): [True: 0, False: 0] | Branch (75:30): [True: 0, False: 0] ------------------ 76| 0| auto cipher = BlockCipher::create(req.arg(0)); 77| 0| if(cipher) { ------------------ | Branch (77:13): [True: 0, False: 0] ------------------ 78| 0| const size_t ctr_size = req.arg_as_integer(1, cipher->block_size()); 79| 0| return std::make_unique(std::move(cipher), ctr_size); 80| 0| } 81| 0| } 82| 0| } 83| 1|#endif 84| | 85| 1|#if defined(BOTAN_HAS_CHACHA) 86| 1| if(req.algo_name() == "ChaCha") { ------------------ | Branch (86:7): [True: 1, False: 0] ------------------ 87| 1| if(provider.empty() || provider == "base") { ------------------ | Branch (87:10): [True: 1, False: 0] | Branch (87:30): [True: 0, False: 0] ------------------ 88| 1| return std::make_unique(req.arg_as_integer(0, 20)); 89| 1| } 90| 1| } 91| 0|#endif 92| | 93| 0|#if defined(BOTAN_HAS_OFB) 94| 0| if(req.algo_name() == "OFB" && req.arg_count() == 1) { ------------------ | Branch (94:7): [True: 0, False: 0] | Branch (94:35): [True: 0, False: 0] ------------------ 95| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (95:10): [True: 0, False: 0] | Branch (95:30): [True: 0, False: 0] ------------------ 96| 0| if(auto cipher = BlockCipher::create(req.arg(0))) { ------------------ | Branch (96:18): [True: 0, False: 0] ------------------ 97| 0| return std::make_unique(std::move(cipher)); 98| 0| } 99| 0| } 100| 0| } 101| 0|#endif 102| | 103| 0|#if defined(BOTAN_HAS_RC4) 104| | 105| 0| if(req.algo_name() == "RC4" || req.algo_name() == "ARC4" || req.algo_name() == "MARK-4") { ------------------ | Branch (105:7): [True: 0, False: 0] | Branch (105:35): [True: 0, False: 0] | Branch (105:64): [True: 0, False: 0] ------------------ 106| 0| const size_t skip = (req.algo_name() == "MARK-4") ? 256 : req.arg_as_integer(0, 0); ------------------ | Branch (106:27): [True: 0, False: 0] ------------------ 107| | 108| 0| if(provider.empty() || provider == "base") { ------------------ | Branch (108:10): [True: 0, False: 0] | Branch (108:30): [True: 0, False: 0] ------------------ 109| 0| return std::make_unique(skip); 110| 0| } 111| 0| } 112| | 113| 0|#endif 114| | 115| 0| BOTAN_UNUSED(req); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 116| 0| BOTAN_UNUSED(provider); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 117| | 118| 0| return nullptr; 119| 0|} _ZN5Botan12StreamCipher15create_or_throwENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_: 122| 1|std::unique_ptr StreamCipher::create_or_throw(std::string_view algo, std::string_view provider) { 123| 1| if(auto sc = StreamCipher::create(algo, provider)) { ------------------ | Branch (123:12): [True: 1, False: 0] ------------------ 124| 1| return sc; 125| 1| } 126| 0| throw Lookup_Error("Stream cipher", algo, provider); 127| 1|} _ZN5Botan19Credentials_Manager3pskERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES9_S9_: 29| 15| const std::string& identity) { 30| 15| auto side = [&] { 31| 15| if(type == "tls-client") { 32| 15| return TLS::Connection_Side::Client; 33| 15| } else if(type == "tls-server") { 34| 15| return TLS::Connection_Side::Server; 35| 15| } else { 36| 15| throw Internal_Error(fmt("No PSK set for type {}", type)); 37| 15| } 38| 15| }(); 39| | 40| | // New applications should use the appropriate credentials methods. This is a 41| | // retrofit of the behaviour before Botan 3.2.0 and will be removed in a 42| | // future major release. 43| | // 44| | // TODO: deprecate `psk("...", "session-ticket" | "dtls-cookie-secret")` 45| 15| if(side == TLS::Connection_Side::Server && context == "session-ticket") { ------------------ | Branch (45:7): [True: 0, False: 15] | Branch (45:47): [True: 0, False: 0] ------------------ 46| 0| if(auto key = session_ticket_key(); !key.empty()) { ------------------ | Branch (46:43): [True: 0, False: 0] ------------------ 47| 0| return SymmetricKey(std::move(key)); 48| 0| } 49| 15| } else if(side == TLS::Connection_Side::Server && context == "dtls-cookie-secret") { ------------------ | Branch (49:14): [True: 0, False: 15] | Branch (49:54): [True: 0, False: 0] ------------------ 50| 0| if(auto key = dtls_cookie_secret(); !key.empty()) { ------------------ | Branch (50:43): [True: 0, False: 0] ------------------ 51| 0| return SymmetricKey(std::move(key)); 52| 0| } 53| 15| } else /* context is a host name */ { 54| | // Assuming that find_preshared_keys returns _exactly_ one or no keys when 55| | // searching for a single specific identity. 56| 15| if(auto psks = find_preshared_keys(context, side, {identity}); psks.size() == 1) { ------------------ | Branch (56:70): [True: 15, False: 0] ------------------ 57| 15| return SymmetricKey(psks.front().extract_master_secret()); 58| 15| } 59| 15| } 60| | 61| 0| throw Internal_Error(fmt("No PSK set for identity {}", identity)); 62| 15|} _ZN5Botan19Credentials_Manager31trusted_certificate_authoritiesERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES9_: 134| 361| const std::string& /*unused*/) { 135| 361| return std::vector(); 136| 361|} credentials_manager.cpp:_ZZN5Botan19Credentials_Manager3pskERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEES9_S9_ENK3$_0clEv: 30| 15| auto side = [&] { 31| 15| if(type == "tls-client") { ------------------ | Branch (31:10): [True: 15, False: 0] ------------------ 32| 15| return TLS::Connection_Side::Client; 33| 15| } else if(type == "tls-server") { ------------------ | Branch (33:17): [True: 0, False: 0] ------------------ 34| 0| return TLS::Connection_Side::Server; 35| 0| } else { 36| 0| throw Internal_Error(fmt("No PSK set for type {}", type)); 37| 0| } 38| 15| }(); _ZN5Botan3TLS17make_hello_randomERNS_21RandomNumberGeneratorERNS0_9CallbacksERKNS0_6PolicyE: 25| 7.28k|std::vector make_hello_random(RandomNumberGenerator& rng, Callbacks& cb, const Policy& policy) { 26| 7.28k| auto buf = rng.random_vec>(32); 27| | 28| 7.28k| if(policy.hash_hello_random()) { ------------------ | Branch (28:7): [True: 7.28k, False: 0] ------------------ 29| 7.28k| auto sha256 = HashFunction::create_or_throw("SHA-256"); 30| 7.28k| sha256->update(buf); 31| 7.28k| sha256->final(buf); 32| 7.28k| } 33| | 34| | // TLS 1.3 does not require the insertion of a timestamp in the client hello 35| | // random. When offering both TLS 1.2 and 1.3 we nevertheless comply with the 36| | // legacy specification. 37| 7.28k| if(policy.include_time_in_hello_random() && (policy.allow_tls12() || policy.allow_dtls12())) { ------------------ | Branch (37:7): [True: 7.28k, False: 0] | Branch (37:49): [True: 7.28k, False: 0] | Branch (37:73): [True: 0, False: 0] ------------------ 38| 7.28k| const uint32_t time32 = static_cast(std::chrono::system_clock::to_time_t(cb.tls_current_timestamp())); 39| | 40| 7.28k| store_be(time32, buf.data()); 41| 7.28k| } 42| | 43| 7.28k| return buf; 44| 7.28k|} _ZN5Botan3TLS12Client_HelloD2Ev: 126| 7.28k|Client_Hello::~Client_Hello() = default; _ZN5Botan3TLS12Client_HelloC2Ev: 128| 7.28k|Client_Hello::Client_Hello() : m_data(std::make_unique()) {} _ZNK5Botan3TLS12Client_Hello4typeEv: 137| 21.8k|Handshake_Type Client_Hello::type() const { 138| 21.8k| return Handshake_Type::ClientHello; 139| 21.8k|} _ZNK5Botan3TLS12Client_Hello14legacy_versionEv: 141| 11.7k|Protocol_Version Client_Hello::legacy_version() const { 142| 11.7k| return m_data->legacy_version(); 143| 11.7k|} _ZNK5Botan3TLS12Client_Hello6randomEv: 145| 368|const std::vector& Client_Hello::random() const { 146| 368| return m_data->random(); 147| 368|} _ZNK5Botan3TLS12Client_Hello10session_idEv: 149| 65|const Session_ID& Client_Hello::session_id() const { 150| 65| return m_data->session_id(); 151| 65|} _ZNK5Botan3TLS12Client_Hello15extension_typesEv: 161| 5.44k|std::set Client_Hello::extension_types() const { 162| 5.44k| return m_data->extensions().extension_types(); 163| 5.44k|} _ZNK5Botan3TLS12Client_Hello9serializeEv: 172| 7.28k|std::vector Client_Hello::serialize() const { 173| 7.28k| std::vector buf; 174| 7.28k| buf.reserve(1024); // working around GCC warning 175| | 176| 7.28k| buf.push_back(m_data->legacy_version().major_version()); 177| 7.28k| buf.push_back(m_data->legacy_version().minor_version()); 178| 7.28k| buf += m_data->random(); 179| | 180| 7.28k| append_tls_length_value(buf, m_data->session_id().get(), 1); 181| | 182| 7.28k| if(m_data->legacy_version().is_datagram_protocol()) { ------------------ | Branch (182:7): [True: 0, False: 7.28k] ------------------ 183| 0| append_tls_length_value(buf, m_data->hello_cookie(), 1); 184| 0| } 185| | 186| 7.28k| append_tls_length_value(buf, m_data->ciphersuites(), 2); 187| 7.28k| append_tls_length_value(buf, m_data->comp_methods(), 1); 188| | 189| | /* 190| | * May not want to send extensions at all in some cases. If so, 191| | * should include SCSV value (if reneg info is empty, if not we are 192| | * renegotiating with a modern server) 193| | */ 194| | 195| 7.28k| buf += m_data->extensions().serialize(Connection_Side::Client); 196| | 197| 7.28k| return buf; 198| 7.28k|} _ZNK5Botan3TLS12Client_Hello13offered_suiteEt: 209| 5.48k|bool Client_Hello::offered_suite(uint16_t ciphersuite) const { 210| 5.48k| return std::find(m_data->ciphersuites().cbegin(), m_data->ciphersuites().cend(), ciphersuite) != 211| 5.48k| m_data->ciphersuites().cend(); 212| 5.48k|} _ZNK5Botan3TLS12Client_Hello17signature_schemesEv: 214| 311|std::vector Client_Hello::signature_schemes() const { 215| 311| if(const Signature_Algorithms* sigs = m_data->extensions().get()) { ------------------ | Branch (215:35): [True: 311, False: 0] ------------------ 216| 311| return sigs->supported_schemes(); 217| 311| } 218| 0| return {}; 219| 311|} _ZN5Botan3TLS21Server_Hello_InternalC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 48| 6.89k|Server_Hello_Internal::Server_Hello_Internal(const std::vector& buf) { 49| 6.89k| if(buf.size() < 38) { ------------------ | Branch (49:7): [True: 13, False: 6.87k] ------------------ 50| 13| throw Decoding_Error("Server_Hello: Packet corrupted"); 51| 13| } 52| | 53| 6.87k| TLS_Data_Reader reader("ServerHello", buf); 54| | 55| 6.87k| const uint8_t major_version = reader.get_byte(); 56| 6.87k| const uint8_t minor_version = reader.get_byte(); 57| | 58| 6.87k| m_legacy_version = Protocol_Version(major_version, minor_version); 59| | 60| | // RFC 8446 4.1.3 61| | // Upon receiving a message with type server_hello, implementations MUST 62| | // first examine the Random value and, if it matches this value, process 63| | // it as described in Section 4.1.4 [Hello Retry Request]). 64| 6.87k| m_random = reader.get_fixed(32); 65| 6.87k| m_is_hello_retry_request = CT::is_equal(m_random, HELLO_RETRY_REQUEST_MARKER).as_bool(); 66| | 67| 6.87k| m_session_id = Session_ID(reader.get_range(1, 0, 32)); 68| 6.87k| m_ciphersuite = reader.get_uint16_t(); 69| 6.87k| m_comp_method = reader.get_byte(); 70| | 71| | // Note that this code path might parse a TLS 1.2 (or older) server hello message that 72| | // is nevertheless marked as being a 'hello retry request' (potentially maliciously). 73| | // Extension parsing will however not be affected by the associated flag. 74| | // Only after parsing the extensions will the upstream code be able to decide 75| | // whether we're dealing with TLS 1.3 or older. 76| 6.87k| m_extensions.deserialize(reader, 77| 6.87k| Connection_Side::Server, 78| 6.87k| m_is_hello_retry_request ? Handshake_Type::HelloRetryRequest : Handshake_Type::ServerHello); ------------------ | Branch (78:29): [True: 4, False: 6.87k] ------------------ 79| 6.87k|} _ZNK5Botan3TLS21Server_Hello_Internal7versionEv: 81| 5.61k|Protocol_Version Server_Hello_Internal::version() const { 82| | // RFC 8446 4.2.1 83| | // A server which negotiates a version of TLS prior to TLS 1.3 MUST set 84| | // ServerHello.version and MUST NOT send the "supported_versions" 85| | // extension. A server which negotiates TLS 1.3 MUST respond by sending 86| | // a "supported_versions" extension containing the selected version 87| | // value (0x0304). 88| | // 89| | // Note: Here we just take a message parsing decision, further validation of 90| | // the extension's contents is done later. 91| 5.61k| return (extensions().has()) ? Protocol_Version::TLS_V13 : m_legacy_version; ------------------ | Branch (91:11): [True: 3, False: 5.61k] ------------------ 92| 5.61k|} _ZN5Botan3TLS12Server_HelloC2ENSt3__110unique_ptrINS0_21Server_Hello_InternalENS2_14default_deleteIS4_EEEE: 94| 5.61k|Server_Hello::Server_Hello(std::unique_ptr data) : m_data(std::move(data)) {} _ZN5Botan3TLS12Server_HelloD2Ev: 99| 5.61k|Server_Hello::~Server_Hello() = default; _ZNK5Botan3TLS12Server_Hello14legacy_versionEv: 128| 24.8k|Protocol_Version Server_Hello::legacy_version() const { 129| 24.8k| return m_data->legacy_version(); 130| 24.8k|} _ZNK5Botan3TLS12Server_Hello6randomEv: 132| 368|const std::vector& Server_Hello::random() const { 133| 368| return m_data->random(); 134| 368|} _ZNK5Botan3TLS12Server_Hello18compression_methodEv: 136| 5.51k|uint8_t Server_Hello::compression_method() const { 137| 5.51k| return m_data->comp_method(); 138| 5.51k|} _ZNK5Botan3TLS12Server_Hello10session_idEv: 140| 3.19k|const Session_ID& Server_Hello::session_id() const { 141| 3.19k| return m_data->session_id(); 142| 3.19k|} _ZNK5Botan3TLS12Server_Hello11ciphersuiteEv: 144| 21.9k|uint16_t Server_Hello::ciphersuite() const { 145| 21.9k| return m_data->ciphersuite(); 146| 21.9k|} _ZNK5Botan3TLS12Server_Hello15extension_typesEv: 148| 5.44k|std::set Server_Hello::extension_types() const { 149| 5.44k| return m_data->extensions().extension_types(); 150| 5.44k|} _ZNK5Botan3TLS12Server_Hello10extensionsEv: 152| 10.6k|const Extensions& Server_Hello::extensions() const { 153| 10.6k| return m_data->extensions(); 154| 10.6k|} _ZN5Botan3TLS20Server_Hello_12_ShimC2ENSt3__110unique_ptrINS0_21Server_Hello_InternalENS2_14default_deleteIS4_EEEE: 160| 5.61k| Server_Hello(std::move(data)) { 161| 5.61k| if(!m_data->version().is_pre_tls_13()) { ------------------ | Branch (161:7): [True: 85, False: 5.52k] ------------------ 162| 85| throw TLS_Exception(Alert::ProtocolVersion, "Expected server hello of (D)TLS 1.2 or lower"); 163| 85| } 164| 5.61k|} _ZNK5Botan3TLS20Server_Hello_12_Shim24random_signals_downgradeEv: 170| 251|std::optional Server_Hello_12_Shim::random_signals_downgrade() const { 171| 251| const uint64_t last8 = load_be(m_data->random().data(), 3); 172| 251| if(last8 == DOWNGRADE_TLS11) { ------------------ | Branch (172:7): [True: 1, False: 250] ------------------ 173| 1| return Protocol_Version::TLS_V11; 174| 1| } 175| 250| if(last8 == DOWNGRADE_TLS12) { ------------------ | Branch (175:7): [True: 2, False: 248] ------------------ 176| 2| return Protocol_Version::TLS_V12; 177| 2| } 178| | 179| 248| return std::nullopt; 180| 250|} _ZN5Botan3TLS14Certificate_12D2Ev: 22| 914|Certificate_12::~Certificate_12() = default; _ZN5Botan3TLS14Certificate_12C2ERKNSt3__16vectorIhNS2_9allocatorIhEEEERKNS0_6PolicyE: 35| 3.10k|Certificate_12::Certificate_12(const std::vector& buf, const Policy& policy) { 36| 3.10k| if(buf.size() < 3) { ------------------ | Branch (36:7): [True: 0, False: 3.10k] ------------------ 37| 0| throw Decoding_Error("Certificate: Message malformed"); 38| 0| } 39| | 40| 3.10k| const size_t total_size = make_uint32(0, buf[0], buf[1], buf[2]); 41| | 42| 3.10k| if(total_size != buf.size() - 3) { ------------------ | Branch (42:7): [True: 10, False: 3.09k] ------------------ 43| 10| throw Decoding_Error("Certificate: Message malformed"); 44| 10| } 45| | 46| 3.09k| const size_t max_size = policy.maximum_certificate_chain_size(); 47| 3.09k| if(max_size > 0 && total_size > max_size) { ------------------ | Branch (47:7): [True: 3.09k, False: 0] | Branch (47:23): [True: 0, False: 3.09k] ------------------ 48| 0| throw Decoding_Error("Certificate chain exceeds policy specified maximum size"); 49| 0| } 50| | 51| 3.09k| const uint8_t* certs = buf.data() + 3; 52| | 53| 4.01k| while(const size_t remaining_bytes = buf.data() + buf.size() - certs) { ------------------ | Branch (53:23): [True: 3.09k, False: 918] ------------------ 54| 3.09k| if(remaining_bytes < 3) { ------------------ | Branch (54:10): [True: 0, False: 3.09k] ------------------ 55| 0| throw Decoding_Error("Certificate: Message malformed"); 56| 0| } 57| | 58| 3.09k| const size_t cert_size = make_uint32(0, certs[0], certs[1], certs[2]); 59| | 60| 3.09k| if(remaining_bytes < (3 + cert_size)) { ------------------ | Branch (60:10): [True: 0, False: 3.09k] ------------------ 61| 0| throw Decoding_Error("Certificate: Message malformed"); 62| 0| } 63| | 64| 3.09k| DataSource_Memory cert_buf(&certs[3], cert_size); 65| 3.09k| try { 66| 3.09k| m_certs.push_back(X509_Certificate(cert_buf)); 67| 3.09k| } catch(Exception& e) { 68| | // bad_certificate would make more sense but BoGo expects decoding_error 69| 2.17k| throw TLS_Exception(Alert::DecodeError, e.what()); 70| 2.17k| } 71| | 72| 924| certs += cert_size + 3; 73| 924| } 74| | 75| | /* 76| | * TLS 1.0 through 1.2 all seem to require that the certificate be 77| | * precisely a v3 certificate. In fact the strict wording would seem 78| | * to require that every certificate in the chain be v3. But often 79| | * the intermediates are outside of the control of the server. 80| | * But, require that the leaf certificate be v3 81| | */ 82| 918| if(!m_certs.empty() && m_certs[0].x509_version() != 3) { ------------------ | Branch (82:7): [True: 918, False: 0] | Branch (82:27): [True: 4, False: 914] ------------------ 83| 4| throw TLS_Exception(Alert::BadCertificate, "The leaf certificate must be v3"); 84| 4| } 85| 918|} _ZN5Botan3TLS22Certificate_Request_12C2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 75| 31|Certificate_Request_12::Certificate_Request_12(const std::vector& buf) { 76| 31| if(buf.size() < 4) { ------------------ | Branch (76:7): [True: 0, False: 31] ------------------ 77| 0| throw Decoding_Error("Certificate_Req: Bad certificate request"); 78| 0| } 79| | 80| 31| TLS_Data_Reader reader("CertificateRequest", buf); 81| | 82| 31| const auto cert_type_codes = reader.get_range_vector(1, 1, 255); 83| | 84| 2.37k| for(const auto cert_type_code : cert_type_codes) { ------------------ | Branch (84:34): [True: 2.37k, False: 31] ------------------ 85| 2.37k| const std::string cert_type_name = cert_type_code_to_name(cert_type_code); 86| | 87| 2.37k| if(cert_type_name.empty()) { // something we don't know ------------------ | Branch (87:10): [True: 1.85k, False: 526] ------------------ 88| 1.85k| continue; 89| 1.85k| } 90| | 91| 526| m_cert_key_types.emplace_back(cert_type_name); 92| 526| } 93| | 94| 31| const std::vector algs = reader.get_range_vector(2, 2, 65534); 95| | 96| 31| if(algs.size() % 2 != 0) { ------------------ | Branch (96:7): [True: 2, False: 29] ------------------ 97| 2| throw Decoding_Error("Bad length for signature IDs in certificate request"); 98| 2| } 99| | 100| 133| for(size_t i = 0; i != algs.size(); i += 2) { ------------------ | Branch (100:22): [True: 104, False: 29] ------------------ 101| 104| m_schemes.emplace_back(make_uint16(algs[i], algs[i + 1])); 102| 104| } 103| | 104| 29| const uint16_t purported_size = reader.get_uint16_t(); 105| | 106| 29| if(reader.remaining_bytes() != purported_size) { ------------------ | Branch (106:7): [True: 7, False: 22] ------------------ 107| 7| throw Decoding_Error("Inconsistent length in certificate request"); 108| 7| } 109| | 110| 32| while(reader.has_remaining()) { ------------------ | Branch (110:10): [True: 10, False: 22] ------------------ 111| | // RFC 5246 7.4.4: opaque DistinguishedName<1..2^16-1> 112| 10| std::vector name_bits = reader.get_range_vector(2, 1, 65535); 113| | 114| 10| BER_Decoder decoder(name_bits, BER_Decoder::Limits::DER()); 115| 10| X509_DN name; 116| 10| decoder.decode(name).verify_end(); 117| 10| m_names.emplace_back(name); 118| 10| } 119| 22|} msg_certificate_req_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_122cert_type_code_to_nameEh: 32| 2.37k|std::string cert_type_code_to_name(uint8_t code) { 33| 2.37k| switch(code) { 34| 175| case 1: ------------------ | Branch (34:7): [True: 175, False: 2.20k] ------------------ 35| 175| return "RSA"; 36| 351| case 64: ------------------ | Branch (36:7): [True: 351, False: 2.02k] ------------------ 37| 351| return "ECDSA"; 38| 1.85k| default: ------------------ | Branch (38:7): [True: 1.85k, False: 526] ------------------ 39| 1.85k| return ""; // DH or something else 40| 2.37k| } 41| 2.37k|} _ZNK5Botan3TLS15Client_Hello_1220secure_renegotiationEv: 36| 7.28k|bool Client_Hello_12::secure_renegotiation() const { 37| 7.28k| return m_data->extensions().has(); 38| 7.28k|} _ZNK5Botan3TLS15Client_Hello_1218renegotiation_infoEv: 40| 7.28k|std::vector Client_Hello_12::renegotiation_info() const { 41| 7.28k| if(const Renegotiation_Extension* reneg = m_data->extensions().get()) { ------------------ | Branch (41:38): [True: 7.28k, False: 0] ------------------ 42| 7.28k| return reneg->renegotiation_info(); 43| 7.28k| } 44| 0| return {}; 45| 7.28k|} _ZN5Botan3TLS15Client_Hello_1237add_tls12_supported_groups_extensionsERKNS0_6PolicyE: 84| 7.28k|void Client_Hello_12::add_tls12_supported_groups_extensions(const Policy& policy) { 85| | // RFC 7919 3. 86| | // A client that offers a group MUST be able and willing to perform a DH 87| | // key exchange using that group. 88| | // 89| | // We don't support hybrid key exchange in TLS 1.2 90| | 91| 7.28k| std::vector compatible_kex_groups; 92| 94.7k| for(const auto& group : policy.key_exchange_groups()) { ------------------ | Branch (92:26): [True: 94.7k, False: 7.28k] ------------------ 93| 94.7k| if(!group.is_post_quantum()) { ------------------ | Branch (93:10): [True: 72.8k, False: 21.8k] ------------------ 94| 72.8k| compatible_kex_groups.push_back(group); 95| 72.8k| } 96| 94.7k| } 97| | 98| 7.28k| auto supported_groups = std::make_unique(std::move(compatible_kex_groups)); 99| | 100| 7.28k| if(!supported_groups->ec_groups().empty()) { ------------------ | Branch (100:7): [True: 7.28k, False: 0] ------------------ 101| | // NOLINTNEXTLINE(*-owning-memory) 102| 7.28k| m_data->extensions().add(new Supported_Point_Formats(policy.use_ecc_point_compression())); 103| 7.28k| } 104| | 105| 7.28k| m_data->extensions().add(std::move(supported_groups)); 106| 7.28k|} _ZN5Botan3TLS15Client_Hello_12C2ERNS0_12Handshake_IOERNS0_14Handshake_HashERKNS0_6PolicyERNS0_9CallbacksERNS_21RandomNumberGeneratorERKNSt3__16vectorIhNSD_9allocatorIhEEEERKNS1_8SettingsERKNSE_INSD_12basic_stringIcNSD_11char_traitsIcEENSF_IcEEEENSF_ISR_EEEE: 118| 7.28k| const std::vector& next_protocols) { 119| 7.28k| m_data->m_legacy_version = client_settings.protocol_version(); 120| 7.28k| m_data->m_random = make_hello_random(rng, cb, policy); 121| 7.28k| m_data->m_suites = policy.ciphersuite_list(client_settings.protocol_version()); 122| | 123| 7.28k| if(!policy.acceptable_protocol_version(m_data->legacy_version())) { ------------------ | Branch (123:7): [True: 0, False: 7.28k] ------------------ 124| 0| throw Internal_Error("Offering " + m_data->legacy_version().to_string() + 125| 0| " but our own policy does not accept it"); 126| 0| } 127| | 128| | /* 129| | * Place all empty extensions in front to avoid a bug in some systems 130| | * which reject hellos when the last extension in the list is empty. 131| | */ 132| | 133| | // NOLINTBEGIN(*-owning-memory) 134| | 135| | // EMS must always be used with TLS 1.2, regardless of the policy used. 136| | 137| 7.28k| m_data->extensions().add(new Extended_Master_Secret); 138| | 139| 7.28k| if(policy.negotiate_encrypt_then_mac()) { ------------------ | Branch (139:7): [True: 7.28k, False: 0] ------------------ 140| 7.28k| m_data->extensions().add(new Encrypt_then_MAC); 141| 7.28k| } 142| | 143| 7.28k| m_data->extensions().add(new Session_Ticket_Extension()); 144| | 145| 7.28k| m_data->extensions().add(new Renegotiation_Extension(reneg_info)); 146| | 147| 7.28k| m_data->extensions().add(new Supported_Versions(m_data->legacy_version(), policy)); 148| | 149| 7.28k| if(Server_Name_Indicator::hostname_acceptable_for_sni(client_settings.hostname())) { ------------------ | Branch (149:7): [True: 7.28k, False: 0] ------------------ 150| 7.28k| m_data->extensions().add(new Server_Name_Indicator(client_settings.hostname())); 151| 7.28k| } 152| | 153| 7.28k| if(policy.support_cert_status_message()) { ------------------ | Branch (153:7): [True: 7.28k, False: 0] ------------------ 154| 7.28k| m_data->extensions().add(new Certificate_Status_Request({}, {})); 155| 7.28k| } 156| | 157| 7.28k| add_tls12_supported_groups_extensions(policy); 158| | 159| 7.28k| m_data->extensions().add(new Signature_Algorithms(policy.acceptable_signature_schemes())); 160| 7.28k| if(auto cert_signing_prefs = policy.acceptable_certificate_signature_schemes()) { ------------------ | Branch (160:12): [True: 0, False: 7.28k] ------------------ 161| | // RFC 8446 4.2.3 162| | // TLS 1.2 implementations SHOULD also process this extension. 163| | // Implementations which have the same policy in both cases MAY omit 164| | // the "signature_algorithms_cert" extension. 165| 0| m_data->extensions().add(new Signature_Algorithms_Cert(std::move(cert_signing_prefs.value()))); 166| 0| } 167| | 168| 7.28k| if(reneg_info.empty() && !next_protocols.empty()) { ------------------ | Branch (168:7): [True: 7.28k, False: 0] | Branch (168:29): [True: 0, False: 7.28k] ------------------ 169| 0| m_data->extensions().add(new Application_Layer_Protocol_Notification(next_protocols)); 170| 0| } 171| | 172| 7.28k| if(m_data->legacy_version().is_datagram_protocol()) { ------------------ | Branch (172:7): [True: 0, False: 7.28k] ------------------ 173| 0| m_data->extensions().add(new SRTP_Protection_Profiles(policy.srtp_profiles())); 174| 0| } 175| | 176| | // NOLINTEND(*-owning-memory) 177| | 178| 7.28k| cb.tls_modify_extensions(m_data->extensions(), Connection_Side::Client, type()); 179| | 180| 7.28k| hash.update(io.send(*this)); 181| 7.28k|} _ZN5Botan3TLS19Client_Key_ExchangeC2ERNS0_12Handshake_IOERNS0_15Handshake_StateERKNS0_6PolicyERNS_19Credentials_ManagerEPKNS_10Public_KeyENSt3__117basic_string_viewIcNSE_11char_traitsIcEEEERNS_21RandomNumberGeneratorE: 63| 313| RandomNumberGenerator& rng) { 64| 313| const Kex_Algo kex_algo = state.ciphersuite().kex_method(); 65| | 66| 313| if(kex_algo == Kex_Algo::PSK) { ------------------ | Branch (66:7): [True: 15, False: 298] ------------------ 67| 15| std::string identity_hint; 68| | 69| 15| if(state.server_kex() != nullptr) { ------------------ | Branch (69:10): [True: 0, False: 15] ------------------ 70| 0| TLS_Data_Reader reader("ClientKeyExchange", state.server_kex()->params()); 71| 0| identity_hint = reader.get_string(2, 0, 65535); 72| 0| } 73| | 74| 15| m_psk_identity = creds.psk_identity("tls-client", std::string(hostname), identity_hint); 75| | 76| 15| append_tls_length_value(m_key_material, as_span_of_bytes(m_psk_identity.value()), 2); 77| | 78| 15| const SymmetricKey psk = creds.psk("tls-client", std::string(hostname), m_psk_identity.value()); 79| | 80| 15| if(psk.empty()) { ------------------ | Branch (80:10): [True: 0, False: 15] ------------------ 81| 0| throw TLS_Exception(Alert::InternalError, "Application did not provide a PSK for the negotiated identity"); 82| 0| } 83| | 84| 15| const std::vector zeros(psk.length()); 85| | 86| 15| append_tls_length_value(m_pre_master, zeros, 2); 87| 15| append_tls_length_value(m_pre_master, psk.bits_of(), 2); 88| 298| } else if(state.server_kex() != nullptr) { ------------------ | Branch (88:14): [True: 295, False: 3] ------------------ 89| 295| TLS_Data_Reader reader("ClientKeyExchange", state.server_kex()->params()); 90| | 91| 295| SymmetricKey psk; 92| | 93| 295| if(kex_algo == Kex_Algo::ECDHE_PSK) { ------------------ | Branch (93:10): [True: 0, False: 295] ------------------ 94| 0| const std::string identity_hint = reader.get_string(2, 0, 65535); 95| | 96| 0| m_psk_identity = creds.psk_identity("tls-client", std::string(hostname), identity_hint); 97| | 98| 0| append_tls_length_value(m_key_material, as_span_of_bytes(m_psk_identity.value()), 2); 99| | 100| 0| psk = creds.psk("tls-client", std::string(hostname), m_psk_identity.value()); 101| | 102| 0| if(psk.empty()) { ------------------ | Branch (102:13): [True: 0, False: 0] ------------------ 103| 0| throw TLS_Exception(Alert::InternalError, "Application did not provide a PSK for the negotiated identity"); 104| 0| } 105| 0| } 106| | 107| 295| if(kex_algo == Kex_Algo::DH) { ------------------ | Branch (107:10): [True: 295, False: 0] ------------------ 108| 295| const auto modulus = BigInt::from_bytes(reader.get_range(2, 1, 65535)); 109| 295| const auto generator = BigInt::from_bytes(reader.get_range(2, 1, 65535)); 110| 295| const std::vector peer_public_value = reader.get_range(2, 1, 65535); 111| | 112| 295| if(reader.remaining_bytes() > 0) { ------------------ | Branch (112:13): [True: 0, False: 295] ------------------ 113| 0| throw Decoding_Error("Bad params size for DH key exchange"); 114| 0| } 115| | 116| 295| if(modulus.bits() < policy.minimum_dh_group_size()) { ------------------ | Branch (116:13): [True: 81, False: 214] ------------------ 117| 81| throw TLS_Exception(Alert::InsufficientSecurity, "DH prime too small for policy"); 118| 81| } 119| 214| if(modulus.bits() > policy.maximum_dh_group_size()) { ------------------ | Branch (119:13): [True: 0, False: 214] ------------------ 120| 0| throw TLS_Exception(Alert::IllegalParameter, "DH prime too large for policy"); 121| 0| } 122| | 123| 214| const auto group = [&] { 124| 214| if(auto matched = match_well_known_dh_group(modulus, generator)) { 125| 214| return std::move(*matched); 126| 214| } else { 127| | /* 128| | * Even if we sent ffdhe groups in the supported_groups extension 129| | * a server may have replied with some other group. 130| | */ 131| 214| DL_Group ad_hoc(modulus, generator); 132| 214| if(!ad_hoc.verify_group(rng, false)) { 133| 214| throw TLS_Exception(Alert::InsufficientSecurity, "DH group validation failed"); 134| 214| } 135| 214| return ad_hoc; 136| 214| } 137| 214| }(); 138| | 139| 214| const auto private_key = state.callbacks().tls_generate_ephemeral_key(group, rng); 140| 214| m_pre_master = CT::strip_leading_zeros( 141| 214| state.callbacks().tls_ephemeral_key_agreement(group, *private_key, peer_public_value, rng, policy)); 142| 214| append_tls_length_value(m_key_material, private_key->public_value(), 2); 143| 214| } else if(kex_algo == Kex_Algo::ECDH || kex_algo == Kex_Algo::ECDHE_PSK) { ------------------ | Branch (143:17): [True: 0, False: 0] | Branch (143:47): [True: 0, False: 0] ------------------ 144| 0| const uint8_t curve_type = reader.get_byte(); 145| 0| if(curve_type != 3) { ------------------ | Branch (145:13): [True: 0, False: 0] ------------------ 146| 0| throw Decoding_Error("Server sent non-named ECC curve"); 147| 0| } 148| | 149| 0| const Group_Params curve_id = static_cast(reader.get_uint16_t()); 150| 0| const std::vector peer_public_value = reader.get_range(1, 1, 255); 151| | 152| 0| if(!curve_id.is_ecdh_named_curve() && !curve_id.is_x25519() && !curve_id.is_x448()) { ------------------ | Branch (152:13): [True: 0, False: 0] | Branch (152:48): [True: 0, False: 0] | Branch (152:73): [True: 0, False: 0] ------------------ 153| 0| throw TLS_Exception(Alert::IllegalParameter, 154| 0| "Server selected a group that is not compatible with the negotiated ciphersuite"); 155| 0| } 156| | 157| | // RFC 8422 5.1: the server MUST select a curve from the 158| | // supported_groups list the client offered. Check against the actual 159| | // offered list (which may be a strict subset of the policy's 160| | // key_exchange_groups() if the application narrowed it via 161| | // tls_modify_extensions) rather than just the policy. 162| 0| if(!value_exists(state.client_hello()->supported_ecc_curves(), curve_id)) { ------------------ | Branch (162:13): [True: 0, False: 0] ------------------ 163| 0| throw TLS_Exception(Alert::IllegalParameter, "Server selected a curve we did not offer"); 164| 0| } 165| | 166| 0| if(policy.choose_key_exchange_group({curve_id}, {}) != curve_id) { ------------------ | Branch (166:13): [True: 0, False: 0] ------------------ 167| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server sent ECC curve prohibited by policy"); 168| 0| } 169| | 170| 0| const auto private_key = [&] { 171| 0| if(curve_id.is_ecdh_named_curve()) { 172| 0| const auto pubkey_point_format = state.server_hello()->prefers_compressed_ec_points() 173| 0| ? EC_Point_Format::Compressed 174| 0| : EC_Point_Format::Uncompressed; 175| 0| return state.callbacks().tls12_generate_ephemeral_ecdh_key(curve_id, rng, pubkey_point_format); 176| 0| } else { 177| 0| return state.callbacks().tls_generate_ephemeral_key(curve_id, rng); 178| 0| } 179| 0| }(); 180| | 181| 0| if(!private_key) { ------------------ | Branch (181:13): [True: 0, False: 0] ------------------ 182| 0| throw TLS_Exception(Alert::InternalError, "Application did not provide an EC key"); 183| 0| } 184| | 185| 0| auto shared_secret = 186| 0| state.callbacks().tls_ephemeral_key_agreement(curve_id, *private_key, peer_public_value, rng, policy); 187| | 188| 0| if(kex_algo == Kex_Algo::ECDH) { ------------------ | Branch (188:13): [True: 0, False: 0] ------------------ 189| 0| m_pre_master = std::move(shared_secret); 190| 0| } else { 191| 0| append_tls_length_value(m_pre_master, shared_secret, 2); 192| 0| append_tls_length_value(m_pre_master, psk.bits_of(), 2); 193| 0| } 194| | 195| | // Note: In contrast to public_value(), raw_public_key_bits() takes the 196| | // point format (compressed vs. uncompressed) into account that was set 197| | // in its construction within tls_generate_ephemeral_key(). 198| 0| append_tls_length_value(m_key_material, private_key->raw_public_key_bits(), 1); 199| 0| } else { 200| 0| throw Internal_Error("Client_Key_Exchange: Unknown key exchange method was negotiated"); 201| 0| } 202| | 203| 214| reader.assert_done(); 204| 214| } else { 205| | // No server key exchange msg better mean RSA kex + RSA key in cert 206| | 207| 3| if(kex_algo != Kex_Algo::STATIC_RSA) { ------------------ | Branch (207:10): [True: 0, False: 3] ------------------ 208| 0| throw Unexpected_Message("No server kex message, but negotiated a key exchange that required it"); 209| 0| } 210| | 211| 3| if(server_public_key == nullptr) { ------------------ | Branch (211:10): [True: 0, False: 3] ------------------ 212| 0| throw Internal_Error("No server public key for RSA exchange"); 213| 0| } 214| | 215| 3| if(const auto* rsa_pub = dynamic_cast(server_public_key)) { ------------------ | Branch (215:22): [True: 3, False: 0] ------------------ 216| 3| const Protocol_Version offered_version = state.client_hello()->legacy_version(); 217| | 218| 3| rng.random_vec(m_pre_master, 48); 219| 3| m_pre_master[0] = offered_version.major_version(); 220| 3| m_pre_master[1] = offered_version.minor_version(); 221| | 222| 3| const PK_Encryptor_EME encryptor(*rsa_pub, rng, "PKCS1v15"); 223| | 224| 3| const std::vector encrypted_key = encryptor.encrypt(m_pre_master, rng); 225| | 226| 3| append_tls_length_value(m_key_material, encrypted_key, 2); 227| 3| } else { 228| 0| throw TLS_Exception(Alert::HandshakeFailure, 229| 0| "Expected a RSA key in server cert but got " + server_public_key->algo_name()); 230| 0| } 231| 3| } 232| | 233| 232| state.hash().update(io.send(*this)); 234| 232|} msg_client_kex.cpp:_ZZN5Botan3TLS19Client_Key_ExchangeC1ERNS0_12Handshake_IOERNS0_15Handshake_StateERKNS0_6PolicyERNS_19Credentials_ManagerEPKNS_10Public_KeyENSt3__117basic_string_viewIcNSE_11char_traitsIcEEEERNS_21RandomNumberGeneratorEENK3$_0clEv: 123| 214| const auto group = [&] { 124| 214| if(auto matched = match_well_known_dh_group(modulus, generator)) { ------------------ | Branch (124:21): [True: 0, False: 214] ------------------ 125| 0| return std::move(*matched); 126| 214| } else { 127| | /* 128| | * Even if we sent ffdhe groups in the supported_groups extension 129| | * a server may have replied with some other group. 130| | */ 131| 214| DL_Group ad_hoc(modulus, generator); 132| 214| if(!ad_hoc.verify_group(rng, false)) { ------------------ | Branch (132:19): [True: 173, False: 41] ------------------ 133| 173| throw TLS_Exception(Alert::InsufficientSecurity, "DH group validation failed"); 134| 173| } 135| 41| return ad_hoc; 136| 214| } 137| 214| }(); msg_client_kex.cpp:_ZN5Botan3TLS12_GLOBAL__N_125match_well_known_dh_groupERKNS_6BigIntES4_: 34| 214|std::optional match_well_known_dh_group(const BigInt& p, const BigInt& g) { 35| 214| const size_t p_bits = p.bits(); 36| | 37| 214| if(p_bits != 2048 && p_bits != 3072 && p_bits != 4096 && p_bits != 6144 && p_bits != 8192) { ------------------ | Branch (37:7): [True: 192, False: 22] | Branch (37:25): [True: 191, False: 1] | Branch (37:43): [True: 191, False: 0] | Branch (37:61): [True: 191, False: 0] | Branch (37:79): [True: 191, False: 0] ------------------ 38| 191| return {}; 39| 191| } 40| | 41| 46| for(const char* prefix : {"ffdhe/ietf", "modp/ietf"}) { ------------------ | Branch (41:27): [True: 46, False: 23] ------------------ 42| 46| const std::string name = fmt("{}/{}", prefix, p_bits); 43| 46| auto candidate = DL_Group::from_name(name); 44| 46| if(candidate.get_p() == p && candidate.get_g() == g) { ------------------ | Branch (44:10): [True: 0, False: 46] | Branch (44:36): [True: 0, False: 0] ------------------ 45| 0| return candidate; 46| 0| } 47| 46| } 48| | 49| 23| return std::nullopt; 50| 23|} _ZN5Botan3TLS11Finished_12C2ERNS0_12Handshake_IOERNS0_15Handshake_StateENS0_15Connection_SideE: 44| 56|Finished_12::Finished_12(Handshake_IO& io, Handshake_State& state, Connection_Side side) { 45| 56| m_verification_data = finished_compute_verify_12(state, side); 46| 56| state.hash().update(io.send(*this)); 47| 56|} _ZNK5Botan3TLS11Finished_126verifyERKNS0_15Handshake_StateENS0_15Connection_SideE: 49| 2|bool Finished_12::verify(const Handshake_State& state, Connection_Side side) const { 50| 2| std::vector computed_verify = finished_compute_verify_12(state, side); 51| | 52| 2|#if defined(BOTAN_UNSAFE_FUZZER_MODE) 53| 2| return true; 54| |#else 55| | return CT::is_equal(m_verification_data, computed_verify).as_bool(); 56| |#endif 57| 2|} msg_finished_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_126finished_compute_verify_12ERKNS0_15Handshake_StateENS0_15Connection_SideE: 23| 58|std::vector finished_compute_verify_12(const Handshake_State& state, Connection_Side side) { 24| 58| const uint8_t TLS_CLIENT_LABEL[] = { 25| 58| 0x63, 0x6C, 0x69, 0x65, 0x6E, 0x74, 0x20, 0x66, 0x69, 0x6E, 0x69, 0x73, 0x68, 0x65, 0x64}; 26| | 27| 58| const uint8_t TLS_SERVER_LABEL[] = { 28| 58| 0x73, 0x65, 0x72, 0x76, 0x65, 0x72, 0x20, 0x66, 0x69, 0x6E, 0x69, 0x73, 0x68, 0x65, 0x64}; 29| | 30| 58| auto prf = state.protocol_specific_prf(); 31| | 32| 58| std::vector input; 33| 58| std::vector label; 34| 58| label += (side == Connection_Side::Client) ? std::make_pair(TLS_CLIENT_LABEL, sizeof(TLS_CLIENT_LABEL)) ------------------ | Branch (34:13): [True: 56, False: 2] ------------------ 35| 58| : std::make_pair(TLS_SERVER_LABEL, sizeof(TLS_SERVER_LABEL)); 36| | 37| 58| input += state.hash().final(state.ciphersuite().prf_algo()); 38| | 39| 58| return unlock(prf->derive_key(12, state.session_keys().master_secret(), input, label)); 40| 58|} _ZN5Botan3TLS15Server_Hello_12C2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 149| 6.89k| Server_Hello_12(std::make_unique(buf)) {} _ZN5Botan3TLS15Server_Hello_12C2ENSt3__110unique_ptrINS0_21Server_Hello_InternalENS2_14default_deleteIS4_EEEE: 151| 5.61k|Server_Hello_12::Server_Hello_12(std::unique_ptr data) : Server_Hello_12_Shim(std::move(data)) {} _ZNK5Botan3TLS15Server_Hello_1220secure_renegotiationEv: 153| 5.31k|bool Server_Hello_12::secure_renegotiation() const { 154| 5.31k| return m_data->extensions().has(); 155| 5.31k|} _ZNK5Botan3TLS15Server_Hello_1218renegotiation_infoEv: 157| 3.31k|std::vector Server_Hello_12::renegotiation_info() const { 158| 3.31k| if(const Renegotiation_Extension* reneg = m_data->extensions().get()) { ------------------ | Branch (158:38): [True: 3.31k, False: 0] ------------------ 159| 3.31k| return reneg->renegotiation_info(); 160| 3.31k| } 161| 0| return std::vector(); 162| 3.31k|} _ZNK5Botan3TLS15Server_Hello_1231supports_extended_master_secretEv: 164| 5.37k|bool Server_Hello_12::supports_extended_master_secret() const { 165| 5.37k| return m_data->extensions().has(); 166| 5.37k|} _ZNK5Botan3TLS15Server_Hello_1225supports_encrypt_then_macEv: 168| 3.16k|bool Server_Hello_12::supports_encrypt_then_mac() const { 169| 3.16k| return m_data->extensions().has(); 170| 3.16k|} _ZNK5Botan3TLS15Server_Hello_1235supports_certificate_status_messageEv: 172| 659|bool Server_Hello_12::supports_certificate_status_message() const { 173| 659| return m_data->extensions().has(); 174| 659|} _ZNK5Botan3TLS15Server_Hello_1223supports_session_ticketEv: 176| 56|bool Server_Hello_12::supports_session_ticket() const { 177| 56| return m_data->extensions().has(); 178| 56|} _ZNK5Botan3TLS15Server_Hello_1212srtp_profileEv: 180| 5.31k|uint16_t Server_Hello_12::srtp_profile() const { 181| 5.31k| if(auto* srtp = m_data->extensions().get()) { ------------------ | Branch (181:13): [True: 0, False: 5.31k] ------------------ 182| 0| auto prof = srtp->profiles(); 183| 0| if(prof.size() != 1 || prof[0] == 0) { ------------------ | Branch (183:10): [True: 0, False: 0] | Branch (183:30): [True: 0, False: 0] ------------------ 184| 0| throw Decoding_Error("Server sent malformed DTLS-SRTP extension"); 185| 0| } 186| 0| return prof[0]; 187| 0| } 188| | 189| 5.31k| return 0; 190| 5.31k|} _ZNK5Botan3TLS15Server_Hello_1213next_protocolEv: 192| 5.31k|std::string Server_Hello_12::next_protocol() const { 193| 5.31k| if(auto* alpn = m_data->extensions().get()) { ------------------ | Branch (193:13): [True: 0, False: 5.31k] ------------------ 194| 0| return alpn->single_protocol(); 195| 0| } 196| 5.31k| return ""; 197| 5.31k|} _ZN5Botan3TLS17Server_Hello_DoneC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 216| 313|Server_Hello_Done::Server_Hello_Done(const std::vector& buf) { 217| 313| if(!buf.empty()) { ------------------ | Branch (217:7): [True: 0, False: 313] ------------------ 218| 0| throw Decoding_Error("Server_Hello_Done: Must be empty, and is not"); 219| 0| } 220| 313|} _ZN5Botan3TLS19Server_Key_ExchangeD2Ev: 26| 311|Server_Key_Exchange::~Server_Key_Exchange() = default; _ZN5Botan3TLS19Server_Key_ExchangeC2ERKNSt3__16vectorIhNS2_9allocatorIhEEEENS0_8Kex_AlgoENS0_11Auth_MethodENS0_16Protocol_VersionE: 154| 322| Protocol_Version version) { 155| 322| BOTAN_UNUSED(version); // remove this ------------------ | | 144| 322|#define BOTAN_UNUSED Botan::ignore_params ------------------ 156| 322| TLS_Data_Reader reader("ServerKeyExchange", buf); 157| | 158| | /* 159| | * Here we are deserializing enough to find out what offset the 160| | * signature is at. All processing is done when the Client Key Exchange 161| | * is prepared. 162| | */ 163| | 164| 322| if(kex_algo == Kex_Algo::PSK || kex_algo == Kex_Algo::ECDHE_PSK) { ------------------ | Branch (164:7): [True: 0, False: 322] | Branch (164:36): [True: 0, False: 322] ------------------ 165| 0| reader.get_string(2, 0, 65535); // identity hint 166| 0| } 167| | 168| 322| if(kex_algo == Kex_Algo::DH) { ------------------ | Branch (168:7): [True: 322, False: 0] ------------------ 169| | // 3 bigints, DH p, g, Y 170| | 171| 1.28k| for(size_t i = 0; i != 3; ++i) { ------------------ | Branch (171:25): [True: 965, False: 322] ------------------ 172| 965| reader.get_range(2, 1, 65535); 173| 965| } 174| 322| } else if(kex_algo == Kex_Algo::ECDH || kex_algo == Kex_Algo::ECDHE_PSK) { ------------------ | Branch (174:14): [True: 0, False: 0] | Branch (174:44): [True: 0, False: 0] ------------------ 175| 0| reader.get_byte(); // curve type 176| 0| reader.get_uint16_t(); // curve id 177| 0| reader.get_range(1, 1, 255); // public key 178| 0| } else if(kex_algo != Kex_Algo::PSK) { ------------------ | Branch (178:14): [True: 0, False: 0] ------------------ 179| 0| throw Decoding_Error("Server_Key_Exchange: Unsupported kex type " + kex_method_to_string(kex_algo)); 180| 0| } 181| | 182| 322| m_params.assign(buf.data(), buf.data() + reader.read_so_far()); 183| | 184| 322| if(auth_method != Auth_Method::IMPLICIT) { ------------------ | Branch (184:7): [True: 319, False: 3] ------------------ 185| 319| m_scheme = Signature_Scheme(reader.get_uint16_t()); 186| | // RFC 5246 4.7: digitally-signed signatures are opaque<1..2^16-1>. 187| | // Matches the parallel check in Certificate_Verify. 188| 319| m_signature = reader.get_range(2, 1, 65535); 189| 319| } 190| | 191| 322| reader.assert_done(); 192| 322|} _ZNK5Botan3TLS19Server_Key_Exchange6verifyERKNS_10Public_KeyERKNS0_15Handshake_StateERKNS0_6PolicyE: 217| 311| const Policy& policy) const { 218| 311| policy.check_peer_key_acceptable(server_key); 219| | 220| 311| const std::pair format = 221| 311| state.parse_sig_format(server_key, m_scheme, state.client_hello()->signature_schemes(), false, policy); 222| | 223| 311| std::vector buf = state.client_hello()->random(); 224| | 225| 311| buf += state.server_hello()->random(); 226| 311| buf += params(); 227| | 228| 311| const bool signature_valid = 229| 311| state.callbacks().tls_verify_message(server_key, format.first, format.second, buf, m_signature); 230| | 231| 311|#if defined(BOTAN_UNSAFE_FUZZER_MODE) 232| 311| BOTAN_UNUSED(signature_valid); ------------------ | | 144| 311|#define BOTAN_UNUSED Botan::ignore_params ------------------ 233| 311| return true; 234| |#else 235| | return signature_valid; 236| |#endif 237| 311|} _ZN5Botan3TLS21New_Session_Ticket_12C2ERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 28| 6|New_Session_Ticket_12::New_Session_Ticket_12(const std::vector& buf) { 29| 6| if(buf.size() < 6) { ------------------ | Branch (29:7): [True: 0, False: 6] ------------------ 30| 0| throw Decoding_Error("Session ticket message too short to be valid"); 31| 0| } 32| | 33| 6| TLS_Data_Reader reader("SessionTicket", buf); 34| | 35| 6| m_ticket_lifetime_hint = reader.get_uint32_t(); 36| 6| m_ticket = Session_Ticket(reader.get_range(2, 0, 65535)); 37| 6| reader.assert_done(); 38| 6|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_ModeD2Ev: 25| 30|TLS_CBC_HMAC_AEAD_Mode::~TLS_CBC_HMAC_AEAD_Mode() = default; _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_ModeC2ENS_10Cipher_DirENSt3__110unique_ptrINS_11BlockCipherENS3_14default_deleteIS5_EEEENS4_INS_25MessageAuthenticationCodeENS6_IS9_EEEEmmRKNS0_16Protocol_VersionEb: 37| 30| m_mac(std::move(mac)), 38| 30| m_cipher_name(cipher->name()), 39| 30| m_mac_name(m_mac->name()), 40| 30| m_cipher_keylen(cipher_keylen), 41| 30| m_block_size(cipher->block_size()), 42| 30| m_iv_size(m_block_size), 43| 30| m_mac_keylen(mac_keylen), 44| 30| m_tag_size(m_mac->output_length()), 45| 30| m_use_encrypt_then_mac(use_encrypt_then_mac), 46| 30| m_is_datagram(version.is_datagram_protocol()) { 47| 30| BOTAN_ASSERT_NOMSG(m_mac->valid_keylength(m_mac_keylen)); ------------------ | | 77| 30| do { \ | | 78| 30| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 30| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 30] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 30| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 30] | | ------------------ ------------------ 48| 30| BOTAN_ASSERT_NOMSG(cipher->valid_keylength(m_cipher_keylen)); ------------------ | | 77| 30| do { \ | | 78| 30| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 30| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 30] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 30| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 30] | | ------------------ ------------------ 49| | 50| 30| auto null_padding = std::make_unique(); 51| 30| if(dir == Cipher_Dir::Encryption) { ------------------ | Branch (51:7): [True: 23, False: 7] ------------------ 52| 23| m_cbc = std::make_unique(std::move(cipher), std::move(null_padding)); 53| 23| } else { 54| 7| m_cbc = std::make_unique(std::move(cipher), std::move(null_padding)); 55| 7| } 56| 30|} _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode18valid_nonce_lengthEm: 82| 44|bool TLS_CBC_HMAC_AEAD_Mode::valid_nonce_length(size_t nl) const { 83| 44| if(m_cbc_state.empty()) { ------------------ | Branch (83:7): [True: 25, False: 19] ------------------ 84| 25| return nl == block_size(); 85| 25| } 86| 19| return nl == iv_size(); 87| 44|} _ZNK5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode8key_specEv: 89| 30|Key_Length_Specification TLS_CBC_HMAC_AEAD_Mode::key_spec() const { 90| 30| return Key_Length_Specification(m_cipher_keylen + m_mac_keylen); 91| 30|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 97| 30|void TLS_CBC_HMAC_AEAD_Mode::key_schedule(std::span key) { 98| | // Both keys are of fixed length specified by the ciphersuite 99| | 100| 30| if(key.size() != m_cipher_keylen + m_mac_keylen) { ------------------ | Branch (100:7): [True: 0, False: 30] ------------------ 101| 0| throw Invalid_Key_Length(name(), key.size()); 102| 0| } 103| | 104| 30| mac().set_key(key.first(m_mac_keylen)); 105| 30| cbc().set_key(key.subspan(m_mac_keylen, m_cipher_keylen)); 106| 30|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode9start_msgEPKhm: 108| 44|void TLS_CBC_HMAC_AEAD_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) { 109| 44| if(!valid_nonce_length(nonce_len)) { ------------------ | Branch (109:7): [True: 0, False: 44] ------------------ 110| 0| throw Invalid_IV_Length(name(), nonce_len); 111| 0| } 112| | 113| 44| m_msg.clear(); 114| | 115| 44| if(nonce_len > 0) { ------------------ | Branch (115:7): [True: 44, False: 0] ------------------ 116| 44| m_cbc_state.assign(nonce, nonce + nonce_len); 117| 44| } 118| 44|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode11process_msgEPhm: 120| 44|size_t TLS_CBC_HMAC_AEAD_Mode::process_msg(uint8_t buf[], size_t sz) { 121| 44| m_msg.insert(m_msg.end(), buf, buf + sz); 122| 44| return 0; 123| 44|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode19assoc_data_with_lenEt: 125| 2|std::vector TLS_CBC_HMAC_AEAD_Mode::assoc_data_with_len(uint16_t len) { 126| 2| std::vector ad = m_ad; 127| 2| BOTAN_ASSERT(ad.size() == 13, "Expected AAD size"); ------------------ | | 64| 2| do { \ | | 65| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 2| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 2] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 2| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 2] | | ------------------ ------------------ 128| 2| ad[11] = get_byte<0>(len); 129| 2| ad[12] = get_byte<1>(len); 130| 2| return ad; 131| 2|} _ZN5Botan3TLS22TLS_CBC_HMAC_AEAD_Mode21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 133| 44|void TLS_CBC_HMAC_AEAD_Mode::set_associated_data_n(size_t idx, std::span ad) { 134| 44| BOTAN_ARG_CHECK(idx == 0, "TLS 1.2 CBC/HMAC: cannot handle non-zero index in set_associated_data_n"); ------------------ | | 35| 44| do { \ | | 36| 44| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 44| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 44] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 44| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 44] | | ------------------ ------------------ 135| 44| if(ad.size() != 13) { ------------------ | Branch (135:7): [True: 0, False: 44] ------------------ 136| 0| throw Invalid_Argument("Invalid TLS AEAD associated data length"); 137| 0| } 138| 44| m_ad.assign(ad.begin(), ad.end()); 139| 44|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_EncryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS2_14default_deleteIS4_EEEENS3_INS_25MessageAuthenticationCodeENS5_IS8_EEEEmmRKNS0_16Protocol_VersionEb: 147| 23| TLS_CBC_HMAC_AEAD_Mode(Cipher_Dir::Encryption, 148| 23| std::move(cipher), 149| 23| std::move(mac), 150| 23| cipher_keylen, 151| 23| mac_keylen, 152| 23| version, 153| 23| use_encrypt_then_mac) {} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Encryption21set_associated_data_nEmNSt3__14spanIKhLm18446744073709551615EEE: 155| 42|void TLS_CBC_HMAC_AEAD_Encryption::set_associated_data_n(size_t idx, std::span ad) { 156| 42| TLS_CBC_HMAC_AEAD_Mode::set_associated_data_n(idx, ad); 157| | 158| 42| if(use_encrypt_then_mac()) { ------------------ | Branch (158:7): [True: 0, False: 42] ------------------ 159| | // AAD hack for EtM 160| | // EtM uses ciphertext size instead of plaintext size for AEAD input 161| 0| const uint16_t pt_size = make_uint16(assoc_data()[11], assoc_data()[12]); 162| 0| const uint16_t enc_size = static_cast(round_up(iv_size() + pt_size + 1, block_size())); 163| 0| assoc_data()[11] = get_byte<0, uint16_t>(enc_size); 164| 0| assoc_data()[12] = get_byte<1, uint16_t>(enc_size); 165| 0| } 166| 42|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Encryption18cbc_encrypt_recordERNSt3__16vectorIhNS_16secure_allocatorIhEEEEmm: 170| 42| size_t padding_length) { 171| | // We always do short padding: 172| 42| BOTAN_ASSERT_NOMSG(padding_length <= 16); ------------------ | | 77| 42| do { \ | | 78| 42| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 42| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 42] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 42| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 42] | | ------------------ ------------------ 173| | 174| 42| buffer.resize(buffer.size() + padding_length); 175| | 176| 42| const uint8_t padding_val = static_cast(padding_length - 1); 177| | 178| 42| CT::poison(&padding_val, 1); 179| 42| CT::poison(&padding_length, 1); 180| 42| CT::poison(buffer.data(), buffer.size()); 181| | 182| 42| const size_t last_block_starts = buffer.size() - block_size(); 183| 42| const size_t padding_starts = buffer.size() - padding_length; 184| 690| for(size_t i = last_block_starts; i != buffer.size(); ++i) { ------------------ | Branch (184:38): [True: 648, False: 42] ------------------ 185| 648| auto add_padding = CT::Mask(CT::Mask::is_gte(i, padding_starts)); 186| 648| buffer[i] = add_padding.select(padding_val, buffer[i]); 187| 648| } 188| | 189| 42| CT::unpoison(padding_val); 190| 42| CT::unpoison(padding_length); 191| 42| CT::unpoison(buffer.data(), buffer.size()); 192| | 193| 42| cbc().start(cbc_state()); 194| 42| cbc().process(&buffer[offset], buffer.size() - offset); 195| | 196| 42| cbc_state().assign(buffer.data() + (buffer.size() - block_size()), buffer.data() + buffer.size()); 197| 42|} _ZNK5Botan3TLS28TLS_CBC_HMAC_AEAD_Encryption13output_lengthEm: 199| 42|size_t TLS_CBC_HMAC_AEAD_Encryption::output_length(size_t input_length) const { 200| 42| return round_up(input_length + 1 + (use_encrypt_then_mac() ? 0 : tag_size()), block_size()) + ------------------ | Branch (200:40): [True: 0, False: 42] ------------------ 201| 42| (use_encrypt_then_mac() ? tag_size() : 0); ------------------ | Branch (201:12): [True: 0, False: 42] ------------------ 202| 42|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Encryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 204| 42|void TLS_CBC_HMAC_AEAD_Encryption::finish_msg(secure_vector& buffer, size_t offset) { 205| 42| update(buffer, offset); 206| | 207| 42| const size_t msg_size = msg().size(); 208| | 209| 42| const size_t input_size = msg_size + 1 + (use_encrypt_then_mac() ? 0 : tag_size()); ------------------ | Branch (209:46): [True: 0, False: 42] ------------------ 210| 42| const size_t enc_size = round_up(input_size, block_size()); 211| 42| BOTAN_DEBUG_ASSERT(enc_size % block_size() == 0); ------------------ | | 130| 42| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 42| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 42] | | ------------------ ------------------ 212| | 213| 42| const uint8_t padding_val = static_cast(enc_size - input_size); 214| 42| const size_t padding_length = static_cast(padding_val) + 1; 215| | 216| 42| buffer.reserve(offset + msg_size + padding_length + tag_size()); 217| 42| buffer.resize(offset + msg_size); 218| 42| if(msg_size > 0) { ------------------ | Branch (218:7): [True: 42, False: 0] ------------------ 219| 42| copy_mem(&buffer[offset], msg().data(), msg_size); 220| 42| } 221| | 222| 42| mac().update(assoc_data()); 223| | 224| 42| if(use_encrypt_then_mac()) { ------------------ | Branch (224:7): [True: 0, False: 42] ------------------ 225| 0| if(iv_size() > 0) { ------------------ | Branch (225:10): [True: 0, False: 0] ------------------ 226| 0| mac().update(cbc_state()); 227| 0| } 228| | 229| 0| cbc_encrypt_record(buffer, offset, padding_length); 230| 0| mac().update(&buffer[offset], enc_size); 231| 0| buffer.resize(buffer.size() + tag_size()); 232| 0| mac().final(&buffer[buffer.size() - tag_size()]); 233| 42| } else { 234| 42| if(msg_size > 0) { ------------------ | Branch (234:10): [True: 42, False: 0] ------------------ 235| 42| mac().update(&buffer[offset], msg_size); 236| 42| } 237| 42| buffer.resize(buffer.size() + tag_size()); 238| 42| mac().final(&buffer[buffer.size() - tag_size()]); 239| 42| cbc_encrypt_record(buffer, offset, padding_length); 240| 42| } 241| 42|} _ZN5Botan3TLS21check_tls_cbc_paddingEPKhm: 254| 2|uint16_t check_tls_cbc_padding(const uint8_t record[], size_t record_len) { 255| 2| if(record_len == 0 || record_len > 0xFFFF) { ------------------ | Branch (255:7): [True: 0, False: 2] | Branch (255:26): [True: 0, False: 2] ------------------ 256| 0| return 0; 257| 0| } 258| | 259| 2| const uint16_t rec16 = static_cast(record_len); 260| | 261| | /* 262| | * TLS v1.0 and up require all the padding bytes be the same value 263| | * and allows up to 255 bytes. 264| | */ 265| | 266| 2| const uint16_t to_check = std::min(256, static_cast(record_len)); 267| 2| const uint8_t pad_byte = record[record_len - 1]; 268| 2| const uint16_t pad_bytes = 1 + pad_byte; 269| | 270| 2| auto pad_invalid = CT::Mask::is_lt(rec16, pad_bytes); 271| | 272| 306| for(uint16_t i = rec16 - to_check; i != rec16; ++i) { ------------------ | Branch (272:39): [True: 304, False: 2] ------------------ 273| 304| const uint16_t offset = rec16 - i; 274| 304| const auto in_pad_range = CT::Mask::is_lte(offset, pad_bytes); 275| 304| const auto pad_correct = CT::Mask::is_equal(record[i], pad_byte); 276| 304| pad_invalid |= in_pad_range & ~pad_correct; 277| 304| } 278| | 279| 2| return pad_invalid.if_not_set_return(pad_bytes); 280| 2|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_DecryptionC2ENSt3__110unique_ptrINS_11BlockCipherENS2_14default_deleteIS4_EEEENS3_INS_25MessageAuthenticationCodeENS5_IS8_EEEEmmRKNS0_16Protocol_VersionEb: 288| 7| TLS_CBC_HMAC_AEAD_Mode(Cipher_Dir::Decryption, 289| 7| std::move(cipher), 290| 7| std::move(mac), 291| 7| cipher_keylen, 292| 7| mac_keylen, 293| 7| version, 294| 7| use_encrypt_then_mac) {} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption18cbc_decrypt_recordEPhm: 296| 2|void TLS_CBC_HMAC_AEAD_Decryption::cbc_decrypt_record(uint8_t record_contents[], size_t record_len) { 297| 2| if(record_len == 0 || record_len % block_size() != 0) { ------------------ | Branch (297:7): [True: 0, False: 2] | Branch (297:26): [True: 0, False: 2] ------------------ 298| 0| throw Decoding_Error("Received TLS CBC ciphertext with invalid length"); 299| 0| } 300| | 301| 2| cbc().start(cbc_state()); 302| 2| cbc_state().assign(record_contents + record_len - block_size(), record_contents + record_len); 303| | 304| 2| cbc().process(record_contents, record_len); 305| 2|} _ZNK5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption13output_lengthEm: 307| 2|size_t TLS_CBC_HMAC_AEAD_Decryption::output_length(size_t /*input_length*/) const { 308| | /* 309| | * We don't know this because the padding is arbitrary 310| | */ 311| 2| return 0; 312| 2|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption31perform_additional_compressionsEmm: 356| 2|void TLS_CBC_HMAC_AEAD_Decryption::perform_additional_compressions(size_t plen, size_t padlen) { 357| 2| const bool is_sha384 = mac().name() == "HMAC(SHA-384)"; 358| 2| const uint16_t block_size = is_sha384 ? 128 : 64; ------------------ | Branch (358:32): [True: 1, False: 1] ------------------ 359| 2| const uint16_t max_bytes_in_first_block = is_sha384 ? 111 : 55; ------------------ | Branch (359:46): [True: 1, False: 1] ------------------ 360| | 361| | // number of maximum MACed bytes 362| 2| const uint16_t L1 = static_cast(13 + plen - tag_size()); 363| | // number of current MACed bytes (L1 - padlen) 364| | // Here the Lucky 13 paper is different because the padlen length in the paper 365| | // does not count the last message byte. 366| 2| const uint16_t L2 = static_cast(13 + plen - padlen - tag_size()); 367| | // From the paper, for SHA-256/SHA-1 compute: ceil((L1-55)/64) and ceil((L2-55)/64) 368| | // ceil((L1-55)/64) = floor((L1+64-1-55)/64) 369| | // Here we compute number of compressions for SHA-* in general 370| 2| const uint16_t max_compresssions = ((L1 + block_size - 1 - max_bytes_in_first_block) / block_size); 371| 2| const uint16_t current_compressions = ((L2 + block_size - 1 - max_bytes_in_first_block) / block_size); 372| | // number of additional compressions we have to perform 373| 2| const uint16_t add_compressions = max_compresssions - current_compressions; 374| 2| const uint16_t equal = CT::Mask::is_equal(max_compresssions, current_compressions).if_set_return(1); 375| | // We compute the data length we need to achieve the number of compressions. 376| | // If there are no compressions, we just add 55/111 dummy bytes so that no 377| | // compression is performed. 378| 2| const uint16_t data_len = block_size * add_compressions + equal * max_bytes_in_first_block; 379| 2| std::vector data(data_len); 380| 2| mac().update(data); 381| | // we do not need to clear the MAC since the connection is broken anyway 382| 2|} _ZN5Botan3TLS28TLS_CBC_HMAC_AEAD_Decryption10finish_msgERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 384| 2|void TLS_CBC_HMAC_AEAD_Decryption::finish_msg(secure_vector& buffer, size_t offset) { 385| 2| update(buffer, offset); 386| 2| buffer.resize(offset); 387| | 388| 2| const size_t record_len = msg().size(); 389| 2| uint8_t* record_contents = msg().data(); 390| | 391| | // This early exit does not leak info because all the values compared are public 392| 2| if(record_len < tag_size() || (record_len - (use_encrypt_then_mac() ? tag_size() : 0)) % block_size() != 0) { ------------------ | Branch (392:7): [True: 0, False: 2] | Branch (392:34): [True: 0, False: 2] | Branch (392:49): [True: 0, False: 2] ------------------ 393| 0| throw TLS_Exception(Alert::BadRecordMac, "Message authentication failure"); 394| 0| } 395| | 396| 2| if(use_encrypt_then_mac()) { ------------------ | Branch (396:7): [True: 0, False: 2] ------------------ 397| 0| const size_t enc_size = record_len - tag_size(); 398| 0| const size_t enc_iv_size = enc_size + iv_size(); 399| | 400| 0| BOTAN_ASSERT_NOMSG(enc_iv_size <= 0xFFFF); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 401| | 402| 0| mac().update(assoc_data_with_len(static_cast(enc_iv_size))); 403| 0| if(iv_size() > 0) { ------------------ | Branch (403:10): [True: 0, False: 0] ------------------ 404| 0| mac().update(cbc_state()); 405| 0| } 406| 0| mac().update(record_contents, enc_size); 407| | 408| 0| std::vector mac_buf(tag_size()); 409| 0| mac().final(mac_buf.data()); 410| | 411| 0| const size_t mac_offset = enc_size; 412| | 413| 0| const auto mac_ok = CT::is_equal(&record_contents[mac_offset], mac_buf.data(), tag_size()); 414| | 415| 0| if(!mac_ok.as_bool()) { ------------------ | Branch (415:10): [True: 0, False: 0] ------------------ 416| 0| throw TLS_Exception(Alert::BadRecordMac, "Message authentication failure"); 417| 0| } 418| | 419| 0| cbc_decrypt_record(record_contents, enc_size); 420| | 421| | // 0 if padding was invalid, otherwise 1 + padding_bytes 422| 0| const uint16_t pad_size = check_tls_cbc_padding(record_contents, enc_size); 423| | 424| | // No oracle here, whoever sent us this had the key since MAC check passed 425| 0| if(pad_size == 0) { ------------------ | Branch (425:10): [True: 0, False: 0] ------------------ 426| 0| throw TLS_Exception(Alert::BadRecordMac, "Message authentication failure"); 427| 0| } 428| | 429| 0| const uint8_t* plaintext_block = &record_contents[0]; 430| 0| const size_t plaintext_length = enc_size - pad_size; 431| | 432| 0| buffer.insert(buffer.end(), plaintext_block, plaintext_block + plaintext_length); 433| 2| } else { 434| 2| cbc_decrypt_record(record_contents, record_len); 435| | 436| 2| CT::poison(record_contents, record_len); 437| | 438| | // 0 if padding was invalid, otherwise 1 + padding_bytes 439| 2| uint16_t pad_size = check_tls_cbc_padding(record_contents, record_len); 440| | 441| | /* 442| | This mask is zero if there is not enough room in the packet to get a valid MAC. 443| | 444| | We have to accept empty packets, since otherwise we are not compatible 445| | with how OpenSSL's countermeasure for fixing BEAST in TLS 1.0 CBC works 446| | (sending empty records, instead of 1/(n-1) splitting) 447| | */ 448| | 449| | // We know the cast cannot overflow as pad_size <= 256 && tag_size <= 32 450| 2| const auto size_ok_mask = 451| 2| CT::Mask::is_lte(static_cast(tag_size() + pad_size), static_cast(record_len)); 452| | 453| 2| pad_size = size_ok_mask.if_set_return(pad_size); 454| | 455| 2| CT::unpoison(record_contents, record_len); 456| | 457| | /* 458| | This is unpoisoned sooner than it should. The pad_size leaks to plaintext_length and 459| | then to the timing channel in the MAC computation described in the Lucky 13 paper. 460| | */ 461| 2| CT::unpoison(pad_size); 462| | 463| 2| const uint8_t* plaintext_block = &record_contents[0]; 464| 2| const uint16_t plaintext_length = static_cast(record_len - tag_size() - pad_size); 465| | 466| 2| mac().update(assoc_data_with_len(plaintext_length)); 467| 2| mac().update(plaintext_block, plaintext_length); 468| | 469| 2| std::vector mac_buf(tag_size()); 470| 2| mac().final(mac_buf.data()); 471| | 472| 2| const size_t mac_offset = record_len - (tag_size() + pad_size); 473| | 474| 2| const auto mac_ok = CT::is_equal(&record_contents[mac_offset], mac_buf.data(), tag_size()); 475| | 476| 2| const auto ok_mask = size_ok_mask & CT::Mask::expand(mac_ok) & CT::Mask::expand(pad_size); 477| | 478| 2| CT::unpoison(ok_mask); 479| | 480| 2| if(ok_mask.as_bool()) { ------------------ | Branch (480:10): [True: 0, False: 2] ------------------ 481| 0| buffer.insert(buffer.end(), plaintext_block, plaintext_block + plaintext_length); 482| 2| } else { 483| 2| perform_additional_compressions(record_len, pad_size); 484| | 485| | /* 486| | * In DTLS case we have to finish computing the MAC since we require the 487| | * MAC state be reset for future packets. This extra timing channel may 488| | * be exploitable in a Lucky13 variant. 489| | */ 490| 2| if(is_datagram_protocol()) { ------------------ | Branch (490:13): [True: 0, False: 2] ------------------ 491| 0| mac().final(mac_buf); 492| 0| } 493| 2| throw TLS_Exception(Alert::BadRecordMac, "Message authentication failure"); 494| 2| } 495| 2| } 496| 2|} _ZN5Botan3TLS15Channel_Impl_12C2ERKNSt3__110shared_ptrINS0_9CallbacksEEERKNS3_INS0_15Session_ManagerEEERKNS3_INS_21RandomNumberGeneratorEEERKNS3_IKNS0_6PolicyEEEbbm: 34| 7.28k| m_is_server(is_server), 35| 7.28k| m_is_datagram(is_datagram), 36| 7.28k| m_callbacks(callbacks), 37| 7.28k| m_session_manager(session_manager), 38| 7.28k| m_policy(policy), 39| 7.28k| m_rng(rng), 40| 7.28k| m_has_been_closed(false) { 41| 7.28k| BOTAN_ASSERT_NONNULL(m_callbacks); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 42| 7.28k| BOTAN_ASSERT_NONNULL(m_session_manager); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 43| 7.28k| BOTAN_ASSERT_NONNULL(m_rng); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 44| 7.28k| BOTAN_ASSERT_NONNULL(m_policy); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 45| | 46| | /* epoch 0 is plaintext, thus null cipher state */ 47| 7.28k| m_write_cipher_states[0] = nullptr; 48| 7.28k| m_read_cipher_states[0] = nullptr; 49| | 50| 7.28k| m_writebuf.reserve(reserved_io_buffer_size); 51| 7.28k| m_readbuf.reserve(reserved_io_buffer_size); 52| 7.28k|} _ZN5Botan3TLS15Channel_Impl_1211reset_stateEv: 54| 7.13k|void Channel_Impl_12::reset_state() { 55| 7.13k| m_active_state.reset(); 56| 7.13k| m_pending_state.reset(); 57| 7.13k| m_readbuf.clear(); 58| 7.13k| m_write_cipher_states.clear(); 59| 7.13k| m_read_cipher_states.clear(); 60| 7.13k|} _ZN5Botan3TLS15Channel_Impl_12D2Ev: 77| 7.28k|Channel_Impl_12::~Channel_Impl_12() = default; _ZNK5Botan3TLS15Channel_Impl_1216sequence_numbersEv: 79| 29.3k|Connection_Sequence_Numbers& Channel_Impl_12::sequence_numbers() const { 80| 29.3k| BOTAN_ASSERT(m_sequence_numbers, "Have a sequence numbers object"); ------------------ | | 64| 29.3k| do { \ | | 65| 29.3k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 29.3k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 29.3k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 29.3k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 29.3k] | | ------------------ ------------------ 81| 29.3k| return *m_sequence_numbers; 82| 29.3k|} _ZNK5Botan3TLS15Channel_Impl_1223read_cipher_state_epochEt: 84| 2|std::shared_ptr Channel_Impl_12::read_cipher_state_epoch(uint16_t epoch) const { 85| 2| auto i = m_read_cipher_states.find(epoch); 86| 2| if(i == m_read_cipher_states.end()) { ------------------ | Branch (86:7): [True: 0, False: 2] ------------------ 87| 0| throw Internal_Error("TLS::Channel_Impl_12 No read cipherstate for epoch " + std::to_string(epoch)); 88| 0| } 89| 2| return i->second; 90| 2|} _ZNK5Botan3TLS15Channel_Impl_1224write_cipher_state_epochEt: 92| 14.5k|std::shared_ptr Channel_Impl_12::write_cipher_state_epoch(uint16_t epoch) const { 93| 14.5k| auto i = m_write_cipher_states.find(epoch); 94| 14.5k| if(i == m_write_cipher_states.end()) { ------------------ | Branch (94:7): [True: 0, False: 14.5k] ------------------ 95| 0| throw Internal_Error("TLS::Channel_Impl_12 No write cipherstate for epoch " + std::to_string(epoch)); 96| 0| } 97| 14.5k| return i->second; 98| 14.5k|} _ZNK5Botan3TLS15Channel_Impl_1221external_psk_identityEv: 107| 2|std::optional Channel_Impl_12::external_psk_identity() const { 108| 2| if(m_active_state.has_value()) { ------------------ | Branch (108:7): [True: 0, False: 2] ------------------ 109| 0| return m_active_state->psk_identity(); 110| 0| } 111| 2| if(const auto* state = pending_state()) { ------------------ | Branch (111:19): [True: 2, False: 0] ------------------ 112| 2| return state->psk_identity(); 113| 2| } 114| 0| return std::nullopt; 115| 2|} _ZN5Botan3TLS15Channel_Impl_1222create_handshake_stateENS0_16Protocol_VersionE: 117| 7.28k|Handshake_State& Channel_Impl_12::create_handshake_state(Protocol_Version version) { 118| 7.28k| if(pending_state() != nullptr) { ------------------ | Branch (118:7): [True: 0, False: 7.28k] ------------------ 119| 0| throw Internal_Error("create_handshake_state called during handshake"); 120| 0| } 121| | 122| 7.28k| if(m_active_state.has_value()) { ------------------ | Branch (122:7): [True: 0, False: 7.28k] ------------------ 123| 0| const Protocol_Version active_version = m_active_state->version(); 124| | 125| 0| if(active_version.is_datagram_protocol() != version.is_datagram_protocol()) { ------------------ | Branch (125:10): [True: 0, False: 0] ------------------ 126| 0| throw TLS_Exception(Alert::ProtocolVersion, 127| 0| "Active state using version " + active_version.to_string() + " cannot change to " + 128| 0| version.to_string() + " in pending"); 129| 0| } 130| 0| } 131| | 132| 7.28k| if(!m_sequence_numbers) { ------------------ | Branch (132:7): [True: 7.28k, False: 0] ------------------ 133| 7.28k| if(version.is_datagram_protocol()) { ------------------ | Branch (133:10): [True: 0, False: 7.28k] ------------------ 134| 0| m_sequence_numbers = std::make_unique(); 135| 7.28k| } else { 136| 7.28k| m_sequence_numbers = std::make_unique(); 137| 7.28k| } 138| 7.28k| } 139| | 140| 7.28k| using namespace std::placeholders; 141| | 142| 7.28k| std::unique_ptr io; 143| 7.28k| if(version.is_datagram_protocol()) { ------------------ | Branch (143:7): [True: 0, False: 7.28k] ------------------ 144| 0| const uint16_t mtu = static_cast(policy().dtls_default_mtu()); 145| 0| const size_t initial_timeout_ms = policy().dtls_initial_timeout(); 146| 0| const size_t max_timeout_ms = policy().dtls_maximum_timeout(); 147| | 148| 0| auto send_record_f = [this](uint16_t epoch, Record_Type record_type, const std::vector& record) { 149| 0| send_record_under_epoch(epoch, record_type, record); 150| 0| }; 151| 0| io = std::make_unique(send_record_f, 152| 0| sequence_numbers(), 153| 0| mtu, 154| 0| initial_timeout_ms, 155| 0| max_timeout_ms, 156| 0| policy().maximum_handshake_message_size()); 157| 7.28k| } else { 158| 7.28k| auto send_record_f = [this](Record_Type rec_type, const std::vector& record) { 159| 7.28k| send_record(rec_type, record); 160| 7.28k| }; 161| 7.28k| io = std::make_unique(send_record_f); 162| 7.28k| } 163| | 164| 7.28k| m_pending_state = new_handshake_state(std::move(io)); 165| | 166| 7.28k| if(m_active_state.has_value()) { ------------------ | Branch (166:7): [True: 0, False: 7.28k] ------------------ 167| 0| m_pending_state->set_version(m_active_state->version()); 168| 0| } 169| | 170| 7.28k| return *m_pending_state; 171| 7.28k|} _ZN5Botan3TLS15Channel_Impl_1225change_cipher_spec_readerENS0_15Connection_SideE: 202| 7|void Channel_Impl_12::change_cipher_spec_reader(Connection_Side side) { 203| 7| const auto* pending = pending_state(); 204| | 205| 7| BOTAN_ASSERT(pending && pending->server_hello(), "Have received server hello"); ------------------ | | 64| 7| do { \ | | 65| 7| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 14| if(!(expr)) { \ | | ------------------ | | | Branch (66:12): [True: 7, False: 0] | | | Branch (66:12): [True: 7, False: 0] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 7| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 7] | | ------------------ ------------------ 206| | 207| 7| if(pending->server_hello()->compression_method() != 0) { ------------------ | Branch (207:7): [True: 0, False: 7] ------------------ 208| 0| throw Internal_Error("Negotiated unknown compression algorithm"); 209| 0| } 210| | 211| 7| sequence_numbers().new_read_cipher_state(); 212| | 213| 7| const uint16_t epoch = sequence_numbers().current_read_epoch(); 214| | 215| 7| BOTAN_ASSERT(!m_read_cipher_states.contains(epoch), "No read cipher state currently set for next epoch"); ------------------ | | 64| 7| do { \ | | 65| 7| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 7| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 7] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 7| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 7] | | ------------------ ------------------ 216| | 217| | // flip side as we are reading 218| 7| auto read_state = std::make_shared( 219| 7| pending->version(), 220| 7| (side == Connection_Side::Client) ? Connection_Side::Server : Connection_Side::Client, ------------------ | Branch (220:7): [True: 7, False: 0] ------------------ 221| 7| false, 222| 7| pending->ciphersuite(), 223| 7| pending->session_keys(), 224| 7| pending->server_hello()->supports_encrypt_then_mac()); 225| | 226| 7| m_read_cipher_states[epoch] = read_state; 227| 7|} _ZN5Botan3TLS15Channel_Impl_1225change_cipher_spec_writerENS0_15Connection_SideE: 229| 56|void Channel_Impl_12::change_cipher_spec_writer(Connection_Side side) { 230| 56| const auto* pending = pending_state(); 231| | 232| 56| BOTAN_ASSERT(pending && pending->server_hello(), "Have received server hello"); ------------------ | | 64| 56| do { \ | | 65| 56| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 112| if(!(expr)) { \ | | ------------------ | | | Branch (66:12): [True: 56, False: 0] | | | Branch (66:12): [True: 56, False: 0] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 56| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 56] | | ------------------ ------------------ 233| | 234| 56| if(pending->server_hello()->compression_method() != 0) { ------------------ | Branch (234:7): [True: 0, False: 56] ------------------ 235| 0| throw Internal_Error("Negotiated unknown compression algorithm"); 236| 0| } 237| | 238| 56| sequence_numbers().new_write_cipher_state(); 239| | 240| 56| const uint16_t epoch = sequence_numbers().current_write_epoch(); 241| | 242| 56| BOTAN_ASSERT(!m_write_cipher_states.contains(epoch), "No write cipher state currently set for next epoch"); ------------------ | | 64| 56| do { \ | | 65| 56| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 56| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 56] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 56| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 56] | | ------------------ ------------------ 243| | 244| 56| auto write_state = std::make_shared(pending->version(), 245| 56| side, 246| 56| true, 247| 56| pending->ciphersuite(), 248| 56| pending->session_keys(), 249| 56| pending->server_hello()->supports_encrypt_then_mac()); 250| | 251| 56| m_write_cipher_states[epoch] = write_state; 252| 56|} _ZNK5Botan3TLS15Channel_Impl_129is_closedEv: 262| 7.55k|bool Channel_Impl_12::is_closed() const { 263| 7.55k| return m_has_been_closed; 264| 7.55k|} _ZN5Botan3TLS15Channel_Impl_1216activate_sessionEv: 266| 2|void Channel_Impl_12::activate_session() { 267| 2| BOTAN_ASSERT_NONNULL(m_pending_state); ------------------ | | 116| 2| do { \ | | 117| 2| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 2] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 2| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 2] | | ------------------ ------------------ 268| | 269| 2| const auto& state = *m_pending_state; 270| | 271| 2| if(!state.version().is_datagram_protocol()) { ------------------ | Branch (271:7): [True: 2, False: 0] ------------------ 272| | // TLS is easy just remove all but the current state 273| 2| const uint16_t current_epoch = sequence_numbers().current_write_epoch(); 274| | 275| 2| const auto not_current_epoch = [current_epoch](uint16_t epoch) { return (epoch != current_epoch); }; 276| | 277| 2| map_remove_if(not_current_epoch, m_write_cipher_states); 278| 2| map_remove_if(not_current_epoch, m_read_cipher_states); 279| 2| } 280| | 281| | // For DTLS, keep the handshake IO for last-flight retransmission. 282| 2| if(m_is_datagram) { ------------------ | Branch (282:7): [True: 0, False: 2] ------------------ 283| 0| m_active_state = Active_Connection_State_12(state, application_protocol(), m_pending_state->take_handshake_io()); 284| 2| } else { 285| 2| m_active_state = Active_Connection_State_12(state, application_protocol()); 286| 2| } 287| | 288| 2| m_pending_state.reset(); 289| | 290| 2| callbacks().tls_session_activated(); 291| 2|} _ZN5Botan3TLS15Channel_Impl_129from_peerENSt3__14spanIKhLm18446744073709551615EEE: 293| 7.28k|size_t Channel_Impl_12::from_peer(std::span data) { 294| 7.28k| const bool allow_epoch0_restart = m_is_datagram && m_is_server && policy().allow_dtls_epoch0_restart(); ------------------ | Branch (294:38): [True: 0, False: 7.28k] | Branch (294:55): [True: 0, False: 0] | Branch (294:70): [True: 0, False: 0] ------------------ 295| | 296| 7.28k| const auto* input = data.data(); 297| 7.28k| auto input_size = data.size(); 298| | 299| 7.28k| try { 300| 20.8k| while(input_size > 0) { ------------------ | Branch (300:13): [True: 13.6k, False: 7.19k] ------------------ 301| 13.6k| size_t consumed = 0; 302| | 303| 13.6k| auto get_epoch = [this](uint16_t epoch) { return read_cipher_state_epoch(epoch); }; 304| | 305| 13.6k| const Record_Header record = read_record(m_is_datagram, 306| 13.6k| m_readbuf, 307| 13.6k| input, 308| 13.6k| input_size, 309| 13.6k| consumed, 310| 13.6k| m_record_buf, 311| 13.6k| m_sequence_numbers.get(), 312| 13.6k| get_epoch, 313| 13.6k| allow_epoch0_restart); 314| | 315| 13.6k| const size_t needed = record.needed(); 316| | 317| 13.6k| BOTAN_ASSERT(consumed > 0, "Got to eat something"); ------------------ | | 64| 13.6k| do { \ | | 65| 13.6k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 13.6k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 13.6k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 13.6k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 13.6k] | | ------------------ ------------------ 318| | 319| 13.6k| BOTAN_ASSERT(consumed <= input_size, "Record reader consumed sane amount"); ------------------ | | 64| 13.6k| do { \ | | 65| 13.6k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 13.6k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 13.6k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 13.6k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 13.6k] | | ------------------ ------------------ 320| | 321| 13.6k| input += consumed; 322| 13.6k| input_size -= consumed; 323| | 324| 13.6k| BOTAN_ASSERT(input_size == 0 || needed == 0, "Got a full record or consumed all input"); ------------------ | | 64| 13.6k| do { \ | | 65| 13.6k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 21.9k| if(!(expr)) { \ | | ------------------ | | | Branch (66:12): [True: 5.33k, False: 8.30k] | | | Branch (66:12): [True: 8.30k, False: 0] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 13.6k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 13.6k] | | ------------------ ------------------ 325| | 326| 13.6k| if(input_size == 0 && needed != 0) { ------------------ | Branch (326:13): [True: 5.26k, False: 8.38k] | Branch (326:32): [True: 87, False: 5.17k] ------------------ 327| 87| return needed; // need more data to complete record 328| 87| } 329| | 330| | // Ignore invalid records in DTLS 331| 13.5k| if(m_is_datagram && record.type() == Record_Type::Invalid) { ------------------ | Branch (331:13): [True: 0, False: 13.5k] | Branch (331:30): [True: 0, False: 0] ------------------ 332| 0| return 0; 333| 0| } 334| | 335| 13.5k| if(m_record_buf.size() > MAX_PLAINTEXT_SIZE) { ------------------ | Branch (335:13): [True: 0, False: 13.5k] ------------------ 336| 0| throw TLS_Exception(Alert::RecordOverflow, "TLS plaintext record is larger than allowed maximum"); 337| 0| } 338| | 339| 13.5k| const bool epoch0_restart = m_is_datagram && record.epoch() == 0 && m_active_state.has_value(); ------------------ | Branch (339:38): [True: 0, False: 13.5k] | Branch (339:55): [True: 0, False: 0] | Branch (339:78): [True: 0, False: 0] ------------------ 340| 13.5k| BOTAN_ASSERT_IMPLICATION(epoch0_restart, allow_epoch0_restart, "Allowed state"); ------------------ | | 103| 13.5k| do { \ | | 104| 13.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 105| 13.5k| if((expr1) && !(expr2)) { \ | | ------------------ | | | Branch (105:10): [True: 0, False: 13.5k] | | | Branch (105:21): [True: 0, False: 0] | | ------------------ | | 106| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 107| 0| Botan::assertion_failure(#expr1 " implies " #expr2, msg, __func__, __FILE__, __LINE__); \ | | 108| 0| } \ | | 109| 13.5k| } while(0) | | ------------------ | | | Branch (109:12): [Folded, False: 13.5k] | | ------------------ ------------------ 341| | 342| 13.5k| const bool initial_record = epoch0_restart || (pending_state() == nullptr && !m_active_state.has_value()); ------------------ | Branch (342:38): [True: 75, False: 13.4k] | Branch (342:57): [True: 0, False: 13.4k] | Branch (342:87): [True: 0, False: 0] ------------------ 343| 13.5k| bool initial_handshake_message = false; 344| 13.5k| if(record.type() == Record_Type::Handshake && !m_record_buf.empty()) { ------------------ | Branch (344:13): [True: 11.6k, False: 1.93k] | Branch (344:56): [True: 11.6k, False: 0] ------------------ 345| 11.6k| const Handshake_Type type = static_cast(m_record_buf[0]); 346| 11.6k| initial_handshake_message = (type == Handshake_Type::ClientHello); 347| 11.6k| } 348| | 349| 13.5k| if(record.type() != Record_Type::Alert) { ------------------ | Branch (349:13): [True: 11.6k, False: 1.88k] ------------------ 350| 11.6k| if(initial_record) { ------------------ | Branch (350:16): [True: 0, False: 11.6k] ------------------ 351| | // For initial records just check for basic sanity 352| 0| if(record.version().major_version() != 3 && record.version().major_version() != 0xFE) { ------------------ | Branch (352:19): [True: 0, False: 0] | Branch (352:19): [True: 0, False: 0] | Branch (352:60): [True: 0, False: 0] ------------------ 353| 0| throw TLS_Exception(Alert::ProtocolVersion, "Received unexpected record version in initial record"); 354| 0| } 355| 11.6k| } else if(const auto* pending = pending_state()) { ------------------ | Branch (355:35): [True: 11.6k, False: 0] ------------------ 356| 11.6k| if(pending->server_hello() != nullptr && !initial_handshake_message && ------------------ | Branch (356:19): [True: 3.75k, False: 7.91k] | Branch (356:19): [True: 0, False: 11.6k] | Branch (356:57): [True: 3.75k, False: 0] ------------------ 357| 3.75k| record.version() != pending->version()) { ------------------ | Branch (357:19): [True: 0, False: 3.75k] ------------------ 358| 0| throw TLS_Exception(Alert::ProtocolVersion, "Received unexpected record version"); 359| 0| } 360| 11.6k| } else if(m_active_state.has_value()) { ------------------ | Branch (360:23): [True: 0, False: 0] ------------------ 361| 0| if(record.version() != m_active_state->version() && !initial_handshake_message) { ------------------ | Branch (361:19): [True: 0, False: 0] | Branch (361:19): [True: 0, False: 0] | Branch (361:68): [True: 0, False: 0] ------------------ 362| 0| throw TLS_Exception(Alert::ProtocolVersion, "Received unexpected record version"); 363| 0| } 364| 0| } 365| 11.6k| } 366| | 367| 13.5k| if(record.type() == Record_Type::Handshake || record.type() == Record_Type::ChangeCipherSpec) { ------------------ | Branch (367:13): [True: 11.6k, False: 1.86k] | Branch (367:56): [True: 47, False: 1.81k] ------------------ 368| 11.6k| if(m_has_been_closed) { ------------------ | Branch (368:16): [True: 1, False: 11.6k] ------------------ 369| 1| throw TLS_Exception(Alert::UnexpectedMessage, "Received handshake data after connection closure"); 370| 1| } 371| 11.6k| process_handshake_ccs(m_record_buf, record.sequence(), record.type(), record.version(), epoch0_restart); 372| 11.6k| } else if(record.type() == Record_Type::ApplicationData) { ------------------ | Branch (372:20): [True: 4, False: 1.88k] ------------------ 373| 4| if(m_has_been_closed) { ------------------ | Branch (373:16): [True: 1, False: 3] ------------------ 374| 1| throw TLS_Exception(Alert::UnexpectedMessage, "Received application data after connection closure"); 375| 1| } 376| 3| if(pending_state() != nullptr) { ------------------ | Branch (376:16): [True: 3, False: 0] ------------------ 377| 3| throw TLS_Exception(Alert::UnexpectedMessage, "Can't interleave application and handshake data"); 378| 3| } 379| 0| process_application_data(record.sequence(), m_record_buf); 380| 1.88k| } else if(record.type() == Record_Type::Alert) { ------------------ | Branch (380:20): [True: 1.81k, False: 75] ------------------ 381| 1.81k| process_alert(m_record_buf); 382| 1.81k| } else if(record.type() != Record_Type::Invalid) { ------------------ | Branch (382:20): [True: 0, False: 75] ------------------ 383| 0| throw Unexpected_Message("Unexpected record type " + std::to_string(static_cast(record.type())) + 384| 0| " from counterparty"); 385| 0| } 386| 13.5k| } 387| | 388| 7.19k| return 0; // on a record boundary 389| 7.28k| } catch(TLS_Exception& e) { 390| 5.31k| send_fatal_alert(e.type()); 391| 5.31k| throw; 392| 5.31k| } catch(Invalid_Authentication_Tag&) { 393| 0| send_fatal_alert(Alert::BadRecordMac); 394| 0| throw; 395| 1.82k| } catch(Decoding_Error&) { 396| 1.82k| send_fatal_alert(Alert::DecodeError); 397| 1.82k| throw; 398| 1.82k| } catch(...) { 399| 0| send_fatal_alert(Alert::InternalError); 400| 0| throw; 401| 0| } 402| 7.28k|} _ZN5Botan3TLS15Channel_Impl_1221process_handshake_ccsERKNSt3__16vectorIhNS_16secure_allocatorIhEEEEmNS0_11Record_TypeENS0_16Protocol_VersionEb: 408| 11.6k| bool epoch0_restart) { 409| 11.6k| if(!m_pending_state) { ------------------ | Branch (409:7): [True: 0, False: 11.6k] ------------------ 410| | // No pending handshake, possibly new: 411| 0| if(record_version.is_datagram_protocol() && !epoch0_restart) { ------------------ | Branch (411:10): [True: 0, False: 0] | Branch (411:51): [True: 0, False: 0] ------------------ 412| 0| if(m_sequence_numbers) { ------------------ | Branch (412:13): [True: 0, False: 0] ------------------ 413| | /* 414| | * Might be a peer retransmit under epoch - 1 in which 415| | * case we must retransmit last flight 416| | */ 417| 0| sequence_numbers().read_accept(record_sequence); 418| | 419| 0| const uint16_t epoch = record_sequence >> 48; 420| | 421| 0| const uint16_t current_epoch = sequence_numbers().current_read_epoch(); 422| 0| if(epoch == current_epoch) { ------------------ | Branch (422:16): [True: 0, False: 0] ------------------ 423| 0| create_handshake_state(record_version); 424| 0| } else if(current_epoch > 0 && epoch == current_epoch - 1) { ------------------ | Branch (424:23): [True: 0, False: 0] | Branch (424:44): [True: 0, False: 0] ------------------ 425| 0| BOTAN_ASSERT(m_active_state.has_value() && m_active_state->dtls_handshake_io(), ------------------ | | 64| 0| do { \ | | 65| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 0| if(!(expr)) { \ | | ------------------ | | | Branch (66:12): [True: 0, False: 0] | | | Branch (66:12): [True: 0, False: 0] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 0| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 0] | | ------------------ ------------------ 426| 0| "Have DTLS handshake IO for retransmission"); 427| 0| m_active_state->dtls_handshake_io()->add_record( 428| 0| record.data(), record.size(), record_type, record_sequence); 429| 0| } 430| 0| } else { 431| 0| create_handshake_state(record_version); 432| 0| } 433| 0| } else { 434| 0| create_handshake_state(record_version); 435| 0| } 436| 0| } 437| | 438| | // May have been created in above conditional 439| 11.6k| if(m_pending_state) { ------------------ | Branch (439:7): [True: 11.6k, False: 0] ------------------ 440| 11.6k| m_pending_state->handshake_io().add_record(record.data(), record.size(), record_type, record_sequence); 441| | 442| 22.5k| while(auto* pending = m_pending_state.get()) { ------------------ | Branch (442:19): [True: 15.5k, False: 7.02k] ------------------ 443| 15.5k| auto msg = pending->get_next_handshake_msg(policy().maximum_handshake_message_size()); 444| | 445| 15.5k| if(msg.first == Handshake_Type::None) { // no full handshake yet ------------------ | Branch (445:13): [True: 4.63k, False: 10.8k] ------------------ 446| 4.63k| break; 447| 4.63k| } 448| | 449| 10.8k| process_handshake_msg(*pending, msg.first, msg.second, epoch0_restart); 450| | 451| 10.8k| if(!m_pending_state) { ------------------ | Branch (451:13): [True: 2, False: 10.8k] ------------------ 452| 2| break; 453| 2| } 454| 10.8k| } 455| 11.6k| } 456| 11.6k|} _ZN5Botan3TLS15Channel_Impl_1213process_alertERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 473| 1.81k|void Channel_Impl_12::process_alert(const secure_vector& record) { 474| 1.81k| const Alert alert_msg(record); 475| | 476| | // RFC 5246 7.2.2: 477| | // no_renegotiation 478| | // Sent by the client in response to a hello request or by the 479| | // server in response to a client hello after initial handshaking. 480| 1.81k| if(alert_msg.type() == Alert::NoRenegotiation && m_active_state.has_value()) { ------------------ | Branch (480:7): [True: 1.15k, False: 654] | Branch (480:53): [True: 0, False: 1.15k] ------------------ 481| 0| m_pending_state.reset(); 482| 0| } 483| | 484| 1.81k| callbacks().tls_alert(alert_msg); 485| | 486| | // If the alert is fatal on an active session, prevent later resumptions 487| 1.81k| if(alert_msg.is_fatal() && m_active_state.has_value()) { ------------------ | Branch (487:7): [True: 483, False: 1.32k] | Branch (487:31): [True: 0, False: 483] ------------------ 488| 0| const auto& sid = m_active_state->session_id(); 489| 0| if(!sid.empty()) { ------------------ | Branch (489:10): [True: 0, False: 0] ------------------ 490| 0| session_manager().remove(Session_Handle(sid)); 491| 0| } 492| 0| } 493| | 494| 1.81k| if(alert_msg.type() == Alert::CloseNotify) { ------------------ | Branch (494:7): [True: 423, False: 1.38k] ------------------ 495| | // TLS 1.2 requires us to immediately react with our "close_notify", 496| | // the return value of the application's callback has no effect on that. 497| 423| callbacks().tls_peer_closed_connection(); 498| 423| send_warning_alert(Alert::CloseNotify); // reply in kind 499| 423| } 500| | 501| 1.81k| if(alert_msg.type() == Alert::CloseNotify || alert_msg.is_fatal()) { ------------------ | Branch (501:7): [True: 447, False: 1.36k] | Branch (501:49): [True: 220, False: 1.14k] ------------------ 502| 643| m_has_been_closed = true; 503| 643| } 504| 1.81k|} _ZN5Botan3TLS15Channel_Impl_1212write_recordEPNS0_23Connection_Cipher_StateEtNS0_11Record_TypeEPKhm: 510| 14.5k| size_t length) { 511| 14.5k| BOTAN_ASSERT(m_pending_state || m_active_state.has_value(), "Some connection state exists"); ------------------ | | 64| 14.5k| do { \ | | 65| 14.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 14.5k| if(!(expr)) { \ | | ------------------ | | | Branch (66:12): [True: 14.5k, False: 2] | | | Branch (66:12): [True: 2, False: 0] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 14.5k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 14.5k] | | ------------------ ------------------ 512| | 513| 14.5k| const Protocol_Version record_version = (m_pending_state) ? (m_pending_state->version()) : m_active_state->version(); ------------------ | Branch (513:44): [True: 14.5k, False: 2] ------------------ 514| | 515| 14.5k| const uint64_t next_seq = sequence_numbers().next_write_sequence(epoch); 516| | 517| 14.5k| if(cipher_state == nullptr) { ------------------ | Branch (517:7): [True: 14.5k, False: 80] ------------------ 518| 14.5k| TLS::write_unencrypted_record(m_writebuf, record_type, record_version, next_seq, input, length); 519| 14.5k| } else { 520| 80| TLS::write_record(m_writebuf, record_type, record_version, next_seq, input, length, *cipher_state, rng()); 521| 80| } 522| | 523| 14.5k| callbacks().tls_emit_data(m_writebuf); 524| 14.5k|} _ZN5Botan3TLS15Channel_Impl_1217send_record_arrayEtNS0_11Record_TypeEPKhm: 526| 14.5k|void Channel_Impl_12::send_record_array(uint16_t epoch, Record_Type type, const uint8_t input[], size_t length) { 527| 14.5k| if(length == 0) { ------------------ | Branch (527:7): [True: 0, False: 14.5k] ------------------ 528| 0| return; 529| 0| } 530| | 531| 14.5k| auto cipher_state = write_cipher_state_epoch(epoch); 532| | 533| 29.1k| while(length > 0) { ------------------ | Branch (533:10): [True: 14.5k, False: 14.5k] ------------------ 534| 14.5k| const size_t sending = std::min(length, MAX_PLAINTEXT_SIZE); 535| 14.5k| write_record(cipher_state.get(), epoch, type, input, sending); 536| | 537| 14.5k| input += sending; 538| 14.5k| length -= sending; 539| 14.5k| } 540| 14.5k|} _ZN5Botan3TLS15Channel_Impl_1211send_recordENS0_11Record_TypeERKNSt3__16vectorIhNS3_9allocatorIhEEEE: 542| 14.5k|void Channel_Impl_12::send_record(Record_Type record_type, const std::vector& record) { 543| 14.5k| send_record_array(sequence_numbers().current_write_epoch(), record_type, record.data(), record.size()); 544| 14.5k|} _ZN5Botan3TLS15Channel_Impl_1210send_alertERKNS0_5AlertE: 560| 7.55k|void Channel_Impl_12::send_alert(const Alert& alert) { 561| 7.55k| const bool ready_to_send_anything = !is_closed() && m_sequence_numbers; ------------------ | Branch (561:40): [True: 7.13k, False: 418] | Branch (561:56): [True: 7.13k, False: 0] ------------------ 562| 7.55k| if(alert.is_valid() && ready_to_send_anything) { ------------------ | Branch (562:7): [True: 7.55k, False: 0] | Branch (562:27): [True: 7.13k, False: 418] ------------------ 563| 7.13k| try { 564| 7.13k| send_record(Record_Type::Alert, alert.serialize()); 565| 7.13k| } catch(...) { /* swallow it */ 566| 0| } 567| 7.13k| } 568| | 569| 7.55k| if(alert.type() == Alert::NoRenegotiation && m_active_state.has_value()) { ------------------ | Branch (569:7): [True: 0, False: 7.55k] | Branch (569:49): [True: 0, False: 0] ------------------ 570| 0| m_pending_state.reset(); 571| 0| } 572| | 573| 7.55k| if(alert.is_fatal()) { ------------------ | Branch (573:7): [True: 7.13k, False: 423] ------------------ 574| 7.13k| if(m_active_state.has_value()) { ------------------ | Branch (574:10): [True: 2, False: 7.13k] ------------------ 575| 2| const auto& sid = m_active_state->session_id(); 576| 2| if(!sid.empty()) { ------------------ | Branch (576:13): [True: 0, False: 2] ------------------ 577| 0| session_manager().remove(Session_Handle(sid)); 578| 0| } 579| 2| } 580| 7.13k| reset_state(); 581| 7.13k| } 582| | 583| 7.55k| if(alert.type() == Alert::CloseNotify || alert.is_fatal()) { ------------------ | Branch (583:7): [True: 423, False: 7.13k] | Branch (583:45): [True: 7.13k, False: 0] ------------------ 584| 7.55k| m_has_been_closed = true; 585| 7.55k| } 586| 7.55k|} _ZN5Botan3TLS15Channel_Impl_1226secure_renegotiation_checkEPKNS0_15Client_Hello_12E: 588| 7.28k|void Channel_Impl_12::secure_renegotiation_check(const Client_Hello_12* client_hello) { 589| 7.28k| BOTAN_ASSERT_NONNULL(client_hello); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 590| 7.28k| const bool secure_renegotiation = client_hello->secure_renegotiation(); 591| | 592| 7.28k| if(m_active_state && m_active_state->client_supports_secure_renegotiation() != secure_renegotiation) { ------------------ | Branch (592:7): [True: 0, False: 7.28k] | Branch (592:25): [True: 0, False: 0] ------------------ 593| 0| throw TLS_Exception(Alert::HandshakeFailure, "Client changed its mind about secure renegotiation"); 594| 0| } 595| | 596| 7.28k| if(secure_renegotiation) { ------------------ | Branch (596:7): [True: 7.28k, False: 0] ------------------ 597| 7.28k| const std::vector& data = client_hello->renegotiation_info(); 598| | 599| 7.28k| const auto expected = secure_renegotiation_data_for_client_hello(); 600| 7.28k| if(!CT::is_equal(data, expected).as_bool()) { ------------------ | Branch (600:10): [True: 0, False: 7.28k] ------------------ 601| 0| throw TLS_Exception(Alert::HandshakeFailure, "Client sent bad values for secure renegotiation"); 602| 0| } 603| 7.28k| } 604| 7.28k|} _ZN5Botan3TLS15Channel_Impl_1226secure_renegotiation_checkEPKNS0_15Server_Hello_12E: 606| 5.31k|void Channel_Impl_12::secure_renegotiation_check(const Server_Hello_12* server_hello) { 607| 5.31k| BOTAN_ASSERT_NONNULL(server_hello); ------------------ | | 116| 5.31k| do { \ | | 117| 5.31k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 5.31k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 5.31k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 5.31k] | | ------------------ ------------------ 608| 5.31k| const bool secure_renegotiation = server_hello->secure_renegotiation(); 609| | 610| 5.31k| if(m_active_state && m_active_state->server_supports_secure_renegotiation() != secure_renegotiation) { ------------------ | Branch (610:7): [True: 0, False: 5.31k] | Branch (610:25): [True: 0, False: 0] ------------------ 611| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server changed its mind about secure renegotiation"); 612| 0| } 613| | 614| 5.31k| if(secure_renegotiation) { ------------------ | Branch (614:7): [True: 3.31k, False: 2.00k] ------------------ 615| 3.31k| const std::vector& data = server_hello->renegotiation_info(); 616| | 617| 3.31k| const auto expected = secure_renegotiation_data_for_server_hello(); 618| 3.31k| if(!CT::is_equal(data, expected).as_bool()) { ------------------ | Branch (618:10): [True: 4, False: 3.30k] ------------------ 619| 4| throw TLS_Exception(Alert::HandshakeFailure, "Server sent bad values for secure renegotiation"); 620| 4| } 621| 3.31k| } 622| 5.31k|} _ZNK5Botan3TLS15Channel_Impl_1242secure_renegotiation_data_for_client_helloEv: 624| 14.5k|std::vector Channel_Impl_12::secure_renegotiation_data_for_client_hello() const { 625| 14.5k| if(m_active_state.has_value()) { ------------------ | Branch (625:7): [True: 0, False: 14.5k] ------------------ 626| 0| return m_active_state->client_finished_verify_data(); 627| 0| } 628| 14.5k| return std::vector(); 629| 14.5k|} _ZNK5Botan3TLS15Channel_Impl_1242secure_renegotiation_data_for_server_helloEv: 631| 3.31k|std::vector Channel_Impl_12::secure_renegotiation_data_for_server_hello() const { 632| 3.31k| if(m_active_state.has_value()) { ------------------ | Branch (632:7): [True: 0, False: 3.31k] ------------------ 633| 0| return concat(m_active_state->client_finished_verify_data(), m_active_state->server_finished_verify_data()); 634| 3.31k| } else { 635| 3.31k| return {}; 636| 3.31k| } 637| 3.31k|} tls_channel_impl_12.cpp:_ZZN5Botan3TLS15Channel_Impl_1222create_handshake_stateENS0_16Protocol_VersionEENK3$_1clENS0_11Record_TypeERKNSt3__16vectorIhNS5_9allocatorIhEEEE: 158| 7.45k| auto send_record_f = [this](Record_Type rec_type, const std::vector& record) { 159| 7.45k| send_record(rec_type, record); 160| 7.45k| }; tls_channel_impl_12.cpp:_ZZN5Botan3TLS15Channel_Impl_1216activate_sessionEvENK3$_0clEt: 275| 8| const auto not_current_epoch = [current_epoch](uint16_t epoch) { return (epoch != current_epoch); }; tls_channel_impl_12.cpp:_ZZN5Botan3TLS15Channel_Impl_129from_peerENSt3__14spanIKhLm18446744073709551615EEEENK3$_0clEt: 303| 2| auto get_epoch = [this](uint16_t epoch) { return read_cipher_state_epoch(epoch); }; _ZN5Botan3TLS14Client_Impl_12C2ERKNSt3__110shared_ptrINS0_9CallbacksEEERKNS3_INS0_15Session_ManagerEEERKNS3_INS_19Credentials_ManagerEEERKNS3_IKNS0_6PolicyEEERKNS3_INS_21RandomNumberGeneratorEEENS0_18Server_InformationEbRKNS2_6vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENSU_ISW_EEEEm: 109| 7.28k| Channel_Impl_12(callbacks, session_manager, rng, policy, false, datagram, io_buf_sz), 110| 7.28k| m_creds(creds), 111| 7.28k| m_info(std::move(info)) { 112| 7.28k| BOTAN_ASSERT_NONNULL(m_creds); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 113| 7.28k| const auto version = datagram ? Protocol_Version::DTLS_V12 : Protocol_Version::TLS_V12; ------------------ | Branch (113:25): [True: 0, False: 7.28k] ------------------ 114| 7.28k| Handshake_State& state = create_handshake_state(version); 115| 7.28k| send_client_hello(state, false, version, std::nullopt /* no a-priori session to resume */, next_protocols); 116| 7.28k|} _ZN5Botan3TLS14Client_Impl_1219new_handshake_stateENSt3__110unique_ptrINS0_12Handshake_IOENS2_14default_deleteIS4_EEEE: 155| 7.28k|std::unique_ptr Client_Impl_12::new_handshake_state(std::unique_ptr io) { 156| 7.28k| return std::make_unique(std::move(io), callbacks()); 157| 7.28k|} _ZN5Botan3TLS14Client_Impl_1217send_client_helloERNS0_15Handshake_StateEbNS0_16Protocol_VersionENSt3__18optionalINS0_19Session_with_HandleEEERKNS5_6vectorINS5_12basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEENSD_ISF_EEEE: 172| 7.28k| const std::vector& next_protocols) { 173| 7.28k| Client_Handshake_State_12& state = dynamic_cast(state_base); 174| | 175| 7.28k| if(state.version().is_datagram_protocol()) { ------------------ | Branch (175:7): [True: 0, False: 7.28k] ------------------ 176| 0| state.set_expected_next(Handshake_Type::HelloVerifyRequest); // optional 177| 0| } 178| 7.28k| state.set_expected_next(Handshake_Type::ServerHello); 179| | 180| 7.28k| if(!force_full_renegotiation) { ------------------ | Branch (180:7): [True: 7.28k, False: 0] ------------------ 181| | // if no session is provided, we need to try and find one opportunistically 182| 7.28k| if(!session_and_handle.has_value() && !m_info.empty()) { ------------------ | Branch (182:10): [True: 7.28k, False: 0] | Branch (182:45): [True: 7.28k, False: 0] ------------------ 183| 7.28k| if(auto sessions = session_manager().find(m_info, callbacks(), policy()); !sessions.empty()) { ------------------ | Branch (183:84): [True: 0, False: 7.28k] ------------------ 184| 0| session_and_handle = std::move(sessions.front()); 185| 0| } 186| 7.28k| } 187| | 188| 7.28k| if(session_and_handle.has_value()) { ------------------ | Branch (188:10): [True: 0, False: 7.28k] ------------------ 189| | /* 190| | Ensure that the session protocol cipher and version are acceptable 191| | If not skip the resume and establish a new session 192| | */ 193| 0| auto& session_info = session_and_handle->session; 194| 0| const bool exact_version = session_info.version() == version; 195| 0| const bool ok_version = (session_info.version().is_datagram_protocol() == version.is_datagram_protocol()) && ------------------ | Branch (195:34): [True: 0, False: 0] ------------------ 196| 0| policy().acceptable_protocol_version(session_info.version()); ------------------ | Branch (196:34): [True: 0, False: 0] ------------------ 197| | 198| 0| const bool session_version_ok = policy().only_resume_with_exact_version() ? exact_version : ok_version; ------------------ | Branch (198:42): [True: 0, False: 0] ------------------ 199| | 200| 0| if(policy().acceptable_ciphersuite(session_info.ciphersuite()) && session_version_ok) { ------------------ | Branch (200:13): [True: 0, False: 0] | Branch (200:13): [True: 0, False: 0] | Branch (200:76): [True: 0, False: 0] ------------------ 201| 0| state.client_hello(std::make_unique(state.handshake_io(), 202| 0| state.hash(), 203| 0| policy(), 204| 0| callbacks(), 205| 0| rng(), 206| 0| secure_renegotiation_data_for_client_hello(), 207| 0| session_and_handle.value(), 208| 0| next_protocols)); 209| | 210| 0| state.record_resumption_info(std::move(session_info)); 211| 0| } 212| 0| } 213| 7.28k| } 214| | 215| 7.28k| if(state.client_hello() == nullptr) { ------------------ | Branch (215:7): [True: 7.28k, False: 0] ------------------ 216| | // not resuming 217| 7.28k| const Client_Hello_12::Settings client_settings(version, m_info.hostname()); 218| 7.28k| state.client_hello(std::make_unique(state.handshake_io(), 219| 7.28k| state.hash(), 220| 7.28k| policy(), 221| 7.28k| callbacks(), 222| 7.28k| rng(), 223| 7.28k| secure_renegotiation_data_for_client_hello(), 224| 7.28k| client_settings, 225| 7.28k| next_protocols)); 226| 7.28k| } 227| | 228| 7.28k| secure_renegotiation_check(state.client_hello()); 229| 7.28k|} _ZN5Botan3TLS14Client_Impl_1221process_handshake_msgERNS0_15Handshake_StateENS0_14Handshake_TypeERKNSt3__16vectorIhNS5_9allocatorIhEEEEb: 253| 10.7k| bool epoch0_restart) { 254| 10.7k| BOTAN_ASSERT_NOMSG(epoch0_restart == false); // only happens on server side ------------------ | | 77| 10.7k| do { \ | | 78| 10.7k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 10.7k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 10.7k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 10.7k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 10.7k] | | ------------------ ------------------ 255| | 256| 10.7k| Client_Handshake_State_12& state = dynamic_cast(state_base); 257| | 258| 10.7k| if(type == Handshake_Type::HelloRequest && active_state().has_value()) { ------------------ | Branch (258:7): [True: 18, False: 10.7k] | Branch (258:47): [True: 0, False: 18] ------------------ 259| 0| const Hello_Request hello_request(contents); 260| | 261| 0| if(state.client_hello() != nullptr) { ------------------ | Branch (261:10): [True: 0, False: 0] ------------------ 262| 0| throw TLS_Exception(Alert::HandshakeFailure, "Cannot renegotiate during a handshake"); 263| 0| } 264| | 265| 0| if(policy().allow_server_initiated_renegotiation()) { ------------------ | Branch (265:10): [True: 0, False: 0] ------------------ 266| 0| if(secure_renegotiation_supported() || policy().allow_insecure_renegotiation()) { ------------------ | Branch (266:13): [True: 0, False: 0] | Branch (266:49): [True: 0, False: 0] ------------------ 267| 0| state.mark_as_renegotiation(); 268| 0| initiate_handshake(state, true /* force_full_renegotiation */); 269| 0| } else { 270| 0| throw TLS_Exception(Alert::HandshakeFailure, "Client policy prohibits insecure renegotiation"); 271| 0| } 272| 0| } else { 273| 0| if(policy().abort_connection_on_undesired_renegotiation()) { ------------------ | Branch (273:13): [True: 0, False: 0] ------------------ 274| 0| throw TLS_Exception(Alert::NoRenegotiation, "Client policy prohibits renegotiation"); 275| 0| } else { 276| | // RFC 5746 section 4.2 277| 0| send_warning_alert(Alert::NoRenegotiation); 278| 0| } 279| 0| } 280| | 281| 0| return; 282| 0| } 283| | 284| 10.7k| state.confirm_transition_to(type); 285| | 286| 10.7k| if(type != Handshake_Type::HandshakeCCS && type != Handshake_Type::Finished && ------------------ | Branch (286:7): [True: 10.6k, False: 53] | Branch (286:47): [True: 10.6k, False: 4] ------------------ 287| 10.6k| type != Handshake_Type::HelloVerifyRequest) { ------------------ | Branch (287:7): [True: 10.6k, False: 0] ------------------ 288| 10.6k| state.hash().update(state.handshake_io().format(contents, type)); 289| 10.6k| } 290| | 291| 10.7k| if(type == Handshake_Type::HelloVerifyRequest) { ------------------ | Branch (291:7): [True: 0, False: 10.7k] ------------------ 292| 0| state.set_expected_next(Handshake_Type::ServerHello); 293| 0| state.set_expected_next(Handshake_Type::HelloVerifyRequest); // might get it again 294| | 295| 0| const Hello_Verify_Request hello_verify_request(contents); 296| 0| state.hello_verify_request(hello_verify_request); 297| 10.7k| } else if(type == Handshake_Type::ServerHello) { ------------------ | Branch (297:14): [True: 6.89k, False: 3.83k] ------------------ 298| 6.89k| state.server_hello(std::make_unique(contents)); 299| | 300| 6.89k| if(!state.server_hello()->legacy_version().valid()) { ------------------ | Branch (300:10): [True: 47, False: 6.84k] ------------------ 301| 47| throw TLS_Exception(Alert::ProtocolVersion, "Server replied with an invalid version"); 302| 47| } 303| | 304| 6.84k| if(!state.client_hello()->offered_suite(state.server_hello()->ciphersuite())) { ------------------ | Branch (304:10): [True: 26, False: 6.81k] ------------------ 305| 26| throw TLS_Exception(Alert::HandshakeFailure, "Server replied with ciphersuite we didn't send"); 306| 26| } 307| | 308| 6.81k| const auto suite = Ciphersuite::by_id(state.server_hello()->ciphersuite()); 309| 6.81k| if(!suite || !suite->usable_in_version(state.server_hello()->legacy_version())) { ------------------ | Branch (309:10): [True: 1.36k, False: 5.45k] | Branch (309:20): [True: 0, False: 5.45k] ------------------ 310| 0| throw TLS_Exception(Alert::HandshakeFailure, 311| 0| "Server replied using a ciphersuite not allowed in version it offered"); 312| 0| } 313| | 314| | // RFC 7366 3.: 315| | // If a server receives an encrypt-then-MAC request extension from a client 316| | // and then selects a stream or Authenticated Encryption with Associated 317| | // Data (AEAD) ciphersuite, it MUST NOT send an encrypt-then-MAC 318| | // response extension back to the client. 319| 6.81k| if(suite->aead_ciphersuite() && state.server_hello()->supports_encrypt_then_mac()) { ------------------ | Branch (319:10): [True: 3.09k, False: 3.72k] | Branch (319:39): [True: 1, False: 3.09k] ------------------ 320| 1| throw TLS_Exception(Alert::IllegalParameter, 321| 1| "Server replied using an AEAD ciphersuite and an encrypt-then-MAC response extension"); 322| 1| } 323| | 324| 6.81k| if(Ciphersuite::is_scsv(state.server_hello()->ciphersuite())) { ------------------ | Branch (324:10): [True: 0, False: 6.81k] ------------------ 325| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server replied with a signaling ciphersuite"); 326| 0| } 327| | 328| 6.81k| if(state.server_hello()->compression_method() != 0) { ------------------ | Branch (328:10): [True: 9, False: 6.80k] ------------------ 329| 9| throw TLS_Exception(Alert::IllegalParameter, "Server replied with non-null compression method"); 330| 9| } 331| | 332| 6.80k| if(state.client_hello()->legacy_version() > state.server_hello()->legacy_version()) { ------------------ | Branch (332:10): [True: 251, False: 6.55k] ------------------ 333| | // check for downgrade attacks 334| | // 335| | // RFC 8446 4.1.3.: 336| | // TLS 1.2 clients SHOULD also check that the last 8 bytes are 337| | // not equal to the [magic value DOWNGRADE_TLS11] if the ServerHello 338| | // indicates TLS 1.1 or below. If a match is found, the client MUST 339| | // abort the handshake with an "illegal_parameter" alert. 340| | // 341| | // TLS 1.3 servers will still set the magic string to DOWNGRADE_TLS12. Don't abort in this case. 342| 251| if(auto requested = state.server_hello()->random_signals_downgrade(); 343| 251| requested.has_value() && requested.value() <= Protocol_Version::TLS_V11) { ------------------ | Branch (343:13): [True: 3, False: 248] | Branch (343:13): [True: 1, False: 250] | Branch (343:38): [True: 1, False: 2] ------------------ 344| 1| throw TLS_Exception(Alert::IllegalParameter, "Downgrade attack detected"); 345| 1| } 346| 251| } 347| | 348| 6.80k| auto client_extn = state.client_hello()->extension_types(); 349| 6.80k| auto server_extn = state.server_hello()->extension_types(); 350| | 351| 6.80k| std::vector diff; 352| | 353| 6.80k| std::set_difference( 354| 6.80k| server_extn.begin(), server_extn.end(), client_extn.begin(), client_extn.end(), std::back_inserter(diff)); 355| | 356| 6.80k| if(!diff.empty()) { ------------------ | Branch (356:10): [True: 128, False: 6.67k] ------------------ 357| | // Server sent us back an extension we did not send! 358| | 359| 128| std::ostringstream msg; 360| 128| msg << "Server replied with unsupported extensions:"; 361| 924| for(auto&& d : diff) { ------------------ | Branch (361:23): [True: 924, False: 128] ------------------ 362| 924| msg << " " << static_cast(d); 363| 924| } 364| 128| throw TLS_Exception(Alert::UnsupportedExtension, msg.str()); 365| 128| } 366| | 367| 6.67k| if(const uint16_t srtp = state.server_hello()->srtp_profile()) { ------------------ | Branch (367:25): [True: 0, False: 6.67k] ------------------ 368| 0| if(!value_exists(state.client_hello()->srtp_profiles(), srtp)) { ------------------ | Branch (368:13): [True: 0, False: 0] ------------------ 369| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server replied with DTLS-SRTP alg we did not send"); 370| 0| } 371| 0| } 372| | 373| 6.67k| callbacks().tls_examine_extensions( 374| 6.67k| state.server_hello()->extensions(), Connection_Side::Server, Handshake_Type::ServerHello); 375| | 376| 6.67k| state.set_version(state.server_hello()->legacy_version()); 377| | 378| 6.67k| if(state.server_hello()->extensions().has()) { ------------------ | Branch (378:10): [True: 0, False: 6.67k] ------------------ 379| 0| const auto* server_alpn = state.server_hello()->extensions().get(); 380| 0| const auto selected = server_alpn->single_protocol(); 381| 0| const auto* client_alpn = state.client_hello()->extensions().get(); 382| 0| BOTAN_ASSERT_NONNULL(client_alpn); ------------------ | | 116| 0| do { \ | | 117| 0| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 0] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 0| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 0] | | ------------------ ------------------ 383| 0| const auto& offered = client_alpn->protocols(); 384| 0| if(!value_exists(offered, selected)) { ------------------ | Branch (384:13): [True: 0, False: 0] ------------------ 385| 0| throw TLS_Exception(Alert::IllegalParameter, "Server selected an ALPN protocol not offered by the client"); 386| 0| } 387| 0| } 388| 6.67k| m_application_protocol = state.server_hello()->next_protocol(); 389| | 390| 6.67k| secure_renegotiation_check(state.server_hello()); 391| | 392| | // RFC 7627 / RFC 9325 4.4: optionally require Extended Master Secret. 393| 6.67k| if(policy().require_extended_master_secret() && !state.server_hello()->supports_extended_master_secret()) { ------------------ | Branch (393:10): [True: 5.31k, False: 1.36k] | Branch (393:55): [True: 2.18k, False: 3.12k] ------------------ 394| 2.18k| throw TLS_Exception(Alert::HandshakeFailure, 395| 2.18k| "Policy requires the Extended Master Secret extension but the server did not send it"); 396| 2.18k| } 397| | 398| 4.49k| const bool server_returned_same_session_id = 399| 4.49k| !state.server_hello()->session_id().empty() && ------------------ | Branch (399:10): [True: 65, False: 4.43k] ------------------ 400| 65| (state.server_hello()->session_id() == state.client_hello()->session_id()); ------------------ | Branch (400:10): [True: 0, False: 65] ------------------ 401| | 402| 4.49k| if(server_returned_same_session_id) { ------------------ | Branch (402:10): [True: 0, False: 4.49k] ------------------ 403| | // successful resumption 404| 0| BOTAN_ASSERT_NOMSG(state.is_a_resumption()); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 405| | 406| | /* 407| | * In this case, we offered the version used in the original 408| | * session, and the server must resume with the same version. 409| | */ 410| 0| if(state.server_hello()->legacy_version() != state.client_hello()->legacy_version()) { ------------------ | Branch (410:13): [True: 0, False: 0] ------------------ 411| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server resumed session but with wrong version"); 412| 0| } 413| | 414| | // RFC 5246 7.4.1.2: when resuming a session, the server MUST use 415| | // the same cipher suite that was negotiated in the original session. 416| 0| if(state.server_hello()->ciphersuite() != state.resumed_session_ciphersuite_code()) { ------------------ | Branch (416:13): [True: 0, False: 0] ------------------ 417| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server resumed session with a different ciphersuite"); 418| 0| } 419| | 420| 0| if(state.server_hello()->supports_extended_master_secret() && ------------------ | Branch (420:13): [True: 0, False: 0] ------------------ 421| 0| !state.resumed_session_supports_extended_master_secret()) { ------------------ | Branch (421:13): [True: 0, False: 0] ------------------ 422| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server resumed session but added extended master secret"); 423| 0| } 424| | 425| 0| if(!state.server_hello()->supports_extended_master_secret() && ------------------ | Branch (425:13): [True: 0, False: 0] ------------------ 426| 0| state.resumed_session_supports_extended_master_secret()) { ------------------ | Branch (426:13): [True: 0, False: 0] ------------------ 427| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server resumed session and removed extended master secret"); 428| 0| } 429| | 430| 0| state.compute_session_keys(state.resume_master_secret()); 431| 0| if(policy().allow_ssl_key_log_file()) { ------------------ | Branch (431:13): [True: 0, False: 0] ------------------ 432| | // draft-thomson-tls-keylogfile-00 Section 3.2 433| | // An implementation of TLS 1.2 (and also earlier versions) use 434| | // the label "CLIENT_RANDOM" to identify the "master" secret for 435| | // the connection. 436| 0| callbacks().tls_ssl_key_log_data( 437| 0| "CLIENT_RANDOM", state.client_hello()->random(), state.session_keys().master_secret()); 438| 0| } 439| | 440| 0| if(state.server_hello()->supports_session_ticket()) { ------------------ | Branch (440:13): [True: 0, False: 0] ------------------ 441| 0| state.set_expected_next(Handshake_Type::NewSessionTicket); 442| 0| } else { 443| 0| state.set_expected_next(Handshake_Type::HandshakeCCS); 444| 0| } 445| 4.49k| } else { 446| | // new session 447| | 448| 4.49k| if(active_state().has_value()) { ------------------ | Branch (448:13): [True: 0, False: 4.49k] ------------------ 449| | // Here we are testing things that should not change during a renegotiation, 450| | // even if the server creates a new session. However they might change 451| | // in a resumption scenario. 452| | 453| 0| if(active_state()->version() != state.server_hello()->legacy_version()) { ------------------ | Branch (453:16): [True: 0, False: 0] ------------------ 454| 0| throw TLS_Exception(Alert::ProtocolVersion, "Server changed version after renegotiation"); 455| 0| } 456| | 457| 0| if(state.server_hello()->supports_extended_master_secret() != ------------------ | Branch (457:16): [True: 0, False: 0] ------------------ 458| 0| active_state()->supports_extended_master_secret()) { 459| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server changed its mind about extended master secret"); 460| 0| } 461| 0| } 462| | 463| 4.49k| state.discard_resumption_state(); 464| | 465| 4.49k| if(state.client_hello()->legacy_version().is_datagram_protocol() != ------------------ | Branch (465:13): [True: 0, False: 4.49k] ------------------ 466| 4.49k| state.server_hello()->legacy_version().is_datagram_protocol()) { 467| 0| throw TLS_Exception(Alert::ProtocolVersion, "Server replied with different protocol type than we offered"); 468| 0| } 469| | 470| 4.49k| if(state.version() > state.client_hello()->legacy_version()) { ------------------ | Branch (470:13): [True: 0, False: 4.49k] ------------------ 471| 0| throw TLS_Exception(Alert::HandshakeFailure, "Server replied with later version than client offered"); 472| 0| } 473| | 474| 4.49k| if(state.version().major_version() == 3 && state.version().minor_version() == 0) { ------------------ | Branch (474:13): [True: 3.12k, False: 1.36k] | Branch (474:13): [True: 1, False: 4.49k] | Branch (474:53): [True: 1, False: 3.12k] ------------------ 475| 1| throw TLS_Exception(Alert::ProtocolVersion, "Server attempting to negotiate SSLv3 which is not supported"); 476| 1| } 477| | 478| 4.49k| if(!policy().acceptable_protocol_version(state.version())) { ------------------ | Branch (478:13): [True: 3, False: 4.49k] ------------------ 479| 3| throw TLS_Exception(Alert::ProtocolVersion, 480| 3| "Server version " + state.version().to_string() + " is unacceptable by policy"); 481| 3| } 482| | 483| 4.49k| if(state.ciphersuite().is_certificate_required()) { ------------------ | Branch (483:13): [True: 3.10k, False: 1.38k] ------------------ 484| 3.10k| state.set_expected_next(Handshake_Type::Certificate); 485| 3.10k| } else if(state.ciphersuite().kex_method() == Kex_Algo::PSK) { ------------------ | Branch (485:20): [True: 15, False: 1.36k] ------------------ 486| | /* PSK is anonymous so no certificate/cert req message is 487| | ever sent. The server may or may not send a server kex, 488| | depending on if it has an identity hint for us. 489| | 490| | (EC)DHE_PSK always sends a server key exchange for the 491| | DH exchange portion, and is covered by block below 492| | */ 493| | 494| 15| state.set_expected_next(Handshake_Type::ServerKeyExchange); 495| 15| state.set_expected_next(Handshake_Type::ServerHelloDone); 496| 1.36k| } else { 497| | // ECDHE_PSK ServerKeyExchange carries the ECDH parameters and 498| | // immediately follows ServerHello. 499| | // 500| | // Suites using RSA key exchange or signature-authenticated ECDH 501| | // were already routed to expect Certificate above. 502| 1.36k| state.set_expected_next(Handshake_Type::ServerKeyExchange); 503| 1.36k| } 504| 4.49k| } 505| 4.49k| } else if(type == Handshake_Type::Certificate) { ------------------ | Branch (505:14): [True: 3.10k, False: 729] ------------------ 506| 3.10k| state.server_certs(std::make_unique(contents, policy())); 507| | 508| 3.10k| const std::vector& server_certs = state.server_certs()->cert_chain(); 509| | 510| 3.10k| if(server_certs.empty()) { ------------------ | Branch (510:10): [True: 0, False: 3.10k] ------------------ 511| 0| throw TLS_Exception(Alert::HandshakeFailure, "Client: No certificates sent by server"); 512| 0| } 513| | 514| | /* 515| | If the server supports certificate status messages, 516| | certificate verification happens after we receive the server hello done, 517| | in case an OCSP response was also available 518| | */ 519| | 520| 3.10k| const X509_Certificate server_cert = server_certs[0]; 521| | 522| 3.10k| if(active_state().has_value() && !active_state()->peer_certs().empty()) { ------------------ | Branch (522:10): [True: 0, False: 3.10k] | Branch (522:40): [True: 0, False: 0] ------------------ 523| 0| const X509_Certificate& current_cert = active_state()->peer_certs().at(0); 524| | 525| 0| if(current_cert != server_cert) { ------------------ | Branch (525:13): [True: 0, False: 0] ------------------ 526| 0| throw TLS_Exception(Alert::BadCertificate, "Server certificate changed during renegotiation"); 527| 0| } 528| 0| } 529| | 530| 3.10k| auto peer_key = server_cert.subject_public_key(); 531| | 532| 3.10k| const std::string expected_key_type = 533| 3.10k| state.ciphersuite().signature_used() ? state.ciphersuite().sig_algo() : "RSA"; ------------------ | Branch (533:10): [True: 333, False: 2.77k] ------------------ 534| | 535| 3.10k| if(peer_key->algo_name() != expected_key_type) { ------------------ | Branch (535:10): [True: 0, False: 3.10k] ------------------ 536| 0| throw TLS_Exception(Alert::IllegalParameter, "Certificate key type did not match ciphersuite"); 537| 0| } 538| | 539| 3.10k| if(!key_usage_matches_ciphersuite(server_cert.constraints(), state.ciphersuite())) { ------------------ | Branch (539:10): [True: 5, False: 3.09k] ------------------ 540| 5| throw TLS_Exception(Alert::BadCertificate, "Certificate usage constraints do not allow this ciphersuite"); 541| 5| } 542| | 543| 3.09k| state.record_server_public_key(std::move(peer_key)); 544| | 545| 3.09k| if(state.ciphersuite().kex_method() != Kex_Algo::STATIC_RSA) { ------------------ | Branch (545:10): [True: 328, False: 2.77k] ------------------ 546| 328| state.set_expected_next(Handshake_Type::ServerKeyExchange); 547| 2.77k| } else { 548| 2.77k| state.set_expected_next(Handshake_Type::CertificateRequest); // optional 549| 2.77k| state.set_expected_next(Handshake_Type::ServerHelloDone); 550| 2.77k| } 551| | 552| 3.09k| if(state.server_hello()->supports_certificate_status_message()) { ------------------ | Branch (552:10): [True: 0, False: 3.09k] ------------------ 553| 0| state.set_expected_next(Handshake_Type::CertificateStatus); // optional 554| 3.09k| } else { 555| 3.09k| try { 556| 3.09k| auto trusted_CAs = m_creds->trusted_certificate_authorities("tls-client", m_info.hostname()); 557| | 558| 3.09k| callbacks().tls_verify_cert_chain( 559| 3.09k| server_certs, {}, trusted_CAs, Usage_Type::TLS_SERVER_AUTH, m_info.hostname(), policy()); 560| 3.09k| } catch(TLS_Exception&) { 561| 0| throw; 562| 0| } catch(std::exception& e) { 563| 0| throw TLS_Exception(Alert::InternalError, e.what()); 564| 0| } 565| 3.09k| } 566| 3.09k| } else if(type == Handshake_Type::CertificateStatus) { ------------------ | Branch (566:14): [True: 0, False: 729] ------------------ 567| 0| state.server_cert_status(std::make_unique(contents, Connection_Side::Server)); 568| | 569| 0| if(state.ciphersuite().kex_method() != Kex_Algo::STATIC_RSA) { ------------------ | Branch (569:10): [True: 0, False: 0] ------------------ 570| 0| state.set_expected_next(Handshake_Type::ServerKeyExchange); 571| 0| } else { 572| 0| state.set_expected_next(Handshake_Type::CertificateRequest); // optional 573| 0| state.set_expected_next(Handshake_Type::ServerHelloDone); 574| 0| } 575| 729| } else if(type == Handshake_Type::ServerKeyExchange) { ------------------ | Branch (575:14): [True: 322, False: 407] ------------------ 576| 322| if(!state.ciphersuite().psk_ciphersuite()) { ------------------ | Branch (576:10): [True: 322, False: 0] ------------------ 577| 322| state.set_expected_next(Handshake_Type::CertificateRequest); // optional 578| 322| } 579| 322| state.set_expected_next(Handshake_Type::ServerHelloDone); 580| | 581| 322| state.server_kex(std::make_unique( 582| 322| contents, state.ciphersuite().kex_method(), state.ciphersuite().auth_method(), state.version())); 583| | 584| 322| if(state.ciphersuite().signature_used()) { ------------------ | Branch (584:10): [True: 311, False: 11] ------------------ 585| 311| const Public_Key& server_key = state.server_public_key(); 586| | 587| 311| if(!state.server_kex()->verify(server_key, state, policy())) { ------------------ | Branch (587:13): [True: 0, False: 311] ------------------ 588| 0| throw TLS_Exception(Alert::DecryptError, "Bad signature on server key exchange"); 589| 0| } 590| 311| } 591| 407| } else if(type == Handshake_Type::CertificateRequest) { ------------------ | Branch (591:14): [True: 31, False: 376] ------------------ 592| 31| state.set_expected_next(Handshake_Type::ServerHelloDone); 593| 31| state.cert_req(std::make_unique(contents)); 594| 376| } else if(type == Handshake_Type::ServerHelloDone) { ------------------ | Branch (594:14): [True: 313, False: 63] ------------------ 595| 313| state.server_hello_done(std::make_unique(contents)); 596| | 597| 313| if(state.handshake_io().have_more_data()) { ------------------ | Branch (597:10): [True: 0, False: 313] ------------------ 598| 0| throw TLS_Exception(Alert::UnexpectedMessage, "Have data remaining in buffer after ServerHelloDone"); 599| 0| } 600| | 601| 313| if(state.server_certs() != nullptr && state.server_hello()->supports_certificate_status_message()) { ------------------ | Branch (601:10): [True: 298, False: 15] | Branch (601:45): [True: 0, False: 298] ------------------ 602| 0| try { 603| 0| auto trusted_CAs = m_creds->trusted_certificate_authorities("tls-client", m_info.hostname()); 604| | 605| 0| std::vector> ocsp; 606| 0| if(state.server_cert_status() != nullptr) { ------------------ | Branch (606:16): [True: 0, False: 0] ------------------ 607| 0| ocsp.emplace_back(callbacks().tls_parse_ocsp_response(state.server_cert_status()->response())); 608| 0| } 609| | 610| 0| callbacks().tls_verify_cert_chain(state.server_certs()->cert_chain(), 611| 0| ocsp, 612| 0| trusted_CAs, 613| 0| Usage_Type::TLS_SERVER_AUTH, 614| 0| m_info.hostname(), 615| 0| policy()); 616| 0| } catch(TLS_Exception&) { 617| 0| throw; 618| 0| } catch(std::exception& e) { 619| 0| throw TLS_Exception(Alert::InternalError, e.what()); 620| 0| } 621| 0| } 622| | 623| 313| if(state.received_handshake_msg(Handshake_Type::CertificateRequest)) { ------------------ | Branch (623:10): [True: 0, False: 313] ------------------ 624| 0| const auto& types = state.cert_req()->acceptable_cert_types(); 625| | 626| 0| const std::vector client_certs = 627| 0| m_creds->find_cert_chain(types, {}, state.cert_req()->acceptable_CAs(), "tls-client", m_info.hostname()); 628| | 629| 0| state.client_certs(std::make_unique(state.handshake_io(), state.hash(), client_certs)); 630| 0| } 631| | 632| 313| state.client_kex(std::make_unique( 633| 313| state.handshake_io(), state, policy(), *m_creds, state.maybe_server_public_key(), m_info.hostname(), rng())); 634| | 635| 313| state.compute_session_keys(); 636| 313| if(policy().allow_ssl_key_log_file()) { ------------------ | Branch (636:10): [True: 0, False: 313] ------------------ 637| | // draft-thomson-tls-keylogfile-00 Section 3.2 638| | // An implementation of TLS 1.2 (and also earlier versions) use 639| | // the label "CLIENT_RANDOM" to identify the "master" secret for 640| | // the connection. 641| 0| callbacks().tls_ssl_key_log_data( 642| 0| "CLIENT_RANDOM", state.client_hello()->random(), state.session_keys().master_secret()); 643| 0| } 644| | 645| 313| if(state.received_handshake_msg(Handshake_Type::CertificateRequest) && !state.client_certs()->empty()) { ------------------ | Branch (645:10): [True: 0, False: 313] | Branch (645:78): [True: 0, False: 0] ------------------ 646| 0| auto private_key = 647| 0| m_creds->private_key_for(state.client_certs()->cert_chain()[0], "tls-client", m_info.hostname()); 648| | 649| 0| if(!private_key) { ------------------ | Branch (649:13): [True: 0, False: 0] ------------------ 650| 0| throw TLS_Exception(Alert::InternalError, "Failed to get private key for signing"); 651| 0| } 652| | 653| 0| state.client_verify( 654| 0| std::make_unique(state.handshake_io(), state, policy(), rng(), private_key.get())); 655| 0| } 656| | 657| 313| state.handshake_io().send(Change_Cipher_Spec()); 658| | 659| 313| change_cipher_spec_writer(Connection_Side::Client); 660| | 661| 313| state.client_finished(std::make_unique(state.handshake_io(), state, Connection_Side::Client)); 662| | 663| 313| if(state.server_hello()->supports_session_ticket()) { ------------------ | Branch (663:10): [True: 36, False: 277] ------------------ 664| 36| state.set_expected_next(Handshake_Type::NewSessionTicket); 665| 277| } else { 666| 277| state.set_expected_next(Handshake_Type::HandshakeCCS); 667| 277| } 668| 313| } else if(type == Handshake_Type::NewSessionTicket) { ------------------ | Branch (668:14): [True: 6, False: 57] ------------------ 669| 6| state.new_session_ticket(std::make_unique(contents)); 670| | 671| 6| state.set_expected_next(Handshake_Type::HandshakeCCS); 672| 57| } else if(type == Handshake_Type::HandshakeCCS) { ------------------ | Branch (672:14): [True: 7, False: 50] ------------------ 673| 7| state.set_expected_next(Handshake_Type::Finished); 674| | 675| 7| change_cipher_spec_reader(Connection_Side::Client); 676| 50| } else if(type == Handshake_Type::Finished) { ------------------ | Branch (676:14): [True: 4, False: 46] ------------------ 677| 4| if(state.handshake_io().have_more_data()) { ------------------ | Branch (677:10): [True: 2, False: 2] ------------------ 678| 2| throw TLS_Exception(Alert::UnexpectedMessage, "Have data remaining in buffer after Finished"); 679| 2| } 680| | 681| 2| state.server_finished(std::make_unique(contents)); 682| | 683| 2| if(!state.server_finished()->verify(state, Connection_Side::Server)) { ------------------ | Branch (683:10): [True: 0, False: 2] ------------------ 684| 0| throw TLS_Exception(Alert::DecryptError, "Finished message didn't verify"); 685| 0| } 686| | 687| 2| state.hash().update(state.handshake_io().format(contents, type)); 688| | 689| 2| if(state.client_finished() == nullptr) { ------------------ | Branch (689:10): [True: 0, False: 2] ------------------ 690| | // session resume case 691| 0| state.handshake_io().send(Change_Cipher_Spec()); 692| 0| change_cipher_spec_writer(Connection_Side::Client); 693| 0| state.client_finished(std::make_unique(state.handshake_io(), state, Connection_Side::Client)); 694| 0| } 695| | 696| | // Session Tickets (as defined in RFC 5077) contain a lifetime_hint, 697| | // sessions identified via a Session_ID do not. 698| 2| const std::chrono::seconds session_lifetime_hint = [&] { 699| 2| if(state.new_session_ticket() != nullptr) { 700| 2| return std::chrono::seconds(state.new_session_ticket()->ticket_lifetime_hint()); 701| 2| } else { 702| 2| return std::chrono::seconds::max(); 703| 2| } 704| 2| }(); 705| | 706| 2| Session session_info(state.session_keys().master_secret(), 707| 2| state.server_hello()->legacy_version(), 708| 2| state.server_hello()->ciphersuite(), 709| 2| Connection_Side::Client, 710| 2| state.server_hello()->supports_extended_master_secret(), 711| 2| state.server_hello()->supports_encrypt_then_mac(), 712| 2| state.peer_cert_chain(), 713| 2| m_info, 714| 2| state.server_hello()->srtp_profile(), 715| 2| callbacks().tls_current_timestamp(), 716| 2| session_lifetime_hint); 717| | 718| | // RFC 5077 3.4 719| | // If the client receives a session ticket from the server, then it 720| | // discards any Session ID that was sent in the ServerHello. 721| 2| const auto handle = [&]() -> std::optional { 722| | /* 723| | On successful resumption an empty (or absent) NewSessionTicket means "keep using 724| | the old ticket" so we inherit it from the ClientHello. On a fresh negotiation 725| | an empty NewSessionTicket means "no ticket for this session", so inheriting the 726| | ClientHello's old ticket would store the new master secret under a ticket the 727| | server has discarded. 728| | */ 729| 2| if(const auto* nst = state.new_session_ticket(); nst != nullptr && !nst->ticket().empty()) { 730| 2| return Session_Handle(nst->ticket()); 731| 2| } 732| 2| if(state.is_a_resumption() && !state.client_hello()->session_ticket().empty()) { 733| 2| return Session_Handle(state.client_hello()->session_ticket()); 734| 2| } 735| 2| if(const auto& session_id = state.server_hello()->session_id(); !session_id.empty()) { 736| 2| return Session_Handle(session_id); 737| 2| } 738| 2| return std::nullopt; 739| 2| }(); 740| | 741| | // Give the application a chance for a final veto before fully 742| | // establishing the connection. 743| 2| callbacks().tls_session_established([&, this] { 744| 2| Session_Summary summary(session_info, state.is_a_resumption(), external_psk_identity()); 745| 2| summary.set_session_id(state.server_hello()->session_id()); 746| 2| if(const auto* nst = state.new_session_ticket()) { 747| 2| summary.set_session_ticket(nst->ticket()); 748| 2| } 749| 2| return summary; 750| 2| }()); 751| | 752| 2| if(handle.has_value()) { ------------------ | Branch (752:10): [True: 2, False: 0] ------------------ 753| 2| const bool should_save = callbacks().tls_should_persist_resumption_information(session_info); 754| | 755| | // RFC 5077 3.3 756| | // If the server successfully verifies the client's ticket, then it 757| | // MAY renew the ticket by including a NewSessionTicket handshake 758| | // message after the ServerHello in the abbreviated handshake. The 759| | // client should start using the new ticket as soon as possible 760| | // after it verifies the server's Finished message for new 761| | // connections. 762| 2| if(state.is_a_resumption() && !state.client_hello()->session_ticket().empty() && handle->is_ticket() && ------------------ | Branch (762:13): [True: 0, False: 2] | Branch (762:13): [True: 0, False: 2] | Branch (762:40): [True: 0, False: 0] | Branch (762:91): [True: 0, False: 0] ------------------ 763| 0| should_save) { ------------------ | Branch (763:13): [True: 0, False: 0] ------------------ 764| | // renew the session ticket by removing the one we used to establish 765| | // this connection and replace it with the one we just received 766| 0| session_manager().remove(Session_Handle(state.client_hello()->session_ticket())); 767| 0| session_manager().store(session_info, handle.value()); 768| 0| } 769| | 770| 2| if(!state.is_a_resumption()) { ------------------ | Branch (770:13): [True: 2, False: 0] ------------------ 771| 2| if(should_save) { ------------------ | Branch (771:16): [True: 2, False: 0] ------------------ 772| 2| session_manager().store(session_info, handle.value()); 773| 2| } else { 774| 0| session_manager().remove(handle.value()); 775| 0| } 776| 2| } 777| 2| } 778| | 779| 2| activate_session(); 780| 46| } else { 781| 46| throw Unexpected_Message("Unknown handshake message received"); 782| 46| } 783| 10.7k|} tls_client_impl_12.cpp:_ZNK5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1215is_a_resumptionEv: 44| 10| bool is_a_resumption() const { return m_resumed_session.has_value(); } tls_client_impl_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1224discard_resumption_stateEv: 46| 3.12k| void discard_resumption_state() { m_resumed_session.reset(); } tls_client_impl_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_129key_usage_matches_ciphersuiteENS_15Key_ConstraintsERKNS0_11CiphersuiteE: 233| 366|bool key_usage_matches_ciphersuite(Key_Constraints usage, const Ciphersuite& suite) { 234| 366| if(usage == Key_Constraints::None) { ------------------ | Branch (234:7): [True: 48, False: 318] ------------------ 235| 48| return true; // anything goes ... 236| 48| } 237| | 238| 318| if(suite.kex_method() == Kex_Algo::STATIC_RSA) { ------------------ | Branch (238:7): [True: 2, False: 316] ------------------ 239| 2| return usage.includes_any(Key_Constraints::KeyEncipherment, Key_Constraints::DataEncipherment); 240| 316| } else { 241| 316| return usage.includes_any(Key_Constraints::DigitalSignature, Key_Constraints::NonRepudiation); 242| 316| } 243| 318|} tls_client_impl_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1224record_server_public_keyENSt3__110unique_ptrINS_10Public_KeyENS3_14default_deleteIS5_EEEE: 39| 361| void record_server_public_key(std::unique_ptr spk) { 40| 361| BOTAN_STATE_CHECK(!m_server_public_key); ------------------ | | 51| 361| do { \ | | 52| 361| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 361| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 361] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 361| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 361] | | ------------------ ------------------ 41| 361| m_server_public_key = std::move(spk); 42| 361| } tls_client_impl_12.cpp:_ZNK5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1217server_public_keyEv: 32| 311| const Public_Key& server_public_key() const { 33| 311| BOTAN_ASSERT(m_server_public_key, "Server sent us a certificate"); ------------------ | | 64| 311| do { \ | | 65| 311| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 311| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 311] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 311| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 311] | | ------------------ ------------------ 34| 311| return *m_server_public_key; 35| 311| } tls_client_impl_12.cpp:_ZNK5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1223maybe_server_public_keyEv: 37| 313| const Public_Key* maybe_server_public_key() const { return m_server_public_key.get(); } tls_client_impl_12.cpp:_ZZN5Botan3TLS14Client_Impl_1221process_handshake_msgERNS0_15Handshake_StateENS0_14Handshake_TypeERKNSt3__16vectorIhNS5_9allocatorIhEEEEbENK3$_0clEv: 698| 2| const std::chrono::seconds session_lifetime_hint = [&] { 699| 2| if(state.new_session_ticket() != nullptr) { ------------------ | Branch (699:13): [True: 2, False: 0] ------------------ 700| 2| return std::chrono::seconds(state.new_session_ticket()->ticket_lifetime_hint()); 701| 2| } else { 702| 0| return std::chrono::seconds::max(); 703| 0| } 704| 2| }(); tls_client_impl_12.cpp:_ZNK5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_1215peer_cert_chainEv: 77| 4| std::vector peer_cert_chain() const override { 78| 4| if(is_a_resumption()) { ------------------ | Branch (78:13): [True: 0, False: 4] ------------------ 79| 0| return resume_peer_certs(); 80| 0| } 81| 4| if(server_certs() != nullptr) { ------------------ | Branch (81:13): [True: 4, False: 0] ------------------ 82| 4| return server_certs()->cert_chain(); 83| 4| } 84| 0| return {}; 85| 4| } tls_client_impl_12.cpp:_ZZN5Botan3TLS14Client_Impl_1221process_handshake_msgERNS0_15Handshake_StateENS0_14Handshake_TypeERKNSt3__16vectorIhNS5_9allocatorIhEEEEbENK3$_1clEv: 721| 2| const auto handle = [&]() -> std::optional { 722| | /* 723| | On successful resumption an empty (or absent) NewSessionTicket means "keep using 724| | the old ticket" so we inherit it from the ClientHello. On a fresh negotiation 725| | an empty NewSessionTicket means "no ticket for this session", so inheriting the 726| | ClientHello's old ticket would store the new master secret under a ticket the 727| | server has discarded. 728| | */ 729| 2| if(const auto* nst = state.new_session_ticket(); nst != nullptr && !nst->ticket().empty()) { ------------------ | Branch (729:59): [True: 2, False: 0] | Branch (729:77): [True: 2, False: 0] ------------------ 730| 2| return Session_Handle(nst->ticket()); 731| 2| } 732| 0| if(state.is_a_resumption() && !state.client_hello()->session_ticket().empty()) { ------------------ | Branch (732:13): [True: 0, False: 0] | Branch (732:13): [True: 0, False: 0] | Branch (732:40): [True: 0, False: 0] ------------------ 733| 0| return Session_Handle(state.client_hello()->session_ticket()); 734| 0| } 735| 0| if(const auto& session_id = state.server_hello()->session_id(); !session_id.empty()) { ------------------ | Branch (735:74): [True: 0, False: 0] ------------------ 736| 0| return Session_Handle(session_id); 737| 0| } 738| 0| return std::nullopt; 739| 0| }(); tls_client_impl_12.cpp:_ZZN5Botan3TLS14Client_Impl_1221process_handshake_msgERNS0_15Handshake_StateENS0_14Handshake_TypeERKNSt3__16vectorIhNS5_9allocatorIhEEEEbENK3$_2clEv: 743| 2| callbacks().tls_session_established([&, this] { 744| 2| Session_Summary summary(session_info, state.is_a_resumption(), external_psk_identity()); 745| 2| summary.set_session_id(state.server_hello()->session_id()); 746| 2| if(const auto* nst = state.new_session_ticket()) { ------------------ | Branch (746:25): [True: 2, False: 0] ------------------ 747| 2| summary.set_session_ticket(nst->ticket()); 748| 2| } 749| 2| return summary; 750| 2| }()); tls_client_impl_12.cpp:_ZN5Botan3TLS12_GLOBAL__N_125Client_Handshake_State_12C2ENSt3__110unique_ptrINS0_12Handshake_IOENS3_14default_deleteIS5_EEEERNS0_9CallbacksE: 30| 7.28k| Handshake_State(std::move(io), cb), m_is_reneg(false) {} _ZN5Botan3TLS26Active_Connection_State_12D2Ev: 15| 4|Active_Connection_State_12::~Active_Connection_State_12() = default; _ZN5Botan3TLS26Active_Connection_State_12C2EOS1_: 16| 2|Active_Connection_State_12::Active_Connection_State_12(Active_Connection_State_12&&) noexcept = default; _ZN5Botan3TLS26Active_Connection_State_12C2ERKNS0_15Handshake_StateENSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEE: 20| 2| m_version(state.version()), 21| 2| m_ciphersuite_code(state.server_hello()->ciphersuite()), 22| 2| m_application_protocol(std::move(application_protocol)), 23| 2| m_peer_certs(state.peer_cert_chain()), 24| 2| m_client_random(state.client_hello()->random()), 25| 2| m_psk_identity(state.psk_identity()), 26| 2| m_server_random(state.server_hello()->random()), 27| 2| m_session_id(state.server_hello()->session_id()), 28| 2| m_master_secret(state.session_keys().master_secret()), 29| 2| m_prf_algo(state.ciphersuite().prf_algo()), 30| 2| m_client_supports_secure_renegotiation(state.client_hello()->secure_renegotiation()), 31| 2| m_server_supports_secure_renegotiation(state.server_hello()->secure_renegotiation()), 32| 2| m_client_finished_verify_data(state.client_finished()->verify_data()), 33| 2| m_server_finished_verify_data(state.server_finished()->verify_data()), 34| 2| m_supports_extended_master_secret(state.server_hello()->supports_extended_master_secret()) {} _ZN5Botan3TLS23Renegotiation_ExtensionC2ERNS0_15TLS_Data_ReaderEt: 24| 3.34k| m_reneg_data(reader.get_range(1, 0, 255)) { 25| 3.34k| if(m_reneg_data.size() + 1 != extension_size) { ------------------ | Branch (25:7): [True: 6, False: 3.33k] ------------------ 26| 6| throw Decoding_Error("Bad encoding for secure renegotiation extn"); 27| 6| } 28| 3.34k|} _ZNK5Botan3TLS23Renegotiation_Extension9serializeENS0_15Connection_SideE: 30| 7.28k|std::vector Renegotiation_Extension::serialize(Connection_Side /*whoami*/) const { 31| 7.28k| std::vector buf; 32| 7.28k| append_tls_length_value(buf, m_reneg_data, 1); 33| 7.28k| return buf; 34| 7.28k|} _ZNK5Botan3TLS23Supported_Point_Formats9serializeENS0_15Connection_SideE: 36| 7.28k|std::vector Supported_Point_Formats::serialize(Connection_Side /*whoami*/) const { 37| | // if this extension is sent, it MUST include uncompressed (RFC 4492, section 5.1) 38| 7.28k| if(m_prefers_compressed) { ------------------ | Branch (38:7): [True: 0, False: 7.28k] ------------------ 39| 0| return std::vector{2, ANSIX962_COMPRESSED_PRIME, UNCOMPRESSED}; 40| 7.28k| } else { 41| 7.28k| return std::vector{1, UNCOMPRESSED}; 42| 7.28k| } 43| 7.28k|} _ZN5Botan3TLS23Supported_Point_FormatsC2ERNS0_15TLS_Data_ReaderEt: 45| 370|Supported_Point_Formats::Supported_Point_Formats(TLS_Data_Reader& reader, uint16_t extension_size) { 46| 370| const uint8_t len = reader.get_byte(); 47| | 48| 370| if(len + 1 != extension_size) { ------------------ | Branch (48:7): [True: 4, False: 366] ------------------ 49| 4| throw Decoding_Error("Inconsistent length field in supported point formats list"); 50| 4| } 51| | 52| 366| bool includes_uncompressed = false; 53| 606| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (53:22): [True: 599, False: 7] ------------------ 54| 599| const uint8_t format = reader.get_byte(); 55| | 56| 599| if(static_cast(format) == UNCOMPRESSED) { ------------------ | Branch (56:10): [True: 342, False: 257] ------------------ 57| 342| m_prefers_compressed = false; 58| 342| reader.discard_next(len - i - 1); 59| 342| return; 60| 342| } else if(static_cast(format) == ANSIX962_COMPRESSED_PRIME) { ------------------ | Branch (60:17): [True: 17, False: 240] ------------------ 61| 17| m_prefers_compressed = true; 62| 17| std::vector remaining_formats = reader.get_fixed(len - i - 1); 63| 17| includes_uncompressed = 64| 17| std::any_of(std::begin(remaining_formats), std::end(remaining_formats), [](uint8_t remaining_format) { 65| 17| return static_cast(remaining_format) == UNCOMPRESSED; 66| 17| }); 67| 17| break; 68| 17| } 69| | 70| | // ignore ANSIX962_COMPRESSED_CHAR2, we don't support these curves 71| 599| } 72| | 73| | // RFC 4492 5.1.: 74| | // If the Supported Point Formats Extension is indeed sent, it MUST contain the value 0 (uncompressed) 75| | // as one of the items in the list of point formats. 76| | // Note: 77| | // RFC 8422 5.1.2. explicitly requires this check, 78| | // but only if the Supported Groups extension was sent. 79| 24| if(!includes_uncompressed) { ------------------ | Branch (79:7): [True: 16, False: 8] ------------------ 80| 16| throw TLS_Exception(Alert::IllegalParameter, 81| 16| "Supported Point Formats Extension must contain the uncompressed point format"); 82| 16| } 83| 24|} _ZN5Botan3TLS24Session_Ticket_ExtensionC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 87| 3.09k| Connection_Side from) { 88| | // RFC 5077 3.2: in a ServerHello the SessionTicket extension is just a 89| | // flag indicating that a NewSessionTicket handshake message will follow; 90| | // its extension_data MUST be empty. A ticket body is only valid in a 91| | // ClientHello. 92| 3.09k| if(from == Connection_Side::Server && extension_size != 0) { ------------------ | Branch (92:7): [True: 3.09k, False: 0] | Branch (92:42): [True: 31, False: 3.06k] ------------------ 93| 31| throw Decoding_Error("Server sent a non-empty SessionTicket extension"); 94| 31| } 95| 3.06k| m_ticket = Session_Ticket(reader.get_elem>(extension_size)); 96| 3.06k|} _ZN5Botan3TLS22Extended_Master_SecretC2ERNS0_15TLS_Data_ReaderEt: 98| 3.14k|Extended_Master_Secret::Extended_Master_Secret(TLS_Data_Reader& /*unused*/, uint16_t extension_size) { 99| 3.14k| if(extension_size != 0) { ------------------ | Branch (99:7): [True: 1, False: 3.14k] ------------------ 100| 1| throw Decoding_Error("Invalid extended_master_secret extension"); 101| 1| } 102| 3.14k|} _ZNK5Botan3TLS22Extended_Master_Secret9serializeENS0_15Connection_SideE: 104| 7.28k|std::vector Extended_Master_Secret::serialize(Connection_Side /*whoami*/) const { 105| 7.28k| return std::vector(); 106| 7.28k|} _ZN5Botan3TLS16Encrypt_then_MACC2ERNS0_15TLS_Data_ReaderEt: 108| 38|Encrypt_then_MAC::Encrypt_then_MAC(TLS_Data_Reader& /*unused*/, uint16_t extension_size) { 109| 38| if(extension_size != 0) { ------------------ | Branch (109:7): [True: 1, False: 37] ------------------ 110| 1| throw Decoding_Error("Invalid encrypt_then_mac extension"); 111| 1| } 112| 38|} _ZNK5Botan3TLS16Encrypt_then_MAC9serializeENS0_15Connection_SideE: 114| 7.28k|std::vector Encrypt_then_MAC::serialize(Connection_Side /*whoami*/) const { 115| 7.28k| return std::vector(); 116| 7.28k|} tls_extensions_12.cpp:_ZZN5Botan3TLS23Supported_Point_FormatsC1ERNS0_15TLS_Data_ReaderEtENK3$_0clEh: 64| 216| std::any_of(std::begin(remaining_formats), std::end(remaining_formats), [](uint8_t remaining_format) { 65| 216| return static_cast(remaining_format) == UNCOMPRESSED; 66| 216| }); _ZNK5Botan3TLS14Handshake_Hash5finalENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 17| 114|secure_vector Handshake_Hash::final(std::string_view mac_algo) const { 18| 114| std::string hash_algo(mac_algo); 19| 114| if(hash_algo == "SHA-1") { ------------------ | Branch (19:7): [True: 22, False: 92] ------------------ 20| 22| hash_algo = "SHA-256"; 21| 22| } 22| | 23| 114| auto hash = HashFunction::create_or_throw(hash_algo); 24| 114| hash->update(m_data); 25| 114| return hash->final(); 26| 114|} _ZNK5Botan3TLS19Stream_Handshake_IO22initial_record_versionEv: 52| 7.28k|Protocol_Version Stream_Handshake_IO::initial_record_version() const { 53| 7.28k| return Protocol_Version::TLS_V12; 54| 7.28k|} _ZN5Botan3TLS19Stream_Handshake_IO10add_recordEPKhmNS0_11Record_TypeEm: 59| 11.6k| uint64_t /*sequence_number*/) { 60| 11.6k| if(record_type == Record_Type::Handshake) { ------------------ | Branch (60:7): [True: 11.6k, False: 47] ------------------ 61| 11.6k| m_queue.insert(m_queue.end(), record, record + record_len); 62| 11.6k| } else if(record_type == Record_Type::ChangeCipherSpec) { ------------------ | Branch (62:14): [True: 47, False: 0] ------------------ 63| 47| if(record_len != 1 || record[0] != 1) { ------------------ | Branch (63:10): [True: 4, False: 43] | Branch (63:29): [True: 11, False: 32] ------------------ 64| 15| throw Decoding_Error("Invalid ChangeCipherSpec"); 65| 15| } 66| | 67| | // Pretend it's a regular handshake message of zero length 68| 32| const uint8_t ccs_hs[] = {static_cast(Handshake_Type::HandshakeCCS), 0, 0, 0}; 69| 32| m_queue.insert(m_queue.end(), ccs_hs, ccs_hs + sizeof(ccs_hs)); 70| 32| } else { 71| 0| throw Decoding_Error("Unknown message type " + std::to_string(static_cast(record_type)) + 72| 0| " in handshake processing"); 73| 0| } 74| 11.6k|} _ZN5Botan3TLS19Stream_Handshake_IO15get_next_recordEbm: 77| 15.5k| size_t max_message_size) { 78| 15.5k| if(m_queue.size() >= 4) { ------------------ | Branch (78:7): [True: 11.3k, False: 4.11k] ------------------ 79| 11.3k| const Handshake_Type type = static_cast(m_queue[0]); 80| | 81| 11.3k| const size_t rec_length = make_uint32(0, m_queue[1], m_queue[2], m_queue[3]); 82| | 83| | // If we are expecting a CCS but the next queued message is not a CCS, 84| | // the peer has skipped the CCS message. This can happen when the peer 85| | // sends an encrypted Finished without the preceding CCS, in which case 86| | // the encrypted bytes are misinterpreted as a handshake message. 87| 11.3k| if(expecting_ccs) { ------------------ | Branch (87:10): [True: 18, False: 11.3k] ------------------ 88| 18| const bool is_ccs = (type == Handshake_Type::HandshakeCCS && rec_length == 0); ------------------ | Branch (88:31): [True: 18, False: 0] | Branch (88:71): [True: 7, False: 11] ------------------ 89| 18| if(!is_ccs) { ------------------ | Branch (89:13): [True: 11, False: 7] ------------------ 90| 11| throw TLS_Exception(Alert::UnexpectedMessage, "Expected ChangeCipherSpec but got a handshake message"); 91| 11| } 92| 11.3k| } else { 93| 11.3k| verify_is_expected_wire_handshake_type(type); 94| | 95| 11.3k| if(max_message_size > 0 && rec_length > max_message_size) { ------------------ | Branch (95:13): [True: 11.3k, False: 21] | Branch (95:37): [True: 123, False: 11.2k] ------------------ 96| 123| throw TLS_Exception( 97| 123| Alert::HandshakeFailure, 98| 123| Botan::fmt("Handshake message is {} bytes, policy maximum is {}", rec_length, max_message_size)); 99| 123| } 100| 11.3k| } 101| | 102| 11.2k| const size_t length = 4 + rec_length; 103| | 104| 11.2k| if(m_queue.size() >= length) { ------------------ | Branch (104:10): [True: 10.7k, False: 539] ------------------ 105| 10.7k| const std::vector contents(m_queue.begin() + 4, m_queue.begin() + length); 106| | 107| 10.7k| m_queue.erase(m_queue.begin(), m_queue.begin() + length); 108| | 109| 10.7k| return std::make_pair(type, contents); 110| 10.7k| } 111| 11.2k| } 112| | 113| 4.65k| return std::make_pair(Handshake_Type::None, std::vector()); 114| 15.5k|} _ZNK5Botan3TLS19Stream_Handshake_IO6formatERKNSt3__16vectorIhNS2_9allocatorIhEEEENS0_14Handshake_TypeE: 116| 18.0k|std::vector Stream_Handshake_IO::format(const std::vector& msg, Handshake_Type type) const { 117| 18.0k| std::vector send_buf(4 + msg.size()); 118| | 119| 18.0k| const size_t buf_size = msg.size(); 120| | 121| 18.0k| send_buf[0] = static_cast(type); 122| | 123| 18.0k| store_be24(&send_buf[1], buf_size); 124| | 125| 18.0k| if(!msg.empty()) { ------------------ | Branch (125:7): [True: 17.7k, False: 314] ------------------ 126| 17.7k| copy_mem(&send_buf[4], msg.data(), msg.size()); 127| 17.7k| } 128| | 129| 18.0k| return send_buf; 130| 18.0k|} _ZN5Botan3TLS19Stream_Handshake_IO4sendERKNS0_17Handshake_MessageE: 136| 7.45k|std::vector Stream_Handshake_IO::send(const Handshake_Message& msg) { 137| 7.45k| const std::vector msg_bits = msg.serialize(); 138| | 139| 7.45k| if(msg.type() == Handshake_Type::HandshakeCCS) { ------------------ | Branch (139:7): [True: 56, False: 7.39k] ------------------ 140| 56| m_send_hs(Record_Type::ChangeCipherSpec, msg_bits); 141| 56| return std::vector(); // not included in handshake hashes 142| 56| } 143| | 144| 7.39k| auto buf = format(msg_bits, msg.wire_type()); 145| 7.39k| m_send_hs(Record_Type::Handshake, buf); 146| 7.39k| return buf; 147| 7.45k|} tls_handshake_io.cpp:_ZN5Botan3TLS12_GLOBAL__N_138verify_is_expected_wire_handshake_typeENS0_14Handshake_TypeE: 28| 11.3k|void verify_is_expected_wire_handshake_type(Handshake_Type type) { 29| 11.3k| switch(type) { 30| 1| case Handshake_Type::HelloRetryRequest: ------------------ | Branch (30:7): [True: 1, False: 11.3k] ------------------ 31| 7| case Handshake_Type::HandshakeCCS: ------------------ | Branch (31:7): [True: 6, False: 11.3k] ------------------ 32| 21| case Handshake_Type::None: ------------------ | Branch (32:7): [True: 14, False: 11.3k] ------------------ 33| 21| throw TLS_Exception(Alert::UnexpectedMessage, "Invalid handshake message type"); 34| 11.3k| default: ------------------ | Branch (34:7): [True: 11.3k, False: 21] ------------------ 35| 11.3k| break; 36| 11.3k| } 37| 11.3k|} tls_handshake_io.cpp:_ZN5Botan3TLS12_GLOBAL__N_110store_be24EPhm: 39| 18.0k|void store_be24(uint8_t out[3], size_t val) { 40| 18.0k| out[0] = get_byte<1>(static_cast(val)); 41| 18.0k| out[1] = get_byte<2>(static_cast(val)); 42| 18.0k| out[2] = get_byte<3>(static_cast(val)); 43| 18.0k|} _ZN5Botan3TLS15Handshake_StateD2Ev: 28| 7.28k|Handshake_State::~Handshake_State() = default; _ZN5Botan3TLS15Handshake_StateC2ENSt3__110unique_ptrINS0_12Handshake_IOENS2_14default_deleteIS4_EEEERNS0_9CallbacksE: 31| 7.28k| m_callbacks(cb), m_handshake_io(std::move(io)), m_version(m_handshake_io->initial_record_version()) {} _ZN5Botan3TLS15Handshake_State12note_messageERKNS0_17Handshake_MessageE: 33| 14.4k|void Handshake_State::note_message(const Handshake_Message& msg) { 34| 14.4k| m_callbacks.tls_inspect_handshake_msg(msg); 35| 14.4k|} _ZN5Botan3TLS15Handshake_State12client_helloENSt3__110unique_ptrINS0_15Client_Hello_12ENS2_14default_deleteIS4_EEEE: 47| 7.28k|void Handshake_State::client_hello(std::unique_ptr client_hello) { 48| | // Legacy behavior (exception to the rule): Allow client_hello to be nullptr to reset state. 49| 7.28k| if(client_hello == nullptr) { ------------------ | Branch (49:7): [True: 0, False: 7.28k] ------------------ 50| 0| m_client_hello.reset(); 51| 0| hash().reset(); 52| 7.28k| } else { 53| 7.28k| m_client_hello = std::move(client_hello); 54| 7.28k| note_message(*m_client_hello); 55| 7.28k| } 56| 7.28k|} _ZN5Botan3TLS15Handshake_State12server_helloENSt3__110unique_ptrINS0_15Server_Hello_12ENS2_14default_deleteIS4_EEEE: 58| 5.52k|void Handshake_State::server_hello(std::unique_ptr server_hello) { 59| 5.52k| BOTAN_ASSERT_NONNULL(server_hello); ------------------ | | 116| 5.52k| do { \ | | 117| 5.52k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 5.52k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 5.52k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 5.52k] | | ------------------ ------------------ 60| 5.52k| m_server_hello = std::move(server_hello); 61| 5.52k| m_ciphersuite = Ciphersuite::by_id(m_server_hello->ciphersuite()); 62| 5.52k| note_message(*m_server_hello); 63| 5.52k|} _ZN5Botan3TLS15Handshake_State12server_certsENSt3__110unique_ptrINS0_14Certificate_12ENS2_14default_deleteIS4_EEEE: 65| 914|void Handshake_State::server_certs(std::unique_ptr server_certs) { 66| 914| BOTAN_ASSERT_NONNULL(server_certs); ------------------ | | 116| 914| do { \ | | 117| 914| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 914] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 914| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 914] | | ------------------ ------------------ 67| 914| m_server_certs = std::move(server_certs); 68| 914| note_message(*m_server_certs); 69| 914|} _ZN5Botan3TLS15Handshake_State10server_kexENSt3__110unique_ptrINS0_19Server_Key_ExchangeENS2_14default_deleteIS4_EEEE: 77| 311|void Handshake_State::server_kex(std::unique_ptr server_kex) { 78| 311| BOTAN_ASSERT_NONNULL(server_kex); ------------------ | | 116| 311| do { \ | | 117| 311| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 311] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 311| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 311] | | ------------------ ------------------ 79| 311| m_server_kex = std::move(server_kex); 80| 311| note_message(*m_server_kex); 81| 311|} _ZN5Botan3TLS15Handshake_State17server_hello_doneENSt3__110unique_ptrINS0_17Server_Hello_DoneENS2_14default_deleteIS4_EEEE: 89| 313|void Handshake_State::server_hello_done(std::unique_ptr server_hello_done) { 90| 313| BOTAN_ASSERT_NONNULL(server_hello_done); ------------------ | | 116| 313| do { \ | | 117| 313| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 313] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 313| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 313] | | ------------------ ------------------ 91| 313| m_server_hello_done = std::move(server_hello_done); 92| 313| note_message(*m_server_hello_done); 93| 313|} _ZN5Botan3TLS15Handshake_State10client_kexENSt3__110unique_ptrINS0_19Client_Key_ExchangeENS2_14default_deleteIS4_EEEE: 101| 56|void Handshake_State::client_kex(std::unique_ptr client_kex) { 102| 56| BOTAN_ASSERT_NONNULL(client_kex); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 103| 56| m_client_kex = std::move(client_kex); 104| 56| note_message(*m_client_kex); 105| 56|} _ZN5Botan3TLS15Handshake_State18new_session_ticketENSt3__110unique_ptrINS0_21New_Session_Ticket_12ENS2_14default_deleteIS4_EEEE: 119| 6|void Handshake_State::new_session_ticket(std::unique_ptr new_session_ticket) { 120| 6| BOTAN_ASSERT_NONNULL(new_session_ticket); ------------------ | | 116| 6| do { \ | | 117| 6| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 6] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 6| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 6] | | ------------------ ------------------ 121| 6| m_new_session_ticket = std::move(new_session_ticket); 122| 6| note_message(*m_new_session_ticket); 123| 6|} _ZN5Botan3TLS15Handshake_State15server_finishedENSt3__110unique_ptrINS0_11Finished_12ENS2_14default_deleteIS4_EEEE: 125| 2|void Handshake_State::server_finished(std::unique_ptr server_finished) { 126| 2| BOTAN_ASSERT_NONNULL(server_finished); ------------------ | | 116| 2| do { \ | | 117| 2| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 2] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 2| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 2] | | ------------------ ------------------ 127| 2| m_server_finished = std::move(server_finished); 128| 2| note_message(*m_server_finished); 129| 2|} _ZN5Botan3TLS15Handshake_State15client_finishedENSt3__110unique_ptrINS0_11Finished_12ENS2_14default_deleteIS4_EEEE: 131| 56|void Handshake_State::client_finished(std::unique_ptr client_finished) { 132| 56| BOTAN_ASSERT_NONNULL(client_finished); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 133| 56| m_client_finished = std::move(client_finished); 134| 56| note_message(*m_client_finished); 135| 56|} _ZNK5Botan3TLS15Handshake_State11ciphersuiteEv: 137| 6.44k|const Ciphersuite& Handshake_State::ciphersuite() const { 138| 6.44k| if(!m_ciphersuite.has_value()) { ------------------ | Branch (138:7): [True: 0, False: 6.44k] ------------------ 139| 0| throw Invalid_State("Cipher suite is not set"); 140| 0| } 141| 6.44k| return m_ciphersuite.value(); 142| 6.44k|} _ZNK5Botan3TLS15Handshake_State12psk_identityEv: 144| 4|std::optional Handshake_State::psk_identity() const { 145| 4| if(!m_client_kex) { ------------------ | Branch (145:7): [True: 0, False: 4] ------------------ 146| 0| return std::nullopt; 147| 0| } 148| 4| return m_client_kex->psk_identity(); 149| 4|} _ZN5Botan3TLS15Handshake_State11set_versionERKNS0_16Protocol_VersionE: 151| 5.31k|void Handshake_State::set_version(const Protocol_Version& version) { 152| 5.31k| m_version = version; 153| 5.31k|} _ZN5Botan3TLS15Handshake_State20compute_session_keysEv: 155| 56|void Handshake_State::compute_session_keys() { 156| 56| BOTAN_ASSERT_NONNULL(client_kex()); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 157| 56| m_session_keys = Session_Keys(this, client_kex()->pre_master_secret(), false); 158| 56|} _ZN5Botan3TLS15Handshake_State21confirm_transition_toENS0_14Handshake_TypeE: 164| 10.7k|void Handshake_State::confirm_transition_to(Handshake_Type handshake_msg) { 165| 10.7k| m_transitions.confirm_transition_to(handshake_msg); 166| 10.7k|} _ZN5Botan3TLS15Handshake_State17set_expected_nextENS0_14Handshake_TypeE: 168| 11.5k|void Handshake_State::set_expected_next(Handshake_Type handshake_msg) { 169| 11.5k| m_transitions.set_expected_next(handshake_msg); 170| 11.5k|} _ZNK5Botan3TLS15Handshake_State22received_handshake_msgENS0_14Handshake_TypeE: 172| 369|bool Handshake_State::received_handshake_msg(Handshake_Type handshake_msg) const { 173| 369| return m_transitions.received_handshake_msg(handshake_msg); 174| 369|} _ZN5Botan3TLS15Handshake_State22get_next_handshake_msgEm: 176| 15.5k|std::pair> Handshake_State::get_next_handshake_msg(size_t max_handshake_msg_size) { 177| 15.5k| return m_handshake_io->get_next_record(m_transitions.change_cipher_spec_expected(), max_handshake_msg_size); 178| 15.5k|} _ZNK5Botan3TLS15Handshake_State21protocol_specific_prfEv: 192| 114|std::unique_ptr Handshake_State::protocol_specific_prf() const { 193| 114| return m_callbacks.tls12_protocol_specific_kdf(ciphersuite().prf_algo()); 194| 114|} _ZNK5Botan3TLS15Handshake_State16parse_sig_formatERKNS_10Public_KeyENS0_16Signature_SchemeERKNSt3__16vectorIS5_NS6_9allocatorIS5_EEEEbRKNS0_6PolicyE: 263| 311| const Policy& policy) const { 264| 311| const std::string key_type = key.algo_name(); 265| | 266| 311| if(!policy.allowed_signature_method(key_type)) { ------------------ | Branch (266:7): [True: 0, False: 311] ------------------ 267| 0| throw TLS_Exception(Alert::HandshakeFailure, "Rejecting " + key_type + " signature"); 268| 0| } 269| | 270| 311| if(!scheme.is_available()) { ------------------ | Branch (270:7): [True: 0, False: 311] ------------------ 271| 0| throw TLS_Exception(Alert::IllegalParameter, "Peer sent unknown signature scheme"); 272| 0| } 273| | 274| 311| if(key_type != scheme.algorithm_name()) { ------------------ | Branch (274:7): [True: 1, False: 310] ------------------ 275| 1| throw Decoding_Error("Counterparty sent inconsistent key and sig types"); 276| 1| } 277| | 278| 310| if(for_client_auth && cert_req() == nullptr) { ------------------ | Branch (278:7): [True: 0, False: 310] | Branch (278:26): [True: 0, False: 0] ------------------ 279| 0| throw TLS_Exception(Alert::HandshakeFailure, "No CertificateVerify message received"); 280| 0| } 281| | 282| | /* 283| | Confirm the signature type we just received against the 284| | supported_algos list that we sent; it better be there. 285| | */ 286| | 287| 310| const std::vector supported_algos = 288| 310| for_client_auth ? cert_req()->signature_schemes() : offered_schemes; ------------------ | Branch (288:7): [True: 0, False: 310] ------------------ 289| | 290| 310| if(!scheme.is_compatible_with(Protocol_Version::TLS_V12)) { ------------------ | Branch (290:7): [True: 0, False: 310] ------------------ 291| 0| throw TLS_Exception(Alert::IllegalParameter, "Peer sent unacceptable signature scheme"); 292| 0| } 293| | 294| 310| if(!supported_algos_include(supported_algos, scheme)) { ------------------ | Branch (294:7): [True: 0, False: 310] ------------------ 295| 0| throw TLS_Exception(Alert::IllegalParameter, 296| 0| "TLS signature extension did not allow for " + scheme.to_string() + " signature"); 297| 0| } 298| | 299| 310| if(!scheme.format().has_value()) { ------------------ | Branch (299:7): [True: 0, False: 310] ------------------ 300| 0| throw Invalid_Argument(key_type + " is invalid/unknown for TLS signatures"); 301| 0| } 302| | 303| 310| return std::make_pair(scheme.padding_string(), scheme.format().value()); 304| 310|} tls_handshake_state.cpp:_ZN5Botan3TLS12_GLOBAL__N_123supported_algos_includeERKNSt3__16vectorINS0_16Signature_SchemeENS2_9allocatorIS4_EEEES4_: 246| 310|bool supported_algos_include(const std::vector& schemes, Signature_Scheme received_scheme) { 247| 1.50k| for(const Signature_Scheme scheme : schemes) { ------------------ | Branch (247:38): [True: 1.50k, False: 0] ------------------ 248| 1.50k| if(scheme == received_scheme && scheme.is_available()) { ------------------ | Branch (248:10): [True: 310, False: 1.19k] | Branch (248:39): [True: 310, False: 0] ------------------ 249| 310| return true; 250| 310| } 251| 1.50k| } 252| | 253| 0| return false; 254| 310|} _ZN5Botan3TLS23Connection_Cipher_StateD2Ev: 33| 63|Connection_Cipher_State::~Connection_Cipher_State() = default; _ZN5Botan3TLS23Connection_Cipher_StateC2ENS0_16Protocol_VersionENS0_15Connection_SideEbRKNS0_11CiphersuiteERKNS0_12Session_KeysEb: 40| 63| bool uses_encrypt_then_mac) { 41| | // NOLINTBEGIN(*-prefer-member-initializer) 42| 63| m_nonce_format = suite.nonce_format(); 43| 63| m_nonce_bytes_from_record = suite.nonce_bytes_from_record(version); 44| 63| m_nonce_bytes_from_handshake = suite.nonce_bytes_from_handshake(); 45| | 46| 63| const secure_vector& aead_key = keys.aead_key(side); 47| 63| m_nonce = keys.nonce(side); 48| | // NOLINTEND(*-prefer-member-initializer) 49| | 50| 63| BOTAN_ASSERT_NOMSG(m_nonce.size() == m_nonce_bytes_from_handshake); ------------------ | | 77| 63| do { \ | | 78| 63| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 63| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 63] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 63| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 63] | | ------------------ ------------------ 51| | 52| 63| if(nonce_format() == Nonce_Format::CBC_MODE) { ------------------ | Branch (52:7): [True: 30, False: 33] ------------------ 53| 30|#if defined(BOTAN_HAS_TLS_CBC) 54| | // legacy CBC+HMAC mode 55| 30| auto mac = MessageAuthenticationCode::create_or_throw(fmt("HMAC({})", suite.mac_algo())); 56| 30| auto cipher = BlockCipher::create_or_throw(suite.cipher_algo()); 57| | 58| 30| if(our_side) { ------------------ | Branch (58:10): [True: 23, False: 7] ------------------ 59| 23| m_aead = std::make_unique(std::move(cipher), 60| 23| std::move(mac), 61| 23| suite.cipher_keylen(), 62| 23| suite.mac_keylen(), 63| 23| version, 64| 23| uses_encrypt_then_mac); 65| 23| } else { 66| 7| m_aead = std::make_unique(std::move(cipher), 67| 7| std::move(mac), 68| 7| suite.cipher_keylen(), 69| 7| suite.mac_keylen(), 70| 7| version, 71| 7| uses_encrypt_then_mac); 72| 7| } 73| | 74| |#else 75| | BOTAN_UNUSED(uses_encrypt_then_mac); 76| | throw Internal_Error("Negotiated disabled TLS CBC+HMAC ciphersuite"); 77| |#endif 78| 33| } else if(nonce_format() == Nonce_Format::NULL_CIPHER) { ------------------ | Branch (78:14): [True: 0, False: 33] ------------------ 79| |#if defined(BOTAN_HAS_TLS_NULL) 80| | auto mac = MessageAuthenticationCode::create_or_throw(fmt("HMAC({})", suite.mac_algo())); 81| | 82| | if(our_side) { 83| | m_aead = std::make_unique(std::move(mac), suite.mac_keylen()); 84| | } else { 85| | m_aead = std::make_unique(std::move(mac), suite.mac_keylen()); 86| | } 87| |#else 88| 0| throw Internal_Error("Negotiated disabled TLS NULL ciphersuite"); 89| 0|#endif 90| 33| } else { 91| 33| m_aead = 92| 33| AEAD_Mode::create_or_throw(suite.cipher_algo(), our_side ? Cipher_Dir::Encryption : Cipher_Dir::Decryption); ------------------ | Branch (92:58): [True: 33, False: 0] ------------------ 93| 33| } 94| | 95| 63| m_aead->set_key(aead_key); 96| 63|} _ZN5Botan3TLS23Connection_Cipher_State10aead_nonceEmRNS_21RandomNumberGeneratorE: 98| 80|std::vector Connection_Cipher_State::aead_nonce(uint64_t seq, RandomNumberGenerator& rng) { 99| 80| switch(m_nonce_format) { ------------------ | Branch (99:11): [True: 80, False: 0] ------------------ 100| 0| case Nonce_Format::NULL_CIPHER: { ------------------ | Branch (100:7): [True: 0, False: 80] ------------------ 101| 0| return std::vector{}; 102| 0| } 103| 42| case Nonce_Format::CBC_MODE: { ------------------ | Branch (103:7): [True: 42, False: 38] ------------------ 104| 42| std::vector nonce(nonce_bytes_from_record()); 105| 42| rng.randomize(nonce.data(), nonce.size()); 106| 42| return nonce; 107| 0| } 108| 0| case Nonce_Format::AEAD_XOR_12: { ------------------ | Branch (108:7): [True: 0, False: 80] ------------------ 109| 0| BOTAN_ASSERT_NOMSG(m_nonce.size() == 12); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 110| 0| std::vector nonce(12); 111| 0| store_be(seq, nonce.data() + 4); 112| 0| xor_buf(nonce, m_nonce.data(), m_nonce.size()); 113| 0| return nonce; 114| 0| } 115| 38| case Nonce_Format::AEAD_IMPLICIT_4: { ------------------ | Branch (115:7): [True: 38, False: 42] ------------------ 116| 38| BOTAN_ASSERT_NOMSG(m_nonce.size() == 4); ------------------ | | 77| 38| do { \ | | 78| 38| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 38| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 38] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 38| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 38] | | ------------------ ------------------ 117| 38| std::vector nonce(12); 118| 38| copy_mem(&nonce[0], m_nonce.data(), 4); // NOLINT(*container-data-pointer) 119| 38| store_be(seq, &nonce[nonce_bytes_from_handshake()]); 120| 38| return nonce; 121| 0| } 122| 80| } 123| | 124| 0| throw Invalid_State("Unknown nonce format specified"); 125| 80|} _ZN5Botan3TLS23Connection_Cipher_State10aead_nonceEPKhmm: 127| 2|std::vector Connection_Cipher_State::aead_nonce(const uint8_t record[], size_t record_len, uint64_t seq) { 128| 2| switch(m_nonce_format) { ------------------ | Branch (128:11): [True: 2, False: 0] ------------------ 129| 0| case Nonce_Format::NULL_CIPHER: { ------------------ | Branch (129:7): [True: 0, False: 2] ------------------ 130| 0| return std::vector{}; 131| 0| } 132| 2| case Nonce_Format::CBC_MODE: { ------------------ | Branch (132:7): [True: 2, False: 0] ------------------ 133| 2| if(record_len < nonce_bytes_from_record()) { ------------------ | Branch (133:13): [True: 0, False: 2] ------------------ 134| 0| throw Decoding_Error("Invalid CBC packet too short to be valid"); 135| 0| } 136| 2| std::vector nonce(record, record + nonce_bytes_from_record()); 137| 2| return nonce; 138| 2| } 139| 0| case Nonce_Format::AEAD_XOR_12: { ------------------ | Branch (139:7): [True: 0, False: 2] ------------------ 140| 0| BOTAN_ASSERT_NOMSG(m_nonce.size() == 12); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 141| 0| std::vector nonce(12); 142| 0| store_be(seq, nonce.data() + 4); 143| 0| xor_buf(nonce, m_nonce.data(), m_nonce.size()); 144| 0| return nonce; 145| 2| } 146| 0| case Nonce_Format::AEAD_IMPLICIT_4: { ------------------ | Branch (146:7): [True: 0, False: 2] ------------------ 147| 0| BOTAN_ASSERT_NOMSG(m_nonce.size() == 4); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 148| 0| if(record_len < nonce_bytes_from_record()) { ------------------ | Branch (148:13): [True: 0, False: 0] ------------------ 149| 0| throw Decoding_Error("Invalid AEAD packet too short to be valid"); 150| 0| } 151| 0| std::vector nonce(12); 152| 0| copy_mem(&nonce[0], m_nonce.data(), 4); // NOLINT(*container-data-pointer) 153| 0| copy_mem(&nonce[nonce_bytes_from_handshake()], record, nonce_bytes_from_record()); 154| 0| return nonce; 155| 0| } 156| 2| } 157| | 158| 0| throw Invalid_State("Unknown nonce format specified"); 159| 2|} _ZN5Botan3TLS23Connection_Cipher_State9format_adEmNS0_11Record_TypeENS0_16Protocol_VersionEt: 164| 82| uint16_t msg_length) { 165| 82| std::vector ad(13); 166| | 167| 82| store_be(msg_sequence, &ad[0]); // NOLINT(*container-data-pointer) 168| 82| ad[8] = static_cast(msg_type); 169| 82| ad[9] = version.major_version(); 170| 82| ad[10] = version.minor_version(); 171| 82| ad[11] = get_byte<0>(msg_length); 172| 82| ad[12] = get_byte<1>(msg_length); 173| | 174| 82| return ad; 175| 82|} _ZN5Botan3TLS24write_unencrypted_recordERNSt3__16vectorIhNS_16secure_allocatorIhEEEENS0_11Record_TypeENS0_16Protocol_VersionEmPKhm: 210| 14.5k| size_t message_len) { 211| 14.5k| if(record_type == Record_Type::ApplicationData) { ------------------ | Branch (211:7): [True: 0, False: 14.5k] ------------------ 212| 0| throw Internal_Error("Writing an unencrypted TLS application data record"); 213| 0| } 214| 14.5k| write_record_header(output, record_type, version, record_sequence); 215| 14.5k| append_u16_len(output, message_len); 216| 14.5k| output.insert(output.end(), message, message + message_len); 217| 14.5k|} _ZN5Botan3TLS12write_recordERNSt3__16vectorIhNS_16secure_allocatorIhEEEENS0_11Record_TypeENS0_16Protocol_VersionEmPKhmRNS0_23Connection_Cipher_StateERNS_21RandomNumberGeneratorE: 226| 80| RandomNumberGenerator& rng) { 227| 80| write_record_header(output, record_type, version, record_sequence); 228| | 229| 80| AEAD_Mode& aead = cs.aead(); 230| 80| std::vector aad = cs.format_ad(record_sequence, record_type, version, static_cast(message_len)); 231| | 232| 80| const size_t ctext_size = aead.output_length(message_len); 233| | 234| 80| const size_t rec_size = ctext_size + cs.nonce_bytes_from_record(); 235| | 236| 80| aead.set_associated_data(aad); 237| | 238| 80| const std::vector nonce = cs.aead_nonce(record_sequence, rng); 239| | 240| 80| append_u16_len(output, rec_size); 241| | 242| 80| if(cs.nonce_bytes_from_record() > 0) { ------------------ | Branch (242:7): [True: 80, False: 0] ------------------ 243| 80| if(cs.nonce_format() == Nonce_Format::CBC_MODE) { ------------------ | Branch (243:10): [True: 42, False: 38] ------------------ 244| 42| output += nonce; 245| 42| } else { 246| 38| output += std::make_pair(&nonce[cs.nonce_bytes_from_handshake()], cs.nonce_bytes_from_record()); 247| 38| } 248| 80| } 249| | 250| 80| const size_t header_size = output.size(); 251| 80| output += std::make_pair(message, message_len); 252| | 253| 80| aead.start(nonce); 254| 80| aead.finish(output, header_size); 255| | 256| 80| BOTAN_ASSERT(output.size() < MAX_CIPHERTEXT_SIZE, "Produced ciphertext larger than protocol allows"); ------------------ | | 64| 80| do { \ | | 65| 80| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 80| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 80] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 80| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 80] | | ------------------ ------------------ 257| 80|} _ZN5Botan3TLS11read_recordEbRNSt3__16vectorIhNS_16secure_allocatorIhEEEEPKhmRmS6_PNS0_27Connection_Sequence_NumbersERKNS1_8functionIFNS1_10shared_ptrINS0_23Connection_Cipher_StateEEEtEEEb: 514| 13.6k| bool allow_epoch0_restart) { 515| 13.6k| if(is_datagram) { ------------------ | Branch (515:7): [True: 0, False: 13.6k] ------------------ 516| 0| return read_dtls_record( 517| 0| readbuf, input, input_len, consumed, recbuf, sequence_numbers, get_cipherstate, allow_epoch0_restart); 518| 13.6k| } else { 519| 13.6k| return read_tls_record(readbuf, input, input_len, consumed, recbuf, sequence_numbers, get_cipherstate); 520| 13.6k| } 521| 13.6k|} tls_record.cpp:_ZN5Botan3TLS12_GLOBAL__N_119write_record_headerERNSt3__16vectorIhNS_16secure_allocatorIhEEEENS0_11Record_TypeENS0_16Protocol_VersionEm: 189| 14.5k| uint64_t record_sequence) { 190| 14.5k| output.clear(); 191| | 192| 14.5k| output.push_back(static_cast(record_type)); 193| 14.5k| output.push_back(version.major_version()); 194| 14.5k| output.push_back(version.minor_version()); 195| | 196| 14.5k| if(version.is_datagram_protocol()) { ------------------ | Branch (196:7): [True: 0, False: 14.5k] ------------------ 197| 0| for(size_t i = 0; i != 8; ++i) { ------------------ | Branch (197:25): [True: 0, False: 0] ------------------ 198| 0| output.push_back(get_byte_var(i, record_sequence)); 199| 0| } 200| 0| } 201| 14.5k|} tls_record.cpp:_ZN5Botan3TLS12_GLOBAL__N_114append_u16_lenERNSt3__16vectorIhNS_16secure_allocatorIhEEEEm: 179| 14.5k|inline void append_u16_len(secure_vector& output, size_t len_field) { 180| 14.5k| const uint16_t len16 = static_cast(len_field); 181| 14.5k| BOTAN_ASSERT_EQUAL(len_field, len16, "No truncation"); ------------------ | | 90| 14.5k| do { \ | | 91| 14.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 92| 14.5k| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (92:10): [True: 0, False: 14.5k] | | ------------------ | | 93| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 94| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 95| 0| } \ | | 96| 14.5k| } while(0) | | ------------------ | | | Branch (96:12): [Folded, False: 14.5k] | | ------------------ ------------------ 182| 14.5k| output.push_back(get_byte<0>(len16)); 183| 14.5k| output.push_back(get_byte<1>(len16)); 184| 14.5k|} tls_record.cpp:_ZN5Botan3TLS12_GLOBAL__N_114fill_buffer_toERNSt3__16vectorIhNS_16secure_allocatorIhEEEERPKhRmSB_m: 262| 27.1k| secure_vector& readbuf, const uint8_t*& input, size_t& input_size, size_t& input_consumed, size_t desired) { 263| 27.1k| if(readbuf.size() >= desired) { ------------------ | Branch (263:7): [True: 0, False: 27.1k] ------------------ 264| 0| return 0; // already have it 265| 0| } 266| | 267| 27.1k| const size_t taken = std::min(input_size, desired - readbuf.size()); 268| | 269| 27.1k| readbuf.insert(readbuf.end(), input, input + taken); 270| 27.1k| input_consumed += taken; 271| 27.1k| input_size -= taken; 272| 27.1k| input += taken; 273| | 274| 27.1k| return (desired - readbuf.size()); // how many bytes do we still need? 275| 27.1k|} tls_record.cpp:_ZN5Botan3TLS12_GLOBAL__N_114decrypt_recordERNSt3__16vectorIhNS_16secure_allocatorIhEEEEPhmmNS0_16Protocol_VersionENS0_11Record_TypeERNS0_23Connection_Cipher_StateE: 283| 2| Connection_Cipher_State& cs) { 284| 2| AEAD_Mode& aead = cs.aead(); 285| | 286| 2| const std::vector nonce = cs.aead_nonce(record_contents, record_len, record_sequence); 287| 2| const uint8_t* msg = &record_contents[cs.nonce_bytes_from_record()]; 288| 2| const size_t msg_length = record_len - cs.nonce_bytes_from_record(); 289| | 290| | /* 291| | * This early rejection is based just on public information (length of the 292| | * encrypted packet) and so does not leak any information. We used to use 293| | * decode_error here which really is more appropriate, but that confuses some 294| | * tools which are attempting automated detection of padding oracles, 295| | * including older versions of TLS-Attacker. 296| | */ 297| 2| if(msg_length < aead.minimum_final_size()) { ------------------ | Branch (297:7): [True: 0, False: 2] ------------------ 298| 0| throw TLS_Exception(Alert::BadRecordMac, "AEAD packet is shorter than the tag"); 299| 0| } 300| | 301| 2| const size_t ptext_size = aead.output_length(msg_length); 302| | 303| 2| aead.set_associated_data( 304| 2| cs.format_ad(record_sequence, record_type, record_version, static_cast(ptext_size))); 305| | 306| 2| aead.start(nonce); 307| | 308| 2| output.assign(msg, msg + msg_length); 309| 2| aead.finish(output, 0); 310| 2|} tls_record.cpp:_ZN5Botan3TLS12_GLOBAL__N_115read_tls_recordERNSt3__16vectorIhNS_16secure_allocatorIhEEEEPKhmRmS7_PNS0_27Connection_Sequence_NumbersERKNS2_8functionIFNS2_10shared_ptrINS0_23Connection_Cipher_StateEEEtEEE: 318| 13.6k| const get_cipherstate_fn& get_cipherstate) { 319| 13.6k| if(readbuf.size() < TLS_HEADER_SIZE) { ------------------ | Branch (319:7): [True: 13.6k, False: 0] ------------------ 320| | // header incomplete 321| 13.6k| if(const size_t needed = fill_buffer_to(readbuf, input, input_len, consumed, TLS_HEADER_SIZE)) { ------------------ | Branch (321:23): [True: 49, False: 13.5k] ------------------ 322| 49| return Record_Header(needed); 323| 49| } 324| | 325| 13.5k| BOTAN_ASSERT_EQUAL(readbuf.size(), TLS_HEADER_SIZE, "Have an entire header"); ------------------ | | 90| 13.5k| do { \ | | 91| 13.5k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 92| 13.5k| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (92:10): [True: 0, False: 13.5k] | | ------------------ | | 93| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 94| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 95| 0| } \ | | 96| 13.5k| } while(0) | | ------------------ | | | Branch (96:12): [Folded, False: 13.5k] | | ------------------ ------------------ 326| 13.5k| } 327| | 328| | /* 329| | Verify that the record type and record version are within some expected 330| | range, so we can quickly reject totally invalid packets. 331| | 332| | Unfortunately we cannot be more strict about the record number than just 333| | checking the major version, at least at this level, due to this requirement 334| | in RFC 7568 335| | 336| | TLS servers MUST accept any value {03,XX} (including {03,00}) as 337| | the record layer version number for ClientHello 338| | */ 339| 13.5k| const bool bad_record_type = readbuf[0] < 20 || readbuf[0] > 23; ------------------ | Branch (339:33): [True: 13, False: 13.5k] | Branch (339:52): [True: 43, False: 13.5k] ------------------ 340| 13.5k| const bool bad_record_version = readbuf[1] != 3; 341| | 342| 13.5k| if(bad_record_type || bad_record_version) { ------------------ | Branch (342:7): [True: 56, False: 13.5k] | Branch (342:26): [True: 5, False: 13.5k] ------------------ 343| | // We know we read up to at least the 5 byte TLS header 344| 61| const std::string first5 = std::string(reinterpret_cast(readbuf.data()), 5); 345| | 346| 61| if(first5 == "GET /" || first5 == "PUT /" || first5 == "POST " || first5 == "HEAD ") { ------------------ | Branch (346:10): [True: 1, False: 60] | Branch (346:31): [True: 1, False: 59] | Branch (346:52): [True: 1, False: 58] | Branch (346:73): [True: 1, False: 57] ------------------ 347| 4| throw TLS_Exception(Alert::ProtocolVersion, "Client sent plaintext HTTP request instead of TLS handshake"); 348| 4| } 349| | 350| 57| if(first5 == "CONNE") { ------------------ | Branch (350:10): [True: 1, False: 56] ------------------ 351| 1| throw TLS_Exception(Alert::ProtocolVersion, 352| 1| "Client sent plaintext HTTP proxy CONNECT request instead of TLS handshake"); 353| 1| } 354| | 355| 56| if(bad_record_type) { ------------------ | Branch (355:10): [True: 51, False: 5] ------------------ 356| | // RFC 5246 Section 6. 357| | // If a TLS implementation receives an unexpected record type, it MUST 358| | // send an unexpected_message alert. 359| 51| throw TLS_Exception(Alert::UnexpectedMessage, "TLS record type had unexpected value"); 360| 51| } 361| 5| throw TLS_Exception(Alert::ProtocolVersion, "TLS record version had unexpected value"); 362| 56| } 363| | 364| 13.5k| const Protocol_Version version(readbuf[1], readbuf[2]); 365| | 366| 13.5k| if(version.is_datagram_protocol()) { ------------------ | Branch (366:7): [True: 0, False: 13.5k] ------------------ 367| 0| throw TLS_Exception(Alert::ProtocolVersion, "Expected TLS but got a record with DTLS version"); 368| 0| } 369| | 370| 13.5k| const size_t record_size = make_uint16(readbuf[TLS_HEADER_SIZE - 2], readbuf[TLS_HEADER_SIZE - 1]); 371| | 372| 13.5k| if(record_size > MAX_CIPHERTEXT_SIZE) { ------------------ | Branch (372:7): [True: 8, False: 13.5k] ------------------ 373| 8| throw TLS_Exception(Alert::RecordOverflow, "Received a record that exceeds maximum size"); 374| 8| } 375| | 376| 13.5k| if(record_size == 0) { ------------------ | Branch (376:7): [True: 4, False: 13.5k] ------------------ 377| 4| throw TLS_Exception(Alert::DecodeError, "Received a completely empty record"); 378| 4| } 379| | 380| 13.5k| if(const size_t needed = fill_buffer_to(readbuf, input, input_len, consumed, TLS_HEADER_SIZE + record_size)) { ------------------ | Branch (380:20): [True: 38, False: 13.4k] ------------------ 381| 38| return Record_Header(needed); 382| 38| } 383| | 384| 13.4k| BOTAN_ASSERT_EQUAL(static_cast(TLS_HEADER_SIZE) + record_size, readbuf.size(), "Have the full record"); ------------------ | | 90| 13.4k| do { \ | | 91| 13.4k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 92| 13.4k| if((expr1) != (expr2)) { \ | | ------------------ | | | Branch (92:10): [True: 0, False: 13.4k] | | ------------------ | | 93| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 94| 0| Botan::assertion_failure(#expr1 " == " #expr2, assertion_made, __func__, __FILE__, __LINE__); \ | | 95| 0| } \ | | 96| 13.4k| } while(0) | | ------------------ | | | Branch (96:12): [Folded, False: 13.4k] | | ------------------ ------------------ 385| | 386| 13.4k| const Record_Type type = static_cast(readbuf[0]); 387| | 388| 13.4k| uint16_t epoch = 0; 389| | 390| 13.4k| uint64_t sequence = 0; 391| 13.4k| if(sequence_numbers != nullptr) { ------------------ | Branch (391:7): [True: 13.4k, False: 0] ------------------ 392| 13.4k| sequence = sequence_numbers->next_read_sequence(); 393| 13.4k| epoch = sequence_numbers->current_read_epoch(); 394| 13.4k| } else { 395| | // server initial handshake case 396| 0| epoch = 0; 397| 0| } 398| | 399| 13.4k| if(epoch == 0) { ------------------ | Branch (399:7): [True: 13.4k, False: 2] ------------------ 400| | // Unencrypted initial handshake 401| 13.4k| recbuf.assign(readbuf.begin() + TLS_HEADER_SIZE, readbuf.begin() + TLS_HEADER_SIZE + record_size); 402| 13.4k| readbuf.clear(); 403| 13.4k| return Record_Header(sequence, version, type); 404| 13.4k| } 405| | 406| | // Otherwise, decrypt, check MAC, return plaintext 407| 2| auto cs = get_cipherstate(epoch); 408| | 409| 2| BOTAN_ASSERT(cs, "Have cipherstate for this epoch"); ------------------ | | 64| 2| do { \ | | 65| 2| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 2| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 2] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 2| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 2] | | ------------------ ------------------ 410| | 411| 2| decrypt_record(recbuf, &readbuf[TLS_HEADER_SIZE], record_size, sequence, version, type, *cs); 412| | 413| 2| if(sequence_numbers != nullptr) { ------------------ | Branch (413:7): [True: 0, False: 2] ------------------ 414| 0| sequence_numbers->read_accept(sequence); 415| 0| } 416| | 417| 2| readbuf.clear(); 418| 2| return Record_Header(sequence, version, type); 419| 13.4k|} _ZN5Botan3TLS12Session_KeysC2EPKNS0_15Handshake_StateERKNSt3__16vectorIhNS_16secure_allocatorIhEEEEb: 22| 56| bool resuming) { 23| 56| BOTAN_ASSERT_NONNULL(state); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 24| 56| BOTAN_ASSERT_NONNULL(state->client_hello()); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 25| 56| BOTAN_ASSERT_NONNULL(state->server_hello()); ------------------ | | 116| 56| do { \ | | 117| 56| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 56] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 56| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 56] | | ------------------ ------------------ 26| | 27| 56| const auto& suite = state->ciphersuite(); 28| 56| BOTAN_STATE_CHECK(suite.valid()); ------------------ | | 51| 56| do { \ | | 52| 56| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 56| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 56] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 56| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 56] | | ------------------ ------------------ 29| | 30| 56| const size_t cipher_keylen = suite.cipher_keylen(); 31| 56| const size_t mac_keylen = suite.mac_keylen(); 32| 56| const size_t cipher_nonce_bytes = suite.nonce_bytes_from_handshake(); 33| | 34| 56| const bool extended_master_secret = state->server_hello()->supports_extended_master_secret(); 35| | 36| 56| const size_t prf_gen = 2 * (mac_keylen + cipher_keylen + cipher_nonce_bytes); 37| | 38| 56| const uint8_t MASTER_SECRET_MAGIC[] = {0x6D, 0x61, 0x73, 0x74, 0x65, 0x72, 0x20, 0x73, 0x65, 0x63, 0x72, 0x65, 0x74}; 39| | 40| 56| const uint8_t EXT_MASTER_SECRET_MAGIC[] = {0x65, 0x78, 0x74, 0x65, 0x6E, 0x64, 0x65, 0x64, 0x20, 0x6D, 0x61, 41| 56| 0x73, 0x74, 0x65, 0x72, 0x20, 0x73, 0x65, 0x63, 0x72, 0x65, 0x74}; 42| | 43| 56| const uint8_t KEY_GEN_MAGIC[] = {0x6B, 0x65, 0x79, 0x20, 0x65, 0x78, 0x70, 0x61, 0x6E, 0x73, 0x69, 0x6F, 0x6E}; 44| | 45| 56| auto prf = state->protocol_specific_prf(); 46| | 47| 56| if(resuming) { ------------------ | Branch (47:7): [True: 0, False: 56] ------------------ 48| | // This is actually the master secret saved as part of the session 49| 0| m_master_sec = pre_master_secret; 50| 56| } else { 51| 56| std::vector salt; 52| 56| std::vector label; 53| 56| if(extended_master_secret) { ------------------ | Branch (53:10): [True: 56, False: 0] ------------------ 54| 56| label.assign(EXT_MASTER_SECRET_MAGIC, EXT_MASTER_SECRET_MAGIC + sizeof(EXT_MASTER_SECRET_MAGIC)); 55| 56| salt += state->hash().final(suite.prf_algo()); 56| 56| } else { 57| 0| label.assign(MASTER_SECRET_MAGIC, MASTER_SECRET_MAGIC + sizeof(MASTER_SECRET_MAGIC)); 58| 0| salt += state->client_hello()->random(); 59| 0| salt += state->server_hello()->random(); 60| 0| } 61| | 62| 56| m_master_sec = prf->derive_key(48, pre_master_secret, salt, label); 63| 56| } 64| | 65| 56| std::vector salt; 66| 56| std::vector label; 67| 56| label.assign(KEY_GEN_MAGIC, KEY_GEN_MAGIC + sizeof(KEY_GEN_MAGIC)); 68| 56| salt += state->server_hello()->random(); 69| 56| salt += state->client_hello()->random(); 70| | 71| 56| const secure_vector prf_output = prf->derive_key( 72| 56| prf_gen, m_master_sec.data(), m_master_sec.size(), salt.data(), salt.size(), label.data(), label.size()); 73| | 74| 56| const uint8_t* key_data = prf_output.data(); 75| | 76| 56| m_c_aead.resize(mac_keylen + cipher_keylen); 77| 56| m_s_aead.resize(mac_keylen + cipher_keylen); 78| | 79| | // NOLINTBEGIN(readability-container-data-pointer) 80| 56| copy_mem(&m_c_aead[0], key_data, mac_keylen); 81| 56| copy_mem(&m_s_aead[0], key_data + mac_keylen, mac_keylen); 82| | // NOLINTEND(readability-container-data-pointer) 83| | 84| | // Key is not used for NULL suites 85| 56| if(cipher_keylen > 0) { ------------------ | Branch (85:7): [True: 56, False: 0] ------------------ 86| 56| copy_mem(&m_c_aead[mac_keylen], key_data + 2 * mac_keylen, cipher_keylen); 87| 56| copy_mem(&m_s_aead[mac_keylen], key_data + 2 * mac_keylen + cipher_keylen, cipher_keylen); 88| 56| } else { 89| 0| BOTAN_STATE_CHECK(suite.null_ciphersuite()); ------------------ | | 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] | | ------------------ ------------------ 90| 0| } 91| | 92| 56| if(cipher_nonce_bytes > 0) { ------------------ | Branch (92:7): [True: 33, False: 23] ------------------ 93| 33| const uint8_t* c_nonce_bytes = key_data + 2 * (mac_keylen + cipher_keylen); 94| 33| m_c_nonce.assign(c_nonce_bytes, c_nonce_bytes + cipher_nonce_bytes); 95| | 96| 33| const uint8_t* s_nonce_bytes = key_data + 2 * (mac_keylen + cipher_keylen) + cipher_nonce_bytes; 97| 33| m_s_nonce.assign(s_nonce_bytes, s_nonce_bytes + cipher_nonce_bytes); 98| 33| } 99| 56|} _ZN5Botan3TLS6CookieC2ERNS0_15TLS_Data_ReaderEt: 26| 47|Cookie::Cookie(TLS_Data_Reader& reader, uint16_t extension_size) { 27| | // RFC 8446 4.2.2 28| | // struct { 29| | // opaque cookie<1..2^16-1>; 30| | // } Cookie; 31| | // 32| | // The wire form requires a 2-byte length field plus at least one byte of 33| | // cookie data, so the minimum extension size is 3 bytes. 34| 47| if(extension_size < 3) { ------------------ | Branch (34:7): [True: 30, False: 17] ------------------ 35| 30| throw Decoding_Error("Empty cookie extension is illegal"); 36| 30| } 37| | 38| 17| const uint16_t len = reader.get_uint16_t(); 39| | 40| 17| if(static_cast(len) + 2 != extension_size) { ------------------ | Branch (40:7): [True: 6, False: 11] ------------------ 41| 6| throw Decoding_Error("Inconsistent length in cookie extension"); 42| 6| } 43| | 44| 11| m_cookie = reader.get_fixed(len); 45| 11|} _ZN5Botan3TLS22PSK_Key_Exchange_ModesC2ERNS0_15TLS_Data_ReaderEt: 65| 53|PSK_Key_Exchange_Modes::PSK_Key_Exchange_Modes(TLS_Data_Reader& reader, uint16_t extension_size) { 66| | // RFC 8446 4.2.9 67| | // struct { 68| | // PskKeyExchangeMode ke_modes<1..255>; 69| | // } PskKeyExchangeModes; 70| | // 71| | // The wire form is a 1-byte length followed by mode_count mode bytes, 72| | // with mode_count in [1, 255], so the extension size is in [2, 256]. 73| 53| if(extension_size < 2) { ------------------ | Branch (73:7): [True: 1, False: 52] ------------------ 74| 1| throw Decoding_Error("Empty psk_key_exchange_modes extension is illegal"); 75| 1| } 76| | 77| 52| const auto mode_count = reader.get_byte(); 78| 52| if(static_cast(mode_count) + 1 != extension_size) { ------------------ | Branch (78:7): [True: 44, False: 8] ------------------ 79| 44| throw Decoding_Error("Inconsistent length in psk_key_exchange_modes extension"); 80| 44| } 81| | 82| 17| for(uint16_t i = 0; i < mode_count; ++i) { ------------------ | Branch (82:24): [True: 9, False: 8] ------------------ 83| 9| const auto mode = static_cast(reader.get_byte()); 84| 9| if(mode == PSK_Key_Exchange_Mode::PSK_KE || mode == PSK_Key_Exchange_Mode::PSK_DHE_KE) { ------------------ | Branch (84:10): [True: 3, False: 6] | Branch (84:51): [True: 0, False: 6] ------------------ 85| 3| m_modes.push_back(mode); 86| 3| } 87| 9| } 88| 8|} _ZN5Botan3TLS23Certificate_AuthoritiesC2ERNS0_15TLS_Data_ReaderEt: 106| 747|Certificate_Authorities::Certificate_Authorities(TLS_Data_Reader& reader, uint16_t extension_size) { 107| 747| if(extension_size < 2) { ------------------ | Branch (107:7): [True: 1, False: 746] ------------------ 108| 1| throw Decoding_Error("Empty certificate_authorities extension is illegal"); 109| 1| } 110| | 111| 746| const uint16_t purported_size = reader.get_uint16_t(); 112| | 113| 746| if(reader.remaining_bytes() != purported_size) { ------------------ | Branch (113:7): [True: 16, False: 730] ------------------ 114| 16| throw Decoding_Error("Inconsistent length in certificate_authorities extension"); 115| 16| } 116| | 117| | // RFC 8446 4.2.4: DistinguishedName authorities<3..2^16-1>; 118| 730| if(purported_size < 3) { ------------------ | Branch (118:7): [True: 11, False: 719] ------------------ 119| 11| throw Decoding_Error("Empty certificate_authorities list is illegal"); 120| 11| } 121| | 122| 1.43k| while(reader.has_remaining()) { ------------------ | Branch (122:10): [True: 720, False: 719] ------------------ 123| | // RFC 8446 4.2.4: opaque DistinguishedName<1..2^16-1> 124| 720| const std::vector name_bits = reader.get_range(2, 1, 65535); 125| | 126| 720| BER_Decoder decoder(name_bits, BER_Decoder::Limits::DER()); 127| 720| m_distinguished_names.emplace_back(); 128| 720| decoder.decode(m_distinguished_names.back()).verify_end(); 129| 720| } 130| 719|} _ZN5Botan3TLS19EarlyDataIndicationC2ERNS0_15TLS_Data_ReaderEtNS0_14Handshake_TypeE: 149| 25| Handshake_Type message_type) { 150| 25| if(message_type == Handshake_Type::NewSessionTicket) { ------------------ | Branch (150:7): [True: 0, False: 25] ------------------ 151| 0| if(extension_size != 4) { ------------------ | Branch (151:10): [True: 0, False: 0] ------------------ 152| 0| throw TLS_Exception(Alert::DecodeError, 153| 0| "Received an early_data extension in a NewSessionTicket message " 154| 0| "without maximum early data size indication"); 155| 0| } 156| | 157| 0| m_max_early_data_size = reader.get_uint32_t(); 158| 25| } else if(extension_size != 0) { ------------------ | Branch (158:14): [True: 1, False: 24] ------------------ 159| 1| throw TLS_Exception(Alert::DecodeError, 160| 1| "Received an early_data extension containing an unexpected data " 161| 1| "size indication"); 162| 1| } 163| 25|} _ZNK5Botan3TLS19EarlyDataIndication5emptyEv: 165| 10|bool EarlyDataIndication::empty() const { 166| | // This extension may be empty by definition but still carry information 167| 10| return false; 168| 10|} _ZN5Botan3TLS9Key_ShareC2ERNS0_15TLS_Data_ReaderEtNS0_14Handshake_TypeE: 401| 25|Key_Share::Key_Share(TLS_Data_Reader& reader, uint16_t extension_size, Handshake_Type message_type) { 402| 25| if(message_type == Handshake_Type::ClientHello) { ------------------ | Branch (402:7): [True: 0, False: 25] ------------------ 403| 0| m_impl = std::make_unique(Key_Share_ClientHello(reader, extension_size)); 404| 25| } else if(message_type == Handshake_Type::HelloRetryRequest) { ------------------ | Branch (404:14): [True: 2, False: 23] ------------------ 405| | // Connection_Side::Server 406| 2| m_impl = std::make_unique(Key_Share_HelloRetryRequest(reader, extension_size)); 407| 23| } else if(message_type == Handshake_Type::ServerHello) { ------------------ | Branch (407:14): [True: 23, False: 0] ------------------ 408| | // Connection_Side::Server 409| 23| m_impl = std::make_unique(Key_Share_ServerHello(reader, extension_size)); 410| 23| } else { 411| 0| throw Invalid_Argument(std::string("cannot create a Key_Share extension for message of type: ") + 412| 0| handshake_type_to_string(message_type)); 413| 0| } 414| 25|} _ZN5Botan3TLS9Key_ShareD2Ev: 433| 13|Key_Share::~Key_Share() = default; tls_extensions_key_share.cpp:_ZN5Botan3TLS12_GLOBAL__N_115Key_Share_EntryC2ERNS0_15TLS_Data_ReaderE: 47| 23| explicit Key_Share_Entry(TLS_Data_Reader& reader) { 48| | // TODO check that the group actually exists before casting... 49| 23| m_group = static_cast(reader.get_uint16_t()); 50| | // RFC 8446 4.2.8: opaque key_exchange<1..2^16-1> 51| 23| m_key_exchange = reader.get_range(2, 1, 65535); 52| 23| } tls_extensions_key_share.cpp:_ZN5Botan3TLS12_GLOBAL__N_127Key_Share_HelloRetryRequestC2ERNS0_15TLS_Data_ReaderEt: 352| 2| Key_Share_HelloRetryRequest(TLS_Data_Reader& reader, uint16_t extension_size) { 353| 2| constexpr auto sizeof_uint16_t = sizeof(uint16_t); 354| | 355| 2| if(extension_size != sizeof_uint16_t) { ------------------ | Branch (355:13): [True: 1, False: 1] ------------------ 356| 1| throw Decoding_Error("Size of KeyShare extension in HelloRetryRequest must be " + 357| 1| std::to_string(sizeof_uint16_t) + " bytes"); 358| 1| } 359| | 360| 1| m_selected_group = static_cast(reader.get_uint16_t()); 361| 1| } tls_extensions_key_share.cpp:_ZN5Botan3TLS12_GLOBAL__N_121Key_Share_ServerHelloC2ERNS0_15TLS_Data_ReaderEt: 145| 23| Key_Share_ServerHello(TLS_Data_Reader& reader, uint16_t /*len*/) : m_server_share(reader) {} tls_extensions_key_share.cpp:_ZN5Botan3TLS12_GLOBAL__N_121Key_Share_ServerHelloD2Ev: 153| 36| ~Key_Share_ServerHello() = default; tls_extensions_key_share.cpp:_ZN5Botan3TLS9Key_Share14Key_Share_ImplC2ENSt3__17variantIJNS0_12_GLOBAL__N_121Key_Share_ClientHelloENS5_21Key_Share_ServerHelloENS5_27Key_Share_HelloRetryRequestEEEE: 396| 13| explicit Key_Share_Impl(Key_Share_Type ks) : key_share(std::move(ks)) {} tls_extensions_key_share.cpp:_ZN5Botan3TLS12_GLOBAL__N_121Key_Share_ServerHelloC2EOS2_: 158| 24| Key_Share_ServerHello(Key_Share_ServerHello&&) = default; _ZN5Botan3TLS3PSKC2ERNS0_15TLS_Data_ReaderEtNS0_14Handshake_TypeE: 142| 14|PSK::PSK(TLS_Data_Reader& reader, uint16_t extension_size, Handshake_Type message_type) { 143| 14| if(message_type == Handshake_Type::ServerHello) { ------------------ | Branch (143:7): [True: 13, False: 1] ------------------ 144| 13| if(extension_size != 2) { ------------------ | Branch (144:10): [True: 1, False: 12] ------------------ 145| 1| throw TLS_Exception(Alert::DecodeError, "Server provided a malformed PSK extension"); 146| 1| } 147| | 148| 12| const uint16_t selected_id = reader.get_uint16_t(); 149| 12| m_impl = std::make_unique(Server_PSK(selected_id)); 150| 12| } else if(message_type == Handshake_Type::ClientHello) { ------------------ | Branch (150:14): [True: 0, False: 1] ------------------ 151| 0| const auto identities_length = reader.get_uint16_t(); 152| 0| const auto identities_offset = reader.read_so_far(); 153| | 154| 0| std::vector psk_identities; 155| 0| while(reader.has_remaining() && (reader.read_so_far() - identities_offset) < identities_length) { ------------------ | Branch (155:13): [True: 0, False: 0] | Branch (155:39): [True: 0, False: 0] ------------------ 156| | /* Per RFC 8446 PskIdentity is 157| | 158| | struct { 159| | opaque identity<1..2^16-1>; 160| | uint32 obfuscated_ticket_age; 161| | } PskIdentity; 162| | 163| | so we should reject an empty identity. However BoGo seems to expect 164| | being able to send us such an identity, so for now we accept it. 165| | */ 166| | 167| 0| auto identity = reader.get_tls_length_value(2); 168| 0| const auto obfuscated_ticket_age = reader.get_uint32_t(); 169| 0| psk_identities.emplace_back(std::move(identity), obfuscated_ticket_age); 170| 0| } 171| | 172| 0| if(psk_identities.empty()) { ------------------ | Branch (172:10): [True: 0, False: 0] ------------------ 173| 0| throw TLS_Exception(Alert::DecodeError, "Empty PSK list"); 174| 0| } 175| | 176| 0| if(reader.read_so_far() - identities_offset != identities_length) { ------------------ | Branch (176:10): [True: 0, False: 0] ------------------ 177| 0| throw TLS_Exception(Alert::DecodeError, "Inconsistent PSK identity list"); 178| 0| } 179| | 180| 0| const auto binders_length = reader.get_uint16_t(); 181| 0| const auto binders_offset = reader.read_so_far(); 182| | 183| 0| if(binders_length == 0) { ------------------ | Branch (183:10): [True: 0, False: 0] ------------------ 184| 0| throw TLS_Exception(Alert::DecodeError, "Empty PSK binders list"); 185| 0| } 186| | 187| 0| std::vector psks; 188| 0| for(auto& psk_identity : psk_identities) { ------------------ | Branch (188:30): [True: 0, False: 0] ------------------ 189| 0| if(!reader.has_remaining() || reader.read_so_far() - binders_offset >= binders_length) { ------------------ | Branch (189:13): [True: 0, False: 0] | Branch (189:40): [True: 0, False: 0] ------------------ 190| 0| throw TLS_Exception(Alert::IllegalParameter, "Not enough PSK binders"); 191| 0| } 192| | 193| | // RFC 8446 4.2.11 declares PskBinderEntry opaque<32..255>, but we accept any 194| | // 0..255 length here and let validate_binder reject, which yields a bad_record_mac 195| | // alert rather than decode_error. BoringSSL behaves the same way and BoGo has 196| | // tests that specifically expect this. 197| | 198| 0| psks.emplace_back(std::move(psk_identity), reader.get_tls_length_value(1)); 199| 0| } 200| | 201| 0| if(reader.read_so_far() - binders_offset != binders_length) { ------------------ | Branch (201:10): [True: 0, False: 0] ------------------ 202| 0| throw TLS_Exception(Alert::IllegalParameter, "Too many PSK binders"); 203| 0| } 204| | 205| 0| m_impl = std::make_unique(std::move(psks)); 206| 1| } else { 207| 1| throw TLS_Exception(Alert::DecodeError, "Found a PSK extension in an unexpected handshake message"); 208| 1| } 209| 14|} _ZN5Botan3TLS3PSKD2Ev: 231| 12|PSK::~PSK() = default; _ZNK5Botan3TLS3PSK5emptyEv: 233| 3|bool PSK::empty() const { 234| 3| if(std::holds_alternative(m_impl->psk)) { ------------------ | Branch (234:7): [True: 3, False: 0] ------------------ 235| 3| return false; 236| 3| } 237| | 238| 0| BOTAN_ASSERT_NOMSG(std::holds_alternative>(m_impl->psk)); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 239| 0| return std::get>(m_impl->psk).empty(); 240| 3|} tls_extensions_psk.cpp:_ZN5Botan3TLS12_GLOBAL__N_110Server_PSKC2Et: 109| 12| explicit Server_PSK(uint16_t id) : m_selected_identity(id), m_session_to_resume_or_psk(std::monostate()) {} tls_extensions_psk.cpp:_ZN5Botan3TLS3PSK12PSK_InternalC2ENS0_12_GLOBAL__N_110Server_PSKE: 134| 12| explicit PSK_Internal(Server_PSK srv_psk) : psk(std::move(srv_psk)) {} _ZN5Botan3TLS5AlertC2ERKNSt3__16vectorIhNS_16secure_allocatorIhEEEE: 14| 1.81k|Alert::Alert(const secure_vector& buf) { 15| 1.81k| if(buf.size() != 2) { ------------------ | Branch (15:7): [True: 17, False: 1.79k] ------------------ 16| 17| throw Decoding_Error("Bad size (" + std::to_string(buf.size()) + ") for TLS alert message"); 17| 17| } 18| | 19| 1.79k| if(buf[0] == 1) { ------------------ | Branch (19:7): [True: 1.30k, False: 490] ------------------ 20| 1.30k| m_fatal = false; 21| 1.30k| } else if(buf[0] == 2) { ------------------ | Branch (21:14): [True: 483, False: 7] ------------------ 22| 483| m_fatal = true; 23| 483| } else { 24| 7| throw TLS_Exception(Alert::IllegalParameter, "Bad code for TLS alert level"); 25| 7| } 26| | 27| 1.78k| const uint8_t dc = buf[1]; 28| | 29| 1.78k| m_type_code = static_cast(dc); 30| 1.78k|} _ZNK5Botan3TLS5Alert9serializeEv: 32| 7.13k|std::vector Alert::serialize() const { 33| 7.13k| return std::vector({static_cast(is_fatal() ? 2 : 1), static_cast(type())}); ------------------ | Branch (33:54): [True: 7.11k, False: 21] ------------------ 34| 7.13k|} _ZN5Botan3TLS18kdf_algo_to_stringENS0_8KDF_AlgoE: 17| 230|std::string kdf_algo_to_string(KDF_Algo algo) { 18| 230| switch(algo) { ------------------ | Branch (18:11): [True: 230, False: 0] ------------------ 19| 46| case KDF_Algo::SHA_1: ------------------ | Branch (19:7): [True: 46, False: 184] ------------------ 20| 46| return "SHA-1"; 21| 20| case KDF_Algo::SHA_256: ------------------ | Branch (21:7): [True: 20, False: 210] ------------------ 22| 20| return "SHA-256"; 23| 164| case KDF_Algo::SHA_384: ------------------ | Branch (23:7): [True: 164, False: 66] ------------------ 24| 164| return "SHA-384"; 25| 230| } 26| | 27| 0| throw Invalid_State("kdf_algo_to_string unknown enum value"); 28| 230|} _ZN5Botan3TLS20kex_method_to_stringENS0_8Kex_AlgoE: 30| 2|std::string kex_method_to_string(Kex_Algo method) { 31| 2| switch(method) { ------------------ | Branch (31:11): [True: 2, False: 0] ------------------ 32| 0| case Kex_Algo::STATIC_RSA: ------------------ | Branch (32:7): [True: 0, False: 2] ------------------ 33| 0| return "RSA"; 34| 2| case Kex_Algo::DH: ------------------ | Branch (34:7): [True: 2, False: 0] ------------------ 35| 2| return "DH"; 36| 0| case Kex_Algo::ECDH: ------------------ | Branch (36:7): [True: 0, False: 2] ------------------ 37| 0| return "ECDH"; 38| 0| case Kex_Algo::PSK: ------------------ | Branch (38:7): [True: 0, False: 2] ------------------ 39| 0| return "PSK"; 40| 0| case Kex_Algo::ECDHE_PSK: ------------------ | Branch (40:7): [True: 0, False: 2] ------------------ 41| 0| return "ECDHE_PSK"; 42| 0| case Kex_Algo::DHE_PSK: ------------------ | Branch (42:7): [True: 0, False: 2] ------------------ 43| 0| return "DHE_PSK"; 44| 0| case Kex_Algo::KEM: ------------------ | Branch (44:7): [True: 0, False: 2] ------------------ 45| 0| return "KEM"; 46| 0| case Kex_Algo::KEM_PSK: ------------------ | Branch (46:7): [True: 0, False: 2] ------------------ 47| 0| return "KEM_PSK"; 48| 0| case Kex_Algo::HYBRID: ------------------ | Branch (48:7): [True: 0, False: 2] ------------------ 49| 0| return "HYBRID"; 50| 0| case Kex_Algo::HYBRID_PSK: ------------------ | Branch (50:7): [True: 0, False: 2] ------------------ 51| 0| return "HYBRID_PSK"; 52| 0| case Kex_Algo::UNDEFINED: ------------------ | Branch (52:7): [True: 0, False: 2] ------------------ 53| 0| return "UNDEFINED"; 54| 2| } 55| | 56| 0| throw Invalid_State("kex_method_to_string unknown enum value"); 57| 2|} _ZN5Botan3TLS21auth_method_to_stringENS0_11Auth_MethodE: 107| 333|std::string auth_method_to_string(Auth_Method method) { 108| 333| switch(method) { ------------------ | Branch (108:11): [True: 333, False: 0] ------------------ 109| 333| case Auth_Method::RSA: ------------------ | Branch (109:7): [True: 333, False: 0] ------------------ 110| 333| return "RSA"; 111| 0| case Auth_Method::ECDSA: ------------------ | Branch (111:7): [True: 0, False: 333] ------------------ 112| 0| return "ECDSA"; 113| 0| case Auth_Method::IMPLICIT: ------------------ | Branch (113:7): [True: 0, False: 333] ------------------ 114| 0| return "IMPLICIT"; 115| 0| case Auth_Method::UNDEFINED: ------------------ | Branch (115:7): [True: 0, False: 333] ------------------ 116| 0| return "UNDEFINED"; 117| 333| } 118| | 119| 0| throw Invalid_State("auth_method_to_string unknown enum value"); 120| 333|} _ZN5Botan3TLS9Callbacks25tls_inspect_handshake_msgERKNS0_17Handshake_MessageE: 49| 14.4k|void TLS::Callbacks::tls_inspect_handshake_msg(const Handshake_Message& /*unused*/) { 50| | // default is no op 51| 14.4k|} _ZN5Botan3TLS9Callbacks21tls_current_timestampEv: 61| 14.9k|std::chrono::system_clock::time_point TLS::Callbacks::tls_current_timestamp() { 62| 14.9k| return std::chrono::system_clock::now(); 63| 14.9k|} _ZN5Botan3TLS9Callbacks21tls_modify_extensionsERNS0_10ExtensionsENS0_15Connection_SideENS0_14Handshake_TypeE: 67| 7.28k| Handshake_Type /*unused*/) {} _ZN5Botan3TLS9Callbacks22tls_examine_extensionsERKNS0_10ExtensionsENS0_15Connection_SideENS0_14Handshake_TypeE: 71| 5.31k| Handshake_Type /*unused*/) {} _ZN5Botan3TLS9Callbacks41tls_should_persist_resumption_informationERKNS0_7SessionE: 73| 2|bool TLS::Callbacks::tls_should_persist_resumption_information(const Session& session) { 74| | // RFC 5077 3.3 75| | // The ticket_lifetime_hint field contains a hint from the server about 76| | // how long the ticket should be stored. A value of zero is reserved to 77| | // indicate that the lifetime of the ticket is unspecified. 78| | // 79| | // RFC 8446 4.6.1 80| | // [A ticket_lifetime] of zero indicates that the ticket should be discarded 81| | // immediately. 82| | // 83| | // By default we opt to keep all sessions, except for TLS 1.3 with a lifetime 84| | // hint of zero. 85| 2| return session.lifetime_hint().count() > 0 || session.version().is_pre_tls_13(); ------------------ | Branch (85:11): [True: 2, False: 0] | Branch (85:50): [True: 0, False: 0] ------------------ 86| 2|} _ZN5Botan3TLS9Callbacks21tls_verify_cert_chainERKNSt3__16vectorINS_16X509_CertificateENS2_9allocatorIS4_EEEERKNS3_INS2_8optionalINS_4OCSP8ResponseEEENS5_ISD_EEEERKNS3_IPNS_17Certificate_StoreENS5_ISJ_EEEENS_10Usage_TypeENS2_17basic_string_viewIcNS2_11char_traitsIcEEEERKNS0_6PolicyE: 93| 361| const TLS::Policy& policy) { 94| 361| if(cert_chain.empty()) { ------------------ | Branch (94:7): [True: 0, False: 361] ------------------ 95| 0| throw Invalid_Argument("Certificate chain was empty"); 96| 0| } 97| | 98| 361| const Path_Validation_Restrictions restrictions(policy.require_cert_revocation_info(), 99| 361| policy.minimum_signature_strength()); 100| | 101| | /* 102| | Hostname is always provided in order to allow host-specific logic if required, 103| | but it should not be passed to x509_path_validate unless we are verifying 104| | the server. 105| | */ 106| 361| const std::string_view name_to_match = (usage == Usage_Type::TLS_CLIENT_AUTH) ? std::string_view{} : hostname; ------------------ | Branch (106:43): [True: 0, False: 361] ------------------ 107| | 108| 361| const Path_Validation_Result result = x509_path_validate(cert_chain, 109| 361| restrictions, 110| 361| trusted_roots, 111| 361| name_to_match, 112| 361| usage, 113| 361| tls_current_timestamp(), 114| 361| tls_verify_cert_chain_ocsp_timeout(), 115| 361| ocsp_responses); 116| | 117| 361| if(!result.successful_validation()) { ------------------ | Branch (117:7): [True: 361, False: 0] ------------------ 118| 361| throw TLS_Exception(Alert::BadCertificate, "Certificate validation failure: " + result.result_string()); 119| 361| } 120| 361|} _ZN5Botan3TLS9Callbacks18tls_verify_messageERKNS_10Public_KeyENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEENS_16Signature_FormatERKNS5_6vectorIhNS5_9allocatorIhEEEESG_: 164| 310| const std::vector& sig) { 165| 310| PK_Verifier verifier(key, padding, format); 166| | 167| 310| return verifier.verify_message(msg, sig); 168| 310|} _ZN5Botan3TLS9Callbacks31tls_deserialize_peer_public_keyERKNSt3__17variantIJNS0_12Group_ParamsENS_8DL_GroupEEEENS2_4spanIKhLm18446744073709551615EEE: 191| 38| const std::variant& group, std::span key_bits) { 192| 38| if(is_dh_group(group)) { ------------------ | Branch (192:7): [True: 38, False: 0] ------------------ 193| | // TLS 1.2 allows specifying arbitrary DL_Group parameters in-lieu of 194| | // a standardized DH group identifier. 195| 38| const auto dl_group = get_dl_group(group); 196| | 197| 38| auto Y = BigInt::from_bytes(key_bits); 198| | 199| | /* 200| | * A basic check for key validity. As we do not know q here we 201| | * cannot check that Y is in the right subgroup. However since 202| | * our key is ephemeral there does not seem to be any 203| | * advantage to bogus keys anyway. 204| | */ 205| 38| if(Y <= 1 || Y >= dl_group.get_p() - 1) { ------------------ | Branch (205:10): [True: 0, False: 38] | Branch (205:10): [True: 0, False: 38] | Branch (205:20): [True: 0, False: 38] ------------------ 206| 0| throw Decoding_Error("Server sent bad DH key for DHE exchange"); 207| 0| } 208| | 209| 38| return std::make_unique(dl_group, Y); 210| 38| } 211| | 212| | // The special case for TLS 1.2 with an explicit DH group definition is 213| | // handled above. All other cases are based on the opaque group definition. 214| 0| BOTAN_ASSERT_NOMSG(std::holds_alternative(group)); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 215| 0| const auto group_params = std::get(group); 216| | 217| 0| if(group_params.is_ecdh_named_curve()) { ------------------ | Branch (217:7): [True: 0, False: 0] ------------------ 218| 0| const auto ec_group = EC_Group::from_name(group_params.to_string().value()); 219| 0| return std::make_unique(ec_group, EC_AffinePoint(ec_group, key_bits)); 220| 0| } 221| | 222| 0|#if defined(BOTAN_HAS_X25519) 223| 0| if(group_params.is_x25519()) { ------------------ | Branch (223:7): [True: 0, False: 0] ------------------ 224| 0| return std::make_unique(key_bits); 225| 0| } 226| 0|#endif 227| | 228| 0|#if defined(BOTAN_HAS_X448) 229| 0| if(group_params.is_x448()) { ------------------ | Branch (229:7): [True: 0, False: 0] ------------------ 230| 0| return std::make_unique(key_bits); 231| 0| } 232| 0|#endif 233| | 234| 0|#if defined(BOTAN_HAS_TLS_13_PQC) 235| 0| if(group_params.is_pqc_hybrid()) { ------------------ | Branch (235:7): [True: 0, False: 0] ------------------ 236| 0| return Hybrid_KEM_PublicKey::load_for_group(group_params, key_bits); 237| 0| } 238| 0|#endif 239| | 240| 0|#if defined(BOTAN_HAS_ML_KEM) 241| 0| if(group_params.is_pure_ml_kem()) { ------------------ | Branch (241:7): [True: 0, False: 0] ------------------ 242| 0| return std::make_unique(key_bits, ML_KEM_Mode(group_params.to_string().value())); 243| 0| } 244| 0|#endif 245| | 246| 0|#if defined(BOTAN_HAS_FRODOKEM) 247| 0| if(group_params.is_pure_frodokem()) { ------------------ | Branch (247:7): [True: 0, False: 0] ------------------ 248| 0| return std::make_unique(key_bits, FrodoKEMMode(group_params.to_string().value())); 249| 0| } 250| 0|#endif 251| | 252| 0| throw Decoding_Error("cannot create a key offering without a group definition"); 253| 0|} _ZN5Botan3TLS9Callbacks26tls_generate_ephemeral_keyERKNSt3__17variantIJNS0_12Group_ParamsENS_8DL_GroupEEEERNS_21RandomNumberGeneratorE: 343| 38| const std::variant& group, RandomNumberGenerator& rng) { 344| 38| if(is_dh_group(group)) { ------------------ | Branch (344:7): [True: 38, False: 0] ------------------ 345| 38| const DL_Group dl_group = get_dl_group(group); 346| 38| return std::make_unique(rng, dl_group); 347| 38| } 348| | 349| 0| BOTAN_ASSERT_NOMSG(std::holds_alternative(group)); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 350| 0| const auto group_params = std::get(group); 351| | 352| 0| if(group_params.is_ecdh_named_curve()) { ------------------ | Branch (352:7): [True: 0, False: 0] ------------------ 353| 0| const auto ec_group = EC_Group::from_name(group_params.to_string().value()); 354| 0| return std::make_unique(rng, ec_group); 355| 0| } 356| | 357| 0|#if defined(BOTAN_HAS_X25519) 358| 0| if(group_params.is_x25519()) { ------------------ | Branch (358:7): [True: 0, False: 0] ------------------ 359| 0| return std::make_unique(rng); 360| 0| } 361| 0|#endif 362| | 363| 0|#if defined(BOTAN_HAS_X448) 364| 0| if(group_params.is_x448()) { ------------------ | Branch (364:7): [True: 0, False: 0] ------------------ 365| 0| return std::make_unique(rng); 366| 0| } 367| 0|#endif 368| | 369| 0| if(group_params.is_kem()) { ------------------ | Branch (369:7): [True: 0, False: 0] ------------------ 370| 0| throw TLS_Exception(Alert::IllegalParameter, "cannot generate an ephemeral KEX key for a KEM"); 371| 0| } 372| | 373| 0| throw TLS_Exception(Alert::DecodeError, "cannot create a key offering without a group definition"); 374| 0|} _ZN5Botan3TLS9Callbacks27tls_ephemeral_key_agreementERKNSt3__17variantIJNS0_12Group_ParamsENS_8DL_GroupEEEERKNS_20PK_Key_Agreement_KeyERKNS2_6vectorIhNS2_9allocatorIhEEEERNS_21RandomNumberGeneratorERKNS0_6PolicyE: 400| 38| const Policy& policy) { 401| 38| const auto kex_pub_key = [&]() { 402| 38| try { 403| 38| return tls_deserialize_peer_public_key(group, public_value); 404| 38| } catch(const Decoding_Error& ex) { 405| | // This exception means that the public key was invalid. However, 406| | // TLS' DecodeError would imply that a protocol message was invalid. 407| 38| throw TLS_Exception(Alert::IllegalParameter, ex.what()); 408| 38| } catch(const Invalid_Argument& ex) { 409| 38| throw TLS_Exception(Alert::IllegalParameter, ex.what()); 410| 38| } 411| 38| }(); 412| | 413| 38| BOTAN_ASSERT_NONNULL(kex_pub_key); ------------------ | | 116| 38| do { \ | | 117| 38| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 38] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 38| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 38] | | ------------------ ------------------ 414| 38| policy.check_peer_key_acceptable(*kex_pub_key); 415| | 416| | // RFC 8422 - 5.11. 417| | // With X25519 and X448, a receiving party MUST check whether the 418| | // computed premaster secret is the all-zero value and abort the 419| | // handshake if so, as described in Section 6 of [RFC7748]. 420| | // 421| | // This is done within the key agreement operation and throws 422| | // an Invalid_Argument exception if the shared secret is all-zero. 423| 38| try { 424| 38| const PK_Key_Agreement ka(private_key, rng, "Raw"); 425| 38| return ka.derive_key(0, kex_pub_key->raw_public_key_bits()).bits_of(); 426| 38| } catch(const Invalid_Argument& ex) { 427| 0| throw TLS_Exception(Alert::IllegalParameter, ex.what()); 428| 0| } 429| 38|} _ZN5Botan3TLS9Callbacks23tls_session_establishedERKNS0_15Session_SummaryE: 431| 2|void TLS::Callbacks::tls_session_established(const Session_Summary& session) { 432| 2| BOTAN_UNUSED(session); ------------------ | | 144| 2|#define BOTAN_UNUSED Botan::ignore_params ------------------ 433| 2|} _ZNK5Botan3TLS9Callbacks27tls12_protocol_specific_kdfENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 459| 114|std::unique_ptr TLS::Callbacks::tls12_protocol_specific_kdf(std::string_view prf_algo) const { 460| 114| if(prf_algo == "MD5" || prf_algo == "SHA-1") { ------------------ | Branch (460:7): [True: 0, False: 114] | Branch (460:28): [True: 22, False: 92] ------------------ 461| 22| return KDF::create_or_throw("TLS-12-PRF(SHA-256)"); 462| 22| } 463| | 464| 92| return KDF::create_or_throw(Botan::fmt("TLS-12-PRF({})", prf_algo)); 465| 114|} tls_callbacks.cpp:_ZN5Botan12_GLOBAL__N_111is_dh_groupERKNSt3__17variantIJNS_3TLS12Group_ParamsENS_8DL_GroupEEEE: 172| 152|bool is_dh_group(const std::variant& group) { 173| 152| return std::holds_alternative(group) || std::get(group).is_dh_named_group(); ------------------ | Branch (173:11): [True: 152, False: 0] | Branch (173:54): [True: 0, False: 0] ------------------ 174| 152|} tls_callbacks.cpp:_ZN5Botan12_GLOBAL__N_112get_dl_groupERKNSt3__17variantIJNS_3TLS12Group_ParamsENS_8DL_GroupEEEE: 176| 76|DL_Group get_dl_group(const std::variant& group) { 177| 76| BOTAN_ASSERT_NOMSG(is_dh_group(group)); ------------------ | | 77| 76| do { \ | | 78| 76| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 76| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 76] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 76| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 76] | | ------------------ ------------------ 178| | 179| | // TLS 1.2 allows specifying arbitrary DL_Group parameters in-lieu of 180| | // a standardized DH group identifier. TLS 1.3 just offers pre-defined 181| | // groups. 182| 76| return std::visit( 183| 76| overloaded{[](const DL_Group& dl_group) { return dl_group; }, 184| 76| [&](TLS::Group_Params group_param) { return DL_Group::from_name(group_param.to_string().value()); }}, 185| 76| group); 186| 76|} tls_callbacks.cpp:_ZZN5Botan12_GLOBAL__N_112get_dl_groupERKNSt3__17variantIJNS_3TLS12Group_ParamsENS_8DL_GroupEEEEENK3$_0clERKS5_: 183| 76| overloaded{[](const DL_Group& dl_group) { return dl_group; }, tls_callbacks.cpp:_ZZN5Botan3TLS9Callbacks27tls_ephemeral_key_agreementERKNSt3__17variantIJNS0_12Group_ParamsENS_8DL_GroupEEEERKNS_20PK_Key_Agreement_KeyERKNS2_6vectorIhNS2_9allocatorIhEEEERNS_21RandomNumberGeneratorERKNS0_6PolicyEENK3$_0clEv: 401| 38| const auto kex_pub_key = [&]() { 402| 38| try { 403| 38| return tls_deserialize_peer_public_key(group, public_value); 404| 38| } catch(const Decoding_Error& ex) { 405| | // This exception means that the public key was invalid. However, 406| | // TLS' DecodeError would imply that a protocol message was invalid. 407| 0| throw TLS_Exception(Alert::IllegalParameter, ex.what()); 408| 0| } catch(const Invalid_Argument& ex) { 409| 0| throw TLS_Exception(Alert::IllegalParameter, ex.what()); 410| 0| } 411| 38| }(); _ZNK5Botan3TLS11Ciphersuite26nonce_bytes_from_handshakeEv: 16| 119|size_t Ciphersuite::nonce_bytes_from_handshake() const { 17| 119| switch(m_nonce_format) { ------------------ | Branch (17:11): [True: 119, False: 0] ------------------ 18| 53| case Nonce_Format::CBC_MODE: ------------------ | Branch (18:7): [True: 53, False: 66] ------------------ 19| 53| return 0; 20| 66| case Nonce_Format::AEAD_IMPLICIT_4: ------------------ | Branch (20:7): [True: 66, False: 53] ------------------ 21| 66| return 4; 22| 0| case Nonce_Format::AEAD_XOR_12: ------------------ | Branch (22:7): [True: 0, False: 119] ------------------ 23| 0| return 12; 24| 0| case Nonce_Format::NULL_CIPHER: ------------------ | Branch (24:7): [True: 0, False: 119] ------------------ 25| 0| return 0; 26| 119| } 27| | 28| 0| throw Invalid_State("In Ciphersuite::nonce_bytes_from_handshake invalid enum value"); 29| 119|} _ZNK5Botan3TLS11Ciphersuite23nonce_bytes_from_recordENS0_16Protocol_VersionE: 31| 63|size_t Ciphersuite::nonce_bytes_from_record(Protocol_Version version) const { 32| 63| BOTAN_UNUSED(version); ------------------ | | 144| 63|#define BOTAN_UNUSED Botan::ignore_params ------------------ 33| 63| switch(m_nonce_format) { ------------------ | Branch (33:11): [True: 63, False: 0] ------------------ 34| 30| case Nonce_Format::CBC_MODE: ------------------ | Branch (34:7): [True: 30, False: 33] ------------------ 35| 30| return cipher_algo() == "3DES" ? 8 : 16; ------------------ | Branch (35:17): [True: 2, False: 28] ------------------ 36| 33| case Nonce_Format::AEAD_IMPLICIT_4: ------------------ | Branch (36:7): [True: 33, False: 30] ------------------ 37| 33| return 8; 38| 0| case Nonce_Format::AEAD_XOR_12: ------------------ | Branch (38:7): [True: 0, False: 63] ------------------ 39| 0| case Nonce_Format::NULL_CIPHER: ------------------ | Branch (39:7): [True: 0, False: 63] ------------------ 40| 0| return 0; 41| 63| } 42| | 43| 0| throw Invalid_State("In Ciphersuite::nonce_bytes_from_handshake invalid enum value"); 44| 63|} _ZN5Botan3TLS11Ciphersuite7is_scsvEt: 46| 5.45k|bool Ciphersuite::is_scsv(uint16_t suite) { 47| | // Both signaling cipher suite values - skip them when iterating 48| | // negotiable ciphersuites. The two callers are: 49| | // 50| | // - 0x00FF: TLS_EMPTY_RENEGOTIATION_INFO_SCSV (RFC 5746). Consumed by 51| | // Client_Hello_12::Client_Hello_12 to set secure_renegotiation when 52| | // the renegotiation_info extension is absent. 53| | // 54| | // - 0x5600: TLS_FALLBACK_SCSV (RFC 7507). Recognized so it is filtered 55| | // out of negotiation, but the inappropriate_fallback enforcement is 56| | // intentionally not implemented: 57| | // * Botan does not support TLS 1.0 / 1.1, so the 1.2 -> 1.0/1.1 58| | // fallback that SCSV was originally designed to detect cannot 59| | // occur here. 60| | // * The 1.3 -> 1.2 downgrade is already protected by the 61| | // ServerHello.random sentinel (RFC 8446 4.1.3, DOWNGRADE_TLS12), 62| | // which Botan's TLS 1.3 client enforces at 63| | // tls_client_impl_13.cpp via random_signals_downgrade(). 64| | // 65| | // TODO: derive from IANA file in script 66| 5.45k| return (suite == 0x00FF || suite == 0x5600); ------------------ | Branch (66:12): [True: 0, False: 5.45k] | Branch (66:31): [True: 0, False: 5.45k] ------------------ 67| 5.45k|} _ZNK5Botan3TLS11Ciphersuite15psk_ciphersuiteEv: 69| 322|bool Ciphersuite::psk_ciphersuite() const { 70| 322| return kex_method() == Kex_Algo::PSK || kex_method() == Kex_Algo::ECDHE_PSK; ------------------ | Branch (70:11): [True: 0, False: 322] | Branch (70:44): [True: 0, False: 322] ------------------ 71| 322|} _ZNK5Botan3TLS11Ciphersuite17usable_in_versionENS0_16Protocol_VersionE: 77| 690k|bool Ciphersuite::usable_in_version(Protocol_Version version) const { 78| | // RFC 8446 B.4.: 79| | // Although TLS 1.3 uses the same cipher suite space as previous 80| | // versions of TLS, TLS 1.3 cipher suites are defined differently, only 81| | // specifying the symmetric ciphers, and cannot be used for TLS 1.2. 82| | // Similarly, cipher suites for TLS 1.2 and lower cannot be used with 83| | // TLS 1.3. 84| | // 85| | // Currently cipher suite codes {0x13,0x01} through {0x13,0x05} are 86| | // allowed for TLS 1.3. This may change in the future. 87| 690k| const auto is_legacy_suite = (ciphersuite_code() & 0xFF00) != 0x1300; 88| 690k| return version.is_pre_tls_13() == is_legacy_suite; 89| 690k|} _ZNK5Botan3TLS11Ciphersuite16aead_ciphersuiteEv: 99| 5.45k|bool Ciphersuite::aead_ciphersuite() const { 100| 5.45k| return (mac_algo() == "AEAD"); 101| 5.45k|} _ZNK5Botan3TLS11Ciphersuite14signature_usedEv: 103| 3.80k|bool Ciphersuite::signature_used() const { 104| 3.80k| return auth_method() != Auth_Method::IMPLICIT; 105| 3.80k|} _ZNK5Botan3TLS11Ciphersuite23is_certificate_requiredEv: 107| 3.12k|bool Ciphersuite::is_certificate_required() const { 108| 3.12k| return signature_used() || kex_method() == Kex_Algo::STATIC_RSA; ------------------ | Branch (108:11): [True: 2.86k, False: 257] | Branch (108:31): [True: 242, False: 15] ------------------ 109| 3.12k|} _ZN5Botan3TLS11Ciphersuite5by_idEt: 111| 10.9k|std::optional Ciphersuite::by_id(uint16_t suite) { 112| 10.9k| const std::vector& all_suites = all_known_ciphersuites(); 113| 10.9k| auto s = std::lower_bound(all_suites.begin(), all_suites.end(), suite); 114| | 115| 10.9k| if(s != all_suites.end() && s->ciphersuite_code() == suite) { ------------------ | Branch (115:7): [True: 10.9k, False: 4] | Branch (115:7): [True: 10.9k, False: 61] | Branch (115:32): [True: 10.9k, False: 57] ------------------ 116| 10.9k| return *s; 117| 10.9k| } 118| | 119| 61| return std::nullopt; // some unknown ciphersuite 120| 10.9k|} _ZN5Botan3TLS6ClientC2ERKNSt3__110shared_ptrINS0_9CallbacksEEERKNS3_INS0_15Session_ManagerEEERKNS3_INS_19Credentials_ManagerEEERKNS3_IKNS0_6PolicyEEERKNS3_INS_21RandomNumberGeneratorEEENS0_18Server_InformationENS0_16Protocol_VersionERKNS2_6vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENSV_ISX_EEEEm: 38| 7.28k| size_t io_buf_sz) { 39| 7.28k| BOTAN_ARG_CHECK(policy->acceptable_protocol_version(offer_version), ------------------ | | 35| 7.28k| do { \ | | 36| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 7.28k] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 7.28k| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 7.28k] | | ------------------ ------------------ 40| 7.28k| "Policy does not allow to offer requested protocol version"); 41| | 42| 7.28k|#if defined(BOTAN_HAS_TLS_13) 43| 7.28k| if(offer_version == Protocol_Version::TLS_V13) { ------------------ | Branch (43:7): [True: 0, False: 7.28k] ------------------ 44| 0| m_impl = std::make_unique( 45| 0| callbacks, session_manager, creds, policy, rng, std::move(info), next_protocols); 46| | 47| 0| if(m_impl->expects_downgrade()) { ------------------ | Branch (47:10): [True: 0, False: 0] ------------------ 48| 0| m_impl->set_io_buffer_size(io_buf_sz); 49| 0| } 50| | 51| 0| if(m_impl->is_downgrading()) { ------------------ | Branch (51:10): [True: 0, False: 0] ------------------ 52| | // TLS 1.3 implementation found a resumable TLS 1.2 session and 53| | // requested a downgrade right away. 54| 0| downgrade(); 55| 0| } 56| | 57| 0| return; 58| 0| } 59| 7.28k|#endif 60| | 61| 7.28k|#if defined(BOTAN_HAS_TLS_12) 62| 7.28k| if(offer_version.is_pre_tls_13()) { ------------------ | Branch (62:7): [True: 7.28k, False: 0] ------------------ 63| 7.28k| m_impl = std::make_unique(callbacks, 64| 7.28k| session_manager, 65| 7.28k| creds, 66| 7.28k| policy, 67| 7.28k| rng, 68| 7.28k| std::move(info), 69| 7.28k| offer_version.is_datagram_protocol(), 70| 7.28k| next_protocols, 71| 7.28k| io_buf_sz); 72| 7.28k| return; 73| 7.28k| } 74| 0|#endif 75| | 76| 0| BOTAN_UNUSED(callbacks, session_manager, creds, policy, rng, info, offer_version, next_protocols, io_buf_sz); ------------------ | | 144| 0|#define BOTAN_UNUSED Botan::ignore_params ------------------ 77| 0| throw Not_Implemented("Requested TLS version to be offered is not available in this build"); 78| 7.28k|} _ZN5Botan3TLS6ClientD2Ev: 80| 7.28k|Client::~Client() = default; _ZN5Botan3TLS6Client9from_peerENSt3__14spanIKhLm18446744073709551615EEE: 104| 7.28k|size_t Client::from_peer(std::span data) { 105| 7.28k| auto read = m_impl->from_peer(data); 106| | 107| 7.28k| if(m_impl->is_downgrading()) { ------------------ | Branch (107:7): [True: 0, False: 7.28k] ------------------ 108| 0| read = downgrade(); 109| 0| } 110| | 111| 7.28k| return read; 112| 7.28k|} _ZN5Botan3TLS10ExtensionsD2Ev: 138| 14.1k|Extensions::~Extensions() = default; _ZNK5Botan3TLS10Extensions3hasENS0_14Extension_CodeE: 140| 99.0k|bool Extensions::has(Extension_Code type) const { 141| 99.0k| return m_extensions.contains(type); 142| 99.0k|} _ZNK5Botan3TLS10Extensions3getENS0_14Extension_CodeE: 144| 54.3k|Extension* Extensions::get(Extension_Code type) const { 145| 54.3k| const auto i = m_extensions.find(type); 146| | 147| 54.3k| if(i == m_extensions.end()) { ------------------ | Branch (147:7): [True: 29.5k, False: 24.7k] ------------------ 148| 29.5k| return nullptr; 149| 29.5k| } else { 150| 24.7k| return i->second.get(); 151| 24.7k| } 152| 54.3k|} _ZN5Botan3TLS10Extensions3addENSt3__110unique_ptrINS0_9ExtensionENS2_14default_deleteIS4_EEEE: 154| 85.3k|void Extensions::add(std::unique_ptr extn) { 155| 85.3k| const auto type = extn->type(); 156| 85.3k| if(has(type)) { ------------------ | Branch (156:7): [True: 0, False: 85.3k] ------------------ 157| 0| throw Invalid_Argument("cannot add the same extension twice: " + std::to_string(static_cast(type))); 158| 0| } 159| | 160| 85.3k| m_extension_codes.push_back(type); 161| 85.3k| m_extensions.emplace(type, std::move(extn)); 162| 85.3k|} _ZN5Botan3TLS10Extensions11deserializeERNS0_15TLS_Data_ReaderENS0_15Connection_SideENS0_14Handshake_TypeE: 164| 6.85k|void Extensions::deserialize(TLS_Data_Reader& reader, const Connection_Side from, const Handshake_Type message_type) { 165| 6.85k| if(reader.has_remaining()) { ------------------ | Branch (165:7): [True: 4.86k, False: 1.99k] ------------------ 166| 4.86k| const uint16_t all_extn_size = reader.get_uint16_t(); 167| | 168| 4.86k| if(reader.remaining_bytes() != all_extn_size) { ------------------ | Branch (168:10): [True: 22, False: 4.84k] ------------------ 169| 22| throw Decoding_Error("Bad extension size"); 170| 22| } 171| | 172| 18.5k| while(reader.has_remaining()) { ------------------ | Branch (172:13): [True: 13.7k, False: 4.84k] ------------------ 173| 13.7k| const uint16_t extension_code = reader.get_uint16_t(); 174| 13.7k| const uint16_t extension_size = reader.get_uint16_t(); 175| | 176| 13.7k| const auto type = static_cast(extension_code); 177| | 178| 13.7k| if(this->has(type)) { ------------------ | Branch (178:13): [True: 3, False: 13.7k] ------------------ 179| 3| throw TLS_Exception(TLS::Alert::DecodeError, "Peer sent duplicated extensions"); 180| 3| } 181| | 182| | // TODO offer a function on reader that returns a byte range as a reference 183| | // to avoid this copy of the extension data 184| 13.7k| const std::vector extn_data = reader.get_fixed(extension_size); 185| 13.7k| m_raw_extension_data[type] = extn_data; 186| 13.7k| TLS_Data_Reader extn_reader("Extension", extn_data); 187| 13.7k| this->add(make_extension(extn_reader, type, from, message_type)); 188| 13.7k| extn_reader.assert_done(); 189| 13.7k| } 190| 4.84k| } 191| 6.85k|} _ZNK5Botan3TLS10Extensions9serializeENS0_15Connection_SideE: 229| 7.28k|std::vector Extensions::serialize(Connection_Side whoami) const { 230| 7.28k| std::vector buf(2); // 2 bytes for length field 231| | 232| | // Serialize in the order extensions were added, which matters for TLS 1.3 233| 72.8k| for(const auto extn_type : m_extension_codes) { ------------------ | Branch (233:29): [True: 72.8k, False: 7.28k] ------------------ 234| 72.8k| const auto& extn = m_extensions.at(extn_type); 235| | 236| 72.8k| if(extn->empty()) { ------------------ | Branch (236:10): [True: 0, False: 72.8k] ------------------ 237| 0| continue; 238| 0| } 239| | 240| 72.8k| const uint16_t extn_code = static_cast(extn_type); 241| | 242| 72.8k| const std::vector extn_val = extn->serialize(whoami); 243| | 244| | // Each extension carries a uint16 length prefix. 245| 72.8k| BOTAN_ASSERT_NOMSG(extn_val.size() <= 0xFFFF); ------------------ | | 77| 72.8k| do { \ | | 78| 72.8k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 72.8k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 72.8k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 72.8k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 72.8k] | | ------------------ ------------------ 246| | 247| 72.8k| buf.push_back(get_byte<0>(extn_code)); 248| 72.8k| buf.push_back(get_byte<1>(extn_code)); 249| | 250| 72.8k| buf.push_back(get_byte<0>(static_cast(extn_val.size()))); 251| 72.8k| buf.push_back(get_byte<1>(static_cast(extn_val.size()))); 252| | 253| 72.8k| buf += extn_val; 254| 72.8k| } 255| | 256| | // The outer extensions block is itself uint16-length-prefixed. 257| 7.28k| BOTAN_ASSERT_NOMSG(buf.size() - 2 <= 0xFFFF); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 258| 7.28k| const uint16_t extn_size = static_cast(buf.size() - 2); 259| | 260| 7.28k| buf[0] = get_byte<0>(extn_size); 261| 7.28k| buf[1] = get_byte<1>(extn_size); 262| | 263| | // avoid sending a completely empty extensions block 264| 7.28k| if(buf.size() == 2) { ------------------ | Branch (264:7): [True: 0, False: 7.28k] ------------------ 265| 0| return std::vector(); 266| 0| } 267| | 268| 7.28k| return buf; 269| 7.28k|} _ZNK5Botan3TLS10Extensions15extension_typesEv: 271| 10.8k|std::set Extensions::extension_types() const { 272| 10.8k| std::set offers; 273| 65.5k| for(const auto& [extn_type, extn] : m_extensions) { ------------------ | Branch (273:38): [True: 65.5k, False: 10.8k] ------------------ 274| | // Consistent with serialize(): empty extensions are not placed on 275| | // the wire so they must not appear in the "offered" set either. 276| 65.5k| if(!extn->empty()) { ------------------ | Branch (276:10): [True: 65.5k, False: 1] ------------------ 277| 65.5k| offers.insert(extn_type); 278| 65.5k| } 279| 65.5k| } 280| 10.8k| return offers; 281| 10.8k|} _ZN5Botan3TLS17Unknown_ExtensionC2ENS0_14Extension_CodeERNS0_15TLS_Data_ReaderEt: 311| 2.05k| m_type(type), m_value(reader.get_fixed(extension_size)) {} _ZN5Botan3TLS21Server_Name_IndicatorC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 317| 336|Server_Name_Indicator::Server_Name_Indicator(TLS_Data_Reader& reader, uint16_t extension_size, Connection_Side from) { 318| | /* 319| | RFC 6066 Section 3 320| | 321| | A server that receives a client hello containing the "server_name" 322| | extension MAY use the information contained in the extension to guide 323| | its selection of an appropriate certificate to return to the client, 324| | and/or other aspects of security policy. In this event, the server 325| | SHALL include an extension of type "server_name" in the (extended) 326| | server hello. The "extension_data" field of this extension SHALL be 327| | empty. 328| | */ 329| 336| if(from == Connection_Side::Server) { ------------------ | Branch (329:7): [True: 336, False: 0] ------------------ 330| 336| if(extension_size != 0) { ------------------ | Branch (330:10): [True: 47, False: 289] ------------------ 331| 47| throw TLS_Exception(Alert::IllegalParameter, "Server sent non-empty SNI extension"); 332| 47| } 333| 336| } else { 334| | // Clients are required to send at least one name in the SNI 335| 0| if(extension_size == 0) { ------------------ | Branch (335:10): [True: 0, False: 0] ------------------ 336| 0| throw TLS_Exception(Alert::IllegalParameter, "Client sent empty SNI extension"); 337| 0| } 338| | 339| 0| const uint16_t name_bytes = reader.get_uint16_t(); 340| | 341| | // RFC 6066 3: a ServerName carrying a host_name (the only NameType 342| | // currently defined and the only one this implementation acts on) 343| | // requires at least 1 byte name_type + 2 byte length + 1 byte HostName. 344| 0| if(name_bytes + 2 != extension_size || name_bytes < 4) { ------------------ | Branch (344:10): [True: 0, False: 0] | Branch (344:46): [True: 0, False: 0] ------------------ 345| 0| throw Decoding_Error("Bad encoding of SNI extension"); 346| 0| } 347| | 348| 0| BOTAN_ASSERT_NOMSG(reader.remaining_bytes() == name_bytes); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 349| | 350| 0| while(reader.has_remaining()) { ------------------ | Branch (350:13): [True: 0, False: 0] ------------------ 351| 0| const uint8_t name_type = reader.get_byte(); 352| | 353| 0| if(name_type == 0) { ------------------ | Branch (353:13): [True: 0, False: 0] ------------------ 354| | /* 355| | RFC 6066 Section 3 356| | The ServerNameList MUST NOT contain more than one name of the same name_type. 357| | */ 358| 0| if(!m_sni_host_name.empty()) { ------------------ | Branch (358:16): [True: 0, False: 0] ------------------ 359| 0| throw Decoding_Error("TLS ServerNameIndicator contains more than one host_name"); 360| 0| } 361| 0| m_sni_host_name = reader.get_string(2, 1, 65535); 362| 0| } else { 363| | /* 364| | Unknown name type - skip its length-prefixed value and continue 365| | 366| | RFC 6066 Section 3 367| | For backward compatibility, all future data structures associated 368| | with new NameTypes MUST begin with a 16-bit length field. 369| | */ 370| 0| const uint16_t unknown_name_len = reader.get_uint16_t(); 371| 0| reader.discard_next(unknown_name_len); 372| 0| } 373| 0| } 374| 0| } 375| 336|} _ZNK5Botan3TLS21Server_Name_Indicator9serializeENS0_15Connection_SideE: 377| 7.28k|std::vector Server_Name_Indicator::serialize(Connection_Side whoami) const { 378| | // RFC 6066 379| | // [...] the server SHALL include an extension of type "server_name" in 380| | // the (extended) server hello. The "extension_data" field of this 381| | // extension SHALL be empty. 382| 7.28k| if(whoami == Connection_Side::Server) { ------------------ | Branch (382:7): [True: 0, False: 7.28k] ------------------ 383| 0| return {}; 384| 0| } 385| | 386| 7.28k| std::vector buf; 387| | 388| 7.28k| const size_t name_len = m_sni_host_name.size(); 389| | 390| | // RFC 6066 3: HostName<1..2^16-1>; the outer ServerNameList wraps a 391| | // 1-byte name_type and a 2-byte length so the whole entry must fit in 392| | // a uint16_t too. 393| 7.28k| BOTAN_ASSERT_NOMSG(name_len + 3 <= 0xFFFF); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 394| | 395| 7.28k| buf.push_back(get_byte<0>(static_cast(name_len + 3))); 396| 7.28k| buf.push_back(get_byte<1>(static_cast(name_len + 3))); 397| 7.28k| buf.push_back(0); // DNS 398| | 399| 7.28k| buf.push_back(get_byte<0>(static_cast(name_len))); 400| 7.28k| buf.push_back(get_byte<1>(static_cast(name_len))); 401| | 402| 7.28k| buf += as_span_of_bytes(m_sni_host_name); 403| | 404| 7.28k| return buf; 405| 7.28k|} _ZN5Botan3TLS21Server_Name_Indicator27hostname_acceptable_for_sniENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 407| 7.28k|bool Server_Name_Indicator::hostname_acceptable_for_sni(std::string_view hostname) { 408| | // Avoid sending an IPv4/IPv6 address in SNI as this is prohibited 409| | 410| 7.28k| if(hostname.empty()) { ------------------ | Branch (410:7): [True: 0, False: 7.28k] ------------------ 411| 0| return false; 412| 0| } 413| | 414| 7.28k| if(string_to_ipv4(hostname).has_value()) { ------------------ | Branch (414:7): [True: 0, False: 7.28k] ------------------ 415| 0| return false; 416| 0| } 417| | 418| | // IPv6? Anyway ':' is not valid in DNS 419| 7.28k| if(hostname.find(':') != std::string_view::npos) { ------------------ | Branch (419:7): [True: 0, False: 7.28k] ------------------ 420| 0| return false; 421| 0| } 422| | 423| 7.28k| return true; 424| 7.28k|} _ZN5Botan3TLS39Application_Layer_Protocol_NotificationC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 443| 88| Connection_Side from) { 444| 88| if(extension_size < 2) { ------------------ | Branch (444:7): [True: 27, False: 61] ------------------ 445| 27| throw Decoding_Error("ALPN extension cannot be empty"); 446| 27| } 447| | 448| 61| const uint16_t name_bytes = reader.get_uint16_t(); 449| | 450| 61| size_t bytes_remaining = extension_size - 2; 451| | 452| 61| if(name_bytes != bytes_remaining) { ------------------ | Branch (452:7): [True: 12, False: 49] ------------------ 453| 12| throw Decoding_Error("Bad encoding of ALPN extension, bad length field"); 454| 12| } 455| | 456| | // RFC 7301 3.1: ProtocolName protocol_name_list<2..2^16-1> 457| 49| if(name_bytes == 0) { ------------------ | Branch (457:7): [True: 1, False: 48] ------------------ 458| 1| throw Decoding_Error("Empty ALPN protocol_name_list not allowed"); 459| 1| } 460| | 461| 3.88k| while(bytes_remaining > 0) { ------------------ | Branch (461:10): [True: 3.84k, False: 44] ------------------ 462| 3.84k| const std::string p = reader.get_string(1, 0, 255); 463| | 464| 3.84k| if(bytes_remaining < p.size() + 1) { ------------------ | Branch (464:10): [True: 0, False: 3.84k] ------------------ 465| 0| throw Decoding_Error("Bad encoding of ALPN, length field too long"); 466| 0| } 467| | 468| 3.84k| if(p.empty()) { ------------------ | Branch (468:10): [True: 4, False: 3.83k] ------------------ 469| 4| throw Decoding_Error("Empty ALPN protocol not allowed"); 470| 4| } 471| | 472| 3.83k| bytes_remaining -= (p.size() + 1); 473| | 474| 3.83k| m_protocols.push_back(p); 475| 3.83k| } 476| | 477| | // RFC 7301 3.1 478| | // The "extension_data" field of the [...] extension is structured the 479| | // same as described above for the client "extension_data", except that 480| | // the "ProtocolNameList" MUST contain exactly one "ProtocolName". 481| 44| if(from == Connection_Side::Server && m_protocols.size() != 1) { ------------------ | Branch (481:7): [True: 21, False: 23] | Branch (481:42): [True: 17, False: 4] ------------------ 482| 17| throw TLS_Exception( 483| 17| Alert::DecodeError, 484| 17| "Server sent " + std::to_string(m_protocols.size()) + " protocols in ALPN extension response"); 485| 17| } 486| 44|} _ZN5Botan3TLS21Certificate_Type_BaseC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 549| 27| m_from(from) { 550| 27| if(extension_size == 0) { ------------------ | Branch (550:7): [True: 3, False: 24] ------------------ 551| 3| throw Decoding_Error("Certificate type extension cannot be empty"); 552| 3| } 553| | 554| 24| if(from == Connection_Side::Client) { ------------------ | Branch (554:7): [True: 0, False: 24] ------------------ 555| 0| const auto type_bytes = reader.get_tls_length_value(1); 556| 0| if(static_cast(extension_size) != type_bytes.size() + 1) { ------------------ | Branch (556:10): [True: 0, False: 0] ------------------ 557| 0| throw Decoding_Error("certificate type extension had inconsistent length"); 558| 0| } 559| | // RFC 7250 4: {client,server}_certificate_types<1..2^8-1> so must be non-empty 560| 0| if(type_bytes.empty()) { ------------------ | Branch (560:10): [True: 0, False: 0] ------------------ 561| 0| throw Decoding_Error("Certificate type extension contains no types"); 562| 0| } 563| 0| std::transform( 564| 0| type_bytes.begin(), type_bytes.end(), std::back_inserter(m_certificate_types), [](const auto type_byte) { 565| 0| return static_cast(type_byte); 566| 0| }); 567| 24| } else { 568| | // RFC 7250 4.2 569| | // Note that only a single value is permitted in the 570| | // server_certificate_type extension when carried in the server hello. 571| 24| if(extension_size != 1) { ------------------ | Branch (571:10): [True: 2, False: 22] ------------------ 572| 2| throw Decoding_Error("Server's certificate type extension must be of length 1"); 573| 2| } 574| 22| const auto type_byte = reader.get_byte(); 575| 22| m_certificate_types.push_back(static_cast(type_byte)); 576| 22| } 577| 24|} _ZN5Botan3TLS16Supported_GroupsC2ERKNSt3__16vectorINS0_12Group_ParamsENS2_9allocatorIS4_EEEE: 616| 7.28k|Supported_Groups::Supported_Groups(const std::vector& groups) : m_groups(groups) {} _ZNK5Botan3TLS16Supported_Groups9ec_groupsEv: 622| 7.28k|std::vector Supported_Groups::ec_groups() const { 623| 7.28k| std::vector ec; 624| 72.8k| for(auto g : m_groups) { ------------------ | Branch (624:15): [True: 72.8k, False: 7.28k] ------------------ 625| 72.8k| if(g.is_pure_ecc_group()) { ------------------ | Branch (625:10): [True: 58.2k, False: 14.5k] ------------------ 626| 58.2k| ec.push_back(g); 627| 58.2k| } 628| 72.8k| } 629| 7.28k| return ec; 630| 7.28k|} _ZNK5Botan3TLS16Supported_Groups9serializeENS0_15Connection_SideE: 642| 7.28k|std::vector Supported_Groups::serialize(Connection_Side /*whoami*/) const { 643| 7.28k| std::vector buf(2); 644| | 645| 72.8k| for(auto g : m_groups) { ------------------ | Branch (645:15): [True: 72.8k, False: 7.28k] ------------------ 646| 72.8k| const uint16_t id = g.wire_code(); 647| | 648| 72.8k| if(id > 0) { ------------------ | Branch (648:10): [True: 72.8k, False: 0] ------------------ 649| 72.8k| buf.push_back(get_byte<0>(id)); 650| 72.8k| buf.push_back(get_byte<1>(id)); 651| 72.8k| } 652| 72.8k| } 653| | 654| | // RFC 8446 4.2.7: NamedGroup named_group_list<2..2^16-1>; 655| 7.28k| BOTAN_ASSERT_NOMSG(buf.size() - 2 <= 0xFFFF); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 656| 7.28k| buf[0] = get_byte<0>(static_cast(buf.size() - 2)); 657| 7.28k| buf[1] = get_byte<1>(static_cast(buf.size() - 2)); 658| | 659| 7.28k| return buf; 660| 7.28k|} _ZN5Botan3TLS16Supported_GroupsC2ERNS0_15TLS_Data_ReaderEt: 662| 62|Supported_Groups::Supported_Groups(TLS_Data_Reader& reader, uint16_t extension_size) { 663| 62| const uint16_t len = reader.get_uint16_t(); 664| | 665| 62| if(len + 2 != extension_size) { ------------------ | Branch (665:7): [True: 22, False: 40] ------------------ 666| 22| throw Decoding_Error("Inconsistent length field in supported groups list"); 667| 22| } 668| | 669| | // RFC 8446 4.2.7: NamedGroup named_group_list<2..2^16-1>; 670| 40| if(len == 0) { ------------------ | Branch (670:7): [True: 12, False: 28] ------------------ 671| 12| throw Decoding_Error("Empty supported groups list"); 672| 12| } 673| | 674| 28| if(len % 2 == 1) { ------------------ | Branch (674:7): [True: 1, False: 27] ------------------ 675| 1| throw Decoding_Error("Supported groups list of strange size"); 676| 1| } 677| | 678| 27| const size_t elems = len / 2; 679| | 680| 27| std::unordered_set seen; 681| 1.09k| for(size_t i = 0; i != elems; ++i) { ------------------ | Branch (681:22): [True: 1.07k, False: 27] ------------------ 682| 1.07k| const auto group = static_cast(reader.get_uint16_t()); 683| | // Note: RFC 8446 does not explicitly enforce that groups must be unique. 684| 1.07k| if(seen.insert(group.wire_code()).second) { ------------------ | Branch (684:10): [True: 725, False: 347] ------------------ 685| 725| m_groups.push_back(group); 686| 725| } 687| 1.07k| } 688| 27|} _ZNK5Botan3TLS20Signature_Algorithms9serializeENS0_15Connection_SideE: 729| 7.28k|std::vector Signature_Algorithms::serialize(Connection_Side /*whoami*/) const { 730| 7.28k| return serialize_signature_algorithms(m_schemes); 731| 7.28k|} _ZN5Botan3TLS20Signature_AlgorithmsC2ERNS0_15TLS_Data_ReaderEt: 734| 22| m_schemes(parse_signature_algorithms(reader, extension_size)) {} _ZN5Botan3TLS25Signature_Algorithms_CertC2ERNS0_15TLS_Data_ReaderEt: 741| 28| m_schemes(parse_signature_algorithms(reader, extension_size)) {} _ZN5Botan3TLS24SRTP_Protection_ProfilesC2ERNS0_15TLS_Data_ReaderEt: 743| 51|SRTP_Protection_Profiles::SRTP_Protection_Profiles(TLS_Data_Reader& reader, uint16_t extension_size) { 744| | // RFC 5764 4.1.1: UseSRTPData consists of 745| | // SRTPProtectionProfile SRTPProtectionProfiles<2..2^16-1>; 746| | // opaque srtp_mki<0..255>; 747| | // for a wire size of 2 (profiles len) + 2*N + 1 (mki len) + mki_bytes, 748| | // with N >= 1. 749| 51| if(extension_size < 5) { ------------------ | Branch (749:7): [True: 29, False: 22] ------------------ 750| 29| throw Decoding_Error("Truncated SRTP protection extension"); 751| 29| } 752| 22| const size_t max_profile_pairs = (static_cast(extension_size) - 3) / 2; 753| 22| m_pp = reader.get_range(2, 1, max_profile_pairs); 754| 22| const std::vector mki = reader.get_range(1, 0, 255); 755| | 756| 22| if(m_pp.size() * 2 + mki.size() + 3 != extension_size) { ------------------ | Branch (756:7): [True: 3, False: 19] ------------------ 757| 3| throw Decoding_Error("Bad encoding for SRTP protection extension"); 758| 3| } 759| | 760| 19| if(!mki.empty()) { ------------------ | Branch (760:7): [True: 0, False: 19] ------------------ 761| 0| throw Decoding_Error("Unhandled non-empty MKI for SRTP protection extension"); 762| 0| } 763| 19|} _ZNK5Botan3TLS18Supported_Versions9serializeENS0_15Connection_SideE: 782| 7.28k|std::vector Supported_Versions::serialize(Connection_Side whoami) const { 783| 7.28k| std::vector buf; 784| | 785| 7.28k| if(whoami == Connection_Side::Server) { ------------------ | Branch (785:7): [True: 0, False: 7.28k] ------------------ 786| 0| BOTAN_ASSERT_NOMSG(m_versions.size() == 1); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 787| 0| buf.push_back(m_versions[0].major_version()); 788| 0| buf.push_back(m_versions[0].minor_version()); 789| 7.28k| } else { 790| | // RFC 8446 4.2.1: ProtocolVersion versions<2..254>; - up to 127 entries. 791| 7.28k| BOTAN_ASSERT_NOMSG(!m_versions.empty()); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 792| 7.28k| BOTAN_ASSERT_NOMSG(m_versions.size() <= 127); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 793| 7.28k| const uint8_t len = static_cast(m_versions.size() * 2); 794| | 795| 7.28k| buf.push_back(len); 796| | 797| 7.28k| for(const Protocol_Version version : m_versions) { ------------------ | Branch (797:42): [True: 7.28k, False: 7.28k] ------------------ 798| 7.28k| buf.push_back(version.major_version()); 799| 7.28k| buf.push_back(version.minor_version()); 800| 7.28k| } 801| 7.28k| } 802| | 803| 7.28k| return buf; 804| 7.28k|} _ZN5Botan3TLS18Supported_VersionsC2ENS0_16Protocol_VersionERKNS0_6PolicyE: 806| 7.28k|Supported_Versions::Supported_Versions(Protocol_Version offer, const Policy& policy) { 807| | // RFC 8446 4.2.1 808| | // The extension contains a list of supported versions in preference order, 809| | // with the most preferred version first. Implementations [...] MUST send 810| | // this extension in the ClientHello containing all versions of TLS which 811| | // they are prepared to negotiate. 812| | // 813| | // We simply assume that we always want the newest available TLS version. 814| 7.28k|#if defined(BOTAN_HAS_TLS_13) 815| 7.28k| if(!offer.is_datagram_protocol()) { ------------------ | Branch (815:7): [True: 7.28k, False: 0] ------------------ 816| 7.28k| if(offer >= Protocol_Version::TLS_V13 && policy.allow_tls13()) { ------------------ | Branch (816:10): [True: 0, False: 7.28k] | Branch (816:10): [True: 0, False: 7.28k] | Branch (816:48): [True: 0, False: 0] ------------------ 817| 0| m_versions.push_back(Protocol_Version::TLS_V13); 818| 0| } 819| 7.28k| } 820| 7.28k|#endif 821| | 822| 7.28k|#if defined(BOTAN_HAS_TLS_12) 823| 7.28k| if(offer.is_datagram_protocol()) { ------------------ | Branch (823:7): [True: 0, False: 7.28k] ------------------ 824| 0| if(offer >= Protocol_Version::DTLS_V12 && policy.allow_dtls12()) { ------------------ | Branch (824:10): [True: 0, False: 0] | Branch (824:10): [True: 0, False: 0] | Branch (824:49): [True: 0, False: 0] ------------------ 825| 0| m_versions.push_back(Protocol_Version::DTLS_V12); 826| 0| } 827| 7.28k| } else { 828| 7.28k| if(offer >= Protocol_Version::TLS_V12 && policy.allow_tls12()) { ------------------ | Branch (828:10): [True: 7.28k, False: 0] | Branch (828:10): [True: 7.28k, False: 0] | Branch (828:48): [True: 7.28k, False: 0] ------------------ 829| 7.28k| m_versions.push_back(Protocol_Version::TLS_V12); 830| 7.28k| } 831| 7.28k| } 832| 7.28k|#endif 833| | 834| | // if no versions are supported, the input variables are not used 835| 7.28k| BOTAN_UNUSED(offer, policy); ------------------ | | 144| 7.28k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 836| 7.28k|} _ZN5Botan3TLS18Supported_VersionsC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 838| 15|Supported_Versions::Supported_Versions(TLS_Data_Reader& reader, uint16_t extension_size, Connection_Side from) { 839| 15| if(from == Connection_Side::Server) { ------------------ | Branch (839:7): [True: 15, False: 0] ------------------ 840| 15| if(extension_size != 2) { ------------------ | Branch (840:10): [True: 2, False: 13] ------------------ 841| 2| throw Decoding_Error("Server sent invalid supported_versions extension"); 842| 2| } 843| 13| m_versions.push_back(Protocol_Version(reader.get_uint16_t())); 844| 13| } else { 845| 0| auto versions = reader.get_range(1, 1, 127); 846| | 847| 0| for(auto v : versions) { ------------------ | Branch (847:18): [True: 0, False: 0] ------------------ 848| 0| m_versions.push_back(Protocol_Version(v)); 849| 0| } 850| | 851| 0| if(extension_size != 1 + 2 * versions.size()) { ------------------ | Branch (851:10): [True: 0, False: 0] ------------------ 852| 0| throw Decoding_Error("Client sent invalid supported_versions extension"); 853| 0| } 854| 0| } 855| 15|} _ZN5Botan3TLS17Record_Size_LimitC2ERNS0_15TLS_Data_ReaderEtNS0_15Connection_SideE: 872| 30|Record_Size_Limit::Record_Size_Limit(TLS_Data_Reader& reader, uint16_t extension_size, Connection_Side from) { 873| 30| if(extension_size != 2) { ------------------ | Branch (873:7): [True: 1, False: 29] ------------------ 874| 1| throw TLS_Exception(Alert::DecodeError, "invalid record_size_limit extension"); 875| 1| } 876| | 877| 29| m_limit = reader.get_uint16_t(); 878| | 879| | // RFC 8449 4. 880| | // This value is the length of the plaintext of a protected record. 881| | // The value includes the content type and padding added in TLS 1.3 (that 882| | // is, the complete length of TLSInnerPlaintext). 883| | // 884| | // A server MUST NOT enforce this restriction; a client might advertise 885| | // a higher limit that is enabled by an extension or version the server 886| | // does not understand. A client MAY abort the handshake with an 887| | // "illegal_parameter" alert. 888| | // 889| | // Note: We are currently supporting this extension in TLS 1.3 only, hence 890| | // we check for the TLS 1.3 limit. The TLS 1.2 limit would not include 891| | // the "content type byte" and hence be one byte less! 892| 29| if(m_limit > MAX_PLAINTEXT_SIZE + 1 /* encrypted content type byte */ && from == Connection_Side::Server) { ------------------ | Branch (892:7): [True: 2, False: 27] | Branch (892:77): [True: 2, False: 0] ------------------ 893| 2| throw TLS_Exception(Alert::IllegalParameter, 894| 2| "Server requested a record size limit larger than the protocol's maximum"); 895| 2| } 896| | 897| | // RFC 8449 4. 898| | // Endpoints MUST NOT send a "record_size_limit" extension with a value 899| | // smaller than 64. An endpoint MUST treat receipt of a smaller value 900| | // as a fatal error and generate an "illegal_parameter" alert. 901| 27| if(m_limit < 64) { ------------------ | Branch (901:7): [True: 3, False: 24] ------------------ 902| 3| throw TLS_Exception(Alert::IllegalParameter, "Received a record size limit smaller than 64 bytes"); 903| 3| } 904| 27|} tls_extensions.cpp:_ZN5Botan3TLS12_GLOBAL__N_114make_extensionERNS0_15TLS_Data_ReaderENS0_14Extension_CodeENS0_15Connection_SideENS0_14Handshake_TypeE: 39| 13.6k| const Handshake_Type message_type) { 40| | // This cast is safe because we read exactly a 16 bit length field for 41| | // the extension in Extensions::deserialize 42| 13.6k| const uint16_t size = static_cast(reader.remaining_bytes()); 43| 13.6k| switch(code) { ------------------ | Branch (43:11): [True: 11.6k, False: 2.04k] ------------------ 44| 336| case Extension_Code::ServerNameIndication: ------------------ | Branch (44:7): [True: 336, False: 13.3k] ------------------ 45| 336| return std::make_unique(reader, size, from); 46| | 47| 62| case Extension_Code::SupportedGroups: ------------------ | Branch (47:7): [True: 62, False: 13.6k] ------------------ 48| 62| return std::make_unique(reader, size); 49| | 50| 49| case Extension_Code::CertificateStatusRequest: ------------------ | Branch (50:7): [True: 49, False: 13.6k] ------------------ 51| 49| return std::make_unique(reader, size, message_type, from); 52| | 53| 22| case Extension_Code::SignatureAlgorithms: ------------------ | Branch (53:7): [True: 22, False: 13.6k] ------------------ 54| 22| return std::make_unique(reader, size); 55| | 56| 28| case Extension_Code::CertSignatureAlgorithms: ------------------ | Branch (56:7): [True: 28, False: 13.6k] ------------------ 57| 28| return std::make_unique(reader, size); 58| | 59| 51| case Extension_Code::UseSrtp: ------------------ | Branch (59:7): [True: 51, False: 13.6k] ------------------ 60| 51| return std::make_unique(reader, size); 61| | 62| 88| case Extension_Code::ApplicationLayerProtocolNegotiation: ------------------ | Branch (62:7): [True: 88, False: 13.5k] ------------------ 63| 88| return std::make_unique(reader, size, from); 64| | 65| 13| case Extension_Code::ClientCertificateType: ------------------ | Branch (65:7): [True: 13, False: 13.6k] ------------------ 66| 13| return std::make_unique(reader, size, from); 67| | 68| 14| case Extension_Code::ServerCertificateType: ------------------ | Branch (68:7): [True: 14, False: 13.6k] ------------------ 69| 14| return std::make_unique(reader, size, from); 70| | 71| 30| case Extension_Code::RecordSizeLimit: ------------------ | Branch (71:7): [True: 30, False: 13.6k] ------------------ 72| 30| return std::make_unique(reader, size, from); 73| | 74| 15| case Extension_Code::SupportedVersions: ------------------ | Branch (74:7): [True: 15, False: 13.6k] ------------------ 75| 15| return std::make_unique(reader, size, from); 76| | 77| 6| case Extension_Code::Padding: ------------------ | Branch (77:7): [True: 6, False: 13.6k] ------------------ 78| 6| break; // RFC 7685, recognized but not implemented; falls through to Unknown_Extension 79| | 80| 0|#if defined(BOTAN_HAS_TLS_12) 81| 370| case Extension_Code::EcPointFormats: ------------------ | Branch (81:7): [True: 370, False: 13.2k] ------------------ 82| 370| return std::make_unique(reader, size); 83| | 84| 3.34k| case Extension_Code::SafeRenegotiation: ------------------ | Branch (84:7): [True: 3.34k, False: 10.3k] ------------------ 85| 3.34k| return std::make_unique(reader, size); 86| | 87| 3.14k| case Extension_Code::ExtendedMasterSecret: ------------------ | Branch (87:7): [True: 3.14k, False: 10.5k] ------------------ 88| 3.14k| return std::make_unique(reader, size); 89| | 90| 38| case Extension_Code::EncryptThenMac: ------------------ | Branch (90:7): [True: 38, False: 13.6k] ------------------ 91| 38| return std::make_unique(reader, size); 92| | 93| 3.09k| case Extension_Code::SessionTicket: ------------------ | Branch (93:7): [True: 3.09k, False: 10.5k] ------------------ 94| 3.09k| return std::make_unique(reader, size, from); 95| |#else 96| | case Extension_Code::EcPointFormats: 97| | case Extension_Code::SafeRenegotiation: 98| | case Extension_Code::ExtendedMasterSecret: 99| | case Extension_Code::EncryptThenMac: 100| | case Extension_Code::SessionTicket: 101| | break; // considered as 'unknown extension' 102| |#endif 103| | 104| 0|#if defined(BOTAN_HAS_TLS_13) 105| 14| case Extension_Code::PresharedKey: ------------------ | Branch (105:7): [True: 14, False: 13.6k] ------------------ 106| 14| return std::make_unique(reader, size, message_type); 107| | 108| 25| case Extension_Code::EarlyData: ------------------ | Branch (108:7): [True: 25, False: 13.6k] ------------------ 109| 25| return std::make_unique(reader, size, message_type); 110| | 111| 47| case Extension_Code::Cookie: ------------------ | Branch (111:7): [True: 47, False: 13.6k] ------------------ 112| 47| return std::make_unique(reader, size); 113| | 114| 53| case Extension_Code::PskKeyExchangeModes: ------------------ | Branch (114:7): [True: 53, False: 13.6k] ------------------ 115| 53| return std::make_unique(reader, size); 116| | 117| 747| case Extension_Code::CertificateAuthorities: ------------------ | Branch (117:7): [True: 747, False: 12.9k] ------------------ 118| 747| return std::make_unique(reader, size); 119| | 120| 25| case Extension_Code::KeyShare: ------------------ | Branch (120:7): [True: 25, False: 13.6k] ------------------ 121| 25| return std::make_unique(reader, size, message_type); 122| |#else 123| | case Extension_Code::PresharedKey: 124| | case Extension_Code::EarlyData: 125| | case Extension_Code::Cookie: 126| | case Extension_Code::PskKeyExchangeModes: 127| | case Extension_Code::CertificateAuthorities: 128| | case Extension_Code::KeyShare: 129| | break; // considered as 'unknown extension' 130| |#endif 131| 13.6k| } 132| | 133| 2.05k| return std::make_unique(code, reader, size); 134| 13.6k|} tls_extensions.cpp:_ZN5Botan3TLS12_GLOBAL__N_130serialize_signature_algorithmsERKNSt3__16vectorINS0_16Signature_SchemeENS2_9allocatorIS4_EEEE: 692| 7.28k|std::vector serialize_signature_algorithms(const std::vector& schemes) { 693| 7.28k| BOTAN_ASSERT(schemes.size() < 256, "Too many signature schemes"); ------------------ | | 64| 7.28k| do { \ | | 65| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 66| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (66:10): [True: 0, False: 7.28k] | | ------------------ | | 67| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 68| 0| Botan::assertion_failure(#expr, assertion_made, __func__, __FILE__, __LINE__); \ | | 69| 0| } \ | | 70| 7.28k| } while(0) | | ------------------ | | | Branch (70:12): [Folded, False: 7.28k] | | ------------------ ------------------ 694| | 695| 7.28k| std::vector buf; 696| | 697| 7.28k| const uint16_t len = static_cast(schemes.size() * 2); 698| | 699| 7.28k| buf.push_back(get_byte<0>(len)); 700| 7.28k| buf.push_back(get_byte<1>(len)); 701| | 702| 65.5k| for(const Signature_Scheme scheme : schemes) { ------------------ | Branch (702:38): [True: 65.5k, False: 7.28k] ------------------ 703| 65.5k| buf.push_back(get_byte<0>(scheme.wire_code())); 704| 65.5k| buf.push_back(get_byte<1>(scheme.wire_code())); 705| 65.5k| } 706| | 707| 7.28k| return buf; 708| 7.28k|} tls_extensions.cpp:_ZN5Botan3TLS12_GLOBAL__N_126parse_signature_algorithmsERNS0_15TLS_Data_ReaderEt: 710| 50|std::vector parse_signature_algorithms(TLS_Data_Reader& reader, uint16_t extension_size) { 711| 50| uint16_t len = reader.get_uint16_t(); 712| | 713| 50| if(len + 2 != extension_size || len % 2 == 1 || len == 0) { ------------------ | Branch (713:7): [True: 21, False: 29] | Branch (713:36): [True: 1, False: 28] | Branch (713:52): [True: 1, False: 27] ------------------ 714| 21| throw Decoding_Error("Bad encoding on signature algorithms extension"); 715| 21| } 716| | 717| 29| std::vector schemes; 718| 29| schemes.reserve(len / 2); 719| 398| while(len > 0) { ------------------ | Branch (719:10): [True: 369, False: 29] ------------------ 720| 369| schemes.emplace_back(reader.get_uint16_t()); 721| 369| len -= 2; 722| 369| } 723| | 724| 29| return schemes; 725| 50|} _ZN5Botan3TLS26Certificate_Status_RequestC2ERNS0_15TLS_Data_ReaderEtNS0_14Handshake_TypeENS0_15Connection_SideE: 104| 49| Connection_Side from) { 105| | // This parser needs to take TLS 1.2 and TLS 1.3 into account. The 106| | // extension's content and structure is dependent on the context it 107| | // was sent in (i.e. the enclosing handshake message). Below is a list 108| | // of handshake messages this can appear in. 109| | // 110| | // TLS 1.2 111| | // * Client Hello 112| | // * Server Hello 113| | // 114| | // TLS 1.3 115| | // * Client Hello 116| | // * Certificate Request 117| | // * Certificate (Entry) 118| | 119| | // RFC 6066 8. 120| | // In order to indicate their desire to receive certificate status 121| | // information, clients MAY include an extension of type "status_request" 122| | // in the (extended) client hello. 123| 49| if(message_type == Handshake_Type::ClientHello) { ------------------ | Branch (123:7): [True: 0, False: 49] ------------------ 124| 0| m_impl = std::make_unique( 125| 0| RFC6066_Certificate_Status_Request(reader, extension_size)); 126| 0| } 127| | 128| | // RFC 6066 8. 129| | // If a server returns a "CertificateStatus" message, then the server MUST 130| | // have included an extension of type "status_request" with empty 131| | // "extension_data" in the extended server hello. 132| | // 133| | // RFC 8446 4.4.2.1 134| | // A server MAY request that a client present an OCSP response with its 135| | // certificate by sending an empty "status_request" extension in its 136| | // CertificateRequest message. 137| 49| else if(message_type == Handshake_Type::ServerHello || message_type == Handshake_Type::CertificateRequest) { ------------------ | Branch (137:12): [True: 48, False: 1] | Branch (137:59): [True: 0, False: 1] ------------------ 138| 48| m_impl = std::make_unique( 139| 48| RFC6066_Empty_Certificate_Status_Request(extension_size)); 140| 48| } 141| | 142| | // RFC 8446 4.4.2.1 143| | // In TLS 1.3, the server's OCSP information is carried in an extension 144| | // in the CertificateEntry [in a Certificate handshake message] [...]. 145| | // Specifically, the body of the "status_request" extension from the 146| | // server MUST be a CertificateStatus structure as defined in [RFC6066] 147| | // [...]. 148| | // 149| | // RFC 8446 4.4.2.1 150| | // If the client opts to send an OCSP response, the body of its 151| | // "status_request" extension MUST be a CertificateStatus structure as 152| | // defined in [RFC6066]. 153| 1| else if(message_type == Handshake_Type::Certificate) { ------------------ | Branch (153:12): [True: 0, False: 1] ------------------ 154| 0| m_impl = std::make_unique( 155| 0| Certificate_Status(reader.get_fixed(extension_size), from)); 156| 0| } 157| | 158| | // all other contexts are not allowed for this extension 159| 1| else { 160| 1| throw TLS_Exception(Alert::UnsupportedExtension, 161| 1| "Server sent a Certificate_Status_Request extension in an unsupported context"); 162| 1| } 163| 49|} _ZN5Botan3TLS26Certificate_Status_RequestC2ENSt3__16vectorIhNS2_9allocatorIhEEEENS3_IS6_NS4_IS6_EEEE: 170| 7.28k| m_impl(std::make_unique( 171| 7.28k| RFC6066_Certificate_Status_Request(std::move(ocsp_responder_ids), std::move(ocsp_key_ids)))) {} _ZN5Botan3TLS26Certificate_Status_RequestD2Ev: 176| 7.33k|Certificate_Status_Request::~Certificate_Status_Request() = default; _ZNK5Botan3TLS26Certificate_Status_Request9serializeENS0_15Connection_SideE: 184| 7.28k|std::vector Certificate_Status_Request::serialize(Connection_Side /*side*/) const { 185| 7.28k| BOTAN_ASSERT_NONNULL(m_impl); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 186| 7.28k| return std::visit([](const auto& c) { return c.serialize(); }, m_impl->content); 187| 7.28k|} tls_extensions_cert_status_req.cpp:_ZN5Botan3TLS12_GLOBAL__N_140RFC6066_Empty_Certificate_Status_RequestC2Et: 24| 48| explicit RFC6066_Empty_Certificate_Status_Request(uint16_t extension_size) { 25| 48| if(extension_size != 0) { ------------------ | Branch (25:13): [True: 2, False: 46] ------------------ 26| 2| throw Decoding_Error("Received an unexpectedly non-empty Certificate_Status_Request"); 27| 2| } 28| 48| } tls_extensions_cert_status_req.cpp:_ZN5Botan3TLS12_GLOBAL__N_134RFC6066_Certificate_Status_RequestC2ENSt3__16vectorIhNS3_9allocatorIhEEEENS4_IS7_NS5_IS7_EEEE: 36| 7.28k| ocsp_names(std::move(names)), ocsp_keys(std::move(keys)) {} tls_extensions_cert_status_req.cpp:_ZZNK5Botan3TLS26Certificate_Status_Request9serializeENS0_15Connection_SideEENK3$_0clINS0_12_GLOBAL__N_134RFC6066_Certificate_Status_RequestEEEDaRKT_: 186| 7.28k| return std::visit([](const auto& c) { return c.serialize(); }, m_impl->content); tls_extensions_cert_status_req.cpp:_ZNK5Botan3TLS12_GLOBAL__N_134RFC6066_Certificate_Status_Request9serializeEv: 71| 7.28k| std::vector serialize() const { 72| | // Serialization is hard-coded as we don't support advanced features 73| | // of this extension anyway. 74| 7.28k| return { 75| 7.28k| 1, // status_type = ocsp 76| 7.28k| 0, 77| 7.28k| 0, // empty responder_id_list 78| 7.28k| 0, 79| 7.28k| 0, // no extensions 80| 7.28k| }; 81| 7.28k| } tls_extensions_cert_status_req.cpp:_ZN5Botan3TLS35Certificate_Status_Request_InternalC2ENSt3__17variantIJNS0_12_GLOBAL__N_140RFC6066_Empty_Certificate_Status_RequestENS4_34RFC6066_Certificate_Status_RequestENS0_18Certificate_StatusEEEE: 96| 7.33k| explicit Certificate_Status_Request_Internal(Contents c) : content(std::move(c)) {} _ZN5Botan3TLS11ExternalPSK21extract_master_secretEv: 16| 15|secure_vector ExternalPSK::extract_master_secret() { 17| 15| BOTAN_STATE_CHECK(!m_master_secret.empty()); ------------------ | | 51| 15| do { \ | | 52| 15| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 15| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 15] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 15| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 15] | | ------------------ ------------------ 18| 15| return std::exchange(m_master_secret, {}); 19| 15|} _ZNK5Botan3TLS21Handshake_Transitions22received_handshake_msgENS0_14Handshake_TypeE: 125| 369|bool Handshake_Transitions::received_handshake_msg(Handshake_Type msg_type) const { 126| 369| const uint32_t mask = bitmask_for_handshake_type(msg_type); 127| | 128| 369| return (m_hand_received_mask & mask) != 0; 129| 369|} _ZN5Botan3TLS21Handshake_Transitions21confirm_transition_toENS0_14Handshake_TypeE: 131| 10.7k|void Handshake_Transitions::confirm_transition_to(Handshake_Type msg_type) { 132| 10.7k| const uint32_t mask = bitmask_for_handshake_type(msg_type); 133| | 134| 10.7k| m_hand_received_mask |= mask; 135| | 136| 10.7k| const bool ok = (m_hand_expecting_mask & mask) != 0; // overlap? 137| | 138| 10.7k| if(!ok) { ------------------ | Branch (138:7): [True: 35, False: 10.6k] ------------------ 139| 35| const uint32_t seen_so_far = m_hand_received_mask & ~mask; 140| | 141| 35| std::ostringstream msg; 142| | 143| 35| msg << "Unexpected state transition in handshake got a " << handshake_type_to_string(msg_type); 144| | 145| 35| if(m_hand_expecting_mask == 0) { ------------------ | Branch (145:10): [True: 0, False: 35] ------------------ 146| 0| msg << " not expecting messages"; 147| 35| } else { 148| 35| msg << " expected " << handshake_mask_to_string(m_hand_expecting_mask, '|'); 149| 35| } 150| | 151| 35| if(seen_so_far != 0) { ------------------ | Branch (151:10): [True: 4, False: 31] ------------------ 152| 4| msg << " seen " << handshake_mask_to_string(seen_so_far, '+'); 153| 4| } 154| | 155| 35| throw Unexpected_Message(msg.str()); 156| 35| } 157| | 158| | /* We don't know what to expect next, so force a call to 159| | set_expected_next; if it doesn't happen, the next transition 160| | check will always fail which is what we want. 161| | */ 162| 10.6k| m_hand_expecting_mask = 0; 163| 10.6k|} _ZN5Botan3TLS21Handshake_Transitions17set_expected_nextENS0_14Handshake_TypeE: 165| 11.5k|void Handshake_Transitions::set_expected_next(Handshake_Type msg_type) { 166| 11.5k| m_hand_expecting_mask |= bitmask_for_handshake_type(msg_type); 167| 11.5k|} _ZNK5Botan3TLS21Handshake_Transitions27change_cipher_spec_expectedEv: 175| 15.5k|bool Handshake_Transitions::change_cipher_spec_expected() const { 176| 15.5k| return (bitmask_for_handshake_type(Handshake_Type::HandshakeCCS) & m_hand_expecting_mask) != 0; 177| 15.5k|} tls_handshake_transitions.cpp:_ZN5Botan3TLS12_GLOBAL__N_126bitmask_for_handshake_typeENS0_14Handshake_TypeE: 19| 38.8k|uint32_t bitmask_for_handshake_type(Handshake_Type type) { 20| 38.8k| switch(type) { ------------------ | Branch (20:11): [True: 38.8k, False: 11] ------------------ 21| 44| case Handshake_Type::HelloVerifyRequest: ------------------ | Branch (21:7): [True: 44, False: 38.8k] ------------------ 22| 44| return (1 << 0); 23| | 24| 57| case Handshake_Type::HelloRequest: ------------------ | Branch (24:7): [True: 57, False: 38.8k] ------------------ 25| 57| return (1 << 1); 26| | 27| 40| case Handshake_Type::ClientHello: ------------------ | Branch (27:7): [True: 40, False: 38.8k] ------------------ 28| 40| return (1 << 2); 29| | 30| 14.2k| case Handshake_Type::ServerHello: ------------------ | Branch (30:7): [True: 14.2k, False: 24.6k] ------------------ 31| 14.2k| return (1 << 3); 32| | 33| 6.25k| case Handshake_Type::Certificate: ------------------ | Branch (33:7): [True: 6.25k, False: 32.6k] ------------------ 34| 6.25k| return (1 << 4); 35| | 36| 41| case Handshake_Type::CertificateUrl: ------------------ | Branch (36:7): [True: 41, False: 38.8k] ------------------ 37| 41| return (1 << 5); 38| | 39| 40| case Handshake_Type::CertificateStatus: ------------------ | Branch (39:7): [True: 40, False: 38.8k] ------------------ 40| 40| return (1 << 6); 41| | 42| 705| case Handshake_Type::ServerKeyExchange: ------------------ | Branch (42:7): [True: 705, False: 38.1k] ------------------ 43| 705| return (1 << 7); 44| | 45| 794| case Handshake_Type::CertificateRequest: ------------------ | Branch (45:7): [True: 794, False: 38.0k] ------------------ 46| 794| return (1 << 8); 47| | 48| 754| case Handshake_Type::ServerHelloDone: ------------------ | Branch (48:7): [True: 754, False: 38.1k] ------------------ 49| 754| return (1 << 9); 50| | 51| 40| case Handshake_Type::CertificateVerify: ------------------ | Branch (51:7): [True: 40, False: 38.8k] ------------------ 52| 40| return (1 << 10); 53| | 54| 40| case Handshake_Type::ClientKeyExchange: ------------------ | Branch (54:7): [True: 40, False: 38.8k] ------------------ 55| 40| return (1 << 11); 56| | 57| 81| case Handshake_Type::NewSessionTicket: ------------------ | Branch (57:7): [True: 81, False: 38.7k] ------------------ 58| 81| return (1 << 12); 59| | 60| 15.5k| case Handshake_Type::HandshakeCCS: ------------------ | Branch (60:7): [True: 15.5k, False: 23.2k] ------------------ 61| 15.5k| return (1 << 13); 62| | 63| 51| case Handshake_Type::Finished: ------------------ | Branch (63:7): [True: 51, False: 38.8k] ------------------ 64| 51| return (1 << 14); 65| | 66| 39| case Handshake_Type::EndOfEarlyData: // RFC 8446 ------------------ | Branch (66:7): [True: 39, False: 38.8k] ------------------ 67| 39| return (1 << 15); 68| | 69| 39| case Handshake_Type::EncryptedExtensions: // RFC 8446 ------------------ | Branch (69:7): [True: 39, False: 38.8k] ------------------ 70| 39| return (1 << 16); 71| | 72| 40| case Handshake_Type::KeyUpdate: // RFC 8446 ------------------ | Branch (72:7): [True: 40, False: 38.8k] ------------------ 73| 40| return (1 << 17); 74| | 75| 0| case Handshake_Type::HelloRetryRequest: // RFC 8446 ------------------ | Branch (75:7): [True: 0, False: 38.8k] ------------------ 76| 0| return (1 << 18); 77| | 78| | // allow explicitly disabling new handshakes 79| 0| case Handshake_Type::None: ------------------ | Branch (79:7): [True: 0, False: 38.8k] ------------------ 80| 0| return 0; 81| 38.8k| } 82| | 83| 11| throw TLS_Exception(Alert::UnexpectedMessage, 84| 11| "Unknown TLS handshake message type " + std::to_string(static_cast(type))); 85| 38.8k|} tls_handshake_transitions.cpp:_ZN5Botan3TLS12_GLOBAL__N_124handshake_mask_to_stringEjc: 87| 39|std::string handshake_mask_to_string(uint32_t mask, char combiner) { 88| 39| const Handshake_Type types[] = {Handshake_Type::HelloVerifyRequest, 89| 39| Handshake_Type::HelloRequest, 90| 39| Handshake_Type::ClientHello, 91| 39| Handshake_Type::ServerHello, 92| 39| Handshake_Type::Certificate, 93| 39| Handshake_Type::CertificateUrl, 94| 39| Handshake_Type::CertificateStatus, 95| 39| Handshake_Type::ServerKeyExchange, 96| 39| Handshake_Type::CertificateRequest, 97| 39| Handshake_Type::ServerHelloDone, 98| 39| Handshake_Type::CertificateVerify, 99| 39| Handshake_Type::ClientKeyExchange, 100| 39| Handshake_Type::NewSessionTicket, 101| 39| Handshake_Type::HandshakeCCS, 102| 39| Handshake_Type::Finished, 103| 39| Handshake_Type::EndOfEarlyData, 104| 39| Handshake_Type::EncryptedExtensions, 105| 39| Handshake_Type::KeyUpdate}; 106| | 107| 39| std::ostringstream o; 108| 39| bool empty = true; 109| | 110| 702| for(auto&& t : types) { ------------------ | Branch (110:17): [True: 702, False: 39] ------------------ 111| 702| if((mask & bitmask_for_handshake_type(t)) != 0) { ------------------ | Branch (111:10): [True: 45, False: 657] ------------------ 112| 45| if(!empty) { ------------------ | Branch (112:13): [True: 6, False: 39] ------------------ 113| 6| o << combiner; 114| 6| } 115| 45| o << handshake_type_to_string(t); 116| 45| empty = false; 117| 45| } 118| 702| } 119| | 120| 39| return o.str(); 121| 39|} _ZN5Botan3TLS24handshake_type_to_stringENS0_14Handshake_TypeE: 15| 80|const char* handshake_type_to_string(Handshake_Type type) { 16| 80| switch(type) { ------------------ | Branch (16:11): [True: 80, False: 0] ------------------ 17| 5| case Handshake_Type::HelloVerifyRequest: ------------------ | Branch (17:7): [True: 5, False: 75] ------------------ 18| 5| return "hello_verify_request"; 19| | 20| 18| case Handshake_Type::HelloRequest: ------------------ | Branch (20:7): [True: 18, False: 62] ------------------ 21| 18| return "hello_request"; 22| | 23| 1| case Handshake_Type::ClientHello: ------------------ | Branch (23:7): [True: 1, False: 79] ------------------ 24| 1| return "client_hello"; 25| | 26| 35| case Handshake_Type::ServerHello: ------------------ | Branch (26:7): [True: 35, False: 45] ------------------ 27| 35| return "server_hello"; 28| | 29| 0| case Handshake_Type::HelloRetryRequest: ------------------ | Branch (29:7): [True: 0, False: 80] ------------------ 30| 0| return "hello_retry_request"; 31| | 32| 5| case Handshake_Type::Certificate: ------------------ | Branch (32:7): [True: 5, False: 75] ------------------ 33| 5| return "certificate"; 34| | 35| 2| case Handshake_Type::CertificateUrl: ------------------ | Branch (35:7): [True: 2, False: 78] ------------------ 36| 2| return "certificate_url"; 37| | 38| 1| case Handshake_Type::CertificateStatus: ------------------ | Branch (38:7): [True: 1, False: 79] ------------------ 39| 1| return "certificate_status"; 40| | 41| 4| case Handshake_Type::ServerKeyExchange: ------------------ | Branch (41:7): [True: 4, False: 76] ------------------ 42| 4| return "server_key_exchange"; 43| | 44| 0| case Handshake_Type::CertificateRequest: ------------------ | Branch (44:7): [True: 0, False: 80] ------------------ 45| 0| return "certificate_request"; 46| | 47| 2| case Handshake_Type::ServerHelloDone: ------------------ | Branch (47:7): [True: 2, False: 78] ------------------ 48| 2| return "server_hello_done"; 49| | 50| 1| case Handshake_Type::CertificateVerify: ------------------ | Branch (50:7): [True: 1, False: 79] ------------------ 51| 1| return "certificate_verify"; 52| | 53| 1| case Handshake_Type::ClientKeyExchange: ------------------ | Branch (53:7): [True: 1, False: 79] ------------------ 54| 1| return "client_key_exchange"; 55| | 56| 1| case Handshake_Type::NewSessionTicket: ------------------ | Branch (56:7): [True: 1, False: 79] ------------------ 57| 1| return "new_session_ticket"; 58| | 59| 1| case Handshake_Type::HandshakeCCS: ------------------ | Branch (59:7): [True: 1, False: 79] ------------------ 60| 1| return "change_cipher_spec"; 61| | 62| 2| case Handshake_Type::Finished: ------------------ | Branch (62:7): [True: 2, False: 78] ------------------ 63| 2| return "finished"; 64| | 65| 0| case Handshake_Type::EndOfEarlyData: ------------------ | Branch (65:7): [True: 0, False: 80] ------------------ 66| 0| return "end_of_early_data"; 67| | 68| 0| case Handshake_Type::EncryptedExtensions: ------------------ | Branch (68:7): [True: 0, False: 80] ------------------ 69| 0| return "encrypted_extensions"; 70| | 71| 1| case Handshake_Type::KeyUpdate: ------------------ | Branch (71:7): [True: 1, False: 79] ------------------ 72| 1| return "key_update"; 73| | 74| 0| case Handshake_Type::None: ------------------ | Branch (74:7): [True: 0, False: 80] ------------------ 75| 0| return "invalid"; 76| 80| } 77| | 78| 0| throw TLS_Exception(Alert::UnexpectedMessage, 79| 0| "Unknown TLS handshake message type " + std::to_string(static_cast(type))); 80| 80|} _ZNK5Botan3TLS6Policy22allow_ssl_key_log_fileEv: 25| 56|bool Policy::allow_ssl_key_log_file() const { 26| 56| return false; 27| 56|} _ZNK5Botan3TLS6Policy25allowed_signature_schemesEv: 29| 7.28k|std::vector Policy::allowed_signature_schemes() const { 30| 7.28k| std::vector schemes; 31| | 32| 65.5k| for(const Signature_Scheme scheme : Signature_Scheme::all_available_schemes()) { ------------------ | Branch (32:38): [True: 65.5k, False: 7.28k] ------------------ 33| 65.5k| const bool sig_allowed = allowed_signature_method(scheme.algorithm_name()); 34| 65.5k| const bool hash_allowed = allowed_signature_hash(scheme.hash_function_name()); 35| | 36| 65.5k| if(sig_allowed && hash_allowed) { ------------------ | Branch (36:10): [True: 65.5k, False: 0] | Branch (36:25): [True: 65.5k, False: 0] ------------------ 37| 65.5k| schemes.push_back(scheme); 38| 65.5k| } 39| 65.5k| } 40| | 41| 7.28k| return schemes; 42| 7.28k|} _ZNK5Botan3TLS6Policy28acceptable_signature_schemesEv: 44| 7.28k|std::vector Policy::acceptable_signature_schemes() const { 45| 7.28k| return this->allowed_signature_schemes(); 46| 7.28k|} _ZNK5Botan3TLS6Policy40acceptable_certificate_signature_schemesEv: 48| 7.28k|std::optional> Policy::acceptable_certificate_signature_schemes() const { 49| | // the restrictions of ::acceptable_signature_schemes() shall apply 50| 7.28k| return std::nullopt; 51| 7.28k|} _ZNK5Botan3TLS6Policy24allowed_signature_hashesEv: 73| 65.5k|std::vector Policy::allowed_signature_hashes() const { 74| 65.5k| return { 75| 65.5k| "SHA-512", 76| 65.5k| "SHA-384", 77| 65.5k| "SHA-256", 78| 65.5k| }; 79| 65.5k|} _ZNK5Botan3TLS6Policy25allowed_signature_methodsEv: 105| 65.8k|std::vector Policy::allowed_signature_methods() const { 106| 65.8k| return { 107| 65.8k| "ECDSA", "RSA", 108| | //"IMPLICIT", 109| 65.8k| }; 110| 65.8k|} _ZNK5Botan3TLS6Policy24allowed_signature_methodENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 112| 65.8k|bool Policy::allowed_signature_method(std::string_view sig_method) const { 113| 65.8k| return value_exists(allowed_signature_methods(), sig_method); 114| 65.8k|} _ZNK5Botan3TLS6Policy22allowed_signature_hashENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 116| 65.5k|bool Policy::allowed_signature_hash(std::string_view sig_hash) const { 117| 65.5k| return value_exists(allowed_signature_hashes(), sig_hash); 118| 65.5k|} _ZNK5Botan3TLS6Policy25use_ecc_point_compressionEv: 120| 7.28k|bool Policy::use_ecc_point_compression() const { 121| 7.28k| return false; 122| 7.28k|} _ZNK5Botan3TLS6Policy19key_exchange_groupsEv: 178| 7.28k|std::vector Policy::key_exchange_groups() const { 179| 7.28k| return { 180| | // clang-format off 181| 7.28k|#if defined(BOTAN_HAS_X25519) 182| 7.28k| Group_Params::X25519, 183| 7.28k|#endif 184| | 185| 7.28k| Group_Params::SECP256R1, 186| | 187| 7.28k|#if defined(BOTAN_HAS_ML_KEM) && defined(BOTAN_HAS_TLS_13_PQC) 188| | 189| 7.28k|#if defined(BOTAN_HAS_X25519) 190| 7.28k| Group_Params_Code::HYBRID_X25519_ML_KEM_768, 191| 7.28k|#endif 192| | 193| 7.28k| Group_Params_Code::HYBRID_SECP256R1_ML_KEM_768, 194| 7.28k| Group_Params_Code::HYBRID_SECP384R1_ML_KEM_1024, 195| 7.28k|#endif 196| | 197| 7.28k|#if defined(BOTAN_HAS_X448) 198| 7.28k| Group_Params::X448, 199| 7.28k|#endif 200| | 201| 7.28k| Group_Params::SECP384R1, 202| 7.28k| Group_Params::SECP521R1, 203| | 204| 7.28k| Group_Params::BRAINPOOL256R1, 205| 7.28k| Group_Params::BRAINPOOL384R1, 206| 7.28k| Group_Params::BRAINPOOL512R1, 207| | 208| 7.28k| Group_Params::FFDHE_2048, 209| 7.28k| Group_Params::FFDHE_3072, 210| | 211| | // clang-format on 212| 7.28k| }; 213| 7.28k|} _ZNK5Botan3TLS6Policy21minimum_dh_group_sizeEv: 244| 333|size_t Policy::minimum_dh_group_size() const { 245| 333| return 2048; 246| 333|} _ZNK5Botan3TLS6Policy21maximum_dh_group_sizeEv: 248| 214|size_t Policy::maximum_dh_group_size() const { 249| 214| return 8192; 250| 214|} _ZNK5Botan3TLS6Policy26minimum_signature_strengthEv: 262| 361|size_t Policy::minimum_signature_strength() const { 263| 361| return 110; 264| 361|} _ZNK5Botan3TLS6Policy28require_cert_revocation_infoEv: 266| 361|bool Policy::require_cert_revocation_info() const { 267| 361| return true; 268| 361|} _ZNK5Botan3TLS6Policy16minimum_rsa_bitsEv: 270| 311|size_t Policy::minimum_rsa_bits() const { 271| | /* Default assumption is all end-entity certificates should 272| | be at least 2048 bits these days. 273| | 274| | If you are connecting to arbitrary servers on the Internet 275| | (ie as a web browser or SMTP client) you'll probably have to reduce this 276| | to 1024 bits, or perhaps even lower. 277| | */ 278| 311| return 2048; 279| 311|} _ZNK5Botan3TLS6Policy25check_peer_key_acceptableERKNS_10Public_KeyE: 281| 349|void Policy::check_peer_key_acceptable(const Public_Key& public_key) const { 282| 349| const std::string algo_name = public_key.algo_name(); 283| | 284| 349| const size_t keylength = public_key.key_length(); 285| 349| size_t expected_keylength = 0; 286| | 287| 349| if(algo_name == "RSA") { ------------------ | Branch (287:7): [True: 311, False: 38] ------------------ 288| 311| expected_keylength = minimum_rsa_bits(); 289| 311| } else if(algo_name == "DH") { ------------------ | Branch (289:14): [True: 38, False: 0] ------------------ 290| 38| expected_keylength = minimum_dh_group_size(); 291| 38| } else if(algo_name == "ECDH" || algo_name == "X25519" || algo_name == "X448") { ------------------ | Branch (291:14): [True: 0, False: 0] | Branch (291:37): [True: 0, False: 0] | Branch (291:62): [True: 0, False: 0] ------------------ 292| 0| expected_keylength = minimum_ecdh_group_size(); 293| 0| } else if(algo_name == "ECDSA") { ------------------ | Branch (293:14): [True: 0, False: 0] ------------------ 294| 0| expected_keylength = minimum_ecdsa_group_size(); 295| 0| } 296| | // else some other algo, so leave expected_keylength as zero and the check is a no-op 297| | 298| 349| if(keylength < expected_keylength) { ------------------ | Branch (298:7): [True: 0, False: 349] ------------------ 299| 0| throw TLS_Exception(Alert::InsufficientSecurity, 300| 0| "Peer sent " + std::to_string(keylength) + " bit " + algo_name + 301| 0| " key" 302| 0| ", policy requires at least " + 303| 0| std::to_string(expected_keylength)); 304| 0| } 305| 349|} _ZNK5Botan3TLS6Policy40maximum_session_tickets_per_client_helloEv: 307| 14.5k|size_t Policy::maximum_session_tickets_per_client_hello() const { 308| 14.5k| return 1; 309| 14.5k|} _ZNK5Botan3TLS6Policy23session_ticket_lifetimeEv: 311| 14.5k|std::chrono::seconds Policy::session_ticket_lifetime() const { 312| 14.5k| return std::chrono::days(1); 313| 14.5k|} _ZNK5Botan3TLS6Policy21reuse_session_ticketsEv: 315| 7.28k|bool Policy::reuse_session_tickets() const { 316| 7.28k| return false; 317| 7.28k|} _ZNK5Botan3TLS6Policy27acceptable_protocol_versionENS0_16Protocol_VersionE: 323| 17.7k|bool Policy::acceptable_protocol_version(Protocol_Version version) const { 324| 17.7k|#if defined(BOTAN_HAS_TLS_13) 325| 17.7k| if(version == Protocol_Version::TLS_V13 && allow_tls13()) { ------------------ | Branch (325:7): [True: 0, False: 17.7k] | Branch (325:7): [True: 0, False: 17.7k] | Branch (325:47): [True: 0, False: 0] ------------------ 326| 0| return true; 327| 0| } 328| 17.7k|#endif 329| | 330| 17.7k|#if defined(BOTAN_HAS_TLS_12) 331| 17.7k| if(version == Protocol_Version::TLS_V12 && allow_tls12()) { ------------------ | Branch (331:7): [True: 17.6k, False: 3] | Branch (331:7): [True: 17.6k, False: 3] | Branch (331:47): [True: 17.6k, False: 0] ------------------ 332| 17.6k| return true; 333| 17.6k| } 334| | 335| 3| if(version == Protocol_Version::DTLS_V12 && allow_dtls12()) { ------------------ | Branch (335:7): [True: 0, False: 3] | Branch (335:7): [True: 0, False: 3] | Branch (335:48): [True: 0, False: 0] ------------------ 336| 0| return true; 337| 0| } 338| 3|#endif 339| | 340| 3| BOTAN_UNUSED(version); ------------------ | | 144| 3|#define BOTAN_UNUSED Botan::ignore_params ------------------ 341| 3| return false; 342| 3|} _ZNK5Botan3TLS6Policy11allow_tls12Ev: 378| 32.2k|bool Policy::allow_tls12() const { 379| 32.2k|#if defined(BOTAN_HAS_TLS_12) 380| 32.2k| return true; 381| |#else 382| | return false; 383| |#endif 384| 32.2k|} _ZNK5Botan3TLS6Policy28include_time_in_hello_randomEv: 402| 7.28k|bool Policy::include_time_in_hello_random() const { 403| 7.28k| return true; 404| 7.28k|} _ZNK5Botan3TLS6Policy26negotiate_encrypt_then_macEv: 414| 7.28k|bool Policy::negotiate_encrypt_then_mac() const { 415| 7.28k| return true; 416| 7.28k|} _ZNK5Botan3TLS6Policy30require_extended_master_secretEv: 418| 5.31k|bool Policy::require_extended_master_secret() const { 419| 5.31k| return true; 420| 5.31k|} _ZNK5Botan3TLS6Policy27support_cert_status_messageEv: 426| 7.28k|bool Policy::support_cert_status_message() const { 427| 7.28k| return true; 428| 7.28k|} _ZNK5Botan3TLS6Policy17hash_hello_randomEv: 438| 7.28k|bool Policy::hash_hello_random() const { 439| 7.28k| return true; 440| 7.28k|} _ZNK5Botan3TLS6Policy30maximum_handshake_message_sizeEv: 470| 15.5k|size_t Policy::maximum_handshake_message_size() const { 471| 15.5k| return 65536; 472| 15.5k|} _ZNK5Botan3TLS6Policy30maximum_certificate_chain_sizeEv: 474| 3.09k|size_t Policy::maximum_certificate_chain_size() const { 475| 3.09k| return 65536; 476| 3.09k|} _ZNK5Botan3TLS15TLS_Data_Reader15assert_at_leastEm: 14| 140k|void TLS_Data_Reader::assert_at_least(size_t n) const { 15| 140k| const size_t left = remaining_bytes(); 16| 140k| if(left < n) { ------------------ | Branch (16:7): [True: 114, False: 140k] ------------------ 17| 114| throw_decode_error(fmt("Expected {} bytes remaining, only {} left", n, left)); 18| 114| } 19| 140k|} _ZNK5Botan3TLS15TLS_Data_Reader18throw_decode_errorENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 21| 161|void TLS_Data_Reader::throw_decode_error(std::string_view why) const { 22| 161| throw Decoding_Error(fmt("Invalid {}: {}", m_typename, why)); 23| 161|} _ZNK5Botan3TLS14Session_Handle20validate_constraintsEv: 34| 2|void Session_Handle::validate_constraints() const { 35| 2| std::visit(overloaded{ 36| 2| [](const Session_ID& id) { 37| | // RFC 5246 7.4.1.2 38| | // opaque SessionID<0..32>; 39| 2| BOTAN_ARG_CHECK(!id.empty(), "Session ID must not be empty"); 40| 2| BOTAN_ARG_CHECK(id.size() <= 32, "Session ID cannot be longer than 32 bytes"); 41| 2| }, 42| 2| [](const Session_Ticket& ticket) { 43| 2| BOTAN_ARG_CHECK(!ticket.empty(), "Ticket most not be empty"); 44| 2| BOTAN_ARG_CHECK(ticket.size() <= std::numeric_limits::max(), 45| 2| "Ticket cannot be longer than 64kB"); 46| 2| }, 47| 2| [](const Opaque_Session_Handle& handle) { 48| | // RFC 8446 4.6.1 49| | // opaque ticket<1..2^16-1>; 50| 2| BOTAN_ARG_CHECK(!handle.empty(), "Opaque session handle must not be empty"); 51| 2| BOTAN_ARG_CHECK(handle.size() <= std::numeric_limits::max(), 52| 2| "Opaque session handle cannot be longer than 64kB"); 53| 2| }, 54| 2| }, 55| 2| m_handle); 56| 2|} _ZN5Botan3TLS12Session_BaseD2Ev: 94| 4|Session_Base::~Session_Base() = default; _ZN5Botan3TLS12Session_BaseC2ERKS1_: 96| 2|Session_Base::Session_Base(const Session_Base& other) = default; _ZN5Botan3TLS12Session_BaseC2ENSt3__16chrono10time_pointINS3_12system_clockENS3_8durationIxNS2_5ratioILl1ELl1000000EEEEEEENS0_16Protocol_VersionEtNS0_15Connection_SideEtbbRKNS2_6vectorINS_16X509_CertificateENS2_9allocatorISE_EEEENS2_10shared_ptrIKNS_10Public_KeyEEENS0_18Server_InformationE: 112| 2| m_start_time(start_time), 113| 2| m_version(version), 114| 2| m_ciphersuite(ciphersuite), 115| 2| m_connection_side(connection_side), 116| 2| m_srtp_profile(srtp_profile), 117| 2| m_extended_master_secret(extended_master_secret), 118| 2| m_encrypt_then_mac(encrypt_then_mac), 119| 2| m_peer_certs(peer_certs), 120| 2| m_peer_raw_public_key(std::move(peer_raw_public_key)), 121| 2| m_server_info(std::move(server_info)) {} _ZNK5Botan3TLS12Session_Base11ciphersuiteEv: 123| 2|Ciphersuite Session_Base::ciphersuite() const { 124| 2| auto suite = Ciphersuite::by_id(m_ciphersuite); 125| 2| if(!suite.has_value()) { ------------------ | Branch (125:7): [True: 0, False: 2] ------------------ 126| 0| throw Decoding_Error("Failed to find cipher suite for ID " + std::to_string(m_ciphersuite)); 127| 0| } 128| 2| return suite.value(); 129| 2|} _ZN5Botan3TLS15Session_SummaryC2ERKNS0_12Session_BaseEbNSt3__18optionalINS5_12basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEEEE: 134| 2| Session_Base(base), m_external_psk_identity(std::move(psk_identity)), m_was_resumption(was_resumption) { 135| 2| BOTAN_ARG_CHECK(version().is_pre_tls_13(), "Instantiated a TLS 1.2 session summary with an newer TLS version"); ------------------ | | 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] | | ------------------ ------------------ 136| | 137| 2| const auto cs = ciphersuite(); 138| 2| m_kex_algo = cs.kex_algo(); 139| 2|} _ZN5Botan3TLS7SessionC2ERKNSt3__16vectorIhNS_16secure_allocatorIhEEEENS0_16Protocol_VersionEtNS0_15Connection_SideEbbRKNS3_INS_16X509_CertificateENS2_9allocatorISB_EEEERKNS0_18Server_InformationEtNS2_6chrono10time_pointINSK_12system_clockENSK_8durationIxNS2_5ratioILl1ELl1000000EEEEEEENSN_IxNSO_ILl1ELl1EEEEE: 250| 2| Session_Base(current_timestamp, 251| 2| version, 252| 2| ciphersuite, 253| 2| side, 254| 2| srtp_profile, 255| 2| extended_master_secret, 256| 2| encrypt_then_mac, 257| 2| certs, 258| 2| nullptr, // RFC 7250 (raw public keys) is NYI for TLS 1.2 259| 2| server_info), 260| 2| m_master_secret(master_secret), 261| 2| m_early_data_allowed(false), 262| 2| m_max_early_data_bytes(0), 263| 2| m_ticket_age_add(0), 264| 2| m_lifetime_hint(lifetime_hint) { 265| 2| BOTAN_ARG_CHECK(version.is_pre_tls_13(), "Instantiated a TLS 1.2 session object with a TLS version newer than 1.2"); ------------------ | | 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] | | ------------------ ------------------ 266| 2|} tls_session.cpp:_ZZNK5Botan3TLS14Session_Handle20validate_constraintsEvENK3$_1clERKNS_6StrongINSt3__16vectorIhNS4_9allocatorIhEEEENS0_15Session_Ticket_EJEEE: 42| 2| [](const Session_Ticket& ticket) { 43| 2| BOTAN_ARG_CHECK(!ticket.empty(), "Ticket most not be empty"); ------------------ | | 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] | | ------------------ ------------------ 44| 2| BOTAN_ARG_CHECK(ticket.size() <= std::numeric_limits::max(), ------------------ | | 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] | | ------------------ ------------------ 45| 2| "Ticket cannot be longer than 64kB"); 46| 2| }, _ZN5Botan3TLS15Session_ManagerC2ERKNSt3__110shared_ptrINS_21RandomNumberGeneratorEEE: 24| 7.28k|Session_Manager::Session_Manager(const std::shared_ptr& rng) : m_rng(rng) { 25| 7.28k| BOTAN_ASSERT_NONNULL(m_rng); ------------------ | | 116| 7.28k| do { \ | | 117| 7.28k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 7.28k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 7.28k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 7.28k] | | ------------------ ------------------ 26| 7.28k|} _ZN5Botan3TLS15Session_Manager15find_and_filterERKNS0_18Server_InformationERNS0_9CallbacksERKNS0_6PolicyE: 91| 7.28k| const Policy& policy) { 92| | // A value of '0' means: No policy restrictions. Session ticket lifetimes as 93| | // communicated by the server apply regardless. 94| 7.28k| const std::chrono::seconds policy_lifetime = 95| 7.28k| (policy.session_ticket_lifetime().count() > 0) ? policy.session_ticket_lifetime() : std::chrono::seconds::max(); ------------------ | Branch (95:7): [True: 7.28k, False: 0] ------------------ 96| | 97| 7.28k| const size_t max_sessions_hint = std::max(policy.maximum_session_tickets_per_client_hello(), size_t(1)); 98| 7.28k| const auto now = callbacks.tls_current_timestamp(); 99| | 100| | // An arbitrary number of loop iterations to perform before giving up 101| | // to avoid a potential endless loop with a misbehaving session manager. 102| 7.28k| constexpr unsigned int max_attempts = 10; 103| 7.28k| std::vector sessions_and_handles; 104| | 105| | // Query the session manager implementation for new sessions until at least 106| | // one session passes the filter or no more sessions are found. 107| 7.28k| for(unsigned int attempt = 0; attempt < max_attempts && sessions_and_handles.empty(); ++attempt) { ------------------ | Branch (107:34): [True: 7.28k, False: 0] | Branch (107:60): [True: 7.28k, False: 0] ------------------ 108| 7.28k| sessions_and_handles = find_some(info, max_sessions_hint); 109| | 110| | // ... underlying implementation didn't find anything. Early exit. 111| 7.28k| if(sessions_and_handles.empty()) { ------------------ | Branch (111:10): [True: 7.28k, False: 0] ------------------ 112| 7.28k| break; 113| 7.28k| } 114| | 115| 0| std::erase_if(sessions_and_handles, [&](const auto& session) { 116| 0| const auto age = std::chrono::duration_cast(now - session.session.start_time()); 117| | 118| | // RFC 5077 3.3 -- "Old Session Tickets" 119| | // The ticket_lifetime_hint field contains a hint from the 120| | // server about how long the ticket should be stored. [...] 121| | // A client SHOULD delete the ticket and associated state when 122| | // the time expires. It MAY delete the ticket earlier based on 123| | // local policy. 124| | // 125| | // A value [in ticket_lifetime_hint] of zero is reserved to indicate 126| | // that the lifetime of the ticket is unspecified. 127| | // 128| | // RFC 5246 F.1.4 -- TLS 1.2 129| | // If either party suspects that the session may have been 130| | // compromised, or that certificates may have expired or been 131| | // revoked, it should force a full handshake. An upper limit of 132| | // 24 hours is suggested for session ID lifetimes. 133| | // 134| | // RFC 8446 4.2.11.1 -- TLS 1.3 135| | // The client's view of the age of a ticket is the time since the 136| | // receipt of the NewSessionTicket message. Clients MUST NOT 137| | // attempt to use tickets which have ages greater than the 138| | // "ticket_lifetime" value which was provided with the ticket. 139| | // 140| | // RFC 8446 4.6.1 -- TLS 1.3 141| | // Clients MUST NOT cache tickets for longer than 7 days, 142| | // regardless of the ticket_lifetime, and MAY delete tickets 143| | // earlier based on local policy. 144| | // 145| | // Note: TLS 1.3 tickets with a lifetime longer than 7 days are 146| | // rejected during parsing with an "Illegal Parameter" alert. 147| | // Other suggestions are left to the application via 148| | // Policy::session_ticket_lifetime(). Session lifetimes as 149| | // communicated by the server via the "lifetime_hint" are 150| | // obeyed regardless of the policy setting. 151| 0| const auto session_lifetime_hint = session.session.lifetime_hint(); 152| | 153| 0| const bool is_rfc5077_unspecified = 154| 0| (session_lifetime_hint.count() == 0 && session.session.version().is_pre_tls_13()); 155| 0| const auto effective_hint = is_rfc5077_unspecified ? std::chrono::seconds::max() : session_lifetime_hint; 156| 0| const bool expired = age > std::min(policy_lifetime, effective_hint); 157| | 158| 0| if(expired) { 159| 0| remove(session.handle); 160| 0| } 161| | 162| 0| return expired; 163| 0| }); 164| 0| } 165| | 166| 7.28k| return sessions_and_handles; 167| 7.28k|} _ZN5Botan3TLS15Session_Manager4findERKNS0_18Server_InformationERNS0_9CallbacksERKNS0_6PolicyE: 171| 7.28k| const Policy& policy) { 172| 7.28k| auto allow_reusing_tickets = policy.reuse_session_tickets(); 173| | 174| | // Session_Manager::find() must be an atomic getter if ticket reuse is not 175| | // allowed. I.e. each ticket handed to concurrently requesting threads must 176| | // be unique. In that case we must hold a lock while retrieving a ticket. 177| | // Otherwise, no locking is required on this level. 178| 7.28k| std::optional> lk; 179| 7.28k| if(!allow_reusing_tickets) { ------------------ | Branch (179:7): [True: 7.28k, False: 0] ------------------ 180| 7.28k| lk.emplace(mutex()); 181| 7.28k| } 182| | 183| 7.28k| auto sessions_and_handles = find_and_filter(info, callbacks, policy); 184| | 185| | // std::vector::resize() cannot be used as the vector's members aren't 186| | // default constructible. 187| 7.28k| const auto session_limit = policy.maximum_session_tickets_per_client_hello(); 188| 7.28k| while(session_limit > 0 && sessions_and_handles.size() > session_limit) { ------------------ | Branch (188:10): [True: 7.28k, False: 0] | Branch (188:31): [True: 0, False: 7.28k] ------------------ 189| 0| sessions_and_handles.pop_back(); 190| 0| } 191| | 192| | // RFC 8446 Appendix C.4 193| | // Clients SHOULD NOT reuse a ticket for multiple connections. Reuse of 194| | // a ticket allows passive observers to correlate different connections. 195| | // 196| | // When reuse of session tickets is not allowed, remove all tickets to be 197| | // returned from the implementation's internal storage. 198| 7.28k| if(!allow_reusing_tickets) { ------------------ | Branch (198:7): [True: 7.28k, False: 0] ------------------ 199| | // The lock must be held here, otherwise we cannot guarantee the 200| | // transactional retrieval of tickets to concurrently requesting clients. 201| 7.28k| BOTAN_ASSERT_NOMSG(lk.has_value()); ------------------ | | 77| 7.28k| do { \ | | 78| 7.28k| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 7.28k| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 7.28k] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 7.28k| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 7.28k] | | ------------------ ------------------ 202| 7.28k| for(const auto& [session, handle] : sessions_and_handles) { ------------------ | Branch (202:41): [True: 0, False: 7.28k] ------------------ 203| 0| if(!session.version().is_pre_tls_13() || !handle.is_id()) { ------------------ | Branch (203:13): [True: 0, False: 0] | Branch (203:13): [True: 0, False: 0] | Branch (203:51): [True: 0, False: 0] ------------------ 204| 0| remove(handle); 205| 0| } 206| 0| } 207| 7.28k| } 208| | 209| 7.28k| return sessions_and_handles; 210| 7.28k|} _ZN5Botan3TLS20Session_Manager_NoopC2Ev: 16| 7.28k|Session_Manager_Noop::Session_Manager_Noop() : Session_Manager(std::make_shared()) {} _ZN5Botan3TLS20Session_Manager_Noop9find_someERKNS0_18Server_InformationEm: 29| 7.28k| size_t /*max_sessions_hint*/) { 30| 7.28k| return {}; 31| 7.28k|} _ZN5Botan3TLS16Signature_Scheme21all_available_schemesEv: 17| 7.90k|const std::vector& Signature_Scheme::all_available_schemes() { 18| | /* 19| | * This is ordered in some approximate order of preference 20| | */ 21| 7.90k| static const std::vector all_schemes = { 22| | 23| | // EdDSA 25519 is currently not supported as a signature scheme for certificates 24| | // certificate authentication. 25| | // See: https://github.com/randombit/botan/pull/2958#discussion_r851294715 26| | // 27| | // #if defined(BOTAN_HAS_ED25519) 28| | // EDDSA_25519, 29| | // #endif 30| | 31| 7.90k| RSA_PSS_SHA384, 32| 7.90k| RSA_PSS_SHA256, 33| 7.90k| RSA_PSS_SHA512, 34| | 35| 7.90k| RSA_PKCS1_SHA384, 36| 7.90k| RSA_PKCS1_SHA512, 37| 7.90k| RSA_PKCS1_SHA256, 38| | 39| 7.90k| ECDSA_SHA384, 40| 7.90k| ECDSA_SHA512, 41| 7.90k| ECDSA_SHA256, 42| 7.90k| }; 43| | 44| 7.90k| return all_schemes; 45| 7.90k|} _ZN5Botan3TLS16Signature_SchemeC2Ev: 47| 322|Signature_Scheme::Signature_Scheme() : m_code(NONE) {} _ZN5Botan3TLS16Signature_SchemeC2Et: 49| 791|Signature_Scheme::Signature_Scheme(uint16_t wire_code) : Signature_Scheme(Signature_Scheme::Code(wire_code)) {} _ZN5Botan3TLS16Signature_SchemeC2ENS1_4CodeE: 51| 800|Signature_Scheme::Signature_Scheme(Signature_Scheme::Code wire_code) : m_code(wire_code) {} _ZNK5Botan3TLS16Signature_Scheme12is_availableEv: 53| 621|bool Signature_Scheme::is_available() const noexcept { 54| 621| return value_exists(Signature_Scheme::all_available_schemes(), *this); 55| 621|} _ZNK5Botan3TLS16Signature_Scheme18hash_function_nameEv: 98| 65.8k|std::string Signature_Scheme::hash_function_name() const noexcept { 99| 65.8k| switch(m_code) { 100| 0| case RSA_PKCS1_SHA1: ------------------ | Branch (100:7): [True: 0, False: 65.8k] ------------------ 101| 0| case ECDSA_SHA1: ------------------ | Branch (101:7): [True: 0, False: 65.8k] ------------------ 102| 0| return "SHA-1"; 103| | 104| 7.28k| case ECDSA_SHA256: ------------------ | Branch (104:7): [True: 7.28k, False: 58.6k] ------------------ 105| 14.5k| case RSA_PKCS1_SHA256: ------------------ | Branch (105:7): [True: 7.29k, False: 58.6k] ------------------ 106| 21.8k| case RSA_PSS_SHA256: ------------------ | Branch (106:7): [True: 7.29k, False: 58.6k] ------------------ 107| 21.8k| return "SHA-256"; 108| | 109| 7.28k| case ECDSA_SHA384: ------------------ | Branch (109:7): [True: 7.28k, False: 58.6k] ------------------ 110| 14.5k| case RSA_PKCS1_SHA384: ------------------ | Branch (110:7): [True: 7.28k, False: 58.6k] ------------------ 111| 21.8k| case RSA_PSS_SHA384: ------------------ | Branch (111:7): [True: 7.29k, False: 58.6k] ------------------ 112| 21.8k| return "SHA-384"; 113| | 114| 7.28k| case ECDSA_SHA512: ------------------ | Branch (114:7): [True: 7.28k, False: 58.6k] ------------------ 115| 14.8k| case RSA_PKCS1_SHA512: ------------------ | Branch (115:7): [True: 7.57k, False: 58.3k] ------------------ 116| 22.1k| case RSA_PSS_SHA512: ------------------ | Branch (116:7): [True: 7.29k, False: 58.6k] ------------------ 117| 22.1k| return "SHA-512"; 118| | 119| 0| case EDDSA_25519: ------------------ | Branch (119:7): [True: 0, False: 65.8k] ------------------ 120| 0| case EDDSA_448: ------------------ | Branch (120:7): [True: 0, False: 65.8k] ------------------ 121| 0| return "Pure"; 122| | 123| 0| default: ------------------ | Branch (123:7): [True: 0, False: 65.8k] ------------------ 124| 0| return "Unknown hash function"; 125| 65.8k| } 126| 65.8k|} _ZNK5Botan3TLS16Signature_Scheme14padding_stringEv: 128| 310|std::string Signature_Scheme::padding_string() const noexcept { 129| 310| switch(m_code) { 130| 0| case RSA_PKCS1_SHA1: ------------------ | Branch (130:7): [True: 0, False: 310] ------------------ 131| 0| return "PKCS1v15(SHA-1)"; 132| 4| case RSA_PKCS1_SHA256: ------------------ | Branch (132:7): [True: 4, False: 306] ------------------ 133| 4| return "PKCS1v15(SHA-256)"; 134| 2| case RSA_PKCS1_SHA384: ------------------ | Branch (134:7): [True: 2, False: 308] ------------------ 135| 2| return "PKCS1v15(SHA-384)"; 136| 290| case RSA_PKCS1_SHA512: ------------------ | Branch (136:7): [True: 290, False: 20] ------------------ 137| 290| return "PKCS1v15(SHA-512)"; 138| | 139| 0| case ECDSA_SHA1: ------------------ | Branch (139:7): [True: 0, False: 310] ------------------ 140| 0| return "SHA-1"; 141| 0| case ECDSA_SHA256: ------------------ | Branch (141:7): [True: 0, False: 310] ------------------ 142| 0| return "SHA-256"; 143| 0| case ECDSA_SHA384: ------------------ | Branch (143:7): [True: 0, False: 310] ------------------ 144| 0| return "SHA-384"; 145| 0| case ECDSA_SHA512: ------------------ | Branch (145:7): [True: 0, False: 310] ------------------ 146| 0| return "SHA-512"; 147| | 148| 6| case RSA_PSS_SHA256: ------------------ | Branch (148:7): [True: 6, False: 304] ------------------ 149| 6| return "PSS(SHA-256,MGF1,32)"; 150| 5| case RSA_PSS_SHA384: ------------------ | Branch (150:7): [True: 5, False: 305] ------------------ 151| 5| return "PSS(SHA-384,MGF1,48)"; 152| 3| case RSA_PSS_SHA512: ------------------ | Branch (152:7): [True: 3, False: 307] ------------------ 153| 3| return "PSS(SHA-512,MGF1,64)"; 154| | 155| 0| case EDDSA_25519: ------------------ | Branch (155:7): [True: 0, False: 310] ------------------ 156| 0| case EDDSA_448: ------------------ | Branch (156:7): [True: 0, False: 310] ------------------ 157| 0| return "Pure"; 158| | 159| 0| default: ------------------ | Branch (159:7): [True: 0, False: 310] ------------------ 160| 0| return "Unknown padding"; 161| 310| } 162| 310|} _ZNK5Botan3TLS16Signature_Scheme14algorithm_nameEv: 164| 65.8k|std::string Signature_Scheme::algorithm_name() const noexcept { 165| 65.8k| switch(m_code) { 166| 0| case RSA_PKCS1_SHA1: ------------------ | Branch (166:7): [True: 0, False: 65.8k] ------------------ 167| 7.29k| case RSA_PKCS1_SHA256: ------------------ | Branch (167:7): [True: 7.29k, False: 58.6k] ------------------ 168| 14.5k| case RSA_PKCS1_SHA384: ------------------ | Branch (168:7): [True: 7.28k, False: 58.6k] ------------------ 169| 22.1k| case RSA_PKCS1_SHA512: ------------------ | Branch (169:7): [True: 7.57k, False: 58.3k] ------------------ 170| 29.4k| case RSA_PSS_SHA256: ------------------ | Branch (170:7): [True: 7.29k, False: 58.6k] ------------------ 171| 36.7k| case RSA_PSS_SHA384: ------------------ | Branch (171:7): [True: 7.29k, False: 58.6k] ------------------ 172| 44.0k| case RSA_PSS_SHA512: ------------------ | Branch (172:7): [True: 7.29k, False: 58.6k] ------------------ 173| 44.0k| return "RSA"; 174| | 175| 0| case ECDSA_SHA1: ------------------ | Branch (175:7): [True: 0, False: 65.8k] ------------------ 176| 7.28k| case ECDSA_SHA256: ------------------ | Branch (176:7): [True: 7.28k, False: 58.6k] ------------------ 177| 14.5k| case ECDSA_SHA384: ------------------ | Branch (177:7): [True: 7.28k, False: 58.6k] ------------------ 178| 21.8k| case ECDSA_SHA512: ------------------ | Branch (178:7): [True: 7.28k, False: 58.6k] ------------------ 179| 21.8k| return "ECDSA"; 180| | 181| 0| case EDDSA_25519: ------------------ | Branch (181:7): [True: 0, False: 65.8k] ------------------ 182| 0| return "Ed25519"; 183| | 184| 0| case EDDSA_448: ------------------ | Branch (184:7): [True: 0, False: 65.8k] ------------------ 185| 0| return "Ed448"; 186| | 187| 0| default: ------------------ | Branch (187:7): [True: 0, False: 65.8k] ------------------ 188| 0| return "Unknown algorithm"; 189| 65.8k| } 190| 65.8k|} _ZNK5Botan3TLS16Signature_Scheme6formatEv: 263| 620|std::optional Signature_Scheme::format() const noexcept { 264| 620| switch(m_code) { 265| 0| case RSA_PKCS1_SHA1: ------------------ | Branch (265:7): [True: 0, False: 620] ------------------ 266| 8| case RSA_PKCS1_SHA256: ------------------ | Branch (266:7): [True: 8, False: 612] ------------------ 267| 12| case RSA_PKCS1_SHA384: ------------------ | Branch (267:7): [True: 4, False: 616] ------------------ 268| 592| case RSA_PKCS1_SHA512: ------------------ | Branch (268:7): [True: 580, False: 40] ------------------ 269| 604| case RSA_PSS_SHA256: ------------------ | Branch (269:7): [True: 12, False: 608] ------------------ 270| 614| case RSA_PSS_SHA384: ------------------ | Branch (270:7): [True: 10, False: 610] ------------------ 271| 620| case RSA_PSS_SHA512: ------------------ | Branch (271:7): [True: 6, False: 614] ------------------ 272| 620| case EDDSA_25519: ------------------ | Branch (272:7): [True: 0, False: 620] ------------------ 273| 620| case EDDSA_448: ------------------ | Branch (273:7): [True: 0, False: 620] ------------------ 274| 620| return Signature_Format::Standard; 275| | 276| 0| case ECDSA_SHA1: ------------------ | Branch (276:7): [True: 0, False: 620] ------------------ 277| 0| case ECDSA_SHA256: ------------------ | Branch (277:7): [True: 0, False: 620] ------------------ 278| 0| case ECDSA_SHA384: ------------------ | Branch (278:7): [True: 0, False: 620] ------------------ 279| 0| case ECDSA_SHA512: ------------------ | Branch (279:7): [True: 0, False: 620] ------------------ 280| 0| return Signature_Format::DerSequence; 281| | 282| 0| default: ------------------ | Branch (282:7): [True: 0, False: 620] ------------------ 283| 0| return std::nullopt; 284| 620| } 285| 620|} _ZNK5Botan3TLS16Signature_Scheme18is_compatible_withERKNS0_16Protocol_VersionE: 287| 310|bool Signature_Scheme::is_compatible_with(const Protocol_Version& protocol_version) const noexcept { 288| | // RFC 8446 4.4.3: 289| | // The SHA-1 algorithm MUST NOT be used in any signatures of 290| | // CertificateVerify messages. 291| | // 292| | // Note that Botan enforces that for TLS 1.2 as well. 293| 310| if(hash_function_name() == "SHA-1") { ------------------ | Branch (293:7): [True: 0, False: 310] ------------------ 294| 0| return false; 295| 0| } 296| | 297| | // RFC 8446 4.4.3: 298| | // RSA signatures MUST use an RSASSA-PSS algorithm, regardless of whether 299| | // RSASSA-PKCS1-v1_5 algorithms appear in "signature_algorithms". 300| | // 301| | // Note that this is enforced for TLS 1.3 and above only. 302| 310| if(!protocol_version.is_pre_tls_13() && (m_code == RSA_PKCS1_SHA1 || m_code == RSA_PKCS1_SHA256 || ------------------ | Branch (302:7): [True: 0, False: 310] | Branch (302:45): [True: 0, False: 0] | Branch (302:73): [True: 0, False: 0] ------------------ 303| 0| m_code == RSA_PKCS1_SHA384 || m_code == RSA_PKCS1_SHA512)) { ------------------ | Branch (303:45): [True: 0, False: 0] | Branch (303:75): [True: 0, False: 0] ------------------ 304| 0| return false; 305| 0| } 306| | 307| 310| return true; 308| 310|} _ZN5Botan3TLS11Ciphersuite15is_known_usableEt: 338| 102|bool Ciphersuite::is_known_usable(uint16_t code) { 339| 102| static constexpr auto codes = available_ciphersuites(); 340| 102| return std::binary_search(codes.begin(), codes.end(), code); 341| 102|} _ZN5Botan3TLS11Ciphersuite22all_known_ciphersuitesEv: 344| 18.2k|const std::vector& Ciphersuite::all_known_ciphersuites() { 345| | // clang-format off 346| | 347| | // Note that this list of ciphersuites is ordered by id! 348| 18.2k| static const std::vector g_ciphersuite_list = { 349| 18.2k| Ciphersuite(0x000A, "RSA_WITH_3DES_EDE_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 350| 18.2k| Ciphersuite(0x0016, "DHE_RSA_WITH_3DES_EDE_CBC_SHA", Auth_Method::RSA, Kex_Algo::DH, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 351| 18.2k| Ciphersuite(0x002C, "PSK_WITH_NULL_SHA", Auth_Method::IMPLICIT, Kex_Algo::PSK, "NULL", 0, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::NULL_CIPHER), 352| 18.2k| Ciphersuite(0x002F, "RSA_WITH_AES_128_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 353| 18.2k| Ciphersuite(0x0033, "DHE_RSA_WITH_AES_128_CBC_SHA", Auth_Method::RSA, Kex_Algo::DH, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 354| 18.2k| Ciphersuite(0x0035, "RSA_WITH_AES_256_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 355| 18.2k| Ciphersuite(0x0039, "DHE_RSA_WITH_AES_256_CBC_SHA", Auth_Method::RSA, Kex_Algo::DH, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 356| 18.2k| Ciphersuite(0x003C, "RSA_WITH_AES_128_CBC_SHA256", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 357| 18.2k| Ciphersuite(0x003D, "RSA_WITH_AES_256_CBC_SHA256", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-256", 32, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 358| 18.2k| Ciphersuite(0x0067, "DHE_RSA_WITH_AES_128_CBC_SHA256", Auth_Method::RSA, Kex_Algo::DH, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 359| 18.2k| Ciphersuite(0x006B, "DHE_RSA_WITH_AES_256_CBC_SHA256", Auth_Method::RSA, Kex_Algo::DH, "AES-256", 32, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 360| 18.2k| Ciphersuite(0x008B, "PSK_WITH_3DES_EDE_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::PSK, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 361| 18.2k| Ciphersuite(0x008C, "PSK_WITH_AES_128_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 362| 18.2k| Ciphersuite(0x008D, "PSK_WITH_AES_256_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 363| 18.2k| Ciphersuite(0x009C, "RSA_WITH_AES_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 364| 18.2k| Ciphersuite(0x009D, "RSA_WITH_AES_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 365| 18.2k| Ciphersuite(0x009E, "DHE_RSA_WITH_AES_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::DH, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 366| 18.2k| Ciphersuite(0x009F, "DHE_RSA_WITH_AES_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::DH, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 367| 18.2k| Ciphersuite(0x00A8, "PSK_WITH_AES_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 368| 18.2k| Ciphersuite(0x00A9, "PSK_WITH_AES_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 369| 18.2k| Ciphersuite(0x00AE, "PSK_WITH_AES_128_CBC_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 370| 18.2k| Ciphersuite(0x00AF, "PSK_WITH_AES_256_CBC_SHA384", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256", 32, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::CBC_MODE), 371| 18.2k| Ciphersuite(0x00B0, "PSK_WITH_NULL_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "NULL", 0, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::NULL_CIPHER), 372| 18.2k| Ciphersuite(0x00B1, "PSK_WITH_NULL_SHA384", Auth_Method::IMPLICIT, Kex_Algo::PSK, "NULL", 0, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::NULL_CIPHER), 373| 18.2k| Ciphersuite(0x1301, "AES_128_GCM_SHA256", Auth_Method::UNDEFINED, Kex_Algo::UNDEFINED, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 374| 18.2k| Ciphersuite(0x1302, "AES_256_GCM_SHA384", Auth_Method::UNDEFINED, Kex_Algo::UNDEFINED, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 375| 18.2k| Ciphersuite(0x1303, "CHACHA20_POLY1305_SHA256", Auth_Method::UNDEFINED, Kex_Algo::UNDEFINED, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 376| 18.2k| Ciphersuite(0x1304, "AES_128_CCM_SHA256", Auth_Method::UNDEFINED, Kex_Algo::UNDEFINED, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 377| 18.2k| Ciphersuite(0x1305, "AES_128_CCM_8_SHA256", Auth_Method::UNDEFINED, Kex_Algo::UNDEFINED, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 378| 18.2k| Ciphersuite(0xC006, "ECDHE_ECDSA_WITH_NULL_SHA", Auth_Method::ECDSA, Kex_Algo::ECDH, "NULL", 0, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::NULL_CIPHER), 379| 18.2k| Ciphersuite(0xC008, "ECDHE_ECDSA_WITH_3DES_EDE_CBC_SHA", Auth_Method::ECDSA, Kex_Algo::ECDH, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 380| 18.2k| Ciphersuite(0xC009, "ECDHE_ECDSA_WITH_AES_128_CBC_SHA", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 381| 18.2k| Ciphersuite(0xC00A, "ECDHE_ECDSA_WITH_AES_256_CBC_SHA", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 382| 18.2k| Ciphersuite(0xC010, "ECDHE_RSA_WITH_NULL_SHA", Auth_Method::RSA, Kex_Algo::ECDH, "NULL", 0, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::NULL_CIPHER), 383| 18.2k| Ciphersuite(0xC012, "ECDHE_RSA_WITH_3DES_EDE_CBC_SHA", Auth_Method::RSA, Kex_Algo::ECDH, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 384| 18.2k| Ciphersuite(0xC013, "ECDHE_RSA_WITH_AES_128_CBC_SHA", Auth_Method::RSA, Kex_Algo::ECDH, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 385| 18.2k| Ciphersuite(0xC014, "ECDHE_RSA_WITH_AES_256_CBC_SHA", Auth_Method::RSA, Kex_Algo::ECDH, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 386| 18.2k| Ciphersuite(0xC023, "ECDHE_ECDSA_WITH_AES_128_CBC_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 387| 18.2k| Ciphersuite(0xC024, "ECDHE_ECDSA_WITH_AES_256_CBC_SHA384", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256", 32, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::CBC_MODE), 388| 18.2k| Ciphersuite(0xC027, "ECDHE_RSA_WITH_AES_128_CBC_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 389| 18.2k| Ciphersuite(0xC028, "ECDHE_RSA_WITH_AES_256_CBC_SHA384", Auth_Method::RSA, Kex_Algo::ECDH, "AES-256", 32, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::CBC_MODE), 390| 18.2k| Ciphersuite(0xC02B, "ECDHE_ECDSA_WITH_AES_128_GCM_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 391| 18.2k| Ciphersuite(0xC02C, "ECDHE_ECDSA_WITH_AES_256_GCM_SHA384", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 392| 18.2k| Ciphersuite(0xC02F, "ECDHE_RSA_WITH_AES_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 393| 18.2k| Ciphersuite(0xC030, "ECDHE_RSA_WITH_AES_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::ECDH, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 394| 18.2k| Ciphersuite(0xC034, "ECDHE_PSK_WITH_3DES_EDE_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "3DES", 24, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 395| 18.2k| Ciphersuite(0xC035, "ECDHE_PSK_WITH_AES_128_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-128", 16, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 396| 18.2k| Ciphersuite(0xC036, "ECDHE_PSK_WITH_AES_256_CBC_SHA", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-256", 32, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::CBC_MODE), 397| 18.2k| Ciphersuite(0xC037, "ECDHE_PSK_WITH_AES_128_CBC_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-128", 16, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::CBC_MODE), 398| 18.2k| Ciphersuite(0xC038, "ECDHE_PSK_WITH_AES_256_CBC_SHA384", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-256", 32, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::CBC_MODE), 399| 18.2k| Ciphersuite(0xC039, "ECDHE_PSK_WITH_NULL_SHA", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "NULL", 0, "SHA-1", 20, KDF_Algo::SHA_1, Nonce_Format::NULL_CIPHER), 400| 18.2k| Ciphersuite(0xC03A, "ECDHE_PSK_WITH_NULL_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "NULL", 0, "SHA-256", 32, KDF_Algo::SHA_256, Nonce_Format::NULL_CIPHER), 401| 18.2k| Ciphersuite(0xC03B, "ECDHE_PSK_WITH_NULL_SHA384", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "NULL", 0, "SHA-384", 48, KDF_Algo::SHA_384, Nonce_Format::NULL_CIPHER), 402| 18.2k| Ciphersuite(0xC050, "RSA_WITH_ARIA_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "ARIA-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 403| 18.2k| Ciphersuite(0xC051, "RSA_WITH_ARIA_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "ARIA-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 404| 18.2k| Ciphersuite(0xC052, "DHE_RSA_WITH_ARIA_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::DH, "ARIA-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 405| 18.2k| Ciphersuite(0xC053, "DHE_RSA_WITH_ARIA_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::DH, "ARIA-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 406| 18.2k| Ciphersuite(0xC05C, "ECDHE_ECDSA_WITH_ARIA_128_GCM_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "ARIA-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 407| 18.2k| Ciphersuite(0xC05D, "ECDHE_ECDSA_WITH_ARIA_256_GCM_SHA384", Auth_Method::ECDSA, Kex_Algo::ECDH, "ARIA-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 408| 18.2k| Ciphersuite(0xC060, "ECDHE_RSA_WITH_ARIA_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "ARIA-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 409| 18.2k| Ciphersuite(0xC061, "ECDHE_RSA_WITH_ARIA_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::ECDH, "ARIA-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 410| 18.2k| Ciphersuite(0xC06A, "PSK_WITH_ARIA_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "ARIA-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 411| 18.2k| Ciphersuite(0xC06B, "PSK_WITH_ARIA_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::PSK, "ARIA-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 412| 18.2k| Ciphersuite(0xC07A, "RSA_WITH_CAMELLIA_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "Camellia-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 413| 18.2k| Ciphersuite(0xC07B, "RSA_WITH_CAMELLIA_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "Camellia-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 414| 18.2k| Ciphersuite(0xC07C, "DHE_RSA_WITH_CAMELLIA_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::DH, "Camellia-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 415| 18.2k| Ciphersuite(0xC07D, "DHE_RSA_WITH_CAMELLIA_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::DH, "Camellia-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 416| 18.2k| Ciphersuite(0xC086, "ECDHE_ECDSA_WITH_CAMELLIA_128_GCM_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "Camellia-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 417| 18.2k| Ciphersuite(0xC087, "ECDHE_ECDSA_WITH_CAMELLIA_256_GCM_SHA384", Auth_Method::ECDSA, Kex_Algo::ECDH, "Camellia-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 418| 18.2k| Ciphersuite(0xC08A, "ECDHE_RSA_WITH_CAMELLIA_128_GCM_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "Camellia-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 419| 18.2k| Ciphersuite(0xC08B, "ECDHE_RSA_WITH_CAMELLIA_256_GCM_SHA384", Auth_Method::RSA, Kex_Algo::ECDH, "Camellia-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 420| 18.2k| Ciphersuite(0xC08E, "PSK_WITH_CAMELLIA_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "Camellia-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 421| 18.2k| Ciphersuite(0xC08F, "PSK_WITH_CAMELLIA_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::PSK, "Camellia-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 422| 18.2k| Ciphersuite(0xC09C, "RSA_WITH_AES_128_CCM", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 423| 18.2k| Ciphersuite(0xC09D, "RSA_WITH_AES_256_CCM", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-256/CCM", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 424| 18.2k| Ciphersuite(0xC09E, "DHE_RSA_WITH_AES_128_CCM", Auth_Method::RSA, Kex_Algo::DH, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 425| 18.2k| Ciphersuite(0xC09F, "DHE_RSA_WITH_AES_256_CCM", Auth_Method::RSA, Kex_Algo::DH, "AES-256/CCM", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 426| 18.2k| Ciphersuite(0xC0A0, "RSA_WITH_AES_128_CCM_8", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 427| 18.2k| Ciphersuite(0xC0A1, "RSA_WITH_AES_256_CCM_8", Auth_Method::IMPLICIT, Kex_Algo::STATIC_RSA, "AES-256/CCM(8)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 428| 18.2k| Ciphersuite(0xC0A2, "DHE_RSA_WITH_AES_128_CCM_8", Auth_Method::RSA, Kex_Algo::DH, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 429| 18.2k| Ciphersuite(0xC0A3, "DHE_RSA_WITH_AES_256_CCM_8", Auth_Method::RSA, Kex_Algo::DH, "AES-256/CCM(8)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 430| 18.2k| Ciphersuite(0xC0A4, "PSK_WITH_AES_128_CCM", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 431| 18.2k| Ciphersuite(0xC0A5, "PSK_WITH_AES_256_CCM", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256/CCM", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 432| 18.2k| Ciphersuite(0xC0A8, "PSK_WITH_AES_128_CCM_8", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 433| 18.2k| Ciphersuite(0xC0A9, "PSK_WITH_AES_256_CCM_8", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256/CCM(8)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 434| 18.2k| Ciphersuite(0xC0AC, "ECDHE_ECDSA_WITH_AES_128_CCM", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 435| 18.2k| Ciphersuite(0xC0AD, "ECDHE_ECDSA_WITH_AES_256_CCM", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256/CCM", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 436| 18.2k| Ciphersuite(0xC0AE, "ECDHE_ECDSA_WITH_AES_128_CCM_8", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 437| 18.2k| Ciphersuite(0xC0AF, "ECDHE_ECDSA_WITH_AES_256_CCM_8", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256/CCM(8)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 438| 18.2k| Ciphersuite(0xCCA8, "ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 439| 18.2k| Ciphersuite(0xCCA9, "ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 440| 18.2k| Ciphersuite(0xCCAA, "DHE_RSA_WITH_CHACHA20_POLY1305_SHA256", Auth_Method::RSA, Kex_Algo::DH, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 441| 18.2k| Ciphersuite(0xCCAB, "PSK_WITH_CHACHA20_POLY1305_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 442| 18.2k| Ciphersuite(0xCCAC, "ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "ChaCha20Poly1305", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 443| 18.2k| Ciphersuite(0xD001, "ECDHE_PSK_WITH_AES_128_GCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-128/GCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 444| 18.2k| Ciphersuite(0xD002, "ECDHE_PSK_WITH_AES_256_GCM_SHA384", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-256/GCM", 32, "AEAD", 0, KDF_Algo::SHA_384, Nonce_Format::AEAD_IMPLICIT_4), 445| 18.2k| Ciphersuite(0xD003, "ECDHE_PSK_WITH_AES_128_CCM_8_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-128/CCM(8)", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 446| 18.2k| Ciphersuite(0xD005, "ECDHE_PSK_WITH_AES_128_CCM_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-128/CCM", 16, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_IMPLICIT_4), 447| 18.2k| Ciphersuite(0xFFC3, "ECDHE_RSA_WITH_AES_256_OCB_SHA256", Auth_Method::RSA, Kex_Algo::ECDH, "AES-256/OCB(12)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 448| 18.2k| Ciphersuite(0xFFC5, "ECDHE_ECDSA_WITH_AES_256_OCB_SHA256", Auth_Method::ECDSA, Kex_Algo::ECDH, "AES-256/OCB(12)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 449| 18.2k| Ciphersuite(0xFFC7, "PSK_WITH_AES_256_OCB_SHA256", Auth_Method::IMPLICIT, Kex_Algo::PSK, "AES-256/OCB(12)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 450| 18.2k| Ciphersuite(0xFFCB, "ECDHE_PSK_WITH_AES_256_OCB_SHA256", Auth_Method::IMPLICIT, Kex_Algo::ECDHE_PSK, "AES-256/OCB(12)", 32, "AEAD", 0, KDF_Algo::SHA_256, Nonce_Format::AEAD_XOR_12), 451| 18.2k| }; 452| | 453| | // clang-format on 454| | 455| 18.2k| return g_ciphersuite_list; 456| 18.2k|} _ZNK5Botan3TLS16Protocol_Version9to_stringEv: 34| 7|std::string Protocol_Version::to_string() const { 35| 7| const uint8_t maj = major_version(); 36| 7| const uint8_t min = minor_version(); 37| | 38| 7| if(maj == 3 && min == 0) { ------------------ | Branch (38:7): [True: 5, False: 2] | Branch (38:19): [True: 0, False: 5] ------------------ 39| 0| return "SSL v3"; 40| 0| } 41| | 42| 7| if(maj == 3 && min >= 1) { // TLS v1.x ------------------ | Branch (42:7): [True: 5, False: 2] | Branch (42:19): [True: 5, False: 0] ------------------ 43| 5| return "TLS v1." + std::to_string(min - 1); 44| 5| } 45| | 46| 2| if(maj == 254) { // DTLS 1.x ------------------ | Branch (46:7): [True: 2, False: 0] ------------------ 47| 2| return "DTLS v1." + std::to_string(255 - min); 48| 2| } 49| | 50| | // Some very new or very old protocol (or bogus data) 51| 0| return "Unknown " + std::to_string(maj) + "." + std::to_string(min); 52| 2|} _ZNK5Botan3TLS16Protocol_Version20is_datagram_protocolEv: 54| 846k|bool Protocol_Version::is_datagram_protocol() const { 55| 846k| return major_version() > 250; 56| 846k|} _ZNK5Botan3TLS16Protocol_Version13is_pre_tls_13Ev: 58| 703k|bool Protocol_Version::is_pre_tls_13() const { 59| 703k| return (!is_datagram_protocol() && *this <= Protocol_Version::TLS_V12) || ------------------ | Branch (59:12): [True: 703k, False: 41] | Branch (59:39): [True: 703k, False: 72] ------------------ 60| 113| (is_datagram_protocol() && *this <= Protocol_Version::DTLS_V12); ------------------ | Branch (60:12): [True: 41, False: 72] | Branch (60:38): [True: 28, False: 13] ------------------ 61| 703k|} _ZNK5Botan3TLS16Protocol_VersiongtERKS1_: 68| 16.5k|bool Protocol_Version::operator>(const Protocol_Version& other) const { 69| 16.5k| if(this->is_datagram_protocol() != other.is_datagram_protocol()) { ------------------ | Branch (69:7): [True: 2, False: 16.5k] ------------------ 70| 2| throw TLS_Exception(Alert::ProtocolVersion, "Version comparing " + to_string() + " with " + other.to_string()); 71| 2| } 72| | 73| 16.5k| if(this->is_datagram_protocol()) { ------------------ | Branch (73:7): [True: 32, False: 16.4k] ------------------ 74| 32| return m_version < other.m_version; // goes backwards 75| 32| } 76| | 77| 16.4k| return m_version > other.m_version; 78| 16.5k|} _ZNK5Botan3TLS16Protocol_Version5validEv: 80| 5.52k|bool Protocol_Version::valid() const { 81| 5.52k| const uint8_t maj = major_version(); 82| 5.52k| const uint8_t min = minor_version(); 83| | 84| 5.52k| if(maj == 3 && min <= 4) { ------------------ | Branch (84:7): [True: 5.47k, False: 55] | Branch (84:19): [True: 5.47k, False: 0] ------------------ 85| | // 3.0: SSLv3 86| | // 3.1: TLS 1.0 87| | // 3.2: TLS 1.1 88| | // 3.3: TLS 1.2 89| | // 3.4: TLS 1.3 90| 5.47k| return true; 91| 5.47k| } 92| | 93| 55| if(maj == 254 && (min == 253 || min == 255)) { ------------------ | Branch (93:7): [True: 10, False: 45] | Branch (93:22): [True: 6, False: 4] | Branch (93:36): [True: 2, False: 2] ------------------ 94| | // 254.253: DTLS 1.2 95| | // 254.255: DTLS 1.0 96| 8| return true; 97| 8| } 98| | 99| 47| return false; 100| 55|} _ZN5Botan15allocate_memoryEmm: 21| 6.72M|BOTAN_MALLOC_FN void* allocate_memory(size_t elems, size_t elem_size) { 22| 6.72M| if(elems == 0 || elem_size == 0) { ------------------ | Branch (22:7): [True: 0, False: 6.72M] | Branch (22:21): [True: 0, False: 6.72M] ------------------ 23| 0| return nullptr; 24| 0| } 25| | 26| | // Some calloc implementations do not check for overflow (?!?) 27| 6.72M| if(!checked_mul(elems, elem_size).has_value()) { ------------------ | Branch (27:7): [True: 0, False: 6.72M] ------------------ 28| 0| throw std::bad_alloc(); 29| 0| } 30| | 31| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 32| | // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy 33| | if(void* p = mlock_allocator::instance().allocate(elems, elem_size)) { 34| | return p; 35| | } 36| |#endif 37| | 38| |#if defined(BOTAN_TARGET_OS_HAS_ALLOC_CONCEAL) 39| | void* ptr = ::calloc_conceal(elems, elem_size); 40| |#else 41| | // NOLINTNEXTLINE(*-const-correctness) bug in clang-tidy 42| 6.72M| void* ptr = std::calloc(elems, elem_size); // NOLINT(*-no-malloc,*-owning-memory) 43| 6.72M|#endif 44| 6.72M| if(ptr == nullptr) { ------------------ | Branch (44:7): [True: 0, False: 6.72M] ------------------ 45| 0| [[unlikely]] throw std::bad_alloc(); 46| 0| } 47| 6.72M| return ptr; 48| 6.72M|} _ZN5Botan17deallocate_memoryEPvmm: 50| 6.72M|void deallocate_memory(void* p, size_t elems, size_t elem_size) { 51| 6.72M| if(p == nullptr) { ------------------ | Branch (51:7): [True: 0, False: 6.72M] ------------------ 52| 0| [[unlikely]] return; 53| 0| } 54| | 55| 6.72M| secure_scrub_memory(p, elems * elem_size); 56| | 57| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 58| | if(mlock_allocator::instance().deallocate(p, elems, elem_size)) { 59| | return; 60| | } 61| |#endif 62| | 63| 6.72M| std::free(p); // NOLINT(*-no-malloc,*-owning-memory) 64| 6.72M|} _ZN5Botan20initialize_allocatorEv: 66| 1|void initialize_allocator() { 67| |#if defined(BOTAN_HAS_LOCKING_ALLOCATOR) 68| | mlock_allocator::instance(); 69| |#endif 70| 1|} _ZN5Botan22throw_invalid_argumentEPKcS1_S1_: 23| 5|void throw_invalid_argument(const char* message, const char* func, const char* file) { 24| 5| throw Invalid_Argument(fmt("{} in {}:{}", message, func, file)); 25| 5|} _ZN5Botan13is_valid_utf8ERKNSt3__112basic_stringIcNS0_11char_traitsIcEENS0_9allocatorIcEEEE: 106| 1.84k|bool is_valid_utf8(const std::string& utf8) { 107| 1.84k| try { 108| 1.84k| size_t pos = 0; 109| 26.1k| while(pos < utf8.size()) { ------------------ | Branch (109:13): [True: 24.3k, False: 1.84k] ------------------ 110| 24.3k| const uint32_t c = next_utf8_codepoint(utf8, pos); 111| 24.3k| BOTAN_UNUSED(c); ------------------ | | 144| 24.3k|#define BOTAN_UNUSED Botan::ignore_params ------------------ 112| 24.3k| } 113| 1.84k| } catch(Decoding_Error&) { 114| 541| return false; 115| 541| } 116| 1.30k| return true; 117| 1.84k|} _ZN5Botan12ucs2_to_utf8EPKhm: 119| 24|std::string ucs2_to_utf8(const uint8_t ucs2[], size_t len) { 120| 24| if(len % 2 != 0) { ------------------ | Branch (120:7): [True: 0, False: 24] ------------------ 121| 0| throw Decoding_Error("Invalid length for UCS-2 string"); 122| 0| } 123| | 124| 24| const size_t chars = len / 2; 125| | 126| 24| std::string s; 127| 48| for(size_t i = 0; i != chars; ++i) { ------------------ | Branch (127:22): [True: 24, False: 24] ------------------ 128| 24| const uint32_t c = load_be(ucs2, i); 129| 24| append_utf8_for(s, c); 130| 24| } 131| | 132| 24| return s; 133| 24|} _ZN5Botan14latin1_to_utf8EPKhm: 188| 17|std::string latin1_to_utf8(const uint8_t chars[], size_t len) { 189| 17| std::string s; 190| 223| for(size_t i = 0; i != len; ++i) { ------------------ | Branch (190:22): [True: 206, False: 17] ------------------ 191| 206| const uint32_t c = static_cast(chars[i]); 192| 206| append_utf8_for(s, c); 193| 206| } 194| 17| return s; 195| 17|} charset.cpp:_ZN5Botan12_GLOBAL__N_119next_utf8_codepointERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERm: 52| 24.3k|uint32_t next_utf8_codepoint(const std::string& utf8, size_t& pos) { 53| 24.3k| auto read_continuation = [&]() -> uint32_t { 54| 24.3k| if(pos >= utf8.size()) { 55| 24.3k| throw Decoding_Error("Invalid UTF-8 sequence"); 56| 24.3k| } 57| 24.3k| const uint8_t b = static_cast(utf8[pos++]); 58| 24.3k| if((b & 0xC0) != 0x80) { 59| 24.3k| throw Decoding_Error("Invalid UTF-8 sequence"); 60| 24.3k| } 61| 24.3k| return b & 0x3F; 62| 24.3k| }; 63| | 64| 24.3k| const uint8_t lead = static_cast(utf8[pos++]); 65| 24.3k| uint32_t c = 0; 66| | 67| 24.3k| if(lead <= 0x7F) { ------------------ | Branch (67:7): [True: 23.4k, False: 843] ------------------ 68| 23.4k| c = lead; 69| 23.4k| } else if((lead & 0xE0) == 0xC0) { ------------------ | Branch (69:14): [True: 19, False: 824] ------------------ 70| 19| c = (lead & 0x1F) << 6; 71| 19| c |= read_continuation(); 72| 19| if(c < 0x80) { ------------------ | Branch (72:10): [True: 0, False: 19] ------------------ 73| 0| throw Decoding_Error("Overlong UTF-8 sequence"); 74| 0| } 75| 824| } else if((lead & 0xF0) == 0xE0) { ------------------ | Branch (75:14): [True: 5, False: 819] ------------------ 76| 5| c = (lead & 0x0F) << 12; 77| 5| c |= read_continuation() << 6; 78| 5| c |= read_continuation(); 79| 5| if(c < 0x800) { ------------------ | Branch (79:10): [True: 0, False: 5] ------------------ 80| 0| throw Decoding_Error("Overlong UTF-8 sequence"); 81| 0| } 82| 819| } else if((lead & 0xF8) == 0xF0) { ------------------ | Branch (82:14): [True: 325, False: 494] ------------------ 83| 325| c = (lead & 0x07) << 18; 84| 325| c |= read_continuation() << 12; 85| 325| c |= read_continuation() << 6; 86| 325| c |= read_continuation(); 87| 325| if(c < 0x10000) { ------------------ | Branch (87:10): [True: 0, False: 325] ------------------ 88| 0| throw Decoding_Error("Overlong UTF-8 sequence"); 89| 0| } 90| 494| } else { 91| 494| throw Decoding_Error("Invalid UTF-8 sequence"); 92| 494| } 93| | 94| 23.8k| if(c > 0x10FFFF) { ------------------ | Branch (94:7): [True: 0, False: 23.8k] ------------------ 95| 0| throw Decoding_Error("UTF-8 sequence encodes value outside Unicode range"); 96| 0| } 97| 23.8k| if(c >= 0xD800 && c < 0xE000) { ------------------ | Branch (97:7): [True: 299, False: 23.5k] | Branch (97:22): [True: 0, False: 299] ------------------ 98| 0| throw Decoding_Error("UTF-8 sequence encodes surrogate code point"); 99| 0| } 100| | 101| 23.8k| return c; 102| 23.8k|} charset.cpp:_ZZN5Botan12_GLOBAL__N_119next_utf8_codepointERKNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERmENK3$_0clEv: 53| 955| auto read_continuation = [&]() -> uint32_t { 54| 955| if(pos >= utf8.size()) { ------------------ | Branch (54:10): [True: 0, False: 955] ------------------ 55| 0| throw Decoding_Error("Invalid UTF-8 sequence"); 56| 0| } 57| 955| const uint8_t b = static_cast(utf8[pos++]); 58| 955| if((b & 0xC0) != 0x80) { ------------------ | Branch (58:10): [True: 47, False: 908] ------------------ 59| 47| throw Decoding_Error("Invalid UTF-8 sequence"); 60| 47| } 61| 908| return b & 0x3F; 62| 955| }; charset.cpp:_ZN5Botan12_GLOBAL__N_115append_utf8_forERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEj: 18| 230|void append_utf8_for(std::string& s, uint32_t c) { 19| 230| if(c >= 0xD800 && c < 0xE000) { ------------------ | Branch (19:7): [True: 0, False: 230] | Branch (19:22): [True: 0, False: 0] ------------------ 20| 0| throw Decoding_Error("Invalid Unicode character"); 21| 0| } 22| | 23| 230| if(c <= 0x7F) { ------------------ | Branch (23:7): [True: 181, False: 49] ------------------ 24| 181| const uint8_t b0 = static_cast(c); 25| 181| s.push_back(static_cast(b0)); 26| 181| } else if(c <= 0x7FF) { ------------------ | Branch (26:14): [True: 25, False: 24] ------------------ 27| 25| const uint8_t b0 = 0xC0 | static_cast(c >> 6); 28| 25| const uint8_t b1 = 0x80 | static_cast(c & 0x3F); 29| 25| s.push_back(static_cast(b0)); 30| 25| s.push_back(static_cast(b1)); 31| 25| } else if(c <= 0xFFFF) { ------------------ | Branch (31:14): [True: 24, False: 0] ------------------ 32| 24| const uint8_t b0 = 0xE0 | static_cast(c >> 12); 33| 24| const uint8_t b1 = 0x80 | static_cast((c >> 6) & 0x3F); 34| 24| const uint8_t b2 = 0x80 | static_cast(c & 0x3F); 35| 24| s.push_back(static_cast(b0)); 36| 24| s.push_back(static_cast(b1)); 37| 24| s.push_back(static_cast(b2)); 38| 24| } else if(c <= 0x10FFFF) { ------------------ | Branch (38:14): [True: 0, False: 0] ------------------ 39| 0| const uint8_t b0 = 0xF0 | static_cast(c >> 18); 40| 0| const uint8_t b1 = 0x80 | static_cast((c >> 12) & 0x3F); 41| 0| const uint8_t b2 = 0x80 | static_cast((c >> 6) & 0x3F); 42| 0| const uint8_t b3 = 0x80 | static_cast(c & 0x3F); 43| 0| s.push_back(static_cast(b0)); 44| 0| s.push_back(static_cast(b1)); 45| 0| s.push_back(static_cast(b2)); 46| 0| s.push_back(static_cast(b3)); 47| 0| } else { 48| 0| throw Decoding_Error("Invalid Unicode character"); 49| 0| } 50| 230|} _ZN5Botan5CPUID10CPUID_DataC2Ev: 80| 1|CPUID::CPUID_Data::CPUID_Data() { 81| | // NOLINTBEGIN(*-prefer-member-initializer) 82| 1|#if defined(BOTAN_HAS_CPUID_DETECTION) 83| 1| m_processor_features = detect_cpu_features(~cleared_cpuid_bits()); 84| |#else 85| | m_processor_features = 0; 86| |#endif 87| | // NOLINTEND(*-prefer-member-initializer) 88| 1|} cpuid.cpp:_ZN5Botan12_GLOBAL__N_118cleared_cpuid_bitsEv: 59| 1|uint32_t cleared_cpuid_bits() { 60| 1| uint32_t cleared = 0; 61| | 62| 1| #if defined(BOTAN_HAS_OS_UTILS) 63| 1| std::string clear_cpuid_env; 64| 1| if(OS::read_env_variable(clear_cpuid_env, "BOTAN_CLEAR_CPUID")) { ------------------ | Branch (64:7): [True: 0, False: 1] ------------------ 65| 0| for(const auto& cpuid : split_on(clear_cpuid_env, ',')) { ------------------ | Branch (65:29): [True: 0, False: 0] ------------------ 66| 0| if(auto bit = CPUID::bit_from_string(cpuid)) { ------------------ | Branch (66:18): [True: 0, False: 0] ------------------ 67| 0| cleared |= bit->as_u32(); 68| 0| } 69| 0| } 70| 0| } 71| 1| #endif 72| | 73| 1| return cleared; 74| 1|} _ZN5Botan5CPUID10CPUID_Data19detect_cpu_featuresEj: 62| 1|uint32_t CPUID::CPUID_Data::detect_cpu_features(uint32_t allowed) { 63| 1| enum class x86_CPUID_1_bits : uint64_t { 64| 1| RDTSC = (1ULL << 4), 65| 1| SSE2 = (1ULL << 26), 66| 1| CLMUL = (1ULL << 33), 67| 1| SSSE3 = (1ULL << 41), 68| 1| SSE41 = (1ULL << 51), 69| 1| AESNI = (1ULL << 57), 70| | // AVX + OSXSAVE 71| 1| OSXSAVE = (1ULL << 59) | (1ULL << 60), 72| 1| RDRAND = (1ULL << 62) 73| 1| }; 74| | 75| 1| enum class x86_CPUID_7_bits : uint64_t { 76| 1| BMI1 = (1ULL << 3), 77| 1| AVX2 = (1ULL << 5), 78| 1| BMI2 = (1ULL << 8), 79| 1| BMI_1_AND_2 = BMI1 | BMI2, 80| 1| AVX512_F = (1ULL << 16), 81| 1| AVX512_DQ = (1ULL << 17), 82| 1| RDSEED = (1ULL << 18), 83| 1| ADX = (1ULL << 19), 84| 1| AVX512_IFMA = (1ULL << 21), 85| 1| SHA = (1ULL << 29), 86| 1| AVX512_BW = (1ULL << 30), 87| 1| AVX512_VL = (1ULL << 31), 88| 1| AVX512_VBMI = (1ULL << 33), 89| 1| AVX512_VBMI2 = (1ULL << 38), 90| 1| GFNI = (1ULL << 40), 91| 1| AVX512_VAES = (1ULL << 41), 92| 1| AVX512_VCLMUL = (1ULL << 42), 93| 1| AVX512_VBITALG = (1ULL << 44), 94| | 95| | /* 96| | We only enable AVX512 support if all of the below flags are available 97| | 98| | This is more than we strictly need for most uses, however it also has 99| | the effect of preventing execution of AVX512 codepaths on cores that 100| | have serious downclocking problems when AVX512 code executes, 101| | especially Intel Skylake. 102| | 103| | VBMI2/VBITALG are the key flags here as they restrict us to Intel Ice 104| | Lake/Rocket Lake, or AMD Zen4, all of which do not have penalties for 105| | executing AVX512. 106| | 107| | There is nothing stopping some future processor from supporting the 108| | above flags and having AVX512 penalties, but maybe you should not have 109| | bought such a processor. 110| | */ 111| 1| AVX512_PROFILE = 112| 1| AVX512_F | AVX512_DQ | AVX512_IFMA | AVX512_BW | AVX512_VL | AVX512_VBMI | AVX512_VBMI2 | AVX512_VBITALG, 113| 1| }; 114| | 115| | // NOLINTNEXTLINE(performance-enum-size) 116| 1| enum class x86_CPUID_7_1_bits : uint64_t { 117| 1| SHA512 = (1 << 0), 118| 1| SM3 = (1 << 1), 119| 1| SM4 = (1 << 2), 120| 1| }; 121| | 122| 1| uint32_t feat = 0; 123| 1| uint32_t cpuid[4] = {0}; 124| 1| bool has_os_ymm_support = false; 125| 1| bool has_os_zmm_support = false; 126| | 127| | // CPUID 0: vendor identification, max sublevel 128| 1| invoke_cpuid(0, cpuid); 129| | 130| 1| const uint32_t max_supported_sublevel = cpuid[0]; 131| | 132| 1| if(max_supported_sublevel >= 1) { ------------------ | Branch (132:7): [True: 1, False: 0] ------------------ 133| | // CPUID 1: feature bits 134| 1| invoke_cpuid(1, cpuid); 135| 1| const uint64_t flags0 = (static_cast(cpuid[2]) << 32) | cpuid[3]; 136| | 137| 1| feat |= if_set(flags0, x86_CPUID_1_bits::RDTSC, CPUFeature::Bit::RDTSC, allowed); 138| | 139| 1| feat |= if_set(flags0, x86_CPUID_1_bits::RDRAND, CPUFeature::Bit::RDRAND, allowed); 140| | 141| 1| feat |= if_set(flags0, x86_CPUID_1_bits::SSE2, CPUFeature::Bit::SSE2, allowed); 142| | 143| 1| if(is_set(feat, CPUFeature::Bit::SSE2)) { ------------------ | Branch (143:10): [True: 1, False: 0] ------------------ 144| 1| feat |= if_set(flags0, x86_CPUID_1_bits::SSSE3, CPUFeature::Bit::SSSE3, allowed); 145| | 146| 1| if(is_set(feat, CPUFeature::Bit::SSSE3)) { ------------------ | Branch (146:13): [True: 1, False: 0] ------------------ 147| 1| feat |= if_set(flags0, x86_CPUID_1_bits::CLMUL, CPUFeature::Bit::CLMUL, allowed); 148| 1| feat |= if_set(flags0, x86_CPUID_1_bits::AESNI, CPUFeature::Bit::AESNI, allowed); 149| 1| } 150| | 151| 1| const uint64_t osxsave64 = static_cast(x86_CPUID_1_bits::OSXSAVE); 152| 1| if((flags0 & osxsave64) == osxsave64) { ------------------ | Branch (152:13): [True: 1, False: 0] ------------------ 153| 1| const uint64_t xcr_flags = xgetbv(); 154| 1| if((xcr_flags & 0x6) == 0x6) { ------------------ | Branch (154:16): [True: 1, False: 0] ------------------ 155| 1| has_os_ymm_support = true; 156| 1| has_os_zmm_support = (xcr_flags & 0xE0) == 0xE0; 157| 1| } 158| 1| } 159| 1| } 160| 1| } 161| | 162| 1| if(max_supported_sublevel >= 7) { ------------------ | Branch (162:7): [True: 1, False: 0] ------------------ 163| 1| clear_mem(cpuid, 4); 164| 1| invoke_cpuid_sublevel(7, 0, cpuid); 165| | 166| 1| const uint64_t flags7 = (static_cast(cpuid[2]) << 32) | cpuid[1]; 167| | 168| 1| clear_mem(cpuid, 4); 169| 1| invoke_cpuid_sublevel(7, 1, cpuid); 170| 1| const uint32_t flags7_1 = cpuid[0]; 171| | 172| 1| feat |= if_set(flags7, x86_CPUID_7_bits::RDSEED, CPUFeature::Bit::RDSEED, allowed); 173| 1| feat |= if_set(flags7, x86_CPUID_7_bits::ADX, CPUFeature::Bit::ADX, allowed); 174| | 175| | /* 176| | We only set the BMI bit if both BMI1 and BMI2 are supported, since 177| | typically we want to use both extensions in the same code. 178| | */ 179| 1| feat |= if_set(flags7, x86_CPUID_7_bits::BMI_1_AND_2, CPUFeature::Bit::BMI, allowed); 180| | 181| 1| if(is_set(feat, CPUFeature::Bit::SSSE3)) { ------------------ | Branch (181:10): [True: 1, False: 0] ------------------ 182| 1| feat |= if_set(flags7, x86_CPUID_7_bits::SHA, CPUFeature::Bit::SHA, allowed); 183| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM3, CPUFeature::Bit::SM3, allowed); 184| | 185| | // We only consider AVX2 if SSSE3 is supported 186| 1| if(has_os_ymm_support) { ------------------ | Branch (186:13): [True: 1, False: 0] ------------------ 187| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX2, CPUFeature::Bit::AVX2, allowed); 188| | 189| 1| if(is_set(feat, CPUFeature::Bit::AVX2)) { ------------------ | Branch (189:16): [True: 1, False: 0] ------------------ 190| 1| feat |= if_set(flags7, x86_CPUID_7_bits::GFNI, CPUFeature::Bit::GFNI, allowed); 191| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX2_AES, allowed); 192| 1| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX2_CLMUL, allowed); 193| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SHA512, CPUFeature::Bit::SHA512, allowed); 194| 1| feat |= if_set(flags7_1, x86_CPUID_7_1_bits::SM4, CPUFeature::Bit::SM4, allowed); 195| | 196| | // Likewise we only consider AVX-512 if AVX2 is supported 197| 1| if(has_os_zmm_support) { ------------------ | Branch (197:19): [True: 0, False: 1] ------------------ 198| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_PROFILE, CPUFeature::Bit::AVX512, allowed); 199| | 200| 0| if(is_set(feat, CPUFeature::Bit::AVX512)) { ------------------ | Branch (200:22): [True: 0, False: 0] ------------------ 201| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VAES, CPUFeature::Bit::AVX512_AES, allowed); 202| 0| feat |= if_set(flags7, x86_CPUID_7_bits::AVX512_VCLMUL, CPUFeature::Bit::AVX512_CLMUL, allowed); 203| 0| } 204| 0| } 205| 1| } 206| 1| } 207| 1| } 208| 1| } 209| | 210| |/* 211| | * If we don't have access to CPUID, we can still safely assume that 212| | * any x86-64 processor has SSE2 and RDTSC 213| | */ 214| 1|#if defined(BOTAN_TARGET_ARCH_IS_X86_64) 215| 1| if(feat == 0) { ------------------ | Branch (215:7): [True: 0, False: 1] ------------------ 216| 0| feat |= CPUFeature::Bit::SSE2 & allowed; 217| 0| feat |= CPUFeature::Bit::RDTSC & allowed; 218| 0| } 219| 1|#endif 220| | 221| 1| return feat; 222| 1|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_112invoke_cpuidEjPj: 24| 2|void invoke_cpuid(uint32_t type, uint32_t out[4]) { 25| 2| clear_mem(out, 4); 26| | 27| 2|#if defined(BOTAN_USE_GCC_INLINE_ASM) 28| | // NOLINTNEXTLINE(*-no-assembler) 29| 2| asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type)); 30| | 31| |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC) 32| | __cpuid((int*)out, type); 33| | 34| |#else 35| | BOTAN_UNUSED(type); 36| | #warning "No way of calling x86 cpuid instruction for this compiler" 37| |#endif 38| 2|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_16xgetbvEv: 56| 1|BOTAN_FUNC_ISA("xsave") uint64_t xgetbv() { 57| | return _xgetbv(0); 58| 1|} cpuid_x86.cpp:_ZN5Botan12_GLOBAL__N_121invoke_cpuid_sublevelEjjPj: 40| 2|void invoke_cpuid_sublevel(uint32_t type, uint32_t level, uint32_t out[4]) { 41| 2| clear_mem(out, 4); 42| | 43| 2|#if defined(BOTAN_USE_GCC_INLINE_ASM) 44| | // NOLINTNEXTLINE(*-no-assembler) 45| 2| asm volatile("cpuid\n\t" : "=a"(out[0]), "=b"(out[1]), "=c"(out[2]), "=d"(out[3]) : "0"(type), "2"(level)); 46| | 47| |#elif defined(BOTAN_BUILD_COMPILER_IS_MSVC) 48| | __cpuidex((int*)out, type, level); 49| | 50| |#else 51| | BOTAN_UNUSED(type, level); 52| | #warning "No way of calling x86 cpuid instruction for this compiler" 53| |#endif 54| 2|} _ZN5Botan2CT11copy_outputENS0_6ChoiceENSt3__14spanIhLm18446744073709551615EEENS3_IKhLm18446744073709551615EEEm: 16| 38| size_t offset) { 17| | // This leaks information about the input length, but this happens 18| | // unavoidably since we are unable to ready any bytes besides those 19| | // in input[0..n] 20| 38| BOTAN_ARG_CHECK(output.size() >= input.size(), "Invalid span lengths"); ------------------ | | 35| 38| do { \ | | 36| 38| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 38| if(!(expr)) { \ | | ------------------ | | | Branch (37:10): [True: 0, False: 38] | | ------------------ | | 38| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 39| 0| Botan::throw_invalid_argument(msg, __func__, __FILE__); \ | | 40| 0| } \ | | 41| 38| } while(0) | | ------------------ | | | Branch (41:12): [Folded, False: 38] | | ------------------ ------------------ 21| | 22| | /* 23| | * We do not poison the input here because if we did we would have 24| | * to unpoison it at exit. We assume instead that callers have 25| | * already poisoned the input and will unpoison it at their own 26| | * time. 27| | */ 28| 38| CT::poison(offset); 29| | 30| | /** 31| | * Zeroize the entire output buffer to get started 32| | */ 33| 38| clear_mem(output); 34| | 35| | /* 36| | * If the offset is greater than input length, then the arguments are 37| | * invalid. Ideally we would throw an exception, but that leaks 38| | * information about the offset. Instead treat it as if the input 39| | * was invalid. 40| | */ 41| 38| accept = accept && CT::Mask::is_lte(offset, input.size()).as_choice(); 42| | 43| | /* 44| | * If the input is invalid, then set offset == input_length 45| | */ 46| 38| offset = CT::Mask::from_choice(accept).select(offset, input.size()); 47| | 48| | /* 49| | * Move the desired output bytes to the front using a slow (O^n) 50| | * but constant time loop that does not leak the value of the offset 51| | */ 52| 10.5k| for(size_t i = 0; i != input.size(); ++i) { ------------------ | Branch (52:22): [True: 10.5k, False: 38] ------------------ 53| | /* 54| | * If bad_input was set then we modified offset to equal the input_length. 55| | * In that case, this_loop will be greater than input_length, and so is_eq 56| | * mask will always be false. As a result none of the input values will be 57| | * written to output. 58| | * 59| | * This is ignoring the possibility of integer overflow of offset + i. But 60| | * for this to happen the input would have to consume nearly the entire 61| | * address space. 62| | */ 63| 10.5k| const size_t this_loop = offset + i; 64| | 65| | /* 66| | start index from i rather than 0 since we know j must be >= i + offset 67| | to have any effect, and starting from i does not reveal information 68| | */ 69| 1.49M| for(size_t j = i; j != input.size(); ++j) { ------------------ | Branch (69:25): [True: 1.48M, False: 10.5k] ------------------ 70| 1.48M| const uint8_t b = input[j]; 71| 1.48M| const auto is_eq = CT::Mask::is_equal(j, this_loop); 72| 1.48M| output[i] |= is_eq.if_set_return(b); 73| 1.48M| } 74| 10.5k| } 75| | 76| | // This will always be zero if the input was invalid 77| 38| const size_t output_bytes = input.size() - offset; 78| | 79| 38| CT::unpoison_all(output, output_bytes); 80| | 81| 38| return CT::Option(output_bytes, accept); 82| 38|} _ZN5Botan2CT24count_leading_zero_bytesENSt3__14spanIKhLm18446744073709551615EEE: 84| 38|size_t CT::count_leading_zero_bytes(std::span input) { 85| 38| size_t leading_zeros = 0; 86| 38| auto only_zeros = Mask::set(); 87| 10.5k| for(const uint8_t b : input) { ------------------ | Branch (87:24): [True: 10.5k, False: 38] ------------------ 88| 10.5k| only_zeros &= CT::Mask::is_zero(b); 89| 10.5k| leading_zeros += only_zeros.if_set_return(1); 90| 10.5k| } 91| 38| return leading_zeros; 92| 38|} _ZN5Botan2CT19strip_leading_zerosENSt3__14spanIKhLm18446744073709551615EEE: 94| 38|secure_vector CT::strip_leading_zeros(std::span input) { 95| 38| const size_t leading_zeros = CT::count_leading_zero_bytes(input); 96| | 97| 38| secure_vector output(input.size()); 98| | 99| 38| const auto written = CT::copy_output(CT::Choice::yes(), output, input, leading_zeros); 100| | 101| | /* 102| | This is potentially not const time, depending on how std::vector is 103| | implemented. But since we are always reducing length, it should 104| | just amount to setting the member var holding the length. 105| | */ 106| 38| output.resize(written.value_or(0)); 107| | 108| 38| return output; 109| 38|} _ZN5Botan10DataSource9read_byteERh: 27| 1.69M|size_t DataSource::read_byte(uint8_t& out) { 28| 1.69M| return read(&out, 1); 29| 1.69M|} _ZN5Botan10DataSource9read_byteEv: 34| 110k|std::optional DataSource::read_byte() { 35| 110k| uint8_t b = 0; 36| 110k| if(this->read(&b, 1) == 1) { ------------------ | Branch (36:7): [True: 109k, False: 1.35k] ------------------ 37| 109k| return b; 38| 109k| } else { 39| 1.35k| return {}; 40| 1.35k| } 41| 110k|} _ZNK5Botan10DataSource9peek_byteERh: 46| 4.01k|size_t DataSource::peek_byte(uint8_t& out) const { 47| 4.01k| return peek(&out, 1, 0); 48| 4.01k|} _ZN5Botan17DataSource_Memory4readEPhm: 73| 142k|size_t DataSource_Memory::read(uint8_t out[], size_t length) { 74| 142k| const size_t got = std::min(m_source.size() - m_offset, length); 75| 142k| copy_mem(out, m_source.data() + m_offset, got); 76| 142k| m_offset += got; 77| 142k| return got; 78| 142k|} _ZN5Botan17DataSource_Memory15check_availableEm: 80| 41.7k|bool DataSource_Memory::check_available(size_t n) { 81| 41.7k| return (n <= (m_source.size() - m_offset)); 82| 41.7k|} _ZNK5Botan17DataSource_Memory4peekEPhmm: 87| 8.01k|size_t DataSource_Memory::peek(uint8_t out[], size_t length, size_t peek_offset) const { 88| 8.01k| const size_t bytes_left = m_source.size() - m_offset; 89| 8.01k| if(peek_offset >= bytes_left) { ------------------ | Branch (89:7): [True: 1, False: 8.01k] ------------------ 90| 1| return 0; 91| 1| } 92| | 93| 8.01k| const size_t got = std::min(bytes_left - peek_offset, length); 94| 8.01k| copy_mem(out, &m_source[m_offset + peek_offset], got); 95| 8.01k| return got; 96| 8.01k|} _ZNK5Botan17DataSource_Memory11end_of_dataEv: 101| 21.5k|bool DataSource_Memory::end_of_data() const { 102| 21.5k| return (m_offset == m_source.size()); 103| 21.5k|} _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 71| 11.6k|Exception::Exception(std::string_view msg) : m_msg(msg) {} _ZN5Botan9ExceptionC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 73| 3.27k|Exception::Exception(std::string_view msg, const std::exception& e) : m_msg(fmt("{} failed with {}", msg, e.what())) {} _ZN5Botan9ExceptionC2EPKcNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE: 75| 1|Exception::Exception(const char* prefix, std::string_view msg) : m_msg(fmt("{} {}", prefix, msg)) {} _ZN5Botan16Invalid_ArgumentC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 77| 10|Invalid_Argument::Invalid_Argument(std::string_view msg) : Exception(msg) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 125| 5.96k|Decoding_Error::Decoding_Error(std::string_view name) : Exception(name) {} _ZN5Botan14Decoding_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEERKSt9exception: 130| 3.27k|Decoding_Error::Decoding_Error(std::string_view msg, const std::exception& e) : Exception(msg, e) {} _ZN5Botan15Stream_IO_ErrorC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 135| 1|Stream_IO_Error::Stream_IO_Error(std::string_view err) : Exception("I/O error:", err) {} _ZN5Botan5GHASH14ghash_multiplyENSt3__14spanIhLm16EEENS2_IKhLm18446744073709551615EEEm: 44| 111|void GHASH::ghash_multiply(std::span x, std::span input, size_t blocks) { 45| 111| BOTAN_ASSERT_NOMSG(input.size() % GCM_BS == 0); ------------------ | | 77| 111| do { \ | | 78| 111| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 111| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 111] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 111| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 111] | | ------------------ ------------------ 46| | 47| 111|#if defined(BOTAN_HAS_GHASH_AVX512_CLMUL) 48| 111| if(CPUID::has(CPUID::Feature::AVX512_CLMUL)) { ------------------ | Branch (48:7): [True: 0, False: 111] ------------------ 49| 0| BOTAN_ASSERT_NOMSG(!m_H_pow.empty()); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 50| 0| return ghash_multiply_avx512_clmul(x.data(), m_H_pow.data(), input.data(), blocks); 51| 0| } 52| 111|#endif 53| | 54| 111|#if defined(BOTAN_HAS_GHASH_CLMUL_CPU) 55| 111| if(CPUID::has(CPUID::Feature::HW_CLMUL)) { ------------------ | Branch (55:7): [True: 111, False: 0] ------------------ 56| 111| BOTAN_ASSERT_NOMSG(!m_H_pow.empty()); ------------------ | | 77| 111| do { \ | | 78| 111| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 111| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 111] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 111| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 111] | | ------------------ ------------------ 57| 111| return ghash_multiply_cpu(x.data(), m_H_pow, input.data(), blocks); 58| 111| } 59| 0|#endif 60| | 61| 0|#if defined(BOTAN_HAS_GHASH_CLMUL_VPERM) 62| 0| if(CPUID::has(CPUID::Feature::SIMD_2X64)) { ------------------ | Branch (62:7): [True: 0, False: 0] ------------------ 63| 0| return ghash_multiply_vperm(x.data(), m_HM.data(), input.data(), blocks); 64| 0| } 65| 0|#endif 66| | 67| 0| auto scope = CT::scoped_poison(x); 68| | 69| 0| auto X = load_be>(x); 70| | 71| 0| BufferSlicer in(input); 72| 0| for(size_t b = 0; b != blocks; ++b) { ------------------ | Branch (72:22): [True: 0, False: 0] ------------------ 73| 0| const auto I = load_be>(in.take()); 74| 0| X[0] ^= I[0]; 75| 0| X[1] ^= I[1]; 76| | 77| 0| std::array Z{}; 78| | 79| 0| for(size_t i = 0; i != 64; ++i) { ------------------ | Branch (79:25): [True: 0, False: 0] ------------------ 80| 0| const auto X0MASK = CT::Mask::expand_top_bit(X[0]); 81| 0| const auto X1MASK = CT::Mask::expand_top_bit(X[1]); 82| | 83| 0| X[0] <<= 1; 84| 0| X[1] <<= 1; 85| | 86| 0| Z[0] = X0MASK.select(Z[0] ^ m_HM[4 * i], Z[0]); 87| 0| Z[1] = X0MASK.select(Z[1] ^ m_HM[4 * i + 1], Z[1]); 88| | 89| 0| Z[0] = X1MASK.select(Z[0] ^ m_HM[4 * i + 2], Z[0]); 90| 0| Z[1] = X1MASK.select(Z[1] ^ m_HM[4 * i + 3], Z[1]); 91| 0| } 92| | 93| 0| X[0] = Z[0]; 94| 0| X[1] = Z[1]; 95| 0| } 96| | 97| 0| store_be(x, X); 98| 0|} _ZNK5Botan5GHASH19has_keying_materialEv: 100| 111|bool GHASH::has_keying_material() const { 101| 111| return !m_HM.empty() || !m_H_pow.empty(); ------------------ | Branch (101:11): [True: 0, False: 111] | Branch (101:28): [True: 111, False: 0] ------------------ 102| 111|} _ZN5Botan5GHASH12key_scheduleENSt3__14spanIKhLm18446744073709551615EEE: 104| 32|void GHASH::key_schedule(std::span key) { 105| 32| m_H_ad = {0}; 106| 32| m_ad_len = 0; 107| 32| m_text_len = 0; 108| | 109| 32| BOTAN_ASSERT_NOMSG(key.size() == GCM_BS); ------------------ | | 77| 32| do { \ | | 78| 32| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 32| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 32] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 32| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 32] | | ------------------ ------------------ 110| 32| auto H = load_be>(key.first()); 111| | 112| 32|#if defined(BOTAN_HAS_GHASH_AVX512_CLMUL) 113| 32| if(CPUID::has(CPUID::Feature::AVX512_CLMUL)) { ------------------ | Branch (113:7): [True: 0, False: 32] ------------------ 114| 0| zap(m_HM); 115| 0| if(m_H_pow.size() != 32) { ------------------ | Branch (115:10): [True: 0, False: 0] ------------------ 116| 0| m_H_pow.resize(32); 117| 0| } 118| 0| ghash_precompute_avx512_clmul(key.data(), m_H_pow.data()); 119| | // m_HM left empty 120| 0| return; 121| 0| } 122| 32|#endif 123| | 124| 32|#if defined(BOTAN_HAS_GHASH_CLMUL_CPU) 125| 32| if(CPUID::has(CPUID::Feature::HW_CLMUL)) { ------------------ | Branch (125:7): [True: 32, False: 0] ------------------ 126| 32| zap(m_HM); 127| 32| ghash_precompute_cpu(key.data(), m_H_pow); 128| | // m_HM left empty 129| 32| return; 130| 32| } 131| 0|#endif 132| | 133| 0| const uint64_t R = 0xE100000000000000; 134| | 135| 0| if(m_HM.size() != 256) { ------------------ | Branch (135:7): [True: 0, False: 0] ------------------ 136| 0| m_HM.resize(256); 137| 0| } 138| | 139| | // precompute the multiples of H 140| 0| for(size_t i = 0; i != 2; ++i) { ------------------ | Branch (140:22): [True: 0, False: 0] ------------------ 141| 0| for(size_t j = 0; j != 64; ++j) { ------------------ | Branch (141:25): [True: 0, False: 0] ------------------ 142| | /* 143| | we interleave H^1, H^65, H^2, H^66, H3, H67, H4, H68 144| | to make indexing nicer in the multiplication code 145| | */ 146| 0| m_HM[4 * j + 2 * i] = H[0]; 147| 0| m_HM[4 * j + 2 * i + 1] = H[1]; 148| | 149| | // GCM's bit ops are reversed so we carry out of the bottom 150| 0| const uint64_t carry = CT::Mask::expand(H[1] & 1).if_set_return(R); 151| 0| H[1] = (H[1] >> 1) | (H[0] << 63); 152| 0| H[0] = (H[0] >> 1) ^ carry; 153| 0| } 154| 0| } 155| 0|} _ZN5Botan5GHASH5startENSt3__14spanIKhLm18446744073709551615EEE: 157| 37|void GHASH::start(std::span nonce) { 158| 37| BOTAN_ARG_CHECK(nonce.size() == 16, "GHASH requires a 128-bit nonce"); ------------------ | | 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] | | ------------------ ------------------ 159| 37| auto& n = m_nonce.emplace(); 160| 37| copy_mem(n, nonce); 161| 37| copy_mem(m_ghash, m_H_ad); 162| 37| m_buffer.clear(); 163| 37| m_text_len = 0; 164| 37|} _ZN5Botan5GHASH19set_associated_dataENSt3__14spanIKhLm18446744073709551615EEE: 166| 37|void GHASH::set_associated_data(std::span input) { 167| 37| BOTAN_STATE_CHECK(!m_nonce); ------------------ | | 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] | | ------------------ ------------------ 168| | 169| 37| assert_key_material_set(); 170| 37| m_H_ad = {0}; 171| 37| ghash_update(m_H_ad, input); 172| 37| ghash_zeropad(m_H_ad); 173| 37| m_ad_len = input.size(); 174| 37|} _ZN5Botan5GHASH6updateENSt3__14spanIKhLm18446744073709551615EEE: 190| 37|void GHASH::update(std::span input) { 191| 37| assert_key_material_set(); 192| 37| BOTAN_STATE_CHECK(m_nonce); ------------------ | | 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] | | ------------------ ------------------ 193| 37| ghash_update(m_ghash, input); 194| 37| m_text_len += input.size(); 195| | 196| | // NIST SP 800-38D limits plaintext/ciphertext to 2^39 - 256 bits 197| 37| constexpr uint64_t GHASH_MAX_BYTES = (((static_cast(1) << 39)) - 256) / 8; 198| 37| if(m_text_len > GHASH_MAX_BYTES) { ------------------ | Branch (198:7): [True: 0, False: 37] ------------------ 199| 0| throw Invalid_State("GCM message length limit exceeded"); 200| 0| } 201| 37|} _ZN5Botan5GHASH5finalENSt3__14spanIhLm18446744073709551615EEE: 203| 37|void GHASH::final(std::span mac) { 204| 37| BOTAN_ARG_CHECK(!mac.empty() && mac.size() <= GCM_BS, "GHASH output length"); ------------------ | | 35| 37| do { \ | | 36| 37| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 37| 74| if(!(expr)) { \ | | ------------------ | | | 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] | | ------------------ ------------------ 205| 37| BOTAN_STATE_CHECK(m_nonce); ------------------ | | 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] | | ------------------ ------------------ 206| 37| assert_key_material_set(); 207| | 208| 37| ghash_zeropad(m_ghash); 209| 37| ghash_final_block(m_ghash, m_ad_len, m_text_len); 210| | 211| 37| xor_buf(mac, std::span{m_ghash}.first(mac.size()), std::span{*m_nonce}.first(mac.size())); 212| | 213| 37| secure_scrub_memory(m_ghash); 214| 37| m_text_len = 0; 215| 37| m_nonce.reset(); 216| 37|} _ZN5Botan5GHASH12ghash_updateENSt3__14spanIhLm16EEENS2_IKhLm18446744073709551615EEE: 245| 74|void GHASH::ghash_update(std::span x, std::span input) { 246| 74| BufferSlicer in(input); 247| 148| while(!in.empty()) { ------------------ | Branch (247:10): [True: 74, False: 74] ------------------ 248| 74| if(const auto one_block = m_buffer.handle_unaligned_data(in)) { ------------------ | Branch (248:21): [True: 0, False: 74] ------------------ 249| 0| ghash_multiply(x, one_block.value(), 1); 250| 0| } 251| | 252| 74| if(m_buffer.in_alignment()) { ------------------ | Branch (252:10): [True: 32, False: 42] ------------------ 253| 32| const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in); 254| 32| if(full_blocks > 0) { ------------------ | Branch (254:13): [True: 32, False: 0] ------------------ 255| 32| ghash_multiply(x, aligned_data, full_blocks); 256| 32| } 257| 32| } 258| 74| } 259| 74| BOTAN_ASSERT_NOMSG(in.empty()); ------------------ | | 77| 74| do { \ | | 78| 74| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 74| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 74] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 74| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 74] | | ------------------ ------------------ 260| 74|} _ZN5Botan5GHASH13ghash_zeropadENSt3__14spanIhLm16EEE: 262| 74|void GHASH::ghash_zeropad(std::span x) { 263| 74| if(!m_buffer.in_alignment()) { ------------------ | Branch (263:7): [True: 42, False: 32] ------------------ 264| 42| m_buffer.fill_up_with_zeros(); 265| 42| ghash_multiply(x, m_buffer.consume(), 1); 266| 42| } 267| 74|} _ZN5Botan5GHASH17ghash_final_blockENSt3__14spanIhLm16EEEmm: 269| 37|void GHASH::ghash_final_block(std::span x, uint64_t ad_len, uint64_t text_len) { 270| 37| BOTAN_STATE_CHECK(m_buffer.in_alignment()); ------------------ | | 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] | | ------------------ ------------------ 271| 37| const auto final_block = store_be(8 * ad_len, 8 * text_len); 272| 37| ghash_multiply(x, final_block, 1); 273| 37|} _ZN5Botan5GHASH20ghash_precompute_cpuEPKhRNSt3__16vectorImNS_16secure_allocatorImEEEE: 81| 32|void BOTAN_FN_ISA_CLMUL GHASH::ghash_precompute_cpu(const uint8_t H_bytes[16], secure_vector& H_pow) { 82| 32| const SIMD_4x32 H1 = mulx_polyval(reverse_vector(SIMD_4x32::load_le(H_bytes))); 83| 32| const SIMD_4x32 H2 = polyval_multiply(H1, H1); 84| 32| const SIMD_4x32 H3 = polyval_multiply(H1, H2); 85| 32| const SIMD_4x32 H4 = polyval_multiply(H2, H2); 86| | 87| 32| H_pow.reserve(2 * 8); 88| 32| H_pow.resize(2 * 4); 89| 32| H1.store_le(&H_pow[0]); // NOLINT(*-container-data-pointer) 90| 32| H2.store_le(&H_pow[2]); 91| 32| H3.store_le(&H_pow[4]); 92| 32| H4.store_le(&H_pow[6]); 93| 32|} _ZN5Botan5GHASH18ghash_multiply_cpuEPhRNSt3__16vectorImNS_16secure_allocatorImEEEEPKhm: 98| 111| size_t blocks) { 99| 111| BOTAN_ASSERT_NOMSG(H_pow.size() == 2 * 4 || H_pow.size() == 2 * 8); ------------------ | | 77| 111| do { \ | | 78| 111| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 111| if(!(expr)) { \ | | ------------------ | | | Branch (79:12): [True: 111, False: 0] | | | Branch (79:12): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 111| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 111] | | ------------------ ------------------ 100| | 101| 111| const SIMD_4x32 H1 = SIMD_4x32::load_le(&H_pow[0]); // NOLINT(*-container-data-pointer) 102| | 103| 111| SIMD_4x32 a = reverse_vector(SIMD_4x32::load_le(x)); 104| | 105| 111| if(blocks >= 8) { ------------------ | Branch (105:7): [True: 0, False: 111] ------------------ 106| 0| const SIMD_4x32 H2 = SIMD_4x32::load_le(&H_pow[2]); 107| 0| const SIMD_4x32 H3 = SIMD_4x32::load_le(&H_pow[4]); 108| 0| const SIMD_4x32 H4 = SIMD_4x32::load_le(&H_pow[6]); 109| | 110| 0| if(H_pow.size() < 2 * 8) { ------------------ | Branch (110:10): [True: 0, False: 0] ------------------ 111| 0| H_pow.resize(2 * 8); 112| 0| const SIMD_4x32 H5 = polyval_multiply(H4, H1); 113| 0| const SIMD_4x32 H6 = polyval_multiply(H4, H2); 114| 0| const SIMD_4x32 H7 = polyval_multiply(H4, H3); 115| 0| const SIMD_4x32 H8 = polyval_multiply(H4, H4); 116| 0| H5.store_le(&H_pow[8]); 117| 0| H6.store_le(&H_pow[10]); 118| 0| H7.store_le(&H_pow[12]); 119| 0| H8.store_le(&H_pow[14]); 120| 0| } 121| | 122| 0| const SIMD_4x32 H5 = SIMD_4x32::load_le(&H_pow[8]); 123| 0| const SIMD_4x32 H6 = SIMD_4x32::load_le(&H_pow[10]); 124| 0| const SIMD_4x32 H7 = SIMD_4x32::load_le(&H_pow[12]); 125| 0| const SIMD_4x32 H8 = SIMD_4x32::load_le(&H_pow[14]); 126| | 127| 0| while(blocks >= 8) { ------------------ | Branch (127:13): [True: 0, False: 0] ------------------ 128| 0| const SIMD_4x32 m0 = reverse_vector(SIMD_4x32::load_le(input)); 129| 0| const SIMD_4x32 m1 = reverse_vector(SIMD_4x32::load_le(input + 16 * 1)); 130| 0| const SIMD_4x32 m2 = reverse_vector(SIMD_4x32::load_le(input + 16 * 2)); 131| 0| const SIMD_4x32 m3 = reverse_vector(SIMD_4x32::load_le(input + 16 * 3)); 132| 0| const SIMD_4x32 m4 = reverse_vector(SIMD_4x32::load_le(input + 16 * 4)); 133| 0| const SIMD_4x32 m5 = reverse_vector(SIMD_4x32::load_le(input + 16 * 5)); 134| 0| const SIMD_4x32 m6 = reverse_vector(SIMD_4x32::load_le(input + 16 * 6)); 135| 0| const SIMD_4x32 m7 = reverse_vector(SIMD_4x32::load_le(input + 16 * 7)); 136| | 137| 0| a = polyval_multiply_x8(H1, H2, H3, H4, H5, H6, H7, H8, m7, m6, m5, m4, m3, m2, m1, m0 ^ a); 138| | 139| 0| input += 8 * 16; 140| 0| blocks -= 8; 141| 0| } 142| 0| } 143| | 144| 111| if(blocks >= 4) { ------------------ | Branch (144:7): [True: 0, False: 111] ------------------ 145| 0| const SIMD_4x32 H2 = SIMD_4x32::load_le(&H_pow[2]); 146| 0| const SIMD_4x32 H3 = SIMD_4x32::load_le(&H_pow[4]); 147| 0| const SIMD_4x32 H4 = SIMD_4x32::load_le(&H_pow[6]); 148| | 149| 0| while(blocks >= 4) { ------------------ | Branch (149:13): [True: 0, False: 0] ------------------ 150| 0| const SIMD_4x32 m0 = reverse_vector(SIMD_4x32::load_le(input)); 151| 0| const SIMD_4x32 m1 = reverse_vector(SIMD_4x32::load_le(input + 16 * 1)); 152| 0| const SIMD_4x32 m2 = reverse_vector(SIMD_4x32::load_le(input + 16 * 2)); 153| 0| const SIMD_4x32 m3 = reverse_vector(SIMD_4x32::load_le(input + 16 * 3)); 154| | 155| 0| a ^= m0; 156| 0| a = polyval_multiply_x4(H1, H2, H3, H4, m3, m2, m1, a); 157| | 158| 0| input += 4 * 16; 159| 0| blocks -= 4; 160| 0| } 161| 0| } 162| | 163| 222| for(size_t i = 0; i != blocks; ++i) { ------------------ | Branch (163:22): [True: 111, False: 111] ------------------ 164| 111| const SIMD_4x32 m = reverse_vector(SIMD_4x32::load_le(input + 16 * i)); 165| | 166| 111| a ^= m; 167| 111| a = polyval_multiply(H1, a); 168| 111| } 169| | 170| 111| a = reverse_vector(a); 171| 111| a.store_le(x); 172| 111|} _ZN5Botan11IPv6AddressC2ENSt3__14spanIKhLm16EEE: 16| 5|IPv6Address::IPv6Address(std::span ip) : m_ip{} { 17| 85| for(size_t i = 0; i != 16; ++i) { ------------------ | Branch (17:22): [True: 80, False: 5] ------------------ 18| 80| m_ip[i] = ip[i]; 19| 80| } 20| 5|} _ZN5Botan21constant_time_compareENSt3__14spanIKhLm18446744073709551615EEES3_: 17| 283|bool constant_time_compare(std::span x, std::span y) { 18| 283| const auto min_size = CT::Mask::is_lte(x.size(), y.size()).select(x.size(), y.size()); 19| 283| const auto equal_size = CT::Mask::is_equal(x.size(), y.size()); 20| 283| const auto equal_content = CT::Mask::expand(CT::is_equal(x.data(), y.data(), min_size)); 21| 283| return (equal_content & equal_size).as_bool(); 22| 283|} _ZN5Botan19secure_scrub_memoryEPvm: 25| 6.96M|void secure_scrub_memory(void* ptr, size_t n) { 26| 6.96M| return secure_zeroize_buffer(ptr, n); 27| 6.96M|} _ZN5Botan21secure_zeroize_bufferEPvm: 29| 6.97M|void secure_zeroize_buffer(void* ptr, size_t n) { 30| 6.97M| if(n == 0) { ------------------ | Branch (30:7): [True: 139k, False: 6.83M] ------------------ 31| 139k| return; 32| 139k| } 33| | 34| |#if defined(BOTAN_TARGET_OS_HAS_RTLSECUREZEROMEMORY) 35| | ::RtlSecureZeroMemory(ptr, n); 36| | 37| |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_BZERO) 38| 6.83M| ::explicit_bzero(ptr, n); 39| | 40| |#elif defined(BOTAN_TARGET_OS_HAS_EXPLICIT_MEMSET) 41| | (void)::explicit_memset(ptr, 0, n); 42| | 43| |#else 44| | /* 45| | * Call memset through a static volatile pointer, which the compiler should 46| | * not elide. This construct should be safe in conforming compilers, but who 47| | * knows. This has been checked to generate the expected code, which saves the 48| | * memset address in the data segment and unconditionally loads and jumps to 49| | * that address, with the following targets: 50| | * 51| | * x86-64: Clang 19, GCC 6, 11, 13, 14 52| | * riscv64: GCC 14 53| | * aarch64: GCC 14 54| | * armv7: GCC 14 55| | * 56| | * Actually all of them generated the expected jump even without marking the 57| | * function pointer as volatile. However this seems worth including as an 58| | * additional precaution. 59| | */ 60| | static void* (*const volatile memset_ptr)(void*, int, size_t) = std::memset; 61| | (memset_ptr)(ptr, 0, n); 62| |#endif 63| 6.83M|} _ZN5Botan2OS14get_process_idEv: 76| 12.0k|uint32_t OS::get_process_id() { 77| 12.0k|#if defined(BOTAN_TARGET_OS_HAS_POSIX1) 78| 12.0k| return ::getpid(); 79| |#elif defined(BOTAN_TARGET_OS_HAS_WIN32) 80| | return ::GetCurrentProcessId(); 81| |#elif defined(BOTAN_TARGET_OS_IS_LLVM) || defined(BOTAN_TARGET_OS_IS_NONE) 82| | return 0; // truly no meaningful value 83| |#else 84| | #error "Missing get_process_id" 85| |#endif 86| 12.0k|} _ZN5Botan2OS17read_env_variableERNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEENS1_17basic_string_viewIcS4_EE: 448| 1|bool OS::read_env_variable(std::string& value_out, std::string_view name_view) { 449| 1| value_out = ""; 450| | 451| 1| if(running_in_privileged_state()) { ------------------ | Branch (451:7): [True: 0, False: 1] ------------------ 452| 0| return false; 453| 0| } 454| | 455| |#if defined(BOTAN_TARGET_OS_HAS_WIN32) && \ 456| | (defined(BOTAN_BUILD_COMPILER_IS_MSVC) || defined(BOTAN_BUILD_COMPILER_IS_CLANGCL)) 457| | const std::string name(name_view); 458| | char val[128] = {0}; 459| | size_t req_size = 0; 460| | if(getenv_s(&req_size, val, sizeof(val), name.c_str()) == 0) { 461| | // Microsoft's implementation always writes a terminating \0, 462| | // and includes it in the reported length of the environment variable 463| | // if a value exists. 464| | if(req_size > 0 && val[req_size - 1] == '\0') { 465| | value_out = std::string(val); 466| | } else { 467| | value_out = std::string(val, req_size); 468| | } 469| | return true; 470| | } 471| |#else 472| 1| const std::string name(name_view); 473| 1| if(const char* val = std::getenv(name.c_str())) { ------------------ | Branch (473:19): [True: 0, False: 1] ------------------ 474| 0| value_out = val; 475| 0| return true; 476| 0| } 477| 1|#endif 478| | 479| 1| return false; 480| 1|} os_utils.cpp:_ZN5Botan12_GLOBAL__N_110get_auxvalENSt3__18optionalImEE: 118| 1|std::optional get_auxval(std::optional id) { 119| 1| if(id) { ------------------ | Branch (119:7): [True: 1, False: 0] ------------------ 120| 1|#if defined(BOTAN_TARGET_OS_HAS_GETAUXVAL) 121| 1| return ::getauxval(*id); 122| |#elif defined(BOTAN_TARGET_OS_HAS_ELF_AUX_INFO) 123| | unsigned long auxinfo = 0; 124| | if(::elf_aux_info(static_cast(*id), &auxinfo, sizeof(auxinfo)) == 0) { 125| | return auxinfo; 126| | } 127| |#endif 128| 1| } 129| | 130| 0| return {}; 131| 1|} os_utils.cpp:_ZN5Botan12_GLOBAL__N_127running_in_privileged_stateEv: 152| 1|bool running_in_privileged_state() { 153| 1|#if defined(AT_SECURE) 154| 1| if(auto at_secure = get_auxval(AT_SECURE)) { ------------------ | Branch (154:12): [True: 1, False: 0] ------------------ 155| 1| return at_secure != 0; 156| 1| } 157| 0|#endif 158| | 159| 0|#if defined(BOTAN_TARGET_OS_HAS_POSIX1) 160| 0| return (::getuid() != ::geteuid()) || (::getgid() != ::getegid()); ------------------ | Branch (160:11): [True: 0, False: 0] | Branch (160:42): [True: 0, False: 0] ------------------ 161| |#else 162| | return false; 163| |#endif 164| 1|} _ZN5Botan9to_u32bitENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 30| 24.0k|uint32_t to_u32bit(std::string_view str_view) { 31| 24.0k| const std::string str(str_view); 32| | 33| | // std::stoul is not strict enough. Ensure that str is digit only [0-9]* 34| 48.1k| for(const char chr : str) { ------------------ | Branch (34:23): [True: 48.1k, False: 24.0k] ------------------ 35| 48.1k| if(chr < '0' || chr > '9') { ------------------ | Branch (35:10): [True: 0, False: 48.1k] | Branch (35:23): [True: 1, False: 48.1k] ------------------ 36| 1| throw Invalid_Argument("to_u32bit invalid decimal string '" + str + "'"); 37| 1| } 38| 48.1k| } 39| | 40| 24.0k| const unsigned long int x = std::stoul(str); 41| | 42| 24.0k| if constexpr(sizeof(unsigned long int) > 4) { 43| | // x might be uint64 44| 24.0k| if(x > std::numeric_limits::max()) { ------------------ | Branch (44:10): [True: 0, False: 24.0k] ------------------ 45| 0| throw Invalid_Argument("Integer value of " + str + " exceeds 32 bit range"); 46| 0| } 47| 24.0k| } 48| | 49| 24.0k| return static_cast(x); 50| 24.0k|} _ZN5Botan20parse_algorithm_nameENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 55| 33|std::vector parse_algorithm_name(std::string_view scan_name) { 56| 33| if(scan_name.find('(') == std::string::npos && scan_name.find(')') == std::string::npos) { ------------------ | Branch (56:7): [True: 33, False: 0] | Branch (56:51): [True: 33, False: 0] ------------------ 57| 33| return {std::string(scan_name)}; 58| 33| } 59| | 60| 0| std::string name(scan_name); 61| 0| std::string substring; 62| 0| std::vector elems; 63| 0| size_t level = 0; 64| | 65| 0| elems.push_back(name.substr(0, name.find('('))); 66| 0| name = name.substr(name.find('(')); 67| | 68| 0| for(auto i = name.begin(); i != name.end(); ++i) { ------------------ | Branch (68:31): [True: 0, False: 0] ------------------ 69| 0| const char c = *i; 70| | 71| 0| if(c == '(') { ------------------ | Branch (71:10): [True: 0, False: 0] ------------------ 72| 0| ++level; 73| 0| } 74| 0| if(c == ')') { ------------------ | Branch (74:10): [True: 0, False: 0] ------------------ 75| 0| if(level == 1 && i == name.end() - 1) { ------------------ | Branch (75:13): [True: 0, False: 0] | Branch (75:13): [True: 0, False: 0] | Branch (75:27): [True: 0, False: 0] ------------------ 76| 0| if(elems.size() == 1) { ------------------ | Branch (76:16): [True: 0, False: 0] ------------------ 77| 0| elems.push_back(substring.substr(1)); 78| 0| } else { 79| 0| elems.push_back(substring); 80| 0| } 81| 0| return elems; 82| 0| } 83| | 84| 0| if(level == 0 || (level == 1 && i != name.end() - 1)) { ------------------ | Branch (84:13): [True: 0, False: 0] | Branch (84:13): [True: 0, False: 0] | Branch (84:28): [True: 0, False: 0] | Branch (84:42): [True: 0, False: 0] ------------------ 85| 0| throw Invalid_Algorithm_Name(scan_name); 86| 0| } 87| 0| --level; 88| 0| } 89| | 90| 0| if(c == ',' && level == 1) { ------------------ | Branch (90:10): [True: 0, False: 0] | Branch (90:22): [True: 0, False: 0] ------------------ 91| 0| if(elems.size() == 1) { ------------------ | Branch (91:13): [True: 0, False: 0] ------------------ 92| 0| elems.push_back(substring.substr(1)); 93| 0| } else { 94| 0| elems.push_back(substring); 95| 0| } 96| 0| substring.clear(); 97| 0| } else { 98| 0| substring += c; 99| 0| } 100| 0| } 101| | 102| 0| if(!substring.empty()) { ------------------ | Branch (102:7): [True: 0, False: 0] ------------------ 103| 0| throw Invalid_Algorithm_Name(scan_name); 104| 0| } 105| | 106| 0| return elems; 107| 0|} _ZN5Botan8split_onENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEc: 109| 947|std::vector split_on(std::string_view str, char delim) { 110| 947| std::vector elems; 111| 947| if(str.empty()) { ------------------ | Branch (111:7): [True: 0, False: 947] ------------------ 112| 0| return elems; 113| 0| } 114| | 115| 947| std::string substr; 116| 11.0k| for(const char c : str) { ------------------ | Branch (116:21): [True: 11.0k, False: 947] ------------------ 117| 11.0k| if(c == delim) { ------------------ | Branch (117:10): [True: 60, False: 11.0k] ------------------ 118| 60| if(!substr.empty()) { ------------------ | Branch (118:13): [True: 60, False: 0] ------------------ 119| 60| elems.push_back(substr); 120| 60| } 121| 60| substr.clear(); 122| 11.0k| } else { 123| 11.0k| substr += c; 124| 11.0k| } 125| 11.0k| } 126| | 127| 947| if(substr.empty()) { ------------------ | Branch (127:7): [True: 0, False: 947] ------------------ 128| 0| throw Invalid_Argument(fmt("Unable to split string '{}", str)); 129| 0| } 130| 947| elems.push_back(substr); 131| | 132| 947| return elems; 133| 947|} _ZN5Botan14string_to_ipv4ENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 154| 7.28k|std::optional string_to_ipv4(std::string_view str) { 155| | // At least 3 dots + 4 1-digit integers 156| | // At most 3 dots + 4 3-digit integers 157| 7.28k| if(str.size() < 3 + 4 * 1 || str.size() > 3 + 4 * 3) { ------------------ | Branch (157:7): [True: 0, False: 7.28k] | Branch (157:33): [True: 0, False: 7.28k] ------------------ 158| 0| return {}; 159| 0| } 160| | 161| | // the final result 162| 7.28k| uint32_t ip = 0; 163| | // the number of '.' seen so far 164| 7.28k| size_t dots = 0; 165| | // accumulates one quad (range 0-255) 166| 7.28k| uint32_t accum = 0; 167| | // # of digits pushed to accum since last dot 168| 7.28k| size_t cur_digits = 0; 169| | 170| 7.28k| for(const char c : str) { ------------------ | Branch (170:21): [True: 7.28k, False: 0] ------------------ 171| 7.28k| if(c == '.') { ------------------ | Branch (171:10): [True: 0, False: 7.28k] ------------------ 172| | // . without preceding digit is invalid 173| 0| if(cur_digits == 0) { ------------------ | Branch (173:13): [True: 0, False: 0] ------------------ 174| 0| return {}; 175| 0| } 176| 0| dots += 1; 177| | // too many dots 178| 0| if(dots > 3) { ------------------ | Branch (178:13): [True: 0, False: 0] ------------------ 179| 0| return {}; 180| 0| } 181| | 182| 0| cur_digits = 0; 183| 0| ip = (ip << 8) | accum; 184| 0| accum = 0; 185| 7.28k| } else if(c >= '0' && c <= '9') { ------------------ | Branch (185:17): [True: 7.28k, False: 0] | Branch (185:29): [True: 0, False: 7.28k] ------------------ 186| 0| const auto d = static_cast(c - '0'); 187| | 188| | // prohibit leading zero in quad (used for octal) 189| 0| if(cur_digits > 0 && accum == 0) { ------------------ | Branch (189:13): [True: 0, False: 0] | Branch (189:31): [True: 0, False: 0] ------------------ 190| 0| return {}; 191| 0| } 192| 0| accum = (accum * 10) + d; 193| | 194| 0| if(accum > 255) { ------------------ | Branch (194:13): [True: 0, False: 0] ------------------ 195| 0| return {}; 196| 0| } 197| | 198| 0| cur_digits++; 199| 0| BOTAN_ASSERT_NOMSG(cur_digits <= 3); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 200| 7.28k| } else { 201| 7.28k| return {}; 202| 7.28k| } 203| 7.28k| } 204| | 205| | // no trailing digits? 206| 0| if(cur_digits == 0) { ------------------ | Branch (206:7): [True: 0, False: 0] ------------------ 207| 0| return {}; 208| 0| } 209| | 210| | // insufficient # of dots 211| 0| if(dots != 3) { ------------------ | Branch (211:7): [True: 0, False: 0] ------------------ 212| 0| return {}; 213| 0| } 214| | 215| 0| ip = (ip << 8) | accum; 216| | 217| 0| return ip; 218| 0|} _ZN5Botan31check_and_canonicalize_dns_nameENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE: 393| 372|std::string check_and_canonicalize_dns_name(std::string_view name) { 394| 372| if(name.size() > 255) { ------------------ | Branch (394:7): [True: 0, False: 372] ------------------ 395| 0| throw Decoding_Error("DNS name exceeds maximum allowed length"); 396| 0| } 397| | 398| 372| if(name.empty()) { ------------------ | Branch (398:7): [True: 6, False: 366] ------------------ 399| 6| throw Decoding_Error("DNS name cannot be empty"); 400| 6| } 401| | 402| 366| if(name.starts_with(".") || name.ends_with(".")) { ------------------ | Branch (402:7): [True: 9, False: 357] | Branch (402:32): [True: 0, False: 357] ------------------ 403| 9| throw Decoding_Error("DNS name cannot start or end with a dot"); 404| 9| } 405| | 406| | /* 407| | * Table mapping uppercase to lowercase and only including values for valid DNS names 408| | * namely A-Z, a-z, 0-9, hyphen, and dot, plus '*' for wildcarding. (RFC 1035) 409| | */ 410| | // clang-format off 411| 357| constexpr uint8_t DNS_CHAR_MAPPING[128] = { 412| 357| '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 413| 357| '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 414| 357| '\0', '\0', '\0', '\0', '*', '\0', '\0', '-', '.', '\0', '0', '1', '2', '3', '4', '5', '6', '7', '8', 415| 357| '9', '\0', '\0', '\0', '\0', '\0', '\0', '\0', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 416| 357| 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '\0', '\0', '\0', '\0', 417| 357| '\0', '\0', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 418| 357| 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '\0', '\0', '\0', '\0', '\0', 419| 357| }; 420| | // clang-format on 421| | 422| 357| std::string canon; 423| 357| canon.reserve(name.size()); 424| | 425| | // RFC 1035: DNS labels must not exceed 63 characters 426| 357| size_t current_label_length = 0; 427| | 428| 3.98k| for(size_t i = 0; i != name.size(); ++i) { ------------------ | Branch (428:22): [True: 3.74k, False: 245] ------------------ 429| 3.74k| const char c = name[i]; 430| | 431| 3.74k| if(c == '.') { ------------------ | Branch (431:10): [True: 311, False: 3.42k] ------------------ 432| 311| if(i > 0 && name[i - 1] == '.') { ------------------ | Branch (432:13): [True: 311, False: 0] | Branch (432:22): [True: 25, False: 286] ------------------ 433| 25| throw Decoding_Error("DNS name contains sequential period chars"); 434| 25| } 435| | 436| 286| if(current_label_length == 0) { ------------------ | Branch (436:13): [True: 0, False: 286] ------------------ 437| 0| throw Decoding_Error("DNS name contains empty label"); 438| 0| } 439| 286| current_label_length = 0; // Reset for next label 440| 3.42k| } else { 441| 3.42k| current_label_length++; 442| | 443| 3.42k| if(current_label_length > 63) { // RFC 1035 Maximum DNS label length ------------------ | Branch (443:13): [True: 0, False: 3.42k] ------------------ 444| 0| throw Decoding_Error("DNS name label exceeds maximum length of 63 characters"); 445| 0| } 446| 3.42k| } 447| | 448| 3.71k| const uint8_t cu = static_cast(c); 449| 3.71k| if(cu >= 128) { ------------------ | Branch (449:10): [True: 34, False: 3.68k] ------------------ 450| 34| throw Decoding_Error("DNS name must not contain any extended ASCII code points"); 451| 34| } 452| 3.68k| const uint8_t mapped = DNS_CHAR_MAPPING[cu]; 453| 3.68k| if(mapped == 0) { ------------------ | Branch (453:10): [True: 39, False: 3.64k] ------------------ 454| 39| throw Decoding_Error("DNS name includes invalid character"); 455| 39| } 456| | 457| 3.64k| if(mapped == '-') { ------------------ | Branch (457:10): [True: 16, False: 3.62k] ------------------ 458| 16| if(i == 0 || (i > 0 && name[i - 1] == '.')) { ------------------ | Branch (458:13): [True: 0, False: 16] | Branch (458:24): [True: 16, False: 0] | Branch (458:33): [True: 0, False: 16] ------------------ 459| 0| throw Decoding_Error("DNS name has label with leading hyphen"); 460| 16| } else if(i == name.size() - 1 || (i < name.size() - 1 && name[i + 1] == '.')) { ------------------ | Branch (460:20): [True: 13, False: 3] | Branch (460:45): [True: 3, False: 0] | Branch (460:68): [True: 1, False: 2] ------------------ 461| 14| throw Decoding_Error("DNS name has label with trailing hyphen"); 462| 14| } 463| 16| } 464| 3.62k| canon.push_back(static_cast(mapped)); 465| 3.62k| } 466| | 467| 245| if(current_label_length == 0) { ------------------ | Branch (467:7): [True: 0, False: 245] ------------------ 468| 0| throw Decoding_Error("DNS name contains empty label"); 469| 0| } 470| 245| return canon; 471| 245|} _ZN5Botan9SCAN_NameC2ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 58| 603|SCAN_Name::SCAN_Name(std::string_view algo_spec) : m_orig_algo_spec(algo_spec) { 59| 603| if(algo_spec.empty()) { ------------------ | Branch (59:7): [True: 0, False: 603] ------------------ 60| 0| throw Invalid_Argument("Expected algorithm name, got empty string"); 61| 0| } 62| | 63| 603| std::vector> name; 64| 603| size_t level = 0; 65| 603| std::pair accum = std::make_pair(level, ""); 66| | 67| 603| const std::string decoding_error = "Bad SCAN name '" + m_orig_algo_spec + "': "; 68| | 69| 9.73k| for(const char c : algo_spec) { ------------------ | Branch (69:21): [True: 9.73k, False: 603] ------------------ 70| 9.73k| if(c == '/' || c == ',' || c == '(' || c == ')') { ------------------ | Branch (70:10): [True: 0, False: 9.73k] | Branch (70:22): [True: 28, False: 9.70k] | Branch (70:34): [True: 603, False: 9.10k] | Branch (70:46): [True: 603, False: 8.50k] ------------------ 71| 1.23k| if(c == '(') { ------------------ | Branch (71:13): [True: 603, False: 631] ------------------ 72| 603| ++level; 73| 631| } else if(c == ')') { ------------------ | Branch (73:20): [True: 603, False: 28] ------------------ 74| 603| if(level == 0) { ------------------ | Branch (74:16): [True: 0, False: 603] ------------------ 75| 0| throw Decoding_Error(decoding_error + "Mismatched parens"); 76| 0| } 77| 603| --level; 78| 603| } 79| | 80| 1.23k| if(c == '/' && level > 0) { ------------------ | Branch (80:13): [True: 0, False: 1.23k] | Branch (80:25): [True: 0, False: 0] ------------------ 81| 0| accum.second.push_back(c); 82| 1.23k| } else { 83| 1.23k| if(!accum.second.empty()) { ------------------ | Branch (83:16): [True: 1.23k, False: 0] ------------------ 84| 1.23k| name.push_back(accum); 85| 1.23k| } 86| 1.23k| accum = std::make_pair(level, ""); 87| 1.23k| } 88| 8.50k| } else { 89| 8.50k| accum.second.push_back(c); 90| 8.50k| } 91| 9.73k| } 92| | 93| 603| if(!accum.second.empty()) { ------------------ | Branch (93:7): [True: 0, False: 603] ------------------ 94| 0| name.push_back(accum); 95| 0| } 96| | 97| 603| if(level != 0) { ------------------ | Branch (97:7): [True: 0, False: 603] ------------------ 98| 0| throw Decoding_Error(decoding_error + "Missing close paren"); 99| 0| } 100| | 101| 603| if(name.empty()) { ------------------ | Branch (101:7): [True: 0, False: 603] ------------------ 102| 0| throw Decoding_Error(decoding_error + "Empty name"); 103| 0| } 104| | 105| 603| m_alg_name = name[0].second; 106| | 107| 603| bool in_modes = false; 108| | 109| 1.23k| for(size_t i = 1; i != name.size(); ++i) { ------------------ | Branch (109:22): [True: 631, False: 603] ------------------ 110| 631| if(name[i].first == 0) { ------------------ | Branch (110:10): [True: 0, False: 631] ------------------ 111| 0| m_mode_info.push_back(make_arg(name, i)); 112| 0| in_modes = true; 113| 631| } else if(name[i].first == 1 && !in_modes) { ------------------ | Branch (113:17): [True: 631, False: 0] | Branch (113:39): [True: 631, False: 0] ------------------ 114| 631| m_args.push_back(make_arg(name, i)); 115| 631| } 116| 631| } 117| 603|} _ZNK5Botan9SCAN_Name3argEm: 119| 898|std::string SCAN_Name::arg(size_t i) const { 120| 898| if(i >= arg_count()) { ------------------ | Branch (120:7): [True: 0, False: 898] ------------------ 121| 0| throw Invalid_Argument("SCAN_Name::arg " + std::to_string(i) + " out of range for '" + to_string() + "'"); 122| 0| } 123| 898| return m_args[i]; 124| 898|} _ZNK5Botan9SCAN_Name3argEmNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 126| 14|std::string SCAN_Name::arg(size_t i, std::string_view def_value) const { 127| 14| if(i >= arg_count()) { ------------------ | Branch (127:7): [True: 0, False: 14] ------------------ 128| 0| return std::string(def_value); 129| 0| } 130| 14| return m_args[i]; 131| 14|} _ZNK5Botan9SCAN_Name14arg_as_integerEmm: 133| 49|size_t SCAN_Name::arg_as_integer(size_t i, size_t def_value) const { 134| 49| if(i >= arg_count()) { ------------------ | Branch (134:7): [True: 34, False: 15] ------------------ 135| 34| return def_value; 136| 34| } 137| 15| return to_u32bit(m_args[i]); 138| 49|} scan_name.cpp:_ZN5Botan12_GLOBAL__N_18make_argERKNSt3__16vectorINS1_4pairImNS1_12basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEEEENS7_ISA_EEEEm: 17| 631|std::string make_arg(const std::vector>& name, size_t start) { 18| 631| std::string output = name[start].second; 19| 631| size_t level = name[start].first; 20| | 21| 631| size_t paren_depth = 0; 22| | 23| 631| for(size_t i = start + 1; i != name.size(); ++i) { ------------------ | Branch (23:30): [True: 28, False: 603] ------------------ 24| 28| if(name[i].first <= name[start].first) { ------------------ | Branch (24:10): [True: 28, False: 0] ------------------ 25| 28| break; 26| 28| } 27| | 28| 0| if(name[i].first > level) { ------------------ | Branch (28:10): [True: 0, False: 0] ------------------ 29| 0| output += "(" + name[i].second; 30| 0| ++paren_depth; 31| 0| } else if(name[i].first < level) { ------------------ | Branch (31:17): [True: 0, False: 0] ------------------ 32| 0| for(size_t j = name[i].first; j < level; j++) { ------------------ | Branch (32:40): [True: 0, False: 0] ------------------ 33| 0| output += ")"; 34| 0| --paren_depth; 35| 0| } 36| 0| output += "," + name[i].second; 37| 0| } else { 38| 0| if(output[output.size() - 1] != '(') { ------------------ | Branch (38:13): [True: 0, False: 0] ------------------ 39| 0| output += ","; 40| 0| } 41| 0| output += name[i].second; 42| 0| } 43| | 44| 0| level = name[i].first; 45| 0| } 46| | 47| 631| for(size_t i = 0; i != paren_depth; ++i) { ------------------ | Branch (47:22): [True: 0, False: 631] ------------------ 48| 0| output += ")"; 49| 0| } 50| | 51| 631| return output; 52| 631|} _ZN5Botan15AlternativeName7add_uriENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 17| 30|void AlternativeName::add_uri(std::string_view uri) { 18| 30| if(!uri.empty()) { ------------------ | Branch (18:7): [True: 30, False: 0] ------------------ 19| 30| m_uri.insert(std::string(uri)); 20| 30| } 21| 30|} _ZN5Botan15AlternativeName9add_emailENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE: 23| 50|void AlternativeName::add_email(std::string_view addr) { 24| 50| if(!addr.empty()) { ------------------ | Branch (24:7): [True: 48, False: 2] ------------------ 25| 48| m_email.insert(std::string(addr)); 26| 48| } 27| 50|} _ZN5Botan15AlternativeName6add_dnERKNS_7X509_DNE: 50| 3|void AlternativeName::add_dn(const X509_DN& dn) { 51| 3| m_dn_names.insert(dn); 52| 3|} _ZN5Botan15AlternativeName16add_ipv4_addressEj: 54| 18|void AlternativeName::add_ipv4_address(uint32_t ip) { 55| 18| m_ipv4_addr.insert(ip); 56| 18|} _ZN5Botan15AlternativeName16add_ipv6_addressERKNS_11IPv6AddressE: 58| 5|void AlternativeName::add_ipv6_address(const IPv6Address& ip) { 59| 5| m_ipv6_addr.insert(ip); 60| 5|} _ZNK5Botan15AlternativeName5countEv: 62| 262|size_t AlternativeName::count() const { 63| 262| const auto sum = checked_add(m_dns.size(), 64| 262| m_uri.size(), 65| 262| m_email.size(), 66| 262| m_ipv4_addr.size(), 67| 262| m_ipv6_addr.size(), 68| 262| m_dn_names.size(), 69| 262| m_other_name_values.size(), 70| 262| m_registered_ids.size()); 71| | 72| 262| BOTAN_ASSERT_NOMSG(sum.has_value()); ------------------ | | 77| 262| do { \ | | 78| 262| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 262| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 262] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 262| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 262] | | ------------------ ------------------ 73| 262| return sum.value(); 74| 262|} _ZNK5Botan15AlternativeName9has_itemsEv: 76| 262|bool AlternativeName::has_items() const { 77| 262| return this->count() > 0; 78| 262|} _ZN5Botan15AlternativeName11decode_fromERNS_11BER_DecoderE: 144| 906|void AlternativeName::decode_from(BER_Decoder& source) { 145| 906| BER_Decoder names = source.start_sequence(); 146| | 147| 1.73k| while(names.more_items()) { ------------------ | Branch (147:10): [True: 827, False: 903] ------------------ 148| 827| const BER_Object obj = names.get_next_object(); 149| | 150| 827| if(obj.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (150:10): [True: 11, False: 816] ------------------ 151| 11| BER_Decoder othername(obj, names.limits()); 152| | 153| 11| OID oid; 154| 11| othername.decode(oid); 155| 11| if(othername.more_items()) { ------------------ | Branch (155:13): [True: 0, False: 11] ------------------ 156| 0| const BER_Object othername_value_outer = othername.get_next_object(); 157| 0| othername.verify_end(); 158| | 159| 0| if(!othername_value_outer.is_a(0, ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (159:16): [True: 0, False: 0] ------------------ 160| 0| throw Decoding_Error("Invalid tags on otherName value"); 161| 0| } 162| | 163| 0| BER_Decoder othername_value_inner(othername_value_outer, names.limits()); 164| | 165| 0| const BER_Object value = othername_value_inner.get_next_object(); 166| 0| othername_value_inner.verify_end(); 167| | 168| | // Capture the inner ANY value verbatim so applications can retrieve 169| | // it regardless of its ASN.1 form. 170| 0| std::vector raw_value; 171| 0| DER_Encoder(raw_value).add_object(value.type_tag(), value.class_tag(), value.data()); 172| 0| m_other_name_values.insert(OtherNameValue{oid, std::move(raw_value)}); 173| | 174| | // Populate old string view for compatibility 175| 0| if(ASN1_String::is_string_type(value.type()) && value.get_class() == ASN1_Class::Universal) { ------------------ | Branch (175:16): [True: 0, False: 0] | Branch (175:61): [True: 0, False: 0] ------------------ 176| 0| try { 177| 0| m_othernames.insert(std::make_pair(oid, ASN1_String(ASN1::to_string(value), value.type()))); 178| 0| } catch(const Invalid_Argument&) { // NOLINT(*-empty-catch) 179| 0| } 180| 0| } 181| 0| } 182| 816| } else if(obj.is_a(1, ASN1_Class::ContextSpecific)) { ------------------ | Branch (182:17): [True: 50, False: 766] ------------------ 183| 50| add_email(ASN1::to_string(obj)); 184| 766| } else if(obj.is_a(2, ASN1_Class::ContextSpecific)) { ------------------ | Branch (184:17): [True: 372, False: 394] ------------------ 185| 372| m_dns.insert(check_and_canonicalize_dns_name(ASN1::to_string(obj))); 186| 394| } else if(obj.is_a(4, ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (186:17): [True: 9, False: 385] ------------------ 187| 9| BER_Decoder dec(obj, names.limits()); 188| 9| X509_DN dn; 189| 9| dec.decode(dn).verify_end(); 190| 9| this->add_dn(dn); 191| 385| } else if(obj.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (191:17): [True: 30, False: 355] ------------------ 192| 30| this->add_uri(ASN1::to_string(obj)); 193| 355| } else if(obj.is_a(7, ASN1_Class::ContextSpecific)) { ------------------ | Branch (193:17): [True: 26, False: 329] ------------------ 194| 26| if(obj.length() == 4) { ------------------ | Branch (194:13): [True: 18, False: 8] ------------------ 195| 18| const uint32_t ip = load_be(obj.bits(), 0); 196| 18| this->add_ipv4_address(ip); 197| 18| } else if(obj.length() == 16) { ------------------ | Branch (197:20): [True: 5, False: 3] ------------------ 198| 5| const IPv6Address ip(std::span{obj.bits(), 16}); 199| 5| this->add_ipv6_address(ip); 200| 5| } else { 201| 3| throw Decoding_Error("Invalid IP constraint neither IPv4 or IPv6"); 202| 3| } 203| 329| } else if(obj.is_a(8, ASN1_Class::ContextSpecific)) { ------------------ | Branch (203:17): [True: 0, False: 329] ------------------ 204| | // [8] registeredID is IMPLICIT OBJECT IDENTIFIER. 205| 0| OID oid; 206| 0| names.decode_implicit(obj, oid, ASN1_Type::ObjectId, ASN1_Class::Universal); 207| 0| this->add_registered_id(oid); 208| 0| } 209| 827| } 210| 906|} _ZN5Botan9to_stringENS_23Certificate_Status_CodeE: 11| 361|const char* to_string(Certificate_Status_Code code) { 12| 361| switch(code) { ------------------ | Branch (12:11): [True: 361, False: 0] ------------------ 13| 0| case Certificate_Status_Code::VERIFIED: ------------------ | Branch (13:7): [True: 0, False: 361] ------------------ 14| 0| return "Verified"; 15| 0| case Certificate_Status_Code::OCSP_RESPONSE_GOOD: ------------------ | Branch (15:7): [True: 0, False: 361] ------------------ 16| 0| return "OCSP response accepted as affirming unrevoked status for certificate"; 17| 0| case Certificate_Status_Code::OCSP_SIGNATURE_OK: ------------------ | Branch (17:7): [True: 0, False: 361] ------------------ 18| 0| return "Signature on OCSP response was found valid"; 19| 0| case Certificate_Status_Code::VALID_CRL_CHECKED: ------------------ | Branch (19:7): [True: 0, False: 361] ------------------ 20| 0| return "Valid CRL examined"; 21| | 22| 0| case Certificate_Status_Code::CERT_SERIAL_NEGATIVE: ------------------ | Branch (22:7): [True: 0, False: 361] ------------------ 23| 0| return "Certificate serial number is negative"; 24| 0| case Certificate_Status_Code::DN_TOO_LONG: ------------------ | Branch (24:7): [True: 0, False: 361] ------------------ 25| 0| return "Distinguished name too long"; 26| 0| case Certificate_Status_Code::OCSP_NO_REVOCATION_URL: ------------------ | Branch (26:7): [True: 0, False: 361] ------------------ 27| 0| return "OCSP URL not available"; 28| 0| case Certificate_Status_Code::OCSP_SERVER_NOT_AVAILABLE: ------------------ | Branch (28:7): [True: 0, False: 361] ------------------ 29| 0| return "OCSP server not available"; 30| 0| case Certificate_Status_Code::TRUSTED_CERT_NOT_YET_VALID: ------------------ | Branch (30:7): [True: 0, False: 361] ------------------ 31| 0| return "Trusted certificate is not yet valid"; 32| 0| case Certificate_Status_Code::TRUSTED_CERT_HAS_EXPIRED: ------------------ | Branch (32:7): [True: 0, False: 361] ------------------ 33| 0| return "Trusted certificate has expired"; 34| 0| case Certificate_Status_Code::OCSP_ISSUER_NOT_TRUSTED: ------------------ | Branch (34:7): [True: 0, False: 361] ------------------ 35| 0| return "OCSP issuer is not trustworthy"; 36| | 37| 0| case Certificate_Status_Code::NO_REVOCATION_DATA: ------------------ | Branch (37:7): [True: 0, False: 361] ------------------ 38| 0| return "No revocation data"; 39| 0| case Certificate_Status_Code::SIGNATURE_METHOD_TOO_WEAK: ------------------ | Branch (39:7): [True: 0, False: 361] ------------------ 40| 0| return "Signature method too weak"; 41| 0| case Certificate_Status_Code::UNTRUSTED_HASH: ------------------ | Branch (41:7): [True: 0, False: 361] ------------------ 42| 0| return "Hash function used is considered too weak for security"; 43| | 44| 0| case Certificate_Status_Code::CERT_NOT_YET_VALID: ------------------ | Branch (44:7): [True: 0, False: 361] ------------------ 45| 0| return "Certificate is not yet valid"; 46| 0| case Certificate_Status_Code::CERT_HAS_EXPIRED: ------------------ | Branch (46:7): [True: 0, False: 361] ------------------ 47| 0| return "Certificate has expired"; 48| 0| case Certificate_Status_Code::OCSP_NOT_YET_VALID: ------------------ | Branch (48:7): [True: 0, False: 361] ------------------ 49| 0| return "OCSP is not yet valid"; 50| 0| case Certificate_Status_Code::OCSP_HAS_EXPIRED: ------------------ | Branch (50:7): [True: 0, False: 361] ------------------ 51| 0| return "OCSP response has expired"; 52| 0| case Certificate_Status_Code::OCSP_IS_TOO_OLD: ------------------ | Branch (52:7): [True: 0, False: 361] ------------------ 53| 0| return "OCSP response is too old"; 54| 0| case Certificate_Status_Code::CRL_NOT_YET_VALID: ------------------ | Branch (54:7): [True: 0, False: 361] ------------------ 55| 0| return "CRL response is not yet valid"; 56| 0| case Certificate_Status_Code::CRL_HAS_EXPIRED: ------------------ | Branch (56:7): [True: 0, False: 361] ------------------ 57| 0| return "CRL has expired"; 58| | 59| 292| case Certificate_Status_Code::CERT_ISSUER_NOT_FOUND: ------------------ | Branch (59:7): [True: 292, False: 69] ------------------ 60| 292| return "Certificate issuer not found"; 61| 69| case Certificate_Status_Code::CANNOT_ESTABLISH_TRUST: ------------------ | Branch (61:7): [True: 69, False: 292] ------------------ 62| 69| return "Cannot establish trust"; 63| 0| case Certificate_Status_Code::CERT_CHAIN_LOOP: ------------------ | Branch (63:7): [True: 0, False: 361] ------------------ 64| 0| return "Loop in certificate chain"; 65| 0| case Certificate_Status_Code::CHAIN_LACKS_TRUST_ROOT: ------------------ | Branch (65:7): [True: 0, False: 361] ------------------ 66| 0| return "Certificate chain does not end in a CA certificate"; 67| 0| case Certificate_Status_Code::CHAIN_NAME_MISMATCH: ------------------ | Branch (67:7): [True: 0, False: 361] ------------------ 68| 0| return "Certificate issuer does not match subject of issuing cert"; 69| | 70| 0| case Certificate_Status_Code::POLICY_ERROR: ------------------ | Branch (70:7): [True: 0, False: 361] ------------------ 71| 0| return "Certificate policy error"; 72| 0| case Certificate_Status_Code::DUPLICATE_CERT_POLICY: ------------------ | Branch (72:7): [True: 0, False: 361] ------------------ 73| 0| return "Certificate contains duplicate policy"; 74| 0| case Certificate_Status_Code::EXTENSION_ENCODING_ERROR: ------------------ | Branch (74:7): [True: 0, False: 361] ------------------ 75| 0| return "Certificate extension encoding error"; 76| 0| case Certificate_Status_Code::INVALID_USAGE: ------------------ | Branch (76:7): [True: 0, False: 361] ------------------ 77| 0| return "Certificate does not allow the requested usage"; 78| 0| case Certificate_Status_Code::CERT_CHAIN_TOO_LONG: ------------------ | Branch (78:7): [True: 0, False: 361] ------------------ 79| 0| return "Certificate chain too long"; 80| 0| case Certificate_Status_Code::CA_CERT_NOT_FOR_CERT_ISSUER: ------------------ | Branch (80:7): [True: 0, False: 361] ------------------ 81| 0| return "CA certificate not allowed to issue certs"; 82| 0| case Certificate_Status_Code::CA_CERT_NOT_FOR_CRL_ISSUER: ------------------ | Branch (82:7): [True: 0, False: 361] ------------------ 83| 0| return "CA certificate not allowed to issue CRLs"; 84| 0| case Certificate_Status_Code::NO_MATCHING_CRLDP: ------------------ | Branch (84:7): [True: 0, False: 361] ------------------ 85| 0| return "No CRL with matching distribution point for certificate"; 86| 0| case Certificate_Status_Code::OCSP_CERT_NOT_LISTED: ------------------ | Branch (86:7): [True: 0, False: 361] ------------------ 87| 0| return "OCSP cert not listed"; 88| 0| case Certificate_Status_Code::OCSP_BAD_STATUS: ------------------ | Branch (88:7): [True: 0, False: 361] ------------------ 89| 0| return "OCSP bad status"; 90| 0| case Certificate_Status_Code::CERT_NAME_NOMATCH: ------------------ | Branch (90:7): [True: 0, False: 361] ------------------ 91| 0| return "Certificate does not match provided name"; 92| 0| case Certificate_Status_Code::NAME_CONSTRAINT_ERROR: ------------------ | Branch (92:7): [True: 0, False: 361] ------------------ 93| 0| return "Certificate does not pass name constraint"; 94| 0| case Certificate_Status_Code::IPADDR_BLOCKS_ERROR: ------------------ | Branch (94:7): [True: 0, False: 361] ------------------ 95| 0| return "IP Address Blocks extension invalid"; 96| 0| case Certificate_Status_Code::AS_BLOCKS_ERROR: ------------------ | Branch (96:7): [True: 0, False: 361] ------------------ 97| 0| return "AS Number Blocks extension invalid"; 98| 0| case Certificate_Status_Code::NO_REV_AVAIL_INVALID_USE: ------------------ | Branch (98:7): [True: 0, False: 361] ------------------ 99| 0| return "noRevAvail extension used in an invalid manner"; 100| 0| case Certificate_Status_Code::UNKNOWN_CRITICAL_EXTENSION: ------------------ | Branch (100:7): [True: 0, False: 361] ------------------ 101| 0| return "Unknown critical extension encountered"; 102| 0| case Certificate_Status_Code::DUPLICATE_CERT_EXTENSION: ------------------ | Branch (102:7): [True: 0, False: 361] ------------------ 103| 0| return "Duplicate certificate extension encountered"; 104| 0| case Certificate_Status_Code::EXT_IN_V1_V2_CERT: ------------------ | Branch (104:7): [True: 0, False: 361] ------------------ 105| 0| return "Encountered extension in certificate with version that does not allow it"; 106| 0| case Certificate_Status_Code::V2_IDENTIFIERS_IN_V1_CERT: ------------------ | Branch (106:7): [True: 0, False: 361] ------------------ 107| 0| return "Encountered v2 identifiers in v1 certificate"; 108| 0| case Certificate_Status_Code::OCSP_SIGNATURE_ERROR: ------------------ | Branch (108:7): [True: 0, False: 361] ------------------ 109| 0| return "OCSP signature error"; 110| 0| case Certificate_Status_Code::OCSP_ISSUER_NOT_FOUND: ------------------ | Branch (110:7): [True: 0, False: 361] ------------------ 111| 0| return "Unable to find certificate issuing OCSP response"; 112| 0| case Certificate_Status_Code::OCSP_RESPONSE_MISSING_KEYUSAGE: ------------------ | Branch (112:7): [True: 0, False: 361] ------------------ 113| 0| return "OCSP issuer's keyusage prohibits OCSP"; 114| 0| case Certificate_Status_Code::OCSP_RESPONSE_INVALID: ------------------ | Branch (114:7): [True: 0, False: 361] ------------------ 115| 0| return "OCSP response was unparsable or had invalid encoding"; 116| 0| case Certificate_Status_Code::OCSP_NO_HTTP: ------------------ | Branch (116:7): [True: 0, False: 361] ------------------ 117| 0| return "OCSP requests not available, no HTTP support compiled in"; 118| 0| case Certificate_Status_Code::CERT_IS_REVOKED: ------------------ | Branch (118:7): [True: 0, False: 361] ------------------ 119| 0| return "Certificate is revoked"; 120| 0| case Certificate_Status_Code::CRL_BAD_SIGNATURE: ------------------ | Branch (120:7): [True: 0, False: 361] ------------------ 121| 0| return "CRL bad signature"; 122| 0| case Certificate_Status_Code::SIGNATURE_ERROR: ------------------ | Branch (122:7): [True: 0, False: 361] ------------------ 123| 0| return "Signature error"; 124| 0| case Certificate_Status_Code::CERT_PUBKEY_INVALID: ------------------ | Branch (124:7): [True: 0, False: 361] ------------------ 125| 0| return "Certificate public key invalid"; 126| 0| case Certificate_Status_Code::SIGNATURE_ALGO_UNKNOWN: ------------------ | Branch (126:7): [True: 0, False: 361] ------------------ 127| 0| return "Certificate signed with unknown/unavailable algorithm"; 128| 0| case Certificate_Status_Code::SIGNATURE_ALGO_BAD_PARAMS: ------------------ | Branch (128:7): [True: 0, False: 361] ------------------ 129| 0| return "Certificate signature has invalid parameters"; 130| 0| case Certificate_Status_Code::EXCEEDED_SEARCH_LIMITS: ------------------ | Branch (130:7): [True: 0, False: 361] ------------------ 131| 0| return "Exceeded search limitations while pathfinding"; 132| | 133| | // intentionally no default so we are warned if new enum values are added 134| 361| } 135| | 136| 0| return nullptr; 137| 361|} _ZN5Botan17Certificate_StoreD2Ev: 22| 722|Certificate_Store::~Certificate_Store() = default; _ZN5Botan27Certificate_Store_In_MemoryC2Ev: 63| 722|Certificate_Store_In_Memory::Certificate_Store_In_Memory() : m_impl(std::make_unique()) {} _ZN5Botan27Certificate_Store_In_MemoryD2Ev: 73| 722|Certificate_Store_In_Memory::~Certificate_Store_In_Memory() = default; _ZNK5Botan27Certificate_Store_In_Memory4implEv: 80| 292|const Certificate_Store_In_Memory::Impl& Certificate_Store_In_Memory::impl() const { 81| 292| BOTAN_STATE_CHECK(m_impl != nullptr); ------------------ | | 51| 292| do { \ | | 52| 292| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 53| 292| if(!(expr)) { \ | | ------------------ | | | Branch (53:10): [True: 0, False: 292] | | ------------------ | | 54| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 55| 0| Botan::throw_invalid_state(#expr, __func__, __FILE__); \ | | 56| 0| } \ | | 57| 292| } while(0) | | ------------------ | | | Branch (57:12): [Folded, False: 292] | | ------------------ ------------------ 82| 292| return *m_impl; 83| 292|} _ZNK5Botan27Certificate_Store_In_Memory14find_all_certsERKNS_7X509_DNERKNSt3__16vectorIhNS4_9allocatorIhEEEE: 132| 292| const std::vector& key_id) const { 133| 292| const auto& store = impl(); 134| 292| std::vector matches; 135| | 136| 292| const auto it = store.m_dn_to_indices.find(subject_dn); 137| 292| if(it == store.m_dn_to_indices.end()) { ------------------ | Branch (137:7): [True: 292, False: 0] ------------------ 138| 292| return matches; 139| 292| } 140| | 141| 0| for(const size_t idx : it->second) { ------------------ | Branch (141:25): [True: 0, False: 0] ------------------ 142| 0| const auto& cert = store.m_certs[idx]; 143| 0| BOTAN_ASSERT_NOMSG(cert.subject_dn() == subject_dn); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 144| | 145| 0| if(!key_id.empty()) { ------------------ | Branch (145:10): [True: 0, False: 0] ------------------ 146| 0| const std::vector& skid = cert.subject_key_id(); 147| 0| if(!skid.empty() && skid != key_id) { // no match ------------------ | Branch (147:13): [True: 0, False: 0] | Branch (147:30): [True: 0, False: 0] ------------------ 148| 0| continue; 149| 0| } 150| 0| } 151| | 152| 0| matches.push_back(cert); 153| 0| } 154| | 155| 0| return matches; 156| 292|} _ZN5Botan13x500_name_cmpENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEES4_: 82| 935|bool x500_name_cmp(std::string_view name1, std::string_view name2) { 83| 935| X500_Char_Iterator it1(name1); 84| 935| X500_Char_Iterator it2(name2); 85| | 86| 7.30k| while(true) { ------------------ | Branch (86:10): [True: 7.30k, Folded] ------------------ 87| 7.30k| const auto c1 = it1.next(); 88| 7.30k| const auto c2 = it2.next(); 89| | 90| 7.30k| if(c1 != c2) { ------------------ | Branch (90:10): [True: 358, False: 6.94k] ------------------ 91| 358| return false; 92| 358| } 93| 6.94k| if(!c1.has_value() && !c2.has_value()) { ------------------ | Branch (93:10): [True: 577, False: 6.36k] | Branch (93:29): [True: 577, False: 0] ------------------ 94| 577| return true; 95| 577| } 96| 6.94k| } 97| 935|} _ZN5Botan7X509_DN13add_attributeERKNS_3OIDERKNS_11ASN1_StringE: 109| 6.65k|void X509_DN::add_attribute(const OID& oid, const ASN1_String& str) { 110| 6.65k| if(str.empty()) { ------------------ | Branch (110:7): [True: 0, False: 6.65k] ------------------ 111| 0| return; 112| 0| } 113| | 114| 6.65k| m_rdn.push_back(std::make_pair(oid, str)); 115| 6.65k| m_dn_bits.clear(); 116| 6.65k|} _ZNK5Botan7X509_DN14get_attributesEv: 121| 1.84k|std::multimap X509_DN::get_attributes() const { 122| 1.84k| std::multimap retval; 123| | 124| 2.26k| for(const auto& i : m_rdn) { ------------------ | Branch (124:22): [True: 2.26k, False: 1.84k] ------------------ 125| 2.26k| retval.emplace(i.first, i.second.value()); 126| 2.26k| } 127| 1.84k| return retval; 128| 1.84k|} _ZN5BotaneqERKNS_7X509_DNES2_: 229| 924|bool operator==(const X509_DN& dn1, const X509_DN& dn2) { 230| 924| auto attr1 = dn1.get_attributes(); 231| 924| auto attr2 = dn2.get_attributes(); 232| | 233| 924| if(attr1.size() != attr2.size()) { ------------------ | Branch (233:7): [True: 0, False: 924] ------------------ 234| 0| return false; 235| 0| } 236| | 237| 924| auto p1 = attr1.begin(); 238| 924| auto p2 = attr2.begin(); 239| | 240| 1.50k| while(true) { ------------------ | Branch (240:10): [True: 1.50k, Folded] ------------------ 241| 1.50k| if(p1 == attr1.end() && p2 == attr2.end()) { ------------------ | Branch (241:10): [True: 418, False: 1.08k] | Branch (241:10): [True: 418, False: 1.08k] | Branch (241:31): [True: 418, False: 0] ------------------ 242| 418| break; 243| 418| } 244| 1.08k| if(p1 == attr1.end()) { ------------------ | Branch (244:10): [True: 0, False: 1.08k] ------------------ 245| 0| return false; 246| 0| } 247| 1.08k| if(p2 == attr2.end()) { ------------------ | Branch (247:10): [True: 0, False: 1.08k] ------------------ 248| 0| return false; 249| 0| } 250| 1.08k| if(p1->first != p2->first) { ------------------ | Branch (250:10): [True: 148, False: 935] ------------------ 251| 148| return false; 252| 148| } 253| 935| if(!x500_name_cmp(p1->second, p2->second)) { ------------------ | Branch (253:10): [True: 358, False: 577] ------------------ 254| 358| return false; 255| 358| } 256| 577| ++p1; 257| 577| ++p2; 258| 577| } 259| 418| return true; 260| 924|} _ZN5Botan7X509_DN11decode_fromERNS_11BER_DecoderE: 338| 5.56k|void X509_DN::decode_from(BER_Decoder& source) { 339| 5.56k| std::vector bits; 340| | 341| 5.56k| source.start_sequence().raw_bytes(bits).end_cons(); 342| | 343| 5.56k| BER_Decoder sequence(bits, source.limits()); 344| | 345| 5.56k| m_rdn.clear(); 346| | 347| 13.5k| while(sequence.more_items()) { ------------------ | Branch (347:10): [True: 7.96k, False: 5.56k] ------------------ 348| 7.96k| BER_Decoder rdn = sequence.start_set(); 349| | 350| 15.9k| while(rdn.more_items()) { ------------------ | Branch (350:13): [True: 7.93k, False: 7.96k] ------------------ 351| 7.93k| OID oid; 352| 7.93k| ASN1_String str; 353| | 354| 7.93k| rdn.start_sequence() 355| 7.93k| .decode(oid) 356| 7.93k| .decode(str) // TODO support Any 357| 7.93k| .end_cons(); 358| | 359| 7.93k| add_attribute(oid, str); 360| 7.93k| } 361| 7.96k| } 362| | 363| | // Have to assign last as add_attribute zaps m_dn_bits 364| 5.56k| m_dn_bits = bits; 365| 5.56k|} x509_dn.cpp:_ZN5Botan12_GLOBAL__N_118X500_Char_IteratorC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE: 30| 1.87k| explicit X500_Char_Iterator(std::string_view s) : m_str(s), m_pos(0) { 31| | // Skip leading whitespace 32| 1.93k| while(m_pos < m_str.size() && is_space(m_str[m_pos])) { ------------------ | Branch (32:16): [True: 1.93k, False: 2] | Branch (32:40): [True: 65, False: 1.86k] ------------------ 33| 65| ++m_pos; 34| 65| } 35| 1.87k| } x509_dn.cpp:_ZN5Botan12_GLOBAL__N_118X500_Char_Iterator4nextEv: 38| 14.6k| std::optional next() { 39| 14.6k| if(m_pos >= m_str.size()) { ------------------ | Branch (39:13): [True: 1.16k, False: 13.4k] ------------------ 40| 1.16k| return std::nullopt; 41| 1.16k| } 42| | 43| 13.4k| if(is_space(m_str[m_pos])) { ------------------ | Branch (43:13): [True: 1.55k, False: 11.8k] ------------------ 44| | // Skip the entire whitespace run 45| 3.16k| while(m_pos < m_str.size() && is_space(m_str[m_pos])) { ------------------ | Branch (45:19): [True: 3.15k, False: 3] | Branch (45:43): [True: 1.60k, False: 1.55k] ------------------ 46| 1.60k| ++m_pos; 47| 1.60k| } 48| | // Emit a single space only if more content follows (strip trailing ws) 49| 1.55k| if(m_pos < m_str.size()) { ------------------ | Branch (49:16): [True: 1.55k, False: 3] ------------------ 50| 1.55k| return ' '; 51| 1.55k| } 52| 3| return std::nullopt; 53| 1.55k| } 54| | 55| 11.8k| const char c = m_str[m_pos++]; 56| | // Locale-independent ASCII fold; RFC 5280 DN matching does not depend on libc locale 57| 11.8k| if(c >= 'A' && c <= 'Z') { ------------------ | Branch (57:13): [True: 11.6k, False: 222] | Branch (57:25): [True: 3.79k, False: 7.87k] ------------------ 58| 3.79k| return static_cast(c + ('a' - 'A')); 59| 3.79k| } 60| 8.09k| return c; 61| 11.8k| } x509_dn.cpp:_ZN5Botan12_GLOBAL__N_18is_spaceEc: 21| 18.5k|bool is_space(char c) { 22| 18.5k| return c == ' ' || c == '\t'; ------------------ | Branch (22:11): [True: 3.19k, False: 15.3k] | Branch (22:23): [True: 36, False: 15.3k] ------------------ 23| 18.5k|} _ZN5Botan10Extensions15create_extn_objERKNS_3OIDEbRKNSt3__16vectorIhNS4_9allocatorIhEEEE: 130| 4.11k| const std::vector& body) { 131| 4.11k| auto extn = extension_from_oid(oid); 132| | 133| 4.11k| if(!extn) { ------------------ | Branch (133:7): [True: 424, False: 3.69k] ------------------ 134| | // some other unknown extension type 135| 424| extn = std::make_unique(oid, critical); 136| 3.69k| } else { 137| 3.69k| try { 138| 3.69k| extn->decode_inner(body); 139| 3.69k| return extn; 140| 3.69k| } catch(const Exception&) { 141| | // OID was recognized but contents failed to decode 142| 1.41k| extn = std::make_unique(oid, critical, /*failed_to_decode=*/true); 143| 1.41k| } 144| 3.69k| } 145| | 146| | // This is always Unknown_Extension: 147| 1.84k| extn->decode_inner(body); 148| 1.84k| return extn; 149| 4.11k|} _ZNK5Botan10Extensions15Extensions_Info3objEv: 151| 3.18k|const Certificate_Extension& Extensions::Extensions_Info::obj() const { 152| 3.18k| BOTAN_ASSERT_NONNULL(m_obj.get()); ------------------ | | 116| 3.18k| do { \ | | 117| 3.18k| if((ptr) == nullptr) { \ | | ------------------ | | | Branch (117:10): [True: 0, False: 3.18k] | | ------------------ | | 118| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 119| 0| Botan::assertion_failure(#ptr " is not null", "", __func__, __FILE__, __LINE__); \ | | 120| 0| } \ | | 121| 3.18k| } while(0) | | ------------------ | | | Branch (121:12): [Folded, False: 3.18k] | | ------------------ ------------------ 153| 3.18k| return *m_obj; 154| 3.18k|} _ZNK5Botan10Extensions13extension_setERKNS_3OIDE: 213| 924|bool Extensions::extension_set(const OID& oid) const { 214| 924| return m_extension_info.contains(oid); 215| 924|} _ZNK5Botan10Extensions20get_extension_objectERKNS_3OIDE: 234| 10.1k|const Certificate_Extension* Extensions::get_extension_object(const OID& oid) const { 235| 10.1k| auto extn = m_extension_info.find(oid); 236| 10.1k| if(extn == m_extension_info.end()) { ------------------ | Branch (236:7): [True: 6.97k, False: 3.18k] ------------------ 237| 6.97k| return nullptr; 238| 6.97k| } 239| | 240| 3.18k| return &extn->second.obj(); 241| 10.1k|} _ZN5Botan10Extensions11decode_fromERNS_11BER_DecoderE: 290| 1.10k|void Extensions::decode_from(BER_Decoder& from_source) { 291| 1.10k| m_extension_oids.clear(); 292| 1.10k| m_extension_info.clear(); 293| | 294| 1.10k| BER_Decoder sequence = from_source.start_sequence(); 295| | 296| 5.21k| while(sequence.more_items()) { ------------------ | Branch (296:10): [True: 4.20k, False: 1.00k] ------------------ 297| 4.20k| OID oid; 298| 4.20k| bool critical = false; 299| 4.20k| std::vector bits; 300| | 301| 4.20k| sequence.start_sequence() 302| 4.20k| .decode(oid) 303| 4.20k| .decode_optional(critical, ASN1_Type::Boolean, ASN1_Class::Universal, false) 304| 4.20k| .decode(bits, ASN1_Type::OctetString) 305| 4.20k| .end_cons(); 306| | 307| 4.20k| auto obj = create_extn_obj(oid, critical, bits); 308| 4.20k| Extensions_Info info(critical, bits, std::move(obj)); 309| | 310| | // RFC 5280 4.2: "A certificate MUST NOT include more than one 311| | // instance of a particular extension." 312| 4.20k| if(!m_extension_info.emplace(oid, info).second) { ------------------ | Branch (312:10): [True: 92, False: 4.10k] ------------------ 313| 92| throw Decoding_Error("Duplicate certificate extension encountered"); 314| 92| } 315| 4.10k| m_extension_oids.push_back(oid); 316| 4.10k| } 317| 1.00k| sequence.verify_end(); 318| 1.00k|} _ZN5Botan14Cert_Extension17Basic_ConstraintsC2Ebm: 323| 834| Basic_Constraints(is_ca, is_ca ? std::optional(path_length_constraint) : std::nullopt) {} ------------------ | Branch (323:32): [True: 0, False: 834] ------------------ _ZN5Botan14Cert_Extension17Basic_ConstraintsC2EbNSt3__18optionalImEE: 326| 834| m_is_ca(is_ca), m_path_length_constraint(path_length_constraint) { 327| 834| if(!m_is_ca && m_path_length_constraint.has_value()) { ------------------ | Branch (327:7): [True: 834, False: 0] | Branch (327:19): [True: 0, False: 834] ------------------ 328| | // RFC 5280 Sec 4.2.1.9 "CAs MUST NOT include the pathLenConstraint field unless the cA boolean is asserted" 329| 0| throw Invalid_Argument( 330| 0| "Basic_Constraints nonsensical to set a path length constraint for a non-CA basicConstraints"); 331| 0| } 332| 834|} _ZN5Botan14Cert_Extension17Basic_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 363| 834|void Basic_Constraints::decode_inner(const std::vector& in) { 364| | /* 365| | * RFC 5280 Section 4.2.1.9 366| | * 367| | * BasicConstraints ::= SEQUENCE { 368| | * cA BOOLEAN DEFAULT FALSE, 369| | * pathLenConstraint INTEGER (0..MAX) OPTIONAL } 370| | */ 371| 834| BER_Decoder(in, BER_Decoder::Limits::DER()) 372| 834| .start_sequence() 373| 834| .decode_optional(m_is_ca, ASN1_Type::Boolean, ASN1_Class::Universal, false) 374| 834| .decode_optional(m_path_length_constraint, ASN1_Type::Integer, ASN1_Class::Universal) 375| 834| .end_cons() 376| 834| .verify_end(); 377| | 378| | /* RFC 5280 Section 4.2.1.9: 379| | * "CAs MUST NOT include the pathLenConstraint field unless the cA boolean 380| | * is asserted and the key usage extension asserts the keyCertSign bit" */ 381| 834| if(!m_is_ca && m_path_length_constraint.has_value()) { ------------------ | Branch (381:7): [True: 642, False: 192] | Branch (381:19): [True: 0, False: 642] ------------------ 382| 0| throw Decoding_Error("BasicConstraints pathLenConstraint must not be present when cA is FALSE"); 383| 0| } 384| 834|} _ZN5Botan14Cert_Extension9Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 412| 774|void Key_Usage::decode_inner(const std::vector& in) { 413| | /* RFC 5280 Section 4.2.1.3 - KeyUsage ::= BIT STRING */ 414| 774| std::vector bits; 415| 774| BER_Decoder(in, BER_Decoder::Limits::DER()) 416| 774| .decode(bits, ASN1_Type::BitString, ASN1_Type::BitString, ASN1_Class::Universal) 417| 774| .verify_end(); 418| | 419| 774| const uint16_t usage = [&bits]() -> uint16_t { 420| 774| switch(bits.size()) { 421| 774| case 0: 422| 774| return 0; 423| 774| case 1: 424| 774| return make_uint16(bits[0], 0); 425| 774| case 2: 426| 774| return make_uint16(bits[0], bits[1]); 427| 774| default: 428| 774| throw Decoding_Error("Invalid KeyUsage bitstring encoding"); 429| 774| } 430| 774| }(); 431| | 432| | /* RFC 5280 Section 4.2.1.3: 433| | * "When the keyUsage extension appears in a certificate, at least one of 434| | * the bits MUST be set to 1." */ 435| 774| if(usage == 0) { ------------------ | Branch (435:7): [True: 0, False: 774] ------------------ 436| 0| throw Decoding_Error("KeyUsage extension must have at least one bit set"); 437| 0| } 438| | 439| 774| m_constraints = Key_Constraints(usage); 440| 774|} _ZN5Botan14Cert_Extension14Subject_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 454| 69|void Subject_Key_ID::decode_inner(const std::vector& in) { 455| | /* RFC 5280 Section 4.2.1.2 - SubjectKeyIdentifier ::= KeyIdentifier */ 456| 69| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_key_id, ASN1_Type::OctetString).verify_end(); 457| | 458| 69| if(m_key_id.empty()) { ------------------ | Branch (458:7): [True: 0, False: 69] ------------------ 459| 0| throw Decoding_Error("SubjectKeyIdentifier must not be empty"); 460| 0| } 461| 69| if(m_key_id.size() > MaximumKeyIdentifierLength) { ------------------ | Branch (461:7): [True: 0, False: 69] ------------------ 462| 0| throw Decoding_Error( 463| 0| fmt("SubjectKeyIdentifier length {} exceeds limit of {} bytes", m_key_id.size(), MaximumKeyIdentifierLength)); 464| 0| } 465| 69|} _ZN5Botan14Cert_Extension16Authority_Key_ID12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 500| 60|void Authority_Key_ID::decode_inner(const std::vector& in) { 501| | /* 502| | * RFC 5280 Section 4.2.1.1 503| | * 504| | * AuthorityKeyIdentifier ::= SEQUENCE { 505| | * keyIdentifier [0] KeyIdentifier OPTIONAL, 506| | * authorityCertIssuer [1] GeneralNames OPTIONAL, 507| | * authorityCertSerialNumber [2] CertificateSerialNumber OPTIONAL } 508| | */ 509| 60| BER_Decoder ber(in, BER_Decoder::Limits::DER()); 510| 60| BER_Decoder seq = ber.start_sequence(); 511| | 512| 60| const bool key_id_present = seq.peek_next_object().is_a(0, ASN1_Class::ContextSpecific); 513| | 514| 60| seq.decode_optional_string(m_key_id, ASN1_Type::OctetString, 0).discard_remaining().end_cons(); 515| 60| ber.verify_end(); 516| | 517| 60| if(key_id_present) { ------------------ | Branch (517:7): [True: 26, False: 34] ------------------ 518| 26| if(m_key_id.empty()) { ------------------ | Branch (518:10): [True: 1, False: 25] ------------------ 519| 1| throw Decoding_Error("AuthorityKeyIdentifier keyIdentifier must not be empty"); 520| 1| } 521| 25| if(m_key_id.size() > MaximumKeyIdentifierLength) { ------------------ | Branch (521:10): [True: 0, False: 25] ------------------ 522| 0| throw Decoding_Error(fmt("AuthorityKeyIdentifier keyIdentifier length {} exceeds limit of {} bytes", 523| 0| m_key_id.size(), 524| 0| MaximumKeyIdentifierLength)); 525| 0| } 526| 25| } 527| 60|} _ZN5Botan14Cert_Extension24Subject_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 550| 797|void Subject_Alternative_Name::decode_inner(const std::vector& in) { 551| | /* RFC 5280 Section 4.2.1.6 - SubjectAltName ::= GeneralNames 552| | * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName */ 553| 797| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_alt_name).verify_end(); 554| 797| if(!m_alt_name.has_items()) { ------------------ | Branch (554:7): [True: 15, False: 782] ------------------ 555| 15| throw Decoding_Error("SubjectAlternativeName extension must contain at least one GeneralName"); 556| 15| } 557| 797|} _ZN5Botan14Cert_Extension23Issuer_Alternative_Name12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 562| 77|void Issuer_Alternative_Name::decode_inner(const std::vector& in) { 563| | /* RFC 5280 Section 4.2.1.7 - IssuerAltName ::= GeneralNames 564| | * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName */ 565| 77| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_alt_name).verify_end(); 566| 77| if(!m_alt_name.has_items()) { ------------------ | Branch (566:7): [True: 18, False: 59] ------------------ 567| 18| throw Decoding_Error("IssuerAlternativeName extension must contain at least one GeneralName"); 568| 18| } 569| 77|} _ZN5Botan14Cert_Extension18Extended_Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 583| 844|void Extended_Key_Usage::decode_inner(const std::vector& in) { 584| | /* RFC 5280 Section 4.2.1.12 - ExtKeyUsageSyntax ::= SEQUENCE SIZE (1..MAX) OF KeyPurposeId */ 585| 844| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_oids).verify_end(); 586| 844| if(m_oids.empty()) { ------------------ | Branch (586:7): [True: 1, False: 843] ------------------ 587| 1| throw Decoding_Error("ExtendedKeyUsage extension must contain at least one KeyPurposeId"); 588| 1| } 589| 844|} _ZN5Botan14Cert_Extension16Name_Constraints12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 601| 9|void Name_Constraints::decode_inner(const std::vector& in) { 602| | /* 603| | * RFC 5280 Section 4.2.1.10 604| | * 605| | * NameConstraints ::= SEQUENCE { 606| | * permittedSubtrees [0] GeneralSubtrees OPTIONAL, 607| | * excludedSubtrees [1] GeneralSubtrees OPTIONAL } 608| | */ 609| 9| BER_Decoder ber(in, BER_Decoder::Limits::DER()); 610| 9| BER_Decoder inner = ber.start_sequence(); 611| | 612| 9| std::vector permitted; 613| 9| if(inner.decode_optional_list(permitted, ASN1_Type(0), ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (613:7): [True: 0, False: 9] ------------------ 614| 0| if(permitted.empty()) { ------------------ | Branch (614:10): [True: 0, False: 0] ------------------ 615| 0| throw Decoding_Error("Empty NameConstraint permitted list"); 616| 0| } 617| 0| } 618| | 619| 9| std::vector excluded; 620| 9| if(inner.decode_optional_list(excluded, ASN1_Type(1), ASN1_Class::ExplicitContextSpecific)) { ------------------ | Branch (620:7): [True: 0, False: 9] ------------------ 621| 0| if(excluded.empty()) { ------------------ | Branch (621:10): [True: 0, False: 0] ------------------ 622| 0| throw Decoding_Error("Empty NameConstraint excluded list"); 623| 0| } 624| 0| } 625| | 626| 9| inner.end_cons(); 627| 9| ber.verify_end(); 628| | 629| 9| if(permitted.empty() && excluded.empty()) { ------------------ | Branch (629:7): [True: 0, False: 9] | Branch (629:28): [True: 0, False: 0] ------------------ 630| 0| throw Decoding_Error("Empty NameConstraint extension"); 631| 0| } 632| | 633| 9| m_name_constraints = NameConstraints(std::move(permitted), std::move(excluded)); 634| 9|} _ZN5Botan14Cert_Extension20Certificate_Policies12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 716| 31|void Certificate_Policies::decode_inner(const std::vector& in) { 717| | /* RFC 5280 Section 4.2.1.4 - CertificatePolicies ::= SEQUENCE SIZE (1..MAX) OF PolicyInformation */ 718| 31| std::vector policies; 719| | 720| 31| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(policies).verify_end(); 721| 31| if(policies.empty()) { ------------------ | Branch (721:7): [True: 0, False: 31] ------------------ 722| 0| throw Decoding_Error("CertificatePolicies extension must contain at least one PolicyInformation"); 723| 0| } 724| 31| m_oids.clear(); 725| 31| for(const auto& policy : policies) { ------------------ | Branch (725:27): [True: 0, False: 31] ------------------ 726| 0| m_oids.push_back(policy.oid()); 727| 0| } 728| 31|} _ZN5Botan14Cert_Extension28Authority_Information_Access12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 768| 29|void Authority_Information_Access::decode_inner(const std::vector& in) { 769| | /* 770| | * RFC 5280 Section 4.2.2.1 771| | * 772| | * AuthorityInfoAccessSyntax ::= SEQUENCE SIZE (1..MAX) OF AccessDescription 773| | * AccessDescription ::= SEQUENCE { 774| | * accessMethod OBJECT IDENTIFIER, 775| | * accessLocation GeneralName } 776| | */ 777| 29| BER_Decoder outer(in, BER_Decoder::Limits::DER()); 778| 29| BER_Decoder ber = outer.start_sequence(); 779| | 780| 29| const OID ocsp_responder = OID::from_string("PKIX.OCSP"); 781| 29| const OID ca_issuer = OID::from_string("PKIX.CertificateAuthorityIssuers"); 782| | 783| 29| size_t access_descriptions_seen = 0; 784| 53| while(ber.more_items()) { ------------------ | Branch (784:10): [True: 24, False: 29] ------------------ 785| 24| OID oid; 786| | 787| 24| BER_Decoder info = ber.start_sequence(); 788| | 789| 24| info.decode(oid); 790| 24| const BER_Object name = info.get_next_object(); 791| 24| info.end_cons(); 792| | 793| 24| access_descriptions_seen += 1; 794| | 795| 24| if(oid == ocsp_responder && name.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (795:10): [True: 1, False: 23] | Branch (795:35): [True: 0, False: 1] ------------------ 796| 0| m_ocsp_responders.push_back(ASN1::to_string(name)); 797| 24| } else if(oid == ca_issuer && name.is_a(6, ASN1_Class::ContextSpecific)) { ------------------ | Branch (797:17): [True: 0, False: 24] | Branch (797:37): [True: 0, False: 0] ------------------ 798| 0| m_ca_issuers.push_back(ASN1::to_string(name)); 799| 0| } 800| 24| } 801| | 802| 29| ber.end_cons(); 803| 29| outer.verify_end(); 804| | 805| 29| if(access_descriptions_seen == 0) { ------------------ | Branch (805:7): [True: 0, False: 29] ------------------ 806| 0| throw Decoding_Error("AuthorityInformationAccess extension must contain at least one AccessDescription"); 807| 0| } 808| 29|} _ZN5Botan14Cert_Extension10CRL_Number12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 842| 6|void CRL_Number::decode_inner(const std::vector& in) { 843| | /* RFC 5280 Section 5.2.3 - CRLNumber ::= INTEGER (0..MAX) */ 844| 6| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_crl_number).verify_end(); 845| 6| m_has_value = true; 846| 6|} _ZN5Botan14Cert_Extension14CRL_ReasonCode12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 860| 16|void CRL_ReasonCode::decode_inner(const std::vector& in) { 861| | /* 862| | * RFC 5280 Section 5.3.1 863| | * 864| | * CRLReason ::= ENUMERATED { 865| | * unspecified (0), 866| | * keyCompromise (1), 867| | * cACompromise (2), 868| | * affiliationChanged (3), 869| | * superseded (4), 870| | * cessationOfOperation (5), 871| | * certificateHold (6), 872| | * -- value 7 is not used 873| | * removeFromCRL (8), 874| | * privilegeWithdrawn (9), 875| | * aACompromise (10) } 876| | */ 877| 16| size_t reason_code = 0; 878| 16| BER_Decoder(in, BER_Decoder::Limits::DER()) 879| 16| .decode(reason_code, ASN1_Type::Enumerated, ASN1_Class::Universal) 880| 16| .verify_end(); 881| | 882| 16| if(reason_code == 7 || reason_code > 10) { ------------------ | Branch (882:7): [True: 14, False: 2] | Branch (882:27): [True: 2, False: 0] ------------------ 883| 2| throw Decoding_Error(fmt("CRLReason has unknown enumeration value {}", reason_code)); 884| 2| } 885| | 886| 14| m_reason = static_cast(reason_code); 887| 14|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 895| 108|void CRL_Distribution_Points::decode_inner(const std::vector& buf) { 896| | /* 897| | * RFC 5280 Section 4.2.1.13 898| | * 899| | * CRLDistributionPoints ::= SEQUENCE SIZE (1..MAX) OF DistributionPoint 900| | */ 901| 108| BER_Decoder(buf, BER_Decoder::Limits::DER()).decode_list(m_distribution_points).verify_end(); 902| | 903| 108| if(m_distribution_points.empty()) { ------------------ | Branch (903:7): [True: 2, False: 106] ------------------ 904| 2| throw Decoding_Error("CRLDistributionPoints extension must contain at least one DistributionPoint"); 905| 2| } 906| | 907| 106| for(const auto& distribution_point : m_distribution_points) { ------------------ | Branch (907:39): [True: 0, False: 106] ------------------ 908| 0| for(const auto& uri : distribution_point.point().uris()) { ------------------ | Branch (908:27): [True: 0, False: 0] ------------------ 909| 0| m_crl_distribution_urls.push_back(uri); 910| 0| } 911| 0| } 912| 106|} _ZN5Botan14Cert_Extension23CRL_Distribution_Points18Distribution_Point11decode_fromERNS_11BER_DecoderE: 932| 111|void CRL_Distribution_Points::Distribution_Point::decode_from(BER_Decoder& ber) { 933| 111| ber.start_sequence() 934| 111| .start_context_specific(0) 935| 111| .decode_optional_implicit(m_point, 936| 111| ASN1_Type(0), 937| 111| ASN1_Class::ContextSpecific | ASN1_Class::Constructed, 938| 111| ASN1_Type::Sequence, 939| 111| ASN1_Class::Constructed) 940| 111| .end_cons() 941| 111| .end_cons(); 942| 111|} _ZN5Botan14Cert_Extension30CRL_Issuing_Distribution_Point12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 948| 15|void CRL_Issuing_Distribution_Point::decode_inner(const std::vector& buf) { 949| | /* RFC 5280 Section 5.2.5 - IssuingDistributionPoint ::= SEQUENCE { ... } */ 950| 15| BER_Decoder(buf, BER_Decoder::Limits::DER()).decode(m_distribution_point).verify_end(); 951| 15|} _ZN5Botan14Cert_Extension10TNAuthList5Entry11decode_fromERNS_11BER_DecoderE: 957| 11|void TNAuthList::Entry::decode_from(class BER_Decoder& ber) { 958| 11| const BER_Object obj = ber.get_next_object(); 959| | 960| 11| if(obj.get_class() != (ASN1_Class::ContextSpecific | ASN1_Class::Constructed)) { ------------------ | Branch (960:7): [True: 11, False: 0] ------------------ 961| 11| throw Decoding_Error(fmt("Unexpected TNEntry class tag {}", static_cast(obj.get_class()))); 962| 11| } 963| | 964| 0| const uint32_t type_tag = static_cast(obj.type_tag()); 965| | 966| 0| if(type_tag == ServiceProviderCode) { ------------------ | Branch (966:7): [True: 0, False: 0] ------------------ 967| 0| m_type = ServiceProviderCode; 968| 0| ASN1_String spc_string; 969| 0| BER_Decoder(obj, ber.limits()).decode(spc_string).verify_end(); 970| 0| m_data = std::move(spc_string); 971| 0| } else if(type_tag == TelephoneNumberRange) { ------------------ | Branch (971:14): [True: 0, False: 0] ------------------ 972| 0| m_type = TelephoneNumberRange; 973| 0| m_data = RangeContainer(); 974| 0| auto& range_items = std::get(m_data); 975| 0| BER_Decoder outer(obj, ber.limits()); 976| 0| BER_Decoder list = outer.start_sequence(); 977| 0| while(list.more_items()) { ------------------ | Branch (977:13): [True: 0, False: 0] ------------------ 978| 0| TelephoneNumberRangeData entry; 979| | 980| 0| list.decode(entry.start); 981| 0| if(!is_valid_telephone_number(entry.start)) { ------------------ | Branch (981:13): [True: 0, False: 0] ------------------ 982| 0| throw Decoding_Error(fmt("Invalid TelephoneNumberRange start {}", entry.start.value())); 983| 0| } 984| | 985| 0| list.decode(entry.count); 986| 0| if(entry.count < 2) { ------------------ | Branch (986:13): [True: 0, False: 0] ------------------ 987| 0| throw Decoding_Error(fmt("Invalid TelephoneNumberRange count {}", entry.count)); 988| 0| } 989| | 990| 0| range_items.emplace_back(std::move(entry)); 991| 0| } 992| 0| list.end_cons(); 993| 0| outer.verify_end(); 994| | 995| 0| if(range_items.empty()) { ------------------ | Branch (995:10): [True: 0, False: 0] ------------------ 996| 0| throw Decoding_Error("TelephoneNumberRange is empty"); 997| 0| } 998| 0| } else if(type_tag == TelephoneNumber) { ------------------ | Branch (998:14): [True: 0, False: 0] ------------------ 999| 0| m_type = TelephoneNumber; 1000| 0| ASN1_String one_string; 1001| 0| BER_Decoder(obj, ber.limits()).decode(one_string).verify_end(); 1002| 0| if(!is_valid_telephone_number(one_string)) { ------------------ | Branch (1002:10): [True: 0, False: 0] ------------------ 1003| 0| throw Decoding_Error(fmt("Invalid TelephoneNumber {}", one_string.value())); 1004| 0| } 1005| 0| m_data = std::move(one_string); 1006| 0| } else { 1007| 0| throw Decoding_Error(fmt("Unexpected TNEntry type code {}", type_tag)); 1008| 0| }; 1009| 0|} _ZN5Botan14Cert_Extension10TNAuthList12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1015| 11|void TNAuthList::decode_inner(const std::vector& in) { 1016| | /* RFC 8226 Section 9 - TNAuthorizationList ::= SEQUENCE SIZE (1..MAX) OF TNEntry */ 1017| 11| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_tn_entries).verify_end(); 1018| 11| if(m_tn_entries.empty()) { ------------------ | Branch (1018:7): [True: 0, False: 11] ------------------ 1019| 0| throw Decoding_Error("TNAuthorizationList is empty"); 1020| 0| } 1021| 11|} _ZN5Botan14Cert_Extension15IPAddressBlocks12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1044| 7|void IPAddressBlocks::decode_inner(const std::vector& in) { 1045| | /* RFC 3779 Section 2.2.3.1 - IPAddrBlocks ::= SEQUENCE OF IPAddressFamily */ 1046| 7| BER_Decoder(in, BER_Decoder::Limits::DER()).decode_list(m_ip_addr_blocks).verify_end(); 1047| 7| sort_and_merge(); 1048| 7|} _ZN5Botan14Cert_Extension15IPAddressBlocks15IPAddressFamily11decode_fromERNS_11BER_DecoderE: 1069| 6|void IPAddressBlocks::IPAddressFamily::decode_from(Botan::BER_Decoder& from) { 1070| 6| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 1071| 6| if(next_tag != ASN1_Type::Sequence) { ------------------ | Branch (1071:7): [True: 1, False: 5] ------------------ 1072| 1| throw Decoding_Error(fmt("Unexpected type for IPAddressFamily {}", static_cast(next_tag))); 1073| 1| } 1074| | 1075| 5| BER_Decoder seq_dec = from.start_sequence(); 1076| | 1077| 5| std::vector addr_family; 1078| 5| seq_dec.decode(addr_family, ASN1_Type::OctetString); 1079| 5| const size_t addr_family_length = addr_family.size(); 1080| | 1081| 5| if(addr_family_length != 2 && addr_family_length != 3) { ------------------ | Branch (1081:7): [True: 3, False: 2] | Branch (1081:34): [True: 2, False: 1] ------------------ 1082| 2| throw Decoding_Error("(S)AFI can only contain 2 or 3 bytes"); 1083| 2| } 1084| | 1085| 3| m_afi = (addr_family[0] << 8) | addr_family[1]; 1086| | 1087| 3| if(addr_family_length == 3) { ------------------ | Branch (1087:7): [True: 1, False: 2] ------------------ 1088| 1| m_safi = addr_family[2]; 1089| 1| } 1090| | 1091| 3| if(m_afi == 1) { ------------------ | Branch (1091:7): [True: 0, False: 3] ------------------ 1092| 0| IPAddressChoice addr_choice; 1093| 0| seq_dec.decode(addr_choice); 1094| 0| m_ip_addr_choice = addr_choice; 1095| 3| } else if(m_afi == 2) { ------------------ | Branch (1095:14): [True: 0, False: 3] ------------------ 1096| 0| IPAddressChoice addr_choice; 1097| 0| seq_dec.decode(addr_choice); 1098| 0| m_ip_addr_choice = addr_choice; 1099| 3| } else { 1100| 3| throw Decoding_Error("Only AFI IPv4 and IPv6 are supported."); 1101| 3| } 1102| | 1103| 0| seq_dec.end_cons(); 1104| 0|} _ZN5Botan14Cert_Extension8ASBlocks12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1648| 5|void ASBlocks::decode_inner(const std::vector& in) { 1649| | /* RFC 3779 Section 3.2.3.1 - ASIdentifiers ::= SEQUENCE { ... } */ 1650| 5| BER_Decoder(in, BER_Decoder::Limits::DER()).decode(m_as_identifiers).verify_end(); 1651| 5|} _ZN5Botan14Cert_Extension8ASBlocks13ASIdentifiers11decode_fromERNS_11BER_DecoderE: 1686| 5|void ASBlocks::ASIdentifiers::decode_from(Botan::BER_Decoder& from) { 1687| 5| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 1688| 5| if(next_tag != ASN1_Type::Sequence) { ------------------ | Branch (1688:7): [True: 2, False: 3] ------------------ 1689| 2| throw Decoding_Error(fmt("Unexpected type for ASIdentifiers {}", static_cast(next_tag))); 1690| 2| } 1691| | 1692| 3| BER_Decoder seq_dec = from.start_sequence(); 1693| | 1694| 3| const BER_Object elem_obj = seq_dec.get_next_object(); 1695| 3| const uint32_t elem_type_tag = static_cast(elem_obj.type_tag()); 1696| | 1697| | // asnum, potentially followed by an rdi 1698| 3| if(elem_type_tag == 0) { ------------------ | Branch (1698:7): [True: 0, False: 3] ------------------ 1699| 0| BER_Decoder as_obj_ber = BER_Decoder(elem_obj, seq_dec.limits()); 1700| 0| ASIdentifierChoice asnum; 1701| 0| as_obj_ber.decode(asnum).verify_end(); 1702| 0| m_asnum = asnum; 1703| | 1704| 0| const BER_Object rdi_obj = seq_dec.get_next_object(); 1705| 0| const ASN1_Type rdi_type_tag = rdi_obj.type_tag(); 1706| 0| if(static_cast(rdi_type_tag) == 1) { ------------------ | Branch (1706:10): [True: 0, False: 0] ------------------ 1707| 0| BER_Decoder rdi_obj_ber = BER_Decoder(rdi_obj, seq_dec.limits()); 1708| 0| ASIdentifierChoice rdi; 1709| 0| rdi_obj_ber.decode(rdi).verify_end(); 1710| 0| m_rdi = rdi; 1711| 0| } else if(rdi_type_tag != ASN1_Type::NoObject) { ------------------ | Branch (1711:17): [True: 0, False: 0] ------------------ 1712| 0| throw Decoding_Error(fmt("Unexpected type for ASIdentifiers rdi: {}", static_cast(rdi_type_tag))); 1713| 0| } 1714| 0| } 1715| | 1716| | // just an rdi 1717| 3| if(elem_type_tag == 1) { ------------------ | Branch (1717:7): [True: 2, False: 1] ------------------ 1718| 2| BER_Decoder rdi_obj_ber = BER_Decoder(elem_obj, seq_dec.limits()); 1719| 2| ASIdentifierChoice rdi; 1720| 2| rdi_obj_ber.decode(rdi).verify_end(); 1721| 2| m_rdi = rdi; 1722| 2| const BER_Object end = seq_dec.get_next_object(); 1723| 2| const ASN1_Type end_type_tag = end.type_tag(); 1724| 2| if(end_type_tag != ASN1_Type::NoObject) { ------------------ | Branch (1724:10): [True: 0, False: 2] ------------------ 1725| 0| throw Decoding_Error( 1726| 0| fmt("Unexpected element with type {} in ASIdentifiers", static_cast(end_type_tag))); 1727| 0| } 1728| 2| } 1729| | 1730| 3| seq_dec.end_cons(); 1731| | 1732| 3| if(!m_asnum.has_value() && !m_rdi.has_value()) { ------------------ | Branch (1732:7): [True: 1, False: 2] | Branch (1732:31): [True: 1, False: 0] ------------------ 1733| 1| throw Decoding_Error("Invalid encoding for ASIdentifiers"); 1734| 1| } 1735| 3|} _ZN5Botan14Cert_Extension8ASBlocks18ASIdentifierChoice11decode_fromERNS_11BER_DecoderE: 1749| 2|void ASBlocks::ASIdentifierChoice::decode_from(Botan::BER_Decoder& from) { 1750| 2| const ASN1_Type next_tag = from.peek_next_object().type_tag(); 1751| | 1752| 2| if(next_tag == ASN1_Type::Null) { ------------------ | Branch (1752:7): [True: 1, False: 1] ------------------ 1753| 1| from.decode_null(); 1754| 1| m_as_ranges = std::nullopt; 1755| 1| } else if(next_tag == ASN1_Type::Sequence) { ------------------ | Branch (1755:14): [True: 0, False: 1] ------------------ 1756| 0| std::vector as_ranges; 1757| 0| from.decode_list(as_ranges); 1758| | 1759| 0| m_as_ranges = sort_and_merge_ranges(as_ranges); 1760| 1| } else { 1761| 1| throw Decoding_Error(fmt("Unexpected type for ASIdentifierChoice {}", static_cast(next_tag))); 1762| 1| } 1763| 2|} _ZN5Botan14Cert_Extension17Unknown_Extension12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEE: 1941| 1.84k|void Unknown_Extension::decode_inner(const std::vector& bytes) { 1942| | // Just treat as an opaque blob at this level 1943| 1.84k| m_bytes = bytes; 1944| 1.84k|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_118extension_from_oidERKNS_3OIDE: 38| 4.11k|std::unique_ptr extension_from_oid(const OID& oid) { 39| 4.11k| if(auto iso_ext = is_sub_element_of(oid, {2, 5, 29})) { ------------------ | Branch (39:12): [True: 3.74k, False: 374] ------------------ 40| | // NOLINTNEXTLINE(*-switch-missing-default-case) 41| 3.74k| switch(*iso_ext) { ------------------ | Branch (41:14): [True: 3.64k, False: 102] ------------------ 42| 69| case 14: ------------------ | Branch (42:10): [True: 69, False: 3.67k] ------------------ 43| 69| return make_extension(oid); 44| 774| case 15: ------------------ | Branch (44:10): [True: 774, False: 2.96k] ------------------ 45| 774| return make_extension(oid); 46| 797| case 17: ------------------ | Branch (46:10): [True: 797, False: 2.94k] ------------------ 47| 797| return make_extension(oid); 48| 77| case 18: ------------------ | Branch (48:10): [True: 77, False: 3.66k] ------------------ 49| 77| return make_extension(oid); 50| 834| case 19: ------------------ | Branch (50:10): [True: 834, False: 2.90k] ------------------ 51| 834| return make_extension(oid); 52| 6| case 20: ------------------ | Branch (52:10): [True: 6, False: 3.73k] ------------------ 53| 6| return make_extension(oid); 54| 16| case 21: ------------------ | Branch (54:10): [True: 16, False: 3.72k] ------------------ 55| 16| return make_extension(oid); 56| 15| case 28: ------------------ | Branch (56:10): [True: 15, False: 3.72k] ------------------ 57| 15| return make_extension(oid); 58| 9| case 30: ------------------ | Branch (58:10): [True: 9, False: 3.73k] ------------------ 59| 9| return make_extension(oid); 60| 108| case 31: ------------------ | Branch (60:10): [True: 108, False: 3.63k] ------------------ 61| 108| return make_extension(oid); 62| 31| case 32: ------------------ | Branch (62:10): [True: 31, False: 3.71k] ------------------ 63| 31| return make_extension(oid); 64| 60| case 35: ------------------ | Branch (64:10): [True: 60, False: 3.68k] ------------------ 65| 60| return make_extension(oid); 66| 844| case 37: ------------------ | Branch (66:10): [True: 844, False: 2.89k] ------------------ 67| 844| return make_extension(oid); 68| 0| case 56: ------------------ | Branch (68:10): [True: 0, False: 3.74k] ------------------ 69| 0| return make_extension(oid); 70| 3.74k| } 71| 3.74k| } 72| | 73| 476| if(auto pkix_ext = is_sub_element_of(oid, {1, 3, 6, 1, 5, 5, 7, 1})) { ------------------ | Branch (73:12): [True: 53, False: 423] ------------------ 74| | // NOLINTNEXTLINE(*-switch-missing-default-case) 75| 53| switch(*pkix_ext) { ------------------ | Branch (75:14): [True: 52, False: 1] ------------------ 76| 29| case 1: ------------------ | Branch (76:10): [True: 29, False: 24] ------------------ 77| 29| return make_extension(oid); 78| 7| case 7: ------------------ | Branch (78:10): [True: 7, False: 46] ------------------ 79| 7| return make_extension(oid); 80| 5| case 8: ------------------ | Branch (80:10): [True: 5, False: 48] ------------------ 81| 5| return make_extension(oid); 82| 11| case 26: ------------------ | Branch (82:10): [True: 11, False: 42] ------------------ 83| 11| return make_extension(oid); 84| 53| } 85| 53| } 86| | 87| 424| if(oid == Cert_Extension::OCSP_NoCheck::static_oid()) { ------------------ | Branch (87:7): [True: 0, False: 424] ------------------ 88| 0| return make_extension(oid); 89| 0| } 90| | 91| 424| return nullptr; // unknown 92| 424|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension14Subject_Key_IDEEEDaRKNS_3OIDE: 33| 69|auto make_extension([[maybe_unused]] const OID& oid) { 34| 69| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 69| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 69| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 69] | | ------------------ ------------------ 35| 69| return std::make_unique(); 36| 69|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension9Key_UsageEEEDaRKNS_3OIDE: 33| 774|auto make_extension([[maybe_unused]] const OID& oid) { 34| 774| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 774| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 774| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 774] | | ------------------ ------------------ 35| 774| return std::make_unique(); 36| 774|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension24Subject_Alternative_NameEEEDaRKNS_3OIDE: 33| 797|auto make_extension([[maybe_unused]] const OID& oid) { 34| 797| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 797| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 797| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 797] | | ------------------ ------------------ 35| 797| return std::make_unique(); 36| 797|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension23Issuer_Alternative_NameEEEDaRKNS_3OIDE: 33| 77|auto make_extension([[maybe_unused]] const OID& oid) { 34| 77| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 77| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 77| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 77] | | ------------------ ------------------ 35| 77| return std::make_unique(); 36| 77|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension17Basic_ConstraintsEEEDaRKNS_3OIDE: 33| 834|auto make_extension([[maybe_unused]] const OID& oid) { 34| 834| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 834| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 834| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 834] | | ------------------ ------------------ 35| 834| return std::make_unique(); 36| 834|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension10CRL_NumberEEEDaRKNS_3OIDE: 33| 6|auto make_extension([[maybe_unused]] const OID& oid) { 34| 6| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 6| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 6| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 6] | | ------------------ ------------------ 35| 6| return std::make_unique(); 36| 6|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension14CRL_ReasonCodeEEEDaRKNS_3OIDE: 33| 16|auto make_extension([[maybe_unused]] const OID& oid) { 34| 16| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 16| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 16| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 16] | | ------------------ ------------------ 35| 16| return std::make_unique(); 36| 16|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension30CRL_Issuing_Distribution_PointEEEDaRKNS_3OIDE: 33| 15|auto make_extension([[maybe_unused]] const OID& oid) { 34| 15| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 15| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 15| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 15] | | ------------------ ------------------ 35| 15| return std::make_unique(); 36| 15|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension16Name_ConstraintsEEEDaRKNS_3OIDE: 33| 9|auto make_extension([[maybe_unused]] const OID& oid) { 34| 9| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 9| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 9| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 9] | | ------------------ ------------------ 35| 9| return std::make_unique(); 36| 9|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension23CRL_Distribution_PointsEEEDaRKNS_3OIDE: 33| 108|auto make_extension([[maybe_unused]] const OID& oid) { 34| 108| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 108| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 108| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 108] | | ------------------ ------------------ 35| 108| return std::make_unique(); 36| 108|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension20Certificate_PoliciesEEEDaRKNS_3OIDE: 33| 31|auto make_extension([[maybe_unused]] const OID& oid) { 34| 31| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 31| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 31| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 31] | | ------------------ ------------------ 35| 31| return std::make_unique(); 36| 31|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension16Authority_Key_IDEEEDaRKNS_3OIDE: 33| 60|auto make_extension([[maybe_unused]] const OID& oid) { 34| 60| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 60| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 60| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 60] | | ------------------ ------------------ 35| 60| return std::make_unique(); 36| 60|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension18Extended_Key_UsageEEEDaRKNS_3OIDE: 33| 844|auto make_extension([[maybe_unused]] const OID& oid) { 34| 844| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 844| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 844| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 844] | | ------------------ ------------------ 35| 844| return std::make_unique(); 36| 844|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension28Authority_Information_AccessEEEDaRKNS_3OIDE: 33| 29|auto make_extension([[maybe_unused]] const OID& oid) { 34| 29| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 29| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 29| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 29] | | ------------------ ------------------ 35| 29| return std::make_unique(); 36| 29|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension15IPAddressBlocksEEEDaRKNS_3OIDE: 33| 7|auto make_extension([[maybe_unused]] const OID& oid) { 34| 7| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 7| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 7| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 7] | | ------------------ ------------------ 35| 7| return std::make_unique(); 36| 7|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension8ASBlocksEEEDaRKNS_3OIDE: 33| 5|auto make_extension([[maybe_unused]] const OID& oid) { 34| 5| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 5| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 5| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 5] | | ------------------ ------------------ 35| 5| return std::make_unique(); 36| 5|} x509_ext.cpp:_ZN5Botan12_GLOBAL__N_114make_extensionITkNSt3__112derived_fromINS_21Certificate_ExtensionEEENS_14Cert_Extension10TNAuthListEEEDaRKNS_3OIDE: 33| 11|auto make_extension([[maybe_unused]] const OID& oid) { 34| 11| BOTAN_DEBUG_ASSERT(oid == T::static_oid()); ------------------ | | 130| 11| do { /* NOLINT(*-avoid-do-while) */ \ | | 131| 11| } while(0) | | ------------------ | | | Branch (131:15): [Folded, False: 11] | | ------------------ ------------------ 35| 11| return std::make_unique(); 36| 11|} x509_ext.cpp:_ZZN5Botan14Cert_Extension9Key_Usage12decode_innerERKNSt3__16vectorIhNS2_9allocatorIhEEEEENK3$_0clEv: 419| 695| const uint16_t usage = [&bits]() -> uint16_t { 420| 695| switch(bits.size()) { 421| 0| case 0: ------------------ | Branch (421:10): [True: 0, False: 695] ------------------ 422| 0| return 0; 423| 695| case 1: ------------------ | Branch (423:10): [True: 695, False: 0] ------------------ 424| 695| return make_uint16(bits[0], 0); 425| 0| case 2: ------------------ | Branch (425:10): [True: 0, False: 695] ------------------ 426| 0| return make_uint16(bits[0], bits[1]); 427| 0| default: ------------------ | Branch (427:10): [True: 0, False: 695] ------------------ 428| 0| throw Decoding_Error("Invalid KeyUsage bitstring encoding"); 429| 695| } 430| 695| }(); x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_Information11decode_fromERNS_11BER_DecoderE: 687| 12| void decode_from(BER_Decoder& codec) override { 688| 12| codec.start_sequence().decode(m_oid).discard_remaining().end_cons(); 689| 12| } x509_ext.cpp:_ZN5Botan14Cert_Extension12_GLOBAL__N_118Policy_InformationC2Ev: 679| 12| Policy_Information() = default; _ZN5Botan11X509_Object9load_dataERNS_10DataSourceE: 24| 3.09k|void X509_Object::load_data(DataSource& in) { 25| 3.09k| try { 26| 3.09k| if(ASN1::maybe_BER(in) && !PEM_Code::matches(in)) { ------------------ | Branch (26:10): [True: 3.09k, False: 7] | Branch (26:33): [True: 3.09k, False: 2] ------------------ 27| 3.09k| BER_Decoder dec(in, BER_Decoder::Limits::DER()); 28| 3.09k| decode_from(dec); 29| | // Call to verify_end omitted here since we have to sometimes decode 30| | // multiple certificates encoded sequentially in a DataSource 31| 3.09k| } else { 32| 9| std::string got_label; 33| 9| DataSource_Memory ber(PEM_Code::decode(in, got_label)); 34| | 35| 9| if(got_label != PEM_label()) { ------------------ | Branch (35:13): [True: 0, False: 9] ------------------ 36| 0| bool is_alternate = false; 37| 0| for(const std::string_view alt_label : alternate_PEM_labels()) { ------------------ | Branch (37:50): [True: 0, False: 0] ------------------ 38| 0| if(got_label == alt_label) { ------------------ | Branch (38:19): [True: 0, False: 0] ------------------ 39| 0| is_alternate = true; 40| 0| break; 41| 0| } 42| 0| } 43| | 44| 0| if(!is_alternate) { ------------------ | Branch (44:16): [True: 0, False: 0] ------------------ 45| 0| throw Decoding_Error("Unexpected PEM label for " + PEM_label() + " of " + got_label); 46| 0| } 47| 0| } 48| | 49| 9| BER_Decoder dec(ber, BER_Decoder::Limits::DER()); 50| 9| decode_from(dec); 51| | // Call to verify_end omitted here since we have to sometimes decode 52| | // multiple certificates encoded sequentially in a DataSource 53| 9| } 54| 3.09k| } catch(Decoding_Error& e) { 55| 2.17k| throw Decoding_Error(PEM_label() + " decoding", e); 56| 2.17k| } 57| 3.09k|} _ZNK5Botan11X509_Object9signatureEv: 59| 924|const std::vector& X509_Object::signature() const { 60| 924| if(!m_signed_data) { ------------------ | Branch (60:7): [True: 0, False: 924] ------------------ 61| 0| throw Invalid_State("X509_Object uninitialized"); 62| 0| } 63| 924| return m_signed_data->m_sig; 64| 924|} _ZNK5Botan11X509_Object11signed_bodyEv: 66| 3.92k|const std::vector& X509_Object::signed_body() const { 67| 3.92k| if(!m_signed_data) { ------------------ | Branch (67:7): [True: 0, False: 3.92k] ------------------ 68| 0| throw Invalid_State("X509_Object uninitialized"); 69| 0| } 70| 3.92k| return m_signed_data->m_tbs_bits; 71| 3.92k|} _ZNK5Botan11X509_Object19signature_algorithmEv: 73| 2.39k|const AlgorithmIdentifier& X509_Object::signature_algorithm() const { 74| 2.39k| if(!m_signed_data) { ------------------ | Branch (74:7): [True: 0, False: 2.39k] ------------------ 75| 0| throw Invalid_State("X509_Object uninitialized"); 76| 0| } 77| 2.39k| return m_signed_data->m_sig_algo; 78| 2.39k|} _ZNK5Botan11X509_Object11encode_intoERNS_11DER_EncoderE: 80| 924|void X509_Object::encode_into(DER_Encoder& to) const { 81| 924| to.start_sequence() 82| 924| .start_sequence() 83| 924| .raw_bytes(signed_body()) 84| 924| .end_cons() 85| 924| .encode(signature_algorithm()) 86| 924| .encode(signature(), ASN1_Type::BitString) 87| 924| .end_cons(); 88| 924|} _ZN5Botan11X509_Object11decode_fromERNS_11BER_DecoderE: 93| 3.09k|void X509_Object::decode_from(BER_Decoder& from) { 94| 3.09k| auto data = std::make_shared(); 95| | 96| 3.09k| from.start_sequence() 97| 3.09k| .start_sequence() 98| 3.09k| .raw_bytes(data->m_tbs_bits) 99| 3.09k| .end_cons() 100| 3.09k| .decode(data->m_sig_algo) 101| 3.09k| .decode(data->m_sig, ASN1_Type::BitString) 102| 3.09k| .end_cons(); 103| | 104| 3.09k| m_signed_data = std::move(data); 105| 3.09k| force_decode(); 106| 3.09k|} _ZN5Botan16X509_CertificateD2Ev: 76| 3.85k|X509_Certificate::~X509_Certificate() = default; _ZNK5Botan16X509_Certificate9PEM_labelEv: 78| 2.17k|std::string X509_Certificate::PEM_label() const { 79| 2.17k| return "CERTIFICATE"; 80| 2.17k|} _ZN5Botan16X509_CertificateC2ERNS_10DataSourceE: 86| 3.09k|X509_Certificate::X509_Certificate(DataSource& src) { 87| 3.09k| load_data(src); 88| 3.09k|} _ZN5Botan16X509_Certificate12force_decodeEv: 338| 2.99k|void X509_Certificate::force_decode() { 339| 2.99k| m_data.reset(); 340| 2.99k| m_data = parse_x509_cert_body(*this); 341| 2.99k|} _ZNK5Botan16X509_Certificate4dataEv: 343| 3.50k|const X509_Certificate_Data& X509_Certificate::data() const { 344| 3.50k| if(m_data == nullptr) { ------------------ | Branch (344:7): [True: 0, False: 3.50k] ------------------ 345| 0| throw Invalid_State("X509_Certificate uninitialized"); 346| 0| } 347| 3.50k| return *m_data; 348| 3.50k|} _ZNK5Botan16X509_Certificate12x509_versionEv: 350| 918|uint32_t X509_Certificate::x509_version() const { 351| 918| return static_cast(data().m_version); 352| 918|} _ZNK5Botan16X509_Certificate14is_self_signedEv: 354| 361|bool X509_Certificate::is_self_signed() const { 355| 361| return data().m_self_signed; 356| 361|} _ZNK5Botan16X509_Certificate23subject_public_key_infoEv: 382| 914|const std::vector& X509_Certificate::subject_public_key_info() const { 383| 914| return data().m_subject_public_key_bits_seq; 384| 914|} _ZNK5Botan16X509_Certificate16authority_key_idEv: 398| 292|const std::vector& X509_Certificate::authority_key_id() const { 399| 292| return data().m_authority_key_id; 400| 292|} _ZNK5Botan16X509_Certificate9issuer_dnEv: 414| 292|const X509_DN& X509_Certificate::issuer_dn() const { 415| 292| return data().m_issuer_dn; 416| 292|} _ZNK5Botan16X509_Certificate11constraintsEv: 461| 366|Key_Constraints X509_Certificate::constraints() const { 462| 366| return data().m_key_constraints; 463| 366|} _ZNK5Botan16X509_Certificate18subject_public_keyEv: 659| 914|std::unique_ptr X509_Certificate::subject_public_key() const { 660| 914| try { 661| 914| return std::unique_ptr(X509::load_key(subject_public_key_info())); 662| 914| } catch(std::exception& e) { 663| 548| throw Decoding_Error("X509_Certificate::subject_public_key", e); 664| 548| } 665| 914|} _ZNK5Botan16X509_Certificate3tagEv: 704| 361|X509_Certificate::Tag X509_Certificate::tag() const { 705| 361| return Tag(data().m_cert_data_sha256); 706| 361|} x509cert.cpp:_ZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectE: 104| 2.99k|std::unique_ptr parse_x509_cert_body(const X509_Object& obj) { 105| 2.99k| auto data = std::make_unique(); 106| | 107| 2.99k| BigInt serial_bn; 108| 2.99k| BER_Object public_key; 109| 2.99k| BER_Object v3_exts_data; 110| | 111| 2.99k| BER_Decoder(obj.signed_body(), BER_Decoder::Limits::DER()) 112| 2.99k| .decode_optional(data->m_version, ASN1_Type(0), ASN1_Class::Constructed | ASN1_Class::ContextSpecific) 113| 2.99k| .decode(serial_bn) 114| 2.99k| .decode(data->m_sig_algo_inner) 115| 2.99k| .decode(data->m_issuer_dn) 116| 2.99k| .start_sequence() 117| 2.99k| .decode(data->m_not_before) 118| 2.99k| .decode(data->m_not_after) 119| 2.99k| .end_cons() 120| 2.99k| .decode(data->m_subject_dn) 121| 2.99k| .get_next(public_key) 122| 2.99k| .decode_optional_string(data->m_v2_issuer_key_id, ASN1_Type::BitString, 1) 123| 2.99k| .decode_optional_string(data->m_v2_subject_key_id, ASN1_Type::BitString, 2) 124| 2.99k| .get_next(v3_exts_data) 125| 2.99k| .verify_end("TBSCertificate has extra data after extensions block"); 126| | 127| 2.99k| if(data->m_version > 2) { ------------------ | Branch (127:7): [True: 0, False: 2.99k] ------------------ 128| 0| throw Decoding_Error("Unknown X.509 cert version " + std::to_string(data->m_version)); 129| 0| } 130| 2.99k| if(obj.signature_algorithm() != data->m_sig_algo_inner) { ------------------ | Branch (130:7): [True: 11, False: 2.98k] ------------------ 131| 11| throw Decoding_Error("X.509 Certificate had differing algorithm identifiers in inner and outer ID fields"); 132| 11| } 133| | 134| 2.98k| public_key.assert_is_a(ASN1_Type::Sequence, ASN1_Class::Constructed, "X.509 certificate public key"); 135| | 136| | // for general sanity convert wire version (0 based) to standards version (v1 .. v3) 137| 2.98k| data->m_version += 1; 138| | 139| 2.98k| data->m_serial = serial_bn.serialize(); 140| | // crude method to save the serial's sign; will get lost during decoding, otherwise 141| 2.98k| data->m_serial_negative = serial_bn.signum() < 0; 142| 2.98k| data->m_subject_dn_bits = ASN1::put_in_sequence(data->m_subject_dn.get_bits()); 143| 2.98k| data->m_issuer_dn_bits = ASN1::put_in_sequence(data->m_issuer_dn.get_bits()); 144| | 145| 2.98k| data->m_subject_public_key_bits.assign(public_key.bits(), public_key.bits() + public_key.length()); 146| | 147| 2.98k| data->m_subject_public_key_bits_seq = ASN1::put_in_sequence(data->m_subject_public_key_bits); 148| | 149| 2.98k| BER_Decoder(data->m_subject_public_key_bits, BER_Decoder::Limits::DER()) 150| 2.98k| .decode(data->m_subject_public_key_algid) 151| 2.98k| .decode(data->m_subject_public_key_bitstring, ASN1_Type::BitString) 152| 2.98k| .verify_end(); 153| | 154| 2.98k| if(v3_exts_data.is_a(3, ASN1_Class::Constructed | ASN1_Class::ContextSpecific)) { ------------------ | Branch (154:7): [True: 1.10k, False: 1.88k] ------------------ 155| | // Path validation will reject a v1/v2 cert with v3 extensions 156| 1.10k| BER_Decoder(v3_exts_data, BER_Decoder::Limits::DER()).decode(data->m_v3_extensions).verify_end(); 157| 1.88k| } else if(v3_exts_data.is_set()) { ------------------ | Branch (157:14): [True: 1, False: 1.88k] ------------------ 158| 1| throw BER_Bad_Tag("Unknown tag in X.509 cert", v3_exts_data.tagging()); 159| 1| } 160| | 161| | // Now cache some fields from the extensions 162| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (162:19): [True: 606, False: 2.38k] ------------------ 163| 606| data->m_key_constraints = ext->get_constraints(); 164| | /* 165| | RFC 5280: When the keyUsage extension appears in a certificate, 166| | at least one of the bits MUST be set to 1. 167| | */ 168| 606| if(data->m_key_constraints.empty()) { ------------------ | Branch (168:10): [True: 0, False: 606] ------------------ 169| 0| throw Decoding_Error("Certificate has invalid encoding for KeyUsage"); 170| 0| } 171| 606| } 172| | 173| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (173:19): [True: 15, False: 2.97k] ------------------ 174| 15| data->m_subject_key_id = ext->get_key_id(); 175| 15| } 176| | 177| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (177:19): [True: 38, False: 2.94k] ------------------ 178| 38| data->m_authority_key_id = ext->get_key_id(); 179| 38| } 180| | 181| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (181:19): [True: 0, False: 2.98k] ------------------ 182| 0| data->m_name_constraints = ext->get_name_constraints(); 183| 0| } 184| | 185| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (185:19): [True: 558, False: 2.42k] ------------------ 186| 558| data->m_extended_key_usage = ext->object_identifiers(); 187| | /* 188| | RFC 5280 section 4.2.1.12 189| | 190| | "This extension indicates one or more purposes ..." 191| | 192| | "If the extension is present, then the certificate MUST only be 193| | used for one of the purposes indicated." 194| | 195| | Thus we reject an EKU extension which is empty, since this indicates 196| | the certificate cannot be used for any purpose. 197| | */ 198| 558| if(data->m_extended_key_usage.empty()) { ------------------ | Branch (198:10): [True: 0, False: 558] ------------------ 199| 0| throw Decoding_Error("Certificate has invalid empty EKU extension"); 200| 0| } 201| 558| } 202| | 203| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (203:19): [True: 684, False: 2.30k] ------------------ 204| | /* 205| | * RFC 5280 4.2.1.9 requires that conforming CAs "MUST mark the 206| | * extension [basicConstraints] as critical in such certificates" 207| | * but places no such requirement on validators. 208| | */ 209| 684| if(ext->is_ca() == true) { ------------------ | Branch (209:10): [True: 43, False: 641] ------------------ 210| | /* 211| | * RFC 5280 section 4.2.1.3 requires that CAs include KeyUsage in all 212| | * intermediate CA certificates they issue. Currently we accept it being 213| | * missing, as do most other implementations. But it may be worth 214| | * removing this entirely, or alternately adding a warning level 215| | * validation failure for it. 216| | */ 217| 43| const bool allowed_by_ku = 218| 43| data->m_key_constraints.includes(Key_Constraints::KeyCertSign) || data->m_key_constraints.empty(); ------------------ | Branch (218:13): [True: 2, False: 41] | Branch (218:79): [True: 40, False: 1] ------------------ 219| | 220| | /* 221| | * If the extended key usages are set then we must restrict the usage in 222| | * accordance with it as well. 223| | * 224| | * RFC 5280 does not define any extended key usages compatible with certificate 225| | * signing, but some CAs use serverAuth, clientAuth, OCSPSigning, or AnyExtendedKeyUsage 226| | * for this purpose, even though clearly all of these (besides AEKU) are invalid. 227| | * This check at least allows excluding a certificate which is set for only eg 228| | * timestamping or code signing, and that seems about the best we can possibly enforce. 229| | * OpenSSL, BoringSSL, and Go all completely ignore EKUs in determining ability to 230| | * issue certs. 231| | */ 232| 43| const bool allowed_by_ext_ku = [](const std::vector& ext_ku) -> bool { 233| 43| if(ext_ku.empty()) { 234| 43| return true; 235| 43| } 236| | 237| 43| const auto server_auth = OID::from_name("PKIX.ServerAuth"); 238| 43| const auto client_auth = OID::from_name("PKIX.ClientAuth"); 239| 43| const auto ocsp_sign = OID::from_name("PKIX.OCSPSigning"); 240| 43| const auto any_eku = OID::from_name("X509v3.AnyExtendedKeyUsage"); 241| | 242| 43| for(const auto& oid : ext_ku) { 243| 43| if(oid == any_eku || oid == server_auth || oid == client_auth || oid == ocsp_sign) { 244| 43| return true; 245| 43| } 246| 43| } 247| | 248| 43| return false; 249| 43| }(data->m_extended_key_usage); 250| | 251| 43| if(allowed_by_ku && allowed_by_ext_ku) { ------------------ | Branch (251:13): [True: 42, False: 1] | Branch (251:30): [True: 42, False: 0] ------------------ 252| 42| data->m_is_ca_certificate = true; 253| 42| data->m_path_len_constraint = ext->path_length_constraint(); 254| 42| } 255| 43| } 256| 684| } 257| | 258| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (258:19): [True: 0, False: 2.98k] ------------------ 259| 0| data->m_issuer_alt_name = ext->get_alt_name(); 260| 0| } 261| | 262| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (262:19): [True: 227, False: 2.75k] ------------------ 263| 227| data->m_subject_alt_name = ext->get_alt_name(); 264| 227| } 265| | 266| | // This will be set even if SAN parsing failed entirely eg due to a decoding error 267| | // or if the SAN is empty. This is used to guard against using the CN for domain 268| | // name checking. 269| 2.98k| const auto san_oid = OID::from_string("X509v3.SubjectAlternativeName"); 270| 2.98k| data->m_subject_alt_name_exists = data->m_v3_extensions.extension_set(san_oid); 271| | 272| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (272:19): [True: 0, False: 2.98k] ------------------ 273| 0| data->m_cert_policies = ext->get_policy_oids(); 274| 0| } 275| | 276| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (276:19): [True: 0, False: 2.98k] ------------------ 277| 0| data->m_ocsp_responders = ext->ocsp_responders(); 278| 0| data->m_ca_issuers = ext->ca_issuers(); 279| 0| } 280| | 281| 2.98k| if(const auto* ext = data->m_v3_extensions.get_extension_object_as()) { ------------------ | Branch (281:19): [True: 0, False: 2.98k] ------------------ 282| 0| data->m_crl_distribution_points = ext->crl_distribution_urls(); 283| 0| } 284| | 285| | /* 286| | Determine if this certificate appears to be self-issued (subject == issuer). 287| | This is only a heuristic used for path building so it's ok it is not precise. 288| | The self-signature is verified during path validation. 289| | */ 290| 2.98k| if(data->m_subject_dn == data->m_issuer_dn) { ------------------ | Branch (290:7): [True: 418, False: 2.56k] ------------------ 291| 418| if(!data->m_subject_key_id.empty() && !data->m_authority_key_id.empty()) { ------------------ | Branch (291:10): [True: 4, False: 414] | Branch (291:45): [True: 2, False: 2] ------------------ 292| | /* 293| | Both SKID and AKID are set so we can reliably determine self-signed vs 294| | self-issued by comparing the two 295| | */ 296| 2| data->m_self_signed = (data->m_subject_key_id == data->m_authority_key_id); 297| 416| } else { 298| | /* 299| | Without both SKID and AKID we can't determine with certainty. Assume 300| | self-signed since that's by far the common case. 301| | */ 302| 416| data->m_self_signed = true; 303| 416| } 304| 418| } 305| | 306| 2.98k| const std::vector full_encoding = obj.BER_encode(); 307| | 308| 2.98k| if(auto sha1 = HashFunction::create("SHA-1")) { ------------------ | Branch (308:12): [True: 924, False: 2.06k] ------------------ 309| 924| sha1->update(data->m_subject_public_key_bitstring); 310| 924| data->m_subject_public_key_bitstring_sha1 = sha1->final_stdvec(); 311| | // otherwise left as empty, and we will throw if subject_public_key_bitstring_sha1 is called 312| | 313| 924| sha1->update(full_encoding); 314| 924| sha1->final(data->m_cert_data_sha1); 315| 924| data->m_fingerprint_sha1 = format_hex_fingerprint(data->m_cert_data_sha1); 316| 924| } 317| | 318| | // SHA-256 is a hard dependency of this module 319| 2.98k| auto sha256 = HashFunction::create_or_throw("SHA-256"); 320| 2.98k| sha256->update(data->m_issuer_dn_bits); 321| 2.98k| data->m_issuer_dn_bits_sha256 = sha256->final_stdvec(); 322| | 323| 2.98k| sha256->update(data->m_subject_dn_bits); 324| 2.98k| data->m_subject_dn_bits_sha256 = sha256->final_stdvec(); 325| | 326| 2.98k| sha256->update(full_encoding); 327| 2.98k| sha256->final(data->m_cert_data_sha256); 328| 2.98k| data->m_fingerprint_sha256 = format_hex_fingerprint(data->m_cert_data_sha256); 329| | 330| 2.98k| return data; 331| 2.98k|} x509cert.cpp:_ZZN5Botan12_GLOBAL__N_120parse_x509_cert_bodyERKNS_11X509_ObjectEENK3$_0clERKNSt3__16vectorINS_3OIDENS5_9allocatorIS7_EEEE: 232| 43| const bool allowed_by_ext_ku = [](const std::vector& ext_ku) -> bool { 233| 43| if(ext_ku.empty()) { ------------------ | Branch (233:16): [True: 43, False: 0] ------------------ 234| 43| return true; 235| 43| } 236| | 237| 0| const auto server_auth = OID::from_name("PKIX.ServerAuth"); 238| 0| const auto client_auth = OID::from_name("PKIX.ClientAuth"); 239| 0| const auto ocsp_sign = OID::from_name("PKIX.OCSPSigning"); 240| 0| const auto any_eku = OID::from_name("X509v3.AnyExtendedKeyUsage"); 241| | 242| 0| for(const auto& oid : ext_ku) { ------------------ | Branch (242:33): [True: 0, False: 0] ------------------ 243| 0| if(oid == any_eku || oid == server_auth || oid == client_auth || oid == ocsp_sign) { ------------------ | Branch (243:19): [True: 0, False: 0] | Branch (243:37): [True: 0, False: 0] | Branch (243:59): [True: 0, False: 0] | Branch (243:81): [True: 0, False: 0] ------------------ 244| 0| return true; 245| 0| } 246| 0| } 247| | 248| 0| return false; 249| 0| }(data->m_extended_key_usage); _ZN5Botan18x509_path_validateERKNSt3__16vectorINS_16X509_CertificateENS0_9allocatorIS2_EEEERKNS_28Path_Validation_RestrictionsERKNS1_IPNS_17Certificate_StoreENS3_ISC_EEEENS0_17basic_string_viewIcNS0_11char_traitsIcEEEENS_10Usage_TypeENS0_6chrono10time_pointINSM_12system_clockENSM_8durationIxNS0_5ratioILl1ELl1000000EEEEEEENSP_IxNSQ_ILl1ELl1000EEEEERKNS1_INS0_8optionalINS_4OCSP8ResponseEEENS3_ISZ_EEEE: 1004| 361| const std::vector>& ocsp_resp) { 1005| 361| if(end_certs.empty()) { ------------------ | Branch (1005:7): [True: 0, False: 361] ------------------ 1006| 0| throw Invalid_Argument("x509_path_validate called with no subjects"); 1007| 0| } 1008| | 1009| 361| const X509_Certificate& end_entity = end_certs[0]; 1010| 361| std::vector end_entity_extra; 1011| 361| for(size_t i = 1; i < end_certs.size(); ++i) { ------------------ | Branch (1011:22): [True: 0, False: 361] ------------------ 1012| 0| end_entity_extra.push_back(end_certs[i]); 1013| 0| } 1014| | 1015| 361| const bool require_self_signed = restrictions.require_self_signed_trust_anchors(); 1016| | 1017| 361| CertificatePathBuilder builder(trusted_roots, end_entity, end_entity_extra, require_self_signed); 1018| | 1019| 361| constexpr size_t max_paths = 50; 1020| 361| constexpr size_t max_verifications = 200; 1021| | 1022| 361| std::optional first_path_error; 1023| 361| size_t paths_checked = 0; 1024| 361| size_t certs_checked = 0; 1025| | 1026| 361| while(auto cert_path = builder.next()) { ------------------ | Branch (1026:15): [True: 0, False: 361] ------------------ 1027| 0| BOTAN_ASSERT_NOMSG(cert_path->empty() == false); ------------------ | | 77| 0| do { \ | | 78| 0| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 0| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 0] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 0| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 0] | | ------------------ ------------------ 1028| | 1029| 0| paths_checked += 1; 1030| 0| certs_checked += cert_path->size(); 1031| 0| if(paths_checked > max_paths || certs_checked > max_verifications) { ------------------ | Branch (1031:10): [True: 0, False: 0] | Branch (1031:39): [True: 0, False: 0] ------------------ 1032| 0| first_path_error = Path_Validation_Result(Certificate_Status_Code::EXCEEDED_SEARCH_LIMITS); 1033| 0| break; 1034| 0| } 1035| | 1036| 0| CertificatePathStatusCodes status = PKIX::check_chain(*cert_path, ref_time, hostname, usage, restrictions); 1037| | 1038| | // Skip revocation checks if the chain already has fatal errors. 1039| 0| if(PKIX::overall_status(status) < Certificate_Status_Code::FIRST_ERROR_STATUS_TO_SKIP_REVOCATION) { ------------------ | Branch (1039:10): [True: 0, False: 0] ------------------ 1040| 0| const CertificatePathStatusCodes crl_status = PKIX::check_crl(*cert_path, trusted_roots, ref_time); 1041| | 1042| 0| CertificatePathStatusCodes ocsp_status; 1043| | 1044| 0| if(!ocsp_resp.empty()) { ------------------ | Branch (1044:13): [True: 0, False: 0] ------------------ 1045| 0| ocsp_status = PKIX::check_ocsp(*cert_path, ocsp_resp, trusted_roots, ref_time, restrictions); 1046| 0| } 1047| | 1048| 0| if(ocsp_timeout != std::chrono::milliseconds(0)) { ------------------ | Branch (1048:13): [True: 0, False: 0] ------------------ 1049| 0| const size_t to_online = restrictions.ocsp_all_intermediates() ? (cert_path->size() - 1) : 1; ------------------ | Branch (1049:38): [True: 0, False: 0] ------------------ 1050| 0| bool need_online = false; 1051| 0| for(size_t i = 0; i < to_online; ++i) { ------------------ | Branch (1051:31): [True: 0, False: 0] ------------------ 1052| 0| if(skip_revocation_check((*cert_path)[i])) { ------------------ | Branch (1052:19): [True: 0, False: 0] ------------------ 1053| 0| continue; 1054| 0| } 1055| 0| if(i >= ocsp_status.size() || ocsp_status[i].empty()) { ------------------ | Branch (1055:19): [True: 0, False: 0] | Branch (1055:46): [True: 0, False: 0] ------------------ 1056| 0| need_online = true; 1057| 0| break; 1058| 0| } 1059| 0| } 1060| | 1061| 0| if(need_online) { ------------------ | Branch (1061:16): [True: 0, False: 0] ------------------ 1062| 0|#if defined(BOTAN_TARGET_OS_HAS_THREADS) && defined(BOTAN_HAS_HTTP_UTIL) 1063| 0| auto online_status = 1064| 0| PKIX::check_ocsp_online(*cert_path, trusted_roots, ref_time, ocsp_timeout, restrictions); 1065| 0| if(ocsp_status.size() < online_status.size()) { ------------------ | Branch (1065:19): [True: 0, False: 0] ------------------ 1066| 0| ocsp_status.resize(online_status.size()); 1067| 0| } 1068| 0| for(size_t i = 0; i < online_status.size(); ++i) { ------------------ | Branch (1068:34): [True: 0, False: 0] ------------------ 1069| 0| if(ocsp_status[i].empty()) { ------------------ | Branch (1069:22): [True: 0, False: 0] ------------------ 1070| 0| ocsp_status[i] = std::move(online_status[i]); 1071| 0| } 1072| 0| } 1073| |#else 1074| | if(ocsp_status.size() < to_online) { 1075| | ocsp_status.resize(to_online); 1076| | } 1077| | for(size_t i = 0; i < to_online; ++i) { 1078| | if(ocsp_status[i].empty()) { 1079| | ocsp_status[i].insert(Certificate_Status_Code::OCSP_NO_HTTP); 1080| | } 1081| | } 1082| |#endif 1083| 0| } 1084| 0| } 1085| | 1086| 0| PKIX::merge_revocation_status(status, crl_status, ocsp_status, restrictions); 1087| | 1088| | // merge_revocation_status flags NO_REVOCATION_DATA when require_revocation 1089| | // is set; clear it for certs where RFC 9608 Section 4 says to skip the check. 1090| 0| for(size_t i = 0; i + 1 < cert_path->size() && i < status.size(); ++i) { ------------------ | Branch (1090:28): [True: 0, False: 0] | Branch (1090:57): [True: 0, False: 0] ------------------ 1091| 0| if(skip_revocation_check((*cert_path)[i])) { ------------------ | Branch (1091:16): [True: 0, False: 0] ------------------ 1092| 0| status[i].erase(Certificate_Status_Code::NO_REVOCATION_DATA); 1093| 0| } 1094| 0| } 1095| 0| } 1096| | 1097| 0| Path_Validation_Result pvd(status, std::move(*cert_path)); 1098| 0| if(pvd.successful_validation()) { ------------------ | Branch (1098:10): [True: 0, False: 0] ------------------ 1099| 0| return pvd; 1100| 0| } else if(!first_path_error.has_value()) { ------------------ | Branch (1100:17): [True: 0, False: 0] ------------------ 1101| | // Save the errors from the first path we attempted 1102| 0| first_path_error = std::move(pvd); 1103| 0| } 1104| 0| } 1105| | 1106| 361| if(first_path_error.has_value()) { ------------------ | Branch (1106:7): [True: 0, False: 361] ------------------ 1107| | // We found at least one path, but none of them verified 1108| | // Return arbitrarily the error from the first path attempted 1109| 0| return first_path_error.value(); 1110| 361| } else { 1111| | // Failed to build any path at all 1112| 361| return Path_Validation_Result(builder.error()); 1113| 361| } 1114| 361|} _ZN5Botan28Path_Validation_RestrictionsC2EbmbNSt3__16chrono8durationIxNS1_5ratioILl1ELl1EEEEENS1_10unique_ptrINS_17Certificate_StoreENS1_14default_deleteIS8_EEEEbb: 1167| 361| m_require_revocation_information(require_rev), 1168| 361| m_ocsp_all_intermediates(ocsp_intermediates), 1169| 361| m_minimum_key_strength(key_strength), 1170| 361| m_max_ocsp_age(max_ocsp_age), 1171| 361| m_trusted_ocsp_responders(std::move(trusted_ocsp_responders)), 1172| 361| m_ignore_trusted_root_time_range(ignore_trusted_root_time_range), 1173| 361| m_require_self_signed_trust_anchors(require_self_signed_trust_anchors) { 1174| 361| if(key_strength <= 80) { ------------------ | Branch (1174:7): [True: 0, False: 361] ------------------ 1175| 0| m_trusted_hashes.insert("SHA-1"); 1176| 0| } 1177| | 1178| 361| m_trusted_hashes.insert("SHA-224"); 1179| 361| m_trusted_hashes.insert("SHA-256"); 1180| 361| m_trusted_hashes.insert("SHA-384"); 1181| 361| m_trusted_hashes.insert("SHA-512"); 1182| 361| m_trusted_hashes.insert("SHAKE-256(512)"); // Dilithium/ML-DSA 1183| 361| m_trusted_hashes.insert("SHAKE-256(912)"); // Ed448 1184| 361|} _ZNK5Botan22Path_Validation_Result21successful_validationEv: 1221| 361|bool Path_Validation_Result::successful_validation() const { 1222| 361| return (result() == Certificate_Status_Code::VERIFIED || result() == Certificate_Status_Code::OCSP_RESPONSE_GOOD || ------------------ | Branch (1222:12): [True: 0, False: 361] | Branch (1222:61): [True: 0, False: 361] ------------------ 1223| 361| result() == Certificate_Status_Code::VALID_CRL_CHECKED); ------------------ | Branch (1223:12): [True: 0, False: 361] ------------------ 1224| 361|} _ZNK5Botan22Path_Validation_Result13result_stringEv: 1239| 361|std::string Path_Validation_Result::result_string() const { 1240| 361| return status_string(result()); 1241| 361|} _ZN5Botan22Path_Validation_Result13status_stringENS_23Certificate_Status_CodeE: 1243| 361|const char* Path_Validation_Result::status_string(Certificate_Status_Code code) { 1244| 361| if(const char* s = to_string(code)) { ------------------ | Branch (1244:19): [True: 361, False: 0] ------------------ 1245| 361| return s; 1246| 361| } 1247| | 1248| 0| return "Unknown error"; 1249| 361|} x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilderC2ERKNSt3__16vectorIPNS_17Certificate_StoreENS2_9allocatorIS5_EEEERKNS_16X509_CertificateERKNS3_ISB_NS6_ISB_EEEEb: 82| 361| m_trusted_certstores(trusted_certstores), m_require_self_signed(require_self_signed) { 83| 361| if(std::ranges::any_of(trusted_certstores, [](auto* ptr) { return ptr == nullptr; })) { ------------------ | Branch (83:13): [True: 0, False: 361] ------------------ 84| 0| throw Invalid_Argument("Certificate store list must not contain nullptr"); 85| 0| } 86| | 87| 361| for(const auto& cert : end_entity_extra) { ------------------ | Branch (87:31): [True: 0, False: 361] ------------------ 88| 0| if(!cert_in_any_trusted_store(cert)) { ------------------ | Branch (88:16): [True: 0, False: 0] ------------------ 89| 0| m_ee_extras.add_certificate(cert); 90| 0| } 91| 0| } 92| | 93| 361| m_stack.push_back({end_entity, cert_in_any_trusted_store(end_entity)}); 94| 361| } x509path.cpp:_ZNK5Botan12_GLOBAL__N_122CertificatePathBuilder25cert_in_any_trusted_storeERKNS_16X509_CertificateE: 180| 361| bool cert_in_any_trusted_store(const X509_Certificate& cert) const { 181| 361| return std::ranges::any_of(m_trusted_certstores, 182| 361| [&](const Certificate_Store* store) { return store->contains(cert); }); 183| 361| } x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilder4nextEv: 96| 361| std::optional> next() { 97| 361| size_t steps = 0; 98| | 99| 722| while(!m_stack.empty()) { ------------------ | Branch (99:16): [True: 361, False: 361] ------------------ 100| 361| constexpr size_t MAX_DFS_STEPS = 1000; 101| | 102| 361| steps++; 103| | 104| 361| if(steps > MAX_DFS_STEPS) { ------------------ | Branch (104:16): [True: 0, False: 361] ------------------ 105| | // Intentionally overwrite any previous builder error 106| 0| m_error = Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 107| 0| return std::nullopt; 108| 0| } 109| | 110| 361| auto [last, trusted] = std::move(m_stack.back()); // move before pop_back 111| 361| m_stack.pop_back(); 112| | 113| | // Found a deletion marker that guides the DFS, backtracking 114| 361| if(!last.has_value()) { ------------------ | Branch (114:16): [True: 0, False: 361] ------------------ 115| 0| m_certs_seen.erase(m_path_so_far.back().tag()); 116| 0| m_path_so_far.pop_back(); 117| 0| continue; 118| 0| } 119| | 120| | // Certificate already seen in this path? 121| 361| const auto tag = last->tag(); 122| 361| if(m_certs_seen.contains(tag)) { ------------------ | Branch (122:16): [True: 0, False: 361] ------------------ 123| 0| if(!m_error.has_value()) { ------------------ | Branch (123:19): [True: 0, False: 0] ------------------ 124| 0| m_error = Certificate_Status_Code::CERT_CHAIN_LOOP; 125| 0| } 126| 0| continue; 127| 0| } 128| | 129| | // A valid path has been discovered. It includes endpoints that may end 130| | // with either a self-signed or a non-self-signed certificate. For 131| | // certificates that are not self-signed, additional paths could 132| | // potentially extend from the current one. 133| 361| if(trusted) { ------------------ | Branch (133:16): [True: 0, False: 361] ------------------ 134| 0| auto path = m_path_so_far; 135| 0| path.push_back(*last); 136| 0| push_issuers(*last); 137| | 138| 0| if(!m_require_self_signed || last->is_self_signed()) { ------------------ | Branch (138:19): [True: 0, False: 0] | Branch (138:45): [True: 0, False: 0] ------------------ 139| 0| return path; 140| 0| } 141| | 142| | /* 143| | This unconditionally overwrites the error because it's likely the most 144| | informative error in this context - we found a path that seemed entirely 145| | suitable, except that self-signed roots are required so it was skipped. 146| | */ 147| 0| m_error = Certificate_Status_Code::CANNOT_ESTABLISH_TRUST; 148| 0| continue; 149| 0| } 150| | 151| 361| if(last->is_self_signed()) { ------------------ | Branch (151:16): [True: 69, False: 292] ------------------ 152| 69| if(!m_error.has_value()) { ------------------ | Branch (152:19): [True: 69, False: 0] ------------------ 153| 69| m_error = Certificate_Status_Code::CANNOT_ESTABLISH_TRUST; 154| 69| } 155| 69| continue; 156| 69| } 157| | 158| 292| push_issuers(*last); 159| 292| } 160| | 161| 361| return std::nullopt; 162| 361| } x509path.cpp:_ZN5Botan12_GLOBAL__N_122CertificatePathBuilder12push_issuersERKNS_16X509_CertificateE: 185| 292| void push_issuers(const X509_Certificate& cert) { 186| 292| const X509_DN& issuer_dn = cert.issuer_dn(); 187| 292| const std::vector& auth_key_id = cert.authority_key_id(); 188| | 189| | // Search for trusted issuers 190| 292| std::vector trusted_issuers; 191| 292| for(const Certificate_Store* store : m_trusted_certstores) { ------------------ | Branch (191:45): [True: 0, False: 292] ------------------ 192| 0| auto new_issuers = store->find_all_certs(issuer_dn, auth_key_id); 193| 0| trusted_issuers.insert(trusted_issuers.end(), new_issuers.begin(), new_issuers.end()); 194| 0| } 195| | 196| | // Search the supplemental certs 197| 292| const std::vector misc_issuers = m_ee_extras.find_all_certs(issuer_dn, auth_key_id); 198| | 199| | // If we could not find any issuers, the current path ends here 200| 292| if(trusted_issuers.empty() && misc_issuers.empty()) { ------------------ | Branch (200:13): [True: 292, False: 0] | Branch (200:40): [True: 292, False: 0] ------------------ 201| 292| if(!m_error.has_value()) { ------------------ | Branch (201:16): [True: 292, False: 0] ------------------ 202| 292| m_error = Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 203| 292| } 204| 292| return; 205| 292| } 206| | 207| 0| m_path_so_far.push_back(cert); 208| 0| m_certs_seen.emplace(cert.tag()); 209| | 210| | // Push a deletion marker on the stack for backtracking later 211| 0| m_stack.push_back({std::nullopt, false}); 212| | 213| 0| for(const auto& trusted_cert : trusted_issuers) { ------------------ | Branch (213:39): [True: 0, False: 0] ------------------ 214| 0| m_stack.push_back({trusted_cert, true}); 215| 0| } 216| 0| for(const auto& misc : misc_issuers) { ------------------ | Branch (216:31): [True: 0, False: 0] ------------------ 217| 0| m_stack.push_back({misc, false}); 218| 0| } 219| 0| } x509path.cpp:_ZNK5Botan12_GLOBAL__N_122CertificatePathBuilder5errorEv: 169| 361| Certificate_Status_Code error() const { 170| 361| if(m_error.has_value()) { ------------------ | Branch (170:13): [True: 361, False: 0] ------------------ 171| | // Confirm it is an actual error code and not accidentally OK... 172| 361| BOTAN_ASSERT_NOMSG(static_cast(m_error.value()) >= 3000); ------------------ | | 77| 361| do { \ | | 78| 361| /* NOLINTNEXTLINE(*-simplify-boolean-expr) */ \ | | 79| 361| if(!(expr)) { \ | | ------------------ | | | Branch (79:10): [True: 0, False: 361] | | ------------------ | | 80| 0| /* NOLINTNEXTLINE(bugprone-lambda-function-name) */ \ | | 81| 0| Botan::assertion_failure(#expr, "", __func__, __FILE__, __LINE__); \ | | 82| 0| } \ | | 83| 361| } while(0) | | ------------------ | | | Branch (83:12): [Folded, False: 361] | | ------------------ ------------------ 173| 361| return m_error.value(); 174| 361| } else { 175| 0| return Certificate_Status_Code::CERT_ISSUER_NOT_FOUND; 176| 0| } 177| 361| }