/usr/include/bobcat/bigint is in libbobcat-dev 4.08.02-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 | #ifndef INCLUDED_BOBCAT_BIGINT_
#define INCLUDED_BOBCAT_BIGINT_
#include <iosfwd>
#include <vector>
#include <openssl/bn.h>
namespace FBB
{
class BigInt
{
friend std::ostream &operator<<(std::ostream &out, BigInt const &bn);
BIGNUM *d_bn;
enum
{
WordMask = (1 << BN_BYTES) - 1
};
public:
typedef BN_ULONG Word;
enum Msb
{
MSB_UNKNOWN = -1,
MSB_IS_ONE,
TOP_TWO_BITS_ONE
};
enum Lsb
{
EVEN,
ODD,
};
enum PrimeType
{
ANY = false,
SAFE = true
};
BigInt(); // 1
BigInt(BigInt const &other); // 3
template<typename Type> // promotion OK
BigInt(Type value);
explicit BigInt(BIGNUM const &bignum); // 2
explicit BigInt(BIGNUM const *bignum); // 4
explicit BigInt(BIGNUM *bignum); // .f (avoids selection of
// the template)
BigInt(char const *bigEndian, size_t length, bool negative = false);
// 5
explicit BigInt(std::string const &bigEndian, bool negative = false);
// 6
~BigInt();
BigInt &operator=(BigInt const &other);
BigInt operator-() const;
BigInt &negate();
BigInt negatec() const;
BigInt &setNegative(bool negative);
BigInt setNegativec(bool negative) const;
bool isNegative() const; // .f
BigInt &tildeBits();
BigInt tildeBitsc() const;
BigInt &tildeInt();
BigInt tildeIntc() const;
BigInt &operator--(); // opdec.f
BigInt operator--(int);
BigInt &operator++(); // opinc.f
BigInt operator++(int);
class Bit;
Bit operator[](size_t idx); // opindex.f
// non-const BigInts:
// distinguishes lhs/rhs
int operator[](size_t idx) const; // opindexc.f
// only rhs for const BigInts
class Bit
{
friend Bit BigInt::operator[](size_t idx);
friend std::ostream &operator<<(std::ostream &out,
Bit const &bit);
BigInt &d_bi;
size_t d_idx;
public:
operator bool() const;
Bit &operator=(bool rhs); // assign a bit
Bit &operator&=(bool rhs); // bit_and a bit
Bit &operator|=(bool rhs); // bit_or a bit
Bit &operator^=(bool rhs); // bit_xor a bit
private:
Bit(BigInt &bi, size_t idx);
};
char *bigEndian() const;
BigInt &operator+=(BigInt const &rhs); // opaddis.f
BigInt &addMod(BigInt const &rhs, BigInt const &mod); // .f
BigInt addModc(BigInt const &rhs, BigInt const &mod) const;
BigInt &operator-=(BigInt const &rhs); // opsubis.f
BigInt &subMod(BigInt const &rhs, BigInt const &mod); // .f
BigInt subModc(BigInt const &rhs, BigInt const &mod) const;
BigInt &operator*=(BigInt const &rhs);
BigInt &mulMod(BigInt const &rhs, BigInt const &mod); // .f
BigInt mulModc(BigInt const &rhs, BigInt const &mod) const;
BigInt &operator%=(BigInt const &rhs);
BigInt &operator/=(BigInt const &rhs); // integer division,
// integer division, also
// returning remainder
BigInt &div(BigInt *remainder, BigInt const &rhs);
BigInt divc(BigInt *remainder, BigInt const &rhs) const;
BigInt &sqr();
BigInt sqrc() const;
BigInt &sqrMod(BigInt const &mod); // .f
BigInt sqrModc(BigInt const &mod) const;
BigInt &operator&=(BigInt const &rhs);
BigInt &operator|=(BigInt const &rhs);
BigInt &operator^=(BigInt const &rhs);
bool isZero() const; // .f
bool isOne() const; // .f
bool isOdd() const; // .f
unsigned long ulong() const; // .f
BIGNUM const &bignum() const; // .f
size_t sizeInBytes() const; // .f
size_t size() const; // .f
size_t nWords() const; // .f
static size_t constexpr sizeOfWord(); // .f
Word at(size_t index) const;
void setWord(size_t index, Word value);
int compare(BigInt const &other) const; // .f
int uCompare(BigInt const &other) const; // .f
long long diophantus(long long *factor1, long long *factor2,
long long const &value1,
long long const &value2);
BigInt diophantus(BigInt *factor1, BigInt *factor2,
BigInt const &value1, BigInt const &value2);
BigInt &exp(BigInt const &exponent);
BigInt expc(BigInt const &exponent) const;
BigInt &expMod(BigInt const &exponent, BigInt const &mod);
BigInt expModc(BigInt const &exponent, BigInt const &mod) const;
BigInt &gcd(BigInt const &rhs);
BigInt gcdc(BigInt const &rhs) const;
BigInt &inverseMod(BigInt const &mod);
BigInt inverseModc(BigInt const &mod) const;
BigInt &isqrt();
BigInt isqrtc() const;
static BigInt rand(size_t bitsSize,
Msb msb = MSB_IS_ONE, Lsb lsb = ODD);
static BigInt randRange(BigInt const &max);
static BigInt setBigEndian(std::string const &bytes);
static BigInt pseudoRand(size_t bitsSize,
Msb msb = MSB_IS_ONE, Lsb lsb = ODD);
static BigInt pseudoRandRange(BigInt const &max);
static BigInt prime(size_t nBits,
BigInt const *add = 0, BigInt const *rem = 0,
PrimeType primeType = ANY);
static BigInt fromText(std::string const &text, int mode = 0);
BigInt &clearBit(size_t index);
BigInt clearBit(size_t index) const;
bool hasBit(size_t index) const; // .f
BigInt &maskBits(size_t lowerNBits);
BigInt maskBitsc(size_t lowerNBits) const;
BigInt &setBit(size_t index);
BigInt setBitc(size_t index) const;
BigInt &setBit(size_t index, bool value);
BigInt setBitc(size_t index, bool value) const;
BigInt &lshift();
BigInt lshiftc() const;
BigInt &lshift(size_t nBits);
BigInt lshiftc(size_t nBits) const;
BigInt &operator<<=(size_t nBits); // opshlis.f
BigInt &rshift();
BigInt rshiftc() const;
BigInt &rshift(size_t nBits);
BigInt rshiftc(size_t nBits) const;
BigInt &operator>>=(size_t nBits); // opshris.f
void swap(BigInt &other);
private:
void mod_inverse(BigInt *ret, BigInt const &mod) const;
std::ostream &insertInto(std::ostream &out) const;
static char *bn2oct(BIGNUM const *bn);
void copy(BIGNUM *lhs, BIGNUM const &rhs);
void nWordsCheck(size_t index) const;
BigInt &checked1(
int (*BN_op)(BIGNUM *,
BIGNUM const *, BIGNUM const *),
BigInt const &rhs, char const *op);
BigInt &checked2(int (*BN_op)(BIGNUM *,
BIGNUM const *, BIGNUM const *,
BIGNUM const *,
BN_CTX *),
BigInt const &rhs, BigInt const &mod,
char const *op);
void checked3(BIGNUM *div, BIGNUM *rem,
BigInt const &rhs, char const *op) const;
BigInt &checked4(int (*BN_op)(BIGNUM *,
BIGNUM const *, BIGNUM const *,
BN_CTX *),
BigInt const &rhs, char const *op);
static void primeCallback(int reason, int primeNr, void *primeBase);
static bool addDigit(char ch, BigInt &ret, BigInt const &radix,
int (*pConv)(int));
};
template<typename Type>
BigInt::BigInt(Type value)
:
d_bn(BN_new())
{
bool negative = value < 0;
if (negative)
value = -value;
BN_set_word(d_bn, static_cast<unsigned long>(value));
if (negative)
negate();
}
inline size_t BigInt::nWords() const
{
return (size() + BN_BYTES - 1) / BN_BYTES;
}
inline BigInt &BigInt::addMod(BigInt const &rhs, BigInt const &mod)
{
return checked2(BN_mod_add, rhs, mod, "addMod");
}
inline BIGNUM const &BigInt::bignum() const
{
return *d_bn;
}
inline int BigInt::compare(BigInt const &other) const
{
return BN_cmp(d_bn, other.d_bn);
}
inline bool BigInt::hasBit(size_t index) const
{
return BN_is_bit_set(this->d_bn, index);
}
inline bool BigInt::isNegative() const
{
return BN_is_negative(this->d_bn);
}
inline bool BigInt::isOdd() const
{
return BN_is_odd(d_bn);
}
inline bool BigInt::isOne() const
{
return BN_is_one(d_bn);
}
inline bool BigInt::isZero() const
{
return BN_is_zero(d_bn);
}
inline BigInt &BigInt::mulMod(BigInt const &rhs, BigInt const &mod)
{
return checked2(BN_mod_mul, rhs, mod, "mulMod");
}
inline BigInt &BigInt::operator+=(BigInt const &rhs)
{
return checked1(BN_add, rhs, "+");
}
inline BigInt::Bit::operator bool() const
{
return d_bi.hasBit(d_idx);
}
inline BigInt &BigInt::operator--()
{
return *this -= 1;
}
inline BigInt &BigInt::operator++()
{
return *this += 1;
}
inline BigInt::Bit BigInt::operator[](size_t idx)
{
Bit bit(*this, idx);
return bit;
}
inline int BigInt::operator[](size_t idx) const
{
return hasBit(idx);
}
inline BigInt &BigInt::operator<<=(size_t nBits)
{
return lshift(nBits);
}
inline BigInt &BigInt::operator>>=(size_t nBits)
{
return rshift(nBits);
}
inline BigInt &BigInt::operator-=(BigInt const &rhs)
{
return checked1(BN_sub, rhs, "-");
}
inline size_t BigInt::size() const
{
return BN_num_bits(d_bn);
}
inline size_t BigInt::sizeInBytes() const
{
return BN_num_bytes(d_bn);
}
size_t constexpr BigInt::sizeOfWord()
{
return sizeof(Word);
}
inline BigInt &BigInt::sqrMod(BigInt const &mod)
{
return checked4(BN_mod_sqr, mod, "sqrMod");
}
inline BigInt &BigInt::subMod(BigInt const &rhs, BigInt const &mod)
{
return checked2(BN_mod_sub, rhs, mod, "subMod");
}
inline unsigned long BigInt::ulong() const
{
return BN_get_word(d_bn);
}
inline int BigInt::uCompare(BigInt const &other) const
{
return BN_ucmp(d_bn, other.d_bn);
}
// Free functions
BigInt operator*(BigInt const &lhs, BigInt const &rhs);
BigInt operator/(BigInt const &lhs, BigInt const &rhs);
BigInt operator%(BigInt const &lhs, BigInt const &rhs);
BigInt operator+(BigInt const &lhs, BigInt const &rhs);
BigInt operator-(BigInt const &lhs, BigInt const &rhs);
BigInt operator>>(BigInt const &lhs, size_t rhs);
BigInt operator<<(BigInt const &lhs, size_t rhs);
BigInt operator|(BigInt const &lhs, BigInt const &rhs);
BigInt operator&(BigInt const &lhs, BigInt const &rhs);
BigInt operator^(BigInt const &lhs, BigInt const &rhs);
BigInt gcd(BigInt const &lhs, BigInt const &rhs);
BigInt inverseMod(BigInt const &lhs, BigInt const &mod);
std::istream &operator>>(std::istream &out, BigInt &bn);
int isoctdigit(int ch);
inline bool operator>(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) > 0;
}
inline bool operator>=(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) >= 0;
}
inline std::ostream &operator<<(std::ostream &out, BigInt const &bn)
{
return bn.insertInto(out);
}
inline bool operator==(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) == 0;
}
inline bool operator!=(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) != 0;
}
inline bool operator<(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) < 0;
}
inline bool operator<=(BigInt const &lhs, BigInt const &rhs)
{
return lhs.compare(rhs) <= 0;
}
} // namespace FBB
#endif
|