[thirdparty/gcc.git] / gcc / lambda.h

/* Lambda matrix and vector interface.
   Copyright (C) 2003, 2004, 2005, 2006 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
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
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, 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.  */

#ifndef LAMBDA_H
#define LAMBDA_H

#include "vec.h"

/* An integer vector.  A vector formally consists of an element of a vector
   space. A vector space is a set that is closed under vector addition
   and scalar multiplication.  In this vector space, an element is a list of
   integers.  */
typedef int *lambda_vector;

DEF_VEC_P(lambda_vector);
DEF_VEC_ALLOC_P(lambda_vector,heap);

/* An integer matrix.  A matrix consists of m vectors of length n (IE
   all vectors are the same length).  */
typedef lambda_vector *lambda_matrix;

/* A transformation matrix, which is a self-contained ROWSIZE x COLSIZE
   matrix.  Rather than use floats, we simply keep a single DENOMINATOR that
   represents the denominator for every element in the matrix.  */
typedef struct
{
  lambda_matrix matrix;
  int rowsize;
  int colsize;
  int denominator;
} *lambda_trans_matrix;
#define LTM_MATRIX(T) ((T)->matrix)
#define LTM_ROWSIZE(T) ((T)->rowsize)
#define LTM_COLSIZE(T) ((T)->colsize)
#define LTM_DENOMINATOR(T) ((T)->denominator)

/* A vector representing a statement in the body of a loop.
   The COEFFICIENTS vector contains a coefficient for each induction variable
   in the loop nest containing the statement.
   The DENOMINATOR represents the denominator for each coefficient in the
   COEFFICIENT vector.

   This structure is used during code generation in order to rewrite the old
   induction variable uses in a statement in terms of the newly created
   induction variables.  */
typedef struct
{
  lambda_vector coefficients;
  int size;
  int denominator;
} *lambda_body_vector;
#define LBV_COEFFICIENTS(T) ((T)->coefficients)
#define LBV_SIZE(T) ((T)->size)
#define LBV_DENOMINATOR(T) ((T)->denominator)

/* Piecewise linear expression.  
   This structure represents a linear expression with terms for the invariants
   and induction variables of a loop. 
   COEFFICIENTS is a vector of coefficients for the induction variables, one
   per loop in the loop nest.
   CONSTANT is the constant portion of the linear expression
   INVARIANT_COEFFICIENTS is a vector of coefficients for the loop invariants,
   one per invariant.
   DENOMINATOR is the denominator for all of the coefficients and constants in
   the expression.  
   The linear expressions can be linked together using the NEXT field, in
   order to represent MAX or MIN of a group of linear expressions.  */
typedef struct lambda_linear_expression_s
{
  lambda_vector coefficients;
  int constant;
  lambda_vector invariant_coefficients;
  int denominator;
  struct lambda_linear_expression_s *next;
} *lambda_linear_expression;

#define LLE_COEFFICIENTS(T) ((T)->coefficients)
#define LLE_CONSTANT(T) ((T)->constant)
#define LLE_INVARIANT_COEFFICIENTS(T) ((T)->invariant_coefficients)
#define LLE_DENOMINATOR(T) ((T)->denominator)
#define LLE_NEXT(T) ((T)->next)

lambda_linear_expression lambda_linear_expression_new (int, int);
void print_lambda_linear_expression (FILE *, lambda_linear_expression, int,
				     int, char);

/* Loop structure.  Our loop structure consists of a constant representing the
   STEP of the loop, a set of linear expressions representing the LOWER_BOUND
   of the loop, a set of linear expressions representing the UPPER_BOUND of
   the loop, and a set of linear expressions representing the LINEAR_OFFSET of
   the loop.  The linear offset is a set of linear expressions that are
   applied to *both* the lower bound, and the upper bound.  */
typedef struct lambda_loop_s
{
  lambda_linear_expression lower_bound;
  lambda_linear_expression upper_bound;
  lambda_linear_expression linear_offset;
  int step;
} *lambda_loop;

#define LL_LOWER_BOUND(T) ((T)->lower_bound)
#define LL_UPPER_BOUND(T) ((T)->upper_bound)
#define LL_LINEAR_OFFSET(T) ((T)->linear_offset)
#define LL_STEP(T)   ((T)->step)

/* Loop nest structure.  
   The loop nest structure consists of a set of loop structures (defined
   above) in LOOPS, along with an integer representing the DEPTH of the loop,
   and an integer representing the number of INVARIANTS in the loop.  Both of
   these integers are used to size the associated coefficient vectors in the
   linear expression structures.  */
typedef struct
{
  lambda_loop *loops;
  int depth;
  int invariants;
} *lambda_loopnest;

#define LN_LOOPS(T) ((T)->loops)
#define LN_DEPTH(T) ((T)->depth)
#define LN_INVARIANTS(T) ((T)->invariants)

lambda_loopnest lambda_loopnest_new (int, int);
lambda_loopnest lambda_loopnest_transform (lambda_loopnest, lambda_trans_matrix);
struct loop;
struct loops;
bool perfect_nest_p (struct loop *);
void print_lambda_loopnest (FILE *, lambda_loopnest, char);

#define lambda_loop_new() (lambda_loop) ggc_alloc_cleared (sizeof (struct lambda_loop_s))

void print_lambda_loop (FILE *, lambda_loop, int, int, char);

lambda_matrix lambda_matrix_new (int, int);

void lambda_matrix_id (lambda_matrix, int);
bool lambda_matrix_id_p (lambda_matrix, int);
void lambda_matrix_copy (lambda_matrix, lambda_matrix, int, int);
void lambda_matrix_negate (lambda_matrix, lambda_matrix, int, int);
void lambda_matrix_transpose (lambda_matrix, lambda_matrix, int, int);
void lambda_matrix_add (lambda_matrix, lambda_matrix, lambda_matrix, int,
			int);
void lambda_matrix_add_mc (lambda_matrix, int, lambda_matrix, int,
			   lambda_matrix, int, int);
void lambda_matrix_mult (lambda_matrix, lambda_matrix, lambda_matrix,
			 int, int, int);
void lambda_matrix_delete_rows (lambda_matrix, int, int, int);
void lambda_matrix_row_exchange (lambda_matrix, int, int);
void lambda_matrix_row_add (lambda_matrix, int, int, int, int);
void lambda_matrix_row_negate (lambda_matrix mat, int, int);
void lambda_matrix_row_mc (lambda_matrix, int, int, int);
void lambda_matrix_col_exchange (lambda_matrix, int, int, int);
void lambda_matrix_col_add (lambda_matrix, int, int, int, int);
void lambda_matrix_col_negate (lambda_matrix, int, int);
void lambda_matrix_col_mc (lambda_matrix, int, int, int);
int lambda_matrix_inverse (lambda_matrix, lambda_matrix, int);
void lambda_matrix_hermite (lambda_matrix, int, lambda_matrix, lambda_matrix);
void lambda_matrix_left_hermite (lambda_matrix, int, int, lambda_matrix, lambda_matrix);
void lambda_matrix_right_hermite (lambda_matrix, int, int, lambda_matrix, lambda_matrix);
int lambda_matrix_first_nz_vec (lambda_matrix, int, int, int);
void lambda_matrix_project_to_null (lambda_matrix, int, int, int, 
				    lambda_vector);
void print_lambda_matrix (FILE *, lambda_matrix, int, int);

lambda_trans_matrix lambda_trans_matrix_new (int, int);
bool lambda_trans_matrix_nonsingular_p (lambda_trans_matrix);
bool lambda_trans_matrix_fullrank_p (lambda_trans_matrix);
int lambda_trans_matrix_rank (lambda_trans_matrix);
lambda_trans_matrix lambda_trans_matrix_basis (lambda_trans_matrix);
lambda_trans_matrix lambda_trans_matrix_padding (lambda_trans_matrix);
lambda_trans_matrix lambda_trans_matrix_inverse (lambda_trans_matrix);
void print_lambda_trans_matrix (FILE *, lambda_trans_matrix);
void lambda_matrix_vector_mult (lambda_matrix, int, int, lambda_vector, 
				lambda_vector);
bool lambda_trans_matrix_id_p (lambda_trans_matrix);

lambda_body_vector lambda_body_vector_new (int);
lambda_body_vector lambda_body_vector_compute_new (lambda_trans_matrix, 
						   lambda_body_vector);
void print_lambda_body_vector (FILE *, lambda_body_vector);
lambda_loopnest gcc_loopnest_to_lambda_loopnest (struct loops *,
						 struct loop *,
						 VEC(tree,heap) **,
						 VEC(tree,heap) **,
						 bool);
void lambda_loopnest_to_gcc_loopnest (struct loop *,
				      VEC(tree,heap) *, VEC(tree,heap) *,
				      lambda_loopnest, lambda_trans_matrix);


static inline void lambda_vector_negate (lambda_vector, lambda_vector, int);
static inline void lambda_vector_mult_const (lambda_vector, lambda_vector, int, int);
static inline void lambda_vector_add (lambda_vector, lambda_vector,
				      lambda_vector, int);
static inline void lambda_vector_add_mc (lambda_vector, int, lambda_vector, int,
					 lambda_vector, int);
static inline void lambda_vector_copy (lambda_vector, lambda_vector, int);
static inline bool lambda_vector_zerop (lambda_vector, int);
static inline void lambda_vector_clear (lambda_vector, int);
static inline bool lambda_vector_equal (lambda_vector, lambda_vector, int);
static inline int lambda_vector_min_nz (lambda_vector, int, int);
static inline int lambda_vector_first_nz (lambda_vector, int, int);
static inline void print_lambda_vector (FILE *, lambda_vector, int);

/* Allocate a new vector of given SIZE.  */

static inline lambda_vector
lambda_vector_new (int size)
{
  return GGC_CNEWVEC (int, size);
}


/* Multiply vector VEC1 of length SIZE by a constant CONST1,
   and store the result in VEC2.  */

static inline void
lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2,
			  int size, int const1)
{
  int i;

  if (const1 == 0)
    lambda_vector_clear (vec2, size);
  else
    for (i = 0; i < size; i++)
      vec2[i] = const1 * vec1[i];
}

/* Negate vector VEC1 with length SIZE and store it in VEC2.  */

static inline void 
lambda_vector_negate (lambda_vector vec1, lambda_vector vec2,
		      int size)
{
  lambda_vector_mult_const (vec1, vec2, size, -1);
}

/* VEC3 = VEC1+VEC2, where all three the vectors are of length SIZE.  */

static inline void
lambda_vector_add (lambda_vector vec1, lambda_vector vec2,
		   lambda_vector vec3, int size)
{
  int i;
  for (i = 0; i < size; i++)
    vec3[i] = vec1[i] + vec2[i];
}

/* VEC3 = CONSTANT1*VEC1 + CONSTANT2*VEC2.  All vectors have length SIZE.  */

static inline void
lambda_vector_add_mc (lambda_vector vec1, int const1,
		      lambda_vector vec2, int const2,
		      lambda_vector vec3, int size)
{
  int i;
  for (i = 0; i < size; i++)
    vec3[i] = const1 * vec1[i] + const2 * vec2[i];
}

/* Copy the elements of vector VEC1 with length SIZE to VEC2.  */

static inline void
lambda_vector_copy (lambda_vector vec1, lambda_vector vec2,
		    int size)
{
  memcpy (vec2, vec1, size * sizeof (*vec1));
}

/* Return true if vector VEC1 of length SIZE is the zero vector.  */

static inline bool 
lambda_vector_zerop (lambda_vector vec1, int size)
{
  int i;
  for (i = 0; i < size; i++)
    if (vec1[i] != 0)
      return false;
  return true;
}

/* Clear out vector VEC1 of length SIZE.  */

static inline void
lambda_vector_clear (lambda_vector vec1, int size)
{
  memset (vec1, 0, size * sizeof (*vec1));
}

/* Return true if two vectors are equal.  */
 
static inline bool
lambda_vector_equal (lambda_vector vec1, lambda_vector vec2, int size)
{
  int i;
  for (i = 0; i < size; i++)
    if (vec1[i] != vec2[i])
      return false;
  return true;
}

/* Return the minimum nonzero element in vector VEC1 between START and N.
   We must have START <= N.  */

static inline int
lambda_vector_min_nz (lambda_vector vec1, int n, int start)
{
  int j;
  int min = -1;

  gcc_assert (start <= n);
  for (j = start; j < n; j++)
    {
      if (vec1[j])
	if (min < 0 || vec1[j] < vec1[min])
	  min = j;
    }
  gcc_assert (min >= 0);

  return min;
}

/* Return the first nonzero element of vector VEC1 between START and N.
   We must have START <= N.   Returns N if VEC1 is the zero vector.  */

static inline int
lambda_vector_first_nz (lambda_vector vec1, int n, int start)
{
  int j = start;
  while (j < n && vec1[j] == 0)
    j++;
  return j;
}


/* Multiply a vector by a matrix.  */

static inline void
lambda_vector_matrix_mult (lambda_vector vect, int m, lambda_matrix mat, 
			   int n, lambda_vector dest)
{
  int i, j;
  lambda_vector_clear (dest, n);
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      dest[i] += mat[j][i] * vect[j];
}


/* Print out a vector VEC of length N to OUTFILE.  */

static inline void
print_lambda_vector (FILE * outfile, lambda_vector vector, int n)
{
  int i;

  for (i = 0; i < n; i++)
    fprintf (outfile, "%3d ", vector[i]);
  fprintf (outfile, "\n");
}

/* Compute the greatest common divisor of two numbers using
   Euclid's algorithm.  */

static inline int 
gcd (int a, int b)
{
  int x, y, z;

  x = abs (a);
  y = abs (b);

  while (x > 0)
    {
      z = y % x;
      y = x;
      x = z;
    }

  return y;
}

/* Compute the greatest common divisor of a VECTOR of SIZE numbers.  */

static inline int
lambda_vector_gcd (lambda_vector vector, int size)
{
  int i;
  int gcd1 = 0;

  if (size > 0)
    {
      gcd1 = vector[0];
      for (i = 1; i < size; i++)
	gcd1 = gcd (gcd1, vector[i]);
    }
  return gcd1;
}

/* Returns true when the vector V is lexicographically positive, in
   other words, when the first nonzero element is positive.  */

static inline bool
lambda_vector_lexico_pos (lambda_vector v, 
			  unsigned n)
{
  unsigned i;
  for (i = 0; i < n; i++)
    {
      if (v[i] == 0)
	continue;
      if (v[i] < 0)
	return false;
      if (v[i] > 0)
	return true;
    }
  return true;
}

#endif /* LAMBDA_H  */
Commit	Line	Data
98975653	1	/* Lambda matrix and vector interface.
0ff4040e	2	Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
56cf8686 SP	3	Contributed by Daniel Berlin <dberlin@dberlin.org>
	4
	5	This file is part of GCC.
	6
	7	GCC is free software; you can redistribute it and/or modify it under
	8	the terms of the GNU General Public License as published by the Free
	9	Software Foundation; either version 2, or (at your option) any later
	10	version.
	11
	12	GCC is distributed in the hope that it will be useful, but WITHOUT ANY
	13	WARRANTY; without even the implied warranty of MERCHANTABILITY or
	14	FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
	15	for more details.
	16
	17	You should have received a copy of the GNU General Public License
	18	along with GCC; see the file COPYING. If not, write to the Free
366ccddb KC	19	Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
366ccddb KC	20	02110-1301, USA. */
98975653	21
56cf8686 SP	22	#ifndef LAMBDA_H
	23	#define LAMBDA_H
	24
36d59cf7 DB	25	#include "vec.h"
36d59cf7 DB	26
98975653 DB	27	/* An integer vector. A vector formally consists of an element of a vector
	28	space. A vector space is a set that is closed under vector addition
	29	and scalar multiplication. In this vector space, an element is a list of
	30	integers. */
56cf8686	31	typedef int *lambda_vector;
c4bda9f0	32
304afda6 SP	33	DEF_VEC_P(lambda_vector);
	34	DEF_VEC_ALLOC_P(lambda_vector,heap);
	35
98975653 DB	36	/* An integer matrix. A matrix consists of m vectors of length n (IE
	37	all vectors are the same length). */
	38	typedef lambda_vector *lambda_matrix;
	39
c4bda9f0 DB	40	/* A transformation matrix, which is a self-contained ROWSIZE x COLSIZE
	41	matrix. Rather than use floats, we simply keep a single DENOMINATOR that
	42	represents the denominator for every element in the matrix. */
36d59cf7 DB	43	typedef struct
	44	{
	45	lambda_matrix matrix;
	46	int rowsize;
	47	int colsize;
	48	int denominator;
	49	} *lambda_trans_matrix;
	50	#define LTM_MATRIX(T) ((T)->matrix)
	51	#define LTM_ROWSIZE(T) ((T)->rowsize)
	52	#define LTM_COLSIZE(T) ((T)->colsize)
	53	#define LTM_DENOMINATOR(T) ((T)->denominator)
	54
c4bda9f0 DB	55	/* A vector representing a statement in the body of a loop.
	56	The COEFFICIENTS vector contains a coefficient for each induction variable
	57	in the loop nest containing the statement.
	58	The DENOMINATOR represents the denominator for each coefficient in the
	59	COEFFICIENT vector.
	60
	61	This structure is used during code generation in order to rewrite the old
	62	induction variable uses in a statement in terms of the newly created
	63	induction variables. */
36d59cf7 DB	64	typedef struct
	65	{
	66	lambda_vector coefficients;
	67	int size;
	68	int denominator;
	69	} *lambda_body_vector;
	70	#define LBV_COEFFICIENTS(T) ((T)->coefficients)
	71	#define LBV_SIZE(T) ((T)->size)
	72	#define LBV_DENOMINATOR(T) ((T)->denominator)
	73
c4bda9f0 DB	74	/* Piecewise linear expression.
	75	This structure represents a linear expression with terms for the invariants
	76	and induction variables of a loop.
	77	COEFFICIENTS is a vector of coefficients for the induction variables, one
	78	per loop in the loop nest.
	79	CONSTANT is the constant portion of the linear expression
	80	INVARIANT_COEFFICIENTS is a vector of coefficients for the loop invariants,
	81	one per invariant.
	82	DENOMINATOR is the denominator for all of the coefficients and constants in
	83	the expression.
	84	The linear expressions can be linked together using the NEXT field, in
	85	order to represent MAX or MIN of a group of linear expressions. */
36d59cf7 DB	86	typedef struct lambda_linear_expression_s
	87	{
	88	lambda_vector coefficients;
	89	int constant;
	90	lambda_vector invariant_coefficients;
	91	int denominator;
	92	struct lambda_linear_expression_s *next;
	93	} *lambda_linear_expression;
	94
	95	#define LLE_COEFFICIENTS(T) ((T)->coefficients)
	96	#define LLE_CONSTANT(T) ((T)->constant)
	97	#define LLE_INVARIANT_COEFFICIENTS(T) ((T)->invariant_coefficients)
	98	#define LLE_DENOMINATOR(T) ((T)->denominator)
	99	#define LLE_NEXT(T) ((T)->next)
	100
	101	lambda_linear_expression lambda_linear_expression_new (int, int);
	102	void print_lambda_linear_expression (FILE *, lambda_linear_expression, int,
	103	int, char);
	104
c4bda9f0 DB	105	/* Loop structure. Our loop structure consists of a constant representing the
	106	STEP of the loop, a set of linear expressions representing the LOWER_BOUND
	107	of the loop, a set of linear expressions representing the UPPER_BOUND of
	108	the loop, and a set of linear expressions representing the LINEAR_OFFSET of
	109	the loop. The linear offset is a set of linear expressions that are
	110	applied to both the lower bound, and the upper bound. */
36d59cf7 DB	111	typedef struct lambda_loop_s
	112	{
	113	lambda_linear_expression lower_bound;
	114	lambda_linear_expression upper_bound;
	115	lambda_linear_expression linear_offset;
	116	int step;
	117	} *lambda_loop;
	118
	119	#define LL_LOWER_BOUND(T) ((T)->lower_bound)
	120	#define LL_UPPER_BOUND(T) ((T)->upper_bound)
	121	#define LL_LINEAR_OFFSET(T) ((T)->linear_offset)
	122	#define LL_STEP(T) ((T)->step)
	123
c4bda9f0 DB	124	/* Loop nest structure.
	125	The loop nest structure consists of a set of loop structures (defined
	126	above) in LOOPS, along with an integer representing the DEPTH of the loop,
	127	and an integer representing the number of INVARIANTS in the loop. Both of
	128	these integers are used to size the associated coefficient vectors in the
	129	linear expression structures. */
36d59cf7 DB	130	typedef struct
	131	{
	132	lambda_loop *loops;
	133	int depth;
	134	int invariants;
	135	} *lambda_loopnest;
	136
	137	#define LN_LOOPS(T) ((T)->loops)
	138	#define LN_DEPTH(T) ((T)->depth)
	139	#define LN_INVARIANTS(T) ((T)->invariants)
	140
	141	lambda_loopnest lambda_loopnest_new (int, int);
	142	lambda_loopnest lambda_loopnest_transform (lambda_loopnest, lambda_trans_matrix);
f67d92e9 DB	143	struct loop;
	144	struct loops;
	145	bool perfect_nest_p (struct loop *);
36d59cf7 DB	146	void print_lambda_loopnest (FILE *, lambda_loopnest, char);
	147
	148	#define lambda_loop_new() (lambda_loop) ggc_alloc_cleared (sizeof (struct lambda_loop_s))
	149
	150	void print_lambda_loop (FILE *, lambda_loop, int, int, char);
	151
98975653 DB	152	lambda_matrix lambda_matrix_new (int, int);
	153
	154	void lambda_matrix_id (lambda_matrix, int);
f67d92e9	155	bool lambda_matrix_id_p (lambda_matrix, int);
98975653 DB	156	void lambda_matrix_copy (lambda_matrix, lambda_matrix, int, int);
	157	void lambda_matrix_negate (lambda_matrix, lambda_matrix, int, int);
	158	void lambda_matrix_transpose (lambda_matrix, lambda_matrix, int, int);
	159	void lambda_matrix_add (lambda_matrix, lambda_matrix, lambda_matrix, int,
	160	int);
	161	void lambda_matrix_add_mc (lambda_matrix, int, lambda_matrix, int,
	162	lambda_matrix, int, int);
	163	void lambda_matrix_mult (lambda_matrix, lambda_matrix, lambda_matrix,
	164	int, int, int);
	165	void lambda_matrix_delete_rows (lambda_matrix, int, int, int);
	166	void lambda_matrix_row_exchange (lambda_matrix, int, int);
	167	void lambda_matrix_row_add (lambda_matrix, int, int, int, int);
	168	void lambda_matrix_row_negate (lambda_matrix mat, int, int);
	169	void lambda_matrix_row_mc (lambda_matrix, int, int, int);
	170	void lambda_matrix_col_exchange (lambda_matrix, int, int, int);
	171	void lambda_matrix_col_add (lambda_matrix, int, int, int, int);
	172	void lambda_matrix_col_negate (lambda_matrix, int, int);
	173	void lambda_matrix_col_mc (lambda_matrix, int, int, int);
	174	int lambda_matrix_inverse (lambda_matrix, lambda_matrix, int);
	175	void lambda_matrix_hermite (lambda_matrix, int, lambda_matrix, lambda_matrix);
	176	void lambda_matrix_left_hermite (lambda_matrix, int, int, lambda_matrix, lambda_matrix);
	177	void lambda_matrix_right_hermite (lambda_matrix, int, int, lambda_matrix, lambda_matrix);
	178	int lambda_matrix_first_nz_vec (lambda_matrix, int, int, int);
	179	void lambda_matrix_project_to_null (lambda_matrix, int, int, int,
	180	lambda_vector);
	181	void print_lambda_matrix (FILE *, lambda_matrix, int, int);
	182
36d59cf7 DB	183	lambda_trans_matrix lambda_trans_matrix_new (int, int);
	184	bool lambda_trans_matrix_nonsingular_p (lambda_trans_matrix);
	185	bool lambda_trans_matrix_fullrank_p (lambda_trans_matrix);
	186	int lambda_trans_matrix_rank (lambda_trans_matrix);
	187	lambda_trans_matrix lambda_trans_matrix_basis (lambda_trans_matrix);
	188	lambda_trans_matrix lambda_trans_matrix_padding (lambda_trans_matrix);
	189	lambda_trans_matrix lambda_trans_matrix_inverse (lambda_trans_matrix);
	190	void print_lambda_trans_matrix (FILE *, lambda_trans_matrix);
98975653 DB	191	void lambda_matrix_vector_mult (lambda_matrix, int, int, lambda_vector,
98975653 DB	192	lambda_vector);
f67d92e9	193	bool lambda_trans_matrix_id_p (lambda_trans_matrix);
98975653	194
36d59cf7 DB	195	lambda_body_vector lambda_body_vector_new (int);
	196	lambda_body_vector lambda_body_vector_compute_new (lambda_trans_matrix,
	197	lambda_body_vector);
	198	void print_lambda_body_vector (FILE *, lambda_body_vector);
f67d92e9 DB	199	lambda_loopnest gcc_loopnest_to_lambda_loopnest (struct loops *,
f67d92e9 DB	200	struct loop *,
e6ef8d81 NS	201	VEC(tree,heap) **,
e6ef8d81 NS	202	VEC(tree,heap) **,
f67d92e9	203	bool);
e6ef8d81 NS	204	void lambda_loopnest_to_gcc_loopnest (struct loop *,
	205	VEC(tree,heap) , VEC(tree,heap) ,
	206	lambda_loopnest, lambda_trans_matrix);
36d59cf7 DB	207
36d59cf7 DB	208
98975653 DB	209	static inline void lambda_vector_negate (lambda_vector, lambda_vector, int);
	210	static inline void lambda_vector_mult_const (lambda_vector, lambda_vector, int, int);
	211	static inline void lambda_vector_add (lambda_vector, lambda_vector,
	212	lambda_vector, int);
	213	static inline void lambda_vector_add_mc (lambda_vector, int, lambda_vector, int,
	214	lambda_vector, int);
	215	static inline void lambda_vector_copy (lambda_vector, lambda_vector, int);
	216	static inline bool lambda_vector_zerop (lambda_vector, int);
	217	static inline void lambda_vector_clear (lambda_vector, int);
	218	static inline bool lambda_vector_equal (lambda_vector, lambda_vector, int);
	219	static inline int lambda_vector_min_nz (lambda_vector, int, int);
	220	static inline int lambda_vector_first_nz (lambda_vector, int, int);
	221	static inline void print_lambda_vector (FILE *, lambda_vector, int);
56cf8686 SP	222
	223	/* Allocate a new vector of given SIZE. */
	224
	225	static inline lambda_vector
	226	lambda_vector_new (int size)
	227	{
cceb1885	228	return GGC_CNEWVEC (int, size);
56cf8686 SP	229	}
56cf8686 SP	230
98975653 DB	231
	232
	233	/* Multiply vector VEC1 of length SIZE by a constant CONST1,
	234	and store the result in VEC2. */
	235
	236	static inline void
	237	lambda_vector_mult_const (lambda_vector vec1, lambda_vector vec2,
	238	int size, int const1)
	239	{
	240	int i;
	241
	242	if (const1 == 0)
	243	lambda_vector_clear (vec2, size);
	244	else
	245	for (i = 0; i < size; i++)
	246	vec2[i] = const1 * vec1[i];
	247	}
	248
	249	/* Negate vector VEC1 with length SIZE and store it in VEC2. */
	250
	251	static inline void
	252	lambda_vector_negate (lambda_vector vec1, lambda_vector vec2,
	253	int size)
	254	{
	255	lambda_vector_mult_const (vec1, vec2, size, -1);
	256	}
	257
	258	/* VEC3 = VEC1+VEC2, where all three the vectors are of length SIZE. */
	259
	260	static inline void
	261	lambda_vector_add (lambda_vector vec1, lambda_vector vec2,
	262	lambda_vector vec3, int size)
	263	{
	264	int i;
	265	for (i = 0; i < size; i++)
	266	vec3[i] = vec1[i] + vec2[i];
	267	}
	268
	269	/* VEC3 = CONSTANT1VEC1 + CONSTANT2VEC2. All vectors have length SIZE. */
	270
	271	static inline void
	272	lambda_vector_add_mc (lambda_vector vec1, int const1,
	273	lambda_vector vec2, int const2,
	274	lambda_vector vec3, int size)
	275	{
	276	int i;
	277	for (i = 0; i < size; i++)
	278	vec3[i] = const1 * vec1[i] + const2 * vec2[i];
	279	}
	280
	281	/* Copy the elements of vector VEC1 with length SIZE to VEC2. */
	282
	283	static inline void
	284	lambda_vector_copy (lambda_vector vec1, lambda_vector vec2,
	285	int size)
	286	{
	287	memcpy (vec2, vec1, size * sizeof (*vec1));
	288	}
	289
	290	/* Return true if vector VEC1 of length SIZE is the zero vector. */
	291
	292	static inline bool
	293	lambda_vector_zerop (lambda_vector vec1, int size)
	294	{
295	int i;
296	for (i = 0; i < size; i++)
297	if (vec1[i] != 0)
298	return false;
299	return true;
300	}
301
56cf8686 SP	302	/* Clear out vector VEC1 of length SIZE. */
	303
	304	static inline void
	305	lambda_vector_clear (lambda_vector vec1, int size)
	306	{
98975653	307	memset (vec1, 0, size * sizeof (*vec1));
56cf8686 SP	308	}
56cf8686 SP	309
98975653 DB	310	/* Return true if two vectors are equal. */
	311
	312	static inline bool
	313	lambda_vector_equal (lambda_vector vec1, lambda_vector vec2, int size)
	314	{
	315	int i;
	316	for (i = 0; i < size; i++)
	317	if (vec1[i] != vec2[i])
	318	return false;
	319	return true;
	320	}
	321
8e3c61c5	322	/* Return the minimum nonzero element in vector VEC1 between START and N.
98975653 DB	323	We must have START <= N. */
	324
	325	static inline int
	326	lambda_vector_min_nz (lambda_vector vec1, int n, int start)
	327	{
	328	int j;
	329	int min = -1;
0e61db61 NS	330
0e61db61 NS	331	gcc_assert (start <= n);
98975653 DB	332	for (j = start; j < n; j++)
	333	{
	334	if (vec1[j])
	335	if (min < 0 \|\| vec1[j] < vec1[min])
	336	min = j;
	337	}
0e61db61	338	gcc_assert (min >= 0);
98975653 DB	339
	340	return min;
	341	}
	342
	343	/* Return the first nonzero element of vector VEC1 between START and N.
	344	We must have START <= N. Returns N if VEC1 is the zero vector. */
	345
	346	static inline int
	347	lambda_vector_first_nz (lambda_vector vec1, int n, int start)
	348	{
	349	int j = start;
	350	while (j < n && vec1[j] == 0)
	351	j++;
	352	return j;
	353	}
	354
	355
	356	/* Multiply a vector by a matrix. */
	357
	358	static inline void
	359	lambda_vector_matrix_mult (lambda_vector vect, int m, lambda_matrix mat,
	360	int n, lambda_vector dest)
	361	{
	362	int i, j;
	363	lambda_vector_clear (dest, n);
	364	for (i = 0; i < n; i++)
	365	for (j = 0; j < m; j++)
	366	dest[i] += mat[j][i] * vect[j];
	367	}
	368
	369
56cf8686 SP	370	/* Print out a vector VEC of length N to OUTFILE. */
	371
	372	static inline void
	373	print_lambda_vector (FILE * outfile, lambda_vector vector, int n)
	374	{
	375	int i;
	376
	377	for (i = 0; i < n; i++)
	378	fprintf (outfile, "%3d ", vector[i]);
	379	fprintf (outfile, "\n");
	380	}
37b8a73b	381
0ff4040e SP	382	/* Compute the greatest common divisor of two numbers using
	383	Euclid's algorithm. */
	384
	385	static inline int
	386	gcd (int a, int b)
	387	{
	388	int x, y, z;
	389
	390	x = abs (a);
	391	y = abs (b);
	392
	393	while (x > 0)
	394	{
	395	z = y % x;
	396	y = x;
	397	x = z;
	398	}
	399
	400	return y;
	401	}
	402
	403	/* Compute the greatest common divisor of a VECTOR of SIZE numbers. */
	404
	405	static inline int
	406	lambda_vector_gcd (lambda_vector vector, int size)
	407	{
	408	int i;
	409	int gcd1 = 0;
	410
	411	if (size > 0)
	412	{
	413	gcd1 = vector[0];
	414	for (i = 1; i < size; i++)
	415	gcd1 = gcd (gcd1, vector[i]);
	416	}
	417	return gcd1;
	418	}
	419
37b8a73b SP	420	/* Returns true when the vector V is lexicographically positive, in
	421	other words, when the first nonzero element is positive. */
	422
	423	static inline bool
	424	lambda_vector_lexico_pos (lambda_vector v,
	425	unsigned n)
	426	{
	427	unsigned i;
	428	for (i = 0; i < n; i++)
	429	{
	430	if (v[i] == 0)
	431	continue;
	432	if (v[i] < 0)
	433	return false;
	434	if (v[i] > 0)
	435	return true;
	436	}
	437	return true;
	438	}
	439
56cf8686 SP	440	#endif /* LAMBDA_H */
56cf8686 SP	441