mirror of https://git.cro.wtf/kip.git
Kitty-Cricket Piapiac
f25f1b8176
this mostly switches from using a resizeable hash table to store macros and whatnot to using a binary search tree (i was having some heisenbugs with the hash table that i didn't really feel like debugging it). a BST has a simpler implementation and uses a bit less memory, however it is potentially slower (O(log n) vs O(1)) & less cache performant however, currently i care more about ease of implementation so i can muck about with my impl without running into bugs. when i care more about performance i will probably revert this change (or rewrite a working hash table), but not without benchmarks |
||
|---|---|---|
| d | ||
| s | ||
| t | ||
| x | ||
| .gitignore | ||
| LICENSE | ||
| README | ||
| a.c | ||
| a.h | ||
| as.c | ||
| kip-io-disk.c | ||
| kip-io-term.c | ||
| kip-io.def | ||
| kip-sdl2.c | ||
| kip.c | ||
| kip.h | ||
| kmm32.c | ||
| kmm32.h | ||
| meson.build | ||
README
kip fantasy computer based on the kmm32
kmm32 tiny stack processor
depends c11 compiler
meson
ninja
sdl2
build meson compile -C b
test meson test -C b
usage ./b/kip [ROM FILE]
./b/as [ASM FILE] [ROM FILE]
layout ./kip* -- sdl2-based emulator
./as -- assembler
./d/ -- documentation
./t/ -- tests
./x/ -- examples
patches,questions,comments welcome and encouraged --> kitty+kip@piapiac.org
or you can open issues, pull requests --> https://codeberg.org/kitty/kip
more examples --> https://codeberg.org/kitty/mow