diff options
| author | Jonathan Wakely <jwakely@redhat.com> | 2024-07-04 12:01:29 +0100 |
|---|---|---|
| committer | Jonathan Wakely <redi@gcc.gnu.org> | 2024-07-27 12:47:39 +0100 |
| commit | e69456ff9a54ba3e9c93842b05757b7d8fff6d9d (patch) | |
| tree | 49a4577dab61b248055497b2542001d5e1e05865 /gcc/tree-data-ref.c | |
| parent | 6d79d53eed82b1df378998bd4ced88644dcde200 (diff) | |
| download | gcc-e69456ff9a54ba3e9c93842b05757b7d8fff6d9d.zip gcc-e69456ff9a54ba3e9c93842b05757b7d8fff6d9d.tar.gz gcc-e69456ff9a54ba3e9c93842b05757b7d8fff6d9d.tar.bz2 | |
libstdc++: Remove __find_if unrolling for random access iterators
As the numbers in PR libstdc++/88545 show, the manual loop unrolling in
std::__find_if doesn't actually help these days, and it prevents the
compiler from auto-vectorizing.
Remove the dispatching on iterator_category and just use the simple loop
for all iterator categories.
libstdc++-v3/ChangeLog:
* include/bits/stl_algobase.h (__find_if): Remove overloads for
dispatching on iterator_category. Do not unroll loop manually.
* include/bits/stl_algo.h (__find_if_not): Remove
iterator_category argument from __find_if call.
Diffstat (limited to 'gcc/tree-data-ref.c')
0 files changed, 0 insertions, 0 deletions