From ab4b89fe8a6b41b6317e18e0d14c81103f3d98e1 Mon Sep 17 00:00:00 2001 From: Ulrich Drepper Date: Mon, 27 Dec 2004 16:44:39 +0000 Subject: Update. 2004-04-27 Paolo Bonzini * posix/regex_internal.h (struct re_dfastate_t): Make word_trtable a pointer to the 512-item transition table. * posix/regexec.c (build_trtable): Fill in either state->trtable or state->word_trtable. Return a boolean indicating success. (transit_state): Expect state->trtable to be a 256-item transition table. Reorganize code to have less tests in the common case, and to save an indentation level. --- posix/regex_internal.h | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) (limited to 'posix/regex_internal.h') diff --git a/posix/regex_internal.h b/posix/regex_internal.h index 0ccd8d3665..23765c970e 100644 --- a/posix/regex_internal.h +++ b/posix/regex_internal.h @@ -486,7 +486,7 @@ struct re_dfastate_t re_node_set non_eps_nodes; re_node_set inveclosure; re_node_set *entrance_nodes; - struct re_dfastate_t **trtable; + struct re_dfastate_t **trtable, **word_trtable; unsigned int context : 4; unsigned int halt : 1; /* If this state can accept `multi byte'. @@ -496,7 +496,6 @@ struct re_dfastate_t /* If this state has backreference node(s). */ unsigned int has_backref : 1; unsigned int has_constraint : 1; - unsigned int word_trtable : 1; }; typedef struct re_dfastate_t re_dfastate_t; -- cgit v1.2.3