1 /* Extended regular expression matching and search library.
2 Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License along
17 with this program; if not, write to the Free Software Foundation,
18 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
20 #ifndef _REGEX_INTERNAL_H
21 #define _REGEX_INTERNAL_H 1
34 #if defined HAVE_LANGINFO_H || defined HAVE_LANGINFO_CODESET || defined _LIBC
35 # include <langinfo.h>
37 #if defined HAVE_LOCALE_H || defined _LIBC
40 #if defined HAVE_WCHAR_H || defined _LIBC
42 #endif /* HAVE_WCHAR_H || _LIBC */
43 #if defined HAVE_WCTYPE_H || defined _LIBC
45 #endif /* HAVE_WCTYPE_H || _LIBC */
47 # include <bits/libc-lock.h>
49 # define __libc_lock_define(CLASS,NAME)
50 # define __libc_lock_init(NAME) do { } while (0)
51 # define __libc_lock_lock(NAME) do { } while (0)
52 # define __libc_lock_unlock(NAME) do { } while (0)
55 /* In case that the system doesn't have isblank(). */
56 #if !defined _LIBC && !defined HAVE_ISBLANK && !defined isblank
57 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
61 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
62 # define _RE_DEFINE_LOCALE_FUNCTIONS 1
63 # include <locale/localeinfo.h>
64 # include <locale/elem-hash.h>
65 # include <locale/coll-lookup.h>
69 /* This is for other GNU distributions with internationalized messages. */
70 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
74 # define gettext(msgid) \
75 INTUSE(__dcgettext) (_libc_intl_domainname, msgid, LC_MESSAGES)
78 # define gettext(msgid) (msgid)
82 /* This define is so xgettext can find the internationalizable
84 # define gettext_noop(String) String
87 #if (defined MB_CUR_MAX && HAVE_LOCALE_H && HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_WCRTOMB && HAVE_MBRTOWC && HAVE_WCSCOLL) || _LIBC
88 # define RE_ENABLE_I18N
92 # define BE(expr, val) __builtin_expect (expr, val)
94 # define BE(expr, val) (expr)
97 /* Number of single byte character. */
100 #define COLL_ELEM_LEN_MAX 8
102 /* The character which represents newline. */
103 #define NEWLINE_CHAR '\n'
104 #define WIDE_NEWLINE_CHAR L'\n'
106 /* Rename to standard API for using out of glibc. */
108 # define __wctype wctype
109 # define __iswctype iswctype
110 # define __btowc btowc
112 # define __mempcpy mempcpy
114 # define __wcrtomb wcrtomb
115 # define __regfree regfree
116 # define attribute_hidden
117 #endif /* not _LIBC */
119 #if __GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)
120 # define __attribute(arg) __attribute__ (arg)
122 # define __attribute(arg)
125 extern const char __re_error_msgid[] attribute_hidden;
126 extern const size_t __re_error_msgid_idx[] attribute_hidden;
128 typedef __re_idx_t Idx;
130 /* Special return value for failure to match. */
131 #define REG_MISSING ((Idx) -1)
133 /* Special return value for internal error. */
134 #define REG_ERROR ((Idx) -2)
136 /* Test whether N is a valid index, and is not one of the above. */
137 #ifdef _REGEX_LARGE_OFFSETS
138 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR)
140 # define REG_VALID_INDEX(n) (0 <= (n))
143 /* Test whether N is a valid nonzero index. */
144 #ifdef _REGEX_LARGE_OFFSETS
145 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1))
147 # define REG_VALID_NONZERO_INDEX(n) (0 < (n))
150 /* A hash value, suitable for computing hash tables. */
151 typedef __re_size_t re_hashval_t;
153 /* An integer used to represent a set of bits. It must be unsigned,
154 and must be at least as wide as unsigned int. */
155 typedef unsigned long int bitset_word;
157 /* Maximum value of a bitset word. It must be useful in preprocessor
158 contexts, and must be consistent with bitset_word. */
159 #define BITSET_WORD_MAX ULONG_MAX
161 /* Number of bits in a bitset word. Avoid greater-than-32-bit
162 integers and unconditional shifts by more than 31 bits, as they're
164 #if BITSET_WORD_MAX == 0xffffffff
165 # define BITSET_WORD_BITS 32
166 #elif BITSET_WORD_MAX >> 31 >> 5 == 1
167 # define BITSET_WORD_BITS 36
168 #elif BITSET_WORD_MAX >> 31 >> 16 == 1
169 # define BITSET_WORD_BITS 48
170 #elif BITSET_WORD_MAX >> 31 >> 28 == 1
171 # define BITSET_WORD_BITS 60
172 #elif BITSET_WORD_MAX >> 31 >> 31 >> 1 == 1
173 # define BITSET_WORD_BITS 64
174 #elif BITSET_WORD_MAX >> 31 >> 31 >> 9 == 1
175 # define BITSET_WORD_BITS 72
176 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 3 == 1
177 # define BITSET_WORD_BITS 128
178 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 == 1
179 # define BITSET_WORD_BITS 256
180 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 > 1
181 # define BITSET_WORD_BITS 257 /* any value > SBC_MAX will do here */
182 # if BITSET_WORD_BITS <= SBC_MAX
183 # error "Invalid SBC_MAX"
186 # error "Add case for new bitset_word size"
189 /* Number of bitset words in a bitset. */
190 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)
192 typedef bitset_word bitset[BITSET_WORDS];
193 typedef bitset_word *re_bitset_ptr_t;
194 typedef const bitset_word *re_const_bitset_ptr_t;
196 #define PREV_WORD_CONSTRAINT 0x0001
197 #define PREV_NOTWORD_CONSTRAINT 0x0002
198 #define NEXT_WORD_CONSTRAINT 0x0004
199 #define NEXT_NOTWORD_CONSTRAINT 0x0008
200 #define PREV_NEWLINE_CONSTRAINT 0x0010
201 #define NEXT_NEWLINE_CONSTRAINT 0x0020
202 #define PREV_BEGBUF_CONSTRAINT 0x0040
203 #define NEXT_ENDBUF_CONSTRAINT 0x0080
204 #define WORD_DELIM_CONSTRAINT 0x0100
205 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
209 INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
210 WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
211 WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
212 INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
213 LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
214 LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
215 BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
216 BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
217 WORD_DELIM = WORD_DELIM_CONSTRAINT,
218 NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
232 /* Node type, These are used by token, node, tree. */
238 #ifdef RE_ENABLE_I18N
241 #endif /* RE_ENABLE_I18N */
243 /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
244 when the debugger shows values of this enum type. */
245 #define EPSILON_BIT 8
246 OP_OPEN_SUBEXP = EPSILON_BIT | 0,
247 OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
248 OP_ALT = EPSILON_BIT | 2,
249 OP_DUP_ASTERISK = EPSILON_BIT | 3,
250 ANCHOR = EPSILON_BIT | 4,
252 /* Tree type, these are used only by tree. */
256 /* Token type, these are used only by token. */
268 OP_CLOSE_EQUIV_CLASS,
279 #ifdef RE_ENABLE_I18N
282 /* Multibyte characters. */
285 /* Collating symbols. */
290 /* Equivalence classes. */
292 int32_t *equiv_classes;
295 /* Range expressions. */
297 uint32_t *range_starts;
298 uint32_t *range_ends;
299 # else /* not _LIBC */
300 wchar_t *range_starts;
302 # endif /* not _LIBC */
304 /* Character classes. */
305 wctype_t *char_classes;
307 /* If this character set is the non-matching list. */
308 unsigned int non_match : 1;
310 /* # of multibyte characters. */
313 /* # of collating symbols. */
316 /* # of equivalence classes. */
319 /* # of range expressions. */
322 /* # of character classes. */
325 #endif /* RE_ENABLE_I18N */
331 unsigned char c; /* for CHARACTER */
332 re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */
333 #ifdef RE_ENABLE_I18N
334 re_charset_t *mbcset; /* for COMPLEX_BRACKET */
335 #endif /* RE_ENABLE_I18N */
336 Idx idx; /* for BACK_REF */
337 re_context_type ctx_type; /* for ANCHOR */
340 re_token_type_t type : 8;
342 re_token_type_t type;
344 unsigned int constraint : 10; /* context constraint */
345 unsigned int duplicated : 1;
346 unsigned int opt_subexp : 1;
347 #ifdef RE_ENABLE_I18N
348 unsigned int accept_mb : 1;
349 /* These 2 bits can be moved into the union if needed (e.g. if running out
350 of bits; move opr.c to opr.c.c and move the flags to opr.c.flags). */
351 unsigned int mb_partial : 1;
353 unsigned int word_char : 1;
356 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
360 /* Indicate the raw buffer which is the original string passed as an
361 argument of regexec(), re_search(), etc.. */
362 const unsigned char *raw_mbs;
363 /* Store the multibyte string. In case of "case insensitive mode" like
364 REG_ICASE, upper cases of the string are stored, otherwise MBS points
365 the same address that RAW_MBS points. */
367 #ifdef RE_ENABLE_I18N
368 /* Store the wide character string which is corresponding to MBS. */
373 /* Index in RAW_MBS. Each character mbs[i] corresponds to
374 raw_mbs[raw_mbs_idx + i]. */
376 /* The length of the valid characters in the buffers. */
378 /* The corresponding number of bytes in raw_mbs array. */
380 /* The length of the buffers MBS and WCS. */
382 /* The index in MBS, which is updated by re_string_fetch_byte. */
384 /* length of RAW_MBS array. */
386 /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN. */
388 /* End of the buffer may be shorter than its length in the cases such
389 as re_match_2, re_search_2. Then, we use STOP for end of the buffer
392 /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS. */
395 /* The context of mbs[0]. We store the context independently, since
396 the context of mbs[0] may be different from raw_mbs[0], which is
397 the beginning of the input string. */
398 unsigned int tip_context;
399 /* The translation passed as a part of an argument of re_compile_pattern. */
400 unsigned REG_TRANSLATE_TYPE trans;
401 /* Copy of re_dfa_t's word_char. */
402 re_const_bitset_ptr_t word_char;
403 /* true if REG_ICASE. */
405 unsigned char is_utf8;
406 unsigned char map_notascii;
407 unsigned char mbs_allocated;
408 unsigned char offsets_needed;
409 unsigned char newline_anchor;
410 unsigned char word_ops_used;
413 typedef struct re_string_t re_string_t;
417 typedef struct re_dfa_t re_dfa_t;
421 # define internal_function __attribute ((regparm (3), stdcall))
423 # define internal_function
427 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
430 #ifdef RE_ENABLE_I18N
431 static void build_wcs_buffer (re_string_t *pstr) internal_function;
432 static reg_errcode_t build_wcs_upper_buffer (re_string_t *pstr)
434 #endif /* RE_ENABLE_I18N */
435 static void build_upper_buffer (re_string_t *pstr) internal_function;
436 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
437 static unsigned int re_string_context_at (const re_string_t *input,
439 internal_function __attribute ((pure));
441 #define re_string_peek_byte(pstr, offset) \
442 ((pstr)->mbs[(pstr)->cur_idx + offset])
443 #define re_string_fetch_byte(pstr) \
444 ((pstr)->mbs[(pstr)->cur_idx++])
445 #define re_string_first_byte(pstr, idx) \
446 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
447 #define re_string_is_single_byte_char(pstr, idx) \
448 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
449 || (pstr)->wcs[(idx) + 1] != WEOF))
450 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
451 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
452 #define re_string_get_buffer(pstr) ((pstr)->mbs)
453 #define re_string_length(pstr) ((pstr)->len)
454 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
455 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
456 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
462 /* The OS usually guarantees only one guard page at the bottom of the stack,
463 and a page size can be as small as 4096 bytes. So we cannot safely
464 allocate anything larger than 4096 bytes. Also care for the possibility
465 of a few compiler-allocated temporary stack slots. */
466 # define __libc_use_alloca(n) ((n) < 4032)
468 /* alloca is implemented with malloc, so just use malloc. */
469 # define __libc_use_alloca(n) 0
473 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
474 #define re_xmalloc(t,n) ((t *) re_xnmalloc (n, sizeof (t)))
475 #define re_calloc(t,n) ((t *) calloc (n, sizeof (t)))
476 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
477 #define re_xrealloc(p,t,n) ((t *) re_xnrealloc (p, n, sizeof (t)))
478 #define re_x2realloc(p,t,pn) ((t *) re_x2nrealloc (p, pn, sizeof (t)))
479 #define re_free(p) free (p)
482 # define SIZE_MAX ((size_t) -1)
485 /* Return true if an array of N objects, each of size S, cannot exist
486 due to size arithmetic overflow. S must be nonzero. */
488 re_alloc_oversized (size_t n, size_t s)
490 return BE (SIZE_MAX / s < n, 0);
493 /* Return true if an array of (2 * N + 1) objects, each of size S,
494 cannot exist due to size arithmetic overflow. S must be nonzero. */
496 re_x2alloc_oversized (size_t n, size_t s)
498 return BE ((SIZE_MAX / s - 1) / 2 < n, 0);
501 /* Allocate an array of N objects, each with S bytes of memory,
502 dynamically, with error checking. S must be nonzero. */
504 re_xnmalloc (size_t n, size_t s)
506 return re_alloc_oversized (n, s) ? NULL : malloc (n * s);
509 /* Change the size of an allocated block of memory P to an array of N
510 objects each of S bytes, with error checking. S must be nonzero. */
512 re_xnrealloc (void *p, size_t n, size_t s)
514 return re_alloc_oversized (n, s) ? NULL : realloc (p, n * s);
517 /* Reallocate a block of memory P to an array of (2 * (*PN) + 1)
518 objects each of S bytes, with error checking. S must be nonzero.
519 If the allocation is successful, set *PN to the new allocation
520 count and return the resulting pointer. Otherwise, return
523 re_x2nrealloc (void *p, size_t *pn, size_t s)
525 if (re_x2alloc_oversized (*pn, s))
529 /* Add 1 in case *PN is zero. */
530 size_t n1 = 2 * *pn + 1;
531 p = realloc (p, n1 * s);
532 if (BE (p != NULL, 1))
540 struct bin_tree_t *parent;
541 struct bin_tree_t *left;
542 struct bin_tree_t *right;
543 struct bin_tree_t *first;
544 struct bin_tree_t *next;
548 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
549 Otherwise `type' indicate the type of this node. */
552 typedef struct bin_tree_t bin_tree_t;
554 #define BIN_TREE_STORAGE_SIZE \
555 ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
557 struct bin_tree_storage_t
559 struct bin_tree_storage_t *next;
560 bin_tree_t data[BIN_TREE_STORAGE_SIZE];
562 typedef struct bin_tree_storage_t bin_tree_storage_t;
564 #define CONTEXT_WORD 1
565 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
566 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
567 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
569 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
570 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
571 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
572 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
573 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
575 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
576 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
577 #define IS_WIDE_WORD_CHAR(ch) (iswalnum (ch) || (ch) == L'_')
578 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
580 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
581 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
582 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
583 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
584 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
586 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
587 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
588 || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
589 || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
590 || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
596 re_node_set non_eps_nodes;
597 re_node_set inveclosure;
598 re_node_set *entrance_nodes;
599 struct re_dfastate_t **trtable, **word_trtable;
600 unsigned int context : 4;
601 unsigned int halt : 1;
602 /* If this state can accept `multi byte'.
603 Note that we refer to multibyte characters, and multi character
604 collating elements as `multi byte'. */
605 unsigned int accept_mb : 1;
606 /* If this state has backreference node(s). */
607 unsigned int has_backref : 1;
608 unsigned int has_constraint : 1;
610 typedef struct re_dfastate_t re_dfastate_t;
612 struct re_state_table_entry
616 re_dfastate_t **array;
619 /* Array type used in re_sub_match_last_t and re_sub_match_top_t. */
625 re_dfastate_t **array;
628 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP. */
633 Idx str_idx; /* The position NODE match at. */
635 } re_sub_match_last_t;
637 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
638 And information about the node, whose type is OP_CLOSE_SUBEXP,
639 corresponding to NODE is stored in LASTS. */
646 Idx alasts; /* Allocation size of LASTS. */
647 Idx nlasts; /* The number of LASTS. */
648 re_sub_match_last_t **lasts;
649 } re_sub_match_top_t;
651 struct re_backref_cache_entry
659 unsigned short int eps_reachable_subexps_map;
664 /* The string object corresponding to the input string. */
666 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
671 /* EFLAGS of the argument of regexec. */
673 /* Where the matching ends. */
676 /* The state log used by the matcher. */
677 re_dfastate_t **state_log;
679 /* Back reference cache. */
682 struct re_backref_cache_entry *bkref_ents;
686 re_sub_match_top_t **sub_tops;
687 } re_match_context_t;
691 re_dfastate_t **sifted_states;
692 re_dfastate_t **limited_states;
698 struct re_fail_stack_ent_t
703 re_node_set eps_via_nodes;
706 struct re_fail_stack_t
710 struct re_fail_stack_ent_t *stack;
721 re_node_set *eclosures;
722 re_node_set *inveclosures;
723 struct re_state_table_entry *state_table;
724 re_dfastate_t *init_state;
725 re_dfastate_t *init_state_word;
726 re_dfastate_t *init_state_nl;
727 re_dfastate_t *init_state_begbuf;
728 bin_tree_t *str_tree;
729 bin_tree_storage_t *str_tree_storage;
730 re_bitset_ptr_t sb_char;
731 int str_tree_storage_idx;
733 /* number of subexpressions `re_nsub' is in regex_t. */
734 re_hashval_t state_hash_mask;
736 Idx nbackref; /* The number of backreference in this dfa. */
738 /* Bitmap expressing which backreference is used. */
739 bitset_word used_bkref_map;
740 bitset_word completed_bkref_map;
742 unsigned int has_plural_match : 1;
743 /* If this dfa has "multibyte node", which is a backreference or
744 a node which can accept multibyte character or multi character
745 collating element. */
746 unsigned int has_mb_node : 1;
747 unsigned int is_utf8 : 1;
748 unsigned int map_notascii : 1;
749 unsigned int word_ops_used : 1;
757 __libc_lock_define (, lock)
760 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
761 #define re_node_set_remove(set,id) \
762 (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
763 #define re_node_set_empty(p) ((p)->nelem = 0)
764 #define re_node_set_free(set) re_free ((set)->elems)
766 static void free_state (re_dfastate_t *state) internal_function;
780 bracket_elem_type type;
790 /* Inline functions for bitset operation. */
793 bitset_set (bitset set, Idx i)
795 set[i / BITSET_WORD_BITS] |= (bitset_word) 1 << i % BITSET_WORD_BITS;
799 bitset_clear (bitset set, Idx i)
801 set[i / BITSET_WORD_BITS] &= ~ ((bitset_word) 1 << i % BITSET_WORD_BITS);
805 bitset_contain (const bitset set, Idx i)
807 return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1;
811 bitset_empty (bitset set)
813 memset (set, 0, sizeof (bitset));
817 bitset_set_all (bitset set)
819 memset (set, -1, sizeof (bitset_word) * (SBC_MAX / BITSET_WORD_BITS));
820 if (SBC_MAX % BITSET_WORD_BITS != 0)
821 set[BITSET_WORDS - 1] =
822 ((bitset_word) 1 << SBC_MAX % BITSET_WORD_BITS) - 1;
826 bitset_copy (bitset dest, const bitset src)
828 memcpy (dest, src, sizeof (bitset));
832 bitset_not (bitset set)
835 for (i = 0; i < SBC_MAX / BITSET_WORD_BITS; ++i)
837 if (SBC_MAX % BITSET_WORD_BITS != 0)
838 set[BITSET_WORDS - 1] =
839 ((((bitset_word) 1 << SBC_MAX % BITSET_WORD_BITS) - 1)
840 & ~set[BITSET_WORDS - 1]);
844 bitset_merge (bitset dest, const bitset src)
847 for (i = 0; i < BITSET_WORDS; ++i)
852 bitset_mask (bitset dest, const bitset src)
855 for (i = 0; i < BITSET_WORDS; ++i)
859 #if defined RE_ENABLE_I18N
860 /* Inline functions for re_string. */
862 internal_function __attribute ((pure))
863 re_string_char_size_at (const re_string_t *pstr, Idx idx)
866 if (pstr->mb_cur_max == 1)
868 for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
869 if (pstr->wcs[idx + byte_idx] != WEOF)
875 internal_function __attribute ((pure))
876 re_string_wchar_at (const re_string_t *pstr, Idx idx)
878 if (pstr->mb_cur_max == 1)
879 return (wint_t) pstr->mbs[idx];
880 return (wint_t) pstr->wcs[idx];
884 internal_function __attribute ((pure))
885 re_string_elem_size_at (const re_string_t *pstr, Idx idx)
888 const unsigned char *p, *extra;
889 const int32_t *table, *indirect;
891 # include <locale/weight.h>
892 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
896 table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
897 extra = (const unsigned char *)
898 _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
899 indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
900 _NL_COLLATE_INDIRECTMB);
903 return p - pstr->mbs - idx;
909 #endif /* RE_ENABLE_I18N */
911 #endif /* _REGEX_INTERNAL_H */