diff options
| author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2012-12-22 17:57:07 +0100 |
|---|---|---|
| committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2013-01-02 16:31:28 +0100 |
| commit | 53afcfd24613d8e485f3534fae96be10e7e1293a (patch) | |
| tree | 1abc633885993c3b18e5186544448cdb63f83198 /cpukit/score/include/rtems/score/rbtree.h | |
| parent | score: Doxygen Clean Up Task #1 (diff) | |
| download | rtems-53afcfd24613d8e485f3534fae96be10e7e1293a.tar.bz2 | |
score: Do not inline _RBTree_Find_unprotected()
This function is to big to inline. It leads also to test case
explosion.
Diffstat (limited to 'cpukit/score/include/rtems/score/rbtree.h')
| -rw-r--r-- | cpukit/score/include/rtems/score/rbtree.h | 16 |
1 files changed, 15 insertions, 1 deletions
diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h index 3ce9226bc0..db26e59a96 100644 --- a/cpukit/score/include/rtems/score/rbtree.h +++ b/cpukit/score/include/rtems/score/rbtree.h @@ -224,6 +224,20 @@ RBTree_Node *_RBTree_Get( RBTree_Direction dir ); +/** @brief Find the node with given key in the tree + * + * This function returns a pointer to the node in @a the_rbtree + * having key equal to key of @a the_node if it exists, + * and NULL if not. @a the_node has to be made up before a search. + * + * @note If the tree is not unique and contains duplicate keys, the set + * of duplicate keys acts as FIFO. + */ +RBTree_Node *_RBTree_Find_unprotected( + RBTree_Control *the_rbtree, + RBTree_Node *the_node +); + /** * @brief Find the node with given key in the tree. * @@ -393,4 +407,4 @@ void _RBTree_Iterate_unprotected( /**@}*/ #endif -/* end of include file */
\ No newline at end of file +/* end of include file */ |