* toplev.c (warn_deprecated_use): Correct logic for saying "type"

[pf3gnuchains/gcc-fork.git] / gcc / lambda-mat.c

diff --git a/gcc/lambda-mat.c b/gcc/lambda-mat.c
index 987fa5e..92437df 100644 (file)
--- a/gcc/lambda-mat.c
+++ b/gcc/lambda-mat.c
@@ -24,6 +24,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 #include "tm.h"
 #include "ggc.h"
 #include "varray.h"
+#include "tree.h"
 #include "lambda.h"
 
 static void lambda_matrix_get_column (lambda_matrix, int, int, 
@@ -154,7 +155,7 @@ lambda_matrix_get_column (lambda_matrix mat, int n, int col,
     vec[i] = mat[i][col];
 }
 
-/* Delete rows r1 to r2 (not including r2). */
+/* Delete rows r1 to r2 (not including r2).  */
 
 void
 lambda_matrix_delete_rows (lambda_matrix mat, int rows, int from, int to)
@@ -378,8 +379,7 @@ lambda_matrix_inverse_hard (lambda_matrix mat, lambda_matrix inv, int n)
       diagonal = row[j];
 
       /* If the matrix is singular, abort.  */
-      if (diagonal == 0)
-       abort ();
+      gcc_assert (diagonal != 0);
 
       determinant = determinant * diagonal;
 
@@ -462,7 +462,7 @@ lambda_matrix_hermite (lambda_matrix mat, int n,
    "U.A = S".  This decomposition is also known as "right Hermite".
    
    Ref: Algorithm 2.1 page 33 in "Loop Transformations for
-   Restructuring Compilers" Utpal Banerjee. */
+   Restructuring Compilers" Utpal Banerjee.  */
 
 void
 lambda_matrix_right_hermite (lambda_matrix A, int m, int n,
@@ -507,7 +507,7 @@ lambda_matrix_right_hermite (lambda_matrix A, int m, int n,
    V.S".  This decomposition is also known as "left Hermite".
    
    Ref: Algorithm 2.2 page 36 in "Loop Transformations for
-   Restructuring Compilers" Utpal Banerjee. */
+   Restructuring Compilers" Utpal Banerjee.  */
 
 void
 lambda_matrix_left_hermite (lambda_matrix A, int m, int n,