berg, branch masterMemory safe virtual machinehttps://metanimi.dy.fi/cgit/berg/atom?h=master2025-05-19T17:34:51Zimplement initial fallback bounds check2025-05-19T17:34:51ZKimplulkimi.h.kuparinen@gmail.com2025-05-19T17:34:51Zurn:sha1:2a8830742e1c831ae1499c1467bb9c658eb2319b
+ 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
don't stxr32 when you want to ldxr322025-05-19T16:50:48ZKimplulkimi.h.kuparinen@gmail.com2025-05-19T16:50:48Zurn:sha1:b434471bbb555936d4827eb0483065d143284f40
+ lol
initial full matrix multiplication2025-05-18T20:01:12ZKimplulkimi.h.kuparinen@gmail.com2025-05-18T20:01:12Zurn:sha1:f4083f86cabfa4b314ef6fb3e1f3df96e5dbd794initial rough skeleton2025-05-18T14:15:57ZKimplulkimi.h.kuparinen@gmail.com2025-05-18T14:15:57Zurn:sha1:0e6bc60ceb3d2676fae166308668680a2f675d17
+ Naive/fast allocation hashmap
+ Stores/loads are currently all checked, the idea about static analysis
to skip checks is still TODO