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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
|
# SPDX-License-Identifier: GPL-2.0
#
# Radix Tree Parser
#
# Copyright (c) 2016 Linaro Ltd
# Copyright (c) 2023 Broadcom
#
# Authors:
# Kieran Bingham <kieran.bingham@linaro.org>
# Florian Fainelli <f.fainelli@gmail.com>
import gdb
from linux import utils
from linux import constants
radix_tree_root_type = utils.CachedType("struct xarray")
radix_tree_node_type = utils.CachedType("struct xa_node")
def is_internal_node(node):
long_type = utils.get_long_type()
return ((node.cast(long_type) & constants.LX_RADIX_TREE_ENTRY_MASK) == constants.LX_RADIX_TREE_INTERNAL_NODE)
def entry_to_node(node):
long_type = utils.get_long_type()
node_type = node.type
indirect_ptr = node.cast(long_type) & ~constants.LX_RADIX_TREE_INTERNAL_NODE
return indirect_ptr.cast(radix_tree_node_type.get_type().pointer())
def is_node(entry):
# Like xa_is_node(): internal entries below 4096 are sibling, retry
# or zero entries rather than pointers to a struct xa_node.
ulong_type = utils.get_ulong_type()
return is_internal_node(entry) and entry.cast(ulong_type) > 4096
def is_sibling(entry):
# Like xa_is_sibling(): a multi-index entry occupies several slots,
# and all but the first hold a sibling entry that encodes the offset
# of the first one.
ulong_type = utils.get_ulong_type()
return is_internal_node(entry) and entry.cast(ulong_type) < \
xa_mk_internal(constants.LX_RADIX_TREE_MAP_SIZE - 1)
def sibling_offset(entry):
ulong_type = utils.get_ulong_type()
return int(entry.cast(ulong_type)) >> 2
def node_maxindex(node):
return (constants.LX_RADIX_TREE_MAP_SIZE << node['shift']) - 1
def resolve_root(root):
if root.type == radix_tree_root_type.get_type():
return root
if root.type == radix_tree_root_type.get_type().pointer():
return root.dereference()
raise gdb.GdbError("must be {} not {}"
.format(radix_tree_root_type.get_type(), root.type))
def lookup(root, index):
root = resolve_root(root)
entry = root['xa_head']
if is_node(entry):
node = entry_to_node(entry)
if index > node_maxindex(node):
return None
# Walk down the tree like xas_load() does.
while True:
offset = (index >> node['shift']) & constants.LX_RADIX_TREE_MAP_MASK
entry = node['slots'][offset]
while is_sibling(entry):
entry = node['slots'][sibling_offset(entry)]
if node['shift'] and is_node(entry):
# xas_descend() turns this into a retry entry.
return None
if not is_node(entry) or node['shift'] == 0:
break
node = entry_to_node(entry)
elif index > 0:
return None
# Empty slots and retry or zero entries hold no data.
if entry == 0 or is_internal_node(entry):
return None
return entry
def descend(parent, index):
offset = (index >> int(parent["shift"])) & constants.LX_RADIX_TREE_MAP_MASK
return offset, parent["slots"][offset]
def load_root(root):
node = root["xa_head"]
nodep = node
if is_internal_node(node):
node = entry_to_node(node)
maxindex = node_maxindex(node)
return int(node["shift"]) + constants.LX_RADIX_TREE_MAP_SHIFT, \
nodep, maxindex
return 0, nodep, 0
class RadixTreeIter:
def __init__(self, start):
self.index = 0
self.next_index = start
self.node = None
def xa_mk_internal(v):
return (v << 2) | 2
LX_XA_RETRY_ENTRY = xa_mk_internal(256)
LX_RADIX_TREE_RETRY = LX_XA_RETRY_ENTRY
def next_chunk(root, iter):
mask = (1 << (utils.get_ulong_type().sizeof * 8)) - 1
index = iter.next_index
if index == 0 and iter.index != 0:
return None
restart = True
while restart:
restart = False
_, child, maxindex = load_root(root)
if index > maxindex:
return None
if not child:
return None
if not is_internal_node(child):
iter.index = index
iter.next_index = (maxindex + 1) & mask
iter.node = None
return root["xa_head"].address
while True:
node = entry_to_node(child)
offset, child = descend(node, index)
if not child:
while True:
offset += 1
if offset >= constants.LX_RADIX_TREE_MAP_SIZE:
break
slot = node["slots"][offset]
if slot:
break
index &= ~node_maxindex(node)
index = (index + (offset << int(node["shift"]))) & mask
if index == 0:
return None
if offset == constants.LX_RADIX_TREE_MAP_SIZE:
restart = True
break
child = node["slots"][offset]
if not child:
restart = True
break
if child == LX_XA_RETRY_ENTRY:
break
if not node["shift"] or not is_internal_node(child):
break
iter.index = (index & ~node_maxindex(node)) | offset
iter.next_index = ((index | node_maxindex(node)) + 1) & mask
iter.node = node
return node["slots"][offset].address
def next_slot(slot, iter):
mask = (1 << (utils.get_ulong_type().sizeof * 8)) - 1
for _ in range(iter.next_index - iter.index - 1):
slot += 1
iter.index = (iter.index + 1) & mask
if slot.dereference():
return slot
return None
def for_each_slot(root, start=0):
iter = RadixTreeIter(start)
slot = None
while True:
if not slot:
slot = next_chunk(root, iter)
if not slot:
break
yield iter.index, slot
slot = next_slot(slot, iter)
class LxRadixTreeLookup(gdb.Function):
""" Lookup and return a node from a RadixTree.
$lx_radix_tree_lookup(root_node [, index]): Return the node at the given index.
If index is omitted, the root node is dereference and returned."""
def __init__(self):
super(LxRadixTreeLookup, self).__init__("lx_radix_tree_lookup")
def invoke(self, root, index=0):
result = lookup(root, index)
if result is None:
raise gdb.GdbError("No entry in tree at index {}".format(index))
return result
class LxRadixTree(gdb.Command):
"""Show all values stored in a RadixTree."""
def __init__(self):
super(LxRadixTree, self).__init__("lx-radix-tree", gdb.COMMAND_DATA,
gdb.COMPLETE_NONE)
def invoke(self, argument, from_tty):
args = gdb.string_to_argv(argument)
if len(args) != 1:
raise gdb.GdbError("Usage: lx-radix-tree ROOT")
root = gdb.parse_and_eval(args[0])
for index, slot in for_each_slot(root):
gdb.write("[{}] = {}\n".format(index, slot.dereference()))
LxRadixTree()
LxRadixTreeLookup()
|