base_definitions.py 38 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900
  1. #Mantis Nodes Base
  2. import bpy
  3. from bpy.props import (BoolProperty, StringProperty, EnumProperty, CollectionProperty, \
  4. IntProperty, IntVectorProperty, PointerProperty, BoolVectorProperty)
  5. from . import ops_nodegroup
  6. from bpy.types import NodeTree, Node, PropertyGroup, Operator, UIList, Panel
  7. from .utilities import (prRed, prGreen, prPurple, prWhite,
  8. prOrange,
  9. wrapRed, wrapGreen, wrapPurple, wrapWhite,
  10. wrapOrange,)
  11. from .utilities import get_socket_maps, relink_socket_map, do_relink
  12. FLOAT_EPSILON=0.0001 # used to check against floating point inaccuracy
  13. def TellClasses():
  14. #Why use a function to do this? Because I don't need every class to register.
  15. return [ MantisTree,
  16. SchemaTree,
  17. MantisNodeGroup,
  18. SchemaGroup,
  19. ]
  20. def error_popup_draw(self, context):
  21. self.layout.label(text="Error executing tree. See Console.")
  22. mantis_root = ".".join(__name__.split('.')[:-1]) # absolute HACK
  23. # https://docs.blender.org/api/master/bpy.types.NodeTree.html#bpy.types.NodeTree.valid_socket_type
  24. # thank you, Sverchok
  25. def valid_interface_types(cls : NodeTree, socket_idname : str):
  26. from .socket_definitions import tell_valid_bl_idnames, TellClasses
  27. #TODO: do the versioning code to handle this so it can be in all versions
  28. if bpy.app.version <= (4,4,0): # should work in 4.4.1
  29. return socket_idname in [cls.bl_idname for cls in TellClasses()]
  30. else: # once versioning is finished this will be unnecesary.
  31. return socket_idname in tell_valid_bl_idnames()
  32. def fix_reroute_colors(tree):
  33. context = bpy.context
  34. if any((tree.is_executing, tree.is_exporting, tree.do_live_update==False, context.space_data is None) ):
  35. return
  36. from collections import deque
  37. from .utilities import socket_seek
  38. from .socket_definitions import MantisSocket
  39. reroutes_without_color = deque()
  40. for n in tree.nodes:
  41. if n.bl_idname=='NodeReroute' and n.inputs[0].bl_idname == "NodeSocketColor":
  42. reroutes_without_color.append(n)
  43. try:
  44. while reroutes_without_color:
  45. rr = reroutes_without_color.pop()
  46. if rr.inputs[0].is_linked:
  47. link = rr.inputs[0].links[0]
  48. from_node = link.from_node
  49. socket = socket_seek(link, tree.links)
  50. if isinstance(socket, MantisSocket):
  51. rr.socket_idname = socket.bl_idname
  52. except Exception as e:
  53. print(wrapOrange("WARN: Updating reroute color failed with exception: ")+wrapWhite(f"{e.__class__.__name__}"))
  54. class MantisTree(NodeTree):
  55. '''A custom node tree type that will show up in the editor type list'''
  56. bl_idname = 'MantisTree'
  57. bl_label = "Rigging Nodes"
  58. bl_icon = 'OUTLINER_OB_ARMATURE'
  59. tree_valid:BoolProperty(default=False)
  60. do_live_update:BoolProperty(default=True) # use this to disable updates for e.g. scripts
  61. num_links:IntProperty(default=-1)
  62. filepath:StringProperty(default="", subtype='FILE_PATH')
  63. is_executing:BoolProperty(default=False)
  64. is_exporting:BoolProperty(default=False)
  65. execution_id:StringProperty(default='')
  66. mantis_version:IntVectorProperty(default=[0,9,2])
  67. # this prevents the node group from executing on the next depsgraph update
  68. # because I don't always have control over when the dg update happens.
  69. prevent_next_exec:BoolProperty(default=False)
  70. parsed_tree={}
  71. if (bpy.app.version < (4, 4, 0)): # in 4.4 this leads to a crash
  72. @classmethod
  73. def valid_socket_type(cls : NodeTree, socket_idname: str):
  74. return valid_interface_types(cls, socket_idname)
  75. def update(self): # set the reroute colors
  76. if (bpy.app.version >= (4,4,0)):
  77. fix_reroute_colors(self)
  78. def update_tree(self, context = None):
  79. if self.is_exporting:
  80. return
  81. # return
  82. self.is_executing = True
  83. from . import readtree
  84. prGreen("Validating Tree: %s" % self.name)
  85. try:
  86. self.parsed_tree = readtree.parse_tree(self)
  87. if context:
  88. self.display_update(context)
  89. self.is_executing = False
  90. self.tree_valid = True
  91. except GraphError as e:
  92. prRed("Failed to update node tree due to error.")
  93. self.tree_valid = False
  94. self.is_executing = False
  95. raise e
  96. finally:
  97. self.is_executing = False
  98. def display_update(self, context):
  99. if self.is_exporting:
  100. return
  101. self.is_executing = True
  102. current_tree = bpy.context.space_data.path[-1].node_tree
  103. for node in current_tree.nodes:
  104. if hasattr(node, "display_update"):
  105. try:
  106. node.display_update(self.parsed_tree, context)
  107. except Exception as e:
  108. print("Node \"%s\" failed to update display with error: %s" %(wrapGreen(node.name), wrapRed(e)))
  109. self.is_executing = False
  110. # TODO: deal with invalid links properly.
  111. # - Non-hierarchy links should be ignored in the circle-check and so the links should be marked valid in such a circle
  112. # - hierarchy-links should be marked invalid and prevent the tree from executing.
  113. def execute_tree(self,context, error_popups = False):
  114. self.prevent_next_exec = False
  115. if self.is_exporting:
  116. return
  117. # return
  118. prGreen("Executing Tree: %s" % self.name)
  119. self.is_executing = True
  120. from . import readtree
  121. try:
  122. readtree.execute_tree(self.parsed_tree, self, context, error_popups)
  123. except RecursionError as e:
  124. prRed("Recursion error while parsing tree.")
  125. finally:
  126. self.is_executing = False
  127. class SchemaTree(NodeTree):
  128. '''A node tree representing a schema to generate a Mantis tree'''
  129. bl_idname = 'SchemaTree'
  130. bl_label = "Rigging Nodes Schema"
  131. bl_icon = 'RIGID_BODY_CONSTRAINT'
  132. # these are only needed for consistent interface, but should not be used
  133. do_live_update:BoolProperty(default=True) # default to true so that updates work
  134. is_executing:BoolProperty(default=False)
  135. is_exporting:BoolProperty(default=False)
  136. mantis_version:IntVectorProperty(default=[0,9,2])
  137. if (bpy.app.version < (4, 4, 0)): # in 4.4 this leads to a crash
  138. @classmethod
  139. def valid_socket_type(cls : NodeTree, socket_idname: str):
  140. return valid_interface_types(cls, socket_idname)
  141. def update(self): # set the reroute colors
  142. if (bpy.app.version >= (4,4,0)):
  143. fix_reroute_colors(self)
  144. from dataclasses import dataclass, field
  145. from typing import Any
  146. @dataclass
  147. class MantisSocketTemplate():
  148. name : str = field(default="")
  149. bl_idname : str = field(default="")
  150. traverse_target : str = field(default="")
  151. identifier : str = field(default="")
  152. display_shape : str = field(default="") # for arrays
  153. category : str = field(default="") # for use in display update
  154. blender_property : str | tuple[str] = field(default="") # for props_sockets -> evaluate sockets
  155. is_input : bool = field(default=False)
  156. hide : bool = field(default=False)
  157. use_multi_input : bool = field(default=False)
  158. default_value : Any = field(default=None)
  159. #TODO: do a better job explaining how MantisNode and MantisUINode relate.
  160. class MantisUINode:
  161. """
  162. This class contains the common user-interface features of Mantis nodes.
  163. MantisUINode objects will spawn one or more MantisNode objects when the graph is evaluated.
  164. The MantisNode objects will pull the data from the UI node and use it to generate the graph.
  165. """
  166. mantis_node_library=''
  167. mantis_node_class_name=''
  168. mantis_class=None
  169. @classmethod
  170. def poll(cls, ntree):
  171. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  172. @classmethod
  173. def set_mantis_class(self):
  174. from importlib import import_module
  175. # do not catch errors, they should cause a failure.
  176. try:
  177. module = import_module(self.mantis_node_library, package=mantis_root)
  178. self.mantis_class=getattr(module, self.mantis_node_class_name)
  179. except Exception as e:
  180. print(self)
  181. raise e
  182. def insert_link(self, link):
  183. if (bpy.app.version >= (4, 4, 0)):
  184. return # this causes a crash due to a bug.
  185. context = bpy.context
  186. if context.space_data:
  187. node_tree = context.space_data.path[0].node_tree
  188. if node_tree.do_live_update:
  189. node_tree.update_tree(context)
  190. if (link.to_socket.is_linked == False):
  191. node_tree.num_links+=1
  192. elif (link.to_socket.is_multi_input):
  193. node_tree.num_links+=1
  194. def init_sockets(self, socket_templates : tuple[MantisSocketTemplate]):
  195. for template in socket_templates:
  196. collection = self.outputs
  197. if template.is_input:
  198. collection = self.inputs
  199. identifier = template.name
  200. if template.identifier:
  201. identifier = template.identifier
  202. socket = collection.new(
  203. template.bl_idname,
  204. template.name,
  205. identifier=identifier,
  206. use_multi_input=template.use_multi_input
  207. )
  208. socket.hide= template.hide
  209. if template.category:
  210. # a custom property for the UI functions to use.
  211. socket['category'] = template.category
  212. if template.default_value is not None:
  213. socket.default_value = template.default_value
  214. # this can throw a TypeError - it is the caller's
  215. # responsibility to send the right type.
  216. class SchemaUINode(MantisUINode):
  217. mantis_node_library='.schema_containers'
  218. @classmethod
  219. def poll(cls, ntree):
  220. return (ntree.bl_idname in ['SchemaTree'])
  221. class LinkNode(MantisUINode):
  222. mantis_node_library='.link_containers'
  223. @classmethod
  224. def poll(cls, ntree):
  225. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  226. class xFormNode(MantisUINode):
  227. mantis_node_library='.xForm_containers'
  228. @classmethod
  229. def poll(cls, ntree):
  230. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  231. class DeformerNode(MantisUINode):
  232. mantis_node_library='.deformer_containers'
  233. @classmethod
  234. def poll(cls, ntree):
  235. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  236. def poll_node_tree(self, object):
  237. forbid = []
  238. context = bpy.context
  239. if context.space_data:
  240. if context.space_data.path:
  241. for path_item in context.space_data.path:
  242. forbid.append(path_item.node_tree.name)
  243. if isinstance(object, MantisTree) and object.name not in forbid:
  244. return True
  245. return False
  246. # TODO: try to check identifiers instead of name.
  247. def node_group_update(node, force = False):
  248. if not node.is_updating:
  249. raise RuntimeError("Cannot update node while it is not marked as updating.")
  250. if not force:
  251. if (node.id_data.do_live_update == False) or \
  252. (node.id_data.is_executing == True) or \
  253. (node.id_data.is_exporting == True):
  254. return
  255. # note: if (node.id_data.is_exporting == True) I need to be able to update so I can make links.
  256. toggle_update = node.id_data.do_live_update
  257. node.id_data.do_live_update = False
  258. identifiers_in={socket.identifier:socket for socket in node.inputs}
  259. identifiers_out={socket.identifier:socket for socket in node.outputs}
  260. indices_in,indices_out={},{} # check by INDEX to see if the socket's name/type match.
  261. for collection, map in [(node.inputs, indices_in), (node.outputs, indices_out)]:
  262. for i, socket in enumerate(collection):
  263. map[socket.identifier]=i
  264. if node.node_tree is None:
  265. node.inputs.clear(); node.outputs.clear()
  266. node.id_data.do_live_update = toggle_update
  267. return
  268. found_in, found_out = [], []
  269. update_input, update_output = False, False
  270. for item in node.node_tree.interface.items_tree:
  271. if item.item_type != "SOCKET": continue
  272. if item.in_out == 'OUTPUT':
  273. if s:= identifiers_out.get(item.identifier): # if the requested output doesn't exist, update
  274. found_out.append(item.identifier)
  275. if (indices_out[s.identifier]!=item.index): update_output=True; continue
  276. if update_output: continue
  277. if s.bl_idname != item.socket_type: update_output = True; continue
  278. else: update_output = True; continue
  279. else:
  280. if s:= identifiers_in.get(item.identifier): # if the requested input doesn't exist, update
  281. found_in.append(item.identifier)
  282. if (indices_in[s.identifier]!=item.index): update_input=True; continue
  283. if update_input: continue # done here
  284. if s.bl_idname != item.socket_type: update_input = True; continue
  285. else: update_input = True; continue
  286. # Schema has an extra input for Length and for Extend.
  287. if node.bl_idname == 'MantisSchemaGroup':
  288. found_in.extend(['Schema Length', ''])
  289. # if we have too many elements, just get rid of the ones we don't need
  290. if len(node.inputs) > len(found_in):#
  291. for inp in node.inputs:
  292. if inp.identifier in found_in: continue
  293. node.inputs.remove(inp)
  294. if len(node.outputs) > len(found_out):
  295. for out in node.outputs:
  296. if out.identifier in found_out: continue
  297. node.outputs.remove(out)
  298. #
  299. if len(node.inputs) > 0 and (inp := node.inputs[-1]).bl_idname == 'WildcardSocket' and inp.is_linked:
  300. update_input = True
  301. #
  302. if not (update_input or update_output):
  303. node.id_data.do_live_update = toggle_update
  304. return
  305. if update_input or update_output:
  306. socket_maps = get_socket_maps(node,)
  307. if socket_maps:
  308. socket_map_in, socket_map_out = socket_maps
  309. if node.bl_idname == "MantisSchemaGroup" and \
  310. len(node.inputs)+len(node.outputs)<=2 and\
  311. len(node.node_tree.interface.items_tree) > 0:
  312. socket_map_in, socket_map_out = None, None
  313. # We have to initialize the node because it only has its base inputs.
  314. elif socket_maps is None:
  315. node.id_data.do_live_update = toggle_update
  316. return
  317. if update_input :
  318. if node.bl_idname == 'MantisSchemaGroup':
  319. schema_length=0
  320. if sl := node.inputs.get("Schema Length"):
  321. schema_length = sl.default_value
  322. # sometimes this isn't available yet # TODO not happy about this solution
  323. remove_me=[]
  324. # remove all found map items but the Schema Length input (reuse it)
  325. for i, socket in enumerate(node.inputs):
  326. if socket.identifier == "Schema Length" and i == 0:
  327. continue
  328. elif (socket_map_in is None) or socket.identifier in socket_map_in.keys():
  329. remove_me.append(socket)
  330. while remove_me:
  331. node.inputs.remove(remove_me.pop())
  332. if update_output:
  333. remove_me=[]
  334. for socket in node.outputs:
  335. if (socket_map_out is None) or socket.identifier in socket_map_out.keys():
  336. remove_me.append(socket)
  337. while remove_me:
  338. node.inputs.remove(remove_me.pop())
  339. from .utilities import relink_socket_map_add_socket
  340. for item in node.node_tree.interface.items_tree:
  341. if item.item_type != "SOCKET": continue
  342. if (item.in_out == 'INPUT' and update_input):
  343. socket = relink_socket_map_add_socket(node, node.inputs, item)
  344. if socket_map_in:
  345. if item.identifier in socket_map_in.keys():
  346. do_relink(node, socket, socket_map_in)
  347. if (item.in_out == 'OUTPUT' and update_output):
  348. socket = relink_socket_map_add_socket(node, node.outputs, item)
  349. if socket_map_out:
  350. if item.identifier in socket_map_out.keys():
  351. do_relink(node, socket, socket_map_out)
  352. # at this point there is no wildcard socket
  353. if socket_map_in and '__extend__' in socket_map_in.keys():
  354. do_relink(node, None, socket_map_in, in_out='INPUT', parent_name='Constant' )
  355. node.id_data.do_live_update = toggle_update
  356. def node_tree_prop_update(self, context):
  357. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  358. return # so we check if an update is currently running.
  359. self.is_updating = True
  360. def init_schema(self, context):
  361. if len(self.inputs) == 0:
  362. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  363. if self.inputs[-1].bl_idname != "WildcardSocket":
  364. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  365. init_schema(self, context)
  366. try:
  367. node_group_update(self, force=True)
  368. finally: # ensure this line is run even if there is an error
  369. self.is_updating = False
  370. if self.bl_idname in ['MantisSchemaGroup'] and self.node_tree is not None:
  371. init_schema(self, context)
  372. from bpy.types import NodeCustomGroup
  373. def group_draw_buttons(self, context, layout):
  374. row = layout.row(align=True)
  375. row.prop(self, "node_tree", text="")
  376. if self.node_tree is None:
  377. row.operator("mantis.new_node_tree", text="", icon='PLUS', emboss=True)
  378. else:
  379. row.operator("mantis.edit_group", text="", icon='NODETREE', emboss=True)
  380. class MantisNodeGroup(Node, MantisUINode):
  381. bl_idname = "MantisNodeGroup"
  382. bl_label = "Node Group"
  383. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree, update=node_tree_prop_update,)
  384. is_updating:BoolProperty(default=False)
  385. def draw_label(self):
  386. if self.node_tree is None:
  387. return "Node Group"
  388. else:
  389. return self.node_tree.name
  390. def draw_buttons(self, context, layout):
  391. group_draw_buttons(self, context, layout)
  392. def update(self):
  393. if self.node_tree is None:
  394. return
  395. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  396. return # so we check if an update is currently running.
  397. live_update = self.id_data.do_live_update
  398. self.is_updating = True
  399. try:
  400. node_group_update(self)
  401. finally: # we need to reset this regardless of whether or not the operation succeeds!
  402. self.is_updating = False
  403. self.id_data.do_live_update = live_update # ensure this remains the same
  404. class GraphError(Exception):
  405. pass
  406. def get_signature_from_edited_tree(node, context):
  407. sig_path=[None,]
  408. for item in context.space_data.path[:-1]:
  409. sig_path.append(item.node_tree.nodes.active.name)
  410. return tuple(sig_path+[node.name])
  411. def poll_node_tree_schema(self, object):
  412. if isinstance(object, SchemaTree):
  413. return True
  414. return False
  415. # TODO tiny UI problem - inserting new links into the tree will not place them in the right place.
  416. class SchemaGroup(Node, MantisUINode):
  417. bl_idname = "MantisSchemaGroup"
  418. bl_label = "Node Schema"
  419. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree_schema, update=node_tree_prop_update,)
  420. is_updating:BoolProperty(default=False)
  421. def draw_buttons(self, context, layout):
  422. group_draw_buttons(self, context, layout)
  423. def draw_label(self):
  424. if self.node_tree is None:
  425. return "Schema Group"
  426. else:
  427. return self.node_tree.name
  428. def update(self):
  429. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  430. return # so we check if an update is currently running.
  431. if self.node_tree is None:
  432. return
  433. live_update = self.id_data.do_live_update
  434. self.is_updating = True
  435. try:
  436. node_group_update(self)
  437. # reset things if necessary:
  438. if self.node_tree:
  439. if len(self.inputs) == 0:
  440. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  441. if self.inputs[-1].identifier != "__extend__":
  442. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  443. finally: # we need to reset this regardless of whether or not the operation succeeds!
  444. self.is_updating = False
  445. self.id_data.do_live_update = live_update # ensure this remains the same
  446. NODES_REMOVED=["xFormRootNode"]
  447. # Node bl_idname, # Socket Name
  448. SOCKETS_REMOVED=[("UtilityDriverVariable", "Transform Channel"),
  449. ("xFormRootNode","World Out"),
  450. ("UtilitySwitch","xForm"),
  451. ("LinkDrivenParameter", "Enable")]
  452. # Node Class #Prior bl_idname # prior name # new bl_idname # new name, # Multi
  453. SOCKETS_RENAMED=[ ("LinkDrivenParameter", "DriverSocket", "Driver", "FloatSocket", "Value", False)]
  454. # NODE CLASS NAME IN_OUT SOCKET TYPE SOCKET NAME INDEX MULTI DEFAULT
  455. SOCKETS_ADDED=[("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Shape Key", 1, False, False),
  456. ("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Offset", 2, False, True),
  457. ("UtilityFCurve", 'INPUT', "eFCrvExtrapolationMode", "Extrapolation Mode", 0, False, 'CONSTANT'),
  458. ("LinkCopyScale", 'INPUT', "BooleanSocket", "Additive", 3, False, False)]
  459. # replace names with bl_idnames for reading the tree and solving schemas.
  460. replace_types = ["NodeGroupInput", "NodeGroupOutput", "SchemaIncomingConnection",
  461. "SchemaArrayInput", "SchemaConstInput", "SchemaConstOutput", "SchemaIndex",
  462. "SchemaOutgoingConnection", "SchemaConstantOutput", "SchemaArrayOutput",
  463. "SchemaArrayInputGet",]
  464. # anything that gets properties added in the graph... this is a clumsy approach but I need to watch for this
  465. # in schema generation and this is the easiest way to do it for now.
  466. custom_props_types = ["LinkArmature", "UtilityKeyframe", "UtilityFCurve", "UtilityDriver", "xFormBone"]
  467. # filters for determining if a link is a hierarchy link or a non-hierarchy (cyclic) link.
  468. from_name_filter = ["Driver",]
  469. to_name_filter = [
  470. "Custom Object xForm Override",
  471. "Custom Object",
  472. "Deform Bones",
  473. ]
  474. class MantisNode:
  475. """
  476. This class contains the basic interface for a Mantis Node.
  477. A MantisNode is used internally by Mantis to represent the final evaluated node graph.
  478. It gets generated with data from a MantisUINode when the graph is read.
  479. """
  480. def __init__(self, signature : tuple,
  481. base_tree : bpy.types.NodeTree,
  482. socket_templates : list[MantisSocketTemplate]=[]):
  483. self.base_tree=base_tree
  484. self.signature = signature
  485. self.inputs = MantisNodeSocketCollection(node=self, is_input=True)
  486. self.outputs = MantisNodeSocketCollection(node=self, is_input=False)
  487. self.parameters = {}
  488. self.drivers = {}
  489. self.node_type='UNINITIALIZED'
  490. self.hierarchy_connections, self.connections = [], []
  491. self.hierarchy_dependencies, self.dependencies = [], []
  492. self.prepared = False
  493. self.executed = False
  494. self.socket_templates = socket_templates
  495. if self.socket_templates:
  496. self.init_sockets()
  497. def init_sockets(self) -> None:
  498. self.inputs.init_sockets(self.socket_templates)
  499. self.outputs.init_sockets(self.socket_templates)
  500. def init_parameters(self, additional_parameters = {}) -> None:
  501. for socket in self.inputs:
  502. self.parameters[socket.name] = None
  503. for socket in self.outputs:
  504. self.parameters[socket.name] = None
  505. for key, value in additional_parameters.items():
  506. self.parameters[key]=value
  507. def gen_property_socket_map(self) -> dict:
  508. props_sockets = {}
  509. for s_template in self.socket_templates:
  510. if not s_template.blender_property:
  511. continue
  512. if isinstance(s_template.blender_property, str):
  513. props_sockets[s_template.blender_property]=(s_template.name, s_template.default_value)
  514. elif isinstance(s_template.blender_property, tuple):
  515. for index, sub_prop in enumerate(s_template.blender_property):
  516. props_sockets[sub_prop]=( (s_template.name, index),s_template.default_value[index] )
  517. return props_sockets
  518. def set_traverse(self, traversal_pairs = [(str, str)]) -> None:
  519. for (a, b) in traversal_pairs:
  520. self.inputs[a].set_traverse_target(self.outputs[b])
  521. self.outputs[b].set_traverse_target(self.inputs[a])
  522. def flush_links(self) -> None:
  523. for inp in self.inputs.values():
  524. inp.flush_links()
  525. for out in self.outputs.values():
  526. out.flush_links()
  527. def evaluate_input(self, input_name, index=0) -> Any:
  528. from .node_container_common import trace_single_line
  529. if not (self.inputs.get(input_name)): # get the named parameter if there is no input
  530. return self.parameters.get(input_name) # this will return None if the parameter does not exist.
  531. # this trace() should give a key error if there is a problem
  532. # it is NOT handled here because it should NOT happen - so I want the error message.
  533. trace = trace_single_line(self, input_name, index)
  534. prop = trace[0][-1].parameters[trace[1].name] #trace[0] = the list of traced nodes; read its parameters
  535. return prop
  536. def fill_parameters(self, ui_node=None) -> None:
  537. from .utilities import get_node_prototype
  538. from .node_container_common import get_socket_value
  539. if not ui_node:
  540. if ( (self.signature[0] in ["MANTIS_AUTOGENERATED", "SCHEMA_AUTOGENERATED" ]) or
  541. (self.signature[-1] in ["NodeGroupOutput", "NodeGroupInput"]) ): # I think this is harmless
  542. return None
  543. else:
  544. ui_node = get_node_prototype(self.signature, self.base_tree)
  545. if not ui_node:
  546. raise RuntimeError(wrapRed("No node prototype found for... %s" % ( [self.base_tree] + list(self.signature[1:]) ) ) )
  547. for key in self.parameters.keys():
  548. node_socket = ui_node.inputs.get(key)
  549. if self.parameters[key] is not None: # the parameters are usually initialized as None.
  550. continue # will be filled by the node itself
  551. if not node_socket: #maybe the node socket has no name
  552. if ( ( len(ui_node.inputs) == 0) and ( len(ui_node.outputs) == 1) ):
  553. # this is a simple input node.
  554. node_socket = ui_node.outputs[0]
  555. elif key == 'Name': # for Links we just use the Node Label, or if there is no label, the name.
  556. self.parameters[key] = ui_node.label if ui_node.label else ui_node.name
  557. continue
  558. else:
  559. pass
  560. if node_socket:
  561. if node_socket.bl_idname in ['RelationshipSocket', 'xFormSocket']:
  562. continue
  563. elif node_socket.is_linked and (not node_socket.is_output):
  564. pass # we will get the value from the link, because this is a linked input port.
  565. # very importantly, we do not pass linked outputs- fill these because they are probably Input nodes.
  566. elif hasattr(node_socket, "default_value"):
  567. if (value := get_socket_value(node_socket)) is not None:
  568. self.parameters[key] = value
  569. # TODO: try and remove the input if it is not needed (for performance speed)
  570. else:
  571. raise RuntimeError(wrapRed("No value found for " + self.__repr__() + " when filling out node parameters for " + ui_node.name + "::"+node_socket.name))
  572. else:
  573. pass
  574. # I don't think this works! but I like the idea
  575. def call_on_all_ancestors(self, *args, **kwargs):
  576. """Resolve the dependencies of this node with the named method and its arguments.
  577. First, dependencies are discovered by walking backwards through the tree. Once the root
  578. nodes are discovered, the method is called by each node in dependency order.
  579. The first argument MUST be the name of the method as a string.
  580. """
  581. prGreen(self)
  582. if args[0] == 'call_on_all_ancestors': raise RuntimeError("Very funny!")
  583. from .utilities import get_all_dependencies
  584. from collections import deque
  585. # get all dependencies by walking backward through the tree.
  586. all_dependencies = get_all_dependencies(self)
  587. # get just the roots
  588. can_solve = deque(filter(lambda a : len(a.hierarchy_connections) == 0, all_dependencies))
  589. solved = set()
  590. while can_solve:
  591. node = can_solve.pop()
  592. print(node)
  593. method = getattr(node, args[0])
  594. method(*args[0:], **kwargs)
  595. solved.add(node)
  596. can_solve.extendleft(filter(lambda a : a in all_dependencies, node.hierarchy_connections))
  597. # prPurple(can_solve)
  598. if self in solved:
  599. break
  600. # else:
  601. # for dep in all_dependencies:
  602. # if dep not in solved:
  603. # prOrange(dep)
  604. return
  605. # gets targets for constraints and deformers and should handle all cases
  606. def get_target_and_subtarget(self, constraint_or_deformer, input_name = "Target"):
  607. from bpy.types import PoseBone, Object, SplineIKConstraint
  608. subtarget = ''; target = self.evaluate_input(input_name)
  609. if target:
  610. if not hasattr(target, "bGetObject"):
  611. prRed(f"No {input_name} target found for {constraint_or_deformer.name} in {self} because there is no connected node, or node is wrong type")
  612. return
  613. if (isinstance(target.bGetObject(), PoseBone)):
  614. subtarget = target.bGetObject().name
  615. target = target.bGetParentArmature()
  616. elif (isinstance(target.bGetObject(), Object) ):
  617. target = target.bGetObject()
  618. else:
  619. raise RuntimeError("Cannot interpret constraint or deformer target!")
  620. if (isinstance(constraint_or_deformer, SplineIKConstraint)):
  621. if target and target.type not in ["CURVE"]:
  622. raise GraphError(wrapRed("Error: %s requires a Curve input, not %s" %
  623. (self, type(target))))
  624. constraint_or_deformer.target = target# don't get a subtarget
  625. if (input_name == 'Pole Target'):
  626. constraint_or_deformer.pole_target, constraint_or_deformer.pole_subtarget = target, subtarget
  627. else:
  628. if hasattr(constraint_or_deformer, "target"):
  629. constraint_or_deformer.target = target
  630. if hasattr(constraint_or_deformer, "object"):
  631. constraint_or_deformer.object = target
  632. if hasattr(constraint_or_deformer, "subtarget"):
  633. constraint_or_deformer.subtarget = subtarget
  634. def bPrepare(self, bContext=None):
  635. return
  636. def bExecute(self, bContext=None):
  637. return
  638. def bFinalize(self, bContext=None):
  639. return
  640. def __repr__(self):
  641. return self.signature.__repr__()
  642. # do I need this and the link class above?
  643. class DummyLink:
  644. #gonna use this for faking links to keep the interface consistent
  645. def __init__(self, from_socket, to_socket, nc_from=None, nc_to=None, original_from=None, multi_input_sort_id=0):
  646. self.from_socket = from_socket
  647. self.to_socket = to_socket
  648. self.nc_from = nc_from
  649. self.nc_to = nc_to
  650. self.multi_input_sort_id = multi_input_sort_id
  651. # self.from_node = from_socket.node
  652. # self.to_node = to_socket.node
  653. if (original_from):
  654. self.original_from = original_from
  655. else:
  656. self.original_from = self.from_socket
  657. def __repr__(self):
  658. return(self.nc_from.__repr__()+":"+self.from_socket.name + " -> " + self.nc_to.__repr__()+":"+self.to_socket.name)
  659. def detect_hierarchy_link(from_node, from_socket, to_node, to_socket,):
  660. if to_node.node_type in ['DUMMY_SCHEMA', 'SCHEMA']:
  661. return False
  662. if (from_socket in from_name_filter) or (to_socket in to_name_filter):
  663. return False
  664. # if from_node.__class__.__name__ in ["UtilityCombineVector", "UtilityCombineThreeBool"]:
  665. # return False
  666. return True
  667. class NodeLink:
  668. from_node = None
  669. from_socket = None
  670. to_node = None
  671. to_socket = None
  672. def __init__(self, from_node, from_socket, to_node, to_socket, multi_input_sort_id=0):
  673. if from_node.signature == to_node.signature:
  674. raise RuntimeError("Cannot connect a node to itself.")
  675. self.from_node = from_node
  676. self.from_socket = from_socket
  677. self.to_node = to_node
  678. self.to_socket = to_socket
  679. self.from_node.outputs[self.from_socket].links.append(self)
  680. # it is the responsibility of the node that uses these links to sort them correctly based on the sort_id
  681. self.multi_input_sort_id = multi_input_sort_id
  682. self.to_node.inputs[self.to_socket].links.append(self)
  683. self.is_hierarchy = detect_hierarchy_link(from_node, from_socket, to_node, to_socket,)
  684. self.is_alive = True
  685. def __repr__(self):
  686. return self.from_node.outputs[self.from_socket].__repr__() + " --> " + self.to_node.inputs[self.to_socket].__repr__()
  687. # link_string = # if I need to colorize output for debugging.
  688. # if self.is_hierarchy:
  689. # return wrapOrange(link_string)
  690. # else:
  691. # return wrapWhite(link_string)
  692. def die(self):
  693. self.is_alive = False
  694. self.to_node.inputs[self.to_socket].flush_links()
  695. self.from_node.outputs[self.from_socket].flush_links()
  696. def insert_node(self, middle_node, middle_node_in, middle_node_out, re_init_hierarchy = True):
  697. to_node = self.to_node
  698. to_socket = self.to_socket
  699. self.to_node = middle_node
  700. self.to_socket = middle_node_in
  701. middle_node.outputs[middle_node_out].connect(to_node, to_socket)
  702. if re_init_hierarchy:
  703. from .utilities import init_connections, init_dependencies
  704. init_connections(self.from_node)
  705. init_connections(middle_node)
  706. init_dependencies(middle_node)
  707. init_dependencies(to_node)
  708. class NodeSocket:
  709. # @property # this is a read-only property.
  710. # def is_linked(self):
  711. # return bool(self.links)
  712. def __init__(self, is_input = False,
  713. node = None, name = None,
  714. traverse_target = None):
  715. self.can_traverse = False # to/from the other side of the parent node
  716. self.traverse_target = None
  717. self.node = node
  718. self.name = name
  719. self.is_input = is_input
  720. self.links = []
  721. self.is_linked = False
  722. if (traverse_target):
  723. self.can_traverse = True
  724. def connect(self, node, socket, sort_id=0):
  725. if (self.is_input):
  726. to_node = self.node; from_node = node
  727. to_socket = self.name; from_socket = socket
  728. else:
  729. from_node = self.node; to_node = node
  730. from_socket = self.name; to_socket = socket
  731. from_node.outputs[from_socket].is_linked = True
  732. to_node.inputs[to_socket].is_linked = True
  733. for l in from_node.outputs[from_socket].links:
  734. if l.to_node==to_node and l.to_socket==to_socket:
  735. return None
  736. new_link = NodeLink(
  737. from_node,
  738. from_socket,
  739. to_node,
  740. to_socket,
  741. sort_id)
  742. return new_link
  743. def set_traverse_target(self, traverse_target):
  744. self.traverse_target = traverse_target
  745. self.can_traverse = True
  746. def flush_links(self):
  747. """ Removes dead links from this socket."""
  748. self.links = [l for l in self.links if l.is_alive]
  749. self.is_linked = bool(self.links)
  750. @property
  751. def is_connected(self):
  752. return len(self.links)>0
  753. def __repr__(self):
  754. return self.node.__repr__() + "::" + self.name
  755. class MantisNodeSocketCollection(dict):
  756. def __init__(self, node, is_input=False):
  757. self.is_input = is_input
  758. self.node = node
  759. def init_sockets(self, sockets):
  760. for socket in sockets:
  761. if isinstance(socket, str):
  762. self[socket] = NodeSocket(is_input=self.is_input, name=socket, node=self.node)
  763. elif isinstance(socket, MantisSocketTemplate):
  764. if socket.is_input != self.is_input: continue
  765. self[socket.name] = NodeSocket(is_input=self.is_input, name=socket.name, node=self.node)
  766. else:
  767. raise RuntimeError(f"NodeSocketCollection keys must be str or MantisSocketTemplate, not {type(socket)}")
  768. def __delitem__(self, key):
  769. """Deletes a node socket by name, and all its links."""
  770. socket = self[key]
  771. for l in socket.links:
  772. l.die()
  773. super().__delitem__(key)
  774. def __iter__(self):
  775. """Makes the class iterable"""
  776. return iter(self.values())
  777. # The Mantis Solver class is used to store the execution-specific variables that are used
  778. # when executing the tree
  779. class MantisSolver():
  780. pass
  781. # GOAL: make the switch to "group overlay" paradigm