transform.alc 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  1. include "primitives.alh"
  2. include "object_operations.alh"
  3. include "modelling.alh"
  4. include "random.alh"
  5. include "conformance_scd.alh"
  6. include "model_management.alh"
  7. include "library.alh"
  8. Element function make_matching_schedule(schedule_model : Element, LHS : String, ignore : Element):
  9. Element schedule
  10. Element workset
  11. Element all_elements
  12. Element full_all_elements
  13. Integer required_size
  14. String new_element
  15. Integer counter
  16. String next
  17. Element tmp
  18. // Initialize
  19. schedule = create_node()
  20. workset = create_node()
  21. all_elements = allAssociationDestinations(schedule_model, LHS, "LHS_contains")
  22. log("All elements: " + set_to_string(all_elements))
  23. full_all_elements = set_copy(all_elements)
  24. required_size = read_nr_out(all_elements)
  25. // Need to keep adding to the schedule
  26. while (read_nr_out(schedule) < required_size):
  27. // workset is empty, but we still need to add to the list
  28. // Therefore, we pick a random, unbound node, and add it to the workset
  29. new_element = set_pop(all_elements)
  30. while (bool_or(set_in(schedule, new_element), is_edge(schedule_model["model"][new_element]))):
  31. // Element is not usable, so pick another one
  32. new_element = set_pop(all_elements)
  33. set_add(workset, new_element)
  34. // Handle the workset
  35. while (read_nr_out(workset) > 0):
  36. // Still elements in the workset, so pop from these first
  37. next = set_pop(workset)
  38. // Check if element might not be already used somewhere
  39. if (bool_not(set_in(schedule, next))):
  40. if (set_in(full_all_elements, next)):
  41. if (bool_not(set_in(ignore, read_attribute(schedule_model, next, "label")))):
  42. list_append(schedule, next)
  43. else:
  44. required_size = required_size - 1
  45. // If it is an edge, we should also add the target and source
  46. if (is_edge(schedule_model["model"][next])):
  47. // Add the target/source to the schedule
  48. set_add(workset, reverseKeyLookup(schedule_model["model"], read_edge_src(schedule_model["model"][next])))
  49. set_add(workset, reverseKeyLookup(schedule_model["model"], read_edge_dst(schedule_model["model"][next])))
  50. // Also add all outgoing links
  51. counter = read_nr_out(schedule_model["model"][next])
  52. while (counter > 0):
  53. counter = counter - 1
  54. if (set_in_node(schedule_model["model"], read_out(schedule_model["model"][next], counter))):
  55. set_add(workset, reverseKeyLookup(schedule_model["model"], read_out(schedule_model["model"][next], counter)))
  56. // And incoming links
  57. counter = read_nr_in(schedule_model["model"][next])
  58. while (counter > 0):
  59. counter = counter - 1
  60. if (set_in_node(schedule_model["model"], read_in(schedule_model["model"][next], counter))):
  61. set_add(workset, reverseKeyLookup(schedule_model["model"], read_in(schedule_model["model"][next], counter)))
  62. return schedule!
  63. Element function get_possible_bindings(host_model : Element, schedule_model : Element, current_element : String, map : Element):
  64. Element options
  65. String src_label
  66. String dst_label
  67. String typename
  68. String original_typename
  69. options = create_node()
  70. typename = read_type(schedule_model, current_element)
  71. original_typename = string_substr(typename, 4, string_len(typename))
  72. if (is_edge(schedule_model["model"][current_element])):
  73. // Is an edge, so check for already bound source/target
  74. src_label = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_src(schedule_model["model"][current_element])), "label")
  75. dst_label = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_dst(schedule_model["model"][current_element])), "label")
  76. if (bool_and(set_in(dict_keys(map), src_label), set_in(dict_keys(map), dst_label))):
  77. // Source and destination are bound
  78. options = allOutgoingAssociationInstances(host_model, map[src_label], original_typename)
  79. options = set_overlap(options, allIncomingAssociationInstances(host_model, map[dst_label], original_typename))
  80. elif (set_in(dict_keys(map), src_label)):
  81. // Source is bound
  82. options = allOutgoingAssociationInstances(host_model, map[src_label], original_typename)
  83. elif (set_in(dict_keys(map), dst_label)):
  84. // Destination is bound
  85. options = allIncomingAssociationInstances(host_model, map[dst_label], original_typename)
  86. else:
  87. // Neither is bound, so just get all of them
  88. return allInstances(host_model, original_typename)!
  89. else:
  90. // Is a node, so find whether or not there are some connections that are already resolved
  91. Element ic
  92. Element oc
  93. String poll
  94. ic = allIncomingAssociationInstances(schedule_model, current_element, "PreElement")
  95. oc = allOutgoingAssociationInstances(schedule_model, current_element, "PreElement")
  96. while (bool_and(read_nr_out(ic) > 0, read_nr_out(options) == 0)):
  97. poll = set_pop(ic)
  98. if (dict_in(map, read_attribute(schedule_model, poll, "label"))):
  99. // This incoming link is already defined, so we just have one option: the destination of the link we matched
  100. set_add(options, readAssociationDestination(host_model, map[read_attribute(schedule_model, poll, "label")]))
  101. while (bool_and(read_nr_out(oc) > 0, read_nr_out(options) == 0)):
  102. poll = set_pop(oc)
  103. if (dict_in(map, read_attribute(schedule_model, poll, "label"))):
  104. // This incoming link is already defined, so we just have one option: the destination of the link we matched
  105. set_add(options, readAssociationSource(host_model, map[read_attribute(schedule_model, poll, "label")]))
  106. if (read_nr_out(options) == 0):
  107. // Is a node and no connections, so we just pick all options
  108. options = allInstances(host_model, original_typename)
  109. elif (read_nr_out(options) > 1):
  110. // Multiple "only" options, which will not work out: no options!
  111. return create_node()!
  112. // Filter options further
  113. Element filtered_options
  114. String option
  115. filtered_options = create_node()
  116. while (read_nr_out(options) > 0):
  117. option = set_pop(options)
  118. // Check for detecting same element twice
  119. if (bool_not(set_in(map, option))):
  120. // Option is already present with another label, so skip this!
  121. // Check if it conforms to the desired type
  122. if (is_nominal_instance(host_model, option, original_typename)):
  123. // Check for local constraints of element
  124. if (element_eq(read_attribute(schedule_model, current_element, "constraint"), read_root())):
  125. // No local constraints, so all is well
  126. set_add(filtered_options, option)
  127. else:
  128. // Check local constraints and add only if positive
  129. Element constraint_function
  130. Boolean result
  131. Element func
  132. constraint_function = read_attribute(schedule_model, current_element, "constraint")
  133. func = get_func_AL_model(import_node(constraint_function))
  134. result = func(host_model, option)
  135. if (result):
  136. set_add(filtered_options, option)
  137. Element attributes
  138. String attribute
  139. Element value
  140. Element func
  141. Boolean result
  142. Element attributes_copy
  143. options = filtered_options
  144. filtered_options = create_node()
  145. // Check whether all attributes have a satisfied condition
  146. attributes_copy = dict_keys(getAttributeList(schedule_model, current_element))
  147. while (read_nr_out(options) > 0):
  148. option = set_pop(options)
  149. attributes = set_copy(attributes_copy)
  150. result = True
  151. while (read_nr_out(attributes) > 0):
  152. attribute = set_pop(attributes)
  153. if (bool_not(string_startswith(attribute, "constraint_"))):
  154. continue!
  155. value = read_attribute(schedule_model, current_element, attribute)
  156. // Attribute might be undefined, so skip if it is
  157. if (element_neq(value, read_root())):
  158. func = get_func_AL_model(import_node(value))
  159. result = func(read_attribute(host_model, option, string_substr(attribute, string_len("constraint_"), string_len(attribute) + 1)))
  160. else:
  161. result = True
  162. if (bool_not(result)):
  163. break!
  164. // Check value of last result, which will be True if all passed, or False otherwise
  165. if (result):
  166. set_add(filtered_options, option)
  167. options = filtered_options
  168. return options!
  169. Element function full_match(host_model : Element, schedule_model : Element, current : String):
  170. Element NACs
  171. String LHS
  172. String NAC
  173. Element mappings
  174. Element mapping
  175. Integer i
  176. Element result
  177. Element final_mappings
  178. Boolean allowed
  179. final_mappings = create_node()
  180. // First match the LHS part itself to get initial mappings
  181. LHS = set_pop(allAssociationDestinations(schedule_model, current, "LHSLink"))
  182. mappings = match(host_model, schedule_model, LHS, create_node())
  183. // Got a list of all possible mappings, now filter based on NACs
  184. NACs = allAssociationDestinations(schedule_model, current, "NACLink")
  185. // For each possible mapping, we check all NACs!
  186. while (read_nr_out(mappings) > 0):
  187. mapping = set_pop(mappings)
  188. i = 0
  189. allowed = True
  190. while (i < read_nr_out(NACs)):
  191. NAC = read_edge_dst(read_out(NACs, i))
  192. result = match(host_model, schedule_model, NAC, mapping)
  193. if (read_nr_out(result) > 0):
  194. // NAC could be matched, and therefore is not allowed
  195. allowed = False
  196. break!
  197. i = i + 1
  198. if (allowed):
  199. set_add(final_mappings, mapping)
  200. return final_mappings!
  201. Element function match(host_model : Element, schedule_model : Element, LHS : String, initial_mapping : Element):
  202. // Match the schedule_model to the host_model, returning all possible mappings from schedule_model elements to host_model elements
  203. // Make the schedule first
  204. Element schedule
  205. schedule = make_matching_schedule(schedule_model, LHS, dict_keys(initial_mapping))
  206. // Now follow the schedule, incrementally building all mappings
  207. Element mappings
  208. Element new_mappings
  209. Element new_map
  210. String current_element
  211. Element map
  212. String option
  213. Element options
  214. mappings = create_node()
  215. set_add(mappings, initial_mapping)
  216. while (read_nr_out(schedule) > 0):
  217. current_element = list_pop(schedule, 0)
  218. log("Binding element with label " + cast_v2s(read_attribute(schedule_model, current_element, "label")))
  219. new_mappings = create_node()
  220. while (read_nr_out(mappings) > 0):
  221. map = set_pop(mappings)
  222. options = get_possible_bindings(host_model, schedule_model, current_element, map)
  223. while (read_nr_out(options) > 0):
  224. option = set_pop(options)
  225. new_map = dict_copy(map)
  226. dict_add(new_map, read_attribute(schedule_model, current_element, "label"), option)
  227. set_add(new_mappings, new_map)
  228. mappings = new_mappings
  229. log("Remaining options: " + cast_v2s(read_nr_out(mappings)))
  230. if (read_nr_out(mappings) == 0):
  231. // Stop because we have no more options remaining!
  232. return create_node()!
  233. // Finished, so try the global constraint
  234. String constraint
  235. Element func
  236. Boolean result
  237. new_mappings = create_node()
  238. constraint = read_attribute(schedule_model, LHS, "constraint")
  239. if (element_neq(constraint, read_root())):
  240. while (read_nr_out(mappings) > 0):
  241. map = set_pop(mappings)
  242. func = get_func_AL_model(import_node(constraint))
  243. result = func(host_model, map)
  244. if (result):
  245. set_add(new_mappings, map)
  246. mappings = new_mappings
  247. return mappings!
  248. Void function rewrite(host_model : Element, schedule_model : Element, RHS : String, mapping : Element):
  249. // Rewrite the host model based on the mapping combined with the RHS
  250. Element LHS_labels
  251. Element RHS_labels
  252. Element RHS_elements
  253. Element remaining
  254. String elem
  255. String label
  256. Element labels_to_remove
  257. Element labels_to_add
  258. String typename
  259. String original_typename
  260. String src
  261. String dst
  262. Element new_mapping
  263. String new_name
  264. Element RHS_map
  265. String tmp
  266. Element value
  267. Element action
  268. Element original_RHS_labels
  269. LHS_labels = dict_keys(mapping)
  270. RHS_labels = create_node()
  271. RHS_map = create_node()
  272. RHS_elements = allAssociationDestinations(schedule_model, RHS, "RHS_contains")
  273. while (read_nr_out(RHS_elements) > 0):
  274. tmp = set_pop(RHS_elements)
  275. label = read_attribute(schedule_model, tmp, "label")
  276. set_add(RHS_labels, label)
  277. dict_add(RHS_map, label, tmp)
  278. remaining = set_overlap(LHS_labels, RHS_labels)
  279. original_RHS_labels = set_copy(RHS_labels)
  280. while (read_nr_out(remaining) > 0):
  281. elem = set_pop(remaining)
  282. set_remove(LHS_labels, elem)
  283. set_remove(RHS_labels, elem)
  284. labels_to_remove = LHS_labels
  285. labels_to_add = set_to_list(RHS_labels)
  286. new_mapping = dict_copy(mapping)
  287. while (read_nr_out(labels_to_add) > 0):
  288. // Add the elements linked to these labels
  289. label = list_pop(labels_to_add, 0)
  290. if (is_edge(schedule_model["model"][RHS_map[label]])):
  291. // Edge
  292. src = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_src(schedule_model["model"][RHS_map[label]])), "label")
  293. dst = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_dst(schedule_model["model"][RHS_map[label]])), "label")
  294. // First check whether both source and destination are already created
  295. if (bool_and(dict_in(new_mapping, src), dict_in(new_mapping, dst))):
  296. // Both are present, so we can make the link
  297. typename = read_type(schedule_model, RHS_map[label])
  298. original_typename = string_substr(typename, 5, string_len(typename))
  299. new_name = instantiate_link(host_model, original_typename, "", new_mapping[src], new_mapping[dst])
  300. dict_add(new_mapping, label, new_name)
  301. else:
  302. // Delay this a bit, until all are bound
  303. list_append(labels_to_add, label)
  304. else:
  305. // Node
  306. // Create the node and add it
  307. typename = read_type(schedule_model, RHS_map[label])
  308. original_typename = string_substr(typename, 5, string_len(typename))
  309. new_name = instantiate_node(host_model, original_typename, "")
  310. dict_add(new_mapping, label, new_name)
  311. Element attributes
  312. String attribute
  313. Element result
  314. Element func
  315. while (read_nr_out(original_RHS_labels) > 0):
  316. // Perform actions
  317. label = set_pop(original_RHS_labels)
  318. // Do all attribute actions that are defined
  319. attributes = dict_keys(getAttributeList(schedule_model, RHS_map[label]))
  320. while (read_nr_out(attributes) > 0):
  321. attribute = set_pop(attributes)
  322. if (bool_not(string_startswith(attribute, "value_"))):
  323. continue!
  324. value = read_attribute(schedule_model, RHS_map[label], attribute)
  325. if (element_neq(value, read_root())):
  326. func = get_func_AL_model(import_node(value))
  327. result = func(host_model, new_mapping[label], mapping)
  328. if (has_value(result)):
  329. // New value defined, so assign!
  330. instantiate_attribute(host_model, new_mapping[label], string_substr(attribute, string_len("value_"), string_len(attribute) + 1), result)
  331. else:
  332. // Non-value return means to destroy the attribute!
  333. unset_attribute(host_model, new_mapping[label], string_substr(attribute, string_len("value_"), string_len(attribute) + 1))
  334. // Do the global action of each element
  335. action = read_attribute(schedule_model, RHS_map[label], "action")
  336. if (element_neq(action, read_root())):
  337. Element func
  338. func = get_func_AL_model(import_node(action))
  339. func(host_model, new_mapping[label], mapping)
  340. while (read_nr_out(labels_to_remove) > 0):
  341. // Remove the elements linked to these labels
  342. label = set_pop(labels_to_remove)
  343. model_delete_element(host_model, mapping[label])
  344. dict_delete(new_mapping, label)
  345. // Execute global action (whatever it may be)
  346. action = read_attribute(schedule_model, RHS, "action")
  347. if (element_neq(action, read_root())):
  348. Element func
  349. func = get_func_AL_model(import_node(action))
  350. func(host_model, new_mapping)
  351. return!
  352. Element function transform(host_model : Element, schedule_model : Element):
  353. // Find initial model
  354. Element all_composites
  355. String composite
  356. String current
  357. Element merged
  358. Element original_mm
  359. // Now start transforming for real
  360. all_composites = allInstances(schedule_model, "Composite")
  361. if (read_nr_out(all_composites) == 1):
  362. // Only one, so it is easy
  363. current = set_pop(all_composites)
  364. else:
  365. // Filter out those that are themselves contained
  366. while (read_nr_out(all_composites) > 0):
  367. composite = set_pop(all_composites)
  368. if (read_nr_out(allIncomingAssociationInstances(schedule_model, composite, "Contains")) == 0):
  369. // Isn't contained in any, so this is the root model!
  370. current = composite
  371. if (transform_composite(host_model, schedule_model, current)):
  372. // Success, so return True if it is in-place, or the new model if it is out-place
  373. return True!
  374. else:
  375. return False!
  376. Boolean function transform_composite(host_model : Element, schedule_model : Element, composite : String):
  377. String current
  378. String typename
  379. Boolean result
  380. current = set_pop(allAssociationDestinations(schedule_model, composite, "Initial"))
  381. while (is_nominal_instance(schedule_model, current, "Rule")):
  382. log("Executing " + current)
  383. // Still a rule that we must execute
  384. typename = read_type(schedule_model, current)
  385. if (typename == "Atomic"):
  386. result = transform_atomic(host_model, schedule_model, current)
  387. elif (typename == "Query"):
  388. result = transform_query(host_model, schedule_model, current)
  389. elif (typename == "Composite"):
  390. result = transform_composite(host_model, schedule_model, current)
  391. elif (typename == "ForAll"):
  392. result = transform_forall(host_model, schedule_model, current)
  393. if (result):
  394. current = set_pop(allAssociationDestinations(schedule_model, current, "OnSuccess"))
  395. else:
  396. current = set_pop(allAssociationDestinations(schedule_model, current, "OnFailure"))
  397. // No longer a rule, so it is either success or failure
  398. if (is_nominal_instance(schedule_model, current, "Success")):
  399. return True!
  400. else:
  401. return False!
  402. Boolean function transform_atomic(host_model : Element, schedule_model : Element, current : String):
  403. // Execute the atomic transformation
  404. Element mappings
  405. Element mapping
  406. mappings = full_match(host_model, schedule_model, current)
  407. if (read_nr_out(mappings) > 0):
  408. // Pick one!
  409. mapping = random_choice(set_to_list(mappings))
  410. String RHS
  411. RHS = set_pop(allAssociationDestinations(schedule_model, current, "RHSLink"))
  412. rewrite(host_model, schedule_model, RHS, mapping)
  413. return True!
  414. else:
  415. return False!
  416. Boolean function transform_forall(host_model : Element, schedule_model : Element, current : String):
  417. // Execute the atomic transformation
  418. Element mappings
  419. String RHS
  420. Element mapping
  421. Boolean result
  422. mappings = full_match(host_model, schedule_model, current)
  423. if (read_nr_out(mappings) > 0):
  424. result = True
  425. else:
  426. result = False
  427. log("Matches in forall: " + cast_v2s(read_nr_out(mappings)))
  428. while (read_nr_out(mappings) > 0):
  429. mapping = set_pop(mappings)
  430. // TODO check if there are actually no deletions happening in the meantime of other matched elements...
  431. RHS = set_pop(allAssociationDestinations(schedule_model, current, "RHSLink"))
  432. rewrite(host_model, schedule_model, RHS, mapping)
  433. return result!
  434. Boolean function transform_query(host_model : Element, schedule_model : Element, current : String):
  435. // Execute the transformation
  436. Element mappings
  437. Element mapping
  438. mappings = full_match(host_model, schedule_model, current)
  439. if (read_nr_out(mappings) > 0):
  440. return True!
  441. else:
  442. return False!