transform.alc 19 KB

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