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
29 #if defined HAVE_LANGINFO_H || defined HAVE_LANGINFO_CODESET || defined _LIBC
30 # include <langinfo.h>
32 #if defined HAVE_LOCALE_H || defined _LIBC
35 #if defined HAVE_WCHAR_H || defined _LIBC
37 #endif /* HAVE_WCHAR_H || _LIBC */
38 #if defined HAVE_WCTYPE_H || defined _LIBC
40 #endif /* HAVE_WCTYPE_H || _LIBC */
42 # include <bits/libc-lock.h>
44 # define __libc_lock_define(CLASS,NAME)
45 # define __libc_lock_init(NAME) do { } while (0)
46 # define __libc_lock_lock(NAME) do { } while (0)
47 # define __libc_lock_unlock(NAME) do { } while (0)
50 /* In case that the system doesn't have isblank(). */
51 #if !defined _LIBC && !defined HAVE_ISBLANK && !defined isblank
52 # define isblank(ch) ((ch) == ' ' || (ch) == '\t')
56 # ifndef _RE_DEFINE_LOCALE_FUNCTIONS
57 # define _RE_DEFINE_LOCALE_FUNCTIONS 1
58 # include <locale/localeinfo.h>
59 # include <locale/elem-hash.h>
60 # include <locale/coll-lookup.h>
64 /* This is for other GNU distributions with internationalized messages. */
65 #if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
69 # define gettext(msgid) \
70 INTUSE(__dcgettext) (_libc_intl_domainname, msgid, LC_MESSAGES)
73 # define gettext(msgid) (msgid)
77 /* This define is so xgettext can find the internationalizable
79 # define gettext_noop(String) String
82 #if (defined MB_CUR_MAX && HAVE_LOCALE_H && HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_WCRTOMB && HAVE_MBRTOWC && HAVE_WCSCOLL) || _LIBC
83 # define RE_ENABLE_I18N
87 # define BE(expr, val) __builtin_expect (expr, val)
89 # define BE(expr, val) (expr)
93 /* Number of bits in a byte. */
95 /* Number of single byte character. */
98 #define COLL_ELEM_LEN_MAX 8
100 /* The character which represents newline. */
101 #define NEWLINE_CHAR '\n'
102 #define WIDE_NEWLINE_CHAR L'\n'
104 /* Rename to standard API for using out of glibc. */
106 # define __wctype wctype
107 # define __iswctype iswctype
108 # define __btowc btowc
110 # define __mempcpy mempcpy
112 # define __wcrtomb wcrtomb
113 # define __regfree regfree
114 # define attribute_hidden
115 #endif /* not _LIBC */
118 # define __attribute(arg) __attribute__ (arg)
120 # define __attribute(arg)
123 extern const char __re_error_msgid[] attribute_hidden;
124 extern const size_t __re_error_msgid_idx[] attribute_hidden;
126 /* Number of bits in an unsinged int. */
127 #define UINT_BITS (sizeof (unsigned int) * BYTE_BITS)
128 /* Number of unsigned int in an bit_set. */
129 #define BITSET_UINTS ((SBC_MAX + UINT_BITS - 1) / UINT_BITS)
130 typedef unsigned int bitset[BITSET_UINTS];
131 typedef unsigned int *re_bitset_ptr_t;
132 typedef const unsigned int *re_const_bitset_ptr_t;
134 #define bitset_set(set,i) (set[i / UINT_BITS] |= 1 << i % UINT_BITS)
135 #define bitset_clear(set,i) (set[i / UINT_BITS] &= ~(1 << i % UINT_BITS))
136 #define bitset_contain(set,i) (set[i / UINT_BITS] & (1 << i % UINT_BITS))
137 #define bitset_empty(set) memset (set, 0, sizeof (unsigned int) * BITSET_UINTS)
138 #define bitset_set_all(set) \
139 memset (set, 255, sizeof (unsigned int) * BITSET_UINTS)
140 #define bitset_copy(dest,src) \
141 memcpy (dest, src, sizeof (unsigned int) * BITSET_UINTS)
142 static inline void bitset_not (bitset set);
143 static inline void bitset_merge (bitset dest, const bitset src);
144 static inline void bitset_not_merge (bitset dest, const bitset src);
145 static inline void bitset_mask (bitset dest, const bitset src);
147 #define PREV_WORD_CONSTRAINT 0x0001
148 #define PREV_NOTWORD_CONSTRAINT 0x0002
149 #define NEXT_WORD_CONSTRAINT 0x0004
150 #define NEXT_NOTWORD_CONSTRAINT 0x0008
151 #define PREV_NEWLINE_CONSTRAINT 0x0010
152 #define NEXT_NEWLINE_CONSTRAINT 0x0020
153 #define PREV_BEGBUF_CONSTRAINT 0x0040
154 #define NEXT_ENDBUF_CONSTRAINT 0x0080
155 #define WORD_DELIM_CONSTRAINT 0x0100
156 #define NOT_WORD_DELIM_CONSTRAINT 0x0200
160 INSIDE_WORD = PREV_WORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
161 WORD_FIRST = PREV_NOTWORD_CONSTRAINT | NEXT_WORD_CONSTRAINT,
162 WORD_LAST = PREV_WORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
163 INSIDE_NOTWORD = PREV_NOTWORD_CONSTRAINT | NEXT_NOTWORD_CONSTRAINT,
164 LINE_FIRST = PREV_NEWLINE_CONSTRAINT,
165 LINE_LAST = NEXT_NEWLINE_CONSTRAINT,
166 BUF_FIRST = PREV_BEGBUF_CONSTRAINT,
167 BUF_LAST = NEXT_ENDBUF_CONSTRAINT,
168 WORD_DELIM = WORD_DELIM_CONSTRAINT,
169 NOT_WORD_DELIM = NOT_WORD_DELIM_CONSTRAINT
183 /* Node type, These are used by token, node, tree. */
189 #ifdef RE_ENABLE_I18N
192 #endif /* RE_ENABLE_I18N */
194 /* We define EPSILON_BIT as a macro so that OP_OPEN_SUBEXP is used
195 when the debugger shows values of this enum type. */
196 #define EPSILON_BIT 8
197 OP_OPEN_SUBEXP = EPSILON_BIT | 0,
198 OP_CLOSE_SUBEXP = EPSILON_BIT | 1,
199 OP_ALT = EPSILON_BIT | 2,
200 OP_DUP_ASTERISK = EPSILON_BIT | 3,
201 ANCHOR = EPSILON_BIT | 4,
203 /* Tree type, these are used only by tree. */
207 /* Token type, these are used only by token. */
219 OP_CLOSE_EQUIV_CLASS,
230 #ifdef RE_ENABLE_I18N
233 /* Multibyte characters. */
236 /* Collating symbols. */
241 /* Equivalence classes. */
243 int32_t *equiv_classes;
246 /* Range expressions. */
248 uint32_t *range_starts;
249 uint32_t *range_ends;
250 # else /* not _LIBC */
251 wchar_t *range_starts;
253 # endif /* not _LIBC */
255 /* Character classes. */
256 wctype_t *char_classes;
258 /* If this character set is the non-matching list. */
259 unsigned int non_match : 1;
261 /* # of multibyte characters. */
264 /* # of collating symbols. */
267 /* # of equivalence classes. */
270 /* # of range expressions. */
273 /* # of character classes. */
276 #endif /* RE_ENABLE_I18N */
282 unsigned char c; /* for CHARACTER */
283 re_bitset_ptr_t sbcset; /* for SIMPLE_BRACKET */
284 #ifdef RE_ENABLE_I18N
285 re_charset_t *mbcset; /* for COMPLEX_BRACKET */
286 #endif /* RE_ENABLE_I18N */
287 int idx; /* for BACK_REF */
288 re_context_type ctx_type; /* for ANCHOR */
291 re_token_type_t type : 8;
293 re_token_type_t type;
295 unsigned int constraint : 10; /* context constraint */
296 unsigned int duplicated : 1;
297 unsigned int opt_subexp : 1;
298 #ifdef RE_ENABLE_I18N
299 unsigned int accept_mb : 1;
300 /* These 2 bits can be moved into the union if needed (e.g. if running out
301 of bits; move opr.c to opr.c.c and move the flags to opr.c.flags). */
302 unsigned int mb_partial : 1;
304 unsigned int word_char : 1;
307 #define IS_EPSILON_NODE(type) ((type) & EPSILON_BIT)
311 /* Indicate the raw buffer which is the original string passed as an
312 argument of regexec(), re_search(), etc.. */
313 const unsigned char *raw_mbs;
314 /* Store the multibyte string. In case of "case insensitive mode" like
315 REG_ICASE, upper cases of the string are stored, otherwise MBS points
316 the same address that RAW_MBS points. */
318 #ifdef RE_ENABLE_I18N
319 /* Store the wide character string which is corresponding to MBS. */
324 /* Index in RAW_MBS. Each character mbs[i] corresponds to
325 raw_mbs[raw_mbs_idx + i]. */
327 /* The length of the valid characters in the buffers. */
329 /* The corresponding number of bytes in raw_mbs array. */
331 /* The length of the buffers MBS and WCS. */
333 /* The index in MBS, which is updated by re_string_fetch_byte. */
335 /* length of RAW_MBS array. */
337 /* This is RAW_LEN - RAW_MBS_IDX + VALID_LEN - VALID_RAW_LEN. */
339 /* End of the buffer may be shorter than its length in the cases such
340 as re_match_2, re_search_2. Then, we use STOP for end of the buffer
343 /* This is RAW_STOP - RAW_MBS_IDX adjusted through OFFSETS. */
346 /* The context of mbs[0]. We store the context independently, since
347 the context of mbs[0] may be different from raw_mbs[0], which is
348 the beginning of the input string. */
349 unsigned int tip_context;
350 /* The translation passed as a part of an argument of re_compile_pattern. */
351 unsigned RE_TRANSLATE_TYPE trans;
352 /* Copy of re_dfa_t's word_char. */
353 re_const_bitset_ptr_t word_char;
354 /* 1 if REG_ICASE. */
356 unsigned char is_utf8;
357 unsigned char map_notascii;
358 unsigned char mbs_allocated;
359 unsigned char offsets_needed;
360 unsigned char newline_anchor;
361 unsigned char word_ops_used;
364 typedef struct re_string_t re_string_t;
368 typedef struct re_dfa_t re_dfa_t;
372 # define internal_function __attribute ((regparm (3), stdcall))
374 # define internal_function
378 static reg_errcode_t re_string_allocate (re_string_t *pstr, const char *str,
379 int len, int init_len,
380 RE_TRANSLATE_TYPE trans, int icase,
383 static reg_errcode_t re_string_construct (re_string_t *pstr, const char *str,
384 int len, RE_TRANSLATE_TYPE trans,
385 int icase, const re_dfa_t *dfa)
387 static reg_errcode_t re_string_reconstruct (re_string_t *pstr, int idx,
388 int eflags) internal_function;
389 static reg_errcode_t re_string_realloc_buffers (re_string_t *pstr,
392 #ifdef RE_ENABLE_I18N
393 static void build_wcs_buffer (re_string_t *pstr) internal_function;
394 static int build_wcs_upper_buffer (re_string_t *pstr) internal_function;
395 #endif /* RE_ENABLE_I18N */
396 static void build_upper_buffer (re_string_t *pstr) internal_function;
397 static void re_string_translate_buffer (re_string_t *pstr) internal_function;
398 static void re_string_destruct (re_string_t *pstr) internal_function;
399 #ifdef RE_ENABLE_I18N
400 static int re_string_elem_size_at (const re_string_t *pstr, int idx)
401 internal_function __attribute ((pure));
402 static inline int re_string_char_size_at (const re_string_t *pstr, int idx)
403 internal_function __attribute ((pure));
404 static inline wint_t re_string_wchar_at (const re_string_t *pstr, int idx)
405 internal_function __attribute ((pure));
406 #endif /* RE_ENABLE_I18N */
407 static unsigned int re_string_context_at (const re_string_t *input, int idx,
409 internal_function __attribute ((pure));
410 static unsigned char re_string_peek_byte_case (const re_string_t *pstr,
412 internal_function __attribute ((pure));
413 static unsigned char re_string_fetch_byte_case (re_string_t *pstr)
414 internal_function __attribute ((pure));
416 #define re_string_peek_byte(pstr, offset) \
417 ((pstr)->mbs[(pstr)->cur_idx + offset])
418 #define re_string_fetch_byte(pstr) \
419 ((pstr)->mbs[(pstr)->cur_idx++])
420 #define re_string_first_byte(pstr, idx) \
421 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
422 #define re_string_is_single_byte_char(pstr, idx) \
423 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
424 || (pstr)->wcs[(idx) + 1] != WEOF))
425 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
426 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
427 #define re_string_get_buffer(pstr) ((pstr)->mbs)
428 #define re_string_length(pstr) ((pstr)->len)
429 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx])
430 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
431 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
433 #define re_malloc(t,n) ((t *) malloc ((n) * sizeof (t)))
434 #define re_realloc(p,t,n) ((t *) realloc (p, (n) * sizeof (t)))
435 #define re_free(p) free (p)
439 struct bin_tree_t *parent;
440 struct bin_tree_t *left;
441 struct bin_tree_t *right;
442 struct bin_tree_t *first;
443 struct bin_tree_t *next;
447 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
448 Otherwise `type' indicate the type of this node. */
451 typedef struct bin_tree_t bin_tree_t;
453 #define BIN_TREE_STORAGE_SIZE \
454 ((1024 - sizeof (void *)) / sizeof (bin_tree_t))
456 struct bin_tree_storage_t
458 struct bin_tree_storage_t *next;
459 bin_tree_t data[BIN_TREE_STORAGE_SIZE];
461 typedef struct bin_tree_storage_t bin_tree_storage_t;
463 #define CONTEXT_WORD 1
464 #define CONTEXT_NEWLINE (CONTEXT_WORD << 1)
465 #define CONTEXT_BEGBUF (CONTEXT_NEWLINE << 1)
466 #define CONTEXT_ENDBUF (CONTEXT_BEGBUF << 1)
468 #define IS_WORD_CONTEXT(c) ((c) & CONTEXT_WORD)
469 #define IS_NEWLINE_CONTEXT(c) ((c) & CONTEXT_NEWLINE)
470 #define IS_BEGBUF_CONTEXT(c) ((c) & CONTEXT_BEGBUF)
471 #define IS_ENDBUF_CONTEXT(c) ((c) & CONTEXT_ENDBUF)
472 #define IS_ORDINARY_CONTEXT(c) ((c) == 0)
474 #define IS_WORD_CHAR(ch) (isalnum (ch) || (ch) == '_')
475 #define IS_NEWLINE(ch) ((ch) == NEWLINE_CHAR)
476 #define IS_WIDE_WORD_CHAR(ch) (iswalnum (ch) || (ch) == L'_')
477 #define IS_WIDE_NEWLINE(ch) ((ch) == WIDE_NEWLINE_CHAR)
479 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \
480 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
481 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
482 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\
483 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context)))
485 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \
486 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \
487 || (((constraint) & NEXT_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \
488 || (((constraint) & NEXT_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context)) \
489 || (((constraint) & NEXT_ENDBUF_CONSTRAINT) && !IS_ENDBUF_CONTEXT (context)))
495 re_node_set non_eps_nodes;
496 re_node_set inveclosure;
497 re_node_set *entrance_nodes;
498 struct re_dfastate_t **trtable, **word_trtable;
499 unsigned int context : 4;
500 unsigned int halt : 1;
501 /* If this state can accept `multi byte'.
502 Note that we refer to multibyte characters, and multi character
503 collating elements as `multi byte'. */
504 unsigned int accept_mb : 1;
505 /* If this state has backreference node(s). */
506 unsigned int has_backref : 1;
507 unsigned int has_constraint : 1;
509 typedef struct re_dfastate_t re_dfastate_t;
511 struct re_state_table_entry
515 re_dfastate_t **array;
518 /* Array type used in re_sub_match_last_t and re_sub_match_top_t. */
524 re_dfastate_t **array;
527 /* Store information about the node NODE whose type is OP_CLOSE_SUBEXP. */
532 int str_idx; /* The position NODE match at. */
534 } re_sub_match_last_t;
536 /* Store information about the node NODE whose type is OP_OPEN_SUBEXP.
537 And information about the node, whose type is OP_CLOSE_SUBEXP,
538 corresponding to NODE is stored in LASTS. */
544 int next_last_offset;
546 int alasts; /* Allocation size of LASTS. */
547 int nlasts; /* The number of LASTS. */
548 re_sub_match_last_t **lasts;
549 } re_sub_match_top_t;
551 struct re_backref_cache_entry
559 unsigned short int eps_reachable_subexps_map;
564 /* The string object corresponding to the input string. */
566 #if defined _LIBC || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L)
571 /* EFLAGS of the argument of regexec. */
573 /* Where the matching ends. */
576 /* The state log used by the matcher. */
577 re_dfastate_t **state_log;
579 /* Back reference cache. */
582 struct re_backref_cache_entry *bkref_ents;
586 re_sub_match_top_t **sub_tops;
587 } re_match_context_t;
591 re_dfastate_t **sifted_states;
592 re_dfastate_t **limited_states;
598 struct re_fail_stack_ent_t
603 re_node_set eps_via_nodes;
606 struct re_fail_stack_t
610 struct re_fail_stack_ent_t *stack;
621 re_node_set *eclosures;
622 re_node_set *inveclosures;
623 struct re_state_table_entry *state_table;
624 re_dfastate_t *init_state;
625 re_dfastate_t *init_state_word;
626 re_dfastate_t *init_state_nl;
627 re_dfastate_t *init_state_begbuf;
628 bin_tree_t *str_tree;
629 bin_tree_storage_t *str_tree_storage;
630 re_bitset_ptr_t sb_char;
631 int str_tree_storage_idx;
633 /* number of subexpressions `re_nsub' is in regex_t. */
634 unsigned int state_hash_mask;
637 int nbackref; /* The number of backreference in this dfa. */
639 /* Bitmap expressing which backreference is used. */
640 unsigned int used_bkref_map;
641 unsigned int completed_bkref_map;
643 unsigned int has_plural_match : 1;
644 /* If this dfa has "multibyte node", which is a backreference or
645 a node which can accept multibyte character or multi character
646 collating element. */
647 unsigned int has_mb_node : 1;
648 unsigned int is_utf8 : 1;
649 unsigned int map_notascii : 1;
650 unsigned int word_ops_used : 1;
658 __libc_lock_define (, lock)
661 #ifndef RE_NO_INTERNAL_PROTOTYPES
662 static reg_errcode_t re_node_set_alloc (re_node_set *set, int size) internal_function;
663 static reg_errcode_t re_node_set_init_1 (re_node_set *set, int elem) internal_function;
664 static reg_errcode_t re_node_set_init_2 (re_node_set *set, int elem1,
665 int elem2) internal_function;
666 #define re_node_set_init_empty(set) memset (set, '\0', sizeof (re_node_set))
667 static reg_errcode_t re_node_set_init_copy (re_node_set *dest,
668 const re_node_set *src) internal_function;
669 static reg_errcode_t re_node_set_add_intersect (re_node_set *dest,
670 const re_node_set *src1,
671 const re_node_set *src2) internal_function;
672 static reg_errcode_t re_node_set_init_union (re_node_set *dest,
673 const re_node_set *src1,
674 const re_node_set *src2) internal_function;
675 static reg_errcode_t re_node_set_merge (re_node_set *dest,
676 const re_node_set *src) internal_function;
677 static int re_node_set_insert (re_node_set *set, int elem) internal_function;
678 static int re_node_set_insert_last (re_node_set *set,
679 int elem) internal_function;
680 static int re_node_set_compare (const re_node_set *set1,
681 const re_node_set *set2)
682 internal_function __attribute ((pure));
683 static int re_node_set_contains (const re_node_set *set, int elem)
684 internal_function __attribute ((pure));
685 static void re_node_set_remove_at (re_node_set *set, int idx) internal_function;
686 #define re_node_set_remove(set,id) \
687 (re_node_set_remove_at (set, re_node_set_contains (set, id) - 1))
688 #define re_node_set_empty(p) ((p)->nelem = 0)
689 #define re_node_set_free(set) re_free ((set)->elems)
690 static int re_dfa_add_node (re_dfa_t *dfa, re_token_t token) internal_function;
691 static re_dfastate_t *re_acquire_state (reg_errcode_t *err, re_dfa_t *dfa,
692 const re_node_set *nodes) internal_function;
693 static re_dfastate_t *re_acquire_state_context (reg_errcode_t *err,
695 const re_node_set *nodes,
696 unsigned int context) internal_function;
697 static void free_state (re_dfastate_t *state) internal_function;
712 bracket_elem_type type;
722 /* Inline functions for bitset operation. */
724 bitset_not (bitset set)
727 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
728 set[bitset_i] = ~set[bitset_i];
732 bitset_merge (bitset dest, const bitset src)
735 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
736 dest[bitset_i] |= src[bitset_i];
740 bitset_not_merge (bitset dest, const bitset src)
743 for (i = 0; i < BITSET_UINTS; ++i)
748 bitset_mask (bitset dest, const bitset src)
751 for (bitset_i = 0; bitset_i < BITSET_UINTS; ++bitset_i)
752 dest[bitset_i] &= src[bitset_i];
755 #if defined RE_ENABLE_I18N && !defined RE_NO_INTERNAL_PROTOTYPES
756 /* Inline functions for re_string. */
759 re_string_char_size_at (const re_string_t *pstr, int idx)
762 if (pstr->mb_cur_max == 1)
764 for (byte_idx = 1; idx + byte_idx < pstr->valid_len; ++byte_idx)
765 if (pstr->wcs[idx + byte_idx] != WEOF)
772 re_string_wchar_at (const re_string_t *pstr, int idx)
774 if (pstr->mb_cur_max == 1)
775 return (wint_t) pstr->mbs[idx];
776 return (wint_t) pstr->wcs[idx];
781 re_string_elem_size_at (const re_string_t *pstr, int idx)
784 const unsigned char *p, *extra;
785 const int32_t *table, *indirect;
787 # include <locale/weight.h>
788 uint_fast32_t nrules = _NL_CURRENT_WORD (LC_COLLATE, _NL_COLLATE_NRULES);
792 table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB);
793 extra = (const unsigned char *)
794 _NL_CURRENT (LC_COLLATE, _NL_COLLATE_EXTRAMB);
795 indirect = (const int32_t *) _NL_CURRENT (LC_COLLATE,
796 _NL_COLLATE_INDIRECTMB);
799 return p - pstr->mbs - idx;
805 #endif /* RE_ENABLE_I18N */
807 #endif /* _REGEX_INTERNAL_H */