diff options
author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2016-06-17 07:38:17 +0200 |
---|---|---|
committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2016-06-22 14:37:11 +0200 |
commit | 768c483b7063025dfd130b29dc3466b6360042e0 (patch) | |
tree | fbddff076e67f787bb21c4c8d82dcc50a6cc1335 /cpukit/score/include/rtems/score/rbtree.h | |
parent | score: Rework EDF scheduler (diff) | |
download | rtems-768c483b7063025dfd130b29dc3466b6360042e0.tar.bz2 |
score: Move _RBTree_Insert()
The _RBTree_Insert() is no longer used in the score. Move it to sapi
and make it rtems_rbtree_insert().
Diffstat (limited to '')
-rw-r--r-- | cpukit/score/include/rtems/score/rbtree.h | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h index dd56f1bca4..f0590c0904 100644 --- a/cpukit/score/include/rtems/score/rbtree.h +++ b/cpukit/score/include/rtems/score/rbtree.h @@ -117,29 +117,6 @@ RBTree_Node *_RBTree_Find( ); /** - * @brief Inserts the node into the red-black tree. - * - * In case the node is already a node of a tree, then this function yields - * unpredictable results. - * - * @param[in] the_rbtree The red-black tree control. - * @param[in] the_node The node to insert. - * @param[in] compare The node compare function. - * @param[in] is_unique If true, then reject nodes with a duplicate key, else - * insert nodes in FIFO order in case the key value is equal to existing nodes. - * - * @retval NULL Successfully inserted. - * @retval existing_node This is a unique insert and there exists a node with - * an equal key in the tree already. - */ -RBTree_Node *_RBTree_Insert( - RBTree_Control *the_rbtree, - RBTree_Node *the_node, - RBTree_Compare compare, - bool is_unique -); - -/** * @brief Rebalances the red-black tree after insertion of the node. * * @param[in] the_rbtree The red-black tree control. |