-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmemory.py
176 lines (138 loc) · 5.17 KB
/
memory.py
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
import inspect
import random
import struct
class Memory(object):
def __init__(self):
self._io_registers = range(0x0000, 0x001F) # 32 bytes
self._page_zero_eprom = range(0x0020, 0x004F) # user eprom 48 bytes
self._heap = range(0x0050, 0x00C0) # heap + stack = ram
self._stack = range(0x00C0, 0x00FF)
self._eprom = range(0x1000, 0x3EFF)
self._user_vectors = range(0x3FF4, 0x3FFF)
self._mark_option_registers = (0xFF0, 0xFF1)
self._unused = range(0x0100, 0x0FFF)
self._rom = range(0x3F00,0x3FEF)
self._reset_interrupt = range(0x3FFE, 0x3FFF)
self._software_interrupt = range(0x3FFC, 0x3FFD)
self._external_interrupt_vector = range(0x3FA, )
self.address_size = 0xFFFF
self._memory = {}
self._mem_gen = None
def __iter__(self):
return self
def __str__(self):
result = ""
for address, value in self._memory.items():
result += "{0:#06X}: {1:#04X}\n".format(address, value)
return str(result)
def __next__(self):
if self._mem_gen == None:
self._mem_gen = self.next()
try:
return_value = next(self._mem_gen)
except StopIteration as stop_iter:
self._mem_gen = self.next()
raise stop_iter
return next(self._mem_gen)
def next(self):
for address, value in self._memory.items():
yield "{0:#06X}: {1:#04X}\n".format(address, value)
def write_buffer_to_memory(self, start_address, buffer):
address = start_address
for value in buffer:
self.write(address, value)
address += 1
def read(self, read_address):
address = self._convert_address(read_address)
value = self._memory.get(address, 0x9d)
return value
def write(self, write_address, value):
address = self._convert_address(write_address)
self._memory[address] = value
def _convert_address(self, original_address):
"""
converts address that comes in few different formats into int
accepts bytes, string and int
:param original_address: int/bytes/string address representation
:return: int address representation
:throws: ValueError - if invalid address format
"""
if type(original_address) == bytes:
address = struct.unpack(">H", original_address)[0] # big endian 2 bytes address
elif type(original_address) == str:
address = int(original_address, 16)
elif type(original_address) == int:
address = original_address
else:
raise ValueError("invalid address format")
return address
class Metalog(type):
def logit(cls, value):
def zz():
print("zzz")
return zz
def __new__(mcs, classname, bases, body):
for name, value in body.items():
if not inspect.isfunction(value):
continue
body[name] = mcs.logit(value)
return super(Metalog, mcs).__new__(mcs, classname, bases, body)
class Stack(object):
def __init__(self, size=64, start=0x00FF):
"""
defaults are from the 6800 family ref
size - size of the stack in bytes
start - the start address
this is our stack , its supposed to be circular , hardware controlled and it grows downwards.
"""
self._stack_size = size
self._stack_top = start
self._stack_bottom = self._stack_top - self._stack_size + 1
self._sp = self._stack_top - self._stack_bottom
self._stack = [int(random.random()*100) for _ in range(size)]
print("sp: {}".format(self._sp))
print("stack bottom: {}".format(hex(self._stack_bottom)))
print("stack top: {}".format(hex(self._stack_top)))
@property
def sp(self):
return self._sp + self._stack_bottom
@sp.setter
def sp(self, value):
if value not in range(0x0, 0xFFFF):
raise ValueError("sp should be 16 bit max")
self._sp = value - self._stack_bottom
def push(self, value):
# fist we put the value then we check if its the last memory address, if it is we come back to the start
self._sp -= 1
self._set_push_val(value)
if self.sp == (self._stack_bottom):
self.sp = self._stack_top
def pop(self):
if self.sp == self._stack_top:
self.sp = self._stack_bottom
value = self._get_pop_val()
self._sp += 1
return value
def push_state(self):
pass
def pop_state(self):
pass
def reset_stack_pointer(self, address):
self.sp = address
def _set_push_val(self, value):
self._stack[self._sp] = value
def _get_pop_val(self):
value = self._stack[self._sp]
return value
def test_underflow():
stack = Stack(size=64, start=0x00FF)
stack.pop()
assert(stack.sp == stack._stack_bottom+1)
def test_overflow():
stack = Stack(size=64, start=0x00FF)
for num in range(64):
stack.push(num)
assert(stack.sp == stack._stack_top - 1)
if __name__ == "__main__":
test_underflow()
test_overflow()