c1bc70b711
A lot of files were missing copyright field in the header and
the Blender Foundation contributed to them in a sense of bug
fixing and general maintenance.
This change makes it explicit that those files are at least
partially copyrighted by the Blender Foundation.
Note that this does not make it so the Blender Foundation is
the only holder of the copyright in those files, and developers
who do not have a signed contract with the foundation still
hold the copyright as well.
Another aspect of this change is using SPDX format for the
header. We already used it for the license specification,
and now we state it for the copyright as well, following the
FAQ:
https://reuse.software/faq/
100 lines
2.8 KiB
C++
100 lines
2.8 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Foundation
|
|
*
|
|
* 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
|