1 /* -*- buffer-read-only: t -*- vi: set ro: */
2 /* DO NOT EDIT! GENERATED AUTOMATICALLY! */
3 /* Extended regular expression matching and search library.
4 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free
5 Software Foundation, Inc.
6 This file is part of the GNU C Library.
7 Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License along
20 with this program; if not, write to the Free Software Foundation,
21 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
23 #ifndef _REGEX_INTERNAL_H
24 #define _REGEX_INTERNAL_H 1
35 # include "localcharset.h"
37 #if defined HAVE_LOCALE_H || defined _LIBC
45 # include <bits/libc-lock.h>
47 # define __libc_lock_init(NAME) do { } while (0)
48 # define __libc_lock_lock(NAME) do { } while (0)
49 # define __libc_lock_unlock(NAME) do { } while (0)
52 /* In case that the system doesn't have isblank(). */
53 #if !defined _LIBC && ! (defined isblank || (HAVE_ISBLANK && HAVE_DECL_ISBLANK))
54 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
58 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
59 # define _RE_DEFINE_LOCALE_FUNCTIONS 1
60 # include <locale/localeinfo.h>
61 # include <locale/elem-hash.h>
62 # include <locale/coll-lookup.h>
66 /* This is for other GNU distributions with internationalized messages. */
67 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
71 # define gettext(msgid) \
72 INTUSE(__dcgettext) (_libc_intl_domainname, msgid, LC_MESSAGES)
75 # define gettext(msgid) (msgid)
79 /* This define is so xgettext can find the internationalizable
81 # define gettext_noop(String) String
84 /* For loser systems without the definition. */
86 # define SIZE_MAX ((size_t) -1)
89 #if (defined MB_CUR_MAX && HAVE_LOCALE_H && HAVE_WCTYPE_H && HAVE_ISWCTYPE && HAVE_WCSCOLL) || _LIBC
90 # define RE_ENABLE_I18N
94 # define BE(expr, val) __builtin_expect (expr, val)
96 # define BE(expr, val) (expr)
102 /* Number of ASCII characters. */
103 #define ASCII_CHARS 0x80
105 /* Number of single byte characters. */
106 #define SBC_MAX (UCHAR_MAX + 1)
108 #define COLL_ELEM_LEN_MAX 8
110 /* The character which represents newline. */
111 #define NEWLINE_CHAR '\n'
112 #define WIDE_NEWLINE_CHAR L'\n'
114 /* Rename to standard API for using out of glibc. */
116 # define __wctype wctype
117 # define __iswctype iswctype
118 # define __btowc btowc
119 # define __wcrtomb wcrtomb
120 # define __mbrtowc mbrtowc
121 # define __regfree regfree
122 # define attribute_hidden
123 #endif /* not _LIBC */
125 #if __GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)
126 # define __attribute(arg) __attribute__ (arg)
128 # define __attribute(arg)
131 typedef __re_idx_t Idx;
133 /* Special return value for failure to match. */
134 #define REG_MISSING ((Idx) -1)
136 /* Special return value for internal error. */
137 #define REG_ERROR ((Idx) -2)
139 /* Test whether N is a valid index, and is not one of the above. */
140 #ifdef _REGEX_LARGE_OFFSETS
141 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR)
143 # define REG_VALID_INDEX(n) (0 <= (n))
146 /* Test whether N is a valid nonzero index. */
147 #ifdef _REGEX_LARGE_OFFSETS
148 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1))
150 # define REG_VALID_NONZERO_INDEX(n) (0 < (n))
153 /* A hash value, suitable for computing hash tables. */
154 typedef __re_size_t re_hashval_t;
156 /* An integer used to represent a set of bits. It must be unsigned,
157 and must be at least as wide as unsigned int. */
158 typedef unsigned long int bitset_word_t;
159 /* All bits set in a bitset_word_t. */
160 #define BITSET_WORD_MAX ULONG_MAX
162 /* Number of bits in a bitset_word_t. For portability to hosts with
163 padding bits, do not use '(sizeof (bitset_word_t) * CHAR_BIT)';
164 instead, deduce it directly from BITSET_WORD_MAX. Avoid
165 greater-than-32-bit integers and unconditional shifts by more than
166 31 bits, as they're not portable. */
167 #if BITSET_WORD_MAX == 0xffffffffUL
168 # define BITSET_WORD_BITS 32
169 #elif BITSET_WORD_MAX >> 31 >> 4 == 1
170 # define BITSET_WORD_BITS 36
171 #elif BITSET_WORD_MAX >> 31 >> 16 == 1
172 # define BITSET_WORD_BITS 48
173 #elif BITSET_WORD_MAX >> 31 >> 28 == 1
174 # define BITSET_WORD_BITS 60
175 #elif BITSET_WORD_MAX >> 31 >> 31 >> 1 == 1
176 # define BITSET_WORD_BITS 64
177 #elif BITSET_WORD_MAX >> 31 >> 31 >> 9 == 1
178 # define BITSET_WORD_BITS 72
179 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 3 == 1
180 # define BITSET_WORD_BITS 128
181 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 == 1
182 # define BITSET_WORD_BITS 256
183 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 > 1
184 # define BITSET_WORD_BITS 257 /* any value > SBC_MAX will do here */
185 # if BITSET_WORD_BITS <= SBC_MAX
186 # error "Invalid SBC_MAX"
189 # error "Add case for new bitset_word_t size"
192 /* Number of bitset_word_t values in a bitset_t. */
193 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)
195 typedef bitset_word_t bitset_t[BITSET_WORDS];
196 typedef bitset_word_t *re_bitset_ptr_t;
197 typedef const bitset_word_t *re_const_bitset_ptr_t;
199 #define PREV_WORD_CONSTRAINT 0x0001
200 #define PREV_NOTWORD_CONSTRAINT 0x0002
201 #define NEXT_WORD_CONSTRAINT 0x0004
202 #define NEXT_NOTWORD_CONSTRAINT 0x0008
203 #define PREV_NEWLINE_CONSTRAINT 0x0010
204 #define NEXT_NEWLINE_CONSTRAINT 0x0020
205 #define PREV_BEGBUF_CONSTRAINT 0x0040
206 #define NEXT_ENDBUF_CONSTRAINT 0x0080
207 #define WORD_DELIM_CONSTRAINT 0x0100
208 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
212 INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
213 WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
214 WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
215 INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
216 LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
217 LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
218 BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
219 BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
220 WORD_DELIM = WORD_DELIM_CONSTRAINT,
221 NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
235 /* Node type, These are used by token, node, tree. */
241 #ifdef RE_ENABLE_I18N
244 #endif /* RE_ENABLE_I18N */
246 /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
247 when the debugger shows values of this enum type. */
248 #define EPSILON_BIT 8
249 OP_OPEN_SUBEXP = EPSILON_BIT | 0,
250 OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
251 OP_ALT = EPSILON_BIT | 2,
252 OP_DUP_ASTERISK = EPSILON_BIT | 3,
253 ANCHOR = EPSILON_BIT | 4,
255 /* Tree type, these are used only by tree. */
259 /* Token type, these are used only by token. */
271 OP_CLOSE_EQUIV_CLASS,
282 #ifdef RE_ENABLE_I18N
285 /* Multibyte characters. */
288 /* Collating symbols. */
293 /* Equivalence classes. */
295 int32_t *equiv_classes;
298 /* Range expressions. */
300 uint32_t *range_starts;
301 uint32_t *range_ends;
302 # else /* not _LIBC */
303 wchar_t *range_starts;
305 # endif /* not _LIBC */
307 /* Character classes. */
308 wctype_t *char_classes;
310 /* If this character set is the non-matching list. */
311 unsigned int non_match : 1;
313 /* # of multibyte characters. */
316 /* # of collating symbols. */
319 /* # of equivalence classes. */
322 /* # of range expressions. */
325 /* # of character classes. */
328 #endif /* RE_ENABLE_I18N */
334 unsigned char c; /* for CHARACTER */
335 re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */
336 #ifdef RE_ENABLE_I18N
337 re_charset_t *mbcset; /* for COMPLEX_BRACKET */
338 #endif /* RE_ENABLE_I18N */
339 Idx idx; /* for BACK_REF */
340 re_context_type ctx_type; /* for ANCHOR */
342 #if __GNUC__ >= 2 && !__STRICT_ANSI__
343 re_token_type_t type : 8;
345 re_token_type_t type;
347 unsigned int constraint : 10; /* context constraint */
348 unsigned int duplicated : 1;
349 unsigned int opt_subexp : 1;
350 #ifdef RE_ENABLE_I18N
351 unsigned int accept_mb : 1;
352 /* These 2 bits can be moved into the union if needed (e.g. if running out
353 of bits; move opr.c to opr.c.c and move the flags to opr.c.flags). */
354 unsigned int mb_partial : 1;
356 unsigned int word_char : 1;
359 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
363 /* Indicate the raw buffer which is the original string passed as an
364 argument of regexec(), re_search(), etc.. */
365 const unsigned char *raw_mbs;
366 /* Store the multibyte string. In case of "case insensitive mode" like
367 REG_ICASE, upper cases of the string are stored, otherwise MBS points
368 the same address that RAW_MBS points. */
370 #ifdef RE_ENABLE_I18N
371 /* Store the wide character string which is corresponding to MBS. */
376 /* Index in RAW_MBS. Each character mbs[i] corresponds to
377 raw_mbs[raw_mbs_idx + i]. */
379 /* The length of the valid characters in the buffers. */
381 /* The corresponding number of bytes in raw_mbs array. */
383 /* The length of the buffers MBS and WCS. */
385 /* The index in MBS, which is updated by re_string_fetch_byte. */
387 /* length of RAW_MBS array. */
389 /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN. */
391 /* End of the buffer may be shorter than its length in the cases such
392 as re_match_2, re_search_2. Then, we use STOP for end of the buffer
395 /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS. */
398 /* The context of mbs[0]. We store the context independently, since
399 the context of mbs[0] may be different from raw_mbs[0], which is
400 the beginning of the input string. */
401 unsigned int tip_context;
402 /* The translation passed as a part of an argument of re_compile_pattern. */
403 RE_TRANSLATE_TYPE trans;
404 /* Copy of re_dfa_t's word_char. */
405 re_const_bitset_ptr_t word_char;
406 /* true if REG_ICASE. */
408 unsigned char is_utf8;
409 unsigned char map_notascii;
410 unsigned char mbs_allocated;
411 unsigned char offsets_needed;
412 unsigned char newline_anchor;
413 unsigned char word_ops_used;
416 typedef struct re_string_t re_string_t;
420 typedef struct re_dfa_t re_dfa_t;
423 # if defined __i386__ && !defined __EMX__
424 # define internal_function __attribute ((regparm (3), stdcall))
426 # define internal_function
430 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
433 #ifdef RE_ENABLE_I18N
434 static void build_wcs_buffer (re_string_t *pstr) internal_function;
435 static reg_errcode_t build_wcs_upper_buffer (re_string_t *pstr)
437 #endif /* RE_ENABLE_I18N */
438 static void build_upper_buffer (re_string_t *pstr) internal_function;
439 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
440 static unsigned int re_string_context_at (const re_string_t *input, Idx idx,
442 internal_function __attribute ((pure));
443 #define re_string_peek_byte(pstr, offset) \
444 ((pstr)->mbs[(pstr)->cur_idx + offset])
445 #define re_string_fetch_byte(pstr) \
446 ((pstr)->mbs[(pstr)->cur_idx++])
447 #define re_string_first_byte(pstr, idx) \
448 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
449 #define re_string_is_single_byte_char(pstr, idx) \
450 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
451 || (pstr)->wcs[(idx) + 1] != WEOF))
452 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
453 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
454 #define re_string_get_buffer(pstr) ((pstr)->mbs)
455 #define re_string_length(pstr) ((pstr)->len)
456 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
457 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
458 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
464 /* The OS usually guarantees only one guard page at the bottom of the stack,
465 and a page size can be as small as 4096 bytes. So we cannot safely
466 allocate anything larger than 4096 bytes. Also care for the possibility
467 of a few compiler-allocated temporary stack slots. */
468 # define __libc_use_alloca(n) ((n) < 4032)
470 /* alloca is implemented with malloc, so just use malloc. */
471 # define __libc_use_alloca(n) 0
473 # define alloca(n) malloc (n)
478 # define MAX(a,b) ((a) < (b) ? (b) : (a))
481 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
482 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
483 #define re_free(p) free (p)
487 struct bin_tree_t *parent;
488 struct bin_tree_t *left;
489 struct bin_tree_t *right;
490 struct bin_tree_t *first;
491 struct bin_tree_t *next;
495 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
496 Otherwise `type' indicate the type of this node. */
499 typedef struct bin_tree_t bin_tree_t;
501 #define BIN_TREE_STORAGE_SIZE \
502 ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
504 struct bin_tree_storage_t
506 struct bin_tree_storage_t *next;
507 bin_tree_t data[BIN_TREE_STORAGE_SIZE];
509 typedef struct bin_tree_storage_t bin_tree_storage_t;
511 #define CONTEXT_WORD 1
512 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
513 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
514 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
516 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
517 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
518 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
519 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
520 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
522 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
523 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
524 #define IS_WIDE_WORD_CHAR(ch) (iswalnum (ch) || (ch) == L'_')
525 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
527 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
528 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
529 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
530 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
531 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
533 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
534 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
535 || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
536 || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
537 || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
543 re_node_set non_eps_nodes;
544 re_node_set inveclosure;
545 re_node_set *entrance_nodes;
546 struct re_dfastate_t **trtable, **word_trtable;
547 unsigned int context : 4;
548 unsigned int halt : 1;
549 /* If this state can accept `multi byte'.
550 Note that we refer to multibyte characters, and multi character
551 collating elements as `multi byte'. */
552 unsigned int accept_mb : 1;
553 /* If this state has backreference node(s). */
554 unsigned int has_backref : 1;
555 unsigned int has_constraint : 1;
557 typedef struct re_dfastate_t re_dfastate_t;
559 struct re_state_table_entry
563 re_dfastate_t **array;
566 /* Array type used in re_sub_match_last_t and re_sub_match_top_t. */
572 re_dfastate_t **array;
575 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP. */
580 Idx str_idx; /* The position NODE match at. */
582 } re_sub_match_last_t;
584 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
585 And information about the node, whose type is OP_CLOSE_SUBEXP,
586 corresponding to NODE is stored in LASTS. */
593 Idx alasts; /* Allocation size of LASTS. */
594 Idx nlasts; /* The number of LASTS. */
595 re_sub_match_last_t **lasts;
596 } re_sub_match_top_t;
598 struct re_backref_cache_entry
606 unsigned short int eps_reachable_subexps_map;
611 /* The string object corresponding to the input string. */
613 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
614 const re_dfa_t *const dfa;
618 /* EFLAGS of the argument of regexec. */
620 /* Where the matching ends. */
623 /* The state log used by the matcher. */
624 re_dfastate_t **state_log;
626 /* Back reference cache. */
629 struct re_backref_cache_entry *bkref_ents;
633 re_sub_match_top_t **sub_tops;
634 } re_match_context_t;
638 re_dfastate_t **sifted_states;
639 re_dfastate_t **limited_states;
645 struct re_fail_stack_ent_t
650 re_node_set eps_via_nodes;
653 struct re_fail_stack_t
657 struct re_fail_stack_ent_t *stack;
668 re_node_set *eclosures;
669 re_node_set *inveclosures;
670 struct re_state_table_entry *state_table;
671 re_dfastate_t *init_state;
672 re_dfastate_t *init_state_word;
673 re_dfastate_t *init_state_nl;
674 re_dfastate_t *init_state_begbuf;
675 bin_tree_t *str_tree;
676 bin_tree_storage_t *str_tree_storage;
677 re_bitset_ptr_t sb_char;
678 int str_tree_storage_idx;
680 /* number of subexpressions `re_nsub' is in regex_t. */
681 re_hashval_t state_hash_mask;
683 Idx nbackref; /* The number of backreference in this dfa. */
685 /* Bitmap expressing which backreference is used. */
686 bitset_word_t used_bkref_map;
687 bitset_word_t completed_bkref_map;
689 unsigned int has_plural_match : 1;
690 /* If this dfa has "multibyte node", which is a backreference or
691 a node which can accept multibyte character or multi character
692 collating element. */
693 unsigned int has_mb_node : 1;
694 unsigned int is_utf8 : 1;
695 unsigned int map_notascii : 1;
696 unsigned int word_ops_used : 1;
705 __libc_lock_define (, lock)
709 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
710 #define re_node_set_remove(set,id) \
711 (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
712 #define re_node_set_empty(p) ((p)->nelem = 0)
713 #define re_node_set_free(set) re_free ((set)->elems)
727 bracket_elem_type type;
737 /* Inline functions for bitset_t operation. */
740 bitset_set (bitset_t set, Idx i)
742 set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS;
746 bitset_clear (bitset_t set, Idx i)
748 set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS);
752 bitset_contain (const bitset_t set, Idx i)
754 return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1;
758 bitset_empty (bitset_t set)
760 memset (set, '\0', sizeof (bitset_t));
764 bitset_set_all (bitset_t set)
766 memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS));
767 if (SBC_MAX % BITSET_WORD_BITS != 0)
768 set[BITSET_WORDS - 1] =
769 ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1;
773 bitset_copy (bitset_t dest, const bitset_t src)
775 memcpy (dest, src, sizeof (bitset_t));
779 bitset_not (bitset_t set)
782 for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i)
783 set[bitset_i] = ~set[bitset_i];
784 if (SBC_MAX % BITSET_WORD_BITS != 0)
785 set[BITSET_WORDS - 1] =
786 ((((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1)
787 & ~set[BITSET_WORDS - 1]);
791 bitset_merge (bitset_t dest, const bitset_t src)
794 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
795 dest[bitset_i] |= src[bitset_i];
799 bitset_mask (bitset_t dest, const bitset_t src)
802 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
803 dest[bitset_i] &= src[bitset_i];
806 #ifdef RE_ENABLE_I18N
807 /* Inline functions for re_string. */
809 internal_function __attribute ((pure))
810 re_string_char_size_at (const re_string_t *pstr, Idx idx)
813 if (pstr->mb_cur_max == 1)
815 for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
816 if (pstr->wcs[idx + byte_idx] != WEOF)
822 internal_function __attribute ((pure))
823 re_string_wchar_at (const re_string_t *pstr, Idx idx)
825 if (pstr->mb_cur_max == 1)
826 return (wint_t) pstr->mbs[idx];
827 return (wint_t) pstr->wcs[idx];
831 internal_function __attribute ((pure))
832 re_string_elem_size_at (const re_string_t *pstr, Idx idx)
835 const unsigned char *p, *extra;
836 const int32_t *table, *indirect;
838 # include <locale/weight.h>
839 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
843 table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
844 extra = (const unsigned char *)
845 _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
846 indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
847 _NL_COLLATE_INDIRECTMB);
850 return p - pstr->mbs - idx;
856 #endif /* RE_ENABLE_I18N */
858 #ifndef __GNUC_PREREQ
859 # if defined __GNUC__ && defined __GNUC_MINOR__
860 # define __GNUC_PREREQ(maj, min) \
861 ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min))
863 # define __GNUC_PREREQ(maj, min) 0
867 #if __GNUC_PREREQ (3,4)
868 # undef __attribute_warn_unused_result__
869 # define __attribute_warn_unused_result__ \
870 __attribute__ ((__warn_unused_result__))
872 # define __attribute_warn_unused_result__ /* empty */
875 #endif /* _REGEX_INTERNAL_H */