Lines Matching refs:CHECK
89 CHECK(v8::internal::RegExpParser::ParseRegExp(
91 CHECK(result.tree != NULL);
92 CHECK(result.error.is_null());
104 CHECK(v8::internal::RegExpParser::ParseRegExp(
106 CHECK(result.tree != NULL);
107 CHECK(result.error.is_null());
123 CHECK(v8::internal::RegExpParser::ParseRegExp(
125 CHECK(result.tree != NULL);
126 CHECK(result.error.is_null());
134 #define CHECK_PARSE_ERROR(input) CHECK(!CheckParse(input))
397 CHECK(!v8::internal::RegExpParser::ParseRegExp(
399 CHECK(result.tree == NULL);
400 CHECK(!result.error.is_null());
424 // Check that we don't allow more than kMaxCapture captures
588 // We've already seen this one. Check the value and remove
591 CHECK(tree.Find(next, &loc));
598 // Check that it wasn't there already and then add it.
600 CHECK(!tree.Find(next, &loc));
601 CHECK(tree.Insert(next, &loc));
610 CHECK(tree.FindGreatestLessThan(val, &loc));
617 CHECK(tree.FindLeastGreaterThan(val, &loc));
640 CHECK(range[j-1] <= range[j]);
651 // Check that the table looks as we would expect
1069 // Check that prevchar = '\n' and current = 'f'.
1079 // Check that prevchar = 'o' and current = 'b'.
1313 CHECK(isolate->has_pending_exception());
1417 CHECK(IrregexpInterpreter::Match(isolate, array, f1_16, captures, 0));
1428 CHECK(!IrregexpInterpreter::Match(isolate, array, f2_16, captures, 0));
1469 CHECK(!table.Get(0xFFFE)->Get(0));
1470 CHECK(table.Get(0xFFFF)->Get(0));
1529 // Check that we arrive at the same result when using the basic
1658 CHECK(!InClass(i, included));
1659 CHECK(!InClass(i, excluded));
