Home | Notifications | New Note | Local | Federated | Search | Logout

Note Detail


Reply to @ireneista@adhd.irenes.space
Irenes (many)@ireneista@adhd.irenes.space (2026-09-08 11:05:43)
in particular all the actual output happens through a few low-level words such as pack8, which are given an address to write to as parameters.

the work we did earlier today created a trap that's called each time one of those words is, and we can have the trap save the next address after each piece of output. then it'll be available for the ~ replacement to reference.
---Reply--- Irenes (many)@ireneista@adhd.irenes.space (2026-09-08 11:06:39) so, that's the strategy. we think it's going to work. the experiments we did the other day showed us the general shape of all the call sequences the hex transform is going to encounter, and they're surprisingly uniform, not a lot of surprises.
Reply

---Replies---
Irenes (many)@ireneista@adhd.irenes.space (2026-09-08 11:07:58)
we're going to need to add one more layer of abstraction after we get this working on programs written in our Evocation dialect of assembly, which is what we've been starting with since it's simpler. when we need it to work on full Forth programs, the hex transform will have to do some additional tweaking to the label and log-load transforms, both of which are used as part of Forth compilation.