RTOS/rtems
1
0
Fork 0
forked from Imagelibrary/rtems
Code Pull Requests Activity

rbtree: Delete unused functions

Browse Source
This commit is contained in:
Sebastian Huber
2014-07-12 14:22:21 -05:00
committed by Joel Sherrill
parent 7e60b7d125
commit 7e11999038
2 changed files with 0 additions and 90 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
cpukit/sapi/include/rtems/rbtree.h
View File

@@ -145,18 +145,6 @@ RTEMS_INLINE_ROUTINE bool rtems_rbtree_is_node_off_rbtree(
return _RBTree_Is_node_off_rbtree( node );
}
/**
* @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.
*
@@ -229,20 +217,6 @@ RTEMS_INLINE_ROUTINE rtems_rbtree_node *rtems_rbtree_parent(
return _RBTree_Parent( the_node );
}
/**
* @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.
*
@@ -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.
*

50
cpukit/score/include/rtems/score/rbtree.h
View File

@@ -289,38 +289,6 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_node_off_rbtree(
(node->child[RBT_RIGHT] == NULL);
}
/**
* @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.
*
@@ -430,24 +398,6 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_first(
return (the_node == _RBTree_First(the_rbtree, dir));
}
/**
* @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.
*