Stephen Kell

I agree there's a code quality issue around error checking. However, it seems possible to separate that out from this issue, which is a matter of functionality. The old code...

I meant to say 'defined too late', of course (or referenced too early).

This got tweaked in 9a7a29c since the CircleCI box had different linker version/behaviour. We needed to split the defsyms up from the -lallocs (to keep the latter towards the end...

A very simple low-effort version would work like this: we batch ```free```-derived mprotect requests. By default, we do them every N calls to ```free```. Wart: if a ```malloc``` wants to...

We need to think about how to re-add permissions. In fact that exposes a flaw in the above: if a malloc wants to re-use that VAS region, it's too late...

This segues into our idea of providing coarse-grained (bigalloc-level) may-reach and must-reach approximations. Doing our GC sweep we only need to consider bigallocs (roots) that may-reach our heap. Do we...

The may-reach relation between data and text segments is populated by (1) fixed-offset knowledge within a DSO, and (2) symbol binding info available from ld.so audit upcalls. Note there is...

If allocsld always emulates the 'requested' case of dynamic linking (`$ ./my.binary`), not the 'invoked' case (`$ /path/to/ld.so my.binary`), then we get to map the executable before the real ld.so...

This all relates to how we package the liballocs implementation, which currently is still 99% in a preload DSO. To get our hooks a little deeper into the dynamic linker,...

When devising a solution it's important to think about the static-linking case, which we want to support (allocsld could load a static binary). E.g. could we fake out a subset...