ret = build_charclass (mbcset, sbcset, &alloc, "alpha");
ret = build_charclass (mbcset, sbcset, &alloc, "alpha", 0);
build_word_op (dfa, not, err)     re_dfa_t *dfa;     int not;     reg_errcode_t *err;{  re_bitset_ptr_t sbcset;  re_charset_t *mbcset;  reg_errcode_t ret;  re_token_t br_token;  bin_tree_t *tree;  int new_idx, alloc = 0;  sbcset = (re_bitset_ptr_t) calloc (sizeof (unsigned int), BITSET_UINTS);  mbcset = (re_charset_t *) calloc (sizeof (re_charset_t), 1);  if (BE (sbcset == NULL || mbcset == NULL, 0))    {      *err = REG_ESPACE;      return NULL;    }  if (not)    {      int i;      mbcset->non_match = 1;      /*      if (syntax & RE_HAT_LISTS_NOT_NEWLINE)        bitset_set(cset->sbcset, '\0');      */      if (MB_CUR_MAX > 1)        for (i = 0; i < SBC_MAX; ++i)          if (__btowc (i) == WEOF)            bitset_set (sbcset, i);    }  ret = build_charclass (mbcset, sbcset, &alloc, "alpha");  if (BE (ret != REG_NOERROR, 0))    {      re_free (sbcset);      free_charset (mbcset);      *err = REG_ESPACE;      return NULL;    }  /* If it is non-matching list.  */  if (mbcset->non_match)    bitset_not (sbcset);  /* Build a tree for simple bracket.  */  br_token.type = SIMPLE_BRACKET;  br_token.opr.sbcset = sbcset;  new_idx = re_dfa_add_node (dfa, br_token, 0);  tree = create_tree (NULL, NULL, 0, new_idx);  if (BE (new_idx == -1 || tree == NULL, 0))    goto build_word_op_espace;  if (MB_CUR_MAX > 1)    {      re_token_t alt_token;      bin_tree_t *mbc_tree;      /* Build a tree for complex bracket.  */      br_token.type = COMPLEX_BRACKET;      br_token.opr.mbcset = mbcset;      dfa->has_mb_node = 1;      new_idx = re_dfa_add_node (dfa, br_token, 0);      mbc_tree = create_tree (NULL, NULL, 0, new_idx);      if (BE (new_idx == -1 || mbc_tree == NULL, 0))        goto build_word_op_espace;      /* Then join them by ALT node.  */      alt_token.type = OP_ALT;      new_idx = re_dfa_add_node (dfa, alt_token, 0);      tree = create_tree (tree, mbc_tree, 0, new_idx);      if (BE (new_idx != -1 && mbc_tree != NULL, 1))        return tree;    }  else    {      free_charset (mbcset);      return tree;    } build_word_op_espace:  re_free (sbcset);  free_charset (mbcset);  *err = REG_ESPACE;  return NULL;}