Geometry Nodes: new Repeat Zone
This adds support for running a set of nodes repeatedly. The number of iterations can be controlled dynamically as an input of the repeat zone. The repeat zone can be added in via the search or from the Add > Utilities menu. The main use case is to replace long repetitive node chains with a more flexible alternative. Technically, repeat zones can also be used for many other use cases. However, due to their serial nature, performance is very sub-optimal when they are used to solve problems that could be processed in parallel. Better solutions for such use cases will be worked on separately. Repeat zones are similar to simulation zones. The major difference is that they have no concept of time and are always evaluated entirely in the current frame, while in simulations only a single iteration is evaluated per frame. Stopping the repetition early using a dynamic condition is not yet supported. "Break" functionality can be implemented manually using Switch nodes in the loop for now. It's likely that this functionality will be built into the repeat zone in the future. For now, things are kept more simple. Remaining Todos after this first version: * Improve socket inspection and viewer node support. Currently, only the first iteration is taken into account for socket inspection and the viewer. * Make loop evaluation more lazy. Currently, the evaluation is eager, meaning that it evaluates some nodes even though their output may not be required. Pull Request: https://projects.blender.org/blender/blender/pulls/109164
This commit is contained in:
@@ -78,4 +78,29 @@ class SimulationZoneComputeContext : public ComputeContext {
|
||||
void print_current_in_line(std::ostream &stream) const override;
|
||||
};
|
||||
|
||||
class RepeatZoneComputeContext : public ComputeContext {
|
||||
private:
|
||||
static constexpr const char *s_static_type = "REPEAT_ZONE";
|
||||
|
||||
int32_t output_node_id_;
|
||||
int iteration_;
|
||||
|
||||
public:
|
||||
RepeatZoneComputeContext(const ComputeContext *parent, int32_t output_node_id, int iteration);
|
||||
RepeatZoneComputeContext(const ComputeContext *parent, const bNode &node, int iteration);
|
||||
|
||||
int32_t output_node_id() const
|
||||
{
|
||||
return output_node_id_;
|
||||
}
|
||||
|
||||
int iteration() const
|
||||
{
|
||||
return iteration_;
|
||||
}
|
||||
|
||||
private:
|
||||
void print_current_in_line(std::ostream &stream) const override;
|
||||
};
|
||||
|
||||
} // namespace blender::bke
|
||||
|
||||
@@ -1361,6 +1361,10 @@ void BKE_nodetree_remove_layer_n(struct bNodeTree *ntree, struct Scene *scene, i
|
||||
#define GEO_NODE_INPUT_SIGNED_DISTANCE 2102
|
||||
#define GEO_NODE_SAMPLE_VOLUME 2103
|
||||
#define GEO_NODE_MESH_TOPOLOGY_CORNERS_OF_EDGE 2104
|
||||
/* Leaving out two indices to avoid crashes with files that were created during the development of
|
||||
* the repeat zone. */
|
||||
#define GEO_NODE_REPEAT_INPUT 2107
|
||||
#define GEO_NODE_REPEAT_OUTPUT 2108
|
||||
|
||||
/** \} */
|
||||
|
||||
|
||||
@@ -53,6 +53,7 @@ ModifierViewerPathElem *BKE_viewer_path_elem_new_modifier(void);
|
||||
GroupNodeViewerPathElem *BKE_viewer_path_elem_new_group_node(void);
|
||||
SimulationZoneViewerPathElem *BKE_viewer_path_elem_new_simulation_zone(void);
|
||||
ViewerNodeViewerPathElem *BKE_viewer_path_elem_new_viewer_node(void);
|
||||
RepeatZoneViewerPathElem *BKE_viewer_path_elem_new_repeat_zone(void);
|
||||
ViewerPathElem *BKE_viewer_path_elem_copy(const ViewerPathElem *src);
|
||||
bool BKE_viewer_path_elem_equal(const ViewerPathElem *a, const ViewerPathElem *b);
|
||||
void BKE_viewer_path_elem_free(ViewerPathElem *elem);
|
||||
|
||||
@@ -88,4 +88,33 @@ void SimulationZoneComputeContext::print_current_in_line(std::ostream &stream) c
|
||||
stream << "Simulation Zone ID: " << output_node_id_;
|
||||
}
|
||||
|
||||
RepeatZoneComputeContext::RepeatZoneComputeContext(const ComputeContext *parent,
|
||||
const int32_t output_node_id,
|
||||
const int iteration)
|
||||
: ComputeContext(s_static_type, parent), output_node_id_(output_node_id), iteration_(iteration)
|
||||
{
|
||||
/* Mix static type and node id into a single buffer so that only a single call to #mix_in is
|
||||
* necessary. */
|
||||
const int type_size = strlen(s_static_type);
|
||||
const int buffer_size = type_size + 1 + sizeof(int32_t) + sizeof(int);
|
||||
DynamicStackBuffer<64, 8> buffer_owner(buffer_size, 8);
|
||||
char *buffer = static_cast<char *>(buffer_owner.buffer());
|
||||
memcpy(buffer, s_static_type, type_size + 1);
|
||||
memcpy(buffer + type_size + 1, &output_node_id_, sizeof(int32_t));
|
||||
memcpy(buffer + type_size + 1 + sizeof(int32_t), &iteration_, sizeof(int));
|
||||
hash_.mix_in(buffer, buffer_size);
|
||||
}
|
||||
|
||||
RepeatZoneComputeContext::RepeatZoneComputeContext(const ComputeContext *parent,
|
||||
const bNode &node,
|
||||
const int iteration)
|
||||
: RepeatZoneComputeContext(parent, node.identifier, iteration)
|
||||
{
|
||||
}
|
||||
|
||||
void RepeatZoneComputeContext::print_current_in_line(std::ostream &stream) const
|
||||
{
|
||||
stream << "Repeat Zone ID: " << output_node_id_;
|
||||
}
|
||||
|
||||
} // namespace blender::bke
|
||||
|
||||
@@ -675,6 +675,14 @@ void ntreeBlendWrite(BlendWriter *writer, bNodeTree *ntree)
|
||||
BLO_write_string(writer, item.name);
|
||||
}
|
||||
}
|
||||
if (node->type == GEO_NODE_REPEAT_OUTPUT) {
|
||||
const NodeGeometryRepeatOutput &storage = *static_cast<const NodeGeometryRepeatOutput *>(
|
||||
node->storage);
|
||||
BLO_write_struct_array(writer, NodeRepeatItem, storage.items_num, storage.items);
|
||||
for (const NodeRepeatItem &item : Span(storage.items, storage.items_num)) {
|
||||
BLO_write_string(writer, item.name);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
LISTBASE_FOREACH (bNodeLink *, link, &ntree->links) {
|
||||
@@ -871,6 +879,15 @@ void ntreeBlendReadData(BlendDataReader *reader, ID *owner_id, bNodeTree *ntree)
|
||||
}
|
||||
break;
|
||||
}
|
||||
case GEO_NODE_REPEAT_OUTPUT: {
|
||||
NodeGeometryRepeatOutput &storage = *static_cast<NodeGeometryRepeatOutput *>(
|
||||
node->storage);
|
||||
BLO_read_data_address(reader, &storage.items);
|
||||
for (const NodeRepeatItem &item : Span(storage.items, storage.items_num)) {
|
||||
BLO_read_data_address(reader, &item.name);
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
default:
|
||||
break;
|
||||
|
||||
@@ -294,6 +294,17 @@ static Vector<const bNode *> get_implicit_origin_nodes(const bNodeTree &ntree, b
|
||||
}
|
||||
}
|
||||
}
|
||||
if (node.type == GEO_NODE_REPEAT_OUTPUT) {
|
||||
for (const bNode *repeat_input_node :
|
||||
ntree.runtime->nodes_by_type.lookup(nodeTypeFind("GeometryNodeRepeatInput")))
|
||||
{
|
||||
const auto &storage = *static_cast<const NodeGeometryRepeatInput *>(
|
||||
repeat_input_node->storage);
|
||||
if (storage.output_node_id == node.identifier) {
|
||||
origin_nodes.append(repeat_input_node);
|
||||
}
|
||||
}
|
||||
}
|
||||
return origin_nodes;
|
||||
}
|
||||
|
||||
@@ -306,6 +317,12 @@ static Vector<const bNode *> get_implicit_target_nodes(const bNodeTree &ntree, b
|
||||
target_nodes.append(sim_output_node);
|
||||
}
|
||||
}
|
||||
if (node.type == GEO_NODE_REPEAT_INPUT) {
|
||||
const auto &storage = *static_cast<const NodeGeometryRepeatInput *>(node.storage);
|
||||
if (const bNode *repeat_output_node = ntree.node_by_id(storage.output_node_id)) {
|
||||
target_nodes.append(repeat_output_node);
|
||||
}
|
||||
}
|
||||
return target_nodes;
|
||||
}
|
||||
|
||||
|
||||
@@ -99,6 +99,48 @@ static const aal::RelationsInNode &get_relations_in_node(const bNode &node, Reso
|
||||
}
|
||||
return relations;
|
||||
}
|
||||
if (ELEM(node.type, GEO_NODE_REPEAT_INPUT, GEO_NODE_REPEAT_OUTPUT)) {
|
||||
aal::RelationsInNode &relations = scope.construct<aal::RelationsInNode>();
|
||||
/* TODO: Add a smaller set of relations. This requires changing the inferencing algorithm to
|
||||
* make it aware of loops. */
|
||||
for (const bNodeSocket *socket : node.output_sockets()) {
|
||||
if (socket->type == SOCK_GEOMETRY) {
|
||||
for (const bNodeSocket *other_output : node.output_sockets()) {
|
||||
if (socket_is_field(*other_output)) {
|
||||
relations.available_relations.append({other_output->index(), socket->index()});
|
||||
}
|
||||
}
|
||||
for (const bNodeSocket *input_socket : node.input_sockets()) {
|
||||
if (input_socket->type == SOCK_GEOMETRY) {
|
||||
relations.propagate_relations.append({input_socket->index(), socket->index()});
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (socket_is_field(*socket)) {
|
||||
/* Reference relations are not added for the output node, because then nodes after the
|
||||
* repeat zone would have to know about the individual field sources within the repeat
|
||||
* zone. This is not necessary, because the field outputs of a repeat zone already serve as
|
||||
* field sources and anonymous attributes are extracted from them. */
|
||||
if (node.type == GEO_NODE_REPEAT_INPUT) {
|
||||
for (const bNodeSocket *input_socket : node.input_sockets()) {
|
||||
if (socket_is_field(*input_socket)) {
|
||||
relations.reference_relations.append({input_socket->index(), socket->index()});
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
for (const bNodeSocket *socket : node.input_sockets()) {
|
||||
if (socket->type == SOCK_GEOMETRY) {
|
||||
for (const bNodeSocket *other_input : node.input_sockets()) {
|
||||
if (socket_is_field(*other_input)) {
|
||||
relations.eval_relations.append({other_input->index(), socket->index()});
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return relations;
|
||||
}
|
||||
if (const NodeDeclaration *node_decl = node.declaration()) {
|
||||
if (const aal::RelationsInNode *relations = node_decl->anonymous_attribute_relations()) {
|
||||
return *relations;
|
||||
|
||||
@@ -319,6 +319,22 @@ static eFieldStateSyncResult simulation_nodes_field_state_sync(
|
||||
return res;
|
||||
}
|
||||
|
||||
static eFieldStateSyncResult repeat_field_state_sync(
|
||||
const bNode &input_node,
|
||||
const bNode &output_node,
|
||||
const MutableSpan<SocketFieldState> field_state_by_socket_id)
|
||||
{
|
||||
eFieldStateSyncResult res = eFieldStateSyncResult::NONE;
|
||||
for (const int i : output_node.output_sockets().index_range()) {
|
||||
const bNodeSocket &input_socket = input_node.output_socket(i);
|
||||
const bNodeSocket &output_socket = output_node.output_socket(i);
|
||||
SocketFieldState &input_state = field_state_by_socket_id[input_socket.index_in_tree()];
|
||||
SocketFieldState &output_state = field_state_by_socket_id[output_socket.index_in_tree()];
|
||||
res |= sync_field_states(input_state, output_state);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
static bool propagate_special_data_requirements(
|
||||
const bNodeTree &tree,
|
||||
const bNode &node,
|
||||
@@ -328,29 +344,59 @@ static bool propagate_special_data_requirements(
|
||||
|
||||
bool need_update = false;
|
||||
|
||||
/* Sync field state between simulation nodes and schedule another pass if necessary. */
|
||||
if (node.type == GEO_NODE_SIMULATION_INPUT) {
|
||||
const NodeGeometrySimulationInput &data = *static_cast<const NodeGeometrySimulationInput *>(
|
||||
node.storage);
|
||||
if (const bNode *output_node = tree.node_by_id(data.output_node_id)) {
|
||||
const eFieldStateSyncResult sync_result = simulation_nodes_field_state_sync(
|
||||
node, *output_node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_B)) {
|
||||
need_update = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (node.type == GEO_NODE_SIMULATION_OUTPUT) {
|
||||
for (const bNode *input_node : tree.nodes_by_type("GeometryNodeSimulationInput")) {
|
||||
/* Sync field state between zone nodes and schedule another pass if necessary. */
|
||||
switch (node.type) {
|
||||
case GEO_NODE_SIMULATION_INPUT: {
|
||||
const NodeGeometrySimulationInput &data = *static_cast<const NodeGeometrySimulationInput *>(
|
||||
input_node->storage);
|
||||
if (node.identifier == data.output_node_id) {
|
||||
node.storage);
|
||||
if (const bNode *output_node = tree.node_by_id(data.output_node_id)) {
|
||||
const eFieldStateSyncResult sync_result = simulation_nodes_field_state_sync(
|
||||
*input_node, node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_A)) {
|
||||
node, *output_node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_B)) {
|
||||
need_update = true;
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
case GEO_NODE_SIMULATION_OUTPUT: {
|
||||
for (const bNode *input_node : tree.nodes_by_type("GeometryNodeSimulationInput")) {
|
||||
const NodeGeometrySimulationInput &data =
|
||||
*static_cast<const NodeGeometrySimulationInput *>(input_node->storage);
|
||||
if (node.identifier == data.output_node_id) {
|
||||
const eFieldStateSyncResult sync_result = simulation_nodes_field_state_sync(
|
||||
*input_node, node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_A)) {
|
||||
need_update = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
case GEO_NODE_REPEAT_INPUT: {
|
||||
const NodeGeometryRepeatInput &data = *static_cast<const NodeGeometryRepeatInput *>(
|
||||
node.storage);
|
||||
if (const bNode *output_node = tree.node_by_id(data.output_node_id)) {
|
||||
const eFieldStateSyncResult sync_result = repeat_field_state_sync(
|
||||
node, *output_node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_B)) {
|
||||
need_update = true;
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
case GEO_NODE_REPEAT_OUTPUT: {
|
||||
for (const bNode *input_node : tree.nodes_by_type("GeometryNodeRepeatInput")) {
|
||||
const NodeGeometryRepeatInput &data = *static_cast<const NodeGeometryRepeatInput *>(
|
||||
input_node->storage);
|
||||
if (node.identifier == data.output_node_id) {
|
||||
const eFieldStateSyncResult sync_result = repeat_field_state_sync(
|
||||
*input_node, node, field_state_by_socket_id);
|
||||
if (bool(sync_result & eFieldStateSyncResult::CHANGED_A)) {
|
||||
need_update = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -365,8 +411,8 @@ static void propagate_data_requirements_from_right_to_left(
|
||||
const Span<const bNode *> toposort_result = tree.toposort_right_to_left();
|
||||
|
||||
while (true) {
|
||||
/* Node updates may require several passes due to cyclic dependencies caused by simulation
|
||||
* input/output nodes. */
|
||||
/* Node updates may require several passes due to cyclic dependencies caused by simulation or
|
||||
* repeat input/output nodes. */
|
||||
bool need_update = false;
|
||||
|
||||
for (const bNode *node : toposort_result) {
|
||||
|
||||
@@ -588,6 +588,15 @@ class NodeTreeMainUpdater {
|
||||
}
|
||||
}
|
||||
}
|
||||
if (node.type == GEO_NODE_REPEAT_INPUT) {
|
||||
const NodeGeometryRepeatInput *data = static_cast<const NodeGeometryRepeatInput *>(
|
||||
node.storage);
|
||||
if (const bNode *output_node = ntree.node_by_id(data->output_node_id)) {
|
||||
if (output_node->runtime->changed_flag & NTREE_CHANGED_NODE_PROPERTY) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
@@ -33,7 +33,10 @@ static Vector<std::unique_ptr<bNodeTreeZone>> find_zone_nodes(
|
||||
Map<const bNode *, bNodeTreeZone *> &r_zone_by_inout_node)
|
||||
{
|
||||
Vector<std::unique_ptr<bNodeTreeZone>> zones;
|
||||
for (const bNode *node : tree.nodes_by_type("GeometryNodeSimulationOutput")) {
|
||||
Vector<const bNode *> zone_output_nodes;
|
||||
zone_output_nodes.extend(tree.nodes_by_type("GeometryNodeSimulationOutput"));
|
||||
zone_output_nodes.extend(tree.nodes_by_type("GeometryNodeRepeatOutput"));
|
||||
for (const bNode *node : zone_output_nodes) {
|
||||
auto zone = std::make_unique<bNodeTreeZone>();
|
||||
zone->owner = &owner;
|
||||
zone->index = zones.size();
|
||||
@@ -50,6 +53,15 @@ static Vector<std::unique_ptr<bNodeTreeZone>> find_zone_nodes(
|
||||
}
|
||||
}
|
||||
}
|
||||
for (const bNode *node : tree.nodes_by_type("GeometryNodeRepeatInput")) {
|
||||
const auto &storage = *static_cast<NodeGeometryRepeatInput *>(node->storage);
|
||||
if (const bNode *repeat_output_node = tree.node_by_id(storage.output_node_id)) {
|
||||
if (bNodeTreeZone *zone = r_zone_by_inout_node.lookup_default(repeat_output_node, nullptr)) {
|
||||
zone->input_node = node;
|
||||
r_zone_by_inout_node.add(node, zone);
|
||||
}
|
||||
}
|
||||
}
|
||||
return zones;
|
||||
}
|
||||
|
||||
@@ -227,13 +239,13 @@ static std::unique_ptr<bNodeTreeZones> discover_tree_zones(const bNodeTree &tree
|
||||
depend_on_output_flags |= depend_on_output_flag_array[from_node_i];
|
||||
}
|
||||
}
|
||||
if (node->type == GEO_NODE_SIMULATION_INPUT) {
|
||||
if (ELEM(node->type, GEO_NODE_SIMULATION_INPUT, GEO_NODE_REPEAT_INPUT)) {
|
||||
if (const bNodeTreeZone *zone = zone_by_inout_node.lookup_default(node, nullptr)) {
|
||||
/* Now entering a zone, so set the corresponding bit. */
|
||||
depend_on_input_flags[zone->index].set();
|
||||
}
|
||||
}
|
||||
else if (node->type == GEO_NODE_SIMULATION_OUTPUT) {
|
||||
else if (ELEM(node->type, GEO_NODE_SIMULATION_OUTPUT, GEO_NODE_REPEAT_OUTPUT)) {
|
||||
if (const bNodeTreeZone *zone = zone_by_inout_node.lookup_default(node, nullptr)) {
|
||||
/* The output is implicitly linked to the input, so also propagate the bits from there. */
|
||||
if (const bNode *zone_input_node = zone->input_node) {
|
||||
|
||||
@@ -88,6 +88,11 @@ void BKE_viewer_path_blend_write(BlendWriter *writer, const ViewerPath *viewer_p
|
||||
BLO_write_struct(writer, ViewerNodeViewerPathElem, typed_elem);
|
||||
break;
|
||||
}
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
const auto *typed_elem = reinterpret_cast<RepeatZoneViewerPathElem *>(elem);
|
||||
BLO_write_struct(writer, RepeatZoneViewerPathElem, typed_elem);
|
||||
break;
|
||||
}
|
||||
}
|
||||
BLO_write_string(writer, elem->ui_name);
|
||||
}
|
||||
@@ -102,6 +107,7 @@ void BKE_viewer_path_blend_read_data(BlendDataReader *reader, ViewerPath *viewer
|
||||
case VIEWER_PATH_ELEM_TYPE_GROUP_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_SIMULATION_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_ID: {
|
||||
break;
|
||||
}
|
||||
@@ -126,7 +132,8 @@ void BKE_viewer_path_blend_read_lib(BlendLibReader *reader, ID *self_id, ViewerP
|
||||
case VIEWER_PATH_ELEM_TYPE_MODIFIER:
|
||||
case VIEWER_PATH_ELEM_TYPE_GROUP_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_SIMULATION_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE: {
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -145,7 +152,8 @@ void BKE_viewer_path_foreach_id(LibraryForeachIDData *data, ViewerPath *viewer_p
|
||||
case VIEWER_PATH_ELEM_TYPE_MODIFIER:
|
||||
case VIEWER_PATH_ELEM_TYPE_GROUP_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_SIMULATION_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE: {
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -164,7 +172,8 @@ void BKE_viewer_path_id_remap(ViewerPath *viewer_path, const IDRemapper *mapping
|
||||
case VIEWER_PATH_ELEM_TYPE_MODIFIER:
|
||||
case VIEWER_PATH_ELEM_TYPE_GROUP_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_SIMULATION_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE: {
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
break;
|
||||
}
|
||||
}
|
||||
@@ -196,6 +205,9 @@ ViewerPathElem *BKE_viewer_path_elem_new(const ViewerPathElemType type)
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE: {
|
||||
return &make_elem<ViewerNodeViewerPathElem>(type)->base;
|
||||
}
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
return &make_elem<RepeatZoneViewerPathElem>(type)->base;
|
||||
}
|
||||
}
|
||||
BLI_assert_unreachable();
|
||||
return nullptr;
|
||||
@@ -230,6 +242,12 @@ ViewerNodeViewerPathElem *BKE_viewer_path_elem_new_viewer_node()
|
||||
BKE_viewer_path_elem_new(VIEWER_PATH_ELEM_TYPE_VIEWER_NODE));
|
||||
}
|
||||
|
||||
RepeatZoneViewerPathElem *BKE_viewer_path_elem_new_repeat_zone()
|
||||
{
|
||||
return reinterpret_cast<RepeatZoneViewerPathElem *>(
|
||||
BKE_viewer_path_elem_new(VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE));
|
||||
}
|
||||
|
||||
ViewerPathElem *BKE_viewer_path_elem_copy(const ViewerPathElem *src)
|
||||
{
|
||||
ViewerPathElem *dst = BKE_viewer_path_elem_new(ViewerPathElemType(src->type));
|
||||
@@ -269,6 +287,13 @@ ViewerPathElem *BKE_viewer_path_elem_copy(const ViewerPathElem *src)
|
||||
new_elem->node_id = old_elem->node_id;
|
||||
break;
|
||||
}
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
const auto *old_elem = reinterpret_cast<const RepeatZoneViewerPathElem *>(src);
|
||||
auto *new_elem = reinterpret_cast<RepeatZoneViewerPathElem *>(dst);
|
||||
new_elem->repeat_output_node_id = old_elem->repeat_output_node_id;
|
||||
new_elem->iteration = old_elem->iteration;
|
||||
break;
|
||||
}
|
||||
}
|
||||
return dst;
|
||||
}
|
||||
@@ -304,6 +329,12 @@ bool BKE_viewer_path_elem_equal(const ViewerPathElem *a, const ViewerPathElem *b
|
||||
const auto *b_elem = reinterpret_cast<const ViewerNodeViewerPathElem *>(b);
|
||||
return a_elem->node_id == b_elem->node_id;
|
||||
}
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
const auto *a_elem = reinterpret_cast<const RepeatZoneViewerPathElem *>(a);
|
||||
const auto *b_elem = reinterpret_cast<const RepeatZoneViewerPathElem *>(b);
|
||||
return a_elem->repeat_output_node_id == b_elem->repeat_output_node_id &&
|
||||
a_elem->iteration == b_elem->iteration;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
@@ -314,7 +345,8 @@ void BKE_viewer_path_elem_free(ViewerPathElem *elem)
|
||||
case VIEWER_PATH_ELEM_TYPE_ID:
|
||||
case VIEWER_PATH_ELEM_TYPE_GROUP_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_SIMULATION_ZONE:
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE: {
|
||||
case VIEWER_PATH_ELEM_TYPE_VIEWER_NODE:
|
||||
case VIEWER_PATH_ELEM_TYPE_REPEAT_ZONE: {
|
||||
break;
|
||||
}
|
||||
case VIEWER_PATH_ELEM_TYPE_MODIFIER: {
|
||||
|
||||
Reference in New Issue
Block a user