interpreter-irregexp.cc 20.6 KB
Newer Older
1
// Copyright 2011 the V8 project authors. All rights reserved.
2 3
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
4 5 6

// A simple interpreter for the Irregexp byte code.

7 8
#ifdef V8_INTERPRETED_REGEXP

9
#include "src/regexp/interpreter-irregexp.h"
10

11
#include "src/ast/ast.h"
12
#include "src/objects-inl.h"
13 14 15
#include "src/regexp/bytecodes-irregexp.h"
#include "src/regexp/jsregexp.h"
#include "src/regexp/regexp-macro-assembler.h"
16 17
#include "src/unicode.h"
#include "src/utils.h"
18

19
#ifdef V8_INTL_SUPPORT
20
#include "unicode/uchar.h"
21
#endif  // V8_INTL_SUPPORT
22

23 24
namespace v8 {
namespace internal {
25

26
typedef unibrow::Mapping<unibrow::Ecma262Canonicalize> Canonicalize;
27

28 29 30 31 32 33 34 35 36 37
static bool BackRefMatchesNoCase(Isolate* isolate, int from, int current,
                                 int len, Vector<const uc16> subject,
                                 bool unicode) {
  Address offset_a =
      reinterpret_cast<Address>(const_cast<uc16*>(&subject.at(from)));
  Address offset_b =
      reinterpret_cast<Address>(const_cast<uc16*>(&subject.at(current)));
  size_t length = len * kUC16Size;
  return RegExpMacroAssembler::CaseInsensitiveCompareUC16(
             offset_a, offset_b, length, unicode ? nullptr : isolate) == 1;
38 39 40
}


41 42 43 44
static bool BackRefMatchesNoCase(Isolate* isolate, int from, int current,
                                 int len, Vector<const uint8_t> subject,
                                 bool unicode) {
  // For Latin1 characters the unicode flag makes no difference.
45 46 47 48
  for (int i = 0; i < len; i++) {
    unsigned int old_char = subject[from++];
    unsigned int new_char = subject[current++];
    if (old_char == new_char) continue;
49 50 51
    // Convert both characters to lower case.
    old_char |= 0x20;
    new_char |= 0x20;
52
    if (old_char != new_char) return false;
53 54 55 56 57
    // Not letters in the ASCII range and Latin-1 range.
    if (!(old_char - 'a' <= 'z' - 'a') &&
        !(old_char - 224 <= 254 - 224 && old_char != 247)) {
      return false;
    }
58 59 60 61 62
  }
  return true;
}


63 64 65 66 67
#ifdef DEBUG
static void TraceInterpreter(const byte* code_base,
                             const byte* pc,
                             int stack_depth,
                             int current_position,
68
                             uint32_t current_char,
69 70 71
                             int bytecode_length,
                             const char* bytecode_name) {
  if (FLAG_trace_regexp_bytecodes) {
72 73 74 75 76 77
    bool printable = (current_char < 127 && current_char >= 32);
    const char* format =
        printable ?
        "pc = %02x, sp = %d, curpos = %d, curchar = %08x (%c), bc = %s" :
        "pc = %02x, sp = %d, curpos = %d, curchar = %08x .%c., bc = %s";
    PrintF(format,
78 79 80
           pc - code_base,
           stack_depth,
           current_position,
81 82
           current_char,
           printable ? current_char : '.',
83
           bytecode_name);
84
    for (int i = 0; i < bytecode_length; i++) {
85 86
      printf(", %02x", pc[i]);
    }
87 88 89 90 91 92 93 94 95
    printf(" ");
    for (int i = 1; i < bytecode_length; i++) {
      unsigned char b = pc[i];
      if (b < 127 && b >= 32) {
        printf("%c", b);
      } else {
        printf(".");
      }
    }
96 97 98 99 100
    printf("\n");
  }
}


101 102 103 104 105 106 107 108
#define BYTECODE(name)                                                      \
  case BC_##name:                                                           \
    TraceInterpreter(code_base,                                             \
                     pc,                                                    \
                     static_cast<int>(backtrack_sp - backtrack_stack_base), \
                     current,                                               \
                     current_char,                                          \
                     BC_##name##_LENGTH,                                    \
109
                     #name);
110
#else
111
#define BYTECODE(name)                                                      \
112
  case BC_##name:
113 114 115
#endif


116
static int32_t Load32Aligned(const byte* pc) {
117
  DCHECK_EQ(0, reinterpret_cast<intptr_t>(pc) & 3);
118 119 120 121 122
  return *reinterpret_cast<const int32_t *>(pc);
}


static int32_t Load16Aligned(const byte* pc) {
123
  DCHECK_EQ(0, reinterpret_cast<intptr_t>(pc) & 1);
124 125 126
  return *reinterpret_cast<const uint16_t *>(pc);
}

127

128 129 130 131 132 133
// A simple abstraction over the backtracking stack used by the interpreter.
// This backtracking stack does not grow automatically, but it ensures that the
// the memory held by the stack is released or remembered in a cache if the
// matching terminates.
class BacktrackStack {
 public:
134
  BacktrackStack() { data_ = NewArray<int>(kBacktrackStackSize); }
135 136

  ~BacktrackStack() {
137
    DeleteArray(data_);
138 139 140 141 142 143 144 145 146 147 148 149 150 151 152
  }

  int* data() const { return data_; }

  int max_size() const { return kBacktrackStackSize; }

 private:
  static const int kBacktrackStackSize = 10000;

  int* data_;

  DISALLOW_COPY_AND_ASSIGN(BacktrackStack);
};


153
template <typename Char>
154 155 156 157 158 159
static RegExpImpl::IrregexpResult RawMatch(Isolate* isolate,
                                           const byte* code_base,
                                           Vector<const Char> subject,
                                           int* registers,
                                           int current,
                                           uint32_t current_char) {
160
  const byte* pc = code_base;
161 162 163
  // BacktrackStack ensures that the memory allocated for the backtracking stack
  // is returned to the system or cached if there is no stack being cached at
  // the moment.
164
  BacktrackStack backtrack_stack;
165
  int* backtrack_stack_base = backtrack_stack.data();
166
  int* backtrack_sp = backtrack_stack_base;
167
  int backtrack_stack_space = backtrack_stack.max_size();
168 169 170 171 172 173
#ifdef DEBUG
  if (FLAG_trace_regexp_bytecodes) {
    PrintF("\n\nStart bytecode interpreter\n\n");
  }
#endif
  while (true) {
174 175
    int32_t insn = Load32Aligned(pc);
    switch (insn & BYTECODE_MASK) {
176 177 178 179
      BYTECODE(BREAK)
        UNREACHABLE();
      BYTECODE(PUSH_CP)
        if (--backtrack_stack_space < 0) {
180
          return RegExpImpl::RE_EXCEPTION;
181
        }
182
        *backtrack_sp++ = current;
183 184 185 186
        pc += BC_PUSH_CP_LENGTH;
        break;
      BYTECODE(PUSH_BT)
        if (--backtrack_stack_space < 0) {
187
          return RegExpImpl::RE_EXCEPTION;
188
        }
189
        *backtrack_sp++ = Load32Aligned(pc + 4);
190 191 192 193
        pc += BC_PUSH_BT_LENGTH;
        break;
      BYTECODE(PUSH_REGISTER)
        if (--backtrack_stack_space < 0) {
194
          return RegExpImpl::RE_EXCEPTION;
195
        }
196
        *backtrack_sp++ = registers[insn >> BYTECODE_SHIFT];
197 198 199
        pc += BC_PUSH_REGISTER_LENGTH;
        break;
      BYTECODE(SET_REGISTER)
200
        registers[insn >> BYTECODE_SHIFT] = Load32Aligned(pc + 4);
201 202 203
        pc += BC_SET_REGISTER_LENGTH;
        break;
      BYTECODE(ADVANCE_REGISTER)
204
        registers[insn >> BYTECODE_SHIFT] += Load32Aligned(pc + 4);
205 206 207
        pc += BC_ADVANCE_REGISTER_LENGTH;
        break;
      BYTECODE(SET_REGISTER_TO_CP)
208
        registers[insn >> BYTECODE_SHIFT] = current + Load32Aligned(pc + 4);
209 210 211
        pc += BC_SET_REGISTER_TO_CP_LENGTH;
        break;
      BYTECODE(SET_CP_TO_REGISTER)
212
        current = registers[insn >> BYTECODE_SHIFT];
213 214 215
        pc += BC_SET_CP_TO_REGISTER_LENGTH;
        break;
      BYTECODE(SET_REGISTER_TO_SP)
216 217
        registers[insn >> BYTECODE_SHIFT] =
            static_cast<int>(backtrack_sp - backtrack_stack_base);
218 219 220
        pc += BC_SET_REGISTER_TO_SP_LENGTH;
        break;
      BYTECODE(SET_SP_TO_REGISTER)
221
        backtrack_sp = backtrack_stack_base + registers[insn >> BYTECODE_SHIFT];
222
        backtrack_stack_space = backtrack_stack.max_size() -
223
            static_cast<int>(backtrack_sp - backtrack_stack_base);
224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239
        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;
        break;
      BYTECODE(POP_REGISTER)
        backtrack_stack_space++;
        --backtrack_sp;
240
        registers[insn >> BYTECODE_SHIFT] = *backtrack_sp;
241 242 243
        pc += BC_POP_REGISTER_LENGTH;
        break;
      BYTECODE(FAIL)
244
        return RegExpImpl::RE_FAILURE;
245
      BYTECODE(SUCCEED)
246
        return RegExpImpl::RE_SUCCESS;
247
      BYTECODE(ADVANCE_CP)
248
        current += insn >> BYTECODE_SHIFT;
249 250 251
        pc += BC_ADVANCE_CP_LENGTH;
        break;
      BYTECODE(GOTO)
252
        pc = code_base + Load32Aligned(pc + 4);
253
        break;
254 255 256 257
      BYTECODE(ADVANCE_CP_AND_GOTO)
        current += insn >> BYTECODE_SHIFT;
        pc = code_base + Load32Aligned(pc + 4);
        break;
erik.corry@gmail.com's avatar
erik.corry@gmail.com committed
258 259 260 261
      BYTECODE(CHECK_GREEDY)
        if (current == backtrack_sp[-1]) {
          backtrack_sp--;
          backtrack_stack_space++;
262
          pc = code_base + Load32Aligned(pc + 4);
erik.corry@gmail.com's avatar
erik.corry@gmail.com committed
263 264 265 266
        } else {
          pc += BC_CHECK_GREEDY_LENGTH;
        }
        break;
267
      BYTECODE(LOAD_CURRENT_CHAR) {
268
        int pos = current + (insn >> BYTECODE_SHIFT);
269
        if (pos >= subject.length() || pos < 0) {
270
          pc = code_base + Load32Aligned(pc + 4);
271 272 273 274 275 276
        } else {
          current_char = subject[pos];
          pc += BC_LOAD_CURRENT_CHAR_LENGTH;
        }
        break;
      }
erik.corry@gmail.com's avatar
erik.corry@gmail.com committed
277
      BYTECODE(LOAD_CURRENT_CHAR_UNCHECKED) {
278
        int pos = current + (insn >> BYTECODE_SHIFT);
erik.corry@gmail.com's avatar
erik.corry@gmail.com committed
279 280 281 282
        current_char = subject[pos];
        pc += BC_LOAD_CURRENT_CHAR_UNCHECKED_LENGTH;
        break;
      }
283
      BYTECODE(LOAD_2_CURRENT_CHARS) {
284
        int pos = current + (insn >> BYTECODE_SHIFT);
285
        if (pos + 2 > subject.length() || pos < 0) {
286
          pc = code_base + Load32Aligned(pc + 4);
287 288 289 290 291 292 293 294 295
        } else {
          Char next = subject[pos + 1];
          current_char =
              (subject[pos] | (next << (kBitsPerByte * sizeof(Char))));
          pc += BC_LOAD_2_CURRENT_CHARS_LENGTH;
        }
        break;
      }
      BYTECODE(LOAD_2_CURRENT_CHARS_UNCHECKED) {
296
        int pos = current + (insn >> BYTECODE_SHIFT);
297 298 299 300 301 302
        Char next = subject[pos + 1];
        current_char = (subject[pos] | (next << (kBitsPerByte * sizeof(Char))));
        pc += BC_LOAD_2_CURRENT_CHARS_UNCHECKED_LENGTH;
        break;
      }
      BYTECODE(LOAD_4_CURRENT_CHARS) {
303
        DCHECK_EQ(1, sizeof(Char));
304
        int pos = current + (insn >> BYTECODE_SHIFT);
305
        if (pos + 4 > subject.length() || pos < 0) {
306
          pc = code_base + Load32Aligned(pc + 4);
307 308 309 310 311 312 313 314 315 316 317 318 319
        } else {
          Char next1 = subject[pos + 1];
          Char next2 = subject[pos + 2];
          Char next3 = subject[pos + 3];
          current_char = (subject[pos] |
                          (next1 << 8) |
                          (next2 << 16) |
                          (next3 << 24));
          pc += BC_LOAD_4_CURRENT_CHARS_LENGTH;
        }
        break;
      }
      BYTECODE(LOAD_4_CURRENT_CHARS_UNCHECKED) {
320
        DCHECK_EQ(1, sizeof(Char));
321
        int pos = current + (insn >> BYTECODE_SHIFT);
322 323 324 325 326 327 328 329 330 331
        Char next1 = subject[pos + 1];
        Char next2 = subject[pos + 2];
        Char next3 = subject[pos + 3];
        current_char = (subject[pos] |
                        (next1 << 8) |
                        (next2 << 16) |
                        (next3 << 24));
        pc += BC_LOAD_4_CURRENT_CHARS_UNCHECKED_LENGTH;
        break;
      }
332 333 334 335 336 337 338 339 340
      BYTECODE(CHECK_4_CHARS) {
        uint32_t c = Load32Aligned(pc + 4);
        if (c == current_char) {
          pc = code_base + Load32Aligned(pc + 8);
        } else {
          pc += BC_CHECK_4_CHARS_LENGTH;
        }
        break;
      }
341
      BYTECODE(CHECK_CHAR) {
342
        uint32_t c = (insn >> BYTECODE_SHIFT);
343
        if (c == current_char) {
344
          pc = code_base + Load32Aligned(pc + 4);
345 346 347 348 349
        } else {
          pc += BC_CHECK_CHAR_LENGTH;
        }
        break;
      }
350 351 352 353 354 355 356 357 358
      BYTECODE(CHECK_NOT_4_CHARS) {
        uint32_t c = Load32Aligned(pc + 4);
        if (c != current_char) {
          pc = code_base + Load32Aligned(pc + 8);
        } else {
          pc += BC_CHECK_NOT_4_CHARS_LENGTH;
        }
        break;
      }
359
      BYTECODE(CHECK_NOT_CHAR) {
360
        uint32_t c = (insn >> BYTECODE_SHIFT);
361
        if (c != current_char) {
362
          pc = code_base + Load32Aligned(pc + 4);
363 364 365 366 367
        } else {
          pc += BC_CHECK_NOT_CHAR_LENGTH;
        }
        break;
      }
368 369 370 371 372 373 374 375 376
      BYTECODE(AND_CHECK_4_CHARS) {
        uint32_t c = Load32Aligned(pc + 4);
        if (c == (current_char & Load32Aligned(pc + 8))) {
          pc = code_base + Load32Aligned(pc + 12);
        } else {
          pc += BC_AND_CHECK_4_CHARS_LENGTH;
        }
        break;
      }
377
      BYTECODE(AND_CHECK_CHAR) {
378 379 380
        uint32_t c = (insn >> BYTECODE_SHIFT);
        if (c == (current_char & Load32Aligned(pc + 4))) {
          pc = code_base + Load32Aligned(pc + 8);
381
        } else {
382
          pc += BC_AND_CHECK_CHAR_LENGTH;
383 384 385
        }
        break;
      }
386 387 388 389 390 391 392 393 394
      BYTECODE(AND_CHECK_NOT_4_CHARS) {
        uint32_t c = Load32Aligned(pc + 4);
        if (c != (current_char & Load32Aligned(pc + 8))) {
          pc = code_base + Load32Aligned(pc + 12);
        } else {
          pc += BC_AND_CHECK_NOT_4_CHARS_LENGTH;
        }
        break;
      }
395
      BYTECODE(AND_CHECK_NOT_CHAR) {
396 397 398
        uint32_t c = (insn >> BYTECODE_SHIFT);
        if (c != (current_char & Load32Aligned(pc + 4))) {
          pc = code_base + Load32Aligned(pc + 8);
399 400 401 402 403 404
        } else {
          pc += BC_AND_CHECK_NOT_CHAR_LENGTH;
        }
        break;
      }
      BYTECODE(MINUS_AND_CHECK_NOT_CHAR) {
405 406 407
        uint32_t c = (insn >> BYTECODE_SHIFT);
        uint32_t minus = Load16Aligned(pc + 4);
        uint32_t mask = Load16Aligned(pc + 6);
408
        if (c != ((current_char - minus) & mask)) {
409
          pc = code_base + Load32Aligned(pc + 8);
410
        } else {
411
          pc += BC_MINUS_AND_CHECK_NOT_CHAR_LENGTH;
412 413 414
        }
        break;
      }
415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
      BYTECODE(CHECK_CHAR_IN_RANGE) {
        uint32_t from = Load16Aligned(pc + 4);
        uint32_t to = Load16Aligned(pc + 6);
        if (from <= current_char && current_char <= to) {
          pc = code_base + Load32Aligned(pc + 8);
        } else {
          pc += BC_CHECK_CHAR_IN_RANGE_LENGTH;
        }
        break;
      }
      BYTECODE(CHECK_CHAR_NOT_IN_RANGE) {
        uint32_t from = Load16Aligned(pc + 4);
        uint32_t to = Load16Aligned(pc + 6);
        if (from > current_char || current_char > to) {
          pc = code_base + Load32Aligned(pc + 8);
        } else {
          pc += BC_CHECK_CHAR_NOT_IN_RANGE_LENGTH;
        }
        break;
      }
      BYTECODE(CHECK_BIT_IN_TABLE) {
        int mask = RegExpMacroAssembler::kTableMask;
        byte b = pc[8 + ((current_char & mask) >> kBitsPerByteLog2)];
        int bit = (current_char & (kBitsPerByte - 1));
        if ((b & (1 << bit)) != 0) {
          pc = code_base + Load32Aligned(pc + 4);
        } else {
          pc += BC_CHECK_BIT_IN_TABLE_LENGTH;
        }
        break;
      }
446
      BYTECODE(CHECK_LT) {
447
        uint32_t limit = (insn >> BYTECODE_SHIFT);
448
        if (current_char < limit) {
449
          pc = code_base + Load32Aligned(pc + 4);
450 451 452 453 454 455
        } else {
          pc += BC_CHECK_LT_LENGTH;
        }
        break;
      }
      BYTECODE(CHECK_GT) {
456
        uint32_t limit = (insn >> BYTECODE_SHIFT);
457
        if (current_char > limit) {
458
          pc = code_base + Load32Aligned(pc + 4);
459 460 461 462 463 464
        } else {
          pc += BC_CHECK_GT_LENGTH;
        }
        break;
      }
      BYTECODE(CHECK_REGISTER_LT)
465 466
        if (registers[insn >> BYTECODE_SHIFT] < Load32Aligned(pc + 4)) {
          pc = code_base + Load32Aligned(pc + 8);
467 468 469 470 471
        } else {
          pc += BC_CHECK_REGISTER_LT_LENGTH;
        }
        break;
      BYTECODE(CHECK_REGISTER_GE)
472 473
        if (registers[insn >> BYTECODE_SHIFT] >= Load32Aligned(pc + 4)) {
          pc = code_base + Load32Aligned(pc + 8);
474 475 476 477
        } else {
          pc += BC_CHECK_REGISTER_GE_LENGTH;
        }
        break;
478
      BYTECODE(CHECK_REGISTER_EQ_POS)
479 480
        if (registers[insn >> BYTECODE_SHIFT] == current) {
          pc = code_base + Load32Aligned(pc + 4);
481 482 483 484
        } else {
          pc += BC_CHECK_REGISTER_EQ_POS_LENGTH;
        }
        break;
485
      BYTECODE(CHECK_NOT_REGS_EQUAL)
erik.corry@gmail.com's avatar
erik.corry@gmail.com committed
486 487
        if (registers[insn >> BYTECODE_SHIFT] ==
            registers[Load32Aligned(pc + 4)]) {
488 489
          pc += BC_CHECK_NOT_REGS_EQUAL_LENGTH;
        } else {
490
          pc = code_base + Load32Aligned(pc + 8);
491 492
        }
        break;
493
      BYTECODE(CHECK_NOT_BACK_REF) {
494 495
        int from = registers[insn >> BYTECODE_SHIFT];
        int len = registers[(insn >> BYTECODE_SHIFT) + 1] - from;
496 497 498 499 500
        if (from >= 0 && len > 0) {
          if (current + len > subject.length() ||
              CompareChars(&subject[from], &subject[current], len) != 0) {
            pc = code_base + Load32Aligned(pc + 4);
            break;
501 502 503 504 505 506
          }
          current += len;
        }
        pc += BC_CHECK_NOT_BACK_REF_LENGTH;
        break;
      }
507 508 509 510 511 512 513 514 515 516 517 518 519 520
      BYTECODE(CHECK_NOT_BACK_REF_BACKWARD) {
        int from = registers[insn >> BYTECODE_SHIFT];
        int len = registers[(insn >> BYTECODE_SHIFT) + 1] - from;
        if (from >= 0 && len > 0) {
          if (current - len < 0 ||
              CompareChars(&subject[from], &subject[current - len], len) != 0) {
            pc = code_base + Load32Aligned(pc + 4);
            break;
          }
          current -= len;
        }
        pc += BC_CHECK_NOT_BACK_REF_BACKWARD_LENGTH;
        break;
      }
521
      BYTECODE(CHECK_NOT_BACK_REF_NO_CASE_UNICODE)
522
      V8_FALLTHROUGH;
523
      BYTECODE(CHECK_NOT_BACK_REF_NO_CASE) {
524 525
        bool unicode =
            (insn & BYTECODE_MASK) == BC_CHECK_NOT_BACK_REF_NO_CASE_UNICODE;
526 527
        int from = registers[insn >> BYTECODE_SHIFT];
        int len = registers[(insn >> BYTECODE_SHIFT) + 1] - from;
528 529
        if (from >= 0 && len > 0) {
          if (current + len > subject.length() ||
530 531
              !BackRefMatchesNoCase(isolate, from, current, len, subject,
                                    unicode)) {
532 533 534 535
            pc = code_base + Load32Aligned(pc + 4);
            break;
          }
          current += len;
536
        }
537 538 539
        pc += BC_CHECK_NOT_BACK_REF_NO_CASE_LENGTH;
        break;
      }
540
      BYTECODE(CHECK_NOT_BACK_REF_NO_CASE_UNICODE_BACKWARD)
541
      V8_FALLTHROUGH;
542
      BYTECODE(CHECK_NOT_BACK_REF_NO_CASE_BACKWARD) {
543 544
        bool unicode = (insn & BYTECODE_MASK) ==
                       BC_CHECK_NOT_BACK_REF_NO_CASE_UNICODE_BACKWARD;
545 546 547 548
        int from = registers[insn >> BYTECODE_SHIFT];
        int len = registers[(insn >> BYTECODE_SHIFT) + 1] - from;
        if (from >= 0 && len > 0) {
          if (current - len < 0 ||
549 550
              !BackRefMatchesNoCase(isolate, from, current - len, len, subject,
                                    unicode)) {
551
            pc = code_base + Load32Aligned(pc + 4);
552
            break;
553
          }
554
          current -= len;
555
        }
556
        pc += BC_CHECK_NOT_BACK_REF_NO_CASE_BACKWARD_LENGTH;
557 558
        break;
      }
559 560
      BYTECODE(CHECK_AT_START)
        if (current == 0) {
561
          pc = code_base + Load32Aligned(pc + 4);
562 563 564 565
        } else {
          pc += BC_CHECK_AT_START_LENGTH;
        }
        break;
566
      BYTECODE(CHECK_NOT_AT_START)
567
        if (current + (insn >> BYTECODE_SHIFT) == 0) {
568 569
          pc += BC_CHECK_NOT_AT_START_LENGTH;
        } else {
570
          pc = code_base + Load32Aligned(pc + 4);
571 572
        }
        break;
573 574 575 576 577 578 579 580 581
      BYTECODE(SET_CURRENT_POSITION_FROM_END) {
        int by = static_cast<uint32_t>(insn) >> BYTECODE_SHIFT;
        if (subject.length() - current > by) {
          current = subject.length() - by;
          current_char = subject[current - 1];
        }
        pc += BC_SET_CURRENT_POSITION_FROM_END_LENGTH;
        break;
      }
582 583 584 585 586 587 588 589
      default:
        UNREACHABLE();
        break;
    }
  }
}


590 591 592 593 594 595
RegExpImpl::IrregexpResult IrregexpInterpreter::Match(
    Isolate* isolate,
    Handle<ByteArray> code_array,
    Handle<String> subject,
    int* registers,
    int start_position) {
596
  DCHECK(subject->IsFlat());
597

598
  DisallowHeapAllocation no_gc;
599
  const byte* code_base = code_array->GetDataStartAddress();
600
  uc16 previous_char = '\n';
lrn@chromium.org's avatar
lrn@chromium.org committed
601
  String::FlatContent subject_content = subject->GetFlatContent();
602
  if (subject_content.IsOneByte()) {
603
    Vector<const uint8_t> subject_vector = subject_content.ToOneByteVector();
604
    if (start_position != 0) previous_char = subject_vector[start_position - 1];
605 606
    return RawMatch(isolate,
                    code_base,
607 608 609 610 611
                    subject_vector,
                    registers,
                    start_position,
                    previous_char);
  } else {
612
    DCHECK(subject_content.IsTwoByte());
613
    Vector<const uc16> subject_vector = subject_content.ToUC16Vector();
614
    if (start_position != 0) previous_char = subject_vector[start_position - 1];
615 616
    return RawMatch(isolate,
                    code_base,
617 618 619 620 621
                    subject_vector,
                    registers,
                    start_position,
                    previous_char);
  }
622 623
}

624 625
}  // namespace internal
}  // namespace v8
626 627

#endif  // V8_INTERPRETED_REGEXP