-
-
Notifications
You must be signed in to change notification settings - Fork 741
/
jswrap_regexp.c
420 lines (395 loc) · 13 KB
/
jswrap_regexp.c
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
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
/*
* This file is part of Espruino, a JavaScript interpreter for Microcontrollers
*
* Copyright (C) 2017 Gordon Williams <gw@pur3.co.uk>
*
* 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 is designed to be parsed during the build process
*
* JavaScript methods for Regular Expressions
* ----------------------------------------------------------------------------
*/
#include "jswrap_regexp.h"
#include "jsparse.h"
#include "jshardware.h"
#include "jslex.h"
#include "jsinteractive.h"
/* TODO:
*
* Handling of 'global' flag especially
* lastIndex support?
*/
#define MAX_GROUPS 9
#define NO_RANGE 256
typedef struct {
JsVar *sourceStr;
size_t startIndex;
bool ignoreCase;
bool rangeMatch;
short rangeFirstChar;
int groups;
size_t groupStart[MAX_GROUPS];
size_t groupEnd[MAX_GROUPS];
} matchInfo;
static JsVar *matchhere(char *regexp, JsvStringIterator *txtIt, matchInfo info);
static JsVar *matchfound(JsvStringIterator *txtIt, matchInfo info) {
JsVar *rmatch = jsvNewEmptyArray();
size_t endIndex = jsvStringIteratorGetIndex(txtIt);
JsVar *matchStr = jsvNewFromStringVar(info.sourceStr, info.startIndex, endIndex-info.startIndex);
jsvSetArrayItem(rmatch, 0, matchStr);
jsvUnLock(matchStr);
int i;
for (i=0;i<info.groups;i++) {
matchStr = jsvNewFromStringVar(info.sourceStr, info.groupStart[i], info.groupEnd[i]-info.groupStart[i]);
jsvSetArrayItem(rmatch, i+1, matchStr);
jsvUnLock(matchStr);
}
jsvObjectSetChildAndUnLock(rmatch, "index", jsvNewFromInteger((JsVarInt)info.startIndex));
jsvObjectSetChild(rmatch, "input", info.sourceStr);
return rmatch;
}
// No match found, so search to end of regex to see if there's an '|'
static JsVar *nomatchfound(char *regexp, matchInfo info) {
if (!jspCheckStackPosition()) return 0;
// TODO: | inside a group?
while (*regexp && *regexp!='|') {
if (*regexp=='\\') {
regexp++; // end of regex after escape char!
if (!*regexp) return 0;
}
regexp++;
}
if (*regexp != '|') return 0;
regexp++;
JsvStringIterator txtIt;
jsvStringIteratorNew(&txtIt, info.sourceStr, info.startIndex);
JsVar *rmatch = matchhere(regexp, &txtIt, info);
jsvStringIteratorFree(&txtIt);
return rmatch;
}
/* match: search for regexp anywhere in text */
static JsVar *match(char *regexp, JsVar *str, size_t startIndex, bool ignoreCase) {
matchInfo info;
info.sourceStr = str;
info.startIndex = startIndex;
info.ignoreCase = ignoreCase;
info.rangeMatch = false;
info.rangeFirstChar = NO_RANGE;
info.groups = 0;
JsVar *rmatch;
JsvStringIterator txtIt, txtIt2;
jsvStringIteratorNew(&txtIt, str, startIndex);
/* must look even if string is empty */
jsvStringIteratorClone(&txtIt2, &txtIt);
rmatch = matchhere(regexp, &txtIt2, info);
jsvStringIteratorFree(&txtIt2);
jsvStringIteratorNext(&txtIt);
while (!rmatch && jsvStringIteratorHasChar(&txtIt)) {
info.startIndex++;
jsvStringIteratorClone(&txtIt2, &txtIt);
rmatch = matchhere(regexp, &txtIt2, info);
jsvStringIteratorFree(&txtIt2);
jsvStringIteratorNext(&txtIt);
}
jsvStringIteratorFree(&txtIt);
return rmatch;
}
/* Match one character. Doesn't modify txtIt, returns length of regexp char in *length */
bool matchcharacter(char *regexp, JsvStringIterator *txtIt, int *length, matchInfo *info) {
*length = 1;
char ch = jsvStringIteratorGetChar(txtIt);
if (regexp[0]=='.') return true;
if (regexp[0]=='[') { // Character set (any char inside '[]')
info->rangeMatch = true;
bool inverted = regexp[1]=='^';
if (inverted) (*length)++;
bool matchAny = false;
while (regexp[*length] && regexp[*length]!=']') {
int matchLen;
if (regexp[*length]=='.') { // https://github.com/espruino/Espruino/issues/1948
matchAny |= ch=='.';
(*length)++;
} else {
matchAny |= matchcharacter(®exp[*length], txtIt, &matchLen, info);
(*length) += matchLen;
}
}
if (regexp[*length]==']') {
(*length)++;
} else {
jsExceptionHere(JSET_ERROR, "Unfinished character set in RegEx");
return false;
}
info->rangeMatch = false;
return matchAny != inverted;
}
char cH = regexp[0];
if (cH=='\\') { // escape character
*length = 2;
// fallback to the quoted character (e.g. /,-,? etc.)
cH = regexp[1];
// missing quite a few here
// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
if (cH=='d') return isNumeric(ch);
if (cH=='D') return !isNumeric(ch);
if (cH=='f') { cH=0x0C; goto haveCode; }
if (cH=='b') { cH=0x08; goto haveCode; }
if (cH=='n') { cH=0x0A; goto haveCode; }
if (cH=='r') { cH=0x0D; goto haveCode; }
if (cH=='s') return isWhitespace(ch);
if (cH=='S') return !isWhitespace(ch);
if (cH=='t') { cH=0x09; goto haveCode; }
if (cH=='v') { cH=0x0B; goto haveCode; }
if (cH=='w') return isNumeric(ch) || isAlpha(ch) || ch=='_';
if (cH=='W') return !(isNumeric(ch) || isAlpha(ch) || ch=='_');
if (cH=='0') { cH=0; goto haveCode; }
if (cH>='1' && cH<='9') {
jsExceptionHere(JSET_ERROR, "Backreferences not supported");
return false;
// we could implement this if needed by matching against info->groupStart/End
}
if (cH=='x' && regexp[2] && regexp[3]) {
*length = 4;
cH = (char)hexToByte(regexp[2],regexp[3]);
goto haveCode;
}
}
haveCode:
if (info->rangeMatch && regexp[*length] == '-' && regexp[1+*length] != ']') { // Character set range start
info->rangeFirstChar = cH;
(*length)++;
int matchLen;
bool match = matchcharacter(®exp[*length], txtIt, &matchLen, info);
(*length)+=matchLen;
return match;
}
if (info->ignoreCase) {
ch = charToLowerCase(ch);
cH = charToLowerCase(cH);
}
if (info->rangeFirstChar != NO_RANGE) { // Character set range
char cL = (char)info->rangeFirstChar;
if (info->ignoreCase) {
cL = charToLowerCase(cL);
}
info->rangeFirstChar = NO_RANGE;
return (ch >= cL && ch <= cH && cL < cH);
}
return cH==ch;
}
/* matchhere: search for regexp at beginning of text. Only handles up to '|' character. Modifies txtIt */
static JsVar *matchhere(char *regexp, JsvStringIterator *txtIt, matchInfo info) {
if (jspIsInterrupted()) return 0;
if (regexp[0] == '\0' || // end of regex
regexp[0] == '|') // end of this 'or' section of regex
return matchfound(txtIt, info);
if (regexp[0] == '^') { // must be beginning of String
if (jsvStringIteratorGetIndex(txtIt)!=0)
return 0; // no match
if (!jspCheckStackPosition()) return 0;
return matchhere(regexp+1, txtIt, info);
}
// Marker for end of String
if (regexp[0] == '$') {
if (!jsvStringIteratorHasChar(txtIt))
return matchhere(regexp+1, txtIt, info);
else
return nomatchfound(regexp+1, info); // not the end, it's a fail
}
if (regexp[0] == '(') {
info.groupStart[info.groups] = jsvStringIteratorGetIndex(txtIt);
info.groupEnd[info.groups] = info.groupStart[info.groups];
if (info.groups<MAX_GROUPS) info.groups++;
if (!jspCheckStackPosition()) return 0;
return matchhere(regexp+1, txtIt, info);
}
if (regexp[0] == ')') {
if (info.groups>0)
info.groupEnd[info.groups-1] = jsvStringIteratorGetIndex(txtIt);
if (!jspCheckStackPosition()) return 0;
return matchhere(regexp+1, txtIt, info);
}
int charLength;
bool charMatched = matchcharacter(regexp, txtIt, &charLength, &info);
if (regexp[charLength] == '*' || regexp[charLength] == '+') {
char op = regexp[charLength];
if (!charMatched && op=='+') {
// with '+' operator it has to match at least once
return nomatchfound(®exp[charLength+1], info);
}
char *regexpAfterStar = regexp+charLength+1;
JsvStringIterator txtIt2;
// Try and match everything after right now
jsvStringIteratorClone(&txtIt2, txtIt);
JsVar *lastrmatch = matchhere(regexpAfterStar, &txtIt2, info);
jsvStringIteratorFree(&txtIt2);
// Otherwise try and match more than one
while (jsvStringIteratorHasChar(txtIt) && charMatched) {
// We had this character matched, so move on and see if we can match with the new one
jsvStringIteratorNext(txtIt);
charMatched = matchcharacter(regexp, txtIt, &charLength, &info);
// See if we can match after the character...
jsvStringIteratorClone(&txtIt2, txtIt);
JsVar *rmatch = matchhere(regexpAfterStar, &txtIt2, info);
jsvStringIteratorFree(&txtIt2);
// can't match with this - use the last one
if (rmatch) {
jsvUnLock(lastrmatch);
lastrmatch = rmatch;
}
}
return lastrmatch;
}
// This character is matched
if (jsvStringIteratorHasChar(txtIt) && charMatched) {
jsvStringIteratorNext(txtIt);
if (!jspCheckStackPosition()) return 0;
return matchhere(regexp+charLength, txtIt, info);
}
// No match
return nomatchfound(®exp[charLength], info);
}
/*JSON{
"type" : "class",
"ifndef" : "SAVE_ON_FLASH",
"class" : "RegExp"
}
The built-in class for handling Regular Expressions
**Note:** Espruino's regular expression parser does not contain all the features
present in a full ES6 JS engine. However it does contain support for the all the
basics.
*/
/*JSON{
"type" : "constructor",
"ifndef" : "SAVE_ON_FLASH",
"class" : "RegExp",
"name" : "RegExp",
"generate" : "jswrap_regexp_constructor",
"params" : [
["regex","JsVar","A regular expression as a string"],
["flags","JsVar","Flags for the regular expression as a string"]
],
"return" : ["JsVar","A RegExp object"],
"return_object" : "RegExp"
}
Creates a RegExp object, for handling Regular Expressions
*/
JsVar *jswrap_regexp_constructor(JsVar *str, JsVar *flags) {
if (!jsvIsString(str)) {
jsExceptionHere(JSET_TYPEERROR, "Expecting String as first argument, got %t", str);
return 0;
}
JsVar *r = jspNewObject(0,"RegExp");
jsvObjectSetChild(r, "source", str);
if (!jsvIsUndefined(flags)) {
if (!jsvIsString(flags))
jsExceptionHere(JSET_TYPEERROR, "Expecting String as first argument, got %t", str);
else
jsvObjectSetChild(r, "flags", flags);
}
jsvObjectSetChildAndUnLock(r, "lastIndex", jsvNewFromInteger(0));
return r;
}
/*JSON{
"type" : "method",
"ifndef" : "SAVE_ON_FLASH",
"class" : "RegExp",
"name" : "exec",
"params" : [
["str","JsVar","A string to match on"]
],
"generate" : "jswrap_regexp_exec",
"return" : ["JsVar","A result array, or null"]
}
Test this regex on a string - returns a result array on success, or `null`
otherwise.
`/Wo/.exec("Hello World")` will return:
```
[
"Wo",
"index": 6,
"input": "Hello World"
]
```
Or with groups `/W(o)rld/.exec("Hello World")` returns:
```
[
"World",
"o", "index": 6,
"input": "Hello World"
]
```
*/
JsVar *jswrap_regexp_exec(JsVar *parent, JsVar *arg) {
JsVar *str = jsvAsString(arg);
JsVarInt lastIndex = jsvGetIntegerAndUnLock(jsvObjectGetChild(parent, "lastIndex", 0));
JsVar *regex = jsvObjectGetChild(parent, "source", 0);
if (!jsvIsString(regex) || lastIndex>jsvGetStringLength(str)) {
jsvUnLock2(str,regex);
return 0;
}
size_t regexLen = jsvGetStringLength(regex);
char *regexPtr = (char *)alloca(regexLen+1);
if (!regexPtr) {
jsvUnLock2(str,regex);
return 0;
}
jsvGetString(regex, regexPtr, regexLen+1);
jsvUnLock(regex);
JsVar *rmatch = match(regexPtr, str, (size_t)lastIndex, jswrap_regexp_hasFlag(parent,'i'));
jsvUnLock(str);
if (!rmatch) {
rmatch = jsvNewWithFlags(JSV_NULL);
lastIndex = 0;
} else {
// if it's global, set lastIndex
if (jswrap_regexp_hasFlag(parent,'g')) {
JsVar *matchStr = jsvGetArrayItem(rmatch,0);
lastIndex = jsvGetIntegerAndUnLock(jsvObjectGetChild(rmatch, "index", 0)) +
(JsVarInt)jsvGetStringLength(matchStr);
jsvUnLock(matchStr);
} else
lastIndex = 0;
}
jsvObjectSetChildAndUnLock(parent, "lastIndex", jsvNewFromInteger(lastIndex));
return rmatch;
}
/*JSON{
"type" : "method",
"ifndef" : "SAVE_ON_FLASH",
"class" : "RegExp",
"name" : "test",
"params" : [
["str","JsVar","A string to match on"]
],
"generate" : "jswrap_regexp_test",
"return" : ["bool","true for a match, or false"]
}
Test this regex on a string - returns `true` on a successful match, or `false`
otherwise
*/
bool jswrap_regexp_test(JsVar *parent, JsVar *str) {
JsVar *v = jswrap_regexp_exec(parent, str);
bool r = v && !jsvIsNull(v);
jsvUnLock(v);
return r;
}
/// Does this regex have the given flag?
bool jswrap_regexp_hasFlag(JsVar *parent, char flag) {
JsVar *flags = jsvObjectGetChild(parent, "flags", 0);
bool has = false;
if (jsvIsString(flags)) {
JsvStringIterator it;
jsvStringIteratorNew(&it, flags, 0);
while (jsvStringIteratorHasChar(&it)) {
has |= jsvStringIteratorGetCharAndNext(&it)==flag;
}
jsvStringIteratorFree(&it);
}
jsvUnLock(flags);
return has;
}