> On Mar 14, 2017, at 4:04 PM, Jed Brown <[email protected]> wrote: > > Barry Smith <[email protected]> writes: > >>> On Mar 14, 2017, at 3:23 PM, Jed Brown <[email protected]> wrote: >>> >>> Barry Smith <[email protected]> writes: >>> >>>>> On Mar 13, 2017, at 1:27 PM, Jed Brown <[email protected]> wrote: >>>>> >>>>> Satish Balay <[email protected]> writes: >>>>>> stash the metadata for each allocation (and pointers for corresponding >>>>>> free) in a hash table for all mallocs that we need to track? [this >>>>>> avoids the wasted 'space' in each alloc.] >>>>> >>>>> Sure, but this is just duplicating an implementation of malloc. >>>> >>>> No it isn't. It is a very thin wrapper around multiple current mallocs. >>> >>> Meh, the proposal has more storage overhead than malloc(). >> >> It still doesn't even come close to providing the functionality of malloc, >> so isn't a duplication of malloc > > Fine, it's more wasteful than malloc while doing less than malloc, and > still calls malloc.
Well it actually does something malloc doesn't do. It allows for multiple malloc backends, and possibly allows for other things like tracking how often the malloced space is accessed. And keeps enough information for migration of malloced space.
