@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,919 @@
1
+ // Name resolution (linking) with KIELER's scoping rules (SCTXScopeProvider, KExtScopeProvider):
2
+ //
3
+ // - A valued object reference sees the declarations of every enclosing declaration scope, innermost first:
4
+ // code blocks and methods, then the state or region it is written in, then the enclosing regions and states up to
5
+ // the scchart. A transition is contained in its source state, so its trigger and effects also see the source
6
+ // state's own (inner) declarations. Within one scope the first declaration of a name wins; for regions the
7
+ // for-loop counter is visible too. Declaration order does not matter (`int a[N]` may come before `const int N`).
8
+ // - A call `f(x)` in an expression only sees methods and extern declarations.
9
+ // - `a.b`: b is looked up among the members of a's type (referenced chart, class, struct, enum).
10
+ // - A transition can only target a state of its source state's own region (including the source itself).
11
+ // - `state S is Other(...)`, `extends Base`, `ref Other x` name a root state of this file or of the other files
12
+ // given to compile().
13
+ //
14
+ // Sets Reference.decl, Transition.target, ScopeParameter.bindingDecl, and turns a valued emission `m(x)` of a
15
+ // method or reference into a call (KIELER's KEffectsEmissionReferenceCallConverter). Unresolved names become
16
+ // errors with KIELER's linking message in `kieler` and a beginner-oriented message and hint.
17
+ import { counterId } from "./ids.js";
18
+ import { referenceName } from "./parser.js";
19
+ const isCallable = (d) => !!d && (d.declKind === 'method' || (d.declKind === 'reference' && !!d.extern));
20
+ const isPublic = (d) => d.access === undefined || d.access === 'public';
21
+ const isPrivate = (d) => d.access === 'private' || (!isPublic(d) && d.access !== 'protected');
22
+ class Scope {
23
+ parent;
24
+ owner;
25
+ label;
26
+ names = new Map();
27
+ callables = new Map();
28
+ /** All callables per name, for overloads (methods differing in their number of parameters). */
29
+ overloads = new Map();
30
+ constructor(parent, owner, label) {
31
+ this.parent = parent;
32
+ this.owner = owner;
33
+ this.label = label;
34
+ }
35
+ add(vo, decl) {
36
+ if (!this.names.has(vo.name))
37
+ this.names.set(vo.name, vo);
38
+ if (isCallable(decl) && !this.callables.has(vo.name))
39
+ this.callables.set(vo.name, vo);
40
+ if (decl?.declKind === 'method') {
41
+ const list = this.overloads.get(vo.name) ?? [];
42
+ list.push({ vo, decl });
43
+ this.overloads.set(vo.name, list);
44
+ }
45
+ }
46
+ /** KIELER's overloading-aware scope: among methods of one name, the one with as many parameters as arguments. */
47
+ lookupCall(name, args) {
48
+ for (let s = this; s; s = s.parent) {
49
+ const list = s.overloads.get(name);
50
+ if (list && list.length > 1) {
51
+ const match = list.find(m => (m.decl.parameters?.length ?? 0) === args);
52
+ if (match)
53
+ return match.vo;
54
+ }
55
+ const vo = s.callables.get(name);
56
+ if (vo)
57
+ return vo;
58
+ }
59
+ return undefined;
60
+ }
61
+ lookup(name, callable = false) {
62
+ for (let s = this; s; s = s.parent) {
63
+ const vo = (callable ? s.callables : s.names).get(name);
64
+ if (vo)
65
+ return vo;
66
+ }
67
+ return undefined;
68
+ }
69
+ visible() {
70
+ const out = new Set();
71
+ for (let s = this; s; s = s.parent)
72
+ for (const n of s.names.keys())
73
+ out.add(n);
74
+ return [...out];
75
+ }
76
+ }
77
+ export function editDistance(a, b) {
78
+ const row = Array.from({ length: b.length + 1 }, (_, j) => j);
79
+ for (let i = 1; i <= a.length; i++) {
80
+ let prev = row[0];
81
+ row[0] = i;
82
+ for (let j = 1; j <= b.length; j++) {
83
+ const tmp = row[j];
84
+ row[j] = Math.min(row[j] + 1, row[j - 1] + 1, prev + (a[i - 1] === b[j - 1] ? 0 : 1));
85
+ prev = tmp;
86
+ }
87
+ }
88
+ return row[b.length];
89
+ }
90
+ export function closest(name, candidates) {
91
+ let best;
92
+ let bestD = Infinity;
93
+ for (const c of candidates) {
94
+ if (c === name)
95
+ continue;
96
+ const d = c.toLowerCase() === name.toLowerCase() ? 0.5 : editDistance(name, c);
97
+ if (d < bestD) {
98
+ bestD = d;
99
+ best = c;
100
+ }
101
+ }
102
+ const limit = name.length <= 3 ? 1 : name.length <= 6 ? 2 : 3;
103
+ return best !== undefined && bestD <= limit ? best : undefined;
104
+ }
105
+ export function resolveProgram(program, options = {}) {
106
+ return new Resolver(program, options).run();
107
+ }
108
+ class Resolver {
109
+ program;
110
+ diagnostics = [];
111
+ index;
112
+ /** Root states by name (first wins), this file first. */
113
+ chartsByName = new Map();
114
+ stateScopes = new Map();
115
+ /** All declared names per owner, for "declared elsewhere" hints. */
116
+ declaredIn = new Map();
117
+ /** Names declared too late in a state (State.lateDeclarations): where, for the hint. */
118
+ declaredLate = new Map();
119
+ constructor(program, options) {
120
+ this.program = program;
121
+ const charts = [...program.charts, ...(options.externalCharts ?? [])];
122
+ for (const c of charts)
123
+ if (!this.chartsByName.has(c.name))
124
+ this.chartsByName.set(c.name, c);
125
+ this.index = {
126
+ programs: [program], charts, vos: new Map(), states: new Map(), regions: new Map(), parentRegion: new Map(), parentState: new Map(),
127
+ targets: new Map(), incoming: new Map(), scopeTargets: new Map(), baseStates: new Map(), refTargets: new Map(), ambiguousStateAccess: new Set(),
128
+ };
129
+ }
130
+ run() {
131
+ // Pass 1: register structure, valued objects and the charts' base states (inherited declarations need them).
132
+ for (const chart of this.program.charts)
133
+ this.register(chart, undefined);
134
+ for (const chart of this.index.charts)
135
+ if (!this.program.charts.includes(chart))
136
+ this.register(chart, undefined, true);
137
+ for (const s of this.index.states.values())
138
+ this.resolveBaseStates(s);
139
+ // Pass 2: resolve everything in this file.
140
+ for (const chart of this.program.charts)
141
+ this.resolveState(chart, undefined);
142
+ return { index: this.index, diagnostics: this.diagnostics };
143
+ }
144
+ // ----- registration -----
145
+ register(state, parent, external = false) {
146
+ if (!external || !this.index.states.has(state.id))
147
+ this.index.states.set(state.id, state);
148
+ if (parent)
149
+ this.index.parentRegion.set(state, parent);
150
+ if (!this.index.incoming.has(state))
151
+ this.index.incoming.set(state, []);
152
+ this.registerDeclarations(state.declarations, state);
153
+ for (const d of state.lateDeclarations ?? [])
154
+ for (const vo of d.valuedObjects)
155
+ if (!this.declaredLate.has(vo.name))
156
+ this.declaredLate.set(vo.name, { owner: state, line: d.span.line });
157
+ for (const r of state.regions) {
158
+ this.index.regions.set(r.id, r);
159
+ this.index.parentState.set(r, state);
160
+ this.registerDeclarations(r.declarations, r);
161
+ if (r.forLoop) {
162
+ const vo = { kind: 'valuedObject', id: counterId(r), name: r.forLoop.variable, cardinalities: [], span: r.forLoop.span };
163
+ this.index.vos.set(vo.id, { vo, owner: r, counter: true });
164
+ }
165
+ for (const s of r.states)
166
+ this.register(s, r, external);
167
+ }
168
+ for (const p of state.policies ?? [])
169
+ this.registerPolicy(p, state);
170
+ }
171
+ registerPolicy(region, owner) {
172
+ this.index.regions.set(region.id, region);
173
+ if (owner)
174
+ this.index.parentState.set(region, owner);
175
+ this.registerDeclarations(region.declarations, region);
176
+ for (const s of region.states) {
177
+ this.index.states.set(s.id, s);
178
+ this.index.parentRegion.set(s, region);
179
+ this.index.incoming.set(s, []);
180
+ }
181
+ }
182
+ registerDeclarations(decls, owner, memberOf) {
183
+ for (const d of decls) {
184
+ for (const vo of d.valuedObjects) {
185
+ this.index.vos.set(vo.id, { vo, decl: d, owner, memberOf });
186
+ if (owner && !memberOf) {
187
+ const list = this.declaredIn.get(vo.name) ?? [];
188
+ list.push(owner);
189
+ this.declaredIn.set(vo.name, list);
190
+ }
191
+ }
192
+ if (d.members)
193
+ this.registerDeclarations(d.members, undefined, d);
194
+ for (const p of d.policies ?? [])
195
+ this.registerPolicy(p, undefined);
196
+ if (d.parameters)
197
+ this.registerDeclarations(d.parameters, undefined);
198
+ if (d.body)
199
+ this.registerBlock(d.body.declarations, d.body.statements);
200
+ }
201
+ }
202
+ registerBlock(decls, statements) {
203
+ this.registerDeclarations(decls, undefined);
204
+ for (const s of statements) {
205
+ if (s.kind === 'block' || s.kind === 'while')
206
+ this.registerBlock(s.declarations, s.statements);
207
+ else if (s.kind === 'if') {
208
+ this.registerBlock(s.declarations, s.statements);
209
+ if (s.else)
210
+ this.registerBlock(s.else.declarations, s.else.statements);
211
+ }
212
+ else if (s.kind === 'for') {
213
+ if (s.init && s.init.kind === 'declaration')
214
+ this.registerDeclarations([s.init], undefined);
215
+ this.registerBlock(s.declarations, s.statements);
216
+ }
217
+ }
218
+ }
219
+ resolveBaseStates(state) {
220
+ if (!state.baseStates?.length)
221
+ return;
222
+ const bases = [];
223
+ for (const b of state.baseStates) {
224
+ const target = this.chartsByName.get(b.target);
225
+ if (target) {
226
+ bases.push(target);
227
+ this.index.scopeTargets.set(b, target);
228
+ }
229
+ }
230
+ this.index.baseStates.set(state, bases);
231
+ }
232
+ /** All states a state inherits from (transitively, each once), KIELER's getAllInheritedStates. */
233
+ allInherited(state) {
234
+ const out = [];
235
+ const work = [...(this.index.baseStates.get(state) ?? [])].filter(s => s !== state);
236
+ while (work.length) {
237
+ const s = work.pop();
238
+ if (out.includes(s))
239
+ continue;
240
+ out.push(s);
241
+ for (const b of [...(this.index.baseStates.get(s) ?? [])].reverse())
242
+ if (b !== state && !out.includes(b) && !work.includes(b))
243
+ work.push(b);
244
+ }
245
+ return out;
246
+ }
247
+ // ----- diagnostics -----
248
+ unresolved(kind, name, span, message, hint, code, related, suggestion) {
249
+ this.diagnostics.push({
250
+ severity: 'error', code, message, hint, span,
251
+ kieler: `Couldn't resolve reference to ${kind} '${name}'.`,
252
+ ...(related?.length ? { related } : {}),
253
+ ...(suggestion ? { suggestion } : {}),
254
+ });
255
+ }
256
+ unknownVariable(ref, scope, callable, span = ref.span) {
257
+ const name = ref.name;
258
+ const nameSpan = { ...span, end: span.start + name.length, endLine: span.line, endCol: span.col + name.length };
259
+ if (callable) {
260
+ const plain = scope.lookup(name);
261
+ if (plain) {
262
+ this.unresolved('ValuedObject', name, nameSpan, `\`${name}\` cannot be called: it is not a method`, `Only methods and extern functions can be called with parentheses. To use the value of \`${name}\`, write it without \`( )\`.`, 'not-callable');
263
+ return;
264
+ }
265
+ }
266
+ const suggestion = closest(name, scope.visible());
267
+ const elsewhere = this.declaredIn.get(name);
268
+ const late = this.declaredLate.get(name);
269
+ let hint;
270
+ if (late) {
271
+ const where = late.owner.isRoot ? `scchart \`${late.owner.name}\`` : `state \`${late.owner.name}\``;
272
+ hint = `\`${name}\` is declared on line ${late.line}, after the states or actions of ${where}, where KIELER does not accept a declaration (so it does not exist). Move the declaration to the top of ${where}, before the first state.`;
273
+ }
274
+ else if (elsewhere?.length) {
275
+ const where = elsewhere[0];
276
+ const whereText = where.kind === 'state' ? `inside state ${where.name ? `\`${where.name}\`` : '(unnamed)'}` : `inside ${where.name ? `region \`${where.name}\`` : 'a region'}`;
277
+ hint = `\`${name}\` is declared ${whereText}, so it is only visible there. Declare it in a scope that contains every use, for example at the top of the scchart.`;
278
+ }
279
+ else if (suggestion) {
280
+ hint = suggestion.toLowerCase() === name.toLowerCase() ? `Did you mean \`${suggestion}\`? Names are case-sensitive.` : `Did you mean \`${suggestion}\`?`;
281
+ }
282
+ else {
283
+ hint = `Declare it before using it, for example \`input bool ${name}\` or \`int ${name} = 0\` at the top of the scchart.`;
284
+ }
285
+ this.unresolved('ValuedObject', name, nameSpan, suggestion && !elsewhere?.length ? `Unknown name \`${name}\` (did you mean \`${suggestion}\`?)` : `Unknown name \`${name}\``, hint, 'unknown-variable', undefined, suggestion && !elsewhere?.length ? suggestion : undefined);
286
+ }
287
+ // ----- states, regions -----
288
+ stateScope(state, parent) {
289
+ const scope = new Scope(parent, state, `state ${state.name}`);
290
+ for (const d of state.declarations)
291
+ for (const vo of d.valuedObjects)
292
+ scope.add(vo, d);
293
+ if (state.baseStates?.length) {
294
+ for (const base of this.allInherited(state)) {
295
+ for (const d of base.declarations)
296
+ if (!isPrivate(d))
297
+ for (const vo of d.valuedObjects)
298
+ scope.add(vo, d);
299
+ }
300
+ }
301
+ this.stateScopes.set(state, scope);
302
+ return scope;
303
+ }
304
+ resolveState(state, parent) {
305
+ const scope = this.stateScope(state, parent);
306
+ if (state.baseStates) {
307
+ for (const b of state.baseStates) {
308
+ const target = this.index.scopeTargets.get(b);
309
+ if (!target) {
310
+ this.unresolved('State', b.target, b.targetSpan ?? b.span, `There is no scchart called \`${b.target}\` to extend`, this.chartHint(b.target), 'unknown-chart');
311
+ for (const p of b.parameters)
312
+ this.resolveExpression(p.expression, scope);
313
+ }
314
+ else {
315
+ this.resolveScopeParameters(b, target, scope);
316
+ }
317
+ }
318
+ }
319
+ this.resolveDeclarations(state.declarations, scope);
320
+ for (const a of state.actions)
321
+ this.resolveAction(a, scope);
322
+ if (state.reference)
323
+ this.resolveScopeCall(state.reference, scope, state);
324
+ for (const r of state.regions)
325
+ this.resolveRegion(r, state, scope);
326
+ for (const p of state.policies ?? [])
327
+ this.resolvePolicy(p, scope);
328
+ }
329
+ /** A policy region: its transitions go to its own states; names are those of the region, the class and above. */
330
+ resolvePolicy(region, parent) {
331
+ const scope = new Scope(parent, region, `policy ${region.name ?? ''}`);
332
+ for (const d of region.declarations)
333
+ for (const vo of d.valuedObjects)
334
+ scope.add(vo, d);
335
+ this.resolveDeclarations(region.declarations, scope);
336
+ for (const s of region.states) {
337
+ this.stateScopes.set(s, scope);
338
+ for (const t of s.transitions)
339
+ this.resolveTransition(t, s, region);
340
+ }
341
+ }
342
+ chartHint(name) {
343
+ const s = closest(name, this.chartsByName.keys());
344
+ return s ? `Did you mean \`${s}\`?` : 'The referenced chart must be another scchart in this file or in an imported file (`import "File"`).';
345
+ }
346
+ resolveScopeCall(call, scope, state) {
347
+ if (call.super) {
348
+ // `is super.X` only in regions; on a state it refers to an inherited state (rare): leave it.
349
+ for (const p of call.parameters)
350
+ this.resolveExpression(p.expression, scope);
351
+ return;
352
+ }
353
+ const target = this.chartsByName.get(call.target);
354
+ if (!target) {
355
+ this.unresolved('NamedObject', call.target, call.targetSpan ?? call.span, `There is no scchart called \`${call.target}\``, this.chartHint(call.target), 'unknown-chart');
356
+ for (const p of call.parameters) {
357
+ this.resolveExpression(p.expression, scope);
358
+ if (p.binding !== undefined)
359
+ this.unresolved('ValuedObject', p.binding, p.bindingSpan ?? p.span, `Cannot bind \`${p.binding}\`: the referenced chart is unknown`, undefined, 'unknown-binding');
360
+ }
361
+ return;
362
+ }
363
+ if (target === state)
364
+ return;
365
+ this.index.scopeTargets.set(call, target);
366
+ this.resolveScopeParameters(call, target, scope);
367
+ }
368
+ /** Parameters of `is X(...)`, `extends X(...)` and `ref X x(...)`: expressions in the caller's scope, bindings in X's interface. */
369
+ resolveScopeParameters(call, target, scope) {
370
+ const io = new Map();
371
+ const addIO = (d) => {
372
+ if (d.input || d.output)
373
+ for (const vo of d.valuedObjects)
374
+ if (!io.has(vo.name))
375
+ io.set(vo.name, vo);
376
+ };
377
+ target.declarations.forEach(addIO);
378
+ for (const base of this.allInherited(target))
379
+ base.declarations.filter(d => !isPrivate(d)).forEach(addIO);
380
+ for (const p of call.parameters) {
381
+ this.resolveExpression(p.expression, scope);
382
+ if (p.binding !== undefined) {
383
+ const vo = io.get(p.binding);
384
+ if (vo)
385
+ p.bindingDecl = vo.id;
386
+ else {
387
+ const s = closest(p.binding, io.keys());
388
+ this.unresolved('ValuedObject', p.binding, p.bindingSpan ?? p.span, `\`${target.name}\` has no input or output called \`${p.binding}\``, s ? `Did you mean \`${s}\`? After \`to\` comes the name of an input or output of \`${target.name}\`.` : `After \`to\` comes the name of an input or output of \`${target.name}\`${io.size ? ` (${[...io.keys()].slice(0, 6).map(n => `\`${n}\``).join(', ')})` : ''}.`, 'unknown-binding');
389
+ }
390
+ }
391
+ }
392
+ }
393
+ resolveRegion(region, parentState, parentScope) {
394
+ const scope = new Scope(parentScope, region, region.name ? `region ${region.name}` : 'region');
395
+ for (const d of region.declarations)
396
+ for (const vo of d.valuedObjects)
397
+ scope.add(vo, d);
398
+ if (region.forLoop) {
399
+ const entry = this.index.vos.get(counterId(region));
400
+ if (entry)
401
+ scope.add(entry.vo, undefined);
402
+ this.resolveExpression(region.forLoop.from, scope);
403
+ if (region.forLoop.to)
404
+ this.resolveExpression(region.forLoop.to, scope);
405
+ }
406
+ if (region.reference) {
407
+ // `region R is X`: X names a region inherited by the next enclosing state that extends another chart
408
+ // (KIELER's nextSuperStateWithBaseStates.getAllVisibleInheritedRegions).
409
+ let holder = parentState;
410
+ while (holder && !holder.baseStates?.length) {
411
+ const r = this.index.parentRegion.get(holder);
412
+ holder = r ? this.index.parentState.get(r) : undefined;
413
+ }
414
+ const inherited = holder ? this.allInherited(holder).flatMap(s => s.regions) : [];
415
+ const target = inherited.find(r => r.name === region.reference.target);
416
+ if (!target) {
417
+ this.unresolved('NamedObject', region.reference.target, region.reference.targetSpan ?? region.reference.span, `There is no inherited region called \`${region.reference.target}\``, holder ? '`region R is X` names a region of a base chart (`extends`).' : '`region ... is X` refers to a region of a base chart; this chart does not extend another one.', 'unknown-region');
418
+ }
419
+ for (const p of region.reference.parameters)
420
+ this.resolveExpression(p.expression, scope);
421
+ }
422
+ this.resolveDeclarations(region.declarations, scope);
423
+ for (const a of region.actions)
424
+ this.resolveAction(a, scope);
425
+ for (const eq of region.equations)
426
+ this.resolveEquation(eq, scope);
427
+ for (const s of region.states) {
428
+ this.resolveState(s, scope);
429
+ }
430
+ // Transitions after all states of the region are known (targets may come later in the text).
431
+ for (const s of region.states)
432
+ for (const t of s.transitions)
433
+ this.resolveTransition(t, s, region);
434
+ }
435
+ resolveTransition(t, source, region) {
436
+ const scope = this.stateScopes.get(source);
437
+ const target = region.states.find(s => s.name === t.targetName && s.name !== '');
438
+ if (target) {
439
+ t.target = target.id;
440
+ this.index.targets.set(t, target);
441
+ this.index.incoming.get(target)?.push(t);
442
+ }
443
+ else if (t.targetName) {
444
+ const siblings = region.states.map(s => s.name).filter(Boolean);
445
+ const s = closest(t.targetName, siblings);
446
+ const elsewhere = [...this.index.states.values()].find(st => st.name === t.targetName && !st.isRoot);
447
+ let hint;
448
+ if (elsewhere) {
449
+ const er = this.index.parentRegion.get(elsewhere);
450
+ const ep = er ? this.index.parentState.get(er) : undefined;
451
+ hint = `\`${t.targetName}\` is in another region${ep ? ` (inside ${ep.isRoot ? `scchart \`${ep.name}\`` : `state \`${ep.name}\``})` : ''}. A transition can only go to a state of the same region as \`${source.name}\`; to leave a superstate, add a transition to the superstate itself.`;
452
+ }
453
+ else if (s) {
454
+ hint = s.toLowerCase() === t.targetName.toLowerCase() ? `Did you mean \`${s}\`? State names are case-sensitive.` : `Did you mean \`${s}\`?`;
455
+ }
456
+ else {
457
+ hint = `Add a state \`${t.targetName}\` to this region, or go to one of ${siblings.slice(0, 6).map(n => `\`${n}\``).join(', ')}.`;
458
+ }
459
+ this.unresolved('State', t.targetName, t.targetSpan, s && !elsewhere ? `There is no state \`${t.targetName}\` here (did you mean \`${s}\`?)` : `There is no state \`${t.targetName}\` in this region`, hint, 'unknown-state', [source.id, t.id], s && !elsewhere ? s : undefined);
460
+ }
461
+ if (t.trigger)
462
+ this.resolveExpression(t.trigger, scope);
463
+ this.resolveEffects(t.effects, scope);
464
+ }
465
+ resolveAction(a, scope) {
466
+ if (a.trigger)
467
+ this.resolveExpression(a.trigger, scope);
468
+ this.resolveEffects(a.effects, scope);
469
+ }
470
+ resolveEquation(eq, scope) {
471
+ if (eq.callArgs) {
472
+ this.resolveReference(eq.target, scope, { callable: !eq.target.sub, dataflow: true });
473
+ for (const a of eq.callArgs)
474
+ this.resolveExpression(a, scope, true);
475
+ if (eq.expression.kind !== 'call')
476
+ this.resolveExpression(eq.expression, scope, true);
477
+ return;
478
+ }
479
+ this.resolveReference(eq.target, scope, { dataflow: true });
480
+ this.resolveExpression(eq.expression, scope, true);
481
+ }
482
+ // ----- declarations -----
483
+ resolveDeclarations(decls, scope) {
484
+ for (const d of decls) {
485
+ for (const vo of d.valuedObjects) {
486
+ for (const c of vo.cardinalities)
487
+ this.resolveExpression(c, scope);
488
+ if (vo.initialValue)
489
+ this.resolveExpression(vo.initialValue, scope);
490
+ }
491
+ if (d.declKind === 'reference' && !d.extern && d.referenceTarget)
492
+ this.resolveRefDeclaration(d, scope);
493
+ if (d.declKind === 'primitive' && d.referenceTarget) {
494
+ // `primitive T x` refers to a primitive generic type parameter of the root state: <T is primitive>.
495
+ let root;
496
+ for (let s = scope; s; s = s.parent)
497
+ if (s.owner?.kind === 'state' && s.owner.isRoot)
498
+ root = s.owner;
499
+ const generic = root?.genericParameters?.map(g => /^\s*([A-Za-z_^][\w']*)\s*(?:is\s+(.*))?$/.exec(g)).find(m => m?.[1] === d.referenceTarget);
500
+ const kind = generic?.[2]?.trim();
501
+ if (!generic || !kind || !/^(primitive|pure|bool|int|float|string|clock|clock-time)$/.test(kind)) {
502
+ this.unresolved('EObject', d.referenceTarget, d.referenceSpan ?? d.span, `There is no primitive type parameter \`${d.referenceTarget}\``, `\`primitive ${d.referenceTarget} x\` needs a generic parameter of the chart declared as \`<${d.referenceTarget} is primitive>\`.`, 'unknown-type');
503
+ }
504
+ }
505
+ if (d.members) {
506
+ const classScope = new Scope(scope, undefined, `class ${d.className ?? ''}`);
507
+ for (const m of d.members)
508
+ for (const vo of m.valuedObjects)
509
+ classScope.add(vo, m);
510
+ this.resolveDeclarations(d.members, classScope);
511
+ for (const p of d.policies ?? [])
512
+ this.resolvePolicy(p, classScope);
513
+ }
514
+ if (d.declKind === 'method')
515
+ this.resolveMethod(d, scope);
516
+ }
517
+ }
518
+ resolveRefDeclaration(d, scope) {
519
+ let target;
520
+ if (d.referenceContainer) {
521
+ const container = this.chartsByName.get(d.referenceContainer);
522
+ if (!container) {
523
+ this.unresolved('EObject', d.referenceContainer, d.span, `There is no scchart called \`${d.referenceContainer}\``, this.chartHint(d.referenceContainer), 'unknown-chart');
524
+ return;
525
+ }
526
+ else {
527
+ target = this.findType(container, d.referenceTarget);
528
+ }
529
+ }
530
+ else {
531
+ target = this.chartsByName.get(d.referenceTarget) ?? this.findTypeInScopeChain(scope, d.referenceTarget);
532
+ }
533
+ if (!target) {
534
+ this.unresolved('EObject', d.referenceTarget, d.referenceSpan ?? d.span, `There is no scchart, class or enum called \`${d.referenceTarget}\``, this.chartHint(d.referenceTarget), 'unknown-chart');
535
+ return;
536
+ }
537
+ this.index.refTargets.set(d, target);
538
+ if (target.kind === 'state') {
539
+ for (const vo of d.valuedObjects)
540
+ if (vo.parameters)
541
+ this.resolveScopeParameters({ parameters: vo.parameters }, target, scope);
542
+ }
543
+ else {
544
+ for (const vo of d.valuedObjects)
545
+ for (const p of vo.parameters ?? [])
546
+ this.resolveExpression(p.expression, scope);
547
+ }
548
+ }
549
+ /** Class or enum declared in a chart (the enum's type name or the class's name). */
550
+ findType(chart, name) {
551
+ for (const d of [...chart.declarations, ...this.allInherited(chart).flatMap(s => s.declarations)]) {
552
+ if ((d.declKind === 'class' || d.declKind === 'struct' || d.declKind === 'enum') && (d.className === name || (d.declKind === 'enum' && d.valuedObjects[0]?.name === name)))
553
+ return d;
554
+ }
555
+ return undefined;
556
+ }
557
+ findTypeInScopeChain(scope, name) {
558
+ // KIELER looks in the root state's declarations (and inherited ones).
559
+ let root;
560
+ for (let s = scope; s; s = s.parent)
561
+ if (s.owner?.kind === 'state' && s.owner.isRoot)
562
+ root = s.owner;
563
+ return root ? this.findType(root, name) : undefined;
564
+ }
565
+ resolveMethod(d, scope) {
566
+ const methodScope = new Scope(scope, undefined, `method ${d.valuedObjects[0]?.name ?? ''}`);
567
+ for (const p of d.parameters ?? [])
568
+ for (const vo of p.valuedObjects)
569
+ methodScope.add(vo, p);
570
+ for (const p of d.parameters ?? [])
571
+ for (const vo of p.valuedObjects)
572
+ if (vo.initialValue)
573
+ this.resolveExpression(vo.initialValue, methodScope);
574
+ if (d.body)
575
+ this.resolveBlock(d.body.declarations, d.body.statements, methodScope);
576
+ }
577
+ /** `outer`: the labels of the enclosing blocks (a goto may jump to a label of an enclosing block, conformance
578
+ * structure/153). */
579
+ resolveBlock(decls, statements, parent, outer = new Set()) {
580
+ const scope = new Scope(parent, undefined, 'block');
581
+ for (const d of decls)
582
+ for (const vo of d.valuedObjects)
583
+ scope.add(vo, d);
584
+ this.resolveDeclarations(decls, scope);
585
+ const labels = new Set([...outer, ...statements.filter(s => s.kind === 'label').map(s => s.name)]);
586
+ for (const s of statements)
587
+ this.resolveStatement(s, scope, labels);
588
+ }
589
+ resolveStatement(s, scope, labels) {
590
+ switch (s.kind) {
591
+ case 'assign':
592
+ this.resolveReference(s.target, scope, {});
593
+ this.resolveExpression(s.expression, scope);
594
+ break;
595
+ case 'postfix':
596
+ this.resolveReference(s.target, scope, {});
597
+ break;
598
+ case 'call':
599
+ case 'print':
600
+ case 'randomize':
601
+ case 'hostcode':
602
+ this.resolveEffect(s, scope);
603
+ break;
604
+ case 'return':
605
+ this.resolveExpression(s.expression, scope);
606
+ break;
607
+ case 'expression':
608
+ this.resolveExpression(s.expression, scope);
609
+ break;
610
+ case 'goto':
611
+ if (!labels.has(s.target)) {
612
+ const end = s.span.end;
613
+ const span = { start: end - s.target.length, end, line: s.span.endLine, col: s.span.endCol - s.target.length, endLine: s.span.endLine, endCol: s.span.endCol };
614
+ this.diagnostics.push({ severity: 'error', code: 'unknown-label', span, message: `There is no label \`${s.target}\` in this block`, kieler: `Couldn't resolve reference to Label '${s.target}'.` });
615
+ }
616
+ break;
617
+ case 'label': break;
618
+ case 'block':
619
+ case 'while':
620
+ if (s.kind === 'while')
621
+ this.resolveExpression(s.condition, scope);
622
+ this.resolveBlock(s.declarations, s.statements, scope, labels);
623
+ break;
624
+ case 'if':
625
+ this.resolveExpression(s.condition, scope);
626
+ this.resolveBlock(s.declarations, s.statements, scope, labels);
627
+ if (s.else)
628
+ this.resolveBlock(s.else.declarations, s.else.statements, scope, labels);
629
+ break;
630
+ case 'for': {
631
+ const loopScope = new Scope(scope, undefined, 'for');
632
+ if (s.init?.kind === 'declaration') {
633
+ for (const vo of s.init.valuedObjects)
634
+ loopScope.add(vo, s.init);
635
+ this.resolveDeclarations([s.init], loopScope);
636
+ }
637
+ else if (s.init)
638
+ this.resolveStatement(s.init, loopScope, labels);
639
+ this.resolveExpression(s.condition, loopScope);
640
+ if (s.update)
641
+ this.resolveStatement(s.update, loopScope, labels);
642
+ this.resolveBlock(s.declarations, s.statements, loopScope, labels);
643
+ break;
644
+ }
645
+ }
646
+ }
647
+ // ----- effects -----
648
+ resolveEffects(effects, scope) {
649
+ for (let i = 0; i < effects.length; i++) {
650
+ const e = effects[i];
651
+ const converted = this.resolveEffect(e, scope);
652
+ if (converted)
653
+ effects[i] = converted;
654
+ }
655
+ }
656
+ /** Resolves an effect; returns a replacement when a valued emission is really a call. */
657
+ resolveEffect(e, scope) {
658
+ switch (e.kind) {
659
+ case 'assign':
660
+ this.resolveReference(e.target, scope, {});
661
+ this.resolveExpression(e.expression, scope);
662
+ return;
663
+ case 'postfix':
664
+ this.resolveReference(e.target, scope, {});
665
+ return;
666
+ case 'emit': {
667
+ this.resolveReference(e.target, scope, {});
668
+ if (e.value)
669
+ this.resolveExpression(e.value, scope);
670
+ if (e.value) {
671
+ const low = lowermost(e.target);
672
+ const entry = low.decl ? this.index.vos.get(low.decl) : undefined;
673
+ if (entry?.decl && (entry.decl.declKind === 'method' || entry.decl.declKind === 'reference')) {
674
+ // `c.add(10)` parsed as an emission is a call with one argument: resolve it again as one (overloads).
675
+ if (entry.decl.declKind === 'method')
676
+ this.resolveReference(e.target, scope, { callable: !e.target.sub, args: 1 });
677
+ const call = { kind: 'call', name: referenceName(e.target), args: [e.value], target: e.target, span: e.span };
678
+ if (e.annotations)
679
+ call.annotations = e.annotations;
680
+ return call;
681
+ }
682
+ }
683
+ return;
684
+ }
685
+ case 'call':
686
+ if (!e.extern && e.target)
687
+ this.resolveReference(e.target, scope, { callable: !e.target.sub, args: e.args.length, super: e.super && !e.target.sub });
688
+ for (const a of e.args)
689
+ this.resolveExpression(a, scope);
690
+ return;
691
+ case 'print':
692
+ case 'randomize':
693
+ for (const a of e.args)
694
+ this.resolveExpression(a, scope);
695
+ return;
696
+ case 'hostcode':
697
+ return;
698
+ case 'code':
699
+ this.resolveBlock(e.declarations ?? [], e.statements ?? [], scope);
700
+ return;
701
+ }
702
+ }
703
+ // ----- expressions and references -----
704
+ resolveExpression(e, scope, dataflow = false) {
705
+ switch (e.kind) {
706
+ case 'ref':
707
+ this.resolveReference(e, scope, { dataflow });
708
+ return;
709
+ case 'op':
710
+ for (const a of e.args)
711
+ this.resolveExpression(a, scope, dataflow);
712
+ return;
713
+ case 'call':
714
+ if (!e.extern && e.target)
715
+ this.resolveReference(e.target, scope, { callable: !e.target.sub, dataflow, args: e.args.length, super: e.super && !e.target.sub });
716
+ for (const a of e.args)
717
+ this.resolveExpression(a, scope, dataflow);
718
+ return;
719
+ case 'vector':
720
+ for (const v of e.values)
721
+ this.resolveExpression(v, scope, dataflow);
722
+ return;
723
+ case 'special':
724
+ if (e.access === 'state' && e.target) {
725
+ this.resolveStateAccess(e, scope);
726
+ return;
727
+ }
728
+ if (e.access === 'scchart' && e.target) {
729
+ const chart = this.chartsByName.get(e.target);
730
+ if (!chart) {
731
+ this.unresolved('NamedObject', e.target, e.span, `There is no scchart called \`${e.target}\``, this.chartHint(e.target), 'unknown-chart');
732
+ if (e.sub)
733
+ this.reportSubUnresolved(e.sub);
734
+ }
735
+ else if (e.sub) {
736
+ const members = new Map();
737
+ for (const d of chart.declarations) {
738
+ const global = (d.declKind === 'variable' && !d.input && isPublic(d) && d.const) || ((d.declKind === 'class' || d.declKind === 'struct' || d.declKind === 'enum') && isPublic(d));
739
+ if (global)
740
+ for (const vo of d.valuedObjects)
741
+ if (!members.has(vo.name))
742
+ members.set(vo.name, vo);
743
+ }
744
+ this.resolveInMembers(e.sub, members, scope, dataflow);
745
+ }
746
+ }
747
+ return;
748
+ default: return;
749
+ }
750
+ }
751
+ /** `state(S)` / `state(R.S)`: a state of the enclosing scope (SCTXScopeProvider.getScopeForSpecialAccess). */
752
+ resolveStateAccess(e, scope) {
753
+ let owner;
754
+ for (let s = scope; s && !owner; s = s.parent)
755
+ owner = s.owner;
756
+ const nameSpan = (name, after = 0) => {
757
+ const i = e.text.indexOf(name, after);
758
+ const start = e.span.start + Math.max(0, i);
759
+ return { start, end: start + name.length, line: e.span.line, col: e.span.col + Math.max(0, i), endLine: e.span.line, endCol: e.span.col + Math.max(0, i) + name.length };
760
+ };
761
+ let candidates = [];
762
+ if (e.container !== undefined) {
763
+ const region = owner?.kind === 'state' ? owner.regions.find(r => r.name === e.container) : undefined;
764
+ if (!region) {
765
+ this.unresolved('NamedObject', e.container, nameSpan(e.container, e.text.indexOf('(')), `There is no region \`${e.container}\` here`, undefined, 'unknown-region');
766
+ }
767
+ else if (region.regionType === 'controlflow')
768
+ candidates = region.states;
769
+ }
770
+ else if (owner?.kind === 'state') {
771
+ candidates = owner.regions.filter(r => r.regionType === 'controlflow' && !r.name).flatMap(r => r.states);
772
+ }
773
+ else if (owner?.kind === 'region' && owner.regionType === 'controlflow') {
774
+ candidates = owner.states;
775
+ }
776
+ if (e.container !== undefined && !candidates.length && !(owner?.kind === 'state' && owner.regions.some(r => r.name === e.container)))
777
+ return;
778
+ const target = candidates.find(s => s.name === e.target);
779
+ if (!target) {
780
+ const after = e.container !== undefined ? e.text.indexOf('.') : e.text.indexOf('(');
781
+ this.unresolved('NamedObject', e.target, nameSpan(e.target, after), `There is no state \`${e.target}\` here`, undefined, 'unknown-state');
782
+ }
783
+ else {
784
+ e.state = target.id;
785
+ if (e.container === undefined && owner?.kind === 'state' && candidates.filter(s => s.name === e.target).length > 1)
786
+ this.index.ambiguousStateAccess.add(e);
787
+ }
788
+ }
789
+ reportSubUnresolved(r) {
790
+ this.unresolved('ValuedObject', r.name, r.span, `Unknown member \`${r.name}\``, undefined, 'unknown-variable');
791
+ for (const i of r.indices)
792
+ void i;
793
+ if (r.sub)
794
+ this.reportSubUnresolved(r.sub);
795
+ }
796
+ /** `super.m(...)`: only methods inherited by the enclosing states (KIELER's scope for super calls). */
797
+ lookupSuper(name, scope) {
798
+ for (let s = scope; s; s = s.parent) {
799
+ if (s.owner?.kind !== 'state' || !s.owner.baseStates?.length)
800
+ continue;
801
+ for (const base of this.allInherited(s.owner)) {
802
+ for (const d of base.declarations)
803
+ if (d.declKind === 'method' && !isPrivate(d))
804
+ for (const vo of d.valuedObjects)
805
+ if (vo.name === name)
806
+ return vo;
807
+ }
808
+ }
809
+ return undefined;
810
+ }
811
+ resolveReference(ref, scope, opts) {
812
+ const vo = opts.super ? this.lookupSuper(ref.name, scope)
813
+ : opts.callable && opts.args !== undefined ? scope.lookupCall(ref.name, opts.args) : scope.lookup(ref.name, !!opts.callable);
814
+ for (const i of ref.indices)
815
+ this.resolveExpression(i, scope, opts.dataflow);
816
+ if (!vo) {
817
+ this.unknownVariable(ref, scope, !!opts.callable);
818
+ if (ref.sub)
819
+ this.reportSubUnresolved(ref.sub);
820
+ return;
821
+ }
822
+ ref.decl = vo.id;
823
+ if (ref.sub)
824
+ this.resolveSub(ref.sub, vo, scope, !!opts.dataflow, opts.args);
825
+ }
826
+ /** `args`: a call's number of arguments, for choosing among overloaded methods of the last member. */
827
+ resolveSub(sub, parentVO, scope, dataflow, args) {
828
+ const members = this.membersOf(parentVO, dataflow);
829
+ if (!members) {
830
+ const entry = this.index.vos.get(parentVO.id);
831
+ this.unresolved('ValuedObject', sub.name, sub.span, `\`${parentVO.name}\` has no members`, entry?.decl?.declKind === 'variable' ? `\`${parentVO.name}\` is a plain variable; \`.\` is only for referenced charts, classes, structs and enums.` : undefined, 'unknown-variable');
832
+ if (sub.sub)
833
+ this.reportSubUnresolved(sub.sub);
834
+ for (const i of sub.indices)
835
+ this.resolveExpression(i, scope, dataflow);
836
+ return;
837
+ }
838
+ this.resolveInMembers(sub, members, scope, dataflow, args, parentVO);
839
+ }
840
+ resolveInMembers(sub, members, scope, dataflow, args, parentVO) {
841
+ for (const i of sub.indices)
842
+ this.resolveExpression(i, scope, dataflow);
843
+ let vo = members.get(sub.name);
844
+ // Methods of one name differ in their number of parameters (KIELER's overloading, structure.md S-62).
845
+ if (vo && !sub.sub && args !== undefined && parentVO) {
846
+ const overload = this.memberMethods(parentVO).find(m => m.vo.name === sub.name && (m.decl.parameters?.length ?? 0) === args);
847
+ if (overload)
848
+ vo = overload.vo;
849
+ }
850
+ if (!vo) {
851
+ const s = closest(sub.name, members.keys());
852
+ this.unresolved('ValuedObject', sub.name, sub.span, `Unknown member \`${sub.name}\`${s ? ` (did you mean \`${s}\`?)` : ''}`, members.size ? `Available: ${[...members.keys()].slice(0, 8).map(n => `\`${n}\``).join(', ')}.` : undefined, 'unknown-variable', undefined, s);
853
+ if (sub.sub)
854
+ this.reportSubUnresolved(sub.sub);
855
+ return;
856
+ }
857
+ sub.decl = vo.id;
858
+ if (sub.sub)
859
+ this.resolveSub(sub.sub, vo, scope, dataflow, args);
860
+ }
861
+ /** The methods reachable as members of `vo` (a class or struct instance, or a referenced chart). */
862
+ memberMethods(vo) {
863
+ const d = this.index.vos.get(vo.id)?.decl;
864
+ if (!d)
865
+ return [];
866
+ const target = d.declKind === 'reference' && !d.extern ? this.index.refTargets.get(d) : d;
867
+ if (!target)
868
+ return [];
869
+ const decls = target.kind === 'declaration' ? target.members ?? [] : target.declarations;
870
+ return decls.filter(m => m.declKind === 'method').flatMap(m => m.valuedObjects.map(v => ({ vo: v, decl: m })));
871
+ }
872
+ /** Members visible through `vo.` (KExtScopeProvider.getScopeForReferencedDeclarationFromSubReference). */
873
+ membersOf(vo, dataflow) {
874
+ const entry = this.index.vos.get(vo.id);
875
+ const d = entry?.decl;
876
+ if (!d)
877
+ return undefined;
878
+ const out = new Map();
879
+ const add = (decl) => { for (const v of decl.valuedObjects)
880
+ if (!out.has(v.name))
881
+ out.set(v.name, v); };
882
+ const structMembers = (cls) => {
883
+ for (const m of cls.members ?? [])
884
+ if (isPublic(m))
885
+ add(m);
886
+ return out;
887
+ };
888
+ if (d.declKind === 'reference' && !d.extern) {
889
+ const target = this.index.refTargets.get(d);
890
+ if (!target)
891
+ return undefined;
892
+ if (target.kind === 'declaration')
893
+ return structMembers(target);
894
+ // A referenced chart: its methods, then its (public / input-output) declarations, then inherited ones.
895
+ for (const m of target.declarations)
896
+ if (m.declKind === 'method')
897
+ add(m);
898
+ for (const base of this.allInherited(target))
899
+ for (const m of base.declarations)
900
+ if (!isPrivate(m))
901
+ add(m);
902
+ for (const m of target.declarations) {
903
+ if (m.declKind !== 'variable' && m.declKind !== 'reference')
904
+ continue;
905
+ if (dataflow ? (m.input || m.output) : isPublic(m))
906
+ add(m);
907
+ }
908
+ return out;
909
+ }
910
+ if (d.declKind === 'class' || d.declKind === 'struct' || d.declKind === 'enum')
911
+ return structMembers(d);
912
+ return undefined;
913
+ }
914
+ }
915
+ /** The innermost reference of a chain `a.b.c` (c). */
916
+ export function lowermost(r) {
917
+ return r.sub ? lowermost(r.sub) : r;
918
+ }
919
+ //# sourceMappingURL=resolve.js.map