---
cpukit/sapi/include/rtems/rbtree.h | 40 -------------------------
cpukit/score/include/rtems/score/rbtree.h | 50 -------------------------------
2 files changed, 90 deletions(-)
diff --git a/cpukit/sapi/include/rtems/rbtree.h
b/cpukit/sapi/include/rtems/rbtree.h
index cdef801..7e59e03 100644
--- a/cpukit/sapi/include/rtems/rbtree.h
+++ b/cpukit/sapi/include/rtems/rbtree.h
@@ -146,18 +146,6 @@ RTEMS_INLINE_ROUTINE bool rtems_rbtree_is_node_off_rbtree(
}
/**
- * @brief Is the RBTree Node Pointer NULL.
- *
- * This function returns true if @a the_node is NULL and false otherwise.
- */
-RTEMS_INLINE_ROUTINE bool rtems_rbtree_is_null_node(
- const rtems_rbtree_node *the_node
-)
-{
- return _RBTree_Is_null_node( the_node );
-}
-
-/**
* @brief Return pointer to RBTree root.
*
* This function returns a pointer to the root node of @a the_rbtree.
@@ -230,20 +218,6 @@ RTEMS_INLINE_ROUTINE rtems_rbtree_node
*rtems_rbtree_parent(
}
/**
- * @brief Are two nodes equal.
- *
- * This function returns true if @a left and @a right are equal,
- * and false otherwise.
- */
-RTEMS_INLINE_ROUTINE bool rtems_rbtree_are_nodes_equal(
- const rtems_rbtree_node *left,
- const rtems_rbtree_node *right
-)
-{
- return _RBTree_Are_nodes_equal( left, right );
-}
-
-/**
* @brief Is the RBTree empty.
*
* This function returns true if there a no nodes on @a the_rbtree and
@@ -284,20 +258,6 @@ RTEMS_INLINE_ROUTINE bool rtems_rbtree_is_max(
return _RBTree_Is_first( the_rbtree, the_node, RBT_RIGHT );
}
-
-/**
- * @brief Does this RBTree have only one node.
- *
- * This function returns true if there is only one node on @a the_rbtree and
- * false otherwise.
- */
-RTEMS_INLINE_ROUTINE bool rtems_rbtree_has_only_one_node(
- const rtems_rbtree_control *the_rbtree
-)
-{
- return _RBTree_Has_only_one_node( the_rbtree );
-}
-
/**
* @brief Is this node the RBTree root.
*
diff --git a/cpukit/score/include/rtems/score/rbtree.h
b/cpukit/score/include/rtems/score/rbtree.h
index fa52299..5a296b6 100644
--- a/cpukit/score/include/rtems/score/rbtree.h
+++ b/cpukit/score/include/rtems/score/rbtree.h
@@ -290,38 +290,6 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_node_off_rbtree(
}
/**
- * @brief Are two Nodes equal.
- *
- * This function returns true if @a left and @a right are equal,
- * and false otherwise.
- *
- * @retval true @a left and @a right are equal.
- * @retval false @a left and @a right are not equal.
- */
-RTEMS_INLINE_ROUTINE bool _RBTree_Are_nodes_equal(
- const RBTree_Node *left,
- const RBTree_Node *right
- )
-{
- return left == right;
-}
-
-/**
- * @brief Is the RBTree node pointer NUL.
- *
- * This function returns true if @a the_node is NULL and false otherwise.
- *
- * @retval true @a the_node is @c NULL.
- * @retval false @a the_node is not @c NULL.
- */
-RTEMS_INLINE_ROUTINE bool _RBTree_Is_null_node(
- const RBTree_Node *the_node
- )
-{
- return (the_node == NULL);
-}
-
-/**
* @brief Return pointer to RBTree's root node.
*
* This function returns a pointer to the root node of @a the_rbtree.
@@ -431,24 +399,6 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_first(
}
/**
- * @brief Does this RBTree have only one node.
- *
- * This function returns true if there is only one node on @a the_rbtree and
- * false otherwise.
- *
- * @retval true @a the_rbtree has only one node.
- * @retval false @a the_rbtree has more than one nodes.
- */
-RTEMS_INLINE_ROUTINE bool _RBTree_Has_only_one_node(
- const RBTree_Control *the_rbtree
- )
-{
- if(!the_rbtree) return false; /* TODO: expected behavior? */
- return (the_rbtree->root->child[RBT_LEFT] == NULL &&
- the_rbtree->root->child[RBT_RIGHT] == NULL);
-}
-
-/**
* @brief Is this node the RBTree root.
*
* This function returns true if @a the_node is the root of @a the_rbtree and
--
1.8.1.4
_______________________________________________
devel mailing list
devel@rtems.org
http://lists.rtems.org/mailman/listinfo/devel
