Mercurial > hg > CbC > CbC_gcc
diff gcc/lambda-mat.c @ 55:77e2b8dfacca gcc-4.4.5
update it from 4.4.3 to 4.5.0
author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
---|---|
date | Fri, 12 Feb 2010 23:39:51 +0900 |
parents | a06113de4d67 |
children | b7f97abdc517 |
line wrap: on
line diff
--- a/gcc/lambda-mat.c Sun Feb 07 18:28:00 2010 +0900 +++ b/gcc/lambda-mat.c Fri Feb 12 23:39:51 2010 +0900 @@ -27,7 +27,7 @@ #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. */ @@ -39,7 +39,7 @@ int i; mat = GGC_NEWVEC (lambda_vector, m); - + for (i = 0; i < m; i++) mat[i] = lambda_vector_new (n); @@ -318,7 +318,7 @@ 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 @@ /* 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 @@ /* 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. */