#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. */
int i;
mat = GGC_NEWVEC (lambda_vector, m);
-
+
for (i = 0; i < m; i++)
mat[i] = lambda_vector_new (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;
/* 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. */
/* 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. */