Search
Saturday, 6th of August 2022, 1:13:40 UTC
3:10:07
Bike
we could make symbol-value a little faster by computing an index at load time, and then skipping the get-an-index-if-there-isn't-one step
3:10:11
Bike
dunno how important that would be tho
3:10:11
drmeister
These are all the bytecodes - correct?
3:10:25
drmeister
https://github.com/bike/cvm/blob/main/compile.lisp#L12
3:10:49
drmeister
https://github.com/bike/cvm/blob/main/compile.lisp#L19
3:12:19
drmeister
I was going to write a function to generate #define's for each bytecode
3:28:30
drmeister
How do you use the compile.lisp file?
3:31:21
Bike
Yeah. You'll need to compile and load vm.lisp first
3:31:30
Bike
and you need alexandria loaded now
3:36:44
drmeister
Why are the codes defined twice? Once in vm.lisp and again in compile.lisp
3:39:08
Bike
cos i wrote it quickly
3:39:14
Bike
they should be the same codes though
5:46:49
karlosz
stassats: n is the number of values in the values glob - its totally equivalent to the sbcl representation since that's basically a stack offset into the start of the values
6:05:56
karlosz
Bike: seems worthwhile to me. the index for the tls area you mean?
Saturday, 6th of August 2022, 13:13:40 UTC