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. One 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. -Luke
sort_test2.c
Description: Binary data
