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
//! The instruction set executed by the VM.
//!
//! `bvm-lang` is a *register machine*: every instruction names the registers it
//! reads and writes explicitly, rather than pushing and popping an operand stack.
//! A register machine issues far fewer instructions for the same work — a
//! three-address `Add { dst, lhs, rhs }` replaces a push/push/add/pop sequence —
//! which means fewer dispatch iterations through the interpreter loop and better
//! use of the CPU's branch predictor.
//!
//! Each [`Op`] is a fixed-size, already-decoded value: the operands are plain
//! integer fields, so the interpreter never parses a byte stream at runtime. A
//! program is just a `&[Op]` walked by a program counter, plus a pool of
//! [`Value`](crate::Value) constants.
/// A register index.
///
/// Registers are the VM's working storage. A [`Chunk`](crate::Chunk) sizes its
/// register file to the highest index any of its instructions names, so indices
/// are dense and start at zero. The 16-bit width allows up to 65 536 registers
/// per chunk, far more than a single function body needs.
pub type Reg = u16;
/// A constant-pool index.
///
/// Constants are [`Value`](crate::Value)s too large or too varied to encode as an
/// immediate (arbitrary floats, interned symbols). They live in the chunk's
/// constant pool and are addressed by this index via [`Op::LoadConst`].
pub type Const = u16;
/// An instruction address within a chunk's code array.
///
/// Branch targets are absolute indices, not relative offsets: `Jump { target }`
/// sets the program counter directly. Absolute targets keep back-patching during
/// code generation trivial — the target is known once, and never shifts if
/// earlier instructions change size (they never do).
pub type Addr = u32;
/// A single decoded instruction.
///
/// Instructions divide into data movement (`Move`, `Load*`), arithmetic
/// (`Add`…`Neg`), comparison (`Eq`…`Ge`), the logical `Not`, control flow
/// (`Jump`, `JumpIfTrue`, `JumpIfFalse`), and termination (`Return`, `Halt`).
///
/// Arithmetic and comparison operands are numeric: an integer combines with an
/// integer to give an integer (with overflow checked), and any float operand
/// promotes the result to float. Comparisons and `Not` produce booleans. See the
/// individual variants and [the crate root](crate) for the exact semantics.