Nodes: separate node name and display name in bNodeTreePath

Previously, `node_name` was rarely actually a name of a node. It is set
correctly as node name in `ED_node_tree_push`. However, later on it
was overwritten by the name of an id data block in `node_draw_space`.

Now, the node_name stays the name of the "parent" node. Whereas
display_name is the name that will be displayed in the breadcrumbs.

With this change, the `node_name` can be used to reconstruct the
actual path from the root node tree to the currently visible tree.

Differential Revision: https://developer.blender.org/D10874
This commit is contained in:
Jacques Lucke 2021-04-01 14:36:44 +02:00
parent 1bdceb813c
commit b00727950c
Notes: blender-bot 2023-02-13 17:11:55 +01:00
Referenced by issue #82812, Including node group attribute into NodeTreePath
4 changed files with 25 additions and 10 deletions

View File

@ -1970,5 +1970,18 @@ void blo_do_versions_290(FileData *fd, Library *UNUSED(lib), Main *bmain)
la->area_spread = DEG2RADF(180.0f);
}
}
LISTBASE_FOREACH (bScreen *, screen, &bmain->screens) {
LISTBASE_FOREACH (ScrArea *, area, &screen->areabase) {
LISTBASE_FOREACH (SpaceLink *, sl, &area->spacedata) {
if (sl->spacetype == SPACE_NODE) {
SpaceNode *snode = (SpaceNode *)sl;
LISTBASE_FOREACH (bNodeTreePath *, path, &snode->treepath) {
STRNCPY(path->display_name, path->node_name);
}
}
}
}
}
}
}

View File

@ -1959,8 +1959,8 @@ void node_draw_space(const bContext *C, ARegion *region)
ID *name_id = (path->nodetree && path->nodetree != snode->nodetree) ? &path->nodetree->id :
snode->id;
if (name_id && UNLIKELY(!STREQ(path->node_name, name_id->name + 2))) {
BLI_strncpy(path->node_name, name_id->name + 2, sizeof(path->node_name));
if (name_id && UNLIKELY(!STREQ(path->display_name, name_id->name + 2))) {
BLI_strncpy(path->display_name, name_id->name + 2, sizeof(path->display_name));
}
/* Current View2D center, will be set temporarily for parent node trees. */

View File

@ -74,7 +74,7 @@ void ED_node_tree_start(SpaceNode *snode, bNodeTree *ntree, ID *id, ID *from)
copy_v2_v2(path->view_center, ntree->view_center);
if (id) {
BLI_strncpy(path->node_name, id->name + 2, sizeof(path->node_name));
BLI_strncpy(path->display_name, id->name + 2, sizeof(path->display_name));
}
BLI_addtail(&snode->treepath, path);
@ -111,6 +111,7 @@ void ED_node_tree_push(SpaceNode *snode, bNodeTree *ntree, bNode *gnode)
}
BLI_strncpy(path->node_name, gnode->name, sizeof(path->node_name));
BLI_strncpy(path->display_name, gnode->name, sizeof(path->display_name));
}
else {
path->parent_key = NODE_INSTANCE_KEY_BASE;
@ -175,7 +176,7 @@ int ED_node_tree_path_length(SpaceNode *snode)
int length = 0;
int i = 0;
LISTBASE_FOREACH_INDEX (bNodeTreePath *, path, &snode->treepath, i) {
length += strlen(path->node_name);
length += strlen(path->display_name);
if (i > 0) {
length += 1; /* for separator char */
}
@ -190,12 +191,12 @@ void ED_node_tree_path_get(SpaceNode *snode, char *value)
value[0] = '\0';
LISTBASE_FOREACH_INDEX (bNodeTreePath *, path, &snode->treepath, i) {
if (i == 0) {
strcpy(value, path->node_name);
value += strlen(path->node_name);
strcpy(value, path->display_name);
value += strlen(path->display_name);
}
else {
sprintf(value, "/%s", path->node_name);
value += strlen(path->node_name) + 1;
sprintf(value, "/%s", path->display_name);
value += strlen(path->display_name) + 1;
}
}
}
@ -208,10 +209,10 @@ void ED_node_tree_path_get_fixedbuf(SpaceNode *snode, char *value, int max_lengt
int i = 0;
LISTBASE_FOREACH_INDEX (bNodeTreePath *, path, &snode->treepath, i) {
if (i == 0) {
size = BLI_strncpy_rlen(value, path->node_name, max_length);
size = BLI_strncpy_rlen(value, path->display_name, max_length);
}
else {
size = BLI_snprintf_rlen(value, max_length, "/%s", path->node_name);
size = BLI_snprintf_rlen(value, max_length, "/%s", path->display_name);
}
max_length -= size;
if (max_length <= 0) {

View File

@ -1520,6 +1520,7 @@ typedef struct bNodeTreePath {
/** MAX_NAME. */
char node_name[64];
char display_name[64];
} bNodeTreePath;
typedef struct SpaceNode {