diff options
author | Hans Goudey <h.goudey@me.com> | 2022-01-18 22:32:36 +0300 |
---|---|---|
committer | Hans Goudey <h.goudey@me.com> | 2022-01-18 22:32:36 +0300 |
commit | 221ff895d962a305d37eafd72f236a84d2e979b8 (patch) | |
tree | 2619008fd6fbdeb312df8de2119e56cb21b7f35f /source/blender/editors/space_node/node_draw.cc | |
parent | a5610da1d5ece3a3800d65cff1da926ca6ccf6c2 (diff) |
Cleanup: Use references, LISTBASE_FOREACH macro
Diffstat (limited to 'source/blender/editors/space_node/node_draw.cc')
-rw-r--r-- | source/blender/editors/space_node/node_draw.cc | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/editors/space_node/node_draw.cc b/source/blender/editors/space_node/node_draw.cc index a68d34f7682..ee6dbc15c15 100644 --- a/source/blender/editors/space_node/node_draw.cc +++ b/source/blender/editors/space_node/node_draw.cc @@ -232,14 +232,14 @@ static bool compare_nodes(const bNode *a, const bNode *b) return false; } -void node_sort(bNodeTree *ntree) +void node_sort(bNodeTree &ntree) { /* Merge sort is the algorithm of choice here. */ - int totnodes = BLI_listbase_count(&ntree->nodes); + int totnodes = BLI_listbase_count(&ntree.nodes); int k = 1; while (k < totnodes) { - bNode *first_a = (bNode *)ntree->nodes.first; + bNode *first_a = (bNode *)ntree.nodes.first; bNode *first_b = first_a; do { @@ -266,8 +266,8 @@ void node_sort(bNodeTree *ntree) bNode *tmp = node_b; node_b = node_b->next; b++; - BLI_remlink(&ntree->nodes, tmp); - BLI_insertlinkbefore(&ntree->nodes, node_a, tmp); + BLI_remlink(&ntree.nodes, tmp); + BLI_insertlinkbefore(&ntree.nodes, node_a, tmp); } } |