-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path16-optimize-prims.lsp
250 lines (246 loc) · 6.17 KB
/
16-optimize-prims.lsp
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
; create some more optimized primitives with the linker
; length could be a lot faster and is pretty simple
(define length$ (car (link
(start
; set up counter
(\addi $sp $sp -0x10)
(\sd $ra $sp 0x00)
(\sd $s1 $sp 0x08)
(\li $s1 0)
)
(loop
; do cdr in a loop
(\beqz $a0 (rel end))
(\auipc $ra (rel cdr$))
(\callr $ra (rel+ cdr$))
(\addi $s1 $s1 1)
(\j (rel loop))
)
(end
(\mv $a0 $s1)
(\ld $ra $sp 0x00)
(\ld $s1 $sp 0x08)
(\addi $sp $sp 0x10)
(\ret)
)
)))
(define length (fn (list)
(car (call-native length$ 1 (ref list)))))
; this is very commonly used and this version is a lot faster
(define eval-list (box-procedure (car (link
(start
; stash locals, set up variables
(\addi $sp $sp -0x28)
(\sd $ra $sp 0x00)
(\sd $s1 $sp 0x08)
(\sd $s2 $sp 0x10)
(\sd $a1 $sp 0x18) ; locals
(\sd $a0 $sp 0x20) ; remaining args
(\li $s1 0) ; return value (dest)
(\li $s2 0) ; current node of dest to append to
)
(setup
; evaluate args first
; arg 0 - locals (to be used)
(\ld $a0 $sp 0x18)
(\auipc $ra (rel acquire-object$))
(\callr $ra (rel+ acquire-object$))
(\mv $a1 $a0)
(\addi $a0 $sp 0x20)
(\auipc $ra (rel eval-head$))
(\callr $ra (rel+ eval-head$))
(\bnez $a0 (rel ret))
; swap provided locals into position
(\mv $t0 $a1) ; new locals
(\ld $a1 $sp 0x18) ; old locals (use one more time)
(\sd $t0 $sp 0x18) ; save new as locals
; arg 1 - list to evaluate
(\addi $a0 $sp 0x20)
(\auipc $ra (rel eval-head$))
(\callr $ra (rel+ eval-head$))
(\bnez $a0 (rel ret))
; temporarily stash arg list in s1
(\mv $s1 $a1)
; release rest of args
(\ld $a0 $sp 0x20)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; store new args
(\sd $s1 $sp 0x20)
(\li $s1 0)
)
(loop
; check if next is nil
(\ld $t0 $sp 0x20)
(\beqz $t0 (rel done))
; acquire locals
(\ld $a0 $sp 0x18)
(\auipc $ra (rel acquire-object$))
(\callr $ra (rel+ acquire-object$))
(\mv $a1 $a0)
; set address of args
(\addi $a0 $sp 0x20)
; call eval-head$
(\auipc $ra (rel eval-head$))
(\callr $ra (rel+ eval-head$))
; handle error
(\bnez $a0 (rel ret))
; make cons with nil
(\mv $a0 $a1)
(\li $a1 0)
(\auipc $ra (rel cons$))
(\callr $ra (rel+ cons$))
; handle error
(\beqz $a0 (rel nomem))
; handle first node specially
(\beqz $s1 (rel first))
; set cons into current node
(\sd $a0 $s2 0x10) ; tail
(\mv $s2 $a0) ; advance
(\j (rel loop))
)
(first
; first node = set to s1 and s2
(\mv $s1 $a0)
(\mv $s2 $a0)
(\j (rel loop))
)
(done
; ok
(\li $a0 0)
; take result from s1
(\mv $a1 $s1)
(\mv $s1 $zero)
)
(ret
(\addi $sp $sp -0x10)
(\sd $a0 $sp 0x00)
(\sd $a1 $sp 0x08)
; free locals
(\ld $a0 $sp 0x28)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; free args
(\ld $a0 $sp 0x30)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; free s1
(\mv $a0 $s1)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; restore and return
(\ld $a0 $sp 0x00)
(\ld $a1 $sp 0x08)
(\ld $ra $sp 0x10)
(\ld $s1 $sp 0x18)
(\ld $s2 $sp 0x20)
(\addi $sp $sp 0x38)
(\ret)
)
(nomem
(\li $a0 -4) ; EVAL_ERROR_NO_FREE_MEM
(\li $a1 0)
(\j (rel ret))
)
))))
; replace math
(define binary-op$ (car (link
; unbox first arg into s1
; args list on stack for eval-head
(start
(\addi $sp $sp -0x40)
(\sd $ra $sp 0x00)
(\sd $s1 $sp 0x08)
(\sd $a1 $sp 0x10) ; locals
(\sd $s2 $sp 0x18)
(\sd $a0 $sp 0x20) ; args
(\sd $zero $sp 0x28) ; first flag
; load address from data
(\mv $a0 $a2)
(\auipc $ra (rel unbox-integer$))
(\callr $ra (rel+ unbox-integer$))
(\beqz $a0 (rel exc))
(\beqz $a1 (rel exc))
(\mv $s2 $a1) ; routine
)
(loop
; eval arg
(\ld $a0 $sp 0x10)
(\auipc $ra (rel acquire-object$))
(\callr $ra (rel+ acquire-object$))
(\mv $a1 $a0)
(\addi $a0 $sp 0x20)
(\auipc $ra (rel eval-head$))
(\callr $ra (rel+ eval-head$))
(\bnez $a0 (rel ret)) ; err
; unbox
(\mv $a0 $a1)
(\auipc $ra (rel unbox-integer$))
(\callr $ra (rel+ unbox-integer$))
; check if first
(\ld $t0 $sp 0x28)
(\beqz $t0 (rel first))
; call routine with a0, a1
(\mv $a0 $s1)
(\callr $s2 0)
(\mv $s1 $a0)
; check if end
(\ld $t0 $sp 0x20)
(\beqz $t0 (rel end))
(\j (rel loop))
)
(first
; move arg in
(\mv $s1 $a1)
(\li $t0 1)
(\sd $t0 $sp 0x28) ; set first flag
(\j (rel loop))
)
(end
; box the result
(\mv $a0 $s1)
(\auipc $ra (rel box-integer$))
(\callr $ra (rel+ box-integer$))
(\beqz $a0 (rel nomem))
(\mv $a1 $a0)
(\li $a0 0)
)
(ret
; stash result
(\sd $a0 $sp 0x30)
(\sd $a1 $sp 0x38)
; release locals
(\ld $a0 $sp 0x10)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; release args
(\ld $a0 $sp 0x20)
(\auipc $ra (rel release-object$))
(\callr $ra (rel+ release-object$))
; restore saved
(\ld $ra $sp 0x00)
(\ld $s1 $sp 0x08)
(\ld $s2 $sp 0x18)
(\ld $a0 $sp 0x30)
(\ld $a1 $sp 0x38)
(\addi $sp $sp 0x40)
(\ret)
)
(nomem
(\li $a0 -4) ; EVAL_ERROR_NO_FREE_MEM
(\li $a1 0)
(\j (rel ret))
)
(exc
(\li $a0 -1) ; EVAL_ERROR_EXCEPTION
(\li $a1 0)
(\j (rel ret))
)
)))
(define + (box-procedure binary-op$ +$))
(define - (box-procedure binary-op$ -$))
(define << (box-procedure binary-op$ <<$))
(define >> (box-procedure binary-op$ >>$))
(define & (box-procedure binary-op$ &$))
(define | (box-procedure binary-op$ |$))
(define ^ (box-procedure binary-op$ ^$))