21768358452

Committed 06 Feb 2026 10:35PM UTC coverage: 90.064% (-0.003%) from 90.067%

Build # 21768358452

Build Type

Pull #5289

github

Committed by

web-flow

Commit Message

Merge f589db195 into 8ea0ca252

Pull Request Pull Request #5289: Further misc header reductions, forward declarations, etc

Run Details

102238 of 113517 relevant lines covered (90.06%)

11357432.36 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/src/lib/math/numbertheory/reducer.cpp

/*
* Modular Reducer
* (C) 1999-2011,2018,2025 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/

#include <botan/reducer.h>

#include <botan/exceptn.h>
#include <botan/internal/divide.h>

namespace Botan {

Modular_Reducer::Modular_Reducer(const BigInt& mod) : m_mod_words(mod.sig_words()) {
   if(mod < 0) {
      throw Invalid_Argument("Modular_Reducer: modulus must be positive");
   }

   m_modulus = mod;
}

BigInt Modular_Reducer::reduce(const BigInt& x) const {
   return ct_modulo(x, m_modulus);
}

}  // namespace Botan

1	/*
2	* Modular Reducer
3	* (C) 1999-2011,2018,2025 Jack Lloyd
4	*
5	* Botan is released under the Simplified BSD License (see license.txt)
6	*/
7
8	#include <botan/reducer.h>
9
10	#include <botan/exceptn.h>
11	#include <botan/internal/divide.h>
12
13	namespace Botan {
14
15	Modular_Reducer::Modular_Reducer(const BigInt& mod) : m_mod_words(mod.sig_words()) {	×
16	if(mod < 0) {	×
17	throw Invalid_Argument("Modular_Reducer: modulus must be positive");	×
18	}
19
20	m_modulus = mod;	×
21	}	×
22
23	BigInt Modular_Reducer::reduce(const BigInt& x) const {	×
24	return ct_modulo(x, m_modulus);	×
25	}
26
27	} // namespace Botan

randombit / botan / 21768358452

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous