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
|
.ifndef _primops_s_file
_primops_s_file:
.include "include/data.s"
.macro .primop2 name
# | arg1 | arg2 | -> cont
.thunkcode \name
# push a thunk for collecting the first arg and set it as continuation
thunkto %rsi, $\name\()_step1, $3, 030(%rbp), %rbp, %rsi
enter 0x10(%rbp) # evaluate arg1
# arg1 -> | arg2 | ret | cont |
.thunkcode \name\()_step1
# this is guaranteed to be entered only once (it's a case cont), so we
# can rewrite the thunk in place
xchg %rsi, 020(%rbp) # store arg1, get arg 2
movq $\name\()_fini, 0(%rbp) # continue with finishing
xchg %rbp, %rsi # continue here, evaluate arg 2
enter_rbp
# arg2 -> | arg1 | ret | cont |
.thunkcode \name\()_fini
# at this point,
# arg1 is pointed to by 020(%rbp)
# arg2 is pointed to by %rsi
.endm
.macro primop2_ret_int val
# TODO: try to generalize
# the result should now be in %rax
mov 030(%rbp), %rsi # save result to the original primop2 thunk
movq \val, 010(%rsi)
movq $INT_code, 0(%rsi)
enter 040(%rbp) # eval cont, returning %rsi
.endm
.macro primop2_cont_indirect new
# TODO: try to generalize
mov 030(%rbp), %rdi # load the original thunk
mov 040(%rbp), %rsi # set the continuation
movq \new, 010(%rdi) # set the indirect to the new thunk
movq $IND_code, 0(%rdi)
enter \new # continue evaluating the new thunk
.endm
.endif # _primops_s_file
|
