commit 3d31240bfdaee03aff28103b530ff593e9ddbbc5 from: David du Colombier <0intro@gmail.com> date: Tue Jul 02 04:39:17 2013 UTC libregexp: update from Plan 9 R=rsc https://codereview.appspot.com/10690044 commit - da3ed55e4e4d2d3052b03df3dd0a40d19f99ea70 commit + 3d31240bfdaee03aff28103b530ff593e9ddbbc5 blob - 0dabd4f0f331911edc02252d988d2bd86164770b blob + 09678755e411a05732348468e03af0aa83313c69 --- src/libregexp/regcomp.c +++ src/libregexp/regcomp.c @@ -14,6 +14,12 @@ struct Node Reinst* first; Reinst* last; }Node; + +/* max character classes per program is nelem(reprog->class) */ +static Reprog *reprog; + +/* max rune ranges per character class is nelem(classp->spans)/2 */ +#define NCCRUNE nelem(classp->spans) #define NSTACK 20 static Node andstack[NSTACK]; @@ -321,8 +327,8 @@ dump(Reprog *pp) static Reclass* newclass(void) { - if(nclass >= NCLASS) - regerr2("too many character classes; limit", NCLASS+'0'); + if(nclass >= nelem(reprog->class)) + rcerror("too many character classes; increase Reprog.class size"); return &(classp[nclass++]); } @@ -407,7 +413,7 @@ bldcclass(void) } /* parse class into a set of spans */ - for(; ep<&r[NCCRUNE];){ + while(ep < &r[NCCRUNE-1]){ if(rune == 0){ rcerror("malformed '[]'"); return 0; @@ -431,6 +437,10 @@ bldcclass(void) } quoted = nextc(&rune); } + if(ep >= &r[NCCRUNE-1]) { + rcerror("char class too large; increase Reclass.spans size"); + return 0; + } /* sort on span start */ for(p = r; p < ep; p += 2){ @@ -454,9 +464,10 @@ bldcclass(void) np[0] = *p++; np[1] = *p++; for(; p < ep; p += 2) - if(p[0] <= np[1]){ - if(p[1] > np[1]) - np[1] = p[1]; + /* overlapping or adjacent ranges? */ + if(p[0] <= np[1] + 1){ + if(p[1] >= np[1]) + np[1] = p[1]; /* coalesce */ } else { np += 2; np[0] = p[0]; blob - 6c88cd09768dc39ab0966a3f9f28d0ab9c3288c3 blob + 4b9a483b90d6ee2ea229a970bf77e4f9afb62906 --- src/libregexp/regcomp.h +++ src/libregexp/regcomp.h @@ -12,13 +12,6 @@ struct Resublist Resub m[NSUBEXP]; }; -/* max character classes per program */ -extern Reprog RePrOg; -#define NCLASS (sizeof(RePrOg.class)/sizeof(Reclass)) - -/* max rune ranges per character class */ -#define NCCRUNE (sizeof(Reclass)/sizeof(Rune)) - /* * Actions and Tokens (Reinst types) * @@ -48,7 +41,7 @@ extern Reprog RePrOg; * regexec execution lists */ #define LISTSIZE 10 -#define BIGLISTSIZE (10*LISTSIZE) +#define BIGLISTSIZE (25*LISTSIZE) typedef struct Relist Relist; struct Relist { blob - ab5ad99d3da44710d49bfd117ec202c22a0cf006 blob + 579d12432739447c083038a0dda1b18490b39ca0 --- src/libregexp/regsub.c +++ src/libregexp/regsub.c @@ -27,7 +27,7 @@ regsub(char *sp, /* source string */ case '8': case '9': i = *sp-'0'; - if(mp[i].s.sp != 0 && mp!=0 && ms>i) + if(mp!=0 && mp[i].s.sp != 0 && ms>i) for(ssp = mp[i].s.sp; ssp < mp[i].e.ep; ssp++) @@ -46,9 +46,8 @@ regsub(char *sp, /* source string */ *dp++ = *sp; break; } - }else if(*sp == '&'){ - if(mp[0].s.sp != 0 && mp!=0 && ms>0) - if(mp[0].s.sp != 0) + }else if(*sp == '&'){ + if(mp!=0 && mp[0].s.sp != 0 && ms>0) for(ssp = mp[0].s.sp; ssp < mp[0].e.ep; ssp++) if(dp < ep) blob - 83533ee62e389ec7df052088f0b6ee3e7f9d161d blob + f6bea534064ed0ab7c44dab7eb12928fa766dbc3 --- src/libregexp/test.c +++ src/libregexp/test.c @@ -22,17 +22,16 @@ struct x t[] = { { 0, 0, 0 }, }; +int main(int ac, char **av) { Resub rs[10]; char dst[128]; - int n; struct x *tp; for(tp = t; tp->re; tp++) tp->p = regcomp(tp->re); - for(tp = t; tp->re; tp++){ print("%s VIA %s", av[1], tp->re); memset(rs, 0, sizeof rs); blob - 150953e47d31de7b3948450597bdc3c19f07dd73 blob + 62d5213aec81b35cb0a69ae59e3a00ecf027979d --- src/libregexp/test2.c +++ src/libregexp/test2.c @@ -1,20 +1,19 @@ #include "lib9.h" #include - +int main(int ac, char **av) { Resub rs[10]; Reprog *p; char *s; - int i; p = regcomp("[^a-z]"); s = "\n"; if(regexec(p, s, rs, 10)) - print("%s %lux %lux %lux\n", s, s, rs[0].sp, rs[0].ep); + print("%s %lux %lux %lux\n", s, s, rs[0].s.sp, rs[0].e.ep); s = "0"; if(regexec(p, s, rs, 10)) - print("%s %lux %lux %lux\n", s, s, rs[0].sp, rs[0].ep); + print("%s %lux %lux %lux\n", s, s, rs[0].s.sp, rs[0].e.ep); exit(0); }