* params.def (PARAM_MAX_VARTRACK_SIZE): New.

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

diff --git a/gcc/lambda-mat.c b/gcc/lambda-mat.c
index 8de0e98..fb9098b 100644 (file)
--- a/gcc/lambda-mat.c
+++ b/gcc/lambda-mat.c
@@ -1,12 +1,12 @@
 /* Integer matrix math routines
-   Copyright (C) 2003, 2004 Free Software Foundation, Inc.
+   Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation, Inc.
    Contributed by Daniel Berlin <dberlin@dberlin.org>.
 
 This file is part of GCC.
 
 GCC is free software; you can redistribute it and/or modify it under
 the terms of the GNU General Public License as published by the Free
-Software Foundation; either version 2, or (at your option) any later
+Software Foundation; either version 3, or (at your option) any later
 version.
 
 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
@@ -15,19 +15,19 @@ FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 for more details.
 
 You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING.  If not, write to the Free
-Software Foundation, 59 Temple Place - Suite 330, Boston, MA
-02111-1307, USA.  */
+along with GCC; see the file COPYING3.  If not see
+<http://www.gnu.org/licenses/>.  */
+
 #include "config.h"
 #include "system.h"
 #include "coretypes.h"
 #include "tm.h"
 #include "ggc.h"
-#include "varray.h"
 #include "tree.h"
+#include "tree-flow.h"
 #include "lambda.h"
 
-static void lambda_matrix_get_column (lambda_matrix, int, int, 
+static void lambda_matrix_get_column (lambda_matrix, int, int,
                                      lambda_vector);
 
 /* Allocate a matrix of M rows x  N cols.  */
@@ -38,8 +38,8 @@ lambda_matrix_new (int m, int n)
   lambda_matrix mat;
   int i;
 
-  mat = ggc_alloc (m * sizeof (lambda_vector));
-  
+  mat = GGC_NEWVEC (lambda_vector, m);
+
   for (i = 0; i < m; i++)
     mat[i] = lambda_vector_new (n);
 
@@ -318,7 +318,7 @@ lambda_matrix_inverse (lambda_matrix mat, lambda_matrix inv, int n)
       a = mat[0][0];
       b = mat[1][0];
       c = mat[0][1];
-      d = mat[1][1];      
+      d = mat[1][1];
       inv[0][0] =  d;
       inv[0][1] = -c;
       inv[1][0] = -b;
@@ -483,7 +483,7 @@ lambda_matrix_hermite (lambda_matrix mat, int n,
 /* Given an M x N integer matrix A, this function determines an M x
    M unimodular matrix U, and an M x N echelon matrix S such that
    "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.  */
 
@@ -528,7 +528,7 @@ lambda_matrix_right_hermite (lambda_matrix A, int m, int n,
 /* Given an M x N integer matrix A, this function determines an M x M
    unimodular matrix V, and an M x N echelon matrix S such that "A =
    V.S".  This decomposition is also known as "left Hermite".
-   
+
    Ref: Algorithm 2.2 page 36 in "Loop Transformations for
    Restructuring Compilers" Utpal Banerjee.  */