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

src/interpreter-re2k.cc

 // Copyright 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 59 matching lines @@
 # define BYTECODE(name) case BC_##name:  // NOLINT
 #endif
 
 
 
 static bool RawMatch(const byte* code_base,
                      Vector<const uc16> subject,
                      int* registers,
                      int current) {
   const byte* pc = code_base;
-  int backtrack_stack[10000];
-  int backtrack_stack_space = 10000;
+  static const int kBacktrackStackSize = 10000;
+  int backtrack_stack[kBacktrackStackSize];
+  int backtrack_stack_space = kBacktrackStackSize;
   int* backtrack_sp = backtrack_stack;
   int current_char = -1;
 #ifdef DEBUG
   if (FLAG_trace_regexp_bytecodes) {
     PrintF("\n\nStart bytecode interpreter\n\n");
   }
 #endif
   while (true) {
     switch (*pc) {
       BYTECODE(BREAK)
@@ skipping 25 matching lines @@
         pc += BC_SET_REGISTER_LENGTH;
         break;
       BYTECODE(ADVANCE_REGISTER)
         registers[pc[1]] += Load32(pc + 2);
         pc += BC_ADVANCE_REGISTER_LENGTH;
         break;
       BYTECODE(SET_REGISTER_TO_CP)
         registers[pc[1]] = current + Load32(pc + 2);
         pc += BC_SET_REGISTER_TO_CP_LENGTH;
         break;
+      BYTECODE(SET_CP_TO_REGISTER)
+        current = registers[pc[1]];
+        pc += BC_SET_CP_TO_REGISTER_LENGTH;
+        break;
+      BYTECODE(SET_REGISTER_TO_SP)
+        registers[pc[1]] = backtrack_sp - backtrack_stack;
+        pc += BC_SET_REGISTER_TO_SP_LENGTH;
+        break;
+      BYTECODE(SET_SP_TO_REGISTER)
+        backtrack_sp = backtrack_stack + registers[pc[1]];
+        backtrack_stack_space = kBacktrackStackSize -
+                                (backtrack_sp - backtrack_stack);
+        pc += BC_SET_SP_TO_REGISTER_LENGTH;
+        break;
       BYTECODE(POP_CP)
         backtrack_stack_space++;
         --backtrack_sp;
         current = *backtrack_sp;
         pc += BC_POP_CP_LENGTH;
         break;
       BYTECODE(POP_BT)
         backtrack_stack_space++;
         --backtrack_sp;
         pc = code_base + *backtrack_sp;
@@ skipping 20 matching lines @@
         if (pos >= subject.length()) {
           pc = code_base + Load32(pc + 5);
         } else {
           current_char = subject[pos];
           pc += BC_LOAD_CURRENT_CHAR_LENGTH;
         }
         break;
       }
       BYTECODE(CHECK_CHAR) {
         int c = Load16(pc + 1);
-        if (c != current_char) {
+        if (c == current_char) {
           pc = code_base + Load32(pc + 3);
         } else {
           pc += BC_CHECK_CHAR_LENGTH;
         }
         break;
       }
       BYTECODE(CHECK_NOT_CHAR) {
         int c = Load16(pc + 1);
-        if (c == current_char) {
+        if (c != current_char) {
           pc = code_base + Load32(pc + 3);
         } else {
           pc += BC_CHECK_NOT_CHAR_LENGTH;
         }
         break;
       }
       BYTECODE(CHECK_LT) {
         int limit = Load16(pc + 1);
         if (current_char < limit) {
           pc = code_base + Load32(pc + 3);
@@ skipping 103 matching lines @@
   AssertNoAllocation a;
   const byte* code_base = code_array->GetDataStartAddress();
   return RawMatch(code_base,
                   Vector<const uc16>(subject16->GetTwoByteData(),
                                      subject16->length()),
                   registers,
                   start_position);
 }
 
 } }  // namespace v8::internal