feat(big): add SBigMul

This commit is contained in:
fallenoak 2023-01-30 00:10:52 -06:00 committed by GitHub
parent e74654800d
commit 6e96e0a767
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
11 changed files with 179 additions and 0 deletions

View file

@ -24,6 +24,10 @@ void SBigNew(BigData** num) {
*num = new (m) BigData();
}
void SBigMul(BigData* a, BigData* b, BigData* c) {
Mul(a->Primary(), b->Primary(), c->Primary(), a->Stack());
}
void SBigToBinaryBuffer(BigData* num, uint8_t* data, uint32_t maxBytes, uint32_t* bytes) {
auto& output = num->Output();
ToBinary(output, num->Primary());

View file

@ -12,6 +12,8 @@ void SBigFromBinary(BigData* num, const void* data, uint32_t bytes);
void SBigFromUnsigned(BigData* num, uint32_t val);
void SBigMul(BigData* a, BigData* b, BigData* c);
void SBigNew(BigData** num);
void SBigToBinaryBuffer(BigData* num, uint8_t* data, uint32_t maxBytes, uint32_t* bytes);

View file

@ -32,3 +32,15 @@ int32_t BigBuffer::IsUsed(uint32_t index) const {
void BigBuffer::SetCount(uint32_t count) {
this->m_data.SetCount(this->m_offset + count);
}
void BigBuffer::Trim() const {
while (this->Count()) {
auto& data = const_cast<TSGrowableArray<uint32_t>&>(this->m_data);
if (*data.Top()) {
break;
}
data.SetCount(data.Count() - 1);
}
}

View file

@ -18,6 +18,7 @@ class BigBuffer {
void GrowToFit(uint32_t index);
int32_t IsUsed(uint32_t index) const;
void SetCount(uint32_t count);
void Trim() const;
};
#endif

View file

@ -7,3 +7,7 @@ TSGrowableArray<uint8_t>& BigData::Output() const {
BigBuffer& BigData::Primary() {
return this->m_primary;
}
BigStack& BigData::Stack() const {
return const_cast<BigStack&>(this->m_stack);
}

View file

@ -15,6 +15,7 @@ class BigData {
// Member functions
TSGrowableArray<uint8_t>& Output() const;
BigBuffer& Primary();
BigStack& Stack() const;
};
#endif

29
storm/big/BigStack.cpp Normal file
View file

@ -0,0 +1,29 @@
#include "storm/big/BigStack.hpp"
BigBuffer& BigStack::Alloc(uint32_t* count) {
STORM_ASSERT(this->m_used < SIZE);
if (count) {
(*count)++;
}
auto& buffer = this->m_buffer[this->m_used];
this->m_used++;
return buffer;
}
void BigStack::Free(uint32_t count) {
this->m_used -= count;
}
BigBuffer& BigStack::MakeDistinct(BigBuffer& orig, int32_t required) {
return required ? this->Alloc(nullptr) : orig;
}
void BigStack::UnmakeDistinct(BigBuffer& orig, BigBuffer& distinct) {
if (&orig != &distinct) {
orig = distinct;
this->Free(1);
}
}

View file

@ -14,6 +14,10 @@ class BigStack {
uint32_t m_used = 0;
// Member functions
BigBuffer& Alloc(uint32_t* count);
void Free(uint32_t count);
BigBuffer& MakeDistinct(BigBuffer& orig, int32_t required);
void UnmakeDistinct(BigBuffer& orig, BigBuffer& distinct);
};
#endif

View file

@ -62,6 +62,26 @@ void Mul(BigBuffer& a, const BigBuffer& b, uint64_t c) {
a.SetCount(i);
}
void Mul(BigBuffer& a, const BigBuffer& b, const BigBuffer& c, BigStack& stack) {
auto& aa = stack.MakeDistinct(a, &a == &b || &a == &c);
aa.Clear();
uint32_t i = 0;
for (i = 0; b.IsUsed(i); i++) {
uint64_t carry = 0;
uint32_t j = 0;
for (j = 0; c.IsUsed(j); j++) {
carry += aa[i + j] + b[i] * static_cast<uint64_t>(c[j]);
aa[i + j] = ExtractLowPart(carry);
}
aa[i + j] = ExtractLowPart(carry);
}
stack.UnmakeDistinct(a, aa);
}
void ToBinaryAppend(TSGrowableArray<uint8_t>& output, const BigBuffer& buffer) {
for (uint32_t i = 0; i < buffer.Count() * 4; i++) {
auto byte = buffer[i / 4] >> (8 * (i & 3));

View file

@ -2,6 +2,7 @@
#define STORM_BIG_OPS_HPP
#include "storm/big/BigBuffer.hpp"
#include "storm/big/BigStack.hpp"
#include <cstdint>
void Add(BigBuffer& a, const BigBuffer& b, const BigBuffer& c);
@ -18,6 +19,8 @@ uint64_t MakeLarge(uint32_t low, uint32_t high);
void Mul(BigBuffer& a, const BigBuffer& b, uint64_t c);
void Mul(BigBuffer& a, const BigBuffer& b, const BigBuffer& c, BigStack& stack);
void ToBinary(TSGrowableArray<uint8_t>& output, const BigBuffer& buffer);
#endif