-
Notifications
You must be signed in to change notification settings - Fork 33
Expand file tree
/
Copy pathpointerTable.py
More file actions
207 lines (179 loc) · 8.24 KB
/
pointerTable.py
File metadata and controls
207 lines (179 loc) · 8.24 KB
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
import copy
import struct
class PointerTable:
END_OF_DATA = (0xff, )
"""
Class to manage a list of pointers to data objects
Can rewrite the rom to modify the data objects and still keep the pointers intact.
"""
def __init__(self, rom, info):
assert "count" in info
assert "pointers_bank" in info
assert "pointers_addr" in info
assert ("banks_bank" in info and "banks_addr" in info) or ("data_bank" in info)
self.__info = info
self.__data = []
self.__alt_data = {}
self.__banks = []
self.__storage = []
count = info["count"]
addr = info["pointers_addr"]
pointers_bank = rom.banks[info["pointers_bank"]]
if "data_addr" in info:
pointers_raw = []
for n in range(count):
pointers_raw.append(info["data_addr"] + 0x4000 + pointers_bank[addr + n] * info["data_size"])
else:
pointers_raw = struct.unpack("<" + "H" * count, pointers_bank[addr:addr+count*2])
if "data_bank" in info:
banks = [info["data_bank"]] * count
else:
addr = info["banks_addr"]
banks = rom.banks[info["banks_bank"]][addr:addr+count]
if "alt_pointers" in self.__info:
for key, (bank, addr) in self.__info["alt_pointers"].items():
pointer = struct.unpack("<H", rom.banks[bank][addr:addr+2])[0]
assert 0x4000 <= pointer < 0x8000
self.__alt_data[key] = self._readData(rom, self.__info["data_bank"], pointer & 0x3FFF)
for n in range(count):
bank = banks[n] & 0x3f
pointer = pointers_raw[n]
if 0x4000 <= pointer < 0x8000:
pointer &= 0x3fff
self.__data.append(self._readData(rom, bank, pointer))
else:
self.__data.append(pointer)
self.__banks.append(bank)
while self.__mergeStorage():
pass
self.__storage.sort(key=lambda n: n["start"])
if "claim_storage_gaps" in info and info["claim_storage_gaps"]:
self.__storage = [{"bank": self.__storage[0]["bank"], "start": self.__storage[0]["start"], "end": self.__storage[-1]["end"]}]
if "expand_to_end_of_bank" in info and info["expand_to_end_of_bank"]:
for st in self.__storage:
expand = True
for st2 in self.__storage:
if st["bank"] == st2["bank"] and st["end"] < st2["end"]:
expand = False
if expand:
st["end"] = 0x4000
# for s in sorted(self.__storage, key=lambda s: (s["bank"], s["start"])):
# print(self.__class__.__name__, s)
def __contains__(self, item):
if isinstance(item, str):
return item in self.__alt_data
return 0 <= item < len(self.__data)
def __setitem__(self, item, value):
if isinstance(item, str):
self.__alt_data[item] = value
else:
self.__data[item] = value
def __getitem__(self, item):
if isinstance(item, str):
return self.__alt_data[item]
return self.__data[item]
def __len__(self):
return len(self.__data)
def store(self, rom):
storage = copy.deepcopy(self.__storage)
pointers_bank = self.__info["pointers_bank"]
pointers_addr = self.__info["pointers_addr"]
done = {}
for st in storage:
done[st["bank"]] = {}
for key, (ptr_bank, ptr_addr) in self.__info.get("alt_pointers", {}).items():
s = bytes(self.__alt_data[key])
bank = self.__info["data_bank"]
my_storage = None
for st in storage:
if st["end"] - st["start"] >= len(s) and st["bank"] == bank:
my_storage = st
break
assert my_storage is not None, "Not enough room in storage... %s" % (storage)
pointer = my_storage["start"]
my_storage["start"] = pointer + len(s)
rom.banks[bank][pointer:pointer + len(s)] = s
rom.banks[ptr_bank][ptr_addr] = pointer & 0xFF
rom.banks[ptr_bank][ptr_addr + 1] = (pointer >> 8) | 0x40
for n, s in enumerate(self.__data):
if isinstance(s, int):
pointer = s
else:
s = bytes(s)
bank = self.__banks[n]
if s in done[bank]:
pointer = done[bank][s]
assert rom.banks[bank][pointer:pointer+len(s)] == s
else:
my_storage = None
for st in storage:
if st["end"] - st["start"] >= len(s) and st["bank"] == bank:
my_storage = st
break
assert my_storage is not None, "Not enough room in storage... %d/%d %s id:%x(%d) bank:%d" % (n, len(self.__data), storage, n, n, bank)
pointer = my_storage["start"]
my_storage["start"] = pointer + len(s)
rom.banks[bank][pointer:pointer+len(s)] = s
if "data_size" not in self.__info:
# aggressive de-duplication.
for skip in range(len(s)):
done[bank][s[skip:]] = pointer + skip
done[bank][s] = pointer
if "data_addr" in self.__info:
offset = pointer - self.__info["data_addr"]
if "data_size" in self.__info:
assert offset % self.__info["data_size"] == 0
offset //= self.__info["data_size"]
rom.banks[pointers_bank][pointers_addr + n] = offset
else:
rom.banks[pointers_bank][pointers_addr+n*2] = pointer & 0xff
rom.banks[pointers_bank][pointers_addr+n*2+1] = ((pointer >> 8) & 0xff) | 0x40
space_left = sum(map(lambda n: n["end"] - n["start"], storage))
# print(self.__class__.__name__, "Space left:", space_left)
return storage
def _readData(self, rom, bank_nr, pointer):
bank = rom.banks[bank_nr]
start = pointer
if "data_size" in self.__info:
pointer += self.__info["data_size"]
else:
while bank[pointer] not in self.END_OF_DATA:
pointer += 1
pointer += 1
self._addStorage(bank_nr, start, pointer)
return bank[start:pointer]
def _addStorage(self, bank, start, end):
for n, data in enumerate(self.__storage):
if data["bank"] == bank:
if data["start"] == end:
data["start"] = start
return
if data["end"] == start:
data["end"] = end
return
if data["start"] <= start and data["end"] >= end:
return
self.__storage.append({"bank": bank, "start": start, "end": end})
def __mergeStorage(self):
for n in range(len(self.__storage)):
n_end = self.__storage[n]["end"]
n_start = self.__storage[n]["start"]
for m in range(len(self.__storage)):
if m == n or self.__storage[n]["bank"] != self.__storage[m]["bank"]:
continue
m_end = self.__storage[m]["end"]
m_start = self.__storage[m]["start"]
if m_start - 1 <= n_end <= m_end:
self.__storage[n]["start"] = min(self.__storage[n]["start"], self.__storage[m]["start"])
self.__storage[n]["end"] = self.__storage[m]["end"]
self.__storage.pop(m)
return True
return False
def addStorage(self, extra_storage):
for data in extra_storage:
self._addStorage(data["bank"], data["start"], data["end"])
while self.__mergeStorage():
pass
self.__storage.sort(key=lambda n: n["start"])
def adjustDataStart(self, new_start):
self.__info["data_addr"] = new_start