[Bug tree-optimization/18813] not vectorizing obvious loop

2006-01-28 Thread pinskia at gcc dot gnu dot org
--- Comment #4 from pinskia at gcc dot gnu dot org 2006-01-29 05:23 --- The first example is fixed so closing as fixed, the second example I think has been fixed seperately already. -- pinskia at gcc dot gnu dot org changed: What|Removed |Added ---

[Bug tree-optimization/18813] not vectorizing obvious loop

2004-12-20 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2004-12-21 05:44 --- Note we are unrolling this loop now so that should help SPEC. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18813

[Bug tree-optimization/18813] not vectorizing obvious loop

2004-12-05 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2004-12-06 04:58 --- Confirmed. -- What|Removed |Added CC||rakdver at

[Bug tree-optimization/18813] not vectorizing obvious loop

2004-12-03 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2004-12-03 19:51 --- Oh, the problem is we don't handle non one increment. Another example: int f(unsigned s1, unsigned s2, int *s, int *e) { unsigned i; for (i = s1; i< s2; i+=4) *s++ = 0; } -- http://gcc.gnu.org/bug