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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/*
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2003, 2007, 2008 Apple Inc. All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#ifndef RegExpConstructor_h
#define RegExpConstructor_h
#include "InternalFunction.h"
#include "RegExp.h"
#include <wtf/OwnPtr.h>
namespace JSC {
class RegExp;
class RegExpPrototype;
struct RegExpConstructorPrivate;
struct RegExpConstructorPrivate {
WTF_MAKE_FAST_ALLOCATED;
public:
// Global search cache / settings
RegExpConstructorPrivate()
: lastNumSubPatterns(0)
, multiline(false)
, lastOvectorIndex(0)
{
}
const Vector<int, 32>& lastOvector() const { return ovector[lastOvectorIndex]; }
Vector<int, 32>& lastOvector() { return ovector[lastOvectorIndex]; }
Vector<int, 32>& tempOvector() { return ovector[lastOvectorIndex ? 0 : 1]; }
void changeLastOvector() { lastOvectorIndex = lastOvectorIndex ? 0 : 1; }
UString input;
UString lastInput;
Vector<int, 32> ovector[2];
unsigned lastNumSubPatterns : 30;
bool multiline : 1;
unsigned lastOvectorIndex : 1;
};
struct RegExpResult {
WTF_MAKE_FAST_ALLOCATED;
public:
RegExpResult()
: lastNumSubPatterns(0)
{
}
RegExpResult& operator=(const RegExpConstructorPrivate&);
UString input;
unsigned lastNumSubPatterns;
Vector<int, 32> ovector;
};
class RegExpConstructor : public InternalFunction {
public:
typedef InternalFunction Base;
static RegExpConstructor* create(ExecState* exec, JSGlobalObject* globalObject, Structure* structure, RegExpPrototype* regExpPrototype)
{
RegExpConstructor* constructor = new (NotNull, allocateCell<RegExpConstructor>(*exec->heap())) RegExpConstructor(globalObject, structure);
constructor->finishCreation(exec, regExpPrototype);
return constructor;
}
static Structure* createStructure(JSGlobalData& globalData, JSGlobalObject* globalObject, JSValue prototype)
{
return Structure::create(globalData, globalObject, prototype, TypeInfo(ObjectType, StructureFlags), &s_info);
}
static void put(JSCell*, ExecState*, const Identifier& propertyName, JSValue, PutPropertySlot&);
static bool getOwnPropertySlot(JSCell*, ExecState*, const Identifier& propertyName, PropertySlot&);
static bool getOwnPropertyDescriptor(JSObject*, ExecState*, const Identifier&, PropertyDescriptor&);
static const ClassInfo s_info;
void performMatch(JSGlobalData&, RegExp*, const UString&, int startOffset, int& position, int& length, int** ovector = 0);
JSObject* arrayOfMatches(ExecState*) const;
void setInput(const UString&);
const UString& input() const;
void setMultiline(bool);
bool multiline() const;
JSValue getBackref(ExecState*, unsigned) const;
JSValue getLastParen(ExecState*) const;
JSValue getLeftContext(ExecState*) const;
JSValue getRightContext(ExecState*) const;
protected:
void finishCreation(ExecState*, RegExpPrototype*);
static const unsigned StructureFlags = OverridesGetOwnPropertySlot | ImplementsHasInstance | InternalFunction::StructureFlags;
private:
RegExpConstructor(JSGlobalObject*, Structure*);
static void destroy(JSCell*);
static ConstructType getConstructData(JSCell*, ConstructData&);
static CallType getCallData(JSCell*, CallData&);
RegExpConstructorPrivate d;
};
RegExpConstructor* asRegExpConstructor(JSValue);
JSObject* constructRegExp(ExecState*, JSGlobalObject*, const ArgList&, bool callAsConstructor = false);
inline RegExpConstructor* asRegExpConstructor(JSValue value)
{
ASSERT(asObject(value)->inherits(&RegExpConstructor::s_info));
return static_cast<RegExpConstructor*>(asObject(value));
}
/*
To facilitate result caching, exec(), test(), match(), search(), and replace() dipatch regular
expression matching through the performMatch function. We use cached results to calculate,
e.g., RegExp.lastMatch and RegExp.leftParen.
*/
ALWAYS_INLINE void RegExpConstructor::performMatch(JSGlobalData& globalData, RegExp* r, const UString& s, int startOffset, int& position, int& length, int** ovector)
{
position = r->match(globalData, s, startOffset, &d.tempOvector());
if (ovector)
*ovector = d.tempOvector().data();
if (position != -1) {
ASSERT(!d.tempOvector().isEmpty());
length = d.tempOvector()[1] - d.tempOvector()[0];
d.input = s;
d.lastInput = s;
d.changeLastOvector();
d.lastNumSubPatterns = r->numSubpatterns();
}
}
} // namespace JSC
#endif // RegExpConstructor_h
|
