1 /* Extended regular expression matching and search library.
2 Copyright (C) 2002-2011 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 static void re_string_construct_common (const char *str, Idx len,
22 RE_TRANSLATE_TYPE trans, bool icase,
23 const re_dfa_t *dfa) internal_function;
24 static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa,
25 const re_node_set *nodes,
26 re_hashval_t hash) internal_function;
27 static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa,
28 const re_node_set *nodes,
30 re_hashval_t hash) internal_function;
32 /* Functions for string operation. */
34 /* This function allocate the buffers. It is necessary to call
35 re_string_reconstruct before using the object. */
38 internal_function __attribute_warn_unused_result__
39 re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len,
40 RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa)
45 /* Ensure at least one character fits into the buffers. */
46 if (init_len < dfa->mb_cur_max)
47 init_len = dfa->mb_cur_max;
48 init_buf_len = (len + 1 < init_len) ? len + 1: init_len;
49 re_string_construct_common (str, len, pstr, trans, icase, dfa);
51 ret = re_string_realloc_buffers (pstr, init_buf_len);
52 if (BE (ret != REG_NOERROR, 0))
55 pstr->word_char = dfa->word_char;
56 pstr->word_ops_used = dfa->word_ops_used;
57 pstr->mbs = pstr->mbs_allocated ? pstr->mbs : (unsigned char *) str;
58 pstr->valid_len = (pstr->mbs_allocated || dfa->mb_cur_max > 1) ? 0 : len;
59 pstr->valid_raw_len = pstr->valid_len;
63 /* This function allocate the buffers, and initialize them. */
66 internal_function __attribute_warn_unused_result__
67 re_string_construct (re_string_t *pstr, const char *str, Idx len,
68 RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa)
71 memset (pstr, '\0', sizeof (re_string_t));
72 re_string_construct_common (str, len, pstr, trans, icase, dfa);
76 ret = re_string_realloc_buffers (pstr, len + 1);
77 if (BE (ret != REG_NOERROR, 0))
80 pstr->mbs = pstr->mbs_allocated ? pstr->mbs : (unsigned char *) str;
85 if (dfa->mb_cur_max > 1)
89 ret = build_wcs_upper_buffer (pstr);
90 if (BE (ret != REG_NOERROR, 0))
92 if (pstr->valid_raw_len >= len)
94 if (pstr->bufs_len > pstr->valid_len + dfa->mb_cur_max)
96 ret = re_string_realloc_buffers (pstr, pstr->bufs_len * 2);
97 if (BE (ret != REG_NOERROR, 0))
102 #endif /* RE_ENABLE_I18N */
103 build_upper_buffer (pstr);
107 #ifdef RE_ENABLE_I18N
108 if (dfa->mb_cur_max > 1)
109 build_wcs_buffer (pstr);
111 #endif /* RE_ENABLE_I18N */
114 re_string_translate_buffer (pstr);
117 pstr->valid_len = pstr->bufs_len;
118 pstr->valid_raw_len = pstr->bufs_len;
126 /* Helper functions for re_string_allocate, and re_string_construct. */
129 internal_function __attribute_warn_unused_result__
130 re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len)
132 #ifdef RE_ENABLE_I18N
133 if (pstr->mb_cur_max > 1)
137 /* Avoid overflow. */
138 size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx));
139 if (BE (SIZE_MAX / max_object_size < new_buf_len, 0))
142 new_wcs = re_realloc (pstr->wcs, wint_t, new_buf_len);
143 if (BE (new_wcs == NULL, 0))
146 if (pstr->offsets != NULL)
148 Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len);
149 if (BE (new_offsets == NULL, 0))
151 pstr->offsets = new_offsets;
154 #endif /* RE_ENABLE_I18N */
155 if (pstr->mbs_allocated)
157 unsigned char *new_mbs = re_realloc (pstr->mbs, unsigned char,
159 if (BE (new_mbs == NULL, 0))
163 pstr->bufs_len = new_buf_len;
170 re_string_construct_common (const char *str, Idx len, re_string_t *pstr,
171 RE_TRANSLATE_TYPE trans, bool icase,
174 pstr->raw_mbs = (const unsigned char *) str;
179 pstr->mbs_allocated = (trans != NULL || icase);
180 pstr->mb_cur_max = dfa->mb_cur_max;
181 pstr->is_utf8 = dfa->is_utf8;
182 pstr->map_notascii = dfa->map_notascii;
183 pstr->stop = pstr->len;
184 pstr->raw_stop = pstr->stop;
187 #ifdef RE_ENABLE_I18N
189 /* Build wide character buffer PSTR->WCS.
190 If the byte sequence of the string are:
191 <mb1>(0), <mb1>(1), <mb2>(0), <mb2>(1), <sb3>
192 Then wide character buffer will be:
193 <wc1> , WEOF , <wc2> , WEOF , <wc3>
194 We use WEOF for padding, they indicate that the position isn't
195 a first byte of a multibyte character.
197 Note that this function assumes PSTR->VALID_LEN elements are already
198 built and starts from PSTR->VALID_LEN. */
202 build_wcs_buffer (re_string_t *pstr)
205 unsigned char buf[MB_LEN_MAX];
206 assert (MB_LEN_MAX >= pstr->mb_cur_max);
208 unsigned char buf[64];
211 Idx byte_idx, end_idx, remain_len;
214 /* Build the buffers from pstr->valid_len to either pstr->len or
216 end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
217 for (byte_idx = pstr->valid_len; byte_idx < end_idx;)
222 remain_len = end_idx - byte_idx;
223 prev_st = pstr->cur_state;
224 /* Apply the translation if we need. */
225 if (BE (pstr->trans != NULL, 0))
229 for (i = 0; i < pstr->mb_cur_max && i < remain_len; ++i)
231 ch = pstr->raw_mbs [pstr->raw_mbs_idx + byte_idx + i];
232 buf[i] = pstr->mbs[byte_idx + i] = pstr->trans[ch];
234 p = (const char *) buf;
237 p = (const char *) pstr->raw_mbs + pstr->raw_mbs_idx + byte_idx;
238 mbclen = __mbrtowc (&wc, p, remain_len, &pstr->cur_state);
239 if (BE (mbclen == (size_t) -2, 0))
241 /* The buffer doesn't have enough space, finish to build. */
242 pstr->cur_state = prev_st;
245 else if (BE (mbclen == (size_t) -1 || mbclen == 0, 0))
247 /* We treat these cases as a singlebyte character. */
249 wc = (wchar_t) pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx];
250 if (BE (pstr->trans != NULL, 0))
251 wc = pstr->trans[wc];
252 pstr->cur_state = prev_st;
255 /* Write wide character and padding. */
256 pstr->wcs[byte_idx++] = wc;
257 /* Write paddings. */
258 for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
259 pstr->wcs[byte_idx++] = WEOF;
261 pstr->valid_len = byte_idx;
262 pstr->valid_raw_len = byte_idx;
265 /* Build wide character buffer PSTR->WCS like build_wcs_buffer,
266 but for REG_ICASE. */
269 internal_function __attribute_warn_unused_result__
270 build_wcs_upper_buffer (re_string_t *pstr)
273 Idx src_idx, byte_idx, end_idx, remain_len;
276 char buf[MB_LEN_MAX];
277 assert (MB_LEN_MAX >= pstr->mb_cur_max);
282 byte_idx = pstr->valid_len;
283 end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
285 /* The following optimization assumes that ASCII characters can be
286 mapped to wide characters with a simple cast. */
287 if (! pstr->map_notascii && pstr->trans == NULL && !pstr->offsets_needed)
289 while (byte_idx < end_idx)
293 if (isascii (pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx])
294 && mbsinit (&pstr->cur_state))
296 /* In case of a singlebyte character. */
298 = toupper (pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx]);
299 /* The next step uses the assumption that wchar_t is encoded
300 ASCII-safe: all ASCII values can be converted like this. */
301 pstr->wcs[byte_idx] = (wchar_t) pstr->mbs[byte_idx];
306 remain_len = end_idx - byte_idx;
307 prev_st = pstr->cur_state;
308 mbclen = __mbrtowc (&wc,
309 ((const char *) pstr->raw_mbs + pstr->raw_mbs_idx
310 + byte_idx), remain_len, &pstr->cur_state);
311 if (BE (mbclen < (size_t) -2, 1))
319 mbcdlen = wcrtomb (buf, wcu, &prev_st);
320 if (BE (mbclen == mbcdlen, 1))
321 memcpy (pstr->mbs + byte_idx, buf, mbclen);
329 memcpy (pstr->mbs + byte_idx,
330 pstr->raw_mbs + pstr->raw_mbs_idx + byte_idx, mbclen);
331 pstr->wcs[byte_idx++] = wcu;
332 /* Write paddings. */
333 for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
334 pstr->wcs[byte_idx++] = WEOF;
336 else if (mbclen == (size_t) -1 || mbclen == 0)
338 /* It is an invalid character or '\0'. Just use the byte. */
339 int ch = pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx];
340 pstr->mbs[byte_idx] = ch;
341 /* And also cast it to wide char. */
342 pstr->wcs[byte_idx++] = (wchar_t) ch;
343 if (BE (mbclen == (size_t) -1, 0))
344 pstr->cur_state = prev_st;
348 /* The buffer doesn't have enough space, finish to build. */
349 pstr->cur_state = prev_st;
353 pstr->valid_len = byte_idx;
354 pstr->valid_raw_len = byte_idx;
358 for (src_idx = pstr->valid_raw_len; byte_idx < end_idx;)
363 remain_len = end_idx - byte_idx;
364 prev_st = pstr->cur_state;
365 if (BE (pstr->trans != NULL, 0))
369 for (i = 0; i < pstr->mb_cur_max && i < remain_len; ++i)
371 ch = pstr->raw_mbs [pstr->raw_mbs_idx + src_idx + i];
372 buf[i] = pstr->trans[ch];
374 p = (const char *) buf;
377 p = (const char *) pstr->raw_mbs + pstr->raw_mbs_idx + src_idx;
378 mbclen = __mbrtowc (&wc, p, remain_len, &pstr->cur_state);
379 if (BE (mbclen < (size_t) -2, 1))
387 mbcdlen = wcrtomb ((char *) buf, wcu, &prev_st);
388 if (BE (mbclen == mbcdlen, 1))
389 memcpy (pstr->mbs + byte_idx, buf, mbclen);
390 else if (mbcdlen != (size_t) -1)
394 if (byte_idx + mbcdlen > pstr->bufs_len)
396 pstr->cur_state = prev_st;
400 if (pstr->offsets == NULL)
402 pstr->offsets = re_malloc (Idx, pstr->bufs_len);
404 if (pstr->offsets == NULL)
407 if (!pstr->offsets_needed)
409 for (i = 0; i < (size_t) byte_idx; ++i)
410 pstr->offsets[i] = i;
411 pstr->offsets_needed = 1;
414 memcpy (pstr->mbs + byte_idx, buf, mbcdlen);
415 pstr->wcs[byte_idx] = wcu;
416 pstr->offsets[byte_idx] = src_idx;
417 for (i = 1; i < mbcdlen; ++i)
419 pstr->offsets[byte_idx + i]
420 = src_idx + (i < mbclen ? i : mbclen - 1);
421 pstr->wcs[byte_idx + i] = WEOF;
423 pstr->len += mbcdlen - mbclen;
424 if (pstr->raw_stop > src_idx)
425 pstr->stop += mbcdlen - mbclen;
426 end_idx = (pstr->bufs_len > pstr->len)
427 ? pstr->len : pstr->bufs_len;
433 memcpy (pstr->mbs + byte_idx, p, mbclen);
436 memcpy (pstr->mbs + byte_idx, p, mbclen);
438 if (BE (pstr->offsets_needed != 0, 0))
441 for (i = 0; i < mbclen; ++i)
442 pstr->offsets[byte_idx + i] = src_idx + i;
446 pstr->wcs[byte_idx++] = wcu;
447 /* Write paddings. */
448 for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
449 pstr->wcs[byte_idx++] = WEOF;
451 else if (mbclen == (size_t) -1 || mbclen == 0)
453 /* It is an invalid character or '\0'. Just use the byte. */
454 int ch = pstr->raw_mbs[pstr->raw_mbs_idx + src_idx];
456 if (BE (pstr->trans != NULL, 0))
457 ch = pstr->trans [ch];
458 pstr->mbs[byte_idx] = ch;
460 if (BE (pstr->offsets_needed != 0, 0))
461 pstr->offsets[byte_idx] = src_idx;
464 /* And also cast it to wide char. */
465 pstr->wcs[byte_idx++] = (wchar_t) ch;
466 if (BE (mbclen == (size_t) -1, 0))
467 pstr->cur_state = prev_st;
471 /* The buffer doesn't have enough space, finish to build. */
472 pstr->cur_state = prev_st;
476 pstr->valid_len = byte_idx;
477 pstr->valid_raw_len = src_idx;
481 /* Skip characters until the index becomes greater than NEW_RAW_IDX.
486 re_string_skip_chars (re_string_t *pstr, Idx new_raw_idx, wint_t *last_wc)
493 /* Skip the characters which are not necessary to check. */
494 for (rawbuf_idx = pstr->raw_mbs_idx + pstr->valid_raw_len;
495 rawbuf_idx < new_raw_idx;)
499 remain_len = pstr->len - rawbuf_idx;
500 prev_st = pstr->cur_state;
501 mbclen = __mbrtowc (&wc2, (const char *) pstr->raw_mbs + rawbuf_idx,
502 remain_len, &pstr->cur_state);
503 if (BE (mbclen == (size_t) -2 || mbclen == (size_t) -1 || mbclen == 0, 0))
505 /* We treat these cases as a single byte character. */
506 if (mbclen == 0 || remain_len == 0)
509 wc = *(unsigned char *) (pstr->raw_mbs + rawbuf_idx);
511 pstr->cur_state = prev_st;
515 /* Then proceed the next character. */
516 rawbuf_idx += mbclen;
521 #endif /* RE_ENABLE_I18N */
523 /* Build the buffer PSTR->MBS, and apply the translation if we need.
524 This function is used in case of REG_ICASE. */
528 build_upper_buffer (re_string_t *pstr)
530 Idx char_idx, end_idx;
531 end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
533 for (char_idx = pstr->valid_len; char_idx < end_idx; ++char_idx)
535 int ch = pstr->raw_mbs[pstr->raw_mbs_idx + char_idx];
536 if (BE (pstr->trans != NULL, 0))
537 ch = pstr->trans[ch];
539 pstr->mbs[char_idx] = toupper (ch);
541 pstr->mbs[char_idx] = ch;
543 pstr->valid_len = char_idx;
544 pstr->valid_raw_len = char_idx;
547 /* Apply TRANS to the buffer in PSTR. */
551 re_string_translate_buffer (re_string_t *pstr)
553 Idx buf_idx, end_idx;
554 end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
556 for (buf_idx = pstr->valid_len; buf_idx < end_idx; ++buf_idx)
558 int ch = pstr->raw_mbs[pstr->raw_mbs_idx + buf_idx];
559 pstr->mbs[buf_idx] = pstr->trans[ch];
562 pstr->valid_len = buf_idx;
563 pstr->valid_raw_len = buf_idx;
566 /* This function re-construct the buffers.
567 Concretely, convert to wide character in case of pstr->mb_cur_max > 1,
568 convert to upper case in case of REG_ICASE, apply translation. */
571 internal_function __attribute_warn_unused_result__
572 re_string_reconstruct (re_string_t *pstr, Idx idx, int eflags)
576 if (BE (pstr->raw_mbs_idx <= idx, 0))
577 offset = idx - pstr->raw_mbs_idx;
581 #ifdef RE_ENABLE_I18N
582 if (pstr->mb_cur_max > 1)
583 memset (&pstr->cur_state, '\0', sizeof (mbstate_t));
584 #endif /* RE_ENABLE_I18N */
585 pstr->len = pstr->raw_len;
586 pstr->stop = pstr->raw_stop;
588 pstr->raw_mbs_idx = 0;
589 pstr->valid_raw_len = 0;
590 pstr->offsets_needed = 0;
591 pstr->tip_context = ((eflags & REG_NOTBOL) ? CONTEXT_BEGBUF
592 : CONTEXT_NEWLINE | CONTEXT_BEGBUF);
593 if (!pstr->mbs_allocated)
594 pstr->mbs = (unsigned char *) pstr->raw_mbs;
598 if (BE (offset != 0, 1))
600 /* Should the already checked characters be kept? */
601 if (BE (offset < pstr->valid_raw_len, 1))
603 /* Yes, move them to the front of the buffer. */
604 #ifdef RE_ENABLE_I18N
605 if (BE (pstr->offsets_needed, 0))
607 Idx low = 0, high = pstr->valid_len, mid;
610 mid = (high + low) / 2;
611 if (pstr->offsets[mid] > offset)
613 else if (pstr->offsets[mid] < offset)
619 if (pstr->offsets[mid] < offset)
621 pstr->tip_context = re_string_context_at (pstr, mid - 1,
623 /* This can be quite complicated, so handle specially
624 only the common and easy case where the character with
625 different length representation of lower and upper
626 case is present at or after offset. */
627 if (pstr->valid_len > offset
628 && mid == offset && pstr->offsets[mid] == offset)
630 memmove (pstr->wcs, pstr->wcs + offset,
631 (pstr->valid_len - offset) * sizeof (wint_t));
632 memmove (pstr->mbs, pstr->mbs + offset, pstr->valid_len - offset);
633 pstr->valid_len -= offset;
634 pstr->valid_raw_len -= offset;
635 for (low = 0; low < pstr->valid_len; low++)
636 pstr->offsets[low] = pstr->offsets[low + offset] - offset;
640 /* Otherwise, just find out how long the partial multibyte
641 character at offset is and fill it with WEOF/255. */
642 pstr->len = pstr->raw_len - idx + offset;
643 pstr->stop = pstr->raw_stop - idx + offset;
644 pstr->offsets_needed = 0;
645 while (mid > 0 && pstr->offsets[mid - 1] == offset)
647 while (mid < pstr->valid_len)
648 if (pstr->wcs[mid] != WEOF)
652 if (mid == pstr->valid_len)
656 pstr->valid_len = pstr->offsets[mid] - offset;
659 for (low = 0; low < pstr->valid_len; ++low)
660 pstr->wcs[low] = WEOF;
661 memset (pstr->mbs, 255, pstr->valid_len);
664 pstr->valid_raw_len = pstr->valid_len;
670 pstr->tip_context = re_string_context_at (pstr, offset - 1,
672 #ifdef RE_ENABLE_I18N
673 if (pstr->mb_cur_max > 1)
674 memmove (pstr->wcs, pstr->wcs + offset,
675 (pstr->valid_len - offset) * sizeof (wint_t));
676 #endif /* RE_ENABLE_I18N */
677 if (BE (pstr->mbs_allocated, 0))
678 memmove (pstr->mbs, pstr->mbs + offset,
679 pstr->valid_len - offset);
680 pstr->valid_len -= offset;
681 pstr->valid_raw_len -= offset;
683 assert (pstr->valid_len > 0);
689 #ifdef RE_ENABLE_I18N
690 /* No, skip all characters until IDX. */
691 Idx prev_valid_len = pstr->valid_len;
693 if (BE (pstr->offsets_needed, 0))
695 pstr->len = pstr->raw_len - idx + offset;
696 pstr->stop = pstr->raw_stop - idx + offset;
697 pstr->offsets_needed = 0;
701 #ifdef RE_ENABLE_I18N
702 if (pstr->mb_cur_max > 1)
709 const unsigned char *raw, *p, *end;
711 /* Special case UTF-8. Multi-byte chars start with any
712 byte other than 0x80 - 0xbf. */
713 raw = pstr->raw_mbs + pstr->raw_mbs_idx;
714 end = raw + (offset - pstr->mb_cur_max);
715 if (end < pstr->raw_mbs)
717 p = raw + offset - 1;
719 /* We know the wchar_t encoding is UCS4, so for the simple
720 case, ASCII characters, skip the conversion step. */
721 if (isascii (*p) && BE (pstr->trans == NULL, 1))
723 memset (&pstr->cur_state, '\0', sizeof (mbstate_t));
724 /* pstr->valid_len = 0; */
729 for (; p >= end; --p)
730 if ((*p & 0xc0) != 0x80)
734 Idx mlen = raw + pstr->len - p;
737 #if 0 /* dead code: buf is set but never used */
738 unsigned char buf[6];
739 if (BE (pstr->trans != NULL, 0))
741 int i = mlen < 6 ? mlen : 6;
743 buf[i] = pstr->trans[p[i]];
746 /* XXX Don't use mbrtowc, we know which conversion
747 to use (UTF-8 -> UCS4). */
748 memset (&cur_state, 0, sizeof (cur_state));
749 mbclen = __mbrtowc (&wc2, (const char *) p, mlen,
751 if (raw + offset - p <= mbclen
752 && mbclen < (size_t) -2)
754 memset (&pstr->cur_state, '\0',
756 pstr->valid_len = mbclen - (raw + offset - p);
764 pstr->valid_len = re_string_skip_chars (pstr, idx, &wc) - idx;
767 = re_string_context_at (pstr, prev_valid_len - 1, eflags);
769 pstr->tip_context = ((BE (pstr->word_ops_used != 0, 0)
770 && IS_WIDE_WORD_CHAR (wc))
772 : ((IS_WIDE_NEWLINE (wc)
773 && pstr->newline_anchor)
774 ? CONTEXT_NEWLINE : 0));
775 if (BE (pstr->valid_len, 0))
777 for (wcs_idx = 0; wcs_idx < pstr->valid_len; ++wcs_idx)
778 pstr->wcs[wcs_idx] = WEOF;
779 if (pstr->mbs_allocated)
780 memset (pstr->mbs, 255, pstr->valid_len);
782 pstr->valid_raw_len = pstr->valid_len;
785 #endif /* RE_ENABLE_I18N */
787 int c = pstr->raw_mbs[pstr->raw_mbs_idx + offset - 1];
788 pstr->valid_raw_len = 0;
791 pstr->tip_context = (bitset_contain (pstr->word_char, c)
793 : ((IS_NEWLINE (c) && pstr->newline_anchor)
794 ? CONTEXT_NEWLINE : 0));
797 if (!BE (pstr->mbs_allocated, 0))
800 pstr->raw_mbs_idx = idx;
802 pstr->stop -= offset;
804 /* Then build the buffers. */
805 #ifdef RE_ENABLE_I18N
806 if (pstr->mb_cur_max > 1)
810 reg_errcode_t ret = build_wcs_upper_buffer (pstr);
811 if (BE (ret != REG_NOERROR, 0))
815 build_wcs_buffer (pstr);
818 #endif /* RE_ENABLE_I18N */
819 if (BE (pstr->mbs_allocated, 0))
822 build_upper_buffer (pstr);
823 else if (pstr->trans != NULL)
824 re_string_translate_buffer (pstr);
827 pstr->valid_len = pstr->len;
834 internal_function __attribute ((pure))
835 re_string_peek_byte_case (const re_string_t *pstr, Idx idx)
840 /* Handle the common (easiest) cases first. */
841 if (BE (!pstr->mbs_allocated, 1))
842 return re_string_peek_byte (pstr, idx);
844 #ifdef RE_ENABLE_I18N
845 if (pstr->mb_cur_max > 1
846 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx))
847 return re_string_peek_byte (pstr, idx);
850 off = pstr->cur_idx + idx;
851 #ifdef RE_ENABLE_I18N
852 if (pstr->offsets_needed)
853 off = pstr->offsets[off];
856 ch = pstr->raw_mbs[pstr->raw_mbs_idx + off];
858 #ifdef RE_ENABLE_I18N
859 /* Ensure that e.g. for tr_TR.UTF-8 BACKSLASH DOTLESS SMALL LETTER I
860 this function returns CAPITAL LETTER I instead of first byte of
861 DOTLESS SMALL LETTER I. The latter would confuse the parser,
862 since peek_byte_case doesn't advance cur_idx in any way. */
863 if (pstr->offsets_needed && !isascii (ch))
864 return re_string_peek_byte (pstr, idx);
871 internal_function __attribute ((pure))
872 re_string_fetch_byte_case (re_string_t *pstr)
874 if (BE (!pstr->mbs_allocated, 1))
875 return re_string_fetch_byte (pstr);
877 #ifdef RE_ENABLE_I18N
878 if (pstr->offsets_needed)
883 /* For tr_TR.UTF-8 [[:islower:]] there is
884 [[: CAPITAL LETTER I WITH DOT lower:]] in mbs. Skip
885 in that case the whole multi-byte character and return
886 the original letter. On the other side, with
887 [[: DOTLESS SMALL LETTER I return [[:I, as doing
888 anything else would complicate things too much. */
890 if (!re_string_first_byte (pstr, pstr->cur_idx))
891 return re_string_fetch_byte (pstr);
893 off = pstr->offsets[pstr->cur_idx];
894 ch = pstr->raw_mbs[pstr->raw_mbs_idx + off];
897 return re_string_fetch_byte (pstr);
899 re_string_skip_bytes (pstr,
900 re_string_char_size_at (pstr, pstr->cur_idx));
905 return pstr->raw_mbs[pstr->raw_mbs_idx + pstr->cur_idx++];
910 re_string_destruct (re_string_t *pstr)
912 #ifdef RE_ENABLE_I18N
914 re_free (pstr->offsets);
915 #endif /* RE_ENABLE_I18N */
916 if (pstr->mbs_allocated)
920 /* Return the context at IDX in INPUT. */
924 re_string_context_at (const re_string_t *input, Idx idx, int eflags)
927 if (BE (! REG_VALID_INDEX (idx), 0))
928 /* In this case, we use the value stored in input->tip_context,
929 since we can't know the character in input->mbs[-1] here. */
930 return input->tip_context;
931 if (BE (idx == input->len, 0))
932 return ((eflags & REG_NOTEOL) ? CONTEXT_ENDBUF
933 : CONTEXT_NEWLINE | CONTEXT_ENDBUF);
934 #ifdef RE_ENABLE_I18N
935 if (input->mb_cur_max > 1)
939 while(input->wcs[wc_idx] == WEOF)
942 /* It must not happen. */
943 assert (REG_VALID_INDEX (wc_idx));
946 if (! REG_VALID_INDEX (wc_idx))
947 return input->tip_context;
949 wc = input->wcs[wc_idx];
950 if (BE (input->word_ops_used != 0, 0) && IS_WIDE_WORD_CHAR (wc))
952 return (IS_WIDE_NEWLINE (wc) && input->newline_anchor
953 ? CONTEXT_NEWLINE : 0);
958 c = re_string_byte_at (input, idx);
959 if (bitset_contain (input->word_char, c))
961 return IS_NEWLINE (c) && input->newline_anchor ? CONTEXT_NEWLINE : 0;
965 /* Functions for set operation. */
968 internal_function __attribute_warn_unused_result__
969 re_node_set_alloc (re_node_set *set, Idx size)
973 set->elems = re_malloc (Idx, size);
974 if (BE (set->elems == NULL, 0))
980 internal_function __attribute_warn_unused_result__
981 re_node_set_init_1 (re_node_set *set, Idx elem)
985 set->elems = re_malloc (Idx, 1);
986 if (BE (set->elems == NULL, 0))
988 set->alloc = set->nelem = 0;
991 set->elems[0] = elem;
996 internal_function __attribute_warn_unused_result__
997 re_node_set_init_2 (re_node_set *set, Idx elem1, Idx elem2)
1000 set->elems = re_malloc (Idx, 2);
1001 if (BE (set->elems == NULL, 0))
1006 set->elems[0] = elem1;
1013 set->elems[0] = elem1;
1014 set->elems[1] = elem2;
1018 set->elems[0] = elem2;
1019 set->elems[1] = elem1;
1025 static reg_errcode_t
1026 internal_function __attribute_warn_unused_result__
1027 re_node_set_init_copy (re_node_set *dest, const re_node_set *src)
1029 dest->nelem = src->nelem;
1032 dest->alloc = dest->nelem;
1033 dest->elems = re_malloc (Idx, dest->alloc);
1034 if (BE (dest->elems == NULL, 0))
1036 dest->alloc = dest->nelem = 0;
1039 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1042 re_node_set_init_empty (dest);
1046 /* Calculate the intersection of the sets SRC1 and SRC2. And merge it to
1047 DEST. Return value indicate the error code or REG_NOERROR if succeeded.
1048 Note: We assume dest->elems is NULL, when dest->alloc is 0. */
1050 static reg_errcode_t
1051 internal_function __attribute_warn_unused_result__
1052 re_node_set_add_intersect (re_node_set *dest, const re_node_set *src1,
1053 const re_node_set *src2)
1055 Idx i1, i2, is, id, delta, sbase;
1056 if (src1->nelem == 0 || src2->nelem == 0)
1059 /* We need dest->nelem + 2 * elems_in_intersection; this is a
1060 conservative estimate. */
1061 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc)
1063 Idx new_alloc = src1->nelem + src2->nelem + dest->alloc;
1064 Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc);
1065 if (BE (new_elems == NULL, 0))
1067 dest->elems = new_elems;
1068 dest->alloc = new_alloc;
1071 /* Find the items in the intersection of SRC1 and SRC2, and copy
1072 into the top of DEST those that are not already in DEST itself. */
1073 sbase = dest->nelem + src1->nelem + src2->nelem;
1074 i1 = src1->nelem - 1;
1075 i2 = src2->nelem - 1;
1076 id = dest->nelem - 1;
1079 if (src1->elems[i1] == src2->elems[i2])
1081 /* Try to find the item in DEST. Maybe we could binary search? */
1082 while (REG_VALID_INDEX (id) && dest->elems[id] > src1->elems[i1])
1085 if (! REG_VALID_INDEX (id) || dest->elems[id] != src1->elems[i1])
1086 dest->elems[--sbase] = src1->elems[i1];
1088 if (! REG_VALID_INDEX (--i1) || ! REG_VALID_INDEX (--i2))
1092 /* Lower the highest of the two items. */
1093 else if (src1->elems[i1] < src2->elems[i2])
1095 if (! REG_VALID_INDEX (--i2))
1100 if (! REG_VALID_INDEX (--i1))
1105 id = dest->nelem - 1;
1106 is = dest->nelem + src1->nelem + src2->nelem - 1;
1107 delta = is - sbase + 1;
1109 /* Now copy. When DELTA becomes zero, the remaining
1110 DEST elements are already in place; this is more or
1111 less the same loop that is in re_node_set_merge. */
1112 dest->nelem += delta;
1113 if (delta > 0 && REG_VALID_INDEX (id))
1116 if (dest->elems[is] > dest->elems[id])
1118 /* Copy from the top. */
1119 dest->elems[id + delta--] = dest->elems[is--];
1125 /* Slide from the bottom. */
1126 dest->elems[id + delta] = dest->elems[id];
1127 if (! REG_VALID_INDEX (--id))
1132 /* Copy remaining SRC elements. */
1133 memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx));
1138 /* Calculate the union set of the sets SRC1 and SRC2. And store it to
1139 DEST. Return value indicate the error code or REG_NOERROR if succeeded. */
1141 static reg_errcode_t
1142 internal_function __attribute_warn_unused_result__
1143 re_node_set_init_union (re_node_set *dest, const re_node_set *src1,
1144 const re_node_set *src2)
1147 if (src1 != NULL && src1->nelem > 0 && src2 != NULL && src2->nelem > 0)
1149 dest->alloc = src1->nelem + src2->nelem;
1150 dest->elems = re_malloc (Idx, dest->alloc);
1151 if (BE (dest->elems == NULL, 0))
1156 if (src1 != NULL && src1->nelem > 0)
1157 return re_node_set_init_copy (dest, src1);
1158 else if (src2 != NULL && src2->nelem > 0)
1159 return re_node_set_init_copy (dest, src2);
1161 re_node_set_init_empty (dest);
1164 for (i1 = i2 = id = 0 ; i1 < src1->nelem && i2 < src2->nelem ;)
1166 if (src1->elems[i1] > src2->elems[i2])
1168 dest->elems[id++] = src2->elems[i2++];
1171 if (src1->elems[i1] == src2->elems[i2])
1173 dest->elems[id++] = src1->elems[i1++];
1175 if (i1 < src1->nelem)
1177 memcpy (dest->elems + id, src1->elems + i1,
1178 (src1->nelem - i1) * sizeof (Idx));
1179 id += src1->nelem - i1;
1181 else if (i2 < src2->nelem)
1183 memcpy (dest->elems + id, src2->elems + i2,
1184 (src2->nelem - i2) * sizeof (Idx));
1185 id += src2->nelem - i2;
1191 /* Calculate the union set of the sets DEST and SRC. And store it to
1192 DEST. Return value indicate the error code or REG_NOERROR if succeeded. */
1194 static reg_errcode_t
1195 internal_function __attribute_warn_unused_result__
1196 re_node_set_merge (re_node_set *dest, const re_node_set *src)
1198 Idx is, id, sbase, delta;
1199 if (src == NULL || src->nelem == 0)
1201 if (dest->alloc < 2 * src->nelem + dest->nelem)
1203 Idx new_alloc = 2 * (src->nelem + dest->alloc);
1204 Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc);
1205 if (BE (new_buffer == NULL, 0))
1207 dest->elems = new_buffer;
1208 dest->alloc = new_alloc;
1211 if (BE (dest->nelem == 0, 0))
1213 dest->nelem = src->nelem;
1214 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1218 /* Copy into the top of DEST the items of SRC that are not
1219 found in DEST. Maybe we could binary search in DEST? */
1220 for (sbase = dest->nelem + 2 * src->nelem,
1221 is = src->nelem - 1, id = dest->nelem - 1;
1222 REG_VALID_INDEX (is) && REG_VALID_INDEX (id); )
1224 if (dest->elems[id] == src->elems[is])
1226 else if (dest->elems[id] < src->elems[is])
1227 dest->elems[--sbase] = src->elems[is--];
1228 else /* if (dest->elems[id] > src->elems[is]) */
1232 if (REG_VALID_INDEX (is))
1234 /* If DEST is exhausted, the remaining items of SRC must be unique. */
1236 memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx));
1239 id = dest->nelem - 1;
1240 is = dest->nelem + 2 * src->nelem - 1;
1241 delta = is - sbase + 1;
1245 /* Now copy. When DELTA becomes zero, the remaining
1246 DEST elements are already in place. */
1247 dest->nelem += delta;
1250 if (dest->elems[is] > dest->elems[id])
1252 /* Copy from the top. */
1253 dest->elems[id + delta--] = dest->elems[is--];
1259 /* Slide from the bottom. */
1260 dest->elems[id + delta] = dest->elems[id];
1261 if (! REG_VALID_INDEX (--id))
1263 /* Copy remaining SRC elements. */
1264 memcpy (dest->elems, dest->elems + sbase,
1265 delta * sizeof (Idx));
1274 /* Insert the new element ELEM to the re_node_set* SET.
1275 SET should not already have ELEM.
1276 Return true if successful. */
1279 internal_function __attribute_warn_unused_result__
1280 re_node_set_insert (re_node_set *set, Idx elem)
1283 /* In case the set is empty. */
1284 if (set->alloc == 0)
1285 return BE (re_node_set_init_1 (set, elem) == REG_NOERROR, 1);
1287 if (BE (set->nelem, 0) == 0)
1289 /* We already guaranteed above that set->alloc != 0. */
1290 set->elems[0] = elem;
1295 /* Realloc if we need. */
1296 if (set->alloc == set->nelem)
1299 set->alloc = set->alloc * 2;
1300 new_elems = re_realloc (set->elems, Idx, set->alloc);
1301 if (BE (new_elems == NULL, 0))
1303 set->elems = new_elems;
1306 /* Move the elements which follows the new element. Test the
1307 first element separately to skip a check in the inner loop. */
1308 if (elem < set->elems[0])
1311 for (idx = set->nelem; idx > 0; idx--)
1312 set->elems[idx] = set->elems[idx - 1];
1316 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1317 set->elems[idx] = set->elems[idx - 1];
1320 /* Insert the new element. */
1321 set->elems[idx] = elem;
1326 /* Insert the new element ELEM to the re_node_set* SET.
1327 SET should not already have any element greater than or equal to ELEM.
1328 Return true if successful. */
1331 internal_function __attribute_warn_unused_result__
1332 re_node_set_insert_last (re_node_set *set, Idx elem)
1334 /* Realloc if we need. */
1335 if (set->alloc == set->nelem)
1338 set->alloc = (set->alloc + 1) * 2;
1339 new_elems = re_realloc (set->elems, Idx, set->alloc);
1340 if (BE (new_elems == NULL, 0))
1342 set->elems = new_elems;
1345 /* Insert the new element. */
1346 set->elems[set->nelem++] = elem;
1350 /* Compare two node sets SET1 and SET2.
1351 Return true if SET1 and SET2 are equivalent. */
1354 internal_function __attribute ((pure))
1355 re_node_set_compare (const re_node_set *set1, const re_node_set *set2)
1358 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
1360 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; )
1361 if (set1->elems[i] != set2->elems[i])
1366 /* Return (idx + 1) if SET contains the element ELEM, return 0 otherwise. */
1369 internal_function __attribute ((pure))
1370 re_node_set_contains (const re_node_set *set, Idx elem)
1372 __re_size_t idx, right, mid;
1373 if (! REG_VALID_NONZERO_INDEX (set->nelem))
1376 /* Binary search the element. */
1378 right = set->nelem - 1;
1381 mid = (idx + right) / 2;
1382 if (set->elems[mid] < elem)
1387 return set->elems[idx] == elem ? idx + 1 : 0;
1392 re_node_set_remove_at (re_node_set *set, Idx idx)
1394 if (idx < 0 || idx >= set->nelem)
1397 for (; idx < set->nelem; idx++)
1398 set->elems[idx] = set->elems[idx + 1];
1402 /* Add the token TOKEN to dfa->nodes, and return the index of the token.
1403 Or return REG_MISSING if an error occurred. */
1407 re_dfa_add_node (re_dfa_t *dfa, re_token_t token)
1409 if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
1411 size_t new_nodes_alloc = dfa->nodes_alloc * 2;
1412 Idx *new_nexts, *new_indices;
1413 re_node_set *new_edests, *new_eclosures;
1414 re_token_t *new_nodes;
1415 size_t max_object_size =
1416 MAX (sizeof (re_token_t),
1417 MAX (sizeof (re_node_set),
1420 /* Avoid overflows. */
1421 if (BE (SIZE_MAX / 2 / max_object_size < dfa->nodes_alloc, 0))
1424 new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
1425 if (BE (new_nodes == NULL, 0))
1427 dfa->nodes = new_nodes;
1428 new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc);
1429 new_indices = re_realloc (dfa->org_indices, Idx, new_nodes_alloc);
1430 new_edests = re_realloc (dfa->edests, re_node_set, new_nodes_alloc);
1431 new_eclosures = re_realloc (dfa->eclosures, re_node_set, new_nodes_alloc);
1432 if (BE (new_nexts == NULL || new_indices == NULL
1433 || new_edests == NULL || new_eclosures == NULL, 0))
1435 dfa->nexts = new_nexts;
1436 dfa->org_indices = new_indices;
1437 dfa->edests = new_edests;
1438 dfa->eclosures = new_eclosures;
1439 dfa->nodes_alloc = new_nodes_alloc;
1441 dfa->nodes[dfa->nodes_len] = token;
1442 dfa->nodes[dfa->nodes_len].constraint = 0;
1443 #ifdef RE_ENABLE_I18N
1445 int type = token.type;
1446 dfa->nodes[dfa->nodes_len].accept_mb =
1447 (type == OP_PERIOD && dfa->mb_cur_max > 1) || type == COMPLEX_BRACKET;
1450 dfa->nexts[dfa->nodes_len] = REG_MISSING;
1451 re_node_set_init_empty (dfa->edests + dfa->nodes_len);
1452 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len);
1453 return dfa->nodes_len++;
1456 static inline re_hashval_t
1458 calc_state_hash (const re_node_set *nodes, unsigned int context)
1460 re_hashval_t hash = nodes->nelem + context;
1462 for (i = 0 ; i < nodes->nelem ; i++)
1463 hash += nodes->elems[i];
1467 /* Search for the state whose node_set is equivalent to NODES.
1468 Return the pointer to the state, if we found it in the DFA.
1469 Otherwise create the new one and return it. In case of an error
1470 return NULL and set the error code in ERR.
1471 Note: - We assume NULL as the invalid state, then it is possible that
1472 return value is NULL and ERR is REG_NOERROR.
1473 - We never return non-NULL value in case of any errors, it is for
1476 static re_dfastate_t *
1477 internal_function __attribute_warn_unused_result__
1478 re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa,
1479 const re_node_set *nodes)
1482 re_dfastate_t *new_state;
1483 struct re_state_table_entry *spot;
1486 /* Suppress bogus uninitialized-variable warnings. */
1489 if (BE (nodes->nelem == 0, 0))
1494 hash = calc_state_hash (nodes, 0);
1495 spot = dfa->state_table + (hash & dfa->state_hash_mask);
1497 for (i = 0 ; i < spot->num ; i++)
1499 re_dfastate_t *state = spot->array[i];
1500 if (hash != state->hash)
1502 if (re_node_set_compare (&state->nodes, nodes))
1506 /* There are no appropriate state in the dfa, create the new one. */
1507 new_state = create_ci_newstate (dfa, nodes, hash);
1508 if (BE (new_state == NULL, 0))
1514 /* Search for the state whose node_set is equivalent to NODES and
1515 whose context is equivalent to CONTEXT.
1516 Return the pointer to the state, if we found it in the DFA.
1517 Otherwise create the new one and return it. In case of an error
1518 return NULL and set the error code in ERR.
1519 Note: - We assume NULL as the invalid state, then it is possible that
1520 return value is NULL and ERR is REG_NOERROR.
1521 - We never return non-NULL value in case of any errors, it is for
1524 static re_dfastate_t *
1525 internal_function __attribute_warn_unused_result__
1526 re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa,
1527 const re_node_set *nodes, unsigned int context)
1530 re_dfastate_t *new_state;
1531 struct re_state_table_entry *spot;
1534 /* Suppress bogus uninitialized-variable warnings. */
1537 if (nodes->nelem == 0)
1542 hash = calc_state_hash (nodes, context);
1543 spot = dfa->state_table + (hash & dfa->state_hash_mask);
1545 for (i = 0 ; i < spot->num ; i++)
1547 re_dfastate_t *state = spot->array[i];
1548 if (state->hash == hash
1549 && state->context == context
1550 && re_node_set_compare (state->entrance_nodes, nodes))
1553 /* There are no appropriate state in `dfa', create the new one. */
1554 new_state = create_cd_newstate (dfa, nodes, context, hash);
1555 if (BE (new_state == NULL, 0))
1561 /* Finish initialization of the new state NEWSTATE, and using its hash value
1562 HASH put in the appropriate bucket of DFA's state table. Return value
1563 indicates the error code if failed. */
1565 static reg_errcode_t
1566 __attribute_warn_unused_result__
1567 register_state (const re_dfa_t *dfa, re_dfastate_t *newstate,
1570 struct re_state_table_entry *spot;
1574 newstate->hash = hash;
1575 err = re_node_set_alloc (&newstate->non_eps_nodes, newstate->nodes.nelem);
1576 if (BE (err != REG_NOERROR, 0))
1578 for (i = 0; i < newstate->nodes.nelem; i++)
1580 Idx elem = newstate->nodes.elems[i];
1581 if (!IS_EPSILON_NODE (dfa->nodes[elem].type))
1582 if (BE (! re_node_set_insert_last (&newstate->non_eps_nodes, elem), 0))
1586 spot = dfa->state_table + (hash & dfa->state_hash_mask);
1587 if (BE (spot->alloc <= spot->num, 0))
1589 Idx new_alloc = 2 * spot->num + 2;
1590 re_dfastate_t **new_array = re_realloc (spot->array, re_dfastate_t *,
1592 if (BE (new_array == NULL, 0))
1594 spot->array = new_array;
1595 spot->alloc = new_alloc;
1597 spot->array[spot->num++] = newstate;
1602 free_state (re_dfastate_t *state)
1604 re_node_set_free (&state->non_eps_nodes);
1605 re_node_set_free (&state->inveclosure);
1606 if (state->entrance_nodes != &state->nodes)
1608 re_node_set_free (state->entrance_nodes);
1609 re_free (state->entrance_nodes);
1611 re_node_set_free (&state->nodes);
1612 re_free (state->word_trtable);
1613 re_free (state->trtable);
1617 /* Create the new state which is independ of contexts.
1618 Return the new state if succeeded, otherwise return NULL. */
1620 static re_dfastate_t *
1621 internal_function __attribute_warn_unused_result__
1622 create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
1627 re_dfastate_t *newstate;
1629 newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
1630 if (BE (newstate == NULL, 0))
1632 err = re_node_set_init_copy (&newstate->nodes, nodes);
1633 if (BE (err != REG_NOERROR, 0))
1639 newstate->entrance_nodes = &newstate->nodes;
1640 for (i = 0 ; i < nodes->nelem ; i++)
1642 re_token_t *node = dfa->nodes + nodes->elems[i];
1643 re_token_type_t type = node->type;
1644 if (type == CHARACTER && !node->constraint)
1646 #ifdef RE_ENABLE_I18N
1647 newstate->accept_mb |= node->accept_mb;
1648 #endif /* RE_ENABLE_I18N */
1650 /* If the state has the halt node, the state is a halt state. */
1651 if (type == END_OF_RE)
1653 else if (type == OP_BACK_REF)
1654 newstate->has_backref = 1;
1655 else if (type == ANCHOR || node->constraint)
1656 newstate->has_constraint = 1;
1658 err = register_state (dfa, newstate, hash);
1659 if (BE (err != REG_NOERROR, 0))
1661 free_state (newstate);
1667 /* Create the new state which is depend on the context CONTEXT.
1668 Return the new state if succeeded, otherwise return NULL. */
1670 static re_dfastate_t *
1671 internal_function __attribute_warn_unused_result__
1672 create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
1673 unsigned int context, re_hashval_t hash)
1675 Idx i, nctx_nodes = 0;
1677 re_dfastate_t *newstate;
1679 newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
1680 if (BE (newstate == NULL, 0))
1682 err = re_node_set_init_copy (&newstate->nodes, nodes);
1683 if (BE (err != REG_NOERROR, 0))
1689 newstate->context = context;
1690 newstate->entrance_nodes = &newstate->nodes;
1692 for (i = 0 ; i < nodes->nelem ; i++)
1694 re_token_t *node = dfa->nodes + nodes->elems[i];
1695 re_token_type_t type = node->type;
1696 unsigned int constraint = node->constraint;
1698 if (type == CHARACTER && !constraint)
1700 #ifdef RE_ENABLE_I18N
1701 newstate->accept_mb |= node->accept_mb;
1702 #endif /* RE_ENABLE_I18N */
1704 /* If the state has the halt node, the state is a halt state. */
1705 if (type == END_OF_RE)
1707 else if (type == OP_BACK_REF)
1708 newstate->has_backref = 1;
1712 if (newstate->entrance_nodes == &newstate->nodes)
1714 newstate->entrance_nodes = re_malloc (re_node_set, 1);
1715 if (BE (newstate->entrance_nodes == NULL, 0))
1717 free_state (newstate);
1720 if (re_node_set_init_copy (newstate->entrance_nodes, nodes)
1724 newstate->has_constraint = 1;
1727 if (NOT_SATISFY_PREV_CONSTRAINT (constraint,context))
1729 re_node_set_remove_at (&newstate->nodes, i - nctx_nodes);
1734 err = register_state (dfa, newstate, hash);
1735 if (BE (err != REG_NOERROR, 0))
1737 free_state (newstate);