b87ccedd75
Most of this patch is by Jacques Lucke, from the simulation branch. This commit adds generic expression evaluation for bit spans, helping to generalize the optimizations that avoid processing a single bit at a time. Operations like "for each 1 index", "or", and "and" are already implemented in this pull request. Bits in full integers are processed 64 at a time, then remaining bits are processed all at once. The operations allow implementing a `copy_from` method for bit spans. Currently this optimized evaluation is only implemented for simpler bounded bit spans. Bounded bit spans have constraints on their bit ranges that make them more efficient to process. Large spans must start at the beginning of the first int, and small spans must start and end within the first int. Knowing these constraints at compile time reduces the number of edge cases in the operations, but mainly allows skipping alignment between multiple spans with different offsets. Pull Request: https://projects.blender.org/blender/blender/pulls/107408
98 lines
2.8 KiB
C++
98 lines
2.8 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#include "BLI_bit_span.hh"
|
|
#include "BLI_bit_span_ops.hh"
|
|
|
|
namespace blender::bits {
|
|
|
|
void MutableBitSpan::set_all()
|
|
{
|
|
if (bit_range_.is_empty()) {
|
|
return;
|
|
}
|
|
const AlignedIndexRanges ranges = split_index_range_by_alignment(bit_range_, BitsPerInt);
|
|
{
|
|
BitInt &first_int = *int_containing_bit(data_, bit_range_.start());
|
|
const BitInt first_int_mask = mask_range_bits(ranges.prefix.start() & BitIndexMask,
|
|
ranges.prefix.size());
|
|
first_int |= first_int_mask;
|
|
}
|
|
{
|
|
BitInt *start = int_containing_bit(data_, ranges.aligned.start());
|
|
const int64_t ints_to_fill = ranges.aligned.size() / BitsPerInt;
|
|
constexpr BitInt fill_value = BitInt(-1);
|
|
initialized_fill_n(start, ints_to_fill, fill_value);
|
|
}
|
|
{
|
|
BitInt &last_int = *int_containing_bit(data_, bit_range_.one_after_last() - 1);
|
|
const BitInt last_int_mask = mask_first_n_bits(ranges.suffix.size());
|
|
last_int |= last_int_mask;
|
|
}
|
|
}
|
|
|
|
void MutableBitSpan::reset_all()
|
|
{
|
|
if (bit_range_.is_empty()) {
|
|
return;
|
|
}
|
|
const AlignedIndexRanges ranges = split_index_range_by_alignment(bit_range_, BitsPerInt);
|
|
{
|
|
BitInt &first_int = *int_containing_bit(data_, bit_range_.start());
|
|
const BitInt first_int_mask = mask_range_bits(ranges.prefix.start() & BitIndexMask,
|
|
ranges.prefix.size());
|
|
first_int &= ~first_int_mask;
|
|
}
|
|
{
|
|
BitInt *start = int_containing_bit(data_, ranges.aligned.start());
|
|
const int64_t ints_to_fill = ranges.aligned.size() / BitsPerInt;
|
|
constexpr BitInt fill_value = 0;
|
|
initialized_fill_n(start, ints_to_fill, fill_value);
|
|
}
|
|
{
|
|
BitInt &last_int = *int_containing_bit(data_, bit_range_.one_after_last() - 1);
|
|
const BitInt last_int_mask = mask_first_n_bits(ranges.suffix.size());
|
|
last_int &= ~last_int_mask;
|
|
}
|
|
}
|
|
|
|
void MutableBitSpan::copy_from(const BitSpan other)
|
|
{
|
|
BLI_assert(this->size() == other.size());
|
|
copy_from_or(*this, other);
|
|
}
|
|
|
|
void MutableBitSpan::copy_from(const BoundedBitSpan other)
|
|
{
|
|
BLI_assert(this->size() == other.size());
|
|
copy_from_or(*this, other);
|
|
}
|
|
|
|
void MutableBoundedBitSpan::copy_from(const BitSpan other)
|
|
{
|
|
BLI_assert(this->size() == other.size());
|
|
copy_from_or(*this, other);
|
|
}
|
|
|
|
void MutableBoundedBitSpan::copy_from(const BoundedBitSpan other)
|
|
{
|
|
BLI_assert(this->size() == other.size());
|
|
copy_from_or(*this, other);
|
|
}
|
|
|
|
std::ostream &operator<<(std::ostream &stream, const BitSpan &span)
|
|
{
|
|
stream << "(Size: " << span.size() << ", ";
|
|
for (const BitRef bit : span) {
|
|
stream << bit;
|
|
}
|
|
stream << ")";
|
|
return stream;
|
|
}
|
|
|
|
std::ostream &operator<<(std::ostream &stream, const MutableBitSpan &span)
|
|
{
|
|
return stream << BitSpan(span);
|
|
}
|
|
|
|
} // namespace blender::bits
|