summaryrefslogtreecommitdiffstats
path: root/chromium/v8/src/regexp/experimental/experimental-interpreter.h
blob: 32bff001b1c4e93d424587013227e0be97e68fbf (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// Copyright 2020 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef V8_REGEXP_EXPERIMENTAL_EXPERIMENTAL_INTERPRETER_H_
#define V8_REGEXP_EXPERIMENTAL_EXPERIMENTAL_INTERPRETER_H_

#include "src/regexp/experimental/experimental-bytecode.h"
#include "src/utils/vector.h"

namespace v8 {
namespace internal {

class Zone;

class ExperimentalRegExpInterpreter final : public AllStatic {
 public:
  // Executes a bytecode program in breadth-first NFA mode, without
  // backtracking, to find matching substrings.  Trys to find up to
  // `max_match_num` matches in `input`, starting at `start_index`.  Returns
  // the actual number of matches found.  The boundaires of matching subranges
  // are written to `matches_out`.  Provided in variants for one-byte and
  // two-byte strings.
  static int FindMatchesNfaOneByte(Vector<const RegExpInstruction> bytecode,
                                   int capture_count,
                                   Vector<const uint8_t> input, int start_index,
                                   int32_t* output_registers,
                                   int output_register_count, Zone* zone);
  static int FindMatchesNfaTwoByte(Vector<const RegExpInstruction> bytecode,
                                   int capture_count, Vector<const uc16> input,
                                   int start_index, int32_t* output_registers,
                                   int output_register_count, Zone* zone);
};

}  // namespace internal
}  // namespace v8

#endif  // V8_REGEXP_EXPERIMENTAL_EXPERIMENTAL_INTERPRETER_H_