------- Comment #2 from pinskia at gcc dot gnu dot org 2006-04-25 18:38 -------
The other way of getting this is to have the code converted so there is only
one store instead of two:
int cmov(int* A ,int B ,int C ,int* D ,int* E ,int F ,int g) {
int k,f;
for (k = 1; k <= 1000; k++) {
int t = B+C;
g = D[k-1] + E[k-1];
if (g > t) t=g; /* This is not converted to cmov*/
A[K] = t;
f += g;
}
return f;
}
Which is most likely better anyways as one it is smaller.
--
pinskia at gcc dot gnu dot org changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |pinskia at gcc dot gnu dot
| |org
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27313
