blob: e79f175f35f49e76cce602dfa07f060c7bf8b297 (
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
|
/**
* @file
*
* @ingroup ScoreRBTree
*
* @brief _RBTree_Next_unprotected() and _RBTree_Next() implementation.
*/
/*
* Copyright (c) 2012 embedded brains GmbH. All rights reserved.
*
* embedded brains GmbH
* Obere Lagerstr. 30
* 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.com/license/LICENSE.
*/
#if HAVE_CONFIG_H
#include "config.h"
#endif
#include <rtems/score/rbtree.h>
#include <rtems/score/isr.h>
RBTree_Node *_RBTree_Next_unprotected(
const RBTree_Control *rbtree,
const RBTree_Node *node,
RBTree_Direction dir
)
{
RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir );
RBTree_Node *current = node->child [dir];
RBTree_Node *next = NULL;
if ( current != NULL ) {
next = current;
while ( (current = current->child [opp_dir]) != NULL ) {
next = current;
}
} else {
const RBTree_Node *null = (const RBTree_Node *) rbtree;
RBTree_Node *parent = node->parent;
if ( parent != null && node == parent->child [opp_dir] ) {
next = parent;
} else {
while ( parent != null && node == parent->child [dir] ) {
node = parent;
parent = node->parent;
}
if ( parent != null ) {
next = parent;
}
}
}
return next;
}
RBTree_Node *_RBTree_Next(
const RBTree_Control *rbtree,
const RBTree_Node *node,
RBTree_Direction dir
)
{
RBTree_Node *next;
ISR_Level level;
_ISR_Disable( level );
next = _RBTree_Next_unprotected( rbtree, node, dir );
_ISR_Enable( level );
return next;
}
|