@sccharts-lab/engine 0.0.0-stage → 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (279) hide show
  1. package/LICENSE +277 -0
  2. package/README.md +125 -2
  3. package/dist/codegen/expr.d.ts +36 -0
  4. package/dist/codegen/expr.js +252 -0
  5. package/dist/codegen/expr.js.map +1 -0
  6. package/dist/codegen/index.d.ts +4 -0
  7. package/dist/codegen/index.js +238 -0
  8. package/dist/codegen/index.js.map +1 -0
  9. package/dist/codegen/layout.d.ts +57 -0
  10. package/dist/codegen/layout.js +306 -0
  11. package/dist/codegen/layout.js.map +1 -0
  12. package/dist/codegen/logic.d.ts +31 -0
  13. package/dist/codegen/logic.js +258 -0
  14. package/dist/codegen/logic.js.map +1 -0
  15. package/dist/codegen/methods.d.ts +17 -0
  16. package/dist/codegen/methods.js +242 -0
  17. package/dist/codegen/methods.js.map +1 -0
  18. package/dist/codegen/reset.d.ts +6 -0
  19. package/dist/codegen/reset.js +110 -0
  20. package/dist/codegen/reset.js.map +1 -0
  21. package/dist/codegen/types.d.ts +81 -0
  22. package/dist/codegen/types.js +3 -0
  23. package/dist/codegen/types.js.map +1 -0
  24. package/dist/format.d.ts +136 -0
  25. package/dist/format.js +872 -0
  26. package/dist/format.js.map +1 -0
  27. package/dist/index.d.ts +120 -0
  28. package/dist/index.js +507 -0
  29. package/dist/index.js.map +1 -0
  30. package/dist/internal.d.ts +1 -0
  31. package/dist/internal.js +4 -0
  32. package/dist/internal.js.map +1 -0
  33. package/dist/parser/ids.d.ts +4 -0
  34. package/dist/parser/ids.js +172 -0
  35. package/dist/parser/ids.js.map +1 -0
  36. package/dist/parser/imports.d.ts +2 -0
  37. package/dist/parser/imports.js +28 -0
  38. package/dist/parser/imports.js.map +1 -0
  39. package/dist/parser/interface.d.ts +10 -0
  40. package/dist/parser/interface.js +93 -0
  41. package/dist/parser/interface.js.map +1 -0
  42. package/dist/parser/kielerWording.d.ts +2 -0
  43. package/dist/parser/kielerWording.js +196 -0
  44. package/dist/parser/kielerWording.js.map +1 -0
  45. package/dist/parser/lexer.d.ts +25 -0
  46. package/dist/parser/lexer.js +334 -0
  47. package/dist/parser/lexer.js.map +1 -0
  48. package/dist/parser/parser.d.ts +29 -0
  49. package/dist/parser/parser.js +3249 -0
  50. package/dist/parser/parser.js.map +1 -0
  51. package/dist/parser/resolve.d.ts +46 -0
  52. package/dist/parser/resolve.js +919 -0
  53. package/dist/parser/resolve.js.map +1 -0
  54. package/dist/parser/source.d.ts +15 -0
  55. package/dist/parser/source.js +42 -0
  56. package/dist/parser/source.js.map +1 -0
  57. package/dist/parser/validate.d.ts +5 -0
  58. package/dist/parser/validate.js +1430 -0
  59. package/dist/parser/validate.js.map +1 -0
  60. package/dist/sim/abortRegions.d.ts +9 -0
  61. package/dist/sim/abortRegions.js +192 -0
  62. package/dist/sim/abortRegions.js.map +1 -0
  63. package/dist/sim/analysis.d.ts +113 -0
  64. package/dist/sim/analysis.js +1104 -0
  65. package/dist/sim/analysis.js.map +1 -0
  66. package/dist/sim/codegen.d.ts +30 -0
  67. package/dist/sim/codegen.js +730 -0
  68. package/dist/sim/codegen.js.map +1 -0
  69. package/dist/sim/compile.d.ts +43 -0
  70. package/dist/sim/compile.js +1062 -0
  71. package/dist/sim/compile.js.map +1 -0
  72. package/dist/sim/deps.d.ts +73 -0
  73. package/dist/sim/deps.js +481 -0
  74. package/dist/sim/deps.js.map +1 -0
  75. package/dist/sim/describe.d.ts +22 -0
  76. package/dist/sim/describe.js +272 -0
  77. package/dist/sim/describe.js.map +1 -0
  78. package/dist/sim/describePreemption.d.ts +22 -0
  79. package/dist/sim/describePreemption.js +90 -0
  80. package/dist/sim/describePreemption.js.map +1 -0
  81. package/dist/sim/describeStructure.d.ts +75 -0
  82. package/dist/sim/describeStructure.js +293 -0
  83. package/dist/sim/describeStructure.js.map +1 -0
  84. package/dist/sim/eval.d.ts +99 -0
  85. package/dist/sim/eval.js +644 -0
  86. package/dist/sim/eval.js.map +1 -0
  87. package/dist/sim/exec.d.ts +212 -0
  88. package/dist/sim/exec.js +874 -0
  89. package/dist/sim/exec.js.map +1 -0
  90. package/dist/sim/fold.d.ts +2 -0
  91. package/dist/sim/fold.js +40 -0
  92. package/dist/sim/fold.js.map +1 -0
  93. package/dist/sim/goblock.d.ts +16 -0
  94. package/dist/sim/goblock.js +171 -0
  95. package/dist/sim/goblock.js.map +1 -0
  96. package/dist/sim/guardIndices.d.ts +13 -0
  97. package/dist/sim/guardIndices.js +137 -0
  98. package/dist/sim/guardIndices.js.map +1 -0
  99. package/dist/sim/index.d.ts +43 -0
  100. package/dist/sim/index.js +138 -0
  101. package/dist/sim/index.js.map +1 -0
  102. package/dist/sim/lower.d.ts +33 -0
  103. package/dist/sim/lower.js +716 -0
  104. package/dist/sim/lower.js.map +1 -0
  105. package/dist/sim/memory.d.ts +47 -0
  106. package/dist/sim/memory.js +328 -0
  107. package/dist/sim/memory.js.map +1 -0
  108. package/dist/sim/model.d.ts +487 -0
  109. package/dist/sim/model.js +772 -0
  110. package/dist/sim/model.js.map +1 -0
  111. package/dist/sim/passes/abort.d.ts +2 -0
  112. package/dist/sim/passes/abort.js +269 -0
  113. package/dist/sim/passes/abort.js.map +1 -0
  114. package/dist/sim/passes/abortRegion.d.ts +10 -0
  115. package/dist/sim/passes/abortRegion.js +62 -0
  116. package/dist/sim/passes/abortRegion.js.map +1 -0
  117. package/dist/sim/passes/arrayAssignment.d.ts +2 -0
  118. package/dist/sim/passes/arrayAssignment.js +147 -0
  119. package/dist/sim/passes/arrayAssignment.js.map +1 -0
  120. package/dist/sim/passes/codeEffects.d.ts +2 -0
  121. package/dist/sim/passes/codeEffects.js +14 -0
  122. package/dist/sim/passes/codeEffects.js.map +1 -0
  123. package/dist/sim/passes/complexFinalState.d.ts +4 -0
  124. package/dist/sim/passes/complexFinalState.js +77 -0
  125. package/dist/sim/passes/complexFinalState.js.map +1 -0
  126. package/dist/sim/passes/connector.d.ts +2 -0
  127. package/dist/sim/passes/connector.js +18 -0
  128. package/dist/sim/passes/connector.js.map +1 -0
  129. package/dist/sim/passes/contained.d.ts +37 -0
  130. package/dist/sim/passes/contained.js +198 -0
  131. package/dist/sim/passes/contained.js.map +1 -0
  132. package/dist/sim/passes/context.d.ts +39 -0
  133. package/dist/sim/passes/context.js +3 -0
  134. package/dist/sim/passes/context.js.map +1 -0
  135. package/dist/sim/passes/countDelay.d.ts +2 -0
  136. package/dist/sim/passes/countDelay.js +51 -0
  137. package/dist/sim/passes/countDelay.js.map +1 -0
  138. package/dist/sim/passes/dataflow.d.ts +11 -0
  139. package/dist/sim/passes/dataflow.js +319 -0
  140. package/dist/sim/passes/dataflow.js.map +1 -0
  141. package/dist/sim/passes/deferred.d.ts +2 -0
  142. package/dist/sim/passes/deferred.js +345 -0
  143. package/dist/sim/passes/deferred.js.map +1 -0
  144. package/dist/sim/passes/detect.d.ts +10 -0
  145. package/dist/sim/passes/detect.js +33 -0
  146. package/dist/sim/passes/detect.js.map +1 -0
  147. package/dist/sim/passes/during.d.ts +2 -0
  148. package/dist/sim/passes/during.js +67 -0
  149. package/dist/sim/passes/during.js.map +1 -0
  150. package/dist/sim/passes/entry.d.ts +5 -0
  151. package/dist/sim/passes/entry.js +93 -0
  152. package/dist/sim/passes/entry.js.map +1 -0
  153. package/dist/sim/passes/enum.d.ts +2 -0
  154. package/dist/sim/passes/enum.js +22 -0
  155. package/dist/sim/passes/enum.js.map +1 -0
  156. package/dist/sim/passes/exit.d.ts +4 -0
  157. package/dist/sim/passes/exit.js +120 -0
  158. package/dist/sim/passes/exit.js.map +1 -0
  159. package/dist/sim/passes/finalRegion.d.ts +2 -0
  160. package/dist/sim/passes/finalRegion.js +21 -0
  161. package/dist/sim/passes/finalRegion.js.map +1 -0
  162. package/dist/sim/passes/followedBy.d.ts +2 -0
  163. package/dist/sim/passes/followedBy.js +78 -0
  164. package/dist/sim/passes/followedBy.js.map +1 -0
  165. package/dist/sim/passes/forRegion.d.ts +9 -0
  166. package/dist/sim/passes/forRegion.js +230 -0
  167. package/dist/sim/passes/forRegion.js.map +1 -0
  168. package/dist/sim/passes/history.d.ts +12 -0
  169. package/dist/sim/passes/history.js +115 -0
  170. package/dist/sim/passes/history.js.map +1 -0
  171. package/dist/sim/passes/hostCode.d.ts +2 -0
  172. package/dist/sim/passes/hostCode.js +152 -0
  173. package/dist/sim/passes/hostCode.js.map +1 -0
  174. package/dist/sim/passes/index.d.ts +4 -0
  175. package/dist/sim/passes/index.js +84 -0
  176. package/dist/sim/passes/index.js.map +1 -0
  177. package/dist/sim/passes/inheritance.d.ts +8 -0
  178. package/dist/sim/passes/inheritance.js +233 -0
  179. package/dist/sim/passes/inheritance.js.map +1 -0
  180. package/dist/sim/passes/initOperator.d.ts +2 -0
  181. package/dist/sim/passes/initOperator.js +68 -0
  182. package/dist/sim/passes/initOperator.js.map +1 -0
  183. package/dist/sim/passes/initialization.d.ts +2 -0
  184. package/dist/sim/passes/initialization.js +69 -0
  185. package/dist/sim/passes/initialization.js.map +1 -0
  186. package/dist/sim/passes/ode.d.ts +2 -0
  187. package/dist/sim/passes/ode.js +14 -0
  188. package/dist/sim/passes/ode.js.map +1 -0
  189. package/dist/sim/passes/period.d.ts +2 -0
  190. package/dist/sim/passes/period.js +106 -0
  191. package/dist/sim/passes/period.js.map +1 -0
  192. package/dist/sim/passes/prTransitions.d.ts +2 -0
  193. package/dist/sim/passes/prTransitions.js +12 -0
  194. package/dist/sim/passes/prTransitions.js.map +1 -0
  195. package/dist/sim/passes/pre.d.ts +4 -0
  196. package/dist/sim/passes/pre.js +326 -0
  197. package/dist/sim/passes/pre.js.map +1 -0
  198. package/dist/sim/passes/quirks.d.ts +2 -0
  199. package/dist/sim/passes/quirks.js +169 -0
  200. package/dist/sim/passes/quirks.js.map +1 -0
  201. package/dist/sim/passes/reference.d.ts +60 -0
  202. package/dist/sim/passes/reference.js +386 -0
  203. package/dist/sim/passes/reference.js.map +1 -0
  204. package/dist/sim/passes/regionActions.d.ts +2 -0
  205. package/dist/sim/passes/regionActions.js +56 -0
  206. package/dist/sim/passes/regionActions.js.map +1 -0
  207. package/dist/sim/passes/sequentialFollowedBy.d.ts +2 -0
  208. package/dist/sim/passes/sequentialFollowedBy.js +72 -0
  209. package/dist/sim/passes/sequentialFollowedBy.js.map +1 -0
  210. package/dist/sim/passes/signal.d.ts +2 -0
  211. package/dist/sim/passes/signal.js +230 -0
  212. package/dist/sim/passes/signal.js.map +1 -0
  213. package/dist/sim/passes/static.d.ts +5 -0
  214. package/dist/sim/passes/static.js +67 -0
  215. package/dist/sim/passes/static.js.map +1 -0
  216. package/dist/sim/passes/suspend.d.ts +10 -0
  217. package/dist/sim/passes/suspend.js +71 -0
  218. package/dist/sim/passes/suspend.js.map +1 -0
  219. package/dist/sim/passes/termination.d.ts +9 -0
  220. package/dist/sim/passes/termination.js +69 -0
  221. package/dist/sim/passes/termination.js.map +1 -0
  222. package/dist/sim/passes/timedAutomata.d.ts +10 -0
  223. package/dist/sim/passes/timedAutomata.js +437 -0
  224. package/dist/sim/passes/timedAutomata.js.map +1 -0
  225. package/dist/sim/passes/unpackClasses.d.ts +2 -0
  226. package/dist/sim/passes/unpackClasses.js +54 -0
  227. package/dist/sim/passes/unpackClasses.js.map +1 -0
  228. package/dist/sim/passes/userSchedule.d.ts +2 -0
  229. package/dist/sim/passes/userSchedule.js +43 -0
  230. package/dist/sim/passes/userSchedule.js.map +1 -0
  231. package/dist/sim/passes/weakSuspend.d.ts +2 -0
  232. package/dist/sim/passes/weakSuspend.js +145 -0
  233. package/dist/sim/passes/weakSuspend.js.map +1 -0
  234. package/dist/sim/preemptionLog.d.ts +41 -0
  235. package/dist/sim/preemptionLog.js +133 -0
  236. package/dist/sim/preemptionLog.js.map +1 -0
  237. package/dist/sim/random.d.ts +12 -0
  238. package/dist/sim/random.js +40 -0
  239. package/dist/sim/random.js.map +1 -0
  240. package/dist/sim/reasons.d.ts +29 -0
  241. package/dist/sim/reasons.js +168 -0
  242. package/dist/sim/reasons.js.map +1 -0
  243. package/dist/sim/scg.d.ts +124 -0
  244. package/dist/sim/scg.js +723 -0
  245. package/dist/sim/scg.js.map +1 -0
  246. package/dist/sim/sfr.d.ts +4 -0
  247. package/dist/sim/sfr.js +264 -0
  248. package/dist/sim/sfr.js.map +1 -0
  249. package/dist/sim/stringConditions.d.ts +3 -0
  250. package/dist/sim/stringConditions.js +42 -0
  251. package/dist/sim/stringConditions.js.map +1 -0
  252. package/dist/sim/structure/copy.d.ts +4 -0
  253. package/dist/sim/structure/copy.js +140 -0
  254. package/dist/sim/structure/copy.js.map +1 -0
  255. package/dist/sim/structure/delays.d.ts +30 -0
  256. package/dist/sim/structure/delays.js +127 -0
  257. package/dist/sim/structure/delays.js.map +1 -0
  258. package/dist/sim/structure/instance.d.ts +15 -0
  259. package/dist/sim/structure/instance.js +69 -0
  260. package/dist/sim/structure/instance.js.map +1 -0
  261. package/dist/sim/structure/methods.d.ts +19 -0
  262. package/dist/sim/structure/methods.js +550 -0
  263. package/dist/sim/structure/methods.js.map +1 -0
  264. package/dist/sim/structure/rewrite.d.ts +20 -0
  265. package/dist/sim/structure/rewrite.js +113 -0
  266. package/dist/sim/structure/rewrite.js.map +1 -0
  267. package/dist/sim/structure/track.d.ts +22 -0
  268. package/dist/sim/structure/track.js +123 -0
  269. package/dist/sim/structure/track.js.map +1 -0
  270. package/dist/sim/tracker.d.ts +77 -0
  271. package/dist/sim/tracker.js +265 -0
  272. package/dist/sim/tracker.js.map +1 -0
  273. package/dist/sim/values.d.ts +31 -0
  274. package/dist/sim/values.js +103 -0
  275. package/dist/sim/values.js.map +1 -0
  276. package/dist/types.d.ts +670 -0
  277. package/dist/types.js +9 -0
  278. package/dist/types.js.map +1 -0
  279. package/package.json +58 -3
@@ -0,0 +1,481 @@
1
+ // Data dependencies between concurrent SCG nodes, as KIELER's dependency analysis computes them
2
+ // (kicool/processors/dependencies/AbstractDependencyAnalysis.xtend, scg/processors/DependencyTransformationV2.xtend;
3
+ // concurrency.md 1.3, 1.4):
4
+ //
5
+ // - every assignment is an absolute write, a relative write (x op= e not reading x, x++, and old-style
6
+ // x = ... x ... reading x exactly once) or, for its operands, a read; conditionals read their condition;
7
+ // - array accesses with constant indices are accesses to that cell, others to the whole array;
8
+ // - between concurrent accesses: absolute write -> relative write -> read; two absolute writes conflict
9
+ // (edges both ways) unless confluent (same value or structurally equal expression); relative writes with
10
+ // non-commuting operators conflict too.
11
+ import { controlflowRegions, sameExpr, walkExpr } from "./model.js";
12
+ import { noKielerNode } from "./scg.js";
13
+ const PRIORITY = { write: 0, relative: 1, read: 2 };
14
+ const PLUS_MINUS = new Set(['++', '--', '+=', '-=']);
15
+ function commuting(a, b) {
16
+ return a === b || (PLUS_MINUS.has(a ?? '') && PLUS_MINUS.has(b ?? ''));
17
+ }
18
+ /** Constant-index key of a reference (`a[1][2]` -> "1,2"), undefined if any index is not a literal. */
19
+ function cellKey(r) {
20
+ if (!r.idx.length)
21
+ return undefined;
22
+ const parts = [];
23
+ for (const i of r.idx) {
24
+ if (i.k === 'lit' && typeof i.v === 'number')
25
+ parts.push(i.v);
26
+ else if (i.k === 'lit' && typeof i.v === 'boolean')
27
+ parts.push(i.v ? 1 : 0);
28
+ else
29
+ return undefined;
30
+ }
31
+ return parts.join(',');
32
+ }
33
+ function lowermost(r) {
34
+ let x = r;
35
+ while (x.sub)
36
+ x = x.sub;
37
+ return x;
38
+ }
39
+ /** The reads of an expression: every variable reference, including those in indices. */
40
+ function reads(node, e, out) {
41
+ walkExpr(e, x => {
42
+ if (x.k === 'ref')
43
+ out.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span });
44
+ });
45
+ }
46
+ /** The accesses of one SCG node. */
47
+ export function nodeAccesses(node) {
48
+ const out = [];
49
+ if (node.kind === 'cond') {
50
+ reads(node, node.expr, out);
51
+ return out;
52
+ }
53
+ if (node.kind !== 'assign' || !node.effect)
54
+ return out;
55
+ const f = node.effect;
56
+ switch (f.k) {
57
+ case 'assign': {
58
+ const rhs = [];
59
+ reads(node, f.expr, rhs);
60
+ const target = f.ref;
61
+ const low = lowermost(target);
62
+ // A sub reference reads its parent (member access).
63
+ if (target.sub)
64
+ reads(node, { ...target, sub: undefined, idx: [] }, out);
65
+ const isTarget = (a) => a.v === low.v && a.cell === cellKey(low);
66
+ const ownReads = rhs.filter(isTarget).length;
67
+ // The assignment's own reads of its target are dropped once the write is recorded (deps:200-205).
68
+ for (const a of rhs)
69
+ if (!isTarget(a))
70
+ out.push(a);
71
+ // Index expressions are read.
72
+ for (const i of low.idx)
73
+ reads(node, i, out);
74
+ let cls = 'write';
75
+ if (ownReads > 0 && ownReads === 1 && f.op === '=')
76
+ cls = 'relative';
77
+ if (f.op !== '=' && ownReads === 0)
78
+ cls = 'relative';
79
+ out.push({ node, v: low.v, cell: cellKey(low), cls, op: f.op, expr: f.expr, span: f.o.span });
80
+ return out;
81
+ }
82
+ case 'print':
83
+ for (const a of f.args)
84
+ reads(node, a, out);
85
+ return out;
86
+ case 'call': {
87
+ const call = f.call;
88
+ call.args.forEach((a, i) => {
89
+ const mode = call.paramAccess?.[i];
90
+ if (mode === '!&' || mode === '&') {
91
+ walkExpr(a, x => {
92
+ if (x.k === 'ref')
93
+ out.push({ node, v: x.v, cell: cellKey(x), cls: mode === '!&' ? 'write' : 'relative', span: x.span });
94
+ });
95
+ }
96
+ else {
97
+ reads(node, a, out);
98
+ }
99
+ });
100
+ return out;
101
+ }
102
+ case 'emit':
103
+ reads(node, f.value, out);
104
+ return out;
105
+ default:
106
+ return out;
107
+ }
108
+ }
109
+ /**
110
+ * The accesses inside the methods a node calls that KIELER does not inline (DependencyTransformationV2
111
+ * .processInnerAccesses): the reads and writes of the method's body, its locals and parameters left out, count as the
112
+ * calling node's, and the calling node's operator decides whether two updates commute (a call effect is an
113
+ * assignment with `=`, so its `x += 1` conflicts with a concurrent `x += 1`; probe structure/probe-method-inner-*).
114
+ */
115
+ export function innerAccesses(node, isInlined) {
116
+ const out = [];
117
+ const op = node.kind === 'assign' && node.effect?.k === 'assign' ? node.effect.op : node.kind === 'assign' ? '=' : undefined;
118
+ const anyOp = node.kind !== 'assign';
119
+ const visiting = new Set();
120
+ let via = '';
121
+ const tag = () => (anyOp ? { anyOp, via } : { via });
122
+ const calls = (e, local) => walkExpr(e, x => { if (x.k === 'call' && !x.extern && x.target?.v.method)
123
+ method(x.target.v.method, local); });
124
+ const read = (e, local) => {
125
+ walkExpr(e, x => { if (x.k === 'ref' && !local.has(x.v))
126
+ out.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span, ...tag() }); });
127
+ calls(e, local);
128
+ };
129
+ const statements = (list, local) => {
130
+ for (const st of list) {
131
+ switch (st.k) {
132
+ case 'do': {
133
+ const f = st.f;
134
+ if (f.k === 'assign') {
135
+ const low = lowermost(f.ref);
136
+ const rhs = [];
137
+ walkExpr(f.expr, x => { if (x.k === 'ref')
138
+ rhs.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span }); });
139
+ const isTarget = (a) => a.v === low.v && a.cell === cellKey(low);
140
+ const ownReads = rhs.filter(isTarget).length;
141
+ for (const a of rhs)
142
+ if (!isTarget(a) && !local.has(a.v))
143
+ out.push({ ...a, ...tag() });
144
+ calls(f.expr, local);
145
+ for (const i of low.idx)
146
+ read(i, local);
147
+ if (local.has(low.v))
148
+ break;
149
+ let cls = 'write';
150
+ if (ownReads === 1 && f.op === '=')
151
+ cls = 'relative';
152
+ if (f.op !== '=' && ownReads === 0)
153
+ cls = 'relative';
154
+ out.push({ node, v: low.v, cell: cellKey(low), cls, op, span: f.o.span, ...tag() });
155
+ }
156
+ else if (f.k === 'print')
157
+ f.args.forEach(a => read(a, local));
158
+ else if (f.k === 'call') {
159
+ f.call.args.forEach(a => read(a, local));
160
+ calls(f.call, local);
161
+ }
162
+ else if (f.k === 'emit')
163
+ read(f.value, local);
164
+ break;
165
+ }
166
+ case 'if':
167
+ read(st.cond, local);
168
+ statements(st.then, local);
169
+ if (st.else)
170
+ statements(st.else, local);
171
+ break;
172
+ case 'while':
173
+ read(st.cond, local);
174
+ statements(st.body, local);
175
+ break;
176
+ case 'for':
177
+ statements(st.init, local);
178
+ read(st.cond, local);
179
+ statements(st.update, local);
180
+ statements(st.body, local);
181
+ break;
182
+ case 'return':
183
+ read(st.expr, local);
184
+ break;
185
+ case 'expr':
186
+ read(st.e, local);
187
+ break;
188
+ default: break;
189
+ }
190
+ }
191
+ };
192
+ function method(m, outer) {
193
+ if (visiting.has(m))
194
+ return;
195
+ visiting.add(m);
196
+ statements(m.body, new Set([...outer, ...m.params, ...m.locals]));
197
+ visiting.delete(m);
198
+ }
199
+ const roots = [];
200
+ const collect = (e) => walkExpr(e, x => { if (x.k === 'call' && !x.extern && x.target?.v.method && !isInlined(x.target.v.method))
201
+ roots.push(x); });
202
+ if (node.kind === 'cond')
203
+ collect(node.expr);
204
+ else if (node.kind === 'assign' && node.effect) {
205
+ const f = node.effect;
206
+ if (f.k === 'call')
207
+ collect(f.call);
208
+ else if (f.k === 'assign') {
209
+ f.ref.idx.forEach(collect);
210
+ collect(f.expr);
211
+ }
212
+ else if (f.k === 'emit')
213
+ collect(f.value);
214
+ else if (f.k === 'print')
215
+ f.args.forEach(collect);
216
+ }
217
+ for (const c of roots) {
218
+ via = c.target.v.name;
219
+ method(c.target.v.method, new Set());
220
+ }
221
+ return out;
222
+ }
223
+ /** The user schedules of a node's effect (dataflow sequences, passes/userSchedule.ts). */
224
+ function schedulesOf(n) {
225
+ return n.kind === 'assign' ? n.effect?.o.schedule ?? [] : [];
226
+ }
227
+ /**
228
+ * KIELER's scheduled dependencies: for every schedule object, its accesses of a variable in priority order; an
229
+ * access comes before every access of a higher priority (a write-read dependency, read or write alike), and two
230
+ * writes of the same priority conflict. Returns, per variable, the node pairs handled here (both directions).
231
+ */
232
+ function scheduledDependencies(byVar, deps, seen) {
233
+ const out = new Map();
234
+ for (const [v, list] of byVar) {
235
+ const groups = new Map();
236
+ for (const a of list) {
237
+ for (const s of schedulesOf(a.node)) {
238
+ let g = groups.get(s.group);
239
+ if (!g)
240
+ groups.set(s.group, (g = []));
241
+ g.push({ a, priority: s.priority });
242
+ }
243
+ }
244
+ for (const [group, g] of groups) {
245
+ const protocols = group.protocols;
246
+ for (const x of g) {
247
+ for (const y of g) {
248
+ if (x.a.node === y.a.node || x.priority > y.priority)
249
+ continue;
250
+ if (x.a.cell !== undefined && y.a.cell !== undefined && x.a.cell !== y.a.cell)
251
+ continue;
252
+ let pairs = out.get(v);
253
+ if (!pairs)
254
+ out.set(v, (pairs = new Set()));
255
+ pairs.add(`${x.a.node.id}>${y.a.node.id}`);
256
+ pairs.add(`${y.a.node.id}>${x.a.node.id}`);
257
+ const xw = x.a.cls !== 'read';
258
+ const yw = y.a.cls !== 'read';
259
+ // Accesses of a confluent priority do not depend on each other (KIELER's PriorityProtocol.CONFLUENT).
260
+ if (x.priority === y.priority && protocols?.[x.priority] === 'confluent')
261
+ continue;
262
+ if (x.priority === y.priority && xw && !yw)
263
+ continue;
264
+ if (!concurrentThreads(x.a.node.thread, y.a.node.thread))
265
+ continue;
266
+ const kind = x.priority === y.priority && xw && yw ? 'write-write' : 'write-read';
267
+ const key = `${x.a.node.id}>${y.a.node.id}:${v.uid}:${kind}`;
268
+ if (seen.has(key))
269
+ continue;
270
+ seen.add(key);
271
+ deps.push({ from: x.a.node, to: y.a.node, v, kind, confluent: kind === 'write-write' && confluent(x.a, y.a), a: x.a, b: y.a });
272
+ }
273
+ }
274
+ }
275
+ }
276
+ return out;
277
+ }
278
+ /**
279
+ * Two threads are concurrent if, below their innermost common thread, they are in different threads of one fork, and
280
+ * that fork is not the sequential preemptive fork of a state with abort regions (DependencyTransformationV2
281
+ * .isConcurrentTo: "sequentially ordered by fork", abortRegions.ts).
282
+ */
283
+ export function concurrentThreads(a, b) {
284
+ if (a === b)
285
+ return false;
286
+ let x = a;
287
+ let y = b;
288
+ while (x.depth > y.depth)
289
+ x = x.parent;
290
+ while (y.depth > x.depth)
291
+ y = y.parent;
292
+ if (x === y)
293
+ return false; // one is inside the other: sequential
294
+ while (x.parent !== y.parent) {
295
+ x = x.parent;
296
+ y = y.parent;
297
+ }
298
+ return x.fork === y.fork && !x.fork?.preemptive;
299
+ }
300
+ /** KIELER's isConfluentTo for two absolute writes. */
301
+ function confluent(a, b) {
302
+ if (a.node.kind !== 'assign' || b.node.kind !== 'assign')
303
+ return false;
304
+ if (a.op === '=' && b.op === '=') {
305
+ if (!a.expr || !b.expr)
306
+ return false;
307
+ return sameExpr(a.expr, b.expr);
308
+ }
309
+ return a.op !== undefined && a.op === b.op;
310
+ }
311
+ /**
312
+ * KIELER's search for accesses (DependencyTransformationV2.searchDependencies), where it ends early. It walks the graph
313
+ * depth first from the root's entry with a stack (a fork pushes its join, then its threads; a conditional its else,
314
+ * then its then branch) while `!nodes.empty && nodes.peek !== null`. A state without nodes (a referenced chart's state
315
+ * whose first immediate transition goes back to it without trigger, scg.ts simpleState) leaves the flows into it
316
+ * without target (SCGTransformation.transformSCGConnectNodes):
317
+ *
318
+ * - a thread entry still gets a flow, with no target node: null goes on the stack and the search ends there. The
319
+ * nodes still on the stack and those behind them get no accesses, so no data dependencies (`stop`);
320
+ * - an assignment gets no flow, and the search skips it;
321
+ * - a conditional, a depth or a join gets no flow either, and the search throws a NullPointerException (`crash`).
322
+ *
323
+ * Returns undefined if the search goes through the whole graph.
324
+ */
325
+ export function dependencyReach(scg) {
326
+ const visited = new Set();
327
+ const stack = [];
328
+ const reached = new Set();
329
+ let stop;
330
+ let into;
331
+ /** The node a flow leads to in KIELER's graph (marks without KIELER effects are no nodes there). */
332
+ const target = (n) => {
333
+ let state;
334
+ const seen = new Set();
335
+ while (n && noKielerNode(n) && !seen.has(n)) {
336
+ seen.add(n);
337
+ state = n.transition?.target ?? state;
338
+ n = n.next;
339
+ }
340
+ return { node: n, state };
341
+ };
342
+ const push = (n) => {
343
+ if (visited.has(n))
344
+ return;
345
+ visited.add(n);
346
+ stack.push(n);
347
+ };
348
+ /** Follows a flow; false if KIELER throws on it. */
349
+ const follow = (from, to, missing) => {
350
+ const t = target(to);
351
+ if (t.node) {
352
+ push(t.node);
353
+ return true;
354
+ }
355
+ into = t.state ?? from.transition?.target ?? (from.kind === 'entry' ? from.thread.region?.states.find(s => s.initial) : from.state?.out[0]?.target);
356
+ if (missing === 'skip')
357
+ return true;
358
+ if (missing === 'crash')
359
+ return false;
360
+ if (!visited.has(null)) {
361
+ visited.add(null);
362
+ stack.push(null);
363
+ stop = from;
364
+ }
365
+ return true;
366
+ };
367
+ let crash;
368
+ follow(scg.root.entry, scg.root.entry.next, 'stop');
369
+ while (stack.length > 0 && stack[stack.length - 1] !== null) {
370
+ const n = stack.pop();
371
+ reached.add(n);
372
+ let ok = true;
373
+ switch (n.kind) {
374
+ case 'assign':
375
+ ok = follow(n, n.next, 'skip');
376
+ break;
377
+ case 'entry':
378
+ ok = follow(n, n.next, 'stop');
379
+ break;
380
+ case 'depth':
381
+ case 'join':
382
+ ok = follow(n, n.next, 'crash');
383
+ break;
384
+ case 'cond':
385
+ // KIELER's equal-branch defect: its else flow also goes to the then branch's node.
386
+ ok = follow(n, n.sameElse ? n.sameTarget ?? n.then : n.else, 'crash') && follow(n, n.then, 'crash');
387
+ break;
388
+ case 'fork':
389
+ if (n.join)
390
+ push(n.join);
391
+ for (const t of n.threads ?? [])
392
+ push(t.entry);
393
+ break;
394
+ case 'surface':
395
+ if (n.depth)
396
+ push(n.depth);
397
+ break;
398
+ default:
399
+ break;
400
+ }
401
+ if (!ok) {
402
+ crash = n;
403
+ break;
404
+ }
405
+ }
406
+ // The state without node itself: below single-region superstates (whose fork KIELER removed) if need be.
407
+ for (let i = 0; into && i < 100; i++) {
408
+ const regions = controlflowRegions(into);
409
+ const initial = regions.length === 1 ? regions[0].states.find(x => x.initial) : undefined;
410
+ if (!initial)
411
+ break;
412
+ into = initial;
413
+ }
414
+ if (crash)
415
+ return { reached, crash, into };
416
+ return stop && stack.length > 0 ? { reached, stop, into } : undefined;
417
+ }
418
+ /**
419
+ * The concurrent dependencies among the given nodes (only those matter for scheduling; dependencies within one
420
+ * thread are ordered by its control flow). `reached`: only these nodes' accesses count (dependencyReach).
421
+ */
422
+ export function dependencies(nodes, reached, isInlined = () => true) {
423
+ const accesses = new Map();
424
+ const byVar = new Map();
425
+ for (const n of nodes) {
426
+ const list = [...nodeAccesses(n), ...innerAccesses(n, isInlined)];
427
+ accesses.set(n, list);
428
+ if (reached && !reached.has(n))
429
+ continue;
430
+ for (const a of list) {
431
+ let l = byVar.get(a.v);
432
+ if (!l)
433
+ byVar.set(a.v, (l = []));
434
+ l.push(a);
435
+ }
436
+ }
437
+ const deps = [];
438
+ const seen = new Set();
439
+ // User schedules first (AbstractDependencyAnalysis.processDependencies): the accesses of one schedule object are
440
+ // ordered by priority, whatever they are; those node pairs are left out of initialise-update-read below.
441
+ const scheduled = scheduledDependencies(byVar, deps, seen);
442
+ for (const [v, list] of byVar) {
443
+ if (list.length < 2)
444
+ continue;
445
+ const exclude = scheduled.get(v);
446
+ for (const a of list) {
447
+ for (const b of list) {
448
+ if (a === b || a.node === b.node)
449
+ continue;
450
+ if (exclude?.has(`${a.node.id}>${b.node.id}`))
451
+ continue;
452
+ if (PRIORITY[a.cls] > PRIORITY[b.cls])
453
+ continue;
454
+ // Different constant cells of an array do not interact (C-8).
455
+ if (a.cell !== undefined && b.cell !== undefined && a.cell !== b.cell)
456
+ continue;
457
+ let kind;
458
+ if (a.cls === 'write')
459
+ kind = b.cls === 'write' ? 'write-write' : b.cls === 'relative' ? 'write-relative' : 'write-read';
460
+ else if (a.cls === 'relative') {
461
+ if (b.cls === 'read')
462
+ kind = 'relative-read';
463
+ else if (b.cls === 'relative' && !a.anyOp && !b.anyOp && !commuting(a.op, b.op))
464
+ kind = 'write-write';
465
+ }
466
+ if (!kind)
467
+ continue;
468
+ if (!concurrentThreads(a.node.thread, b.node.thread))
469
+ continue;
470
+ const isConfluent = kind === 'write-write' && confluent(a, b);
471
+ const key = `${a.node.id}>${b.node.id}:${v.uid}:${kind}`;
472
+ if (seen.has(key))
473
+ continue;
474
+ seen.add(key);
475
+ deps.push({ from: a.node, to: b.node, v, kind, confluent: isConfluent, a, b });
476
+ }
477
+ }
478
+ }
479
+ return { deps, accesses };
480
+ }
481
+ //# sourceMappingURL=deps.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"deps.js","sourceRoot":"","sources":["../../src/sim/deps.ts"],"names":[],"mappings":"AAAA,gGAAgG;AAChG,qHAAqH;AACrH,4BAA4B;AAC5B,EAAE;AACF,uGAAuG;AACvG,2GAA2G;AAC3G,+FAA+F;AAC/F,wGAAwG;AACxG,2GAA2G;AAC3G,0CAA0C;AAG1C,OAAO,EAAE,kBAAkB,EAAE,QAAQ,EAAE,QAAQ,EAA2E,mBAAe;AACzI,OAAO,EAAE,YAAY,EAAqC,iBAAa;AAgCvE,MAAM,QAAQ,GAAgC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAA;AAChF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;AAEpD,SAAS,SAAS,CAAC,CAAqB,EAAE,CAAqB;IAC3D,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;AAC1E,CAAC;AAED,uGAAuG;AACvG,SAAS,OAAO,CAAC,CAAO;IACpB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,SAAS,CAAA;IACnC,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;aACxD,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;;YACtE,OAAO,SAAS,CAAA;IACzB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC1B,CAAC;AAED,SAAS,SAAS,CAAC,CAAO;IACtB,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,CAAC,GAAG;QAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAA;IACvB,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,wFAAwF;AACxF,SAAS,KAAK,CAAC,IAAW,EAAE,CAAoB,EAAE,GAAa;IAC3D,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;QACZ,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IAC9F,CAAC,CAAC,CAAA;AACN,CAAC;AAED,oCAAoC;AACpC,MAAM,UAAU,YAAY,CAAC,IAAW;IACpC,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC3B,OAAO,GAAG,CAAA;IACd,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,GAAG,CAAA;IACtD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,MAAM,GAAG,GAAa,EAAE,CAAA;YACxB,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAA;YACpB,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;YAC7B,oDAAoD;YACpD,IAAI,MAAM,CAAC,GAAG;gBAAE,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;YACxE,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;YACxE,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;YAC5C,kGAAkG;YAClG,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAClD,8BAA8B;YAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG;gBAAE,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;YAC5C,IAAI,GAAG,GAAgB,OAAO,CAAA;YAC9B,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;gBAAE,GAAG,GAAG,UAAU,CAAA;YACpE,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,QAAQ,KAAK,CAAC;gBAAE,GAAG,GAAG,UAAU,CAAA;YACpD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;YAC7F,OAAO,GAAG,CAAA;QACd,CAAC;QACD,KAAK,OAAO;YACR,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;YAC3C,OAAO,GAAG,CAAA;QACd,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YACnB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAA;gBAClC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAChC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;wBACZ,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;4BAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;oBAC5H,CAAC,CAAC,CAAA;gBACN,CAAC;qBAAM,CAAC;oBACJ,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;gBACvB,CAAC;YACL,CAAC,CAAC,CAAA;YACF,OAAO,GAAG,CAAA;QACd,CAAC;QACD,KAAK,MAAM;YACP,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YACzB,OAAO,GAAG,CAAA;QACd;YACI,OAAO,GAAG,CAAA;IAClB,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,IAAW,EAAE,SAAkC;IACzE,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,MAAM,EAAE,GAA6C,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;IACtK,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAW,CAAA;IACnC,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA;IACpD,MAAM,KAAK,GAAG,CAAC,CAAoB,EAAE,KAAgB,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM;QAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;IACvK,MAAM,IAAI,GAAG,CAAC,CAAoB,EAAE,KAAgB,EAAE,EAAE;QACpD,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;QAC7I,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACnB,CAAC,CAAA;IACD,MAAM,UAAU,GAAG,CAAC,IAAa,EAAE,KAAgB,EAAE,EAAE;QACnD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACpB,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;gBACX,KAAK,IAAI,CAAC,CAAC,CAAC;oBACR,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;oBACd,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;wBACnB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;wBAC5B,MAAM,GAAG,GAAa,EAAE,CAAA;wBACxB,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;4BAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;wBACrH,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;wBACxE,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;wBAC5C,KAAK,MAAM,CAAC,IAAI,GAAG;4BAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gCAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,CAAC,CAAA;wBACtF,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;wBACpB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG;4BAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;wBACvC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;4BAAE,MAAK;wBAC3B,IAAI,GAAG,GAAgB,OAAO,CAAA;wBAC9B,IAAI,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;4BAAE,GAAG,GAAG,UAAU,CAAA;wBACpD,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,QAAQ,KAAK,CAAC;4BAAE,GAAG,GAAG,UAAU,CAAA;wBACpD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,CAAC,CAAA;oBACvF,CAAC;yBAAM,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO;wBAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;yBAC1D,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;wBAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;wBAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;oBAAC,CAAC;yBACtF,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;wBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;oBAC7C,MAAK;gBACT,CAAC;gBACD,KAAK,IAAI;oBAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,IAAI,EAAE,CAAC,IAAI;wBAAE,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,MAAK;gBAC3G,KAAK,OAAO;oBAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,MAAK;gBACrE,KAAK,KAAK;oBAAE,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,MAAK;gBAC7H,KAAK,QAAQ;oBAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,MAAK;gBAC1C,KAAK,MAAM;oBAAE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBAAC,MAAK;gBACrC,OAAO,CAAC,CAAC,MAAK;YAClB,CAAC;QACL,CAAC;IACL,CAAC,CAAA;IACD,SAAS,MAAM,CAAC,CAAU,EAAE,KAAgB;QACxC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAM;QAC3B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACf,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACjE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACtB,CAAC;IACD,MAAM,KAAK,GAAoC,EAAE,CAAA;IACjD,MAAM,OAAO,GAAG,CAAC,CAAoB,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;IACrK,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;SACvC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QACrB,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;YAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;aAC9B,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;YAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAAC,CAAC;aACrE,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;YAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;aACpC,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IACrD,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,GAAG,GAAG,CAAC,CAAC,MAAO,CAAC,CAAC,CAAC,IAAI,CAAA;QACtB,MAAM,CAAC,CAAC,CAAC,MAAO,CAAC,CAAC,CAAC,MAAO,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IAC1C,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,0FAA0F;AAC1F,SAAS,WAAW,CAAC,CAAQ;IACzB,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;AAChE,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,KAA0B,EAAE,IAAkB,EAAE,IAAiB;IAC5F,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAA;IACxC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6C,CAAA;QACnE,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;gBAC3B,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;gBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAA;YACvC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAI,KAAkC,CAAC,SAAS,CAAA;YAC/D,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChB,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChB,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;wBAAE,SAAQ;oBAC9D,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI;wBAAE,SAAQ;oBACvF,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBACtB,IAAI,CAAC,KAAK;wBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;oBAC3C,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;oBAC1C,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;oBAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,CAAA;oBAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,CAAA;oBAC7B,sGAAsG;oBACtG,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,WAAW;wBAAE,SAAQ;oBAClF,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,EAAE,IAAI,CAAC,EAAE;wBAAE,SAAQ;oBACpD,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;wBAAE,SAAQ;oBAClE,MAAM,IAAI,GAAuB,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,CAAA;oBACrG,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,EAAE,CAAA;oBAC5D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;wBAAE,SAAQ;oBAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBACb,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,KAAK,aAAa,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gBAClI,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAClD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACzB,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;QAAE,CAAC,GAAG,CAAC,CAAC,MAAO,CAAA;IACvC,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;QAAE,CAAC,GAAG,CAAC,CAAC,MAAO,CAAA;IACvC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA,CAAC,sCAAsC;IAChE,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3B,CAAC,GAAG,CAAC,CAAC,MAAO,CAAA;QACb,CAAC,GAAG,CAAC,CAAC,MAAO,CAAA;IACjB,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,CAAA;AACnD,CAAC;AAED,sDAAsD;AACtD,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACnC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAA;IACtE,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,KAAK,CAAA;QACpC,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,eAAe,CAAC,GAAQ;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAA;IACvC,MAAM,KAAK,GAAqB,EAAE,CAAA;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAS,CAAA;IAChC,IAAI,IAAuB,CAAA;IAC3B,IAAI,IAAwB,CAAA;IAC5B,oGAAoG;IACpG,MAAM,MAAM,GAAG,CAAC,CAAoB,EAAoC,EAAE;QACtE,IAAI,KAAyB,CAAA;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;QAC7B,OAAO,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACX,KAAK,GAAG,CAAC,CAAC,UAAU,EAAE,MAAM,IAAI,KAAK,CAAA;YACrC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;QACd,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAA;IAC7B,CAAC,CAAA;IACD,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;QACtB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAM;QAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACjB,CAAC,CAAA;IACD,oDAAoD;IACpD,MAAM,MAAM,GAAG,CAAC,IAAW,EAAE,EAAqB,EAAE,OAAkC,EAAW,EAAE;QAC/F,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAA;QACpB,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACZ,OAAO,IAAI,CAAA;QACf,CAAC;QACD,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QACnJ,IAAI,OAAO,KAAK,MAAM;YAAE,OAAO,IAAI,CAAA;QACnC,IAAI,OAAO,KAAK,OAAO;YAAE,OAAO,KAAK,CAAA;QACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAChB,IAAI,GAAG,IAAI,CAAA;QACf,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC,CAAA;IACD,IAAI,KAAwB,CAAA;IAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACnD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACd,IAAI,EAAE,GAAG,IAAI,CAAA;QACb,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACb,KAAK,QAAQ;gBACT,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;gBAC9B,MAAK;YACT,KAAK,OAAO;gBACR,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;gBAC9B,MAAK;YACT,KAAK,OAAO,CAAC;YAAC,KAAK,MAAM;gBACrB,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;gBAC/B,MAAK;YACT,KAAK,MAAM;gBACP,mFAAmF;gBACnF,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;gBACnG,MAAK;YACT,KAAK,MAAM;gBACP,IAAI,CAAC,CAAC,IAAI;oBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBACxB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE;oBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;gBAC9C,MAAK;YACT,KAAK,SAAS;gBACV,IAAI,CAAC,CAAC,KAAK;oBAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;gBAC1B,MAAK;YACT;gBACI,MAAK;QACb,CAAC;QACD,IAAI,CAAC,EAAE,EAAE,CAAC;YACN,KAAK,GAAG,CAAC,CAAA;YACT,MAAK;QACT,CAAC;IACL,CAAC;IACD,yGAAyG;IACzG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QACzF,IAAI,CAAC,OAAO;YAAE,MAAK;QACnB,IAAI,GAAG,OAAO,CAAA;IAClB,CAAC;IACD,IAAI,KAAK;QAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;IAC1C,OAAO,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;AACzE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAc,EAAE,OAAoB,EAAE,YAAqC,GAAG,EAAE,CAAC,IAAI;IAC9G,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAA;QACjE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACrB,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACtB,IAAI,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YAChC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,CAAC;IACL,CAAC;IACD,MAAM,IAAI,GAAiB,EAAE,CAAA;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,iHAAiH;IACjH,yGAAyG;IACzG,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;IAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAC7B,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;oBAAE,SAAQ;gBAC1C,IAAI,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;oBAAE,SAAQ;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBAC/C,8DAA8D;gBAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;oBAAE,SAAQ;gBAC/E,IAAI,IAAoC,CAAA;gBACxC,IAAI,CAAC,CAAC,GAAG,KAAK,OAAO;oBAAE,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,YAAY,CAAA;qBACnH,IAAI,CAAC,CAAC,GAAG,KAAK,UAAU,EAAE,CAAC;oBAC5B,IAAI,CAAC,CAAC,GAAG,KAAK,MAAM;wBAAE,IAAI,GAAG,eAAe,CAAA;yBACvC,IAAI,CAAC,CAAC,GAAG,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;wBAAE,IAAI,GAAG,aAAa,CAAA;gBACzG,CAAC;gBACD,IAAI,CAAC,IAAI;oBAAE,SAAQ;gBACnB,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAAE,SAAQ;gBAC9D,MAAM,WAAW,GAAG,IAAI,KAAK,aAAa,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC7D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,EAAE,CAAA;gBACxD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;YAClF,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC7B,CAAC","sourcesContent":["// Data dependencies between concurrent SCG nodes, as KIELER's dependency analysis computes them\n// (kicool/processors/dependencies/AbstractDependencyAnalysis.xtend, scg/processors/DependencyTransformationV2.xtend;\n// concurrency.md 1.3, 1.4):\n//\n// - every assignment is an absolute write, a relative write (x op= e not reading x, x++, and old-style\n// x = ... x ... reading x exactly once) or, for its operands, a read; conditionals read their condition;\n// - array accesses with constant indices are accesses to that cell, others to the whole array;\n// - between concurrent accesses: absolute write -> relative write -> read; two absolute writes conflict\n// (edges both ways) unless confluent (same value or structurally equal expression); relative writes with\n// non-commuting operators conflict too.\n\nimport type { AssignOperator, Span } from '../types'\nimport { controlflowRegions, sameExpr, walkExpr, type CExpr, type CMethod, type CRef, type CState, type CStmt, type CVar } from './model'\nimport { noKielerNode, type SCG, type SNode, type Thread } from './scg'\n\nexport type AccessClass = 'write' | 'relative' | 'read'\n\nexport interface Access {\n node: SNode\n v: CVar\n /** Inside a method that is called at a conditional (not an assignment): KIELER's check for non-commuting update\n * operators does not apply (AbstractDependencyAnalysis.processDependency only compares assignments). */\n anyOp?: boolean\n /** The access is inside this method, which KIELER does not inline (innerAccesses); `_effect<n>` is a code block. */\n via?: string\n /** Constant indices of a cell access, or undefined for the whole variable / a variable index. */\n cell?: string\n cls: AccessClass\n /** The assignment operator (for writes). */\n op?: AssignOperator | '++' | '--'\n expr?: CExpr\n span?: Span\n}\n\nexport interface Dependency {\n from: SNode\n to: SNode\n v: CVar\n kind: 'write-write' | 'write-relative' | 'write-read' | 'relative-read'\n confluent: boolean\n /** The accesses that cause it. */\n a: Access\n b: Access\n}\n\nconst PRIORITY: Record<AccessClass, number> = { write: 0, relative: 1, read: 2 }\nconst PLUS_MINUS = new Set(['++', '--', '+=', '-='])\n\nfunction commuting(a: string | undefined, b: string | undefined): boolean {\n return a === b || (PLUS_MINUS.has(a ?? '') && PLUS_MINUS.has(b ?? ''))\n}\n\n/** Constant-index key of a reference (`a[1][2]` -> \"1,2\"), undefined if any index is not a literal. */\nfunction cellKey(r: CRef): string | undefined {\n if (!r.idx.length) return undefined\n const parts: number[] = []\n for (const i of r.idx) {\n if (i.k === 'lit' && typeof i.v === 'number') parts.push(i.v)\n else if (i.k === 'lit' && typeof i.v === 'boolean') parts.push(i.v ? 1 : 0)\n else return undefined\n }\n return parts.join(',')\n}\n\nfunction lowermost(r: CRef): CRef {\n let x = r\n while (x.sub) x = x.sub\n return x\n}\n\n/** The reads of an expression: every variable reference, including those in indices. */\nfunction reads(node: SNode, e: CExpr | undefined, out: Access[]) {\n walkExpr(e, x => {\n if (x.k === 'ref') out.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span })\n })\n}\n\n/** The accesses of one SCG node. */\nexport function nodeAccesses(node: SNode): Access[] {\n const out: Access[] = []\n if (node.kind === 'cond') {\n reads(node, node.expr, out)\n return out\n }\n if (node.kind !== 'assign' || !node.effect) return out\n const f = node.effect\n switch (f.k) {\n case 'assign': {\n const rhs: Access[] = []\n reads(node, f.expr, rhs)\n const target = f.ref\n const low = lowermost(target)\n // A sub reference reads its parent (member access).\n if (target.sub) reads(node, { ...target, sub: undefined, idx: [] }, out)\n const isTarget = (a: Access) => a.v === low.v && a.cell === cellKey(low)\n const ownReads = rhs.filter(isTarget).length\n // The assignment's own reads of its target are dropped once the write is recorded (deps:200-205).\n for (const a of rhs) if (!isTarget(a)) out.push(a)\n // Index expressions are read.\n for (const i of low.idx) reads(node, i, out)\n let cls: AccessClass = 'write'\n if (ownReads > 0 && ownReads === 1 && f.op === '=') cls = 'relative'\n if (f.op !== '=' && ownReads === 0) cls = 'relative'\n out.push({ node, v: low.v, cell: cellKey(low), cls, op: f.op, expr: f.expr, span: f.o.span })\n return out\n }\n case 'print':\n for (const a of f.args) reads(node, a, out)\n return out\n case 'call': {\n const call = f.call\n call.args.forEach((a, i) => {\n const mode = call.paramAccess?.[i]\n if (mode === '!&' || mode === '&') {\n walkExpr(a, x => {\n if (x.k === 'ref') out.push({ node, v: x.v, cell: cellKey(x), cls: mode === '!&' ? 'write' : 'relative', span: x.span })\n })\n } else {\n reads(node, a, out)\n }\n })\n return out\n }\n case 'emit':\n reads(node, f.value, out)\n return out\n default:\n return out\n }\n}\n\n/**\n * The accesses inside the methods a node calls that KIELER does not inline (DependencyTransformationV2\n * .processInnerAccesses): the reads and writes of the method's body, its locals and parameters left out, count as the\n * calling node's, and the calling node's operator decides whether two updates commute (a call effect is an\n * assignment with `=`, so its `x += 1` conflicts with a concurrent `x += 1`; probe structure/probe-method-inner-*).\n */\nexport function innerAccesses(node: SNode, isInlined: (m: CMethod) => boolean): Access[] {\n const out: Access[] = []\n const op: AssignOperator | '++' | '--' | undefined = node.kind === 'assign' && node.effect?.k === 'assign' ? node.effect.op : node.kind === 'assign' ? '=' : undefined\n const anyOp = node.kind !== 'assign'\n const visiting = new Set<CMethod>()\n let via = ''\n const tag = () => (anyOp ? { anyOp, via } : { via })\n const calls = (e: CExpr | undefined, local: Set<CVar>) => walkExpr(e, x => { if (x.k === 'call' && !x.extern && x.target?.v.method) method(x.target.v.method, local) })\n const read = (e: CExpr | undefined, local: Set<CVar>) => {\n walkExpr(e, x => { if (x.k === 'ref' && !local.has(x.v)) out.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span, ...tag() }) })\n calls(e, local)\n }\n const statements = (list: CStmt[], local: Set<CVar>) => {\n for (const st of list) {\n switch (st.k) {\n case 'do': {\n const f = st.f\n if (f.k === 'assign') {\n const low = lowermost(f.ref)\n const rhs: Access[] = []\n walkExpr(f.expr, x => { if (x.k === 'ref') rhs.push({ node, v: x.v, cell: cellKey(x), cls: 'read', span: x.span }) })\n const isTarget = (a: Access) => a.v === low.v && a.cell === cellKey(low)\n const ownReads = rhs.filter(isTarget).length\n for (const a of rhs) if (!isTarget(a) && !local.has(a.v)) out.push({ ...a, ...tag() })\n calls(f.expr, local)\n for (const i of low.idx) read(i, local)\n if (local.has(low.v)) break\n let cls: AccessClass = 'write'\n if (ownReads === 1 && f.op === '=') cls = 'relative'\n if (f.op !== '=' && ownReads === 0) cls = 'relative'\n out.push({ node, v: low.v, cell: cellKey(low), cls, op, span: f.o.span, ...tag() })\n } else if (f.k === 'print') f.args.forEach(a => read(a, local))\n else if (f.k === 'call') { f.call.args.forEach(a => read(a, local)); calls(f.call, local) }\n else if (f.k === 'emit') read(f.value, local)\n break\n }\n case 'if': read(st.cond, local); statements(st.then, local); if (st.else) statements(st.else, local); break\n case 'while': read(st.cond, local); statements(st.body, local); break\n case 'for': statements(st.init, local); read(st.cond, local); statements(st.update, local); statements(st.body, local); break\n case 'return': read(st.expr, local); break\n case 'expr': read(st.e, local); break\n default: break\n }\n }\n }\n function method(m: CMethod, outer: Set<CVar>) {\n if (visiting.has(m)) return\n visiting.add(m)\n statements(m.body, new Set([...outer, ...m.params, ...m.locals]))\n visiting.delete(m)\n }\n const roots: Extract<CExpr, { k: 'call' }>[] = []\n const collect = (e: CExpr | undefined) => walkExpr(e, x => { if (x.k === 'call' && !x.extern && x.target?.v.method && !isInlined(x.target.v.method)) roots.push(x) })\n if (node.kind === 'cond') collect(node.expr)\n else if (node.kind === 'assign' && node.effect) {\n const f = node.effect\n if (f.k === 'call') collect(f.call)\n else if (f.k === 'assign') { f.ref.idx.forEach(collect); collect(f.expr) }\n else if (f.k === 'emit') collect(f.value)\n else if (f.k === 'print') f.args.forEach(collect)\n }\n for (const c of roots) {\n via = c.target!.v.name\n method(c.target!.v.method!, new Set())\n }\n return out\n}\n\n/** The user schedules of a node's effect (dataflow sequences, passes/userSchedule.ts). */\nfunction schedulesOf(n: SNode): { group: object; priority: number }[] {\n return n.kind === 'assign' ? n.effect?.o.schedule ?? [] : []\n}\n\n/**\n * KIELER's scheduled dependencies: for every schedule object, its accesses of a variable in priority order; an\n * access comes before every access of a higher priority (a write-read dependency, read or write alike), and two\n * writes of the same priority conflict. Returns, per variable, the node pairs handled here (both directions).\n */\nfunction scheduledDependencies(byVar: Map<CVar, Access[]>, deps: Dependency[], seen: Set<string>): Map<CVar, Set<string>> {\n const out = new Map<CVar, Set<string>>()\n for (const [v, list] of byVar) {\n const groups = new Map<object, { a: Access; priority: number }[]>()\n for (const a of list) {\n for (const s of schedulesOf(a.node)) {\n let g = groups.get(s.group)\n if (!g) groups.set(s.group, (g = []))\n g.push({ a, priority: s.priority })\n }\n }\n for (const [group, g] of groups) {\n const protocols = (group as { protocols?: string[] }).protocols\n for (const x of g) {\n for (const y of g) {\n if (x.a.node === y.a.node || x.priority > y.priority) continue\n if (x.a.cell !== undefined && y.a.cell !== undefined && x.a.cell !== y.a.cell) continue\n let pairs = out.get(v)\n if (!pairs) out.set(v, (pairs = new Set()))\n pairs.add(`${x.a.node.id}>${y.a.node.id}`)\n pairs.add(`${y.a.node.id}>${x.a.node.id}`)\n const xw = x.a.cls !== 'read'\n const yw = y.a.cls !== 'read'\n // Accesses of a confluent priority do not depend on each other (KIELER's PriorityProtocol.CONFLUENT).\n if (x.priority === y.priority && protocols?.[x.priority] === 'confluent') continue\n if (x.priority === y.priority && xw && !yw) continue\n if (!concurrentThreads(x.a.node.thread, y.a.node.thread)) continue\n const kind: Dependency['kind'] = x.priority === y.priority && xw && yw ? 'write-write' : 'write-read'\n const key = `${x.a.node.id}>${y.a.node.id}:${v.uid}:${kind}`\n if (seen.has(key)) continue\n seen.add(key)\n deps.push({ from: x.a.node, to: y.a.node, v, kind, confluent: kind === 'write-write' && confluent(x.a, y.a), a: x.a, b: y.a })\n }\n }\n }\n }\n return out\n}\n\n/**\n * Two threads are concurrent if, below their innermost common thread, they are in different threads of one fork, and\n * that fork is not the sequential preemptive fork of a state with abort regions (DependencyTransformationV2\n * .isConcurrentTo: \"sequentially ordered by fork\", abortRegions.ts).\n */\nexport function concurrentThreads(a: Thread, b: Thread): boolean {\n if (a === b) return false\n let x = a\n let y = b\n while (x.depth > y.depth) x = x.parent!\n while (y.depth > x.depth) y = y.parent!\n if (x === y) return false // one is inside the other: sequential\n while (x.parent !== y.parent) {\n x = x.parent!\n y = y.parent!\n }\n return x.fork === y.fork && !x.fork?.preemptive\n}\n\n/** KIELER's isConfluentTo for two absolute writes. */\nfunction confluent(a: Access, b: Access): boolean {\n if (a.node.kind !== 'assign' || b.node.kind !== 'assign') return false\n if (a.op === '=' && b.op === '=') {\n if (!a.expr || !b.expr) return false\n return sameExpr(a.expr, b.expr)\n }\n return a.op !== undefined && a.op === b.op\n}\n\n/**\n * KIELER's search for accesses (DependencyTransformationV2.searchDependencies), where it ends early. It walks the graph\n * depth first from the root's entry with a stack (a fork pushes its join, then its threads; a conditional its else,\n * then its then branch) while `!nodes.empty && nodes.peek !== null`. A state without nodes (a referenced chart's state\n * whose first immediate transition goes back to it without trigger, scg.ts simpleState) leaves the flows into it\n * without target (SCGTransformation.transformSCGConnectNodes):\n *\n * - a thread entry still gets a flow, with no target node: null goes on the stack and the search ends there. The\n * nodes still on the stack and those behind them get no accesses, so no data dependencies (`stop`);\n * - an assignment gets no flow, and the search skips it;\n * - a conditional, a depth or a join gets no flow either, and the search throws a NullPointerException (`crash`).\n *\n * Returns undefined if the search goes through the whole graph.\n */\nexport function dependencyReach(scg: SCG): { reached: Set<SNode>; stop?: SNode; crash?: SNode; into?: CState } | undefined {\n const visited = new Set<SNode | null>()\n const stack: (SNode | null)[] = []\n const reached = new Set<SNode>()\n let stop: SNode | undefined\n let into: CState | undefined\n /** The node a flow leads to in KIELER's graph (marks without KIELER effects are no nodes there). */\n const target = (n: SNode | undefined): { node?: SNode; state?: CState } => {\n let state: CState | undefined\n const seen = new Set<SNode>()\n while (n && noKielerNode(n) && !seen.has(n)) {\n seen.add(n)\n state = n.transition?.target ?? state\n n = n.next\n }\n return { node: n, state }\n }\n const push = (n: SNode) => {\n if (visited.has(n)) return\n visited.add(n)\n stack.push(n)\n }\n /** Follows a flow; false if KIELER throws on it. */\n const follow = (from: SNode, to: SNode | undefined, missing: 'stop' | 'skip' | 'crash'): boolean => {\n const t = target(to)\n if (t.node) {\n push(t.node)\n return true\n }\n into = t.state ?? from.transition?.target ?? (from.kind === 'entry' ? from.thread.region?.states.find(s => s.initial) : from.state?.out[0]?.target)\n if (missing === 'skip') return true\n if (missing === 'crash') return false\n if (!visited.has(null)) {\n visited.add(null)\n stack.push(null)\n stop = from\n }\n return true\n }\n let crash: SNode | undefined\n follow(scg.root.entry, scg.root.entry.next, 'stop')\n while (stack.length > 0 && stack[stack.length - 1] !== null) {\n const n = stack.pop()!\n reached.add(n)\n let ok = true\n switch (n.kind) {\n case 'assign':\n ok = follow(n, n.next, 'skip')\n break\n case 'entry':\n ok = follow(n, n.next, 'stop')\n break\n case 'depth': case 'join':\n ok = follow(n, n.next, 'crash')\n break\n case 'cond':\n // KIELER's equal-branch defect: its else flow also goes to the then branch's node.\n ok = follow(n, n.sameElse ? n.sameTarget ?? n.then : n.else, 'crash') && follow(n, n.then, 'crash')\n break\n case 'fork':\n if (n.join) push(n.join)\n for (const t of n.threads ?? []) push(t.entry)\n break\n case 'surface':\n if (n.depth) push(n.depth)\n break\n default:\n break\n }\n if (!ok) {\n crash = n\n break\n }\n }\n // The state without node itself: below single-region superstates (whose fork KIELER removed) if need be.\n for (let i = 0; into && i < 100; i++) {\n const regions = controlflowRegions(into)\n const initial = regions.length === 1 ? regions[0].states.find(x => x.initial) : undefined\n if (!initial) break\n into = initial\n }\n if (crash) return { reached, crash, into }\n return stop && stack.length > 0 ? { reached, stop, into } : undefined\n}\n\n/**\n * The concurrent dependencies among the given nodes (only those matter for scheduling; dependencies within one\n * thread are ordered by its control flow). `reached`: only these nodes' accesses count (dependencyReach).\n */\nexport function dependencies(nodes: SNode[], reached?: Set<SNode>, isInlined: (m: CMethod) => boolean = () => true): { deps: Dependency[]; accesses: Map<SNode, Access[]> } {\n const accesses = new Map<SNode, Access[]>()\n const byVar = new Map<CVar, Access[]>()\n for (const n of nodes) {\n const list = [...nodeAccesses(n), ...innerAccesses(n, isInlined)]\n accesses.set(n, list)\n if (reached && !reached.has(n)) continue\n for (const a of list) {\n let l = byVar.get(a.v)\n if (!l) byVar.set(a.v, (l = []))\n l.push(a)\n }\n }\n const deps: Dependency[] = []\n const seen = new Set<string>()\n // User schedules first (AbstractDependencyAnalysis.processDependencies): the accesses of one schedule object are\n // ordered by priority, whatever they are; those node pairs are left out of initialise-update-read below.\n const scheduled = scheduledDependencies(byVar, deps, seen)\n for (const [v, list] of byVar) {\n if (list.length < 2) continue\n const exclude = scheduled.get(v)\n for (const a of list) {\n for (const b of list) {\n if (a === b || a.node === b.node) continue\n if (exclude?.has(`${a.node.id}>${b.node.id}`)) continue\n if (PRIORITY[a.cls] > PRIORITY[b.cls]) continue\n // Different constant cells of an array do not interact (C-8).\n if (a.cell !== undefined && b.cell !== undefined && a.cell !== b.cell) continue\n let kind: Dependency['kind'] | undefined\n if (a.cls === 'write') kind = b.cls === 'write' ? 'write-write' : b.cls === 'relative' ? 'write-relative' : 'write-read'\n else if (a.cls === 'relative') {\n if (b.cls === 'read') kind = 'relative-read'\n else if (b.cls === 'relative' && !a.anyOp && !b.anyOp && !commuting(a.op, b.op)) kind = 'write-write'\n }\n if (!kind) continue\n if (!concurrentThreads(a.node.thread, b.node.thread)) continue\n const isConfluent = kind === 'write-write' && confluent(a, b)\n const key = `${a.node.id}>${b.node.id}:${v.uid}:${kind}`\n if (seen.has(key)) continue\n seen.add(key)\n deps.push({ from: a.node, to: b.node, v, kind, confluent: isConfluent, a, b })\n }\n }\n }\n return { deps, accesses }\n}\n"]}
@@ -0,0 +1,22 @@
1
+ import type { Program, TickResult } from "../types.js";
2
+ export interface DescribeOptions {
3
+ /** Inline Markdown: state, variable, signal and chart names, triggers and values in code spans. */
4
+ markdown?: boolean;
5
+ }
6
+ /** Records the imported programs of a compiled program, for the names of the elements of their charts' copies. */
7
+ export declare function rememberImports(program: Program, imported: Program[]): void;
8
+ /**
9
+ * A readable name for an element id of a tick's result or log (a state, transition, region or local action), also
10
+ * inside the copy of a referenced chart or of a for-region: `{ name: 'Off → On', within: 'inside Left (a copy of
11
+ * PushSwitch)' }`; with `markdown`, names in code spans. Undefined for an id it does not know.
12
+ */
13
+ export declare function elementName(id: string, program: Program, options?: DescribeOptions): {
14
+ name: string;
15
+ within?: string;
16
+ } | undefined;
17
+ /**
18
+ * Sentences describing a tick: what was entered, which transitions fired and why, which signals were emitted,
19
+ * which outputs changed, and whether the chart terminated or stopped with an error. Plain text, or inline Markdown
20
+ * with `markdown: true` (the same sentences, with names, triggers and values in code spans).
21
+ */
22
+ export declare function describeTick(result: TickResult, program: Program, previous?: TickResult, options?: DescribeOptions): string[];