diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 19:33:14 +0000 |
commit | 36d22d82aa202bb199967e9512281e9a53db42c9 (patch) | |
tree | 105e8c98ddea1c1e4784a60a5a6410fa416be2de /js/src/jit-test/tests/ion/merge-phi-usage-analysis.js | |
parent | Initial commit. (diff) | |
download | firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.tar.xz firefox-esr-36d22d82aa202bb199967e9512281e9a53db42c9.zip |
Adding upstream version 115.7.0esr.upstream/115.7.0esrupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r-- | js/src/jit-test/tests/ion/merge-phi-usage-analysis.js | 63 |
1 files changed, 63 insertions, 0 deletions
diff --git a/js/src/jit-test/tests/ion/merge-phi-usage-analysis.js b/js/src/jit-test/tests/ion/merge-phi-usage-analysis.js new file mode 100644 index 0000000000..f239a8faf2 --- /dev/null +++ b/js/src/jit-test/tests/ion/merge-phi-usage-analysis.js @@ -0,0 +1,63 @@ + +function expensive() { + with({}) {} +} + +function phi_merge_0(i) { + // These computations can overflow, if the output is not truncated. + i = i | 0; + var a0 = i + i; + var a1 = i + i; + + if ((a1 | 0) - ((2 * i) | 0)) { + // Good candidate for branch pruning, which marks only a1 as having + // removed uses. + expensive(); + expensive(); + expensive(); + expensive(); + expensive(); + } + + // Simple branch made to let GVN merge the Phi instructions. + if (a1 % 3 == 1) { + a1 = 2 * i; + a0 = 2 * i; + } + + // a0 is never used, but a1 is truncated. + return a1 | 0; +} + +function phi_merge_1(i) { + // These computations can overflow, if the output is not truncated. + i = i | 0; + var a1 = i + i; + var a0 = i + i; + + if ((a1 | 0) - ((2 * i) | 0)) { + // Good candidate for branch pruning, which marks only a1 as having + // removed uses. + expensive(); + expensive(); + expensive(); + expensive(); + expensive(); + } + + // Simple branch made to let GVN merge the Phi instructions. + if (a1 % 3 == 1) { + a1 = 2 * i; + a0 = 2 * i; + } + + // a0 is never used, but a1 is truncated. + return a1 | 0; +} + +for (var j = 0; j < 300; j++) { + for (var i = 1; i == (i | 0); i = 2 * i + 1) { + assertEq(phi_merge_0(i) < 0x80000000, true); + assertEq(phi_merge_1(i) < 0x80000000, true); + } +} |