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
30 #if defined HAVE_LANGINFO_H || defined HAVE_LANGINFO_CODESET || defined _LIBC
31 # include <langinfo.h>
33 #if defined HAVE_LOCALE_H || defined _LIBC
36 #if defined HAVE_WCHAR_H || defined _LIBC
38 #endif /* HAVE_WCHAR_H || _LIBC */
39 #if defined HAVE_WCTYPE_H || defined _LIBC
41 #endif /* HAVE_WCTYPE_H || _LIBC */
43 # include <bits/libc-lock.h>
45 # define __libc_lock_define(CLASS,NAME)
46 # define __libc_lock_init(NAME) do { } while (0)
47 # define __libc_lock_lock(NAME) do { } while (0)
48 # define __libc_lock_unlock(NAME) do { } while (0)
51 /* In case that the system doesn't have isblank(). */
52 #if !defined _LIBC && !defined HAVE_ISBLANK && !defined isblank
53 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
57 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
58 # define _RE_DEFINE_LOCALE_FUNCTIONS 1
59 # include <locale/localeinfo.h>
60 # include <locale/elem-hash.h>
61 # include <locale/coll-lookup.h>
65 /* This is for other GNU distributions with internationalized messages. */
66 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
70 # define gettext(msgid) \
71 INTUSE(__dcgettext) (_libc_intl_domainname, msgid, LC_MESSAGES)
74 # define gettext(msgid) (msgid)
78 /* This define is so xgettext can find the internationalizable
80 # define gettext_noop(String) String
83 #if (defined MB_CUR_MAX && HAVE_LOCALE_H && HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_WCRTOMB && HAVE_MBRTOWC && HAVE_WCSCOLL) || _LIBC
84 # define RE_ENABLE_I18N
88 # define BE(expr, val) __builtin_expect (expr, val)
90 # define BE(expr, val) (expr)
94 /* Number of single byte character. */
97 #define COLL_ELEM_LEN_MAX 8
99 /* The character which represents newline. */
100 #define NEWLINE_CHAR '\n'
101 #define WIDE_NEWLINE_CHAR L'\n'
103 /* Rename to standard API for using out of glibc. */
105 # define __wctype wctype
106 # define __iswctype iswctype
107 # define __btowc btowc
109 # define __mempcpy mempcpy
111 # define __wcrtomb wcrtomb
112 # define __regfree regfree
113 # define attribute_hidden
114 #endif /* not _LIBC */
117 # define __attribute(arg) __attribute__ (arg)
119 # define __attribute(arg)
122 extern const char __re_error_msgid[] attribute_hidden;
123 extern const size_t __re_error_msgid_idx[] attribute_hidden;
125 typedef __re_idx_t Idx;
127 /* Special return value for failure to match. */
128 #define REG_MISSING ((Idx) -1)
130 /* Special return value for internal error. */
131 #define REG_ERROR ((Idx) -2)
133 /* Test whether N is a valid index, and is not one of the above. */
134 #ifdef _REGEX_LARGE_OFFSETS
135 # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR)
137 # define REG_VALID_INDEX(n) (0 <= (n))
140 /* Test whether N is a valid nonzero index. */
141 #ifdef _REGEX_LARGE_OFFSETS
142 # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1))
144 # define REG_VALID_NONZERO_INDEX(n) (0 < (n))
147 /* A hash value, suitable for computing hash tables. */
148 typedef __re_size_t re_hashval_t;
150 /* Number of bits in an unsinged int. */
151 #define UINT_BITS (sizeof (unsigned int) * CHAR_BIT)
152 /* Number of unsigned int in an bit_set. */
153 #define BITSET_UINTS ((SBC_MAX + UINT_BITS - 1) / UINT_BITS)
154 typedef unsigned int bitset[BITSET_UINTS];
155 typedef unsigned int *re_bitset_ptr_t;
156 typedef const unsigned int *re_const_bitset_ptr_t;
158 #define bitset_set(set,i) (set[i / UINT_BITS] |= 1u << i % UINT_BITS)
159 #define bitset_clear(set,i) (set[i / UINT_BITS] &= ~(1u << i % UINT_BITS))
160 #define bitset_contain(set,i) (set[i / UINT_BITS] & (1u << i % UINT_BITS))
161 #define bitset_empty(set) memset (set, 0, sizeof (unsigned int) * BITSET_UINTS)
162 #define bitset_set_all(set) \
163 memset (set, 255, sizeof (unsigned int) * BITSET_UINTS)
164 #define bitset_copy(dest,src) \
165 memcpy (dest, src, sizeof (unsigned int) * BITSET_UINTS)
167 #define PREV_WORD_CONSTRAINT 0x0001
168 #define PREV_NOTWORD_CONSTRAINT 0x0002
169 #define NEXT_WORD_CONSTRAINT 0x0004
170 #define NEXT_NOTWORD_CONSTRAINT 0x0008
171 #define PREV_NEWLINE_CONSTRAINT 0x0010
172 #define NEXT_NEWLINE_CONSTRAINT 0x0020
173 #define PREV_BEGBUF_CONSTRAINT 0x0040
174 #define NEXT_ENDBUF_CONSTRAINT 0x0080
175 #define WORD_DELIM_CONSTRAINT 0x0100
176 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
180 INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
181 WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
182 WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
183 INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
184 LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
185 LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
186 BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
187 BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
188 WORD_DELIM = WORD_DELIM_CONSTRAINT,
189 NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
203 /* Node type, These are used by token, node, tree. */
209 #ifdef RE_ENABLE_I18N
212 #endif /* RE_ENABLE_I18N */
214 /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
215 when the debugger shows values of this enum type. */
216 #define EPSILON_BIT 8
217 OP_OPEN_SUBEXP = EPSILON_BIT | 0,
218 OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
219 OP_ALT = EPSILON_BIT | 2,
220 OP_DUP_ASTERISK = EPSILON_BIT | 3,
221 ANCHOR = EPSILON_BIT | 4,
223 /* Tree type, these are used only by tree. */
227 /* Token type, these are used only by token. */
239 OP_CLOSE_EQUIV_CLASS,
250 #ifdef RE_ENABLE_I18N
253 /* Multibyte characters. */
256 /* Collating symbols. */
261 /* Equivalence classes. */
263 int32_t *equiv_classes;
266 /* Range expressions. */
268 uint32_t *range_starts;
269 uint32_t *range_ends;
270 # else /* not _LIBC */
271 wchar_t *range_starts;
273 # endif /* not _LIBC */
275 /* Character classes. */
276 wctype_t *char_classes;
278 /* If this character set is the non-matching list. */
279 unsigned int non_match : 1;
281 /* # of multibyte characters. */
284 /* # of collating symbols. */
287 /* # of equivalence classes. */
290 /* # of range expressions. */
293 /* # of character classes. */
296 #endif /* RE_ENABLE_I18N */
302 unsigned char c; /* for CHARACTER */
303 re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */
304 #ifdef RE_ENABLE_I18N
305 re_charset_t *mbcset; /* for COMPLEX_BRACKET */
306 #endif /* RE_ENABLE_I18N */
307 Idx idx; /* for BACK_REF */
308 re_context_type ctx_type; /* for ANCHOR */
311 re_token_type_t type : 8;
313 re_token_type_t type;
315 unsigned int constraint : 10; /* context constraint */
316 unsigned int duplicated : 1;
317 unsigned int opt_subexp : 1;
318 #ifdef RE_ENABLE_I18N
319 unsigned int accept_mb : 1;
320 /* These 2 bits can be moved into the union if needed (e.g. if running out
321 of bits; move opr.c to opr.c.c and move the flags to opr.c.flags). */
322 unsigned int mb_partial : 1;
324 unsigned int word_char : 1;
327 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
331 /* Indicate the raw buffer which is the original string passed as an
332 argument of regexec(), re_search(), etc.. */
333 const unsigned char *raw_mbs;
334 /* Store the multibyte string. In case of "case insensitive mode" like
335 REG_ICASE, upper cases of the string are stored, otherwise MBS points
336 the same address that RAW_MBS points. */
338 #ifdef RE_ENABLE_I18N
339 /* Store the wide character string which is corresponding to MBS. */
344 /* Index in RAW_MBS. Each character mbs[i] corresponds to
345 raw_mbs[raw_mbs_idx + i]. */
347 /* The length of the valid characters in the buffers. */
349 /* The corresponding number of bytes in raw_mbs array. */
351 /* The length of the buffers MBS and WCS. */
353 /* The index in MBS, which is updated by re_string_fetch_byte. */
355 /* length of RAW_MBS array. */
357 /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN. */
359 /* End of the buffer may be shorter than its length in the cases such
360 as re_match_2, re_search_2. Then, we use STOP for end of the buffer
363 /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS. */
366 /* The context of mbs[0]. We store the context independently, since
367 the context of mbs[0] may be different from raw_mbs[0], which is
368 the beginning of the input string. */
369 unsigned int tip_context;
370 /* The translation passed as a part of an argument of re_compile_pattern. */
371 unsigned REG_TRANSLATE_TYPE trans;
372 /* Copy of re_dfa_t's word_char. */
373 re_const_bitset_ptr_t word_char;
374 /* true if REG_ICASE. */
376 unsigned char is_utf8;
377 unsigned char map_notascii;
378 unsigned char mbs_allocated;
379 unsigned char offsets_needed;
380 unsigned char newline_anchor;
381 unsigned char word_ops_used;
384 typedef struct re_string_t re_string_t;
388 typedef struct re_dfa_t re_dfa_t;
392 # define internal_function __attribute ((regparm (3), stdcall))
394 # define internal_function
398 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
401 #ifdef RE_ENABLE_I18N
402 static void build_wcs_buffer (re_string_t *pstr) internal_function;
403 static reg_errcode_t build_wcs_upper_buffer (re_string_t *pstr)
405 #endif /* RE_ENABLE_I18N */
406 static void build_upper_buffer (re_string_t *pstr) internal_function;
407 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
408 static unsigned int re_string_context_at (const re_string_t *input,
410 internal_function __attribute ((pure));
412 #define re_string_peek_byte(pstr, offset) \
413 ((pstr)->mbs[(pstr)->cur_idx + offset])
414 #define re_string_fetch_byte(pstr) \
415 ((pstr)->mbs[(pstr)->cur_idx++])
416 #define re_string_first_byte(pstr, idx) \
417 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
418 #define re_string_is_single_byte_char(pstr, idx) \
419 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
420 || (pstr)->wcs[(idx) + 1] != WEOF))
421 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
422 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
423 #define re_string_get_buffer(pstr) ((pstr)->mbs)
424 #define re_string_length(pstr) ((pstr)->len)
425 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
426 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
427 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
433 /* The OS usually guarantees only one guard page at the bottom of the stack,
434 and a page size can be as small as 4096 bytes. So we cannot safely
435 allocate anything larger than 4096 bytes. Also care for the possibility
436 of a few compiler-allocated temporary stack slots. */
437 # define __libc_use_alloca(n) ((n) < 4032)
439 /* alloca is implemented with malloc, so just use malloc. */
440 # define __libc_use_alloca(n) 0
444 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
445 #define re_xmalloc(t,n) ((t *) re_xnmalloc (n, sizeof (t)))
446 #define re_calloc(t,n) ((t *) calloc (n, sizeof (t)))
447 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
448 #define re_xrealloc(p,t,n) ((t *) re_xnrealloc (p, n, sizeof (t)))
449 #define re_x2realloc(p,t,pn) ((t *) re_x2nrealloc (p, pn, sizeof (t)))
450 #define re_free(p) free (p)
453 # define SIZE_MAX ((size_t) -1)
456 /* Return true if an array of N objects, each of size S, cannot exist
457 due to size arithmetic overflow. S must be nonzero. */
459 re_alloc_oversized (size_t n, size_t s)
461 return BE (SIZE_MAX / s < n, 0);
464 /* Return true if an array of (2 * N + 1) objects, each of size S,
465 cannot exist due to size arithmetic overflow. S must be nonzero. */
467 re_x2alloc_oversized (size_t n, size_t s)
469 return BE ((SIZE_MAX / s - 1) / 2 < n, 0);
472 /* Allocate an array of N objects, each with S bytes of memory,
473 dynamically, with error checking. S must be nonzero. */
475 re_xnmalloc (size_t n, size_t s)
477 return re_alloc_oversized (n, s) ? NULL : malloc (n * s);
480 /* Change the size of an allocated block of memory P to an array of N
481 objects each of S bytes, with error checking. S must be nonzero. */
483 re_xnrealloc (void *p, size_t n, size_t s)
485 return re_alloc_oversized (n, s) ? NULL : realloc (p, n * s);
488 /* Reallocate a block of memory P to an array of (2 * (*PN) + 1)
489 objects each of S bytes, with error checking. S must be nonzero.
490 If the allocation is successful, set *PN to the new allocation
491 count and return the resulting pointer. Otherwise, return
494 re_x2nrealloc (void *p, size_t *pn, size_t s)
496 if (re_x2alloc_oversized (*pn, s))
500 /* Add 1 in case *PN is zero. */
501 size_t n1 = 2 * *pn + 1;
502 p = realloc (p, n1 * s);
503 if (BE (p != NULL, 1))
511 struct bin_tree_t *parent;
512 struct bin_tree_t *left;
513 struct bin_tree_t *right;
514 struct bin_tree_t *first;
515 struct bin_tree_t *next;
519 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
520 Otherwise `type' indicate the type of this node. */
523 typedef struct bin_tree_t bin_tree_t;
525 #define BIN_TREE_STORAGE_SIZE \
526 ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
528 struct bin_tree_storage_t
530 struct bin_tree_storage_t *next;
531 bin_tree_t data[BIN_TREE_STORAGE_SIZE];
533 typedef struct bin_tree_storage_t bin_tree_storage_t;
535 #define CONTEXT_WORD 1
536 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
537 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
538 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
540 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
541 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
542 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
543 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
544 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
546 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
547 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
548 #define IS_WIDE_WORD_CHAR(ch) (iswalnum (ch) || (ch) == L'_')
549 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
551 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
552 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
553 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
554 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
555 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
557 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
558 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
559 || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
560 || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
561 || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
567 re_node_set non_eps_nodes;
568 re_node_set inveclosure;
569 re_node_set *entrance_nodes;
570 struct re_dfastate_t **trtable, **word_trtable;
571 unsigned int context : 4;
572 unsigned int halt : 1;
573 /* If this state can accept `multi byte'.
574 Note that we refer to multibyte characters, and multi character
575 collating elements as `multi byte'. */
576 unsigned int accept_mb : 1;
577 /* If this state has backreference node(s). */
578 unsigned int has_backref : 1;
579 unsigned int has_constraint : 1;
581 typedef struct re_dfastate_t re_dfastate_t;
583 struct re_state_table_entry
587 re_dfastate_t **array;
590 /* Array type used in re_sub_match_last_t and re_sub_match_top_t. */
596 re_dfastate_t **array;
599 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP. */
604 Idx str_idx; /* The position NODE match at. */
606 } re_sub_match_last_t;
608 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
609 And information about the node, whose type is OP_CLOSE_SUBEXP,
610 corresponding to NODE is stored in LASTS. */
617 Idx alasts; /* Allocation size of LASTS. */
618 Idx nlasts; /* The number of LASTS. */
619 re_sub_match_last_t **lasts;
620 } re_sub_match_top_t;
622 struct re_backref_cache_entry
630 unsigned short int eps_reachable_subexps_map;
635 /* The string object corresponding to the input string. */
637 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
642 /* EFLAGS of the argument of regexec. */
644 /* Where the matching ends. */
647 /* The state log used by the matcher. */
648 re_dfastate_t **state_log;
650 /* Back reference cache. */
653 struct re_backref_cache_entry *bkref_ents;
657 re_sub_match_top_t **sub_tops;
658 } re_match_context_t;
662 re_dfastate_t **sifted_states;
663 re_dfastate_t **limited_states;
669 struct re_fail_stack_ent_t
674 re_node_set eps_via_nodes;
677 struct re_fail_stack_t
681 struct re_fail_stack_ent_t *stack;
692 re_node_set *eclosures;
693 re_node_set *inveclosures;
694 struct re_state_table_entry *state_table;
695 re_dfastate_t *init_state;
696 re_dfastate_t *init_state_word;
697 re_dfastate_t *init_state_nl;
698 re_dfastate_t *init_state_begbuf;
699 bin_tree_t *str_tree;
700 bin_tree_storage_t *str_tree_storage;
701 re_bitset_ptr_t sb_char;
702 int str_tree_storage_idx;
704 /* number of subexpressions `re_nsub' is in regex_t. */
705 re_hashval_t state_hash_mask;
707 Idx nbackref; /* The number of backreference in this dfa. */
709 /* Bitmap expressing which backreference is used. */
710 unsigned int used_bkref_map;
711 unsigned int completed_bkref_map;
713 unsigned int has_plural_match : 1;
714 /* If this dfa has "multibyte node", which is a backreference or
715 a node which can accept multibyte character or multi character
716 collating element. */
717 unsigned int has_mb_node : 1;
718 unsigned int is_utf8 : 1;
719 unsigned int map_notascii : 1;
720 unsigned int word_ops_used : 1;
728 __libc_lock_define (, lock)
731 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
732 #define re_node_set_remove(set,id) \
733 (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
734 #define re_node_set_empty(p) ((p)->nelem = 0)
735 #define re_node_set_free(set) re_free ((set)->elems)
737 static void free_state (re_dfastate_t *state) internal_function;
751 bracket_elem_type type;
761 /* Inline functions for bitset operation. */
763 bitset_not (bitset set)
766 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
767 set[bitset_i] = ~set[bitset_i];
771 bitset_merge (bitset dest, const bitset src)
774 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
775 dest[bitset_i] |= src[bitset_i];
779 bitset_not_merge (bitset dest, const bitset src)
782 for (i = 0; i < BITSET_UINTS; ++i)
787 bitset_mask (bitset dest, const bitset src)
790 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
791 dest[bitset_i] &= src[bitset_i];
794 #if defined RE_ENABLE_I18N
795 /* Inline functions for re_string. */
797 internal_function __attribute ((pure))
798 re_string_char_size_at (const re_string_t *pstr, Idx idx)
801 if (pstr->mb_cur_max == 1)
803 for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
804 if (pstr->wcs[idx + byte_idx] != WEOF)
810 internal_function __attribute ((pure))
811 re_string_wchar_at (const re_string_t *pstr, Idx idx)
813 if (pstr->mb_cur_max == 1)
814 return (wint_t) pstr->mbs[idx];
815 return (wint_t) pstr->wcs[idx];
819 internal_function __attribute ((pure))
820 re_string_elem_size_at (const re_string_t *pstr, Idx idx)
823 const unsigned char *p, *extra;
824 const int32_t *table, *indirect;
826 # include <locale/weight.h>
827 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
831 table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
832 extra = (const unsigned char *)
833 _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
834 indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
835 _NL_COLLATE_INDIRECTMB);
838 return p - pstr->mbs - idx;
844 #endif /* RE_ENABLE_I18N */
846 #endif /* _REGEX_INTERNAL_H */