@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,39 @@
1
+ import type { Diagnostic, Span } from "../../types.js";
2
+ import type { CState, CVar } from "../model.js";
3
+ export type Owner = 'core' | 'preemption' | 'structure';
4
+ /** A construct of the chart that a pass removes (used to report charts the simulator cannot run yet). */
5
+ export interface Construct {
6
+ what: string;
7
+ span?: Span;
8
+ related?: string[];
9
+ }
10
+ export interface PassContext {
11
+ /** The scchart being compiled (rewritten in place). */
12
+ readonly root: CState;
13
+ /** KIELER configuration that decides how some processors behave in the netlist simulation chain. */
14
+ readonly config: {
15
+ /** de.cau.cs.kieler.sccharts.finalRegion.supported (false in the netlist system). */
16
+ finalRegions: boolean;
17
+ /** Compile host code and extern calls on (for the C code generator, which carries them into the C code). */
18
+ hostCode?: boolean;
19
+ };
20
+ /** Source variables by ValuedObject id. */
21
+ readonly vars: Map<string, CVar>;
22
+ /** Reports a problem; errors make the chart rejected. */
23
+ report(d: Diagnostic): void;
24
+ /** Shared state between passes (for example Termination's annotations that Abort reads). */
25
+ readonly shared: Record<string, unknown>;
26
+ }
27
+ export interface Pass {
28
+ /** KIELER's processor id (de.cau.cs.kieler.sccharts.processors....). */
29
+ id: string;
30
+ name: string;
31
+ /** The workstream that implements it. */
32
+ owner: Owner;
33
+ /** KIELER runs some processors twice with different configurations (entry and exit actions). */
34
+ config?: Record<string, string>;
35
+ /** Constructs in the chart that need this pass. Only consulted while `run` is missing. */
36
+ uses?(root: CState): Construct[];
37
+ /** Rewrites the chart. Missing: the pass is not implemented yet, and charts that use it are rejected. */
38
+ run?(ctx: PassContext): void;
39
+ }
@@ -0,0 +1,3 @@
1
+ // What a desugaring pass gets to work with, and how passes describe themselves to the registry (index.ts).
2
+ export {};
3
+ //# sourceMappingURL=context.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"context.js","sourceRoot":"","sources":["../../../src/sim/passes/context.ts"],"names":[],"mappings":"AAAA,2GAA2G","sourcesContent":["// What a desugaring pass gets to work with, and how passes describe themselves to the registry (index.ts).\n\nimport type { Diagnostic, Span } from '../../types'\nimport type { CState, CVar } from '../model'\n\nexport type Owner = 'core' | 'preemption' | 'structure'\n\n/** A construct of the chart that a pass removes (used to report charts the simulator cannot run yet). */\nexport interface Construct {\n what: string\n span?: Span\n related?: string[]\n}\n\nexport interface PassContext {\n /** The scchart being compiled (rewritten in place). */\n readonly root: CState\n /** KIELER configuration that decides how some processors behave in the netlist simulation chain. */\n readonly config: {\n /** de.cau.cs.kieler.sccharts.finalRegion.supported (false in the netlist system). */\n finalRegions: boolean\n /** Compile host code and extern calls on (for the C code generator, which carries them into the C code). */\n hostCode?: boolean\n }\n /** Source variables by ValuedObject id. */\n readonly vars: Map<string, CVar>\n /** Reports a problem; errors make the chart rejected. */\n report(d: Diagnostic): void\n /** Shared state between passes (for example Termination's annotations that Abort reads). */\n readonly shared: Record<string, unknown>\n}\n\nexport interface Pass {\n /** KIELER's processor id (de.cau.cs.kieler.sccharts.processors....). */\n id: string\n name: string\n /** The workstream that implements it. */\n owner: Owner\n /** KIELER runs some processors twice with different configurations (entry and exit actions). */\n config?: Record<string, string>\n /** Constructs in the chart that need this pass. Only consulted while `run` is missing. */\n uses?(root: CState): Construct[]\n /** Rewrites the chart. Missing: the pass is not implemented yet, and charts that use it are rejected. */\n run?(ctx: PassContext): void\n}\n"]}
@@ -0,0 +1,2 @@
1
+ import type { Pass } from "./context.js";
2
+ export declare const countDelay: Pass;
@@ -0,0 +1,51 @@
1
+ // KIELER's Count Delay processor (sccharts/processors/CountDelay.xtend, the pre-based variant; the structure-based
2
+ // one is off by default): `[immediate] if n T go to X` from S becomes a counter `_cdcounter` declared in S's
3
+ // parent, `entry do _cdcounter = 0` on S (tagged DoNotDefer), `[immediate] during if T do _cdcounter += 1` on S
4
+ // (immediate iff the transition is implicitly immediate) and the trigger `pre(_cdcounter) == n - 1 && T`
5
+ // (preemption.md P-28..P-36). Count delays on actions are not transformed: KIELER ignores them on during actions
6
+ // (the validator warns, P-13) and on suspends (P-32).
7
+ //
8
+ // Because the counter lives in a during action and its test reads `pre`, a count delay inherits their timing:
9
+ // the entry tick of a delayed count is not counted, the count restarts on every entry, suspension freezes it
10
+ // (Suspend runs first and guards T), and an immediate count can complete at once on re-entry because pre(counter)
11
+ // is still last visit's count (P-30, reported by quirks.ts).
12
+ import { containedTransitions, markDoNotDefer } from "./contained.js";
13
+ import { assign, copyExpr, createAction, createEntryAction, createVar, isImplicitlyImmediate, lit, op, ref, quoted, readableName, } from "../model.js";
14
+ export const countDelay = {
15
+ id: 'de.cau.cs.kieler.sccharts.processors.countDelay',
16
+ name: 'Count Delay',
17
+ owner: 'preemption',
18
+ run(ctx) {
19
+ for (const t of containedTransitions(ctx.root))
20
+ transformCountDelay(t, ctx);
21
+ },
22
+ };
23
+ function transformCountDelay(t, ctx) {
24
+ const n = t.triggerDelay;
25
+ if (n === undefined || n <= 1 || t.trigger === undefined)
26
+ return;
27
+ const source = t.source;
28
+ const parent = source.parent.parent;
29
+ const by = t.origin ?? t.about;
30
+ const o = { hidden: true, by };
31
+ const counter = createVar(parent, '_cdcounter', 'int', 'counter');
32
+ counter.display = `the count delay on ${quoted(readableName(source)) ?? 'a state'}'s transition to ${quoted(readableName(t.target)) ?? 'another state'}`;
33
+ // The source transition, for the diagnostics (compile.ts countDelayResetLoop).
34
+ if (by)
35
+ counter.tags.add(`#count-delay:${by}`);
36
+ // entry do _cdcounter = 0 (DoNotDefer: a deferred entry still restarts the count, P-34)
37
+ const entry = createEntryAction(source);
38
+ entry.about = by;
39
+ entry.effects.push(assign(counter, lit(0), o));
40
+ markDoNotDefer(ctx, entry);
41
+ // [immediate] during if T do _cdcounter = _cdcounter + 1
42
+ const during = createAction(source, 'during');
43
+ during.about = by;
44
+ during.delay = isImplicitlyImmediate(t) ? 'immediate' : 'undefined';
45
+ during.trigger = copyExpr(t.trigger);
46
+ during.effects.push(assign(counter, op('+', ref(counter), lit(1)), o));
47
+ // trigger := pre(_cdcounter) == n - 1 && T
48
+ t.trigger = op('&&', op('==', op('pre', ref(counter)), lit(n - 1)), t.trigger);
49
+ t.triggerDelay = 1;
50
+ }
51
+ //# sourceMappingURL=countDelay.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"countDelay.js","sourceRoot":"","sources":["../../../src/sim/passes/countDelay.ts"],"names":[],"mappings":"AAAA,mHAAmH;AACnH,6GAA6G;AAC7G,gHAAgH;AAChH,yGAAyG;AACzG,iHAAiH;AACjH,sDAAsD;AACtD,EAAE;AACF,8GAA8G;AAC9G,6GAA6G;AAC7G,kHAAkH;AAClH,6DAA6D;AAG7D,OAAO,EAAE,oBAAoB,EAAE,cAAc,EAAE,uBAAmB;AAClE,OAAO,EACH,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,iBAAiB,EAAE,SAAS,EAAE,qBAAqB,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EACjG,MAAM,EAAE,YAAY,GACvB,oBAAgB;AAEjB,MAAM,CAAC,MAAM,UAAU,GAAS;IAC5B,EAAE,EAAE,iDAAiD;IACrD,IAAI,EAAE,aAAa;IACnB,KAAK,EAAE,YAAY;IACnB,GAAG,CAAC,GAAgB;QAChB,KAAK,MAAM,CAAC,IAAI,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,mBAAmB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAC/E,CAAC;CACJ,CAAA;AAED,SAAS,mBAAmB,CAAC,CAAc,EAAE,GAAgB;IACzD,MAAM,CAAC,GAAG,CAAC,CAAC,YAAY,CAAA;IACxB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS;QAAE,OAAM;IAChE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAA;IACvB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAO,CAAC,MAAM,CAAA;IACpC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAA;IAC9B,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;IAE9B,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;IACjE,OAAO,CAAC,OAAO,GAAG,sBAAsB,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,SAAS,oBAAoB,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,eAAe,EAAE,CAAA;IACxJ,+EAA+E;IAC/E,IAAI,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAA;IAE9C,wFAAwF;IACxF,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAA;IACvC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAA;IAChB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC9C,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAE1B,yDAAyD;IACzD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IAC7C,MAAM,CAAC,KAAK,GAAG,EAAE,CAAA;IACjB,MAAM,CAAC,KAAK,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAA;IACnE,MAAM,CAAC,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACpC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAEtE,2CAA2C;IAC3C,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAA;IAC9E,CAAC,CAAC,YAAY,GAAG,CAAC,CAAA;AACtB,CAAC","sourcesContent":["// KIELER's Count Delay processor (sccharts/processors/CountDelay.xtend, the pre-based variant; the structure-based\n// one is off by default): `[immediate] if n T go to X` from S becomes a counter `_cdcounter` declared in S's\n// parent, `entry do _cdcounter = 0` on S (tagged DoNotDefer), `[immediate] during if T do _cdcounter += 1` on S\n// (immediate iff the transition is implicitly immediate) and the trigger `pre(_cdcounter) == n - 1 && T`\n// (preemption.md P-28..P-36). Count delays on actions are not transformed: KIELER ignores them on during actions\n// (the validator warns, P-13) and on suspends (P-32).\n//\n// Because the counter lives in a during action and its test reads `pre`, a count delay inherits their timing:\n// the entry tick of a delayed count is not counted, the count restarts on every entry, suspension freezes it\n// (Suspend runs first and guards T), and an immediate count can complete at once on re-entry because pre(counter)\n// is still last visit's count (P-30, reported by quirks.ts).\n\nimport type { Pass, PassContext } from './context'\nimport { containedTransitions, markDoNotDefer } from './contained'\nimport {\n assign, copyExpr, createAction, createEntryAction, createVar, isImplicitlyImmediate, lit, op, ref, type CTransition,\n quoted, readableName,\n} from '../model'\n\nexport const countDelay: Pass = {\n id: 'de.cau.cs.kieler.sccharts.processors.countDelay',\n name: 'Count Delay',\n owner: 'preemption',\n run(ctx: PassContext) {\n for (const t of containedTransitions(ctx.root)) transformCountDelay(t, ctx)\n },\n}\n\nfunction transformCountDelay(t: CTransition, ctx: PassContext) {\n const n = t.triggerDelay\n if (n === undefined || n <= 1 || t.trigger === undefined) return\n const source = t.source\n const parent = source.parent!.parent\n const by = t.origin ?? t.about\n const o = { hidden: true, by }\n\n const counter = createVar(parent, '_cdcounter', 'int', 'counter')\n counter.display = `the count delay on ${quoted(readableName(source)) ?? 'a state'}'s transition to ${quoted(readableName(t.target)) ?? 'another state'}`\n // The source transition, for the diagnostics (compile.ts countDelayResetLoop).\n if (by) counter.tags.add(`#count-delay:${by}`)\n\n // entry do _cdcounter = 0 (DoNotDefer: a deferred entry still restarts the count, P-34)\n const entry = createEntryAction(source)\n entry.about = by\n entry.effects.push(assign(counter, lit(0), o))\n markDoNotDefer(ctx, entry)\n\n // [immediate] during if T do _cdcounter = _cdcounter + 1\n const during = createAction(source, 'during')\n during.about = by\n during.delay = isImplicitlyImmediate(t) ? 'immediate' : 'undefined'\n during.trigger = copyExpr(t.trigger)\n during.effects.push(assign(counter, op('+', ref(counter), lit(1)), o))\n\n // trigger := pre(_cdcounter) == n - 1 && T\n t.trigger = op('&&', op('==', op('pre', ref(counter)), lit(n - 1)), t.trigger)\n t.triggerDelay = 1\n}\n"]}
@@ -0,0 +1,11 @@
1
+ import { type CState } from "../model.js";
2
+ import type { Expansion } from "./reference.js";
3
+ /** A schedule group of sequential equations (KIELER's schedule object) and an equation region's priority in it. */
4
+ export interface Schedule {
5
+ group: object;
6
+ priority: number;
7
+ /** For the log: the equations' region names. */
8
+ name: string;
9
+ }
10
+ /** Processes every dataflow region inside `state` (KIELER's processState: eAllContents order). */
11
+ export declare function processDataflow(state: CState, expansion: Expansion): void;
@@ -0,0 +1,319 @@
1
+ // KIELER's Dataflow processor, classic mode (sccharts/processors/dataflow/Dataflow.xtend, processDataflowRegionClassic),
2
+ // called by the Reference processor. structure.md S-25 .. S-34.
3
+ //
4
+ // A dataflow region becomes a control-flow region `__df_<name>` of its state with one state `__df_main`. Every
5
+ // equation becomes a region of `__df_main`: `__df_<k>` -immediate/ x = e-> `__df_d<k>` -delayed-> `__df_<k>`, so it
6
+ // is evaluated in every tick, the entry tick included, concurrently with the others (`once`: `__df_d<k>` is final and
7
+ // `__df_main` joins a final `__df_done`). Every chart instance used in the equations (`ref C g`) gets a region
8
+ // before them: `__df_<i> is C(...)` -join-> `__df_d<i>` -delayed-> `__df_<i>` (a terminated instance restarts one
9
+ // tick later, S-34), bound to fresh locals `__df_g_X` for C's inputs and outputs, which `g.X` in the equations
10
+ // becomes. A tuple `g = {a, _, c}` sets C's inputs in declaration order (`_` skips one); a vector assigned to an
11
+ // array sets its elements. Equations ending with `;` (or `seq`) and the one after them form a sequence: their regions
12
+ // get one schedule (KIELER's `schedule seq<n>` with increasing priorities), so they run in written order (S-27).
13
+ import { CVar, createAction, createControlflowRegion, createState, createTransitionTo, ref, } from "../model.js";
14
+ const PREFIX = '__df_';
15
+ /** Processes every dataflow region inside `state` (KIELER's processState: eAllContents order). */
16
+ export function processDataflow(state, expansion) {
17
+ const regions = [];
18
+ const visit = (s) => {
19
+ for (const r of s.regions) {
20
+ if (r.dataflow)
21
+ regions.push(r);
22
+ for (const c of r.states)
23
+ visit(c);
24
+ }
25
+ };
26
+ visit(state);
27
+ for (const r of regions)
28
+ processRegion(r, expansion);
29
+ }
30
+ /** Does an equation call a method? Then KIELER uses its "OO" translation (processDataflowRegionOO). */
31
+ function callsMethod(eqs) {
32
+ let found = false;
33
+ const visit = (e) => {
34
+ if (e.k === 'call' && e.target?.v.method)
35
+ found = true;
36
+ if (e.k === 'op')
37
+ e.args.forEach(visit);
38
+ else if (e.k === 'call' || e.k === 'vector')
39
+ (e.k === 'call' ? e.args : e.values).forEach(visit);
40
+ else if (e.k === 'ref')
41
+ e.idx.forEach(visit);
42
+ };
43
+ for (const eq of eqs)
44
+ visit(eq.expr);
45
+ return found;
46
+ }
47
+ /**
48
+ * KIELER's processDataflowRegionOO, for equations that call methods: one state `__df_<name>` whose immediate during
49
+ * actions (entry actions for `once`) are the equations, in written order; sequences get schedules as in the classic
50
+ * translation. Chart instances in such regions are not supported (KIELER keeps them as objects).
51
+ */
52
+ function processRegionOO(df, expansion, eqs) {
53
+ const parent = df.parent;
54
+ const about = df.origin ?? df.about;
55
+ const region = createControlflowRegion(parent, `${PREFIX}${df.name ?? 'null'}`);
56
+ region.about = about;
57
+ const main = createState(region, `${PREFIX}${df.name ?? 'null'}`);
58
+ main.initial = true;
59
+ main.about = about;
60
+ for (const v of [...df.decls]) {
61
+ v.scope = main;
62
+ main.decls.push(v);
63
+ }
64
+ df.decls = [];
65
+ if (eqs.some(eq => [eq.target, ...refsOf(eq.expr)].some(r => r.v.declKind === 'reference'))) {
66
+ expansion.ctx.report({
67
+ severity: 'info', code: 'unsupported', related: about ? [about] : undefined,
68
+ message: 'The guide\'s simulator cannot run chart instances in a dataflow region that calls methods yet',
69
+ hint: 'KIELER translates such a region differently (its "OO" mode), keeping the instances as objects. The official KIELER tools can run this chart.',
70
+ });
71
+ return;
72
+ }
73
+ let group;
74
+ let priority = 0;
75
+ let lastSequential = false;
76
+ for (const eq of eqs) {
77
+ if (eq.sequential && !lastSequential) {
78
+ group = {};
79
+ priority = 0;
80
+ }
81
+ const action = createAction(main, df.ext.once ? 'entry' : 'during');
82
+ action.delay = 'immediate';
83
+ action.about = about;
84
+ const schedule = (eq.sequential || lastSequential) && group ? [{ group, priority: priority++ }] : undefined;
85
+ action.effects.push({ k: 'assign', ref: eq.target, op: eq.op, expr: eq.expr, o: { by: about, span: eq.span, schedule } });
86
+ lastSequential = eq.sequential;
87
+ }
88
+ parent.regions.splice(parent.regions.indexOf(df), 1);
89
+ }
90
+ function refsOf(e) {
91
+ const out = [];
92
+ const visit = (x) => {
93
+ if (x.k === 'ref') {
94
+ out.push(x);
95
+ x.idx.forEach(visit);
96
+ }
97
+ else if (x.k === 'op')
98
+ x.args.forEach(visit);
99
+ else if (x.k === 'vector')
100
+ x.values.forEach(visit);
101
+ else if (x.k === 'call')
102
+ x.args.forEach(visit);
103
+ };
104
+ visit(e);
105
+ return out;
106
+ }
107
+ function processRegion(df, expansion) {
108
+ const eqsAll = df.ext.eqs ?? [];
109
+ if (!df.ext.forCounter && !eqsAll.some(eq => eq.call) && callsMethod(eqsAll)) {
110
+ processRegionOO(df, expansion, eqsAll);
111
+ return;
112
+ }
113
+ const parent = df.parent;
114
+ const about = df.origin ?? df.about;
115
+ const region = createControlflowRegion(parent, `${PREFIX}${df.name ?? 'null'}`);
116
+ region.about = about;
117
+ const main = createState(region, `${PREFIX}main`);
118
+ main.initial = true;
119
+ main.about = about;
120
+ if (df.ext.once) {
121
+ const done = createState(region, `${PREFIX}done`);
122
+ done.final = true;
123
+ done.about = about;
124
+ createTransitionTo(main, done).preemption = 'termination';
125
+ }
126
+ for (const v of [...df.decls]) {
127
+ v.scope = region;
128
+ region.decls.push(v);
129
+ }
130
+ df.decls = [];
131
+ const eqs = df.ext.eqs ?? [];
132
+ const counter = df.ext.forCounter;
133
+ if (counter) {
134
+ // The Dataflow processor ignores the for-loop: the equations keep references to a counter that is gone (S-24).
135
+ expansion.ctx.report({
136
+ severity: 'error', code: 'dataflow-for', span: counter.span, related: about ? [about] : undefined,
137
+ message: 'A dataflow region cannot be a for-region',
138
+ kieler: `The valued object reference points to a valued object (${counter.name}) that is not contained in the model!\nReferences objects are not contained in the resource!`,
139
+ hint: `KIELER turns the dataflow region into control flow without copying it, so \`${counter.name}\` is unknown in its equations. Write the equations for each value (O[0] = I[0], O[1] = I[1], ...), or use a control-flow for-region.`,
140
+ });
141
+ return;
142
+ }
143
+ for (const eq of eqs) {
144
+ if (eq.call) {
145
+ expansion.ctx.report({
146
+ severity: 'info', code: 'unsupported', span: eq.span, related: about ? [about] : undefined,
147
+ message: 'The guide\'s simulator cannot run dataflow reference calls (A(x, y)) yet',
148
+ hint: 'Write one equation per input instead: g.A = x. The official KIELER tools can run this chart as written.',
149
+ });
150
+ return;
151
+ }
152
+ }
153
+ // Chart instances used in the equations, in order of first use.
154
+ const instances = [];
155
+ for (const eq of eqs) {
156
+ for (const r of assignmentRefs(eq)) {
157
+ if (r.v.declKind === 'reference' && r.v.instance && !instances.includes(r.v))
158
+ instances.push(r.v);
159
+ }
160
+ }
161
+ const locals = new Map();
162
+ instances.forEach((g, i) => {
163
+ const chart = expansion.findChart(g.instance.target);
164
+ const r = createControlflowRegion(main, `${PREFIX}refRegion_${i}`);
165
+ r.about = g.decl;
166
+ const refState = createState(r, `${PREFIX}${i}`);
167
+ refState.initial = true;
168
+ refState.about = g.decl;
169
+ const wait = createState(r, `${PREFIX}d${i}`);
170
+ wait.about = g.decl;
171
+ createTransitionTo(refState, wait).preemption = 'termination';
172
+ createTransitionTo(wait, refState);
173
+ const args = [...g.instance.args];
174
+ const own = new Map();
175
+ // Local versions of the instance's interface (inputs and outputs, in declaration order).
176
+ for (const d of chart ? interfaceOf(chart) : []) {
177
+ const local = new CVar(`${PREFIX}${g.name}_${d.name}`, d.type);
178
+ local.signal = d.signal;
179
+ local.generated = true;
180
+ local.dims = d.dims;
181
+ local.display = `${g.name}.${d.name}`;
182
+ local.decl = g.decl;
183
+ local.span = g.span;
184
+ const scope = g.scope ?? main;
185
+ local.scope = scope;
186
+ scope.decls.push(local);
187
+ own.set(d.name, local);
188
+ args.push({ expr: ref(local) });
189
+ }
190
+ locals.set(g, own);
191
+ const call = { target: g.instance.target, args, span: g.span };
192
+ refState.ext.call = call;
193
+ });
194
+ // Equations: tuples into one equation per input (or array element), in written order.
195
+ let group;
196
+ let priority = 0;
197
+ let lastSequential = false;
198
+ eqs.forEach((eq, k) => {
199
+ const parts = [];
200
+ if (eq.expr.k === 'vector') {
201
+ const values = [...eq.expr.values];
202
+ const target = eq.target;
203
+ if (target.v.declKind === 'reference' && target.v.instance) {
204
+ const chart = expansion.findChart(target.v.instance.target);
205
+ let idx = 0;
206
+ for (const input of chart ? interfaceOf(chart).filter(d => d.input) : []) {
207
+ if (values.length) {
208
+ const value = values.shift();
209
+ if (value.k !== 'ignore')
210
+ parts.push({ key: idx + k * 100, target: { k: 'ref', v: target.v, idx: [], sub: { k: 'ref', v: placeholder(input.name), idx: [] }, span: target.span }, op: eq.op, expr: value });
211
+ }
212
+ idx++;
213
+ }
214
+ }
215
+ else {
216
+ values.forEach((value, idx) => {
217
+ if (value.k !== 'ignore')
218
+ parts.push({ key: idx + k * 100, target: { ...target, idx: [...target.idx, { k: 'lit', t: 'int', v: idx }] }, op: eq.op, expr: value });
219
+ });
220
+ }
221
+ }
222
+ else {
223
+ parts.push({ key: k, target: eq.target, op: eq.op, expr: eq.expr });
224
+ }
225
+ if (eq.sequential && !lastSequential) {
226
+ group = {};
227
+ priority = 0;
228
+ }
229
+ for (const part of parts) {
230
+ const r = createControlflowRegion(main, `${PREFIX}subRegion_${part.key}`);
231
+ r.about = about;
232
+ if ((eq.sequential || lastSequential) && group)
233
+ r.ext.schedule = { group, priority: priority++, name: `seq` };
234
+ const s = createState(r, `${PREFIX}${part.key}`);
235
+ s.initial = true;
236
+ s.about = about;
237
+ const d = createState(r, `${PREFIX}d${part.key}`);
238
+ d.about = about;
239
+ const t = createTransitionTo(s, d);
240
+ t.delay = 'immediate';
241
+ t.about = about;
242
+ const target = instanceRef(part.target, locals);
243
+ const expr = instanceExpr(part.expr, locals);
244
+ t.effects.push({ k: 'assign', ref: target, op: part.op, expr, o: { by: about, span: eq.span } });
245
+ if (df.ext.once)
246
+ d.final = true;
247
+ else
248
+ createTransitionTo(d, s);
249
+ }
250
+ lastSequential = eq.sequential;
251
+ });
252
+ // Remove the dataflow region and the instances' declarations.
253
+ parent.regions.splice(parent.regions.indexOf(df), 1);
254
+ for (const g of instances) {
255
+ const scope = g.scope;
256
+ if (scope)
257
+ scope.decls.splice(scope.decls.indexOf(g), 1);
258
+ }
259
+ }
260
+ /** The interface of a chart as written: its inputs and outputs in declaration order. */
261
+ function interfaceOf(chart) {
262
+ const out = [];
263
+ for (const d of chart.declarations) {
264
+ if (d.declKind !== 'variable' || !(d.input || d.output))
265
+ continue;
266
+ for (const vo of d.valuedObjects) {
267
+ out.push({
268
+ name: vo.name, type: d.type ?? (d.signal ? 'pure' : 'host'), signal: d.signal, input: d.input,
269
+ dims: vo.cardinalities.flatMap(c => (c.kind === 'int' ? [{ k: 'lit', t: 'int', v: c.value }] : [])),
270
+ });
271
+ }
272
+ }
273
+ return out;
274
+ }
275
+ const placeholders = new Map();
276
+ /** A stand-in for a member of an instance (`g.A`) before it is replaced by the local `__df_g_A`. */
277
+ function placeholder(name) {
278
+ let v = placeholders.get(name);
279
+ if (!v)
280
+ placeholders.set(name, (v = new CVar(name, 'host')));
281
+ return v;
282
+ }
283
+ /** The references of an equation: target first, then the expression's (KIELER's allAssignmentReferences). */
284
+ function assignmentRefs(eq) {
285
+ const out = [eq.target];
286
+ const walk = (e) => {
287
+ if (e.k === 'ref') {
288
+ out.push(e);
289
+ e.idx.forEach(walk);
290
+ }
291
+ else if (e.k === 'op')
292
+ e.args.forEach(walk);
293
+ else if (e.k === 'vector')
294
+ e.values.forEach(walk);
295
+ else if (e.k === 'call')
296
+ e.args.forEach(walk);
297
+ };
298
+ walk(eq.expr);
299
+ return out;
300
+ }
301
+ /** `g.X` becomes the local `__df_g_X`. */
302
+ function instanceRef(r, locals) {
303
+ if (r.sub) {
304
+ const local = locals.get(r.v)?.get(r.sub.v.name);
305
+ if (local)
306
+ return { k: 'ref', v: local, idx: r.sub.idx, span: r.span };
307
+ }
308
+ return { ...r, idx: r.idx.map(i => instanceExpr(i, locals)) };
309
+ }
310
+ function instanceExpr(e, locals) {
311
+ switch (e.k) {
312
+ case 'ref': return instanceRef(e, locals);
313
+ case 'op': return { ...e, args: e.args.map(a => instanceExpr(a, locals)) };
314
+ case 'vector': return { ...e, values: e.values.map(a => instanceExpr(a, locals)) };
315
+ case 'call': return { ...e, args: e.args.map(a => instanceExpr(a, locals)) };
316
+ default: return e;
317
+ }
318
+ }
319
+ //# sourceMappingURL=dataflow.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"dataflow.js","sourceRoot":"","sources":["../../../src/sim/passes/dataflow.ts"],"names":[],"mappings":"AAAA,yHAAyH;AACzH,gEAAgE;AAChE,EAAE;AACF,+GAA+G;AAC/G,oHAAoH;AACpH,sHAAsH;AACtH,+GAA+G;AAC/G,kHAAkH;AAClH,+GAA+G;AAC/G,iHAAiH;AACjH,sHAAsH;AACtH,iHAAiH;AAIjH,OAAO,EACH,IAAI,EAAE,YAAY,EAAE,uBAAuB,EAAE,WAAW,EAAE,kBAAkB,EAAE,GAAG,GAEpF,oBAAgB;AAGjB,MAAM,MAAM,GAAG,OAAO,CAAA;AAUtB,kGAAkG;AAClG,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,SAAoB;IAC/D,MAAM,OAAO,GAAc,EAAE,CAAA;IAC7B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE;QACxB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,QAAQ;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QACtC,CAAC;IACL,CAAC,CAAA;IACD,KAAK,CAAC,KAAK,CAAC,CAAA;IACZ,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;AACxD,CAAC;AAED,uGAAuG;AACvG,SAAS,WAAW,CAAC,GAAgB;IACjC,IAAI,KAAK,GAAG,KAAK,CAAA;IACjB,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,EAAE;QACvB,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM;YAAE,KAAK,GAAG,IAAI,CAAA;QACtD,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;aAClC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ;YAAE,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;aAC3F,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK;YAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAChD,CAAC,CAAA;IACD,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;IACpC,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,EAAW,EAAE,SAAoB,EAAE,GAAgB;IACxE,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAA;IACxB,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,CAAA;IACnC,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC,CAAA;IAC/E,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC,CAAA;IACjE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;IACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IAClB,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,CAAC,CAAC,KAAK,GAAG,IAAI,CAAA;QACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACtB,CAAC;IACD,EAAE,CAAC,KAAK,GAAG,EAAE,CAAA;IACb,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,WAAW,CAAC,CAAC,EAAE,CAAC;QAC1F,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC;YACjB,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;YAC3E,OAAO,EAAE,+FAA+F;YACxG,IAAI,EAAE,8IAA8I;SACvJ,CAAC,CAAA;QACF,OAAM;IACV,CAAC;IACD,IAAI,KAAyB,CAAA;IAC7B,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,EAAE,CAAC,UAAU,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,KAAK,GAAG,EAAE,CAAA;YACV,QAAQ,GAAG,CAAC,CAAA;QAChB,CAAC;QACD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QACnE,MAAM,CAAC,KAAK,GAAG,WAAW,CAAA;QAC1B,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;QACpB,MAAM,QAAQ,GAAG,CAAC,EAAE,CAAC,UAAU,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAC3G,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAA;QACzH,cAAc,GAAG,EAAE,CAAC,UAAU,CAAA;IAClC,CAAC;IACD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACxD,CAAC;AAED,SAAS,MAAM,CAAC,CAAQ;IACpB,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,EAAE;QACvB,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAAC,CAAC;aACnD,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;aACvC,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ;YAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;aAC7C,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAClD,CAAC,CAAA;IACD,KAAK,CAAC,CAAC,CAAC,CAAA;IACR,OAAO,GAAG,CAAA;AACd,CAAC;AAED,SAAS,aAAa,CAAC,EAAW,EAAE,SAAoB;IACpD,MAAM,MAAM,GAAI,EAAE,CAAC,GAAG,CAAC,GAA+B,IAAI,EAAE,CAAA;IAC5D,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3E,eAAe,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,CAAA;QACtC,OAAM;IACV,CAAC;IACD,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAA;IACxB,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,CAAA;IACnC,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC,CAAA;IAC/E,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,CAAA;IACjD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;IACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IAClB,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,CAAA;QACjD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,UAAU,GAAG,aAAa,CAAA;IAC7D,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,CAAC,CAAC,KAAK,GAAG,MAAM,CAAA;QAChB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACxB,CAAC;IACD,EAAE,CAAC,KAAK,GAAG,EAAE,CAAA;IAEb,MAAM,GAAG,GAAI,EAAE,CAAC,GAAG,CAAC,GAA+B,IAAI,EAAE,CAAA;IACzD,MAAM,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,UAA8B,CAAA;IACrD,IAAI,OAAO,EAAE,CAAC;QACV,+GAA+G;QAC/G,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC;YACjB,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;YACjG,OAAO,EAAE,0CAA0C;YACnD,MAAM,EAAE,0DAA0D,OAAO,CAAC,IAAI,8FAA8F;YAC5K,IAAI,EAAE,+EAA+E,OAAO,CAAC,IAAI,uIAAuI;SAC3O,CAAC,CAAA;QACF,OAAM;IACV,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YACV,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC;gBACjB,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC1F,OAAO,EAAE,0EAA0E;gBACnF,IAAI,EAAE,yGAAyG;aAClH,CAAC,CAAA;YACF,OAAM;QACV,CAAC;IACL,CAAC;IAED,gEAAgE;IAChE,MAAM,SAAS,GAAW,EAAE,CAAA;IAC5B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACrG,CAAC;IACL,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAA;IACjD,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,QAAS,CAAC,MAAM,CAAC,CAAA;QACrD,MAAM,CAAC,GAAG,uBAAuB,CAAC,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,EAAE,CAAC,CAAA;QAClE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAA;QAChB,MAAM,QAAQ,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;QAChD,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAA;QACvB,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAA;QACvB,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,CAAA;QAC7C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAA;QACnB,kBAAkB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,UAAU,GAAG,aAAa,CAAA;QAC7D,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAClC,MAAM,IAAI,GAAW,CAAC,GAAG,CAAC,CAAC,QAAS,CAAC,IAAI,CAAC,CAAA;QAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAgB,CAAA;QACnC,yFAAyF;QACzF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;YAC9D,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAA;YACvB,KAAK,CAAC,SAAS,GAAG,IAAI,CAAA;YACtB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YACnB,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;YACrC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YACnB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YACnB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;YAC7B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;YACnB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACvB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YACtB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;QACnC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QAClB,MAAM,IAAI,GAAkB,EAAE,MAAM,EAAE,CAAC,CAAC,QAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;QAC9E,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAA;IAC5B,CAAC,CAAC,CAAA;IAEF,sFAAsF;IACtF,IAAI,KAAyB,CAAA;IAC7B,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QAClB,MAAM,KAAK,GAAsE,EAAE,CAAA;QACnF,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAClC,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAA;YACxB,IAAI,MAAM,CAAC,CAAC,CAAC,QAAQ,KAAK,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACzD,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;gBAC3D,IAAI,GAAG,GAAG,CAAC,CAAA;gBACX,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;oBACvE,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;wBAChB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAG,CAAA;wBAC7B,IAAI,KAAK,CAAC,CAAC,KAAK,QAAQ;4BAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;oBAC/M,CAAC;oBACD,GAAG,EAAE,CAAA;gBACT,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;oBAC1B,IAAI,KAAK,CAAC,CAAC,KAAK,QAAQ;wBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;gBACrK,CAAC,CAAC,CAAA;YACN,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;QACvE,CAAC;QACD,IAAI,EAAE,CAAC,UAAU,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,KAAK,GAAG,EAAE,CAAA;YACV,QAAQ,GAAG,CAAC,CAAA;QAChB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,uBAAuB,CAAC,IAAI,EAAE,GAAG,MAAM,aAAa,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;YACzE,CAAC,CAAC,KAAK,GAAG,KAAK,CAAA;YACf,IAAI,CAAC,EAAE,CAAC,UAAU,IAAI,cAAc,CAAC,IAAI,KAAK;gBAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,KAAK,EAAqB,CAAA;YAChI,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;YAChD,CAAC,CAAC,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAA;YACf,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;YACjD,CAAC,CAAC,KAAK,GAAG,KAAK,CAAA;YACf,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAClC,CAAC,CAAC,KAAK,GAAG,WAAW,CAAA;YACrB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAA;YACf,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;YAC/C,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC5C,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YAChG,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI;gBAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAA;;gBAC1B,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACjC,CAAC;QACD,cAAc,GAAG,EAAE,CAAC,UAAU,CAAA;IAClC,CAAC,CAAC,CAAA;IAEF,8DAA8D;IAC9D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;QACrB,IAAI,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5D,CAAC;AACL,CAAC;AAED,wFAAwF;AACxF,SAAS,WAAW,CAAC,KAAY;IAC7B,MAAM,GAAG,GAA2F,EAAE,CAAA;IACtG,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;YAAE,SAAQ;QACjE,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAC/B,GAAG,CAAC,IAAI,CAAC;gBACL,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK;gBAC7F,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAC/G,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgB,CAAA;AAC5C,oGAAoG;AACpG,SAAS,WAAW,CAAC,IAAY;IAC7B,IAAI,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC9B,IAAI,CAAC,CAAC;QAAE,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAA;IAC5D,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,6GAA6G;AAC7G,SAAS,cAAc,CAAC,EAAa;IACjC,MAAM,GAAG,GAAW,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;IAC/B,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,EAAE;QACtB,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAChB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACX,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;aAAM,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;aACxC,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ;YAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;aAC5C,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACjD,CAAC,CAAA;IACD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;IACb,OAAO,GAAG,CAAA;AACd,CAAC;AAED,0CAA0C;AAC1C,SAAS,WAAW,CAAC,CAAO,EAAE,MAAoC;IAC9D,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;QACR,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,KAAK;YAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;IAC1E,CAAC;IACD,OAAO,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAA;AACjE,CAAC;AAED,SAAS,YAAY,CAAC,CAAQ,EAAE,MAAoC;IAChE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,OAAO,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QACzC,KAAK,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAA;QAC1E,KAAK,QAAQ,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAA;QAClF,KAAK,MAAM,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAA;QAC5E,OAAO,CAAC,CAAC,OAAO,CAAC,CAAA;IACrB,CAAC;AACL,CAAC","sourcesContent":["// KIELER's Dataflow processor, classic mode (sccharts/processors/dataflow/Dataflow.xtend, processDataflowRegionClassic),\n// called by the Reference processor. structure.md S-25 .. S-34.\n//\n// A dataflow region becomes a control-flow region `__df_<name>` of its state with one state `__df_main`. Every\n// equation becomes a region of `__df_main`: `__df_<k>` -immediate/ x = e-> `__df_d<k>` -delayed-> `__df_<k>`, so it\n// is evaluated in every tick, the entry tick included, concurrently with the others (`once`: `__df_d<k>` is final and\n// `__df_main` joins a final `__df_done`). Every chart instance used in the equations (`ref C g`) gets a region\n// before them: `__df_<i> is C(...)` -join-> `__df_d<i>` -delayed-> `__df_<i>` (a terminated instance restarts one\n// tick later, S-34), bound to fresh locals `__df_g_X` for C's inputs and outputs, which `g.X` in the equations\n// becomes. A tuple `g = {a, _, c}` sets C's inputs in declaration order (`_` skips one); a vector assigned to an\n// array sets its elements. Equations ending with `;` (or `seq`) and the one after them form a sequence: their regions\n// get one schedule (KIELER's `schedule seq<n>` with increasing priorities), so they run in written order (S-27).\n\nimport type { State } from '../../types'\nimport type { CEquation } from '../lower'\nimport {\n CVar, createAction, createControlflowRegion, createState, createTransitionTo, ref, type CArg, type CExpr, type CRef,\n type CRegion, type CState,\n} from '../model'\nimport type { Expansion, ReferenceCall } from './reference'\n\nconst PREFIX = '__df_'\n\n/** A schedule group of sequential equations (KIELER's schedule object) and an equation region's priority in it. */\nexport interface Schedule {\n group: object\n priority: number\n /** For the log: the equations' region names. */\n name: string\n}\n\n/** Processes every dataflow region inside `state` (KIELER's processState: eAllContents order). */\nexport function processDataflow(state: CState, expansion: Expansion) {\n const regions: CRegion[] = []\n const visit = (s: CState) => {\n for (const r of s.regions) {\n if (r.dataflow) regions.push(r)\n for (const c of r.states) visit(c)\n }\n }\n visit(state)\n for (const r of regions) processRegion(r, expansion)\n}\n\n/** Does an equation call a method? Then KIELER uses its \"OO\" translation (processDataflowRegionOO). */\nfunction callsMethod(eqs: CEquation[]): boolean {\n let found = false\n const visit = (e: CExpr) => {\n if (e.k === 'call' && e.target?.v.method) found = true\n if (e.k === 'op') e.args.forEach(visit)\n else if (e.k === 'call' || e.k === 'vector') (e.k === 'call' ? e.args : e.values).forEach(visit)\n else if (e.k === 'ref') e.idx.forEach(visit)\n }\n for (const eq of eqs) visit(eq.expr)\n return found\n}\n\n/**\n * KIELER's processDataflowRegionOO, for equations that call methods: one state `__df_<name>` whose immediate during\n * actions (entry actions for `once`) are the equations, in written order; sequences get schedules as in the classic\n * translation. Chart instances in such regions are not supported (KIELER keeps them as objects).\n */\nfunction processRegionOO(df: CRegion, expansion: Expansion, eqs: CEquation[]) {\n const parent = df.parent\n const about = df.origin ?? df.about\n const region = createControlflowRegion(parent, `${PREFIX}${df.name ?? 'null'}`)\n region.about = about\n const main = createState(region, `${PREFIX}${df.name ?? 'null'}`)\n main.initial = true\n main.about = about\n for (const v of [...df.decls]) {\n v.scope = main\n main.decls.push(v)\n }\n df.decls = []\n if (eqs.some(eq => [eq.target, ...refsOf(eq.expr)].some(r => r.v.declKind === 'reference'))) {\n expansion.ctx.report({\n severity: 'info', code: 'unsupported', related: about ? [about] : undefined,\n message: 'The guide\\'s simulator cannot run chart instances in a dataflow region that calls methods yet',\n hint: 'KIELER translates such a region differently (its \"OO\" mode), keeping the instances as objects. The official KIELER tools can run this chart.',\n })\n return\n }\n let group: object | undefined\n let priority = 0\n let lastSequential = false\n for (const eq of eqs) {\n if (eq.sequential && !lastSequential) {\n group = {}\n priority = 0\n }\n const action = createAction(main, df.ext.once ? 'entry' : 'during')\n action.delay = 'immediate'\n action.about = about\n const schedule = (eq.sequential || lastSequential) && group ? [{ group, priority: priority++ }] : undefined\n action.effects.push({ k: 'assign', ref: eq.target, op: eq.op, expr: eq.expr, o: { by: about, span: eq.span, schedule } })\n lastSequential = eq.sequential\n }\n parent.regions.splice(parent.regions.indexOf(df), 1)\n}\n\nfunction refsOf(e: CExpr): CRef[] {\n const out: CRef[] = []\n const visit = (x: CExpr) => {\n if (x.k === 'ref') { out.push(x); x.idx.forEach(visit) }\n else if (x.k === 'op') x.args.forEach(visit)\n else if (x.k === 'vector') x.values.forEach(visit)\n else if (x.k === 'call') x.args.forEach(visit)\n }\n visit(e)\n return out\n}\n\nfunction processRegion(df: CRegion, expansion: Expansion) {\n const eqsAll = (df.ext.eqs as CEquation[] | undefined) ?? []\n if (!df.ext.forCounter && !eqsAll.some(eq => eq.call) && callsMethod(eqsAll)) {\n processRegionOO(df, expansion, eqsAll)\n return\n }\n const parent = df.parent\n const about = df.origin ?? df.about\n const region = createControlflowRegion(parent, `${PREFIX}${df.name ?? 'null'}`)\n region.about = about\n const main = createState(region, `${PREFIX}main`)\n main.initial = true\n main.about = about\n if (df.ext.once) {\n const done = createState(region, `${PREFIX}done`)\n done.final = true\n done.about = about\n createTransitionTo(main, done).preemption = 'termination'\n }\n for (const v of [...df.decls]) {\n v.scope = region\n region.decls.push(v)\n }\n df.decls = []\n\n const eqs = (df.ext.eqs as CEquation[] | undefined) ?? []\n const counter = df.ext.forCounter as CVar | undefined\n if (counter) {\n // The Dataflow processor ignores the for-loop: the equations keep references to a counter that is gone (S-24).\n expansion.ctx.report({\n severity: 'error', code: 'dataflow-for', span: counter.span, related: about ? [about] : undefined,\n message: 'A dataflow region cannot be a for-region',\n kieler: `The valued object reference points to a valued object (${counter.name}) that is not contained in the model!\\nReferences objects are not contained in the resource!`,\n hint: `KIELER turns the dataflow region into control flow without copying it, so \\`${counter.name}\\` is unknown in its equations. Write the equations for each value (O[0] = I[0], O[1] = I[1], ...), or use a control-flow for-region.`,\n })\n return\n }\n for (const eq of eqs) {\n if (eq.call) {\n expansion.ctx.report({\n severity: 'info', code: 'unsupported', span: eq.span, related: about ? [about] : undefined,\n message: 'The guide\\'s simulator cannot run dataflow reference calls (A(x, y)) yet',\n hint: 'Write one equation per input instead: g.A = x. The official KIELER tools can run this chart as written.',\n })\n return\n }\n }\n\n // Chart instances used in the equations, in order of first use.\n const instances: CVar[] = []\n for (const eq of eqs) {\n for (const r of assignmentRefs(eq)) {\n if (r.v.declKind === 'reference' && r.v.instance && !instances.includes(r.v)) instances.push(r.v)\n }\n }\n const locals = new Map<CVar, Map<string, CVar>>()\n instances.forEach((g, i) => {\n const chart = expansion.findChart(g.instance!.target)\n const r = createControlflowRegion(main, `${PREFIX}refRegion_${i}`)\n r.about = g.decl\n const refState = createState(r, `${PREFIX}${i}`)\n refState.initial = true\n refState.about = g.decl\n const wait = createState(r, `${PREFIX}d${i}`)\n wait.about = g.decl\n createTransitionTo(refState, wait).preemption = 'termination'\n createTransitionTo(wait, refState)\n const args: CArg[] = [...g.instance!.args]\n const own = new Map<string, CVar>()\n // Local versions of the instance's interface (inputs and outputs, in declaration order).\n for (const d of chart ? interfaceOf(chart) : []) {\n const local = new CVar(`${PREFIX}${g.name}_${d.name}`, d.type)\n local.signal = d.signal\n local.generated = true\n local.dims = d.dims\n local.display = `${g.name}.${d.name}`\n local.decl = g.decl\n local.span = g.span\n const scope = g.scope ?? main\n local.scope = scope\n scope.decls.push(local)\n own.set(d.name, local)\n args.push({ expr: ref(local) })\n }\n locals.set(g, own)\n const call: ReferenceCall = { target: g.instance!.target, args, span: g.span }\n refState.ext.call = call\n })\n\n // Equations: tuples into one equation per input (or array element), in written order.\n let group: object | undefined\n let priority = 0\n let lastSequential = false\n eqs.forEach((eq, k) => {\n const parts: { key: number; target: CRef; op: CEquation['op']; expr: CExpr }[] = []\n if (eq.expr.k === 'vector') {\n const values = [...eq.expr.values]\n const target = eq.target\n if (target.v.declKind === 'reference' && target.v.instance) {\n const chart = expansion.findChart(target.v.instance.target)\n let idx = 0\n for (const input of chart ? interfaceOf(chart).filter(d => d.input) : []) {\n if (values.length) {\n const value = values.shift()!\n if (value.k !== 'ignore') parts.push({ key: idx + k * 100, target: { k: 'ref', v: target.v, idx: [], sub: { k: 'ref', v: placeholder(input.name), idx: [] }, span: target.span }, op: eq.op, expr: value })\n }\n idx++\n }\n } else {\n values.forEach((value, idx) => {\n if (value.k !== 'ignore') parts.push({ key: idx + k * 100, target: { ...target, idx: [...target.idx, { k: 'lit', t: 'int', v: idx }] }, op: eq.op, expr: value })\n })\n }\n } else {\n parts.push({ key: k, target: eq.target, op: eq.op, expr: eq.expr })\n }\n if (eq.sequential && !lastSequential) {\n group = {}\n priority = 0\n }\n for (const part of parts) {\n const r = createControlflowRegion(main, `${PREFIX}subRegion_${part.key}`)\n r.about = about\n if ((eq.sequential || lastSequential) && group) r.ext.schedule = { group, priority: priority++, name: `seq` } satisfies Schedule\n const s = createState(r, `${PREFIX}${part.key}`)\n s.initial = true\n s.about = about\n const d = createState(r, `${PREFIX}d${part.key}`)\n d.about = about\n const t = createTransitionTo(s, d)\n t.delay = 'immediate'\n t.about = about\n const target = instanceRef(part.target, locals)\n const expr = instanceExpr(part.expr, locals)\n t.effects.push({ k: 'assign', ref: target, op: part.op, expr, o: { by: about, span: eq.span } })\n if (df.ext.once) d.final = true\n else createTransitionTo(d, s)\n }\n lastSequential = eq.sequential\n })\n\n // Remove the dataflow region and the instances' declarations.\n parent.regions.splice(parent.regions.indexOf(df), 1)\n for (const g of instances) {\n const scope = g.scope\n if (scope) scope.decls.splice(scope.decls.indexOf(g), 1)\n }\n}\n\n/** The interface of a chart as written: its inputs and outputs in declaration order. */\nfunction interfaceOf(chart: State): { name: string; type: CVar['type']; signal: boolean; input: boolean; dims: CExpr[] }[] {\n const out: { name: string; type: CVar['type']; signal: boolean; input: boolean; dims: CExpr[] }[] = []\n for (const d of chart.declarations) {\n if (d.declKind !== 'variable' || !(d.input || d.output)) continue\n for (const vo of d.valuedObjects) {\n out.push({\n name: vo.name, type: d.type ?? (d.signal ? 'pure' : 'host'), signal: d.signal, input: d.input,\n dims: vo.cardinalities.flatMap(c => (c.kind === 'int' ? [{ k: 'lit', t: 'int', v: c.value } as CExpr] : [])),\n })\n }\n }\n return out\n}\n\nconst placeholders = new Map<string, CVar>()\n/** A stand-in for a member of an instance (`g.A`) before it is replaced by the local `__df_g_A`. */\nfunction placeholder(name: string): CVar {\n let v = placeholders.get(name)\n if (!v) placeholders.set(name, (v = new CVar(name, 'host')))\n return v\n}\n\n/** The references of an equation: target first, then the expression's (KIELER's allAssignmentReferences). */\nfunction assignmentRefs(eq: CEquation): CRef[] {\n const out: CRef[] = [eq.target]\n const walk = (e: CExpr) => {\n if (e.k === 'ref') {\n out.push(e)\n e.idx.forEach(walk)\n } else if (e.k === 'op') e.args.forEach(walk)\n else if (e.k === 'vector') e.values.forEach(walk)\n else if (e.k === 'call') e.args.forEach(walk)\n }\n walk(eq.expr)\n return out\n}\n\n/** `g.X` becomes the local `__df_g_X`. */\nfunction instanceRef(r: CRef, locals: Map<CVar, Map<string, CVar>>): CRef {\n if (r.sub) {\n const local = locals.get(r.v)?.get(r.sub.v.name)\n if (local) return { k: 'ref', v: local, idx: r.sub.idx, span: r.span }\n }\n return { ...r, idx: r.idx.map(i => instanceExpr(i, locals)) }\n}\n\nfunction instanceExpr(e: CExpr, locals: Map<CVar, Map<string, CVar>>): CExpr {\n switch (e.k) {\n case 'ref': return instanceRef(e, locals)\n case 'op': return { ...e, args: e.args.map(a => instanceExpr(a, locals)) }\n case 'vector': return { ...e, values: e.values.map(a => instanceExpr(a, locals)) }\n case 'call': return { ...e, args: e.args.map(a => instanceExpr(a, locals)) }\n default: return e\n }\n}\n"]}
@@ -0,0 +1,2 @@
1
+ import type { Pass } from "./context.js";
2
+ export declare const deferred: Pass;