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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/* This is the interface that the regexp engine exposes to SpiderMonkey. */
#ifndef regexp_RegExpAPI_h
#define regexp_RegExpAPI_h
#include "mozilla/Maybe.h"
#include "mozilla/MemoryReporting.h"
#include "mozilla/Range.h"
#include <stddef.h>
#include <stdint.h>
#include "jstypes.h"
#include "irregexp/RegExpTypes.h"
#include "js/ColumnNumber.h" // JS::ColumnNumberOneOigin
#include "js/Stack.h" // JS::NativeStackLimit
#include "vm/RegExpShared.h"
struct JS_PUBLIC_API JSContext;
class JS_PUBLIC_API JSTracer;
namespace JS {
class RegExpFlags;
}
namespace v8::internal {
class RegExpStack;
}
namespace js {
class VectorMatchPairs;
class LifoAlloc;
namespace frontend {
class TokenStreamAnyChars;
}
namespace irregexp {
Isolate* CreateIsolate(JSContext* cx);
void TraceIsolate(JSTracer* trc, Isolate* isolate);
void DestroyIsolate(Isolate* isolate);
size_t IsolateSizeOfIncludingThis(Isolate* isolate,
mozilla::MallocSizeOf mallocSizeOf);
bool CheckPatternSyntax(
js::LifoAlloc& alloc, JS::NativeStackLimit stackLimit,
frontend::TokenStreamAnyChars& ts,
const mozilla::Range<const char16_t> chars, JS::RegExpFlags flags,
mozilla::Maybe<uint32_t> line = mozilla::Nothing(),
mozilla::Maybe<JS::ColumnNumberOneOrigin> column = mozilla::Nothing());
bool CheckPatternSyntax(JSContext* cx, JS::NativeStackLimit stackLimit,
frontend::TokenStreamAnyChars& ts,
Handle<JSAtom*> pattern, JS::RegExpFlags flags);
bool CompilePattern(JSContext* cx, MutableHandleRegExpShared re,
Handle<JSLinearString*> input,
RegExpShared::CodeKind codeKind);
RegExpRunStatus Execute(JSContext* cx, MutableHandleRegExpShared re,
Handle<JSLinearString*> input, size_t start,
VectorMatchPairs* matches);
RegExpRunStatus ExecuteForFuzzing(JSContext* cx, Handle<JSAtom*> pattern,
Handle<JSLinearString*> input,
JS::RegExpFlags flags, size_t startIndex,
VectorMatchPairs* matches,
RegExpShared::CodeKind codeKind);
bool GrowBacktrackStack(v8::internal::RegExpStack* regexp_stack);
uint32_t CaseInsensitiveCompareNonUnicode(const char16_t* substring1,
const char16_t* substring2,
size_t byteLength);
uint32_t CaseInsensitiveCompareUnicode(const char16_t* substring1,
const char16_t* substring2,
size_t byteLength);
bool IsCharacterInRangeArray(uint32_t c, ByteArrayData* ranges);
#ifdef DEBUG
bool IsolateShouldSimulateInterrupt(Isolate* isolate);
void IsolateSetShouldSimulateInterrupt(Isolate* isolate);
void IsolateClearShouldSimulateInterrupt(Isolate* isolate);
#endif
} // namespace irregexp
} // namespace js
#endif /* regexp_RegExpAPI_h */
|
