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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
# RTEMS Tools Project (http://www.rtems.org/)
# Copyright 2010-2015 Chris Johns (chrisj@rtems.org)
# All rights reserved.
#
# This file is part of the RTEMS Tools package in 'rtems-tools'.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
#
# RTEMS Red/Black Tree Support
#
import gdb
rbt_left = 0
rbt_right = 1
def opp_dir(dir_):
if dir_ == rbt_left:
return rbt_right
return rbt_left
class node:
"""Manage the RBTree_Node_struct."""
def __init__(self, node_ptr):
self.node_ptr = node_ptr
self.node_val = None
if node_ptr != 0:
print '}}}}'
self.node_val = node_ptr.dereference()
def __str__(self):
return self.to_string()
def null(self):
if not self.node_val:
return True
return False
def pointer(self):
return self.node_ptr
def parent(self):
if not self.null():
return self.node_val['parent']
return None
def child(self):
if not self.null():
return self.node_val['child']
return None
def left(self):
if not self.null():
return self.node_val['child'][rbt_left]
return None
def right(self):
if not self.null():
return self.node_val['child'][rbt_right]
return None
def next(self, dir_):
next_ = None
if not self.null():
current = self.child(color, dir_)
if current is not None:
while current is not None:
cn = node(current)
current = cn.child(opp_dir(dir_))
next_ = current
else:
# RBTree_Node *parent = node->parent;
# if ( parent->parent && node == parent->child[ opp_dir ] ) {
#
# node->parent
if self.parent():
# pn = *(node->parent) or pn = *parent
pn = node(self.parent())
if pn.parent() and (self.pointer() == pn.child(opp_dir(dir_))):
next_ = self.parent()
else:
nn = self
while pn.parent():
if nn.pointer() != pn.child(dir_):
break
nn = pn
pn = node(pn.parent())
if pn.parent():
next_ = pn.pointer()
return next_
def predecessor(self):
return self.next(rbt_left)
def successor(self):
return self.next(rbt_right)
def color(self):
if not self.null():
return self.node_val['color']
return None
def cast(self, typename):
if not self.null():
nodetype = gdb.lookup_type(typename)
return self.node_val.cast(nodetype)
return None
def off_tree(self):
if parent.null():
return True
return False
def to_string(self):
if self.null():
return 'NULL'
print ']]] here'
return 'Parent:%s Child:%s Color:%s' % (self.node_val['parent'],
self.node_val['child'],
self.node_val['color'])
class control:
"""Manage the RBTree_Control."""
def __init__(self, ctrl):
self.ctrl = ctrl
def root(self):
"""Return the root node of the RBT."""
return node(self.ctrl['root'])
def first(self, dir_):
""" Return the min or max nodes of this RBT."""
return node(self.ctrl['first'][dir_])
def empty(self):
if self.root().null():
return True
return False
|
