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
98
99
100
|
/* -*- 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 file forward-defines Irregexp classes that need to be visible
// to the rest of Spidermonkey and re-exports them into js::irregexp.
#ifndef regexp_RegExpTypes_h
#define regexp_RegExpTypes_h
#include "js/UniquePtr.h"
namespace js {
class MatchPairs;
}
namespace v8 {
namespace internal {
class ByteArrayData {
public:
uint32_t length;
uint8_t* data();
uint8_t get(uint32_t index) {
MOZ_ASSERT(index < length);
return data()[index];
}
void set(uint32_t index, uint8_t val) {
MOZ_ASSERT(index < length);
data()[index] = val;
}
// Used for FixedIntegerArray.
template <typename T>
T getTyped(uint32_t index);
template <typename T>
void setTyped(uint32_t index, T value);
private:
template <typename T>
T* typedData();
};
class Isolate;
class RegExpStack;
class RegExpStackScope;
struct InputOutputData {
const void* inputStart;
const void* inputEnd;
// Index into inputStart (in chars) at which to begin matching.
size_t startIndex;
js::MatchPairs* matches;
template <typename CharT>
InputOutputData(const CharT* inputStart, const CharT* inputEnd,
size_t startIndex, js::MatchPairs* matches)
: inputStart(inputStart),
inputEnd(inputEnd),
startIndex(startIndex),
matches(matches) {}
// Note: return int32_t instead of size_t to prevent signed => unsigned
// conversions in caller functions.
static constexpr int32_t offsetOfInputStart() {
return int32_t(offsetof(InputOutputData, inputStart));
}
static constexpr int32_t offsetOfInputEnd() {
return int32_t(offsetof(InputOutputData, inputEnd));
}
static constexpr int32_t offsetOfStartIndex() {
return int32_t(offsetof(InputOutputData, startIndex));
}
static constexpr int32_t offsetOfMatches() {
return int32_t(offsetof(InputOutputData, matches));
}
};
} // namespace internal
} // namespace v8
namespace js {
namespace irregexp {
using Isolate = v8::internal::Isolate;
using RegExpStack = v8::internal::RegExpStack;
using RegExpStackScope = v8::internal::RegExpStackScope;
using ByteArrayData = v8::internal::ByteArrayData;
using ByteArray = js::UniquePtr<v8::internal::ByteArrayData, JS::FreePolicy>;
using InputOutputData = v8::internal::InputOutputData;
} // namespace irregexp
} // namespace js
#endif // regexp_RegExpTypes_h
|
