about summary refs log tree commit diff stats
path: root/subx/apps/handle
Commit message (Collapse)AuthorAgeFilesLines
* 4945Kartik Agaram2019-02-011-0/+0
|
* 4938Kartik Agaram2019-01-201-0/+0
|
* 4937Kartik Agaram2019-01-201-0/+0
|
* 4930Kartik Agaram2019-01-151-0/+0
|
* 4929Kartik Agaram2019-01-151-0/+0
| | | | Clean up primitives for converting from/to hex chars.
* 4928Kartik Agaram2019-01-141-0/+0
|
* 4927Kartik Agaram2019-01-141-0/+0
|
* 4926Kartik Agaram2019-01-141-0/+0
|
* 4925Kartik Agaram2019-01-141-0/+0
|
* 4923Kartik Agaram2019-01-121-0/+0
| | | | | We want slice-equal? for length-prefixed strings, not null-terminated "kernel" strings.
* 4920Kartik Agaram2019-01-111-0/+0
|
* 4916Kartik Agaram2019-01-101-0/+0
| | | | | In the process of building slice primitives I found an out-of-bounds access in write-byte.
* 4913Kartik Agaram2019-01-071-0/+0
|
* 4911Kartik Agaram2019-01-061-0/+0
|
* 4908Kartik Agaram2019-01-051-0/+0
| | | | | | | | Fix CI. a) Update canonical binaries. b) Fix an out-of-bounds access in `clear-stream`. This also required supporting a new instruction in `subx run` to load an imm8 into rm8.
* 4905 - safe ptr lookup is now 6 instructionsKartik Agaram2019-01-041-0/+0
| | | | | | | | | | | | | The lines within '{}' can now be turned into a macro like `E_X = deref(E_X)`, parameterizing the register being modified. Assumes the input is in a register but also saved elsewhere, so it's safe to clobber and replace with the result. Compare commit 4894. Used to take 9 instructions, 8 of them making loads/stores. Now it's 6 instructions, 4 of them loads/stores (the one non-local load is unchanged, of course). Key is to not consume more registers so we don't have to push/pop them.
* 4900Kartik Agaram2018-12-301-0/+0
| | | | | | | | | | | Finally really fix the CI failure of commit 4894. This is a remainder to forget my knowledge of stack addresses in the SubX VM when writing SubX programs. Otherwise my programs will work in the VM but not natively. The only assumptions a SubX program should make about its segment addresses are what's encoded in the ELF binary. Thanks to https://en.wikipedia.org/wiki/Address_space_layout_randomization, it can't know anything else.
* 4896Kartik Agaram2018-12-301-0/+0
| | | | Fix CI.
* 4894Kartik Agaram2018-12-301-0/+0
| | | | | | | | | | | | Done with kinda-safe pointers. In a real compiler the fast path of 'lookup' would ideally get inlined. Excluding procedure-call overhead, the current implementation consumes 2 registers besides the input, and requires 9 instructions (2 push, 2 load, compare, jump, increment, 2 pop). That's large enough that inlining may become a trade-off. Even if we somehow magically had the registers already loaded and available, we'd still need 4 instructions (1 pointer dereference, compare, jump and increment). The price of safety.
* 4889 - playing with kinda-safe pointersKartik Agaram2018-12-291-0/+0