3 * @brief Arbitrary sized integer definitions
5 * @see add_digits_asm.s
6 * @see sub_digits_asm.s
7 * @see mul_digits_asm.s
27 /** Absolute value hackery **/
28 template <> Arbint Tabs(const Arbint & a)
35 Arbint::Arbint(int64_t i) : m_digits(1), m_sign(i < 0)
37 m_digits[0] = llabs(i);
40 Arbint::Arbint(unsigned n, digit_t d0, ...) : m_digits(n), m_sign(false)
46 for (unsigned i = 1; i < n; ++i)
48 m_digits[i] = va_arg(ap, digit_t);
53 Arbint::Arbint(const Arbint & cpy) : m_digits(cpy.m_digits), m_sign(cpy.m_sign)
58 Arbint::Arbint(const vector<digit_t> & digits) : m_digits(digits), m_sign(false)
63 Arbint & Arbint::operator=(const Arbint & cpy)
65 m_digits = cpy.m_digits;
72 m_digits.resize(1, 0L);
75 unsigned Arbint::Shrink()
77 if (m_digits.size() <= 1)
80 for (i = m_digits.size()-1; (i > 0 && m_digits[i] != 0L); --i);
81 unsigned result = m_digits.size() - i;
86 Arbint & Arbint::operator*=(const Arbint & mul)
88 vector<digit_t> new_digits(m_digits.size(), 0L);
89 new_digits.reserve(new_digits.size()+mul.m_digits.size());
90 for (unsigned i = 0; i < mul.m_digits.size(); ++i)
92 vector<digit_t> step(m_digits.size()+i, 0L);
93 memcpy(step.data()+i, m_digits.data(), sizeof(digit_t)*m_digits.size());
95 digit_t overflow = mul_digits((digit_t*)step.data()+i, mul.m_digits[i], m_digits.size());
98 step.push_back(overflow);
100 new_digits.resize(max(new_digits.size(), step.size()), 0L);
101 digit_t carry = add_digits((digit_t*)new_digits.data(), step.data(), step.size());
104 new_digits.push_back(carry);
108 m_digits.swap(new_digits);
109 m_sign = !(m_sign == mul.m_sign);
113 void Arbint::Division(const Arbint & div, Arbint & result, Arbint & remainder) const
117 for (int i = 8*sizeof(digit_t)*m_digits.size(); i >= 0; --i)
123 remainder.BitClear(0);
124 if (remainder >= div)
132 Arbint & Arbint::operator+=(const Arbint & add)
134 if (m_sign == add.m_sign)
136 // -a + -b == -(a + b)
137 return AddBasic(add);
142 // -a + b == -(a - b)
155 Arbint & Arbint::operator-=(const Arbint & sub)
157 if (m_sign == sub.m_sign)
158 return SubBasic(sub);
159 return AddBasic(sub);
162 Arbint & Arbint::AddBasic(const Arbint & add)
164 if (add.m_digits.size() >= m_digits.size())
166 m_digits.resize(add.m_digits.size()+1,0L);
169 digit_t carry = add_digits((digit_t*)m_digits.data(),
170 (digit_t*)add.m_digits.data(), add.m_digits.size());
172 m_digits[m_digits.size()-1] = carry;
173 else if (m_digits.back() == 0L)
174 m_digits.resize(m_digits.size()-1);
178 Arbint & Arbint::SubBasic(const Arbint & sub)
180 if (sub.m_digits.size() >= m_digits.size())
182 m_digits.resize(sub.m_digits.size(),0L);
184 digit_t borrow = sub_digits((digit_t*)m_digits.data(),
185 (digit_t*)sub.m_digits.data(), sub.m_digits.size());
188 //TODO: Write ASM to do this bit?
192 for (unsigned i = 0; i < m_digits.size(); ++i)
193 m_digits[i] = -m_digits[i];
199 string Arbint::Str(const string & base) const
204 reverse(s.begin(), s.end());
208 bool Arbint::IsZero() const
210 for (unsigned i = m_digits.size()-1; i > 0; --i)
212 if (m_digits[i] != 0L) return false;
214 return (m_digits[0] == 0L);
217 bool Arbint::operator==(const Arbint & equ) const
219 if (m_sign != equ.m_sign)
221 unsigned min_size = m_digits.size();
222 const Arbint * larger = &equ;
223 if (m_digits.size() > equ.m_digits.size())
225 min_size = equ.m_digits.size();
229 if (memcmp(m_digits.data(), equ.m_digits.data(), sizeof(digit_t)*min_size) != 0)
232 for (unsigned i = min_size; i < larger->m_digits.size(); ++i)
234 if (larger->m_digits[i] != 0L)
240 bool Arbint::operator<(const Arbint & less) const
244 return (cpy.m_sign && !cpy.IsZero());
247 string Arbint::DigitStr() const
250 //ss << std::hex << std::setfill('0');
251 for (unsigned i = 0; i < m_digits.size(); ++i)
253 if (i != 0) ss << ',';
254 //ss << std::setw(2*sizeof(digit_t)) << static_cast<digit_t>(m_digits[i]);
255 ss << static_cast<digit_t>(m_digits[i]);
260 Arbint & Arbint::operator>>=(unsigned amount)
262 // Shift by whole number of digits
263 unsigned whole = amount/(8*sizeof(digit_t));
264 unsigned old_size = m_digits.size();
266 if (whole >= old_size)
272 memmove(m_digits.data(), m_digits.data()+whole, sizeof(digit_t)*(old_size-whole));
273 m_digits.resize(old_size-whole, 0L);
275 // Shift by partial amount
276 amount = amount %(8*sizeof(digit_t));
280 digit_t underflow = 0L;
281 for (int i = (int)(m_digits.size()-1); i >= 0; --i)
283 unsigned shl = (8*sizeof(digit_t)-amount);
284 digit_t next_underflow = (m_digits[i] << shl);
285 //digit_t mask_upper = ~(0L >> amount);
286 m_digits[i] = (m_digits[i] >> amount);// & mask_upper;
287 m_digits[i] |= underflow;
288 underflow = next_underflow;
293 Arbint & Arbint::operator<<=(unsigned amount)
295 // Shift by whole number of digits
296 unsigned whole = amount/(8*sizeof(digit_t));
297 unsigned old_size = m_digits.size();
298 m_digits.resize(m_digits.size() + whole);
299 memmove(m_digits.data()+whole, m_digits.data(), sizeof(digit_t)*old_size);
300 memset(m_digits.data(), 0L, whole*sizeof(digit_t));
305 amount = amount % (8*sizeof(digit_t));
309 //Debug("Shift by %u from %u", amount, whole);
310 digit_t overflow = 0L;
311 for (unsigned i = whole; i < m_digits.size(); ++i)
313 //Debug("Digit is %.16lx", m_digits[i]);
314 unsigned shr = (8*sizeof(digit_t)-amount);
315 //Debug("shr is %u", shr);
316 digit_t next_overflow = (m_digits[i] >> shr);
317 //Debug("Next overflow %.16lx", next_overflow);
318 m_digits[i] <<= amount;
319 //Debug("Before overflow %.16lx", m_digits[i]);
320 m_digits[i] |= overflow;
321 overflow = next_overflow;
324 m_digits.push_back(overflow);
329 bool Arbint::GetBit(unsigned i) const
331 unsigned digit = i/(8*sizeof(digit_t));
332 if (digit >= m_digits.size())
335 i = i % (8*sizeof(digit_t));
337 return (m_digits[digit] & (1L << i));
341 void Arbint::BitClear(unsigned i)
343 unsigned digit = i/(8*sizeof(digit_t));
344 if (digit >= m_digits.size())
346 i = i % (8*sizeof(digit_t));
347 m_digits[digit] &= ~(1L << i);
350 void Arbint::BitSet(unsigned i)
352 unsigned digit = i/(8*sizeof(digit_t));
353 if (digit >= m_digits.size())
355 m_digits.resize(digit+1, 0L);
357 i = i % (8*sizeof(digit_t));
358 m_digits[digit] |= (1L << i);