summaryrefslogtreecommitdiffstats
path: root/cpukit/score
diff options
context:
space:
mode:
authorSebastian Huber <sebastian.huber@embedded-brains.de>2015-08-18 06:21:17 +0200
committerSebastian Huber <sebastian.huber@embedded-brains.de>2015-09-01 09:06:18 +0200
commit9ccdb1dfdec1942af73af44670757a2aa422d69a (patch)
treefb3134cdd8c623c6baebe4282e93a7052b02c47b /cpukit/score
parentRespect 2^32 - 1 B NFSv2 maximum file size (diff)
downloadrtems-9ccdb1dfdec1942af73af44670757a2aa422d69a.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 'cpukit/score')
-rw-r--r--cpukit/score/include/rtems/score/rbtree.h25
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 299b75ad2c..d99d7c305d 100644
--- a/cpukit/score/include/rtems/score/rbtree.h
+++ b/cpukit/score/include/rtems/score/rbtree.h
@@ -444,31 +444,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.