root/lib/regex_internal.h

INCLUDED FROM

DEFINITIONS

1. bitset_set
2. bitset_clear
3. bitset_contain
4. bitset_empty
5. bitset_set_all
6. bitset_copy
7. bitset_not
8. bitset_merge
9. bitset_mask
10. re_string_char_size_at
11. re_string_wchar_at
12. re_string_elem_size_at

     1 /* Extended regular expression matching and search library.
     2    Copyright (C) 2002-2023 Free Software Foundation, Inc.
     3    This file is part of the GNU C Library.
     4    Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
     5 
     6    The GNU C Library is free software; you can redistribute it and/or
     7    modify it under the terms of the GNU Lesser General Public
     8    License as published by the Free Software Foundation; either
     9    version 2.1 of the License, or (at your option) any later version.
    10 
    11    The GNU C Library is distributed in the hope that it will be useful,
    12    but WITHOUT ANY WARRANTY; without even the implied warranty of
    13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    14    Lesser General Public License for more details.
    15 
    16    You should have received a copy of the GNU Lesser General Public
    17    License along with the GNU C Library; if not, see
    18    <https://www.gnu.org/licenses/>.  */
    19 
    20 #ifndef _REGEX_INTERNAL_H
    21 #define _REGEX_INTERNAL_H 1
    22 
    23 #include <ctype.h>
    24 #include <stdio.h>
    25 #include <stdlib.h>
    26 #include <string.h>
    27 
    28 #include <langinfo.h>
    29 #include <locale.h>
    30 #include <wchar.h>
    31 #include <wctype.h>
    32 #include <stdckdint.h>
    33 #include <stdint.h>
    34 
    35 #ifndef _LIBC
    36 # include <dynarray.h>
    37 #endif
    38 
    39 #include <intprops.h>
    40 #include <verify.h>
    41 
    42 #if defined DEBUG && DEBUG != 0
    43 # include <assert.h>
    44 # define DEBUG_ASSERT(x) assert (x)
    45 #else
    46 # define DEBUG_ASSERT(x) assume (x)
    47 #endif
    48 
    49 #ifdef _LIBC
    50 # include <libc-lock.h>
    51 # define lock_define(name) __libc_lock_define (, name)
    52 # define lock_init(lock) (__libc_lock_init (lock), 0)
    53 # define lock_fini(lock) ((void) 0)
    54 # define lock_lock(lock) __libc_lock_lock (lock)
    55 # define lock_unlock(lock) __libc_lock_unlock (lock)
    56 #elif defined GNULIB_LOCK && !defined GNULIB_REGEX_SINGLE_THREAD
    57 # include "glthread/lock.h"
    58 # define lock_define(name) gl_lock_define (, name)
    59 # define lock_init(lock) glthread_lock_init (&(lock))
    60 # define lock_fini(lock) glthread_lock_destroy (&(lock))
    61 # define lock_lock(lock) glthread_lock_lock (&(lock))
    62 # define lock_unlock(lock) glthread_lock_unlock (&(lock))
    63 #elif defined GNULIB_PTHREAD && !defined GNULIB_REGEX_SINGLE_THREAD
    64 # include <pthread.h>
    65 # define lock_define(name) pthread_mutex_t name;
    66 # define lock_init(lock) pthread_mutex_init (&(lock), 0)
    67 # define lock_fini(lock) pthread_mutex_destroy (&(lock))
    68 # define lock_lock(lock) pthread_mutex_lock (&(lock))
    69 # define lock_unlock(lock) pthread_mutex_unlock (&(lock))
    70 #else
    71 # define lock_define(name)
    72 # define lock_init(lock) 0
    73 # define lock_fini(lock) ((void) 0)
    74   /* The 'dfa' avoids an "unused variable 'dfa'" warning from GCC.  */
    75 # define lock_lock(lock) ((void) dfa)
    76 # define lock_unlock(lock) ((void) 0)
    77 #endif
    78 
    79 /* In case that the system doesn't have isblank().  */
    80 #if !defined _LIBC && ! (defined isblank || (HAVE_ISBLANK && HAVE_DECL_ISBLANK))
    81 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
    82 #endif
    83 
    84 /* regex code assumes isascii has its usual numeric meaning,
    85    even if the portable character set uses EBCDIC encoding,
    86    and even if wint_t is wider than int.  */
    87 #ifndef _LIBC
    88 # undef isascii
    89 # define isascii(c) (((c) & ~0x7f) == 0)
    90 #endif
    91 
    92 #ifdef _LIBC
    93 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
    94 #  define _RE_DEFINE_LOCALE_FUNCTIONS 1
    95 #   include <locale/localeinfo.h>
    96 #   include <locale/coll-lookup.h>
    97 # endif
    98 #endif
    99 
   100 /* This is for other GNU distributions with internationalized messages.  */
   101 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
   102 # include <libintl.h>
   103 # ifdef _LIBC
   104 #  undef gettext
   105 #  define gettext(msgid) \
   106   __dcgettext (_libc_intl_domainname, msgid, LC_MESSAGES)
   107 # endif
   108 #else
   109 # undef gettext
   110 # define gettext(msgid) (msgid)
   111 #endif
   112 
   113 #ifndef gettext_noop
   114 /* This define is so xgettext can find the internationalizable
   115    strings.  */
   116 # define gettext_noop(String) String
   117 #endif
   118 
   119 /* Number of ASCII characters.  */
   120 #define ASCII_CHARS 0x80
   121 
   122 /* Number of single byte characters.  */
   123 #define SBC_MAX (UCHAR_MAX + 1)
   124 
   125 #define COLL_ELEM_LEN_MAX 8
   126 
   127 /* The character which represents newline.  */
   128 #define NEWLINE_CHAR '\n'
   129 #define WIDE_NEWLINE_CHAR L'\n'
   130 
   131 /* Rename to standard API for using out of glibc.  */
   132 #ifndef _LIBC
   133 # undef __wctype
   134 # undef __iswalnum
   135 # undef __iswctype
   136 # undef __towlower
   137 # undef __towupper
   138 # define __wctype wctype
   139 # define __iswalnum iswalnum
   140 # define __iswctype iswctype
   141 # define __towlower towlower
   142 # define __towupper towupper
   143 # define __btowc btowc
   144 # define __mbrtowc mbrtowc
   145 # define __wcrtomb wcrtomb
   146 # define __regfree regfree
   147 #endif /* not _LIBC */
   148 
   149 /* Types related to integers.  Unless protected by #ifdef _LIBC, the
   150    regex code should avoid exact-width types like int32_t and uint64_t
   151    as some non-GCC platforms lack them, an issue when this code is
   152    used in Gnulib.  */
   153 
   154 #ifndef ULONG_WIDTH
   155 # define ULONG_WIDTH REGEX_UINTEGER_WIDTH (ULONG_MAX)
   156 /* The number of usable bits in an unsigned integer type with maximum
   157    value MAX, as an int expression suitable in #if.  Cover all known
   158    practical hosts.  This implementation exploits the fact that MAX is
   159    1 less than a power of 2, and merely counts the number of 1 bits in
   160    MAX; "COBn" means "count the number of 1 bits in the low-order n bits".  */
   161 # define REGEX_UINTEGER_WIDTH(max) REGEX_COB128 (max)
   162 # define REGEX_COB128(n) (REGEX_COB64 ((n) >> 31 >> 31 >> 2) + REGEX_COB64 (n))
   163 # define REGEX_COB64(n) (REGEX_COB32 ((n) >> 31 >> 1) + REGEX_COB32 (n))
   164 # define REGEX_COB32(n) (REGEX_COB16 ((n) >> 16) + REGEX_COB16 (n))
   165 # define REGEX_COB16(n) (REGEX_COB8 ((n) >> 8) + REGEX_COB8 (n))
   166 # define REGEX_COB8(n) (REGEX_COB4 ((n) >> 4) + REGEX_COB4 (n))
   167 # define REGEX_COB4(n) (!!((n) & 8) + !!((n) & 4) + !!((n) & 2) + ((n) & 1))
   168 # if ULONG_MAX / 2 + 1 != 1ul << (ULONG_WIDTH - 1)
   169 #  error "ULONG_MAX out of range"
   170 # endif
   171 #endif
   172 
   173 /* The type of indexes into strings.  This is signed, not size_t,
   174    since the API requires indexes to fit in regoff_t anyway, and using
   175    signed integers makes the code a bit smaller and presumably faster.
   176    The traditional GNU regex implementation uses int for indexes.
   177    The POSIX-compatible implementation uses a possibly-wider type.
   178    The name 'Idx' is three letters to minimize the hassle of
   179    reindenting a lot of regex code that formerly used 'int'.  */
   180 typedef regoff_t Idx;
   181 #ifdef _REGEX_LARGE_OFFSETS
   182 # define IDX_MAX SSIZE_MAX
   183 #else
   184 # define IDX_MAX INT_MAX
   185 #endif
   186 
   187 /* A hash value, suitable for computing hash tables.  */
   188 typedef __re_size_t re_hashval_t;
   189 
   190 /* An integer used to represent a set of bits.  It must be unsigned,
   191    and must be at least as wide as unsigned int.  */
   192 typedef unsigned long int bitset_word_t;
   193 /* All bits set in a bitset_word_t.  */
   194 #define BITSET_WORD_MAX ULONG_MAX
   195 /* Number of bits in a bitset_word_t.  */
   196 #define BITSET_WORD_BITS ULONG_WIDTH
   197 
   198 /* Number of bitset_word_t values in a bitset_t.  */
   199 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)
   200 
   201 typedef bitset_word_t bitset_t[BITSET_WORDS];
   202 typedef bitset_word_t *re_bitset_ptr_t;
   203 typedef const bitset_word_t *re_const_bitset_ptr_t;
   204 
   205 #define PREV_WORD_CONSTRAINT 0x0001
   206 #define PREV_NOTWORD_CONSTRAINT 0x0002
   207 #define NEXT_WORD_CONSTRAINT 0x0004
   208 #define NEXT_NOTWORD_CONSTRAINT 0x0008
   209 #define PREV_NEWLINE_CONSTRAINT 0x0010
   210 #define NEXT_NEWLINE_CONSTRAINT 0x0020
   211 #define PREV_BEGBUF_CONSTRAINT 0x0040
   212 #define NEXT_ENDBUF_CONSTRAINT 0x0080
   213 #define WORD_DELIM_CONSTRAINT 0x0100
   214 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
   215 
   216 typedef enum
   217 {
   218   INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
   219   WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
   220   WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
   221   INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
   222   LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
   223   LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
   224   BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
   225   BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
   226   WORD_DELIM = WORD_DELIM_CONSTRAINT,
   227   NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
   228 } re_context_type;
   229 
   230 typedef struct
   231 {
   232   Idx alloc;
   233   Idx nelem;
   234   Idx *elems;
   235 } re_node_set;
   236 
   237 typedef enum
   238 {
   239   NON_TYPE = 0,
   240 
   241   /* Node type, These are used by token, node, tree.  */
   242   CHARACTER = 1,
   243   END_OF_RE = 2,
   244   SIMPLE_BRACKET = 3,
   245   OP_BACK_REF = 4,
   246   OP_PERIOD = 5,
   247   COMPLEX_BRACKET = 6,
   248   OP_UTF8_PERIOD = 7,
   249 
   250   /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
   251      when the debugger shows values of this enum type.  */
   252 #define EPSILON_BIT 8
   253   OP_OPEN_SUBEXP = EPSILON_BIT | 0,
   254   OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
   255   OP_ALT = EPSILON_BIT | 2,
   256   OP_DUP_ASTERISK = EPSILON_BIT | 3,
   257   ANCHOR = EPSILON_BIT | 4,
   258 
   259   /* Tree type, these are used only by tree. */
   260   CONCAT = 16,
   261   SUBEXP = 17,
   262 
   263   /* Token type, these are used only by token.  */
   264   OP_DUP_PLUS = 18,
   265   OP_DUP_QUESTION,
   266   OP_OPEN_BRACKET,
   267   OP_CLOSE_BRACKET,
   268   OP_CHARSET_RANGE,
   269   OP_OPEN_DUP_NUM,
   270   OP_CLOSE_DUP_NUM,
   271   OP_NON_MATCH_LIST,
   272   OP_OPEN_COLL_ELEM,
   273   OP_CLOSE_COLL_ELEM,
   274   OP_OPEN_EQUIV_CLASS,
   275   OP_CLOSE_EQUIV_CLASS,
   276   OP_OPEN_CHAR_CLASS,
   277   OP_CLOSE_CHAR_CLASS,
   278   OP_WORD,
   279   OP_NOTWORD,
   280   OP_SPACE,
   281   OP_NOTSPACE,
   282   BACK_SLASH
   283 
   284 } re_token_type_t;
   285 
   286 typedef struct
   287 {
   288   /* Multibyte characters.  */
   289   wchar_t *mbchars;
   290 
   291 #ifdef _LIBC
   292   /* Collating symbols.  */
   293   int32_t *coll_syms;
   294 #endif
   295 
   296 #ifdef _LIBC
   297   /* Equivalence classes. */
   298   int32_t *equiv_classes;
   299 #endif
   300 
   301   /* Range expressions. */
   302 #ifdef _LIBC
   303   uint32_t *range_starts;
   304   uint32_t *range_ends;
   305 #else
   306   wchar_t *range_starts;
   307   wchar_t *range_ends;
   308 #endif
   309 
   310   /* Character classes. */
   311   wctype_t *char_classes;
   312 
   313   /* If this character set is the non-matching list.  */
   314   unsigned int non_match : 1;
   315 
   316   /* # of multibyte characters.  */
   317   Idx nmbchars;
   318 
   319   /* # of collating symbols.  */
   320   Idx ncoll_syms;
   321 
   322   /* # of equivalence classes. */
   323   Idx nequiv_classes;
   324 
   325   /* # of range expressions. */
   326   Idx nranges;
   327 
   328   /* # of character classes. */
   329   Idx nchar_classes;
   330 } re_charset_t;
   331 
   332 typedef struct
   333 {
   334   union
   335   {
   336     unsigned char c;            /* for CHARACTER */
   337     re_bitset_ptr_t sbcset;     /* for SIMPLE_BRACKET */
   338     re_charset_t *mbcset;       /* for COMPLEX_BRACKET */
   339     Idx idx;                    /* for BACK_REF */
   340     re_context_type ctx_type;   /* for ANCHOR */
   341   } opr;
   342 #if (__GNUC__ >= 2 || defined __clang__) && !defined __STRICT_ANSI__
   343   re_token_type_t type : 8;
   344 #else
   345   re_token_type_t type;
   346 #endif
   347   unsigned int constraint : 10; /* context constraint */
   348   unsigned int duplicated : 1;
   349   unsigned int opt_subexp : 1;
   350   unsigned int accept_mb : 1;
   351   /* These 2 bits can be moved into the union if needed (e.g. if running out
   352      of bits; move opr.c to opr.c.c and move the flags to opr.c.flags).  */
   353   unsigned int mb_partial : 1;
   354   unsigned int word_char : 1;
   355 } re_token_t;
   356 
   357 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
   358 
   359 struct re_string_t
   360 {
   361   /* Indicate the raw buffer which is the original string passed as an
   362      argument of regexec(), re_search(), etc..  */
   363   const unsigned char *raw_mbs;
   364   /* Store the multibyte string.  In case of "case insensitive mode" like
   365      REG_ICASE, upper cases of the string are stored, otherwise MBS points
   366      the same address that RAW_MBS points.  */
   367   unsigned char *mbs;
   368   /* Store the wide character string which is corresponding to MBS.  */
   369   wint_t *wcs;
   370   Idx *offsets;
   371   mbstate_t cur_state;
   372   /* Index in RAW_MBS.  Each character mbs[i] corresponds to
   373      raw_mbs[raw_mbs_idx + i].  */
   374   Idx raw_mbs_idx;
   375   /* The length of the valid characters in the buffers.  */
   376   Idx valid_len;
   377   /* The corresponding number of bytes in raw_mbs array.  */
   378   Idx valid_raw_len;
   379   /* The length of the buffers MBS and WCS.  */
   380   Idx bufs_len;
   381   /* The index in MBS, which is updated by re_string_fetch_byte.  */
   382   Idx cur_idx;
   383   /* length of RAW_MBS array.  */
   384   Idx raw_len;
   385   /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN.  */
   386   Idx len;
   387   /* End of the buffer may be shorter than its length in the cases such
   388      as re_match_2, re_search_2.  Then, we use STOP for end of the buffer
   389      instead of LEN.  */
   390   Idx raw_stop;
   391   /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS.  */
   392   Idx stop;
   393 
   394   /* The context of mbs[0].  We store the context independently, since
   395      the context of mbs[0] may be different from raw_mbs[0], which is
   396      the beginning of the input string.  */
   397   unsigned int tip_context;
   398   /* The translation passed as a part of an argument of re_compile_pattern.  */
   399   RE_TRANSLATE_TYPE trans;
   400   /* Copy of re_dfa_t's word_char.  */
   401   re_const_bitset_ptr_t word_char;
   402   /* true if REG_ICASE.  */
   403   unsigned char icase;
   404   unsigned char is_utf8;
   405   unsigned char map_notascii;
   406   unsigned char mbs_allocated;
   407   unsigned char offsets_needed;
   408   unsigned char newline_anchor;
   409   unsigned char word_ops_used;
   410   int mb_cur_max;
   411 };
   412 typedef struct re_string_t re_string_t;
   413 
   414 
   415 struct re_dfa_t;
   416 typedef struct re_dfa_t re_dfa_t;
   417 
   418 #ifndef _LIBC
   419 # define IS_IN(libc) false
   420 #endif
   421 
   422 #define re_string_peek_byte(pstr, offset) \
   423   ((pstr)->mbs[(pstr)->cur_idx + offset])
   424 #define re_string_fetch_byte(pstr) \
   425   ((pstr)->mbs[(pstr)->cur_idx++])
   426 #define re_string_first_byte(pstr, idx) \
   427   ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
   428 #define re_string_is_single_byte_char(pstr, idx) \
   429   ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
   430                                 || (pstr)->wcs[(idx) + 1] != WEOF))
   431 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
   432 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
   433 #define re_string_get_buffer(pstr) ((pstr)->mbs)
   434 #define re_string_length(pstr) ((pstr)->len)
   435 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
   436 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
   437 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
   438 
   439 #ifdef _LIBC
   440 # define MALLOC_0_IS_NONNULL 1
   441 #elif !defined MALLOC_0_IS_NONNULL
   442 # define MALLOC_0_IS_NONNULL 0
   443 #endif
   444 
   445 #ifndef MAX
   446 # define MAX(a,b) ((a) < (b) ? (b) : (a))
   447 #endif
   448 #ifndef MIN
   449 # define MIN(a,b) ((a) < (b) ? (a) : (b))
   450 #endif
   451 
   452 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
   453 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
   454 #define re_free(p) free (p)
   455 
   456 struct bin_tree_t
   457 {
   458   struct bin_tree_t *parent;
   459   struct bin_tree_t *left;
   460   struct bin_tree_t *right;
   461   struct bin_tree_t *first;
   462   struct bin_tree_t *next;
   463 
   464   re_token_t token;
   465 
   466   /* 'node_idx' is the index in dfa->nodes, if 'type' == 0.
   467      Otherwise 'type' indicate the type of this node.  */
   468   Idx node_idx;
   469 };
   470 typedef struct bin_tree_t bin_tree_t;
   471 
   472 #define BIN_TREE_STORAGE_SIZE \
   473   ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
   474 
   475 struct bin_tree_storage_t
   476 {
   477   struct bin_tree_storage_t *next;
   478   bin_tree_t data[BIN_TREE_STORAGE_SIZE];
   479 };
   480 typedef struct bin_tree_storage_t bin_tree_storage_t;
   481 
   482 #define CONTEXT_WORD 1
   483 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
   484 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
   485 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
   486 
   487 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
   488 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
   489 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
   490 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
   491 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
   492 
   493 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
   494 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
   495 #define IS_WIDE_WORD_CHAR(ch) (__iswalnum (ch) || (ch) == L'_')
   496 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
   497 
   498 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
   499  ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
   500   || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
   501   || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
   502   || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
   503 
   504 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
   505  ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
   506   || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
   507   || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
   508   || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
   509 
   510 struct re_dfastate_t
   511 {
   512   re_hashval_t hash;
   513   re_node_set nodes;
   514   re_node_set non_eps_nodes;
   515   re_node_set inveclosure;
   516   re_node_set *entrance_nodes;
   517   struct re_dfastate_t **trtable, **word_trtable;
   518   unsigned int context : 4;
   519   unsigned int halt : 1;
   520   /* If this state can accept "multi byte".
   521      Note that we refer to multibyte characters, and multi character
   522      collating elements as "multi byte".  */
   523   unsigned int accept_mb : 1;
   524   /* If this state has backreference node(s).  */
   525   unsigned int has_backref : 1;
   526   unsigned int has_constraint : 1;
   527 };
   528 typedef struct re_dfastate_t re_dfastate_t;
   529 
   530 struct re_state_table_entry
   531 {
   532   Idx num;
   533   Idx alloc;
   534   re_dfastate_t **array;
   535 };
   536 
   537 /* Array type used in re_sub_match_last_t and re_sub_match_top_t.  */
   538 
   539 typedef struct
   540 {
   541   Idx next_idx;
   542   Idx alloc;
   543   re_dfastate_t **array;
   544 } state_array_t;
   545 
   546 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP.  */
   547 
   548 typedef struct
   549 {
   550   Idx node;
   551   Idx str_idx; /* The position NODE match at.  */
   552   state_array_t path;
   553 } re_sub_match_last_t;
   554 
   555 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
   556    And information about the node, whose type is OP_CLOSE_SUBEXP,
   557    corresponding to NODE is stored in LASTS.  */
   558 
   559 typedef struct
   560 {
   561   Idx str_idx;
   562   Idx node;
   563   state_array_t *path;
   564   Idx alasts; /* Allocation size of LASTS.  */
   565   Idx nlasts; /* The number of LASTS.  */
   566   re_sub_match_last_t **lasts;
   567 } re_sub_match_top_t;
   568 
   569 struct re_backref_cache_entry
   570 {
   571   Idx node;
   572   Idx str_idx;
   573   Idx subexp_from;
   574   Idx subexp_to;
   575   bitset_word_t eps_reachable_subexps_map;
   576   char more;
   577 };
   578 
   579 typedef struct
   580 {
   581   /* The string object corresponding to the input string.  */
   582   re_string_t input;
   583   const re_dfa_t *const dfa;
   584   /* EFLAGS of the argument of regexec.  */
   585   int eflags;
   586   /* Where the matching ends.  */
   587   Idx match_last;
   588   Idx last_node;
   589   /* The state log used by the matcher.  */
   590   re_dfastate_t **state_log;
   591   Idx state_log_top;
   592   /* Back reference cache.  */
   593   Idx nbkref_ents;
   594   Idx abkref_ents;
   595   struct re_backref_cache_entry *bkref_ents;
   596   int max_mb_elem_len;
   597   Idx nsub_tops;
   598   Idx asub_tops;
   599   re_sub_match_top_t **sub_tops;
   600 } re_match_context_t;
   601 
   602 typedef struct
   603 {
   604   re_dfastate_t **sifted_states;
   605   re_dfastate_t **limited_states;
   606   Idx last_node;
   607   Idx last_str_idx;
   608   re_node_set limits;
   609 } re_sift_context_t;
   610 
   611 struct re_fail_stack_ent_t
   612 {
   613   Idx idx;
   614   Idx node;
   615   regmatch_t *regs;
   616   re_node_set eps_via_nodes;
   617 };
   618 
   619 struct re_fail_stack_t
   620 {
   621   Idx num;
   622   Idx alloc;
   623   struct re_fail_stack_ent_t *stack;
   624 };
   625 
   626 struct re_dfa_t
   627 {
   628   re_token_t *nodes;
   629   size_t nodes_alloc;
   630   size_t nodes_len;
   631   Idx *nexts;
   632   Idx *org_indices;
   633   re_node_set *edests;
   634   re_node_set *eclosures;
   635   re_node_set *inveclosures;
   636   struct re_state_table_entry *state_table;
   637   re_dfastate_t *init_state;
   638   re_dfastate_t *init_state_word;
   639   re_dfastate_t *init_state_nl;
   640   re_dfastate_t *init_state_begbuf;
   641   bin_tree_t *str_tree;
   642   bin_tree_storage_t *str_tree_storage;
   643   re_bitset_ptr_t sb_char;
   644   int str_tree_storage_idx;
   645 
   646   /* number of subexpressions 're_nsub' is in regex_t.  */
   647   re_hashval_t state_hash_mask;
   648   Idx init_node;
   649   Idx nbackref; /* The number of backreference in this dfa.  */
   650 
   651   /* Bitmap expressing which backreference is used.  */
   652   bitset_word_t used_bkref_map;
   653   bitset_word_t completed_bkref_map;
   654 
   655   unsigned int has_plural_match : 1;
   656   /* If this dfa has "multibyte node", which is a backreference or
   657      a node which can accept multibyte character or multi character
   658      collating element.  */
   659   unsigned int has_mb_node : 1;
   660   unsigned int is_utf8 : 1;
   661   unsigned int map_notascii : 1;
   662   unsigned int word_ops_used : 1;
   663   int mb_cur_max;
   664   bitset_t word_char;
   665   reg_syntax_t syntax;
   666   Idx *subexp_map;
   667 #ifdef DEBUG
   668   char* re_str;
   669 #endif
   670   lock_define (lock)
   671 };
   672 
   673 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
   674 #define re_node_set_remove(set,id) \
   675   (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
   676 #define re_node_set_empty(p) ((p)->nelem = 0)
   677 #define re_node_set_free(set) re_free ((set)->elems)
   678 
   679 
   680 typedef enum
   681 {
   682   SB_CHAR,
   683   MB_CHAR,
   684   EQUIV_CLASS,
   685   COLL_SYM,
   686   CHAR_CLASS
   687 } bracket_elem_type;
   688 
   689 typedef struct
   690 {
   691   bracket_elem_type type;
   692   union
   693   {
   694     unsigned char ch;
   695     unsigned char *name;
   696     wchar_t wch;
   697   } opr;
   698 } bracket_elem_t;
   699 
   700 
   701 /* Functions for bitset_t operation.  */
   702 
   703 static inline void
   704 bitset_set (bitset_t set, Idx i)
   705 {
   706   set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS;
   707 }
   708 
   709 static inline void
   710 bitset_clear (bitset_t set, Idx i)
   711 {
   712   set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS);
   713 }
   714 
   715 static inline bool
   716 bitset_contain (const bitset_t set, Idx i)
   717 {
   718   return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1;
   719 }
   720 
   721 static inline void
   722 bitset_empty (bitset_t set)
   723 {
   724   memset (set, '\0', sizeof (bitset_t));
   725 }
   726 
   727 static inline void
   728 bitset_set_all (bitset_t set)
   729 {
   730   memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS));
   731   if (SBC_MAX % BITSET_WORD_BITS != 0)
   732     set[BITSET_WORDS - 1] =
   733       ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1;
   734 }
   735 
   736 static inline void
   737 bitset_copy (bitset_t dest, const bitset_t src)
   738 {
   739   memcpy (dest, src, sizeof (bitset_t));
   740 }
   741 
   742 static inline void
   743 bitset_not (bitset_t set)
   744 {
   745   int bitset_i;
   746   for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i)
   747     set[bitset_i] = ~set[bitset_i];
   748   if (SBC_MAX % BITSET_WORD_BITS != 0)
   749     set[BITSET_WORDS - 1] =
   750       ((((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1)
   751        & ~set[BITSET_WORDS - 1]);
   752 }
   753 
   754 static inline void
   755 bitset_merge (bitset_t dest, const bitset_t src)
   756 {
   757   int bitset_i;
   758   for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
   759     dest[bitset_i] |= src[bitset_i];
   760 }
   761 
   762 static inline void
   763 bitset_mask (bitset_t dest, const bitset_t src)
   764 {
   765   int bitset_i;
   766   for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
   767     dest[bitset_i] &= src[bitset_i];
   768 }
   769 
   770 /* Functions for re_string.  */
   771 static int
   772 __attribute__ ((pure, unused))
   773 re_string_char_size_at (const re_string_t *pstr, Idx idx)
   774 {
   775   int byte_idx;
   776   if (pstr->mb_cur_max == 1)
   777     return 1;
   778   for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
   779     if (pstr->wcs[idx + byte_idx] != WEOF)
   780       break;
   781   return byte_idx;
   782 }
   783 
   784 static wint_t
   785 __attribute__ ((pure, unused))
   786 re_string_wchar_at (const re_string_t *pstr, Idx idx)
   787 {
   788   if (pstr->mb_cur_max == 1)
   789     return (wint_t) pstr->mbs[idx];
   790   return (wint_t) pstr->wcs[idx];
   791 }
   792 
   793 #ifdef _LIBC
   794 # include <locale/weight.h>
   795 #endif
   796 
   797 static int
   798 __attribute__ ((pure, unused))
   799 re_string_elem_size_at (const re_string_t *pstr, Idx idx)
   800 {
   801 #ifdef _LIBC
   802   const unsigned char *p, *extra;
   803   const int32_t *table, *indirect;
   804   uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
   805 
   806   if (nrules != 0)
   807     {
   808       table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
   809       extra = (const unsigned char *)
   810         _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
   811       indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
   812                                                 _NL_COLLATE_INDIRECTMB);
   813       p = pstr->mbs + idx;
   814       findidx (table, indirect, extra, &p, pstr->len - idx);
   815       return p - pstr->mbs - idx;
   816     }
   817 #endif /* _LIBC */
   818 
   819   return 1;
   820 }
   821 
   822 #ifdef _LIBC
   823 # if __glibc_has_attribute (__fallthrough__)
   824 #  define FALLTHROUGH __attribute__ ((__fallthrough__))
   825 # else
   826 #  define FALLTHROUGH ((void) 0)
   827 # endif
   828 #else
   829 # include "attribute.h"
   830 #endif
   831 
   832 #endif /*  _REGEX_INTERNAL_H */