c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
111 lines
2.7 KiB
C++
111 lines
2.7 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2020 Blender Foundation. All rights reserved. */
|
|
|
|
#include "pipeline_from_ids.h"
|
|
|
|
#include "DNA_layer_types.h"
|
|
|
|
#include "intern/builder/deg_builder_nodes.h"
|
|
#include "intern/builder/deg_builder_relations.h"
|
|
#include "intern/depsgraph.h"
|
|
|
|
namespace blender::deg {
|
|
|
|
namespace {
|
|
|
|
class DepsgraphFromIDsFilter {
|
|
public:
|
|
DepsgraphFromIDsFilter(Span<ID *> ids)
|
|
{
|
|
ids_.add_multiple(ids);
|
|
}
|
|
|
|
bool contains(ID *id)
|
|
{
|
|
return ids_.contains(id);
|
|
}
|
|
|
|
protected:
|
|
Set<ID *> ids_;
|
|
};
|
|
|
|
class DepsgraphFromIDsNodeBuilder : public DepsgraphNodeBuilder {
|
|
public:
|
|
DepsgraphFromIDsNodeBuilder(Main *bmain,
|
|
Depsgraph *graph,
|
|
DepsgraphBuilderCache *cache,
|
|
Span<ID *> ids)
|
|
: DepsgraphNodeBuilder(bmain, graph, cache), filter_(ids)
|
|
{
|
|
}
|
|
|
|
bool need_pull_base_into_graph(Base *base) override
|
|
{
|
|
if (!filter_.contains(&base->object->id)) {
|
|
return false;
|
|
}
|
|
return DepsgraphNodeBuilder::need_pull_base_into_graph(base);
|
|
}
|
|
|
|
protected:
|
|
DepsgraphFromIDsFilter filter_;
|
|
};
|
|
|
|
class DepsgraphFromIDsRelationBuilder : public DepsgraphRelationBuilder {
|
|
public:
|
|
DepsgraphFromIDsRelationBuilder(Main *bmain,
|
|
Depsgraph *graph,
|
|
DepsgraphBuilderCache *cache,
|
|
Span<ID *> ids)
|
|
: DepsgraphRelationBuilder(bmain, graph, cache), filter_(ids)
|
|
{
|
|
}
|
|
|
|
bool need_pull_base_into_graph(Base *base) override
|
|
{
|
|
if (!filter_.contains(&base->object->id)) {
|
|
return false;
|
|
}
|
|
return DepsgraphRelationBuilder::need_pull_base_into_graph(base);
|
|
}
|
|
|
|
protected:
|
|
DepsgraphFromIDsFilter filter_;
|
|
};
|
|
|
|
} // namespace
|
|
|
|
FromIDsBuilderPipeline::FromIDsBuilderPipeline(::Depsgraph *graph, Span<ID *> ids)
|
|
: AbstractBuilderPipeline(graph), ids_(ids)
|
|
{
|
|
}
|
|
|
|
unique_ptr<DepsgraphNodeBuilder> FromIDsBuilderPipeline::construct_node_builder()
|
|
{
|
|
return std::make_unique<DepsgraphFromIDsNodeBuilder>(bmain_, deg_graph_, &builder_cache_, ids_);
|
|
}
|
|
|
|
unique_ptr<DepsgraphRelationBuilder> FromIDsBuilderPipeline::construct_relation_builder()
|
|
{
|
|
return std::make_unique<DepsgraphFromIDsRelationBuilder>(
|
|
bmain_, deg_graph_, &builder_cache_, ids_);
|
|
}
|
|
|
|
void FromIDsBuilderPipeline::build_nodes(DepsgraphNodeBuilder &node_builder)
|
|
{
|
|
node_builder.build_view_layer(scene_, view_layer_, DEG_ID_LINKED_DIRECTLY);
|
|
for (ID *id : ids_) {
|
|
node_builder.build_id(id);
|
|
}
|
|
}
|
|
|
|
void FromIDsBuilderPipeline::build_relations(DepsgraphRelationBuilder &relation_builder)
|
|
{
|
|
relation_builder.build_view_layer(scene_, view_layer_, DEG_ID_LINKED_DIRECTLY);
|
|
for (ID *id : ids_) {
|
|
relation_builder.build_id(id);
|
|
}
|
|
}
|
|
|
|
} // namespace blender::deg
|