@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 @@
1
+ {"version":3,"file":"scg.js","sourceRoot":"","sources":["../../src/sim/scg.ts"],"names":[],"mappings":"AAAA,yGAAyG;AACzG,yGAAyG;AACzG,gFAAgF;AAChF,EAAE;AACF,gHAAgH;AAChH,qFAAqF;AACrF,yGAAyG;AACzG,mGAAmG;AACnG,yFAAyF;AACzF,EAAE;AACF,+GAA+G;AAC/G,iFAAiF;AACjF,EAAE;AACF,uEAAuE;AACvE,oGAAoG;AACpG,sDAAsD;AACtD,4GAA4G;AAC5G,oFAAoF;AACpF,2GAA2G;AAC3G,0GAA0G;AAC1G,4GAA4G;AAC5G,gHAAgH;AAChH,wFAAwF;AAIxF,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,+BAA+B,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,mBAAe;AAqGpI,yFAAyF;AACzF,MAAM,OAAO,GAAG,CAAC,CAAA;AACjB,+DAA+D;AAC/D,MAAM,IAAI,GAAG,GAAG,CAAA;AAEhB,SAAS,WAAW,CAAC,CAAM,EAAE,CAAM;IAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACjE,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAA;AAC9B,CAAC;AAED,6GAA6G;AAC7G,SAAS,QAAQ,CAAC,CAAU,EAAE,QAAgB;IAC1C,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;QAAE,OAAO,CAAC,CAAA;IAC5B,gFAAgF;IAChF,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAA;IAC3F,8GAA8G;IAC9G,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;QAAE,OAAO,CAAC,CAAA;IAClD,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACzD,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,YAAY,CAAC,CAAoB;IAC7C,OAAO,CAAC,EAAE,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;AACxF,CAAC;AAED,gHAAgH;AAChH,SAAS,OAAO,CAAC,CAAoB,EAAE,CAAoB;IACvD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IAC5B,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAC7B,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAM,CAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAM,CAAc,CAAC,CAAC,CAAA;QACzE,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAM,CAAc,CAAC,IAAI,CAAA;QACnD,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,MAAM,CAAC,GAAG,CAAa,CAAA;YACvB,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACtG,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACR,MAAM,CAAC,GAAG,CAAa,CAAA;YACvB,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5G,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,CAAa,CAAA;YACvB,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnG,CAAC;QACD,OAAO,CAAC,CAAC,OAAO,KAAK,CAAA;IACzB,CAAC;AACL,CAAC;AAED,MAAM,OAAO;IA6BkC;IA5BlC,KAAK,GAAY,EAAE,CAAA;IACnB,OAAO,GAAa,EAAE,CAAA;IACtB,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAA;IACrC,QAAQ,GAAoB,EAAE,CAAA;IACtB,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9C,iHAAiH;IAChG,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IAChD,kEAAkE;IACjD,IAAI,GAAG,IAAI,GAAG,EAAkE,CAAA;IACjG,2EAA2E;IAC1D,GAAG,GAAG,IAAI,GAAG,EAAe,CAAA;IAC5B,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAA;IAC/C,oEAAoE;IACnD,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;IAChD,gHAAgH;IAC/F,EAAE,GAAG,IAAI,GAAG,EAAoC,CAAA;IACjE,qEAAqE;IACpD,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAA;IAChE,6FAA6F;IAC5E,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpD,gDAAgD;IAC/B,OAAO,GAAG,IAAI,GAAG,EAAc,CAAA;IAChD,+GAA+G;IACtG,UAAU,GAAa,EAAE,CAAA;IAClC,gHAAgH;IAC/F,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExD,YAAY,IAAY,EAAmB,QAAgB;QAAhB,aAAQ,GAAR,QAAQ,CAAQ;QACvD,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,GAAQ,EAAE,EAAE;YAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;YACpB,kBAAkB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;gBACpC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,CAAA;gBACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;gBACpB,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YACvD,CAAC,CAAC,CAAA;QACN,CAAC,CAAA;QACD,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAChB,SAAS,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACrD,2GAA2G;QAC3G,wDAAwD;QACxD,IAAI,EAAE,GAAG,CAAC,CAAA;QACV,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE;YAC1B,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM;oBAAE,OAAO,CAAC,CAAC,CAAC,CAAA;YAC3E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACrD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;oBACpC,IAAI,CAAC,CAAC;wBAAE,OAAO,SAAS,CAAA;oBACxB,EAAE,IAAI,CAAC,CAAA;oBACP,OAAO,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;gBACjC,CAAC,CAAC,CAAC,CAAA;YACP,CAAC;QACL,CAAC,CAAA;QACD,OAAO,CAAC,IAAI,CAAC,CAAA;IACjB,CAAC;IAEO,MAAM,CAAC,CAAc;QACzB,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;IACxE,CAAC;IAED,qFAAqF;IACrF,MAAM,CAAC,CAAc;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACxB,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,WAAW,IAAI,CAAC,CAAC,UAAU,KAAK,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACrH,CAAC;IAED,qEAAqE;IACrE,YAAY,CAAC,CAAc;QACvB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IAChD,CAAC;IAED,IAAI,CAAC,IAAc,EAAE,MAAc,EAAE,KAAqB,EAAE,GAAQ;QAChE,MAAM,CAAC,GAAU,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAA;QAClE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;QACxB,OAAO,CAAC,CAAA;IACZ,CAAC;IAED,MAAM,CAAC,MAA0B,EAAE,MAA2B,EAAE,IAAuB;QACnF,MAAM,CAAC,GAAG;YACN,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SAC7G,CAAA;QACX,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;QACnD,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAClD,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAChD,OAAO,CAAC,CAAA;IACZ,CAAC;IAED,mHAAmH;IAC3G,IAAI,CAAC,GAAU,EAAE,IAAU,EAAE,EAAqB,EAAE,GAAQ,EAAE,MAAe;QACjF,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;QACd,IAAI,CAAC,EAAE;YAAE,OAAM;QACf,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACpC,MAAM,KAAK,GAAG,MAAM,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,IAAI,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAC1G,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;IAC7E,CAAC;IAEO,SAAS,CAAC,IAAW,EAAE,GAAQ;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CACpC;QAAA,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjC,CAAC;IAED,sEAAsE;IACtE,SAAS,CAAC,CAAS,EAAE,CAAS;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpC,IAAI,KAAK;YAAE,OAAO,KAAK,CAAA;QACvB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,wGAAwG;YACxG,wGAAwG;YACxG,uGAAuG;YACvG,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;YACtE,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBAC7C,OAAO,SAAS,CAAA;YACpB,CAAC;YACD,oFAAoF;YACpF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,+DAA+D,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;YAC7H,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YACnF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YACrD,OAAO,IAAI,CAAA;QACf,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,IAAI,+BAA+B,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC9E,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACtB,OAAO,CAAC,CAAC,IAAI,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjC,CAAC;IAED;;;;;OAKG;IACK,SAAS,CAAC,MAAe;QAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;QACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC3C,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAW,EAAE;YAC/C,IAAI,+BAA+B,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;YACpD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAA;YACvC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACnB,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,KAAK,aAAa;gBAAE,OAAO,KAAK,CAAA;YACvE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAA;YACxH,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;YAC5E,wGAAwG;YACxG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAA;QACpD,CAAC,CAAA;QACD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAA;IACrE,CAAC;IAEO,UAAU,CAAC,CAAS,EAAE,CAAS;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC9D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAA;QACjB,kBAAkB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;YACzC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;YAC1C,IAAI,CAAC,OAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACzB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAChC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;QAC7G,CAAC,CAAC,CAAA;QACF,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;QAC9D,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YAChB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QACjD,CAAC;aAAM,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,kGAAkG;YAClG,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;YAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;YACnE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;YAC/D,OAAO,CAAC,KAAK,GAAG,KAAK,CAAA;YACrB,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;YACvB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;YAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QAClD,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QACjD,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAEO,WAAW,CAAC,CAAS,EAAE,CAAS;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAO,CAAC,IAAI,CAAC,CAAA;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,2DAA2D;QAC3D,MAAM,EAAE,GAAG,GAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;QAEtD,6GAA6G;QAC7G,iHAAiH;QACjH,+GAA+G;QAC/G,oGAAoG;QACpG,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAA;QAC/D,IAAI,cAAc,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,cAAc,CAAC;YAAE,OAAO,SAAS,CAAA;QACzI,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,gGAAgG;YAChG,mBAAmB;YACnB,MAAM,GAAG,GAAG,EAAE,EAAE,CAAA;YAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YAClE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YAC9D,OAAO,CAAC,KAAK,GAAG,KAAK,CAAA;YACrB,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;YACvB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAC/B,OAAO,OAAO,CAAA;QAClB,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAA;QACjB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QACjB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;YACvG,oEAAoE;YACpE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YAChE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YAC5D,OAAO,CAAC,KAAK,GAAG,KAAK,CAAA;YACrB,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;YACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACrB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAClD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;YACxB,OAAO,OAAO,CAAA;QAClB,CAAC;QAED,yGAAyG;QACzG,mGAAmG;QACnG,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAA;QAC7D,MAAM,KAAK,GAA2C;YAClD,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;SAC9C,CAAA;QACD,qFAAqF;QACrF,yGAAyG;QACzG,oGAAoG;QACpG,mCAAmC;QACnC,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,OAAO,MAAM,GAAG,YAAY,CAAC,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;YACxD,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;YACtC,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAA;YAC3F,MAAM,WAAW,GAAG,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAA;YACzG,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;gBAAE,MAAK;YACtC,MAAM,EAAE,CAAA;QACZ,CAAC;QACD,iHAAiH;QACjH,2GAA2G;QAC3G,6GAA6G;QAC7G,2GAA2G;QAC3G,mGAAmG;QACnG,IAAI,UAA8B,CAAA;QAClC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE,CAAC;YAC5D,IAAI,EAAE,GAAW,CAAC,CAAA;YAClB,OAAO,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBACzB,IAAI,EAAE,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO;oBAAE,MAAK;gBACxF,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;gBACzB,IAAI,EAAE,CAAC,KAAK,KAAK,WAAW;oBAAE,MAAK;gBACnC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAA;gBACpB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;gBAC1C,MAAM,GAAG,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;gBACtC,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;gBACxC,IAAI,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC;oBAAE,MAAK;gBAC3B,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAA;gBACtF,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;gBACjH,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;oBAAE,MAAK;gBACtC,MAAM,EAAE,CAAA;gBACR,UAAU,GAAG,EAAE,CAAA;gBACf,EAAE,GAAG,EAAE,CAAA;YACX,CAAC;YACD,IAAI,UAAU;gBAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACjG,CAAC;QACD,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,GAAG,MAAM,CAAA;QACtC,MAAM,YAAY,GAAY,EAAE,CAAA;QAEhC,IAAI,KAAwB,CAAA;QAC5B,IAAI,KAAwB,CAAA;QAC5B,sFAAsF;QACtF,IAAI,MAAwD,CAAA;QAC5D,MAAM,QAAQ,GAAG,CAAC,CAAoB,EAAE,EAAE;YACtC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBACd,KAAK,GAAG,CAAC,CAAA;gBACT,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC7B,CAAC;QACL,CAAC,CAAA;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,KAAK,GAAG,KAAK,CAAA;QACjB,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YACrB,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC1B,MAAM,GAAG,GAAG,EAAE,EAAE,CAAA;gBAChB,EAAE,EAAE,CAAA,CAAC,2DAA2D;gBAChE,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;gBAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;gBAC9D,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;gBACnB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAA;gBACrB,IAAI,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAA;gBACjE,QAAQ,CAAC,KAAK,CAAC,CAAA;gBACf,MAAM,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAA;YAC3D,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;gBAChB,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;oBAC5B,oGAAoG;oBACpG,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC,CAAA;oBACtG,IAAI,MAAM,IAAI,MAAM;wBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAA;oBAC5E,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACT,CAAC;gBACD,UAAU,EAAE,CAAA;YAChB,CAAC;YACD,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA;YACjD,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;YACjB,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;gBACjG,IAAI,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAA;gBAChE,QAAQ,CAAC,IAAI,CAAC,CAAA;gBACd,IAAI,IAAI,CAAC,OAAO;oBAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;gBAC3D,MAAM,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,EAAE,CAAA;YAC7D,CAAC;iBAAM,CAAC;gBACJ,mEAAmE;gBACnE,uGAAuG;gBACvG,qGAAqG;gBACrG,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,CAAA;gBAC7B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC;oBAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;oBACnC,IAAI,MAAM;wBAAE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO;4BAAE,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM;gCAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;oBAClI,6DAA6D;oBAC7D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;oBAC3C,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;oBAC5B,2FAA2F;oBAC3F,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAA;oBACrE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;oBACxB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM;wBAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;oBACrE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;oBACzC,IAAI,KAAK,IAAI,MAAM,EAAE,IAAI,KAAK,MAAM;wBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;oBAChE,OAAO,MAAM,CAAA;gBACjB,CAAC;gBACD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;gBACpD,IAAI,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;;oBAC7E,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACxB,IAAI,IAAI,CAAC,OAAO;oBAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAA;gBAC/C,KAAK,GAAG,IAAI,CAAA;gBACZ,MAAK;YACT,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,MAAM,IAAI,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAA;QACpF,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACxB,OAAO,KAAK,CAAA;IAChB,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,CAAS,EAAE,CAAS;QACzC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,CAAA;QACjE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,CAAA;QAC3D,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,+BAA+B,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAA;QAChH,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,UAAU,KAAK,aAAa;YAAE,OAAO,CAAC,CAAC,GAAG,CAAA;QACvE,MAAM,IAAI,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAA;QACtC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,CAAA;QAClG,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACxF,OAAO,SAAS,CAAA;IACpB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAU,EAAE,IAAU,EAAE,EAAe,EAAE,CAAS,EAAE,GAAQ,EAAE,MAAW;QAC/E,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC1F,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAM;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IACrD,CAAC;IAED;;;;OAIG;IACK,SAAS,CAAC,EAAe,EAAE,CAAS,EAAE,MAAW,EAAE,OAA4B,EAAE,WAAgC;QACrH,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAA;QACxF,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC7B,IAAI,KAAK,EAAE,CAAC;YACR,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpC,IAAI,MAAM,EAAE,CAAC;gBACT,OAAO,EAAE,CAAC,MAAM,CAAC,CAAA;gBACjB,WAAW,EAAE,CAAC,MAAM,CAAC,CAAA;gBACrB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,WAAW,EAAE,CAAA;YACpD,CAAC;QACL,CAAC;QACD,IAAI,KAAwB,CAAA;QAC5B,IAAI,IAAuB,CAAA;QAC3B,IAAI,OAAO,GAAQ,MAAM,CAAA;QACzB,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAA;YAChF,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YAC3F,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAA;YAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,KAAK,GAAG,CAAC,CAAA;gBACT,IAAI,KAAK;oBAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;gBACnC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAA;gBACZ,WAAW,EAAE,CAAC,CAAC,CAAC,CAAA;YACpB,CAAC;YACD,IAAI,GAAG,CAAC,CAAA;YACR,IAAI,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAA;QAC5G,CAAC,CAAC,CAAA;QACF,IAAI,CAAC,IAAI,CAAC,IAAK,EAAE,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,CAAA;QAC1E,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,WAAW,EAAE,CAAA;IACnD,CAAC;IAED,wGAAwG;IACxG,MAAM;QACF,MAAM,GAAG,GAA+C,EAAE,CAAA;QAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAY,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAA;YACjC,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAU,EAAE,CAAC;gBACnD,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;gBACnB,IAAI,GAAG;oBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,CAAA;YAC3D,CAAC;YACD,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBACZ,GAAG,CAAC,OAAO,GAAG,EAAE,CAAA;gBAChB,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,OAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACvF,CAAC;QACL,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7C,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAC/G,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;QACtC,yEAAyE;QACzE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1J,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;QAC1C,OAAO,GAAG,CAAC,MAAM,CAAA;IACrB,CAAC;CACJ;AAED,2HAA2H;AAC3H,SAAS,UAAU,CAAC,CAAc;IAC9B,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;AAC/G,CAAC;AAED,0HAA0H;AAC1H,SAAS,UAAU,CAAC,CAAU,EAAE,CAAc;IAC1C,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;AAC7B,CAAC;AAED,8HAA8H;AAC9H,SAAS,kBAAkB,CAAC,CAAU,EAAE,EAAe,EAAE,EAAe;IACpE,OAAO,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC;QAC7E,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;AAClF,CAAC;AAED,8GAA8G;AAC9G,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,QAAQ,GAAG,CAAC;IAC/C,MAAM,CAAC,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IACrC,wGAAwG;IACxG,8GAA8G;IAC9G,wGAAwG;IACxG,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,IAAI,+BAA+B,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAC9E,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACZ,OAAO,EAAE,qBAAqB,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;gBAC3C,MAAM,EAAE,uGAAuG;aAClH,CAAC,CAAA;YACF,MAAK;QACT,CAAC;IACL,CAAC;IACD,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;IAC5D,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC3C,UAAU,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAA;IAC7B,4GAA4G;IAC5G,uGAAuG;IACvG,wGAAwG;IACxG,gGAAgG;IAChG,gHAAgH;IAChH,MAAM,MAAM,GAAG,CAAC,CAAoB,EAAc,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAA;IACjK,MAAM,OAAO,GAAG,CAAC,CAAoB,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;QAC7B,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACX,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;QACd,CAAC;QACD,OAAO,CAAC,CAAA;IACZ,CAAC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,SAAQ;QAC/E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAQ;QACxC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAA;QAClB,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAA;QACjB,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,UAAU,GAAG,MAAM,CAAA;QAC5C,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACnF,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,CAAA;IACxB,yCAAyC;IACzC,UAAU,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;IACtC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAA;AAC7J,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,UAAU,CAAC,CAAQ;IAC/B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAA;QAC/E,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,OAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;QAChD,KAAK,SAAS,CAAC,CAAC,OAAO,EAAE,CAAA;QACzB,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC1C,CAAC;AACL,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,aAAa,CAAC,CAAQ;IAClC,OAAO,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;AAC5D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,GAAQ;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyC,CAAA;IAC9D,MAAM,GAAG,GAAG,CAAC,IAAW,EAAE,EAAS,EAAE,GAAuB,EAAE,EAAE;QAC5D,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrB,IAAI,CAAC,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAC/B,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,QAAQ,EAAE,CAAC,CAAA;IAC1C,CAAC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAA;QACjB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACb,KAAK,MAAM;gBACP,IAAI,CAAC,CAAC,IAAI;oBAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;gBACrC,IAAI,CAAC,CAAC,IAAI;oBAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;gBACrC,MAAK;YACT,KAAK,MAAM;gBACP,CAAC,CAAC,OAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBAChE,MAAK;YACT,KAAK,SAAS;gBACV,MAAK;YACT;gBACI,IAAI,CAAC,CAAC,IAAI;oBAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;QAC7C,CAAC;IACL,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAA;IACnC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QACjD,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,CAAC,CAAA;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAQ;IAC7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAgB,CAAA;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAA;IAC/I,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;IAClD,MAAM,CAAC,GAAG,CAAC,CAAoB,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7D,MAAM,EAAE,GAAG,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAE,CAAA;QACxB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;QACpB,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QACtB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QACtB,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;QAC9B,IAAI,CAAC,CAAC,OAAO;YAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAA;IACzD,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5B,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,CAAA;QACrB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAE,CAAA;QACnB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAA;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,UAAU;QAAE,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAA;IAC/D,OAAO;QACH,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE;QACrM,GAAG;KACN,CAAA;AACL,CAAC","sourcesContent":["// The sequentially constructive graph (SCG) of the core chart: what KIELER's core chain (Trigger/Effect,\n// Surface/Depth: sccharts/processors/TriggerEffect.xtend, SurfaceDepth.xtend) and its SCG transformation\n// (sccharts/processors/scg/SCGTransformation.xtend) produce, built in one step.\n//\n// superstate fork -> one thread per control-flow region (entry ... exit) -> join -> termination target\n// final state the thread's exit (a final state without outgoing transitions)\n// simple state surface: the immediate transitions in priority order (conditionals), then a pause;\n// depth (next tick): all transitions in priority order, then back to the pause\n// transition one assignment node per effect, then the target state's first node\n//\n// Only nodes reachable from the root entry exist (KIELER's dead code removal). Every node knows the core state\n// and transition or action it implements, so everything maps back to the source.\n//\n// The graph also has KIELER's shape where later analyses depend on it:\n// - the effects Trigger/Effect moves into states of their own are one chain, shared by an immediate\n// transition's surface copy and its depth original;\n// - Surface/Depth's depth transition optimisation (DTO): when the last transitions are immediate, the depth\n// continues in the surface's conditionals for them instead of testing them again;\n// - every control flow has KIELER's creation rank (`seq`): the order of a node's incoming control flows in\n// KIELER's EMF model, which decides where its depth-first searches look first (the schizophrenia cure's\n// hasConcurrentDelay, propagateDelay). Flows are created state by state in region order (generated states\n// come after the written ones: first Trigger/Effect's, then Surface/Depth's), flows into final states move to\n// the region's exit afterwards (trimExitNodes), and later rewiring appends (scg.seq).\n\nimport type { Span } from '../types'\nimport type { CEffect, CExpr, CRegion, CState, CTransition } from './model'\nimport { allStates, controlflowRegions, controlflowRegionsContainStates, isImplicitlyImmediate, regionsMayTerminate } from './model'\n\nexport type NodeKind = 'entry' | 'exit' | 'assign' | 'cond' | 'fork' | 'join' | 'surface' | 'depth'\n\n/** Creation ranks of a node's outgoing control flows (fork: one per thread). */\nexport interface FlowSeq {\n next?: number\n then?: number\n else?: number\n threads?: number[]\n}\n\nexport interface SNode {\n id: number\n kind: NodeKind\n /** The innermost thread the node belongs to (a fork and its join belong to the parent thread). */\n thread: Thread\n next?: SNode\n then?: SNode\n else?: SNode\n /** fork: its threads in region order. */\n threads?: Thread[]\n /** fork -> join, join -> fork. */\n join?: SNode\n fork?: SNode\n /** surface -> depth, depth -> surface. */\n depth?: SNode\n surface?: SNode\n /** assign: the effect. */\n effect?: CEffect\n /** cond: the condition. */\n expr?: CExpr\n /** The core state this node implements part of. */\n state?: CState\n /** cond: the transition whose trigger it tests; assign: the transition whose effect it runs. */\n transition?: CTransition\n /** A schizophrenic surface copy made by the structural depth join (analysis.ts). */\n schizo?: SNode\n /** Copies keep a link to the node they copy. */\n copyOf?: SNode\n /** KIELER's creation rank of each outgoing control flow. */\n seq?: FlowSeq\n /** Position in KIELER's node list (SCGTransformation creates nodes state by state; copies come last). */\n gen?: number\n /** cond: KIELER also has an else flow to the then branch's node (the netlist's equal-branch defect). */\n sameElse?: boolean\n /** cond with `sameElse`: the node both branches reach in KIELER's graph, when the simulator's then branch first\n * passes marks KIELER has no nodes for (a referenced chart's transitions, scg.ts weightOf). */\n sameTarget?: SNode\n /** fork: KIELER's SEQUENTIAL_PREEMPTIVE fork of a state with abort regions (abortRegions.ts): its threads run\n * in order and finishing ones preempt later ones. */\n preemptive?: boolean\n /** join: a par-or join (`any`): it fires as soon as any of its threads finishes (abort regions). */\n any?: boolean\n /** fork: a preemptive fork whose join leads back to it within a tick (KIELER's thread reincarnation). */\n reincarnation?: boolean\n /**\n * assign, cond: a node of a method's (or code block's) body that KIELER's Methods processor copied into the\n * graph (structure/methods.ts inline), `name` as called. Its conditions are the body's `if` tests, not a check of\n * the transition the call is on. `jumpsBack`: a `goto` from this node to a label before it (the body loops within\n * the tick, which KIELER cannot schedule).\n */\n method?: { name: string; jumpsBack?: { label: string; span?: Span } }\n}\n\nexport interface Thread {\n id: number\n entry: SNode\n exit: SNode\n /** The region the thread runs (undefined for the root thread). */\n region?: CRegion\n /** The fork that starts the thread (undefined for the root thread). */\n fork?: SNode\n parent?: Thread\n depth: number\n /** A final region's thread (KIELER: exit.final). */\n final: boolean\n /** Position of the thread's entry in KIELER's node list (SCGTransformation creates nodes in region order). */\n rank: number\n}\n\nexport interface SCG {\n nodes: SNode[]\n threads: Thread[]\n root: Thread\n /** First node of each core state (as KIELER's state-to-node mapping). */\n stateNodes: Map<CState, SNode>\n /** Problems found while building (instantaneous loops through states without nodes, KIELER crashes). */\n problems: { message: string; states: CState[]; kieler?: string }[]\n /** The next free control-flow rank: rewiring a flow appends it to its new target's incoming flows. */\n seq: number\n /**\n * Transitions (tracker ids) of referenced charts that have no nodes: KIELER merges a state whose only transition is\n * immediate, untriggered and effectless into its target. The source-level configuration follows them on entry.\n */\n silentHops?: string[]\n}\n\ntype Key = number[]\ntype Slot = 'next' | 'then' | 'else'\n\n/** After the root's flows ([0, ...]): flows moved into region exits by trimExitNodes. */\nconst TRIMMED = 1\n/** A state's flows after those of its regions (the join's). */\nconst LAST = 1e9\n\nfunction compareKeys(a: Key, b: Key): number {\n const n = Math.min(a.length, b.length)\n for (let i = 0; i < n; i++) if (a[i] !== b[i]) return a[i] - b[i]\n return a.length - b.length\n}\n\n/** Number of KIELER effects an effect stands for: the TTS reset is one per transition, action marks none. */\nfunction weightOf(e: CEffect, ttsCount: number): number {\n if (e.k !== 'mark') return 1\n // Action marks and the preemption passes' tracker hooks are not KIELER effects.\n if (e.m.kind === 'action' || e.m.kind === 'enterRegions' || e.m.kind === 'resume') return 0\n // Transitions of a referenced chart's copy are not counted by Taken Transition Signaling (structure.md S-15).\n if (e.m.kind === 'take' && e.m.index < 0) return 0\n if (e.m.kind === 'ttsReset') return Math.max(1, ttsCount)\n return 1\n}\n\n/** A mark node that stands for no KIELER effect (KIELER's graph has no node for it, weightOf). */\nexport function noKielerNode(n: SNode | undefined): boolean {\n return n?.kind === 'assign' && n.effect?.k === 'mark' && weightOf(n.effect, 1) === 0\n}\n\n/** KIELER's equals2 (KExpressionsCompareExtensions): structural for operators, references and literals only. */\nfunction equals2(a: CExpr | undefined, b: CExpr | undefined): boolean {\n if (!a || !b) return a === b\n if (a.k !== b.k) return false\n switch (a.k) {\n case 'lit': return a.t === (b as typeof a).t && a.v === (b as typeof a).v\n case 'host': return a.text === (b as typeof a).text\n case 'ref': {\n const o = b as typeof a\n return a.v === o.v && a.idx.length === o.idx.length && a.idx.every((x, i) => equals2(x, o.idx[i]))\n }\n case 'op': {\n const o = b as typeof a\n return a.op === o.op && a.args.length === o.args.length && a.args.every((x, i) => equals2(x, o.args[i]))\n }\n case 'vector': {\n const o = b as typeof a\n return a.values.length === o.values.length && a.values.every((x, i) => equals2(x, o.values[i]))\n }\n default: return false\n }\n}\n\nclass Builder {\n readonly nodes: SNode[] = []\n readonly threads: Thread[] = []\n readonly stateNodes = new Map<CState, SNode>()\n readonly problems: SCG['problems'] = []\n private readonly resolving = new Set<CState>()\n /** States being merged into the target of their silent transition (simpleState), and the silent cycles found. */\n private readonly silentMerging = new Set<CState>()\n private readonly silentCycle = new Set<CState>()\n /** Creation keys of the flows (converted to ranks at the end). */\n private readonly keys = new Map<SNode, { next?: Key; then?: Key; else?: Key; threads?: Key[] }>()\n /** Position of every state and region in KIELER's SCG connection order. */\n private readonly pos = new Map<CState, Key>()\n private readonly rpos = new Map<CRegion, Key>()\n /** Pre-order index (Surface/Depth handles states in this order). */\n private readonly pre = new Map<CState, number>()\n /** Trigger/Effect: per transition it splits, the key of the state each effect ends in (undefined: no state). */\n private readonly te = new Map<CTransition, (Key | undefined)[]>()\n /** Shared effect chains of the transitions Trigger/Effect splits. */\n private readonly teChains = new Map<CTransition, SNode | null>()\n /** The final state a state's node is (final states, and states that only pass on to one). */\n private readonly finalOf = new Map<CState, CState>()\n /** Node creation keys in KIELER's node list. */\n private readonly genKeys = new Map<SNode, Key>()\n /** Transitions of referenced charts that KIELER's optimisations remove (the tracker follows them on entry). */\n readonly silentHops: string[] = []\n /** States a depth was redirected into by DTO across states (one more incoming transition in KIELER's model). */\n private readonly dtoIncoming = new Map<CState, number>()\n\n constructor(root: CState, private readonly ttsCount: number) {\n const visit = (s: CState, key: Key) => {\n this.pos.set(s, key)\n controlflowRegions(s).forEach((r, ri) => {\n const rk = [...key, ri]\n this.rpos.set(r, rk)\n r.states.forEach((x, i) => visit(x, [...rk, 0, i]))\n })\n }\n visit(root, [0])\n allStates(root).forEach((s, i) => this.pre.set(s, i))\n // Trigger/Effect handles the transitions in containment order (a state's inner transitions before its own)\n // and appends each effect state to the target's region.\n let te = 0\n const visitTE = (s: CState) => {\n for (const r of controlflowRegions(s)) for (const x of r.states) visitTE(x)\n for (const t of s.out) {\n if (!this.splits(t)) continue\n const region = this.rpos.get(t.target.parent!) ?? [0]\n this.te.set(t, t.effects.map(e => {\n const w = weightOf(e, this.ttsCount)\n if (!w) return undefined\n te += w\n return [...region, 1, te - 1]\n }))\n }\n }\n visitTE(root)\n }\n\n private weight(t: CTransition): number {\n return t.effects.reduce((n, e) => n + weightOf(e, this.ttsCount), 0)\n }\n\n /** TriggerEffect: does it move the transition's effects into states of their own? */\n splits(t: CTransition): boolean {\n const w = this.weight(t)\n return ((t.trigger !== undefined || t.delay !== 'immediate' || t.preemption === 'termination') && w > 0) || w > 1\n }\n\n /** After Trigger/Effect, does the transition still carry effects? */\n keepsEffects(t: CTransition): boolean {\n return !this.splits(t) && this.weight(t) > 0\n }\n\n node(kind: NodeKind, thread: Thread, extra: Partial<SNode>, gen: Key): SNode {\n const n: SNode = { id: this.nodes.length, kind, thread, ...extra }\n this.nodes.push(n)\n this.genKeys.set(n, gen)\n return n\n }\n\n thread(parent: Thread | undefined, region: CRegion | undefined, fork: SNode | undefined): Thread {\n const t = {\n id: this.threads.length, region, fork, parent, depth: parent ? parent.depth + 1 : 0, final: !!region?.final, rank: 0,\n } as Thread\n this.threads.push(t)\n const R = region ? this.rpos.get(region) ?? [] : []\n t.entry = this.node('entry', t, {}, [...R, -1, 0])\n t.exit = this.node('exit', t, {}, [...R, -1, 1])\n return t\n }\n\n /** Sets a control flow. `target`: the state it leads to (a flow into a final state moves to the region's exit). */\n private link(src: SNode, slot: Slot, to: SNode | undefined, key: Key, target?: CState) {\n src[slot] = to\n if (!to) return\n let k = this.keys.get(src)\n if (!k) this.keys.set(src, (k = {}))\n const final = target && to.kind === 'exit' && to === to.thread.exit ? this.finalOf.get(target) : undefined\n k[slot] = final ? [TRIMMED, ...(this.pos.get(final) ?? []), ...key] : key\n }\n\n private threadKey(fork: SNode, key: Key) {\n let k = this.keys.get(fork)\n if (!k) this.keys.set(fork, (k = {}))\n ;(k.threads ??= []).push(key)\n }\n\n /** The first node of state `s` in thread `t` (built on first use). */\n stateNode(s: CState, t: Thread): SNode | undefined {\n const known = this.stateNodes.get(s)\n if (known) return known\n if (this.resolving.has(s)) {\n // A cycle of states merged into the targets of their silent transitions (a referenced chart's immediate\n // transitions without trigger have no KIELER effects): Surface/Depth merges them into one state with an\n // untriggered self-loop, which it then drops (simpleState). The states have no node, as for that loop.\n const path = [...this.resolving].slice([...this.resolving].indexOf(s))\n if (path.every(x => this.silentMerging.has(x))) {\n for (const x of path) this.silentCycle.add(x)\n return undefined\n }\n // A cycle of immediate transitions without trigger and effects: no node in between.\n this.problems.push({ message: 'instantaneous loop of transitions without trigger and effects', states: [...this.resolving] })\n const loop = this.node('assign', t, { state: s }, [...(this.pos.get(s) ?? [0]), 0])\n this.stateNodes.set(s, loop)\n this.link(loop, 'next', loop, this.pos.get(s) ?? [0])\n return loop\n }\n if (s.root || controlflowRegionsContainStates(s)) return this.superstate(s, t)\n if (s.final && s.out.length === 0) {\n this.stateNodes.set(s, t.exit)\n this.finalOf.set(s, s)\n return t.exit\n }\n return this.simpleState(s, t)\n }\n\n /**\n * The state a region starts in: SCGTransformation takes the first initial state of the region after\n * Surface/Depth. A region has several only after Deferred copied an initial state (passes/deferred.ts: like\n * EcoreUtil.copy, the copy keeps the flag); Surface/Depth's superfluous immediate transition optimisation then\n * replaces a simple state whose first transition is delayed by its `_Pause` state, at the end of the region.\n */\n private initialOf(region: CRegion): CState | undefined {\n const initials = region.states.filter(x => x.initial)\n if (initials.length < 2) return initials[0]\n const movedBySurfaceDepth = (s: CState): boolean => {\n if (controlflowRegionsContainStates(s)) return false\n if (s.out.length === 0) return !s.final\n const t0 = s.out[0]\n if (s.out.length === 1 && t0.preemption === 'termination') return false\n if (s.out.length === 1 && t0.trigger === undefined && !isImplicitlyImmediate(t0) && !this.keepsEffects(t0)) return false\n if (s.out.length > 1 && conditionalPattern(this, t0, s.out[1])) return false\n // Immediate transitions are duplicated to the front and keep the state; it is merged only without them.\n return !s.out.some(x => x.delay === 'immediate')\n }\n return initials.find(x => !movedBySurfaceDepth(x)) ?? initials[0]\n }\n\n private superstate(s: CState, t: Thread): SNode {\n const P = this.pos.get(s) ?? [0]\n const fork = this.node('fork', t, { state: s }, [...P, -1, 0])\n const join = this.node('join', t, { state: s }, [...P, -1, 1])\n fork.join = join\n join.fork = fork\n this.stateNodes.set(s, fork)\n fork.threads = []\n controlflowRegions(s).forEach((region, ri) => {\n const R = this.rpos.get(region) ?? [...P, ri]\n const child = this.thread(t, region, fork)\n fork.threads!.push(child)\n this.threadKey(fork, [...R, -3])\n this.link(child.exit, 'next', join, [...R, -2])\n const initial = this.initialOf(region)\n this.link(child.entry, 'next', initial ? this.stateNode(initial, child) : undefined, [...R, -1], initial)\n })\n if (s.out.length > 0) {\n this.chainFrom(join, 'next', s.out[0], t, [...P, LAST], P)\n } else if (s.root) {\n this.link(join, 'next', t.exit, [...P, LAST])\n } else if (!s.final && regionsMayTerminate(s)) {\n // Surface/Depth: a halt superstate that may terminate continues in __sd_HaltState (a pause loop).\n const halt = [...(this.rpos.get(s.parent!) ?? P), 2, this.pre.get(s) ?? 0, 0]\n const surface = this.node('surface', t, { state: s }, [...halt, 0])\n const depth = this.node('depth', t, { state: s }, [...halt, 1])\n surface.depth = depth\n depth.surface = surface\n this.link(depth, 'next', surface, [...halt, 0])\n this.link(join, 'next', surface, [...P, LAST])\n } else {\n this.link(join, 'next', t.exit, [...P, LAST])\n }\n return fork\n }\n\n private simpleState(s: CState, t: Thread): SNode | undefined {\n const P = this.pos.get(s) ?? [0]\n const R = this.rpos.get(s.parent!) ?? P\n const preIndex = this.pre.get(s) ?? 0\n let generated = 0\n /** The next state Surface/Depth creates for this state. */\n const sd = (): Key => [...R, 2, preIndex, generated++]\n\n // The first immediate transition is an untriggered self-loop with no KIELER effects (in a referenced chart):\n // Surface/Depth's clean-ups (superfluous conditional states, then superfluous immediate transitions) drop it and\n // the transitions after it. The state is left without transitions, so KIELER's SCG has no node for it: control\n // that reaches it ends there (the thread neither pauses nor exits, and its join treats it as done).\n const firstImmediate = s.out.find(x => x.delay === 'immediate')\n if (firstImmediate && firstImmediate.target === s && firstImmediate.trigger === undefined && silentTake(firstImmediate)) return undefined\n if (s.out.length === 0) {\n // A halt state: KIELER adds a delayed self-loop; after Surface/Depth's clean-ups its pause is a\n // generated state.\n const key = sd()\n const surface = this.node('surface', t, { state: s }, [...key, 0])\n const depth = this.node('depth', t, { state: s }, [...key, 1])\n surface.depth = depth\n depth.surface = surface\n this.link(depth, 'next', surface, [...key, 0])\n this.stateNodes.set(s, surface)\n return surface\n }\n const out = s.out\n const t0 = out[0]\n if (out.length === 1 && t0.trigger === undefined && !isImplicitlyImmediate(t0) && !this.keepsEffects(t0)) {\n // Surface/Depth leaves a plain pause alone: the state is the pause.\n const surface = this.node('surface', t, { state: s }, [...P, 0])\n const depth = this.node('depth', t, { state: s }, [...P, 1])\n surface.depth = depth\n depth.surface = surface\n this.stateNodes.set(s, surface)\n this.resolving.add(s)\n this.chainFrom(depth, 'next', t0, t, [...P, 0], P)\n this.resolving.delete(s)\n return surface\n }\n\n // Surface/Depth: the immediate transitions are copied to the front (they are the surface); the originals\n // count as delayed, so the pause comes before them and the depth checks every transition in order.\n const surfaceItems = out.filter(x => x.delay === 'immediate')\n const order: { t: CTransition; surface: boolean }[] = [\n ...surfaceItems.map(x => ({ t: x, surface: true })),\n ...out.map(x => ({ t: x, surface: false })),\n ]\n // DTO: the depth's last transitions continue in the surface's conditionals for them.\n // Pairs are compared from the back (the surface's last conditional with the depth's last one) while they\n // have the same target and equal triggers; the comparison stops at the state itself, whose incoming\n // transitions come from elsewhere.\n let merged = 0\n while (merged < surfaceItems.length && merged < out.length) {\n const a = surfaceItems[surfaceItems.length - 1 - merged]\n const b = out[out.length - 1 - merged]\n const sameTarget = a === b || (!this.splits(a) && !this.splits(b) && a.target === b.target)\n const sameTrigger = (a.trigger === undefined && b.trigger === undefined) || equals2(a.trigger, b.trigger)\n if (!sameTarget || !sameTrigger) break\n merged++\n }\n // KIELER's DTO does not stop at the state: when the state has exactly one incoming transition, an immediate one,\n // it goes on comparing the depth's next transition (from the back) with the first other transition of that\n // transition's source, and merges them too: the depth then continues in the predecessor (SurfaceDepth.xtend,\n // the loop over stateAfterDepth). This happens with the connector the Abort transformation puts before the\n // target of a superstate's join: the depth re-runs the connector, and its transition counts again.\n let continueAt: CState | undefined\n if (surfaceItems.length > 0 && merged === surfaceItems.length) {\n let at: CState = s\n while (merged < out.length) {\n if (at.incoming.length !== 1 || (this.dtoIncoming.get(at) ?? 0) > 0 || at.initial) break\n const t1 = at.incoming[0]\n if (t1.delay !== 'immediate') break\n const k1 = t1.source\n const k1Out = this.untransformedOut(k1, s)\n const tk1 = k1Out?.find(x => x !== t1)\n const tk2 = out[out.length - 1 - merged]\n if (!tk1 || k1 === s) break\n const sameTarget = !this.splits(tk1) && !this.splits(tk2) && tk1.target === tk2.target\n const sameTrigger = (tk1.trigger === undefined && tk2.trigger === undefined) || equals2(tk1.trigger, tk2.trigger)\n if (!sameTarget || !sameTrigger) break\n merged++\n continueAt = k1\n at = k1\n }\n if (continueAt) this.dtoIncoming.set(continueAt, (this.dtoIncoming.get(continueAt) ?? 0) + 1)\n }\n const depthCount = out.length - merged\n const surfaceFirst: SNode[] = []\n\n let first: SNode | undefined\n let pause: SNode | undefined\n /** Where the next node of the chain is attached (its flow's source, slot and key). */\n let attach: { src: SNode; slot: Slot; key: Key } | undefined\n const register = (n: SNode | undefined) => {\n if (!first && n) {\n first = n\n this.stateNodes.set(s, n)\n }\n }\n this.resolving.add(s)\n let ended = false\n let depthIndex = 0\n for (let i = 0; i < order.length; i++) {\n const item = order[i]\n if (!item.surface && !pause) {\n const key = sd()\n sd() // _Depth (merged into the next state by the optimisations)\n pause = this.node('surface', t, { state: s }, [...key, 0])\n const depth = this.node('depth', t, { state: s }, [...key, 1])\n pause.depth = depth\n depth.surface = pause\n if (attach) this.link(attach.src, attach.slot, pause, attach.key)\n register(pause)\n attach = { src: depth, slot: 'next', key: [...key, 0] }\n }\n if (!item.surface) {\n if (depthIndex === depthCount) {\n // Merged by DTO: continue in the surface's conditional for this transition (or in the predecessor).\n const target = continueAt ? this.stateNode(continueAt, t) : surfaceFirst[surfaceItems.length - merged]\n if (attach && target) this.link(attach.src, attach.slot, target, attach.key)\n ended = true\n break\n }\n depthIndex++\n }\n const holder = i === 0 && item.surface ? P : sd()\n const tr = item.t\n if (tr.trigger !== undefined) {\n const cond = this.node('cond', t, { state: s, transition: tr, expr: tr.trigger }, [...holder, 0])\n if (attach) this.link(attach.src, attach.slot, cond, attach.key)\n register(cond)\n if (item.surface) surfaceFirst.push(cond)\n this.chainFrom(cond, 'then', tr, t, [...holder, 0], holder)\n attach = { src: cond, slot: 'else', key: [...holder, 1] }\n } else {\n // Untriggered: always taken; the rest of the chain is unreachable.\n // A referenced chart's transitions are effectless in KIELER (their take marks are not KIELER effects):\n // Surface/Depth's superfluous immediate transition optimisation merges such a state into its target.\n const silent = silentTake(tr)\n if (!first && (!tr.effects.length || silent)) {\n const hops = this.silentHops.length\n if (silent) for (const e of tr.effects) if (e.k === 'mark' && e.m.kind === 'take') this.silentHops.push(e.m.key ?? e.m.transition)\n // The state has no node of its own: it is its target's node.\n this.silentMerging.add(s)\n const target = this.stateNode(tr.target, t)\n this.silentMerging.delete(s)\n // In a silent cycle the region stays in the state it entered (the tracker follows no hop).\n if (!target && this.silentCycle.has(s)) this.silentHops.length = hops\n this.resolving.delete(s)\n if (!this.stateNodes.has(s) && target) this.stateNodes.set(s, target)\n const final = this.finalOf.get(tr.target)\n if (final && target?.kind === 'exit') this.finalOf.set(s, final)\n return target\n }\n const head = this.chainHead(tr, t, holder, register)\n if (attach) this.link(attach.src, attach.slot, head.node, attach.key, head.target)\n else register(head.node)\n if (item.surface) surfaceFirst.push(head.node!)\n ended = true\n break\n }\n }\n if (!ended && attach && pause) this.link(attach.src, attach.slot, pause, attach.key)\n this.resolving.delete(s)\n return first\n }\n\n /**\n * The outgoing transitions KIELER's DTO sees on state `k` while it transforms `s`: those of the chart if Surface/Depth\n * has not transformed `k` yet (it comes later in pre-order) or leaves it alone; undefined if it rewrote `k` (its\n * other transitions then lead into Surface/Depth's own states, which no transition of `s` targets).\n */\n private untransformedOut(k: CState, s: CState): CTransition[] | undefined {\n if ((this.pre.get(k) ?? 0) > (this.pre.get(s) ?? 0)) return k.out\n if (k.root || (k.out.length === 0 && k.final)) return k.out\n if (k.out.length === 0) return controlflowRegionsContainStates(k) && !regionsMayTerminate(k) ? k.out : undefined\n const t0 = k.out[0]\n if (k.out.length === 1 && t0.preemption === 'termination') return k.out\n const imm0 = isImplicitlyImmediate(t0)\n if (k.out.length === 1 && t0.trigger === undefined && imm0 === this.keepsEffects(t0)) return k.out\n if (k.out.length > 1 && conditionalPattern(this, t0, k.out[1])) return k.out.slice(0, 2)\n return undefined\n }\n\n /**\n * The nodes of a transition, linked from `src`: one assignment per effect (Trigger/Effect), then the target\n * state's first node. `holder` is the state that keeps the transition's effects when Trigger/Effect does not\n * move them.\n */\n chainFrom(src: SNode, slot: Slot, tr: CTransition, t: Thread, key: Key, holder: Key) {\n const head = this.chainHead(tr, t, holder, undefined, (n) => this.link(src, slot, n, key))\n if (head.attached) return\n this.link(src, slot, head.node, key, head.target)\n }\n\n /**\n * Builds the transition's chain and returns its first node (`target`: the state it is, when the transition has\n * no effects). `onFirst` hears about the first effect node before the target is built, so recursion through\n * the target finds the state resolved; `attachFirst` links it (then `attached` is true).\n */\n private chainHead(tr: CTransition, t: Thread, holder: Key, onFirst?: (n: SNode) => void, attachFirst?: (n: SNode) => void): { node: SNode | undefined; target?: CState; attached?: boolean } {\n if (!tr.effects.length) return { node: this.stateNode(tr.target, t), target: tr.target }\n const split = this.te.get(tr)\n if (split) {\n const shared = this.teChains.get(tr)\n if (shared) {\n onFirst?.(shared)\n attachFirst?.(shared)\n return { node: shared, attached: !!attachFirst }\n }\n }\n let first: SNode | undefined\n let last: SNode | undefined\n let lastKey: Key = holder\n tr.effects.forEach((effect, i) => {\n const own = split ? split.slice(i).find(k => k !== undefined) ?? holder : holder\n const n = this.node('assign', t, { state: tr.source, transition: tr, effect }, [...own, 0])\n if (last) this.link(last, 'next', n, lastKey)\n if (!first) {\n first = n\n if (split) this.teChains.set(tr, n)\n onFirst?.(n)\n attachFirst?.(n)\n }\n last = n\n if (weightOf(effect, this.ttsCount) > 0) lastKey = split ? [...(split[i] ?? holder), 0] : [...holder, 0]\n })\n this.link(last!, 'next', this.stateNode(tr.target, t), lastKey, tr.target)\n return { node: first, attached: !!attachFirst }\n }\n\n /** Converts the creation keys to ranks (the order of every node's incoming control flows in KIELER). */\n finish(): number {\n const all: { key: Key; set: (seq: number) => void }[] = []\n for (const [n, k] of this.keys) {\n const seq: FlowSeq = (n.seq = {})\n for (const slot of ['next', 'then', 'else'] as const) {\n const key = k[slot]\n if (key) all.push({ key, set: v => { seq[slot] = v } })\n }\n if (k.threads) {\n seq.threads = []\n k.threads.forEach((key, i) => all.push({ key, set: v => { seq.threads![i] = v } }))\n }\n }\n all.sort((a, b) => compareKeys(a.key, b.key))\n all.forEach((x, i) => x.set(i))\n const order = [...this.nodes].sort((a, b) => compareKeys(this.genKeys.get(a) ?? [], this.genKeys.get(b) ?? []))\n order.forEach((n, i) => { n.gen = i })\n // Threads in KIELER's node order (entries are created region by region).\n const ranked = [...this.threads].sort((a, b) => compareKeys(a.region ? this.rpos.get(a.region) ?? [] : [], b.region ? this.rpos.get(b.region) ?? [] : []))\n ranked.forEach((th, i) => { th.rank = i })\n return all.length\n }\n}\n\n/** A referenced chart's transition with no KIELER effects: only its take mark (index -1, not counted, scg.ts weightOf). */\nfunction silentTake(t: CTransition): boolean {\n return t.effects.length > 0 && t.effects.every(e => e.k === 'mark' && e.m.kind === 'take' && e.m.index < 0)\n}\n\n/** After Trigger/Effect: does the transition keep its effects (immediate, untriggered, not a termination, one effect)? */\nfunction effectless(b: Builder, t: CTransition): boolean {\n return !b.keepsEffects(t)\n}\n\n/** SurfaceDepth's \"conditional\" shape: an immediate triggered transition, then an immediate default, both without effects. */\nfunction conditionalPattern(b: Builder, t0: CTransition, t1: CTransition): boolean {\n return isImplicitlyImmediate(t0) && t0.trigger !== undefined && effectless(b, t0) &&\n isImplicitlyImmediate(t1) && t1.trigger === undefined && effectless(b, t1)\n}\n\n/** `ttsCount`: the number of transitions Taken Transition Signaling counts (its reset is one effect each). */\nexport function buildSCG(root: CState, ttsCount = 1): SCG {\n const b = new Builder(root, ttsCount)\n // Surface/Depth runs on every state (reachable or not) and recognises an already normalised conditional\n // (an immediate triggered transition, then an immediate default): it deletes the transitions after the second\n // by index while the list shrinks, so with four or more transitions KIELER throws (SurfaceDepth.xtend).\n for (const s of allStates(root)) {\n if (s.root || controlflowRegionsContainStates(s) || s.out.length < 4) continue\n if (conditionalPattern(b, s.out[0], s.out[1])) {\n b.problems.push({\n message: 'conditional-pattern', states: [s],\n kieler: 'org.eclipse.emf.common.util.BasicEList$BasicIndexOutOfBoundsException: index=3, size=3 (SurfaceDepth)',\n })\n break\n }\n }\n const rootThread = b.thread(undefined, undefined, undefined)\n const first = b.stateNode(root, rootThread)\n rootThread.entry.next = first\n // KIELER's netlist gives a conditional whose two branches lead to the same node the condition on both paths\n // (the guard becomes `(g && c) || (g && c)`): the else branch never passes control. This arises when a\n // generated state has a triggered and an untriggered transition to the same target without effects (the\n // watcher region of a superstate with several delayed strong aborts, the last without trigger).\n // Marks that are no KIELER effects (a referenced chart's transitions carry such take marks) are no nodes there.\n const silent = (x: SNode | undefined): x is SNode => x?.kind === 'assign' && x.effect?.k === 'mark' && weightOf(x.effect, ttsCount) === 0 && x.next !== undefined\n const through = (x: SNode | undefined) => {\n const seen = new Set<SNode>()\n while (silent(x) && !seen.has(x)) {\n seen.add(x)\n x = x.next\n }\n return x\n }\n for (const n of b.nodes) {\n if (n.kind !== 'cond' || n.then === undefined || n.else === undefined) continue\n const target = through(n.then)\n if (target !== through(n.else)) continue\n n.else = undefined\n n.sameElse = true\n if (target !== n.then) n.sameTarget = target\n b.problems.push({ message: 'same-branches', states: n.state ? [n.state] : [] })\n }\n const count = b.finish()\n // The root entry's flow is created last.\n rootThread.entry.seq = { next: count }\n return { nodes: b.nodes, threads: b.threads, root: rootThread, stateNodes: b.stateNodes, problems: b.problems, seq: count + 1, silentHops: b.silentHops }\n}\n\n/** Successors of a node within a tick (a surface ends the tick; its depth is reached in the next one). */\nexport function successors(n: SNode): SNode[] {\n switch (n.kind) {\n case 'cond': return [n.then, n.else].filter((x): x is SNode => x !== undefined)\n case 'fork': return n.threads!.map(t => t.entry)\n case 'surface': return []\n default: return n.next ? [n.next] : []\n }\n}\n\n/** Successors including the surface -> depth step (for reachability). */\nexport function allSuccessors(n: SNode): SNode[] {\n return n.kind === 'surface' ? [n.depth!] : successors(n)\n}\n\n/**\n * Control-flow predecessors in the order of KIELER's incoming control flows (a depth has none from its surface).\n * Flows without a rank (should not happen) come last.\n */\nexport function predecessors(scg: SCG): Map<SNode, SNode[]> {\n const lists = new Map<SNode, { from: SNode; seq: number }[]>()\n const add = (from: SNode, to: SNode, seq: number | undefined) => {\n let l = lists.get(to)\n if (!l) lists.set(to, (l = []))\n l.push({ from, seq: seq ?? Infinity })\n }\n for (const n of scg.nodes) {\n const seq = n.seq\n switch (n.kind) {\n case 'cond':\n if (n.then) add(n, n.then, seq?.then)\n if (n.else) add(n, n.else, seq?.else)\n break\n case 'fork':\n n.threads!.forEach((t, i) => add(n, t.entry, seq?.threads?.[i]))\n break\n case 'surface':\n break\n default:\n if (n.next) add(n, n.next, seq?.next)\n }\n }\n const m = new Map<SNode, SNode[]>()\n for (const [to, l] of lists) {\n if (l.length > 1) l.sort((a, b) => a.seq - b.seq)\n m.set(to, l.map(x => x.from))\n }\n return m\n}\n\n/**\n * A copy of the graph (nodes, threads, state mapping) that analyses can change independently; `map` takes an\n * original node to its copy.\n */\nexport function cloneSCG(scg: SCG): { scg: SCG; map: Map<SNode, SNode> } {\n const map = new Map<SNode, SNode>()\n const tmap = new Map<Thread, Thread>()\n for (const n of scg.nodes) map.set(n, { ...n, seq: n.seq ? { ...n.seq, threads: n.seq.threads ? [...n.seq.threads] : undefined } : undefined })\n for (const t of scg.threads) tmap.set(t, { ...t })\n const m = (n: SNode | undefined) => (n ? map.get(n) ?? n : n)\n const mt = (t: Thread | undefined) => (t ? tmap.get(t) ?? t : t)\n for (const c of map.values()) {\n c.thread = mt(c.thread)!\n c.next = m(c.next)\n c.then = m(c.then)\n c.else = m(c.else)\n c.join = m(c.join)\n c.fork = m(c.fork)\n c.depth = m(c.depth)\n c.surface = m(c.surface)\n c.schizo = m(c.schizo)\n c.copyOf = m(c.copyOf)\n c.sameTarget = m(c.sameTarget)\n if (c.threads) c.threads = c.threads.map(t => mt(t)!)\n }\n for (const c of tmap.values()) {\n c.entry = m(c.entry)!\n c.exit = m(c.exit)!\n c.fork = m(c.fork)\n c.parent = mt(c.parent)\n }\n const stateNodes = new Map<CState, SNode>()\n for (const [st, n] of scg.stateNodes) stateNodes.set(st, m(n)!)\n return {\n scg: { nodes: scg.nodes.map(n => map.get(n)!), threads: scg.threads.map(t => tmap.get(t)!), root: tmap.get(scg.root)!, stateNodes, problems: scg.problems, seq: scg.seq, silentHops: scg.silentHops },\n map,\n }\n}\n"]}
@@ -0,0 +1,4 @@
1
+ import type { Diagnostic } from "../types.js";
2
+ import { type CState } from "./model.js";
3
+ import type { SCG } from "./scg.js";
4
+ export declare function removeSuperfluousForks(scg: SCG, core: CState): Diagnostic[];
@@ -0,0 +1,264 @@
1
+ // KIELER's SCG clean-ups that run right after the SCG is built (sccharts.netlist.kico: str, then sfr):
2
+ //
3
+ // - Superfluous Thread Remover (scg/processors/optimizer/SuperfluousThreadRemover.xtend): a thread whose entry
4
+ // leads straight to its exit (a region that is just a final state) is removed; a fork left without threads is
5
+ // removed and its predecessors continue after the join.
6
+ // - Superfluous Fork Remover (scg/processors/optimizer/SuperfluousForkRemover.xtend): a superstate with a single
7
+ // region needs no fork and join, so control flow into the fork goes straight to the region's first node, and
8
+ // control flow into the region's exit goes straight to the join's successor.
9
+ //
10
+ // Everything later in KIELER's chain (thread analysis, loops, schizophrenia curing, synchronizers) sees the graph
11
+ // without these threads and forks, so the simulator does the same. Ported with the rerouting order (forks in the
12
+ // order KIELER created them, flows removed at the end) and the crashes (concurrency.md T-6, K-1):
13
+ // - a superstate below the root left without threads (its only region was just a final state): observed to
14
+ // crash KIELER ("The compiler failed during compilation setup."), the root does not;
15
+ // - a later single-region superstate with a named region that is only reachable through the join of a superstate
16
+ // removed before it: getThreadEntry finds no thread and `ancestorEntry.name` throws;
17
+ // - a single-region superstate whose region starts in a state without node, entered other than from a thread's
18
+ // entry: the flows into it are re-routed to nothing, and ThreadAnalyzer throws on them.
19
+ import { allStates, readableName } from "./model.js";
20
+ export function removeSuperfluousForks(scg, core) {
21
+ const out = [];
22
+ const flows = [];
23
+ const byTarget = new Map();
24
+ const own = new Map();
25
+ const place = (f, to) => {
26
+ if (f.to)
27
+ byTarget.get(f.to)?.delete(f);
28
+ f.to = to;
29
+ if (to) {
30
+ let set = byTarget.get(to);
31
+ if (!set)
32
+ byTarget.set(to, (set = new Set()));
33
+ set.add(f);
34
+ }
35
+ };
36
+ const retarget = (f, to) => {
37
+ place(f, to);
38
+ f.seq = scg.seq++;
39
+ };
40
+ const pending = [];
41
+ const add = (from, slot, to, seq) => {
42
+ if (!to)
43
+ return;
44
+ const f = { from, slot, to, seq: seq ?? Infinity };
45
+ pending.push(f);
46
+ let l = own.get(from);
47
+ if (!l)
48
+ own.set(from, (l = []));
49
+ l.push(f);
50
+ };
51
+ for (const n of scg.nodes) {
52
+ switch (n.kind) {
53
+ case 'cond':
54
+ add(n, 'then', n.then, n.seq?.then);
55
+ add(n, 'else', n.else, n.seq?.else);
56
+ break;
57
+ case 'fork':
58
+ n.threads.forEach((t, i) => add(n, i, t.entry, n.seq?.threads?.[i]));
59
+ break;
60
+ case 'surface': break;
61
+ default: add(n, 'next', n.next, n.seq?.next);
62
+ }
63
+ }
64
+ // Incoming flows in KIELER's order.
65
+ pending.sort((a, b) => a.seq - b.seq);
66
+ for (const f of pending) {
67
+ const to = f.to;
68
+ f.to = undefined;
69
+ place(f, to);
70
+ flows.push(f);
71
+ }
72
+ const incoming = (n) => [...(byTarget.get(n) ?? [])];
73
+ const flowOf = (n) => own.get(n)?.[0];
74
+ /** SCGThreadExtensions.getThreadEntry on the current flows. */
75
+ const threadEntry = (node) => {
76
+ const work = node.kind === 'join' ? incoming(node.fork) : incoming(node);
77
+ const marked = new Set();
78
+ const push = (list) => { for (const f of list)
79
+ if (!marked.has(f))
80
+ work.push(f); };
81
+ while (work.length) {
82
+ const f = work.shift();
83
+ if (marked.has(f))
84
+ continue;
85
+ marked.add(f);
86
+ const prev = f.from;
87
+ if (prev.kind === 'join')
88
+ push(incoming(prev.fork));
89
+ else if (prev.kind === 'entry')
90
+ return prev;
91
+ else if (prev.kind === 'depth')
92
+ push(incoming(prev.surface));
93
+ else
94
+ push(incoming(prev));
95
+ }
96
+ return undefined;
97
+ };
98
+ const crash = (fork, message, hint, kieler, also = []) => {
99
+ const state = fork.state?.origin ?? fork.state?.about;
100
+ const related = [...also, state].filter((x) => !!x);
101
+ out.push({ severity: 'error', code: 'kieler-crash', message, kieler, hint, related: related.length ? [...new Set(related)] : undefined });
102
+ };
103
+ // KIELER's node order: states in pre-order (SCGTransformation.transformSCGGenerateNodes).
104
+ const forks = allStates(core).map(s => scg.stateNodes.get(s)).filter((n) => n?.kind === 'fork');
105
+ const removedNodes = new Set();
106
+ const removedThreads = new Set();
107
+ // Superfluous Thread Remover.
108
+ const threadsLeft = new Map(forks.map(f => [f, [...f.threads]]));
109
+ // Entries in KIELER's node order.
110
+ for (const t of [...scg.threads].sort((a, b) => a.rank - b.rank)) {
111
+ if (!t.fork || flowOf(t.entry)?.to !== t.exit)
112
+ continue;
113
+ const fork = t.fork;
114
+ for (const f of incoming(t.entry))
115
+ retarget(f, undefined);
116
+ removedNodes.add(t.entry);
117
+ removedNodes.add(t.exit);
118
+ removedThreads.add(t);
119
+ const left = (threadsLeft.get(fork) ?? fork.threads).filter(x => x !== t);
120
+ threadsLeft.set(fork, left);
121
+ if (left.length === 0) {
122
+ if (!fork.state?.root) {
123
+ crash(fork, 'KIELER\'s compiler crashes on a superstate whose only region is just a final state', 'Give the region a state to start in before the final state, or remove the superstate.', 'The compiler failed during compilation setup. (after SuperfluousThreadRemover)');
124
+ return out;
125
+ }
126
+ const after = flowOf(fork.join)?.to;
127
+ for (const f of incoming(fork))
128
+ retarget(f, after);
129
+ removedNodes.add(fork);
130
+ removedNodes.add(fork.join);
131
+ }
132
+ }
133
+ for (const fork of forks)
134
+ fork.threads = threadsLeft.get(fork) ?? fork.threads;
135
+ for (const fork of forks) {
136
+ if (removedNodes.has(fork) || fork.threads.length !== 1)
137
+ continue;
138
+ const t = fork.threads[0];
139
+ const join = fork.join;
140
+ const ancestor = threadEntry(fork);
141
+ const entryTarget = flowOf(t.entry)?.to;
142
+ const forkIncoming = incoming(fork);
143
+ // The region starts in a state without node (a referenced chart's state whose first immediate transition goes
144
+ // back to it, scg.ts simpleState): KIELER's entry flow has no target, and the flows into the fork are re-routed
145
+ // to nothing. ThreadAnalyzer then walks the threads and throws on such a flow unless it is a thread's entry's.
146
+ if (!entryTarget && forkIncoming.some(f => f.from.kind !== 'entry')) {
147
+ const id = fork.state?.origin ?? fork.state?.about;
148
+ crash(fork, `KIELER's compiler crashes on this chart: a transition leads into ${fork.state?.name ? `\`${fork.state.name}\`` : 'a superstate'}, whose only region starts in a state without code`, 'In a referenced chart, KIELER drops a state whose first immediate transition goes back to it without a trigger (the transition has no take counter there), so that state has no code. Such a loop would not let the tick end anyway: give the transition a trigger, or make it delayed.', 'java.lang.NullPointerException in ThreadAnalyzer (SCGThreadExtensions.getAllThreadNodesAndThreads; the lab server reports: The compiler failed during compilation setup.)', id ? [id] : []);
149
+ return out;
150
+ }
151
+ for (const f of forkIncoming)
152
+ retarget(f, entryTarget);
153
+ const joinTarget = flowOf(join)?.to;
154
+ const exitIncoming = incoming(t.exit);
155
+ if (exitIncoming.length && !joinTarget) {
156
+ crash(fork, 'KIELER\'s compiler crashes on this superstate (its region ends, but nothing follows)', 'Add a transition after the superstate.', 'Cannot re-route join flows without next target. The SCG seems to be broken.');
157
+ return out;
158
+ }
159
+ for (const f of exitIncoming)
160
+ retarget(f, joinTarget);
161
+ if (t.region?.name && !ancestor) {
162
+ // The superstate before it: reached only through its join, which cannot fire.
163
+ const before = [];
164
+ const seen = new Set();
165
+ const back = forkIncoming.map(f => f.from);
166
+ while (back.length) {
167
+ const n = back.pop();
168
+ if (seen.has(n))
169
+ continue;
170
+ seen.add(n);
171
+ if (n.kind === 'join')
172
+ before.push(n.fork.state);
173
+ else if (n.kind === 'assign' || n.kind === 'cond')
174
+ back.push(...incoming(n).map(f => f.from));
175
+ }
176
+ const names = [...new Set(before.map(s => readableName(s)).filter(Boolean))];
177
+ crash(fork, `KIELER's compiler crashes on this chart: ${names.length ? names.map(n => `\`${n}\``).join(', ') : 'a superstate'} can never finish (a region without a final state), but its \`join to\` leads to a state with an entry action or a named region`, 'A `join to` waits for every region to reach a final state: add a final state to the superstate\'s region, or remove the `join to` transition.', 'java.lang.NullPointerException in SuperfluousForkRemover (the lab server reports: The compiler failed during compilation setup.)', before.map(s => s?.origin ?? s?.about));
178
+ return out;
179
+ }
180
+ for (const n of [fork, join, t.entry, t.exit])
181
+ removedNodes.add(n);
182
+ removedThreads.add(t);
183
+ }
184
+ if (!removedNodes.size)
185
+ return out;
186
+ // Write the flows back (flows of removed nodes vanish with them).
187
+ for (const n of scg.nodes) {
188
+ if (removedNodes.has(n))
189
+ continue;
190
+ if (n.kind === 'fork')
191
+ continue;
192
+ if (n.kind === 'cond') {
193
+ n.then = undefined;
194
+ n.else = undefined;
195
+ }
196
+ else if (n.kind !== 'surface') {
197
+ n.next = undefined;
198
+ }
199
+ }
200
+ for (const f of flows) {
201
+ if (removedNodes.has(f.from))
202
+ continue;
203
+ const n = f.from;
204
+ const seq = (n.seq ??= {});
205
+ if (f.slot === 'then') {
206
+ n.then = f.to;
207
+ seq.then = f.seq;
208
+ }
209
+ else if (f.slot === 'else') {
210
+ n.else = f.to;
211
+ seq.else = f.seq;
212
+ }
213
+ else if (f.slot === 'next') {
214
+ n.next = f.to;
215
+ seq.next = f.seq;
216
+ }
217
+ }
218
+ for (const n of scg.nodes) {
219
+ if (n.kind !== 'fork' || removedNodes.has(n))
220
+ continue;
221
+ const own_ = own.get(n) ?? [];
222
+ (n.seq ??= {}).threads = n.threads.map(th => own_.find(f => f.to === th.entry)?.seq ?? Infinity);
223
+ }
224
+ // Nodes of removed threads now belong to the enclosing thread.
225
+ const live = (t) => {
226
+ let x = t;
227
+ while (removedThreads.has(x))
228
+ x = x.parent;
229
+ return x;
230
+ };
231
+ for (const n of scg.nodes)
232
+ n.thread = live(n.thread);
233
+ for (const t of scg.threads) {
234
+ if (removedThreads.has(t))
235
+ continue;
236
+ if (t.parent)
237
+ t.parent = live(t.parent);
238
+ }
239
+ const depthOf = (t) => (t.parent ? depthOf(t.parent) + 1 : 0);
240
+ scg.threads = scg.threads.filter(t => !removedThreads.has(t));
241
+ for (const t of scg.threads)
242
+ t.depth = depthOf(t);
243
+ for (const [s, n] of scg.stateNodes) {
244
+ if (!removedNodes.has(n))
245
+ continue;
246
+ let target = n;
247
+ for (let guard = 0; target && removedNodes.has(target) && guard < 1000; guard++) {
248
+ if (target.kind === 'fork')
249
+ target = target.threads.length ? flowOf(target.threads[0].entry)?.to : flowOf(target.join)?.to;
250
+ else if (target.kind === 'entry' || target.kind === 'join' || target.kind === 'exit')
251
+ target = flowOf(target)?.to;
252
+ else
253
+ target = undefined;
254
+ }
255
+ if (target && !removedNodes.has(target))
256
+ scg.stateNodes.set(s, target);
257
+ else
258
+ scg.stateNodes.delete(s);
259
+ }
260
+ scg.nodes = scg.nodes.filter(n => !removedNodes.has(n));
261
+ scg.nodes.forEach((n, i) => { n.id = i; });
262
+ return out;
263
+ }
264
+ //# sourceMappingURL=sfr.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"sfr.js","sourceRoot":"","sources":["../../src/sim/sfr.ts"],"names":[],"mappings":"AAAA,uGAAuG;AACvG,EAAE;AACF,+GAA+G;AAC/G,gHAAgH;AAChH,0DAA0D;AAC1D,iHAAiH;AACjH,+GAA+G;AAC/G,+EAA+E;AAC/E,EAAE;AACF,kHAAkH;AAClH,iHAAiH;AACjH,kGAAkG;AAClG,2GAA2G;AAC3G,uFAAuF;AACvF,iHAAiH;AACjH,uFAAuF;AACvF,+GAA+G;AAC/G,0FAA0F;AAG1F,OAAO,EAAE,SAAS,EAAE,YAAY,EAAe,mBAAe;AAa9D,MAAM,UAAU,sBAAsB,CAAC,GAAQ,EAAE,IAAY;IACzD,MAAM,GAAG,GAAiB,EAAE,CAAA;IAC5B,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAiB,CAAA;IACpC,MAAM,KAAK,GAAG,CAAC,CAAO,EAAE,EAAqB,EAAE,EAAE;QAC7C,IAAI,CAAC,CAAC,EAAE;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAA;QACT,IAAI,EAAE,EAAE,CAAC;YACL,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAC1B,IAAI,CAAC,GAAG;gBAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YAC7C,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACd,CAAC;IACL,CAAC,CAAA;IACD,MAAM,QAAQ,GAAG,CAAC,CAAO,EAAE,EAAqB,EAAE,EAAE;QAChD,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACZ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAA;IACrB,CAAC,CAAA;IACD,MAAM,OAAO,GAAW,EAAE,CAAA;IAC1B,MAAM,GAAG,GAAG,CAAC,IAAW,EAAE,IAAU,EAAE,EAAqB,EAAE,GAAuB,EAAE,EAAE;QACpF,IAAI,CAAC,EAAE;YAAE,OAAM;QACf,MAAM,CAAC,GAAS,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,QAAQ,EAAE,CAAA;QACxD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrB,IAAI,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAC/B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACb,CAAC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACxB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACb,KAAK,MAAM;gBAAE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAK;YAC5F,KAAK,MAAM;gBAAE,CAAC,CAAC,OAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,MAAK;YACzF,KAAK,SAAS,CAAC,CAAC,MAAK;YACrB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAChD,CAAC;IACL,CAAC;IACD,oCAAoC;IACpC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;IACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAA;QACf,CAAC,CAAC,EAAE,GAAG,SAAS,CAAA;QAChB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACjB,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IAC3D,MAAM,MAAM,GAAG,CAAC,CAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAE5C,+DAA+D;IAC/D,MAAM,WAAW,GAAG,CAAC,IAAW,EAAqB,EAAE;QACnD,MAAM,IAAI,GAAW,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACjF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAA;QAC9B,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAE,GAAG,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAA;QACzF,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,EAAG,CAAA;YACvB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACb,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;YACnB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,CAAA;iBAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAA;iBACtC,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAQ,CAAC,CAAC,CAAA;;gBACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;QAC7B,CAAC;QACD,OAAO,SAAS,CAAA;IACpB,CAAC,CAAA;IAED,MAAM,KAAK,GAAG,CAAC,IAAW,EAAE,OAAe,EAAE,IAAY,EAAE,MAAc,EAAE,OAA+B,EAAE,EAAE,EAAE;QAC5G,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,KAAK,CAAA;QACrD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChE,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAA;IAC7I,CAAC,CAAA;IAED,0FAA0F;IAC1F,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAA;IAC3G,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IACrC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;IAExC,8BAA8B;IAC9B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IAClF,kCAAkC;IAClC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/D,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI;YAAE,SAAQ;QACvD,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;QACnB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QACzD,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;QACzB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACxB,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACrB,MAAM,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QAC1E,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,EAAE,oFAAoF,EAC5F,uFAAuF,EACvF,gFAAgF,CAAC,CAAA;gBACrF,OAAO,GAAG,CAAA;YACd,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAK,CAAC,EAAE,EAAE,CAAA;YACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC;gBAAE,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;YAClD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACtB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAK,CAAC,CAAA;QAChC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAA;IAE9E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAClE,MAAM,CAAC,GAAG,IAAI,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAK,CAAA;QACvB,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QAClC,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAA;QACvC,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;QACnC,8GAA8G;QAC9G,gHAAgH;QAChH,+GAA+G;QAC/G,IAAI,CAAC,WAAW,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,CAAC;YAClE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,KAAK,CAAA;YAClD,KAAK,CAAC,IAAI,EAAE,oEAAoE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,cAAc,oDAAoD,EAC5L,yRAAyR,EACzR,2KAA2K,EAC3K,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACnB,OAAO,GAAG,CAAA;QACd,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,YAAY;YAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,CAAA;QACtD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,CAAA;QACnC,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,EAAE,sFAAsF,EAC9F,wCAAwC,EAAE,6EAA6E,CAAC,CAAA;YAC5H,OAAO,GAAG,CAAA;QACd,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,YAAY;YAAE,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC,CAAA;QACrD,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,8EAA8E;YAC9E,MAAM,MAAM,GAA2B,EAAE,CAAA;YACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;YAC7B,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YAC1C,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAG,CAAA;gBACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACX,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAK,CAAC,KAAK,CAAC,CAAA;qBAC5C,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;YACjG,CAAC;YACD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YAC5E,KAAK,CAAC,IAAI,EAAE,4CAA4C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,iIAAiI,EAC1P,+IAA+I,EAC/I,kIAAkI,EAClI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;YAC3C,OAAO,GAAG,CAAA;QACd,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAClE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACzB,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,IAAI;QAAE,OAAO,GAAG,CAAA;IAElC,kEAAkE;IAClE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,SAAQ;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACpB,CAAC,CAAC,IAAI,GAAG,SAAS,CAAA;YAClB,CAAC,CAAC,IAAI,GAAG,SAAS,CAAA;QACtB,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC9B,CAAC,CAAC,IAAI,GAAG,SAAS,CAAA;QACtB,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAQ;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;QAChB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAA;QAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAA;QAAC,CAAC;aACrD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAA;QAAC,CAAC;aAC1D,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAA;QAAC,CAAC;IACnE,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QACtD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAC5B;QAAA,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,CAAA;IACtG,CAAC;IAED,+DAA+D;IAC/D,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,CAAC,GAAG,CAAC,CAAC,MAAO,CAAA;QAC3C,OAAO,CAAC,CAAA;IACZ,CAAC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IACpD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC1B,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,IAAI,CAAC,CAAC,MAAM;YAAE,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAC3C,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7E,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO;QAAE,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACjD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAQ;QAClC,IAAI,MAAM,GAAsB,CAAC,CAAA;QACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,MAAM,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC9E,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM;gBAAE,MAAM,GAAG,MAAM,CAAC,OAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,EAAE,EAAE,CAAA;iBACxH,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM;gBAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAA;;gBAC5G,MAAM,GAAG,SAAS,CAAA;QAC3B,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;;YACjE,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACjC,CAAC;IACD,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACvD,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA;IACzC,OAAO,GAAG,CAAA;AACd,CAAC","sourcesContent":["// KIELER's SCG clean-ups that run right after the SCG is built (sccharts.netlist.kico: str, then sfr):\n//\n// - Superfluous Thread Remover (scg/processors/optimizer/SuperfluousThreadRemover.xtend): a thread whose entry\n// leads straight to its exit (a region that is just a final state) is removed; a fork left without threads is\n// removed and its predecessors continue after the join.\n// - Superfluous Fork Remover (scg/processors/optimizer/SuperfluousForkRemover.xtend): a superstate with a single\n// region needs no fork and join, so control flow into the fork goes straight to the region's first node, and\n// control flow into the region's exit goes straight to the join's successor.\n//\n// Everything later in KIELER's chain (thread analysis, loops, schizophrenia curing, synchronizers) sees the graph\n// without these threads and forks, so the simulator does the same. Ported with the rerouting order (forks in the\n// order KIELER created them, flows removed at the end) and the crashes (concurrency.md T-6, K-1):\n// - a superstate below the root left without threads (its only region was just a final state): observed to\n// crash KIELER (\"The compiler failed during compilation setup.\"), the root does not;\n// - a later single-region superstate with a named region that is only reachable through the join of a superstate\n// removed before it: getThreadEntry finds no thread and `ancestorEntry.name` throws;\n// - a single-region superstate whose region starts in a state without node, entered other than from a thread's\n// entry: the flows into it are re-routed to nothing, and ThreadAnalyzer throws on them.\n\nimport type { Diagnostic } from '../types'\nimport { allStates, readableName, type CState } from './model'\nimport type { SCG, SNode, Thread } from './scg'\n\ntype Slot = 'next' | 'then' | 'else' | number\n\ninterface Flow {\n from: SNode\n slot: Slot\n to: SNode | undefined\n /** Creation rank (scg.ts): rewiring appends the flow to its new target's incoming flows. */\n seq: number\n}\n\nexport function removeSuperfluousForks(scg: SCG, core: CState): Diagnostic[] {\n const out: Diagnostic[] = []\n const flows: Flow[] = []\n const byTarget = new Map<SNode, Set<Flow>>()\n const own = new Map<SNode, Flow[]>()\n const place = (f: Flow, to: SNode | undefined) => {\n if (f.to) byTarget.get(f.to)?.delete(f)\n f.to = to\n if (to) {\n let set = byTarget.get(to)\n if (!set) byTarget.set(to, (set = new Set()))\n set.add(f)\n }\n }\n const retarget = (f: Flow, to: SNode | undefined) => {\n place(f, to)\n f.seq = scg.seq++\n }\n const pending: Flow[] = []\n const add = (from: SNode, slot: Slot, to: SNode | undefined, seq: number | undefined) => {\n if (!to) return\n const f: Flow = { from, slot, to, seq: seq ?? Infinity }\n pending.push(f)\n let l = own.get(from)\n if (!l) own.set(from, (l = []))\n l.push(f)\n }\n for (const n of scg.nodes) {\n switch (n.kind) {\n case 'cond': add(n, 'then', n.then, n.seq?.then); add(n, 'else', n.else, n.seq?.else); break\n case 'fork': n.threads!.forEach((t, i) => add(n, i, t.entry, n.seq?.threads?.[i])); break\n case 'surface': break\n default: add(n, 'next', n.next, n.seq?.next)\n }\n }\n // Incoming flows in KIELER's order.\n pending.sort((a, b) => a.seq - b.seq)\n for (const f of pending) {\n const to = f.to\n f.to = undefined\n place(f, to)\n flows.push(f)\n }\n const incoming = (n: SNode) => [...(byTarget.get(n) ?? [])]\n const flowOf = (n: SNode) => own.get(n)?.[0]\n\n /** SCGThreadExtensions.getThreadEntry on the current flows. */\n const threadEntry = (node: SNode): SNode | undefined => {\n const work: Flow[] = node.kind === 'join' ? incoming(node.fork!) : incoming(node)\n const marked = new Set<Flow>()\n const push = (list: Flow[]) => { for (const f of list) if (!marked.has(f)) work.push(f) }\n while (work.length) {\n const f = work.shift()!\n if (marked.has(f)) continue\n marked.add(f)\n const prev = f.from\n if (prev.kind === 'join') push(incoming(prev.fork!))\n else if (prev.kind === 'entry') return prev\n else if (prev.kind === 'depth') push(incoming(prev.surface!))\n else push(incoming(prev))\n }\n return undefined\n }\n\n const crash = (fork: SNode, message: string, hint: string, kieler: string, also: (string | undefined)[] = []) => {\n const state = fork.state?.origin ?? fork.state?.about\n const related = [...also, state].filter((x): x is string => !!x)\n out.push({ severity: 'error', code: 'kieler-crash', message, kieler, hint, related: related.length ? [...new Set(related)] : undefined })\n }\n\n // KIELER's node order: states in pre-order (SCGTransformation.transformSCGGenerateNodes).\n const forks = allStates(core).map(s => scg.stateNodes.get(s)).filter((n): n is SNode => n?.kind === 'fork')\n const removedNodes = new Set<SNode>()\n const removedThreads = new Set<Thread>()\n\n // Superfluous Thread Remover.\n const threadsLeft = new Map<SNode, Thread[]>(forks.map(f => [f, [...f.threads!]]))\n // Entries in KIELER's node order.\n for (const t of [...scg.threads].sort((a, b) => a.rank - b.rank)) {\n if (!t.fork || flowOf(t.entry)?.to !== t.exit) continue\n const fork = t.fork\n for (const f of incoming(t.entry)) retarget(f, undefined)\n removedNodes.add(t.entry)\n removedNodes.add(t.exit)\n removedThreads.add(t)\n const left = (threadsLeft.get(fork) ?? fork.threads!).filter(x => x !== t)\n threadsLeft.set(fork, left)\n if (left.length === 0) {\n if (!fork.state?.root) {\n crash(fork, 'KIELER\\'s compiler crashes on a superstate whose only region is just a final state',\n 'Give the region a state to start in before the final state, or remove the superstate.',\n 'The compiler failed during compilation setup. (after SuperfluousThreadRemover)')\n return out\n }\n const after = flowOf(fork.join!)?.to\n for (const f of incoming(fork)) retarget(f, after)\n removedNodes.add(fork)\n removedNodes.add(fork.join!)\n }\n }\n for (const fork of forks) fork.threads = threadsLeft.get(fork) ?? fork.threads\n\n for (const fork of forks) {\n if (removedNodes.has(fork) || fork.threads!.length !== 1) continue\n const t = fork.threads![0]\n const join = fork.join!\n const ancestor = threadEntry(fork)\n const entryTarget = flowOf(t.entry)?.to\n const forkIncoming = incoming(fork)\n // The region starts in a state without node (a referenced chart's state whose first immediate transition goes\n // back to it, scg.ts simpleState): KIELER's entry flow has no target, and the flows into the fork are re-routed\n // to nothing. ThreadAnalyzer then walks the threads and throws on such a flow unless it is a thread's entry's.\n if (!entryTarget && forkIncoming.some(f => f.from.kind !== 'entry')) {\n const id = fork.state?.origin ?? fork.state?.about\n crash(fork, `KIELER's compiler crashes on this chart: a transition leads into ${fork.state?.name ? `\\`${fork.state.name}\\`` : 'a superstate'}, whose only region starts in a state without code`,\n 'In a referenced chart, KIELER drops a state whose first immediate transition goes back to it without a trigger (the transition has no take counter there), so that state has no code. Such a loop would not let the tick end anyway: give the transition a trigger, or make it delayed.',\n 'java.lang.NullPointerException in ThreadAnalyzer (SCGThreadExtensions.getAllThreadNodesAndThreads; the lab server reports: The compiler failed during compilation setup.)',\n id ? [id] : [])\n return out\n }\n for (const f of forkIncoming) retarget(f, entryTarget)\n const joinTarget = flowOf(join)?.to\n const exitIncoming = incoming(t.exit)\n if (exitIncoming.length && !joinTarget) {\n crash(fork, 'KIELER\\'s compiler crashes on this superstate (its region ends, but nothing follows)',\n 'Add a transition after the superstate.', 'Cannot re-route join flows without next target. The SCG seems to be broken.')\n return out\n }\n for (const f of exitIncoming) retarget(f, joinTarget)\n if (t.region?.name && !ancestor) {\n // The superstate before it: reached only through its join, which cannot fire.\n const before: (CState | undefined)[] = []\n const seen = new Set<SNode>()\n const back = forkIncoming.map(f => f.from)\n while (back.length) {\n const n = back.pop()!\n if (seen.has(n)) continue\n seen.add(n)\n if (n.kind === 'join') before.push(n.fork!.state)\n else if (n.kind === 'assign' || n.kind === 'cond') back.push(...incoming(n).map(f => f.from))\n }\n const names = [...new Set(before.map(s => readableName(s)).filter(Boolean))]\n crash(fork, `KIELER's compiler crashes on this chart: ${names.length ? names.map(n => `\\`${n}\\``).join(', ') : 'a superstate'} can never finish (a region without a final state), but its \\`join to\\` leads to a state with an entry action or a named region`,\n 'A `join to` waits for every region to reach a final state: add a final state to the superstate\\'s region, or remove the `join to` transition.',\n 'java.lang.NullPointerException in SuperfluousForkRemover (the lab server reports: The compiler failed during compilation setup.)',\n before.map(s => s?.origin ?? s?.about))\n return out\n }\n for (const n of [fork, join, t.entry, t.exit]) removedNodes.add(n)\n removedThreads.add(t)\n }\n if (!removedNodes.size) return out\n\n // Write the flows back (flows of removed nodes vanish with them).\n for (const n of scg.nodes) {\n if (removedNodes.has(n)) continue\n if (n.kind === 'fork') continue\n if (n.kind === 'cond') {\n n.then = undefined\n n.else = undefined\n } else if (n.kind !== 'surface') {\n n.next = undefined\n }\n }\n for (const f of flows) {\n if (removedNodes.has(f.from)) continue\n const n = f.from\n const seq = (n.seq ??= {})\n if (f.slot === 'then') { n.then = f.to; seq.then = f.seq }\n else if (f.slot === 'else') { n.else = f.to; seq.else = f.seq }\n else if (f.slot === 'next') { n.next = f.to; seq.next = f.seq }\n }\n for (const n of scg.nodes) {\n if (n.kind !== 'fork' || removedNodes.has(n)) continue\n const own_ = own.get(n) ?? []\n ;(n.seq ??= {}).threads = n.threads!.map(th => own_.find(f => f.to === th.entry)?.seq ?? Infinity)\n }\n\n // Nodes of removed threads now belong to the enclosing thread.\n const live = (t: Thread): Thread => {\n let x = t\n while (removedThreads.has(x)) x = x.parent!\n return x\n }\n for (const n of scg.nodes) n.thread = live(n.thread)\n for (const t of scg.threads) {\n if (removedThreads.has(t)) continue\n if (t.parent) t.parent = live(t.parent)\n }\n const depthOf = (t: Thread): number => (t.parent ? depthOf(t.parent) + 1 : 0)\n scg.threads = scg.threads.filter(t => !removedThreads.has(t))\n for (const t of scg.threads) t.depth = depthOf(t)\n for (const [s, n] of scg.stateNodes) {\n if (!removedNodes.has(n)) continue\n let target: SNode | undefined = n\n for (let guard = 0; target && removedNodes.has(target) && guard < 1000; guard++) {\n if (target.kind === 'fork') target = target.threads!.length ? flowOf(target.threads![0].entry)?.to : flowOf(target.join!)?.to\n else if (target.kind === 'entry' || target.kind === 'join' || target.kind === 'exit') target = flowOf(target)?.to\n else target = undefined\n }\n if (target && !removedNodes.has(target)) scg.stateNodes.set(s, target)\n else scg.stateNodes.delete(s)\n }\n scg.nodes = scg.nodes.filter(n => !removedNodes.has(n))\n scg.nodes.forEach((n, i) => { n.id = i })\n return out\n}\n"]}
@@ -0,0 +1,3 @@
1
+ import type { Diagnostic } from "../types.js";
2
+ import type { SCG } from "./scg.js";
3
+ export declare function stringConditions(scg: SCG): Diagnostic[];
@@ -0,0 +1,42 @@
1
+ // A string as a whole condition (`if t go to ...` with `string t`): KIELER's netlist code keeps every condition in a
2
+ // `char` guard (`_cg<n> = d->t;`), and gcc (14 and later) rejects turning a `char*` into a `char` without a cast
3
+ // ("assignment to ‘char’ from ‘char *’ makes integer from pointer without a cast"). A plain read of an input the
4
+ // chart never writes is the exception: KIELER's copy propagation puts it into the guard expression itself, where C
5
+ // tests the pointer. Probe tests/engine/kieler/probe-string-condition.
6
+ const lowermost = (r) => (r.sub ? lowermost(r.sub) : r);
7
+ /** The C value of the expression is a pointer (a string, NULL, an array without all its indices). */
8
+ function isPointer(e) {
9
+ switch (e.k) {
10
+ case 'lit': return e.t === 'string';
11
+ case 'null': return true;
12
+ case 'ref': {
13
+ const r = lowermost(e);
14
+ return r.v.type === 'string' || r.idx.length < r.v.dims.length;
15
+ }
16
+ case 'call': return !e.extern && e.target?.v.method?.returnType === 'string';
17
+ case 'op': return e.op === '?:' && e.args.slice(1).some(isPointer);
18
+ default: return false;
19
+ }
20
+ }
21
+ export function stringConditions(scg) {
22
+ const written = new Set();
23
+ for (const n of scg.nodes)
24
+ if (n.effect?.k === 'assign')
25
+ written.add(lowermost(n.effect.ref).v);
26
+ for (const n of scg.nodes) {
27
+ const e = n.expr;
28
+ if (n.kind !== 'cond' || !e || !isPointer(e))
29
+ continue;
30
+ if (e.k === 'ref' && !e.sub && e.v.input && !written.has(e.v))
31
+ continue;
32
+ const by = n.method ? undefined : n.transition?.origin ?? n.transition?.about;
33
+ return [{
34
+ severity: 'error', code: 'c-string-condition', span: e.span, related: by ? [by] : undefined,
35
+ message: 'A string is not a condition in KIELER\'s C code: gcc rejects it',
36
+ kieler: 'assignment to ‘char’ from ‘char *’ makes integer from pointer without a cast [-Wint-conversion]\nCompiler did not return success (exit value != 0)',
37
+ hint: 'KIELER keeps every condition in a `char`, and C does not turn a string into a `char` without a cast. Test what you mean instead: compare the string (`t == "on"`), or keep a `bool` next to it.',
38
+ }];
39
+ }
40
+ return [];
41
+ }
42
+ //# sourceMappingURL=stringConditions.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"stringConditions.js","sourceRoot":"","sources":["../../src/sim/stringConditions.ts"],"names":[],"mappings":"AAAA,qHAAqH;AACrH,iHAAiH;AACjH,iHAAiH;AACjH,mHAAmH;AACnH,uEAAuE;AAMvE,MAAM,SAAS,GAAG,CAAC,CAAO,EAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnE,qGAAqG;AACrG,SAAS,SAAS,CAAC,CAAQ;IACvB,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAA;QACnC,KAAK,MAAM,CAAC,CAAC,OAAO,IAAI,CAAA;QACxB,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YACtB,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAClE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,UAAU,KAAK,QAAQ,CAAA;QAC5E,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAClE,OAAO,CAAC,CAAC,OAAO,KAAK,CAAA;IACzB,CAAC;AACL,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,GAAQ;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAA;IAClC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,QAAQ;YAAE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/F,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;QAChB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QACtD,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,SAAQ;QACvE,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,CAAA;QAC7E,OAAO,CAAC;gBACJ,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC3F,OAAO,EAAE,iEAAiE;gBAC1E,MAAM,EAAE,oJAAoJ;gBAC5J,IAAI,EAAE,iMAAiM;aAC1M,CAAC,CAAA;IACN,CAAC;IACD,OAAO,EAAE,CAAA;AACb,CAAC","sourcesContent":["// A string as a whole condition (`if t go to ...` with `string t`): KIELER's netlist code keeps every condition in a\n// `char` guard (`_cg<n> = d->t;`), and gcc (14 and later) rejects turning a `char*` into a `char` without a cast\n// (\"assignment to ‘char’ from ‘char *’ makes integer from pointer without a cast\"). A plain read of an input the\n// chart never writes is the exception: KIELER's copy propagation puts it into the guard expression itself, where C\n// tests the pointer. Probe tests/engine/kieler/probe-string-condition.\n\nimport type { Diagnostic } from '../types'\nimport type { CExpr, CRef } from './model'\nimport type { SCG } from './scg'\n\nconst lowermost = (r: CRef): CRef => (r.sub ? lowermost(r.sub) : r)\n\n/** The C value of the expression is a pointer (a string, NULL, an array without all its indices). */\nfunction isPointer(e: CExpr): boolean {\n switch (e.k) {\n case 'lit': return e.t === 'string'\n case 'null': return true\n case 'ref': {\n const r = lowermost(e)\n return r.v.type === 'string' || r.idx.length < r.v.dims.length\n }\n case 'call': return !e.extern && e.target?.v.method?.returnType === 'string'\n case 'op': return e.op === '?:' && e.args.slice(1).some(isPointer)\n default: return false\n }\n}\n\nexport function stringConditions(scg: SCG): Diagnostic[] {\n const written = new Set<unknown>()\n for (const n of scg.nodes) if (n.effect?.k === 'assign') written.add(lowermost(n.effect.ref).v)\n for (const n of scg.nodes) {\n const e = n.expr\n if (n.kind !== 'cond' || !e || !isPointer(e)) continue\n if (e.k === 'ref' && !e.sub && e.v.input && !written.has(e.v)) continue\n const by = n.method ? undefined : n.transition?.origin ?? n.transition?.about\n return [{\n severity: 'error', code: 'c-string-condition', span: e.span, related: by ? [by] : undefined,\n message: 'A string is not a condition in KIELER\\'s C code: gcc rejects it',\n kieler: 'assignment to ‘char’ from ‘char *’ makes integer from pointer without a cast [-Wint-conversion]\\nCompiler did not return success (exit value != 0)',\n hint: 'KIELER keeps every condition in a `char`, and C does not turn a string into a `char` without a cast. Test what you mean instead: compare the string (`t == \"on\"`), or keep a `bool` next to it.',\n }]\n }\n return []\n}\n"]}
@@ -0,0 +1,4 @@
1
+ import { CRegion, CVar } from "../model.js";
2
+ export declare function copyVar(v: CVar): CVar;
3
+ /** Copies a region (not attached anywhere: `parent` is the original's until the caller adds it). */
4
+ export declare function copyRegion(region: CRegion): CRegion;