This patch adds support for _Menu Switch_ nodes and enum definitions in node trees more generally. The design is based on the outcome of the [2022 Nodes Workshop](https://code.blender.org/2022/11/geometry-nodes-workshop-2022/#menu-switch). The _Menu Switch_ node is an advanced version of the _Switch_ node which has a customizable **menu input socket** instead of a simple boolean. The _items_ of this menu are owned by the node itself. Each item has a name and description and unique identifier that is used internally. A menu _socket_ represents a concrete value out of the list of items. To enable selection of an enum value for unconnected sockets the menu is presented as a dropdown list like built-in enums. When the socket is connected a shared pointer to the enum definition is propagated along links and stored in socket default values. This allows node groups to expose a menu from an internal menu switch as a parameter. The enum definition is a runtime copy of the enum items in DNA that allows sharing. A menu socket can have multiple connections, which can lead to ambiguity. If two or more different menu source nodes are connected to a socket it gets marked as _undefined_. Any connection to an undefined menu socket is invalid as a hint to users that there is a problem. A warning/error is also shown on nodes with undefined menu sockets. At runtime the value of a menu socket is the simple integer identifier. This can also be a field in geometry nodes. The identifier is unique within each enum definition, and it is persistent even when items are added, removed, or changed. Changing the name of an item does not affect the internal identifier, so users can rename enum items without breaking existing input values. This also persists if, for example, a linked node group is temporarily unavailable. Pull Request: https://projects.blender.org/blender/blender/pulls/113445
150 lines
4.1 KiB
C++
150 lines
4.1 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#include "BLI_string.h"
|
|
#include "BLI_string_utils.hh"
|
|
|
|
#include "DNA_array_utils.hh"
|
|
#include "DNA_node_types.h"
|
|
|
|
#include "BKE_node.h"
|
|
#include "BKE_node_enum.hh"
|
|
#include "BKE_node_runtime.hh"
|
|
|
|
using blender::bke::NodeSocketValueMenuRuntimeFlag;
|
|
|
|
bool bNodeSocketValueMenu::has_conflict() const
|
|
{
|
|
return this->runtime_flag & NodeSocketValueMenuRuntimeFlag::NODE_MENU_ITEMS_CONFLICT;
|
|
}
|
|
|
|
blender::Span<NodeEnumItem> NodeEnumDefinition::items() const
|
|
{
|
|
return {this->items_array, this->items_num};
|
|
}
|
|
|
|
blender::MutableSpan<NodeEnumItem> NodeEnumDefinition::items_for_write()
|
|
{
|
|
return {this->items_array, this->items_num};
|
|
}
|
|
|
|
NodeEnumItem *NodeEnumDefinition::add_item(blender::StringRef name)
|
|
{
|
|
const int insert_index = this->items_num;
|
|
NodeEnumItem *old_items = this->items_array;
|
|
|
|
this->items_array = MEM_cnew_array<NodeEnumItem>(this->items_num + 1, __func__);
|
|
std::copy_n(old_items, insert_index, this->items_array);
|
|
NodeEnumItem &new_item = this->items_array[insert_index];
|
|
std::copy_n(old_items + insert_index + 1,
|
|
this->items_num - insert_index,
|
|
this->items_array + insert_index + 1);
|
|
|
|
new_item.identifier = this->next_identifier++;
|
|
this->set_item_name(new_item, name);
|
|
|
|
this->items_num++;
|
|
MEM_SAFE_FREE(old_items);
|
|
|
|
return &new_item;
|
|
}
|
|
|
|
static void free_enum_item(NodeEnumItem *item)
|
|
{
|
|
MEM_SAFE_FREE(item->name);
|
|
MEM_SAFE_FREE(item->description);
|
|
}
|
|
|
|
bool NodeEnumDefinition::remove_item(NodeEnumItem &item)
|
|
{
|
|
if (!this->items().contains_ptr(&item)) {
|
|
return false;
|
|
}
|
|
const int remove_index = &item - this->items().begin();
|
|
/* DNA fields are 16 bits, can't use directly. */
|
|
int items_num = this->items_num;
|
|
int active_index = this->active_index;
|
|
blender::dna::array::remove_index(
|
|
&this->items_array, &items_num, &active_index, remove_index, free_enum_item);
|
|
this->items_num = int16_t(items_num);
|
|
this->active_index = int16_t(active_index);
|
|
return true;
|
|
}
|
|
|
|
void NodeEnumDefinition::clear()
|
|
{
|
|
/* DNA fields are 16 bits, can't use directly. */
|
|
int items_num = this->items_num;
|
|
int active_index = this->active_index;
|
|
blender::dna::array::clear(&this->items_array, &items_num, &active_index, free_enum_item);
|
|
this->items_num = int16_t(items_num);
|
|
this->active_index = int16_t(active_index);
|
|
}
|
|
|
|
bool NodeEnumDefinition::move_item(uint16_t from_index, uint16_t to_index)
|
|
{
|
|
if (to_index < this->items_num) {
|
|
int items_num = this->items_num;
|
|
int active_index = this->active_index;
|
|
blender::dna::array::move_index(this->items_array, items_num, from_index, to_index);
|
|
this->items_num = int16_t(items_num);
|
|
this->active_index = int16_t(active_index);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
const NodeEnumItem *NodeEnumDefinition::active_item() const
|
|
{
|
|
if (blender::IndexRange(this->items_num).contains(this->active_index)) {
|
|
return &this->items()[this->active_index];
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
NodeEnumItem *NodeEnumDefinition::active_item()
|
|
{
|
|
if (blender::IndexRange(this->items_num).contains(this->active_index)) {
|
|
return &this->items_for_write()[this->active_index];
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void NodeEnumDefinition::active_item_set(NodeEnumItem *item)
|
|
{
|
|
this->active_index = this->items().contains_ptr(item) ? item - this->items_array : -1;
|
|
}
|
|
|
|
void NodeEnumDefinition::set_item_name(NodeEnumItem &item, blender::StringRef name)
|
|
{
|
|
char unique_name[MAX_NAME + 4];
|
|
STRNCPY(unique_name, name.data());
|
|
|
|
struct Args {
|
|
NodeEnumDefinition *enum_def;
|
|
const NodeEnumItem *item;
|
|
} args = {this, &item};
|
|
|
|
const char *default_name = items().is_empty() ? "Name" : items().last().name;
|
|
BLI_uniquename_cb(
|
|
[](void *arg, const char *name) {
|
|
const Args &args = *static_cast<Args *>(arg);
|
|
for (const NodeEnumItem &item : args.enum_def->items()) {
|
|
if (&item != args.item) {
|
|
if (STREQ(item.name, name)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
},
|
|
&args,
|
|
default_name,
|
|
'.',
|
|
unique_name,
|
|
ARRAY_SIZE(unique_name));
|
|
|
|
MEM_SAFE_FREE(item.name);
|
|
item.name = BLI_strdup(unique_name);
|
|
}
|