tree = re_malloc (bin_tree_t, 1); if (BE (tree == NULL, 0))
if (BE (dfa->str_tree_storage_idx == BIN_TREE_STORAGE_SIZE, 0))
create_tree (left, right, type, index)     bin_tree_t *left;     bin_tree_t *right;     re_token_type_t type;     int index;{  bin_tree_t *tree;  tree = re_malloc (bin_tree_t, 1);  if (BE (tree == NULL, 0))    {      free_bin_tree (left);      free_bin_tree (right);      return NULL;    }  tree->parent = NULL;  tree->left = left;  tree->right = right;  tree->type = type;  tree->node_idx = index;  tree->first = -1;  tree->next = -1;  re_node_set_init_empty (&tree->eclosure);  if (left != NULL)    left->parent = tree;  if (right != NULL)    right->parent = tree;  return tree;}