/* Extended regular expression matching and search library.

   Copyright (C) 2002-2026 Free Software Foundation, Inc.

   This file is part of the GNU C Library.

   Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.

   The GNU C Library is free software; you can redistribute it and/or

   modify it under the terms of the GNU Lesser General Public

   License as published by the Free Software Foundation; either

   version 2.1 of the License, or (at your option) any later version.

   The GNU C Library is distributed in the hope that it will be useful,

   but WITHOUT ANY WARRANTY; without even the implied warranty of

   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public

   License along with the GNU C Library; if not, see

   <https://www.gnu.org/licenses/>.  */

#ifndef _REGEX_INTERNAL_H

#define _REGEX_INTERNAL_H 1

#include <ctype.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <langinfo.h>

#include <locale.h>

#include <stdckdint.h>

#include <stdcountof.h>

#include <stdint.h>

#ifndef _LIBC

# include <dynarray.h>

#endif

#include <intprops.h>

#include <verify.h>

#if defined DEBUG && DEBUG != 0

# include <assert.h>

# define DEBUG_ASSERT(x) assert (x)

#else

# define DEBUG_ASSERT(x) assume (x)

#endif

#ifdef _LIBC

# include <libc-lock.h>

# define lock_define(name) __libc_lock_define (, name)

# define lock_init(lock) (__libc_lock_init (lock), 0)

# define lock_fini(lock) ((void) 0)

# define lock_lock(lock) __libc_lock_lock (lock)

# define lock_unlock(lock) __libc_lock_unlock (lock)

#elif defined GNULIB_LOCK && !defined GNULIB_REGEX_SINGLE_THREAD

# include "glthread/lock.h"

# define lock_define(name) gl_lock_define (, name)

# define lock_init(lock) glthread_lock_init (&(lock))

# define lock_fini(lock) glthread_lock_destroy (&(lock))

# define lock_lock(lock) glthread_lock_lock (&(lock))

# define lock_unlock(lock) glthread_lock_unlock (&(lock))

#elif defined GNULIB_PTHREAD && !defined GNULIB_REGEX_SINGLE_THREAD

# include <pthread.h>

# define lock_define(name) pthread_mutex_t name;

# define lock_init(lock) pthread_mutex_init (&(lock), 0)

# define lock_fini(lock) pthread_mutex_destroy (&(lock))

# define lock_lock(lock) pthread_mutex_lock (&(lock))

# define lock_unlock(lock) pthread_mutex_unlock (&(lock))

#else

# define lock_define(name)

# define lock_init(lock) 0

# define lock_fini(lock) ((void) 0)

  /* The 'dfa' avoids an "unused variable 'dfa'" warning from GCC.  */

# define lock_lock(lock) ((void) dfa)

# define lock_unlock(lock) ((void) 0)

#endif

/* In case that the system doesn't have isblank().  */

#if !defined _LIBC && ! (defined isblank || (HAVE_ISBLANK && HAVE_DECL_ISBLANK))

# define isblank(ch) ((ch) == ' ' || (ch) == '\t')

#endif

/* regex code assumes isascii has its usual numeric meaning,

   even if the portable character set uses EBCDIC encoding,

   and even if wint_t is wider than int.  */

#ifndef _LIBC

# undef isascii

# define isascii(c) (((c) & ~0x7f) == 0)

#endif

#ifdef _LIBC

# ifndef _RE_DEFINE_LOCALE_FUNCTIONS

#  define _RE_DEFINE_LOCALE_FUNCTIONS 1

#   include <locale/localeinfo.h>

#   include <locale/coll-lookup.h>

# endif

#endif

/* This is for other GNU distributions with internationalized messages.  */

#ifdef _LIBC

# include <libintl.h>

# undef gettext

# define gettext(msgid) \

  __dcgettext (_libc_intl_domainname, msgid, LC_MESSAGES)

# define gettext_noop(String) String

#else

# include "gettext.h"

#endif

/* Number of ASCII characters.  */

#define ASCII_CHARS 0x80

/* Number of single byte characters.  */

#define SBC_MAX (UCHAR_MAX + 1)

#define COLL_ELEM_LEN_MAX 8

/* The character which represents newline.  */

#define NEWLINE_CHAR '\n'

#define WIDE_NEWLINE_CHAR L'\n'

/* Use Gnulib <uchar.h> if outside glibc and not avoided by the app.  */

#if defined _LIBC || defined _REGEX_AVOID_UCHAR_H

# include <wchar.h>

# include <wctype.h>

#else

# include <uchar.h>

# undef wctype_t

# define wchar_t char32_t

# define wctype_t c32_type_test_t

#endif

#ifndef _LIBC

# undef __wctype

# undef __iswalnum

# undef __iswctype

# undef __towlower

# undef __towupper

# undef __btowc

# undef __mbrtowc

# undef __wcrtomb

# undef __regfree

# define __regfree regfree

# ifdef _REGEX_AVOID_UCHAR_H

#  define __wctype wctype

#  define __iswalnum iswalnum

#  define __iswctype iswctype

#  define __towlower towlower

#  define __towupper towupper

#  define __btowc btowc

#  define __mbrtowc mbrtowc

#  define __wcrtomb wcrtomb

# else

#  define __wctype c32_get_type_test

#  define __iswalnum c32isalnum

#  define __iswctype c32_apply_type_test

#  define __towlower c32tolower

#  define __towupper c32toupper

#  define __btowc btoc32

#  define __mbrtowc mbrtoc32

#  define __wcrtomb c32rtomb

# endif

#endif /* not _LIBC */

/* Types related to integers.  Unless protected by #ifdef _LIBC, the

   regex code should avoid exact-width types like int32_t and uint64_t

   as some non-GCC platforms lack them, an issue when this code is

   used in Gnulib.  */

#ifndef ULONG_WIDTH

# define ULONG_WIDTH REGEX_UINTEGER_WIDTH (ULONG_MAX)

/* The number of usable bits in an unsigned integer type with maximum

   value MAX, as an int expression suitable in #if.  Cover all known

   practical hosts.  This implementation exploits the fact that MAX is

   1 less than a power of 2, and merely counts the number of 1 bits in

   MAX; "COBn" means "count the number of 1 bits in the low-order n bits".  */

# define REGEX_UINTEGER_WIDTH(max) REGEX_COB128 (max)

# define REGEX_COB128(n) (REGEX_COB64 ((n) >> 31 >> 31 >> 2) + REGEX_COB64 (n))

# define REGEX_COB64(n) (REGEX_COB32 ((n) >> 31 >> 1) + REGEX_COB32 (n))

# define REGEX_COB32(n) (REGEX_COB16 ((n) >> 16) + REGEX_COB16 (n))

# define REGEX_COB16(n) (REGEX_COB8 ((n) >> 8) + REGEX_COB8 (n))

# define REGEX_COB8(n) (REGEX_COB4 ((n) >> 4) + REGEX_COB4 (n))

# define REGEX_COB4(n) (!!((n) & 8) + !!((n) & 4) + !!((n) & 2) + ((n) & 1))

# if ULONG_MAX / 2 + 1 != 1ul << (ULONG_WIDTH - 1)

#  error "ULONG_MAX out of range"

# endif

#endif

/* The type of indexes into strings.  This is signed, not size_t,

   since the API requires indexes to fit in regoff_t anyway, and using

   signed integers makes the code a bit smaller and presumably faster.

   The traditional GNU regex implementation uses int for indexes.

   The POSIX-compatible implementation uses a possibly-wider type.

   The name 'Idx' is three letters to minimize the hassle of

   reindenting a lot of regex code that formerly used 'int'.  */

typedef regoff_t Idx;

#ifdef _REGEX_LARGE_OFFSETS

# ifdef SSIZE_MAX

#  define IDX_MAX SSIZE_MAX

# else

#  define IDX_MAX ((Idx) ((size_t) -1 / 2))

# endif

#else

# define IDX_MAX INT_MAX

#endif

/* A hash value, suitable for computing hash tables.  */

typedef __re_size_t re_hashval_t;

/* An integer used to represent a set of bits.  It must be unsigned,

   and must be at least as wide as unsigned int.  */

typedef unsigned long int bitset_word_t;

/* All bits set in a bitset_word_t.  */

#define BITSET_WORD_MAX ULONG_MAX

/* Number of bits in a bitset_word_t.  */

#define BITSET_WORD_BITS ULONG_WIDTH

/* Number of bitset_word_t values in a bitset_t.  */

#define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)

typedef bitset_word_t bitset_t[BITSET_WORDS];

typedef bitset_word_t *re_bitset_ptr_t;

typedef const bitset_word_t *re_const_bitset_ptr_t;

#define PREV_WORD_CONSTRAINT 0x0001

#define PREV_NOTWORD_CONSTRAINT 0x0002

#define NEXT_WORD_CONSTRAINT 0x0004

#define NEXT_NOTWORD_CONSTRAINT 0x0008

#define PREV_NEWLINE_CONSTRAINT 0x0010

#define NEXT_NEWLINE_CONSTRAINT 0x0020

#define PREV_BEGBUF_CONSTRAINT 0x0040

#define NEXT_ENDBUF_CONSTRAINT 0x0080

#define WORD_DELIM_CONSTRAINT 0x0100

#define NOT_WORD_DELIM_CONSTRAINT 0x0200

typedef enum

{

  INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,

  WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,

  WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,

  INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,

  LINE_FIRST = PREV_NEWLINE_CONSTRAINT,

  LINE_LAST = NEXT_NEWLINE_CONSTRAINT,

  BUF_FIRST = PREV_BEGBUF_CONSTRAINT,

  BUF_LAST = NEXT_ENDBUF_CONSTRAINT,

  WORD_DELIM = WORD_DELIM_CONSTRAINT,

  NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT

} re_context_type;

typedef struct

{

  Idx alloc;

  Idx nelem;

  Idx *elems;

} re_node_set;

typedef enum

{

  NON_TYPE = 0,

  /* Node type, These are used by token, node, tree.  */

  CHARACTER = 1,

  END_OF_RE = 2,

  SIMPLE_BRACKET = 3,

  OP_BACK_REF = 4,

  OP_PERIOD = 5,

  COMPLEX_BRACKET = 6,

  OP_UTF8_PERIOD = 7,

  /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used

     when the debugger shows values of this enum type.  */

#define EPSILON_BIT 8

  OP_OPEN_SUBEXP = EPSILON_BIT | 0,

  OP_CLOSE_SUBEXP = EPSILON_BIT | 1,

  OP_ALT = EPSILON_BIT | 2,

  OP_DUP_ASTERISK = EPSILON_BIT | 3,

  ANCHOR = EPSILON_BIT | 4,

  /* Tree type, these are used only by tree. */

  CONCAT = 16,

  SUBEXP = 17,

  /* Token type, these are used only by token.  */

  OP_DUP_PLUS = 18,

  OP_DUP_QUESTION,

  OP_OPEN_BRACKET,

  OP_CLOSE_BRACKET,

  OP_CHARSET_RANGE,

  OP_OPEN_DUP_NUM,

  OP_CLOSE_DUP_NUM,

  OP_NON_MATCH_LIST,

  OP_OPEN_COLL_ELEM,

  OP_CLOSE_COLL_ELEM,

  OP_OPEN_EQUIV_CLASS,

  OP_CLOSE_EQUIV_CLASS,

  OP_OPEN_CHAR_CLASS,

  OP_CLOSE_CHAR_CLASS,

  OP_WORD,

  OP_NOTWORD,

  OP_SPACE,

  OP_NOTSPACE,

  BACK_SLASH

} re_token_type_t;

typedef struct

{

  /* Multibyte characters.  */

  wchar_t *mbchars;

#ifdef _LIBC

  /* Collating symbols.  */

  int32_t *coll_syms;

#endif

#ifdef _LIBC

  /* Equivalence classes. */

  int32_t *equiv_classes;

#endif

  /* Range expressions. */

#ifdef _LIBC

  uint32_t *range_starts;

  uint32_t *range_ends;

#else

  wchar_t *range_starts;

  wchar_t *range_ends;

#endif

  /* Character classes. */

  wctype_t *char_classes;

  /* If this character set is the non-matching list.  */

  unsigned int non_match : 1;

  /* # of multibyte characters.  */

  Idx nmbchars;

  /* # of collating symbols.  */

  Idx ncoll_syms;

  /* # of equivalence classes. */

  Idx nequiv_classes;

  /* # of range expressions. */

  Idx nranges;

  /* # of character classes. */

  Idx nchar_classes;

} re_charset_t;

typedef struct

{

  union

  {

    unsigned char c;    /* for CHARACTER */

    re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */

    re_charset_t *mbcset; /* for COMPLEX_BRACKET */

    Idx idx;      /* for BACK_REF */

    re_context_type ctx_type; /* for ANCHOR */

  } opr;

#if (__GNUC__ >= 2 || defined __clang__) && !defined __STRICT_ANSI__

  re_token_type_t type : 8;

#else

  re_token_type_t type;

#endif

  unsigned int constraint : 10; /* context constraint */

  unsigned int duplicated : 1;

  unsigned int opt_subexp : 1;

  unsigned int accept_mb : 1;

  /* These 2 bits can be moved into the union if needed (e.g. if running out

     of bits; move opr.c to opr.c.c and move the flags to opr.c.flags).  */

  unsigned int mb_partial : 1;

  unsigned int word_char : 1;

} re_token_t;

#define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)

struct re_string_t

{

  /* Indicate the raw buffer which is the original string passed as an

     argument of regexec(), re_search(), etc..  */

  const unsigned char *raw_mbs;

  /* Store the multibyte string.  In case of "case insensitive mode" like

     REG_ICASE, upper cases of the string are stored, otherwise MBS points

     the same address that RAW_MBS points.  */

  unsigned char *mbs;

  /* Store the wide character string which is corresponding to MBS.  */

  wint_t *wcs;

  Idx *offsets;

  mbstate_t cur_state;

  /* Index in RAW_MBS.  Each character mbs[i] corresponds to

     raw_mbs[raw_mbs_idx + i].  */

  Idx raw_mbs_idx;

  /* The length of the valid characters in the buffers.  */

  Idx valid_len;

  /* The corresponding number of bytes in raw_mbs array.  */

  Idx valid_raw_len;

  /* The length of the buffers MBS and WCS.  */

  Idx bufs_len;

  /* The index in MBS, which is updated by re_string_fetch_byte.  */

  Idx cur_idx;

  /* length of RAW_MBS array.  */

  Idx raw_len;

  /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN.  */

  Idx len;

  /* End of the buffer may be shorter than its length in the cases such

     as re_match_2, re_search_2.  Then, we use STOP for end of the buffer

     instead of LEN.  */

  Idx raw_stop;

  /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS.  */

  Idx stop;

  /* The context of mbs[0].  We store the context independently, since

     the context of mbs[0] may be different from raw_mbs[0], which is

     the beginning of the input string.  */

  unsigned int tip_context;

  /* The translation passed as a part of an argument of re_compile_pattern.  */

  RE_TRANSLATE_TYPE trans;

  /* Copy of re_dfa_t's word_char.  */

  re_const_bitset_ptr_t word_char;

  /* true if REG_ICASE.  */

  unsigned char icase;

  unsigned char is_utf8;

  unsigned char map_notascii;

  unsigned char mbs_allocated;

  unsigned char offsets_needed;

  unsigned char newline_anchor;

  unsigned char word_ops_used;

  int mb_cur_max;

};

typedef struct re_string_t re_string_t;

struct re_dfa_t;

typedef struct re_dfa_t re_dfa_t;

#ifndef _LIBC

# define IS_IN(libc) false

#endif

#define re_string_peek_byte(pstr, offset) \

  ((pstr)->mbs[(pstr)->cur_idx + offset])

#define re_string_fetch_byte(pstr) \

  ((pstr)->mbs[(pstr)->cur_idx++])

#define re_string_first_byte(pstr, idx) \

  ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)

#define re_string_is_single_byte_char(pstr, idx) \

  ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \

        || (pstr)->wcs[(idx) + 1] != WEOF))

#define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)

#define re_string_cur_idx(pstr) ((pstr)->cur_idx)

#define re_string_get_buffer(pstr) ((pstr)->mbs)

#define re_string_length(pstr) ((pstr)->len)

#define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])

#define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))

#define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))

#ifndef MAX

# define MAX(a,b) ((a) < (b) ? (b) : (a))

#endif

#ifndef MIN

# define MIN(a,b) ((a) < (b) ? (a) : (b))

#endif

#if defined _LIBC || HAVE_MALLOC_0_NONNULL

# define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))

#else

# define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t) + ((n) == 0)))

#endif

#define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))

#define re_free(p) free (p)

struct bin_tree_t

{

  struct bin_tree_t *parent;

  struct bin_tree_t *left;

  struct bin_tree_t *right;

  struct bin_tree_t *first;

  struct bin_tree_t *next;

  re_token_t token;

  /* 'node_idx' is the index in dfa->nodes, if 'type' == 0.

     Otherwise 'type' indicate the type of this node.  */

  Idx node_idx;

};

typedef struct bin_tree_t bin_tree_t;

#define BIN_TREE_STORAGE_SIZE \

  ((1024 - sizeof (void *)) / sizeof (bin_tree_t))

struct bin_tree_storage_t

{

  struct bin_tree_storage_t *next;

  bin_tree_t data[BIN_TREE_STORAGE_SIZE];

};

typedef struct bin_tree_storage_t bin_tree_storage_t;

#define CONTEXT_WORD 1

#define CONTEXT_NEWLINE (CONTEXT_WORD << 1)

#define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)

#define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)

#define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)

#define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)

#define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)

#define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)

#define IS_ORDINARY_CONTEXT(c) ((c) == 0)

#define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')

#define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)

#define IS_WIDE_WORD_CHAR(ch) (__iswalnum (ch) || (ch) == L'_')

#define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)

#define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \

 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \

  || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \

  || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\

  || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))

#define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \

 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \

  || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \

  || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \

  || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))

struct re_dfastate_t

{

  re_hashval_t hash;

  re_node_set nodes;

  re_node_set non_eps_nodes;

  re_node_set inveclosure;

  re_node_set *entrance_nodes;

  struct re_dfastate_t **trtable, **word_trtable;

  unsigned int context : 4;

  unsigned int halt : 1;

  /* If this state can accept "multi byte".

     Note that we refer to multibyte characters, and multi character

     collating elements as "multi byte".  */

  unsigned int accept_mb : 1;

  /* If this state has backreference node(s).  */

  unsigned int has_backref : 1;

  unsigned int has_constraint : 1;

};

typedef struct re_dfastate_t re_dfastate_t;

struct re_state_table_entry

{

  Idx num;

  Idx alloc;

  re_dfastate_t **array;

};

/* Array type used in re_sub_match_last_t and re_sub_match_top_t.  */

typedef struct

{

  Idx next_idx;

  Idx alloc;

  re_dfastate_t **array;

} state_array_t;

/* Store information about the node NODE whose type is OP_CLOSE_SUBEXP.  */

typedef struct

{

  Idx node;

  Idx str_idx; /* The position NODE match at.  */

  state_array_t path;

} re_sub_match_last_t;

/* Store information about the node NODE whose type is OP_OPEN_SUBEXP.

   And information about the node, whose type is OP_CLOSE_SUBEXP,

   corresponding to NODE is stored in LASTS.  */

typedef struct

{

  Idx str_idx;

  Idx node;

  state_array_t *path;

  Idx alasts; /* Allocation size of LASTS.  */

  Idx nlasts; /* The number of LASTS.  */

  re_sub_match_last_t **lasts;

} re_sub_match_top_t;

struct re_backref_cache_entry

{

  Idx node;

  Idx str_idx;

  Idx subexp_from;

  Idx subexp_to;

  bitset_word_t eps_reachable_subexps_map;

  char more;

};

typedef struct

{

  /* The string object corresponding to the input string.  */

  re_string_t input;

  const re_dfa_t *const dfa;

  /* EFLAGS of the argument of regexec.  */

  int eflags;

  /* Where the matching ends.  */

  Idx match_last;

  Idx last_node;

  /* The state log used by the matcher.  */

  re_dfastate_t **state_log;

  Idx state_log_top;

  /* Back reference cache.  */

  Idx nbkref_ents;

  Idx abkref_ents;

  struct re_backref_cache_entry *bkref_ents;

  int max_mb_elem_len;

  Idx nsub_tops;

  Idx asub_tops;

  re_sub_match_top_t **sub_tops;

} re_match_context_t;

typedef struct

{

  re_dfastate_t **sifted_states;

  re_dfastate_t **limited_states;

  Idx last_node;

  Idx last_str_idx;

  re_node_set limits;

} re_sift_context_t;

struct re_fail_stack_ent_t

{

  Idx idx;

  Idx node;

  regmatch_t *regs;

  re_node_set eps_via_nodes;

};

struct re_fail_stack_t

{

  Idx num;

  Idx alloc;

  struct re_fail_stack_ent_t *stack;

};

struct re_dfa_t

{

  re_token_t *nodes;

  size_t nodes_alloc;

  size_t nodes_len;

  Idx *nexts;

  Idx *org_indices;

  re_node_set *edests;

  re_node_set *eclosures;

  re_node_set *inveclosures;

  struct re_state_table_entry *state_table;

  re_dfastate_t *init_state;

  re_dfastate_t *init_state_word;

  re_dfastate_t *init_state_nl;

  re_dfastate_t *init_state_begbuf;

  bin_tree_t *str_tree;

  bin_tree_storage_t *str_tree_storage;

  re_bitset_ptr_t sb_char;

  int str_tree_storage_idx;

  /* number of subexpressions 're_nsub' is in regex_t.  */

  re_hashval_t state_hash_mask;

  Idx init_node;

  Idx nbackref; /* The number of backreference in this dfa.  */

  /* Bitmap expressing which backreference is used.  */

  bitset_word_t used_bkref_map;

  bitset_word_t completed_bkref_map;

  unsigned int has_plural_match : 1;

  /* If this dfa has "multibyte node", which is a backreference or

     a node which can accept multibyte character or multi character

     collating element.  */

  unsigned int has_mb_node : 1;

  unsigned int is_utf8 : 1;

  unsigned int map_notascii : 1;

  unsigned int word_ops_used : 1;

  int mb_cur_max;

  bitset_t word_char;

  reg_syntax_t syntax;

  Idx *subexp_map;

#ifdef DEBUG

  char* re_str;

#endif

  lock_define (lock)

};

#define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))

#define re_node_set_remove(set,id) \

  (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))

#define re_node_set_empty(p) ((p)->nelem = 0)

#define re_node_set_free(set) re_free ((set)->elems)

typedef enum

{

  SB_CHAR,

  MB_CHAR,

  EQUIV_CLASS,

  COLL_SYM,

  CHAR_CLASS

} bracket_elem_type;

typedef struct

{

  bracket_elem_type type;

  union

  {

    unsigned char ch;

    unsigned char *name;

    wchar_t wch;

  } opr;

} bracket_elem_t;

/* Functions for bitset_t operation.  */

static inline void

bitset_set (bitset_t set, Idx i)

{

  set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS;

}

static inline void

bitset_clear (bitset_t set, Idx i)

{

  set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS);

}

static inline bool

bitset_contain (const bitset_t set, Idx i)

{

  return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1;

}

static inline void

bitset_empty (bitset_t set)

{

  memset (set, '\0', sizeof (bitset_t));

}

static inline void

bitset_set_all (bitset_t set)

{

  memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS));

  if (SBC_MAX % BITSET_WORD_BITS != 0)

    set[BITSET_WORDS - 1] =

      ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1;

}

static inline void

bitset_copy (bitset_t dest, const bitset_t src)

{

  memcpy (dest, src, sizeof (bitset_t));

}

static inline void

bitset_not (bitset_t set)

{

  int bitset_i;

  for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i)

    set[bitset_i] = ~set[bitset_i];

  if (SBC_MAX % BITSET_WORD_BITS != 0)

    set[BITSET_WORDS - 1] =

      ((((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1)

       & ~set[BITSET_WORDS - 1]);

}

static inline void

bitset_merge (bitset_t dest, const bitset_t src)

{

  int bitset_i;

  for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)

    dest[bitset_i] |= src[bitset_i];

}

static inline void

bitset_mask (bitset_t dest, const bitset_t src)

{

  int bitset_i;

  for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)

    dest[bitset_i] &= src[bitset_i];

}

/* Functions for re_string.  */

static int

__attribute__ ((pure, unused))

re_string_char_size_at (const re_string_t *pstr, Idx idx)

{

  int byte_idx;

  if (pstr->mb_cur_max == 1)

    return 1;

  for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)

    if (pstr->wcs[idx + byte_idx] != WEOF)

      break;

  return byte_idx;

}

static wint_t

__attribute__ ((pure, unused))

re_string_wchar_at (const re_string_t *pstr, Idx idx)

{

  if (pstr->mb_cur_max == 1)

    return pstr->mbs[idx];

  return pstr->wcs[idx];

}

#ifdef _LIBC

# include <locale/weight.h>

#endif

static int

__attribute__ ((pure, unused))

re_string_elem_size_at (const re_string_t *pstr, Idx idx)

{

#ifdef _LIBC

  const unsigned char *p, *extra;

  const int32_t *table, *indirect;

  uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);

  if (nrules != 0)

    {

      table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);

      extra = (const unsigned char *)

  _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);

      indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,

            _NL_COLLATE_INDIRECTMB);

      p = pstr->mbs + idx;

      findidx (table, indirect, extra, &p, pstr->len - idx);

      return p - pstr->mbs - idx;

    }

#endif /* _LIBC */

  return 1;

}

#ifdef _LIBC

# if __glibc_has_attribute (__fallthrough__)

#  define FALLTHROUGH __attribute__ ((__fallthrough__))

# else

#  define FALLTHROUGH ((void) 0)

# endif

#else

# include "attribute.h"

#endif

#endif /*  _REGEX_INTERNAL_H */