blob: cf042ec96a77db9c2ed36de902d27458da3d6597 (
plain)
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
|
#ifndef U3_V2_H
#define U3_V2_H
#include "v3.h"
/*** allocate.h
***/
# define u3_Loom_v2 u3_Loom_v3
# define u3a_v2_heap u3a_v3_heap
# define u3a_v2_is_cat u3a_v3_is_cat
# define u3a_v2_is_cell u3a_v3_is_cell
# define u3a_v2_is_north u3a_v3_is_north
# define u3a_v2_is_pom u3a_v3_is_pom
# define u3a_v2_is_pug u3a_v3_is_pug
# define u3a_v2_vits u3a_v3_vits
# define u3a_v2_into u3a_v3_into
# define u3a_v2_outa u3a_v3_outa
# define u3a_v2_botox u3a_v3_botox
# define u3a_v2_box u3a_v3_box
# define u3a_v2_cell u3a_v3_cell
# define u3a_v2_fbox u3a_v3_fbox
# define u3a_v2_fbox_no u3a_v3_fbox_no
# define u3a_v2_minimum u3a_v3_minimum
# define u3a_v2_rewrite_ptr u3a_v3_rewrite_ptr
# define u3a_v2_rewritten u3a_v3_rewritten
# define u3a_v2_to_pug u3a_v3_to_pug
# define u3a_v2_to_pom u3a_v3_to_pom
# define u3a_v2_wfree u3a_v3_wfree
# define u3v2to u3v3to
# define u3v2of u3v3of
# define u3a_v2_free u3a_v3_free
# define u3a_v2_lose u3a_v3_lose
# define u3a_v2_to_off u3a_v3_to_off
# define u3a_v2_to_ptr u3a_v3_to_ptr
# define u3a_v2_ream u3a_v3_ream
# define u3a_v2_balign u3a_v3_balign
# define u3a_v2_walign u3a_v3_walign
/* u3a_v2_road: contiguous allocation and execution context.
*/
typedef struct _u3a_v2_road {
u3p(struct _u3a_v2_road) par_p; // parent road
u3p(struct _u3a_v2_road) kid_p; // child road list
u3p(struct _u3a_v2_road) nex_p; // sibling road
u3p(c3_w) cap_p; // top of transient region
u3p(c3_w) hat_p; // top of durable region
u3p(c3_w) mat_p; // bottom of transient region
u3p(c3_w) rut_p; // bottom of durable region
u3p(c3_w) ear_p; // original cap if kid is live
c3_w fut_w[32]; // futureproof buffer
struct { // escape buffer
union {
jmp_buf buf;
c3_w buf_w[256]; // futureproofing
};
} esc;
struct { // miscellaneous config
c3_w fag_w; // flag bits
} how; //
struct { // allocation pools
u3p(u3a_v2_fbox) fre_p[u3a_v2_fbox_no]; // heap by node size log
u3p(u3a_v2_fbox) cel_p; // custom cell allocator
c3_w fre_w; // number of free words
c3_w max_w; // maximum allocated
} all;
struct {
u3p(u3h_root) hot_p; // hot state (home road only)
u3p(u3h_root) war_p; // warm state
u3p(u3h_root) cod_p; // cold state
u3p(u3h_root) han_p; // hank cache
u3p(u3h_root) bas_p; // battery hashes
} jed; // jet dashboard
struct { // bytecode state
u3p(u3h_root) har_p; // formula->post of bytecode
} byc;
struct { // namespace
u3_noun gul; // (list $+(* (unit (unit)))) now
} ski;
struct { // trace stack
u3_noun tax; // (list ,*)
u3_noun mer; // emergency buffer to release
} bug;
struct { // profile stack
c3_d nox_d; // nock steps
c3_d cel_d; // cell allocations
u3_noun don; // (list batt)
u3_noun trace; // (list trace)
u3_noun day; // doss, only in u3H (moveme)
} pro;
struct { // memoization
u3p(u3h_v2_root) har_p; // (map (pair term noun) noun)
} cax;
} u3a_v2_road;
/** Globals.
**/
/// Current road (thread-local).
extern u3a_v2_road* u3a_v2_Road;
# define u3R_v2 u3a_v2_Road
/*** jets.h
***/
# define u3j_v2_fink u3j_v3_fink
# define u3j_v2_fist u3j_v3_fist
# define u3j_v2_hank u3j_v3_hank
# define u3j_v2_rite u3j_v3_rite
# define u3j_v2_site u3j_v3_site
# define u3j_v2_rite_lose u3j_v3_rite_lose
# define u3j_v2_site_lose u3j_v3_site_lose
# define u3j_v2_free_hank u3j_v3_free_hank
/* u3j_v2_reclaim(): clear ad-hoc persistent caches to reclaim memory.
*/
void
u3j_v2_reclaim(void);
/*** hashtable.h
***/
# define u3h_v2_buck u3h_v3_buck
# define u3h_v2_node u3h_v3_node
# define u3h_v2_root u3h_v3_root
# define u3h_v2_slot_is_node u3h_v3_slot_is_node
# define u3h_v2_slot_is_noun u3h_v3_slot_is_noun
# define u3h_v2_noun_to_slot u3h_v3_noun_to_slot
# define u3h_v2_slot_to_noun u3h_v3_slot_to_noun
# define u3h_v2_slot_to_node(sot) (u3a_v2_into(((sot) & 0x3fffffff) << u3a_v2_vits))
# define u3h_v2_node_to_slot(ptr) ((u3a_v2_outa((ptr)) >> u3a_v2_vits) | 0x40000000)
/*** nock.h
***/
/* u3n_memo: %memo hint space
*/
typedef struct {
c3_l sip_l;
u3_noun key;
} u3n_v2_memo;
/* u3n_v2_prog: program compiled from nock
*/
typedef struct _u3n_v2_prog {
struct {
c3_o own_o; // program owns ops_y?
c3_w len_w; // length of bytecode (bytes)
c3_y* ops_y; // actual array of bytes
} byc_u; // bytecode
struct {
c3_w len_w; // number of literals
u3_noun* non; // array of literals
} lit_u; // literals
struct {
c3_w len_w; // number of memo slots
u3n_v2_memo* sot_u; // array of memo slots
} mem_u; // memo slot data
struct {
c3_w len_w; // number of calls sites
u3j_v2_site* sit_u; // array of sites
} cal_u; // call site data
struct {
c3_w len_w; // number of registration sites
u3j_v2_rite* rit_u; // array of sites
} reg_u; // registration site data
} u3n_v2_prog;
/* u3n_v2_reclaim(): clear ad-hoc persistent caches to reclaim memory.
*/
void
u3n_v2_reclaim(void);
/*** vortex.h
***/
# define u3v_v2_arvo u3v_v3_arvo
# define u3v_v2_version u3v_v3_version
/* u3v_v2_home: all internal (within image) state.
** NB: version must be last for discriminability in north road
*/
typedef struct _u3v_v2_home {
u3a_v2_road rod_u; // storage state
u3v_v2_arvo arv_u; // arvo state
u3v_v2_version ver_w; // version number
} u3v_v2_home;
/** Globals.
**/
/// Arvo internal state.
extern u3v_v2_home* u3v_v2_Home;
# define u3H_v2 u3v_v2_Home
# define u3A_v2 (&(u3v_v2_Home->arv_u))
/*** init
***/
void
u3_v2_load(c3_z wor_i);
#endif /* U3_V2_H */
|
