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

rbtree: Add _RBTree_Replace_node()

Browse Source
This commit is contained in:
Sebastian Huber
2015-08-31 13:11:04 +02:00
parent e9fbaa3b48
commit edf640f8cf
3 changed files with 75 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
cpukit/score/Makefile.am
View File

@@ -286,6 +286,7 @@ libscore_a_SOURCES += src/freechain.c
libscore_a_SOURCES += \
src/rbtreeextract.c src/rbtreefind.c \
src/rbtreeinsert.c src/rbtreeiterate.c src/rbtreenext.c
libscore_a_SOURCES += src/rbtreereplace.c
## THREAD_C_FILES
libscore_a_SOURCES += src/thread.c src/threadchangepriority.c \

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

@@ -470,6 +470,19 @@ RBTree_Node *_RBTree_Predecessor( const RBTree_Node *node );
*/
RBTree_Node *_RBTree_Successor( const RBTree_Node *node );
/**
* @brief Replaces a node in the red-black tree without a rebalance.
*
* @param[in] the_rbtree The red-black tree control.
* @param[in] victim The victim node.
* @param[in] replacement The replacement node.
*/
void _RBTree_Replace_node(
RBTree_Control *the_rbtree,
RBTree_Node *victim,
RBTree_Node *replacement
);
/**@}*/
#ifdef __cplusplus

61
cpukit/score/src/rbtreereplace.c Normal file
View File

@@ -0,0 +1,61 @@
/**
* @file
*
* @ingroup ScoreRBTree
*
* @brief _RBTree_Replace_node() implementation.
*/
/*
* Copyright (c) 2015 embedded brains GmbH. All rights reserved.
*
* embedded brains GmbH
* Dornierstr. 4
* 82178 Puchheim
* Germany
* <rtems@embedded-brains.de>
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rtems.org/license/LICENSE.
*/
#if HAVE_CONFIG_H
#include "config.h"
#endif
#include <rtems/score/rbtree.h>
void _RBTree_Replace_node(
RBTree_Control *the_rbtree,
RBTree_Node *victim,
RBTree_Node *replacement
)
{
RBTree_Node *parent = _RBTree_Parent( victim );
RBTree_Node **link;
RBTree_Node *child;
if (parent != NULL) {
if ( victim == _RBTree_Left( parent ) ) {
link = _RBTree_Left_reference( parent );
} else {
link = _RBTree_Right_reference( parent );
}
} else {
link = _RBTree_Root_reference( the_rbtree );
}
*link = replacement;
child = _RBTree_Left( victim );
if ( child != NULL ) {
RB_PARENT( child, Node ) = replacement;
}
child = _RBTree_Right( victim );
if ( child != NULL ) {
RB_PARENT( child, Node ) = replacement;
}
*replacement = *victim;
}