hyung-hwan/qse
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
34801c778f
qse/ase/awk/rex.c

1840 lines
41 KiB
C
Raw Blame History

/*
* $Id: rex.c,v 1.48 2006-11-29 02:54:16 bacon Exp $
*/
#include <ase/awk/awk_i.h>
enum
{
CT_EOF,
CT_SPECIAL,
CT_NORMAL
};
enum
{
LEVEL_TOP,
LEVEL_CHARSET,
LEVEL_RANGE
};
enum
{
CMD_BOL,
CMD_EOL,
CMD_ANY_CHAR,
CMD_ORD_CHAR,
CMD_CHARSET,
CMD_GROUP
};
enum
{
CHARSET_ONE,
CHARSET_RANGE,
CHARSET_CLASS
};
enum
{
CHARSET_CLASS_PUNCT,
CHARSET_CLASS_SPACE,
CHARSET_CLASS_DIGIT,
CHARSET_CLASS_ALNUM
};
#define DEF_CODE_CAPA 512
#define BOUND_MIN 0
#define BOUND_MAX (ASE_TYPE_MAX(ase_size_t))
typedef struct __builder_t __builder_t;
typedef struct __matcher_t __matcher_t;
typedef struct __match_t __match_t;
struct __code_t
{
/*ase_byte_t cmd;*/
short cmd;
short negate; /* only for CMD_CHARSET */
ase_size_t lbound;
ase_size_t ubound;
};
struct __builder_t
{
ase_awk_t* awk;
struct
{
const ase_char_t* ptr;
const ase_char_t* end;
const ase_char_t* curp;
struct
{
int type;
ase_char_t value;
} curc;
} ptn;
struct
{
ase_byte_t* buf;
ase_size_t size;
ase_size_t capa;
} code;
struct
{
int max;
int cur;
} depth;
int errnum;
};
struct __matcher_t
{
ase_awk_t* awk;
struct
{
struct
{
const ase_char_t* ptr;
const ase_char_t* end;
} str;
} match;
struct
{
int max;
int cur;
} depth;
int ignorecase;
int errnum;
};
struct __match_t
{
const ase_char_t* match_ptr;
ase_bool_t matched;
ase_size_t match_len;
const ase_byte_t* branch;
const ase_byte_t* branch_end;
};
typedef const ase_byte_t* (*atom_matcher_t) (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
#define NCHARS_REMAINING(rex) ((rex)->ptn.end - (rex)->ptn.curp)
#define NEXT_CHAR(rex,level) \
do { if (__next_char(rex,level) == -1) return -1; } while (0)
#define ADD_CODE(rex,data,len) \
do { if (__add_code(rex,data,len) == -1) return -1; } while (0)
#if defined(__sparc) || defined(__sparc__)
#define GET_CODE(rex,pos,type) __get_code(rex,pos)
#define SET_CODE(rex,pos,type,code) __set_code(rex,pos,code)
#else
#define GET_CODE(rex,pos,type) (*((type*)&(rex)->code.buf[pos]))
#define SET_CODE(rex,pos,type,code) (GET_CODE(rex,pos,type) = (code))
#endif
static int __build_pattern (__builder_t* rex);
static int __build_pattern0 (__builder_t* rex);
static int __build_branch (__builder_t* rex);
static int __build_atom (__builder_t* rex);
static int __build_charset (__builder_t* rex, struct __code_t* cmd);
static int __build_occurrences (__builder_t* rex, struct __code_t* cmd);
static int __build_cclass (__builder_t* rex, ase_char_t* cc);
static int __build_range (__builder_t* rex, struct __code_t* cmd);
static int __next_char (__builder_t* rex, int level);
static int __add_code (__builder_t* rex, void* data, ase_size_t len);
#if defined(__sparc) || defined(__sparc__)
static ase_size_t __get_code (__builder_t* builder, ase_size_t pos)
{
ase_size_t code;
ASE_AWK_MEMCPY (builder->awk,
&code, &builder->code.buf[pos], ASE_SIZEOF(code));
return code;
}
static void __set_code (__builder_t* builder, ase_size_t pos, ase_size_t code)
{
ASE_AWK_MEMCPY (builder->awk,
&builder->code.buf[pos], &code, ASE_SIZEOF(code));
}
#endif
static ase_bool_t __begin_with (
const ase_char_t* str, ase_size_t len, const ase_char_t* what);
static const ase_byte_t* __match_pattern (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_branch (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_branch_body (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_branch_body0 (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_atom (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_bol (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_eol (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_any_char (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_ord_char (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_charset (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_group (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat);
static const ase_byte_t* __match_occurrences (
__matcher_t* matcher, ase_size_t si, const ase_byte_t* p,
ase_size_t lbound, ase_size_t ubound, __match_t* mat);
static ase_bool_t __test_charset (
__matcher_t* matcher, const ase_byte_t* p, ase_size_t csc, ase_char_t c);
static ase_bool_t __cc_isalnum (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isalpha (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isblank (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_iscntrl (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isdigit (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isgraph (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_islower (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isprint (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_ispunct (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isspace (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isupper (ase_awk_t* awk, ase_char_t c);
static ase_bool_t __cc_isxdigit (ase_awk_t* awk, ase_char_t c);
#ifdef DEBUG_REX
static const ase_byte_t* __print_pattern (const ase_byte_t* p);
static const ase_byte_t* __print_branch (const ase_byte_t* p);
static const ase_byte_t* __print_atom (const ase_byte_t* p);
#endif
struct __char_class_t
{
const ase_char_t* name;
ase_size_t name_len;
ase_bool_t (*func) (ase_awk_t* awk, ase_char_t c);
};
static struct __char_class_t __char_class[] =
{
{ ASE_T("alnum"), 5, __cc_isalnum },
{ ASE_T("alpha"), 5, __cc_isalpha },
{ ASE_T("blank"), 5, __cc_isblank },
{ ASE_T("cntrl"), 5, __cc_iscntrl },
{ ASE_T("digit"), 5, __cc_isdigit },
{ ASE_T("graph"), 5, __cc_isgraph },
{ ASE_T("lower"), 5, __cc_islower },
{ ASE_T("print"), 5, __cc_isprint },
{ ASE_T("punct"), 5, __cc_ispunct },
{ ASE_T("space"), 5, __cc_isspace },
{ ASE_T("upper"), 5, __cc_isupper },
{ ASE_T("xdigit"), 6, __cc_isxdigit },
/*
{ ASE_T("arabic"), 6, __cc_isarabic },
{ ASE_T("chinese"), 7, __cc_ischinese },
{ ASE_T("english"), 7, __cc_isenglish },
{ ASE_T("japanese"), 8, __cc_isjapanese },
{ ASE_T("korean"), 6, __cc_iskorean },
{ ASE_T("thai"), 4, __cc_isthai },
*/
{ ASE_NULL, 0, ASE_NULL }
};
void* ase_awk_buildrex (
ase_awk_t* awk, const ase_char_t* ptn, ase_size_t len, int* errnum)
{
__builder_t builder;
builder.awk = awk;
builder.code.capa = DEF_CODE_CAPA;
builder.code.size = 0;
builder.code.buf = (ase_byte_t*)
ASE_AWK_MALLOC (builder.awk, builder.code.capa);
if (builder.code.buf == ASE_NULL)
{
*errnum = ASE_AWK_ENOMEM;
return ASE_NULL;
}
builder.ptn.ptr = ptn;
builder.ptn.end = builder.ptn.ptr + len;
builder.ptn.curp = builder.ptn.ptr;
builder.ptn.curc.type = CT_EOF;
builder.ptn.curc.value = ASE_T('\0');
/* IMPLEMENT THIS PROPERLY. */
/*builder.depth.max = awk->rex.depth.max;*/
builder.depth.max = 0;
builder.depth.cur = 0;
if (__next_char (&builder, LEVEL_TOP) == -1)
{
if (errnum != ASE_NULL) *errnum = builder.errnum;
ASE_AWK_FREE (builder.awk, builder.code.buf);
return ASE_NULL;
}
if (__build_pattern (&builder) == -1)
{
if (errnum != ASE_NULL) *errnum = builder.errnum;
ASE_AWK_FREE (builder.awk, builder.code.buf);
return ASE_NULL;
}
if (builder.ptn.curc.type != CT_EOF)
{
if (errnum != ASE_NULL) *errnum = ASE_AWK_EREXGARBAGE;
ASE_AWK_FREE (builder.awk, builder.code.buf);
return ASE_NULL;
}
return builder.code.buf;
}
int ase_awk_matchrex (
ase_awk_t* awk, void* code, int option,
const ase_char_t* str, ase_size_t len,
const ase_char_t** match_ptr, ase_size_t* match_len, int* errnum)
{
__matcher_t matcher;
__match_t mat;
ase_size_t offset = 0;
/*const ase_char_t* match_ptr_zero = ASE_NULL;*/
matcher.awk = awk;
/* store the source string */
matcher.match.str.ptr = str;
matcher.match.str.end = str + len;
/* TODO: implement the maximum depth
matcher.depth.max = awk->max_depth; */
matcher.depth.max = 0;
matcher.depth.cur = 0;
matcher.ignorecase = (option & ASE_AWK_REX_IGNORECASE)? 1: 0;
mat.matched = ase_false;
/* TODO: should it allow an offset here??? */
mat.match_ptr = str + offset;
while (mat.match_ptr < matcher.match.str.end)
{
if (__match_pattern (&matcher, code, &mat) == ASE_NULL)
{
if (errnum != ASE_NULL) *errnum = matcher.errnum;
return -1;
}
if (mat.matched)
{
/*
if (mat.match_len == 0)
{
if (match_ptr_zero == ASE_NULL)
match_ptr_zero = mat.match_ptr;
mat.match_ptr++;
continue;
}
*/
if (match_ptr != ASE_NULL) *match_ptr = mat.match_ptr;
if (match_len != ASE_NULL) *match_len = mat.match_len;
/*match_ptr_zero = ASE_NULL;*/
break;
}
mat.match_ptr++;
}
/*
if (match_ptr_zero != ASE_NULL)
{
if (match_ptr != ASE_NULL) *match_ptr = match_ptr_zero;
if (match_len != ASE_NULL) *match_len = 0;
return 1;
}
*/
return (mat.matched)? 1: 0;
}
void ase_awk_freerex (ase_awk_t* awk, void* code)
{
ASE_AWK_ASSERT (awk, code != ASE_NULL);
ASE_AWK_FREE (awk, code);
}
ase_bool_t ase_awk_isemptyrex (ase_awk_t* awk, void* code)
{
const ase_byte_t* p = code;
ase_size_t nb, el;
ASE_AWK_ASSERT (awk, p != ASE_NULL);
nb = *(ase_size_t*)p; p += ASE_SIZEOF(nb);
el = *(ase_size_t*)p; p += ASE_SIZEOF(el);
/* an empty regular expression look like:
* | expression |
* | header | branch |
* | | branch header |
* | NB(1) | EL(16) | NA(1) | BL(8) | */
return (nb == 1 && el == ASE_SIZEOF(ase_size_t)*4)? ase_true: ase_false;
}
static int __build_pattern (__builder_t* builder)
{
int n;
if (builder->depth.max > 0 && builder->depth.cur >= builder->depth.max)
{
builder->errnum = ASE_AWK_ERECURSION;
return -1;
}
builder->depth.cur++;
n = __build_pattern0 (builder);
builder->depth.cur--;
return n;
}
static int __build_pattern0 (__builder_t* builder)
{
ase_size_t zero = 0;
ase_size_t old_size;
ase_size_t pos_nb, pos_el;
int n;
old_size = builder->code.size;
/* secure space for header and set the header fields to zero */
pos_nb = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
pos_el = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
/* handle the first branch */
n = __build_branch (builder);
if (n == -1) return -1;
if (n == 0)
{
/* if the pattern is empty, the control reaches here */
return 0;
}
/*CODEAT(builder,pos_nb,ase_size_t) += 1;*/
SET_CODE (builder, pos_nb, ase_size_t,
GET_CODE (builder, pos_nb, ase_size_t) + 1);
/* handle subsequent branches if any */
while (builder->ptn.curc.type == CT_SPECIAL &&
builder->ptn.curc.value == ASE_T('|'))
{
NEXT_CHAR (builder, LEVEL_TOP);
n = __build_branch(builder);
if (n == -1) return -1;
if (n == 0)
{
/* if the pattern ends with a vertical bar(|),
* this block can be reached. however, such a
* pattern is highly discouraged */
break;
}
/*CODEAT(builder,pos_nb,ase_size_t) += 1;*/
SET_CODE (builder, pos_nb, ase_size_t,
GET_CODE (builder, pos_nb, ase_size_t) + 1);
}
/*CODEAT(builder,pos_el,ase_size_t) = builder->code.size - old_size;*/
SET_CODE (builder, pos_el, ase_size_t, builder->code.size - old_size);
return 1;
}
static int __build_branch (__builder_t* builder)
{
int n;
ase_size_t zero = 0;
ase_size_t old_size;
ase_size_t pos_na, pos_bl;
struct __code_t* cmd;
old_size = builder->code.size;
pos_na = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
pos_bl = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
while (1)
{
cmd = (struct __code_t*)&builder->code.buf[builder->code.size];
n = __build_atom (builder);
if (n == -1)
{
builder->code.size = old_size;
return -1;
}
if (n == 0) break; /* no atom */
n = __build_occurrences (builder, cmd);
if (n == -1)
{
builder->code.size = old_size;
return -1;
}
/* n == 0 no bound character. just continue */
/* n == 1 bound has been applied by build_occurrences */
/*CODEAT(builder,pos_na,ase_size_t) += 1;*/
SET_CODE (builder, pos_na, ase_size_t,
GET_CODE (builder, pos_na, ase_size_t) + 1);
}
/*CODEAT(builder,pos_bl,ase_size_t) = builder->code.size - old_size;*/
SET_CODE (builder, pos_bl, ase_size_t, builder->code.size - old_size);
return (builder->code.size == old_size)? 0: 1;
}
static int __build_atom (__builder_t* builder)
{
int n;
struct __code_t tmp;
if (builder->ptn.curc.type == CT_EOF) return 0;
if (builder->ptn.curc.type == CT_SPECIAL)
{
if (builder->ptn.curc.value == ASE_T('('))
{
tmp.cmd = CMD_GROUP;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
NEXT_CHAR (builder, LEVEL_TOP);
n = __build_pattern (builder);
if (n == -1) return -1;
if (builder->ptn.curc.type != CT_SPECIAL ||
builder->ptn.curc.value != ASE_T(')'))
{
builder->errnum = ASE_AWK_EREXRPAREN;
return -1;
}
}
else if (builder->ptn.curc.value == ASE_T('^'))
{
tmp.cmd = CMD_BOL;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
}
else if (builder->ptn.curc.value == ASE_T('$'))
{
tmp.cmd = CMD_EOL;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
}
else if (builder->ptn.curc.value == ASE_T('.'))
{
tmp.cmd = CMD_ANY_CHAR;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
}
else if (builder->ptn.curc.value == ASE_T('['))
{
struct __code_t* cmd;
cmd = (struct __code_t*)&builder->code.buf[builder->code.size];
tmp.cmd = CMD_CHARSET;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
NEXT_CHAR (builder, LEVEL_CHARSET);
n = __build_charset (builder, cmd);
if (n == -1) return -1;
ASE_AWK_ASSERT (builder->awk, n != 0);
if (builder->ptn.curc.type != CT_SPECIAL ||
builder->ptn.curc.value != ASE_T(']'))
{
builder->errnum = ASE_AWK_EREXRBRACKET;
return -1;
}
}
else return 0;
NEXT_CHAR (builder, LEVEL_TOP);
return 1;
}
else
{
ASE_AWK_ASSERT (builder->awk, builder->ptn.curc.type == CT_NORMAL);
tmp.cmd = CMD_ORD_CHAR;
tmp.negate = 0;
tmp.lbound = 1;
tmp.ubound = 1;
ADD_CODE (builder, &tmp, ASE_SIZEOF(tmp));
ADD_CODE (builder, &builder->ptn.curc.value, ASE_SIZEOF(builder->ptn.curc.value));
NEXT_CHAR (builder, LEVEL_TOP);
return 1;
}
}
static int __build_charset (__builder_t* builder, struct __code_t* cmd)
{
ase_size_t zero = 0;
ase_size_t old_size;
ase_size_t pos_csc, pos_csl;
old_size = builder->code.size;
pos_csc = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
pos_csl = builder->code.size;
ADD_CODE (builder, &zero, ASE_SIZEOF(zero));
if (builder->ptn.curc.type == CT_NORMAL &&
builder->ptn.curc.value == ASE_T('^'))
{
cmd->negate = 1;
NEXT_CHAR (builder, LEVEL_CHARSET);
}
while (builder->ptn.curc.type == CT_NORMAL)
{
ase_char_t c0, c1, c2;
int cc = 0;
c1 = builder->ptn.curc.value;
NEXT_CHAR(builder, LEVEL_CHARSET);
if (c1 == ASE_T('[') &&
builder->ptn.curc.type == CT_NORMAL &&
builder->ptn.curc.value == ASE_T(':'))
{
if (__build_cclass (builder, &c1) == -1) return -1;
cc = cc | 1;
}
c2 = c1;
if (builder->ptn.curc.type == CT_NORMAL &&
builder->ptn.curc.value == ASE_T('-'))
{
NEXT_CHAR (builder, LEVEL_CHARSET);
if (builder->ptn.curc.type == CT_NORMAL)
{
c2 = builder->ptn.curc.value;
NEXT_CHAR (builder, LEVEL_CHARSET);
if (c2 == ASE_T('[') &&
builder->ptn.curc.type == CT_NORMAL &&
builder->ptn.curc.value == ASE_T(':'))
{
if (__build_cclass (builder, &c2) == -1)
{
return -1;
}
cc = cc | 2;
}
}
else cc = cc | 4;
}
if (cc == 0 || cc == 4)
{
if (c1 == c2)
{
c0 = CHARSET_ONE;
ADD_CODE (builder, &c0, ASE_SIZEOF(c0));
ADD_CODE (builder, &c1, ASE_SIZEOF(c1));
}
else
{
c0 = CHARSET_RANGE;
ADD_CODE (builder, &c0, ASE_SIZEOF(c0));
ADD_CODE (builder, &c1, ASE_SIZEOF(c1));
ADD_CODE (builder, &c2, ASE_SIZEOF(c2));
}
}
else if (cc == 1)
{
c0 = CHARSET_CLASS;
ADD_CODE (builder, &c0, ASE_SIZEOF(c0));
ADD_CODE (builder, &c1, ASE_SIZEOF(c1));
}
else
{
/* invalid range */
#ifdef DEBUG_REX
xp_printf (ASE_T("__build_charset: invalid character set range\n"));
#endif
builder->errnum = ASE_AWK_EREXCRANGE;
return -1;
}
/*CODEAT(builder,pos_csc,ase_size_t) += 1;*/
SET_CODE (builder, pos_csc, ase_size_t,
GET_CODE (builder, pos_csc, ase_size_t) + 1);
}
/*CODEAT(builder,pos_csl,ase_size_t) = builder->code.size - old_size;*/
SET_CODE (builder, pos_csl, ase_size_t, builder->code.size - old_size);
return 1;
}
static int __build_cclass (__builder_t* builder, ase_char_t* cc)
{
const struct __char_class_t* ccp = __char_class;
ase_size_t len = builder->ptn.end - builder->ptn.curp;
while (ccp->name != ASE_NULL)
{
if (__begin_with (builder->ptn.curp, len, ccp->name)) break;
ccp++;
}
if (ccp->name == ASE_NULL)
{
/* wrong class name */
#ifdef DEBUG_REX
xp_printf (ASE_T("__build_cclass: wrong class name\n"));*/
#endif
builder->errnum = ASE_AWK_EREXCCLASS;
return -1;
}
builder->ptn.curp += ccp->name_len;
NEXT_CHAR (builder, LEVEL_CHARSET);
if (builder->ptn.curc.type != CT_NORMAL ||
builder->ptn.curc.value != ASE_T(':'))
{
#ifdef BUILD_REX
xp_printf (ASE_T("__build_cclass: a colon(:) expected\n"));
#endif
builder->errnum = ASE_AWK_EREXCOLON;
return -1;
}
NEXT_CHAR (builder, LEVEL_CHARSET);
/* ] happens to be the charset ender ] */
if (builder->ptn.curc.type != CT_SPECIAL ||
builder->ptn.curc.value != ASE_T(']'))
{
#ifdef DEBUG_REX
xp_printf (ASE_T("__build_cclass: ] expected\n"));
#endif
builder->errnum = ASE_AWK_EREXRBRACKET;
return -1;
}
NEXT_CHAR (builder, LEVEL_CHARSET);
*cc = (ase_char_t)(ccp - __char_class);
return 1;
}
static int __build_occurrences (__builder_t* builder, struct __code_t* cmd)
{
if (builder->ptn.curc.type != CT_SPECIAL) return 0;
switch (builder->ptn.curc.value)
{
case ASE_T('+'):
{
cmd->lbound = 1;
cmd->ubound = BOUND_MAX;
NEXT_CHAR(builder, LEVEL_TOP);
return 1;
}
case ASE_T('*'):
{
cmd->lbound = 0;
cmd->ubound = BOUND_MAX;
NEXT_CHAR(builder, LEVEL_TOP);
return 1;
}
case ASE_T('?'):
{
cmd->lbound = 0;
cmd->ubound = 1;
NEXT_CHAR(builder, LEVEL_TOP);
return 1;
}
case ASE_T('{'):
{
NEXT_CHAR (builder, LEVEL_RANGE);
if (__build_range(builder, cmd) == -1) return -1;
if (builder->ptn.curc.type != CT_SPECIAL ||
builder->ptn.curc.value != ASE_T('}'))
{
builder->errnum = ASE_AWK_EREXRBRACE;
return -1;
}
NEXT_CHAR (builder, LEVEL_TOP);
return 1;
}
}
return 0;
}
static int __build_range (__builder_t* builder, struct __code_t* cmd)
{
ase_size_t bound;
/* TODO: should allow white spaces in the range???
what if it is not in the raight format? convert it to ordinary characters?? */
bound = 0;
while (builder->ptn.curc.type == CT_NORMAL &&
(builder->ptn.curc.value >= ASE_T('0') &&
builder->ptn.curc.value <= ASE_T('9')))
{
bound = bound * 10 + builder->ptn.curc.value - ASE_T('0');
NEXT_CHAR (builder, LEVEL_RANGE);
}
cmd->lbound = bound;
if (builder->ptn.curc.type == CT_SPECIAL &&
builder->ptn.curc.value == ASE_T(','))
{
NEXT_CHAR (builder, LEVEL_RANGE);
bound = 0;
while (builder->ptn.curc.type == CT_NORMAL &&
(builder->ptn.curc.value >= ASE_T('0') &&
builder->ptn.curc.value <= ASE_T('9')))
{
bound = bound * 10 + builder->ptn.curc.value - ASE_T('0');
NEXT_CHAR (builder, LEVEL_RANGE);
}
cmd->ubound = bound;
}
else cmd->ubound = BOUND_MAX;
if (cmd->lbound > cmd->ubound)
{
/* invalid occurrences range */
builder->errnum = ASE_AWK_EREXBRANGE;
return -1;
}
return 0;
}
static int __next_char (__builder_t* builder, int level)
{
if (builder->ptn.curp >= builder->ptn.end)
{
builder->ptn.curc.type = CT_EOF;
builder->ptn.curc.value = ASE_T('\0');
return 0;
}
builder->ptn.curc.type = CT_NORMAL;
builder->ptn.curc.value = *builder->ptn.curp++;
if (builder->ptn.curc.value == ASE_T('\\'))
{
if (builder->ptn.curp >= builder->ptn.end)
{
builder->errnum = ASE_AWK_EREXEND;
return -1;
}
builder->ptn.curc.value = *builder->ptn.curp++;
return 0;
}
else
{
if (level == LEVEL_TOP)
{
if (builder->ptn.curc.value == ASE_T('[') ||
builder->ptn.curc.value == ASE_T('|') ||
builder->ptn.curc.value == ASE_T('^') ||
builder->ptn.curc.value == ASE_T('$') ||
builder->ptn.curc.value == ASE_T('{') ||
builder->ptn.curc.value == ASE_T('+') ||
builder->ptn.curc.value == ASE_T('?') ||
builder->ptn.curc.value == ASE_T('*') ||
builder->ptn.curc.value == ASE_T('.') ||
builder->ptn.curc.value == ASE_T('(') ||
builder->ptn.curc.value == ASE_T(')'))
{
builder->ptn.curc.type = CT_SPECIAL;
}
}
else if (level == LEVEL_CHARSET)
{
if (builder->ptn.curc.value == ASE_T(']'))
{
builder->ptn.curc.type = CT_SPECIAL;
}
}
else if (level == LEVEL_RANGE)
{
if (builder->ptn.curc.value == ASE_T(',') ||
builder->ptn.curc.value == ASE_T('}'))
{
builder->ptn.curc.type = CT_SPECIAL;
}
}
}
return 0;
}
static int __add_code (__builder_t* builder, void* data, ase_size_t len)
{
if (len > builder->code.capa - builder->code.size)
{
ase_size_t capa = builder->code.capa * 2;
ase_byte_t* tmp;
if (capa == 0) capa = DEF_CODE_CAPA;
while (len > capa - builder->code.size) { capa = capa * 2; }
if (builder->awk->syscas.realloc != ASE_NULL)
{
tmp = (ase_byte_t*) ASE_AWK_REALLOC (
builder->awk, builder->code.buf, capa);
if (tmp == ASE_NULL)
{
builder->errnum = ASE_AWK_ENOMEM;
return -1;
}
}
else
{
tmp = (ase_byte_t*) ASE_AWK_MALLOC (builder->awk, capa);
if (tmp == ASE_NULL)
{
builder->errnum = ASE_AWK_ENOMEM;
return -1;
}
if (builder->code.buf != ASE_NULL)
{
ASE_AWK_MEMCPY (builder->awk, tmp,
builder->code.buf, builder->code.capa);
ASE_AWK_FREE (builder->awk, builder->code.buf);
}
}
builder->code.buf = tmp;
builder->code.capa = capa;
}
ASE_AWK_MEMCPY (builder->awk,
&builder->code.buf[builder->code.size], data, len);
builder->code.size += len;
return 0;
}
static ase_bool_t __begin_with (
const ase_char_t* str, ase_size_t len, const ase_char_t* what)
{
const ase_char_t* end = str + len;
while (str < end)
{
if (*what == ASE_T('\0')) return ase_true;
if (*what != *str) return ase_false;
str++; what++;
}
if (*what == ASE_T('\0')) return ase_true;
return ase_false;
}
static const ase_byte_t* __match_pattern (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p;
__match_t mat2;
ase_size_t nb, el, i;
p = base;
nb = *(ase_size_t*)p; p += ASE_SIZEOF(nb);
el = *(ase_size_t*)p; p += ASE_SIZEOF(el);
#ifdef BUILD_REX
xp_printf (ASE_T("__match_pattern: NB = %u, EL = %u\n"), (unsigned)nb, (unsigned)el);
#endif
mat->matched = ase_false;
mat->match_len = 0;
for (i = 0; i < nb; i++)
{
mat2.match_ptr = mat->match_ptr;
p = __match_branch (matcher, p, &mat2);
if (p == ASE_NULL) return ASE_NULL;
if (mat2.matched)
{
mat->matched = ase_true;
mat->match_len = mat2.match_len;
break;
}
}
return base + el;
}
static const ase_byte_t* __match_branch (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
/*
* branch body (base+sizeof(NA)+sizeof(BL)---+
* BL=base+sizeof(NA) ---------+ |
* base=NA ------+ | |
* | | |
* |NA(ase_size_t)|BL(ase_size_t)|ATOMS.........|
*/
mat->branch = base;
mat->branch_end = base + *((ase_size_t*)(base+ASE_SIZEOF(ase_size_t)));
return __match_branch_body (
matcher, base+ASE_SIZEOF(ase_size_t)*2, mat);
}
static const ase_byte_t* __match_branch_body (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* n;
if (matcher->depth.max > 0 && matcher->depth.cur >= matcher->depth.max)
{
matcher->errnum = ASE_AWK_ERECURSION;
return ASE_NULL;
}
matcher->depth.cur++;
n = __match_branch_body0 (matcher, base, mat);
matcher->depth.cur--;
return n;
}
static const ase_byte_t* __match_branch_body0 (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p;
/* __match_t mat2;*/
ase_size_t match_len = 0;
mat->matched = ase_false;
mat->match_len = 0;
/* TODO: is mat2 necessary here ? */
/*
mat2.match_ptr = mat->match_ptr;
mat2.branch = mat->branch;
mat2.branch_end = mat->branch_end;
*/
p = base;
while (p < mat->branch_end)
{
p = __match_atom (matcher, p, mat);
if (p == ASE_NULL) return ASE_NULL;
if (!mat->matched) break;
mat->match_ptr = &mat->match_ptr[mat->match_len];
match_len += mat->match_len;
#if 0
p = __match_atom (matcher, p, &mat2);
if (p == ASE_NULL) return ASE_NULL;
if (!mat2.matched)
{
mat->matched = ase_false;
break; /* stop matching */
}
mat->matched = ase_true;
mat->match_len += mat2.match_len;
mat2.match_ptr = &mat2.match_ptr[mat2.match_len];
#endif
}
if (mat->matched) mat->match_len = match_len;
return mat->branch_end;
}
static const ase_byte_t* __match_atom (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
static atom_matcher_t matchers[] =
{
__match_bol,
__match_eol,
__match_any_char,
__match_ord_char,
__match_charset,
__match_group
};
ASE_AWK_ASSERT (matcher->awk,
((struct __code_t*)base)->cmd >= 0 &&
((struct __code_t*)base)->cmd < ASE_COUNTOF(matchers));
return matchers[((struct __code_t*)base)->cmd] (matcher, base, mat);
}
static const ase_byte_t* __match_bol (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_BOL);
mat->matched = (mat->match_ptr == matcher->match.str.ptr ||
(cp->lbound == cp->ubound && cp->lbound == 0));
mat->match_len = 0;
return p;
}
static const ase_byte_t* __match_eol (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_EOL);
mat->matched = (mat->match_ptr == matcher->match.str.end ||
(cp->lbound == cp->ubound && cp->lbound == 0));
mat->match_len = 0;
return p;
}
static const ase_byte_t* __match_any_char (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
ase_size_t si = 0, lbound, ubound;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_ANY_CHAR);
lbound = cp->lbound;
ubound = cp->ubound;
mat->matched = ase_false;
mat->match_len = 0;
/* merge the same consecutive codes */
while (p < mat->branch_end &&
cp->cmd == ((const struct __code_t*)p)->cmd)
{
lbound += ((const struct __code_t*)p)->lbound;
ubound += ((const struct __code_t*)p)->ubound;
p += ASE_SIZEOF(*cp);
}
#ifdef BUILD_REX
xp_printf (ASE_T("__match_any_char: lbound = %u, ubound = %u\n"),
(unsigned int)lbound, (unsigned int)ubound);
#endif
/* find the longest match */
while (si < ubound)
{
if (&mat->match_ptr[si] >= matcher->match.str.end) break;
si++;
}
#ifdef BUILD_REX
xp_printf (ASE_T("__match_any_char: max si = %d\n"), si);
#endif
if (si >= lbound && si <= ubound)
{
p = __match_occurrences (matcher, si, p, lbound, ubound, mat);
}
return p;
}
static const ase_byte_t* __match_ord_char (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
ase_size_t si = 0, lbound, ubound;
ase_char_t cc;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_ORD_CHAR);
lbound = cp->lbound;
ubound = cp->ubound;
cc = *(ase_char_t*)p; p += ASE_SIZEOF(cc);
if (matcher->ignorecase) cc = ASE_AWK_TOUPPER(matcher->awk, cc);
/* merge the same consecutive codes
* for example, a{1,10}a{0,10} is shortened to a{1,20}
*/
if (matcher->ignorecase)
{
while (p < mat->branch_end &&
cp->cmd == ((const struct __code_t*)p)->cmd)
{
if (ASE_AWK_TOUPPER (matcher->awk, *(ase_char_t*)(p+ASE_SIZEOF(*cp))) != cc) break;
lbound += ((const struct __code_t*)p)->lbound;
ubound += ((const struct __code_t*)p)->ubound;
p += ASE_SIZEOF(*cp) + ASE_SIZEOF(cc);
}
}
else
{
while (p < mat->branch_end &&
cp->cmd == ((const struct __code_t*)p)->cmd)
{
if (*(ase_char_t*)(p+ASE_SIZEOF(*cp)) != cc) break;
lbound += ((const struct __code_t*)p)->lbound;
ubound += ((const struct __code_t*)p)->ubound;
p += ASE_SIZEOF(*cp) + ASE_SIZEOF(cc);
}
}
#ifdef BUILD_REX
xp_printf (ASE_T("__match_ord_char: lbound = %u, ubound = %u\n"),
(unsigned int)lbound, (unsigned int)ubound);*/
#endif
mat->matched = ase_false;
mat->match_len = 0;
/* find the longest match */
if (matcher->ignorecase)
{
while (si < ubound)
{
if (&mat->match_ptr[si] >= matcher->match.str.end) break;
if (cc != ASE_AWK_TOUPPER (matcher->awk, mat->match_ptr[si])) break;
si++;
}
}
else
{
while (si < ubound)
{
if (&mat->match_ptr[si] >= matcher->match.str.end) break;
if (cc != mat->match_ptr[si]) break;
si++;
}
}
#ifdef DEBUG_REX
xp_printf (ASE_T("__match_ord_char: max si = %d, lbound = %u, ubound = %u\n"), si, lbound, ubound);
#endif
if (si >= lbound && si <= ubound)
{
p = __match_occurrences (matcher, si, p, lbound, ubound, mat);
}
return p;
}
static const ase_byte_t* __match_charset (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
ase_size_t si = 0, lbound, ubound, csc, csl;
ase_bool_t n;
ase_char_t c;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_CHARSET);
lbound = cp->lbound;
ubound = cp->ubound;
csc = *(ase_size_t*)p; p += ASE_SIZEOF(csc);
csl = *(ase_size_t*)p; p += ASE_SIZEOF(csl);
mat->matched = ase_false;
mat->match_len = 0;
while (si < ubound)
{
if (&mat->match_ptr[si] >= matcher->match.str.end) break;
c = mat->match_ptr[si];
if (matcher->ignorecase) c = ASE_AWK_TOUPPER(matcher->awk, c);
n = __test_charset (matcher, p, csc, c);
if (cp->negate) n = !n;
if (!n) break;
si++;
}
p = p + csl - (ASE_SIZEOF(csc) + ASE_SIZEOF(csl));
if (si >= lbound && si <= ubound)
{
p = __match_occurrences (matcher, si, p, lbound, ubound, mat);
}
return p;
}
static const ase_byte_t* __match_group (
__matcher_t* matcher, const ase_byte_t* base, __match_t* mat)
{
const ase_byte_t* p = base;
const struct __code_t* cp;
__match_t mat2;
ase_size_t si = 0, grp_len_static[16], * grp_len;
cp = (const struct __code_t*)p; p += ASE_SIZEOF(*cp);
ASE_AWK_ASSERT (matcher->awk, cp->cmd == CMD_GROUP);
mat->matched = ase_false;
mat->match_len = 0;
/*
* A grouped pattern, unlike other atoms, can match one or more
* characters. When it is requested with a variable occurrences,
* the number of characters that have matched at each occurrence
* needs to be remembered for the backtracking purpose.
*
* An array "grp_len" is used to store the accumulated number of
* characters. grp_len[0] is set to zero always for convenience.
* grp_len[1] holds the number of characters that have matched
* at the first occurrence, grp_len[2] at the second occurrence,
* and so on.
*
* Look at the following example
*
* pattern: (abc){1,3}x string: abcabcabcxyz
*
* grp_len[3] => 9 -----------+
* grp_len[2] => 6 --------+ |
* grp_len[1] => 3 -----+ | |
* grp_len[0] => 0 --+ | | |
* | | | |
* abcabcabcxyz
*/
if (cp->ubound < ASE_COUNTOF(grp_len_static))
{
grp_len = grp_len_static;
}
else
{
grp_len = (ase_size_t*) ASE_AWK_MALLOC (
matcher->awk, ASE_SIZEOF(ase_size_t) * cp->ubound);
if (grp_len == ASE_NULL)
{
matcher->errnum = ASE_AWK_ENOMEM;
return ASE_NULL;
}
}
grp_len[si] = 0;
mat2.match_ptr = mat->match_ptr;
while (si < cp->ubound)
{
if (mat2.match_ptr >= matcher->match.str.end) break;
if (__match_pattern (matcher, p, &mat2) == ASE_NULL)
{
if (grp_len != grp_len_static)
ASE_AWK_FREE (matcher->awk, grp_len);
return ASE_NULL;
}
if (!mat2.matched) break;
grp_len[si+1] = grp_len[si] + mat2.match_len;
mat2.match_ptr += mat2.match_len;
mat2.match_len = 0;
mat2.matched = ase_false;
si++;
}
/* increment p by the length of the subpattern */
p += *(ase_size_t*)(p+ASE_SIZEOF(ase_size_t));
/* check the occurrences */
if (si >= cp->lbound && si <= cp->ubound)
{
if (cp->lbound == cp->ubound || p >= mat->branch_end)
{
mat->matched = ase_true;
mat->match_len = grp_len[si];
}
else
{
ASE_AWK_ASSERT (matcher->awk, cp->ubound > cp->lbound);
do
{
const ase_byte_t* tmp;
mat2.match_ptr = &mat->match_ptr[grp_len[si]];
mat2.branch = mat->branch;
mat2.branch_end = mat->branch_end;
#ifdef DEBUG_REX
xp_printf (ASE_T("__match_group: GROUP si = %d [%s]\n"), si, mat->match_ptr);
#endif
tmp = __match_branch_body (matcher, p, &mat2);
if (tmp == ASE_NULL)
{
if (grp_len != grp_len_static)
ASE_AWK_FREE (matcher->awk, grp_len);
return ASE_NULL;
}
if (mat2.matched)
{
mat->matched = ase_true;
mat->match_len = grp_len[si] + mat2.match_len;
p = tmp;
break;
}
if (si <= cp->lbound) break;
si--;
}
while (1);
}
}
if (grp_len != grp_len_static) ASE_AWK_FREE (matcher->awk, grp_len);
return p;
}
static const ase_byte_t* __match_occurrences (
__matcher_t* matcher, ase_size_t si, const ase_byte_t* p,
ase_size_t lbound, ase_size_t ubound, __match_t* mat)
{
ASE_AWK_ASSERT (matcher->awk, si >= lbound && si <= ubound);
/* the match has been found */
if (lbound == ubound || p >= mat->branch_end)
{
/* if the match for fixed occurrences was
* requested or no atoms remain unchecked in
* the branch, the match is returned. */
mat->matched = ase_true;
mat->match_len = si;
}
else
{
/* Otherwise, it checks if the remaining atoms
* match the rest of the string
*
* Let's say the caller of this function was processing
* the first period character in the following example.
*
* pattern: .{1,3}xx string: xxxyy
*
* It scans up to the third "x" in the string. si is set
* to 3 and p points to the first "x" in the pattern.
* It doesn't change mat.match_ptr so mat.match_ptr remains
* the same.
*
* si = 3 p -----+ mat.match_ptr ---+
* | |
* .{1,3}xx xxxyy
*
* When the code reaches here, the string pointed at by
* &mat.match_ptr[si] is tried to match against the remaining
* pattern pointed at p.
*
* &mat.match_ptr[si] ---+
* |
* xxxyy
*
* If a match is found, the match and the previous match are
* merged and returned.
*
* If not, si is decremented by one and the match is performed
* from the string pointed at by &mat.match_ptr[si].
*
* &mat.match_ptr[si] --+
* |
* xxxyy
*
* This process is repeated until a match is found or si
* becomes less than lbound. (si never becomes less than
* lbound in the implementation below, though)
*/
ASE_AWK_ASSERT (matcher->awk, ubound > lbound);
do
{
__match_t mat2;
const ase_byte_t* tmp;
mat2.match_ptr = &mat->match_ptr[si];
mat2.branch = mat->branch;
mat2.branch_end = mat->branch_end;
#ifdef DEBUG_REX
xp_printf (ASE_T("__match occurrences: si = %d [%s]\n"), si, mat->match_ptr);
#endif
tmp = __match_branch_body (matcher, p, &mat2);
if (mat2.matched)
{
mat->matched = ase_true;
mat->match_len = si + mat2.match_len;
p = tmp;
break;
}
if (si <= lbound) break;
si--;
}
while (1);
}
return p;
}
static ase_bool_t __test_charset (
__matcher_t* matcher, const ase_byte_t* p, ase_size_t csc, ase_char_t c)
{
ase_size_t i;
for (i = 0; i < csc; i++)
{
ase_char_t c0, c1, c2;
c0 = *(const ase_char_t*)p;
p += ASE_SIZEOF(c0);
if (c0 == CHARSET_ONE)
{
c1 = *(const ase_char_t*)p;
if (matcher->ignorecase)
c1 = ASE_AWK_TOUPPER(matcher->awk, c1);
if (c == c1) return ase_true;
}
else if (c0 == CHARSET_RANGE)
{
c1 = *(const ase_char_t*)p;
p += ASE_SIZEOF(c1);
c2 = *(const ase_char_t*)p;
if (matcher->ignorecase)
{
c1 = ASE_AWK_TOUPPER(matcher->awk, c1);
c2 = ASE_AWK_TOUPPER(matcher->awk, c2);
}
if (c >= c1 && c <= c2) return ase_true;
}
else if (c0 == CHARSET_CLASS)
{
c1 = *(const ase_char_t*)p;
if (__char_class[c1].func (
matcher->awk, c)) return ase_true;
}
else
{
ASE_AWK_ASSERT (matcher->awk,
!"should never happen - invalid charset code");
break;
}
p += ASE_SIZEOF(c1);
}
return ase_false;
}
static ase_bool_t __cc_isalnum (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISALNUM (awk, c);
}
static ase_bool_t __cc_isalpha (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISALPHA (awk, c);
}
static ase_bool_t __cc_isblank (ase_awk_t* awk, ase_char_t c)
{
return c == ASE_T(' ') || c == ASE_T('\t');
}
static ase_bool_t __cc_iscntrl (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISCNTRL (awk, c);
}
static ase_bool_t __cc_isdigit (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISDIGIT (awk, c);
}
static ase_bool_t __cc_isgraph (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISGRAPH (awk, c);
}
static ase_bool_t __cc_islower (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISLOWER (awk, c);
}
static ase_bool_t __cc_isprint (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISPRINT (awk, c);
}
static ase_bool_t __cc_ispunct (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISPUNCT (awk, c);
}
static ase_bool_t __cc_isspace (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISSPACE (awk, c);
}
static ase_bool_t __cc_isupper (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISUPPER (awk, c);
}
static ase_bool_t __cc_isxdigit (ase_awk_t* awk, ase_char_t c)
{
return ASE_AWK_ISXDIGIT (awk, c);
}
#ifdef DEBUG_REX
void ase_awk_printrex (void* rex)
{
__print_pattern (rex);
xp_printf (ASE_T("\n"));
}
static const ase_byte_t* __print_pattern (const ase_byte_t* p)
{
ase_size_t nb, el, i;
nb = *(ase_size_t*)p; p += ASE_SIZEOF(nb);
el = *(ase_size_t*)p; p += ASE_SIZEOF(el);
#ifdef DEBUG_REX
xp_printf (ASE_T("__print_pattern: NB = %u, EL = %u\n"), (unsigned int)nb, (unsigned int)el);
#endif
for (i = 0; i < nb; i++)
{
if (i != 0) xp_printf (ASE_T("|"));
p = __print_branch (p);
}
return p;
}
static const ase_byte_t* __print_branch (const ase_byte_t* p)
{
ase_size_t na, bl, i;
na = *(ase_size_t*)p; p += ASE_SIZEOF(na);
bl = *(ase_size_t*)p; p += ASE_SIZEOF(bl);
#ifdef DEBUG_REX
xp_printf (ASE_T("__print_branch: NA = %u, BL = %u\n"), (unsigned int) na, (unsigned int)bl);
#endif
for (i = 0; i < na; i++)
{
p = __print_atom (p);
}
return p;
}
static const ase_byte_t* __print_atom (const ase_byte_t* p)
{
const struct __code_t* cp = (const struct __code_t*)p;
if (cp->cmd == CMD_BOL)
{
xp_printf (ASE_T("^"));
p += ASE_SIZEOF(*cp);
}
else if (cp->cmd == CMD_EOL)
{
xp_printf (ASE_T("$"));
p += ASE_SIZEOF(*cp);
}
else if (cp->cmd == CMD_ANY_CHAR)
{
xp_printf (ASE_T("."));
p += ASE_SIZEOF(*cp);
}
else if (cp->cmd == CMD_ORD_CHAR)
{
p += ASE_SIZEOF(*cp);
xp_printf (ASE_T("%c"), *(ase_char_t*)p);
p += ASE_SIZEOF(ase_char_t);
}
else if (cp->cmd == CMD_CHARSET)
{
ase_size_t csc, csl, i;
p += ASE_SIZEOF(*cp);
xp_printf (ASE_T("["));
if (cp->negate) xp_printf (ASE_T("^"));
csc = *(ase_size_t*)p; p += ASE_SIZEOF(csc);
csl = *(ase_size_t*)p; p += ASE_SIZEOF(csl);
for (i = 0; i < csc; i++)
{
ase_char_t c0, c1, c2;
c0 = *(ase_char_t*)p;
p += ASE_SIZEOF(c0);
if (c0 == CHARSET_ONE)
{
c1 = *(ase_char_t*)p;
xp_printf (ASE_T("%c"), c1);
}
else if (c0 == CHARSET_RANGE)
{
c1 = *(ase_char_t*)p;
p += ASE_SIZEOF(c1);
c2 = *(ase_char_t*)p;
xp_printf (ASE_T("%c-%c"), c1, c2);
}
else if (c0 == CHARSET_CLASS)
{
c1 = *(ase_char_t*)p;
xp_printf (ASE_T("[:%s:]"), __char_class[c1].name);
}
else
{
xp_printf (ASE_T("should never happen - invalid charset code\n"));
}
p += ASE_SIZEOF(c1);
}
xp_printf (ASE_T("]"));
}
else if (cp->cmd == CMD_GROUP)
{
p += ASE_SIZEOF(*cp);
xp_printf (ASE_T("("));
p = __print_pattern (p);
xp_printf (ASE_T(")"));
}
else
{
xp_printf (ASE_T("should never happen - invalid atom code\n"));
}
if (cp->lbound == 0 && cp->ubound == BOUND_MAX)
xp_printf (ASE_T("*"));
else if (cp->lbound == 1 && cp->ubound == BOUND_MAX)
xp_printf (ASE_T("+"));
else if (cp->lbound == 0 && cp->ubound == 1)
xp_printf (ASE_T("?"));
else if (cp->lbound != 1 || cp->ubound != 1)
{
xp_printf (ASE_T("{%lu,%lu}"),
(unsigned long)cp->lbound, (unsigned long)cp->ubound);
}
return p;
}
#endif
Reference in New Issue View Git Blame Copy Permalink