{  dfa->subexps = NULL; dfa->state_table = NULL; dfa->nodes = NULL; return REG_ESPACE; }
return REG_ESPACE;
init_dfa (dfa, pat_len)     re_dfa_t *dfa;     int pat_len;{  int table_size;  memset (dfa, '\0', sizeof (re_dfa_t));  dfa->nodes_alloc = pat_len + 1;  dfa->nodes = re_malloc (re_token_t, dfa->nodes_alloc);  dfa->states_alloc = pat_len + 1;  /*  table_size = 2 ^ ceil(log pat_len) */  for (table_size = 1; table_size > 0; table_size <<= 1)    if (table_size > pat_len)      break;  dfa->state_table = calloc (sizeof (struct re_state_table_entry), table_size);  dfa->state_hash_mask = table_size - 1;  dfa->subexps_alloc = 1;  dfa->subexps = re_malloc (re_subexp_t, dfa->subexps_alloc);  dfa->word_char = NULL;  dfa->mb_cur_max = MB_CUR_MAX;#ifdef _LIBC  if (dfa->mb_cur_max > 1      && strcmp (_NL_CURRENT (LC_CTYPE, _NL_CTYPE_CODESET_NAME), "UTF-8") == 0)    dfa->is_utf8 = 1;  dfa->map_notascii = (_NL_CURRENT_WORD (LC_CTYPE, _NL_CTYPE_MAP_TO_NONASCII)		       != 0);#endif  if (BE (dfa->nodes == NULL || dfa->state_table == NULL	  || dfa->subexps == NULL, 0))    {      /* We don't bother to free anything which was allocated.  Very	 soon the process will go down anyway.  */      dfa->subexps = NULL;      dfa->state_table = NULL;      dfa->nodes = NULL;      return REG_ESPACE;    }  return REG_NOERROR;}