Commit 78d3c323 by Daniel Berlin Committed by Daniel Berlin

tree-ssa-sccvn.c (set_ssa_val_to): Check for operand_equal_p before declaring inequality.

2007-07-03  Daniel Berlin  <dberlin@dberlin.org>

	* tree-ssa-sccvn.c (set_ssa_val_to): Check for operand_equal_p
	before declaring inequality.

From-SVN: r126252
parent b6bcd676
2007-07-03 Daniel Berlin <dberlin@dberlin.org>
* tree-ssa-sccvn.c (set_ssa_val_to): Check for operand_equal_p
before declaring inequality.
2007-07-03 Rask Ingemann Lambertsen <rask@sygehus.dk>
* combine.c (recog_for_combine): Log the success or failure of
......
2007-07-02 Daniel Berlin <dberlin@dberlin.org>
* gcc.c-torture/compile/ssa-pre-1.c: New test.
2007-07-03 Tobias Burnus <burnus@net-b.de>
PR fortran/20888
void washQtoM3(double m[9], double q[4]);
double sqrt(double);
int f(int samp)
{
double clp[2], xyz[3], q[4], len;
double mRF[9];
int xi;
for (xi=0; xi<samp; xi++)
{
q[0] = 1.0;
q[1] = ( ((double)(1)-(-1))*((double)((float)xi)-(-0.5)) / ((double)(samp-0.5)-(-0.5)) + (-1));
q[2] = ( ((double)(1)-(-1))*((double)((float)0)-(-0.5)) / ((double)(samp-0.5)-(-0.5)) + (-1));
q[3] = ( ((double)(1)-(-1))*((double)((float)0)-(-0.5)) / ((double)(samp-0.5)-(-0.5)) + (-1));
len = (sqrt((((q))[0]*((q))[0] + ((q))[1]*((q))[1] + ((q))[2]*((q))[2] + ((q))[3]*((q))[3])));
((q)[0] = (q)[0]*1.0/len, (q)[1] = (q)[1]*1.0/len, (q)[2] = (q)[2]*1.0/len, (q)[3] = (q)[3]*1.0/len);
washQtoM3(mRF, q);
}
return 0;
}
......@@ -1014,6 +1014,7 @@ print_scc (FILE *out, VEC (tree, heap) *scc)
static inline bool
set_ssa_val_to (tree from, tree to)
{
tree currval;
gcc_assert (to != NULL);
/* Make sure we don't create chains of copies, so that we get the
......@@ -1037,7 +1038,9 @@ set_ssa_val_to (tree from, tree to)
fprintf (dump_file, "\n");
}
if (SSA_VAL (from) != to)
currval = SSA_VAL (from);
if (currval != to && !operand_equal_p (currval, to, OEP_PURE_SAME))
{
SSA_VAL (from) = to;
return true;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment