This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/85466] Performance is slow when doing 'branchless' conditional style math operations
- From: "rguenther at suse dot de" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 19 Apr 2018 14:19:28 +0000
- Subject: [Bug libstdc++/85466] Performance is slow when doing 'branchless' conditional style math operations
- Auto-submitted: auto-generated
- References: <bug-85466-4@http.gcc.gnu.org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85466
--- Comment #13 from rguenther at suse dot de <rguenther at suse dot de> ---
On Thu, 19 Apr 2018, glisse at gcc dot gnu.org wrote:
> https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85466
>
> --- Comment #12 from Marc Glisse <glisse at gcc dot gnu.org> ---
> Constant folding for nextafter seems like a useful thing to add, whatever we
> say about the rest of the testcase.
Indeed - looks like this and related functions are not constant folded for
whatever reason...