base_definitions.py 43 KB

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