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-2012 Free Software Foundation, Inc.
5 This file is part of the GNU C Library.
6 Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License along
19 with this program; if not, see <http://www.gnu.org/licenses/>. */
21 #ifndef _REGEX_INTERNAL_H
22 #define _REGEX_INTERNAL_H 1
32 # include "localcharset.h"
40 # include <bits/libc-lock.h>
42 # define __libc_lock_define(CLASS,NAME)
43 # define __libc_lock_init(NAME) do { } while (0)
44 # define __libc_lock_lock(NAME) do { } while (0)
45 # define __libc_lock_unlock(NAME) do { } while (0)
48 /* In case that the system doesn't have isblank(). */
49 #if !defined _LIBC && ! (defined isblank || (HAVE_ISBLANK && HAVE_DECL_ISBLANK))
50 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
54 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
55 # define _RE_DEFINE_LOCALE_FUNCTIONS 1
56 # include <locale/localeinfo.h>
57 # include <locale/elem-hash.h>
58 # include <locale/coll-lookup.h>
62 /* This is for other GNU distributions with internationalized messages. */
63 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
67 # define gettext(msgid) \
68 INTUSE(__dcgettext) (_libc_intl_domainname, msgid, LC_MESSAGES)
71 # define gettext(msgid) (msgid)
75 /* This define is so xgettext can find the internationalizable
77 # define gettext_noop(String) String
80 #if (defined MB_CUR_MAX && HAVE_WCTYPE_H && HAVE_ISWCTYPE && HAVE_WCSCOLL) || _LIBC
81 # define RE_ENABLE_I18N
85 # define BE(expr, val) __builtin_expect (expr, val)
87 # define BE(expr, val) (expr)
90 /* Number of ASCII characters. */
91 #define ASCII_CHARS 0x80
93 /* Number of single byte characters. */
94 #define SBC_MAX (UCHAR_MAX + 1)
96 #define COLL_ELEM_LEN_MAX 8
98 /* The character which represents newline. */
99 #define NEWLINE_CHAR '\n'
100 #define WIDE_NEWLINE_CHAR L'\n'
102 /* Rename to standard API for using out of glibc. */
104 # define __wctype wctype
105 # define __iswctype iswctype
106 # define __btowc btowc
107 # define __mbrtowc mbrtowc
108 # define __wcrtomb wcrtomb
109 # define __regfree regfree
110 # define attribute_hidden
111 #endif /* not _LIBC */
113 #if __GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)
114 # define __attribute(arg) __attribute__ (arg)
116 # define __attribute(arg)
119 typedef __re_idx_t Idx;
120 #ifdef _REGEX_LARGE_OFFSETS
121 # define IDX_MAX (SIZE_MAX - 2)
123 # define IDX_MAX INT_MAX
126 /* Special return value for failure to match. */
127 #define REG_MISSING ((Idx) -1)
129 /* Special return value for internal error. */
130 #define REG_ERROR ((Idx) -2)
132 /* Test whether N is a valid index, and is not one of the above. */
133 #ifdef _REGEX_LARGE_OFFSETS
134 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR)
136 # define REG_VALID_INDEX(n) (0 <= (n))
139 /* Test whether N is a valid nonzero index. */
140 #ifdef _REGEX_LARGE_OFFSETS
141 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1))
143 # define REG_VALID_NONZERO_INDEX(n) (0 < (n))
146 /* A hash value, suitable for computing hash tables. */
147 typedef __re_size_t re_hashval_t;
149 /* An integer used to represent a set of bits. It must be unsigned,
150 and must be at least as wide as unsigned int. */
151 typedef unsigned long int bitset_word_t;
152 /* All bits set in a bitset_word_t. */
153 #define BITSET_WORD_MAX ULONG_MAX
155 /* Number of bits in a bitset_word_t. For portability to hosts with
156 padding bits, do not use '(sizeof (bitset_word_t) * CHAR_BIT)';
157 instead, deduce it directly from BITSET_WORD_MAX. Avoid
158 greater-than-32-bit integers and unconditional shifts by more than
159 31 bits, as they're not portable. */
160 #if BITSET_WORD_MAX == 0xffffffffUL
161 # define BITSET_WORD_BITS 32
162 #elif BITSET_WORD_MAX >> 31 >> 4 == 1
163 # define BITSET_WORD_BITS 36
164 #elif BITSET_WORD_MAX >> 31 >> 16 == 1
165 # define BITSET_WORD_BITS 48
166 #elif BITSET_WORD_MAX >> 31 >> 28 == 1
167 # define BITSET_WORD_BITS 60
168 #elif BITSET_WORD_MAX >> 31 >> 31 >> 1 == 1
169 # define BITSET_WORD_BITS 64
170 #elif BITSET_WORD_MAX >> 31 >> 31 >> 9 == 1
171 # define BITSET_WORD_BITS 72
172 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 3 == 1
173 # define BITSET_WORD_BITS 128
174 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 == 1
175 # define BITSET_WORD_BITS 256
176 #elif BITSET_WORD_MAX >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 31 >> 7 > 1
177 # define BITSET_WORD_BITS 257 /* any value > SBC_MAX will do here */
178 # if BITSET_WORD_BITS <= SBC_MAX
179 # error "Invalid SBC_MAX"
182 # error "Add case for new bitset_word_t size"
185 /* Number of bitset_word_t values in a bitset_t. */
186 #define BITSET_WORDS ((SBC_MAX + BITSET_WORD_BITS - 1) / BITSET_WORD_BITS)
188 typedef bitset_word_t bitset_t[BITSET_WORDS];
189 typedef bitset_word_t *re_bitset_ptr_t;
190 typedef const bitset_word_t *re_const_bitset_ptr_t;
192 #define PREV_WORD_CONSTRAINT 0x0001
193 #define PREV_NOTWORD_CONSTRAINT 0x0002
194 #define NEXT_WORD_CONSTRAINT 0x0004
195 #define NEXT_NOTWORD_CONSTRAINT 0x0008
196 #define PREV_NEWLINE_CONSTRAINT 0x0010
197 #define NEXT_NEWLINE_CONSTRAINT 0x0020
198 #define PREV_BEGBUF_CONSTRAINT 0x0040
199 #define NEXT_ENDBUF_CONSTRAINT 0x0080
200 #define WORD_DELIM_CONSTRAINT 0x0100
201 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
205 INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
206 WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
207 WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
208 INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
209 LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
210 LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
211 BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
212 BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
213 WORD_DELIM = WORD_DELIM_CONSTRAINT,
214 NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
228 /* Node type, These are used by token, node, tree. */
234 #ifdef RE_ENABLE_I18N
237 #endif /* RE_ENABLE_I18N */
239 /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
240 when the debugger shows values of this enum type. */
241 #define EPSILON_BIT 8
242 OP_OPEN_SUBEXP = EPSILON_BIT | 0,
243 OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
244 OP_ALT = EPSILON_BIT | 2,
245 OP_DUP_ASTERISK = EPSILON_BIT | 3,
246 ANCHOR = EPSILON_BIT | 4,
248 /* Tree type, these are used only by tree. */
252 /* Token type, these are used only by token. */
264 OP_CLOSE_EQUIV_CLASS,
275 #ifdef RE_ENABLE_I18N
278 /* Multibyte characters. */
281 /* Collating symbols. */
286 /* Equivalence classes. */
288 int32_t *equiv_classes;
291 /* Range expressions. */
293 uint32_t *range_starts;
294 uint32_t *range_ends;
295 # else /* not _LIBC */
296 wchar_t *range_starts;
298 # endif /* not _LIBC */
300 /* Character classes. */
301 wctype_t *char_classes;
303 /* If this character set is the non-matching list. */
304 unsigned int non_match : 1;
306 /* # of multibyte characters. */
309 /* # of collating symbols. */
312 /* # of equivalence classes. */
315 /* # of range expressions. */
318 /* # of character classes. */
321 #endif /* RE_ENABLE_I18N */
327 unsigned char c; /* for CHARACTER */
328 re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */
329 #ifdef RE_ENABLE_I18N
330 re_charset_t *mbcset; /* for COMPLEX_BRACKET */
331 #endif /* RE_ENABLE_I18N */
332 Idx idx; /* for BACK_REF */
333 re_context_type ctx_type; /* for ANCHOR */
335 #if __GNUC__ >= 2 && !defined __STRICT_ANSI__
336 re_token_type_t type : 8;
338 re_token_type_t type;
340 unsigned int constraint : 10; /* context constraint */
341 unsigned int duplicated : 1;
342 unsigned int opt_subexp : 1;
343 #ifdef RE_ENABLE_I18N
344 unsigned int accept_mb : 1;
345 /* These 2 bits can be moved into the union if needed (e.g. if running out
346 of bits; move opr.c to opr.c.c and move the flags to opr.c.flags). */
347 unsigned int mb_partial : 1;
349 unsigned int word_char : 1;
352 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
356 /* Indicate the raw buffer which is the original string passed as an
357 argument of regexec(), re_search(), etc.. */
358 const unsigned char *raw_mbs;
359 /* Store the multibyte string. In case of "case insensitive mode" like
360 REG_ICASE, upper cases of the string are stored, otherwise MBS points
361 the same address that RAW_MBS points. */
363 #ifdef RE_ENABLE_I18N
364 /* Store the wide character string which is corresponding to MBS. */
369 /* Index in RAW_MBS. Each character mbs[i] corresponds to
370 raw_mbs[raw_mbs_idx + i]. */
372 /* The length of the valid characters in the buffers. */
374 /* The corresponding number of bytes in raw_mbs array. */
376 /* The length of the buffers MBS and WCS. */
378 /* The index in MBS, which is updated by re_string_fetch_byte. */
380 /* length of RAW_MBS array. */
382 /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN. */
384 /* End of the buffer may be shorter than its length in the cases such
385 as re_match_2, re_search_2. Then, we use STOP for end of the buffer
388 /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS. */
391 /* The context of mbs[0]. We store the context independently, since
392 the context of mbs[0] may be different from raw_mbs[0], which is
393 the beginning of the input string. */
394 unsigned int tip_context;
395 /* The translation passed as a part of an argument of re_compile_pattern. */
396 RE_TRANSLATE_TYPE trans;
397 /* Copy of re_dfa_t's word_char. */
398 re_const_bitset_ptr_t word_char;
399 /* true if REG_ICASE. */
401 unsigned char is_utf8;
402 unsigned char map_notascii;
403 unsigned char mbs_allocated;
404 unsigned char offsets_needed;
405 unsigned char newline_anchor;
406 unsigned char word_ops_used;
409 typedef struct re_string_t re_string_t;
413 typedef struct re_dfa_t re_dfa_t;
416 # define internal_function
420 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
423 # ifdef RE_ENABLE_I18N
424 static void build_wcs_buffer (re_string_t *pstr) internal_function;
425 static reg_errcode_t build_wcs_upper_buffer (re_string_t *pstr)
427 # endif /* RE_ENABLE_I18N */
428 static void build_upper_buffer (re_string_t *pstr) internal_function;
429 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
430 static unsigned int re_string_context_at (const re_string_t *input, Idx idx,
432 internal_function __attribute ((pure));
434 #define re_string_peek_byte(pstr, offset) \
435 ((pstr)->mbs[(pstr)->cur_idx + offset])
436 #define re_string_fetch_byte(pstr) \
437 ((pstr)->mbs[(pstr)->cur_idx++])
438 #define re_string_first_byte(pstr, idx) \
439 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
440 #define re_string_is_single_byte_char(pstr, idx) \
441 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
442 || (pstr)->wcs[(idx) + 1] != WEOF))
443 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
444 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
445 #define re_string_get_buffer(pstr) ((pstr)->mbs)
446 #define re_string_length(pstr) ((pstr)->len)
447 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
448 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
449 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
455 /* The OS usually guarantees only one guard page at the bottom of the stack,
456 and a page size can be as small as 4096 bytes. So we cannot safely
457 allocate anything larger than 4096 bytes. Also care for the possibility
458 of a few compiler-allocated temporary stack slots. */
459 # define __libc_use_alloca(n) ((n) < 4032)
461 /* alloca is implemented with malloc, so just use malloc. */
462 # define __libc_use_alloca(n) 0
464 # define alloca(n) malloc (n)
469 # define MAX(a,b) ((a) < (b) ? (b) : (a))
472 # define MIN(a,b) ((a) < (b) ? (a) : (b))
475 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
476 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
477 #define re_free(p) free (p)
481 struct bin_tree_t *parent;
482 struct bin_tree_t *left;
483 struct bin_tree_t *right;
484 struct bin_tree_t *first;
485 struct bin_tree_t *next;
489 /* 'node_idx' is the index in dfa->nodes, if 'type' == 0.
490 Otherwise 'type' indicate the type of this node. */
493 typedef struct bin_tree_t bin_tree_t;
495 #define BIN_TREE_STORAGE_SIZE \
496 ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
498 struct bin_tree_storage_t
500 struct bin_tree_storage_t *next;
501 bin_tree_t data[BIN_TREE_STORAGE_SIZE];
503 typedef struct bin_tree_storage_t bin_tree_storage_t;
505 #define CONTEXT_WORD 1
506 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
507 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
508 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
510 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
511 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
512 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
513 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
514 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
516 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
517 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
518 #define IS_WIDE_WORD_CHAR(ch) (iswalnum (ch) || (ch) == L'_')
519 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
521 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
522 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
523 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
524 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
525 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
527 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
528 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
529 || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
530 || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
531 || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
537 re_node_set non_eps_nodes;
538 re_node_set inveclosure;
539 re_node_set *entrance_nodes;
540 struct re_dfastate_t **trtable, **word_trtable;
541 unsigned int context : 4;
542 unsigned int halt : 1;
543 /* If this state can accept "multi byte".
544 Note that we refer to multibyte characters, and multi character
545 collating elements as "multi byte". */
546 unsigned int accept_mb : 1;
547 /* If this state has backreference node(s). */
548 unsigned int has_backref : 1;
549 unsigned int has_constraint : 1;
551 typedef struct re_dfastate_t re_dfastate_t;
553 struct re_state_table_entry
557 re_dfastate_t **array;
560 /* Array type used in re_sub_match_last_t and re_sub_match_top_t. */
566 re_dfastate_t **array;
569 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP. */
574 Idx str_idx; /* The position NODE match at. */
576 } re_sub_match_last_t;
578 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
579 And information about the node, whose type is OP_CLOSE_SUBEXP,
580 corresponding to NODE is stored in LASTS. */
587 Idx alasts; /* Allocation size of LASTS. */
588 Idx nlasts; /* The number of LASTS. */
589 re_sub_match_last_t **lasts;
590 } re_sub_match_top_t;
592 struct re_backref_cache_entry
600 unsigned short int eps_reachable_subexps_map;
605 /* The string object corresponding to the input string. */
607 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
608 const re_dfa_t *const dfa;
612 /* EFLAGS of the argument of regexec. */
614 /* Where the matching ends. */
617 /* The state log used by the matcher. */
618 re_dfastate_t **state_log;
620 /* Back reference cache. */
623 struct re_backref_cache_entry *bkref_ents;
627 re_sub_match_top_t **sub_tops;
628 } re_match_context_t;
632 re_dfastate_t **sifted_states;
633 re_dfastate_t **limited_states;
639 struct re_fail_stack_ent_t
644 re_node_set eps_via_nodes;
647 struct re_fail_stack_t
651 struct re_fail_stack_ent_t *stack;
662 re_node_set *eclosures;
663 re_node_set *inveclosures;
664 struct re_state_table_entry *state_table;
665 re_dfastate_t *init_state;
666 re_dfastate_t *init_state_word;
667 re_dfastate_t *init_state_nl;
668 re_dfastate_t *init_state_begbuf;
669 bin_tree_t *str_tree;
670 bin_tree_storage_t *str_tree_storage;
671 re_bitset_ptr_t sb_char;
672 int str_tree_storage_idx;
674 /* number of subexpressions 're_nsub' is in regex_t. */
675 re_hashval_t state_hash_mask;
677 Idx nbackref; /* The number of backreference in this dfa. */
679 /* Bitmap expressing which backreference is used. */
680 bitset_word_t used_bkref_map;
681 bitset_word_t completed_bkref_map;
683 unsigned int has_plural_match : 1;
684 /* If this dfa has "multibyte node", which is a backreference or
685 a node which can accept multibyte character or multi character
686 collating element. */
687 unsigned int has_mb_node : 1;
688 unsigned int is_utf8 : 1;
689 unsigned int map_notascii : 1;
690 unsigned int word_ops_used : 1;
698 __libc_lock_define (, lock)
701 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
702 #define re_node_set_remove(set,id) \
703 (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
704 #define re_node_set_empty(p) ((p)->nelem = 0)
705 #define re_node_set_free(set) re_free ((set)->elems)
719 bracket_elem_type type;
729 /* Functions for bitset_t operation. */
732 bitset_set (bitset_t set, Idx i)
734 set[i / BITSET_WORD_BITS] |= (bitset_word_t) 1 << i % BITSET_WORD_BITS;
738 bitset_clear (bitset_t set, Idx i)
740 set[i / BITSET_WORD_BITS] &= ~ ((bitset_word_t) 1 << i % BITSET_WORD_BITS);
744 bitset_contain (const bitset_t set, Idx i)
746 return (set[i / BITSET_WORD_BITS] >> i % BITSET_WORD_BITS) & 1;
750 bitset_empty (bitset_t set)
752 memset (set, '\0', sizeof (bitset_t));
756 bitset_set_all (bitset_t set)
758 memset (set, -1, sizeof (bitset_word_t) * (SBC_MAX / BITSET_WORD_BITS));
759 if (SBC_MAX % BITSET_WORD_BITS != 0)
760 set[BITSET_WORDS - 1] =
761 ((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1;
765 bitset_copy (bitset_t dest, const bitset_t src)
767 memcpy (dest, src, sizeof (bitset_t));
771 bitset_not (bitset_t set)
774 for (bitset_i = 0; bitset_i < SBC_MAX / BITSET_WORD_BITS; ++bitset_i)
775 set[bitset_i] = ~set[bitset_i];
776 if (SBC_MAX % BITSET_WORD_BITS != 0)
777 set[BITSET_WORDS - 1] =
778 ((((bitset_word_t) 1 << SBC_MAX % BITSET_WORD_BITS) - 1)
779 & ~set[BITSET_WORDS - 1]);
783 bitset_merge (bitset_t dest, const bitset_t src)
786 for (bitset_i = 0; bitset_i < BITSET_WORDS; ++bitset_i)
787 dest[bitset_i] |= src[bitset_i];
791 bitset_mask (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];
798 #ifdef RE_ENABLE_I18N
799 /* Functions for re_string. */
801 internal_function __attribute ((pure))
802 re_string_char_size_at (const re_string_t *pstr, Idx idx)
805 if (pstr->mb_cur_max == 1)
807 for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
808 if (pstr->wcs[idx + byte_idx] != WEOF)
814 internal_function __attribute ((pure))
815 re_string_wchar_at (const re_string_t *pstr, Idx idx)
817 if (pstr->mb_cur_max == 1)
818 return (wint_t) pstr->mbs[idx];
819 return (wint_t) pstr->wcs[idx];
824 internal_function __attribute ((pure))
825 re_string_elem_size_at (const re_string_t *pstr, Idx idx)
828 const unsigned char *p, *extra;
829 const int32_t *table, *indirect;
830 # include <locale/weight.h>
831 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
835 table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
836 extra = (const unsigned char *)
837 _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
838 indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
839 _NL_COLLATE_INDIRECTMB);
841 findidx (&p, pstr->len - idx);
842 return p - pstr->mbs - idx;
849 #endif /* RE_ENABLE_I18N */
851 #ifndef __GNUC_PREREQ
852 # if defined __GNUC__ && defined __GNUC_MINOR__
853 # define __GNUC_PREREQ(maj, min) \
854 ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min))
856 # define __GNUC_PREREQ(maj, min) 0
860 #if __GNUC_PREREQ (3,4)
861 # undef __attribute_warn_unused_result__
862 # define __attribute_warn_unused_result__ \
863 __attribute__ ((__warn_unused_result__))
865 # define __attribute_warn_unused_result__ /* empty */
868 #endif /* _REGEX_INTERNAL_H */