blob: 1f97ed457fbf9c7ffd9ef4a668a3366ed25b3261 (
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
/**
* @file
*
* @ingroup RTEMSScoreRBTree
*
* @brief This source file contains the implementation of
* _RBTree_Postorder_next() and _RBTree_Postorder_first().
*/
/*
* Copyright (c) 2018 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.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <rtems/score/rbtree.h>
static void *_RBTree_Postorder_dive_left(
const RBTree_Node *the_node,
size_t offset
)
{
while ( true ) {
if ( _RBTree_Left( the_node ) != NULL ) {
the_node = _RBTree_Left( the_node );
} else if ( _RBTree_Right( the_node ) != NULL ) {
the_node = _RBTree_Right( the_node );
} else {
return (void *) ( (uintptr_t) the_node - offset );
}
}
}
void *_RBTree_Postorder_next(
const RBTree_Node *the_node,
size_t offset
)
{
const RBTree_Node *parent;
parent = _RBTree_Parent( the_node );
if ( parent == NULL ) {
return NULL;
}
if (
the_node == _RBTree_Left( parent )
&& _RBTree_Right( parent ) != NULL
) {
return _RBTree_Postorder_dive_left( _RBTree_Right( parent ), offset );
}
return (void *) ( (uintptr_t) parent - offset );
}
void *_RBTree_Postorder_first(
const RBTree_Control *the_rbtree,
size_t offset
)
{
const RBTree_Node *the_node;
the_node = _RBTree_Root( the_rbtree );
if ( the_node == NULL ) {
return NULL;
}
return _RBTree_Postorder_dive_left( the_node, offset );
}
|