Changeset 3058

Timestamp:

Apr 8, 2007, 8:51:40 PM (18 years ago)

Author:

bird

Message:

Merged in regex from glibc 2.5.

Location:

branches/libc-0.6/src/emx

Files:

• include/regex.h (modified) (12 diffs)
• src/lib/lgpl/include/config.h (modified) (3 diffs)
• src/lib/lgpl/posix/regcomp.c (modified) (81 diffs)
• src/lib/lgpl/posix/regex.c (modified) (4 diffs)
• src/lib/lgpl/posix/regex_internal.c (modified) (48 diffs)
• src/lib/lgpl/posix/regex_internal.h (modified) (17 diffs)
• src/lib/lgpl/posix/regexec.c (modified) (110 diffs)

branches/libc-0.6/src/emx/include/regex.h

@@ -1 +1 @@
 /* Definitions for data structures and routines for the regular
    expression library.
-   Copyright (C) 1985,1989-93,1995-98,2000,2001,2002,2003
+   Copyright (C) 1985,1989-93,1995-98,2000,2001,2002,2003,2005,2006
    Free Software Foundation, Inc.
    This file is part of the GNU C Library.
@@ -28 +28 @@
 #ifdef __cplusplus
 extern "C" {
-#endif
-
-/* POSIX says that <sys/types.h> must be included (by the caller) before
-   <regex.h>.  */
-
-#if !defined _POSIX_C_SOURCE && !defined _POSIX_SOURCE && defined VMS
-/* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it
-   should be there.  */
-# include <stddef.h>
 #endif
 
@@ -209 +200 @@
        | RE_CONTEXT_INVALID_OPS ))
 
-#define RE_SYNTAX_POSIX_AWK                                             \
+#define RE_SYNTAX_POSIX_AWK                                             \
   (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS              \
    | RE_INTERVALS           | RE_NO_GNU_OPS)
@@ -350 +341 @@
 
 #ifndef RE_TRANSLATE_TYPE
-# define RE_TRANSLATE_TYPE char *
+# define RE_TRANSLATE_TYPE unsigned char *
 #endif
 
 struct re_pattern_buffer
 {
-/* [[[begin pattern_buffer]]] */
-        /* Space that holds the compiled pattern.  It is declared as
-          `unsigned char *' because its elements are
-           sometimes used as array indexes.  */
+  /* Space that holds the compiled pattern.  It is declared as
+     `unsigned char *' because its elements are sometimes used as
+     array indexes.  */
   unsigned char *buffer;
 
-        /* Number of bytes to which `buffer' points.  */
+  /* Number of bytes to which `buffer' points.  */
   unsigned long int allocated;
 
-        /* Number of bytes actually used in `buffer'.  */
+  /* Number of bytes actually used in `buffer'.  */
   unsigned long int used;
 
-        /* Syntax setting with which the pattern was compiled.  */
+  /* Syntax setting with which the pattern was compiled.  */
   reg_syntax_t syntax;
 
-        /* Pointer to a fastmap, if any, otherwise zero.  re_search uses
-           the fastmap, if there is one, to skip over impossible
-           starting points for matches.  */
+  /* Pointer to a fastmap, if any, otherwise zero.  re_search uses the
+     fastmap, if there is one, to skip over impossible starting points
+     for matches.  */
   char *fastmap;
 
-        /* Either a translate table to apply to all characters before
-           comparing them, or zero for no translation.  The translation
-           is applied to a pattern when it is compiled and to a string
-           when it is matched.  */
+  /* Either a translate table to apply to all characters before
+     comparing them, or zero for no translation.  The translation is
+     applied to a pattern when it is compiled and to a string when it
+     is matched.  */
   RE_TRANSLATE_TYPE translate;
 
-        /* Number of subexpressions found by the compiler.  */
+  /* Number of subexpressions found by the compiler.  */
   size_t re_nsub;
 
-        /* Zero if this pattern cannot match the empty string, one else.
-           Well, in truth it's used only in `re_search_2', to see
-           whether or not we should use the fastmap, so we don't set
-           this absolutely perfectly; see `re_compile_fastmap' (the
-           `duplicate' case).  */
+  /* Zero if this pattern cannot match the empty string, one else.
+     Well, in truth it's used only in `re_search_2', to see whether or
+     not we should use the fastmap, so we don't set this absolutely
+     perfectly; see `re_compile_fastmap' (the `duplicate' case).  */
   unsigned can_be_null : 1;
 
-        /* If REGS_UNALLOCATED, allocate space in the `regs' structure
-             for `max (RE_NREGS, re_nsub + 1)' groups.
-           If REGS_REALLOCATE, reallocate space if necessary.
-           If REGS_FIXED, use what's there.  */
+  /* If REGS_UNALLOCATED, allocate space in the `regs' structure
+     for `max (RE_NREGS, re_nsub + 1)' groups.
+     If REGS_REALLOCATE, reallocate space if necessary.
+     If REGS_FIXED, use what's there.  */
 #define REGS_UNALLOCATED 0
 #define REGS_REALLOCATE 1
@@ -400 +389 @@
   unsigned regs_allocated : 2;
 
-        /* Set to zero when `regex_compile' compiles a pattern; set to one
-           by `re_compile_fastmap' if it updates the fastmap.  */
+  /* Set to zero when `regex_compile' compiles a pattern; set to one
+     by `re_compile_fastmap' if it updates the fastmap.  */
   unsigned fastmap_accurate : 1;
 
-        /* If set, `re_match_2' does not return information about
-           subexpressions.  */
+  /* If set, `re_match_2' does not return information about
+     subexpressions.  */
   unsigned no_sub : 1;
 
-        /* If set, a beginning-of-line anchor doesn't match at the
-           beginning of the string.  */
+  /* If set, a beginning-of-line anchor doesn't match at the beginning
+     of the string.  */
   unsigned not_bol : 1;
 
-        /* Similarly for an end-of-line anchor.  */
+  /* Similarly for an end-of-line anchor.  */
   unsigned not_eol : 1;
 
-        /* If true, an anchor at a newline matches.  */
+  /* If true, an anchor at a newline matches.  */
   unsigned newline_anchor : 1;
-
-/* [[[end pattern_buffer]]] */
 };
 
@@ -458 +445 @@
 /* Declarations for routines.  */
 
-/* To avoid duplicating every routine declaration -- once with a
-   prototype (if we are ANSI), and once without (if we aren't) -- we
-   use the following macro to declare argument types.  This
-   unfortunately clutters up the declarations a bit, but I think it's
-   worth it.  */
-
-#if __STDC__
-
-# define _RE_ARGS(args) args
-
-#else /* not __STDC__ */
-
-# define _RE_ARGS(args) ()
-#error "asdf"
-
-#endif /* not __STDC__ */
-
 /* Sets the current default syntax to SYNTAX, and return the old syntax.
    You can also simply assign to the `re_syntax_options' variable.  */
-extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax));
+extern reg_syntax_t re_set_syntax (reg_syntax_t __syntax);
 
 /* Compile the regular expression PATTERN, with length LENGTH
    and syntax given by the global `re_syntax_options', into the buffer
    BUFFER.  Return NULL if successful, and an error string if not.  */
-extern const char *re_compile_pattern
-  _RE_ARGS ((const char *pattern, size_t length,
-             struct re_pattern_buffer *buffer));
+extern const char *re_compile_pattern (const char *__pattern, size_t __length,
+                                       struct re_pattern_buffer *__buffer);
 
 
@@ -490 +459 @@
    accelerate searches.  Return 0 if successful and -2 if was an
    internal error.  */
-extern int re_compile_fastmap _RE_ARGS ((struct re_pattern_buffer *buffer));
+extern int re_compile_fastmap (struct re_pattern_buffer *__buffer);
 
 
@@ -498 +467 @@
    match, or -2 for an internal error.  Also return register
    information in REGS (if REGS and BUFFER->no_sub are nonzero).  */
-extern int re_search
-  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
-            int length, int start, int range, struct re_registers *regs));
+extern int re_search (struct re_pattern_buffer *__buffer, const char *__string,
+                      int __length, int __start, int __range,
+                      struct re_registers *__regs);
 
 
 /* Like `re_search', but search in the concatenation of STRING1 and
    STRING2.  Also, stop searching at index START + STOP.  */
-extern int re_search_2
-  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
-             int length1, const char *string2, int length2,
-             int start, int range, struct re_registers *regs, int stop));
+extern int re_search_2 (struct re_pattern_buffer *__buffer,
+                        const char *__string1, int __length1,
+                        const char *__string2, int __length2, int __start,
+                        int __range, struct re_registers *__regs, int __stop);
 
 
 /* Like `re_search', but return how many characters in STRING the regexp
    in BUFFER matched, starting at position START.  */
-extern int re_match
-  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
-             int length, int start, struct re_registers *regs));
+extern int re_match (struct re_pattern_buffer *__buffer, const char *__string,
+                     int __length, int __start, struct re_registers *__regs);
 
 
 /* Relates to `re_match' as `re_search_2' relates to `re_search'.  */
-extern int re_match_2
-  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
-             int length1, const char *string2, int length2,
-             int start, struct re_registers *regs, int stop));
+extern int re_match_2 (struct re_pattern_buffer *__buffer,
+                       const char *__string1, int __length1,
+                       const char *__string2, int __length2, int __start,
+                       struct re_registers *__regs, int __stop);
 
 
@@ -537 +505 @@
    PATTERN_BUFFER will allocate its own register data, without
    freeing the old data.  */
-extern void re_set_registers
-  _RE_ARGS ((struct re_pattern_buffer *buffer, struct re_registers *regs,
-             unsigned num_regs, regoff_t *starts, regoff_t *ends));
+extern void re_set_registers (struct re_pattern_buffer *__buffer,
+                              struct re_registers *__regs,
+                              unsigned int __num_regs,
+                              regoff_t *__starts, regoff_t *__ends);
 
 #if defined _REGEX_RE_COMP || defined _LIBC
 # ifndef _CRAY
 /* 4.2 bsd compatibility.  */
-extern char *re_comp _RE_ARGS ((const char *));
-extern int re_exec _RE_ARGS ((const char *));
+extern char *re_comp (const char *);
+extern int re_exec (const char *);
 # endif
 #endif
@@ -562 +531 @@
 /* gcc 3.1 and up support the [restrict] syntax.  */
 #ifndef __restrict_arr
-# if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)
+# if (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)) \
+     && !defined __GNUG__
 #  define __restrict_arr __restrict
 # else
@@ -570 +540 @@
 
 /* POSIX compatibility.  */
-extern int regcomp _RE_ARGS ((regex_t *__restrict __preg,
-                              const char *__restrict __pattern,
-                              int __cflags));
-
-extern int regexec _RE_ARGS ((const regex_t *__restrict __preg,
-                              const char *__restrict __string, size_t __nmatch,
-                              regmatch_t __pmatch[__restrict_arr],
-                              int __eflags));
-
-extern size_t regerror _RE_ARGS ((int __errcode, const regex_t *__preg,
-                                  char *__errbuf, size_t __errbuf_size));
-
-extern void regfree _RE_ARGS ((regex_t *__preg));
+extern int regcomp (regex_t *__restrict __preg,
+                    const char *__restrict __pattern,
+                    int __cflags);
+
+extern int regexec (const regex_t *__restrict __preg,
+                    const char *__restrict __string, size_t __nmatch,
+                    regmatch_t __pmatch[__restrict_arr],
+                    int __eflags);
+
+extern size_t regerror (int __errcode, const regex_t *__restrict __preg,
+                        char *__restrict __errbuf, size_t __errbuf_size);
+
+extern void regfree (regex_t *__preg);
 
 
@@ -590 +560 @@
 
 #endif /* regex.h */
-
-
-/*
-Local variables:
-make-backup-files: t
-version-control: t
-trim-versions-without-asking: nil
-End:
- */

branches/libc-0.6/src/emx/src/lib/lgpl/include/config.h

@@ -52 +52 @@
 #define HAVE___ARGZ_STRINGIFY 1
 #define HAVE___ARGZ_NEXT 1
+#define HAVE_STDINT_H 1
 #define HAVE_STDINT_H_WITH_UINTMAX 1
 #define HAVE_STRCASECMP 1
@@ -61 +62 @@
 #define HAVE_STDLIB_H 1
 #define HAVE_STRING_H 1
+#define HAVE_LANGINFO_H 1
 #define HAVE_LANGINFO_CODESET 1
 #define HAVE_SETLOCALE 1
@@ -73 +75 @@
 #define HAVE_WCSCOLL 0
 #define HAVE_DECL_GETC_UNLOCKED 1
+#define HAVE_STDBOOL_H 1
 
 #define STRERROR_R_CHAR_P 0

branches/libc-0.6/src/emx/src/lib/lgpl/posix/regcomp.c

@@ -1 +1 @@
 /* Extended regular expression matching and search library.
-   Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
+   Copyright (C) 2002,2003,2004,2005,2006 Free Software Foundation, Inc.
    This file is part of the GNU C Library.
    Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
@@ -20 +20 @@
 
 static reg_errcode_t re_compile_internal (regex_t *preg, const char * pattern,
-                                          int length, reg_syntax_t syntax);
+                                          size_t length, reg_syntax_t syntax);
 static void re_compile_fastmap_iter (regex_t *bufp,
                                      const re_dfastate_t *init_state,
                                      char *fastmap);
-static reg_errcode_t init_dfa (re_dfa_t *dfa, int pat_len);
-static void init_word_char (re_dfa_t *dfa);
+static reg_errcode_t init_dfa (re_dfa_t *dfa, size_t pat_len);
 #ifdef RE_ENABLE_I18N
 static void free_charset (re_charset_t *cset);
@@ -35 +34 @@
 #endif
 static reg_errcode_t analyze (regex_t *preg);
-static reg_errcode_t create_initial_state (re_dfa_t *dfa);
 static reg_errcode_t preorder (bin_tree_t *root,
                                reg_errcode_t (fn (void *, bin_tree_t *)),
@@ -49 +47 @@
 static reg_errcode_t calc_next (void *extra, bin_tree_t *node);
 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node);
-static reg_errcode_t duplicate_node_closure (re_dfa_t *dfa, int top_org_node,
-                                             int top_clone_node, int root_node,
-                                             unsigned int constraint);
-static reg_errcode_t duplicate_node (int *new_idx, re_dfa_t *dfa, int org_idx,
-                                     unsigned int constraint);
-static int search_duplicated_node (re_dfa_t *dfa, int org_node,
+static int duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint);
+static int search_duplicated_node (const re_dfa_t *dfa, int org_node,
                                    unsigned int constraint);
 static reg_errcode_t calc_eclosure (re_dfa_t *dfa);
@@ -62 +56 @@
 static int fetch_number (re_string_t *input, re_token_t *token,
                          reg_syntax_t syntax);
-static void fetch_token (re_token_t *result, re_string_t *input,
-                         reg_syntax_t syntax);
 static int peek_token (re_token_t *token, re_string_t *input,
-                        reg_syntax_t syntax);
-static int peek_token_bracket (re_token_t *token, re_string_t *input,
-                               reg_syntax_t syntax);
+                        reg_syntax_t syntax) internal_function;
 static bin_tree_t *parse (re_string_t *regexp, regex_t *preg,
                           reg_syntax_t syntax, reg_errcode_t *err);
@@ -97 +87 @@
                                           re_string_t *regexp,
                                           re_token_t *token);
-#ifndef _LIBC
-# ifdef RE_ENABLE_I18N
-static reg_errcode_t build_range_exp (re_bitset_ptr_t sbcset,
-                                      re_charset_t *mbcset, int *range_alloc,
-                                      bracket_elem_t *start_elem,
-                                      bracket_elem_t *end_elem);
-static reg_errcode_t build_collating_symbol (re_bitset_ptr_t sbcset,
-                                             re_charset_t *mbcset,
-                                             int *coll_sym_alloc,
-                                             const unsigned char *name);
-# else /* not RE_ENABLE_I18N */
-static reg_errcode_t build_range_exp (re_bitset_ptr_t sbcset,
-                                      bracket_elem_t *start_elem,
-                                      bracket_elem_t *end_elem);
-static reg_errcode_t build_collating_symbol (re_bitset_ptr_t sbcset,
-                                             const unsigned char *name);
-# endif /* not RE_ENABLE_I18N */
-#endif /* not _LIBC */
-#ifdef RE_ENABLE_I18N
-static reg_errcode_t build_equiv_class (re_bitset_ptr_t sbcset,
+#ifdef RE_ENABLE_I18N
+static reg_errcode_t build_equiv_class (bitset_t sbcset,
                                         re_charset_t *mbcset,
                                         int *equiv_class_alloc,
                                         const unsigned char *name);
-static reg_errcode_t build_charclass (unsigned RE_TRANSLATE_TYPE trans,
-                                      re_bitset_ptr_t sbcset,
+static reg_errcode_t build_charclass (RE_TRANSLATE_TYPE trans,
+                                      bitset_t sbcset,
                                       re_charset_t *mbcset,
                                       int *char_class_alloc,
@@ -127 +99 @@
                                       reg_syntax_t syntax);
 #else  /* not RE_ENABLE_I18N */
-static reg_errcode_t build_equiv_class (re_bitset_ptr_t sbcset,
+static reg_errcode_t build_equiv_class (bitset_t sbcset,
                                         const unsigned char *name);
-static reg_errcode_t build_charclass (unsigned RE_TRANSLATE_TYPE trans,
-                                      re_bitset_ptr_t sbcset,
+static reg_errcode_t build_charclass (RE_TRANSLATE_TYPE trans,
+                                      bitset_t sbcset,
                                       const unsigned char *class_name,
                                       reg_syntax_t syntax);
 #endif /* not RE_ENABLE_I18N */
 static bin_tree_t *build_charclass_op (re_dfa_t *dfa,
-                                       unsigned RE_TRANSLATE_TYPE trans,
+                                       RE_TRANSLATE_TYPE trans,
                                        const unsigned char *class_name,
                                        const unsigned char *extra,
@@ -330 +302 @@
 
 static void
-re_compile_fastmap_iter (bufp, init_state, fastmap)
-     regex_t *bufp;
-     const re_dfastate_t *init_state;
-     char *fastmap;
+re_compile_fastmap_iter (regex_t *bufp, const re_dfastate_t *init_state,
+                         char *fastmap)
 {
   re_dfa_t *dfa = (re_dfa_t *) bufp->buffer;
@@ -359 +329 @@
                      && dfa->nodes[node].mb_partial)
                 *p++ = dfa->nodes[node].opr.c;
-              memset (&state, 0, sizeof (state));
+              memset (&state, '\0', sizeof (state));
               if (mbrtowc (&wc, (const char *) buf, p - buf,
                            &state) == p - buf
@@ -370 +340 @@
       else if (type == SIMPLE_BRACKET)
         {
-          int i, j, ch;
-          for (i = 0, ch = 0; i < BITSET_UINTS; ++i)
-            for (j = 0; j < UINT_BITS; ++j, ++ch)
-              if (dfa->nodes[node].opr.sbcset[i] & (1 << j))
-                re_set_fastmap (fastmap, icase, ch);
+          int i, ch;
+          for (i = 0, ch = 0; i < BITSET_WORDS; ++i)
+            {
+              int j;
+              bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
+              for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
+                if (w & ((bitset_word_t) 1 << j))
+                  re_set_fastmap (fastmap, icase, ch);
+            }
         }
 #ifdef RE_ENABLE_I18N
@@ -393 +367 @@
                           'b' since 'b' is the only collation element
                           which starts from 'b'.  */
-                  int j, ch;
                   const int32_t *table = (const int32_t *)
                     _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
-                  for (i = 0, ch = 0; i < BITSET_UINTS; ++i)
-                    for (j = 0; j < UINT_BITS; ++j, ++ch)
-                      if (table[ch] < 0)
-                        re_set_fastmap (fastmap, icase, ch);
+                  for (i = 0; i < SBC_MAX; ++i)
+                    if (table[i] < 0)
+                      re_set_fastmap (fastmap, icase, i);
                 }
 # else
@@ -419 +391 @@
                   if (__wcrtomb (buf, towlower (cset->mbchars[i]), &state)
                       != (size_t) -1)
-                  re_set_fastmap (fastmap, 0, *(unsigned char *) buf);
+                    re_set_fastmap (fastmap, 0, *(unsigned char *) buf);
                 }
             }
@@ -540 +512 @@
 _STD(regerror) (errcode, preg, errbuf, errbuf_size)
     int errcode;
-    const regex_t *preg;
-    char *errbuf;
+    const regex_t *__restrict preg;
+    char *__restrict errbuf;
     size_t errbuf_size;
 {
@@ -587 +559 @@
    it the same all the time.  UTF-8 is the preferred encoding so this is
    a worthwhile optimization.  */
-static const bitset utf8_sb_map =
+static const bitset_t utf8_sb_map =
 {
   /* Set the first 128 bits.  */
-# if UINT_MAX == 0xffffffff
-  0xffffffff, 0xffffffff, 0xffffffff, 0xffffffff
-# else
-#  error "Add case for new unsigned int size"
-# endif
+  [0 ... 0x80 / BITSET_WORD_BITS - 1] = BITSET_WORD_MAX
 };
 #endif
@@ -745 +713 @@
 
 static reg_errcode_t
-re_compile_internal (preg, pattern, length, syntax)
-     regex_t *preg;
-     const char * pattern;
-     int length;
-     reg_syntax_t syntax;
+re_compile_internal (regex_t *preg, const char * pattern, size_t length,
+                     reg_syntax_t syntax)
 {
   reg_errcode_t err = REG_NOERROR;
@@ -780 +745 @@
   preg->used = sizeof (re_dfa_t);
 
-  /* __libc_lock_init (dfa->lock); - why init before memsetting the whole thing? */
-
   err = init_dfa (dfa, length);
   if (BE (err != REG_NOERROR, 0))
@@ -790 +753 @@
       return err;
     }
-  __libc_lock_init (dfa->lock); /* bird */
-
 #ifdef DEBUG
+  /* Note: length+1 will not overflow since it is checked in init_dfa.  */
   dfa->re_str = re_malloc (char, length + 1);
   strncpy (dfa->re_str, pattern, length + 1);
 #endif
+
+  __libc_lock_init (dfa->lock);
 
   err = re_string_construct (&regexp, pattern, length, preg->translate,
@@ -848 +812 @@
 
 static reg_errcode_t
-init_dfa (dfa, pat_len)
-     re_dfa_t *dfa;
-     int pat_len;
-{
-  int table_size;
+init_dfa (re_dfa_t *dfa, size_t pat_len)
+{
+  unsigned int table_size;
 #ifndef _LIBC
   char *codeset_name;
@@ -862 +824 @@
   dfa->str_tree_storage_idx = BIN_TREE_STORAGE_SIZE;
 
+  /* Avoid overflows.  */
+  if (pat_len == SIZE_MAX)
+    return REG_ESPACE;
+
   dfa->nodes_alloc = pat_len + 1;
   dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc);
 
-  dfa->states_alloc = pat_len + 1;
-
   /*  table_size = 2 ^ ceil(log pat_len) */
-  for (table_size = 1; table_size > 0; table_size <<= 1)
+  for (table_size = 1; ; table_size <<= 1)
     if (table_size > pat_len)
       break;
@@ -915 +879 @@
           int i, j, ch;
 
-          dfa->sb_char = (re_bitset_ptr_t) calloc (sizeof (bitset), 1);
+          dfa->sb_char = (re_bitset_ptr_t) calloc (sizeof (bitset_t), 1);
           if (BE (dfa->sb_char == NULL, 0))
             return REG_ESPACE;
 
-          /* Clear all bits by, then set those corresponding to single
-             byte chars.  */
-          bitset_empty (dfa->sb_char);
-
-          for (i = 0, ch = 0; i < BITSET_UINTS; ++i)
-            for (j = 0; j < UINT_BITS; ++j, ++ch)
+          /* Set the bits corresponding to single byte chars.  */
+          for (i = 0, ch = 0; i < BITSET_WORDS; ++i)
+            for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
               {
                 wint_t wch = __btowc (ch);
                 if (wch != WEOF)
-                  dfa->sb_char[i] |= 1 << j;
-# if !defined (_LIBC) && !defined (__INNOTEK_LIBC__)
-                if (isascii (ch) && wch != (wchar_t) ch)
+                  dfa->sb_char[i] |= (bitset_word_t) 1 << j;
+# if !defined (_LIBC)
+                if (isascii (ch) && wch != ch)
                   dfa->map_notascii = 1;
 # endif
@@ -948 +909 @@
 
 static void
-init_word_char (dfa)
-     re_dfa_t *dfa;
+internal_function
+init_word_char (re_dfa_t *dfa)
 {
   int i, j, ch;
   dfa->word_ops_used = 1;
-  for (i = 0, ch = 0; i < BITSET_UINTS; ++i)
-    for (j = 0; j < UINT_BITS; ++j, ++ch)
+  for (i = 0, ch = 0; i < BITSET_WORDS; ++i)
+    for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
       if (isalnum (ch) || ch == '_')
-        dfa->word_char[i] |= 1 << j;
+        dfa->word_char[i] |= (bitset_word_t) 1 << j;
 }
 
@@ -962 +923 @@
 
 static void
-free_workarea_compile (preg)
-     regex_t *preg;
+free_workarea_compile (regex_t *preg)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -982 +942 @@
 
 static reg_errcode_t
-create_initial_state (dfa)
-     re_dfa_t *dfa;
+create_initial_state (re_dfa_t *dfa)
 {
   int first, i;
@@ -1066 +1025 @@
 
 static void
-optimize_utf8 (dfa)
-     re_dfa_t *dfa;
+optimize_utf8 (re_dfa_t *dfa)
 {
   int node, i, mb_chars = 0, has_period = 0;
@@ -1104 +1062 @@
         return;
       case SIMPLE_BRACKET:
-        /* Just double check.  */
-        for (i = 0x80 / UINT_BITS; i < BITSET_UINTS; ++i)
+        /* Just double check.  The non-ASCII range starts at 0x80.  */
+        assert (0x80 % BITSET_WORD_BITS == 0);
+        for (i = 0x80 / BITSET_WORD_BITS; i < BITSET_WORDS; ++i)
           if (dfa->nodes[node].opr.sbcset[i])
             return;
@@ -1135 +1094 @@
 
 static reg_errcode_t
-analyze (preg)
-     regex_t *preg;
+analyze (regex_t *preg)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -1199 +1157 @@
    some hairy code in these two functions.  */
 static reg_errcode_t
-postorder (root, fn, extra)
-     bin_tree_t *root;
-     reg_errcode_t (fn (void *, bin_tree_t *));
-     void *extra;
+postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
+           void *extra)
 {
   bin_tree_t *node, *prev;
@@ -1233 +1189 @@
 
 static reg_errcode_t
-preorder (root, fn, extra)
-     bin_tree_t *root;
-     reg_errcode_t (fn (void *, bin_tree_t *));
-     void *extra;
+preorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
+          void *extra)
 {
   bin_tree_t *node;
@@ -1268 +1222 @@
    backreferences as well.  Requires a preorder visit.  */
 static reg_errcode_t
-optimize_subexps (extra, node)
-     void *extra;
-     bin_tree_t *node;
+optimize_subexps (void *extra, bin_tree_t *node)
 {
   re_dfa_t *dfa = (re_dfa_t *) extra;
@@ -1291 +1243 @@
 
       dfa->subexp_map[other_idx] = dfa->subexp_map[node->token.opr.idx];
-      if (other_idx < 8 * sizeof (dfa->used_bkref_map))
-        dfa->used_bkref_map &= ~(1 << other_idx);
+      if (other_idx < BITSET_WORD_BITS)
+          dfa->used_bkref_map &= ~((bitset_word_t) 1 << other_idx);
     }
 
@@ -1301 +1253 @@
    of OP_OPEN_SUBEXP, the body of the SUBEXP (if any) and OP_CLOSE_SUBEXP.  */
 static reg_errcode_t
-lower_subexps (extra, node)
-     void *extra;
-     bin_tree_t *node;
+lower_subexps (void *extra, bin_tree_t *node)
 {
   regex_t *preg = (regex_t *) extra;
@@ -1325 +1275 @@
 
 static bin_tree_t *
-lower_subexp (err, preg, node)
-     reg_errcode_t *err;
-     regex_t *preg;
-     bin_tree_t *node;
+lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -1340 +1287 @@
          this case is the sed "script" /\(\)/x.  */
       && node->left != NULL
-      && (node->token.opr.idx >= 8 * sizeof (dfa->used_bkref_map)
-          || !(dfa->used_bkref_map & (1 << node->token.opr.idx))))
+      && (node->token.opr.idx >= BITSET_WORD_BITS
+          || !(dfa->used_bkref_map
+               & ((bitset_word_t) 1 << node->token.opr.idx))))
     return node->left;
 
@@ -1364 +1312 @@
    nodes.  Requires a postorder visit.  */
 static reg_errcode_t
-calc_first (extra, node)
-     void *extra;
-     bin_tree_t *node;
+calc_first (void *extra, bin_tree_t *node)
 {
   re_dfa_t *dfa = (re_dfa_t *) extra;
@@ -1386 +1332 @@
 /* Pass 2: compute NEXT on the tree.  Preorder visit.  */
 static reg_errcode_t
-calc_next (extra, node)
-     void *extra;
-     bin_tree_t *node;
+calc_next (void *extra, bin_tree_t *node)
 {
   switch (node->token.type)
@@ -1411 +1355 @@
 /* Pass 3: link all DFA nodes to their NEXT node (any order will do).  */
 static reg_errcode_t
-link_nfa_nodes (extra, node)
-     void *extra;
-     bin_tree_t *node;
+link_nfa_nodes (void *extra, bin_tree_t *node)
 {
   re_dfa_t *dfa = (re_dfa_t *) extra;
@@ -1473 +1415 @@
 
 static reg_errcode_t
-duplicate_node_closure (dfa, top_org_node, top_clone_node, root_node,
-                        init_constraint)
-     re_dfa_t *dfa;
-     int top_org_node, top_clone_node, root_node;
-     unsigned int init_constraint;
-{
-  reg_errcode_t err;
+internal_function
+duplicate_node_closure (re_dfa_t *dfa, int top_org_node, int top_clone_node,
+                        int root_node, unsigned int init_constraint)
+{
   int org_node, clone_node, ret;
   unsigned int constraint = init_constraint;
@@ -1493 +1432 @@
           org_dest = dfa->nexts[org_node];
           re_node_set_empty (dfa->edests + clone_node);
-          err = duplicate_node (&clone_dest, dfa, org_dest, constraint);
-          if (BE (err != REG_NOERROR, 0))
-            return err;
+          clone_dest = duplicate_node (dfa, org_dest, constraint);
+          if (BE (clone_dest == -1, 0))
+            return REG_ESPACE;
           dfa->nexts[clone_node] = dfa->nexts[org_node];
           ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);
@@ -1531 +1470 @@
               constraint |= dfa->nodes[org_node].opr.ctx_type;
             }
-          err = duplicate_node (&clone_dest, dfa, org_dest, constraint);
-          if (BE (err != REG_NOERROR, 0))
-            return err;
+          clone_dest = duplicate_node (dfa, org_dest, constraint);
+          if (BE (clone_dest == -1, 0))
+            return REG_ESPACE;
           ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);
           if (BE (ret < 0, 0))
@@ -1549 +1488 @@
             {
               /* There are no such a duplicated node, create a new one.  */
-              err = duplicate_node (&clone_dest, dfa, org_dest, constraint);
-              if (BE (err != REG_NOERROR, 0))
-                return err;
+              reg_errcode_t err;
+              clone_dest = duplicate_node (dfa, org_dest, constraint);
+              if (BE (clone_dest == -1, 0))
+                return REG_ESPACE;
               ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);
               if (BE (ret < 0, 0))
@@ -1570 +1510 @@
 
           org_dest = dfa->edests[org_node].elems[1];
-          err = duplicate_node (&clone_dest, dfa, org_dest, constraint);
-          if (BE (err != REG_NOERROR, 0))
-            return err;
+          clone_dest = duplicate_node (dfa, org_dest, constraint);
+          if (BE (clone_dest == -1, 0))
+            return REG_ESPACE;
           ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);
           if (BE (ret < 0, 0))
@@ -1587 +1527 @@
 
 static int
-search_duplicated_node (dfa, org_node, constraint)
-     re_dfa_t *dfa;
-     int org_node;
-     unsigned int constraint;
+search_duplicated_node (const re_dfa_t *dfa, int org_node,
+                        unsigned int constraint)
 {
   int idx;
@@ -1603 +1541 @@
 
 /* Duplicate the node whose index is ORG_IDX and set the constraint CONSTRAINT.
-   The new index will be stored in NEW_IDX and return REG_NOERROR if succeeded,
-   otherwise return the error code.  */
+   Return the index of the new node, or -1 if insufficient storage is
+   available.  */
+
+static int
+duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint)
+{
+  int dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]);
+  if (BE (dup_idx != -1, 1))
+    {
+      dfa->nodes[dup_idx].constraint = constraint;
+      if (dfa->nodes[org_idx].type == ANCHOR)
+        dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].opr.ctx_type;
+      dfa->nodes[dup_idx].duplicated = 1;
+
+      /* Store the index of the original node.  */
+      dfa->org_indices[dup_idx] = org_idx;
+    }
+  return dup_idx;
+}
 
 static reg_errcode_t
-duplicate_node (new_idx, dfa, org_idx, constraint)
-     re_dfa_t *dfa;
-     int *new_idx, org_idx;
-     unsigned int constraint;
-{
-  int dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]);
-  if (BE (dup_idx == -1, 0))
-    return REG_ESPACE;
-  dfa->nodes[dup_idx].constraint = constraint;
-  if (dfa->nodes[org_idx].type == ANCHOR)
-    dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].opr.ctx_type;
-  dfa->nodes[dup_idx].duplicated = 1;
-
-  /* Store the index of the original node.  */
-  dfa->org_indices[dup_idx] = org_idx;
-  *new_idx = dup_idx;
-  return REG_NOERROR;
-}
-
-static reg_errcode_t
-calc_inveclosure (dfa)
-     re_dfa_t *dfa;
+calc_inveclosure (re_dfa_t *dfa)
 {
   int src, idx, ret;
@@ -1651 +1585 @@
 
 static reg_errcode_t
-calc_eclosure (dfa)
-     re_dfa_t *dfa;
+calc_eclosure (re_dfa_t *dfa)
 {
   int node_idx, incomplete;
@@ -1696 +1629 @@
 
 static reg_errcode_t
-calc_eclosure_iter (new_set, dfa, node, root)
-     re_node_set *new_set;
-     re_dfa_t *dfa;
-     int node, root;
+calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, int node, int root)
 {
   reg_errcode_t err;
@@ -1722 +1652 @@
       && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)
     {
-      int org_node, cur_node;
-      org_node = cur_node = node;
       err = duplicate_node_closure (dfa, node, node, node, constraint);
       if (BE (err != REG_NOERROR, 0))
@@ -1780 +1708 @@
 
 static void
-fetch_token (result, input, syntax)
-     re_token_t *result;
-     re_string_t *input;
-     reg_syntax_t syntax;
+internal_function
+fetch_token (re_token_t *result, re_string_t *input, reg_syntax_t syntax)
 {
   re_string_skip_bytes (input, peek_token (result, input, syntax));
@@ -1792 +1718 @@
 
 static int
-peek_token (token, input, syntax)
-     re_token_t *token;
-     re_string_t *input;
-     reg_syntax_t syntax;
+internal_function
+peek_token (re_token_t *token, re_string_t *input, reg_syntax_t syntax)
 {
   unsigned char c;
@@ -2033 +1957 @@
 
 static int
-peek_token_bracket (token, input, syntax)
-     re_token_t *token;
-     re_string_t *input;
-     reg_syntax_t syntax;
+internal_function
+peek_token_bracket (re_token_t *token, re_string_t *input, reg_syntax_t syntax)
 {
   unsigned char c;
@@ -2133 +2055 @@
 
 static bin_tree_t *
-parse (regexp, preg, syntax, err)
-     re_string_t *regexp;
-     regex_t *preg;
-     reg_syntax_t syntax;
-     reg_errcode_t *err;
+parse (re_string_t *regexp, regex_t *preg, reg_syntax_t syntax,
+       reg_errcode_t *err)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -2170 +2089 @@
 
 static bin_tree_t *
-parse_reg_exp (regexp, preg, token, syntax, nest, err)
-     re_string_t *regexp;
-     regex_t *preg;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     int nest;
-     reg_errcode_t *err;
+parse_reg_exp (re_string_t *regexp, regex_t *preg, re_token_t *token,
+               reg_syntax_t syntax, int nest, reg_errcode_t *err)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -2216 +2130 @@
 
 static bin_tree_t *
-parse_branch (regexp, preg, token, syntax, nest, err)
-     re_string_t *regexp;
-     regex_t *preg;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     int nest;
-     reg_errcode_t *err;
+parse_branch (re_string_t *regexp, regex_t *preg, re_token_t *token,
+              reg_syntax_t syntax, int nest, reg_errcode_t *err)
 {
   bin_tree_t *tree, *exp;
@@ -2261 +2170 @@
 
 static bin_tree_t *
-parse_expression (regexp, preg, token, syntax, nest, err)
-     re_string_t *regexp;
-     regex_t *preg;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     int nest;
-     reg_errcode_t *err;
+parse_expression (re_string_t *regexp, regex_t *preg, re_token_t *token,
+                  reg_syntax_t syntax, int nest, reg_errcode_t *err)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -2482 +2386 @@
 
 static bin_tree_t *
-parse_sub_exp (regexp, preg, token, syntax, nest, err)
-     re_string_t *regexp;
-     regex_t *preg;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     int nest;
-     reg_errcode_t *err;
+parse_sub_exp (re_string_t *regexp, regex_t *preg, re_token_t *token,
+               reg_syntax_t syntax, int nest, reg_errcode_t *err)
 {
   re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
@@ -2508 +2407 @@
         return NULL;
     }
-  dfa->completed_bkref_map |= 1 << cur_nsub;
+
+  if (cur_nsub <= '9' - '1')
+    dfa->completed_bkref_map |= 1 << cur_nsub;
 
   tree = create_tree (dfa, tree, NULL, SUBEXP);
@@ -2523 +2424 @@
 
 static bin_tree_t *
-parse_dup_op (elem, regexp, dfa, token, syntax, err)
-     bin_tree_t *elem;
-     re_string_t *regexp;
-     re_dfa_t *dfa;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     reg_errcode_t *err;
+parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa,
+              re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err)
 {
   bin_tree_t *tree = NULL, *old_tree = NULL;
@@ -2668 +2564 @@
 
 static reg_errcode_t
+internal_function
 # ifdef RE_ENABLE_I18N
-build_range_exp (sbcset, mbcset, range_alloc, start_elem, end_elem)
-     re_charset_t *mbcset;
-     int *range_alloc;
+build_range_exp (bitset_t sbcset, re_charset_t *mbcset, int *range_alloc,
+                 bracket_elem_t *start_elem, bracket_elem_t *end_elem, reg_syntax_t syntax) /* bird: syntax */
 # else /* not RE_ENABLE_I18N */
-build_range_exp (sbcset, start_elem, end_elem)
+build_range_exp (bitset_t sbcset, bracket_elem_t *start_elem,
+                 bracket_elem_t *end_elem, reg_syntax_t syntax)                             /* bird: syntax */
 # endif /* not RE_ENABLE_I18N */
-     re_bitset_ptr_t sbcset;
-     bracket_elem_t *start_elem, *end_elem;
 {
   unsigned int start_ch, end_ch;
@@ -2695 +2590 @@
 # ifdef RE_ENABLE_I18N
   {
-    wint_t wc, start_wc, end_wc;
+    wchar_t wc;
+    wint_t start_wc;
+    wint_t end_wc;
     wchar_t cmp_buf[6] = {L'\0', L'\0', L'\0', L'\0', L'\0', L'\0'};
 
@@ -2712 +2609 @@
     cmp_buf[0] = start_wc;
     cmp_buf[4] = end_wc;
-    if (wcscoll (cmp_buf, cmp_buf + 4) > 0)
+    if ((syntax & RE_NO_EMPTY_RANGES) && wcscoll (cmp_buf, cmp_buf + 4) > 0) /* bird: RE_NO_EMPTY_RANGES */
       return REG_ERANGE;
 
@@ -2769 +2666 @@
                  : 0));
     if (start_ch > end_ch)
-      return REG_ERANGE;
+      return (syntax & RE_NO_EMPTY_RANGES) ? REG_ERANGE : REG_NOERROR; /* bird: added RE_NO_EMPTY_RANGES check. */
+
     /* Build the table for single byte characters.  */
     for (ch = 0; ch < SBC_MAX; ++ch)
@@ -2788 +2686 @@
 
 static reg_errcode_t
+internal_function
 # ifdef RE_ENABLE_I18N
-build_collating_symbol (sbcset, mbcset, coll_sym_alloc, name)
-     re_charset_t *mbcset;
-     int *coll_sym_alloc;
+build_collating_symbol (bitset_t sbcset, re_charset_t *mbcset,
+                        int *coll_sym_alloc, const unsigned char *name)
 # else /* not RE_ENABLE_I18N */
-build_collating_symbol (sbcset, name)
+build_collating_symbol (bitset_t sbcset, const unsigned char *name)
 # endif /* not RE_ENABLE_I18N */
-     re_bitset_ptr_t sbcset;
-     const unsigned char *name;
 {
   size_t name_len = strlen ((const char *) name);
@@ -2813 +2709 @@
 
 static bin_tree_t *
-parse_bracket_exp (regexp, dfa, token, syntax, err)
-     re_string_t *regexp;
-     re_dfa_t *dfa;
-     re_token_t *token;
-     reg_syntax_t syntax;
-     reg_errcode_t *err;
+parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token,
+                   reg_syntax_t syntax, reg_errcode_t *err)
 {
 #ifdef _LIBC
@@ -2840 +2732 @@
       int32_t hash = elem_hash ((const char *) name, name_len);
       int32_t elem = hash % table_size;
-      int32_t second = hash % (table_size - 2);
-      while (symb_table[2 * elem] != 0)
-        {
-          /* First compare the hashing value.  */
-          if (symb_table[2 * elem] == hash
-              /* Compare the length of the name.  */
-              && name_len == extra[symb_table[2 * elem + 1]]
-              /* Compare the name.  */
-              && memcmp (name, &extra[symb_table[2 * elem + 1] + 1],
-                         name_len) == 0)
+      if (symb_table[2 * elem] != 0)
+        {
+          int32_t second = hash % (table_size - 2) + 1;
+
+          do
             {
-              /* Yep, this is the entry.  */
-              break;
+              /* First compare the hashing value.  */
+              if (symb_table[2 * elem] == hash
+                  /* Compare the length of the name.  */
+                  && name_len == extra[symb_table[2 * elem + 1]]
+                  /* Compare the name.  */
+                  && memcmp (name, &extra[symb_table[2 * elem + 1] + 1],
+                             name_len) == 0)
+                {
+                  /* Yep, this is the entry.  */
+                  break;
+                }
+
+              /* Next entry.  */
+              elem += second;
             }
-
-          /* Next entry.  */
-          elem += second;
+          while (symb_table[2 * elem] != 0);
         }
       return elem;
@@ -2938 +2835 @@
          re_charset_t *mbcset;
          int *range_alloc;
-         re_bitset_ptr_t sbcset;
+         bitset_t sbcset;
          bracket_elem_t *start_elem, *end_elem;
     {
@@ -3021 +2918 @@
          re_charset_t *mbcset;
          int *coll_sym_alloc;
-         re_bitset_ptr_t sbcset;
+         bitset_t sbcset;
          const unsigned char *name;
     {
@@ -3098 +2995 @@
       if (MB_CUR_MAX > 1)
       */
-        collseqwc = _NL_CURRENT (LC_COLLATE, _NL_COLLATE_COLLSEQWC);
+      collseqwc = _NL_CURRENT (LC_COLLATE, _NL_COLLATE_COLLSEQWC);
       table_size = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_SYMB_HASH_SIZEMB);
       symb_table = (const int32_t *) _NL_CURRENT (LC_COLLATE,
@@ -3106 +3003 @@
     }
 #endif
-  sbcset = (re_bitset_ptr_t) calloc (sizeof (unsigned int), BITSET_UINTS);
+  sbcset = (re_bitset_ptr_t) calloc (sizeof (bitset_t), 1);
 #ifdef RE_ENABLE_I18N
   mbcset = (re_charset_t *) calloc (sizeof (re_charset_t), 1);
@@ -3217 +3114 @@
           *err = build_range_exp (sbcset,
                                   dfa->mb_cur_max > 1 ? mbcset : NULL,
-                                  &range_alloc, &start_elem, &end_elem);
+                                  &range_alloc, &start_elem, &end_elem, syntax);
 # else
-          *err = build_range_exp (sbcset, &start_elem, &end_elem);
+          *err = build_range_exp (sbcset, &start_elem, &end_elem, syntax);
 # endif
 #endif /* RE_ENABLE_I18N */
@@ -3316 +3213 @@
       if (BE (mbc_tree == NULL, 0))
         goto parse_bracket_exp_espace;
-      for (sbc_idx = 0; sbc_idx < BITSET_UINTS; ++sbc_idx)
+      for (sbc_idx = 0; sbc_idx < BITSET_WORDS; ++sbc_idx)
         if (sbcset[sbc_idx])
           break;
       /* If there are no bits set in sbcset, there is no point
          of having both SIMPLE_BRACKET and COMPLEX_BRACKET.  */
-      if (sbc_idx < BITSET_UINTS)
+      if (sbc_idx < BITSET_WORDS)
         {
           /* Build a tree for simple bracket.  */
@@ -3369 +3266 @@
 
 static reg_errcode_t
-parse_bracket_element (elem, regexp, token, token_len, dfa, syntax,
-                       accept_hyphen)
-     bracket_elem_t *elem;
-     re_string_t *regexp;
-     re_token_t *token;
-     int token_len;
-     re_dfa_t *dfa;
-     reg_syntax_t syntax;
-     int accept_hyphen;
+parse_bracket_element (bracket_elem_t *elem, re_string_t *regexp,
+                       re_token_t *token, int token_len, re_dfa_t *dfa,
+                       reg_syntax_t syntax, int accept_hyphen)
 {
 #ifdef RE_ENABLE_I18N
@@ -3415 +3306 @@
 
 static reg_errcode_t
-parse_bracket_symbol (elem, regexp, token)
-     bracket_elem_t *elem;
-     re_string_t *regexp;
-     re_token_t *token;
+parse_bracket_symbol (bracket_elem_t *elem, re_string_t *regexp,
+                      re_token_t *token)
 {
   unsigned char ch, delim = token->opr.c;
@@ -3465 +3354 @@
 static reg_errcode_t
 #ifdef RE_ENABLE_I18N
-build_equiv_class (sbcset, mbcset, equiv_class_alloc, name)
-     re_charset_t *mbcset;
-     int *equiv_class_alloc;
+build_equiv_class (bitset_t sbcset, re_charset_t *mbcset,
+                   int *equiv_class_alloc, const unsigned char *name)
 #else /* not RE_ENABLE_I18N */
-build_equiv_class (sbcset, name)
+build_equiv_class (bitset_t sbcset, const unsigned char *name)
 #endif /* not RE_ENABLE_I18N */
-     re_bitset_ptr_t sbcset;
-     const unsigned char *name;
-{
-#if defined _LIBC
+{
+#ifdef _LIBC
   uint32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
   if (nrules != 0)
@@ -3560 +3446 @@
 static reg_errcode_t
 #ifdef RE_ENABLE_I18N
-build_charclass (trans, sbcset, mbcset, char_class_alloc, class_name, syntax)
-     re_charset_t *mbcset;
-     int *char_class_alloc;
+build_charclass (RE_TRANSLATE_TYPE trans, bitset_t sbcset,
+                 re_charset_t *mbcset, int *char_class_alloc,
+                 const unsigned char *class_name, reg_syntax_t syntax)
 #else /* not RE_ENABLE_I18N */
-build_charclass (trans, sbcset, class_name, syntax)
+build_charclass (RE_TRANSLATE_TYPE trans, bitset_t sbcset,
+                 const unsigned char *class_name, reg_syntax_t syntax)
 #endif /* not RE_ENABLE_I18N */
-     unsigned RE_TRANSLATE_TYPE trans;
-     re_bitset_ptr_t sbcset;
-     const unsigned char *class_name;
-     reg_syntax_t syntax;
 {
   int i;
@@ -3599 +3482 @@
 
 #define BUILD_CHARCLASS_LOOP(ctype_func)        \
-    for (i = 0; i < SBC_MAX; ++i)               \
+  do {                                          \
+    if (BE (trans != NULL, 0))                  \
       {                                         \
-        if (ctype_func (i))                     \
-          {                                     \
-            int ch = trans ? trans[i] : i;      \
-            bitset_set (sbcset, ch);            \
-          }                                     \
-      }
+        for (i = 0; i < SBC_MAX; ++i)           \
+          if (ctype_func (i))                   \
+            bitset_set (sbcset, trans[i]);      \
+      }                                         \
+    else                                        \
+      {                                         \
+        for (i = 0; i < SBC_MAX; ++i)           \
+          if (ctype_func (i))                   \
+            bitset_set (sbcset, i);             \
+      }                                         \
+  } while (0)
 
   if (strcmp (name, "alnum") == 0)
-    BUILD_CHARCLASS_LOOP (isalnum)
+    BUILD_CHARCLASS_LOOP (isalnum);
   else if (strcmp (name, "cntrl") == 0)
-    BUILD_CHARCLASS_LOOP (iscntrl)
+    BUILD_CHARCLASS_LOOP (iscntrl);
   else if (strcmp (name, "lower") == 0)
-    BUILD_CHARCLASS_LOOP (islower)
+    BUILD_CHARCLASS_LOOP (islower);
   else if (strcmp (name, "space") == 0)
-    BUILD_CHARCLASS_LOOP (isspace)
+    BUILD_CHARCLASS_LOOP (isspace);
   else if (strcmp (name, "alpha") == 0)
-    BUILD_CHARCLASS_LOOP (isalpha)
+    BUILD_CHARCLASS_LOOP (isalpha);
   else if (strcmp (name, "digit") == 0)
-    BUILD_CHARCLASS_LOOP (isdigit)
+    BUILD_CHARCLASS_LOOP (isdigit);
   else if (strcmp (name, "print") == 0)
-    BUILD_CHARCLASS_LOOP (isprint)
+    BUILD_CHARCLASS_LOOP (isprint);
   else if (strcmp (name, "upper") == 0)
-    BUILD_CHARCLASS_LOOP (isupper)
+    BUILD_CHARCLASS_LOOP (isupper);
   else if (strcmp (name, "blank") == 0)
-    BUILD_CHARCLASS_LOOP (isblank)
+    BUILD_CHARCLASS_LOOP (isblank);
   else if (strcmp (name, "graph") == 0)
-    BUILD_CHARCLASS_LOOP (isgraph)
+    BUILD_CHARCLASS_LOOP (isgraph);
   else if (strcmp (name, "punct") == 0)
-    BUILD_CHARCLASS_LOOP (ispunct)
+    BUILD_CHARCLASS_LOOP (ispunct);
   else if (strcmp (name, "xdigit") == 0)
-    BUILD_CHARCLASS_LOOP (isxdigit)
+    BUILD_CHARCLASS_LOOP (isxdigit);
   else
     return REG_ECTYPE;
@@ -3639 +3528 @@
 
 static bin_tree_t *
-build_charclass_op (dfa, trans, class_name, extra, non_match, err)
-     re_dfa_t *dfa;
-     unsigned RE_TRANSLATE_TYPE trans;
-     const unsigned char *class_name;
-     const unsigned char *extra;
-     int non_match;
-     reg_errcode_t *err;
+build_charclass_op (re_dfa_t *dfa, RE_TRANSLATE_TYPE trans,
+                    const unsigned char *class_name,
+                    const unsigned char *extra, int non_match,
+                    reg_errcode_t *err)
 {
   re_bitset_ptr_t sbcset;
@@ -3656 +3542 @@
   bin_tree_t *tree;
 
-  sbcset = (re_bitset_ptr_t) calloc (sizeof (unsigned int), BITSET_UINTS);
+  sbcset = (re_bitset_ptr_t) calloc (sizeof (bitset_t), 1);
 #ifdef RE_ENABLE_I18N
   mbcset = (re_charset_t *) calloc (sizeof (re_charset_t), 1);
@@ -3759 +3645 @@
 
 static int
-fetch_number (input, token, syntax)
-     re_string_t *input;
-     re_token_t *token;
-     reg_syntax_t syntax;
+fetch_number (re_string_t *input, re_token_t *token, reg_syntax_t syntax)
 {
   int num = -1;
@@ -3804 +3687 @@
 
 static bin_tree_t *
-create_tree (dfa, left, right, type)
-     re_dfa_t *dfa;
-     bin_tree_t *left;
-     bin_tree_t *right;
-     re_token_type_t type;
+create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
+             re_token_type_t type)
 {
   re_token_t t;
@@ -3816 +3696 @@
 
 static bin_tree_t *
-create_token_tree (dfa, left, right, token)
-     re_dfa_t *dfa;
-     bin_tree_t *left;
-     bin_tree_t *right;
-     const re_token_t *token;
+create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
+                   const re_token_t *token)
 {
   bin_tree_t *tree;
@@ -3856 +3733 @@
 
 static reg_errcode_t
-mark_opt_subexp (extra, node)
-     void *extra;
-     bin_tree_t *node;
+mark_opt_subexp (void *extra, bin_tree_t *node)
 {
   int idx = (int) (long) extra;
@@ -3898 +3773 @@
 
 static bin_tree_t *
-duplicate_tree (root, dfa)
-     const bin_tree_t *root;
-     re_dfa_t *dfa;
+duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa)
 {
   const bin_tree_t *node;

branches/libc-0.6/src/emx/src/lib/lgpl/posix/regex.c

@@ -1 +1 @@
 /* Extended regular expression matching and search library.
-   Copyright (C) 2002, 2003 Free Software Foundation, Inc.
+   Copyright (C) 2002, 2003, 2005 Free Software Foundation, Inc.
    This file is part of the GNU C Library.
    Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
@@ -23 +23 @@
 #endif
 
-#define RE_ENABLE_I18N 1
-
-/* BSD 4.2, not delcared in the header */
-char * re_comp (const char *);
-int re_exec (const char *);
-
-
-#ifdef _AIX
-#pragma alloca
-#else
-# ifndef allocax           /* predefined by HP cc +Olibcalls */
-#  ifdef __GNUC__
-#   define alloca(size) __builtin_alloca (size)
-#  else
-#   if HAVE_ALLOCA_H
-#    include <alloca.h>
-#   else
-#    ifdef __hpux
-        void *alloca ();
-#    else
-#     if !defined __OS2__ && !defined WIN32
-        char *alloca ();
-#     else
-#      include <malloc.h>       /* OS/2 defines alloca in here */
-#     endif
-#    endif
-#   endif
-#  endif
-# endif
+/* Make sure noone compiles this code with a C++ compiler.  */
+#ifdef __cplusplus
+# error "This is C code, use a C compiler"
 #endif
 
@@ -79 +53 @@
 #endif
 
-/* POSIX says that <sys/types.h> must be included (by the caller) before
-   <regex.h>.  */
-#include <sys/types.h>
-
 /* On some systems, limits.h sets RE_DUP_MAX to a lower value than
    GNU regex allows.  Include it before <regex.h>, which correctly
@@ -96 +66 @@
 
 /* Binary backward compatibility.  */
-#if defined _LIBC && _LIBC
+#if _LIBC
 # include <shlib-compat.h>
 # if SHLIB_COMPAT (libc, GLIBC_2_0, GLIBC_2_3)

branches/libc-0.6/src/emx/src/lib/lgpl/posix/regex_internal.c

@@ -1 +1 @@
 /* Extended regular expression matching and search library.
-   Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
+   Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
    This file is part of the GNU C Library.
    Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
@@ -23 +23 @@
                                         RE_TRANSLATE_TYPE trans, int icase,
                                         const re_dfa_t *dfa) internal_function;
-#ifdef RE_ENABLE_I18N
-static int re_string_skip_chars (re_string_t *pstr, int new_raw_idx,
-                                 wint_t *last_wc) internal_function;
-#endif /* RE_ENABLE_I18N */
-static reg_errcode_t register_state (re_dfa_t *dfa, re_dfastate_t *newstate,
-                                     unsigned int hash) internal_function;
-static re_dfastate_t *create_ci_newstate (re_dfa_t *dfa,
+static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa,
                                           const re_node_set *nodes,
                                           unsigned int hash) internal_function;
-static re_dfastate_t *create_cd_newstate (re_dfa_t *dfa,
+static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa,
                                           const re_node_set *nodes,
                                           unsigned int context,
                                           unsigned int hash) internal_function;
-static unsigned int inline calc_state_hash (const re_node_set *nodes,
-                                            unsigned int context) internal_function;
 
 
@@ -46 +38 @@
 
 static reg_errcode_t
-re_string_allocate (pstr, str, len, init_len, trans, icase, dfa)
-     re_string_t *pstr;
-     const char *str;
-     int len, init_len, icase;
-     RE_TRANSLATE_TYPE trans;
-     const re_dfa_t *dfa;
+internal_function
+re_string_allocate (re_string_t *pstr, const char *str, int len, int init_len,
+                    RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa)
 {
   reg_errcode_t ret;
@@ -77 +66 @@
 
 static reg_errcode_t
-re_string_construct (pstr, str, len, trans, icase, dfa)
-     re_string_t *pstr;
-     const char *str;
-     int len, icase;
-     RE_TRANSLATE_TYPE trans;
-     const re_dfa_t *dfa;
+internal_function
+re_string_construct (re_string_t *pstr, const char *str, int len,
+                     RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa)
 {
   reg_errcode_t ret;
@@ -143 +129 @@
 
 static reg_errcode_t
-re_string_realloc_buffers (pstr, new_buf_len)
-     re_string_t *pstr;
-     int new_buf_len;
+internal_function
+re_string_realloc_buffers (re_string_t *pstr, int new_buf_len)
 {
 #ifdef RE_ENABLE_I18N
   if (pstr->mb_cur_max > 1)
     {
-      wint_t *new_array = re_realloc (pstr->wcs, wint_t, new_buf_len);
-      if (BE (new_array == NULL, 0))
+      wint_t *new_wcs = re_realloc (pstr->wcs, wint_t, new_buf_len);
+      if (BE (new_wcs == NULL, 0))
         return REG_ESPACE;
-      pstr->wcs = new_array;
+      pstr->wcs = new_wcs;
       if (pstr->offsets != NULL)
         {
-          int *new_array = re_realloc (pstr->offsets, int, new_buf_len);
-          if (BE (new_array == NULL, 0))
+          int *new_offsets = re_realloc (pstr->offsets, int, new_buf_len);
+          if (BE (new_offsets == NULL, 0))
             return REG_ESPACE;
-          pstr->offsets = new_array;
+          pstr->offsets = new_offsets;
         }
     }
@@ -165 +150 @@
   if (pstr->mbs_allocated)
     {
-      unsigned char *new_array = re_realloc (pstr->mbs, unsigned char,
-                                             new_buf_len);
-      if (BE (new_array == NULL, 0))
+      unsigned char *new_mbs = re_realloc (pstr->mbs, unsigned char,
+                                           new_buf_len);
+      if (BE (new_mbs == NULL, 0))
         return REG_ESPACE;
-      pstr->mbs = new_array;
+      pstr->mbs = new_mbs;
     }
   pstr->bufs_len = new_buf_len;
@@ -177 +162 @@
 
 static void
-re_string_construct_common (str, len, pstr, trans, icase, dfa)
-     const char *str;
-     int len;
-     re_string_t *pstr;
-     RE_TRANSLATE_TYPE trans;
-     int icase;
-     const re_dfa_t *dfa;
+internal_function
+re_string_construct_common (const char *str, int len, re_string_t *pstr,
+                            RE_TRANSLATE_TYPE trans, int icase,
+                            const re_dfa_t *dfa)
 {
   pstr->raw_mbs = (const unsigned char *) str;
   pstr->len = len;
   pstr->raw_len = len;
-  pstr->trans = (unsigned RE_TRANSLATE_TYPE) trans;
+  pstr->trans = trans;
   pstr->icase = icase ? 1 : 0;
   pstr->mbs_allocated = (trans != NULL || icase);
@@ -212 +194 @@
 
 static void
-build_wcs_buffer (pstr)
-     re_string_t *pstr;
+internal_function
+build_wcs_buffer (re_string_t *pstr)
 {
 #ifdef _LIBC
@@ -279 +261 @@
    but for REG_ICASE.  */
 
-static int
-build_wcs_upper_buffer (pstr)
-     re_string_t *pstr;
+static reg_errcode_t
+internal_function
+build_wcs_upper_buffer (re_string_t *pstr)
 {
   mbstate_t prev_st;
@@ -496 +478 @@
 
 static int
-re_string_skip_chars (pstr, new_raw_idx, last_wc)
-     re_string_t *pstr;
-     int new_raw_idx;
-     wint_t *last_wc;
+internal_function
+re_string_skip_chars (re_string_t *pstr, int new_raw_idx, wint_t *last_wc)
 {
   mbstate_t prev_st;
   int rawbuf_idx;
   size_t mbclen;
-  wchar_t wc = 0;
+  wchar_t wc = WEOF;
 
   /* Skip the characters which are not necessary to check.  */
@@ -517 +497 @@
       if (BE (mbclen == (size_t) -2 || mbclen == (size_t) -1 || mbclen == 0, 0))
         {
-          /* We treat these cases as a singlebyte character.  */
+          /* We treat these cases as a single byte character.  */
+          if (mbclen == 0 || remain_len == 0)
+            wc = L'\0';
+          else
+            wc = *(unsigned char *) (pstr->raw_mbs + rawbuf_idx);
           mbclen = 1;
           pstr->cur_state = prev_st;
@@ -533 +517 @@
 
 static void
-build_upper_buffer (pstr)
-     re_string_t *pstr;
+internal_function
+build_upper_buffer (re_string_t *pstr)
 {
   int char_idx, end_idx;
@@ -556 +540 @@
 
 static void
-re_string_translate_buffer (pstr)
-     re_string_t *pstr;
+internal_function
+re_string_translate_buffer (re_string_t *pstr)
 {
   int buf_idx, end_idx;
@@ -577 +561 @@
 
 static reg_errcode_t
-re_string_reconstruct (pstr, idx, eflags)
-     re_string_t *pstr;
-     int idx, eflags;
+internal_function
+re_string_reconstruct (re_string_t *pstr, int idx, int eflags)
 {
   int offset = idx - pstr->raw_mbs_idx;
@@ -604 +587 @@
   if (BE (offset != 0, 1))
     {
-      /* Are the characters which are already checked remain?  */
-      if (BE (offset < pstr->valid_raw_len, 1)
-#ifdef RE_ENABLE_I18N
-          /* Handling this would enlarge the code too much.
-             Accept a slowdown in that case.  */
-          && pstr->offsets_needed == 0
+      /* Should the already checked characters be kept?  */
+      if (BE (offset < pstr->valid_raw_len, 1))
+        {
+          /* Yes, move them to the front of the buffer.  */
+#ifdef RE_ENABLE_I18N
+          if (BE (pstr->offsets_needed, 0))
+            {
+              int low = 0, high = pstr->valid_len, mid;
+              do
+                {
+                  mid = (high + low) / 2;
+                  if (pstr->offsets[mid] > offset)
+                    high = mid;
+                  else if (pstr->offsets[mid] < offset)
+                    low = mid + 1;
+                  else
+                    break;
+                }
+              while (low < high);
+              if (pstr->offsets[mid] < offset)
+                ++mid;
+              pstr->tip_context = re_string_context_at (pstr, mid - 1,
+                                                        eflags);
+              /* This can be quite complicated, so handle specially
+                 only the common and easy case where the character with
+                 different length representation of lower and upper
+                 case is present at or after offset.  */
+              if (pstr->valid_len > offset
+                  && mid == offset && pstr->offsets[mid] == offset)
+                {
+                  memmove (pstr->wcs, pstr->wcs + offset,
+                           (pstr->valid_len - offset) * sizeof (wint_t));
+                  memmove (pstr->mbs, pstr->mbs + offset, pstr->valid_len - offset);
+                  pstr->valid_len -= offset;
+                  pstr->valid_raw_len -= offset;
+                  for (low = 0; low < pstr->valid_len; low++)
+                    pstr->offsets[low] = pstr->offsets[low + offset] - offset;
+                }
+              else
+                {
+                  /* Otherwise, just find out how long the partial multibyte
+                     character at offset is and fill it with WEOF/255.  */
+                  pstr->len = pstr->raw_len - idx + offset;
+                  pstr->stop = pstr->raw_stop - idx + offset;
+                  pstr->offsets_needed = 0;
+                  while (mid > 0 && pstr->offsets[mid - 1] == offset)
+                    --mid;
+                  while (mid < pstr->valid_len)
+                    if (pstr->wcs[mid] != WEOF)
+                      break;
+                    else
+                      ++mid;
+                  if (mid == pstr->valid_len)
+                    pstr->valid_len = 0;
+                  else
+                    {
+                      pstr->valid_len = pstr->offsets[mid] - offset;
+                      if (pstr->valid_len)
+                        {
+                          for (low = 0; low < pstr->valid_len; ++low)
+                            pstr->wcs[low] = WEOF;
+                          memset (pstr->mbs, 255, pstr->valid_len);
+                        }
+                    }
+                  pstr->valid_raw_len = pstr->valid_len;
+                }
+            }
+          else
 #endif
-         )
-        {
-          /* Yes, move them to the front of the buffer.  */
-          pstr->tip_context = re_string_context_at (pstr, offset - 1, eflags);
-#ifdef RE_ENABLE_I18N
-          if (pstr->mb_cur_max > 1)
-            memmove (pstr->wcs, pstr->wcs + offset,
-                     (pstr->valid_len - offset) * sizeof (wint_t));
+            {
+              pstr->tip_context = re_string_context_at (pstr, offset - 1,
+                                                        eflags);
+#ifdef RE_ENABLE_I18N
+              if (pstr->mb_cur_max > 1)
+                memmove (pstr->wcs, pstr->wcs + offset,
+                         (pstr->valid_len - offset) * sizeof (wint_t));
 #endif /* RE_ENABLE_I18N */
-          if (BE (pstr->mbs_allocated, 0))
-            memmove (pstr->mbs, pstr->mbs + offset,
-                     pstr->valid_len - offset);
-          pstr->valid_len -= offset;
-          pstr->valid_raw_len -= offset;
-#ifdef DEBUG //bird
-          assert (pstr->valid_len > 0);
+              if (BE (pstr->mbs_allocated, 0))
+                memmove (pstr->mbs, pstr->mbs + offset,
+                         pstr->valid_len - offset);
+              pstr->valid_len -= offset;
+              pstr->valid_raw_len -= offset;
+#if DEBUG
+              assert (pstr->valid_len > 0);
 #endif
+            }
         }
       else
         {
           /* No, skip all characters until IDX.  */
+          int prev_valid_len = pstr->valid_len;
+
 #ifdef RE_ENABLE_I18N
           if (BE (pstr->offsets_needed, 0))
@@ -641 +688 @@
 #endif
           pstr->valid_len = 0;
-          pstr->valid_raw_len = 0;
 #ifdef RE_ENABLE_I18N
           if (pstr->mb_cur_max > 1)
@@ -656 +702 @@
                   raw = pstr->raw_mbs + pstr->raw_mbs_idx;
                   end = raw + (offset - pstr->mb_cur_max);
-                  for (p = raw + offset - 1; p >= end; --p)
-                    if ((*p & 0xc0) != 0x80)
-                      {
-                        mbstate_t cur_state;
-                        wchar_t wc2;
-                        int mlen = raw + pstr->len - p;
-                        unsigned char buf[6];
-
-                        q = p;
-                        if (BE (pstr->trans != NULL, 0))
-                          {
-                            int i = mlen < 6 ? mlen : 6;
-                            while (--i >= 0)
-                              buf[i] = pstr->trans[p[i]];
-                            q = buf;
-                          }
-                        /* XXX Don't use mbrtowc, we know which conversion
-                           to use (UTF-8 -> UCS4).  */
-                        memset (&cur_state, 0, sizeof (cur_state));
-                        mlen = (mbrtowc (&wc2, (const char *) p, mlen,
-                                         &cur_state)
-                                - (raw + offset - p));
-                        if (mlen >= 0)
-                          {
-                            memset (&pstr->cur_state, '\0',
-                                    sizeof (mbstate_t));
-                            pstr->valid_len = mlen;
-                            wc = wc2;
-                          }
-                        break;
-                      }
+                  if (end < pstr->raw_mbs)
+                    end = pstr->raw_mbs;
+                  p = raw + offset - 1;
+#ifdef _LIBC
+                  /* We know the wchar_t encoding is UCS4, so for the simple
+                     case, ASCII characters, skip the conversion step.  */
+                  if (isascii (*p) && BE (pstr->trans == NULL, 1))
+                    {
+                      memset (&pstr->cur_state, '\0', sizeof (mbstate_t));
+                      /* pstr->valid_len = 0; */
+                      wc = (wchar_t) *p;
+                    }
+                  else
+#endif
+                    for (; p >= end; --p)
+                      if ((*p & 0xc0) != 0x80)
+                        {
+                          mbstate_t cur_state;
+                          wchar_t wc2;
+                          int mlen = raw + pstr->len - p;
+                          unsigned char buf[6];
+                          size_t mbclen;
+
+                          q = p;
+                          if (BE (pstr->trans != NULL, 0))
+                            {
+                              int i = mlen < 6 ? mlen : 6;
+                              while (--i >= 0)
+                                buf[i] = pstr->trans[p[i]];
+                              q = buf;
+                            }
+                          /* XXX Don't use mbrtowc, we know which conversion
+                             to use (UTF-8 -> UCS4).  */
+                          memset (&cur_state, 0, sizeof (cur_state));
+                          mbclen = mbrtowc (&wc2, (const char *) p, mlen,
+                                            &cur_state);
+                          if (raw + offset - p <= mbclen
+                              && mbclen < (size_t) -2)
+                            {
+                              memset (&pstr->cur_state, '\0',
+                                      sizeof (mbstate_t));
+                              pstr->valid_len = mbclen - (raw + offset - p);
+                              wc = wc2;
+                            }
+                          break;
+                        }
                 }
 
               if (wc == WEOF)
                 pstr->valid_len = re_string_skip_chars (pstr, idx, &wc) - idx;
+              if (wc == WEOF)
+                pstr->tip_context
+                  = re_string_context_at (pstr, prev_valid_len - 1, eflags);
+              else
+                pstr->tip_context = ((BE (pstr->word_ops_used != 0, 0)
+                                      && IS_WIDE_WORD_CHAR (wc))
+                                     ? CONTEXT_WORD
+                                     : ((IS_WIDE_NEWLINE (wc)
+                                         && pstr->newline_anchor)
+                                        ? CONTEXT_NEWLINE : 0));
               if (BE (pstr->valid_len, 0))
                 {
@@ -699 +770 @@
                 }
               pstr->valid_raw_len = pstr->valid_len;
-              pstr->tip_context = ((BE (pstr->word_ops_used != 0, 0)
-                                    && IS_WIDE_WORD_CHAR (wc))
-                                   ? CONTEXT_WORD
-                                   : ((IS_WIDE_NEWLINE (wc)
-                                       && pstr->newline_anchor)
-                                      ? CONTEXT_NEWLINE : 0));
             }
           else
@@ -710 +775 @@
             {
               int c = pstr->raw_mbs[pstr->raw_mbs_idx + offset - 1];
+              pstr->valid_raw_len = 0;
               if (pstr->trans)
                 c = pstr->trans[c];
@@ -731 +797 @@
       if (pstr->icase)
         {
-          int ret = build_wcs_upper_buffer (pstr);
+          reg_errcode_t ret = build_wcs_upper_buffer (pstr);
           if (BE (ret != REG_NOERROR, 0))
             return ret;
@@ -740 +806 @@
   else
 #endif /* RE_ENABLE_I18N */
-  if (BE (pstr->mbs_allocated, 0))
-    {
-      if (pstr->icase)
-        build_upper_buffer (pstr);
-      else if (pstr->trans != NULL)
-        re_string_translate_buffer (pstr);
-    }
-  else
-    pstr->valid_len = pstr->len;
+    if (BE (pstr->mbs_allocated, 0))
+      {
+        if (pstr->icase)
+          build_upper_buffer (pstr);
+        else if (pstr->trans != NULL)
+          re_string_translate_buffer (pstr);
+      }
+    else
+      pstr->valid_len = pstr->len;
 
   pstr->cur_idx = 0;
@@ -755 +821 @@
 
 static unsigned char
-re_string_peek_byte_case (pstr, idx)
-     const re_string_t *pstr;
-     int idx;
+internal_function __attribute ((pure))
+re_string_peek_byte_case (const re_string_t *pstr, int idx)
 {
   int ch, off;
@@ -792 +857 @@
 
 static unsigned char
-re_string_fetch_byte_case (pstr)
-     re_string_t *pstr;
+internal_function __attribute ((pure))
+re_string_fetch_byte_case (re_string_t *pstr)
 {
   if (BE (!pstr->mbs_allocated, 1))
@@ -829 +894 @@
 
 static void
-re_string_destruct (pstr)
-     re_string_t *pstr;
+internal_function
+re_string_destruct (re_string_t *pstr)
 {
 #ifdef RE_ENABLE_I18N
@@ -843 +908 @@
 
 static unsigned int
-re_string_context_at (input, idx, eflags)
-     const re_string_t *input;
-     int idx, eflags;
+internal_function
+re_string_context_at (const re_string_t *input, int idx, int eflags)
 {
   int c;
@@ -890 +954 @@
 
 static reg_errcode_t
-re_node_set_alloc (set, size)
-     re_node_set *set;
-     int size;
+internal_function
+re_node_set_alloc (re_node_set *set, int size)
 {
   set->alloc = size;
@@ -903 +966 @@
 
 static reg_errcode_t
-re_node_set_init_1 (set, elem)
-     re_node_set *set;
-     int elem;
+internal_function
+re_node_set_init_1 (re_node_set *set, int elem)
 {
   set->alloc = 1;
@@ -920 +982 @@
 
 static reg_errcode_t
-re_node_set_init_2 (set, elem1, elem2)
-     re_node_set *set;
-     int elem1, elem2;
+internal_function
+re_node_set_init_2 (re_node_set *set, int elem1, int elem2)
 {
   set->alloc = 2;
@@ -951 +1012 @@
 
 static reg_errcode_t
-re_node_set_init_copy (dest, src)
-     re_node_set *dest;
-     const re_node_set *src;
+internal_function
+re_node_set_init_copy (re_node_set *dest, const re_node_set *src)
 {
   dest->nelem = src->nelem;
@@ -977 +1037 @@
 
 static reg_errcode_t
-re_node_set_add_intersect (dest, src1, src2)
-     re_node_set *dest;
-     const re_node_set *src1, *src2;
+internal_function
+re_node_set_add_intersect (re_node_set *dest, const re_node_set *src1,
+                           const re_node_set *src2)
 {
   int i1, i2, is, id, delta, sbase;
@@ -1068 +1128 @@
 
 static reg_errcode_t
-re_node_set_init_union (dest, src1, src2)
-     re_node_set *dest;
-     const re_node_set *src1, *src2;
+internal_function
+re_node_set_init_union (re_node_set *dest, const re_node_set *src1,
+                        const re_node_set *src2)
 {
   int i1, i2, id;
@@ -1121 +1181 @@
 
 static reg_errcode_t
-re_node_set_merge (dest, src)
-     re_node_set *dest;
-     const re_node_set *src;
+internal_function
+re_node_set_merge (re_node_set *dest, const re_node_set *src)
 {
   int is, id, sbase, delta;
@@ -1205 +1264 @@
 
 static int
-re_node_set_insert (set, elem)
-     re_node_set *set;
-     int elem;
+internal_function
+re_node_set_insert (re_node_set *set, int elem)
 {
   int idx;
@@ -1230 +1288 @@
   if (set->alloc == set->nelem)
     {
-      int *new_array;
+      int *new_elems;
       set->alloc = set->alloc * 2;
-      new_array = re_realloc (set->elems, int, set->alloc);
-      if (BE (new_array == NULL, 0))
+      new_elems = re_realloc (set->elems, int, set->alloc);
+      if (BE (new_elems == NULL, 0))
         return -1;
-      set->elems = new_array;
+      set->elems = new_elems;
     }
 
@@ -1263 +1321 @@
 
 static int
-re_node_set_insert_last (set, elem)
-     re_node_set *set;
-     int elem;
+internal_function
+re_node_set_insert_last (re_node_set *set, int elem)
 {
   /* Realloc if we need.  */
   if (set->alloc == set->nelem)
     {
-      int *new_array;
+      int *new_elems;
       set->alloc = (set->alloc + 1) * 2;
-      new_array = re_realloc (set->elems, int, set->alloc);
-      if (BE (new_array == NULL, 0))
+      new_elems = re_realloc (set->elems, int, set->alloc);
+      if (BE (new_elems == NULL, 0))
         return -1;
-      set->elems = new_array;
+      set->elems = new_elems;
     }
 
@@ -1287 +1344 @@
 
 static int
-re_node_set_compare (set1, set2)
-     const re_node_set *set1, *set2;
+internal_function __attribute ((pure))
+re_node_set_compare (const re_node_set *set1, const re_node_set *set2)
 {
   int i;
@@ -1302 +1359 @@
 
 static int
-re_node_set_contains (set, elem)
-     const re_node_set *set;
-     int elem;
+internal_function __attribute ((pure))
+re_node_set_contains (const re_node_set *set, int elem)
 {
   unsigned int idx, right, mid;
@@ -1325 +1381 @@
 
 static void
-re_node_set_remove_at (set, idx)
-     re_node_set *set;
-     int idx;
+internal_function
+re_node_set_remove_at (re_node_set *set, int idx)
 {
   if (idx < 0 || idx >= set->nelem)
@@ -1342 +1397 @@
 
 static int
-re_dfa_add_node (dfa, token)
-     re_dfa_t *dfa;
-     re_token_t token;
-{
-#ifdef RE_ENABLE_I18N //bird
+internal_function
+re_dfa_add_node (re_dfa_t *dfa, re_token_t token)
+{
   int type = token.type;
-#endif
   if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
     {
-      int new_nodes_alloc = dfa->nodes_alloc * 2;
+      size_t new_nodes_alloc = dfa->nodes_alloc * 2;
       int *new_nexts, *new_indices;
       re_node_set *new_edests, *new_eclosures;
-
-      re_token_t *new_array = re_realloc (dfa->nodes, re_token_t,
-                                          new_nodes_alloc);
-      if (BE (new_array == NULL, 0))
+      re_token_t *new_nodes;
+
+      /* Avoid overflows.  */
+      if (BE (new_nodes_alloc < dfa->nodes_alloc, 0))
         return -1;
-      dfa->nodes = new_array;
+
+      new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
+      if (BE (new_nodes == NULL, 0))
+        return -1;
+      dfa->nodes = new_nodes;
       new_nexts = re_realloc (dfa->nexts, int, new_nodes_alloc);
       new_indices = re_realloc (dfa->org_indices, int, new_nodes_alloc);
@@ -1385 +1441 @@
 }
 
-static unsigned int inline
-calc_state_hash (nodes, context)
-     const re_node_set *nodes;
-     unsigned int context;
+static inline unsigned int
+internal_function
+calc_state_hash (const re_node_set *nodes, unsigned int context)
 {
   unsigned int hash = nodes->nelem + context;
@@ -1406 +1461 @@
            optimization.  */
 
-static re_dfastate_t*
-re_acquire_state (err, dfa, nodes)
-     reg_errcode_t *err;
-     re_dfa_t *dfa;
-     const re_node_set *nodes;
+static re_dfastate_t *
+internal_function
+re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa,
+                  const re_node_set *nodes)
 {
   unsigned int hash;
@@ -1435 +1489 @@
   /* There are no appropriate state in the dfa, create the new one.  */
   new_state = create_ci_newstate (dfa, nodes, hash);
-  if (BE (new_state != NULL, 1))
-    return new_state;
-  else
-    {
-      *err = REG_ESPACE;
-      return NULL;
-    }
+  if (BE (new_state == NULL, 0))
+    *err = REG_ESPACE;
+
+  return new_state;
 }
 
@@ -1454 +1505 @@
            optimization.  */
 
-static re_dfastate_t*
-re_acquire_state_context (err, dfa, nodes, context)
-     reg_errcode_t *err;
-     re_dfa_t *dfa;
-     const re_node_set *nodes;
-     unsigned int context;
+static re_dfastate_t *
+internal_function
+re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa,
+                          const re_node_set *nodes, unsigned int context)
 {
   unsigned int hash;
@@ -1483 +1532 @@
   /* There are no appropriate state in `dfa', create the new one.  */
   new_state = create_cd_newstate (dfa, nodes, context, hash);
-  if (BE (new_state != NULL, 1))
-    return new_state;
-  else
-    {
-      *err = REG_ESPACE;
-      return NULL;
-    }
+  if (BE (new_state == NULL, 0))
+    *err = REG_ESPACE;
+
+  return new_state;
 }
 
@@ -1497 +1543 @@
 
 static reg_errcode_t
-register_state (dfa, newstate, hash)
-     re_dfa_t *dfa;
-     re_dfastate_t *newstate;
-     unsigned int hash;
+register_state (const re_dfa_t *dfa, re_dfastate_t *newstate,
+                unsigned int hash)
 {
   struct re_state_table_entry *spot;
@@ -1532 +1576 @@
 }
 
+static void
+free_state (re_dfastate_t *state)
+{
+  re_node_set_free (&state->non_eps_nodes);
+  re_node_set_free (&state->inveclosure);
+  if (state->entrance_nodes != &state->nodes)
+    {
+      re_node_set_free (state->entrance_nodes);
+      re_free (state->entrance_nodes);
+    }
+  re_node_set_free (&state->nodes);
+  re_free (state->word_trtable);
+  re_free (state->trtable);
+  re_free (state);
+}
+
 /* Create the new state which is independ of contexts.
    Return the new state if succeeded, otherwise return NULL.  */
 
 static re_dfastate_t *
-create_ci_newstate (dfa, nodes, hash)
-     re_dfa_t *dfa;
-     const re_node_set *nodes;
-     unsigned int hash;
+internal_function
+create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
+                    unsigned int hash)
 {
   int i;
@@ -1587 +1646 @@
 
 static re_dfastate_t *
-create_cd_newstate (dfa, nodes, context, hash)
-     re_dfa_t *dfa;
-     const re_node_set *nodes;
-     unsigned int context, hash;
+internal_function
+create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
+                    unsigned int context, unsigned int hash)
 {
   int i, nctx_nodes = 0;
@@ -1661 +1719 @@
   return  newstate;
 }
-
-static void
-free_state (state)
-     re_dfastate_t *state;
-{
-  re_node_set_free (&state->non_eps_nodes);
-  re_node_set_free (&state->inveclosure);
-  if (state->entrance_nodes != &state->nodes)
-    {
-      re_node_set_free (state->entrance_nodes);
-      re_free (state->entrance_nodes);
-    }
-  re_node_set_free (&state->nodes);
-  re_free (state->word_trtable);
-  re_free (state->trtable);
-  re_free (state);
-}

branches/libc-0.6/src/emx/src/lib/lgpl/posix/regex_internal.h

@@ -40 +40 @@
 # include <wctype.h>
 #endif /* HAVE_WCTYPE_H || _LIBC */
+#if defined HAVE_STDBOOL_H || defined _LIBC
+# include <stdbool.h>
+#endif /* HAVE_STDBOOL_H || _LIBC */
+#if defined HAVE_STDINT_H || defined _LIBC
+# include <stdint.h>
+#endif /* HAVE_STDINT_H || _LIBC */
 #if defined _LIBC || defined __INNOTEK_LIBC__
 # include <bits/libc-lock.h>
@@ -81 +87 @@
 #endif
 
+/* For loser systems without the definition.  */
+#ifndef SIZE_MAX
+# define SIZE_MAX ((size_t) -1)
+#endif
+
 #ifndef __INNOTEK_LIBC__
 #if (defined MB_CUR_MAX && HAVE_LOCALE_H && HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_WCRTOMB && HAVE_MBRTOWC && HAVE_WCSCOLL) || _LIBC
 # define RE_ENABLE_I18N
 #endif
-#endif
+#else
+#endif
+#define RE_ENABLE_I18N
 
 #if __GNUC__ >= 3
@@ -94 +107 @@
 #endif
 
-/* Number of bits in a byte.  */
-#define BYTE_BITS 8
 /* Number of single byte character.  */
 #define SBC_MAX 256
@@ -125 +136 @@
 extern const size_t __re_error_msgid_idx[] attribute_hidden;
 
-/* Number of bits in an unsinged int.  */
-#define UINT_BITS (sizeof (unsigned int) * BYTE_BITS)
-/* Number of unsigned int in an bit_set.  */
-#define BITSET_UINTS ((SBC_MAX + UINT_BITS - 1) / UINT_BITS)
-typedef unsigned int bitset[BITSET_UINTS];
-typedef unsigned int *re_bitset_ptr_t;
-typedef const unsigned int *re_const_bitset_ptr_t;
-
-#define bitset_set(set,i) (set[i / UINT_BITS] |= 1 << i % UINT_BITS)
-#define bitset_clear(set,i) (set[i / UINT_BITS] &= ~(1 << i % UINT_BITS))
-#define bitset_contain(set,i) (set[i / UINT_BITS] & (1 << i % UINT_BITS))
-#define bitset_empty(set) memset (set, 0, sizeof (unsigned int) * BITSET_UINTS)
-#define bitset_set_all(set) \
-  memset (set, 255, sizeof (unsigned int) * BITSET_UINTS)
-#define bitset_copy(dest,src) \
-  memcpy (dest, src, sizeof (unsigned int) * BITSET_UINTS)
-static inline void bitset_not (bitset set);
-static inline void bitset_merge (bitset dest, const bitset src);
-static inline void bitset_not_merge (bitset dest, const bitset src);
-static inline void bitset_mask (bitset dest, const bitset src);
+/* 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 (sizeof (bitset_word_t) * CHAR_BIT)
+/* Number of bitset_word_t in a bit_set.  */
+#define BITSET_WORDS (SBC_MAX / 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 bitset_set(set,i) \
+  (set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS)
+#define bitset_clear(set,i) \
+  (set[i / BITSET_WORD_BITS] &= ~((bitset_word_t) 1 << i % BITSET_WORD_BITS))
+#define bitset_contain(set,i) \
+  (set[i / BITSET_WORD_BITS] & ((bitset_word_t) 1 << i % BITSET_WORD_BITS))
+#define bitset_empty(set) memset (set, '\0', sizeof (bitset_t))
+#define bitset_set_all(set) memset (set, '\xff', sizeof (bitset_t))
+#define bitset_copy(dest,src) memcpy (dest, src, sizeof (bitset_t))
 
 #define PREV_WORD_CONSTRAINT 0x0001
@@ -350 +363 @@
   unsigned int tip_context;
   /* The translation passed as a part of an argument of re_compile_pattern.  */
-  unsigned RE_TRANSLATE_TYPE trans;
+  RE_TRANSLATE_TYPE trans;
   /* Copy of re_dfa_t's word_char.  */
   re_const_bitset_ptr_t word_char;
@@ -377 +390 @@
 #endif
 
-#ifndef RE_NO_INTERNAL_PROTOTYPES
-static reg_errcode_t re_string_allocate (re_string_t *pstr, const char *str,
-                                         int len, int init_len,
-                                         RE_TRANSLATE_TYPE trans, int icase,
-                                         const re_dfa_t *dfa)
-     internal_function;
-static reg_errcode_t re_string_construct (re_string_t *pstr, const char *str,
-                                          int len, RE_TRANSLATE_TYPE trans,
-                                          int icase, const re_dfa_t *dfa)
-     internal_function;
-static reg_errcode_t re_string_reconstruct (re_string_t *pstr, int idx,
-                                            int eflags) internal_function;
 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
                                                 int new_buf_len)
      internal_function;
-# ifdef RE_ENABLE_I18N
+#ifdef RE_ENABLE_I18N
 static void build_wcs_buffer (re_string_t *pstr) internal_function;
 static int build_wcs_upper_buffer (re_string_t *pstr) internal_function;
-# endif /* RE_ENABLE_I18N */
+#endif /* RE_ENABLE_I18N */
 static void build_upper_buffer (re_string_t *pstr) internal_function;
 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
-static void re_string_destruct (re_string_t *pstr) internal_function;
-# ifdef RE_ENABLE_I18N
-static int re_string_elem_size_at (const re_string_t *pstr, int idx)
-     internal_function __attribute ((pure));
-static inline int re_string_char_size_at (const re_string_t *pstr, int idx)
-     internal_function __attribute ((pure));
-static inline wint_t re_string_wchar_at (const re_string_t *pstr, int idx)
-     internal_function __attribute ((pure));
-# endif /* RE_ENABLE_I18N */
 static unsigned int re_string_context_at (const re_string_t *input, int idx,
                                           int eflags)
      internal_function __attribute ((pure));
-static unsigned char re_string_peek_byte_case (const re_string_t *pstr,
-                                               int idx)
-     internal_function __attribute ((pure));
-static unsigned char re_string_fetch_byte_case (re_string_t *pstr)
-     internal_function __attribute ((pure));
-#endif
 #define re_string_peek_byte(pstr, offset) \
   ((pstr)->mbs[(pstr)->cur_idx + offset])
@@ -433 +419 @@
 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
 
+#include <alloca.h>
+
+#ifndef _LIBC
+# if HAVE_ALLOCA
+/* The OS usually guarantees only one guard page at the bottom of the stack,
+   and a page size can be as small as 4096 bytes.  So we cannot safely
+   allocate anything larger than 4096 bytes.  Also care for the possibility
+   of a few compiler-allocated temporary stack slots.  */
+#  define __libc_use_alloca(n) ((n) < 4032)
+# else
+/* alloca is implemented with malloc, so just use malloc.  */
+#  define __libc_use_alloca(n) 0
+# endif
+#endif
+
 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
@@ -544 +545 @@
   int str_idx;
   int node;
-  int next_last_offset;
   state_array_t *path;
   int alasts; /* Allocation size of LASTS.  */
@@ -567 +567 @@
   re_string_t input;
 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
-  re_dfa_t *const dfa;
+  const re_dfa_t *const dfa;
 #else
-  re_dfa_t *dfa;
+  const re_dfa_t *dfa;
 #endif
   /* EFLAGS of the argument of regexec.  */
@@ -616 +616 @@
 {
   re_token_t *nodes;
-  int nodes_alloc;
-  int nodes_len;
+  size_t nodes_alloc;
+  size_t nodes_len;
   int *nexts;
   int *org_indices;
@@ -635 +635 @@
   /* number of subexpressions `re_nsub' is in regex_t.  */
   unsigned int state_hash_mask;
-  int states_alloc;
   int init_node;
   int nbackref; /* The number of backreference in this dfa.  */
 
   /* Bitmap expressing which backreference is used.  */
-  unsigned int used_bkref_map;
-  unsigned int completed_bkref_map;
+  bitset_word_t used_bkref_map;
+  bitset_word_t completed_bkref_map;
 
   unsigned int has_plural_match : 1;
@@ -652 +651 @@
   unsigned int word_ops_used : 1;
   int mb_cur_max;
-  bitset word_char;
+  bitset_t word_char;
   reg_syntax_t syntax;
   int *subexp_map;
@@ -661 +660 @@
 };
 
-#ifndef RE_NO_INTERNAL_PROTOTYPES
-static reg_errcode_t re_node_set_alloc (re_node_set *set, int size) internal_function;
-static reg_errcode_t re_node_set_init_1 (re_node_set *set, int elem) internal_function;
-static reg_errcode_t re_node_set_init_2 (re_node_set *set, int elem1,
-                                         int elem2) internal_function;
 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
-static reg_errcode_t re_node_set_init_copy (re_node_set *dest,
-                                            const re_node_set *src) internal_function;
-static reg_errcode_t re_node_set_add_intersect (re_node_set *dest,
-                                                const re_node_set *src1,
-                                                const re_node_set *src2) internal_function;
-static reg_errcode_t re_node_set_init_union (re_node_set *dest,
-                                             const re_node_set *src1,
-                                             const re_node_set *src2) internal_function;
-static reg_errcode_t re_node_set_merge (re_node_set *dest,
-                                        const re_node_set *src) internal_function;
-static int re_node_set_insert (re_node_set *set, int elem) internal_function;
-static int re_node_set_insert_last (re_node_set *set,
-                                    int elem) internal_function;
-static int re_node_set_compare (const re_node_set *set1,
-                                const re_node_set *set2)
-     internal_function __attribute ((pure));
-static int re_node_set_contains (const re_node_set *set, int elem)
-     internal_function __attribute ((pure));
-static void re_node_set_remove_at (re_node_set *set, int idx) internal_function;
 #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)
-static int re_dfa_add_node (re_dfa_t *dfa, re_token_t token) internal_function;
-static re_dfastate_t *re_acquire_state (reg_errcode_t *err, re_dfa_t *dfa,
-                                        const re_node_set *nodes) internal_function;
-static re_dfastate_t *re_acquire_state_context (reg_errcode_t *err,
-                                                re_dfa_t *dfa,
-                                                const re_node_set *nodes,
-                                                unsigned int context) internal_function;
-static void free_state (re_dfastate_t *state) internal_function;
-#endif
 
 
@@ -725 +691 @@
 /* Inline functions for bitset operation.  */
 static inline void
-bitset_not (bitset set)
+bitset_not (bitset_t set)
 {
   int bitset_i;
-  for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
+  for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
     set[bitset_i] = ~set[bitset_i];
 }
 
 static inline void
-bitset_merge (bitset dest, const bitset src)
+bitset_merge (bitset_t dest, const bitset_t src)
 {
   int bitset_i;
-  for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
+  for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
     dest[bitset_i] |= src[bitset_i];
 }
 
 static inline void
-bitset_not_merge (bitset dest, const bitset src)
-{
-  int i;
-  for (i = 0; i < BITSET_UINTS; ++i)
-    dest[i] |= ~src[i];
-}
-
-static inline void
-bitset_mask (bitset dest, const bitset src)
+bitset_mask (bitset_t dest, const bitset_t src)
 {
   int bitset_i;
-  for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
+  for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
     dest[bitset_i] &= src[bitset_i];
 }
 
-#if defined RE_ENABLE_I18N && !defined RE_NO_INTERNAL_PROTOTYPES
+#ifdef RE_ENABLE_I18N
 /* Inline functions for re_string.  */
 static inline int
-internal_function
+internal_function __attribute ((pure))
 re_string_char_size_at (const re_string_t *pstr, int idx)
 {
@@ -772 +730 @@
 
 static inline wint_t
-internal_function
+internal_function __attribute ((pure))
 re_string_wchar_at (const re_string_t *pstr, int idx)
 {
@@ -781 +739 @@
 
 static int
-internal_function
+internal_function __attribute ((pure))
 re_string_elem_size_at (const re_string_t *pstr, int idx)
 {
-#ifdef _LIBC
+# ifdef _LIBC
   const unsigned char *p, *extra;
   const int32_t *table, *indirect;
   int32_t tmp;
-# include <locale/weight.h>
+#  include <locale/weight.h>
   uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
 
@@ -803 +761 @@
     }
   else
-#endif /* _LIBC */
+# endif /* _LIBC */
     return 1;
 }

branches/libc-0.6/src/emx/src/lib/lgpl/posix/regexec.c

@@ -26 +26 @@
                                           int str_idx, int from, int to)
      internal_function;
-static int search_cur_bkref_entry (re_match_context_t *mctx, int str_idx)
+static int search_cur_bkref_entry (const re_match_context_t *mctx, int str_idx)
      internal_function;
 static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, int node,
@@ -53 +53 @@
 static unsigned re_copy_regs (struct re_registers *regs, regmatch_t *pmatch,
                               int nregs, int regs_allocated) internal_function;
-static inline re_dfastate_t *acquire_init_state_context
-     (reg_errcode_t *err, const re_match_context_t *mctx, int idx)
-     __attribute ((always_inline)) internal_function;
 static reg_errcode_t prune_impossible_nodes (re_match_context_t *mctx)
      internal_function;
 static int check_matching (re_match_context_t *mctx, int fl_longest_match,
-                           int *p_match_first)
-     internal_function;
-static int check_halt_node_context (const re_dfa_t *dfa, int node,
-                                    unsigned int context) internal_function;
+                           int *p_match_first) internal_function;
 static int check_halt_state_context (const re_match_context_t *mctx,
                                      const re_dfastate_t *state, int idx)
      internal_function;
-static void update_regs (re_dfa_t *dfa, regmatch_t *pmatch,
+static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch,
                          regmatch_t *prev_idx_match, int cur_node,
                          int cur_idx, int nmatch) internal_function;
-static int proceed_next_node (const re_match_context_t *mctx,
-                              int nregs, regmatch_t *regs,
-                              int *pidx, int node, re_node_set *eps_via_nodes,
-                              struct re_fail_stack_t *fs) internal_function;
 static reg_errcode_t push_fail_stack (struct re_fail_stack_t *fs,
                                       int str_idx, int dest_node, int nregs,
                                       regmatch_t *regs,
-                                      re_node_set *eps_via_nodes) internal_function;
-static int pop_fail_stack (struct re_fail_stack_t *fs, int *pidx, int nregs,
-                           regmatch_t *regs, re_node_set *eps_via_nodes) internal_function;
+                                      re_node_set *eps_via_nodes)
+     internal_function;
 static reg_errcode_t set_regs (const regex_t *preg,
                                const re_match_context_t *mctx,
                                size_t nmatch, regmatch_t *pmatch,
                                int fl_backtrack) internal_function;
-static reg_errcode_t free_fail_stack_return (struct re_fail_stack_t *fs) internal_function;
+static reg_errcode_t free_fail_stack_return (struct re_fail_stack_t *fs)
+     internal_function;
 
 #ifdef RE_ENABLE_I18N
 static int sift_states_iter_mb (const re_match_context_t *mctx,
                                 re_sift_context_t *sctx,
-                                int node_idx, int str_idx, int max_str_idx) internal_function;
+                                int node_idx, int str_idx, int max_str_idx)
+     internal_function;
 #endif /* RE_ENABLE_I18N */
-static reg_errcode_t sift_states_backward (re_match_context_t *mctx,
-                                           re_sift_context_t *sctx) internal_function;
-static reg_errcode_t build_sifted_states (re_match_context_t *mctx,
+static reg_errcode_t sift_states_backward (const re_match_context_t *mctx,
+                                           re_sift_context_t *sctx)
+     internal_function;
+static reg_errcode_t build_sifted_states (const re_match_context_t *mctx,
                                           re_sift_context_t *sctx, int str_idx,
-                                          re_node_set *cur_dest) internal_function;
-static reg_errcode_t update_cur_sifted_state (re_match_context_t *mctx,
+                                          re_node_set *cur_dest)
+     internal_function;
+static reg_errcode_t update_cur_sifted_state (const re_match_context_t *mctx,
                                               re_sift_context_t *sctx,
                                               int str_idx,
-                                              re_node_set *dest_nodes) internal_function;
-static reg_errcode_t add_epsilon_src_nodes (re_dfa_t *dfa,
+                                              re_node_set *dest_nodes)
+     internal_function;
+static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa,
                                             re_node_set *dest_nodes,
-                                            const re_node_set *candidates) internal_function;
-static reg_errcode_t sub_epsilon_src_nodes (re_dfa_t *dfa, int node,
-                                            re_node_set *dest_nodes,
-                                            const re_node_set *and_nodes) internal_function;
-static int check_dst_limits (re_match_context_t *mctx, re_node_set *limits,
+                                            const re_node_set *candidates)
+     internal_function;
+static int check_dst_limits (const re_match_context_t *mctx,
+                             re_node_set *limits,
                              int dst_node, int dst_idx, int src_node,
                              int src_idx) internal_function;
-static int check_dst_limits_calc_pos_1 (re_match_context_t *mctx,
+static int check_dst_limits_calc_pos_1 (const re_match_context_t *mctx,
                                         int boundaries, int subexp_idx,
-                                        int from_node, int bkref_idx) internal_function;
-static int check_dst_limits_calc_pos (re_match_context_t *mctx,
+                                        int from_node, int bkref_idx)
+     internal_function;
+static int check_dst_limits_calc_pos (const re_match_context_t *mctx,
                                       int limit, int subexp_idx,
                                       int node, int str_idx,
                                       int bkref_idx) internal_function;
-static reg_errcode_t check_subexp_limits (re_dfa_t *dfa,
+static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa,
                                           re_node_set *dest_nodes,
                                           const re_node_set *candidates,
@@ -121 +115 @@
                                           struct re_backref_cache_entry *bkref_ents,
                                           int str_idx) internal_function;
-static reg_errcode_t sift_states_bkref (re_match_context_t *mctx,
+static reg_errcode_t sift_states_bkref (const re_match_context_t *mctx,
                                         re_sift_context_t *sctx,
-                                        int str_idx, const re_node_set *candidates) internal_function;
-static reg_errcode_t clean_state_log_if_needed (re_match_context_t *mctx,
-                                                int next_state_log_idx) internal_function;
-static reg_errcode_t merge_state_array (re_dfa_t *dfa, re_dfastate_t **dst,
-                                        re_dfastate_t **src, int num) internal_function;
+                                        int str_idx, const re_node_set *candidates)
+     internal_function;
+static reg_errcode_t merge_state_array (const re_dfa_t *dfa,
+                                        re_dfastate_t **dst,
+                                        re_dfastate_t **src, int num)
+     internal_function;
 static re_dfastate_t *find_recover_state (reg_errcode_t *err,
                                          re_match_context_t *mctx) internal_function;
@@ -135 +130 @@
 static re_dfastate_t *merge_state_with_log (reg_errcode_t *err,
                                             re_match_context_t *mctx,
-                                            re_dfastate_t *next_state) internal_function;
+                                            re_dfastate_t *next_state)
+     internal_function;
 static reg_errcode_t check_subexp_matching_top (re_match_context_t *mctx,
                                                 re_node_set *cur_nodes,
@@ -142 +138 @@
 static re_dfastate_t *transit_state_sb (reg_errcode_t *err,
                                         re_match_context_t *mctx,
-                                        re_dfastate_t *pstate) internal_function;
+                                        re_dfastate_t *pstate)
+     internal_function;
 #endif
 #ifdef RE_ENABLE_I18N
 static reg_errcode_t transit_state_mb (re_match_context_t *mctx,
-                                       re_dfastate_t *pstate) internal_function;
+                                       re_dfastate_t *pstate)
+     internal_function;
 #endif /* RE_ENABLE_I18N */
 static reg_errcode_t transit_state_bkref (re_match_context_t *mctx,
-                                          const re_node_set *nodes) internal_function;
+                                          const re_node_set *nodes)
+     internal_function;
 static reg_errcode_t get_subexp (re_match_context_t *mctx,
-                                 int bkref_node, int bkref_str_idx) internal_function;
+                                 int bkref_node, int bkref_str_idx)
+     internal_function;
 static reg_errcode_t get_subexp_sub (re_match_context_t *mctx,
                                      const re_sub_match_top_t *sub_top,
                                      re_sub_match_last_t *sub_last,
-                                     int bkref_node, int bkref_str) internal_function;
+                                     int bkref_node, int bkref_str)
+     internal_function;
 static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
                              int subexp_idx, int type) internal_function;
@@ -165 +166 @@
                                                    int str_idx,
                                                    re_node_set *cur_nodes,
-                                                   re_node_set *next_nodes) internal_function;
-static reg_errcode_t check_arrival_expand_ecl (re_dfa_t *dfa,
+                                                   re_node_set *next_nodes)
+     internal_function;
+static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa,
                                                re_node_set *cur_nodes,
-                                               int ex_subexp, int type) internal_function;
-static reg_errcode_t check_arrival_expand_ecl_sub (re_dfa_t *dfa,
+                                               int ex_subexp, int type)
+     internal_function;
+static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa,
                                                    re_node_set *dst_nodes,
                                                    int target, int ex_subexp,
@@ -175 +178 @@
 static reg_errcode_t expand_bkref_cache (re_match_context_t *mctx,
                                          re_node_set *cur_nodes, int cur_str,
-                                         int subexp_num, int type) internal_function;
-static int build_trtable (re_dfa_t *dfa,
+                                         int subexp_num, int type)
+     internal_function;
+static int build_trtable (const re_dfa_t *dfa,
                           re_dfastate_t *state) internal_function;
 #ifdef RE_ENABLE_I18N
-static int check_node_accept_bytes (re_dfa_t *dfa, int node_idx,
-                                    const re_string_t *input, int idx) internal_function;
+static int check_node_accept_bytes (const re_dfa_t *dfa, int node_idx,
+                                    const re_string_t *input, int idx)
+     internal_function;
 # ifdef _LIBC
 static unsigned int find_collation_sequence_value (const unsigned char *mbs,
-                                                   size_t name_len) internal_function;
+                                                   size_t name_len)
+     internal_function;
 # endif /* _LIBC */
 #endif /* RE_ENABLE_I18N */
-static int group_nodes_into_DFAstates (re_dfa_t *dfa,
+static int group_nodes_into_DFAstates (const re_dfa_t *dfa,
                                        const re_dfastate_t *state,
                                        re_node_set *states_node,
-                                       bitset *states_ch) internal_function;
+                                       bitset_t *states_ch) internal_function;
 static int check_node_accept (const re_match_context_t *mctx,
-                              const re_token_t *node, int idx) internal_function;
-static reg_errcode_t extend_buffers (re_match_context_t *mctx) internal_function;
+                              const re_token_t *node, int idx)
+     internal_function;
+static reg_errcode_t extend_buffers (re_match_context_t *mctx)
+     internal_function;
 
 
@@ -221 +229 @@
   reg_errcode_t err;
   int start, length;
-  re_dfa_t *dfa = (re_dfa_t *)preg->buffer;
+  re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
 
   if (eflags & ~(REG_NOTBOL | REG_NOTEOL | REG_STARTEND))
@@ -375 +383 @@
         if (BE (s == NULL, 0))
           return -2;
+#ifdef _LIBC
+        memcpy (__mempcpy (s, string1, length1), string2, length2);
+#else
         memcpy (s, string1, length1);
         memcpy (s + length1, string2, length2);
+#endif
         str = s;
         free_str = 1;
@@ -408 +420 @@
   int nregs, rval;
   int eflags = 0;
-  re_dfa_t *dfa = (re_dfa_t *)bufp->buffer;
+  re_dfa_t *dfa = (re_dfa_t *) bufp->buffer;
 
   /* Check for out-of-range.  */
@@ -618 +630 @@
 {
   reg_errcode_t err;
-  re_dfa_t *dfa = (re_dfa_t *)preg->buffer;
+  const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer;
   int left_lim, right_lim, incr;
   int fl_longest_match, match_first, match_kind, match_last = -1;
@@ -630 +642 @@
   char *fastmap = (preg->fastmap != NULL && preg->fastmap_accurate
                    && range && !preg->can_be_null) ? preg->fastmap : NULL;
-  unsigned RE_TRANSLATE_TYPE t = (unsigned RE_TRANSLATE_TYPE) preg->translate;
+  RE_TRANSLATE_TYPE t = preg->translate;
 
 #if !(defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L))
@@ -887 +899 @@
             if (BE (mctx.input.offsets_needed != 0, 0))
               {
-                if (pmatch[reg_idx].rm_so == mctx.input.valid_len)
-                  pmatch[reg_idx].rm_so += mctx.input.valid_raw_len - mctx.input.valid_len;
-                else
-                  pmatch[reg_idx].rm_so = mctx.input.offsets[pmatch[reg_idx].rm_so];
-                if (pmatch[reg_idx].rm_eo == mctx.input.valid_len)
-                  pmatch[reg_idx].rm_eo += mctx.input.valid_raw_len - mctx.input.valid_len;
-                else
-                  pmatch[reg_idx].rm_eo = mctx.input.offsets[pmatch[reg_idx].rm_eo];
+                pmatch[reg_idx].rm_so =
+                  (pmatch[reg_idx].rm_so == mctx.input.valid_len
+                   ? mctx.input.valid_raw_len
+                   : mctx.input.offsets[pmatch[reg_idx].rm_so]);
+                pmatch[reg_idx].rm_eo =
+                  (pmatch[reg_idx].rm_eo == mctx.input.valid_len
+                   ? mctx.input.valid_raw_len
+                   : mctx.input.offsets[pmatch[reg_idx].rm_eo]);
               }
 #else
@@ -931 +943 @@
      re_match_context_t *mctx;
 {
-  re_dfa_t *const dfa = mctx->dfa;
+  const re_dfa_t *const dfa = mctx->dfa;
   int halt_node, match_last;
   reg_errcode_t ret;
@@ -1014 +1026 @@
 
 static inline re_dfastate_t *
-acquire_init_state_context (err, mctx, idx)
-     reg_errcode_t *err;
-     const re_match_context_t *mctx;
-     int idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+__attribute ((always_inline)) internal_function
+acquire_init_state_context (reg_errcode_t *err, const re_match_context_t *mctx,
+                            int idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   if (dfa->init_state->has_constraint)
     {
@@ -1057 +1068 @@
 
 static int
-check_matching (mctx, fl_longest_match, p_match_first)
-    re_match_context_t *mctx;
-    int fl_longest_match;
-    int *p_match_first;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+check_matching (re_match_context_t *mctx, int fl_longest_match,
+                int *p_match_first)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   reg_errcode_t err;
   int match = 0;
@@ -1189 +1199 @@
 /* Check NODE match the current context.  */
 
-static int check_halt_node_context (dfa, node, context)
-    const re_dfa_t *dfa;
-    int node;
-    unsigned int context;
+static int
+internal_function
+check_halt_node_context (const re_dfa_t *dfa, int node, unsigned int context)
 {
   re_token_type_t type = dfa->nodes[node].type;
@@ -1210 +1219 @@
 
 static int
-check_halt_state_context (mctx, state, idx)
-    const re_match_context_t *mctx;
-    const re_dfastate_t *state;
-    int idx;
+internal_function
+check_halt_state_context (const re_match_context_t *mctx,
+                          const re_dfastate_t *state, int idx)
 {
   int i;
@@ -1233 +1241 @@
 
 static int
-proceed_next_node (mctx, nregs, regs, pidx, node, eps_via_nodes, fs)
-    const re_match_context_t *mctx;
-    regmatch_t *regs;
-    int nregs, *pidx, node;
-    re_node_set *eps_via_nodes;
-    struct re_fail_stack_t *fs;
-{
-  re_dfa_t *const dfa = mctx->dfa;
-  int i, err, dest_node;
-  dest_node = -1;
+internal_function
+proceed_next_node (const re_match_context_t *mctx, int nregs, regmatch_t *regs,
+                   int *pidx, int node, re_node_set *eps_via_nodes,
+                   struct re_fail_stack_t *fs)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
+  int i, err;
   if (IS_EPSILON_NODE (dfa->nodes[node].type))
     {
@@ -1308 +1313 @@
           if (naccepted == 0)
             {
+              int dest_node;
               err = re_node_set_insert (eps_via_nodes, node);
               if (BE (err < 0, 0))
@@ -1321 +1327 @@
           || check_node_accept (mctx, dfa->nodes + node, *pidx))
         {
-          dest_node = dfa->nexts[node];
+          int dest_node = dfa->nexts[node];
           *pidx = (naccepted == 0) ? *pidx + 1 : *pidx + naccepted;
           if (fs && (*pidx > mctx->match_last || mctx->state_log[*pidx] == NULL
@@ -1335 +1341 @@
 
 static reg_errcode_t
-push_fail_stack (fs, str_idx, dest_node, nregs, regs, eps_via_nodes)
-     struct re_fail_stack_t *fs;
-     int str_idx, dest_node, nregs;
-     regmatch_t *regs;
-     re_node_set *eps_via_nodes;
+internal_function
+push_fail_stack (struct re_fail_stack_t *fs, int str_idx, int dest_node,
+                 int nregs, regmatch_t *regs, re_node_set *eps_via_nodes)
 {
   reg_errcode_t err;
@@ -1364 +1368 @@
 
 static int
-pop_fail_stack (fs, pidx, nregs, regs, eps_via_nodes)
-     struct re_fail_stack_t *fs;
-     int *pidx, nregs;
-     regmatch_t *regs;
-     re_node_set *eps_via_nodes;
+internal_function
+pop_fail_stack (struct re_fail_stack_t *fs, int *pidx, int nregs,
+                regmatch_t *regs, re_node_set *eps_via_nodes)
 {
   int num = --fs->num;
@@ -1386 +1388 @@
 
 static reg_errcode_t
-set_regs (preg, mctx, nmatch, pmatch, fl_backtrack)
-     const regex_t *preg;
-     const re_match_context_t *mctx;
-     size_t nmatch;
-     regmatch_t *pmatch;
-     int fl_backtrack;
-{
-  re_dfa_t *dfa = (re_dfa_t *) preg->buffer;
+internal_function
+set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch,
+          regmatch_t *pmatch, int fl_backtrack)
+{
+  const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer;
   int idx, cur_node;
   re_node_set eps_via_nodes;
@@ -1399 +1398 @@
   struct re_fail_stack_t fs_body = { 0, 2, NULL };
   regmatch_t *prev_idx_match;
+  int prev_idx_match_malloced = 0;
 
 #ifdef DEBUG
@@ -1417 +1417 @@
   re_node_set_init_empty (&eps_via_nodes);
 
-  prev_idx_match = (regmatch_t *) alloca (sizeof (regmatch_t) * nmatch);
+  if (__libc_use_alloca (nmatch * sizeof (regmatch_t)))
+    prev_idx_match = (regmatch_t *) alloca (nmatch * sizeof (regmatch_t));
+  else
+    {
+      prev_idx_match = re_malloc (regmatch_t, nmatch);
+      if (prev_idx_match == NULL)
+        {
+          free_fail_stack_return (fs);
+          return REG_ESPACE;
+        }
+      prev_idx_match_malloced = 1;
+    }
   memcpy (prev_idx_match, pmatch, sizeof (regmatch_t) * nmatch);
 
@@ -1435 +1446 @@
                 {
                   re_node_set_free (&eps_via_nodes);
+                  if (prev_idx_match_malloced)
+                    re_free (prev_idx_match);
                   return free_fail_stack_return (fs);
                 }
@@ -1443 +1456 @@
             {
               re_node_set_free (&eps_via_nodes);
+              if (prev_idx_match_malloced)
+                re_free (prev_idx_match);
               return REG_NOERROR;
             }
@@ -1456 +1471 @@
             {
               re_node_set_free (&eps_via_nodes);
+              if (prev_idx_match_malloced)
+                re_free (prev_idx_match);
               free_fail_stack_return (fs);
               return REG_ESPACE;
@@ -1465 +1482 @@
             {
               re_node_set_free (&eps_via_nodes);
+              if (prev_idx_match_malloced)
+                re_free (prev_idx_match);
               return REG_NOMATCH;
             }
@@ -1470 +1489 @@
     }
   re_node_set_free (&eps_via_nodes);
+  if (prev_idx_match_malloced)
+    re_free (prev_idx_match);
   return free_fail_stack_return (fs);
 }
 
 static reg_errcode_t
-free_fail_stack_return (fs)
-     struct re_fail_stack_t *fs;
+internal_function
+free_fail_stack_return (struct re_fail_stack_t *fs)
 {
   if (fs)
@@ -1491 +1512 @@
 
 static void
-update_regs (dfa, pmatch, prev_idx_match, cur_node, cur_idx, nmatch)
-     re_dfa_t *dfa;
-     regmatch_t *pmatch, *prev_idx_match;
-     int cur_node, cur_idx, nmatch;
+internal_function
+update_regs (const re_dfa_t *dfa, regmatch_t *pmatch,
+             regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch)
 {
   int type = dfa->nodes[cur_node].type;
@@ -1564 +1584 @@
 
 static reg_errcode_t
-sift_states_backward (mctx, sctx)
-     re_match_context_t *mctx;
-     re_sift_context_t *sctx;
+internal_function
+sift_states_backward (const re_match_context_t *mctx, re_sift_context_t *sctx)
 {
   reg_errcode_t err;
@@ -1623 +1642 @@
 
 static reg_errcode_t
-build_sifted_states (mctx, sctx, str_idx, cur_dest)
-     re_match_context_t *mctx;
-     re_sift_context_t *sctx;
-     int str_idx;
-     re_node_set *cur_dest;
-{
-  re_dfa_t *const dfa = mctx->dfa;
-  re_node_set *cur_src = &mctx->state_log[str_idx]->non_eps_nodes;
+internal_function
+build_sifted_states (const re_match_context_t *mctx, re_sift_context_t *sctx,
+                     int str_idx, re_node_set *cur_dest)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
+  const re_node_set *cur_src = &mctx->state_log[str_idx]->non_eps_nodes;
   int i;
 
@@ -1687 +1704 @@
 
 static reg_errcode_t
-clean_state_log_if_needed (mctx, next_state_log_idx)
-    re_match_context_t *mctx;
-    int next_state_log_idx;
+internal_function
+clean_state_log_if_needed (re_match_context_t *mctx, int next_state_log_idx)
 {
   int top = mctx->state_log_top;
@@ -1713 +1729 @@
 
 static reg_errcode_t
-merge_state_array (dfa, dst, src, num)
-     re_dfa_t *dfa;
-     re_dfastate_t **dst;
-     re_dfastate_t **src;
-     int num;
+internal_function
+merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst,
+                   re_dfastate_t **src, int num)
 {
   int st_idx;
@@ -1742 +1756 @@
 
 static reg_errcode_t
-update_cur_sifted_state (mctx, sctx, str_idx, dest_nodes)
-     re_match_context_t *mctx;
-     re_sift_context_t *sctx;
-     int str_idx;
-     re_node_set *dest_nodes;
-{
-  re_dfa_t *const dfa = mctx->dfa;
-  reg_errcode_t err;
+internal_function
+update_cur_sifted_state (const re_match_context_t *mctx,
+                         re_sift_context_t *sctx, int str_idx,
+                         re_node_set *dest_nodes)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
+  reg_errcode_t err = REG_NOERROR;
   const re_node_set *candidates;
   candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
@@ -1791 +1804 @@
 
 static reg_errcode_t
-add_epsilon_src_nodes (dfa, dest_nodes, candidates)
-     re_dfa_t *dfa;
-     re_node_set *dest_nodes;
-     const re_node_set *candidates;
+internal_function
+add_epsilon_src_nodes (const re_dfa_t *dfa, re_node_set *dest_nodes,
+                       const re_node_set *candidates)
 {
   reg_errcode_t err = REG_NOERROR;
@@ -1817 +1829 @@
 
 static reg_errcode_t
-sub_epsilon_src_nodes (dfa, node, dest_nodes, candidates)
-     re_dfa_t *dfa;
-     int node;
-     re_node_set *dest_nodes;
-     const re_node_set *candidates;
+internal_function
+sub_epsilon_src_nodes (const re_dfa_t *dfa, int node, re_node_set *dest_nodes,
+                       const re_node_set *candidates)
 {
     int ecl_idx;
@@ -1868 +1878 @@
 
 static int
-check_dst_limits (mctx, limits, dst_node, dst_idx, src_node, src_idx)
-     re_match_context_t *mctx;
-     re_node_set *limits;
-     int dst_node, dst_idx, src_node, src_idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+check_dst_limits (const re_match_context_t *mctx, re_node_set *limits,
+                  int dst_node, int dst_idx, int src_node, int src_idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int lim_idx, src_pos, dst_pos;
 
@@ -1905 +1914 @@
 
 static int
-check_dst_limits_calc_pos_1 (mctx, boundaries, subexp_idx, from_node, bkref_idx)
-     re_match_context_t *mctx;
-     int boundaries, subexp_idx, from_node, bkref_idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
-  re_node_set *eclosures = dfa->eclosures + from_node;
+internal_function
+check_dst_limits_calc_pos_1 (const re_match_context_t *mctx, int boundaries,
+                             int subexp_idx, int from_node, int bkref_idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
+  const re_node_set *eclosures = dfa->eclosures + from_node;
   int node_idx;
 
@@ -1931 +1940 @@
                     continue;
 
-                  if (subexp_idx <= 8 * sizeof (ent->eps_reachable_subexps_map)
-                      && !(ent->eps_reachable_subexps_map & (1 << subexp_idx)))
+                  if (subexp_idx < BITSET_WORD_BITS
+                      && !(ent->eps_reachable_subexps_map
+                           & ((bitset_word_t) 1 << subexp_idx)))
                     continue;
 
@@ -1958 +1968 @@
                     return 0;
 
-                  ent->eps_reachable_subexps_map &= ~(1 << subexp_idx);
+                  if (subexp_idx < BITSET_WORD_BITS)
+                    ent->eps_reachable_subexps_map
+                      &= ~((bitset_word_t) 1 << subexp_idx);
                 }
               while (ent++->more);
@@ -1983 +1995 @@
 
 static int
-check_dst_limits_calc_pos (mctx, limit, subexp_idx, from_node, str_idx, bkref_idx)
-     re_match_context_t *mctx;
-     int limit, subexp_idx, from_node, str_idx, bkref_idx;
+internal_function
+check_dst_limits_calc_pos (const re_match_context_t *mctx, int limit,
+                           int subexp_idx, int from_node, int str_idx,
+                           int bkref_idx)
 {
   struct re_backref_cache_entry *lim = mctx->bkref_ents + limit;
@@ -2012 +2025 @@
 
 static reg_errcode_t
-check_subexp_limits (dfa, dest_nodes, candidates, limits, bkref_ents, str_idx)
-     re_dfa_t *dfa;
-     re_node_set *dest_nodes;
-     const re_node_set *candidates;
-     re_node_set *limits;
-     struct re_backref_cache_entry *bkref_ents;
-     int str_idx;
+internal_function
+check_subexp_limits (const re_dfa_t *dfa, re_node_set *dest_nodes,
+                     const re_node_set *candidates, re_node_set *limits,
+                     struct re_backref_cache_entry *bkref_ents, int str_idx)
 {
   reg_errcode_t err;
@@ -2103 +2113 @@
 
 static reg_errcode_t
-sift_states_bkref (mctx, sctx, str_idx, candidates)
-     re_match_context_t *mctx;
-     re_sift_context_t *sctx;
-     int str_idx;
-     const re_node_set *candidates;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+sift_states_bkref (const re_match_context_t *mctx, re_sift_context_t *sctx,
+                   int str_idx, const re_node_set *candidates)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   reg_errcode_t err;
   int node_idx, node;
@@ -2137 +2145 @@
       do
         {
-          int subexp_len, to_idx, dst_node;
+          int subexp_len;
+          int to_idx;
+          int dst_node;
+          int ret;
           re_dfastate_t *cur_state;
 
@@ -2163 +2174 @@
           local_sctx.last_node = node;
           local_sctx.last_str_idx = str_idx;
-          err = re_node_set_insert (&local_sctx.limits, enabled_idx);
-          if (BE (err < 0, 0))
+          ret = re_node_set_insert (&local_sctx.limits, enabled_idx);
+          if (BE (ret < 0, 0))
             {
               err = REG_ESPACE;
@@ -2202 +2213 @@
 #ifdef RE_ENABLE_I18N
 static int
-sift_states_iter_mb (mctx, sctx, node_idx, str_idx, max_str_idx)
-    const re_match_context_t *mctx;
-    re_sift_context_t *sctx;
-    int node_idx, str_idx, max_str_idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+sift_states_iter_mb (const re_match_context_t *mctx, re_sift_context_t *sctx,
+                     int node_idx, int str_idx, int max_str_idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int naccepted;
   /* Check the node can accept `multi byte'.  */
@@ -2234 +2244 @@
 
 static re_dfastate_t *
-transit_state (err, mctx, state)
-     reg_errcode_t *err;
-     re_match_context_t *mctx;
-     re_dfastate_t *state;
+internal_function
+transit_state (reg_errcode_t *err, re_match_context_t *mctx,
+               re_dfastate_t *state)
 {
   re_dfastate_t **trtable;
@@ -2292 +2301 @@
 
 /* Update the state_log if we need */
-static re_dfastate_t *
-merge_state_with_log (err, mctx, next_state)
-     reg_errcode_t *err;
-     re_match_context_t *mctx;
-     re_dfastate_t *next_state;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+re_dfastate_t *
+internal_function
+merge_state_with_log (reg_errcode_t *err, re_match_context_t *mctx,
+                      re_dfastate_t *next_state)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int cur_idx = re_string_cur_idx (&mctx->input);
 
@@ -2373 +2381 @@
    from which to restart matching.  */
 re_dfastate_t *
-find_recover_state (err, mctx)
-     reg_errcode_t *err;
-     re_match_context_t *mctx;
-{
-  re_dfastate_t *cur_state = NULL;
+internal_function
+find_recover_state (reg_errcode_t *err, re_match_context_t *mctx)
+{
+  re_dfastate_t *cur_state;
   do
     {
@@ -2393 +2400 @@
       cur_state = merge_state_with_log (err, mctx, NULL);
     }
-  while (err == REG_NOERROR && cur_state == NULL);
+  while (*err == REG_NOERROR && cur_state == NULL);
   return cur_state;
 }
@@ -2405 +2412 @@
 
 static reg_errcode_t
-check_subexp_matching_top (mctx, cur_nodes, str_idx)
-     re_match_context_t *mctx;
-     re_node_set *cur_nodes;
-     int str_idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes,
+                           int str_idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int node_idx;
   reg_errcode_t err;
@@ -2423 +2429 @@
       int node = cur_nodes->elems[node_idx];
       if (dfa->nodes[node].type == OP_OPEN_SUBEXP
-          && dfa->nodes[node].opr.idx < (8 * sizeof (dfa->used_bkref_map))
-          && dfa->used_bkref_map & (1 << dfa->nodes[node].opr.idx))
+          && dfa->nodes[node].opr.idx < BITSET_WORD_BITS
+          && (dfa->used_bkref_map
+              & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx)))
         {
           err = match_ctx_add_subtop (mctx, node, str_idx);
@@ -2439 +2446 @@
 
 static re_dfastate_t *
-transit_state_sb (err, mctx, state)
-     reg_errcode_t *err;
-     re_match_context_t *mctx;
-     re_dfastate_t *state;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+transit_state_sb (reg_errcode_t *err, re_match_context_t *mctx,
+                  re_dfastate_t *state)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   re_node_set next_nodes;
   re_dfastate_t *next_state;
@@ -2480 +2485 @@
 #ifdef RE_ENABLE_I18N
 static reg_errcode_t
-transit_state_mb (mctx, pstate)
-    re_match_context_t *mctx;
-    re_dfastate_t *pstate;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+transit_state_mb (re_match_context_t *mctx, re_dfastate_t *pstate)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   reg_errcode_t err;
   int i;
@@ -2537 +2541 @@
             return err;
         }
-      context = re_string_context_at (&mctx->input, dest_idx - 1, mctx->eflags);
+      context = re_string_context_at (&mctx->input, dest_idx - 1,
+                                      mctx->eflags);
       mctx->state_log[dest_idx]
         = re_acquire_state_context (&err, dfa, &dest_nodes, context);
@@ -2550 +2555 @@
 
 static reg_errcode_t
-transit_state_bkref (mctx, nodes)
-    re_match_context_t *mctx;
-    const re_node_set *nodes;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+transit_state_bkref (re_match_context_t *mctx, const re_node_set *nodes)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   reg_errcode_t err;
   int i;
@@ -2665 +2669 @@
 
 static reg_errcode_t
-get_subexp (mctx, bkref_node, bkref_str_idx)
-     re_match_context_t *mctx;
-     int bkref_node, bkref_str_idx;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+get_subexp (re_match_context_t *mctx, int bkref_node, int bkref_str_idx)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int subexp_num, sub_top_idx;
   const char *buf = (const char *) re_string_get_buffer (&mctx->input);
@@ -2676 +2679 @@
   if (cache_idx != -1)
     {
-      const struct re_backref_cache_entry *entry = mctx->bkref_ents + cache_idx;
+      const struct re_backref_cache_entry *entry
+        = mctx->bkref_ents + cache_idx;
       do
         if (entry->node == bkref_node)
@@ -2723 +2727 @@
                 }
               if (memcmp (buf + bkref_str_off, buf + sl_str, sl_str_diff) != 0)
-                break; /* We don't need to search this sub expression any more.  */
+                /* We don't need to search this sub expression any more.  */
+                break;
             }
           bkref_str_off += sl_str_diff;
@@ -2774 +2779 @@
           /* Does this state have a ')' of the sub expression?  */
           nodes = &mctx->state_log[sl_str]->nodes;
-          cls_node = find_subexp_node (dfa, nodes, subexp_num, OP_CLOSE_SUBEXP);
+          cls_node = find_subexp_node (dfa, nodes, subexp_num,
+                                       OP_CLOSE_SUBEXP);
           if (cls_node == -1)
             continue; /* No.  */
@@ -2787 +2793 @@
              in the current context?  */
           err = check_arrival (mctx, sub_top->path, sub_top->node,
-                               sub_top->str_idx, cls_node, sl_str, OP_CLOSE_SUBEXP);
+                               sub_top->str_idx, cls_node, sl_str,
+                               OP_CLOSE_SUBEXP);
           if (err == REG_NOMATCH)
               continue;
@@ -2811 +2818 @@
 
 static reg_errcode_t
-get_subexp_sub (mctx, sub_top, sub_last, bkref_node, bkref_str)
-     re_match_context_t *mctx;
-     const re_sub_match_top_t *sub_top;
-     re_sub_match_last_t *sub_last;
-     int bkref_node, bkref_str;
+internal_function
+get_subexp_sub (re_match_context_t *mctx, const re_sub_match_top_t *sub_top,
+                re_sub_match_last_t *sub_last, int bkref_node, int bkref_str)
 {
   reg_errcode_t err;
@@ -2821 +2826 @@
   /* Can the subexpression arrive the back reference?  */
   err = check_arrival (mctx, &sub_last->path, sub_last->node,
-                       sub_last->str_idx, bkref_node, bkref_str, OP_OPEN_SUBEXP);
+                       sub_last->str_idx, bkref_node, bkref_str,
+                       OP_OPEN_SUBEXP);
   if (err != REG_NOERROR)
     return err;
@@ -2841 +2847 @@
 
 static int
-find_subexp_node (dfa, nodes, subexp_idx, type)
-     const re_dfa_t *dfa;
-     const re_node_set *nodes;
-     int subexp_idx, type;
+internal_function
+find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
+                  int subexp_idx, int type)
 {
   int cls_idx;
@@ -2864 +2869 @@
 
 static reg_errcode_t
-check_arrival (mctx, path, top_node, top_str, last_node, last_str,
-               type)
-     re_match_context_t *mctx;
-     state_array_t *path;
-     int top_node, top_str, last_node, last_str, type;
-{
-  re_dfa_t *const dfa = mctx->dfa;
-  reg_errcode_t err;
+internal_function
+check_arrival (re_match_context_t *mctx, state_array_t *path, int top_node,
+               int top_str, int last_node, int last_str, int type)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
+  reg_errcode_t err = REG_NOERROR;
   int subexp_num, backup_cur_idx, str_idx, null_cnt;
   re_dfastate_t *cur_state = NULL;
@@ -2886 +2889 @@
       path->alloc += last_str + mctx->max_mb_elem_len + 1;
       new_array = re_realloc (path->array, re_dfastate_t *, path->alloc);
-      if (new_array == NULL)
+      if (BE (new_array == NULL, 0))
         {
           path->alloc = old_alloc;
@@ -2896 +2899 @@
     }
 
-  str_idx = path->next_idx == 0 ? top_str : path->next_idx;
+  str_idx = path->next_idx ?: top_str;
 
   /* Temporary modify MCTX.  */
@@ -2924 +2927 @@
         {
           err = re_node_set_init_copy (&next_nodes, &cur_state->nodes);
-          if (BE ( err != REG_NOERROR, 0))
+          if (BE (err != REG_NOERROR, 0))
             return err;
         }
@@ -2936 +2939 @@
           err = expand_bkref_cache (mctx, &next_nodes, str_idx,
                                     subexp_num, type);
-          if (BE ( err != REG_NOERROR, 0))
+          if (BE (err != REG_NOERROR, 0))
             {
               re_node_set_free (&next_nodes);
@@ -2967 +2970 @@
         {
           err = check_arrival_add_next_nodes (mctx, str_idx,
-                                              &cur_state->non_eps_nodes, &next_nodes);
+                                              &cur_state->non_eps_nodes,
+                                              &next_nodes);
           if (BE (err != REG_NOERROR, 0))
             {
@@ -2985 +2989 @@
           err = expand_bkref_cache (mctx, &next_nodes, str_idx,
                                     subexp_num, type);
-          if (BE ( err != REG_NOERROR, 0))
+          if (BE (err != REG_NOERROR, 0))
             {
               re_node_set_free (&next_nodes);
@@ -3026 +3030 @@
 
 static reg_errcode_t
-check_arrival_add_next_nodes (mctx, str_idx, cur_nodes, next_nodes)
-     re_match_context_t *mctx;
-     int str_idx;
-     re_node_set *cur_nodes, *next_nodes;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+check_arrival_add_next_nodes (re_match_context_t *mctx, int str_idx,
+                              re_node_set *cur_nodes, re_node_set *next_nodes)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   int result;
   int cur_idx;
-#ifdef RE_ENABLE_I18N
-  reg_errcode_t err;
-#endif
+  reg_errcode_t err = REG_NOERROR;
   re_node_set union_set;
   re_node_set_init_empty (&union_set);
@@ -3108 +3109 @@
 
 static reg_errcode_t
-check_arrival_expand_ecl (dfa, cur_nodes, ex_subexp, type)
-     re_dfa_t *dfa;
-     re_node_set *cur_nodes;
-     int ex_subexp, type;
+internal_function
+check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes,
+                          int ex_subexp, int type)
 {
   reg_errcode_t err;
@@ -3128 +3128 @@
     {
       int cur_node = cur_nodes->elems[idx];
-      re_node_set *eclosure = dfa->eclosures + cur_node;
+      const re_node_set *eclosure = dfa->eclosures + cur_node;
       outside_node = find_subexp_node (dfa, eclosure, ex_subexp, type);
       if (outside_node == -1)
@@ -3162 +3162 @@
 
 static reg_errcode_t
-check_arrival_expand_ecl_sub (dfa, dst_nodes, target, ex_subexp, type)
-     re_dfa_t *dfa;
-     int target, ex_subexp, type;
-     re_node_set *dst_nodes;
+internal_function
+check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_node_set *dst_nodes,
+                              int target, int ex_subexp, int type)
 {
   int cur_node;
@@ -3207 +3206 @@
 
 static reg_errcode_t
-expand_bkref_cache (mctx, cur_nodes, cur_str, subexp_num,
-                    type)
-     re_match_context_t *mctx;
-     int cur_str, subexp_num, type;
-     re_node_set *cur_nodes;
-{
-  re_dfa_t *const dfa = mctx->dfa;
+internal_function
+expand_bkref_cache (re_match_context_t *mctx, re_node_set *cur_nodes,
+                    int cur_str, int subexp_num, int type)
+{
+  const re_dfa_t *const dfa = mctx->dfa;
   reg_errcode_t err;
   int cache_idx_start = search_cur_bkref_entry (mctx, cur_str);
@@ -3298 +3295 @@
 
 static int
-build_trtable (dfa, state)
-    re_dfa_t *dfa;
-    re_dfastate_t *state;
+internal_function
+build_trtable (const re_dfa_t *dfa, re_dfastate_t *state)
 {
   reg_errcode_t err;
   int i, j, ch, need_word_trtable = 0;
-  unsigned int elem, mask;
-  int dests_node_malloced = 0, dest_states_malloced = 0;
+  bitset_word_t elem, mask;
+  bool dests_node_malloced = false;
+  bool dest_states_malloced = false;
   int ndests; /* Number of the destination states from `state'.  */
   re_dfastate_t **trtable;
   re_dfastate_t **dest_states = NULL, **dest_states_word, **dest_states_nl;
   re_node_set follows, *dests_node;
-  bitset *dests_ch;
-  bitset acceptable;
+  bitset_t *dests_ch;
+  bitset_t acceptable;
+
+  struct dests_alloc
+  {
+    re_node_set dests_node[SBC_MAX];
+    bitset_t dests_ch[SBC_MAX];
+  } *dests_alloc;
 
   /* We build DFA states which corresponds to the destination nodes
@@ -3317 +3320 @@
      destination state contains, and `dests_ch[i]' represents the
      characters which i-th destination state accepts.  */
-#ifdef _LIBC
-  if (__libc_use_alloca ((sizeof (re_node_set) + sizeof (bitset)) * SBC_MAX))
-    dests_node = (re_node_set *)
-      alloca ((sizeof (re_node_set) + sizeof (bitset)) * SBC_MAX);
+  if (__libc_use_alloca (sizeof (struct dests_alloc)))
+    dests_alloc = (struct dests_alloc *) alloca (sizeof (struct dests_alloc));
   else
-#endif
-    {
-      dests_node = (re_node_set *)
-        malloc ((sizeof (re_node_set) + sizeof (bitset)) * SBC_MAX);
-      if (BE (dests_node == NULL, 0))
+    {
+      dests_alloc = re_malloc (struct dests_alloc, 1);
+      if (BE (dests_alloc == NULL, 0))
         return 0;
-      dests_node_malloced = 1;
-    }
-  dests_ch = (bitset *) (dests_node + SBC_MAX);
+      dests_node_malloced = true;
+    }
+  dests_node = dests_alloc->dests_node;
+  dests_ch = dests_alloc->dests_ch;
 
   /* Initialize transiton table.  */
@@ -3341 +3341 @@
     {
       if (dests_node_malloced)
-        free (dests_node);
+        free (dests_alloc);
       /* Return 0 in case of an error, 1 otherwise.  */
       if (ndests == 0)
@@ -3356 +3356 @@
     goto out_free;
 
-#ifdef _LIBC
-  if (__libc_use_alloca ((sizeof (re_node_set) + sizeof (bitset)) * SBC_MAX
+  if (__libc_use_alloca ((sizeof (re_node_set) + sizeof (bitset_t)) * SBC_MAX
                          + ndests * 3 * sizeof (re_dfastate_t *)))
     dest_states = (re_dfastate_t **)
       alloca (ndests * 3 * sizeof (re_dfastate_t *));
   else
-#endif
     {
       dest_states = (re_dfastate_t **)
@@ -3375 +3373 @@
             re_node_set_free (dests_node + i);
           if (dests_node_malloced)
-            free (dests_node);
+            free (dests_alloc);
           return 0;
         }
-      dest_states_malloced = 1;
+      dest_states_malloced = true;
     }
   dest_states_word = dest_states + ndests;
@@ -3440 +3438 @@
 
       /* For all characters ch...:  */
-      for (i = 0; i < BITSET_UINTS; ++i)
-        for (ch = i * UINT_BITS, elem = acceptable[i], mask = 1;
+      for (i = 0; i < BITSET_WORDS; ++i)
+        for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;
              elem;
              mask <<= 1, elem >>= 1, ++ch)
@@ -3471 +3469 @@
 
       /* For all characters ch...:  */
-      for (i = 0; i < BITSET_UINTS; ++i)
-        for (ch = i * UINT_BITS, elem = acceptable[i], mask = 1;
+      for (i = 0; i < BITSET_WORDS; ++i)
+        for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;
              elem;
              mask <<= 1, elem >>= 1, ++ch)
@@ -3513 +3511 @@
 
   if (dests_node_malloced)
-    free (dests_node);
+    free (dests_alloc);
 
   return 1;
@@ -3524 +3522 @@
 
 static int
-group_nodes_into_DFAstates (dfa, state, dests_node, dests_ch)
-    re_dfa_t *dfa;
-    const re_dfastate_t *state;
-    re_node_set *dests_node;
-    bitset *dests_ch;
+internal_function
+group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state,
+                            re_node_set *dests_node, bitset_t *dests_ch)
 {
   reg_errcode_t err;
@@ -3534 +3530 @@
   int i, j, k;
   int ndests; /* Number of the destinations from `state'.  */
-  bitset accepts; /* Characters a node can accept.  */
+  bitset_t accepts; /* Characters a node can accept.  */
   const re_node_set *cur_nodes = &state->nodes;
   bitset_empty (accepts);
@@ -3569 +3565 @@
       else if (type == OP_UTF8_PERIOD)
         {
-          memset (accepts, 255, sizeof (unsigned int) * BITSET_UINTS / 2);
+          memset (accepts, '\xff', sizeof (bitset_t) / 2);
           if (!(dfa->syntax & RE_DOT_NEWLINE))
             bitset_clear (accepts, '\n');
@@ -3585 +3581 @@
           if (constraint & NEXT_NEWLINE_CONSTRAINT)
             {
-              int accepts_newline = bitset_contain (accepts, NEWLINE_CHAR);
+              bool accepts_newline = bitset_contain (accepts, NEWLINE_CHAR);
               bitset_empty (accepts);
               if (accepts_newline)
@@ -3600 +3596 @@
           if (constraint & NEXT_WORD_CONSTRAINT)
             {
-              unsigned int any_set = 0;
+              bitset_word_t any_set = 0;
               if (type == CHARACTER && !node->word_char)
                 {
@@ -3608 +3604 @@
 #ifdef RE_ENABLE_I18N
               if (dfa->mb_cur_max > 1)
-                for (j = 0; j < BITSET_UINTS; ++j)
+                for (j = 0; j < BITSET_WORDS; ++j)
                   any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j]));
               else
 #endif
-                for (j = 0; j < BITSET_UINTS; ++j)
+                for (j = 0; j < BITSET_WORDS; ++j)
                   any_set |= (accepts[j] &= dfa->word_char[j]);
               if (!any_set)
@@ -3619 +3615 @@
           if (constraint & NEXT_NOTWORD_CONSTRAINT)
             {
-              unsigned int any_set = 0;
+              bitset_word_t any_set = 0;
               if (type == CHARACTER && node->word_char)
                 {
@@ -3627 +3623 @@
 #ifdef RE_ENABLE_I18N
               if (dfa->mb_cur_max > 1)
-                for (j = 0; j < BITSET_UINTS; ++j)
+                for (j = 0; j < BITSET_WORDS; ++j)
                   any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j]));
               else
 #endif
-                for (j = 0; j < BITSET_UINTS; ++j)
+                for (j = 0; j < BITSET_WORDS; ++j)
                   any_set |= (accepts[j] &= ~dfa->word_char[j]);
               if (!any_set)
@@ -3642 +3638 @@
       for (j = 0; j < ndests; ++j)
         {
-          bitset intersec; /* Intersection sets, see below.  */
-          bitset remains;
+          bitset_t intersec; /* Intersection sets, see below.  */
+          bitset_t remains;
           /* Flags, see below.  */
-          int has_intersec, not_subset, not_consumed;
+          bitset_word_t has_intersec, not_subset, not_consumed;
 
           /* Optimization, skip if this state doesn't accept the character.  */
@@ -3653 +3649 @@
           /* Enumerate the intersection set of this state and `accepts'.  */
           has_intersec = 0;
-          for (k = 0; k < BITSET_UINTS; ++k)
+          for (k = 0; k < BITSET_WORDS; ++k)
             has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k];
           /* And skip if the intersection set is empty.  */
@@ -3661 +3657 @@
           /* Then check if this state is a subset of `accepts'.  */
           not_subset = not_consumed = 0;
-          for (k = 0; k < BITSET_UINTS; ++k)
+          for (k = 0; k < BITSET_WORDS; ++k)
             {
               not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k];
@@ -3716 +3712 @@
 
 static int
-check_node_accept_bytes (dfa, node_idx, input, str_idx)
-    re_dfa_t *dfa;
-    int node_idx, str_idx;
-    const re_string_t *input;
+internal_function
+check_node_accept_bytes (const re_dfa_t *dfa, int node_idx,
+                         const re_string_t *input, int str_idx)
 {
   const re_token_t *node = dfa->nodes + node_idx;
@@ -3953 +3948 @@
 # ifdef _LIBC
 static unsigned int
-find_collation_sequence_value (mbs, mbs_len)
-    const unsigned char *mbs;
-    size_t mbs_len;
+internal_function
+find_collation_sequence_value (const unsigned char *mbs, size_t mbs_len)
 {
   uint32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
@@ -4017 +4011 @@
 
 static int
-check_node_accept (mctx, node, idx)
-    const re_match_context_t *mctx;
-    const re_token_t *node;
-    int idx;
+internal_function
+check_node_accept (const re_match_context_t *mctx, const re_token_t *node,
+                   int idx)
 {
   unsigned char ch;
@@ -4068 +4061 @@
 
 static reg_errcode_t
-extend_buffers (mctx)
-     re_match_context_t *mctx;
+internal_function
+extend_buffers (re_match_context_t *mctx)
 {
   reg_errcode_t ret;
@@ -4128 +4121 @@
 
 static reg_errcode_t
-match_ctx_init (mctx, eflags, n)
-    re_match_context_t *mctx;
-    int eflags, n;
+internal_function
+match_ctx_init (re_match_context_t *mctx, int eflags, int n)
 {
   mctx->eflags = eflags;
@@ -4157 +4149 @@
 
 static void
-match_ctx_clean (mctx)
-    re_match_context_t *mctx;
+internal_function
+match_ctx_clean (re_match_context_t *mctx)
 {
   int st_idx;
@@ -4187 +4179 @@
 
 static void
-match_ctx_free (mctx)
-    re_match_context_t *mctx;
+internal_function
+match_ctx_free (re_match_context_t *mctx)
 {
   /* First, free all the memory associated with MCTX->SUB_TOPS.  */
@@ -4202 +4194 @@
 
 static reg_errcode_t
-match_ctx_add_entry (mctx, node, str_idx, from, to)
-     re_match_context_t *mctx;
-     int node, str_idx, from, to;
+internal_function
+match_ctx_add_entry (re_match_context_t *mctx, int node, int str_idx, int from,
+                     int to)
 {
   if (mctx->nbkref_ents >= mctx->abkref_ents)
@@ -4251 +4243 @@
 
 static int
-search_cur_bkref_entry (mctx, str_idx)
-     re_match_context_t *mctx;
-     int str_idx;
+internal_function
+search_cur_bkref_entry (const re_match_context_t *mctx, int str_idx)
 {
   int left, right, mid, last;
@@ -4275 +4266 @@
 
 static reg_errcode_t
-match_ctx_add_subtop (mctx, node, str_idx)
-     re_match_context_t *mctx;
-     int node, str_idx;
+internal_function
+match_ctx_add_subtop (re_match_context_t *mctx, int node, int str_idx)
 {
 #ifdef DEBUG
@@ -4306 +4296 @@
 
 static re_sub_match_last_t *
-match_ctx_add_sublast (subtop, node, str_idx)
-     re_sub_match_top_t *subtop;
-     int node, str_idx;
+internal_function
+match_ctx_add_sublast (re_sub_match_top_t *subtop, int node, int str_idx)
 {
   re_sub_match_last_t *new_entry;
@@ -4334 +4323 @@
 
 static void
-sift_ctx_init (sctx, sifted_sts, limited_sts, last_node, last_str_idx)
-    re_sift_context_t *sctx;
-    re_dfastate_t **sifted_sts, **limited_sts;
-    int last_node, last_str_idx;
+internal_function
+sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts,
+               re_dfastate_t **limited_sts, int last_node, int last_str_idx)
 {
   sctx->sifted_states = sifted_sts;