1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* 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
*
* Field serve as an intermediate representation for calculation of a group of functions. Having
* an intermediate representation is helpful mainly to separate the execution system from the
* system that describes the necessary computations. Fields can be executed in different contexts,
* and optimization might mean executing the fields differently based on some factors like the
* number of elements.
*
* For now, fields are very tied to the multi-function system, but in the future the #FieldFunction
* class could be extended to use different descriptions of its outputs and computation besides
* the embedded multi-function.
*/
#include "BLI_string_ref.hh"
#include "BLI_vector.hh"
#include "FN_generic_virtual_array.hh"
#include "FN_multi_function_builder.hh"
#include "FN_multi_function_procedure.hh"
#include "FN_multi_function_procedure_builder.hh"
#include "FN_multi_function_procedure_executor.hh"
namespace blender::fn {
class FieldSource {
public:
~FieldSource() = default;
virtual const CPPType &cpp_type_of_output_index(int output_index) const = 0;
virtual bool is_input() const
{
return false;
}
};
/**
* Descibes the output of a function. Generally corresponds to the combination of an output socket
* and link combination in a node graph.
*/
class GField {
std::shared_ptr<FieldSource> source_;
int source_output_index_ = 0;
public:
GField() = default;
GField(std::shared_ptr<FieldSource> source, const int source_output_index = 0)
: source_(std::move(source)), source_output_index_(source_output_index)
{
}
operator bool() const
{
return source_ != nullptr;
}
const fn::CPPType &cpp_type() const
{
return source_->cpp_type_of_output_index(source_output_index_);
}
bool is_input() const
{
return source_->is_input();
}
const FieldSource &source() const
{
return *source_;
}
int source_output_index() const
{
return source_output_index_;
}
};
template<typename T> class Field : public GField {
public:
Field() = default;
Field(GField field) : GField(std::move(field))
{
BLI_assert(this->cpp_type().template is<T>());
}
};
class FieldOperation : public FieldSource {
std::unique_ptr<const MultiFunction> owned_function_;
const MultiFunction *function_;
blender::Vector<GField> inputs_;
public:
FieldOperation(std::unique_ptr<const MultiFunction> function, Vector<GField> inputs = {})
: owned_function_(std::move(function)), inputs_(std::move(inputs))
{
function_ = owned_function_.get();
}
FieldOperation(const MultiFunction &function, Vector<GField> inputs = {})
: function_(&function), inputs_(std::move(inputs))
{
}
Span<GField> inputs() const
{
return inputs_;
}
const MultiFunction &multi_function() const
{
return *function_;
}
const CPPType &cpp_type_of_output_index(int output_index) const override
{
int output_counter = 0;
for (const int param_index : function_->param_indices()) {
MFParamType param_type = function_->param_type(param_index);
if (param_type.is_output()) {
if (output_counter == output_index) {
return param_type.data_type().single_type();
}
output_counter++;
}
}
BLI_assert_unreachable();
return CPPType::get<float>();
}
};
class FieldInput : public FieldSource {
protected:
const CPPType *type_;
std::string debug_name_;
public:
FieldInput(const CPPType &type, std::string debug_name = "")
: type_(&type), debug_name_(std::move(debug_name))
{
}
virtual GVArrayPtr get_varray_generic_context(IndexMask mask) const = 0;
blender::StringRef debug_name() const
{
return debug_name_;
}
const CPPType &cpp_type() const
{
return *type_;
}
const CPPType &cpp_type_of_output_index(int output_index) const override
{
BLI_assert(output_index == 0);
return *type_;
}
bool is_input() const override
{
return true;
}
};
/**
* Evaluate more than one field at a time, as an optimization
* in case they share inputs or various intermediate values.
*/
void evaluate_fields(blender::Span<GField> fields,
blender::IndexMask mask,
blender::Span<GMutableSpan> outputs);
void evaluate_constant_field(const GField &field, void *r_value);
template<typename T> T evaluate_constant_field(const Field<T> &field)
{
T value;
value.~T();
evaluate_constant_field(field, &value);
return value;
}
template<typename T> Field<T> make_constant_field(T value)
{
auto constant_fn = std::make_unique<fn::CustomMF_Constant<T>>(std::forward<T>(value));
auto operation = std::make_shared<FieldOperation>(std::move(constant_fn));
return Field<T>{GField{std::move(operation), 0}};
}
} // namespace blender::fn
|
