Goals of this refactor: * Simplify creating virtual arrays. * Simplify passing virtual arrays around. * Simplify converting between typed and generic virtual arrays. * Reduce memory allocations. As a quick reminder, a virtual arrays is a data structure that behaves like an array (i.e. it can be accessed using an index). However, it may not actually be stored as array internally. The two most important implementations of virtual arrays are those that correspond to an actual plain array and those that have the same value for every index. However, many more implementations exist for various reasons (interfacing with legacy attributes, unified iterator over all points in multiple splines, ...). With this refactor the core types (`VArray`, `GVArray`, `VMutableArray` and `GVMutableArray`) can be used like "normal values". They typically live on the stack. Before, they were usually inside a `std::unique_ptr`. This makes passing them around much easier. Creation of new virtual arrays is also much simpler now due to some constructors. Memory allocations are reduced by making use of small object optimization inside the core types. Previously, `VArray` was a class with virtual methods that had to be overridden to change the behavior of a the virtual array. Now,`VArray` has a fixed size and has no virtual methods. Instead it contains a `VArrayImpl` that is similar to the old `VArray`. `VArrayImpl` should rarely ever be used directly, unless a new virtual array implementation is added. To support the small object optimization for many `VArrayImpl` classes, a new `blender::Any` type is added. It is similar to `std::any` with two additional features. It has an adjustable inline buffer size and alignment. The inline buffer size of `std::any` can't be relied on and is usually too small for our use case here. Furthermore, `blender::Any` can store additional user-defined type information without increasing the stack size. Differential Revision: https://developer.blender.org/D12986
189 lines
5.1 KiB
C++
189 lines
5.1 KiB
C++
/*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup fn
|
|
*
|
|
* A generic virtual vector array is essentially the same as a virtual vector array from blenlib,
|
|
* but its data type is only known at runtime.
|
|
*/
|
|
|
|
#include "FN_generic_virtual_array.hh"
|
|
|
|
#include "BLI_virtual_vector_array.hh"
|
|
|
|
namespace blender::fn {
|
|
|
|
/* A generically typed version of `VVectorArray`. */
|
|
class GVVectorArray {
|
|
protected:
|
|
const CPPType *type_;
|
|
int64_t size_;
|
|
|
|
public:
|
|
GVVectorArray(const CPPType &type, const int64_t size) : type_(&type), size_(size)
|
|
{
|
|
}
|
|
|
|
virtual ~GVVectorArray() = default;
|
|
|
|
/* Returns the number of vectors in the vector array. */
|
|
int64_t size() const
|
|
{
|
|
return size_;
|
|
}
|
|
|
|
/* Returns true when there is no vector in the vector array. */
|
|
bool is_empty() const
|
|
{
|
|
return size_ == 0;
|
|
}
|
|
|
|
const CPPType &type() const
|
|
{
|
|
return *type_;
|
|
}
|
|
|
|
/* Returns the size of the vector at the given index. */
|
|
int64_t get_vector_size(const int64_t index) const
|
|
{
|
|
BLI_assert(index >= 0);
|
|
BLI_assert(index < size_);
|
|
return this->get_vector_size_impl(index);
|
|
}
|
|
|
|
/* Copies an element from one of the vectors into `r_value`, which is expected to point to
|
|
* initialized memory. */
|
|
void get_vector_element(const int64_t index, const int64_t index_in_vector, void *r_value) const
|
|
{
|
|
BLI_assert(index >= 0);
|
|
BLI_assert(index < size_);
|
|
BLI_assert(index_in_vector >= 0);
|
|
BLI_assert(index_in_vector < this->get_vector_size(index));
|
|
this->get_vector_element_impl(index, index_in_vector, r_value);
|
|
}
|
|
|
|
/* Returns true when the same vector is used at every index. */
|
|
bool is_single_vector() const
|
|
{
|
|
if (size_ == 1) {
|
|
return true;
|
|
}
|
|
return this->is_single_vector_impl();
|
|
}
|
|
|
|
protected:
|
|
virtual int64_t get_vector_size_impl(const int64_t index) const = 0;
|
|
|
|
virtual void get_vector_element_impl(const int64_t index,
|
|
const int64_t index_in_vector,
|
|
void *r_value) const = 0;
|
|
|
|
virtual bool is_single_vector_impl() const
|
|
{
|
|
return false;
|
|
}
|
|
};
|
|
|
|
class GVArray_For_GVVectorArrayIndex : public GVArrayImpl {
|
|
private:
|
|
const GVVectorArray &vector_array_;
|
|
const int64_t index_;
|
|
|
|
public:
|
|
GVArray_For_GVVectorArrayIndex(const GVVectorArray &vector_array, const int64_t index)
|
|
: GVArrayImpl(vector_array.type(), vector_array.get_vector_size(index)),
|
|
vector_array_(vector_array),
|
|
index_(index)
|
|
{
|
|
}
|
|
|
|
protected:
|
|
void get(const int64_t index_in_vector, void *r_value) const override;
|
|
void get_to_uninitialized(const int64_t index_in_vector, void *r_value) const override;
|
|
};
|
|
|
|
class GVVectorArray_For_SingleGVArray : public GVVectorArray {
|
|
private:
|
|
GVArray varray_;
|
|
|
|
public:
|
|
GVVectorArray_For_SingleGVArray(GVArray varray, const int64_t size)
|
|
: GVVectorArray(varray.type(), size), varray_(std::move(varray))
|
|
{
|
|
}
|
|
|
|
protected:
|
|
int64_t get_vector_size_impl(const int64_t index) const override;
|
|
void get_vector_element_impl(const int64_t index,
|
|
const int64_t index_in_vector,
|
|
void *r_value) const override;
|
|
|
|
bool is_single_vector_impl() const override;
|
|
};
|
|
|
|
class GVVectorArray_For_SingleGSpan : public GVVectorArray {
|
|
private:
|
|
const GSpan span_;
|
|
|
|
public:
|
|
GVVectorArray_For_SingleGSpan(const GSpan span, const int64_t size)
|
|
: GVVectorArray(span.type(), size), span_(span)
|
|
{
|
|
}
|
|
|
|
protected:
|
|
int64_t get_vector_size_impl(const int64_t UNUSED(index)) const override;
|
|
void get_vector_element_impl(const int64_t UNUSED(index),
|
|
const int64_t index_in_vector,
|
|
void *r_value) const override;
|
|
|
|
bool is_single_vector_impl() const override;
|
|
};
|
|
|
|
template<typename T> class VVectorArray_For_GVVectorArray : public VVectorArray<T> {
|
|
private:
|
|
const GVVectorArray &vector_array_;
|
|
|
|
public:
|
|
VVectorArray_For_GVVectorArray(const GVVectorArray &vector_array)
|
|
: VVectorArray<T>(vector_array.size()), vector_array_(vector_array)
|
|
{
|
|
}
|
|
|
|
protected:
|
|
int64_t get_vector_size_impl(const int64_t index) const override
|
|
{
|
|
return vector_array_.get_vector_size(index);
|
|
}
|
|
|
|
T get_vector_element_impl(const int64_t index, const int64_t index_in_vector) const override
|
|
{
|
|
T value;
|
|
vector_array_.get_vector_element(index, index_in_vector, &value);
|
|
return value;
|
|
}
|
|
|
|
bool is_single_vector_impl() const override
|
|
{
|
|
return vector_array_.is_single_vector();
|
|
}
|
|
};
|
|
|
|
} // namespace blender::fn
|