2018-11-08 Richard Biener <rguenther@suse.de>
+ * tree-data-ref.h (lambda_int): New typedef.
+ (lambda_vector_gcd): Adjust.
+ (lambda_vector_new): Likewise.
+ (lambda_matrix_new): Likewise.
+ * tree-data-ref.c (print_lambda_vector): Adjust.
+
+2018-11-08 Richard Biener <rguenther@suse.de>
+
PR tree-optimization/87929
* tree-complex.c (expand_complex_comparison): Clean EH.
int i;
for (i = 0; i < n; i++)
- fprintf (outfile, "%3d ", vector[i]);
+ fprintf (outfile, "%3d ", (int)vector[i]);
fprintf (outfile, "\n");
}
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;
+typedef HOST_WIDE_INT lambda_int;
+typedef lambda_int *lambda_vector;
/* An integer matrix. A matrix consists of m vectors of length n (IE
all vectors are the same length). */
/* Compute the greatest common divisor of a VECTOR of SIZE numbers. */
-static inline int
+static inline lambda_int
lambda_vector_gcd (lambda_vector vector, int size)
{
int i;
- int gcd1 = 0;
+ lambda_int gcd1 = 0;
if (size > 0)
{
lambda_vector_new (int size)
{
/* ??? We shouldn't abuse the GC allocator here. */
- return ggc_cleared_vec_alloc<int> (size);
+ return ggc_cleared_vec_alloc<lambda_int> (size);
}
/* Clear out vector VEC1 of length SIZE. */
mat = XOBNEWVEC (lambda_obstack, lambda_vector, m);
for (i = 0; i < m; i++)
- mat[i] = XOBNEWVEC (lambda_obstack, int, n);
+ mat[i] = XOBNEWVEC (lambda_obstack, lambda_int, n);
return mat;
}