@vxrn/compiler 1.27.1 → 2.0.0-beta.45.1

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 (89) hide show
  1. package/dist/cjs/cache.cjs +106 -117
  2. package/dist/cjs/configure.cjs +26 -28
  3. package/dist/cjs/constants.cjs +56 -60
  4. package/dist/cjs/index.cjs +420 -443
  5. package/dist/cjs/reactNativeCodegen.cjs +105 -114
  6. package/dist/cjs/reactNativeViewConfig.cjs +362 -381
  7. package/dist/cjs/refresh-runtime.cjs +390 -397
  8. package/dist/cjs/transformBabel.cjs +273 -263
  9. package/dist/cjs/transformHermesAsync.cjs +36 -47
  10. package/dist/cjs/transformHermesLoops.cjs +279 -281
  11. package/dist/cjs/transformSWC.cjs +183 -200
  12. package/dist/cjs/transformWorklets.cjs +107 -95
  13. package/dist/cjs/types.cjs +9 -11
  14. package/dist/cjs/worklets/autoworklet.cjs +277 -222
  15. package/dist/cjs/worklets/globals.cjs +124 -60
  16. package/dist/cjs/worklets/hash.cjs +23 -27
  17. package/dist/cjs/worklets/scope.cjs +338 -359
  18. package/dist/cjs/worklets/serialize.cjs +73 -75
  19. package/dist/cjs/worklets/transform.cjs +217 -222
  20. package/dist/cjs/worklets/types.cjs +9 -11
  21. package/dist/esm/cache.mjs +90 -97
  22. package/dist/esm/cache.mjs.map +1 -1
  23. package/dist/esm/configure.mjs +11 -10
  24. package/dist/esm/configure.mjs.map +1 -1
  25. package/dist/esm/constants.mjs +41 -41
  26. package/dist/esm/constants.mjs.map +1 -1
  27. package/dist/esm/index.js +417 -425
  28. package/dist/esm/index.js.map +1 -1
  29. package/dist/esm/index.mjs +417 -425
  30. package/dist/esm/index.mjs.map +1 -1
  31. package/dist/esm/reactNativeCodegen.mjs +90 -88
  32. package/dist/esm/reactNativeCodegen.mjs.map +1 -1
  33. package/dist/esm/reactNativeViewConfig.mjs +347 -362
  34. package/dist/esm/reactNativeViewConfig.mjs.map +1 -1
  35. package/dist/esm/refresh-runtime.mjs +372 -376
  36. package/dist/esm/refresh-runtime.mjs.map +1 -1
  37. package/dist/esm/transformBabel.mjs +255 -237
  38. package/dist/esm/transformBabel.mjs.map +1 -1
  39. package/dist/esm/transformHermesAsync.mjs +20 -21
  40. package/dist/esm/transformHermesAsync.mjs.map +1 -1
  41. package/dist/esm/transformHermesLoops.mjs +264 -255
  42. package/dist/esm/transformHermesLoops.mjs.map +1 -1
  43. package/dist/esm/transformSWC.mjs +163 -171
  44. package/dist/esm/transformSWC.mjs.map +1 -1
  45. package/dist/esm/transformWorklets.mjs +89 -69
  46. package/dist/esm/transformWorklets.mjs.map +1 -1
  47. package/dist/esm/types.mjs +0 -2
  48. package/dist/esm/worklets/autoworklet.mjs +258 -200
  49. package/dist/esm/worklets/autoworklet.mjs.map +1 -1
  50. package/dist/esm/worklets/globals.mjs +109 -42
  51. package/dist/esm/worklets/globals.mjs.map +1 -1
  52. package/dist/esm/worklets/hash.mjs +10 -9
  53. package/dist/esm/worklets/hash.mjs.map +1 -1
  54. package/dist/esm/worklets/scope.mjs +325 -341
  55. package/dist/esm/worklets/scope.mjs.map +1 -1
  56. package/dist/esm/worklets/serialize.mjs +60 -58
  57. package/dist/esm/worklets/serialize.mjs.map +1 -1
  58. package/dist/esm/worklets/transform.mjs +201 -197
  59. package/dist/esm/worklets/transform.mjs.map +1 -1
  60. package/dist/esm/worklets/types.mjs +0 -2
  61. package/package.json +7 -6
  62. package/src/transformBabel.test.ts +77 -17
  63. package/src/transformBabel.ts +28 -12
  64. package/types/transformBabel.d.ts +12 -0
  65. package/types/transformBabel.d.ts.map +1 -1
  66. package/types/transformSWC.d.ts +1 -4
  67. package/types/transformSWC.d.ts.map +1 -1
  68. package/dist/cjs/transformBabel.test.cjs +0 -652
  69. package/dist/cjs/transformHermesLoops.test.cjs +0 -257
  70. package/dist/cjs/transformSWC.test.cjs +0 -117
  71. package/dist/cjs/transformWorklets.test.cjs +0 -604
  72. package/dist/esm/transformBabel.test.mjs +0 -629
  73. package/dist/esm/transformBabel.test.mjs.map +0 -1
  74. package/dist/esm/transformHermesLoops.test.mjs +0 -234
  75. package/dist/esm/transformHermesLoops.test.mjs.map +0 -1
  76. package/dist/esm/transformSWC.test.mjs +0 -118
  77. package/dist/esm/transformSWC.test.mjs.map +0 -1
  78. package/dist/esm/transformWorklets.test.mjs +0 -581
  79. package/dist/esm/transformWorklets.test.mjs.map +0 -1
  80. package/dist/esm/types.mjs.map +0 -1
  81. package/dist/esm/worklets/types.mjs.map +0 -1
  82. package/types/transformBabel.test.d.ts +0 -2
  83. package/types/transformBabel.test.d.ts.map +0 -1
  84. package/types/transformHermesLoops.test.d.ts +0 -2
  85. package/types/transformHermesLoops.test.d.ts.map +0 -1
  86. package/types/transformSWC.test.d.ts +0 -2
  87. package/types/transformSWC.test.d.ts.map +0 -1
  88. package/types/transformWorklets.test.d.ts +0 -2
  89. package/types/transformWorklets.test.d.ts.map +0 -1
@@ -1,283 +1,292 @@
1
1
  import MagicString from "magic-string";
2
2
  import { parseSync } from "oxc-parser";
3
+
3
4
  const LOOP_RE = /\b(?:for|while)\s*(?:await\s+)?\(/;
4
5
  const LEXICAL_RE = /\b(?:let|const|class)\b/;
5
6
  function langFor(filename) {
6
- const ext = filename.split("?")[0].split(".").pop() || "js";
7
- if (ext === "ts" || ext === "cts" || ext === "mts") return "ts";
8
- if (ext === "tsx") return "tsx";
9
- return "jsx";
7
+ const ext = filename.split("?")[0].split(".").pop() || "js";
8
+ if (ext === "ts" || ext === "cts" || ext === "mts") return "ts";
9
+ if (ext === "tsx") return "tsx";
10
+ return "jsx";
10
11
  }
11
12
  function collectPatternNames(node, out) {
12
- if (!node || typeof node !== "object") return;
13
- switch (node.type) {
14
- case "Identifier":
15
- out.push(node.name);
16
- return;
17
- case "ObjectPattern":
18
- for (const p of node.properties || []) {
19
- collectPatternNames(p.value ?? p.argument, out);
20
- }
21
- return;
22
- case "ArrayPattern":
23
- for (const el of node.elements || []) collectPatternNames(el, out);
24
- return;
25
- case "AssignmentPattern":
26
- collectPatternNames(node.left, out);
27
- return;
28
- case "RestElement":
29
- collectPatternNames(node.argument, out);
30
- return;
31
- }
13
+ if (!node || typeof node !== "object") return;
14
+ switch (node.type) {
15
+ case "Identifier":
16
+ out.push(node.name);
17
+ return;
18
+ case "ObjectPattern":
19
+ for (const p of node.properties || []) {
20
+ collectPatternNames(p.value ?? p.argument, out);
21
+ }
22
+ return;
23
+ case "ArrayPattern":
24
+ for (const el of node.elements || []) collectPatternNames(el, out);
25
+ return;
26
+ case "AssignmentPattern":
27
+ collectPatternNames(node.left, out);
28
+ return;
29
+ case "RestElement":
30
+ collectPatternNames(node.argument, out);
31
+ return;
32
+ }
32
33
  }
33
- const FUNCTION_TYPES = /* @__PURE__ */new Set(["FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"]);
34
+ const FUNCTION_TYPES = /* @__PURE__ */ new Set([
35
+ "FunctionDeclaration",
36
+ "FunctionExpression",
37
+ "ArrowFunctionExpression"
38
+ ]);
34
39
  function eachChild(node, fn) {
35
- for (const key in node) {
36
- if (key === "type" || key === "start" || key === "end" || key === "parent") continue;
37
- const value = node[key];
38
- if (Array.isArray(value)) {
39
- for (const item of value) {
40
- if (item && typeof item.type === "string") fn(item);
41
- }
42
- } else if (value && typeof value === "object" && typeof value.type === "string") {
43
- fn(value);
44
- }
45
- }
40
+ for (const key in node) {
41
+ if (key === "type" || key === "start" || key === "end" || key === "parent") continue;
42
+ const value = node[key];
43
+ if (Array.isArray(value)) {
44
+ for (const item of value) {
45
+ if (item && typeof item.type === "string") fn(item);
46
+ }
47
+ } else if (value && typeof value === "object" && typeof value.type === "string") {
48
+ fn(value);
49
+ }
50
+ }
46
51
  }
47
52
  function capturesInClosure(body, names) {
48
- let found = false;
49
- function scanInsideFunction(node, shadowed) {
50
- if (found || !node || typeof node !== "object") return;
51
- if (node.type === "Identifier" && names.has(node.name) && !shadowed.has(node.name)) {
52
- found = true;
53
- return;
54
- }
55
- if (FUNCTION_TYPES.has(node.type)) {
56
- const inner = new Set(shadowed);
57
- const params = [];
58
- for (const p of node.params || []) collectPatternNames(p, params);
59
- for (const p of params) inner.add(p);
60
- if (node.id?.name) inner.add(node.id.name);
61
- eachChild(node, c => scanInsideFunction(c, inner));
62
- return;
63
- }
64
- if (node.type === "MemberExpression" && !node.computed) {
65
- scanInsideFunction(node.object, shadowed);
66
- return;
67
- }
68
- if (node.type === "Property" && !node.computed && node.key === node.value) {
69
- scanInsideFunction(node.value, shadowed);
70
- return;
71
- }
72
- eachChild(node, c => scanInsideFunction(c, shadowed));
73
- }
74
- function walk(node) {
75
- if (found || !node || typeof node !== "object") return;
76
- if (FUNCTION_TYPES.has(node.type)) {
77
- const shadowed = /* @__PURE__ */new Set();
78
- const params = [];
79
- for (const p of node.params || []) collectPatternNames(p, params);
80
- for (const p of params) shadowed.add(p);
81
- eachChild(node, c => scanInsideFunction(c, shadowed));
82
- return;
83
- }
84
- eachChild(node, walk);
85
- }
86
- walk(body);
87
- return found;
53
+ let found = false;
54
+ function scanInsideFunction(node, shadowed) {
55
+ if (found || !node || typeof node !== "object") return;
56
+ if (node.type === "Identifier" && names.has(node.name) && !shadowed.has(node.name)) {
57
+ found = true;
58
+ return;
59
+ }
60
+ if (FUNCTION_TYPES.has(node.type)) {
61
+ const inner = new Set(shadowed);
62
+ const params = [];
63
+ for (const p of node.params || []) collectPatternNames(p, params);
64
+ for (const p of params) inner.add(p);
65
+ if (node.id?.name) inner.add(node.id.name);
66
+ eachChild(node, (c) => scanInsideFunction(c, inner));
67
+ return;
68
+ }
69
+ if (node.type === "MemberExpression" && !node.computed) {
70
+ scanInsideFunction(node.object, shadowed);
71
+ return;
72
+ }
73
+ if (node.type === "Property" && !node.computed && node.key === node.value) {
74
+ scanInsideFunction(node.value, shadowed);
75
+ return;
76
+ }
77
+ eachChild(node, (c) => scanInsideFunction(c, shadowed));
78
+ }
79
+ function walk(node) {
80
+ if (found || !node || typeof node !== "object") return;
81
+ if (FUNCTION_TYPES.has(node.type)) {
82
+ const shadowed = /* @__PURE__ */ new Set();
83
+ const params = [];
84
+ for (const p of node.params || []) collectPatternNames(p, params);
85
+ for (const p of params) shadowed.add(p);
86
+ eachChild(node, (c) => scanInsideFunction(c, shadowed));
87
+ return;
88
+ }
89
+ eachChild(node, walk);
90
+ }
91
+ walk(body);
92
+ return found;
88
93
  }
89
94
  function analyzeBody(body, names) {
90
- const facts = {
91
- hasBreak: false,
92
- hasContinue: false,
93
- hasReturn: false,
94
- hasAwait: false,
95
- hasYield: false,
96
- assignsBinding: false,
97
- hasLabeledJump: false
98
- };
99
- function walk(node, inNestedBreakable, inNestedLoop, inFunction) {
100
- if (!node || typeof node !== "object") return;
101
- if (FUNCTION_TYPES.has(node.type)) {
102
- eachChild(node, c => walk(c, inNestedBreakable, inNestedLoop, true));
103
- return;
104
- }
105
- switch (node.type) {
106
- case "BreakStatement":
107
- if (node.label) facts.hasLabeledJump = true;else if (!inNestedBreakable) facts.hasBreak = true;
108
- break;
109
- case "ContinueStatement":
110
- if (node.label) facts.hasLabeledJump = true;else if (!inNestedLoop) facts.hasContinue = true;
111
- break;
112
- case "ReturnStatement":
113
- if (!inFunction) facts.hasReturn = true;
114
- break;
115
- case "AwaitExpression":
116
- if (!inFunction) facts.hasAwait = true;
117
- break;
118
- case "YieldExpression":
119
- if (!inFunction) facts.hasYield = true;
120
- break;
121
- case "AssignmentExpression":
122
- if (node.left?.type === "Identifier" && names.has(node.left.name)) {
123
- facts.assignsBinding = true;
124
- }
125
- break;
126
- case "UpdateExpression":
127
- if (node.argument?.type === "Identifier" && names.has(node.argument.name)) {
128
- facts.assignsBinding = true;
129
- }
130
- break;
131
- }
132
- const isLoop = node.type === "ForStatement" || node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "WhileStatement" || node.type === "DoWhileStatement";
133
- const isBreakable = isLoop || node.type === "SwitchStatement";
134
- eachChild(node, c => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction));
135
- }
136
- walk(body, false, false, false);
137
- return facts;
95
+ const facts = {
96
+ hasBreak: false,
97
+ hasContinue: false,
98
+ hasReturn: false,
99
+ hasAwait: false,
100
+ hasYield: false,
101
+ assignsBinding: false,
102
+ hasLabeledJump: false
103
+ };
104
+ function walk(node, inNestedBreakable, inNestedLoop, inFunction) {
105
+ if (!node || typeof node !== "object") return;
106
+ if (FUNCTION_TYPES.has(node.type)) {
107
+ eachChild(node, (c) => walk(c, inNestedBreakable, inNestedLoop, true));
108
+ return;
109
+ }
110
+ switch (node.type) {
111
+ case "BreakStatement":
112
+ if (node.label) facts.hasLabeledJump = true;
113
+ else if (!inNestedBreakable) facts.hasBreak = true;
114
+ break;
115
+ case "ContinueStatement":
116
+ if (node.label) facts.hasLabeledJump = true;
117
+ else if (!inNestedLoop) facts.hasContinue = true;
118
+ break;
119
+ case "ReturnStatement":
120
+ if (!inFunction) facts.hasReturn = true;
121
+ break;
122
+ case "AwaitExpression":
123
+ if (!inFunction) facts.hasAwait = true;
124
+ break;
125
+ case "YieldExpression":
126
+ if (!inFunction) facts.hasYield = true;
127
+ break;
128
+ case "AssignmentExpression":
129
+ if (node.left?.type === "Identifier" && names.has(node.left.name)) {
130
+ facts.assignsBinding = true;
131
+ }
132
+ break;
133
+ case "UpdateExpression":
134
+ if (node.argument?.type === "Identifier" && names.has(node.argument.name)) {
135
+ facts.assignsBinding = true;
136
+ }
137
+ break;
138
+ }
139
+ const isLoop = node.type === "ForStatement" || node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "WhileStatement" || node.type === "DoWhileStatement";
140
+ const isBreakable = isLoop || node.type === "SwitchStatement";
141
+ eachChild(node, (c) => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction));
142
+ }
143
+ walk(body, false, false, false);
144
+ return facts;
138
145
  }
139
146
  function collectBodyLexicalNames(node, out) {
140
- if (!node || typeof node !== "object" || typeof node.type !== "string") return;
141
- if (FUNCTION_TYPES.has(node.type) || node.type === "ClassBody") return;
142
- if (node.type === "VariableDeclaration") {
143
- if (node.kind === "let" || node.kind === "const") {
144
- for (const d of node.declarations || []) collectPatternNames(d.id, out);
145
- }
146
- return;
147
- }
148
- if (node.type === "ClassDeclaration") {
149
- if (node.id?.name) out.push(node.id.name);
150
- return;
151
- }
152
- eachChild(node, c => collectBodyLexicalNames(c, out));
147
+ if (!node || typeof node !== "object" || typeof node.type !== "string") return;
148
+ if (FUNCTION_TYPES.has(node.type) || node.type === "ClassBody") return;
149
+ if (node.type === "VariableDeclaration") {
150
+ if (node.kind === "let" || node.kind === "const") {
151
+ for (const d of node.declarations || []) collectPatternNames(d.id, out);
152
+ }
153
+ return;
154
+ }
155
+ if (node.type === "ClassDeclaration") {
156
+ if (node.id?.name) out.push(node.id.name);
157
+ return;
158
+ }
159
+ eachChild(node, (c) => collectBodyLexicalNames(c, out));
153
160
  }
154
- const LOOP_TYPES = /* @__PURE__ */new Set(["ForStatement", "ForOfStatement", "ForInStatement", "WhileStatement", "DoWhileStatement"]);
161
+ const LOOP_TYPES = /* @__PURE__ */ new Set([
162
+ "ForStatement",
163
+ "ForOfStatement",
164
+ "ForInStatement",
165
+ "WhileStatement",
166
+ "DoWhileStatement"
167
+ ]);
155
168
  function headDeclaration(node) {
156
- if (node.type === "ForStatement") return node.init;
157
- if (node.type === "ForOfStatement" || node.type === "ForInStatement") return node.left;
158
- return null;
169
+ if (node.type === "ForStatement") return node.init;
170
+ if (node.type === "ForOfStatement" || node.type === "ForInStatement") return node.left;
171
+ return null;
159
172
  }
160
173
  function transformOnce(code, filename) {
161
- const parsed = parseSync(filename, code, {
162
- lang: langFor(filename)
163
- });
164
- if (!parsed?.program || parsed.errors?.length) return null;
165
- const candidates = [];
166
- function findLoops(node, insideCandidate) {
167
- if (!node || typeof node !== "object") return;
168
- let isCandidate = false;
169
- if (LOOP_TYPES.has(node.type) && node.body) {
170
- const names = [];
171
- const decl = headDeclaration(node);
172
- if (decl?.type === "VariableDeclaration" && (decl.kind === "let" || decl.kind === "const")) {
173
- for (const d of decl.declarations || []) collectPatternNames(d.id, names);
174
- }
175
- const shared = [...names];
176
- collectBodyLexicalNames(node.body, shared);
177
- if (shared.length && capturesInClosure(node.body, new Set(shared))) {
178
- isCandidate = true;
179
- if (!insideCandidate) candidates.push({
180
- node,
181
- names
182
- });
183
- }
184
- }
185
- eachChild(node, c => findLoops(c, insideCandidate || isCandidate));
186
- }
187
- findLoops(parsed.program, false);
188
- if (!candidates.length) return null;
189
- const s = new MagicString(code);
190
- let counter = 0;
191
- let changed = false;
192
- for (const {
193
- node,
194
- names
195
- } of candidates) {
196
- const nameSet = new Set(names);
197
- const facts = analyzeBody(node.body, nameSet);
198
- if (facts.hasYield || facts.assignsBinding || facts.hasLabeledJump) continue;
199
- const fnName = `_hermesLoop${counter++}`;
200
- const params = names.join(", ");
201
- let bodyText = code.slice(node.body.start, node.body.end);
202
- if (node.body.type !== "BlockStatement") {
203
- bodyText = `{ ${bodyText} }`;
204
- }
205
- if (facts.hasBreak || facts.hasReturn || facts.hasContinue) {
206
- bodyText = rewriteJumps(bodyText, node.body, code, nameSet);
207
- }
208
- const asyncKw = facts.hasAwait ? "async " : "";
209
- const awaitKw = facts.hasAwait ? "await " : "";
210
- let call = `${awaitKw}${fnName}(${params})`;
211
- if (facts.hasBreak || facts.hasReturn) {
212
- const checks = [];
213
- if (facts.hasBreak) checks.push("if (_r === 1) break;");
214
- if (facts.hasReturn) checks.push("if (_r) return _r.v;");
215
- call = `{ var _r = ${call}; ${checks.join(" ")} }`;
216
- } else {
217
- call = `{ ${call}; }`;
218
- }
219
- s.overwrite(node.body.start, node.body.end, call);
220
- s.appendLeft(node.start, `{
174
+ const parsed = parseSync(filename, code, { lang: langFor(filename) });
175
+ if (!parsed?.program || parsed.errors?.length) return null;
176
+ const candidates = [];
177
+ function findLoops(node, insideCandidate) {
178
+ if (!node || typeof node !== "object") return;
179
+ let isCandidate = false;
180
+ if (LOOP_TYPES.has(node.type) && node.body) {
181
+ const names = [];
182
+ const decl = headDeclaration(node);
183
+ if (decl?.type === "VariableDeclaration" && (decl.kind === "let" || decl.kind === "const")) {
184
+ for (const d of decl.declarations || []) collectPatternNames(d.id, names);
185
+ }
186
+ const shared = [...names];
187
+ collectBodyLexicalNames(node.body, shared);
188
+ if (shared.length && capturesInClosure(node.body, new Set(shared))) {
189
+ isCandidate = true;
190
+ if (!insideCandidate) candidates.push({
191
+ node,
192
+ names
193
+ });
194
+ }
195
+ }
196
+ eachChild(node, (c) => findLoops(c, insideCandidate || isCandidate));
197
+ }
198
+ findLoops(parsed.program, false);
199
+ if (!candidates.length) return null;
200
+ const s = new MagicString(code);
201
+ let counter = 0;
202
+ let changed = false;
203
+ for (const { node, names } of candidates) {
204
+ const nameSet = new Set(names);
205
+ const facts = analyzeBody(node.body, nameSet);
206
+ if (facts.hasYield || facts.assignsBinding || facts.hasLabeledJump) continue;
207
+ const fnName = `_hermesLoop${counter++}`;
208
+ const params = names.join(", ");
209
+ let bodyText = code.slice(node.body.start, node.body.end);
210
+ if (node.body.type !== "BlockStatement") {
211
+ bodyText = `{ ${bodyText} }`;
212
+ }
213
+ if (facts.hasBreak || facts.hasReturn || facts.hasContinue) {
214
+ bodyText = rewriteJumps(bodyText, node.body, code, nameSet);
215
+ }
216
+ const asyncKw = facts.hasAwait ? "async " : "";
217
+ const awaitKw = facts.hasAwait ? "await " : "";
218
+ let call = `${awaitKw}${fnName}(${params})`;
219
+ if (facts.hasBreak || facts.hasReturn) {
220
+ const checks = [];
221
+ if (facts.hasBreak) checks.push("if (_r === 1) break;");
222
+ if (facts.hasReturn) checks.push("if (_r) return _r.v;");
223
+ call = `{ var _r = ${call}; ${checks.join(" ")} }`;
224
+ } else {
225
+ call = `{ ${call}; }`;
226
+ }
227
+ s.overwrite(node.body.start, node.body.end, call);
228
+ s.appendLeft(node.start, `{
221
229
  var ${fnName} = ${asyncKw}(${params}) => ${bodyText};
222
230
  `);
223
- s.appendLeft(node.end, "\n}");
224
- changed = true;
225
- }
226
- if (!changed) return null;
227
- return {
228
- code: s.toString(),
229
- map: s.generateMap({
230
- hires: true,
231
- source: filename,
232
- includeContent: false
233
- })
234
- };
231
+ s.appendLeft(node.end, "\n}");
232
+ changed = true;
233
+ }
234
+ if (!changed) return null;
235
+ return {
236
+ code: s.toString(),
237
+ map: s.generateMap({
238
+ hires: true,
239
+ source: filename,
240
+ includeContent: false
241
+ })
242
+ };
235
243
  }
236
244
  function rewriteJumps(bodyText, bodyNode, code, names) {
237
- const offset = bodyNode.start;
238
- const s = new MagicString(bodyText);
239
- const pad = bodyNode.type === "BlockStatement" ? 0 : 2;
240
- function walk(node, inNestedBreakable, inNestedLoop, inFunction) {
241
- if (!node || typeof node !== "object") return;
242
- if (FUNCTION_TYPES.has(node.type)) {
243
- eachChild(node, c => walk(c, inNestedBreakable, inNestedLoop, true));
244
- return;
245
- }
246
- if (node.type === "BreakStatement" && !node.label && !inNestedBreakable) {
247
- s.overwrite(node.start - offset + pad, node.end - offset + pad, "return 1;");
248
- return;
249
- }
250
- if (node.type === "ContinueStatement" && !node.label && !inNestedLoop) {
251
- s.overwrite(node.start - offset + pad, node.end - offset + pad, "return;");
252
- return;
253
- }
254
- if (node.type === "ReturnStatement" && !inFunction) {
255
- const arg = node.argument;
256
- const replacement = arg ? `return { v: ${code.slice(arg.start, arg.end)} };` : "return { v: undefined };";
257
- s.overwrite(node.start - offset + pad, node.end - offset + pad, replacement);
258
- return;
259
- }
260
- const isLoop = node.type === "ForStatement" || node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "WhileStatement" || node.type === "DoWhileStatement";
261
- const isBreakable = isLoop || node.type === "SwitchStatement";
262
- eachChild(node, c => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction));
263
- }
264
- walk(bodyNode, false, false, false);
265
- return s.toString();
245
+ const offset = bodyNode.start;
246
+ const s = new MagicString(bodyText);
247
+ const pad = bodyNode.type === "BlockStatement" ? 0 : 2;
248
+ function walk(node, inNestedBreakable, inNestedLoop, inFunction) {
249
+ if (!node || typeof node !== "object") return;
250
+ if (FUNCTION_TYPES.has(node.type)) {
251
+ eachChild(node, (c) => walk(c, inNestedBreakable, inNestedLoop, true));
252
+ return;
253
+ }
254
+ if (node.type === "BreakStatement" && !node.label && !inNestedBreakable) {
255
+ s.overwrite(node.start - offset + pad, node.end - offset + pad, "return 1;");
256
+ return;
257
+ }
258
+ if (node.type === "ContinueStatement" && !node.label && !inNestedLoop) {
259
+ s.overwrite(node.start - offset + pad, node.end - offset + pad, "return;");
260
+ return;
261
+ }
262
+ if (node.type === "ReturnStatement" && !inFunction) {
263
+ const arg = node.argument;
264
+ const replacement = arg ? `return { v: ${code.slice(arg.start, arg.end)} };` : "return { v: undefined };";
265
+ s.overwrite(node.start - offset + pad, node.end - offset + pad, replacement);
266
+ return;
267
+ }
268
+ const isLoop = node.type === "ForStatement" || node.type === "ForOfStatement" || node.type === "ForInStatement" || node.type === "WhileStatement" || node.type === "DoWhileStatement";
269
+ const isBreakable = isLoop || node.type === "SwitchStatement";
270
+ eachChild(node, (c) => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction));
271
+ }
272
+ walk(bodyNode, false, false, false);
273
+ return s.toString();
266
274
  }
267
275
  function transformHermesLoops(code, filename) {
268
- if (!LOOP_RE.test(code) || !LEXICAL_RE.test(code)) return null;
269
- let current = code;
270
- const maps = [];
271
- for (let i = 0; i < 10; i++) {
272
- const next = transformOnce(current, filename);
273
- if (!next) break;
274
- current = next.code;
275
- maps.push(next.map);
276
- }
277
- return maps.length ? {
278
- code: current,
279
- maps
280
- } : null;
276
+ if (!LOOP_RE.test(code) || !LEXICAL_RE.test(code)) return null;
277
+ let current = code;
278
+ const maps = [];
279
+ for (let i = 0; i < 10; i++) {
280
+ const next = transformOnce(current, filename);
281
+ if (!next) break;
282
+ current = next.code;
283
+ maps.push(next.map);
284
+ }
285
+ return maps.length ? {
286
+ code: current,
287
+ maps
288
+ } : null;
281
289
  }
290
+
282
291
  export { transformHermesLoops };
283
292
  //# sourceMappingURL=transformHermesLoops.mjs.map
@@ -1 +1 @@
1
- {"version":3,"names":["MagicString","parseSync","LOOP_RE","LEXICAL_RE","langFor","filename","ext","split","pop","collectPatternNames","node","out","type","push","name","p","properties","value","argument","el","elements","left","FUNCTION_TYPES","Set","eachChild","fn","key","Array","isArray","item","capturesInClosure","body","names","found","scanInsideFunction","shadowed","has","inner","params","add","id","c","computed","object","walk","analyzeBody","facts","hasBreak","hasContinue","hasReturn","hasAwait","hasYield","assignsBinding","hasLabeledJump","inNestedBreakable","inNestedLoop","inFunction","label","isLoop","isBreakable","collectBodyLexicalNames","kind","d","declarations","LOOP_TYPES","headDeclaration","init","transformOnce","code","parsed","lang","program","errors","length","candidates","findLoops","insideCandidate","isCandidate","decl","shared","s","counter","changed","nameSet","fnName","join","bodyText","slice","start","end","rewriteJumps","asyncKw","awaitKw","call","checks","overwrite","appendLeft","toString","map","generateMap","hires","source","includeContent","bodyNode","offset","pad","arg","replacement","transformHermesLoops","test","current","maps","i","next"],"sources":["../../src/transformHermesLoops.ts"],"sourcesContent":[null],"mappings":"AAAA,OAAOA,WAAA,MAAiB;AACxB,SAASC,SAAA,QAAiB;AAkC1B,MAAMC,OAAA,GAAU;AAChB,MAAMC,UAAA,GAAa;AAOnB,SAASC,QAAQC,QAAA,EAAkB;EACjC,MAAMC,GAAA,GAAMD,QAAA,CAASE,KAAA,CAAM,GAAG,EAAE,CAAC,EAAEA,KAAA,CAAM,GAAG,EAAEC,GAAA,CAAI,KAAK;EAIvD,IAAIF,GAAA,KAAQ,QAAQA,GAAA,KAAQ,SAASA,GAAA,KAAQ,OAAO,OAAO;EAC3D,IAAIA,GAAA,KAAQ,OAAO,OAAO;EAC1B,OAAO;AACT;AAEA,SAASG,oBAAoBC,IAAA,EAAWC,GAAA,EAAe;EACrD,IAAI,CAACD,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;EACvC,QAAQA,IAAA,CAAKE,IAAA;IACX,KAAK;MACHD,GAAA,CAAIE,IAAA,CAAKH,IAAA,CAAKI,IAAI;MAClB;IACF,KAAK;MACH,WAAWC,CAAA,IAAKL,IAAA,CAAKM,UAAA,IAAc,EAAC,EAAG;QACrCP,mBAAA,CAAoBM,CAAA,CAAEE,KAAA,IAASF,CAAA,CAAEG,QAAA,EAAUP,GAAG;MAChD;MACA;IACF,KAAK;MACH,WAAWQ,EAAA,IAAMT,IAAA,CAAKU,QAAA,IAAY,EAAC,EAAGX,mBAAA,CAAoBU,EAAA,EAAIR,GAAG;MACjE;IACF,KAAK;MACHF,mBAAA,CAAoBC,IAAA,CAAKW,IAAA,EAAMV,GAAG;MAClC;IACF,KAAK;MACHF,mBAAA,CAAoBC,IAAA,CAAKQ,QAAA,EAAUP,GAAG;MACtC;EACJ;AACF;AAEA,MAAMW,cAAA,GAAiB,mBAAIC,GAAA,CAAI,CAC7B,uBACA,sBACA,0BACD;AAED,SAASC,UAAUd,IAAA,EAAWe,EAAA,EAA0B;EACtD,WAAWC,GAAA,IAAOhB,IAAA,EAAM;IACtB,IAAIgB,GAAA,KAAQ,UAAUA,GAAA,KAAQ,WAAWA,GAAA,KAAQ,SAASA,GAAA,KAAQ,UAAU;IAC5E,MAAMT,KAAA,GAAQP,IAAA,CAAKgB,GAAG;IACtB,IAAIC,KAAA,CAAMC,OAAA,CAAQX,KAAK,GAAG;MACxB,WAAWY,IAAA,IAAQZ,KAAA,EAAO;QACxB,IAAIY,IAAA,IAAQ,OAAOA,IAAA,CAAKjB,IAAA,KAAS,UAAUa,EAAA,CAAGI,IAAI;MACpD;IACF,WAAWZ,KAAA,IAAS,OAAOA,KAAA,KAAU,YAAY,OAAOA,KAAA,CAAML,IAAA,KAAS,UAAU;MAC/Ea,EAAA,CAAGR,KAAK;IACV;EACF;AACF;AAGA,SAASa,kBAAkBC,IAAA,EAAWC,KAAA,EAA6B;EACjE,IAAIC,KAAA,GAAQ;EAEZ,SAASC,mBAAmBxB,IAAA,EAAWyB,QAAA,EAAuB;IAC5D,IAAIF,KAAA,IAAS,CAACvB,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;IAChD,IAAIA,IAAA,CAAKE,IAAA,KAAS,gBAAgBoB,KAAA,CAAMI,GAAA,CAAI1B,IAAA,CAAKI,IAAI,KAAK,CAACqB,QAAA,CAASC,GAAA,CAAI1B,IAAA,CAAKI,IAAI,GAAG;MAClFmB,KAAA,GAAQ;MACR;IACF;IACA,IAAIX,cAAA,CAAec,GAAA,CAAI1B,IAAA,CAAKE,IAAI,GAAG;MACjC,MAAMyB,KAAA,GAAQ,IAAId,GAAA,CAAIY,QAAQ;MAC9B,MAAMG,MAAA,GAAmB,EAAC;MAC1B,WAAWvB,CAAA,IAAKL,IAAA,CAAK4B,MAAA,IAAU,EAAC,EAAG7B,mBAAA,CAAoBM,CAAA,EAAGuB,MAAM;MAChE,WAAWvB,CAAA,IAAKuB,MAAA,EAAQD,KAAA,CAAME,GAAA,CAAIxB,CAAC;MACnC,IAAIL,IAAA,CAAK8B,EAAA,EAAI1B,IAAA,EAAMuB,KAAA,CAAME,GAAA,CAAI7B,IAAA,CAAK8B,EAAA,CAAG1B,IAAI;MACzCU,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMP,kBAAA,CAAmBO,CAAA,EAAGJ,KAAK,CAAC;MACnD;IACF;IAEA,IAAI3B,IAAA,CAAKE,IAAA,KAAS,sBAAsB,CAACF,IAAA,CAAKgC,QAAA,EAAU;MACtDR,kBAAA,CAAmBxB,IAAA,CAAKiC,MAAA,EAAQR,QAAQ;MACxC;IACF;IACA,IAAIzB,IAAA,CAAKE,IAAA,KAAS,cAAc,CAACF,IAAA,CAAKgC,QAAA,IAAYhC,IAAA,CAAKgB,GAAA,KAAQhB,IAAA,CAAKO,KAAA,EAAO;MAEzEiB,kBAAA,CAAmBxB,IAAA,CAAKO,KAAA,EAAOkB,QAAQ;MACvC;IACF;IACAX,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMP,kBAAA,CAAmBO,CAAA,EAAGN,QAAQ,CAAC;EACxD;EAEA,SAASS,KAAKlC,IAAA,EAAW;IACvB,IAAIuB,KAAA,IAAS,CAACvB,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;IAChD,IAAIY,cAAA,CAAec,GAAA,CAAI1B,IAAA,CAAKE,IAAI,GAAG;MACjC,MAAMuB,QAAA,GAAW,mBAAIZ,GAAA,CAAY;MACjC,MAAMe,MAAA,GAAmB,EAAC;MAC1B,WAAWvB,CAAA,IAAKL,IAAA,CAAK4B,MAAA,IAAU,EAAC,EAAG7B,mBAAA,CAAoBM,CAAA,EAAGuB,MAAM;MAChE,WAAWvB,CAAA,IAAKuB,MAAA,EAAQH,QAAA,CAASI,GAAA,CAAIxB,CAAC;MACtCS,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMP,kBAAA,CAAmBO,CAAA,EAAGN,QAAQ,CAAC;MACtD;IACF;IACAX,SAAA,CAAUd,IAAA,EAAMkC,IAAI;EACtB;EAEAA,IAAA,CAAKb,IAAI;EACT,OAAOE,KAAA;AACT;AAiBA,SAASY,YAAYd,IAAA,EAAWC,KAAA,EAA+B;EAC7D,MAAMc,KAAA,GAAmB;IACvBC,QAAA,EAAU;IACVC,WAAA,EAAa;IACbC,SAAA,EAAW;IACXC,QAAA,EAAU;IACVC,QAAA,EAAU;IACVC,cAAA,EAAgB;IAChBC,cAAA,EAAgB;EAClB;EAEA,SAAST,KACPlC,IAAA,EACA4C,iBAAA,EACAC,YAAA,EACAC,UAAA,EACA;IACA,IAAI,CAAC9C,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;IAEvC,IAAIY,cAAA,CAAec,GAAA,CAAI1B,IAAA,CAAKE,IAAI,GAAG;MACjCY,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMG,IAAA,CAAKH,CAAA,EAAGa,iBAAA,EAAmBC,YAAA,EAAc,IAAI,CAAC;MACrE;IACF;IAEA,QAAQ7C,IAAA,CAAKE,IAAA;MACX,KAAK;QACH,IAAIF,IAAA,CAAK+C,KAAA,EAAOX,KAAA,CAAMO,cAAA,GAAiB,cAC9B,CAACC,iBAAA,EAAmBR,KAAA,CAAMC,QAAA,GAAW;QAC9C;MACF,KAAK;QACH,IAAIrC,IAAA,CAAK+C,KAAA,EAAOX,KAAA,CAAMO,cAAA,GAAiB,cAC9B,CAACE,YAAA,EAAcT,KAAA,CAAME,WAAA,GAAc;QAC5C;MACF,KAAK;QACH,IAAI,CAACQ,UAAA,EAAYV,KAAA,CAAMG,SAAA,GAAY;QACnC;MACF,KAAK;QACH,IAAI,CAACO,UAAA,EAAYV,KAAA,CAAMI,QAAA,GAAW;QAClC;MACF,KAAK;QACH,IAAI,CAACM,UAAA,EAAYV,KAAA,CAAMK,QAAA,GAAW;QAClC;MACF,KAAK;QACH,IAAIzC,IAAA,CAAKW,IAAA,EAAMT,IAAA,KAAS,gBAAgBoB,KAAA,CAAMI,GAAA,CAAI1B,IAAA,CAAKW,IAAA,CAAKP,IAAI,GAAG;UACjEgC,KAAA,CAAMM,cAAA,GAAiB;QACzB;QACA;MACF,KAAK;QACH,IAAI1C,IAAA,CAAKQ,QAAA,EAAUN,IAAA,KAAS,gBAAgBoB,KAAA,CAAMI,GAAA,CAAI1B,IAAA,CAAKQ,QAAA,CAASJ,IAAI,GAAG;UACzEgC,KAAA,CAAMM,cAAA,GAAiB;QACzB;QACA;IACJ;IAEA,MAAMM,MAAA,GACJhD,IAAA,CAAKE,IAAA,KAAS,kBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS;IAChB,MAAM+C,WAAA,GAAcD,MAAA,IAAUhD,IAAA,CAAKE,IAAA,KAAS;IAE5CY,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IACfG,IAAA,CAAKH,CAAA,EAAGa,iBAAA,IAAqBK,WAAA,EAAaJ,YAAA,IAAgBG,MAAA,EAAQF,UAAU,CAC9E;EACF;EAEAZ,IAAA,CAAKb,IAAA,EAAM,OAAO,OAAO,KAAK;EAC9B,OAAOe,KAAA;AACT;AAQA,SAASc,wBAAwBlD,IAAA,EAAWC,GAAA,EAAe;EACzD,IAAI,CAACD,IAAA,IAAQ,OAAOA,IAAA,KAAS,YAAY,OAAOA,IAAA,CAAKE,IAAA,KAAS,UAAU;EACxE,IAAIU,cAAA,CAAec,GAAA,CAAI1B,IAAA,CAAKE,IAAI,KAAKF,IAAA,CAAKE,IAAA,KAAS,aAAa;EAChE,IAAIF,IAAA,CAAKE,IAAA,KAAS,uBAAuB;IACvC,IAAIF,IAAA,CAAKmD,IAAA,KAAS,SAASnD,IAAA,CAAKmD,IAAA,KAAS,SAAS;MAChD,WAAWC,CAAA,IAAKpD,IAAA,CAAKqD,YAAA,IAAgB,EAAC,EAAGtD,mBAAA,CAAoBqD,CAAA,CAAEtB,EAAA,EAAI7B,GAAG;IACxE;IACA;EACF;EACA,IAAID,IAAA,CAAKE,IAAA,KAAS,oBAAoB;IACpC,IAAIF,IAAA,CAAK8B,EAAA,EAAI1B,IAAA,EAAMH,GAAA,CAAIE,IAAA,CAAKH,IAAA,CAAK8B,EAAA,CAAG1B,IAAI;IACxC;EACF;EACAU,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMmB,uBAAA,CAAwBnB,CAAA,EAAG9B,GAAG,CAAC;AACxD;AAEA,MAAMqD,UAAA,GAAa,mBAAIzC,GAAA,CAAI,CACzB,gBACA,kBACA,kBACA,kBACA,mBACD;AAED,SAAS0C,gBAAgBvD,IAAA,EAAgB;EACvC,IAAIA,IAAA,CAAKE,IAAA,KAAS,gBAAgB,OAAOF,IAAA,CAAKwD,IAAA;EAC9C,IAAIxD,IAAA,CAAKE,IAAA,KAAS,oBAAoBF,IAAA,CAAKE,IAAA,KAAS,kBAAkB,OAAOF,IAAA,CAAKW,IAAA;EAClF,OAAO;AACT;AAQA,SAAS8C,cACPC,IAAA,EACA/D,QAAA,EACmC;EACnC,MAAMgE,MAAA,GAASpE,SAAA,CAAUI,QAAA,EAAU+D,IAAA,EAAM;IAAEE,IAAA,EAAMlE,OAAA,CAAQC,QAAQ;EAAE,CAAC;EACpE,IAAI,CAACgE,MAAA,EAAQE,OAAA,IAAWF,MAAA,CAAOG,MAAA,EAAQC,MAAA,EAAQ,OAAO;EAEtD,MAAMC,UAAA,GAAqB,EAAC;EAE5B,SAASC,UAAUjE,IAAA,EAAWkE,eAAA,EAA0B;IACtD,IAAI,CAAClE,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;IAEvC,IAAImE,WAAA,GAAc;IAClB,IAAIb,UAAA,CAAW5B,GAAA,CAAI1B,IAAA,CAAKE,IAAI,KAAKF,IAAA,CAAKqB,IAAA,EAAM;MAG1C,MAAMC,KAAA,GAAkB,EAAC;MACzB,MAAM8C,IAAA,GAAOb,eAAA,CAAgBvD,IAAI;MACjC,IACEoE,IAAA,EAAMlE,IAAA,KAAS,0BACdkE,IAAA,CAAKjB,IAAA,KAAS,SAASiB,IAAA,CAAKjB,IAAA,KAAS,UACtC;QACA,WAAWC,CAAA,IAAKgB,IAAA,CAAKf,YAAA,IAAgB,EAAC,EAAGtD,mBAAA,CAAoBqD,CAAA,CAAEtB,EAAA,EAAIR,KAAK;MAC1E;MACA,MAAM+C,MAAA,GAAS,CAAC,GAAG/C,KAAK;MACxB4B,uBAAA,CAAwBlD,IAAA,CAAKqB,IAAA,EAAMgD,MAAM;MACzC,IAAIA,MAAA,CAAON,MAAA,IAAU3C,iBAAA,CAAkBpB,IAAA,CAAKqB,IAAA,EAAM,IAAIR,GAAA,CAAIwD,MAAM,CAAC,GAAG;QAClEF,WAAA,GAAc;QACd,IAAI,CAACD,eAAA,EAAiBF,UAAA,CAAW7D,IAAA,CAAK;UAAEH,IAAA;UAAMsB;QAAM,CAAC;MACvD;IACF;IAEAR,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMkC,SAAA,CAAUlC,CAAA,EAAGmC,eAAA,IAAmBC,WAAW,CAAC;EACrE;EAEAF,SAAA,CAAUN,MAAA,CAAOE,OAAA,EAAS,KAAK;EAC/B,IAAI,CAACG,UAAA,CAAWD,MAAA,EAAQ,OAAO;EAE/B,MAAMO,CAAA,GAAI,IAAIhF,WAAA,CAAYoE,IAAI;EAC9B,IAAIa,OAAA,GAAU;EACd,IAAIC,OAAA,GAAU;EAEd,WAAW;IAAExE,IAAA;IAAMsB;EAAM,KAAK0C,UAAA,EAAY;IACxC,MAAMS,OAAA,GAAU,IAAI5D,GAAA,CAAIS,KAAK;IAC7B,MAAMc,KAAA,GAAQD,WAAA,CAAYnC,IAAA,CAAKqB,IAAA,EAAMoD,OAAO;IAK5C,IAAIrC,KAAA,CAAMK,QAAA,IAAYL,KAAA,CAAMM,cAAA,IAAkBN,KAAA,CAAMO,cAAA,EAAgB;IAMpE,MAAM+B,MAAA,GAAS,cAAcH,OAAA,EAAS;IACtC,MAAM3C,MAAA,GAASN,KAAA,CAAMqD,IAAA,CAAK,IAAI;IAE9B,IAAIC,QAAA,GAAWlB,IAAA,CAAKmB,KAAA,CAAM7E,IAAA,CAAKqB,IAAA,CAAKyD,KAAA,EAAO9E,IAAA,CAAKqB,IAAA,CAAK0D,GAAG;IACxD,IAAI/E,IAAA,CAAKqB,IAAA,CAAKnB,IAAA,KAAS,kBAAkB;MACvC0E,QAAA,GAAW,KAAKA,QAAQ;IAC1B;IAEA,IAAIxC,KAAA,CAAMC,QAAA,IAAYD,KAAA,CAAMG,SAAA,IAAaH,KAAA,CAAME,WAAA,EAAa;MAC1DsC,QAAA,GAAWI,YAAA,CAAaJ,QAAA,EAAU5E,IAAA,CAAKqB,IAAA,EAAMqC,IAAA,EAAMe,OAAO;IAC5D;IAEA,MAAMQ,OAAA,GAAU7C,KAAA,CAAMI,QAAA,GAAW,WAAW;IAC5C,MAAM0C,OAAA,GAAU9C,KAAA,CAAMI,QAAA,GAAW,WAAW;IAE5C,IAAI2C,IAAA,GAAO,GAAGD,OAAO,GAAGR,MAAM,IAAI9C,MAAM;IACxC,IAAIQ,KAAA,CAAMC,QAAA,IAAYD,KAAA,CAAMG,SAAA,EAAW;MACrC,MAAM6C,MAAA,GAAmB,EAAC;MAC1B,IAAIhD,KAAA,CAAMC,QAAA,EAAU+C,MAAA,CAAOjF,IAAA,CAAK,sBAAsB;MACtD,IAAIiC,KAAA,CAAMG,SAAA,EAAW6C,MAAA,CAAOjF,IAAA,CAAK,sBAAsB;MACvDgF,IAAA,GAAO,cAAcA,IAAI,KAAKC,MAAA,CAAOT,IAAA,CAAK,GAAG,CAAC;IAChD,OAAO;MACLQ,IAAA,GAAO,KAAKA,IAAI;IAClB;IAEAb,CAAA,CAAEe,SAAA,CAAUrF,IAAA,CAAKqB,IAAA,CAAKyD,KAAA,EAAO9E,IAAA,CAAKqB,IAAA,CAAK0D,GAAA,EAAKI,IAAI;IAIhDb,CAAA,CAAEgB,UAAA,CAAWtF,IAAA,CAAK8E,KAAA,EAAO;AAAA,MAAUJ,MAAM,MAAMO,OAAO,IAAIrD,MAAM,QAAQgD,QAAQ;AAAA,CAAK;IACrFN,CAAA,CAAEgB,UAAA,CAAWtF,IAAA,CAAK+E,GAAA,EAAK,KAAK;IAC5BP,OAAA,GAAU;EACZ;EAEA,IAAI,CAACA,OAAA,EAAS,OAAO;EACrB,OAAO;IACLd,IAAA,EAAMY,CAAA,CAAEiB,QAAA,CAAS;IACjBC,GAAA,EAAKlB,CAAA,CAAEmB,WAAA,CAAY;MAAEC,KAAA,EAAO;MAAMC,MAAA,EAAQhG,QAAA;MAAUiG,cAAA,EAAgB;IAAM,CAAC;EAC7E;AACF;AASA,SAASZ,aACPJ,QAAA,EACAiB,QAAA,EACAnC,IAAA,EACApC,KAAA,EACQ;EACR,MAAMwE,MAAA,GAASD,QAAA,CAASf,KAAA;EACxB,MAAMR,CAAA,GAAI,IAAIhF,WAAA,CAAYsF,QAAQ;EAClC,MAAMmB,GAAA,GAAMF,QAAA,CAAS3F,IAAA,KAAS,mBAAmB,IAAI;EAErD,SAASgC,KACPlC,IAAA,EACA4C,iBAAA,EACAC,YAAA,EACAC,UAAA,EACA;IACA,IAAI,CAAC9C,IAAA,IAAQ,OAAOA,IAAA,KAAS,UAAU;IAEvC,IAAIY,cAAA,CAAec,GAAA,CAAI1B,IAAA,CAAKE,IAAI,GAAG;MACjCY,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IAAMG,IAAA,CAAKH,CAAA,EAAGa,iBAAA,EAAmBC,YAAA,EAAc,IAAI,CAAC;MACrE;IACF;IAEA,IAAI7C,IAAA,CAAKE,IAAA,KAAS,oBAAoB,CAACF,IAAA,CAAK+C,KAAA,IAAS,CAACH,iBAAA,EAAmB;MACvE0B,CAAA,CAAEe,SAAA,CAAUrF,IAAA,CAAK8E,KAAA,GAAQgB,MAAA,GAASC,GAAA,EAAK/F,IAAA,CAAK+E,GAAA,GAAMe,MAAA,GAASC,GAAA,EAAK,WAAW;MAC3E;IACF;IACA,IAAI/F,IAAA,CAAKE,IAAA,KAAS,uBAAuB,CAACF,IAAA,CAAK+C,KAAA,IAAS,CAACF,YAAA,EAAc;MACrEyB,CAAA,CAAEe,SAAA,CAAUrF,IAAA,CAAK8E,KAAA,GAAQgB,MAAA,GAASC,GAAA,EAAK/F,IAAA,CAAK+E,GAAA,GAAMe,MAAA,GAASC,GAAA,EAAK,SAAS;MACzE;IACF;IACA,IAAI/F,IAAA,CAAKE,IAAA,KAAS,qBAAqB,CAAC4C,UAAA,EAAY;MAClD,MAAMkD,GAAA,GAAMhG,IAAA,CAAKQ,QAAA;MACjB,MAAMyF,WAAA,GAAcD,GAAA,GAChB,eAAetC,IAAA,CAAKmB,KAAA,CAAMmB,GAAA,CAAIlB,KAAA,EAAOkB,GAAA,CAAIjB,GAAG,CAAC,QAC7C;MACJT,CAAA,CAAEe,SAAA,CAAUrF,IAAA,CAAK8E,KAAA,GAAQgB,MAAA,GAASC,GAAA,EAAK/F,IAAA,CAAK+E,GAAA,GAAMe,MAAA,GAASC,GAAA,EAAKE,WAAW;MAC3E;IACF;IAEA,MAAMjD,MAAA,GACJhD,IAAA,CAAKE,IAAA,KAAS,kBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS,oBACdF,IAAA,CAAKE,IAAA,KAAS;IAChB,MAAM+C,WAAA,GAAcD,MAAA,IAAUhD,IAAA,CAAKE,IAAA,KAAS;IAE5CY,SAAA,CAAUd,IAAA,EAAO+B,CAAA,IACfG,IAAA,CAAKH,CAAA,EAAGa,iBAAA,IAAqBK,WAAA,EAAaJ,YAAA,IAAgBG,MAAA,EAAQF,UAAU,CAC9E;EACF;EAEAZ,IAAA,CAAK2D,QAAA,EAAU,OAAO,OAAO,KAAK;EAClC,OAAOvB,CAAA,CAAEiB,QAAA,CAAS;AACpB;AAEO,SAASW,qBACdxC,IAAA,EACA/D,QAAA,EACsC;EACtC,IAAI,CAACH,OAAA,CAAQ2G,IAAA,CAAKzC,IAAI,KAAK,CAACjE,UAAA,CAAW0G,IAAA,CAAKzC,IAAI,GAAG,OAAO;EAE1D,IAAI0C,OAAA,GAAU1C,IAAA;EACd,MAAM2C,IAAA,GAAc,EAAC;EAIrB,SAASC,CAAA,GAAI,GAAGA,CAAA,GAAI,IAAIA,CAAA,IAAK;IAC3B,MAAMC,IAAA,GAAO9C,aAAA,CAAc2C,OAAA,EAASzG,QAAQ;IAC5C,IAAI,CAAC4G,IAAA,EAAM;IACXH,OAAA,GAAUG,IAAA,CAAK7C,IAAA;IACf2C,IAAA,CAAKlG,IAAA,CAAKoG,IAAA,CAAKf,GAAG;EACpB;EAEA,OAAOa,IAAA,CAAKtC,MAAA,GAAS;IAAEL,IAAA,EAAM0C,OAAA;IAASC;EAAK,IAAI;AACjD","ignoreList":[]}
1
+ {"version":3,"file":"transformHermesLoops.js","names":[],"sources":["esm/transformHermesLoops.js"],"sourcesContent":["import MagicString from \"magic-string\";\nimport { parseSync } from \"oxc-parser\";\nconst LOOP_RE = /\\b(?:for|while)\\s*(?:await\\s+)?\\(/;\nconst LEXICAL_RE = /\\b(?:let|const|class)\\b/;\nfunction langFor(filename) {\n const ext = filename.split(\"?\")[0].split(\".\").pop() || \"js\";\n if (ext === \"ts\" || ext === \"cts\" || ext === \"mts\") return \"ts\";\n if (ext === \"tsx\") return \"tsx\";\n return \"jsx\";\n}\nfunction collectPatternNames(node, out) {\n if (!node || typeof node !== \"object\") return;\n switch (node.type) {\n case \"Identifier\":\n out.push(node.name);\n return;\n case \"ObjectPattern\":\n for (const p of node.properties || []) {\n collectPatternNames(p.value ?? p.argument, out);\n }\n return;\n case \"ArrayPattern\":\n for (const el of node.elements || []) collectPatternNames(el, out);\n return;\n case \"AssignmentPattern\":\n collectPatternNames(node.left, out);\n return;\n case \"RestElement\":\n collectPatternNames(node.argument, out);\n return;\n }\n}\nconst FUNCTION_TYPES = /* @__PURE__ */ new Set([\n \"FunctionDeclaration\",\n \"FunctionExpression\",\n \"ArrowFunctionExpression\"\n]);\nfunction eachChild(node, fn) {\n for (const key in node) {\n if (key === \"type\" || key === \"start\" || key === \"end\" || key === \"parent\") continue;\n const value = node[key];\n if (Array.isArray(value)) {\n for (const item of value) {\n if (item && typeof item.type === \"string\") fn(item);\n }\n } else if (value && typeof value === \"object\" && typeof value.type === \"string\") {\n fn(value);\n }\n }\n}\nfunction capturesInClosure(body, names) {\n let found = false;\n function scanInsideFunction(node, shadowed) {\n if (found || !node || typeof node !== \"object\") return;\n if (node.type === \"Identifier\" && names.has(node.name) && !shadowed.has(node.name)) {\n found = true;\n return;\n }\n if (FUNCTION_TYPES.has(node.type)) {\n const inner = new Set(shadowed);\n const params = [];\n for (const p of node.params || []) collectPatternNames(p, params);\n for (const p of params) inner.add(p);\n if (node.id?.name) inner.add(node.id.name);\n eachChild(node, (c) => scanInsideFunction(c, inner));\n return;\n }\n if (node.type === \"MemberExpression\" && !node.computed) {\n scanInsideFunction(node.object, shadowed);\n return;\n }\n if (node.type === \"Property\" && !node.computed && node.key === node.value) {\n scanInsideFunction(node.value, shadowed);\n return;\n }\n eachChild(node, (c) => scanInsideFunction(c, shadowed));\n }\n function walk(node) {\n if (found || !node || typeof node !== \"object\") return;\n if (FUNCTION_TYPES.has(node.type)) {\n const shadowed = /* @__PURE__ */ new Set();\n const params = [];\n for (const p of node.params || []) collectPatternNames(p, params);\n for (const p of params) shadowed.add(p);\n eachChild(node, (c) => scanInsideFunction(c, shadowed));\n return;\n }\n eachChild(node, walk);\n }\n walk(body);\n return found;\n}\nfunction analyzeBody(body, names) {\n const facts = {\n hasBreak: false,\n hasContinue: false,\n hasReturn: false,\n hasAwait: false,\n hasYield: false,\n assignsBinding: false,\n hasLabeledJump: false\n };\n function walk(node, inNestedBreakable, inNestedLoop, inFunction) {\n if (!node || typeof node !== \"object\") return;\n if (FUNCTION_TYPES.has(node.type)) {\n eachChild(node, (c) => walk(c, inNestedBreakable, inNestedLoop, true));\n return;\n }\n switch (node.type) {\n case \"BreakStatement\":\n if (node.label) facts.hasLabeledJump = true;\n else if (!inNestedBreakable) facts.hasBreak = true;\n break;\n case \"ContinueStatement\":\n if (node.label) facts.hasLabeledJump = true;\n else if (!inNestedLoop) facts.hasContinue = true;\n break;\n case \"ReturnStatement\":\n if (!inFunction) facts.hasReturn = true;\n break;\n case \"AwaitExpression\":\n if (!inFunction) facts.hasAwait = true;\n break;\n case \"YieldExpression\":\n if (!inFunction) facts.hasYield = true;\n break;\n case \"AssignmentExpression\":\n if (node.left?.type === \"Identifier\" && names.has(node.left.name)) {\n facts.assignsBinding = true;\n }\n break;\n case \"UpdateExpression\":\n if (node.argument?.type === \"Identifier\" && names.has(node.argument.name)) {\n facts.assignsBinding = true;\n }\n break;\n }\n const isLoop = node.type === \"ForStatement\" || node.type === \"ForOfStatement\" || node.type === \"ForInStatement\" || node.type === \"WhileStatement\" || node.type === \"DoWhileStatement\";\n const isBreakable = isLoop || node.type === \"SwitchStatement\";\n eachChild(\n node,\n (c) => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction)\n );\n }\n walk(body, false, false, false);\n return facts;\n}\nfunction collectBodyLexicalNames(node, out) {\n if (!node || typeof node !== \"object\" || typeof node.type !== \"string\") return;\n if (FUNCTION_TYPES.has(node.type) || node.type === \"ClassBody\") return;\n if (node.type === \"VariableDeclaration\") {\n if (node.kind === \"let\" || node.kind === \"const\") {\n for (const d of node.declarations || []) collectPatternNames(d.id, out);\n }\n return;\n }\n if (node.type === \"ClassDeclaration\") {\n if (node.id?.name) out.push(node.id.name);\n return;\n }\n eachChild(node, (c) => collectBodyLexicalNames(c, out));\n}\nconst LOOP_TYPES = /* @__PURE__ */ new Set([\n \"ForStatement\",\n \"ForOfStatement\",\n \"ForInStatement\",\n \"WhileStatement\",\n \"DoWhileStatement\"\n]);\nfunction headDeclaration(node) {\n if (node.type === \"ForStatement\") return node.init;\n if (node.type === \"ForOfStatement\" || node.type === \"ForInStatement\") return node.left;\n return null;\n}\nfunction transformOnce(code, filename) {\n const parsed = parseSync(filename, code, { lang: langFor(filename) });\n if (!parsed?.program || parsed.errors?.length) return null;\n const candidates = [];\n function findLoops(node, insideCandidate) {\n if (!node || typeof node !== \"object\") return;\n let isCandidate = false;\n if (LOOP_TYPES.has(node.type) && node.body) {\n const names = [];\n const decl = headDeclaration(node);\n if (decl?.type === \"VariableDeclaration\" && (decl.kind === \"let\" || decl.kind === \"const\")) {\n for (const d of decl.declarations || []) collectPatternNames(d.id, names);\n }\n const shared = [...names];\n collectBodyLexicalNames(node.body, shared);\n if (shared.length && capturesInClosure(node.body, new Set(shared))) {\n isCandidate = true;\n if (!insideCandidate) candidates.push({ node, names });\n }\n }\n eachChild(node, (c) => findLoops(c, insideCandidate || isCandidate));\n }\n findLoops(parsed.program, false);\n if (!candidates.length) return null;\n const s = new MagicString(code);\n let counter = 0;\n let changed = false;\n for (const { node, names } of candidates) {\n const nameSet = new Set(names);\n const facts = analyzeBody(node.body, nameSet);\n if (facts.hasYield || facts.assignsBinding || facts.hasLabeledJump) continue;\n const fnName = `_hermesLoop${counter++}`;\n const params = names.join(\", \");\n let bodyText = code.slice(node.body.start, node.body.end);\n if (node.body.type !== \"BlockStatement\") {\n bodyText = `{ ${bodyText} }`;\n }\n if (facts.hasBreak || facts.hasReturn || facts.hasContinue) {\n bodyText = rewriteJumps(bodyText, node.body, code, nameSet);\n }\n const asyncKw = facts.hasAwait ? \"async \" : \"\";\n const awaitKw = facts.hasAwait ? \"await \" : \"\";\n let call = `${awaitKw}${fnName}(${params})`;\n if (facts.hasBreak || facts.hasReturn) {\n const checks = [];\n if (facts.hasBreak) checks.push(\"if (_r === 1) break;\");\n if (facts.hasReturn) checks.push(\"if (_r) return _r.v;\");\n call = `{ var _r = ${call}; ${checks.join(\" \")} }`;\n } else {\n call = `{ ${call}; }`;\n }\n s.overwrite(node.body.start, node.body.end, call);\n s.appendLeft(node.start, `{\nvar ${fnName} = ${asyncKw}(${params}) => ${bodyText};\n`);\n s.appendLeft(node.end, \"\\n}\");\n changed = true;\n }\n if (!changed) return null;\n return {\n code: s.toString(),\n map: s.generateMap({ hires: true, source: filename, includeContent: false })\n };\n}\nfunction rewriteJumps(bodyText, bodyNode, code, names) {\n const offset = bodyNode.start;\n const s = new MagicString(bodyText);\n const pad = bodyNode.type === \"BlockStatement\" ? 0 : 2;\n function walk(node, inNestedBreakable, inNestedLoop, inFunction) {\n if (!node || typeof node !== \"object\") return;\n if (FUNCTION_TYPES.has(node.type)) {\n eachChild(node, (c) => walk(c, inNestedBreakable, inNestedLoop, true));\n return;\n }\n if (node.type === \"BreakStatement\" && !node.label && !inNestedBreakable) {\n s.overwrite(node.start - offset + pad, node.end - offset + pad, \"return 1;\");\n return;\n }\n if (node.type === \"ContinueStatement\" && !node.label && !inNestedLoop) {\n s.overwrite(node.start - offset + pad, node.end - offset + pad, \"return;\");\n return;\n }\n if (node.type === \"ReturnStatement\" && !inFunction) {\n const arg = node.argument;\n const replacement = arg ? `return { v: ${code.slice(arg.start, arg.end)} };` : \"return { v: undefined };\";\n s.overwrite(node.start - offset + pad, node.end - offset + pad, replacement);\n return;\n }\n const isLoop = node.type === \"ForStatement\" || node.type === \"ForOfStatement\" || node.type === \"ForInStatement\" || node.type === \"WhileStatement\" || node.type === \"DoWhileStatement\";\n const isBreakable = isLoop || node.type === \"SwitchStatement\";\n eachChild(\n node,\n (c) => walk(c, inNestedBreakable || isBreakable, inNestedLoop || isLoop, inFunction)\n );\n }\n walk(bodyNode, false, false, false);\n return s.toString();\n}\nfunction transformHermesLoops(code, filename) {\n if (!LOOP_RE.test(code) || !LEXICAL_RE.test(code)) return null;\n let current = code;\n const maps = [];\n for (let i = 0; i < 10; i++) {\n const next = transformOnce(current, filename);\n if (!next) break;\n current = next.code;\n maps.push(next.map);\n }\n return maps.length ? { code: current, maps } : null;\n}\nexport {\n transformHermesLoops\n};\n//# sourceMappingURL=transformHermesLoops.js.map\n"],"mappings":";;;;AAEA,MAAM,UAAU;AAChB,MAAM,aAAa;AACnB,SAAS,QAAQ,UAAU;CACzB,MAAM,MAAM,SAAS,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;CACvD,IAAI,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,OAAO,OAAO;CAC3D,IAAI,QAAQ,OAAO,OAAO;CAC1B,OAAO;AACT;AACA,SAAS,oBAAoB,MAAM,KAAK;CACtC,IAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;CACvC,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,IAAI,KAAK,KAAK,IAAI;GAClB;EACF,KAAK;GACH,KAAK,MAAM,KAAK,KAAK,cAAc,CAAC,GAAG;IACrC,oBAAoB,EAAE,SAAS,EAAE,UAAU,GAAG;GAChD;GACA;EACF,KAAK;GACH,KAAK,MAAM,MAAM,KAAK,YAAY,CAAC,GAAG,oBAAoB,IAAI,GAAG;GACjE;EACF,KAAK;GACH,oBAAoB,KAAK,MAAM,GAAG;GAClC;EACF,KAAK;GACH,oBAAoB,KAAK,UAAU,GAAG;GACtC;CACJ;AACF;AACA,MAAM,iCAAiC,IAAI,IAAI;CAC7C;CACA;CACA;AACF,CAAC;AACD,SAAS,UAAU,MAAM,IAAI;CAC3B,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,QAAQ,UAAU,QAAQ,WAAW,QAAQ,SAAS,QAAQ,UAAU;EAC5E,MAAM,QAAQ,KAAK;EACnB,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,QAAQ,OAAO,KAAK,SAAS,UAAU,GAAG,IAAI;GACpD;EACF,OAAO,IAAI,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,SAAS,UAAU;GAC/E,GAAG,KAAK;EACV;CACF;AACF;AACA,SAAS,kBAAkB,MAAM,OAAO;CACtC,IAAI,QAAQ;CACZ,SAAS,mBAAmB,MAAM,UAAU;EAC1C,IAAI,SAAS,CAAC,QAAQ,OAAO,SAAS,UAAU;EAChD,IAAI,KAAK,SAAS,gBAAgB,MAAM,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,IAAI,GAAG;GAClF,QAAQ;GACR;EACF;EACA,IAAI,eAAe,IAAI,KAAK,IAAI,GAAG;GACjC,MAAM,QAAQ,IAAI,IAAI,QAAQ;GAC9B,MAAM,SAAS,CAAC;GAChB,KAAK,MAAM,KAAK,KAAK,UAAU,CAAC,GAAG,oBAAoB,GAAG,MAAM;GAChE,KAAK,MAAM,KAAK,QAAQ,MAAM,IAAI,CAAC;GACnC,IAAI,KAAK,IAAI,MAAM,MAAM,IAAI,KAAK,GAAG,IAAI;GACzC,UAAU,OAAO,MAAM,mBAAmB,GAAG,KAAK,CAAC;GACnD;EACF;EACA,IAAI,KAAK,SAAS,sBAAsB,CAAC,KAAK,UAAU;GACtD,mBAAmB,KAAK,QAAQ,QAAQ;GACxC;EACF;EACA,IAAI,KAAK,SAAS,cAAc,CAAC,KAAK,YAAY,KAAK,QAAQ,KAAK,OAAO;GACzE,mBAAmB,KAAK,OAAO,QAAQ;GACvC;EACF;EACA,UAAU,OAAO,MAAM,mBAAmB,GAAG,QAAQ,CAAC;CACxD;CACA,SAAS,KAAK,MAAM;EAClB,IAAI,SAAS,CAAC,QAAQ,OAAO,SAAS,UAAU;EAChD,IAAI,eAAe,IAAI,KAAK,IAAI,GAAG;GACjC,MAAM,2BAA2B,IAAI,IAAI;GACzC,MAAM,SAAS,CAAC;GAChB,KAAK,MAAM,KAAK,KAAK,UAAU,CAAC,GAAG,oBAAoB,GAAG,MAAM;GAChE,KAAK,MAAM,KAAK,QAAQ,SAAS,IAAI,CAAC;GACtC,UAAU,OAAO,MAAM,mBAAmB,GAAG,QAAQ,CAAC;GACtD;EACF;EACA,UAAU,MAAM,IAAI;CACtB;CACA,KAAK,IAAI;CACT,OAAO;AACT;AACA,SAAS,YAAY,MAAM,OAAO;CAChC,MAAM,QAAQ;EACZ,UAAU;EACV,aAAa;EACb,WAAW;EACX,UAAU;EACV,UAAU;EACV,gBAAgB;EAChB,gBAAgB;CAClB;CACA,SAAS,KAAK,MAAM,mBAAmB,cAAc,YAAY;EAC/D,IAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;EACvC,IAAI,eAAe,IAAI,KAAK,IAAI,GAAG;GACjC,UAAU,OAAO,MAAM,KAAK,GAAG,mBAAmB,cAAc,IAAI,CAAC;GACrE;EACF;EACA,QAAQ,KAAK,MAAb;GACE,KAAK;IACH,IAAI,KAAK,OAAO,MAAM,iBAAiB;SAClC,IAAI,CAAC,mBAAmB,MAAM,WAAW;IAC9C;GACF,KAAK;IACH,IAAI,KAAK,OAAO,MAAM,iBAAiB;SAClC,IAAI,CAAC,cAAc,MAAM,cAAc;IAC5C;GACF,KAAK;IACH,IAAI,CAAC,YAAY,MAAM,YAAY;IACnC;GACF,KAAK;IACH,IAAI,CAAC,YAAY,MAAM,WAAW;IAClC;GACF,KAAK;IACH,IAAI,CAAC,YAAY,MAAM,WAAW;IAClC;GACF,KAAK;IACH,IAAI,KAAK,MAAM,SAAS,gBAAgB,MAAM,IAAI,KAAK,KAAK,IAAI,GAAG;KACjE,MAAM,iBAAiB;IACzB;IACA;GACF,KAAK;IACH,IAAI,KAAK,UAAU,SAAS,gBAAgB,MAAM,IAAI,KAAK,SAAS,IAAI,GAAG;KACzE,MAAM,iBAAiB;IACzB;IACA;EACJ;EACA,MAAM,SAAS,KAAK,SAAS,kBAAkB,KAAK,SAAS,oBAAoB,KAAK,SAAS,oBAAoB,KAAK,SAAS,oBAAoB,KAAK,SAAS;EACnK,MAAM,cAAc,UAAU,KAAK,SAAS;EAC5C,UACE,OACC,MAAM,KAAK,GAAG,qBAAqB,aAAa,gBAAgB,QAAQ,UAAU,CACrF;CACF;CACA,KAAK,MAAM,OAAO,OAAO,KAAK;CAC9B,OAAO;AACT;AACA,SAAS,wBAAwB,MAAM,KAAK;CAC1C,IAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,OAAO,KAAK,SAAS,UAAU;CACxE,IAAI,eAAe,IAAI,KAAK,IAAI,KAAK,KAAK,SAAS,aAAa;CAChE,IAAI,KAAK,SAAS,uBAAuB;EACvC,IAAI,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS;GAChD,KAAK,MAAM,KAAK,KAAK,gBAAgB,CAAC,GAAG,oBAAoB,EAAE,IAAI,GAAG;EACxE;EACA;CACF;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,KAAK,GAAG,IAAI;EACxC;CACF;CACA,UAAU,OAAO,MAAM,wBAAwB,GAAG,GAAG,CAAC;AACxD;AACA,MAAM,6BAA6B,IAAI,IAAI;CACzC;CACA;CACA;CACA;CACA;AACF,CAAC;AACD,SAAS,gBAAgB,MAAM;CAC7B,IAAI,KAAK,SAAS,gBAAgB,OAAO,KAAK;CAC9C,IAAI,KAAK,SAAS,oBAAoB,KAAK,SAAS,kBAAkB,OAAO,KAAK;CAClF,OAAO;AACT;AACA,SAAS,cAAc,MAAM,UAAU;CACrC,MAAM,SAAS,UAAU,UAAU,MAAM,EAAE,MAAM,QAAQ,QAAQ,EAAE,CAAC;CACpE,IAAI,CAAC,QAAQ,WAAW,OAAO,QAAQ,QAAQ,OAAO;CACtD,MAAM,aAAa,CAAC;CACpB,SAAS,UAAU,MAAM,iBAAiB;EACxC,IAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;EACvC,IAAI,cAAc;EAClB,IAAI,WAAW,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM;GAC1C,MAAM,QAAQ,CAAC;GACf,MAAM,OAAO,gBAAgB,IAAI;GACjC,IAAI,MAAM,SAAS,0BAA0B,KAAK,SAAS,SAAS,KAAK,SAAS,UAAU;IAC1F,KAAK,MAAM,KAAK,KAAK,gBAAgB,CAAC,GAAG,oBAAoB,EAAE,IAAI,KAAK;GAC1E;GACA,MAAM,SAAS,CAAC,GAAG,KAAK;GACxB,wBAAwB,KAAK,MAAM,MAAM;GACzC,IAAI,OAAO,UAAU,kBAAkB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,GAAG;IAClE,cAAc;IACd,IAAI,CAAC,iBAAiB,WAAW,KAAK;KAAE;KAAM;IAAM,CAAC;GACvD;EACF;EACA,UAAU,OAAO,MAAM,UAAU,GAAG,mBAAmB,WAAW,CAAC;CACrE;CACA,UAAU,OAAO,SAAS,KAAK;CAC/B,IAAI,CAAC,WAAW,QAAQ,OAAO;CAC/B,MAAM,IAAI,IAAI,YAAY,IAAI;CAC9B,IAAI,UAAU;CACd,IAAI,UAAU;CACd,KAAK,MAAM,EAAE,MAAM,WAAW,YAAY;EACxC,MAAM,UAAU,IAAI,IAAI,KAAK;EAC7B,MAAM,QAAQ,YAAY,KAAK,MAAM,OAAO;EAC5C,IAAI,MAAM,YAAY,MAAM,kBAAkB,MAAM,gBAAgB;EACpE,MAAM,SAAS,cAAc;EAC7B,MAAM,SAAS,MAAM,KAAK,IAAI;EAC9B,IAAI,WAAW,KAAK,MAAM,KAAK,KAAK,OAAO,KAAK,KAAK,GAAG;EACxD,IAAI,KAAK,KAAK,SAAS,kBAAkB;GACvC,WAAW,KAAK,SAAS;EAC3B;EACA,IAAI,MAAM,YAAY,MAAM,aAAa,MAAM,aAAa;GAC1D,WAAW,aAAa,UAAU,KAAK,MAAM,MAAM,OAAO;EAC5D;EACA,MAAM,UAAU,MAAM,WAAW,WAAW;EAC5C,MAAM,UAAU,MAAM,WAAW,WAAW;EAC5C,IAAI,OAAO,GAAG,UAAU,OAAO,GAAG,OAAO;EACzC,IAAI,MAAM,YAAY,MAAM,WAAW;GACrC,MAAM,SAAS,CAAC;GAChB,IAAI,MAAM,UAAU,OAAO,KAAK,sBAAsB;GACtD,IAAI,MAAM,WAAW,OAAO,KAAK,sBAAsB;GACvD,OAAO,cAAc,KAAK,IAAI,OAAO,KAAK,GAAG,EAAE;EACjD,OAAO;GACL,OAAO,KAAK,KAAK;EACnB;EACA,EAAE,UAAU,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI;EAChD,EAAE,WAAW,KAAK,OAAO;MACvB,OAAO,KAAK,QAAQ,GAAG,OAAO,OAAO,SAAS;CACnD;EACG,EAAE,WAAW,KAAK,KAAK,KAAK;EAC5B,UAAU;CACZ;CACA,IAAI,CAAC,SAAS,OAAO;CACrB,OAAO;EACL,MAAM,EAAE,SAAS;EACjB,KAAK,EAAE,YAAY;GAAE,OAAO;GAAM,QAAQ;GAAU,gBAAgB;EAAM,CAAC;CAC7E;AACF;AACA,SAAS,aAAa,UAAU,UAAU,MAAM,OAAO;CACrD,MAAM,SAAS,SAAS;CACxB,MAAM,IAAI,IAAI,YAAY,QAAQ;CAClC,MAAM,MAAM,SAAS,SAAS,mBAAmB,IAAI;CACrD,SAAS,KAAK,MAAM,mBAAmB,cAAc,YAAY;EAC/D,IAAI,CAAC,QAAQ,OAAO,SAAS,UAAU;EACvC,IAAI,eAAe,IAAI,KAAK,IAAI,GAAG;GACjC,UAAU,OAAO,MAAM,KAAK,GAAG,mBAAmB,cAAc,IAAI,CAAC;GACrE;EACF;EACA,IAAI,KAAK,SAAS,oBAAoB,CAAC,KAAK,SAAS,CAAC,mBAAmB;GACvE,EAAE,UAAU,KAAK,QAAQ,SAAS,KAAK,KAAK,MAAM,SAAS,KAAK,WAAW;GAC3E;EACF;EACA,IAAI,KAAK,SAAS,uBAAuB,CAAC,KAAK,SAAS,CAAC,cAAc;GACrE,EAAE,UAAU,KAAK,QAAQ,SAAS,KAAK,KAAK,MAAM,SAAS,KAAK,SAAS;GACzE;EACF;EACA,IAAI,KAAK,SAAS,qBAAqB,CAAC,YAAY;GAClD,MAAM,MAAM,KAAK;GACjB,MAAM,cAAc,MAAM,eAAe,KAAK,MAAM,IAAI,OAAO,IAAI,GAAG,EAAE,OAAO;GAC/E,EAAE,UAAU,KAAK,QAAQ,SAAS,KAAK,KAAK,MAAM,SAAS,KAAK,WAAW;GAC3E;EACF;EACA,MAAM,SAAS,KAAK,SAAS,kBAAkB,KAAK,SAAS,oBAAoB,KAAK,SAAS,oBAAoB,KAAK,SAAS,oBAAoB,KAAK,SAAS;EACnK,MAAM,cAAc,UAAU,KAAK,SAAS;EAC5C,UACE,OACC,MAAM,KAAK,GAAG,qBAAqB,aAAa,gBAAgB,QAAQ,UAAU,CACrF;CACF;CACA,KAAK,UAAU,OAAO,OAAO,KAAK;CAClC,OAAO,EAAE,SAAS;AACpB;AACA,SAAS,qBAAqB,MAAM,UAAU;CAC5C,IAAI,CAAC,QAAQ,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI,GAAG,OAAO;CAC1D,IAAI,UAAU;CACd,MAAM,OAAO,CAAC;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,OAAO,cAAc,SAAS,QAAQ;EAC5C,IAAI,CAAC,MAAM;EACX,UAAU,KAAK;EACf,KAAK,KAAK,KAAK,GAAG;CACpB;CACA,OAAO,KAAK,SAAS;EAAE,MAAM;EAAS;CAAK,IAAI;AACjD"}