* Add support for positive lookahead assertions and negative...

test/cctest/test-regexp.cc

 // Copyright 2006-2008 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
@@ skipping 516 matching lines @@
   Re2kAssembler assembler(Vector<byte>(codes, 1024));
 #define __ assembler.
   Label advance;
   Label look_for_foo;
   Label fail;
   __ GoTo(&look_for_foo);
   __ Bind(&advance);
   __ AdvanceCP(1);
   __ Bind(&look_for_foo);
   __ LoadCurrentChar(0, &fail);
-  __ CheckChar('f', &advance);
+  __ CheckNotCharacter('f', &advance);
   __ LoadCurrentChar(1, &fail);
-  __ CheckChar('o', &advance);
+  __ CheckNotCharacter('o', &advance);
   __ LoadCurrentChar(2, &fail);
-  __ CheckChar('o', &advance);
-  __ SetRegisterToCurrentPosition(0);
-  __ SetRegisterToCurrentPosition(1, 2);
+  __ CheckNotCharacter('o', &advance);
+  __ WriteCurrentPositionToRegister(0);
+  __ WriteCurrentPositionToRegister(1, 2);
   __ Succeed();
   __ Bind(&fail);
   __ Fail();
 
   v8::HandleScope scope;
   Handle<ByteArray> array = Factory::NewByteArray(assembler.length());
   assembler.Copy(array->GetDataStartAddress());
   int captures[2];
 
   Handle<String> f1 =
@@ skipping 23 matching lines @@
   // /^.*foo/
   Label more_dots;
   Label unwind_dot;
   Label failure;
   Label foo;
   Label foo_failed;
   Label dot_match;
   // ^
   __ PushCurrentPosition();
   __ PushRegister(0);
-  __ SetRegisterToCurrentPosition(0);
+  __ WriteCurrentPositionToRegister(0);
   __ PushBacktrack(&failure);
   __ GoTo(&dot_match);
   // .*
   __ Bind(&more_dots);
   __ AdvanceCP(1);
   __ Bind(&dot_match);
   __ PushCurrentPosition();
   __ PushBacktrack(&unwind_dot);
   __ LoadCurrentChar(0, &foo);
-  __ CheckChar('\n', &more_dots);
+  __ CheckNotCharacter('\n', &more_dots);
   // foo
   __ Bind(&foo);
-  __ CheckChar('f', &foo_failed);
+  __ CheckNotCharacter('f', &foo_failed);
   __ LoadCurrentChar(1, &foo_failed);
-  __ CheckChar('o', &foo_failed);
+  __ CheckNotCharacter('o', &foo_failed);
   __ LoadCurrentChar(2, &foo_failed);
-  __ CheckChar('o', &foo_failed);
-  __ SetRegisterToCurrentPosition(1, 2);
+  __ CheckNotCharacter('o', &foo_failed);
+  __ WriteCurrentPositionToRegister(1, 2);
   __ Succeed();
   __ Break();
 
   __ Bind(&foo_failed);
   __ PopBacktrack();
   __ Break();
 
   __ Bind(&unwind_dot);
   __ PopCurrentPosition();
   __ LoadCurrentChar(0, &foo_failed);
@@ skipping 191 matching lines @@
 TEST(SimplePropagation) {
   v8::HandleScope scope;
   ZoneScope zone_scope(DELETE_ON_EXIT);
   RegExpNode* node = Compile("(a|^b|c)");
   CHECK(node->info()->determine_start);
 }
 
 
 TEST(Graph) {
   V8::Initialize(NULL);
-  Execute("(a|^b|c)", "", true);
+  Execute(".*o(?=o)", "", true);
 }