summaryrefslogtreecommitdiffstats
path: root/js/src/jit-test/tests/warp/string-indexof-constant-string.js
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 19:33:14 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 19:33:14 +0000
commit36d22d82aa202bb199967e9512281e9a53db42c9 (patch)
tree105e8c98ddea1c1e4784a60a5a6410fa416be2de /js/src/jit-test/tests/warp/string-indexof-constant-string.js
parentInitial commit. (diff)
downloadfirefox-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/warp/string-indexof-constant-string.js100
1 files changed, 100 insertions, 0 deletions
diff --git a/js/src/jit-test/tests/warp/string-indexof-constant-string.js b/js/src/jit-test/tests/warp/string-indexof-constant-string.js
new file mode 100644
index 0000000000..d04dc70055
--- /dev/null
+++ b/js/src/jit-test/tests/warp/string-indexof-constant-string.js
@@ -0,0 +1,100 @@
+// Test case to cover String.prototype.indexOf with a constant search string.
+//
+// String.prototype.indexOf with a short (≤32 characters) constant string is
+// optimised during lowering.
+
+function* characters(...ranges) {
+ for (let [start, end] of ranges) {
+ for (let i = start; i <= end; ++i) {
+ yield i;
+ }
+ }
+}
+
+const ascii = [...characters(
+ [0x41, 0x5A], // A..Z
+ [0x61, 0x7A], // a..z
+ [0x30, 0x39], // 0..9
+)];
+
+const latin1 = [...characters(
+ [0xC0, 0xFF], // À..ÿ
+)];
+
+const twoByte = [...characters(
+ [0x100, 0x17E], // Ā..ž
+)];
+
+function toRope(s) {
+ // Ropes have at least two characters.
+ if (s.length < 2) {
+ return s;
+ }
+ if (s.length === 2) {
+ return newRope(s[0], s[1]);
+ }
+ return newRope(s[0], s.substring(1));
+}
+
+function atomize(s) {
+ return Object.keys({[s]: 0})[0];
+}
+
+for (let i = 1; i <= 32; ++i) {
+ let strings = [ascii, latin1, twoByte].flatMap(codePoints => [
+ // Same string as the input.
+ String.fromCodePoint(...codePoints.slice(0, i)),
+
+ // Same length as the input, but a different string.
+ String.fromCodePoint(...codePoints.slice(1, i + 1)),
+
+ // Shorter string than the input.
+ String.fromCodePoint(...codePoints.slice(0, i - 1)),
+
+ // Longer string than the input.
+ String.fromCodePoint(...codePoints.slice(0, i + 1)),
+ ]).flatMap(x => [
+ x,
+ toRope(x),
+ newString(x, {twoByte: true}),
+ atomize(x),
+ ]);
+
+ for (let codePoints of [ascii, latin1, twoByte]) {
+ let str = String.fromCodePoint(...codePoints.slice(0, i));
+
+ let fn = Function("strings", `
+ const expected = strings.map(x => {
+ // Prevent Warp compilation when computing the expected results.
+ with ({}) ;
+ return x.indexOf("${str}") === 0;
+ });
+
+ for (let i = 0; i < 250; ++i) {
+ let idx = i % strings.length;
+ let str = strings[idx];
+
+ let actual = str.indexOf("${str}") === 0;
+ if (actual !== expected[idx]) throw new Error();
+ }
+ `);
+ fn(strings);
+
+ let fnNot = Function("strings", `
+ const expected = strings.map(x => {
+ // Prevent Warp compilation when computing the expected results.
+ with ({}) ;
+ return x.indexOf("${str}") !== 0;
+ });
+
+ for (let i = 0; i < 250; ++i) {
+ let idx = i % strings.length;
+ let str = strings[idx];
+
+ let actual = str.indexOf("${str}") !== 0;
+ if (actual !== expected[idx]) throw new Error();
+ }
+ `);
+ fnNot(strings);
+ }
+}