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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
# Part of the Fifteen-Thieves Project
# Chris Xiong 2020
# License: Expat (MIT)
import re
from collections import namedtuple
import xv.util as u
LeafNode = namedtuple("LeafNode", ["offset", "name", "size", "elements", "stride"])
def strsize2bytesize(s):
if s.startswith('0'):
return 1
else:
return int(s[1:])
def get_leaf_data(data, leaf):
if leaf.size.startswith('0'):
return data[leaf.offset]
else:
ret = 0
for i in range(0, int(leaf.size[1:])):
ret <<= 4
ret |= data[leaf.offset + i] & 0xf
return ret
def set_leaf_data(data, leaf, value):
sz = int(leaf.size[1:])
if leaf.size.startswith('0'):
if value >= (1 << sz):
raise ValueError("Value overflow")
data[leaf.offset] = value
else:
if value >= (1 << (sz * 4)):
raise ValueError("Value overflow")
for i in range(0, sz):
data[leaf.offset + sz - 1 - i] = value & 0xf
value >>= 4
class AddrMapTemplateNode:
def __init__(self, lines, is_root=False):
self.valid = True
self.name = lines[0].strip()
self.is_root = is_root
self.is_aggregate_node = False
self.children_nodes = []
self.children_names = dict()
if self.name.endswith('*'):
self.is_aggregate_node = True
self.name = self.name[:-1]
for line in lines[1:]:
el = line.split(',')
if not 2 <= len(el) <= 3:
self.valid = False
break
offset = u.hexrep2b7val(int(el[0].strip(), 16))
size = None if len(el) == 2 else el[1].strip()
m = re.match("([a-z_0-9]*)(\[([0-9]*)(\+[0-9a-f]*)?\])?", el[-1].strip())
if not m:
self.valid = False
break
name = m.groups()[0]
elements = None if not m.groups()[2] else int(m.groups()[2])
stride = None if not m.groups()[-1] else u.hexrep2b7val(int(m.groups()[-1][1:], 16))
child = LeafNode(offset, name, size, elements, stride)
self.children_names[name] = len(self.children_nodes)
self.children_nodes.append(child)
class AddrMapTemplate:
def __init__(self, amapfile=None):
self.root_node_name = None
self.nodes = dict()
self.parse(amapfile)
if not self.verify():
raise ValueError("invalid address map file")
def parse(self,amapfile=None):
linebuf = []
with open(amapfile, "r", encoding="utf-8") as f:
for line in f:
line = line[:line.find('#')]
if len(line.strip()) == 0:
continue
if re.match("^[a-z]", line):
if len(linebuf) > 0:
newnode = AddrMapTemplateNode(linebuf, len(self.nodes) == 0)
if newnode.valid:
self.nodes[newnode.name] = newnode
if newnode.is_root:
self.root_node_name = newnode.name
linebuf = [line]
else:
linebuf.append(line)
if len(linebuf) > 0:
newnode = AddrMapTemplateNode(linebuf)
if newnode.valid:
self.nodes[newnode.name] = newnode
def verify(self):
for nodename, node in self.nodes.items():
if not node.is_aggregate_node:
continue
for child in node.children_nodes:
if not child.name in self.nodes:
print(f"referencing undefined node {child.name} in {node.name}")
return False
return True
class AddrMapNode:
def __init__(self, template_node, base_address, data, template):
self.template = template_node
self.base_address = base_address
self.upper_address = base_address
self.children_nodes = []
self.data = data
self._populate(template)
def _populate(self, template):
for t in self.template.children_nodes:
if self.template.is_aggregate_node:
ba = self.base_address + t.offset
if t.elements:
stride = t.stride if t.stride else 1
l = []
for i in range(0, t.elements):
l.append(AddrMapNode(template.nodes[t.name], ba, self.data, template))
ba += stride
self.children_nodes.append(l)
if l[-1].upper_address > self.upper_address:
self.upper_address = l[-1].upper_address
else:
self.children_nodes.append(AddrMapNode(template.nodes[t.name], ba, self.data, template))
if self.children_nodes[-1].upper_address > self.upper_address:
self.upper_address = self.children_nodes[-1].upper_address
else:
ba = self.base_address + t.offset
if t.elements:
stride = t.stride if t.stride else 1
l = []
for i in range(0, t.elements):
cn = LeafNode(ba, t.name, t.size, t.elements, t.stride)
l.append(cn)
ba += stride
self.children_nodes.append(l)
if ba - stride + strsize2bytesize(t.size) > self.upper_address:
self.upper_address = ba - stride + strsize2bytesize(t.size)
else:
cn = LeafNode(ba, t.name, t.size, t.elements, t.stride)
self.children_nodes.append(cn)
if ba + strsize2bytesize(t.size) > self.upper_address:
self.upper_address = ba + strsize2bytesize(t.size)
def dump(self, level=0, instance=None):
ba_rep = ''.join([format(x, "02x") for x in u.padbelist(u.int2b7belist(self.base_address))])
print(f"{ba_rep}{level*' '} {self.template.name}{'['+str(instance)+']' if instance is not None else ''}")
for child in self.children_nodes:
if self.template.is_aggregate_node:
if type(child) == list:
for i, element in enumerate(child):
element.dump(level + 1, i)
else:
child.dump(level + 1)
else:
if type(child) == list:
for i, element in enumerate(child):
ba_rep = ''.join([format(x, "02x") for x in u.padbelist(u.int2b7belist(element.offset))])
print(f"{ba_rep}{(level + 1)*' '} {element.name}[{i}] {element.size}")
else:
ba_rep = ''.join([format(x, "02x") for x in u.padbelist(u.int2b7belist(child.offset))])
print(f"{ba_rep}{(level + 1)*' '} {child.name} {child.size}")
def set_data(self, data):
if len(data) > self.size():
raise ValueError("excessive data")
self.data[self.base_address:self.base_address + len(data)] = data
def get_data(self):
return self.data[self.base_address:self.upper_address + 1]
def size(self):
return self.upper_address - self.base_address + 1
def find_node(self, key):
if type(key) != list:
key = key.split('.')
if len(key) == 0:
raise ValueError("???")
if key[0] == self.template.name:
key = key[1:]
if len(key) == 0:
return self
m = re.match("([a-z_0-9]*)(\[([0-9]*)\])?", key[0])
if not m:
raise ValueError(f"Invalid key: {key[0]}")
if m.groups()[0] not in self.template.children_names:
raise ValueError(f"No such region: {m.groups()[0]}")
child = self.children_nodes[self.template.children_names[m.groups()[0]]]
if m.groups()[2] and type(child) != list:
raise ValueError(f"{m.groups()[0]} is not a list")
if not m.groups()[2] and type(child) == list:
if len(key) > 1:
raise ValueError(f"index needed for {m.groups()[0]}")
if not self.template.is_aggregate_node and len(key) > 1:
raise ValueError(f"{key[0]} has no more subregions")
if type(child) == list:
if len(key) > 1:
return child[int(m.groups()[2])].find_node(key[1:])
else:
return child if not m.groups()[2] else child[int(m.groups()[2])]
else:
if len(key) > 1:
return child.find_node(key[1:])
else:
return child
def value(self, key):
node = self.find_node(key)
if type(node) == list:
if type(node[0]) == AddrMapNode:
return node.data[node[0].base_address:node[-1].upper_address + 1]
else:
stride = node[0].stride if node[0].stride else 1
return self.data[node[0].offset:node[0].offset + len(node) * stride:stride]
else:
if type(node) == AddrMapNode:
return node.data[node.base_address:node.upper_address + 1]
else:
return get_leaf_data(self.data, node)
def set_value(self, key, data):
node = self.find_node(key)
if type(node) == list:
if type(node[0]) == AddrMapNode:
if len(data) > node[-1].upper_address + 1 - node[0].base_address:
raise ValueError("excessive data")
node.data[node[0].base_address:node[0].base_address + len(data)] = data
else:
stride = node[0].stride if node[0].stride else 1
if len(data) > len(self.data[node[0].offset:node[0].offset + len(node) * stride:stride]):
raise ValueError("excessive data")
self.data[node[0].offset:node[0].offset + len(node) * stride:stride] = data
else:
if type(node) == AddrMapNode:
if len(data) > node.upper_address + 1 - node.base_address:
raise ValueError("excessive data")
node.data[node.base_address:node.base_address + len(data)] = data
else:
return set_leaf_data(self.data, node, data)
def __getitem__(self, key):
return self.children_nodes[self.template.children_names[key]]
def __iter__(self):
return self.children_nodes.__iter__()
def __len__(self):
return len(self.children_nodes)
def create_addr_map_tree(template):
r = AddrMapNode(template.nodes[template.root_node_name], 0, bytearray(), template)
r.data.extend(bytearray(r.upper_address))
return r
# vim: expandtab shiftwidth=4 tabstop=4
|
