Stephen Kell
Stephen Kell
We are missing support for thread-local storage. This allocator is implemented inside the dynamic linker and is much like a static allocator, but each thread gets its own segment, for...
Currently there is some confusion about what an "allocator" is, owing to the presence of ```struct allocator``` instances that actually cover more than one allocator, such as ```__generic_malloc_allocator```. All these...
It's not necessary or desirable to suffer start-up delay scanning a whole libc binary for syscalls. We used to hack around this by only scanning certain parts, but that is...
A common operation on uniqtypes when answering any query is to divide by their size. There is potential for speedup here by using [libdivide](https://github.com/ridiculousfish/libdivide). Probably this means storing a 'magic...
Sometimes, especially for instrumentation, it's useful to be able to carve out little bits of space within a binary's segments. This could be used to hold trampolines, or static data...
To insert liballocs into the process, we use LD_PRELOAD. But even better would be a custom dynamic linker, since we would get control at the very beginning. This could simplify...
(Reported by @clearyf -- with thanks!) Building the debian-stretch Dockerfile on buster systems is broken as `struct ucontext` & `ucontext_t` have changed between the two releases.
It's not a good use of space to create a new uniqtype for every existing size of array. Better is to make clients work in terms of 'memory ranges' not...
With the ongoing overhaul of static metadata, there's an opportunity to design towards a more dynamic heuristic for identifying allocator functions. Done carefully, this should not impact performance in any...
The current handling of typedefs, and other cases of aliased uniqtypes (base types, bitfield types) is not quite right. Consider a DSO in which there is a type foo_t, being...