summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorAlon Zakai <azakai@google.com>2024-02-12 13:29:27 -0800
committerGitHub <noreply@github.com>2024-02-12 13:29:27 -0800
commit1948008a8c7ceca1ca278e76bdca72eebba0dae7 (patch)
tree9b48a403d8279d70db0ac932b45e03cd2fdc1f2d /src
parent34d35ae7c0a8e42f94fd02b4b1aa64aec3621a05 (diff)
downloadbinaryen-1948008a8c7ceca1ca278e76bdca72eebba0dae7.tar.gz
binaryen-1948008a8c7ceca1ca278e76bdca72eebba0dae7.tar.bz2
binaryen-1948008a8c7ceca1ca278e76bdca72eebba0dae7.zip
Precompute: Optimize array.len (#6299)
Arrays have immutable length, so we can optimize them like immutable fields.
Diffstat (limited to 'src')
-rw-r--r--src/passes/Precompute.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/passes/Precompute.cpp b/src/passes/Precompute.cpp
index 5baf2331f..d2f3543ad 100644
--- a/src/passes/Precompute.cpp
+++ b/src/passes/Precompute.cpp
@@ -178,7 +178,7 @@ public:
// Otherwise, we've failed to precompute.
return Flow(NONCONSTANT_FLOW);
}
- Flow visitArrayLen(ArrayLen* curr) { return Flow(NONCONSTANT_FLOW); }
+ // ArrayLen is not disallowed here as it is an immutable property.
Flow visitArrayCopy(ArrayCopy* curr) { return Flow(NONCONSTANT_FLOW); }
// Generates heap info for a heap-allocating expression.