| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 4 days | implement initial fallback bounds checkHEADmaster | Kimplul | |
| + Binary tree to keep track of regions is probably not the fastest method, but easy enough to implement and works for now. In practice the matrix example is ~10x slower with fallback checking compared to finding the allocation in the hashmap, so hopefully compilers can ensure that the base of the allocation really is the base | |||
| 4 days | don't stxr32 when you want to ldxr32 | Kimplul | |
| + lol | |||
| 5 days | initial full matrix multiplication | Kimplul | |
| 5 days | initial rough skeleton | Kimplul | |
| + Naive/fast allocation hashmap + Stores/loads are currently all checked, the idea about static analysis to skip checks is still TODO | |||
 |
index : berg | |
| Memory safe virtual machine | kimi.h.kuparinen+berg@gmail.com |
| summaryrefslogtreecommitdiff |