compiled.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  1. from modelverse_kernel.primitives import PrimitiveFinished
  2. import modelverse_jit.runtime as jit_runtime
  3. def reverseKeyLookup(a, b, **remainder):
  4. edges, = yield [("RO", [a])]
  5. expanded_edges = yield [("RE", [i]) for i in edges]
  6. for i, edge in enumerate(expanded_edges):
  7. if b == edge[1]:
  8. # Found our edge: edges[i]
  9. outgoing, = yield [("RO", [edges[i]])]
  10. result, = yield [("RE", [outgoing[0]])]
  11. raise PrimitiveFinished(result[1])
  12. result, = yield [("CNV", ["(unknown: %s)" % b])]
  13. raise PrimitiveFinished(result)
  14. """
  15. def read_attribute(a, b, c, **remainder):
  16. model_dict, b_val, c_val, type_mapping = \
  17. yield [("RD", [a, "model"]),
  18. ("RV", [b]),
  19. ("RV", [c]),
  20. ("RD", [a, "type_mapping"]),
  21. ]
  22. model_instance, = \
  23. yield [("RD", [model_dict, b_val])]
  24. edges, = yield [("RO", [model_instance])]
  25. edge_types = yield [("RDN", [type_mapping, i]) for i in edges]
  26. type_edge_val = yield [("RE", [i]) for i in edge_types]
  27. src_nodes = set([i[0] for i in type_edge_val])
  28. found_edges = yield [("RDE", [i, c_val]) for i in src_nodes]
  29. for e1 in found_edges:
  30. if e1 is not None:
  31. # Found an edge!
  32. for i, e2 in enumerate(edge_types):
  33. if e1 == e2:
  34. # The instance of this edge is the one we want!
  35. edge = edges[i]
  36. edge_val, = yield [("RE", [edge])]
  37. result = edge_val[1]
  38. raise PrimitiveFinished(result)
  39. else:
  40. result, = yield [("RR", [])]
  41. raise PrimitiveFinished(result)
  42. raise Exception("Error in reading edge!")
  43. """
  44. def set_copy(a, **remainder):
  45. b, = yield [("CN", [])]
  46. links, = yield [("RO", [a])]
  47. exp_links = yield [("RE", [i]) for i in links]
  48. _ = yield [("CE", [b, i[1]]) for i in exp_links]
  49. raise PrimitiveFinished(b)
  50. """
  51. def allInstances(a, b, **remainder):
  52. b_val, = yield [("RV", [b])]
  53. model_dict,= yield [("RD", [a, "model"])]
  54. metamodel, = yield [("RD", [a, "metamodel"])]
  55. m3, = yield [("RD", [metamodel, "metamodel"])]
  56. m3_model, = yield [("RD", [m3, "model"])]
  57. mm_dict, = yield [("RD", [metamodel, "model"])]
  58. typing, = yield [("RD", [a, "type_mapping"])]
  59. elem_keys, = yield [("RDK", [model_dict])]
  60. elems = yield [("RDN", [model_dict, i]) for i in elem_keys]
  61. mms = yield [("RDN", [typing, i]) for i in elems]
  62. # Have the type for each name
  63. types_to_name_nodes = {}
  64. for key, mm in zip(elem_keys, mms):
  65. types_to_name_nodes.setdefault(mm, set()).add(key)
  66. # And now we have the inverse mapping: for each type, we have the node containing the name
  67. # Get the inheritance link type
  68. inheritance_type, = yield [("RD", [m3_model, "Inheritance"])]
  69. # Now we figure out which types are valid for the specified model
  70. desired_types = set()
  71. mm_element, = yield [("RD", [mm_dict, b_val])]
  72. work_list = []
  73. work_list.append(mm_element)
  74. mm_typing, = yield [("RD", [metamodel, "type_mapping"])]
  75. while work_list:
  76. mm_element = work_list.pop()
  77. if mm_element in desired_types:
  78. # Already been here, so stop
  79. continue
  80. # New element, so continue
  81. desired_types.add(mm_element)
  82. # Follow all inheritance links that COME IN this node, as all these are subtypes and should also match
  83. incoming, = yield [("RI", [mm_element])]
  84. for i in incoming:
  85. t, = yield [("RDN", [mm_typing, i])]
  86. if t == inheritance_type:
  87. e, = yield [("RE", [i])]
  88. # Add the source of the inheritance link to the work list
  89. work_list.append(e[0])
  90. # Now desired_types holds all the direct types that we are interested in!
  91. # Construct the result out of all models that are direct instances of our specified type
  92. final = set()
  93. for t in desired_types:
  94. final |= types_to_name_nodes.get(t, set())
  95. # Result is a Python set with nodes, so just make this a Mv set
  96. result, = yield [("CN", [])]
  97. v = yield [("RV", [i]) for i in final]
  98. _ = yield [("CE", [result, i]) for i in final]
  99. raise PrimitiveFinished(result)
  100. """
  101. """
  102. def add_AL(a, b, **remainder):
  103. worklist = [(b, "funcdef")]
  104. added = set()
  105. type_cache = {}
  106. model_dict, = yield [("RD", [a, "model"])]
  107. metamodel, = yield [("RD", [a, "metamodel"])]
  108. metamodel_dict, = yield [("RD", [metamodel, "model"])]
  109. type_map, = yield [("RD", [a, "type_mapping"])]
  110. outgoing, = yield [("RO", [model_dict])]
  111. edges = yield [("RE", [i]) for i in outgoing]
  112. added |= set([i[1] for i in edges])
  113. result, = yield [("CNV", ["__%s" % b])]
  114. # All the action language elements and their expected output links
  115. type_links = {
  116. "if": [("cond", ""), ("then", ""), ("else", ""), ("next", "")],
  117. "while": [("cond", ""), ("body", ""), ("next", "")],
  118. "assign": [("var", ""), ("value", ""), ("next", "")],
  119. "break": [("while", "while")],
  120. "continue": [("while", "while")],
  121. "return": [("value", "")],
  122. "resolve": [("var", "")],
  123. "access": [("var", "")],
  124. "constant": [("node", "")],
  125. "output": [("node", ""), ("next", "")],
  126. "global": [("var", "String"), ("next", "")],
  127. "param": [("name", "String"), ("value", ""), ("next_param", "param")],
  128. "funcdef": [("body", ""), ("next", "")],
  129. "call": [("func", ""), ("params", "param"), ("last_param", "param"), ("next", "")],
  130. }
  131. # Already add some often used types to the type cache, so we don't have to check for their presence
  132. to_str, string = yield [("RD", [metamodel_dict, "to_str"]),
  133. ("RD", [metamodel_dict, "String"])]
  134. type_cache = {"to_str": to_str,
  135. "String": string}
  136. while worklist:
  137. # Fetch the element and see if we need to add it
  138. worknode, expected_type = worklist.pop(0)
  139. if worknode in added:
  140. continue
  141. # Determine type of element
  142. if expected_type == "":
  143. value, = yield [("RV", [worknode])]
  144. if (isinstance(value, dict)) and ("value" in value):
  145. v = value["value"]
  146. if v in ["if", "while", "assign", "call", "break", "continue", "return", "resolve", "access", "constant", "global", "declare"]:
  147. expected_type = v
  148. else:
  149. expected_type = "Any"
  150. else:
  151. expected_type = "Any"
  152. # Fill the cache
  153. if expected_type not in type_cache:
  154. type_cache[expected_type], = yield [("RD", [metamodel_dict, expected_type])]
  155. # Need to add it now
  156. yield [("CD", [model_dict, "__%s" % worknode, worknode])]
  157. added.add(worknode)
  158. # NOTE can't just use CD here, as the key is a node and not a value
  159. t1, = yield [("CE", [type_map, type_cache[expected_type]])]
  160. t2, = yield [("CE", [t1, worknode])]
  161. if t1 is None or t2 is None:
  162. raise Exception("ERROR")
  163. # Now add all its outgoing links, depending on the type we actually saw
  164. links = type_links.get(expected_type, [])
  165. for link in links:
  166. link_name, destination_type = link
  167. # Check if the link actually exists
  168. destination, = yield [("RD", [worknode, link_name])]
  169. if destination is not None:
  170. # If so, we add it and continue
  171. edge, = yield [("RDE", [worknode, link_name])]
  172. edge_outlinks, = yield [("RO", [edge])]
  173. edge_outlink = edge_outlinks[0]
  174. edge_name, = yield [("RE", [edge_outlink])]
  175. edge_name = edge_name[1]
  176. # Now add: edge, edge_outlink, edge_name
  177. # Add 'edge'
  178. yield [("CD", [model_dict, "__%s" % edge, edge])]
  179. added.add(edge)
  180. link_type = "%s_%s" % (expected_type, link_name)
  181. if link_type not in type_cache:
  182. type_cache[link_type], = yield [("RD", [metamodel_dict, link_type])]
  183. t, = yield [("CE", [type_map, type_cache[link_type]])]
  184. yield [("CE", [t, edge])]
  185. # Add 'edge_outlink'
  186. yield [("CD", [model_dict, "__%s" % edge_outlink, edge_outlink])]
  187. added.add(edge_outlink)
  188. t, = yield [("CE", [type_map, type_cache["to_str"]])]
  189. yield [("CE", [t, edge_outlink])]
  190. # Add 'edge_name' (if not present)
  191. if edge_name not in added:
  192. yield [("CD", [model_dict, "__%s" % edge_name, edge_name])]
  193. t, = yield [("CE", [type_map, type_cache["String"]])]
  194. yield [("CE", [t, edge_name])]
  195. added.add(edge_name)
  196. # Add the destination to the worklist
  197. worklist.append((destination, destination_type))
  198. raise PrimitiveFinished(result)
  199. """
  200. """
  201. def get_superclasses(a, b, **remainder):
  202. mm, = yield [("RD", [a, "metamodel"])]
  203. mm, = yield [("RD", [mm, "metamodel"])]
  204. m, = yield [("RD", [mm, "model"])]
  205. inheritance, = yield [("RD", [m, "Inheritance"])]
  206. model_dict, = yield [("RD", [a, "model"])]
  207. b_v, = yield [("RV", [b])]
  208. subclass, = yield [("RD", [model_dict, b_v])]
  209. type_mapping, = yield [("RD", [a, "type_mapping"])]
  210. names, = yield [("RDK", [model_dict])]
  211. elems = yield [("RDN", [model_dict, i]) for i in names]
  212. elem_to_name = dict(zip(elems, names))
  213. result, = yield [("CN", [])]
  214. worklist = [subclass]
  215. touched = set()
  216. while worklist:
  217. subclass = worklist.pop()
  218. res = elem_to_name[subclass]
  219. if subclass not in touched:
  220. touched.add(subclass)
  221. yield [("CE", [result, res])]
  222. outgoing, = yield [("RO", [subclass])]
  223. types = yield [("RDN", [type_mapping, i]) for i in outgoing]
  224. for i, t in enumerate(types):
  225. if t == inheritance:
  226. # Found an inheritance link!
  227. elem = outgoing[i]
  228. srcdst, = yield [("RE", [elem])]
  229. src, dst = srcdst
  230. # Find elem in elems
  231. worklist.append(dst)
  232. if dst is None:
  233. print("Read edge gives error for edge: " + str(elem))
  234. raise PrimitiveFinished(result)
  235. """
  236. """
  237. def selectPossibleIncoming(a, b, c, **remainder):
  238. model_dict, = yield [("RD", [a, "model"])]
  239. limit_set_links, = \
  240. yield [("RO", [c])]
  241. limit_set = yield [("RE", [i]) for i in limit_set_links]
  242. limit_set_names = [i[1] for i in limit_set]
  243. name_values = yield [("RV", [i]) for i in limit_set_names]
  244. limit_set = yield [("RD", [model_dict, i]) for i in name_values]
  245. superclasses, = yield [("CALL_ARGS", [get_superclasses, (a, b)])]
  246. vals, = yield [("RO", [superclasses])]
  247. superclasses = yield [("RE", [i]) for i in vals]
  248. superclasses = [i[1] for i in superclasses]
  249. superclass_names = yield [("RV", [i]) for i in superclasses]
  250. elems = yield [("RD", [model_dict, i]) for i in superclass_names]
  251. result, = yield [("CN", [])]
  252. for i, edge in enumerate(limit_set):
  253. srcdst, = yield [("RE", [edge])]
  254. src, dst = srcdst
  255. if dst in elems:
  256. yield [("CE", [result, limit_set_names[i]])]
  257. raise PrimitiveFinished(result)
  258. """
  259. """
  260. def selectPossibleOutgoing(a, b, c, **remainder):
  261. model_dict, = yield [("RD", [a, "model"])]
  262. limit_set_links, = \
  263. yield [("RO", [c])]
  264. limit_set = yield [("RE", [i]) for i in limit_set_links]
  265. limit_set_names = \
  266. [i[1] for i in limit_set]
  267. name_values = yield [("RV", [i]) for i in limit_set_names]
  268. limit_set = yield [("RD", [model_dict, i]) for i in name_values]
  269. superclasses, = yield [("CALL_ARGS", [get_superclasses, (a, b)])]
  270. vals, = yield [("RO", [superclasses])]
  271. superclasses = yield [("RE", [i]) for i in vals]
  272. superclasses = [i[1] for i in superclasses]
  273. superclass_names = yield [("RV", [i]) for i in superclasses]
  274. elems = yield [("RD", [model_dict, i]) for i in superclass_names]
  275. result, = yield [("CN", [])]
  276. for i, edge in enumerate(limit_set):
  277. srcdst, = yield [("RE", [edge])]
  278. src, dst = srcdst
  279. if src in elems:
  280. yield [("CE", [result, limit_set_names[i]])]
  281. raise PrimitiveFinished(result)
  282. """
  283. def check_symbols(a, b, c, **remainder):
  284. symbols = {}
  285. function_name, = yield [("RV", [b])]
  286. symbols[function_name] = False
  287. object_links, = yield [("RO", [c])]
  288. set_elements = yield [("RE", [i]) for i in object_links]
  289. set_elements = [i[1] for i in set_elements]
  290. set_values = yield [("RV", [i]) for i in set_elements]
  291. set_elements = yield [("RD", [a, i]) for i in set_values]
  292. symbols_set = yield [("RD", [i, "symbols"]) for i in set_elements]
  293. all_keys = yield [("RDK", [i]) for i in symbols_set]
  294. for i, s in zip(all_keys, symbols_set):
  295. # For each object we have found
  296. keys = yield [("RV", [j]) for j in i]
  297. values = yield [("RD", [s, j]) for j in keys]
  298. values = yield [("RV", [j]) for j in values]
  299. for key, value in zip(keys, values):
  300. k = key
  301. v = value
  302. if v and symbols.get(k, False):
  303. result, = yield [("CNV", ["ERROR: multiple definition of symbol " + str(key)])]
  304. raise PrimitiveFinished(result)
  305. elif v and not symbols.get(k, False):
  306. symbols[k] = True
  307. elif not v and k not in symbols:
  308. symbols[k] = False
  309. for i, j in symbols.items():
  310. if i == "input" or i == "output":
  311. continue
  312. if not j:
  313. result, = yield [("CNV", ["ERROR: undefined symbol " + str(i)])]
  314. raise PrimitiveFinished(result)
  315. result, = yield [("CNV", ["OK"])]
  316. raise PrimitiveFinished(result)
  317. def construct_const(**remainder):
  318. v, = yield [("CNV", [{"value": "constant"}])]
  319. # Get input: keep trying until we get something
  320. inp, = yield [("CALL_KWARGS", [jit_runtime.get_input, remainder])]
  321. yield [("CD", [v, "node", inp])]
  322. raise PrimitiveFinished(v)
  323. def instantiated_name(a, b, **remainder):
  324. name_value, = yield [("RV", [b])]
  325. if name_value == "":
  326. b, = yield [("CNV", ["__" + str(a)])]
  327. raise PrimitiveFinished(b)