Freelist based allocation is actually very nearly as fast as bump pointer allocation. Like 10% if you compare the allocation function in isolation and 1% if you benchmark the whole object allocation path.
http://users.cecs.anu.edu.au/~steveb/pubs/papers/mmtk-sigmet...
Some older malloc implementations like Hoard have bump pointer allocation into empty pages but the newest allocator impementations found that the branch prediction cost of having both paths outweighed the benefits
https://www.microsoft.com/en-us/research/uploads/prod/2019/0...
- first, as you said, people repeat the opposite a lot, including world class GC experts.
- then, unless I'm missing something, that claim sounds equivalent to claiming than heap allocation is no more than 10% more expensive than stack allocation, which is arguably completely false.
It's like comparing speed of a bike vs airplane: the brand and the quality of the bike doesn't really matter…