Blame lib/regex_internal.c

Packit 1ac44c
/* Extended regular expression matching and search library.
Packit 1ac44c
   Copyright (C) 2002-2018 Free Software Foundation, Inc.
Packit 1ac44c
   This file is part of the GNU C Library.
Packit 1ac44c
   Contributed by Isamu Hasegawa <isamu@yamato.ibm.com>.
Packit 1ac44c
Packit 1ac44c
   The GNU C Library is free software; you can redistribute it and/or
Packit 1ac44c
   modify it under the terms of the GNU General Public
Packit 1ac44c
   License as published by the Free Software Foundation; either
Packit 1ac44c
   version 3 of the License, or (at your option) any later version.
Packit 1ac44c
Packit 1ac44c
   The GNU C Library is distributed in the hope that it will be useful,
Packit 1ac44c
   but WITHOUT ANY WARRANTY; without even the implied warranty of
Packit 1ac44c
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
Packit 1ac44c
   General Public License for more details.
Packit 1ac44c
Packit 1ac44c
   You should have received a copy of the GNU General Public
Packit 1ac44c
   License along with the GNU C Library; if not, see
Packit 1ac44c
   <https://www.gnu.org/licenses/>.  */
Packit 1ac44c
Packit 1ac44c
static void re_string_construct_common (const char *str, Idx len,
Packit 1ac44c
					re_string_t *pstr,
Packit 1ac44c
					RE_TRANSLATE_TYPE trans, bool icase,
Packit 1ac44c
					const re_dfa_t *dfa);
Packit 1ac44c
static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa,
Packit 1ac44c
					  const re_node_set *nodes,
Packit 1ac44c
					  re_hashval_t hash);
Packit 1ac44c
static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa,
Packit 1ac44c
					  const re_node_set *nodes,
Packit 1ac44c
					  unsigned int context,
Packit 1ac44c
					  re_hashval_t hash);
Packit 1ac44c

Packit 1ac44c
/* Functions for string operation.  */
Packit 1ac44c
Packit 1ac44c
/* This function allocate the buffers.  It is necessary to call
Packit 1ac44c
   re_string_reconstruct before using the object.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len,
Packit 1ac44c
		    RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa)
Packit 1ac44c
{
Packit 1ac44c
  reg_errcode_t ret;
Packit 1ac44c
  Idx init_buf_len;
Packit 1ac44c
Packit 1ac44c
  /* Ensure at least one character fits into the buffers.  */
Packit 1ac44c
  if (init_len < dfa->mb_cur_max)
Packit 1ac44c
    init_len = dfa->mb_cur_max;
Packit 1ac44c
  init_buf_len = (len + 1 < init_len) ? len + 1: init_len;
Packit 1ac44c
  re_string_construct_common (str, len, pstr, trans, icase, dfa);
Packit 1ac44c
Packit 1ac44c
  ret = re_string_realloc_buffers (pstr, init_buf_len);
Packit 1ac44c
  if (BE (ret != REG_NOERROR, 0))
Packit 1ac44c
    return ret;
Packit 1ac44c
Packit 1ac44c
  pstr->word_char = dfa->word_char;
Packit 1ac44c
  pstr->word_ops_used = dfa->word_ops_used;
Packit 1ac44c
  pstr->mbs = pstr->mbs_allocated ? pstr->mbs : (unsigned char *) str;
Packit 1ac44c
  pstr->valid_len = (pstr->mbs_allocated || dfa->mb_cur_max > 1) ? 0 : len;
Packit 1ac44c
  pstr->valid_raw_len = pstr->valid_len;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* This function allocate the buffers, and initialize them.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_string_construct (re_string_t *pstr, const char *str, Idx len,
Packit 1ac44c
		     RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa)
Packit 1ac44c
{
Packit 1ac44c
  reg_errcode_t ret;
Packit 1ac44c
  memset (pstr, '\0', sizeof (re_string_t));
Packit 1ac44c
  re_string_construct_common (str, len, pstr, trans, icase, dfa);
Packit 1ac44c
Packit 1ac44c
  if (len > 0)
Packit 1ac44c
    {
Packit 1ac44c
      ret = re_string_realloc_buffers (pstr, len + 1);
Packit 1ac44c
      if (BE (ret != REG_NOERROR, 0))
Packit 1ac44c
	return ret;
Packit 1ac44c
    }
Packit 1ac44c
  pstr->mbs = pstr->mbs_allocated ? pstr->mbs : (unsigned char *) str;
Packit 1ac44c
Packit 1ac44c
  if (icase)
Packit 1ac44c
    {
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
      if (dfa->mb_cur_max > 1)
Packit 1ac44c
	{
Packit 1ac44c
	  while (1)
Packit 1ac44c
	    {
Packit 1ac44c
	      ret = build_wcs_upper_buffer (pstr);
Packit 1ac44c
	      if (BE (ret != REG_NOERROR, 0))
Packit 1ac44c
		return ret;
Packit 1ac44c
	      if (pstr->valid_raw_len >= len)
Packit 1ac44c
		break;
Packit 1ac44c
	      if (pstr->bufs_len > pstr->valid_len + dfa->mb_cur_max)
Packit 1ac44c
		break;
Packit 1ac44c
	      ret = re_string_realloc_buffers (pstr, pstr->bufs_len * 2);
Packit 1ac44c
	      if (BE (ret != REG_NOERROR, 0))
Packit 1ac44c
		return ret;
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
#endif /* RE_ENABLE_I18N  */
Packit 1ac44c
	build_upper_buffer (pstr);
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    {
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
      if (dfa->mb_cur_max > 1)
Packit 1ac44c
	build_wcs_buffer (pstr);
Packit 1ac44c
      else
Packit 1ac44c
#endif /* RE_ENABLE_I18N  */
Packit 1ac44c
	{
Packit 1ac44c
	  if (trans != NULL)
Packit 1ac44c
	    re_string_translate_buffer (pstr);
Packit 1ac44c
	  else
Packit 1ac44c
	    {
Packit 1ac44c
	      pstr->valid_len = pstr->bufs_len;
Packit 1ac44c
	      pstr->valid_raw_len = pstr->bufs_len;
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Helper functions for re_string_allocate, and re_string_construct.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len)
Packit 1ac44c
{
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (pstr->mb_cur_max > 1)
Packit 1ac44c
    {
Packit 1ac44c
      wint_t *new_wcs;
Packit 1ac44c
Packit 1ac44c
      /* Avoid overflow in realloc.  */
Packit 1ac44c
      const size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx));
Packit 1ac44c
      if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) < new_buf_len, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
Packit 1ac44c
      new_wcs = re_realloc (pstr->wcs, wint_t, new_buf_len);
Packit 1ac44c
      if (BE (new_wcs == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
      pstr->wcs = new_wcs;
Packit 1ac44c
      if (pstr->offsets != NULL)
Packit 1ac44c
	{
Packit 1ac44c
	  Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len);
Packit 1ac44c
	  if (BE (new_offsets == NULL, 0))
Packit 1ac44c
	    return REG_ESPACE;
Packit 1ac44c
	  pstr->offsets = new_offsets;
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
#endif /* RE_ENABLE_I18N  */
Packit 1ac44c
  if (pstr->mbs_allocated)
Packit 1ac44c
    {
Packit 1ac44c
      unsigned char *new_mbs = re_realloc (pstr->mbs, unsigned char,
Packit 1ac44c
					   new_buf_len);
Packit 1ac44c
      if (BE (new_mbs == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
      pstr->mbs = new_mbs;
Packit 1ac44c
    }
Packit 1ac44c
  pstr->bufs_len = new_buf_len;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
re_string_construct_common (const char *str, Idx len, re_string_t *pstr,
Packit 1ac44c
			    RE_TRANSLATE_TYPE trans, bool icase,
Packit 1ac44c
			    const re_dfa_t *dfa)
Packit 1ac44c
{
Packit 1ac44c
  pstr->raw_mbs = (const unsigned char *) str;
Packit 1ac44c
  pstr->len = len;
Packit 1ac44c
  pstr->raw_len = len;
Packit 1ac44c
  pstr->trans = trans;
Packit 1ac44c
  pstr->icase = icase;
Packit 1ac44c
  pstr->mbs_allocated = (trans != NULL || icase);
Packit 1ac44c
  pstr->mb_cur_max = dfa->mb_cur_max;
Packit 1ac44c
  pstr->is_utf8 = dfa->is_utf8;
Packit 1ac44c
  pstr->map_notascii = dfa->map_notascii;
Packit 1ac44c
  pstr->stop = pstr->len;
Packit 1ac44c
  pstr->raw_stop = pstr->stop;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
Packit 1ac44c
/* Build wide character buffer PSTR->WCS.
Packit 1ac44c
   If the byte sequence of the string are:
Packit 1ac44c
     <mb1>(0), <mb1>(1), <mb2>(0), <mb2>(1), <sb3>
Packit 1ac44c
   Then wide character buffer will be:
Packit 1ac44c
     <wc1>   , WEOF    , <wc2>   , WEOF    , <wc3>
Packit 1ac44c
   We use WEOF for padding, they indicate that the position isn't
Packit 1ac44c
   a first byte of a multibyte character.
Packit 1ac44c
Packit 1ac44c
   Note that this function assumes PSTR->VALID_LEN elements are already
Packit 1ac44c
   built and starts from PSTR->VALID_LEN.  */
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
build_wcs_buffer (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
#ifdef _LIBC
Packit 1ac44c
  unsigned char buf[MB_LEN_MAX];
Packit 1ac44c
  assert (MB_LEN_MAX >= pstr->mb_cur_max);
Packit 1ac44c
#else
Packit 1ac44c
  unsigned char buf[64];
Packit 1ac44c
#endif
Packit 1ac44c
  mbstate_t prev_st;
Packit 1ac44c
  Idx byte_idx, end_idx, remain_len;
Packit 1ac44c
  size_t mbclen;
Packit 1ac44c
Packit 1ac44c
  /* Build the buffers from pstr->valid_len to either pstr->len or
Packit 1ac44c
     pstr->bufs_len.  */
Packit 1ac44c
  end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
Packit 1ac44c
  for (byte_idx = pstr->valid_len; byte_idx < end_idx;)
Packit 1ac44c
    {
Packit 1ac44c
      wchar_t wc;
Packit 1ac44c
      const char *p;
Packit 1ac44c
Packit 1ac44c
      remain_len = end_idx - byte_idx;
Packit 1ac44c
      prev_st = pstr->cur_state;
Packit 1ac44c
      /* Apply the translation if we need.  */
Packit 1ac44c
      if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
	{
Packit 1ac44c
	  int i, ch;
Packit 1ac44c
Packit 1ac44c
	  for (i = 0; i < pstr->mb_cur_max && i < remain_len; ++i)
Packit 1ac44c
	    {
Packit 1ac44c
	      ch = pstr->raw_mbs [pstr->raw_mbs_idx + byte_idx + i];
Packit 1ac44c
	      buf[i] = pstr->mbs[byte_idx + i] = pstr->trans[ch];
Packit 1ac44c
	    }
Packit 1ac44c
	  p = (const char *) buf;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	p = (const char *) pstr->raw_mbs + pstr->raw_mbs_idx + byte_idx;
Packit 1ac44c
      mbclen = __mbrtowc (&wc, p, remain_len, &pstr->cur_state);
Packit 1ac44c
      if (BE (mbclen == (size_t) -1 || mbclen == 0
Packit 1ac44c
	      || (mbclen == (size_t) -2 && pstr->bufs_len >= pstr->len), 0))
Packit 1ac44c
	{
Packit 1ac44c
	  /* We treat these cases as a singlebyte character.  */
Packit 1ac44c
	  mbclen = 1;
Packit 1ac44c
	  wc = (wchar_t) pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx];
Packit 1ac44c
	  if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
	    wc = pstr->trans[wc];
Packit 1ac44c
	  pstr->cur_state = prev_st;
Packit 1ac44c
	}
Packit 1ac44c
      else if (BE (mbclen == (size_t) -2, 0))
Packit 1ac44c
	{
Packit 1ac44c
	  /* The buffer doesn't have enough space, finish to build.  */
Packit 1ac44c
	  pstr->cur_state = prev_st;
Packit 1ac44c
	  break;
Packit 1ac44c
	}
Packit 1ac44c
Packit 1ac44c
      /* Write wide character and padding.  */
Packit 1ac44c
      pstr->wcs[byte_idx++] = wc;
Packit 1ac44c
      /* Write paddings.  */
Packit 1ac44c
      for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
Packit 1ac44c
	pstr->wcs[byte_idx++] = WEOF;
Packit 1ac44c
    }
Packit 1ac44c
  pstr->valid_len = byte_idx;
Packit 1ac44c
  pstr->valid_raw_len = byte_idx;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Build wide character buffer PSTR->WCS like build_wcs_buffer,
Packit 1ac44c
   but for REG_ICASE.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
build_wcs_upper_buffer (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
  mbstate_t prev_st;
Packit 1ac44c
  Idx src_idx, byte_idx, end_idx, remain_len;
Packit 1ac44c
  size_t mbclen;
Packit 1ac44c
#ifdef _LIBC
Packit 1ac44c
  char buf[MB_LEN_MAX];
Packit 1ac44c
  assert (MB_LEN_MAX >= pstr->mb_cur_max);
Packit 1ac44c
#else
Packit 1ac44c
  char buf[64];
Packit 1ac44c
#endif
Packit 1ac44c
Packit 1ac44c
  byte_idx = pstr->valid_len;
Packit 1ac44c
  end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
Packit 1ac44c
Packit 1ac44c
  /* The following optimization assumes that ASCII characters can be
Packit 1ac44c
     mapped to wide characters with a simple cast.  */
Packit 1ac44c
  if (! pstr->map_notascii && pstr->trans == NULL && !pstr->offsets_needed)
Packit 1ac44c
    {
Packit 1ac44c
      while (byte_idx < end_idx)
Packit 1ac44c
	{
Packit 1ac44c
	  wchar_t wc;
Packit 1ac44c
Packit 1ac44c
	  if (isascii (pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx])
Packit 1ac44c
	      && mbsinit (&pstr->cur_state))
Packit 1ac44c
	    {
Packit 1ac44c
	      /* In case of a singlebyte character.  */
Packit 1ac44c
	      pstr->mbs[byte_idx]
Packit 1ac44c
		= toupper (pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx]);
Packit 1ac44c
	      /* The next step uses the assumption that wchar_t is encoded
Packit 1ac44c
		 ASCII-safe: all ASCII values can be converted like this.  */
Packit 1ac44c
	      pstr->wcs[byte_idx] = (wchar_t) pstr->mbs[byte_idx];
Packit 1ac44c
	      ++byte_idx;
Packit 1ac44c
	      continue;
Packit 1ac44c
	    }
Packit 1ac44c
Packit 1ac44c
	  remain_len = end_idx - byte_idx;
Packit 1ac44c
	  prev_st = pstr->cur_state;
Packit 1ac44c
	  mbclen = __mbrtowc (&wc,
Packit 1ac44c
			      ((const char *) pstr->raw_mbs + pstr->raw_mbs_idx
Packit 1ac44c
			       + byte_idx), remain_len, &pstr->cur_state);
Packit 1ac44c
	  if (BE (mbclen < (size_t) -2, 1))
Packit 1ac44c
	    {
Packit 1ac44c
	      wchar_t wcu = __towupper (wc);
Packit 1ac44c
	      if (wcu != wc)
Packit 1ac44c
		{
Packit 1ac44c
		  size_t mbcdlen;
Packit 1ac44c
Packit 1ac44c
		  mbcdlen = __wcrtomb (buf, wcu, &prev_st);
Packit 1ac44c
		  if (BE (mbclen == mbcdlen, 1))
Packit 1ac44c
		    memcpy (pstr->mbs + byte_idx, buf, mbclen);
Packit 1ac44c
		  else
Packit 1ac44c
		    {
Packit 1ac44c
		      src_idx = byte_idx;
Packit 1ac44c
		      goto offsets_needed;
Packit 1ac44c
		    }
Packit 1ac44c
		}
Packit 1ac44c
	      else
Packit 1ac44c
		memcpy (pstr->mbs + byte_idx,
Packit 1ac44c
			pstr->raw_mbs + pstr->raw_mbs_idx + byte_idx, mbclen);
Packit 1ac44c
	      pstr->wcs[byte_idx++] = wcu;
Packit 1ac44c
	      /* Write paddings.  */
Packit 1ac44c
	      for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
Packit 1ac44c
		pstr->wcs[byte_idx++] = WEOF;
Packit 1ac44c
	    }
Packit 1ac44c
	  else if (mbclen == (size_t) -1 || mbclen == 0
Packit 1ac44c
		   || (mbclen == (size_t) -2 && pstr->bufs_len >= pstr->len))
Packit 1ac44c
	    {
Packit 1ac44c
	      /* It is an invalid character, an incomplete character
Packit 1ac44c
		 at the end of the string, or '\0'.  Just use the byte.  */
Packit 1ac44c
	      int ch = pstr->raw_mbs[pstr->raw_mbs_idx + byte_idx];
Packit 1ac44c
	      pstr->mbs[byte_idx] = ch;
Packit 1ac44c
	      /* And also cast it to wide char.  */
Packit 1ac44c
	      pstr->wcs[byte_idx++] = (wchar_t) ch;
Packit 1ac44c
	      if (BE (mbclen == (size_t) -1, 0))
Packit 1ac44c
		pstr->cur_state = prev_st;
Packit 1ac44c
	    }
Packit 1ac44c
	  else
Packit 1ac44c
	    {
Packit 1ac44c
	      /* The buffer doesn't have enough space, finish to build.  */
Packit 1ac44c
	      pstr->cur_state = prev_st;
Packit 1ac44c
	      break;
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
      pstr->valid_len = byte_idx;
Packit 1ac44c
      pstr->valid_raw_len = byte_idx;
Packit 1ac44c
      return REG_NOERROR;
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    for (src_idx = pstr->valid_raw_len; byte_idx < end_idx;)
Packit 1ac44c
      {
Packit 1ac44c
	wchar_t wc;
Packit 1ac44c
	const char *p;
Packit 1ac44c
      offsets_needed:
Packit 1ac44c
	remain_len = end_idx - byte_idx;
Packit 1ac44c
	prev_st = pstr->cur_state;
Packit 1ac44c
	if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
	  {
Packit 1ac44c
	    int i, ch;
Packit 1ac44c
Packit 1ac44c
	    for (i = 0; i < pstr->mb_cur_max && i < remain_len; ++i)
Packit 1ac44c
	      {
Packit 1ac44c
		ch = pstr->raw_mbs [pstr->raw_mbs_idx + src_idx + i];
Packit 1ac44c
		buf[i] = pstr->trans[ch];
Packit 1ac44c
	      }
Packit 1ac44c
	    p = (const char *) buf;
Packit 1ac44c
	  }
Packit 1ac44c
	else
Packit 1ac44c
	  p = (const char *) pstr->raw_mbs + pstr->raw_mbs_idx + src_idx;
Packit 1ac44c
	mbclen = __mbrtowc (&wc, p, remain_len, &pstr->cur_state);
Packit 1ac44c
	if (BE (mbclen < (size_t) -2, 1))
Packit 1ac44c
	  {
Packit 1ac44c
	    wchar_t wcu = __towupper (wc);
Packit 1ac44c
	    if (wcu != wc)
Packit 1ac44c
	      {
Packit 1ac44c
		size_t mbcdlen;
Packit 1ac44c
Packit 1ac44c
		mbcdlen = wcrtomb ((char *) buf, wcu, &prev_st);
Packit 1ac44c
		if (BE (mbclen == mbcdlen, 1))
Packit 1ac44c
		  memcpy (pstr->mbs + byte_idx, buf, mbclen);
Packit 1ac44c
		else if (mbcdlen != (size_t) -1)
Packit 1ac44c
		  {
Packit 1ac44c
		    size_t i;
Packit 1ac44c
Packit 1ac44c
		    if (byte_idx + mbcdlen > pstr->bufs_len)
Packit 1ac44c
		      {
Packit 1ac44c
			pstr->cur_state = prev_st;
Packit 1ac44c
			break;
Packit 1ac44c
		      }
Packit 1ac44c
Packit 1ac44c
		    if (pstr->offsets == NULL)
Packit 1ac44c
		      {
Packit 1ac44c
			pstr->offsets = re_malloc (Idx, pstr->bufs_len);
Packit 1ac44c
Packit 1ac44c
			if (pstr->offsets == NULL)
Packit 1ac44c
			  return REG_ESPACE;
Packit 1ac44c
		      }
Packit 1ac44c
		    if (!pstr->offsets_needed)
Packit 1ac44c
		      {
Packit 1ac44c
			for (i = 0; i < (size_t) byte_idx; ++i)
Packit 1ac44c
			  pstr->offsets[i] = i;
Packit 1ac44c
			pstr->offsets_needed = 1;
Packit 1ac44c
		      }
Packit 1ac44c
Packit 1ac44c
		    memcpy (pstr->mbs + byte_idx, buf, mbcdlen);
Packit 1ac44c
		    pstr->wcs[byte_idx] = wcu;
Packit 1ac44c
		    pstr->offsets[byte_idx] = src_idx;
Packit 1ac44c
		    for (i = 1; i < mbcdlen; ++i)
Packit 1ac44c
		      {
Packit 1ac44c
			pstr->offsets[byte_idx + i]
Packit 1ac44c
			  = src_idx + (i < mbclen ? i : mbclen - 1);
Packit 1ac44c
			pstr->wcs[byte_idx + i] = WEOF;
Packit 1ac44c
		      }
Packit 1ac44c
		    pstr->len += mbcdlen - mbclen;
Packit 1ac44c
		    if (pstr->raw_stop > src_idx)
Packit 1ac44c
		      pstr->stop += mbcdlen - mbclen;
Packit 1ac44c
		    end_idx = (pstr->bufs_len > pstr->len)
Packit 1ac44c
			      ? pstr->len : pstr->bufs_len;
Packit 1ac44c
		    byte_idx += mbcdlen;
Packit 1ac44c
		    src_idx += mbclen;
Packit 1ac44c
		    continue;
Packit 1ac44c
		  }
Packit 1ac44c
		else
Packit 1ac44c
		  memcpy (pstr->mbs + byte_idx, p, mbclen);
Packit 1ac44c
	      }
Packit 1ac44c
	    else
Packit 1ac44c
	      memcpy (pstr->mbs + byte_idx, p, mbclen);
Packit 1ac44c
Packit 1ac44c
	    if (BE (pstr->offsets_needed != 0, 0))
Packit 1ac44c
	      {
Packit 1ac44c
		size_t i;
Packit 1ac44c
		for (i = 0; i < mbclen; ++i)
Packit 1ac44c
		  pstr->offsets[byte_idx + i] = src_idx + i;
Packit 1ac44c
	      }
Packit 1ac44c
	    src_idx += mbclen;
Packit 1ac44c
Packit 1ac44c
	    pstr->wcs[byte_idx++] = wcu;
Packit 1ac44c
	    /* Write paddings.  */
Packit 1ac44c
	    for (remain_len = byte_idx + mbclen - 1; byte_idx < remain_len ;)
Packit 1ac44c
	      pstr->wcs[byte_idx++] = WEOF;
Packit 1ac44c
	  }
Packit 1ac44c
	else if (mbclen == (size_t) -1 || mbclen == 0
Packit 1ac44c
		 || (mbclen == (size_t) -2 && pstr->bufs_len >= pstr->len))
Packit 1ac44c
	  {
Packit 1ac44c
	    /* It is an invalid character or '\0'.  Just use the byte.  */
Packit 1ac44c
	    int ch = pstr->raw_mbs[pstr->raw_mbs_idx + src_idx];
Packit 1ac44c
Packit 1ac44c
	    if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
	      ch = pstr->trans [ch];
Packit 1ac44c
	    pstr->mbs[byte_idx] = ch;
Packit 1ac44c
Packit 1ac44c
	    if (BE (pstr->offsets_needed != 0, 0))
Packit 1ac44c
	      pstr->offsets[byte_idx] = src_idx;
Packit 1ac44c
	    ++src_idx;
Packit 1ac44c
Packit 1ac44c
	    /* And also cast it to wide char.  */
Packit 1ac44c
	    pstr->wcs[byte_idx++] = (wchar_t) ch;
Packit 1ac44c
	    if (BE (mbclen == (size_t) -1, 0))
Packit 1ac44c
	      pstr->cur_state = prev_st;
Packit 1ac44c
	  }
Packit 1ac44c
	else
Packit 1ac44c
	  {
Packit 1ac44c
	    /* The buffer doesn't have enough space, finish to build.  */
Packit 1ac44c
	    pstr->cur_state = prev_st;
Packit 1ac44c
	    break;
Packit 1ac44c
	  }
Packit 1ac44c
      }
Packit 1ac44c
  pstr->valid_len = byte_idx;
Packit 1ac44c
  pstr->valid_raw_len = src_idx;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Skip characters until the index becomes greater than NEW_RAW_IDX.
Packit 1ac44c
   Return the index.  */
Packit 1ac44c
Packit 1ac44c
static Idx
Packit 1ac44c
re_string_skip_chars (re_string_t *pstr, Idx new_raw_idx, wint_t *last_wc)
Packit 1ac44c
{
Packit 1ac44c
  mbstate_t prev_st;
Packit 1ac44c
  Idx rawbuf_idx;
Packit 1ac44c
  size_t mbclen;
Packit 1ac44c
  wint_t wc = WEOF;
Packit 1ac44c
Packit 1ac44c
  /* Skip the characters which are not necessary to check.  */
Packit 1ac44c
  for (rawbuf_idx = pstr->raw_mbs_idx + pstr->valid_raw_len;
Packit 1ac44c
       rawbuf_idx < new_raw_idx;)
Packit 1ac44c
    {
Packit 1ac44c
      wchar_t wc2;
Packit 1ac44c
      Idx remain_len = pstr->raw_len - rawbuf_idx;
Packit 1ac44c
      prev_st = pstr->cur_state;
Packit 1ac44c
      mbclen = __mbrtowc (&wc2, (const char *) pstr->raw_mbs + rawbuf_idx,
Packit 1ac44c
			  remain_len, &pstr->cur_state);
Packit 1ac44c
      if (BE (mbclen == (size_t) -2 || mbclen == (size_t) -1 || mbclen == 0, 0))
Packit 1ac44c
	{
Packit 1ac44c
	  /* We treat these cases as a single byte character.  */
Packit 1ac44c
	  if (mbclen == 0 || remain_len == 0)
Packit 1ac44c
	    wc = L'\0';
Packit 1ac44c
	  else
Packit 1ac44c
	    wc = *(unsigned char *) (pstr->raw_mbs + rawbuf_idx);
Packit 1ac44c
	  mbclen = 1;
Packit 1ac44c
	  pstr->cur_state = prev_st;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	wc = wc2;
Packit 1ac44c
      /* Then proceed the next character.  */
Packit 1ac44c
      rawbuf_idx += mbclen;
Packit 1ac44c
    }
Packit 1ac44c
  *last_wc = wc;
Packit 1ac44c
  return rawbuf_idx;
Packit 1ac44c
}
Packit 1ac44c
#endif /* RE_ENABLE_I18N  */
Packit 1ac44c
Packit 1ac44c
/* Build the buffer PSTR->MBS, and apply the translation if we need.
Packit 1ac44c
   This function is used in case of REG_ICASE.  */
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
build_upper_buffer (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
  Idx char_idx, end_idx;
Packit 1ac44c
  end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
Packit 1ac44c
Packit 1ac44c
  for (char_idx = pstr->valid_len; char_idx < end_idx; ++char_idx)
Packit 1ac44c
    {
Packit 1ac44c
      int ch = pstr->raw_mbs[pstr->raw_mbs_idx + char_idx];
Packit 1ac44c
      if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
	ch = pstr->trans[ch];
Packit 1ac44c
      pstr->mbs[char_idx] = toupper (ch);
Packit 1ac44c
    }
Packit 1ac44c
  pstr->valid_len = char_idx;
Packit 1ac44c
  pstr->valid_raw_len = char_idx;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Apply TRANS to the buffer in PSTR.  */
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
re_string_translate_buffer (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
  Idx buf_idx, end_idx;
Packit 1ac44c
  end_idx = (pstr->bufs_len > pstr->len) ? pstr->len : pstr->bufs_len;
Packit 1ac44c
Packit 1ac44c
  for (buf_idx = pstr->valid_len; buf_idx < end_idx; ++buf_idx)
Packit 1ac44c
    {
Packit 1ac44c
      int ch = pstr->raw_mbs[pstr->raw_mbs_idx + buf_idx];
Packit 1ac44c
      pstr->mbs[buf_idx] = pstr->trans[ch];
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  pstr->valid_len = buf_idx;
Packit 1ac44c
  pstr->valid_raw_len = buf_idx;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* This function re-construct the buffers.
Packit 1ac44c
   Concretely, convert to wide character in case of pstr->mb_cur_max > 1,
Packit 1ac44c
   convert to upper case in case of REG_ICASE, apply translation.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_string_reconstruct (re_string_t *pstr, Idx idx, int eflags)
Packit 1ac44c
{
Packit 1ac44c
  Idx offset;
Packit 1ac44c
Packit 1ac44c
  if (BE (pstr->raw_mbs_idx <= idx, 0))
Packit 1ac44c
    offset = idx - pstr->raw_mbs_idx;
Packit 1ac44c
  else
Packit 1ac44c
    {
Packit 1ac44c
      /* Reset buffer.  */
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
      if (pstr->mb_cur_max > 1)
Packit 1ac44c
	memset (&pstr->cur_state, '\0', sizeof (mbstate_t));
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
      pstr->len = pstr->raw_len;
Packit 1ac44c
      pstr->stop = pstr->raw_stop;
Packit 1ac44c
      pstr->valid_len = 0;
Packit 1ac44c
      pstr->raw_mbs_idx = 0;
Packit 1ac44c
      pstr->valid_raw_len = 0;
Packit 1ac44c
      pstr->offsets_needed = 0;
Packit 1ac44c
      pstr->tip_context = ((eflags & REG_NOTBOL) ? CONTEXT_BEGBUF
Packit 1ac44c
			   : CONTEXT_NEWLINE | CONTEXT_BEGBUF);
Packit 1ac44c
      if (!pstr->mbs_allocated)
Packit 1ac44c
	pstr->mbs = (unsigned char *) pstr->raw_mbs;
Packit 1ac44c
      offset = idx;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  if (BE (offset != 0, 1))
Packit 1ac44c
    {
Packit 1ac44c
      /* Should the already checked characters be kept?  */
Packit 1ac44c
      if (BE (offset < pstr->valid_raw_len, 1))
Packit 1ac44c
	{
Packit 1ac44c
	  /* Yes, move them to the front of the buffer.  */
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
	  if (BE (pstr->offsets_needed, 0))
Packit 1ac44c
	    {
Packit 1ac44c
	      Idx low = 0, high = pstr->valid_len, mid;
Packit 1ac44c
	      do
Packit 1ac44c
		{
Packit 1ac44c
		  mid = (high + low) / 2;
Packit 1ac44c
		  if (pstr->offsets[mid] > offset)
Packit 1ac44c
		    high = mid;
Packit 1ac44c
		  else if (pstr->offsets[mid] < offset)
Packit 1ac44c
		    low = mid + 1;
Packit 1ac44c
		  else
Packit 1ac44c
		    break;
Packit 1ac44c
		}
Packit 1ac44c
	      while (low < high);
Packit 1ac44c
	      if (pstr->offsets[mid] < offset)
Packit 1ac44c
		++mid;
Packit 1ac44c
	      pstr->tip_context = re_string_context_at (pstr, mid - 1,
Packit 1ac44c
							eflags);
Packit 1ac44c
	      /* This can be quite complicated, so handle specially
Packit 1ac44c
		 only the common and easy case where the character with
Packit 1ac44c
		 different length representation of lower and upper
Packit 1ac44c
		 case is present at or after offset.  */
Packit 1ac44c
	      if (pstr->valid_len > offset
Packit 1ac44c
		  && mid == offset && pstr->offsets[mid] == offset)
Packit 1ac44c
		{
Packit 1ac44c
		  memmove (pstr->wcs, pstr->wcs + offset,
Packit 1ac44c
			   (pstr->valid_len - offset) * sizeof (wint_t));
Packit 1ac44c
		  memmove (pstr->mbs, pstr->mbs + offset, pstr->valid_len - offset);
Packit 1ac44c
		  pstr->valid_len -= offset;
Packit 1ac44c
		  pstr->valid_raw_len -= offset;
Packit 1ac44c
		  for (low = 0; low < pstr->valid_len; low++)
Packit 1ac44c
		    pstr->offsets[low] = pstr->offsets[low + offset] - offset;
Packit 1ac44c
		}
Packit 1ac44c
	      else
Packit 1ac44c
		{
Packit 1ac44c
		  /* Otherwise, just find out how long the partial multibyte
Packit 1ac44c
		     character at offset is and fill it with WEOF/255.  */
Packit 1ac44c
		  pstr->len = pstr->raw_len - idx + offset;
Packit 1ac44c
		  pstr->stop = pstr->raw_stop - idx + offset;
Packit 1ac44c
		  pstr->offsets_needed = 0;
Packit 1ac44c
		  while (mid > 0 && pstr->offsets[mid - 1] == offset)
Packit 1ac44c
		    --mid;
Packit 1ac44c
		  while (mid < pstr->valid_len)
Packit 1ac44c
		    if (pstr->wcs[mid] != WEOF)
Packit 1ac44c
		      break;
Packit 1ac44c
		    else
Packit 1ac44c
		      ++mid;
Packit 1ac44c
		  if (mid == pstr->valid_len)
Packit 1ac44c
		    pstr->valid_len = 0;
Packit 1ac44c
		  else
Packit 1ac44c
		    {
Packit 1ac44c
		      pstr->valid_len = pstr->offsets[mid] - offset;
Packit 1ac44c
		      if (pstr->valid_len)
Packit 1ac44c
			{
Packit 1ac44c
			  for (low = 0; low < pstr->valid_len; ++low)
Packit 1ac44c
			    pstr->wcs[low] = WEOF;
Packit 1ac44c
			  memset (pstr->mbs, 255, pstr->valid_len);
Packit 1ac44c
			}
Packit 1ac44c
		    }
Packit 1ac44c
		  pstr->valid_raw_len = pstr->valid_len;
Packit 1ac44c
		}
Packit 1ac44c
	    }
Packit 1ac44c
	  else
Packit 1ac44c
#endif
Packit 1ac44c
	    {
Packit 1ac44c
	      pstr->tip_context = re_string_context_at (pstr, offset - 1,
Packit 1ac44c
							eflags);
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
	      if (pstr->mb_cur_max > 1)
Packit 1ac44c
		memmove (pstr->wcs, pstr->wcs + offset,
Packit 1ac44c
			 (pstr->valid_len - offset) * sizeof (wint_t));
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
	      if (BE (pstr->mbs_allocated, 0))
Packit 1ac44c
		memmove (pstr->mbs, pstr->mbs + offset,
Packit 1ac44c
			 pstr->valid_len - offset);
Packit 1ac44c
	      pstr->valid_len -= offset;
Packit 1ac44c
	      pstr->valid_raw_len -= offset;
Packit 1ac44c
#if defined DEBUG && DEBUG
Packit 1ac44c
	      assert (pstr->valid_len > 0);
Packit 1ac44c
#endif
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	{
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
	  /* No, skip all characters until IDX.  */
Packit 1ac44c
	  Idx prev_valid_len = pstr->valid_len;
Packit 1ac44c
Packit 1ac44c
	  if (BE (pstr->offsets_needed, 0))
Packit 1ac44c
	    {
Packit 1ac44c
	      pstr->len = pstr->raw_len - idx + offset;
Packit 1ac44c
	      pstr->stop = pstr->raw_stop - idx + offset;
Packit 1ac44c
	      pstr->offsets_needed = 0;
Packit 1ac44c
	    }
Packit 1ac44c
#endif
Packit 1ac44c
	  pstr->valid_len = 0;
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
	  if (pstr->mb_cur_max > 1)
Packit 1ac44c
	    {
Packit 1ac44c
	      Idx wcs_idx;
Packit 1ac44c
	      wint_t wc = WEOF;
Packit 1ac44c
Packit 1ac44c
	      if (pstr->is_utf8)
Packit 1ac44c
		{
Packit 1ac44c
		  const unsigned char *raw, *p, *end;
Packit 1ac44c
Packit 1ac44c
		  /* Special case UTF-8.  Multi-byte chars start with any
Packit 1ac44c
		     byte other than 0x80 - 0xbf.  */
Packit 1ac44c
		  raw = pstr->raw_mbs + pstr->raw_mbs_idx;
Packit 1ac44c
		  end = raw + (offset - pstr->mb_cur_max);
Packit 1ac44c
		  if (end < pstr->raw_mbs)
Packit 1ac44c
		    end = pstr->raw_mbs;
Packit 1ac44c
		  p = raw + offset - 1;
Packit 1ac44c
#ifdef _LIBC
Packit 1ac44c
		  /* We know the wchar_t encoding is UCS4, so for the simple
Packit 1ac44c
		     case, ASCII characters, skip the conversion step.  */
Packit 1ac44c
		  if (isascii (*p) && BE (pstr->trans == NULL, 1))
Packit 1ac44c
		    {
Packit 1ac44c
		      memset (&pstr->cur_state, '\0', sizeof (mbstate_t));
Packit 1ac44c
		      /* pstr->valid_len = 0; */
Packit 1ac44c
		      wc = (wchar_t) *p;
Packit 1ac44c
		    }
Packit 1ac44c
		  else
Packit 1ac44c
#endif
Packit 1ac44c
		    for (; p >= end; --p)
Packit 1ac44c
		      if ((*p & 0xc0) != 0x80)
Packit 1ac44c
			{
Packit 1ac44c
			  mbstate_t cur_state;
Packit 1ac44c
			  wchar_t wc2;
Packit 1ac44c
			  Idx mlen = raw + pstr->len - p;
Packit 1ac44c
			  unsigned char buf[6];
Packit 1ac44c
			  size_t mbclen;
Packit 1ac44c
Packit 1ac44c
			  const unsigned char *pp = p;
Packit 1ac44c
			  if (BE (pstr->trans != NULL, 0))
Packit 1ac44c
			    {
Packit 1ac44c
			      int i = mlen < 6 ? mlen : 6;
Packit 1ac44c
			      while (--i >= 0)
Packit 1ac44c
				buf[i] = pstr->trans[p[i]];
Packit 1ac44c
			      pp = buf;
Packit 1ac44c
			    }
Packit 1ac44c
			  /* XXX Don't use mbrtowc, we know which conversion
Packit 1ac44c
			     to use (UTF-8 -> UCS4).  */
Packit 1ac44c
			  memset (&cur_state, 0, sizeof (cur_state));
Packit 1ac44c
			  mbclen = __mbrtowc (&wc2, (const char *) pp, mlen,
Packit 1ac44c
					      &cur_state);
Packit 1ac44c
			  if (raw + offset - p <= mbclen
Packit 1ac44c
			      && mbclen < (size_t) -2)
Packit 1ac44c
			    {
Packit 1ac44c
			      memset (&pstr->cur_state, '\0',
Packit 1ac44c
				      sizeof (mbstate_t));
Packit 1ac44c
			      pstr->valid_len = mbclen - (raw + offset - p);
Packit 1ac44c
			      wc = wc2;
Packit 1ac44c
			    }
Packit 1ac44c
			  break;
Packit 1ac44c
			}
Packit 1ac44c
		}
Packit 1ac44c
Packit 1ac44c
	      if (wc == WEOF)
Packit 1ac44c
		pstr->valid_len = re_string_skip_chars (pstr, idx, &wc) - idx;
Packit 1ac44c
	      if (wc == WEOF)
Packit 1ac44c
		pstr->tip_context
Packit 1ac44c
		  = re_string_context_at (pstr, prev_valid_len - 1, eflags);
Packit 1ac44c
	      else
Packit 1ac44c
		pstr->tip_context = ((BE (pstr->word_ops_used != 0, 0)
Packit 1ac44c
				      && IS_WIDE_WORD_CHAR (wc))
Packit 1ac44c
				     ? CONTEXT_WORD
Packit 1ac44c
				     : ((IS_WIDE_NEWLINE (wc)
Packit 1ac44c
					 && pstr->newline_anchor)
Packit 1ac44c
					? CONTEXT_NEWLINE : 0));
Packit 1ac44c
	      if (BE (pstr->valid_len, 0))
Packit 1ac44c
		{
Packit 1ac44c
		  for (wcs_idx = 0; wcs_idx < pstr->valid_len; ++wcs_idx)
Packit 1ac44c
		    pstr->wcs[wcs_idx] = WEOF;
Packit 1ac44c
		  if (pstr->mbs_allocated)
Packit 1ac44c
		    memset (pstr->mbs, 255, pstr->valid_len);
Packit 1ac44c
		}
Packit 1ac44c
	      pstr->valid_raw_len = pstr->valid_len;
Packit 1ac44c
	    }
Packit 1ac44c
	  else
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
	    {
Packit 1ac44c
	      int c = pstr->raw_mbs[pstr->raw_mbs_idx + offset - 1];
Packit 1ac44c
	      pstr->valid_raw_len = 0;
Packit 1ac44c
	      if (pstr->trans)
Packit 1ac44c
		c = pstr->trans[c];
Packit 1ac44c
	      pstr->tip_context = (bitset_contain (pstr->word_char, c)
Packit 1ac44c
				   ? CONTEXT_WORD
Packit 1ac44c
				   : ((IS_NEWLINE (c) && pstr->newline_anchor)
Packit 1ac44c
				      ? CONTEXT_NEWLINE : 0));
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
      if (!BE (pstr->mbs_allocated, 0))
Packit 1ac44c
	pstr->mbs += offset;
Packit 1ac44c
    }
Packit 1ac44c
  pstr->raw_mbs_idx = idx;
Packit 1ac44c
  pstr->len -= offset;
Packit 1ac44c
  pstr->stop -= offset;
Packit 1ac44c
Packit 1ac44c
  /* Then build the buffers.  */
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (pstr->mb_cur_max > 1)
Packit 1ac44c
    {
Packit 1ac44c
      if (pstr->icase)
Packit 1ac44c
	{
Packit 1ac44c
	  reg_errcode_t ret = build_wcs_upper_buffer (pstr);
Packit 1ac44c
	  if (BE (ret != REG_NOERROR, 0))
Packit 1ac44c
	    return ret;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	build_wcs_buffer (pstr);
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
    if (BE (pstr->mbs_allocated, 0))
Packit 1ac44c
      {
Packit 1ac44c
	if (pstr->icase)
Packit 1ac44c
	  build_upper_buffer (pstr);
Packit 1ac44c
	else if (pstr->trans != NULL)
Packit 1ac44c
	  re_string_translate_buffer (pstr);
Packit 1ac44c
      }
Packit 1ac44c
    else
Packit 1ac44c
      pstr->valid_len = pstr->len;
Packit 1ac44c
Packit 1ac44c
  pstr->cur_idx = 0;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static unsigned char
Packit 1ac44c
__attribute__ ((pure))
Packit 1ac44c
re_string_peek_byte_case (const re_string_t *pstr, Idx idx)
Packit 1ac44c
{
Packit 1ac44c
  int ch;
Packit 1ac44c
  Idx off;
Packit 1ac44c
Packit 1ac44c
  /* Handle the common (easiest) cases first.  */
Packit 1ac44c
  if (BE (!pstr->mbs_allocated, 1))
Packit 1ac44c
    return re_string_peek_byte (pstr, idx);
Packit 1ac44c
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (pstr->mb_cur_max > 1
Packit 1ac44c
      && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx))
Packit 1ac44c
    return re_string_peek_byte (pstr, idx);
Packit 1ac44c
#endif
Packit 1ac44c
Packit 1ac44c
  off = pstr->cur_idx + idx;
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (pstr->offsets_needed)
Packit 1ac44c
    off = pstr->offsets[off];
Packit 1ac44c
#endif
Packit 1ac44c
Packit 1ac44c
  ch = pstr->raw_mbs[pstr->raw_mbs_idx + off];
Packit 1ac44c
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  /* Ensure that e.g. for tr_TR.UTF-8 BACKSLASH DOTLESS SMALL LETTER I
Packit 1ac44c
     this function returns CAPITAL LETTER I instead of first byte of
Packit 1ac44c
     DOTLESS SMALL LETTER I.  The latter would confuse the parser,
Packit 1ac44c
     since peek_byte_case doesn't advance cur_idx in any way.  */
Packit 1ac44c
  if (pstr->offsets_needed && !isascii (ch))
Packit 1ac44c
    return re_string_peek_byte (pstr, idx);
Packit 1ac44c
#endif
Packit 1ac44c
Packit 1ac44c
  return ch;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static unsigned char
Packit 1ac44c
re_string_fetch_byte_case (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
  if (BE (!pstr->mbs_allocated, 1))
Packit 1ac44c
    return re_string_fetch_byte (pstr);
Packit 1ac44c
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (pstr->offsets_needed)
Packit 1ac44c
    {
Packit 1ac44c
      Idx off;
Packit 1ac44c
      int ch;
Packit 1ac44c
Packit 1ac44c
      /* For tr_TR.UTF-8 [[:islower:]] there is
Packit 1ac44c
	 [[: CAPITAL LETTER I WITH DOT lower:]] in mbs.  Skip
Packit 1ac44c
	 in that case the whole multi-byte character and return
Packit 1ac44c
	 the original letter.  On the other side, with
Packit 1ac44c
	 [[: DOTLESS SMALL LETTER I return [[:I, as doing
Packit 1ac44c
	 anything else would complicate things too much.  */
Packit 1ac44c
Packit 1ac44c
      if (!re_string_first_byte (pstr, pstr->cur_idx))
Packit 1ac44c
	return re_string_fetch_byte (pstr);
Packit 1ac44c
Packit 1ac44c
      off = pstr->offsets[pstr->cur_idx];
Packit 1ac44c
      ch = pstr->raw_mbs[pstr->raw_mbs_idx + off];
Packit 1ac44c
Packit 1ac44c
      if (! isascii (ch))
Packit 1ac44c
	return re_string_fetch_byte (pstr);
Packit 1ac44c
Packit 1ac44c
      re_string_skip_bytes (pstr,
Packit 1ac44c
			    re_string_char_size_at (pstr, pstr->cur_idx));
Packit 1ac44c
      return ch;
Packit 1ac44c
    }
Packit 1ac44c
#endif
Packit 1ac44c
Packit 1ac44c
  return pstr->raw_mbs[pstr->raw_mbs_idx + pstr->cur_idx++];
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
re_string_destruct (re_string_t *pstr)
Packit 1ac44c
{
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  re_free (pstr->wcs);
Packit 1ac44c
  re_free (pstr->offsets);
Packit 1ac44c
#endif /* RE_ENABLE_I18N  */
Packit 1ac44c
  if (pstr->mbs_allocated)
Packit 1ac44c
    re_free (pstr->mbs);
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Return the context at IDX in INPUT.  */
Packit 1ac44c
Packit 1ac44c
static unsigned int
Packit 1ac44c
re_string_context_at (const re_string_t *input, Idx idx, int eflags)
Packit 1ac44c
{
Packit 1ac44c
  int c;
Packit 1ac44c
  if (BE (idx < 0, 0))
Packit 1ac44c
    /* In this case, we use the value stored in input->tip_context,
Packit 1ac44c
       since we can't know the character in input->mbs[-1] here.  */
Packit 1ac44c
    return input->tip_context;
Packit 1ac44c
  if (BE (idx == input->len, 0))
Packit 1ac44c
    return ((eflags & REG_NOTEOL) ? CONTEXT_ENDBUF
Packit 1ac44c
	    : CONTEXT_NEWLINE | CONTEXT_ENDBUF);
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  if (input->mb_cur_max > 1)
Packit 1ac44c
    {
Packit 1ac44c
      wint_t wc;
Packit 1ac44c
      Idx wc_idx = idx;
Packit 1ac44c
      while(input->wcs[wc_idx] == WEOF)
Packit 1ac44c
	{
Packit 1ac44c
#if defined DEBUG && DEBUG
Packit 1ac44c
	  /* It must not happen.  */
Packit 1ac44c
	  assert (wc_idx >= 0);
Packit 1ac44c
#endif
Packit 1ac44c
	  --wc_idx;
Packit 1ac44c
	  if (wc_idx < 0)
Packit 1ac44c
	    return input->tip_context;
Packit 1ac44c
	}
Packit 1ac44c
      wc = input->wcs[wc_idx];
Packit 1ac44c
      if (BE (input->word_ops_used != 0, 0) && IS_WIDE_WORD_CHAR (wc))
Packit 1ac44c
	return CONTEXT_WORD;
Packit 1ac44c
      return (IS_WIDE_NEWLINE (wc) && input->newline_anchor
Packit 1ac44c
	      ? CONTEXT_NEWLINE : 0);
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
#endif
Packit 1ac44c
    {
Packit 1ac44c
      c = re_string_byte_at (input, idx);
Packit 1ac44c
      if (bitset_contain (input->word_char, c))
Packit 1ac44c
	return CONTEXT_WORD;
Packit 1ac44c
      return IS_NEWLINE (c) && input->newline_anchor ? CONTEXT_NEWLINE : 0;
Packit 1ac44c
    }
Packit 1ac44c
}
Packit 1ac44c

Packit 1ac44c
/* Functions for set operation.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_alloc (re_node_set *set, Idx size)
Packit 1ac44c
{
Packit 1ac44c
  set->alloc = size;
Packit 1ac44c
  set->nelem = 0;
Packit 1ac44c
  set->elems = re_malloc (Idx, size);
Packit 1ac44c
  if (BE (set->elems == NULL, 0) && (MALLOC_0_IS_NONNULL || size != 0))
Packit 1ac44c
    return REG_ESPACE;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_init_1 (re_node_set *set, Idx elem)
Packit 1ac44c
{
Packit 1ac44c
  set->alloc = 1;
Packit 1ac44c
  set->nelem = 1;
Packit 1ac44c
  set->elems = re_malloc (Idx, 1);
Packit 1ac44c
  if (BE (set->elems == NULL, 0))
Packit 1ac44c
    {
Packit 1ac44c
      set->alloc = set->nelem = 0;
Packit 1ac44c
      return REG_ESPACE;
Packit 1ac44c
    }
Packit 1ac44c
  set->elems[0] = elem;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_init_2 (re_node_set *set, Idx elem1, Idx elem2)
Packit 1ac44c
{
Packit 1ac44c
  set->alloc = 2;
Packit 1ac44c
  set->elems = re_malloc (Idx, 2);
Packit 1ac44c
  if (BE (set->elems == NULL, 0))
Packit 1ac44c
    return REG_ESPACE;
Packit 1ac44c
  if (elem1 == elem2)
Packit 1ac44c
    {
Packit 1ac44c
      set->nelem = 1;
Packit 1ac44c
      set->elems[0] = elem1;
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    {
Packit 1ac44c
      set->nelem = 2;
Packit 1ac44c
      if (elem1 < elem2)
Packit 1ac44c
	{
Packit 1ac44c
	  set->elems[0] = elem1;
Packit 1ac44c
	  set->elems[1] = elem2;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	{
Packit 1ac44c
	  set->elems[0] = elem2;
Packit 1ac44c
	  set->elems[1] = elem1;
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_init_copy (re_node_set *dest, const re_node_set *src)
Packit 1ac44c
{
Packit 1ac44c
  dest->nelem = src->nelem;
Packit 1ac44c
  if (src->nelem > 0)
Packit 1ac44c
    {
Packit 1ac44c
      dest->alloc = dest->nelem;
Packit 1ac44c
      dest->elems = re_malloc (Idx, dest->alloc);
Packit 1ac44c
      if (BE (dest->elems == NULL, 0))
Packit 1ac44c
	{
Packit 1ac44c
	  dest->alloc = dest->nelem = 0;
Packit 1ac44c
	  return REG_ESPACE;
Packit 1ac44c
	}
Packit 1ac44c
      memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    re_node_set_init_empty (dest);
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Calculate the intersection of the sets SRC1 and SRC2. And merge it to
Packit 1ac44c
   DEST. Return value indicate the error code or REG_NOERROR if succeeded.
Packit 1ac44c
   Note: We assume dest->elems is NULL, when dest->alloc is 0.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_add_intersect (re_node_set *dest, const re_node_set *src1,
Packit 1ac44c
			   const re_node_set *src2)
Packit 1ac44c
{
Packit 1ac44c
  Idx i1, i2, is, id, delta, sbase;
Packit 1ac44c
  if (src1->nelem == 0 || src2->nelem == 0)
Packit 1ac44c
    return REG_NOERROR;
Packit 1ac44c
Packit 1ac44c
  /* We need dest->nelem + 2 * elems_in_intersection; this is a
Packit 1ac44c
     conservative estimate.  */
Packit 1ac44c
  if (src1->nelem + src2->nelem + dest->nelem > dest->alloc)
Packit 1ac44c
    {
Packit 1ac44c
      Idx new_alloc = src1->nelem + src2->nelem + dest->alloc;
Packit 1ac44c
      Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc);
Packit 1ac44c
      if (BE (new_elems == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
      dest->elems = new_elems;
Packit 1ac44c
      dest->alloc = new_alloc;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Find the items in the intersection of SRC1 and SRC2, and copy
Packit 1ac44c
     into the top of DEST those that are not already in DEST itself.  */
Packit 1ac44c
  sbase = dest->nelem + src1->nelem + src2->nelem;
Packit 1ac44c
  i1 = src1->nelem - 1;
Packit 1ac44c
  i2 = src2->nelem - 1;
Packit 1ac44c
  id = dest->nelem - 1;
Packit 1ac44c
  for (;;)
Packit 1ac44c
    {
Packit 1ac44c
      if (src1->elems[i1] == src2->elems[i2])
Packit 1ac44c
	{
Packit 1ac44c
	  /* Try to find the item in DEST.  Maybe we could binary search?  */
Packit 1ac44c
	  while (id >= 0 && dest->elems[id] > src1->elems[i1])
Packit 1ac44c
	    --id;
Packit 1ac44c
Packit 1ac44c
	  if (id < 0 || dest->elems[id] != src1->elems[i1])
Packit 1ac44c
            dest->elems[--sbase] = src1->elems[i1];
Packit 1ac44c
Packit 1ac44c
	  if (--i1 < 0 || --i2 < 0)
Packit 1ac44c
	    break;
Packit 1ac44c
	}
Packit 1ac44c
Packit 1ac44c
      /* Lower the highest of the two items.  */
Packit 1ac44c
      else if (src1->elems[i1] < src2->elems[i2])
Packit 1ac44c
	{
Packit 1ac44c
	  if (--i2 < 0)
Packit 1ac44c
	    break;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	{
Packit 1ac44c
	  if (--i1 < 0)
Packit 1ac44c
	    break;
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  id = dest->nelem - 1;
Packit 1ac44c
  is = dest->nelem + src1->nelem + src2->nelem - 1;
Packit 1ac44c
  delta = is - sbase + 1;
Packit 1ac44c
Packit 1ac44c
  /* Now copy.  When DELTA becomes zero, the remaining
Packit 1ac44c
     DEST elements are already in place; this is more or
Packit 1ac44c
     less the same loop that is in re_node_set_merge.  */
Packit 1ac44c
  dest->nelem += delta;
Packit 1ac44c
  if (delta > 0 && id >= 0)
Packit 1ac44c
    for (;;)
Packit 1ac44c
      {
Packit 1ac44c
	if (dest->elems[is] > dest->elems[id])
Packit 1ac44c
	  {
Packit 1ac44c
	    /* Copy from the top.  */
Packit 1ac44c
	    dest->elems[id + delta--] = dest->elems[is--];
Packit 1ac44c
	    if (delta == 0)
Packit 1ac44c
	      break;
Packit 1ac44c
	  }
Packit 1ac44c
	else
Packit 1ac44c
	  {
Packit 1ac44c
	    /* Slide from the bottom.  */
Packit 1ac44c
	    dest->elems[id + delta] = dest->elems[id];
Packit 1ac44c
	    if (--id < 0)
Packit 1ac44c
	      break;
Packit 1ac44c
	  }
Packit 1ac44c
      }
Packit 1ac44c
Packit 1ac44c
  /* Copy remaining SRC elements.  */
Packit 1ac44c
  memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx));
Packit 1ac44c
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Calculate the union set of the sets SRC1 and SRC2. And store it to
Packit 1ac44c
   DEST. Return value indicate the error code or REG_NOERROR if succeeded.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_init_union (re_node_set *dest, const re_node_set *src1,
Packit 1ac44c
			const re_node_set *src2)
Packit 1ac44c
{
Packit 1ac44c
  Idx i1, i2, id;
Packit 1ac44c
  if (src1 != NULL && src1->nelem > 0 && src2 != NULL && src2->nelem > 0)
Packit 1ac44c
    {
Packit 1ac44c
      dest->alloc = src1->nelem + src2->nelem;
Packit 1ac44c
      dest->elems = re_malloc (Idx, dest->alloc);
Packit 1ac44c
      if (BE (dest->elems == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    {
Packit 1ac44c
      if (src1 != NULL && src1->nelem > 0)
Packit 1ac44c
	return re_node_set_init_copy (dest, src1);
Packit 1ac44c
      else if (src2 != NULL && src2->nelem > 0)
Packit 1ac44c
	return re_node_set_init_copy (dest, src2);
Packit 1ac44c
      else
Packit 1ac44c
	re_node_set_init_empty (dest);
Packit 1ac44c
      return REG_NOERROR;
Packit 1ac44c
    }
Packit 1ac44c
  for (i1 = i2 = id = 0 ; i1 < src1->nelem && i2 < src2->nelem ;)
Packit 1ac44c
    {
Packit 1ac44c
      if (src1->elems[i1] > src2->elems[i2])
Packit 1ac44c
	{
Packit 1ac44c
	  dest->elems[id++] = src2->elems[i2++];
Packit 1ac44c
	  continue;
Packit 1ac44c
	}
Packit 1ac44c
      if (src1->elems[i1] == src2->elems[i2])
Packit 1ac44c
	++i2;
Packit 1ac44c
      dest->elems[id++] = src1->elems[i1++];
Packit 1ac44c
    }
Packit 1ac44c
  if (i1 < src1->nelem)
Packit 1ac44c
    {
Packit 1ac44c
      memcpy (dest->elems + id, src1->elems + i1,
Packit 1ac44c
	     (src1->nelem - i1) * sizeof (Idx));
Packit 1ac44c
      id += src1->nelem - i1;
Packit 1ac44c
    }
Packit 1ac44c
  else if (i2 < src2->nelem)
Packit 1ac44c
    {
Packit 1ac44c
      memcpy (dest->elems + id, src2->elems + i2,
Packit 1ac44c
	     (src2->nelem - i2) * sizeof (Idx));
Packit 1ac44c
      id += src2->nelem - i2;
Packit 1ac44c
    }
Packit 1ac44c
  dest->nelem = id;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Calculate the union set of the sets DEST and SRC. And store it to
Packit 1ac44c
   DEST. Return value indicate the error code or REG_NOERROR if succeeded.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_merge (re_node_set *dest, const re_node_set *src)
Packit 1ac44c
{
Packit 1ac44c
  Idx is, id, sbase, delta;
Packit 1ac44c
  if (src == NULL || src->nelem == 0)
Packit 1ac44c
    return REG_NOERROR;
Packit 1ac44c
  if (dest->alloc < 2 * src->nelem + dest->nelem)
Packit 1ac44c
    {
Packit 1ac44c
      Idx new_alloc = 2 * (src->nelem + dest->alloc);
Packit 1ac44c
      Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc);
Packit 1ac44c
      if (BE (new_buffer == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
      dest->elems = new_buffer;
Packit 1ac44c
      dest->alloc = new_alloc;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  if (BE (dest->nelem == 0, 0))
Packit 1ac44c
    {
Packit 1ac44c
      dest->nelem = src->nelem;
Packit 1ac44c
      memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
Packit 1ac44c
      return REG_NOERROR;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Copy into the top of DEST the items of SRC that are not
Packit 1ac44c
     found in DEST.  Maybe we could binary search in DEST?  */
Packit 1ac44c
  for (sbase = dest->nelem + 2 * src->nelem,
Packit 1ac44c
       is = src->nelem - 1, id = dest->nelem - 1; is >= 0 && id >= 0; )
Packit 1ac44c
    {
Packit 1ac44c
      if (dest->elems[id] == src->elems[is])
Packit 1ac44c
	is--, id--;
Packit 1ac44c
      else if (dest->elems[id] < src->elems[is])
Packit 1ac44c
	dest->elems[--sbase] = src->elems[is--];
Packit 1ac44c
      else /* if (dest->elems[id] > src->elems[is]) */
Packit 1ac44c
	--id;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  if (is >= 0)
Packit 1ac44c
    {
Packit 1ac44c
      /* If DEST is exhausted, the remaining items of SRC must be unique.  */
Packit 1ac44c
      sbase -= is + 1;
Packit 1ac44c
      memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx));
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  id = dest->nelem - 1;
Packit 1ac44c
  is = dest->nelem + 2 * src->nelem - 1;
Packit 1ac44c
  delta = is - sbase + 1;
Packit 1ac44c
  if (delta == 0)
Packit 1ac44c
    return REG_NOERROR;
Packit 1ac44c
Packit 1ac44c
  /* Now copy.  When DELTA becomes zero, the remaining
Packit 1ac44c
     DEST elements are already in place.  */
Packit 1ac44c
  dest->nelem += delta;
Packit 1ac44c
  for (;;)
Packit 1ac44c
    {
Packit 1ac44c
      if (dest->elems[is] > dest->elems[id])
Packit 1ac44c
	{
Packit 1ac44c
	  /* Copy from the top.  */
Packit 1ac44c
	  dest->elems[id + delta--] = dest->elems[is--];
Packit 1ac44c
	  if (delta == 0)
Packit 1ac44c
	    break;
Packit 1ac44c
	}
Packit 1ac44c
      else
Packit 1ac44c
	{
Packit 1ac44c
	  /* Slide from the bottom.  */
Packit 1ac44c
	  dest->elems[id + delta] = dest->elems[id];
Packit 1ac44c
	  if (--id < 0)
Packit 1ac44c
	    {
Packit 1ac44c
	      /* Copy remaining SRC elements.  */
Packit 1ac44c
	      memcpy (dest->elems, dest->elems + sbase,
Packit 1ac44c
		      delta * sizeof (Idx));
Packit 1ac44c
	      break;
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Insert the new element ELEM to the re_node_set* SET.
Packit 1ac44c
   SET should not already have ELEM.
Packit 1ac44c
   Return true if successful.  */
Packit 1ac44c
Packit 1ac44c
static bool
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_insert (re_node_set *set, Idx elem)
Packit 1ac44c
{
Packit 1ac44c
  Idx idx;
Packit 1ac44c
  /* In case the set is empty.  */
Packit 1ac44c
  if (set->alloc == 0)
Packit 1ac44c
    return BE (re_node_set_init_1 (set, elem) == REG_NOERROR, 1);
Packit 1ac44c
Packit 1ac44c
  if (BE (set->nelem, 0) == 0)
Packit 1ac44c
    {
Packit 1ac44c
      /* We already guaranteed above that set->alloc != 0.  */
Packit 1ac44c
      set->elems[0] = elem;
Packit 1ac44c
      ++set->nelem;
Packit 1ac44c
      return true;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Realloc if we need.  */
Packit 1ac44c
  if (set->alloc == set->nelem)
Packit 1ac44c
    {
Packit 1ac44c
      Idx *new_elems;
Packit 1ac44c
      set->alloc = set->alloc * 2;
Packit 1ac44c
      new_elems = re_realloc (set->elems, Idx, set->alloc);
Packit 1ac44c
      if (BE (new_elems == NULL, 0))
Packit 1ac44c
	return false;
Packit 1ac44c
      set->elems = new_elems;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Move the elements which follows the new element.  Test the
Packit 1ac44c
     first element separately to skip a check in the inner loop.  */
Packit 1ac44c
  if (elem < set->elems[0])
Packit 1ac44c
    {
Packit 1ac44c
      idx = 0;
Packit 1ac44c
      for (idx = set->nelem; idx > 0; idx--)
Packit 1ac44c
	set->elems[idx] = set->elems[idx - 1];
Packit 1ac44c
    }
Packit 1ac44c
  else
Packit 1ac44c
    {
Packit 1ac44c
      for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
Packit 1ac44c
	set->elems[idx] = set->elems[idx - 1];
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Insert the new element.  */
Packit 1ac44c
  set->elems[idx] = elem;
Packit 1ac44c
  ++set->nelem;
Packit 1ac44c
  return true;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Insert the new element ELEM to the re_node_set* SET.
Packit 1ac44c
   SET should not already have any element greater than or equal to ELEM.
Packit 1ac44c
   Return true if successful.  */
Packit 1ac44c
Packit 1ac44c
static bool
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_node_set_insert_last (re_node_set *set, Idx elem)
Packit 1ac44c
{
Packit 1ac44c
  /* Realloc if we need.  */
Packit 1ac44c
  if (set->alloc == set->nelem)
Packit 1ac44c
    {
Packit 1ac44c
      Idx *new_elems;
Packit 1ac44c
      set->alloc = (set->alloc + 1) * 2;
Packit 1ac44c
      new_elems = re_realloc (set->elems, Idx, set->alloc);
Packit 1ac44c
      if (BE (new_elems == NULL, 0))
Packit 1ac44c
	return false;
Packit 1ac44c
      set->elems = new_elems;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* Insert the new element.  */
Packit 1ac44c
  set->elems[set->nelem++] = elem;
Packit 1ac44c
  return true;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Compare two node sets SET1 and SET2.
Packit 1ac44c
   Return true if SET1 and SET2 are equivalent.  */
Packit 1ac44c
Packit 1ac44c
static bool
Packit 1ac44c
__attribute__ ((pure))
Packit 1ac44c
re_node_set_compare (const re_node_set *set1, const re_node_set *set2)
Packit 1ac44c
{
Packit 1ac44c
  Idx i;
Packit 1ac44c
  if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
Packit 1ac44c
    return false;
Packit 1ac44c
  for (i = set1->nelem ; --i >= 0 ; )
Packit 1ac44c
    if (set1->elems[i] != set2->elems[i])
Packit 1ac44c
      return false;
Packit 1ac44c
  return true;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Return (idx + 1) if SET contains the element ELEM, return 0 otherwise.  */
Packit 1ac44c
Packit 1ac44c
static Idx
Packit 1ac44c
__attribute__ ((pure))
Packit 1ac44c
re_node_set_contains (const re_node_set *set, Idx elem)
Packit 1ac44c
{
Packit 1ac44c
  __re_size_t idx, right, mid;
Packit 1ac44c
  if (set->nelem <= 0)
Packit 1ac44c
    return 0;
Packit 1ac44c
Packit 1ac44c
  /* Binary search the element.  */
Packit 1ac44c
  idx = 0;
Packit 1ac44c
  right = set->nelem - 1;
Packit 1ac44c
  while (idx < right)
Packit 1ac44c
    {
Packit 1ac44c
      mid = (idx + right) / 2;
Packit 1ac44c
      if (set->elems[mid] < elem)
Packit 1ac44c
	idx = mid + 1;
Packit 1ac44c
      else
Packit 1ac44c
	right = mid;
Packit 1ac44c
    }
Packit 1ac44c
  return set->elems[idx] == elem ? idx + 1 : 0;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
re_node_set_remove_at (re_node_set *set, Idx idx)
Packit 1ac44c
{
Packit 1ac44c
  if (idx < 0 || idx >= set->nelem)
Packit 1ac44c
    return;
Packit 1ac44c
  --set->nelem;
Packit 1ac44c
  for (; idx < set->nelem; idx++)
Packit 1ac44c
    set->elems[idx] = set->elems[idx + 1];
Packit 1ac44c
}
Packit 1ac44c

Packit 1ac44c
Packit 1ac44c
/* Add the token TOKEN to dfa->nodes, and return the index of the token.
Packit 1ac44c
   Or return -1 if an error occurred.  */
Packit 1ac44c
Packit 1ac44c
static Idx
Packit 1ac44c
re_dfa_add_node (re_dfa_t *dfa, re_token_t token)
Packit 1ac44c
{
Packit 1ac44c
  if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
Packit 1ac44c
    {
Packit 1ac44c
      size_t new_nodes_alloc = dfa->nodes_alloc * 2;
Packit 1ac44c
      Idx *new_nexts, *new_indices;
Packit 1ac44c
      re_node_set *new_edests, *new_eclosures;
Packit 1ac44c
      re_token_t *new_nodes;
Packit 1ac44c
Packit 1ac44c
      /* Avoid overflows in realloc.  */
Packit 1ac44c
      const size_t max_object_size = MAX (sizeof (re_token_t),
Packit 1ac44c
					  MAX (sizeof (re_node_set),
Packit 1ac44c
					       sizeof (Idx)));
Packit 1ac44c
      if (BE (MIN (IDX_MAX, SIZE_MAX / max_object_size) < new_nodes_alloc, 0))
Packit 1ac44c
	return -1;
Packit 1ac44c
Packit 1ac44c
      new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
Packit 1ac44c
      if (BE (new_nodes == NULL, 0))
Packit 1ac44c
	return -1;
Packit 1ac44c
      dfa->nodes = new_nodes;
Packit 1ac44c
      new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc);
Packit 1ac44c
      new_indices = re_realloc (dfa->org_indices, Idx, new_nodes_alloc);
Packit 1ac44c
      new_edests = re_realloc (dfa->edests, re_node_set, new_nodes_alloc);
Packit 1ac44c
      new_eclosures = re_realloc (dfa->eclosures, re_node_set, new_nodes_alloc);
Packit 1ac44c
      if (BE (new_nexts == NULL || new_indices == NULL
Packit 1ac44c
	      || new_edests == NULL || new_eclosures == NULL, 0))
Packit 1ac44c
	{
Packit 1ac44c
	   re_free (new_nexts);
Packit 1ac44c
	   re_free (new_indices);
Packit 1ac44c
	   re_free (new_edests);
Packit 1ac44c
	   re_free (new_eclosures);
Packit 1ac44c
	   return -1;
Packit 1ac44c
	}
Packit 1ac44c
      dfa->nexts = new_nexts;
Packit 1ac44c
      dfa->org_indices = new_indices;
Packit 1ac44c
      dfa->edests = new_edests;
Packit 1ac44c
      dfa->eclosures = new_eclosures;
Packit 1ac44c
      dfa->nodes_alloc = new_nodes_alloc;
Packit 1ac44c
    }
Packit 1ac44c
  dfa->nodes[dfa->nodes_len] = token;
Packit 1ac44c
  dfa->nodes[dfa->nodes_len].constraint = 0;
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
  dfa->nodes[dfa->nodes_len].accept_mb =
Packit 1ac44c
    ((token.type == OP_PERIOD && dfa->mb_cur_max > 1)
Packit 1ac44c
     || token.type == COMPLEX_BRACKET);
Packit 1ac44c
#endif
Packit 1ac44c
  dfa->nexts[dfa->nodes_len] = -1;
Packit 1ac44c
  re_node_set_init_empty (dfa->edests + dfa->nodes_len);
Packit 1ac44c
  re_node_set_init_empty (dfa->eclosures + dfa->nodes_len);
Packit 1ac44c
  return dfa->nodes_len++;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static re_hashval_t
Packit 1ac44c
calc_state_hash (const re_node_set *nodes, unsigned int context)
Packit 1ac44c
{
Packit 1ac44c
  re_hashval_t hash = nodes->nelem + context;
Packit 1ac44c
  Idx i;
Packit 1ac44c
  for (i = 0 ; i < nodes->nelem ; i++)
Packit 1ac44c
    hash += nodes->elems[i];
Packit 1ac44c
  return hash;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Search for the state whose node_set is equivalent to NODES.
Packit 1ac44c
   Return the pointer to the state, if we found it in the DFA.
Packit 1ac44c
   Otherwise create the new one and return it.  In case of an error
Packit 1ac44c
   return NULL and set the error code in ERR.
Packit 1ac44c
   Note: - We assume NULL as the invalid state, then it is possible that
Packit 1ac44c
	   return value is NULL and ERR is REG_NOERROR.
Packit 1ac44c
	 - We never return non-NULL value in case of any errors, it is for
Packit 1ac44c
	   optimization.  */
Packit 1ac44c
Packit 1ac44c
static re_dfastate_t *
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa,
Packit 1ac44c
		  const re_node_set *nodes)
Packit 1ac44c
{
Packit 1ac44c
  re_hashval_t hash;
Packit 1ac44c
  re_dfastate_t *new_state;
Packit 1ac44c
  struct re_state_table_entry *spot;
Packit 1ac44c
  Idx i;
Packit 1ac44c
#if defined GCC_LINT || defined lint
Packit 1ac44c
  /* Suppress bogus uninitialized-variable warnings.  */
Packit 1ac44c
  *err = REG_NOERROR;
Packit 1ac44c
#endif
Packit 1ac44c
  if (BE (nodes->nelem == 0, 0))
Packit 1ac44c
    {
Packit 1ac44c
      *err = REG_NOERROR;
Packit 1ac44c
      return NULL;
Packit 1ac44c
    }
Packit 1ac44c
  hash = calc_state_hash (nodes, 0);
Packit 1ac44c
  spot = dfa->state_table + (hash & dfa->state_hash_mask);
Packit 1ac44c
Packit 1ac44c
  for (i = 0 ; i < spot->num ; i++)
Packit 1ac44c
    {
Packit 1ac44c
      re_dfastate_t *state = spot->array[i];
Packit 1ac44c
      if (hash != state->hash)
Packit 1ac44c
	continue;
Packit 1ac44c
      if (re_node_set_compare (&state->nodes, nodes))
Packit 1ac44c
	return state;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  /* There are no appropriate state in the dfa, create the new one.  */
Packit 1ac44c
  new_state = create_ci_newstate (dfa, nodes, hash);
Packit 1ac44c
  if (BE (new_state == NULL, 0))
Packit 1ac44c
    *err = REG_ESPACE;
Packit 1ac44c
Packit 1ac44c
  return new_state;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Search for the state whose node_set is equivalent to NODES and
Packit 1ac44c
   whose context is equivalent to CONTEXT.
Packit 1ac44c
   Return the pointer to the state, if we found it in the DFA.
Packit 1ac44c
   Otherwise create the new one and return it.  In case of an error
Packit 1ac44c
   return NULL and set the error code in ERR.
Packit 1ac44c
   Note: - We assume NULL as the invalid state, then it is possible that
Packit 1ac44c
	   return value is NULL and ERR is REG_NOERROR.
Packit 1ac44c
	 - We never return non-NULL value in case of any errors, it is for
Packit 1ac44c
	   optimization.  */
Packit 1ac44c
Packit 1ac44c
static re_dfastate_t *
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa,
Packit 1ac44c
			  const re_node_set *nodes, unsigned int context)
Packit 1ac44c
{
Packit 1ac44c
  re_hashval_t hash;
Packit 1ac44c
  re_dfastate_t *new_state;
Packit 1ac44c
  struct re_state_table_entry *spot;
Packit 1ac44c
  Idx i;
Packit 1ac44c
#if defined GCC_LINT || defined lint
Packit 1ac44c
  /* Suppress bogus uninitialized-variable warnings.  */
Packit 1ac44c
  *err = REG_NOERROR;
Packit 1ac44c
#endif
Packit 1ac44c
  if (nodes->nelem == 0)
Packit 1ac44c
    {
Packit 1ac44c
      *err = REG_NOERROR;
Packit 1ac44c
      return NULL;
Packit 1ac44c
    }
Packit 1ac44c
  hash = calc_state_hash (nodes, context);
Packit 1ac44c
  spot = dfa->state_table + (hash & dfa->state_hash_mask);
Packit 1ac44c
Packit 1ac44c
  for (i = 0 ; i < spot->num ; i++)
Packit 1ac44c
    {
Packit 1ac44c
      re_dfastate_t *state = spot->array[i];
Packit 1ac44c
      if (state->hash == hash
Packit 1ac44c
	  && state->context == context
Packit 1ac44c
	  && re_node_set_compare (state->entrance_nodes, nodes))
Packit 1ac44c
	return state;
Packit 1ac44c
    }
Packit 1ac44c
  /* There are no appropriate state in 'dfa', create the new one.  */
Packit 1ac44c
  new_state = create_cd_newstate (dfa, nodes, context, hash);
Packit 1ac44c
  if (BE (new_state == NULL, 0))
Packit 1ac44c
    *err = REG_ESPACE;
Packit 1ac44c
Packit 1ac44c
  return new_state;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Finish initialization of the new state NEWSTATE, and using its hash value
Packit 1ac44c
   HASH put in the appropriate bucket of DFA's state table.  Return value
Packit 1ac44c
   indicates the error code if failed.  */
Packit 1ac44c
Packit 1ac44c
static reg_errcode_t
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
register_state (const re_dfa_t *dfa, re_dfastate_t *newstate,
Packit 1ac44c
		re_hashval_t hash)
Packit 1ac44c
{
Packit 1ac44c
  struct re_state_table_entry *spot;
Packit 1ac44c
  reg_errcode_t err;
Packit 1ac44c
  Idx i;
Packit 1ac44c
Packit 1ac44c
  newstate->hash = hash;
Packit 1ac44c
  err = re_node_set_alloc (&newstate->non_eps_nodes, newstate->nodes.nelem);
Packit 1ac44c
  if (BE (err != REG_NOERROR, 0))
Packit 1ac44c
    return REG_ESPACE;
Packit 1ac44c
  for (i = 0; i < newstate->nodes.nelem; i++)
Packit 1ac44c
    {
Packit 1ac44c
      Idx elem = newstate->nodes.elems[i];
Packit 1ac44c
      if (!IS_EPSILON_NODE (dfa->nodes[elem].type))
Packit 1ac44c
	if (! re_node_set_insert_last (&newstate->non_eps_nodes, elem))
Packit 1ac44c
	  return REG_ESPACE;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  spot = dfa->state_table + (hash & dfa->state_hash_mask);
Packit 1ac44c
  if (BE (spot->alloc <= spot->num, 0))
Packit 1ac44c
    {
Packit 1ac44c
      Idx new_alloc = 2 * spot->num + 2;
Packit 1ac44c
      re_dfastate_t **new_array = re_realloc (spot->array, re_dfastate_t *,
Packit 1ac44c
					      new_alloc);
Packit 1ac44c
      if (BE (new_array == NULL, 0))
Packit 1ac44c
	return REG_ESPACE;
Packit 1ac44c
      spot->array = new_array;
Packit 1ac44c
      spot->alloc = new_alloc;
Packit 1ac44c
    }
Packit 1ac44c
  spot->array[spot->num++] = newstate;
Packit 1ac44c
  return REG_NOERROR;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
static void
Packit 1ac44c
free_state (re_dfastate_t *state)
Packit 1ac44c
{
Packit 1ac44c
  re_node_set_free (&state->non_eps_nodes);
Packit 1ac44c
  re_node_set_free (&state->inveclosure);
Packit 1ac44c
  if (state->entrance_nodes != &state->nodes)
Packit 1ac44c
    {
Packit 1ac44c
      re_node_set_free (state->entrance_nodes);
Packit 1ac44c
      re_free (state->entrance_nodes);
Packit 1ac44c
    }
Packit 1ac44c
  re_node_set_free (&state->nodes);
Packit 1ac44c
  re_free (state->word_trtable);
Packit 1ac44c
  re_free (state->trtable);
Packit 1ac44c
  re_free (state);
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Create the new state which is independent of contexts.
Packit 1ac44c
   Return the new state if succeeded, otherwise return NULL.  */
Packit 1ac44c
Packit 1ac44c
static re_dfastate_t *
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
Packit 1ac44c
		    re_hashval_t hash)
Packit 1ac44c
{
Packit 1ac44c
  Idx i;
Packit 1ac44c
  reg_errcode_t err;
Packit 1ac44c
  re_dfastate_t *newstate;
Packit 1ac44c
Packit 1ac44c
  newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
Packit 1ac44c
  if (BE (newstate == NULL, 0))
Packit 1ac44c
    return NULL;
Packit 1ac44c
  err = re_node_set_init_copy (&newstate->nodes, nodes);
Packit 1ac44c
  if (BE (err != REG_NOERROR, 0))
Packit 1ac44c
    {
Packit 1ac44c
      re_free (newstate);
Packit 1ac44c
      return NULL;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  newstate->entrance_nodes = &newstate->nodes;
Packit 1ac44c
  for (i = 0 ; i < nodes->nelem ; i++)
Packit 1ac44c
    {
Packit 1ac44c
      re_token_t *node = dfa->nodes + nodes->elems[i];
Packit 1ac44c
      re_token_type_t type = node->type;
Packit 1ac44c
      if (type == CHARACTER && !node->constraint)
Packit 1ac44c
	continue;
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
      newstate->accept_mb |= node->accept_mb;
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
Packit 1ac44c
      /* If the state has the halt node, the state is a halt state.  */
Packit 1ac44c
      if (type == END_OF_RE)
Packit 1ac44c
	newstate->halt = 1;
Packit 1ac44c
      else if (type == OP_BACK_REF)
Packit 1ac44c
	newstate->has_backref = 1;
Packit 1ac44c
      else if (type == ANCHOR || node->constraint)
Packit 1ac44c
	newstate->has_constraint = 1;
Packit 1ac44c
    }
Packit 1ac44c
  err = register_state (dfa, newstate, hash);
Packit 1ac44c
  if (BE (err != REG_NOERROR, 0))
Packit 1ac44c
    {
Packit 1ac44c
      free_state (newstate);
Packit 1ac44c
      newstate = NULL;
Packit 1ac44c
    }
Packit 1ac44c
  return newstate;
Packit 1ac44c
}
Packit 1ac44c
Packit 1ac44c
/* Create the new state which is depend on the context CONTEXT.
Packit 1ac44c
   Return the new state if succeeded, otherwise return NULL.  */
Packit 1ac44c
Packit 1ac44c
static re_dfastate_t *
Packit 1ac44c
__attribute_warn_unused_result__
Packit 1ac44c
create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes,
Packit 1ac44c
		    unsigned int context, re_hashval_t hash)
Packit 1ac44c
{
Packit 1ac44c
  Idx i, nctx_nodes = 0;
Packit 1ac44c
  reg_errcode_t err;
Packit 1ac44c
  re_dfastate_t *newstate;
Packit 1ac44c
Packit 1ac44c
  newstate = (re_dfastate_t *) calloc (sizeof (re_dfastate_t), 1);
Packit 1ac44c
  if (BE (newstate == NULL, 0))
Packit 1ac44c
    return NULL;
Packit 1ac44c
  err = re_node_set_init_copy (&newstate->nodes, nodes);
Packit 1ac44c
  if (BE (err != REG_NOERROR, 0))
Packit 1ac44c
    {
Packit 1ac44c
      re_free (newstate);
Packit 1ac44c
      return NULL;
Packit 1ac44c
    }
Packit 1ac44c
Packit 1ac44c
  newstate->context = context;
Packit 1ac44c
  newstate->entrance_nodes = &newstate->nodes;
Packit 1ac44c
Packit 1ac44c
  for (i = 0 ; i < nodes->nelem ; i++)
Packit 1ac44c
    {
Packit 1ac44c
      re_token_t *node = dfa->nodes + nodes->elems[i];
Packit 1ac44c
      re_token_type_t type = node->type;
Packit 1ac44c
      unsigned int constraint = node->constraint;
Packit 1ac44c
Packit 1ac44c
      if (type == CHARACTER && !constraint)
Packit 1ac44c
	continue;
Packit 1ac44c
#ifdef RE_ENABLE_I18N
Packit 1ac44c
      newstate->accept_mb |= node->accept_mb;
Packit 1ac44c
#endif /* RE_ENABLE_I18N */
Packit 1ac44c
Packit 1ac44c
      /* If the state has the halt node, the state is a halt state.  */
Packit 1ac44c
      if (type == END_OF_RE)
Packit 1ac44c
	newstate->halt = 1;
Packit 1ac44c
      else if (type == OP_BACK_REF)
Packit 1ac44c
	newstate->has_backref = 1;
Packit 1ac44c
Packit 1ac44c
      if (constraint)
Packit 1ac44c
	{
Packit 1ac44c
	  if (newstate->entrance_nodes == &newstate->nodes)
Packit 1ac44c
	    {
Packit 1ac44c
	      newstate->entrance_nodes = re_malloc (re_node_set, 1);
Packit 1ac44c
	      if (BE (newstate->entrance_nodes == NULL, 0))
Packit 1ac44c
		{
Packit 1ac44c
		  free_state (newstate);
Packit 1ac44c
		  return NULL;
Packit 1ac44c
		}
Packit 1ac44c
	      if (re_node_set_init_copy (newstate->entrance_nodes, nodes)
Packit 1ac44c
		  != REG_NOERROR)
Packit 1ac44c
		return NULL;
Packit 1ac44c
	      nctx_nodes = 0;
Packit 1ac44c
	      newstate->has_constraint = 1;
Packit 1ac44c
	    }
Packit 1ac44c
Packit 1ac44c
	  if (NOT_SATISFY_PREV_CONSTRAINT (constraint,context))
Packit 1ac44c
	    {
Packit 1ac44c
	      re_node_set_remove_at (&newstate->nodes, i - nctx_nodes);
Packit 1ac44c
	      ++nctx_nodes;
Packit 1ac44c
	    }
Packit 1ac44c
	}
Packit 1ac44c
    }
Packit 1ac44c
  err = register_state (dfa, newstate, hash);
Packit 1ac44c
  if (BE (err != REG_NOERROR, 0))
Packit 1ac44c
    {
Packit 1ac44c
      free_state (newstate);
Packit 1ac44c
      newstate = NULL;
Packit 1ac44c
    }
Packit 1ac44c
  return  newstate;
Packit 1ac44c
}