https://gcc.gnu.org/bugzilla/show_bug.cgi?id=110007
Alexander Monakov <amonakov at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |amonakov at gcc dot gnu.org
--- Comment #6 from Alexander Monakov <amonakov at gcc dot gnu.org> ---
Are you sure the branch is unpredictable in your micro-benchmark? If you have
repeated runs you'll train the predictors.
Implementing a __builtin_branchless_select would address such needs more
directly. There were similar requests in the past, two of them related to qsort
and bsearch, unsurprisingly: PR 93165, PR 97734, PR 106804.
