transform.alc 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531
  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 for local constraints of element
  122. if (element_eq(read_attribute(schedule_model, current_element, "constraint"), read_root())):
  123. // No local constraints, so all is well
  124. set_add(filtered_options, option)
  125. else:
  126. // Check local constraints and add only if positive
  127. Element constraint_function
  128. Boolean result
  129. Element func
  130. constraint_function = read_attribute(schedule_model, current_element, "constraint")
  131. func = get_func_AL_model(import_node(constraint_function))
  132. result = func(host_model, option)
  133. if (result):
  134. set_add(filtered_options, option)
  135. Element attributes
  136. String attribute
  137. Element value
  138. Element func
  139. Boolean result
  140. Element attributes_copy
  141. options = filtered_options
  142. filtered_options = create_node()
  143. // Check whether all attributes have a satisfied condition
  144. attributes_copy = dict_keys(getAttributeList(schedule_model, current_element))
  145. while (read_nr_out(options) > 0):
  146. option = set_pop(options)
  147. attributes = set_copy(attributes_copy)
  148. result = True
  149. while (read_nr_out(attributes) > 0):
  150. attribute = set_pop(attributes)
  151. if (bool_not(string_startswith(attribute, "constraint_"))):
  152. continue!
  153. value = read_attribute(schedule_model, current_element, attribute)
  154. // Attribute might be undefined, so skip if it is
  155. if (element_neq(value, read_root())):
  156. func = get_func_AL_model(import_node(value))
  157. result = func(read_attribute(host_model, option, string_substr(attribute, string_len("constraint_"), string_len(attribute) + 1)))
  158. else:
  159. result = True
  160. if (bool_not(result)):
  161. break!
  162. // Check value of last result, which will be True if all passed, or False otherwise
  163. if (result):
  164. set_add(filtered_options, option)
  165. options = filtered_options
  166. return options!
  167. Element function full_match(host_model : Element, schedule_model : Element, current : String):
  168. Element NACs
  169. String LHS
  170. String NAC
  171. Element mappings
  172. Element mapping
  173. Integer i
  174. Element result
  175. Element final_mappings
  176. Boolean allowed
  177. final_mappings = create_node()
  178. // First match the LHS part itself to get initial mappings
  179. LHS = set_pop(allAssociationDestinations(schedule_model, current, "LHSLink"))
  180. mappings = match(host_model, schedule_model, LHS, create_node())
  181. // Got a list of all possible mappings, now filter based on NACs
  182. NACs = allAssociationDestinations(schedule_model, current, "NACLink")
  183. // For each possible mapping, we check all NACs!
  184. while (read_nr_out(mappings) > 0):
  185. mapping = set_pop(mappings)
  186. i = 0
  187. allowed = True
  188. while (i < read_nr_out(NACs)):
  189. NAC = read_edge_dst(read_out(NACs, i))
  190. result = match(host_model, schedule_model, NAC, mapping)
  191. if (read_nr_out(result) > 0):
  192. // NAC could be matched, and therefore is not allowed
  193. allowed = False
  194. break!
  195. i = i + 1
  196. if (allowed):
  197. set_add(final_mappings, mapping)
  198. return final_mappings!
  199. Element function match(host_model : Element, schedule_model : Element, LHS : String, initial_mapping : Element):
  200. // Match the schedule_model to the host_model, returning all possible mappings from schedule_model elements to host_model elements
  201. // Make the schedule first
  202. Element schedule
  203. schedule = make_matching_schedule(schedule_model, LHS, dict_keys(initial_mapping))
  204. // Now follow the schedule, incrementally building all mappings
  205. Element mappings
  206. Element new_mappings
  207. Element new_map
  208. String current_element
  209. Element map
  210. String option
  211. Element options
  212. mappings = create_node()
  213. set_add(mappings, initial_mapping)
  214. while (read_nr_out(schedule) > 0):
  215. current_element = list_pop(schedule, 0)
  216. log("Binding element with label " + cast_v2s(read_attribute(schedule_model, current_element, "label")))
  217. new_mappings = create_node()
  218. while (read_nr_out(mappings) > 0):
  219. map = set_pop(mappings)
  220. options = get_possible_bindings(host_model, schedule_model, current_element, map)
  221. while (read_nr_out(options) > 0):
  222. option = set_pop(options)
  223. new_map = dict_copy(map)
  224. dict_add(new_map, read_attribute(schedule_model, current_element, "label"), option)
  225. set_add(new_mappings, new_map)
  226. mappings = new_mappings
  227. log("Remaining options: " + cast_v2s(read_nr_out(mappings)))
  228. if (read_nr_out(mappings) == 0):
  229. // Stop because we have no more options remaining!
  230. return create_node()!
  231. // Finished, so try the global constraint
  232. String constraint
  233. Element func
  234. Boolean result
  235. new_mappings = create_node()
  236. constraint = read_attribute(schedule_model, LHS, "constraint")
  237. if (element_neq(constraint, read_root())):
  238. while (read_nr_out(mappings) > 0):
  239. map = set_pop(mappings)
  240. func = get_func_AL_model(import_node(constraint))
  241. result = func(host_model, map)
  242. if (result):
  243. set_add(new_mappings, map)
  244. mappings = new_mappings
  245. return mappings!
  246. Void function rewrite(host_model : Element, schedule_model : Element, RHS : String, mapping : Element):
  247. // Rewrite the host model based on the mapping combined with the RHS
  248. Element LHS_labels
  249. Element RHS_labels
  250. Element RHS_elements
  251. Element remaining
  252. String elem
  253. String label
  254. Element labels_to_remove
  255. Element labels_to_add
  256. String typename
  257. String original_typename
  258. String src
  259. String dst
  260. Element new_mapping
  261. String new_name
  262. Element RHS_map
  263. String tmp
  264. Element value
  265. Element action
  266. Element original_RHS_labels
  267. LHS_labels = dict_keys(mapping)
  268. RHS_labels = create_node()
  269. RHS_map = create_node()
  270. RHS_elements = allAssociationDestinations(schedule_model, RHS, "RHS_contains")
  271. while (read_nr_out(RHS_elements) > 0):
  272. tmp = set_pop(RHS_elements)
  273. label = read_attribute(schedule_model, tmp, "label")
  274. set_add(RHS_labels, label)
  275. dict_add(RHS_map, label, tmp)
  276. remaining = set_overlap(LHS_labels, RHS_labels)
  277. original_RHS_labels = set_copy(RHS_labels)
  278. while (read_nr_out(remaining) > 0):
  279. elem = set_pop(remaining)
  280. set_remove(LHS_labels, elem)
  281. set_remove(RHS_labels, elem)
  282. labels_to_remove = LHS_labels
  283. labels_to_add = set_to_list(RHS_labels)
  284. new_mapping = dict_copy(mapping)
  285. while (read_nr_out(labels_to_add) > 0):
  286. // Add the elements linked to these labels
  287. label = list_pop(labels_to_add, 0)
  288. if (is_edge(schedule_model["model"][RHS_map[label]])):
  289. // Edge
  290. src = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_src(schedule_model["model"][RHS_map[label]])), "label")
  291. dst = read_attribute(schedule_model, reverseKeyLookup(schedule_model["model"], read_edge_dst(schedule_model["model"][RHS_map[label]])), "label")
  292. // First check whether both source and destination are already created
  293. if (bool_and(dict_in(new_mapping, src), dict_in(new_mapping, dst))):
  294. // Both are present, so we can make the link
  295. typename = read_type(schedule_model, RHS_map[label])
  296. original_typename = string_substr(typename, 5, string_len(typename))
  297. new_name = instantiate_link(host_model, original_typename, "", new_mapping[src], new_mapping[dst])
  298. dict_add(new_mapping, label, new_name)
  299. else:
  300. // Delay this a bit, until all are bound
  301. list_append(labels_to_add, label)
  302. else:
  303. // Node
  304. // Create the node and add it
  305. typename = read_type(schedule_model, RHS_map[label])
  306. original_typename = string_substr(typename, 5, string_len(typename))
  307. new_name = instantiate_node(host_model, original_typename, "")
  308. dict_add(new_mapping, label, new_name)
  309. Element attributes
  310. String attribute
  311. Element result
  312. Element func
  313. while (read_nr_out(original_RHS_labels) > 0):
  314. // Perform actions
  315. label = set_pop(original_RHS_labels)
  316. // Do all attribute actions that are defined
  317. attributes = dict_keys(getAttributeList(schedule_model, RHS_map[label]))
  318. while (read_nr_out(attributes) > 0):
  319. attribute = set_pop(attributes)
  320. if (bool_not(string_startswith(attribute, "value_"))):
  321. continue!
  322. value = read_attribute(schedule_model, RHS_map[label], attribute)
  323. if (element_neq(value, read_root())):
  324. func = get_func_AL_model(import_node(value))
  325. result = func(host_model, new_mapping[label], mapping)
  326. if (has_value(result)):
  327. // New value defined, so assign!
  328. instantiate_attribute(host_model, new_mapping[label], string_substr(attribute, string_len("value_"), string_len(attribute) + 1), result)
  329. else:
  330. // Non-value return means to destroy the attribute!
  331. unset_attribute(host_model, new_mapping[label], string_substr(attribute, string_len("value_"), string_len(attribute) + 1))
  332. // Do the global action of each element
  333. action = read_attribute(schedule_model, RHS_map[label], "action")
  334. if (element_neq(action, read_root())):
  335. Element func
  336. func = get_func_AL_model(import_node(action))
  337. func(host_model, new_mapping[label], mapping)
  338. while (read_nr_out(labels_to_remove) > 0):
  339. // Remove the elements linked to these labels
  340. label = set_pop(labels_to_remove)
  341. model_delete_element(host_model, mapping[label])
  342. dict_delete(new_mapping, label)
  343. // Execute global action (whatever it may be)
  344. action = read_attribute(schedule_model, RHS, "action")
  345. if (element_neq(action, read_root())):
  346. Element func
  347. func = get_func_AL_model(import_node(action))
  348. func(host_model, new_mapping)
  349. return!
  350. Element function transform(host_model : Element, schedule_model : Element):
  351. // Find initial model
  352. Element all_composites
  353. String composite
  354. String current
  355. Element merged
  356. Element original_mm
  357. // Now start transforming for real
  358. all_composites = allInstances(schedule_model, "Composite")
  359. if (read_nr_out(all_composites) == 1):
  360. // Only one, so it is easy
  361. current = set_pop(all_composites)
  362. else:
  363. // Filter out those that are themselves contained
  364. while (read_nr_out(all_composites) > 0):
  365. composite = set_pop(all_composites)
  366. if (read_nr_out(allIncomingAssociationInstances(schedule_model, composite, "Contains")) == 0):
  367. // Isn't contained in any, so this is the root model!
  368. current = composite
  369. if (transform_composite(host_model, schedule_model, current)):
  370. // Success, so return True if it is in-place, or the new model if it is out-place
  371. return True!
  372. else:
  373. return False!
  374. Boolean function transform_composite(host_model : Element, schedule_model : Element, composite : String):
  375. String current
  376. String typename
  377. Boolean result
  378. current = set_pop(allAssociationDestinations(schedule_model, composite, "Initial"))
  379. while (is_nominal_instance(schedule_model, current, "Rule")):
  380. log("Executing " + current)
  381. // Still a rule that we must execute
  382. typename = read_type(schedule_model, current)
  383. if (typename == "Atomic"):
  384. result = transform_atomic(host_model, schedule_model, current)
  385. elif (typename == "Query"):
  386. result = transform_query(host_model, schedule_model, current)
  387. elif (typename == "Composite"):
  388. result = transform_composite(host_model, schedule_model, current)
  389. elif (typename == "ForAll"):
  390. result = transform_forall(host_model, schedule_model, current)
  391. if (result):
  392. current = set_pop(allAssociationDestinations(schedule_model, current, "OnSuccess"))
  393. else:
  394. current = set_pop(allAssociationDestinations(schedule_model, current, "OnFailure"))
  395. // No longer a rule, so it is either success or failure
  396. if (is_nominal_instance(schedule_model, current, "Success")):
  397. return True!
  398. else:
  399. return False!
  400. Boolean function transform_atomic(host_model : Element, schedule_model : Element, current : String):
  401. // Execute the atomic transformation
  402. Element mappings
  403. Element mapping
  404. mappings = full_match(host_model, schedule_model, current)
  405. if (read_nr_out(mappings) > 0):
  406. // Pick one!
  407. mapping = random_choice(set_to_list(mappings))
  408. String RHS
  409. RHS = set_pop(allAssociationDestinations(schedule_model, current, "RHSLink"))
  410. rewrite(host_model, schedule_model, RHS, mapping)
  411. return True!
  412. else:
  413. return False!
  414. Boolean function transform_forall(host_model : Element, schedule_model : Element, current : String):
  415. // Execute the atomic transformation
  416. Element mappings
  417. String RHS
  418. Element mapping
  419. Boolean result
  420. mappings = full_match(host_model, schedule_model, current)
  421. if (read_nr_out(mappings) > 0):
  422. result = True
  423. else:
  424. result = False
  425. log("Matches in forall: " + cast_v2s(read_nr_out(mappings)))
  426. while (read_nr_out(mappings) > 0):
  427. mapping = set_pop(mappings)
  428. // TODO check if there are actually no deletions happening in the meantime of other matched elements...
  429. RHS = set_pop(allAssociationDestinations(schedule_model, current, "RHSLink"))
  430. rewrite(host_model, schedule_model, RHS, mapping)
  431. return result!
  432. Boolean function transform_query(host_model : Element, schedule_model : Element, current : String):
  433. // Execute the transformation
  434. Element mappings
  435. Element mapping
  436. mappings = full_match(host_model, schedule_model, current)
  437. if (read_nr_out(mappings) > 0):
  438. return True!
  439. else:
  440. return False!