base_definitions.py 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929
  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. reorder_me_input = []; input_index = 0
  341. reorder_me_output = []; output_index = 0
  342. def update_group_sockets(interface_item, is_input):
  343. socket_map = socket_map_in if is_input else socket_map_out
  344. socket_collection = node.inputs if is_input else node.outputs
  345. counter = input_index if is_input else output_index
  346. reorder_collection = reorder_me_input if is_input else reorder_me_output
  347. if socket_map:
  348. if item.identifier in socket_map.keys():
  349. socket = relink_socket_map_add_socket(node, socket_collection, item)
  350. do_relink(node, socket, socket_map, item.in_out)
  351. else:
  352. for has_socket in socket_collection:
  353. if has_socket.bl_idname == item.socket_type and \
  354. has_socket.name == item.name:
  355. reorder_collection.append((has_socket, counter))
  356. break
  357. else:
  358. socket = relink_socket_map_add_socket(node, socket_collection, item)
  359. else:
  360. socket = relink_socket_map_add_socket(node, socket_collection, item)
  361. counter += 1
  362. for item in node.node_tree.interface.items_tree:
  363. if item.item_type != "SOCKET": continue
  364. if (item.in_out == 'INPUT' and update_input):
  365. update_group_sockets(item, True)
  366. if (item.in_out == 'OUTPUT' and update_output):
  367. update_group_sockets(item, False)
  368. both_reorders = zip([reorder_me_input, reorder_me_output], [node.inputs, node.outputs])
  369. for reorder_task, collection in both_reorders:
  370. for socket, position in reorder_task:
  371. for i, s in enumerate(collection): # get the index
  372. if s.identifier == socket.identifier: break
  373. else:
  374. prRed(f"WARN: could not reorder socket {socket.name}")
  375. to_index = position
  376. if (not socket.is_output) and node.bl_idname == "MantisSchemaGroup":
  377. to_index+=1
  378. collection.move(i, to_index)
  379. # at this point there is no wildcard socket
  380. if socket_map_in and '__extend__' in socket_map_in.keys():
  381. do_relink(node, None, socket_map_in, in_out='INPUT', parent_name='Constant' )
  382. node.id_data.do_live_update = toggle_update
  383. def node_tree_prop_update(self, context):
  384. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  385. return # so we check if an update is currently running.
  386. self.is_updating = True
  387. def init_schema(self, context):
  388. if len(self.inputs) == 0:
  389. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  390. if self.inputs[-1].bl_idname != "WildcardSocket":
  391. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  392. init_schema(self, context)
  393. try:
  394. node_group_update(self, force=True)
  395. finally: # ensure this line is run even if there is an error
  396. self.is_updating = False
  397. if self.bl_idname in ['MantisSchemaGroup'] and self.node_tree is not None:
  398. init_schema(self, context)
  399. from bpy.types import NodeCustomGroup
  400. def group_draw_buttons(self, context, layout):
  401. row = layout.row(align=True)
  402. row.prop(self, "node_tree", text="")
  403. if self.node_tree is None:
  404. row.operator("mantis.new_node_tree", text="", icon='PLUS', emboss=True)
  405. else:
  406. row.operator("mantis.edit_group", text="", icon='NODETREE', emboss=True)
  407. class MantisNodeGroup(Node, MantisUINode):
  408. bl_idname = "MantisNodeGroup"
  409. bl_label = "Node Group"
  410. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree, update=node_tree_prop_update,)
  411. is_updating:BoolProperty(default=False)
  412. def draw_label(self):
  413. if self.node_tree is None:
  414. return "Node Group"
  415. else:
  416. return self.node_tree.name
  417. def draw_buttons(self, context, layout):
  418. group_draw_buttons(self, context, layout)
  419. def update(self):
  420. if self.node_tree is None:
  421. return
  422. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  423. return # so we check if an update is currently running.
  424. live_update = self.id_data.do_live_update
  425. self.is_updating = True
  426. try:
  427. node_group_update(self)
  428. finally: # we need to reset this regardless of whether or not the operation succeeds!
  429. self.is_updating = False
  430. self.id_data.do_live_update = live_update # ensure this remains the same
  431. class GraphError(Exception):
  432. pass
  433. def get_signature_from_edited_tree(node, context):
  434. sig_path=[None,]
  435. for item in context.space_data.path[:-1]:
  436. sig_path.append(item.node_tree.nodes.active.name)
  437. return tuple(sig_path+[node.name])
  438. def poll_node_tree_schema(self, object):
  439. if isinstance(object, SchemaTree):
  440. return True
  441. return False
  442. # TODO tiny UI problem - inserting new links into the tree will not place them in the right place.
  443. class SchemaGroup(Node, MantisUINode):
  444. bl_idname = "MantisSchemaGroup"
  445. bl_label = "Node Schema"
  446. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree_schema, update=node_tree_prop_update,)
  447. is_updating:BoolProperty(default=False)
  448. def draw_buttons(self, context, layout):
  449. group_draw_buttons(self, context, layout)
  450. def draw_label(self):
  451. if self.node_tree is None:
  452. return "Schema Group"
  453. else:
  454. return self.node_tree.name
  455. def update(self):
  456. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  457. return # so we check if an update is currently running.
  458. if self.node_tree is None:
  459. return
  460. live_update = self.id_data.do_live_update
  461. self.is_updating = True
  462. try:
  463. node_group_update(self)
  464. # reset things if necessary:
  465. if self.node_tree:
  466. if len(self.inputs) == 0:
  467. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  468. if self.inputs[-1].identifier != "__extend__":
  469. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  470. finally: # we need to reset this regardless of whether or not the operation succeeds!
  471. self.is_updating = False
  472. self.id_data.do_live_update = live_update # ensure this remains the same
  473. NODES_REMOVED=["xFormRootNode"]
  474. # Node bl_idname, # Socket Name
  475. SOCKETS_REMOVED=[("UtilityDriverVariable", "Transform Channel"),
  476. ("xFormRootNode","World Out"),
  477. ("UtilitySwitch","xForm"),
  478. ("LinkDrivenParameter", "Enable")]
  479. # Node Class #Prior bl_idname # prior name # new bl_idname # new name, # Multi
  480. SOCKETS_RENAMED=[ ("LinkDrivenParameter", "DriverSocket", "Driver", "FloatSocket", "Value", False)]
  481. # NODE CLASS NAME IN_OUT SOCKET TYPE SOCKET NAME INDEX MULTI DEFAULT
  482. SOCKETS_ADDED=[("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Shape Key", 1, False, False),
  483. ("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Offset", 2, False, True),
  484. ("UtilityFCurve", 'INPUT', "eFCrvExtrapolationMode", "Extrapolation Mode", 0, False, 'CONSTANT'),
  485. ("LinkCopyScale", 'INPUT', "BooleanSocket", "Additive", 3, False, False)]
  486. # replace names with bl_idnames for reading the tree and solving schemas.
  487. replace_types = ["NodeGroupInput", "NodeGroupOutput", "SchemaIncomingConnection",
  488. "SchemaArrayInput", "SchemaConstInput", "SchemaConstOutput", "SchemaIndex",
  489. "SchemaOutgoingConnection", "SchemaConstantOutput", "SchemaArrayOutput",
  490. "SchemaArrayInputGet",]
  491. # anything that gets properties added in the graph... this is a clumsy approach but I need to watch for this
  492. # in schema generation and this is the easiest way to do it for now.
  493. custom_props_types = ["LinkArmature", "UtilityKeyframe", "UtilityFCurve", "UtilityDriver", "xFormBone"]
  494. # filters for determining if a link is a hierarchy link or a non-hierarchy (cyclic) link.
  495. from_name_filter = ["Driver",]
  496. to_name_filter = [
  497. "Custom Object xForm Override",
  498. "Custom Object",
  499. "Deform Bones",
  500. ]
  501. class MantisNode:
  502. """
  503. This class contains the basic interface for a Mantis Node.
  504. A MantisNode is used internally by Mantis to represent the final evaluated node graph.
  505. It gets generated with data from a MantisUINode when the graph is read.
  506. """
  507. def __init__(self, signature : tuple,
  508. base_tree : bpy.types.NodeTree,
  509. socket_templates : list[MantisSocketTemplate]=[]):
  510. self.base_tree=base_tree
  511. self.signature = signature
  512. self.inputs = MantisNodeSocketCollection(node=self, is_input=True)
  513. self.outputs = MantisNodeSocketCollection(node=self, is_input=False)
  514. self.parameters = {}
  515. self.drivers = {}
  516. self.node_type='UNINITIALIZED'
  517. self.hierarchy_connections, self.connections = [], []
  518. self.hierarchy_dependencies, self.dependencies = [], []
  519. self.prepared = False
  520. self.executed = False
  521. self.socket_templates = socket_templates
  522. if self.socket_templates:
  523. self.init_sockets()
  524. def init_sockets(self) -> None:
  525. self.inputs.init_sockets(self.socket_templates)
  526. self.outputs.init_sockets(self.socket_templates)
  527. def init_parameters(self, additional_parameters = {}) -> None:
  528. for socket in self.inputs:
  529. self.parameters[socket.name] = None
  530. for socket in self.outputs:
  531. self.parameters[socket.name] = None
  532. for key, value in additional_parameters.items():
  533. self.parameters[key]=value
  534. def gen_property_socket_map(self) -> dict:
  535. props_sockets = {}
  536. for s_template in self.socket_templates:
  537. if not s_template.blender_property:
  538. continue
  539. if isinstance(s_template.blender_property, str):
  540. props_sockets[s_template.blender_property]=(s_template.name, s_template.default_value)
  541. elif isinstance(s_template.blender_property, tuple):
  542. for index, sub_prop in enumerate(s_template.blender_property):
  543. props_sockets[sub_prop]=( (s_template.name, index),s_template.default_value[index] )
  544. return props_sockets
  545. def set_traverse(self, traversal_pairs = [(str, str)]) -> None:
  546. for (a, b) in traversal_pairs:
  547. self.inputs[a].set_traverse_target(self.outputs[b])
  548. self.outputs[b].set_traverse_target(self.inputs[a])
  549. def flush_links(self) -> None:
  550. for inp in self.inputs.values():
  551. inp.flush_links()
  552. for out in self.outputs.values():
  553. out.flush_links()
  554. def evaluate_input(self, input_name, index=0) -> Any:
  555. from .node_container_common import trace_single_line
  556. if not (self.inputs.get(input_name)): # get the named parameter if there is no input
  557. return self.parameters.get(input_name) # this will return None if the parameter does not exist.
  558. # this trace() should give a key error if there is a problem
  559. # it is NOT handled here because it should NOT happen - so I want the error message.
  560. trace = trace_single_line(self, input_name, index)
  561. prop = trace[0][-1].parameters[trace[1].name] #trace[0] = the list of traced nodes; read its parameters
  562. return prop
  563. def fill_parameters(self, ui_node=None) -> None:
  564. from .utilities import get_node_prototype
  565. from .node_container_common import get_socket_value
  566. if not ui_node:
  567. if ( (self.signature[0] in ["MANTIS_AUTOGENERATED", "SCHEMA_AUTOGENERATED" ]) or
  568. (self.signature[-1] in ["NodeGroupOutput", "NodeGroupInput"]) ): # I think this is harmless
  569. return None
  570. else:
  571. ui_node = get_node_prototype(self.signature, self.base_tree)
  572. if not ui_node:
  573. raise RuntimeError(wrapRed("No node prototype found for... %s" % ( [self.base_tree] + list(self.signature[1:]) ) ) )
  574. for key in self.parameters.keys():
  575. node_socket = ui_node.inputs.get(key)
  576. if self.parameters[key] is not None: # the parameters are usually initialized as None.
  577. continue # will be filled by the node itself
  578. if not node_socket: #maybe the node socket has no name
  579. if ( ( len(ui_node.inputs) == 0) and ( len(ui_node.outputs) == 1) ):
  580. # this is a simple input node.
  581. node_socket = ui_node.outputs[0]
  582. elif key == 'Name': # for Links we just use the Node Label, or if there is no label, the name.
  583. self.parameters[key] = ui_node.label if ui_node.label else ui_node.name
  584. continue
  585. else:
  586. pass
  587. if node_socket:
  588. if node_socket.bl_idname in ['RelationshipSocket', 'xFormSocket']:
  589. continue
  590. elif node_socket.is_linked and (not node_socket.is_output):
  591. pass # we will get the value from the link, because this is a linked input port.
  592. # very importantly, we do not pass linked outputs- fill these because they are probably Input nodes.
  593. elif hasattr(node_socket, "default_value"):
  594. if (value := get_socket_value(node_socket)) is not None:
  595. self.parameters[key] = value
  596. # TODO: try and remove the input if it is not needed (for performance speed)
  597. else:
  598. raise RuntimeError(wrapRed("No value found for " + self.__repr__() + " when filling out node parameters for " + ui_node.name + "::"+node_socket.name))
  599. else:
  600. pass
  601. # I don't think this works! but I like the idea
  602. def call_on_all_ancestors(self, *args, **kwargs):
  603. """Resolve the dependencies of this node with the named method and its arguments.
  604. First, dependencies are discovered by walking backwards through the tree. Once the root
  605. nodes are discovered, the method is called by each node in dependency order.
  606. The first argument MUST be the name of the method as a string.
  607. """
  608. prGreen(self)
  609. if args[0] == 'call_on_all_ancestors': raise RuntimeError("Very funny!")
  610. from .utilities import get_all_dependencies
  611. from collections import deque
  612. # get all dependencies by walking backward through the tree.
  613. all_dependencies = get_all_dependencies(self)
  614. # get just the roots
  615. can_solve = deque(filter(lambda a : len(a.hierarchy_connections) == 0, all_dependencies))
  616. solved = set()
  617. while can_solve:
  618. node = can_solve.pop()
  619. print(node)
  620. method = getattr(node, args[0])
  621. method(*args[0:], **kwargs)
  622. solved.add(node)
  623. can_solve.extendleft(filter(lambda a : a in all_dependencies, node.hierarchy_connections))
  624. # prPurple(can_solve)
  625. if self in solved:
  626. break
  627. # else:
  628. # for dep in all_dependencies:
  629. # if dep not in solved:
  630. # prOrange(dep)
  631. return
  632. # gets targets for constraints and deformers and should handle all cases
  633. def get_target_and_subtarget(self, constraint_or_deformer, input_name = "Target"):
  634. from bpy.types import PoseBone, Object, SplineIKConstraint
  635. subtarget = ''; target = self.evaluate_input(input_name)
  636. if target:
  637. if not hasattr(target, "bGetObject"):
  638. 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")
  639. return
  640. if (isinstance(target.bGetObject(), PoseBone)):
  641. subtarget = target.bGetObject().name
  642. target = target.bGetParentArmature()
  643. elif (isinstance(target.bGetObject(), Object) ):
  644. target = target.bGetObject()
  645. else:
  646. raise RuntimeError("Cannot interpret constraint or deformer target!")
  647. if (isinstance(constraint_or_deformer, SplineIKConstraint)):
  648. if target and target.type not in ["CURVE"]:
  649. raise GraphError(wrapRed("Error: %s requires a Curve input, not %s" %
  650. (self, type(target))))
  651. constraint_or_deformer.target = target# don't get a subtarget
  652. if (input_name == 'Pole Target'):
  653. constraint_or_deformer.pole_target, constraint_or_deformer.pole_subtarget = target, subtarget
  654. else:
  655. if hasattr(constraint_or_deformer, "target"):
  656. constraint_or_deformer.target = target
  657. if hasattr(constraint_or_deformer, "object"):
  658. constraint_or_deformer.object = target
  659. if hasattr(constraint_or_deformer, "subtarget"):
  660. constraint_or_deformer.subtarget = subtarget
  661. def bPrepare(self, bContext=None):
  662. return
  663. def bExecute(self, bContext=None):
  664. return
  665. def bFinalize(self, bContext=None):
  666. return
  667. def __repr__(self):
  668. return self.signature.__repr__()
  669. # do I need this and the link class above?
  670. class DummyLink:
  671. #gonna use this for faking links to keep the interface consistent
  672. def __init__(self, from_socket, to_socket, nc_from=None, nc_to=None, original_from=None, multi_input_sort_id=0):
  673. self.from_socket = from_socket
  674. self.to_socket = to_socket
  675. self.nc_from = nc_from
  676. self.nc_to = nc_to
  677. self.multi_input_sort_id = multi_input_sort_id
  678. # self.from_node = from_socket.node
  679. # self.to_node = to_socket.node
  680. if (original_from):
  681. self.original_from = original_from
  682. else:
  683. self.original_from = self.from_socket
  684. def __repr__(self):
  685. return(self.nc_from.__repr__()+":"+self.from_socket.name + " -> " + self.nc_to.__repr__()+":"+self.to_socket.name)
  686. def detect_hierarchy_link(from_node, from_socket, to_node, to_socket,):
  687. if to_node.node_type in ['DUMMY_SCHEMA', 'SCHEMA']:
  688. return False
  689. if (from_socket in from_name_filter) or (to_socket in to_name_filter):
  690. return False
  691. # if from_node.__class__.__name__ in ["UtilityCombineVector", "UtilityCombineThreeBool"]:
  692. # return False
  693. return True
  694. class NodeLink:
  695. from_node = None
  696. from_socket = None
  697. to_node = None
  698. to_socket = None
  699. def __init__(self, from_node, from_socket, to_node, to_socket, multi_input_sort_id=0):
  700. if from_node.signature == to_node.signature:
  701. raise RuntimeError("Cannot connect a node to itself.")
  702. self.from_node = from_node
  703. self.from_socket = from_socket
  704. self.to_node = to_node
  705. self.to_socket = to_socket
  706. self.from_node.outputs[self.from_socket].links.append(self)
  707. # it is the responsibility of the node that uses these links to sort them correctly based on the sort_id
  708. self.multi_input_sort_id = multi_input_sort_id
  709. self.to_node.inputs[self.to_socket].links.append(self)
  710. self.is_hierarchy = detect_hierarchy_link(from_node, from_socket, to_node, to_socket,)
  711. self.is_alive = True
  712. def __repr__(self):
  713. return self.from_node.outputs[self.from_socket].__repr__() + " --> " + self.to_node.inputs[self.to_socket].__repr__()
  714. # link_string = # if I need to colorize output for debugging.
  715. # if self.is_hierarchy:
  716. # return wrapOrange(link_string)
  717. # else:
  718. # return wrapWhite(link_string)
  719. def die(self):
  720. self.is_alive = False
  721. self.to_node.inputs[self.to_socket].flush_links()
  722. self.from_node.outputs[self.from_socket].flush_links()
  723. def insert_node(self, middle_node, middle_node_in, middle_node_out, re_init_hierarchy = True):
  724. to_node = self.to_node
  725. to_socket = self.to_socket
  726. self.to_node = middle_node
  727. self.to_socket = middle_node_in
  728. middle_node.outputs[middle_node_out].connect(to_node, to_socket)
  729. if re_init_hierarchy:
  730. from .utilities import init_connections, init_dependencies
  731. init_connections(self.from_node)
  732. init_connections(middle_node)
  733. init_dependencies(middle_node)
  734. init_dependencies(to_node)
  735. class NodeSocket:
  736. # @property # this is a read-only property.
  737. # def is_linked(self):
  738. # return bool(self.links)
  739. def __init__(self, is_input = False,
  740. node = None, name = None,
  741. traverse_target = None):
  742. self.can_traverse = False # to/from the other side of the parent node
  743. self.traverse_target = None
  744. self.node = node
  745. self.name = name
  746. self.is_input = is_input
  747. self.links = []
  748. self.is_linked = False
  749. if (traverse_target):
  750. self.can_traverse = True
  751. def connect(self, node, socket, sort_id=0):
  752. if (self.is_input):
  753. to_node = self.node; from_node = node
  754. to_socket = self.name; from_socket = socket
  755. else:
  756. from_node = self.node; to_node = node
  757. from_socket = self.name; to_socket = socket
  758. from_node.outputs[from_socket].is_linked = True
  759. to_node.inputs[to_socket].is_linked = True
  760. for l in from_node.outputs[from_socket].links:
  761. if l.to_node==to_node and l.to_socket==to_socket:
  762. return None
  763. new_link = NodeLink(
  764. from_node,
  765. from_socket,
  766. to_node,
  767. to_socket,
  768. sort_id)
  769. return new_link
  770. def set_traverse_target(self, traverse_target):
  771. self.traverse_target = traverse_target
  772. self.can_traverse = True
  773. def flush_links(self):
  774. """ Removes dead links from this socket."""
  775. self.links = [l for l in self.links if l.is_alive]
  776. self.is_linked = bool(self.links)
  777. @property
  778. def is_connected(self):
  779. return len(self.links)>0
  780. def __repr__(self):
  781. return self.node.__repr__() + "::" + self.name
  782. class MantisNodeSocketCollection(dict):
  783. def __init__(self, node, is_input=False):
  784. self.is_input = is_input
  785. self.node = node
  786. def init_sockets(self, sockets):
  787. for socket in sockets:
  788. if isinstance(socket, str):
  789. self[socket] = NodeSocket(is_input=self.is_input, name=socket, node=self.node)
  790. elif isinstance(socket, MantisSocketTemplate):
  791. if socket.is_input != self.is_input: continue
  792. self[socket.name] = NodeSocket(is_input=self.is_input, name=socket.name, node=self.node)
  793. else:
  794. raise RuntimeError(f"NodeSocketCollection keys must be str or MantisSocketTemplate, not {type(socket)}")
  795. def __delitem__(self, key):
  796. """Deletes a node socket by name, and all its links."""
  797. socket = self[key]
  798. for l in socket.links:
  799. l.die()
  800. super().__delitem__(key)
  801. def __iter__(self):
  802. """Makes the class iterable"""
  803. return iter(self.values())
  804. # The Mantis Solver class is used to store the execution-specific variables that are used
  805. # when executing the tree
  806. class MantisSolver():
  807. pass
  808. # GOAL: make the switch to "group overlay" paradigm