X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=sidebyside;f=lib%2Fregex.c;h=6ed90243c86a727e99a4a34c91a567dccb85e0d7;hb=ca885e18959ced4df7084ccf262c7b5df5848bdb;hp=8cc9d2878d0994809a683d38af0335b3153167c3;hpb=76ee03dea8ff0a04d7659ded5a9a53ef3eb39aa7;p=libucw.git diff --git a/lib/regex.c b/lib/regex.c index 8cc9d287..6ed90243 100644 --- a/lib/regex.c +++ b/lib/regex.c @@ -2,9 +2,11 @@ * Sherlock Library -- Regular Expressions * * (c) 1997 Martin Mares + * (c) 2001 Robert Spalek */ #include "lib/lib.h" +#include "lib/chartype.h" #include #include @@ -12,6 +14,7 @@ #include #define INITIAL_MEM 1024 /* Initial space allocated for each pattern */ +#define CHAR_SET_SIZE 256 /* How many characters in the character set. */ struct regex { struct re_pattern_buffer buf; @@ -20,14 +23,24 @@ struct regex { }; regex * -rx_compile(byte *p) +rx_compile(byte *p, int icase) { - regex *r = xmalloc(sizeof(regex)); + regex *r = xmalloc_zero(sizeof(regex)); const char *msg; - bzero(r, sizeof(struct regex)); r->buf.buffer = xmalloc(INITIAL_MEM); r->buf.allocated = INITIAL_MEM; + if (icase) + { + unsigned i; + r->buf.translate = xmalloc (CHAR_SET_SIZE); + /* Map uppercase characters to corresponding lowercase ones. */ + for (i = 0; i < CHAR_SET_SIZE; i++) + r->buf.translate[i] = Cupcase(i); + } + else + r->buf.translate = NULL; + re_set_syntax(RE_SYNTAX_POSIX_EXTENDED); msg = re_compile_pattern(p, strlen(p), &r->buf); if (!msg) return r; @@ -38,6 +51,8 @@ void rx_free(regex *r) { xfree(r->buf.buffer); + if (r->buf.translate) + xfree(r->buf.translate); xfree(r); }