if (dfa->nodes_len >= dfa->nodes_alloc)
if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
re_dfa_add_node (dfa, token, mode)     re_dfa_t *dfa;     re_token_t token;     int mode;{  if (dfa->nodes_len >= dfa->nodes_alloc)    {      re_token_t *new_array;      dfa->nodes_alloc *= 2;      new_array = re_realloc (dfa->nodes, re_token_t, dfa->nodes_alloc);      if (BE (new_array == NULL, 0))	return -1;      else	dfa->nodes = new_array;      if (mode)	{	  int *new_nexts, *new_indices;	  re_node_set *new_edests, *new_eclosures, *new_inveclosures;	  new_nexts = re_realloc (dfa->nexts, int, dfa->nodes_alloc);	  new_indices = re_realloc (dfa->org_indices, int, dfa->nodes_alloc);	  new_edests = re_realloc (dfa->edests, re_node_set, dfa->nodes_alloc);	  new_eclosures = re_realloc (dfa->eclosures, re_node_set,				      dfa->nodes_alloc);	  new_inveclosures = re_realloc (dfa->inveclosures, re_node_set,					 dfa->nodes_alloc);	  if (BE (new_nexts == NULL || new_indices == NULL		  || new_edests == NULL || new_eclosures == NULL		  || new_inveclosures == NULL, 0))	    return -1;	  dfa->nexts = new_nexts;	  dfa->org_indices = new_indices;	  dfa->edests = new_edests;	  dfa->eclosures = new_eclosures;	  dfa->inveclosures = new_inveclosures;	}    }  dfa->nodes[dfa->nodes_len] = token;  dfa->nodes[dfa->nodes_len].duplicated = 0;  dfa->nodes[dfa->nodes_len].constraint = 0;  return dfa->nodes_len++;}