diff options
| author | Richard Biener <rguenther@suse.de> | 2026-02-06 15:47:08 +0100 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2026-02-09 13:45:41 +0100 |
| commit | 27c86eb6e7e277e55ca8c257fc3a9d1c1a2a126e (patch) | |
| tree | 95fb51f95e1a455411e9d9f3f3f9cc0854d276cd /libjava/testsuite/libjava.compile | |
| parent | 1c577ee243221af3844120fc03cfd9122063cc55 (diff) | |
| download | gcc-27c86eb6e7e277e55ca8c257fc3a9d1c1a2a126e.zip gcc-27c86eb6e7e277e55ca8c257fc3a9d1c1a2a126e.tar.gz gcc-27c86eb6e7e277e55ca8c257fc3a9d1c1a2a126e.tar.bz2 | |
tree-optimization/123225 - require iteration estimate for uncounted loops
The following makes uncounted loops not profitable to vectorize
unless there's an estimate on the number of iterations, either
from array sizes, overflow, or PGO, that indicates proftiability.
Or trivial profitability, but that's impossible to reach - Tamars
pending patch might change this in some cases.
I have verified that with PGO we do vectorize the testcase in the PR.
PR tree-optimization/123225
* tree-vect-loop.cc (vect_analyze_loop_costing): For uncounted
loops reject not trivially profitable loops that have no
estimate on the number of scalar iterations.
* gcc.dg/vect/costmodel/x86_64/costmodel-pr123225.c: New testcase.
Diffstat (limited to 'libjava/testsuite/libjava.compile')
0 files changed, 0 insertions, 0 deletions