ladybird/Tests/LibJS/Runtime/3rdparty/v8/regexp-global.js
aplefull b3bd8884ae Tests+Meta: Reimport V8 regexp tests
This commit fixes assertEquals, assertThrows/assertDoesNotThrow in
compatibility shim - we were failing some tests purely because of a
bad shim.

Two test files are moved from XFAIL_TESTS to SKIP_FILES:
1. es6/regexp-tostring.js: checks for V8-specific error message wording
2. es6/unicode-regexp-ignore-case-noi18n.js: tests V8's non-i18n build
    behavior, it doesn't case-fold non-ASCII characters, but we do it
    correctly.

The regexp-unicode-sets.js test is now included and passes.

All files that were previously in XFAIL_TESTS and SKIP_TESTS are now
passing, so both lists are cleared.
2026-05-26 10:00:22 +02:00

337 lines
12 KiB
JavaScript

// Copyright 2012 the V8 project authors. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following
// disclaimer in the documentation and/or other materials provided
// with the distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// V8 assertion compatibility shim for Ladybird's test-js harness
function assertEquals(expected, actual, msg) {
if (Array.isArray(expected) && Array.isArray(actual)) {
expect(actual).toEqual(expected);
} else if (expected instanceof RegExp && actual instanceof RegExp) {
expect(actual.source).toBe(expected.source);
expect(actual.flags).toBe(expected.flags);
} else if (expected !== null && typeof expected === "object" && actual !== null && typeof actual === "object") {
expect(actual).toEqual(expected);
} else {
expect(actual).toBe(expected);
}
}
function assertTrue(val, msg) {
expect(val).toBeTrue();
}
function assertFalse(val, msg) {
expect(val).toBeFalse();
}
function assertNull(val, msg) {
expect(val).toBeNull();
}
function assertNotNull(val, msg) {
expect(val).not.toBeNull();
}
function assertThrows(fn, type_opt, msg_opt) {
if (typeof fn === "string") {
expect(() => eval(fn)).toThrow();
} else {
expect(fn).toThrow();
}
}
function assertDoesNotThrow(fn, msg) {
if (typeof fn === "string") {
eval(fn);
} else {
fn();
}
}
function assertInstanceof(val, type, msg) {
expect(val instanceof type).toBeTrue();
}
function assertUnreachable(msg) {
expect().fail("unreachable" + (msg ? ": " + msg : ""));
}
function assertEarlyError(code) {
assertThrows(() => new Function(code));
}
function assertThrowsAtRuntime(code, type_opt) {
const f = new Function(code);
assertThrows(f, type_opt);
}
function assertArrayEquals(expected, actual) {
expect(actual).toEqual(expected);
}
test("regexp-global", () => {
var str = "ABX X";
str = str.replace(/(\w)?X/g, function (match, capture) {
assertTrue(match.indexOf(capture) >= 0 || capture === undefined);
return capture ? capture.toLowerCase() : "-";
});
assertEquals("Ab -", str);
// Test zero-length matches.
str = "Als Gregor Samsa eines Morgens";
str = str.replace(/\b/g, function (match, capture) {
return "/";
});
assertEquals("/Als/ /Gregor/ /Samsa/ /eines/ /Morgens/", str);
// Test zero-length matches that have non-zero-length sub-captures.
str = "It was a pleasure to burn.";
str = str.replace(/(?=(\w+))\b/g, function (match, capture) {
return capture.length;
});
assertEquals("2It 3was 1a 8pleasure 2to 4burn.", str);
// Test multiple captures.
str = "Try not. Do, or do not. There is no try.";
str = str.replace(/(not?)|(do)|(try)/gi, function (match, c1, c2, c3) {
assertTrue(
(c1 === undefined && c2 === undefined) ||
(c2 === undefined && c3 === undefined) ||
(c1 === undefined && c3 === undefined)
);
if (c1) return "-";
if (c2) return "+";
if (c3) return "=";
});
assertEquals("= -. +, or + -. There is - =.", str);
// Test multiple alternate captures.
str = "FOUR LEGS GOOD, TWO LEGS BAD!";
str = str.replace(/(FOUR|TWO) LEGS (GOOD|BAD)/g, function (match, num_legs, likeability) {
assertTrue(num_legs !== undefined);
assertTrue(likeability !== undefined);
if (num_legs == "FOUR") assertTrue(likeability == "GOOD");
if (num_legs == "TWO") assertTrue(likeability == "BAD");
return match.length - 10;
});
assertEquals("4, 2!", str);
// The same tests with UC16.
//Test that an optional capture is cleared between two matches.
str = "AB\u1234 \u1234";
str = str.replace(/(\w)?\u1234/g, function (match, capture) {
assertTrue(match.indexOf(capture) >= 0 || capture === undefined);
return capture ? capture.toLowerCase() : "-";
});
assertEquals("Ab -", str);
// Test zero-length matches.
str = "Als \u2623\u2642 eines Morgens";
str = str.replace(/\b/g, function (match, capture) {
return "/";
});
assertEquals("/Als/ \u2623\u2642 /eines/ /Morgens/", str);
// Test zero-length matches that have non-zero-length sub-captures.
str = "It was a pleasure to \u70e7.";
str = str.replace(/(?=(\w+))\b/g, function (match, capture) {
return capture.length;
});
assertEquals("2It 3was 1a 8pleasure 2to \u70e7.", str);
// Test multiple captures.
str = "Try not. D\u26aa, or d\u26aa not. There is no try.";
str = str.replace(/(not?)|(d\u26aa)|(try)/gi, function (match, c1, c2, c3) {
assertTrue(
(c1 === undefined && c2 === undefined) ||
(c2 === undefined && c3 === undefined) ||
(c1 === undefined && c3 === undefined)
);
if (c1) return "-";
if (c2) return "+";
if (c3) return "=";
});
assertEquals("= -. +, or + -. There is - =.", str);
// Test multiple alternate captures.
str = "FOUR \u817f GOOD, TWO \u817f BAD!";
str = str.replace(/(FOUR|TWO) \u817f (GOOD|BAD)/g, function (match, num_legs, likeability) {
assertTrue(num_legs !== undefined);
assertTrue(likeability !== undefined);
if (num_legs == "FOUR") assertTrue(likeability == "GOOD");
if (num_legs == "TWO") assertTrue(likeability == "BAD");
return match.length - 7;
});
assertEquals("4, 2!", str);
// Test capture that is a real substring.
var str = "Beasts of England, beasts of Ireland";
str = str.replace(/(.*)/g, function (match) {
return "~";
});
assertEquals("~~", str);
// Test zero-length matches that have non-zero-length sub-captures that do not
// start at the match start position.
str = "up up up up";
str = str.replace(/\b(?=u(p))/g, function (match, capture) {
return capture.length;
});
assertEquals("1up 1up 1up 1up", str);
// Create regexp that has a *lot* of captures.
var re_string = "(a)";
for (var i = 0; i < 500; i++) {
re_string = "(" + re_string + ")";
}
re_string = re_string + "1";
// re_string = "(((...((a))...)))1"
var regexps = new Array();
var last_match_expectations = new Array();
var first_capture_expectations = new Array();
// Atomic regexp.
regexps.push(/a1/g);
last_match_expectations.push("a1");
first_capture_expectations.push("");
// Small regexp (no capture);
regexps.push(/\w1/g);
last_match_expectations.push("a1");
first_capture_expectations.push("");
// Small regexp (one capture).
regexps.push(/(a)1/g);
last_match_expectations.push("a1");
first_capture_expectations.push("a");
// Large regexp (a lot of captures).
regexps.push(new RegExp(re_string, "g"));
last_match_expectations.push("a1");
first_capture_expectations.push("a");
function test_replace(result_expectation, subject, regexp, replacement) {
for (var i = 0; i < regexps.length; i++) {
// Overwrite last match info.
"deadbeef".replace(/(dead)beef/, "$1holeycow");
// Conduct tests.
assertEquals(result_expectation, subject.replace(regexps[i], replacement));
if (subject.length == 0) {
assertEquals("deadbeef", RegExp.lastMatch);
assertEquals("dead", RegExp["$1"]);
} else {
assertEquals(last_match_expectations[i], RegExp.lastMatch);
assertEquals(first_capture_expectations[i], RegExp["$1"]);
}
}
}
function test_match(result_expectation, subject, regexp) {
for (var i = 0; i < regexps.length; i++) {
// Overwrite last match info.
"deadbeef".replace(/(dead)beef/, "$1holeycow");
// Conduct tests.
if (result_expectation == null) {
assertNull(subject.match(regexps[i]));
} else {
assertArrayEquals(result_expectation, subject.match(regexps[i]));
}
if (subject.length == 0) {
assertEquals("deadbeef", RegExp.lastMatch);
assertEquals("dead", RegExp["$1"]);
} else {
assertEquals(last_match_expectations[i], RegExp.lastMatch);
assertEquals(first_capture_expectations[i], RegExp["$1"]);
}
}
}
// Test for different number of matches.
for (var m = 0; m < 33; m++) {
// Create string that matches m times.
var subject = "";
var test_1_expectation = "";
var test_2_expectation = "";
var test_3_expectation = m == 0 ? null : new Array();
for (var i = 0; i < m; i++) {
subject += "a11";
test_1_expectation += "x1";
test_2_expectation += "1";
test_3_expectation.push("a1");
}
// Test 1a: String.replace with string.
test_replace(test_1_expectation, subject, /a1/g, "x");
// Test 1b: String.replace with function.
function f() {
return "x";
}
test_replace(test_1_expectation, subject, /a1/g, f);
// Test 2a: String.replace with empty string.
test_replace(test_2_expectation, subject, /a1/g, "");
// Test 3a: String.match.
test_match(test_3_expectation, subject, /a1/g);
}
// Test String hashing (compiling regular expression includes hashing).
var crosscheck = "\x80";
for (var i = 0; i < 12; i++) crosscheck += crosscheck;
new RegExp(crosscheck);
var subject = "ascii~only~string~here~";
var replacement = "\x80";
var result = subject.replace(/~/g, replacement);
for (var i = 0; i < 5; i++) result += result;
new RegExp(result);
// Global Atom RegExp with a single char pattern.
// We chose a match count greater then 255*16, as this is the maximum count
// we can keep in a vector register before it overflows.
// In addition the string length shouldn't be a multiple of 16 to also test
// the scalar part.
// See RegExpMatchGlobalAtom_OneCharPattern() for details.
let text = "a".repeat(255 * 17 + 5);
assertEquals(4340, text.match(/a/g).length);
// Two-byte.
const smiley = "\u{D83D}\u{DE0A}";
text = smiley.repeat(255 * 17 + 5);
assertEquals(4340, text.match(new RegExp(smiley, "g")).length);
// Two-byte subject with one-byte pattern.
text = smiley + "a".repeat(255 * 17 + 5);
assertEquals(4340, text.match(/a/g).length);
// Test the cache with a slice.
text = "a".repeat(255 * 17 + 5).substring(1);
assertEquals(4339, text.match(/a/g).length);
assertEquals(4339, text.match(/a/g).length);
assertEquals(4339, text.match(/a/g).length);
});