http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30442
--- Comment #9 from Richard Guenther 2012-06-05
12:39:29 UTC ---
So, $summary is still true but we now at least vectorize the initialization.
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30442
--- Comment #8 from Richard Guenther 2012-06-05
12:38:30 UTC ---
Author: rguenth
Date: Tue Jun 5 12:38:26 2012
New Revision: 188235
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=188235
Log:
2012-06-05 Richard Guenther
PR tree-op
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30442
--- Comment #7 from Richard Guenther 2012-06-05
10:50:22 UTC ---
The
long long test2(void)
{
long long a[32];
int i;
for (i = 0; i < 32; i++)
a[i] = 0;
return foo(a);
}
loop is transformed to memset at -O3. The unrolled version i
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30442
Uros Bizjak changed:
What|Removed |Added
Last reconfirmed|2007-01-14 05:01:04 |2012-02-06
--- Comment #6 from Uros Bizjak
--- Comment #5 from irar at il dot ibm dot com 2008-03-13 06:51 ---
(In reply to comment #4)
> This still happens on mainline.
>
> I wonder if vectorizer infrastructure can be re-used here to detect unrolled
> and looped version of memset. In addition to loop that can be "vectorized", w
--- Comment #4 from ubizjak at gmail dot com 2008-03-12 11:05 ---
This still happens on mainline.
I wonder if vectorizer infrastructure can be re-used here to detect unrolled
and looped version of memset. In addition to loop that can be "vectorized", we
have something resembling "vector
--- Comment #3 from johan dot walles at gmail dot com 2007-11-09 13:09
---
This optimization would have made grep 2.5.3 30% faster in a real-world test
case:
http://bugs.debian.org/450649
--
johan dot walles at gmail dot com changed:
What|Removed
--- Comment #2 from pinskia at gcc dot gnu dot org 2007-01-14 05:01 ---
This is a bit complex, we could use a loop reroller to roll this into a loop
and then transform that loop into memset for test1.
For test2 it is simple and a patch was presented at last year's gcc summit (and
I poste
