-
Notifications
You must be signed in to change notification settings - Fork 1.9k
Expand file tree
/
Copy pathRegExpPrototype.js
More file actions
361 lines (305 loc) · 13.3 KB
/
RegExpPrototype.js
File metadata and controls
361 lines (305 loc) · 13.3 KB
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
/*
* Copyright (C) 2016-2018 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
@linkTimeConstant
function advanceStringIndex(string, index, unicode)
{
// This function implements AdvanceStringIndex described in ES6 21.2.5.2.3.
"use strict";
if (!unicode)
return index + 1;
if (index + 1 >= string.length)
return index + 1;
var first = string.@charCodeAt(index);
if (first < 0xD800 || first > 0xDBFF)
return index + 1;
var second = string.@charCodeAt(index + 1);
if (second < 0xDC00 || second > 0xDFFF)
return index + 1;
return index + 2;
}
@linkTimeConstant
function regExpExec(regexp, str)
{
"use strict";
var exec = regexp.exec;
var builtinExec = @regExpBuiltinExec;
if (exec !== builtinExec && @isCallable(exec)) {
var result = exec.@call(regexp, str);
if (result !== null && !@isObject(result))
@throwTypeError("The result of a RegExp exec must be null or an object");
return result;
}
return builtinExec.@call(regexp, str);
}
@linkTimeConstant
function hasObservableSideEffectsForRegExpMatch(regexp)
{
"use strict";
if (!@isRegExpObject(regexp))
return true;
// This is accessed by the RegExpExec internal function.
var regexpExec = @tryGetById(regexp, "exec");
if (regexpExec !== @regExpBuiltinExec)
return true;
var regexpFlags = @tryGetById(regexp, "flags");
if (regexpFlags !== @regExpProtoFlagsGetter)
return true;
// These are accessed by the builtin flags getter.
var regexpGlobal = @tryGetById(regexp, "global");
if (regexpGlobal !== @regExpProtoGlobalGetter)
return true;
var regexpHasIndices = @tryGetById(regexp, "hasIndices");
if (regexpHasIndices !== @regExpProtoHasIndicesGetter)
return true;
var regexpIgnoreCase = @tryGetById(regexp, "ignoreCase");
if (regexpIgnoreCase !== @regExpProtoIgnoreCaseGetter)
return true;
var regexpMultiline = @tryGetById(regexp, "multiline");
if (regexpMultiline !== @regExpProtoMultilineGetter)
return true;
var regexpSticky = @tryGetById(regexp, "sticky");
if (regexpSticky !== @regExpProtoStickyGetter)
return true;
var regexpDotAll = @tryGetById(regexp, "dotAll");
if (regexpDotAll !== @regExpProtoDotAllGetter)
return true;
var regexpUnicode = @tryGetById(regexp, "unicode");
if (regexpUnicode !== @regExpProtoUnicodeGetter)
return true;
var regexpUnicodeSets = @tryGetById(regexp, "unicodeSets");
if (regexpUnicodeSets !== @regExpProtoUnicodeSetsGetter)
return true;
return typeof regexp.lastIndex !== "number";
}
@linkTimeConstant
function matchSlow(regexp, str)
{
"use strict";
var flags = @toString(regexp.flags);
var global = @stringIncludesInternal.@call(flags, "g");
if (!global)
return @regExpExec(regexp, str);
var unicode = @stringIncludesInternal.@call(flags, "u") || @stringIncludesInternal.@call(flags, "v");
regexp.lastIndex = 0;
var resultList = [];
// FIXME: It would be great to implement a solution similar to what we do in
// RegExpObject::matchGlobal(). It's not clear if this is possible, since this loop has
// effects. https://bugs.webkit.org/show_bug.cgi?id=158145
var maximumReasonableMatchSize = 100000000;
while (true) {
var result = @regExpExec(regexp, str);
if (result === null) {
if (resultList.length === 0)
return null;
return resultList;
}
if (resultList.length > maximumReasonableMatchSize)
@throwOutOfMemoryError();
var resultString = @toString(result[0]);
if (!resultString.length)
regexp.lastIndex = @advanceStringIndex(str, regexp.lastIndex, unicode);
@arrayPush(resultList, resultString);
}
}
@overriddenName="[Symbol.match]"
function match(strArg)
{
"use strict";
if (!@isObject(this))
@throwTypeError("RegExp.prototype.@@match requires that |this| be an Object");
var str = @toString(strArg);
// Check for observable side effects and call the fast path if there aren't any.
if (!@hasObservableSideEffectsForRegExpMatch(this))
return @regExpMatchFast.@call(this, str);
return @matchSlow(this, str);
}
@linkTimeConstant
function hasObservableSideEffectsForRegExpSplit(regexp)
{
"use strict";
if (!@isRegExpObject(regexp))
return true;
// This is accessed by the RegExpExec internal function.
var regexpExec = @tryGetById(regexp, "exec");
if (regexpExec !== @regExpBuiltinExec)
return true;
// This is accessed by step 5 below.
var regexpFlags = @tryGetById(regexp, "flags");
if (regexpFlags !== @regExpProtoFlagsGetter)
return true;
// These are accessed by the builtin flags getter.
var regexpGlobal = @tryGetById(regexp, "global");
if (regexpGlobal !== @regExpProtoGlobalGetter)
return true;
var regexpHasIndices = @tryGetById(regexp, "hasIndices");
if (regexpHasIndices !== @regExpProtoHasIndicesGetter)
return true;
var regexpIgnoreCase = @tryGetById(regexp, "ignoreCase");
if (regexpIgnoreCase !== @regExpProtoIgnoreCaseGetter)
return true;
var regexpMultiline = @tryGetById(regexp, "multiline");
if (regexpMultiline !== @regExpProtoMultilineGetter)
return true;
var regexpSticky = @tryGetById(regexp, "sticky");
if (regexpSticky !== @regExpProtoStickyGetter)
return true;
var regexpDotAll = @tryGetById(regexp, "dotAll");
if (regexpDotAll !== @regExpProtoDotAllGetter)
return true;
var regexpUnicode = @tryGetById(regexp, "unicode");
if (regexpUnicode !== @regExpProtoUnicodeGetter)
return true;
var regexpUnicodeSets = @tryGetById(regexp, "unicodeSets");
if (regexpUnicodeSets !== @regExpProtoUnicodeSetsGetter)
return true;
// These are accessed by the RegExp species constructor.
var regexpSource = @tryGetById(regexp, "source");
if (regexpSource !== @regExpProtoSourceGetter)
return true;
var regexpSymbolMatch = @tryGetByIdWithWellKnownSymbol(regexp, "match");
if (regexpSymbolMatch !== @regExpPrototypeSymbolMatch)
return true;
return typeof regexp.lastIndex !== "number";
}
// ES 21.2.5.11 RegExp.prototype[@@split](string, limit)
@overriddenName="[Symbol.split]"
function split(string, limit)
{
"use strict";
// 1. Let rx be the this value.
// 2. If Type(rx) is not Object, throw a TypeError exception.
if (!@isObject(this))
@throwTypeError("RegExp.prototype.@@split requires that |this| be an Object");
var regexp = this;
// 3. Let S be ? ToString(string).
var str = @toString(string);
// 4. Let C be ? SpeciesConstructor(rx, %RegExp%).
var speciesConstructor = @speciesConstructor(regexp, @RegExp);
// Skip fast path if limit is number or undefined
// https://bugzilla.mozilla.org/show_bug.cgi?id=1287525
var isLimitNumberOrUndefined = typeof limit === "number" || limit === @undefined;
if (speciesConstructor === @RegExp && !@hasObservableSideEffectsForRegExpSplit(regexp) && isLimitNumberOrUndefined)
return @regExpSplitFast.@call(regexp, str, limit);
// 5. Let flags be ? ToString(? Get(rx, "flags")).
var flags = @toString(regexp.flags);
// 6. If flags contains "u" or flags contains "v", var unicodeMatching be true.
// 7. Else, let unicodeMatching be false.
var unicodeMatching = @stringIncludesInternal.@call(flags, "u") || @stringIncludesInternal.@call(flags, "v");
// 8. If flags contains "y", var newFlags be flags.
// 9. Else, let newFlags be the string that is the concatenation of flags and "y".
var newFlags = @stringIncludesInternal.@call(flags, "y") ? flags : flags + "y";
// 10. Let splitter be ? Construct(C, « rx, newFlags »).
var splitter = new speciesConstructor(regexp, newFlags);
// We need to check again for RegExp subclasses that will fail the speciesConstructor test
// but can still use the fast path after we invoke the constructor above.
if (!@hasObservableSideEffectsForRegExpSplit(splitter) && isLimitNumberOrUndefined)
return @regExpSplitFast.@call(splitter, str, limit);
// 11. Let A be ArrayCreate(0).
// 12. Let lengthA be 0.
var result = [];
// 13. If limit is undefined, let lim be 2^32-1; else var lim be ? ToUint32(limit).
limit = (limit === @undefined) ? 0xffffffff : limit >>> 0;
// 16. If lim = 0, return A.
if (!limit)
return result;
// 14. [Defered from above] Let size be the number of elements in S.
var size = str.length;
// 17. If size = 0, then
if (!size) {
// a. Let z be ? RegExpExec(splitter, S).
var z = @regExpExec(splitter, str);
// b. If z is not null, return A.
if (z !== null)
return result;
// c. Perform ! CreateDataProperty(A, "0", S).
@putByValDirect(result, 0, str);
// d. Return A.
return result;
}
// 15. [Defered from above] Let p be 0.
var position = 0;
// 18. Let q be p.
var matchPosition = 0;
// 19. Repeat, while q < size
while (matchPosition < size) {
// a. Perform ? Set(splitter, "lastIndex", q, true).
splitter.lastIndex = matchPosition;
// b. Let z be ? RegExpExec(splitter, S).
var matches = @regExpExec(splitter, str);
// c. If z is null, let q be AdvanceStringIndex(S, q, unicodeMatching).
if (matches === null)
matchPosition = @advanceStringIndex(str, matchPosition, unicodeMatching);
// d. Else z is not null,
else {
// i. Let e be ? ToLength(? Get(splitter, "lastIndex")).
var endPosition = @toLength(splitter.lastIndex);
// ii. Let e be min(e, size).
endPosition = (endPosition <= size) ? endPosition : size;
// iii. If e = p, let q be AdvanceStringIndex(S, q, unicodeMatching).
if (endPosition === position)
matchPosition = @advanceStringIndex(str, matchPosition, unicodeMatching);
// iv. Else e != p,
else {
// 1. Let T be a String value equal to the substring of S consisting of the elements at indices p (inclusive) through q (exclusive).
var subStr = @stringSubstring.@call(str, position, matchPosition);
// 2. Perform ! CreateDataProperty(A, ! ToString(lengthA), T).
// 3. Let lengthA be lengthA + 1.
@arrayPush(result, subStr);
// 4. If lengthA = lim, return A.
if (result.length == limit)
return result;
// 5. Let p be e.
position = endPosition;
// 6. Let numberOfCaptures be ? ToLength(? Get(z, "length")).
var numberOfCaptures = matches.length;
// 7. Let numberOfCaptures be max(numberOfCaptures-1, 0).
numberOfCaptures = numberOfCaptures > 1 ? numberOfCaptures - 1 : 0;
// 8. Let i be 1.
var i = 1;
// 9. Repeat, while i <= numberOfCaptures,
while (i <= numberOfCaptures) {
// a. Let nextCapture be ? Get(z, ! ToString(i)).
var nextCapture = matches[i];
// b. Perform ! CreateDataProperty(A, ! ToString(lengthA), nextCapture).
// d. Let lengthA be lengthA + 1.
@arrayPush(result, nextCapture);
// e. If lengthA = lim, return A.
if (result.length == limit)
return result;
// c. Let i be i + 1.
i++;
}
// 10. Let q be p.
matchPosition = position;
}
}
}
// 20. Let T be a String value equal to the substring of S consisting of the elements at indices p (inclusive) through size (exclusive).
var remainingStr = @stringSubstring.@call(str, position, size);
// 21. Perform ! CreateDataProperty(A, ! ToString(lengthA), T).
@arrayPush(result, remainingStr);
// 22. Return A.
return result;
}