PR c++/15815

[pf3gnuchains/gcc-fork.git] / gcc / tree-ssa-dse.c

diff --git a/gcc/tree-ssa-dse.c b/gcc/tree-ssa-dse.c
index e5ba66f..ce28694 100644 (file)
--- a/gcc/tree-ssa-dse.c
+++ b/gcc/tree-ssa-dse.c
@@ -55,7 +55,7 @@ Boston, MA 02111-1307, USA.  */
 
    It may help to think of this as first moving the earlier store to
    the point immediately before the later store.  Again, the single
-   use of the virtual defintion and the post-dominance relationship
+   use of the virtual definition and the post-dominance relationship
    ensure that such movement would be safe.  Clearly if there are 
    back to back stores, then the second is redundant.
 
@@ -132,7 +132,7 @@ fix_phi_uses (tree phi, tree stmt)
         them with the appropriate V_MAY_DEF_OP.  */
       for (j = 0; j < PHI_NUM_ARGS (phi); j++)
        if (v_may_def == PHI_ARG_DEF (phi, j))
-         PHI_ARG_DEF (phi, j) = V_MAY_DEF_OP (v_may_defs, i);
+         SET_PHI_ARG_DEF (phi, j, V_MAY_DEF_OP (v_may_defs, i));
     }
 }
 
@@ -164,8 +164,7 @@ fix_stmt_v_may_defs (tree stmt1, tree stmt2)
          if (v_may_def1 == V_MAY_DEF_RESULT (v_may_defs2, j))
            {
              /* Update.  */
-             *V_MAY_DEF_OP_PTR (v_may_defs1, i) = 
-                               V_MAY_DEF_OP (v_may_defs2, j);
+             SET_V_MAY_DEF_OP (v_may_defs1, i, V_MAY_DEF_OP (v_may_defs2, j));
              break;
            }
        }