> On 8 Feb 2024, at 06:52, Nathan Bossart <nathandboss...@gmail.com> wrote: > > For the same compASC() test, I see an ~8.4% improvement with your int64 > code and a ~3.4% improvement with this: If we care about branch prediction in comparison function, maybe we could produce sorting that inlines comparator, thus eliminating function call to comparator? We convert comparison logic to int, to extract comparison back then. I bet “call" is more expensive than “if". Best regards, Andrey Borodin.
- Re: glibc qsort() vulnerability Andres Freund
- Re: glibc qsort() vulnerability Mats Kindahl
- Re: glibc qsort() vulnerability Mats Kindahl
- Re: glibc qsort() vulnerability Nathan Bossart
- Re: glibc qsort() vulnerability Mats Kindahl
- Re: glibc qsort() vulnerability Nathan Bossart
- Re: glibc qsort() vulnerability Mats Kindahl
- Re: glibc qsort() vulnerability Nathan Bossart
- Re: glibc qsort() vulnerability Mats Kindahl
- Re: glibc qsort() vulnerability Nathan Bossart
- Re: glibc qsort() vulnerability Andrey M. Borodin
- Re: glibc qsort() vulnerability Nathan Bossart
- Re: glibc qsort() vulnerability Andrey Borodin
- Re: glibc qsort() vulnerability Andres Freund
- Re: glibc qsort() vulnerability Andres Freund
- Re: glibc qsort() vulnerability Mats Kindahl