On Tue, May 10, 2016 at 07:14:41PM -0400, Daniel Micay wrote:
> > Seems valuable. Note, though, that you're developing on top of the
> > multi-pool malloc patches:
> >
> > https://marc.info/?t=14587167622=1=2
> >
> > http://www.drijf.net/openbsd/malloc/
> >
> > So there are probably
Daniel Micay wrote:
> This uses a hash table to maintain a set of delayed allocations,
> allowing full and efficient double-free detection. The current code
> can only catch it when the two pointers being swapped are equal, so
> double-frees that could be caught are missed. A naive loop over every
This uses a hash table to maintain a set of delayed allocations, allowing full
and efficient double-free detection. The current code can only catch it when
the two pointers being swapped are equal, so double-frees that could be caught
are missed. A naive loop over every delayed chunk would work
