caiyu/nextpnr
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix some bugs found in review.

Browse Source 
Signed-off-by: Keith Rothman <537074+litghost@users.noreply.github.com>
This commit is contained in:
Keith Rothman 2021-02-24 08:52:26 -08:00
parent 3650294e51
commit 6d193ffd8b
1 changed files with 2 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
common/dynamic_bitarray.h
View File

@ -39,10 +39,7 @@ template <typename Storage = std::vector<uint8_t>> class DynamicBitarray
std::fill(storage.begin(), storage.end(), value ? std::numeric_limits<typename Storage::value_type>::max() : 0); std::fill(storage.begin(), storage.end(), value ? std::numeric_limits<typename Storage::value_type>::max() : 0);
} }
constexpr size_t bits_per_value() const constexpr size_t bits_per_value() const { return std::numeric_limits<typename Storage::value_type>::digits; }
{
return sizeof(typename Storage::value_type) * std::numeric_limits<typename Storage::value_type>::digits;
}
bool get(size_t bit) const bool get(size_t bit) const
{ {
@ -67,7 +64,7 @@ template <typename Storage = std::vector<uint8_t>> class DynamicBitarray
void resize(size_t number_bits) void resize(size_t number_bits)
{ {
size_t required_storage = (number_bits + bits_per_value()) / bits_per_value(); size_t required_storage = (number_bits + bits_per_value() - 1) / bits_per_value();
storage.resize(required_storage); storage.resize(required_storage);
} }