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
|
# Conway's Game of Life
#
# To build:
# $ ./translate_mu_baremetal baremetal/life.mu
# To run:
# $ qemu-system-i386 disk.img
fn state _grid: (addr array boolean), x: int, y: int -> _/eax: boolean {
# clip at the edge
compare x, 0
{
break-if->=
return 0/false
}
compare y, 0
{
break-if->=
return 0/false
}
compare x, 0x100/width
{
break-if-<
return 0/false
}
compare y, 0xc0/height
{
break-if-<
return 0/false
}
var idx/eax: int <- copy y
idx <- shift-left 8/log2width
idx <- add x
var grid/esi: (addr array boolean) <- copy _grid
var result/eax: (addr boolean) <- index grid, idx
return *result
}
fn set-state _grid: (addr array boolean), x: int, y: int, val: boolean {
# don't bother checking bounds
var idx/eax: int <- copy y
idx <- shift-left 8/log2width
idx <- add x
var grid/esi: (addr array boolean) <- copy _grid
var result/eax: (addr boolean) <- index grid, idx
var src/ecx: boolean <- copy val
copy-to *result, src
}
fn num-live-neighbors grid: (addr array boolean), x: int, y: int -> _/eax: int {
var result/edi: int <- copy 0
# row above: zig
decrement y
decrement x
var s/eax: boolean <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
increment x
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
increment x
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
# curr row: zag
increment y
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
subtract-from x, 2
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
# row below: zig
increment y
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
increment x
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
increment x
s <- state grid, x, y
{
compare s, 0/false
break-if-=
result <- increment
}
return result
}
fn step old-grid: (addr array boolean), new-grid: (addr array boolean) {
var y/ecx: int <- copy 0
{
compare y, 0xc0/height
break-if->=
var x/edx: int <- copy 0
{
compare x, 0x100/width
break-if->=
var n/eax: int <- num-live-neighbors old-grid, x, y
# if neighbors < 2, die of loneliness
{
compare n, 2
break-if->=
set-state new-grid, x, y, 0/dead
}
# if neighbors > 3, die of overcrowding
{
compare n, 3
break-if-<=
set-state new-grid, x, y, 0/dead
}
# if neighbors = 2, preserve state
{
compare n, 2
break-if-!=
var old-state/eax: boolean <- state old-grid, x, y
set-state new-grid, x, y, old-state
}
# if neighbors = 3, cell quickens to life
{
compare n, 3
break-if-!=
set-state new-grid, x, y, 1/live
}
x <- increment
loop
}
y <- increment
loop
}
}
# color a square of size 'side' starting at x*side, y*side
fn render-square _x: int, _y: int, color: int {
var y/edx: int <- copy _y
y <- shift-left 2/log2side
var side/ebx: int <- copy 1
side <- shift-left 2/log2side
var ymax/ecx: int <- copy y
ymax <- add side
{
compare y, ymax
break-if->=
{
var x/eax: int <- copy _x
x <- shift-left 2/log2side
var xmax/ecx: int <- copy x
xmax <- add side
{
compare x, xmax
break-if->=
pixel-on-real-screen x, y, color
x <- increment
loop
}
}
y <- increment
loop
}
}
fn render grid: (addr array boolean) {
var y/ecx: int <- copy 0
{
compare y, 0xc0/height
break-if->=
var x/edx: int <- copy 0
{
compare x, 0x100/width
break-if->=
var state/eax: boolean <- state grid, x, y
compare state, 0/false
{
break-if-=
render-square x, y, 3/cyan
}
compare state, 0/false
{
break-if-!=
render-square x, y, 0/black
}
x <- increment
loop
}
y <- increment
loop
}
}
fn main {
#? # allocate on the stack
#? var grid1-storage: (array boolean 0xc000) # width * height
#? var grid1/esi: (addr array boolean) <- address grid1-storage
#? var grid2-storage: (array boolean 0xc000) # width * height
#? var grid2/edi: (addr array boolean) <- address grid2-storage
# allocate on the heap
var grid1-storage: (handle array boolean)
var grid1-ah/eax: (addr handle array boolean) <- address grid1-storage
populate grid1-ah, 0xc000 # width * height
var _grid1/eax: (addr array boolean) <- lookup *grid1-ah
var grid1/esi: (addr array boolean) <- copy _grid1
var grid2-storage: (handle array boolean)
var grid2-ah/eax: (addr handle array boolean) <- address grid2-storage
populate grid2-ah, 0xc000 # width * height
var _grid2/eax: (addr array boolean) <- lookup *grid2-ah
var grid2/edi: (addr array boolean) <- copy _grid2
# initialize grid1
set-state grid1, 0x80, 0x5f, 1/live
set-state grid1, 0x81, 0x5f, 1/live
set-state grid1, 0x7f, 0x60, 1/live
set-state grid1, 0x80, 0x60, 1/live
set-state grid1, 0x80, 0x61, 1/live
# render grid1
render grid1
{
var key/eax: byte <- read-key 0/keyboard
compare key, 0
#? loop-if-= # press key to step
break-if-!= # press key to quit
# iter: grid1 -> grid2
step grid1, grid2
render grid2
# iter: grid2 -> grid1
step grid2, grid1
render grid1
loop
}
}
|