Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
184 lines
5.2 KiB
C++
184 lines
5.2 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0 */
|
|
|
|
#include "testing/testing.h"
|
|
|
|
#include "FN_lazy_function_execute.hh"
|
|
#include "FN_lazy_function_graph.hh"
|
|
#include "FN_lazy_function_graph_executor.hh"
|
|
|
|
#include "BLI_task.h"
|
|
#include "BLI_timeit.hh"
|
|
|
|
namespace blender::fn::lazy_function::tests {
|
|
|
|
class AddLazyFunction : public LazyFunction {
|
|
public:
|
|
AddLazyFunction()
|
|
{
|
|
debug_name_ = "Add";
|
|
inputs_.append({"A", CPPType::get<int>()});
|
|
inputs_.append({"B", CPPType::get<int>()});
|
|
outputs_.append({"Result", CPPType::get<int>()});
|
|
}
|
|
|
|
void execute_impl(Params ¶ms, const Context & /*context*/) const override
|
|
{
|
|
const int a = params.get_input<int>(0);
|
|
const int b = params.get_input<int>(1);
|
|
params.set_output(0, a + b);
|
|
}
|
|
};
|
|
|
|
class StoreValueFunction : public LazyFunction {
|
|
private:
|
|
int *dst1_;
|
|
int *dst2_;
|
|
|
|
public:
|
|
StoreValueFunction(int *dst1, int *dst2) : dst1_(dst1), dst2_(dst2)
|
|
{
|
|
debug_name_ = "Store Value";
|
|
inputs_.append({"A", CPPType::get<int>()});
|
|
inputs_.append({"B", CPPType::get<int>(), ValueUsage::Maybe});
|
|
}
|
|
|
|
void execute_impl(Params ¶ms, const Context & /*context*/) const override
|
|
{
|
|
*dst1_ = params.get_input<int>(0);
|
|
if (int *value = params.try_get_input_data_ptr_or_request<int>(1)) {
|
|
*dst2_ = *value;
|
|
}
|
|
}
|
|
};
|
|
|
|
class SimpleSideEffectProvider : public GraphExecutor::SideEffectProvider {
|
|
private:
|
|
Vector<const FunctionNode *> side_effect_nodes_;
|
|
|
|
public:
|
|
SimpleSideEffectProvider(Span<const FunctionNode *> side_effect_nodes)
|
|
: side_effect_nodes_(side_effect_nodes)
|
|
{
|
|
}
|
|
|
|
Vector<const FunctionNode *> get_nodes_with_side_effects(
|
|
const Context & /*context*/) const override
|
|
{
|
|
return side_effect_nodes_;
|
|
}
|
|
};
|
|
|
|
TEST(lazy_function, SimpleAdd)
|
|
{
|
|
const AddLazyFunction add_fn;
|
|
int result = 0;
|
|
execute_lazy_function_eagerly(
|
|
add_fn, nullptr, nullptr, std::make_tuple(30, 5), std::make_tuple(&result));
|
|
EXPECT_EQ(result, 35);
|
|
}
|
|
|
|
TEST(lazy_function, SideEffects)
|
|
{
|
|
BLI_task_scheduler_init();
|
|
int dst1 = 0;
|
|
int dst2 = 0;
|
|
|
|
const AddLazyFunction add_fn;
|
|
const StoreValueFunction store_fn{&dst1, &dst2};
|
|
|
|
Graph graph;
|
|
FunctionNode &add_node_1 = graph.add_function(add_fn);
|
|
FunctionNode &add_node_2 = graph.add_function(add_fn);
|
|
FunctionNode &store_node = graph.add_function(store_fn);
|
|
DummyNode &input_node = graph.add_dummy({}, {&CPPType::get<int>()});
|
|
|
|
graph.add_link(input_node.output(0), add_node_1.input(0));
|
|
graph.add_link(input_node.output(0), add_node_2.input(0));
|
|
graph.add_link(add_node_1.output(0), store_node.input(0));
|
|
graph.add_link(add_node_2.output(0), store_node.input(1));
|
|
|
|
const int value_10 = 10;
|
|
const int value_100 = 100;
|
|
add_node_1.input(1).set_default_value(&value_10);
|
|
add_node_2.input(1).set_default_value(&value_100);
|
|
|
|
graph.update_node_indices();
|
|
|
|
SimpleSideEffectProvider side_effect_provider{{&store_node}};
|
|
|
|
GraphExecutor executor_fn{graph, {&input_node.output(0)}, {}, nullptr, &side_effect_provider};
|
|
execute_lazy_function_eagerly(
|
|
executor_fn, nullptr, nullptr, std::make_tuple(5), std::make_tuple());
|
|
|
|
EXPECT_EQ(dst1, 15);
|
|
EXPECT_EQ(dst2, 105);
|
|
}
|
|
|
|
class PartialEvaluationTestFunction : public LazyFunction {
|
|
public:
|
|
PartialEvaluationTestFunction()
|
|
{
|
|
debug_name_ = "Partial Evaluation";
|
|
allow_missing_requested_inputs_ = true;
|
|
|
|
inputs_.append_as("A", CPPType::get<int>(), ValueUsage::Used);
|
|
inputs_.append_as("B", CPPType::get<int>(), ValueUsage::Used);
|
|
|
|
outputs_.append_as("A*2", CPPType::get<int>());
|
|
outputs_.append_as("B*5", CPPType::get<int>());
|
|
}
|
|
|
|
void execute_impl(Params ¶ms, const Context & /*context*/) const override
|
|
{
|
|
if (!params.output_was_set(0)) {
|
|
if (int *a = params.try_get_input_data_ptr<int>(0)) {
|
|
params.set_output(0, *a * 2);
|
|
}
|
|
}
|
|
if (!params.output_was_set(1)) {
|
|
if (int *b = params.try_get_input_data_ptr<int>(1)) {
|
|
params.set_output(1, *b * 5);
|
|
}
|
|
}
|
|
}
|
|
|
|
void possible_output_dependencies(const int output_index,
|
|
FunctionRef<void(Span<int>)> fn) const override
|
|
{
|
|
/* Each output only depends on the input with the same index. */
|
|
const int input_index = output_index;
|
|
fn({input_index});
|
|
}
|
|
};
|
|
|
|
TEST(lazy_function, GraphWithCycle)
|
|
{
|
|
const PartialEvaluationTestFunction fn;
|
|
|
|
Graph graph;
|
|
FunctionNode &fn_node = graph.add_function(fn);
|
|
|
|
DummyNode &input_node = graph.add_dummy({}, {&CPPType::get<int>()});
|
|
DummyNode &output_node = graph.add_dummy({&CPPType::get<int>()}, {});
|
|
|
|
graph.add_link(input_node.output(0), fn_node.input(0));
|
|
/* Note: This creates a cycle in the graph. However, it should still be possible to evaluate it,
|
|
* because there is no actual data dependency in the cycle. */
|
|
graph.add_link(fn_node.output(0), fn_node.input(1));
|
|
graph.add_link(fn_node.output(1), output_node.input(0));
|
|
|
|
graph.update_node_indices();
|
|
|
|
GraphExecutor executor_fn{
|
|
graph, {&input_node.output(0)}, {&output_node.input(0)}, nullptr, nullptr};
|
|
int result = 0;
|
|
execute_lazy_function_eagerly(
|
|
executor_fn, nullptr, nullptr, std::make_tuple(10), std::make_tuple(&result));
|
|
|
|
EXPECT_EQ(result, 10 * 2 * 5);
|
|
}
|
|
|
|
} // namespace blender::fn::lazy_function::tests
|