* config.gcc (ia64-*-*): Set extra_headers.

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

diff --git a/gcc/ssa.c b/gcc/ssa.c
index f2ede4d..bb71706 100644 (file)
--- a/gcc/ssa.c
+++ b/gcc/ssa.c
@@ -1061,12 +1061,12 @@ rename_block (bb, idom)
          else
            {
              /* When we created the PHI nodes, we did not know what mode
-            the register should be.  Now that we've found an original,
-            we can fill that in.  */
+                the register should be.  Now that we've found an original,
+                we can fill that in.  */
              if (GET_MODE (SET_DEST (phi)) == VOIDmode)
                PUT_MODE (SET_DEST (phi), GET_MODE (reg));
              else if (GET_MODE (SET_DEST (phi)) != GET_MODE (reg))
-               abort();
+               abort ();
 
              *phi_alternative (phi, bb) = reg;
            }
@@ -1231,7 +1231,7 @@ ephi_add_node (reg, nodes, n_nodes)
 /* Part one of the topological sort.  This is a forward (downward) search
    through the graph collecting a stack of nodes to process.  Assuming no
    cycles, the nodes at top of the stack when we are finished will have
-   no other dependancies.  */
+   no other dependencies.  */
 
 static int *
 ephi_forward (t, visited, succ, tstack)
@@ -1366,7 +1366,7 @@ eliminate_phi (e, reg_partition)
   if (n_nodes == 0)
     return;
 
-  /* Build the auxilliary graph R(B). 
+  /* Build the auxiliary graph R(B). 
 
      The nodes of the graph are the members of the register partition
      present in Phi(B).  There is an edge from FIND(T0)->FIND(T1) for
@@ -2121,7 +2121,7 @@ rename_equivalent_regs (reg_partition)
 
                  PATTERN (insn) = XVECEXP (s, 0, slen-1);
                  for (i = 0; i < slen - 1; i++)
-                   emit_block_insn_before (XVECEXP (s, 0, i), insn, b);
+                   emit_insn_before (XVECEXP (s, 0, i), insn);
                }
            }