// 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. #include #include #include #include "include/v8.h" #include "src/api-inl.h" #include "src/assembler-arch.h" #include "src/ast/ast.h" #include "src/char-predicates-inl.h" #include "src/objects-inl.h" #include "src/ostreams.h" #include "src/regexp/jsregexp.h" #include "src/regexp/regexp-macro-assembler-irregexp.h" #include "src/regexp/regexp-macro-assembler.h" #include "src/regexp/regexp-parser.h" #include "src/splay-tree-inl.h" #include "src/string-stream.h" #include "src/unicode-inl.h" #include "src/v8.h" #ifdef V8_INTERPRETED_REGEXP #include "src/regexp/interpreter-irregexp.h" #else // V8_INTERPRETED_REGEXP #include "src/macro-assembler.h" #if V8_TARGET_ARCH_ARM #include "src/regexp/arm/regexp-macro-assembler-arm.h" #endif #if V8_TARGET_ARCH_ARM64 #include "src/regexp/arm64/regexp-macro-assembler-arm64.h" #endif #if V8_TARGET_ARCH_S390 #include "src/regexp/s390/regexp-macro-assembler-s390.h" #endif #if V8_TARGET_ARCH_PPC #include "src/regexp/ppc/regexp-macro-assembler-ppc.h" #endif #if V8_TARGET_ARCH_MIPS #include "src/regexp/mips/regexp-macro-assembler-mips.h" #endif #if V8_TARGET_ARCH_MIPS64 #include "src/regexp/mips64/regexp-macro-assembler-mips64.h" #endif #if V8_TARGET_ARCH_X64 #include "src/regexp/x64/regexp-macro-assembler-x64.h" #endif #if V8_TARGET_ARCH_IA32 #include "src/regexp/ia32/regexp-macro-assembler-ia32.h" #endif #endif // V8_INTERPRETED_REGEXP #include "test/cctest/cctest.h" namespace v8 { namespace internal { namespace test_regexp { static bool CheckParse(const char* input) { v8::HandleScope scope(CcTest::isolate()); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); FlatStringReader reader(CcTest::i_isolate(), CStrVector(input)); RegExpCompileData result; return v8::internal::RegExpParser::ParseRegExp( CcTest::i_isolate(), &zone, &reader, JSRegExp::kNone, &result); } static void CheckParseEq(const char* input, const char* expected, bool unicode = false) { v8::HandleScope scope(CcTest::isolate()); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); FlatStringReader reader(CcTest::i_isolate(), CStrVector(input)); RegExpCompileData result; JSRegExp::Flags flags = JSRegExp::kNone; if (unicode) flags |= JSRegExp::kUnicode; CHECK(v8::internal::RegExpParser::ParseRegExp(CcTest::i_isolate(), &zone, &reader, flags, &result)); CHECK_NOT_NULL(result.tree); CHECK(result.error.is_null()); std::ostringstream os; result.tree->Print(os, &zone); if (strcmp(expected, os.str().c_str()) != 0) { printf("%s | %s\n", expected, os.str().c_str()); } CHECK_EQ(0, strcmp(expected, os.str().c_str())); } static bool CheckSimple(const char* input) { v8::HandleScope scope(CcTest::isolate()); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); FlatStringReader reader(CcTest::i_isolate(), CStrVector(input)); RegExpCompileData result; CHECK(v8::internal::RegExpParser::ParseRegExp( CcTest::i_isolate(), &zone, &reader, JSRegExp::kNone, &result)); CHECK_NOT_NULL(result.tree); CHECK(result.error.is_null()); return result.simple; } struct MinMaxPair { int min_match; int max_match; }; static MinMaxPair CheckMinMaxMatch(const char* input) { v8::HandleScope scope(CcTest::isolate()); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); FlatStringReader reader(CcTest::i_isolate(), CStrVector(input)); RegExpCompileData result; CHECK(v8::internal::RegExpParser::ParseRegExp( CcTest::i_isolate(), &zone, &reader, JSRegExp::kNone, &result)); CHECK_NOT_NULL(result.tree); CHECK(result.error.is_null()); int min_match = result.tree->min_match(); int max_match = result.tree->max_match(); MinMaxPair pair = { min_match, max_match }; return pair; } #define CHECK_PARSE_ERROR(input) CHECK(!CheckParse(input)) #define CHECK_SIMPLE(input, simple) CHECK_EQ(simple, CheckSimple(input)); #define CHECK_MIN_MAX(input, min, max) \ { MinMaxPair min_max = CheckMinMaxMatch(input); \ CHECK_EQ(min, min_max.min_match); \ CHECK_EQ(max, min_max.max_match); \ } TEST(RegExpParser) { CHECK_PARSE_ERROR("?"); CheckParseEq("abc", "'abc'"); CheckParseEq("", "%"); CheckParseEq("abc|def", "(| 'abc' 'def')"); CheckParseEq("abc|def|ghi", "(| 'abc' 'def' 'ghi')"); CheckParseEq("^xxx$", "(: @^i 'xxx' @$i)"); CheckParseEq("ab\\b\\d\\bcd", "(: 'ab' @b [0-9] @b 'cd')"); CheckParseEq("\\w|\\d", "(| [0-9 A-Z _ a-z] [0-9])"); CheckParseEq("a*", "(# 0 - g 'a')"); CheckParseEq("a*?", "(# 0 - n 'a')"); CheckParseEq("abc+", "(: 'ab' (# 1 - g 'c'))"); CheckParseEq("abc+?", "(: 'ab' (# 1 - n 'c'))"); CheckParseEq("xyz?", "(: 'xy' (# 0 1 g 'z'))"); CheckParseEq("xyz??", "(: 'xy' (# 0 1 n 'z'))"); CheckParseEq("xyz{0,1}", "(: 'xy' (# 0 1 g 'z'))"); CheckParseEq("xyz{0,1}?", "(: 'xy' (# 0 1 n 'z'))"); CheckParseEq("xyz{93}", "(: 'xy' (# 93 93 g 'z'))"); CheckParseEq("xyz{93}?", "(: 'xy' (# 93 93 n 'z'))"); CheckParseEq("xyz{1,32}", "(: 'xy' (# 1 32 g 'z'))"); CheckParseEq("xyz{1,32}?", "(: 'xy' (# 1 32 n 'z'))"); CheckParseEq("xyz{1,}", "(: 'xy' (# 1 - g 'z'))"); CheckParseEq("xyz{1,}?", "(: 'xy' (# 1 - n 'z'))"); CheckParseEq("a\\fb\\nc\\rd\\te\\vf", "'a\\x0cb\\x0ac\\x0dd\\x09e\\x0bf'"); CheckParseEq("a\\nb\\bc", "(: 'a\\x0ab' @b 'c')"); CheckParseEq("(?:foo)", "(?: 'foo')"); CheckParseEq("(?: foo )", "(?: ' foo ')"); CheckParseEq("(foo|bar|baz)", "(^ (| 'foo' 'bar' 'baz'))"); CheckParseEq("foo|(bar|baz)|quux", "(| 'foo' (^ (| 'bar' 'baz')) 'quux')"); CheckParseEq("foo(?=bar)baz", "(: 'foo' (-> + 'bar') 'baz')"); CheckParseEq("foo(?!bar)baz", "(: 'foo' (-> - 'bar') 'baz')"); CheckParseEq("foo(?<=bar)baz", "(: 'foo' (<- + 'bar') 'baz')"); CheckParseEq("foo(? + %)"); CheckParseEq("[]", "^[\\x00-\\u{10ffff}]"); // Doesn't compile on windows CheckParseEq("[^]", "[\\x00-\\u{10ffff}]"); // \uffff isn't in codepage 1252 CheckParseEq("[x]", "[x]"); CheckParseEq("[xyz]", "[x y z]"); CheckParseEq("[a-zA-Z0-9]", "[a-z A-Z 0-9]"); CheckParseEq("[-123]", "[- 1 2 3]"); CheckParseEq("[^123]", "^[1 2 3]"); CheckParseEq("]", "']'"); CheckParseEq("}", "'}'"); CheckParseEq("[a-b-c]", "[a-b - c]"); CheckParseEq("[\\d]", "[0-9]"); CheckParseEq("[x\\dz]", "[x 0-9 z]"); CheckParseEq("[\\d-z]", "[0-9 - z]"); CheckParseEq("[\\d-\\d]", "[0-9 0-9 -]"); CheckParseEq("[z-\\d]", "[0-9 z -]"); // Control character outside character class. CheckParseEq("\\cj\\cJ\\ci\\cI\\ck\\cK", "'\\x0a\\x0a\\x09\\x09\\x0b\\x0b'"); CheckParseEq("\\c!", "'\\c!'"); CheckParseEq("\\c_", "'\\c_'"); CheckParseEq("\\c~", "'\\c~'"); CheckParseEq("\\c1", "'\\c1'"); // Control character inside character class. CheckParseEq("[\\c!]", "[\\ c !]"); CheckParseEq("[\\c_]", "[\\x1f]"); CheckParseEq("[\\c~]", "[\\ c ~]"); CheckParseEq("[\\ca]", "[\\x01]"); CheckParseEq("[\\cz]", "[\\x1a]"); CheckParseEq("[\\cA]", "[\\x01]"); CheckParseEq("[\\cZ]", "[\\x1a]"); CheckParseEq("[\\c1]", "[\\x11]"); CheckParseEq("[a\\]c]", "[a ] c]"); CheckParseEq("\\[\\]\\{\\}\$\$\\%\\^\\#\\ ", "'[]{}()%^# '"); CheckParseEq("[\\[\\]\\{\\}\$\$\\%\\^\\#\\ ]", "[[ ] { } ( ) % ^ # ]"); CheckParseEq("\\0", "'\\x00'"); CheckParseEq("\\8", "'8'"); CheckParseEq("\\9", "'9'"); CheckParseEq("\\11", "'\\x09'"); CheckParseEq("\\11a", "'\\x09a'"); CheckParseEq("\\011", "'\\x09'"); CheckParseEq("\\00011", "'\\x0011'"); CheckParseEq("\\118", "'\\x098'"); CheckParseEq("\\111", "'I'"); CheckParseEq("\\1111", "'I1'"); CheckParseEq("(x)(x)(x)\\1", "(: (^ 'x') (^ 'x') (^ 'x') (<- 1))"); CheckParseEq("(x)(x)(x)\\2", "(: (^ 'x') (^ 'x') (^ 'x') (<- 2))"); CheckParseEq("(x)(x)(x)\\3", "(: (^ 'x') (^ 'x') (^ 'x') (<- 3))"); CheckParseEq("(x)(x)(x)\\4", "(: (^ 'x') (^ 'x') (^ 'x') '\\x04')"); CheckParseEq("(x)(x)(x)\\1*", "(: (^ 'x') (^ 'x') (^ 'x')" " (# 0 - g (<- 1)))"); CheckParseEq("(x)(x)(x)\\2*", "(: (^ 'x') (^ 'x') (^ 'x')" " (# 0 - g (<- 2)))"); CheckParseEq("(x)(x)(x)\\3*", "(: (^ 'x') (^ 'x') (^ 'x')" " (# 0 - g (<- 3)))"); CheckParseEq("(x)(x)(x)\\4*", "(: (^ 'x') (^ 'x') (^ 'x')" " (# 0 - g '\\x04'))"); CheckParseEq("(x)(x)(x)(x)(x)(x)(x)(x)(x)(x)\\10", "(: (^ 'x') (^ 'x') (^ 'x') (^ 'x') (^ 'x') (^ 'x')" " (^ 'x') (^ 'x') (^ 'x') (^ 'x') (<- 10))"); CheckParseEq("(x)(x)(x)(x)(x)(x)(x)(x)(x)(x)\\11", "(: (^ 'x') (^ 'x') (^ 'x') (^ 'x') (^ 'x') (^ 'x')" " (^ 'x') (^ 'x') (^ 'x') (^ 'x') '\\x09')"); CheckParseEq("(a)\\1", "(: (^ 'a') (<- 1))"); CheckParseEq("(a\\1)", "(^ 'a')"); CheckParseEq("(\\1a)", "(^ 'a')"); CheckParseEq("(\\2)(\\1)", "(: (^ (<- 2)) (^ (<- 1)))"); CheckParseEq("(?=a)?a", "'a'"); CheckParseEq("(?=a){0,10}a", "'a'"); CheckParseEq("(?=a){1,10}a", "(: (-> + 'a') 'a')"); CheckParseEq("(?=a){9,10}a", "(: (-> + 'a') 'a')"); CheckParseEq("(?!a)?a", "'a'"); CheckParseEq("\\1(a)", "(: (<- 1) (^ 'a'))"); CheckParseEq("(?!(a))\\1", "(: (-> - (^ 'a')) (<- 1))"); CheckParseEq("(?!\\1(a\\1)\\1)\\1", "(: (-> - (: (<- 1) (^ 'a') (<- 1))) (<- 1))"); CheckParseEq("\\1\\2(a(?:\\1(b\\1\\2))\\2)\\1", "(: (<- 1) (<- 2) (^ (: 'a' (?: (^ 'b')) (<- 2))) (<- 1))"); CheckParseEq("\\1\\2(a(?<=\\1(b\\1\\2))\\2)\\1", "(: (<- 1) (<- 2) (^ (: 'a' (<- + (^ 'b')) (<- 2))) (<- 1))"); CheckParseEq("[\\0]", "[\\x00]"); CheckParseEq("[\\11]", "[\\x09]"); CheckParseEq("[\\11a]", "[\\x09 a]"); CheckParseEq("[\\011]", "[\\x09]"); CheckParseEq("[\\00011]", "[\\x00 1 1]"); CheckParseEq("[\\118]", "[\\x09 8]"); CheckParseEq("[\\111]", "[I]"); CheckParseEq("[\\1111]", "[I 1]"); CheckParseEq("\\x34", "'\x34'"); CheckParseEq("\\x60", "'\x60'"); CheckParseEq("\\x3z", "'x3z'"); CheckParseEq("\\c", "'\\c'"); CheckParseEq("\\u0034", "'\x34'"); CheckParseEq("\\u003z", "'u003z'"); CheckParseEq("foo[z]*", "(: 'foo' (# 0 - g [z]))"); CheckParseEq("^^^$$$\\b\\b\\b\\b", "(: @^i @$i @b)"); CheckParseEq("\\b\\b\\b\\b\\B\\B\\B\\B\\b\\b\\b\\b", "(: @b @B @b)"); CheckParseEq("\\b\\B\\b", "(: @b @B @b)"); // Unicode regexps CheckParseEq("\\u{12345}", "'\\ud808\\udf45'", true); CheckParseEq("\\u{12345}\\u{23456}", "(! '\\ud808\\udf45' '\\ud84d\\udc56')", true); CheckParseEq("\\u{12345}|\\u{23456}", "(| '\\ud808\\udf45' '\\ud84d\\udc56')", true); CheckParseEq("\\u{12345}{3}", "(# 3 3 g '\\ud808\\udf45')", true); CheckParseEq("\\u{12345}*", "(# 0 - g '\\ud808\\udf45')", true); CheckParseEq("\\ud808\\udf45*", "(# 0 - g '\\ud808\\udf45')", true); CheckParseEq("[\\ud808\\udf45-\\ud809\\udccc]", "[\\u{012345}-\\u{0124cc}]", true); CHECK_SIMPLE("", false); CHECK_SIMPLE("a", true); CHECK_SIMPLE("a|b", false); CHECK_SIMPLE("a\\n", false); CHECK_SIMPLE("^a", false); CHECK_SIMPLE("a$", false); CHECK_SIMPLE("a\\b!", false); CHECK_SIMPLE("a\\Bb", false); CHECK_SIMPLE("a*", false); CHECK_SIMPLE("a*?", false); CHECK_SIMPLE("a?", false); CHECK_SIMPLE("a??", false); CHECK_SIMPLE("a{0,1}?", false); CHECK_SIMPLE("a{1,1}?", false); CHECK_SIMPLE("a{1,2}?", false); CHECK_SIMPLE("a+?", false); CHECK_SIMPLE("(a)", false); CHECK_SIMPLE("(a)\\1", false); CHECK_SIMPLE("(\\1a)", false); CHECK_SIMPLE("\\1(a)", false); CHECK_SIMPLE("a\\s", false); CHECK_SIMPLE("a\\S", false); CHECK_SIMPLE("a\\d", false); CHECK_SIMPLE("a\\D", false); CHECK_SIMPLE("a\\w", false); CHECK_SIMPLE("a\\W", false); CHECK_SIMPLE("a.", false); CHECK_SIMPLE("a\\q", false); CHECK_SIMPLE("a[a]", false); CHECK_SIMPLE("a[^a]", false); CHECK_SIMPLE("a[a-z]", false); CHECK_SIMPLE("a[\\q]", false); CHECK_SIMPLE("a(?:b)", false); CHECK_SIMPLE("a(?=b)", false); CHECK_SIMPLE("a(?!b)", false); CHECK_SIMPLE("\\x60", false); CHECK_SIMPLE("\\u0060", false); CHECK_SIMPLE("\\cA", false); CHECK_SIMPLE("\\q", false); CHECK_SIMPLE("\\1112", false); CHECK_SIMPLE("\\0", false); CHECK_SIMPLE("(a)\\1", false); CHECK_SIMPLE("(?=a)?a", false); CHECK_SIMPLE("(?!a)?a\\1", false); CHECK_SIMPLE("(?:(?=a))a\\1", false); CheckParseEq("a{}", "'a{}'"); CheckParseEq("a{,}", "'a{,}'"); CheckParseEq("a{", "'a{'"); CheckParseEq("a{z}", "'a{z}'"); CheckParseEq("a{1z}", "'a{1z}'"); CheckParseEq("a{12z}", "'a{12z}'"); CheckParseEq("a{12,", "'a{12,'"); CheckParseEq("a{12,3b", "'a{12,3b'"); CheckParseEq("{}", "'{}'"); CheckParseEq("{,}", "'{,}'"); CheckParseEq("{", "'{'"); CheckParseEq("{z}", "'{z}'"); CheckParseEq("{1z}", "'{1z}'"); CheckParseEq("{12z}", "'{12z}'"); CheckParseEq("{12,", "'{12,'"); CheckParseEq("{12,3b", "'{12,3b'"); CHECK_MIN_MAX("a", 1, 1); CHECK_MIN_MAX("abc", 3, 3); CHECK_MIN_MAX("a[bc]d", 3, 3); CHECK_MIN_MAX("a|bc", 1, 2); CHECK_MIN_MAX("ab|c", 1, 2); CHECK_MIN_MAX("a||bc", 0, 2); CHECK_MIN_MAX("|", 0, 0); CHECK_MIN_MAX("(?:ab)", 2, 2); CHECK_MIN_MAX("(?:ab|cde)", 2, 3); CHECK_MIN_MAX("(?:ab)|cde", 2, 3); CHECK_MIN_MAX("(ab)", 2, 2); CHECK_MIN_MAX("(ab|cde)", 2, 3); CHECK_MIN_MAX("(ab)\\1", 2, RegExpTree::kInfinity); CHECK_MIN_MAX("(ab|cde)\\1", 2, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:ab)?", 0, 2); CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity); CHECK_MIN_MAX("a?", 0, 1); CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("a??", 0, 1); CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a?)?", 0, 1); CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a+)+", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a?)*", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a*)*", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a+)*", 0, RegExpTree::kInfinity); CHECK_MIN_MAX("a{0}", 0, 0); CHECK_MIN_MAX("(?:a+){0}", 0, 0); CHECK_MIN_MAX("(?:a+){0,0}", 0, 0); CHECK_MIN_MAX("a*b", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("a+b", 2, RegExpTree::kInfinity); CHECK_MIN_MAX("a*b|c", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("a+b|c", 1, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:a{5,1000000}){3,1000000}", 15, RegExpTree::kInfinity); CHECK_MIN_MAX("(?:ab){4,7}", 8, 14); CHECK_MIN_MAX("a\\bc", 2, 2); CHECK_MIN_MAX("a\\Bc", 2, 2); CHECK_MIN_MAX("a\\sc", 3, 3); CHECK_MIN_MAX("a\\Sc", 3, 3); CHECK_MIN_MAX("a(?=b)c", 2, 2); CHECK_MIN_MAX("a(?=bbb|bb)c", 2, 2); CHECK_MIN_MAX("a(?!bbb|bb)c", 2, 2); CheckParseEq("(?x)(?x)(?x)\\k", "(: (^ 'x') (^ 'x') (^ 'x') (<- 1))", true); CheckParseEq("(?x)(?x)(?x)\\k", "(: (^ 'x') (^ 'x') (^ 'x') (<- 2))", true); CheckParseEq("(?x)(?x)(?x)\\k", "(: (^ 'x') (^ 'x') (^ 'x') (<- 3))", true); CheckParseEq("(?a)\\k ", "(: (^ 'a') (<- 1))", true); CheckParseEq("(?a\\k )", "(^ 'a')", true); CheckParseEq("(?\\k a)", "(^ 'a')", true); CheckParseEq("(?\\k)(?\\k)", "(: (^ (<- 2)) (^ (<- 1)))", true); CheckParseEq("\\k (?a)", "(: (<- 1) (^ 'a'))", true); CheckParseEq("(?<\\u{03C0}>a)", "(^ 'a')", true); CheckParseEq("(?<\\u03C0>a)", "(^ 'a')", true); } TEST(ParserRegression) { CheckParseEq("[A-Z$-][x]", "(! [A-Z $ -] [x])"); CheckParseEq("a{3,4*}", "(: 'a{3,' (# 0 - g '4') '}')"); CheckParseEq("{", "'{'"); CheckParseEq("a|", "(| 'a' %)"); } static void ExpectError(const char* input, const char* expected, bool unicode = false) { Isolate* isolate = CcTest::i_isolate(); v8::HandleScope scope(CcTest::isolate()); Zone zone(isolate->allocator(), ZONE_NAME); FlatStringReader reader(isolate, CStrVector(input)); RegExpCompileData result; JSRegExp::Flags flags = JSRegExp::kNone; if (unicode) flags |= JSRegExp::kUnicode; CHECK(!v8::internal::RegExpParser::ParseRegExp(isolate, &zone, &reader, flags, &result)); CHECK_NULL(result.tree); CHECK(!result.error.is_null()); std::unique_ptr str = result.error->ToCString(ALLOW_NULLS); CHECK_EQ(0, strcmp(expected, str.get())); } TEST(Errors) { const char* kEndBackslash = "\\ at end of pattern"; ExpectError("\\", kEndBackslash); const char* kUnterminatedGroup = "Unterminated group"; ExpectError("(foo", kUnterminatedGroup); const char* kInvalidGroup = "Invalid group"; ExpectError("(?", kInvalidGroup); const char* kUnterminatedCharacterClass = "Unterminated character class"; ExpectError("[", kUnterminatedCharacterClass); ExpectError("[a-", kUnterminatedCharacterClass); const char* kNothingToRepeat = "Nothing to repeat"; ExpectError("*", kNothingToRepeat); ExpectError("?", kNothingToRepeat); ExpectError("+", kNothingToRepeat); ExpectError("{1}", kNothingToRepeat); ExpectError("{1,2}", kNothingToRepeat); ExpectError("{1,}", kNothingToRepeat); // Check that we don't allow more than kMaxCapture captures const int kMaxCaptures = 1 << 16; // Must match RegExpParser::kMaxCaptures. const char* kTooManyCaptures = "Too many captures"; std::ostringstream os; for (int i = 0; i <= kMaxCaptures; i++) { os << "()"; } ExpectError(os.str().c_str(), kTooManyCaptures); const char* kInvalidCaptureName = "Invalid capture group name"; ExpectError("(?<>.)", kInvalidCaptureName, true); ExpectError("(?<1>.)", kInvalidCaptureName, true); ExpectError("(?<_%>.)", kInvalidCaptureName, true); ExpectError("\\k.)(?.)", kDuplicateCaptureName, true); const char* kInvalidUnicodeEscape = "Invalid Unicode escape sequence"; ExpectError("(?<\\u{FISK}", kInvalidUnicodeEscape, true); const char* kInvalidCaptureReferenced = "Invalid named capture referenced"; ExpectError("\\k ", kInvalidCaptureReferenced, true); ExpectError("(?)\\k", kInvalidCaptureReferenced, true); const char* kInvalidNamedReference = "Invalid named reference"; ExpectError("\\ka", kInvalidNamedReference, true); } static bool IsDigit(uc16 c) { return ('0' <= c && c <= '9'); } static bool NotDigit(uc16 c) { return !IsDigit(c); } static bool IsWhiteSpaceOrLineTerminator(uc16 c) { // According to ECMA 5.1, 15.10.2.12 the CharacterClassEscape \s includes // WhiteSpace (7.2) and LineTerminator (7.3) values. return v8::internal::IsWhiteSpaceOrLineTerminator(c); } static bool NotWhiteSpaceNorLineTermiantor(uc16 c) { return !IsWhiteSpaceOrLineTerminator(c); } static bool NotWord(uc16 c) { return !IsRegExpWord(c); } static void TestCharacterClassEscapes(uc16 c, bool (pred)(uc16 c)) { Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); ZoneList* ranges = new(&zone) ZoneList(2, &zone); CharacterRange::AddClassEscape(c, ranges, &zone); for (uc32 i = 0; i < (1 << 16); i++) { bool in_class = false; for (int j = 0; !in_class && j < ranges->length(); j++) { CharacterRange& range = ranges->at(j); in_class = (range.from() <= i && i <= range.to()); } CHECK_EQ(pred(i), in_class); } } TEST(CharacterClassEscapes) { TestCharacterClassEscapes('.', IsRegExpNewline); TestCharacterClassEscapes('d', IsDigit); TestCharacterClassEscapes('D', NotDigit); TestCharacterClassEscapes('s', IsWhiteSpaceOrLineTerminator); TestCharacterClassEscapes('S', NotWhiteSpaceNorLineTermiantor); TestCharacterClassEscapes('w', IsRegExpWord); TestCharacterClassEscapes('W', NotWord); } static RegExpNode* Compile(const char* input, bool multiline, bool unicode, bool is_one_byte, Zone* zone) { Isolate* isolate = CcTest::i_isolate(); FlatStringReader reader(isolate, CStrVector(input)); RegExpCompileData compile_data; JSRegExp::Flags flags = JSRegExp::kNone; if (multiline) flags = JSRegExp::kMultiline; if (unicode) flags = JSRegExp::kUnicode; if (!v8::internal::RegExpParser::ParseRegExp(CcTest::i_isolate(), zone, &reader, flags, &compile_data)) return nullptr; Handle pattern = isolate->factory() ->NewStringFromUtf8(CStrVector(input)) .ToHandleChecked(); Handle sample_subject = isolate->factory()->NewStringFromUtf8(CStrVector("")).ToHandleChecked(); RegExpEngine::Compile(isolate, zone, &compile_data, flags, pattern, sample_subject, is_one_byte); return compile_data.node; } static void Execute(const char* input, bool multiline, bool unicode, bool is_one_byte, bool dot_output = false) { v8::HandleScope scope(CcTest::isolate()); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); RegExpNode* node = Compile(input, multiline, unicode, is_one_byte, &zone); USE(node); #ifdef DEBUG if (dot_output) { RegExpEngine::DotPrint(input, node, false); } #endif // DEBUG } class TestConfig { public: typedef int Key; typedef int Value; static const int kNoKey; static int NoValue() { return 0; } static inline int Compare(int a, int b) { if (a < b) return -1; else if (a > b) return 1; else return 0; } }; const int TestConfig::kNoKey = 0; static unsigned PseudoRandom(int i, int j) { return ~(~((i * 781) ^ (j * 329))); } TEST(SplayTreeSimple) { static const unsigned kLimit = 1000; Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); ZoneSplayTree tree(&zone); bool seen[kLimit]; for (unsigned i = 0; i < kLimit; i++) seen[i] = false; #define CHECK_MAPS_EQUAL() do { \ for (unsigned k = 0; k < kLimit; k++) \ CHECK_EQ(seen[k], tree.Find(k, &loc)); \ } while (false) for (int i = 0; i < 50; i++) { for (int j = 0; j < 50; j++) { int next = PseudoRandom(i, j) % kLimit; if (seen[next]) { // We've already seen this one. Check the value and remove // it. ZoneSplayTree::Locator loc; CHECK(tree.Find(next, &loc)); CHECK_EQ(next, loc.key()); CHECK_EQ(3 * next, loc.value()); tree.Remove(next); seen[next] = false; CHECK_MAPS_EQUAL(); } else { // Check that it wasn't there already and then add it. ZoneSplayTree::Locator loc; CHECK(!tree.Find(next, &loc)); CHECK(tree.Insert(next, &loc)); CHECK_EQ(next, loc.key()); loc.set_value(3 * next); seen[next] = true; CHECK_MAPS_EQUAL(); } int val = PseudoRandom(j, i) % kLimit; if (seen[val]) { ZoneSplayTree::Locator loc; CHECK(tree.FindGreatestLessThan(val, &loc)); CHECK_EQ(loc.key(), val); break; } val = PseudoRandom(i + j, i - j) % kLimit; if (seen[val]) { ZoneSplayTree::Locator loc; CHECK(tree.FindLeastGreaterThan(val, &loc)); CHECK_EQ(loc.key(), val); break; } } } } TEST(DispatchTableConstruction) { // Initialize test data. static const int kLimit = 1000; static const int kRangeCount = 8; static const int kRangeSize = 16; uc16 ranges[kRangeCount][2 * kRangeSize]; for (int i = 0; i < kRangeCount; i++) { Vector range(ranges[i], 2 * kRangeSize); for (int j = 0; j < 2 * kRangeSize; j++) { range[j] = PseudoRandom(i + 25, j + 87) % kLimit; } range.Sort(); for (int j = 1; j < 2 * kRangeSize; j++) { CHECK(range[j-1] <= range[j]); } } // Enter test data into dispatch table. Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); DispatchTable table(&zone); for (int i = 0; i < kRangeCount; i++) { uc16* range = ranges[i]; for (int j = 0; j < 2 * kRangeSize; j += 2) table.AddRange(CharacterRange::Range(range[j], range[j + 1]), i, &zone); } // Check that the table looks as we would expect for (int p = 0; p < kLimit; p++) { OutSet* outs = table.Get(p); for (int j = 0; j < kRangeCount; j++) { uc16* range = ranges[j]; bool is_on = false; for (int k = 0; !is_on && (k < 2 * kRangeSize); k += 2) is_on = (range[k] <= p && p <= range[k + 1]); CHECK_EQ(is_on, outs->Get(j)); } } } // Test of debug-only syntax. #ifdef DEBUG TEST(ParsePossessiveRepetition) { bool old_flag_value = FLAG_regexp_possessive_quantifier; // Enable possessive quantifier syntax. FLAG_regexp_possessive_quantifier = true; CheckParseEq("a*+", "(# 0 - p 'a')"); CheckParseEq("a++", "(# 1 - p 'a')"); CheckParseEq("a?+", "(# 0 1 p 'a')"); CheckParseEq("a{10,20}+", "(# 10 20 p 'a')"); CheckParseEq("za{10,20}+b", "(: 'z' (# 10 20 p 'a') 'b')"); // Disable possessive quantifier syntax. FLAG_regexp_possessive_quantifier = false; CHECK_PARSE_ERROR("a*+"); CHECK_PARSE_ERROR("a++"); CHECK_PARSE_ERROR("a?+"); CHECK_PARSE_ERROR("a{10,20}+"); CHECK_PARSE_ERROR("a{10,20}+b"); FLAG_regexp_possessive_quantifier = old_flag_value; } #endif // Tests of interpreter. #ifndef V8_INTERPRETED_REGEXP #if V8_TARGET_ARCH_IA32 typedef RegExpMacroAssemblerIA32 ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_X64 typedef RegExpMacroAssemblerX64 ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_ARM typedef RegExpMacroAssemblerARM ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_ARM64 typedef RegExpMacroAssemblerARM64 ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_S390 typedef RegExpMacroAssemblerS390 ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_PPC typedef RegExpMacroAssemblerPPC ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_MIPS typedef RegExpMacroAssemblerMIPS ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_MIPS64 typedef RegExpMacroAssemblerMIPS ArchRegExpMacroAssembler; #elif V8_TARGET_ARCH_X87 typedef RegExpMacroAssemblerX87 ArchRegExpMacroAssembler; #endif class ContextInitializer { public: ContextInitializer() : scope_(CcTest::isolate()), env_(v8::Context::New(CcTest::isolate())) { env_->Enter(); } ~ContextInitializer() { env_->Exit(); } private: v8::HandleScope scope_; v8::Local env_; }; static ArchRegExpMacroAssembler::Result Execute(Code code, String input, int start_offset, Address input_start, Address input_end, int* captures) { return NativeRegExpMacroAssembler::Execute( code, input, start_offset, reinterpret_cast(input_start), reinterpret_cast(input_end), captures, 0, CcTest::i_isolate()); } TEST(MacroAssemblerNativeSuccess) { v8::V8::Initialize(); ContextInitializer initializer; Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); Zone zone(CcTest::i_isolate()->allocator(), ZONE_NAME); ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1, 4); m.Succeed(); Handle source = factory->NewStringFromStaticChars(""); Handle