blob: 7a54000854dcc65ba5d3679c00838e6aa4fcd34a (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
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;
}
|