| 1 |
/* |
| 2 |
** Copyright (C) 2003 by Kevin L. Mitchell <klmitch@mit.edu> |
| 3 |
** |
| 4 |
** This library is free software; you can redistribute it and/or |
| 5 |
** modify it under the terms of the GNU Library General Public |
| 6 |
** License as published by the Free Software Foundation; either |
| 7 |
** version 2 of the License, or (at your option) any later version. |
| 8 |
** |
| 9 |
** This library is distributed in the hope that it will be useful, |
| 10 |
** but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 |
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 12 |
** Library General Public License for more details. |
| 13 |
** |
| 14 |
** You should have received a copy of the GNU Library General Public |
| 15 |
** License along with this library; if not, write to the Free |
| 16 |
** Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, |
| 17 |
** MA 02111-1307, USA |
| 18 |
** |
| 19 |
** @(#)$Id: rn_init.c,v 1.1 2003/06/28 18:48:21 klmitch Exp $ |
| 20 |
*/ |
| 21 |
#include "dbprim.h" |
| 22 |
#include "dbprim_int.h" |
| 23 |
|
| 24 |
RCSTAG("@(#)$Id: rn_init.c,v 1.1 2003/06/28 18:48:21 klmitch Exp $"); |
| 25 |
|
| 26 |
/** \ingroup dbprim_rbtree |
| 27 |
* \brief Dynamically initialize a red-black tree node. |
| 28 |
* |
| 29 |
* This function dynamically initializes a red-black tree node. |
| 30 |
* |
| 31 |
* \param node A pointer to a #rb_tree_t to be initialized. |
| 32 |
* \param value A pointer to \c void which will be the value of the |
| 33 |
* red-black tree entry. |
| 34 |
* |
| 35 |
* \retval DB_ERR_BADARGS A \c NULL pointer was passed for \p |
| 36 |
* node. |
| 37 |
*/ |
| 38 |
unsigned long |
| 39 |
rn_init(rb_node_t *node, void *value) |
| 40 |
{ |
| 41 |
initialize_dbpr_error_table(); /* initialize error table */ |
| 42 |
|
| 43 |
if (!node) /* verify arguments */ |
| 44 |
return DB_ERR_BADARGS; |
| 45 |
|
| 46 |
/* initialize the node */ |
| 47 |
node->rn_color = RB_COLOR_NONE; |
| 48 |
node->rn_tree = 0; |
| 49 |
node->rn_parent = 0; |
| 50 |
node->rn_left = 0; |
| 51 |
node->rn_right = 0; |
| 52 |
node->rn_key.dk_key = 0; |
| 53 |
node->rn_key.dk_len = 0; |
| 54 |
node->rn_value = value; |
| 55 |
|
| 56 |
node->rn_magic = RB_NODE_MAGIC; /* set the magic number */ |
| 57 |
|
| 58 |
return 0; |
| 59 |
} |
