Initial pass at dead code elimination
This is a first pass at DCE without having read any literate on the subject, so lemme know if there's a better approach. That said the algorithm is: * Keep a `Set<Identifier>` of identifiers that are used (and whose constructing logic cannot be removed). * Do a first RPO iteration of all block's phis. Any phi operand that participates in a loop is preemptively marked as "used" even if it isn't strictly used somewhere. This step is necessary bc these operands may otherwise not be used. * Do a second post-order iteration of all blocks, including iterating first their terminals, then reverse iteration of instructions, then their phis. Mark the operands of each as used as we encounter them, and prune instructions whose lvalue is never used. For now I was conservative about which types of instructions can be pruned. For example, call instructions are never pruned, even if the result of the call is never used. However one catch is that we currently prune instructions that cause values to become frozen. We had planned to add runtime calls (in dev) to freeze values for runtime enforcement, and if we want to do that we can always add these instructions back (or replace them with explicit freeze calls). There are a few potential next steps but we should discuss whether they're worth it: * Use fixpoint iteration to find exactly which operands are actually used. This would allow us to to prune cases such as `let x = 0; while (...) { x += 1 }` eg where there's a phi but the result is never used. Such cases should be rare in practice though. * Eliminate more types of instructions, eg eliminate function calls that don't have any mutable arguments.
Joe Savona committed
Feb 3, 2023 at 14:55 UTC
19e21b73a7962d458b2f34c5c6becb622f13bf5c
41 files changed
+230
-176
compiler/forget/src/CompilerPipeline.ts
+5
-2
@@ -6,7 +6,6 @@
6
*/
7
import { NodePath } from "@babel/traverse";
8
import * as t from "@babel/types";
9
-import { CompilerError } from "./CompilerError";
9
import {
10
HIRFunction,
11
lower,
@@ -18,7 +17,7 @@ import {
17
inferMutableRanges,
18
inferReferenceEffects,
19
} from "./Inference";
21
-import { constantPropagation } from "./Optimization";
20
+import { constantPropagation, deadCodeElimination } from "./Optimization";
21
import {
22
alignReactiveScopesToBlockScopes,
23
buildReactiveBlocks,
@@ -71,6 +70,10 @@ export function* run(
70
inferReferenceEffects(hir);
71
yield log({ kind: "hir", name: "InferReferenceEffects", value: hir });
72
73
+ // Note: Has to come after infer reference effects because "dead" code may still affect inference
74
+ deadCodeElimination(hir);
75
+ yield log({ kind: "hir", name: "DeadCodeElimination", value: hir });
76
+
77
inferMutableRanges(hir);
78
yield log({ kind: "hir", name: "InferMutableRanges", value: hir });
79
compiler/forget/src/Optimization/ConstantPropagation.ts
+1
-1
@@ -112,7 +112,7 @@ function applyConstantPropagation(fn: HIRFunction): boolean {
112
switch (terminal.kind) {
113
case "if": {
114
const testValue = read(constants, terminal.test);
115
- if (testValue !== null && testValue.kind === "Primitive") {
115
+ if (testValue !== null) {
116
hasChanges = true;
117
const targetBlockId = Boolean(testValue.value)
118
? terminal.consequent
compiler/forget/src/Optimization/DeadCodeElimination.ts
new
+140
@@ -0,0 +1,140 @@
1
+/**
2
+ * Copyright (c) Facebook, Inc. and its affiliates.
3
+ *
4
+ * This source code is licensed under the MIT license found in the
5
+ * LICENSE file in the root directory of this source tree.
6
+ */
7
+
8
+import {
9
+ BlockId,
10
+ HIRFunction,
11
+ Identifier,
12
+ Instruction,
13
+ InstructionValue,
14
+} from "../HIR";
15
+import {
16
+ eachInstructionValueOperand,
17
+ eachTerminalOperand,
18
+} from "../HIR/visitors";
19
+import { assertExhaustive } from "../Utils/utils";
20
+
21
+/**
22
+ * Implements dead-code elimination, eliminating instructions whose values are unused.
23
+ *
24
+ * Note that unreachable blocks are already pruned during HIR construction.
25
+ */
26
+export function deadCodeElimination(fn: HIRFunction): void {
27
+ const used = new Set<Identifier>();
28
+
29
+ // Find any phi operands involved in a loop, which might otherwise appear as dead
30
+ // code when using a reverse iteration.
31
+ //
32
+ // A more advanced algorithm could still prune some of these operands
33
+ // let's keep it simple for now
34
+ const seen = new Set<BlockId>();
35
+ for (const [, block] of fn.body.blocks) {
36
+ for (const phi of block.phis) {
37
+ for (const [pred, operand] of phi.operands) {
38
+ if (!seen.has(pred)) {
39
+ used.add(operand);
40
+ }
41
+ }
42
+ }
43
+ seen.add(block.id);
44
+ }
45
+
46
+ // Iterate blocks in postorder (successors before predecessors, excepting loops)
47
+ // to find usages before declarations
48
+ const reversedBlocks = [...fn.body.blocks.values()].reverse();
49
+ for (const block of reversedBlocks) {
50
+ for (const operand of eachTerminalOperand(block.terminal)) {
51
+ used.add(operand.identifier);
52
+ }
53
+
54
+ let nextInstructions: Array<Instruction> | null = null;
55
+ for (let i = block.instructions.length - 1; i >= 0; i--) {
56
+ const instr = block.instructions[i]!;
57
+ if (
58
+ !used.has(instr.lvalue.place.identifier) &&
59
+ pruneableValue(instr.value) &&
60
+ // Can't prune the last value of a value block, that's its value!
61
+ !(block.kind !== "block" && i === block.instructions.length - 1)
62
+ ) {
63
+ continue;
64
+ }
65
+ used.add(instr.lvalue.place.identifier);
66
+ nextInstructions ??= [];
67
+ nextInstructions.push(instr);
68
+ for (const operand of eachInstructionValueOperand(instr.value)) {
69
+ used.add(operand.identifier);
70
+ }
71
+ }
72
+ if (nextInstructions !== null) {
73
+ nextInstructions.reverse();
74
+ block.instructions = nextInstructions;
75
+ }
76
+ for (const phi of block.phis) {
77
+ if (used.has(phi.id)) {
78
+ for (const [, operand] of phi.operands) {
79
+ used.add(operand);
80
+ }
81
+ } else {
82
+ for (const [, operand] of phi.operands) {
83
+ if (used.has(operand)) {
84
+ used.add(phi.id);
85
+ for (const [, operand] of phi.operands) {
86
+ used.add(operand);
87
+ }
88
+ break;
89
+ }
90
+ }
91
+ }
92
+ }
93
+ }
94
+}
95
+
96
+/**
97
+ * Returns true if it is safe to prune an instruction with the given value.
98
+ * Functions which may have side-
99
+ */
100
+function pruneableValue(value: InstructionValue): boolean {
101
+ switch (value.kind) {
102
+ case "CallExpression":
103
+ case "ComputedCall":
104
+ case "ComputedStore":
105
+ case "PropertyCall":
106
+ case "PropertyStore": {
107
+ // Mutating instructions are not safe to prune.
108
+ // TODO: we could be more precise and make this conditional on whether
109
+ // any arguments are actually modified
110
+ return false;
111
+ }
112
+ case "NewExpression":
113
+ case "UnsupportedNode":
114
+ case "TaggedTemplateExpression": {
115
+ // Potentially safe to prune, since they should just be creating new values
116
+ return false;
117
+ }
118
+ case "ArrayExpression":
119
+ case "BinaryExpression":
120
+ case "ComputedLoad":
121
+ case "ComputedStore":
122
+ case "FunctionExpression":
123
+ case "Identifier":
124
+ case "JsxExpression":
125
+ case "JsxFragment":
126
+ case "JSXText":
127
+ case "ObjectExpression":
128
+ case "Primitive":
129
+ case "PropertyLoad":
130
+ case "TemplateLiteral":
131
+ case "TypeCastExpression":
132
+ case "UnaryExpression": {
133
+ // Definitely safe to prune since they are read-only
134
+ return true;
135
+ }
136
+ default: {
137
+ assertExhaustive(value, `Unexepcted value kind '${(value as any).kind}'`);
138
+ }
139
+ }
140
+}
compiler/forget/src/Optimization/index.ts
+1
@@ -6,3 +6,4 @@
6
*/
7
8
export { constantPropagation } from "./ConstantPropagation";
9
+export { deadCodeElimination } from "./DeadCodeElimination";
compiler/forget/src/__tests__/fixtures/hir/_bug_expression-with-assignment.expect.md
-4
@@ -15,10 +15,6 @@ function f() {
15
16
```javascript
17
function f() {
18
- const x = 1;
19
-
20
- const x$0 = 2;
21
- 4;
18
return 6;
19
}
20
compiler/forget/src/__tests__/fixtures/hir/call.expect.md
+1
-1
@@ -28,7 +28,7 @@ function Component(props) {
28
a = [];
29
b = {};
30
foo(a, b);
31
- const _ = <div a={a}></div>;
31
+
32
foo(b);
33
$[0] = a;
34
$[1] = b;
compiler/forget/src/__tests__/fixtures/hir/capturing-function-within-block.expect.md
+5
-6
@@ -29,19 +29,18 @@ function component(a) {
29
} else {
30
z = $[1];
31
}
32
- const x = undefined;
32
const c_2 = $[2] !== z;
34
- let x$0;
33
+ let x;
34
if (c_2) {
36
- x$0 = function () {
35
+ x = function () {
36
z;
37
};
38
$[2] = z;
40
- $[3] = x$0;
39
+ $[3] = x;
40
} else {
42
- x$0 = $[3];
41
+ x = $[3];
42
}
44
- return x$0;
43
+ return x;
44
}
45
46
```
compiler/forget/src/__tests__/fixtures/hir/concise-arrow-expr.expect.md
-1
@@ -22,7 +22,6 @@ function component() {
22
} else {
23
t0 = $[0];
24
}
25
- const x = t0[0];
25
const setX = t0[1];
26
let handler;
27
if ($[1] === Symbol.for("react.memo_cache_sentinel")) {
compiler/forget/src/__tests__/fixtures/hir/constant-propagation-for.expect.md
+1
-1
@@ -20,7 +20,7 @@ function foo() {
20
let y;
21
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
22
y = 0;
23
- for (const x = 100; 10, false; 100) {
23
+ for (const x = 100; false; 100) {
24
y = y + 1;
25
}
26
$[0] = y;
compiler/forget/src/__tests__/fixtures/hir/constant-propagation-while.expect.md
+1
-2
@@ -18,11 +18,10 @@ function foo() {
18
```javascript
19
function foo() {
20
const $ = React.useMemoCache();
21
- const x = 100;
21
let y;
22
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
23
y = 0;
25
- while ((10, false)) {
24
+ while (false) {
25
y = y + 1;
26
}
27
$[0] = y;
compiler/forget/src/__tests__/fixtures/hir/constant-propagation.expect.md
-10
@@ -27,18 +27,8 @@ function foo() {
27
28
```javascript
29
function foo() {
30
- const a = 1;
31
- const b = 2;
32
- const c = 3;
33
- const d = 3;
34
- const e = 9;
35
- const f = 3;
36
- const g = -6;
37
-
30
console.log("foo");
31
40
- const h = -6;
41
- const i = -6;
32
const j = -6;
33
return j;
34
}
compiler/forget/src/__tests__/fixtures/hir/constructor.expect.md
-2
@@ -28,8 +28,6 @@ function Component(props) {
28
a = [];
29
b = {};
30
new Foo(a, b);
31
-
32
- const _ = <div a={a}></div>;
31
new Foo(b);
32
$[0] = a;
33
$[1] = b;
compiler/forget/src/__tests__/fixtures/hir/dependencies-outputs.expect.md
-1
@@ -33,7 +33,6 @@ function foo(a, b) {
33
} else {
34
x = $[1];
35
}
36
- <div>{x}</div>;
36
37
const y = [];
38
if (x.length) {
compiler/forget/src/__tests__/fixtures/hir/error.while-with-assignment-in-test.expect.md
+1
-1
@@ -19,7 +19,7 @@ function f(reader) {
19
## Error
20
21
```
22
-[ReactForget] Todo: (CodegenReactiveFunction::codegenInstructionValue) Cannot declare variables in a value block, tried to declare 'value$0'
22
+[ReactForget] Todo: (CodegenReactiveFunction::codegenInstructionValue) Cannot declare variables in a value block, tried to declare 'value'
23
```
24
25
\ No newline at end of file
compiler/forget/src/__tests__/fixtures/hir/for-logical.expect.md
+1
-2
@@ -32,10 +32,9 @@ function foo(props) {
32
for (
33
let x = 0;
34
x > props.min && x < props.max;
35
- x = x$0 + (props.cond ? props.increment : (2, 2)), x
35
+ x = x$0 + (props.cond ? props.increment : 2), x
36
) {
37
const x$0 = x * 2;
38
- const y$1 = y + x$0;
38
}
39
return y;
40
}
compiler/forget/src/__tests__/fixtures/hir/hooks-freeze-possibly-mutable-arguments.expect.md
+15
-16
@@ -29,36 +29,35 @@ function Component(props) {
29
const $ = React.useMemoCache();
30
const cond = props.cond;
31
const x = props.x;
32
- const a = undefined;
32
const c_0 = $[0] !== cond;
33
const c_1 = $[1] !== x;
35
- let a$0;
34
+ let a;
35
if (c_0 || c_1) {
37
- a$0 = undefined;
36
+ a = undefined;
37
if (cond) {
39
- const a$1 = x;
40
- a$0 = a$1;
38
+ const a$0 = x;
39
+ a = a$0;
40
} else {
42
- let a$2;
41
+ let a$1;
42
if ($[3] === Symbol.for("react.memo_cache_sentinel")) {
44
- a$2 = [];
45
- $[3] = a$2;
43
+ a$1 = [];
44
+ $[3] = a$1;
45
} else {
47
- a$2 = $[3];
46
+ a$1 = $[3];
47
}
49
- a$0 = a$2;
48
+ a = a$1;
49
}
50
$[0] = cond;
51
$[1] = x;
53
- $[2] = a$0;
52
+ $[2] = a;
53
} else {
55
- a$0 = $[2];
54
+ a = $[2];
55
}
56
58
- useFreeze(a$0);
59
- useFreeze(a$0);
60
- call(a$0);
61
- return a$0;
57
+ useFreeze(a);
58
+ useFreeze(a);
59
+ call(a);
60
+ return a;
61
}
62
63
function useFreeze(x) {}
compiler/forget/src/__tests__/fixtures/hir/issue852.expect.md
+2
-13
@@ -15,19 +15,8 @@ function Component(c) {
15
16
```javascript
17
function Component(c) {
18
- const $ = React.useMemoCache();
19
- const c_0 = $[0] !== c;
20
- let x;
21
- if (c_0) {
22
- x = { c: c };
23
- mutate(x);
24
- $[0] = c;
25
- $[1] = x;
26
- } else {
27
- x = $[1];
28
- }
29
- const a = x;
30
- const b = a;
18
+ const x = { c: c };
19
+ mutate(x);
20
}
21
22
```
compiler/forget/src/__tests__/fixtures/hir/method-call-computed.expect.md
-4
@@ -41,10 +41,6 @@ function foo(a, b, c) {
41
} else {
42
y = $[3];
43
}
44
- <div>
45
- {x}
46
- {y}
47
- </div>;
44
const c_4 = $[4] !== x;
45
const c_5 = $[5] !== y.method;
46
const c_6 = $[6] !== b;
compiler/forget/src/__tests__/fixtures/hir/method-call-fn-call.expect.md
-1
@@ -29,7 +29,6 @@ function foo(a, b, c) {
29
} else {
30
x = $[1];
31
}
32
- <div>{x}</div>;
32
33
const method = x.method;
34
const c_2 = $[2] !== method;
compiler/forget/src/__tests__/fixtures/hir/method-call.expect.md
-1
@@ -28,7 +28,6 @@ function foo(a, b, c) {
28
} else {
29
x = $[1];
30
}
31
- <div>{x}</div>;
31
const c_2 = $[2] !== x;
32
const c_3 = $[3] !== b;
33
let y;
compiler/forget/src/__tests__/fixtures/hir/object-computed-access-assignment.expect.md
-2
@@ -14,8 +14,6 @@ function foo(a, b, c) {
14
```javascript
15
function foo(a, b, c) {
16
a[b] = c[b];
17
- 1;
18
- 2;
17
a[3] = c[b * 4];
18
}
19
compiler/forget/src/__tests__/fixtures/hir/object-properties.expect.md
-2
@@ -16,12 +16,10 @@ function foo(a, b, c) {
16
17
```javascript
18
function foo(a, b, c) {
19
- const x = a.x;
19
const y = b.c.d;
20
y.z = c.d.e;
21
22
foo(a.b.c);
24
- [a.b.c];
23
}
24
25
```
compiler/forget/src/__tests__/fixtures/hir/reassignment-conditional.expect.md
-1
@@ -55,7 +55,6 @@ function Component(props) {
55
x$0 = $[3];
56
}
57
58
- const _ = <Component x={x$0}></Component>;
58
y.push(props.p2);
59
const c_5 = $[5] !== x$0;
60
const c_6 = $[6] !== y;
compiler/forget/src/__tests__/fixtures/hir/reassignment.expect.md
-1
@@ -36,7 +36,6 @@ function Component(props) {
36
} else {
37
x$0 = $[3];
38
}
39
- const _ = <Component x={x$0}></Component>;
39
40
y.push(props.p1);
41
$[0] = props.p0;
compiler/forget/src/__tests__/fixtures/hir/reverse-postorder.expect.md
+15
-16
@@ -37,7 +37,6 @@ function Component(props) {
37
```javascript
38
function Component(props) {
39
const $ = React.useMemoCache();
40
- const x = undefined;
40
const c_0 = $[0] !== props.cond;
41
const c_1 = $[1] !== props.test;
42
const c_2 = $[2] !== props.v0;
@@ -46,35 +45,35 @@ function Component(props) {
45
const c_5 = $[5] !== props.cond2;
46
const c_6 = $[6] !== props.b;
47
const c_7 = $[7] !== props.c;
49
- let x$0;
48
+ let x;
49
if (c_0 || c_1 || c_2 || c_3 || c_4 || c_5 || c_6 || c_7) {
51
- x$0 = undefined;
50
+ x = undefined;
51
bb1: if (props.cond) {
52
switch (props.test) {
53
case 0: {
55
- const x$1 = props.v0;
56
- x$0 = x$1;
54
+ const x$0 = props.v0;
55
+ x = x$0;
56
break bb1;
57
}
58
case 1: {
60
- const x$2 = props.v1;
61
- x$0 = x$2;
59
+ const x$1 = props.v1;
60
+ x = x$1;
61
break bb1;
62
}
63
case 2: {
64
}
65
default: {
67
- const x$3 = props.v2;
68
- x$0 = x$3;
66
+ const x$2 = props.v2;
67
+ x = x$2;
68
}
69
}
70
} else {
71
if (props.cond2) {
73
- const x$4 = props.b;
74
- x$0 = x$4;
72
+ const x$3 = props.b;
73
+ x = x$3;
74
} else {
76
- const x$5 = props.c;
77
- x$0 = x$5;
75
+ const x$4 = props.c;
76
+ x = x$4;
77
}
78
}
79
$[0] = props.cond;
@@ -85,11 +84,11 @@ function Component(props) {
84
$[5] = props.cond2;
85
$[6] = props.b;
86
$[7] = props.c;
88
- $[8] = x$0;
87
+ $[8] = x;
88
} else {
90
- x$0 = $[8];
89
+ x = $[8];
90
}
92
- x$0;
91
+ x;
92
}
93
94
```
compiler/forget/src/__tests__/fixtures/hir/sequence-expression.expect.md
-2
@@ -19,7 +19,6 @@ function foo() {}
19
```javascript
20
function sequence(props) {
21
const $ = React.useMemoCache();
22
- null;
22
Math.max(1, 2);
23
let t0;
24
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
@@ -33,7 +32,6 @@ function sequence(props) {
32
x = t0;
33
while ((foo(), true)) {
34
foo();
36
- 2;
35
x = 2;
36
}
37
$[1] = x;
compiler/forget/src/__tests__/fixtures/hir/simple-alias.expect.md
+8
-9
@@ -22,20 +22,19 @@ function foo() {
22
function mutate() {}
23
function foo() {
24
const $ = React.useMemoCache();
25
- const a = {};
26
- let c$2;
25
+ let c$1;
26
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
27
const b = {};
28
const c = {};
30
- const a$0 = b;
31
- const b$1 = c;
32
- c$2 = a$0;
33
- mutate(a$0, b$1);
34
- $[0] = c$2;
29
+ const a = b;
30
+ const b$0 = c;
31
+ c$1 = a;
32
+ mutate(a, b$0);
33
+ $[0] = c$1;
34
} else {
36
- c$2 = $[0];
35
+ c$1 = $[0];
36
}
38
- return c$2;
37
+ return c$1;
38
}
39
40
```
compiler/forget/src/__tests__/fixtures/hir/ssa-call-jsx.expect.md
+1
-1
@@ -28,7 +28,7 @@ function Component(props) {
28
a = [];
29
b = {};
30
foo(a, b);
31
- const _ = <div a={a}></div>;
31
+
32
foo(a, b);
33
$[0] = a;
34
$[1] = b;
compiler/forget/src/__tests__/fixtures/hir/ssa-for-trivial-update.expect.md
+1
-1
@@ -20,7 +20,7 @@ function foo() {
20
let x;
21
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
22
x = 1;
23
- for (const i = 0; 10, true; 0) {
23
+ for (const i = 0; true; 0) {
24
x = x + 1;
25
}
26
$[0] = x;
compiler/forget/src/__tests__/fixtures/hir/ssa-multiple-phis.expect.md
+2
-7
@@ -28,13 +28,8 @@ function foo(a, b, c, d) {
28
29
```javascript
30
function foo(a, b, c, d) {
31
- const x = 0;
32
- true;
33
- true;
34
-
35
- const x$0 = a;
36
- x$0;
37
- return x$0;
31
+ const x = a;
32
+ return x;
33
}
34
35
```
compiler/forget/src/__tests__/fixtures/hir/ssa-objectexpression-phi.expect.md
+2
-5
@@ -24,14 +24,11 @@ function foo() {
24
function foo() {
25
const $ = React.useMemoCache();
26
const x = 1;
27
- const y = 2;
28
- 1;
29
- false;
27
31
- const y$0 = 3;
28
+ const y = 3;
29
let t;
30
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
34
- t = { x: x, y: y$0 };
31
+ t = { x: x, y: y };
32
$[0] = t;
33
} else {
34
t = $[0];
compiler/forget/src/__tests__/fixtures/hir/ssa-reassign.expect.md
+2
-5
@@ -16,11 +16,8 @@ function foo(a, b, c) {
16
17
```javascript
18
function foo(a, b, c) {
19
- const x = 0;
20
- const x$0 = a;
21
- const x$1 = b;
22
- const x$2 = c;
23
- return x$2;
19
+ const x = c;
20
+ return x;
21
}
22
23
```
compiler/forget/src/__tests__/fixtures/hir/ssa-return.expect.md
+2
-6
@@ -17,12 +17,8 @@ function foo() {
17
18
```javascript
19
function foo() {
20
- const x = 1;
21
- 1;
22
- true;
23
-
24
- const x$0 = 2;
25
- return x$0;
20
+ const x = 2;
21
+ return x;
22
}
23
24
```
compiler/forget/src/__tests__/fixtures/hir/ssa-throw.expect.md
+2
-6
@@ -16,12 +16,8 @@ function foo() {
16
17
```javascript
18
function foo() {
19
- const x = 1;
20
- 1;
21
- true;
22
-
23
- const x$0 = 2;
24
- throw x$0;
19
+ const x = 2;
20
+ throw x;
21
}
22
23
```
compiler/forget/src/__tests__/fixtures/hir/ssa-while-no-reassign.expect.md
+1
-1
@@ -18,7 +18,7 @@ function foo() {
18
```javascript
19
function foo() {
20
const x = 1;
21
- while ((10, true)) {
21
+ while (true) {
22
1;
23
2;
24
}
compiler/forget/src/__tests__/fixtures/hir/switch-with-fallthrough.expect.md
+6
-7
@@ -36,30 +36,29 @@ function foo(x) {
36
37
```javascript
38
function foo(x) {
39
- const y = undefined;
39
bb1: switch (x) {
40
case 0: {
42
- const y$0 = 0;
41
+ const y = 0;
42
}
43
case 1: {
45
- const y$1 = 1;
44
+ const y = 1;
45
break bb1;
46
}
47
case 2: {
48
break bb1;
49
}
50
case 3: {
52
- const y$2 = 3;
51
+ const y = 3;
52
break bb1;
53
}
54
case 4: {
56
- const y$3 = 4;
55
+ const y = 4;
56
}
57
case 5: {
59
- const y$4 = 5;
58
+ const y = 5;
59
}
60
default: {
62
- const y$5 = 0;
61
+ const y = 0;
62
}
63
}
64
}
compiler/forget/src/__tests__/fixtures/hir/switch.expect.md
+2
-3
@@ -41,11 +41,10 @@ function Component(props) {
41
case true: {
42
x.push(props.p2);
43
x.push(props.p3);
44
- const y$1 = [];
44
}
45
case false: {
47
- const y$2 = x;
48
- y$0 = y$2;
46
+ const y$1 = x;
47
+ y$0 = y$1;
48
}
49
}
50
$[0] = props.p0;
compiler/forget/src/__tests__/fixtures/hir/ternary-expression.expect.md
+1
-1
@@ -39,7 +39,7 @@ function ternary(props) {
39
const c_5 = $[5] !== b;
40
let t2;
41
if (c_4 || c_5) {
42
- t2 = a ? b : (null, null);
42
+ t2 = a ? b : null;
43
$[4] = a;
44
$[5] = b;
45
$[6] = t2;
compiler/forget/src/__tests__/fixtures/hir/type-test-field-store.expect.md
+6
-14
@@ -16,23 +16,15 @@ function component() {
16
```javascript
17
function component() {
18
const $ = React.useMemoCache();
19
- let x;
19
+ const x = {};
20
+ let q;
21
if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
21
- x = {};
22
- let q;
23
- if ($[1] === Symbol.for("react.memo_cache_sentinel")) {
24
- q = {};
25
- $[1] = q;
26
- } else {
27
- q = $[1];
28
- }
29
- x.t = q;
30
- $[0] = x;
22
+ q = {};
23
+ $[0] = q;
24
} else {
32
- x = $[0];
25
+ q = $[0];
26
}
34
-
35
- const z = x.t;
27
+ x.t = q;
28
}
29
30
```
compiler/forget/src/__tests__/fixtures/hir/type-test-polymorphic.expect.md
+3
-13
@@ -30,7 +30,6 @@ function component() {
30
} else {
31
p = $[0];
32
}
33
- p + p;
33
let o;
34
if ($[1] === Symbol.for("react.memo_cache_sentinel")) {
35
o = {};
@@ -38,19 +37,10 @@ function component() {
37
} else {
38
o = $[1];
39
}
41
- let x;
42
- if ($[2] === Symbol.for("react.memo_cache_sentinel")) {
43
- x = {};
44
- x.t = p;
45
-
46
- const z = x.t;
47
- x.t = o;
48
- $[2] = x;
49
- } else {
50
- x = $[2];
51
- }
40
53
- const y = x.t;
41
+ const x = {};
42
+ x.t = p;
43
+ x.t = o;
44
}
45
46
```
compiler/forget/src/__tests__/fixtures/hir/unconditional-break-label.expect.md
+2
-4
@@ -17,10 +17,8 @@ function foo(a) {
17
18
```javascript
19
function foo(a) {
20
- const x = 0;
21
-
22
- const x$0 = 1;
23
- return a + x$0;
20
+ const x = 1;
21
+ return a + x;
22
}
23
24
```