Changeset View
Changeset View
Standalone View
Standalone View
source/blender/blenkernel/BKE_node.h
| Show First 20 Lines • Show All 786 Lines • ▼ Show 20 Lines | |||||
| /** | /** | ||||
| * Iterate over all parents of \a node, executing \a callback for each parent | * Iterate over all parents of \a node, executing \a callback for each parent | ||||
| * (which can return false to end iterator) | * (which can return false to end iterator) | ||||
| * | * | ||||
| * \note Recursive | * \note Recursive | ||||
| */ | */ | ||||
| void nodeParentsIter(bNode *node, bool (*callback)(bNode *, void *), void *userdata); | void nodeParentsIter(bNode *node, bool (*callback)(bNode *, void *), void *userdata); | ||||
| /** | |||||
| * A dangling reroute node is a reroute node that does *not* have a "data source", i.e. no | |||||
| * non-reroute node is connected to its input. | |||||
| */ | |||||
| bool nodeIsDanglingReroute(const struct bNodeTree *ntree, const struct bNode *node); | |||||
| struct bNodeLink *nodeFindLink(struct bNodeTree *ntree, | struct bNodeLink *nodeFindLink(struct bNodeTree *ntree, | ||||
| const struct bNodeSocket *from, | const struct bNodeSocket *from, | ||||
| const struct bNodeSocket *to); | const struct bNodeSocket *to); | ||||
| int nodeCountSocketLinks(const struct bNodeTree *ntree, const struct bNodeSocket *sock); | int nodeCountSocketLinks(const struct bNodeTree *ntree, const struct bNodeSocket *sock); | ||||
| void nodeSetSelected(struct bNode *node, bool select); | void nodeSetSelected(struct bNode *node, bool select); | ||||
| /** | /** | ||||
| * Two active flags, ID nodes have special flag for buttons display. | * Two active flags, ID nodes have special flag for buttons display. | ||||
| ▲ Show 20 Lines • Show All 803 Lines • Show Last 20 Lines | |||||