summaryrefslogtreecommitdiffstats
path: root/cpukit/sapi/inline
diff options
context:
space:
mode:
authorSebastian Huber <sebastian.huber@embedded-brains.de>2012-04-10 10:25:14 +0200
committerSebastian Huber <sebastian.huber@embedded-brains.de>2012-04-11 11:24:18 +0200
commitdc62a48cc5fc95f9bbe7ab2ed2712b70987bde6f (patch)
treeed98e81b6edd2b670c7a29f6004ef9e289d89fa3 /cpukit/sapi/inline
parentPR2052: LEON3: fix open_eth interrupt initialization bug (diff)
downloadrtems-dc62a48cc5fc95f9bbe7ab2ed2712b70987bde6f.tar.bz2
rbtree: PR1995: API change
New functions o _RBTree_Next_unprotected(), o _RBTree_Next(), o _RBTree_Successor_unprotected(), o _RBTree_Predecessor_unprotected(), o rtems_rbtree_successor_unprotected(), and o rtems_rbtree_predecessor_unprotected(). Change prototype of o _RBTree_Successor(), o _RBTree_Predecessor(), o rtems_rbtree_successor(), and o rtems_rbtree_predecessor().
Diffstat (limited to 'cpukit/sapi/inline')
-rw-r--r--cpukit/sapi/inline/rtems/rbtree.inl44
1 files changed, 32 insertions, 12 deletions
diff --git a/cpukit/sapi/inline/rtems/rbtree.inl b/cpukit/sapi/inline/rtems/rbtree.inl
index 259a586fd1..1a2e99e30b 100644
--- a/cpukit/sapi/inline/rtems/rbtree.inl
+++ b/cpukit/sapi/inline/rtems/rbtree.inl
@@ -271,28 +271,48 @@ RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_find(
return _RBTree_Find( the_rbtree, the_node );
}
-/** @brief Find the node's in-order predecessor
- *
- * This function returns a pointer to the in-order predecessor
- * of @a the_node if it exists, and NULL if not.
+/**
+ * @copydoc _RBTree_Predecessor_unprotected()
+ */
+RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_predecessor_unprotected(
+ const rtems_rbtree_control *rbtree,
+ const rtems_rbtree_node *node
+)
+{
+ return _RBTree_Predecessor_unprotected( rbtree, node );
+}
+
+/**
+ * @copydoc _RBTree_Predecessor()
*/
RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_predecessor(
- rtems_rbtree_node *the_node
+ const rtems_rbtree_control *rbtree,
+ const rtems_rbtree_node *node
)
{
- return _RBTree_Predecessor( the_node );
+ return _RBTree_Predecessor( rbtree, node );
}
-/** @brief Find the node's in-order successor
- *
- * This function returns a pointer to the in-order successor
- * of @a the_node if it exists, and NULL if not.
+/**
+ * @copydoc _RBTree_Successor_unprotected()
+ */
+RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_successor_unprotected(
+ const rtems_rbtree_control *rbtree,
+ const rtems_rbtree_node *node
+)
+{
+ return _RBTree_Successor_unprotected( rbtree, node );
+}
+
+/**
+ * @copydoc _RBTree_Successor()
*/
RTEMS_INLINE_ROUTINE rtems_rbtree_node* rtems_rbtree_successor(
- rtems_rbtree_node *the_node
+ const rtems_rbtree_control *rbtree,
+ const rtems_rbtree_node *node
)
{
- return _RBTree_Successor( the_node );
+ return _RBTree_Successor( rbtree, node );
}
/**