diff options
author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2015-08-18 06:21:17 +0200 |
---|---|---|
committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2015-09-01 09:07:08 +0200 |
commit | 509e8d7f4d683f08e1f81ec4610b93487cee7a77 (patch) | |
tree | 288313da0dc11992842e8e38acf9d26a2334d224 /cpukit/score/include/rtems/score/rbtree.h | |
parent | rbtree: Delete unused RBTREE_NODE_*() macros (diff) | |
download | rtems-509e8d7f4d683f08e1f81ec4610b93487cee7a77.tar.bz2 |
rbtree: Delete rtems_rbtree_find_control()
This function is hard to support in alternative implementations. It has
no internal use case.
Diffstat (limited to '')
-rw-r--r-- | cpukit/score/include/rtems/score/rbtree.h | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h index 3e56625c06..b44c09edb5 100644 --- a/cpukit/score/include/rtems/score/rbtree.h +++ b/cpukit/score/include/rtems/score/rbtree.h @@ -388,31 +388,6 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_root( } /** - * @brief Finds the red-black tree control given a node in the tree. - * - * In case the node is not a node of a tree, then this function yields - * unpredictable results. - * - * @param[in] the_node The node of interest. - * - * @return The red-black tree control of the node. - */ -RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_control( - const RBTree_Node *the_node -) -{ - RBTree_Node *parent = the_node->parent; - RBTree_Control *rbtree; - - do { - rbtree = (RBTree_Control *) parent; - parent = parent->parent; - } while ( parent != NULL ); - - return rbtree; -} - -/** * @brief Initialize this RBTree as empty. * * This routine initializes @a the_rbtree to contain zero nodes. |