Sorting an array of around 300 (or 30000) randomly created unsigned characters sounds like a task tailor made for binsort.
(Which seems plausibly worth mentioning in this context.) That said, the key openbsd issues might not include performance on this particular benchmark. Thanks, -- Raul On Sun, Nov 7, 2021 at 9:16 PM Luke Small <[email protected]> wrote: > > https://bugs.llvm.org/show_bug.cgi?id=50026 > > I reported it to the llvm people. it is two slightly different quicksort > algorithms which perform radically differently. The one which you could > assume would take more time, performs MUCH better. > > I made a custom quicksort algorithm which outperforms qsort by A LOT for > sorting an array of around 300 randomly created unsigned characters, which > is what I use it for. > > if you read the report a guy said there's a 10% difference for sorting 3 > million characters on freebsd, but there's about 40% performance difference > on OpenBSD. maybe it's also how the OpenBSD team modified clang to prevent > rop chain stuff or something? I'm using a westmere based intell server. > > it's the same for clang 11. > > What's the deal? > > -Luke
sort_test2r.c
Description: Binary data
