squall/storm/Big.cpp

137 lines
3.2 KiB
C++
Raw Normal View History

#include "storm/Big.hpp"
#include "storm/big/Ops.hpp"
#include "storm/Memory.hpp"
#include <cstring>
2023-01-29 22:12:59 -06:00
void SBigAdd(BigData* a, BigData* b, BigData* c) {
Add(a->Primary(), b->Primary(), c->Primary());
}
2024-11-15 00:57:52 -08:00
void SBigAnd(BigData* a, BigData* b, BigData* c) {
And(a->Primary(), b->Primary(), c->Primary());
}
2023-02-01 22:54:33 -06:00
void SBigBitLen(BigData* num, uint32_t* len) {
auto& buffer = num->Primary();
buffer.Trim();
auto index = buffer.Count() - 1;
auto high = buffer[index];
uint32_t bitIndex;
for (bitIndex = 31; bitIndex > 0; bitIndex--) {
if (((1 << bitIndex) & high)) {
break;
}
}
*len = (index * 32) + bitIndex + 1;
}
2023-02-01 22:16:58 -06:00
int32_t SBigCompare(BigData* a, BigData* b) {
return Compare(a->Primary(), b->Primary());
}
2024-11-15 01:20:08 -08:00
void SBigCopy(BigData* a, BigData* b) {
a->m_primary = b->m_primary;
}
2024-11-15 03:22:16 -08:00
void SBigDec(BigData* a, BigData* b) {
Sub(a->m_primary, b->m_primary, 1);
}
2023-01-29 20:14:01 -06:00
void SBigDel(BigData* num) {
delete num;
}
2024-11-15 07:52:35 -08:00
void SBigDiv(BigData* a, BigData* b, BigData* c) {
uint32_t allocCount = 0;
BigBuffer &buf = a->Stack().Alloc(&allocCount);
Div(a->Primary(), buf, b->Primary(), c->Primary(), a->Stack());
a->Stack().Free(allocCount);
}
2023-01-29 20:37:09 -06:00
void SBigFromBinary(BigData* num, const void* data, uint32_t bytes) {
FromBinary(num->Primary(), data, bytes);
}
2024-11-15 03:50:22 -08:00
void SBigFromStr(BigData* num, const char *str) {
FromStr(num->Primary(), str);
}
void SBigFromUnsigned(BigData* num, uint32_t val) {
FromUnsigned(num->Primary(), val);
}
2024-11-15 04:00:22 -08:00
void SBigInc(BigData* a, BigData* b) {
Add(a->Primary(), b->Primary(), 1);
}
2024-11-15 08:27:03 -08:00
int32_t SBigIsEven(BigData* a) {
return IsEven(a->Primary());
}
2024-11-15 08:31:27 -08:00
int32_t SBigIsOdd(BigData* a) {
return IsOdd(a->Primary());
}
2024-11-15 08:35:42 -08:00
int32_t SBigIsOne(BigData* a) {
return IsOne(a->Primary());
}
2024-11-15 08:38:56 -08:00
int32_t SBigIsZero(BigData* a) {
return IsZero(a->Primary());
}
2023-02-04 14:03:45 -06:00
void SBigMod(BigData* a, BigData* b, BigData* c) {
uint32_t allocCount = 0;
auto& scratch = a->Stack().Alloc(&allocCount);
Div(scratch, a->Primary(), b->Primary(), c->Primary(), a->Stack());
a->Stack().Free(allocCount);
}
void SBigMul(BigData* a, BigData* b, BigData* c) {
Mul(a->Primary(), b->Primary(), c->Primary(), a->Stack());
}
void SBigNew(BigData** num) {
auto m = SMemAlloc(sizeof(BigData), __FILE__, __LINE__, 0x0);
*num = new (m) BigData();
}
2023-02-05 16:36:38 -06:00
void SBigPowMod(BigData* a, BigData* b, BigData* c, BigData* d) {
PowMod(a->Primary(), b->Primary(), c->Primary(), d->Primary(), a->Stack());
}
2023-02-03 16:20:07 -06:00
void SBigShl(BigData* a, BigData* b, uint32_t shift) {
Shl(a->Primary(), b->Primary(), shift);
}
2023-02-03 14:50:34 -06:00
void SBigShr(BigData* a, BigData* b, uint32_t shift) {
Shr(a->Primary(), b->Primary(), shift);
}
2023-02-03 08:15:06 -06:00
void SBigSquare(BigData* a, BigData* b) {
Square(a->Primary(), b->Primary(), a->Stack());
}
2023-02-01 21:29:16 -06:00
void SBigSub(BigData* a, BigData* b, BigData* c) {
Sub(a->Primary(), b->Primary(), c->Primary());
}
void SBigToBinaryBuffer(BigData* num, uint8_t* data, uint32_t maxBytes, uint32_t* bytes) {
auto& output = num->Output();
ToBinary(output, num->Primary());
uint32_t n = output.Count() < maxBytes ? output.Count() : maxBytes;
memcpy(data, output.Ptr(), n);
if (bytes) {
*bytes = n;
}
}