pao214 / mode32 Goto Github PK

Want to make the reference model as close to Java as possible

Need to modify slab allocator to accept large requests for continuous memory

Current switch algorithm stores free list in reverse original order. It is not necessary but becomes an exact copy if the free list is also stored in the original order

Pointers in free list assume that all the pointers fit in 32 bits. Provide a 32bit implementation to free list

Remove unnecessary assert statements

Defer switching object chunks as late as possible

In current implementation number of buffers is detected by looking at end marker, but is computationally giving a wrong value

Switch from 32 bit mode to 64 bit mode when memory footprint exceeds a threshold