diff options
| author | Joel Sherrill <joel.sherrill@oarcorp.com> | 2013-01-10 17:06:06 -0600 |
|---|---|---|
| committer | Joel Sherrill <joel.sherrill@oarcorp.com> | 2013-01-10 17:06:47 -0600 |
| commit | e858f7049c6407648e624cb43a1819237541fd84 (patch) | |
| tree | ec6a688ecef9bd271eab37ca652dc172935acb1d /cpukit/score/inline/rtems | |
| parent | devfs: Doxygen Warning Removal and Cleanup (diff) | |
| download | rtems-e858f7049c6407648e624cb43a1819237541fd84.tar.bz2 | |
cpukit: Fix many Doxygen warnings
Diffstat (limited to 'cpukit/score/inline/rtems')
| -rw-r--r-- | cpukit/score/inline/rtems/score/rbtree.inl | 16 | ||||
| -rw-r--r-- | cpukit/score/inline/rtems/score/states.inl | 2 |
2 files changed, 9 insertions, 9 deletions
diff --git a/cpukit/score/inline/rtems/score/rbtree.inl b/cpukit/score/inline/rtems/score/rbtree.inl index 7bbb9c6af0..8b4234de57 100644 --- a/cpukit/score/inline/rtems/score/rbtree.inl +++ b/cpukit/score/inline/rtems/score/rbtree.inl @@ -65,7 +65,9 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_node_off_rbtree( const RBTree_Node *node ) { - return (node->parent == NULL) && (node->child[RBT_LEFT] == NULL) && (node->child[RBT_RIGHT] == NULL); + return (node->parent == NULL) && + (node->child[RBT_LEFT] == NULL) && + (node->child[RBT_RIGHT] == NULL); } /** @@ -255,7 +257,8 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Has_only_one_node( ) { if(!the_rbtree) return false; /* TODO: expected behavior? */ - return (the_rbtree->root->child[RBT_LEFT] == NULL && the_rbtree->root->child[RBT_RIGHT] == NULL); + return (the_rbtree->root->child[RBT_LEFT] == NULL && + the_rbtree->root->child[RBT_RIGHT] == NULL); } /** @@ -385,11 +388,10 @@ RTEMS_INLINE_ROUTINE bool _RBTree_Is_lesser( /** * @brief Returns the predecessor of a node. * - * @param[in] rbtree is the red-black tree. * @param[in] node is the node. * - * @retval NULL The predecessor does not exist. - * @retval otherwise The predecessor node. + * @retval NULL The predecessor does not exist. Otherwise it returns + * the predecessor node. */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected( const RBTree_Node *node @@ -413,11 +415,9 @@ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor( /** * @brief Returns the successor of a node. * - * @param[in] rbtree is the red-black tree. * @param[in] node is the node. * - * @retval NULL The successor does not exist. - * @retval otherwise The successor node. + * @retval NULL The successor does not exist. Otherwise the successor node. */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected( const RBTree_Node *node diff --git a/cpukit/score/inline/rtems/score/states.inl b/cpukit/score/inline/rtems/score/states.inl index 8d335c9475..5dfdc4230a 100644 --- a/cpukit/score/inline/rtems/score/states.inl +++ b/cpukit/score/inline/rtems/score/states.inl @@ -51,7 +51,7 @@ RTEMS_INLINE_ROUTINE States_Control _States_Set ( * This function clears the given states_to_clear into the current_state * passed in. The result is returned to the user in current_state. * - * @param[in] states_to_set is the state bits to clean + * @param[in] states_to_clear is the state bits to clean * @param[in] current_state is the state set to remove them from * * @return This method returns the updated states value. |