1 /* see copyright notice in squirrel.h */
\r
2 #include <squirrel.h>
\r
6 #include "sqstdstring.h"
\r
9 #define scisprint iswprint
\r
11 #define scisprint isprint
\r
17 static const SQChar *g_nnames[] =
\r
19 _SC("NONE"),_SC("OP_GREEDY"), _SC("OP_OR"),
\r
20 _SC("OP_EXPR"),_SC("OP_NOCAPEXPR"),_SC("OP_DOT"), _SC("OP_CLASS"),
\r
21 _SC("OP_CCLASS"),_SC("OP_NCLASS"),_SC("OP_RANGE"),_SC("OP_CHAR"),
\r
22 _SC("OP_EOL"),_SC("OP_BOL"),_SC("OP_WB")
\r
27 #define OP_GREEDY MAX_CHAR+1 // * + ? {n}
\r
28 #define OP_OR MAX_CHAR+2
\r
29 #define OP_EXPR MAX_CHAR+3 //parentesis ()
\r
30 #define OP_NOCAPEXPR MAX_CHAR+4 //parentesis (?:)
\r
31 #define OP_DOT MAX_CHAR+5
\r
32 #define OP_CLASS MAX_CHAR+6
\r
33 #define OP_CCLASS MAX_CHAR+7
\r
34 #define OP_NCLASS MAX_CHAR+8 //negates class the [^
\r
35 #define OP_RANGE MAX_CHAR+9
\r
36 #define OP_CHAR MAX_CHAR+10
\r
37 #define OP_EOL MAX_CHAR+11
\r
38 #define OP_BOL MAX_CHAR+12
\r
39 #define OP_WB MAX_CHAR+13
\r
41 #define SQREX_SYMBOL_ANY_CHAR '.'
\r
42 #define SQREX_SYMBOL_GREEDY_ONE_OR_MORE '+'
\r
43 #define SQREX_SYMBOL_GREEDY_ZERO_OR_MORE '*'
\r
44 #define SQREX_SYMBOL_GREEDY_ZERO_OR_ONE '?'
\r
45 #define SQREX_SYMBOL_BRANCH '|'
\r
46 #define SQREX_SYMBOL_END_OF_STRING '$'
\r
47 #define SQREX_SYMBOL_BEGINNING_OF_STRING '^'
\r
48 #define SQREX_SYMBOL_ESCAPE_CHAR '\\'
\r
51 typedef int SQRexNodeType;
\r
53 typedef struct tagSQRexNode{
\r
67 SQInteger _nallocated;
\r
69 SQInteger _nsubexpr;
\r
70 SQRexMatch *_matches;
\r
71 SQInteger _currsubexp;
\r
73 const SQChar **_error;
\r
76 static SQInteger sqstd_rex_list(SQRex *exp);
\r
78 static SQInteger sqstd_rex_newnode(SQRex *exp, SQRexNodeType type)
\r
82 n.next = n.right = n.left = -1;
\r
84 n.right = exp->_nsubexpr++;
\r
85 if(exp->_nallocated < (exp->_nsize + 1)) {
\r
86 SQInteger oldsize = exp->_nallocated;
\r
87 exp->_nallocated *= 2;
\r
88 exp->_nodes = (SQRexNode *)sq_realloc(exp->_nodes, oldsize * sizeof(SQRexNode) ,exp->_nallocated * sizeof(SQRexNode));
\r
90 exp->_nodes[exp->_nsize++] = n;
\r
91 return (SQInteger)exp->_nsize - 1;
\r
94 static void sqstd_rex_error(SQRex *exp,const SQChar *error)
\r
96 if(exp->_error) *exp->_error = error;
\r
97 longjmp(*((jmp_buf*)exp->_jmpbuf),-1);
\r
100 static void sqstd_rex_expect(SQRex *exp, SQInteger n){
\r
101 if((*exp->_p) != n)
\r
102 sqstd_rex_error(exp, _SC("expected paren"));
\r
106 /*static SQBool sqstd_rex_ischar(SQChar c)
\r
109 case SQREX_SYMBOL_BRANCH:case SQREX_SYMBOL_GREEDY_ZERO_OR_MORE:
\r
110 case SQREX_SYMBOL_GREEDY_ZERO_OR_ONE:case SQREX_SYMBOL_GREEDY_ONE_OR_MORE:
\r
111 case SQREX_SYMBOL_BEGINNING_OF_STRING:case SQREX_SYMBOL_END_OF_STRING:
\r
112 case SQREX_SYMBOL_ANY_CHAR:case SQREX_SYMBOL_ESCAPE_CHAR:case '(':case ')':case '[':case '{': case '}':
\r
118 static SQChar sqstd_rex_escapechar(SQRex *exp)
\r
120 if(*exp->_p == SQREX_SYMBOL_ESCAPE_CHAR){
\r
123 case 'v': exp->_p++; return '\v';
\r
124 case 'n': exp->_p++; return '\n';
\r
125 case 't': exp->_p++; return '\t';
\r
126 case 'r': exp->_p++; return '\r';
\r
127 case 'f': exp->_p++; return '\f';
\r
128 default: return (*exp->_p++);
\r
130 } else if(!scisprint(*exp->_p)) sqstd_rex_error(exp,_SC("letter expected"));
\r
131 return (*exp->_p++);
\r
134 static SQInteger sqstd_rex_charclass(SQRex *exp,SQInteger classid)
\r
136 SQInteger n = sqstd_rex_newnode(exp,OP_CCLASS);
\r
137 exp->_nodes[n].left = classid;
\r
141 static SQInteger sqstd_rex_charnode(SQRex *exp,SQBool isclass)
\r
143 if(*exp->_p == SQREX_SYMBOL_ESCAPE_CHAR) {
\r
146 case 'n': exp->_p++; return sqstd_rex_newnode(exp,'\n');
\r
147 case 't': exp->_p++; return sqstd_rex_newnode(exp,'\t');
\r
148 case 'r': exp->_p++; return sqstd_rex_newnode(exp,'\r');
\r
149 case 'f': exp->_p++; return sqstd_rex_newnode(exp,'\f');
\r
150 case 'v': exp->_p++; return sqstd_rex_newnode(exp,'\v');
\r
151 case 'a': case 'A': case 'w': case 'W': case 's': case 'S':
\r
152 case 'd': case 'D': case 'x': case 'X': case 'c': case 'C':
\r
153 case 'p': case 'P': case 'l': case 'u':
\r
155 SQChar t = *exp->_p;
\r
157 return sqstd_rex_charclass(exp,t);
\r
162 SQInteger node = sqstd_rex_newnode(exp,OP_WB);
\r
163 exp->_nodes[node].left = *exp->_p;
\r
167 default: return sqstd_rex_newnode(exp,(*exp->_p++));
\r
170 else if(!scisprint(*exp->_p)) {
\r
172 sqstd_rex_error(exp,_SC("letter expected"));
\r
174 return sqstd_rex_newnode(exp,*exp->_p++);
\r
176 static SQInteger sqstd_rex_class(SQRex *exp)
\r
178 SQInteger ret = -1;
\r
179 SQInteger first = -1,chain;
\r
180 if(*exp->_p == SQREX_SYMBOL_BEGINNING_OF_STRING){
\r
181 ret = sqstd_rex_newnode(exp,OP_NCLASS);
\r
183 }else ret = sqstd_rex_newnode(exp,OP_CLASS);
\r
185 if(*exp->_p == ']') sqstd_rex_error(exp,_SC("empty class"));
\r
187 while(*exp->_p != ']' && exp->_p != exp->_eol) {
\r
188 if(*exp->_p == '-' && first != -1){
\r
190 if(*exp->_p++ == ']') sqstd_rex_error(exp,_SC("unfinished range"));
\r
191 r = sqstd_rex_newnode(exp,OP_RANGE);
\r
192 if(first>*exp->_p) sqstd_rex_error(exp,_SC("invalid range"));
\r
193 if(exp->_nodes[first].type == OP_CCLASS) sqstd_rex_error(exp,_SC("cannot use character classes in ranges"));
\r
194 exp->_nodes[r].left = exp->_nodes[first].type;
\r
195 exp->_nodes[r].right = sqstd_rex_escapechar(exp);
\r
196 exp->_nodes[chain].next = r;
\r
202 SQInteger c = first;
\r
203 exp->_nodes[chain].next = c;
\r
205 first = sqstd_rex_charnode(exp,SQTrue);
\r
208 first = sqstd_rex_charnode(exp,SQTrue);
\r
213 SQInteger c = first;
\r
214 exp->_nodes[chain].next = c;
\r
219 exp->_nodes[ret].left = exp->_nodes[ret].next;
\r
220 exp->_nodes[ret].next = -1;
\r
224 static SQInteger sqstd_rex_parsenumber(SQRex *exp)
\r
226 SQInteger ret = *exp->_p-'0';
\r
227 SQInteger positions = 10;
\r
229 while(isdigit(*exp->_p)) {
\r
230 ret = ret*10+(*exp->_p++-'0');
\r
231 if(positions==1000000000) sqstd_rex_error(exp,_SC("overflow in numeric constant"));
\r
237 static SQInteger sqstd_rex_element(SQRex *exp)
\r
247 if(*exp->_p =='?') {
\r
249 sqstd_rex_expect(exp,':');
\r
250 expr = sqstd_rex_newnode(exp,OP_NOCAPEXPR);
\r
253 expr = sqstd_rex_newnode(exp,OP_EXPR);
\r
254 exp->_nodes[expr].left = sqstd_rex_list(exp);
\r
256 sqstd_rex_expect(exp,')');
\r
261 ret = sqstd_rex_class(exp);
\r
262 sqstd_rex_expect(exp,']');
\r
264 case SQREX_SYMBOL_END_OF_STRING: exp->_p++; ret = sqstd_rex_newnode(exp,OP_EOL);break;
\r
265 case SQREX_SYMBOL_ANY_CHAR: exp->_p++; ret = sqstd_rex_newnode(exp,OP_DOT);break;
\r
267 ret = sqstd_rex_charnode(exp,SQFalse);
\r
273 unsigned short p0 = 0, p1 = 0;
\r
275 case SQREX_SYMBOL_GREEDY_ZERO_OR_MORE: p0 = 0; p1 = 0xFFFF; exp->_p++; goto __end;
\r
276 case SQREX_SYMBOL_GREEDY_ONE_OR_MORE: p0 = 1; p1 = 0xFFFF; exp->_p++; goto __end;
\r
277 case SQREX_SYMBOL_GREEDY_ZERO_OR_ONE: p0 = 0; p1 = 1; exp->_p++; goto __end;
\r
280 if(!isdigit(*exp->_p)) sqstd_rex_error(exp,_SC("number expected"));
\r
281 p0 = (unsigned short)sqstd_rex_parsenumber(exp);
\r
284 p1 = p0; exp->_p++;
\r
289 if(isdigit(*exp->_p)){
\r
290 p1 = (unsigned short)sqstd_rex_parsenumber(exp);
\r
292 sqstd_rex_expect(exp,'}');
\r
295 sqstd_rex_error(exp,_SC(", or } expected"));
\r
299 SQInteger nnode = sqstd_rex_newnode(exp,OP_GREEDY);
\r
301 exp->_nodes[nnode].left = ret;
\r
302 exp->_nodes[nnode].right = ((p0)<<16)|p1;
\r
307 if(*exp->_p != SQREX_SYMBOL_BRANCH && *exp->_p != ')' && *exp->_p != SQREX_SYMBOL_GREEDY_ZERO_OR_MORE && *exp->_p != SQREX_SYMBOL_GREEDY_ONE_OR_MORE && *exp->_p != '\0')
\r
308 exp->_nodes[ret].next = sqstd_rex_element(exp);
\r
312 static SQInteger sqstd_rex_list(SQRex *exp)
\r
314 SQInteger ret=-1,e;
\r
315 if(*exp->_p == SQREX_SYMBOL_BEGINNING_OF_STRING) {
\r
317 ret = sqstd_rex_newnode(exp,OP_BOL);
\r
319 e = sqstd_rex_element(exp);
\r
321 exp->_nodes[ret].next = e;
\r
325 if(*exp->_p == SQREX_SYMBOL_BRANCH) {
\r
328 temp = sqstd_rex_newnode(exp,OP_OR);
\r
329 exp->_nodes[temp].left = ret;
\r
330 exp->_nodes[temp].right = sqstd_rex_list(exp);
\r
336 static SQBool sqstd_rex_matchcclass(SQInteger cclass,SQChar c)
\r
339 case 'a': return isalpha(c)?SQTrue:SQFalse;
\r
340 case 'A': return !isalpha(c)?SQTrue:SQFalse;
\r
341 case 'w': return (isalnum(c) || c == '_')?SQTrue:SQFalse;
\r
342 case 'W': return (!isalnum(c) && c != '_')?SQTrue:SQFalse;
\r
343 case 's': return isspace(c)?SQTrue:SQFalse;
\r
344 case 'S': return !isspace(c)?SQTrue:SQFalse;
\r
345 case 'd': return isdigit(c)?SQTrue:SQFalse;
\r
346 case 'D': return !isdigit(c)?SQTrue:SQFalse;
\r
347 case 'x': return isxdigit(c)?SQTrue:SQFalse;
\r
348 case 'X': return !isxdigit(c)?SQTrue:SQFalse;
\r
349 case 'c': return iscntrl(c)?SQTrue:SQFalse;
\r
350 case 'C': return !iscntrl(c)?SQTrue:SQFalse;
\r
351 case 'p': return ispunct(c)?SQTrue:SQFalse;
\r
352 case 'P': return !ispunct(c)?SQTrue:SQFalse;
\r
353 case 'l': return islower(c)?SQTrue:SQFalse;
\r
354 case 'u': return isupper(c)?SQTrue:SQFalse;
\r
356 return SQFalse; /*cannot happen*/
\r
359 static SQBool sqstd_rex_matchclass(SQRex* exp,SQRexNode *node,SQChar c)
\r
362 switch(node->type) {
\r
364 if(c >= node->left && c <= node->right) return SQTrue;
\r
367 if(sqstd_rex_matchcclass(node->left,c)) return SQTrue;
\r
370 if(c == node->type)return SQTrue;
\r
372 } while((node->next != -1) && (node = &exp->_nodes[node->next]));
\r
376 static const SQChar *sqstd_rex_matchnode(SQRex* exp,SQRexNode *node,const SQChar *str,SQRexNode *next)
\r
379 SQRexNodeType type = node->type;
\r
382 //SQRexNode *greedystop = (node->next != -1) ? &exp->_nodes[node->next] : NULL;
\r
383 SQRexNode *greedystop = NULL;
\r
384 SQInteger p0 = (node->right >> 16)&0x0000FFFF, p1 = node->right&0x0000FFFF, nmaches = 0;
\r
385 const SQChar *s=str, *good = str;
\r
387 if(node->next != -1) {
\r
388 greedystop = &exp->_nodes[node->next];
\r
394 while((nmaches == 0xFFFF || nmaches < p1)) {
\r
396 const SQChar *stop;
\r
397 if(!(s = sqstd_rex_matchnode(exp,&exp->_nodes[node->left],s,greedystop)))
\r
402 //checks that 0 matches satisfy the expression(if so skips)
\r
403 //if not would always stop(for instance if is a '?')
\r
404 if(greedystop->type != OP_GREEDY ||
\r
405 (greedystop->type == OP_GREEDY && ((greedystop->right >> 16)&0x0000FFFF) != 0))
\r
407 SQRexNode *gnext = NULL;
\r
408 if(greedystop->next != -1) {
\r
409 gnext = &exp->_nodes[greedystop->next];
\r
410 }else if(next && next->next != -1){
\r
411 gnext = &exp->_nodes[next->next];
\r
413 stop = sqstd_rex_matchnode(exp,greedystop,s,gnext);
\r
415 //if satisfied stop it
\r
416 if(p0 == p1 && p0 == nmaches) break;
\r
417 else if(nmaches >= p0 && p1 == 0xFFFF) break;
\r
418 else if(nmaches >= p0 && nmaches <= p1) break;
\r
426 if(p0 == p1 && p0 == nmaches) return good;
\r
427 else if(nmaches >= p0 && p1 == 0xFFFF) return good;
\r
428 else if(nmaches >= p0 && nmaches <= p1) return good;
\r
432 const SQChar *asd = str;
\r
433 SQRexNode *temp=&exp->_nodes[node->left];
\r
434 while( (asd = sqstd_rex_matchnode(exp,temp,asd,NULL)) ) {
\r
435 if(temp->next != -1)
\r
436 temp = &exp->_nodes[temp->next];
\r
441 temp = &exp->_nodes[node->right];
\r
442 while( (asd = sqstd_rex_matchnode(exp,temp,asd,NULL)) ) {
\r
443 if(temp->next != -1)
\r
444 temp = &exp->_nodes[temp->next];
\r
452 case OP_NOCAPEXPR:{
\r
453 SQRexNode *n = &exp->_nodes[node->left];
\r
454 const SQChar *cur = str;
\r
455 SQInteger capture = -1;
\r
456 if(node->type != OP_NOCAPEXPR && node->right == exp->_currsubexp) {
\r
457 capture = exp->_currsubexp;
\r
458 exp->_matches[capture].begin = cur;
\r
459 exp->_currsubexp++;
\r
463 SQRexNode *subnext = NULL;
\r
464 if(n->next != -1) {
\r
465 subnext = &exp->_nodes[n->next];
\r
469 if(!(cur = sqstd_rex_matchnode(exp,n,cur,subnext))) {
\r
471 exp->_matches[capture].begin = 0;
\r
472 exp->_matches[capture].len = 0;
\r
476 } while((n->next != -1) && (n = &exp->_nodes[n->next]));
\r
479 exp->_matches[capture].len = cur - exp->_matches[capture].begin;
\r
483 if(str == exp->_bol && !isspace(*str)
\r
484 || (str == exp->_eol && !isspace(*(str-1)))
\r
485 || (!isspace(*str) && isspace(*(str+1)))
\r
486 || (isspace(*str) && !isspace(*(str+1))) ) {
\r
487 return (node->left == 'b')?str:NULL;
\r
489 return (node->left == 'b')?NULL:str;
\r
491 if(str == exp->_bol) return str;
\r
494 if(str == exp->_eol) return str;
\r
502 if(sqstd_rex_matchclass(exp,&exp->_nodes[node->left],*str)?(type == OP_CLASS?SQTrue:SQFalse):(type == OP_NCLASS?SQTrue:SQFalse)) {
\r
508 if(sqstd_rex_matchcclass(node->left,*str)) {
\r
513 default: /* char */
\r
514 if(*str != node->type) return NULL;
\r
522 SQRex *sqstd_rex_compile(const SQChar *pattern,const SQChar **error)
\r
524 SQRex *exp = (SQRex *)sq_malloc(sizeof(SQRex));
\r
525 exp->_eol = exp->_bol = NULL;
\r
527 exp->_nallocated = (SQInteger)scstrlen(pattern) * sizeof(SQChar);
\r
528 exp->_nodes = (SQRexNode *)sq_malloc(exp->_nallocated * sizeof(SQRexNode));
\r
531 exp->_nsubexpr = 0;
\r
532 exp->_first = sqstd_rex_newnode(exp,OP_EXPR);
\r
533 exp->_error = error;
\r
534 exp->_jmpbuf = sq_malloc(sizeof(jmp_buf));
\r
535 if(setjmp(*((jmp_buf*)exp->_jmpbuf)) == 0) {
\r
536 exp->_nodes[exp->_first].left=sqstd_rex_list(exp);
\r
538 sqstd_rex_error(exp,_SC("unexpected character"));
\r
543 nsize = exp->_nsize;
\r
544 t = &exp->_nodes[0];
\r
545 scprintf(_SC("\n"));
\r
546 for(i = 0;i < nsize; i++) {
\r
547 if(exp->_nodes[i].type>MAX_CHAR)
\r
548 scprintf(_SC("[%02d] %10s "),i,g_nnames[exp->_nodes[i].type-MAX_CHAR]);
\r
550 scprintf(_SC("[%02d] %10c "),i,exp->_nodes[i].type);
\r
551 scprintf(_SC("left %02d right %02d next %02d\n"),exp->_nodes[i].left,exp->_nodes[i].right,exp->_nodes[i].next);
\r
553 scprintf(_SC("\n"));
\r
556 exp->_matches = (SQRexMatch *) sq_malloc(exp->_nsubexpr * sizeof(SQRexMatch));
\r
557 memset(exp->_matches,0,exp->_nsubexpr * sizeof(SQRexMatch));
\r
560 sqstd_rex_free(exp);
\r
566 void sqstd_rex_free(SQRex *exp)
\r
569 if(exp->_nodes) sq_free(exp->_nodes,exp->_nallocated * sizeof(SQRexNode));
\r
570 if(exp->_jmpbuf) sq_free(exp->_jmpbuf,sizeof(jmp_buf));
\r
571 if(exp->_matches) sq_free(exp->_matches,exp->_nsubexpr * sizeof(SQRexMatch));
\r
572 sq_free(exp,sizeof(SQRex));
\r
576 SQBool sqstd_rex_match(SQRex* exp,const SQChar* text)
\r
578 const SQChar* res = NULL;
\r
580 exp->_eol = text + scstrlen(text);
\r
581 exp->_currsubexp = 0;
\r
582 res = sqstd_rex_matchnode(exp,exp->_nodes,text,NULL);
\r
583 if(res == NULL || res != exp->_eol)
\r
588 SQBool sqstd_rex_searchrange(SQRex* exp,const SQChar* text_begin,const SQChar* text_end,const SQChar** out_begin, const SQChar** out_end)
\r
590 const SQChar *cur = NULL;
\r
591 SQInteger node = exp->_first;
\r
592 if(text_begin >= text_end) return SQFalse;
\r
593 exp->_bol = text_begin;
\r
594 exp->_eol = text_end;
\r
597 while(node != -1) {
\r
598 exp->_currsubexp = 0;
\r
599 cur = sqstd_rex_matchnode(exp,&exp->_nodes[node],cur,NULL);
\r
602 node = exp->_nodes[node].next;
\r
605 } while(cur == NULL && text_begin != text_end);
\r
612 if(out_begin) *out_begin = text_begin;
\r
613 if(out_end) *out_end = cur;
\r
617 SQBool sqstd_rex_search(SQRex* exp,const SQChar* text, const SQChar** out_begin, const SQChar** out_end)
\r
619 return sqstd_rex_searchrange(exp,text,text + scstrlen(text),out_begin,out_end);
\r
622 SQInteger sqstd_rex_getsubexpcount(SQRex* exp)
\r
624 return exp->_nsubexpr;
\r
627 SQBool sqstd_rex_getsubexp(SQRex* exp, SQInteger n, SQRexMatch *subexp)
\r
629 if( n<0 || n >= exp->_nsubexpr) return SQFalse;
\r
630 *subexp = exp->_matches[n];
\r