2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 #include <isl_ctx_private.h>
13 void isl_seq_clr(isl_int *p, unsigned len)
16 for (i = 0; i < len; ++i)
17 isl_int_set_si(p[i], 0);
20 void isl_seq_set(isl_int *p, isl_int v, unsigned len)
23 for (i = 0; i < len; ++i)
27 void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
30 for (i = 0; i < len; ++i)
31 isl_int_neg(dst[i], src[i]);
34 void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len)
37 for (i = 0; i < len; ++i)
38 isl_int_set(dst[i], src[i]);
41 void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
44 for (i = 0; i < len; ++i)
45 isl_int_submul(dst[i], f, src[i]);
48 void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
51 for (i = 0; i < len; ++i)
52 isl_int_addmul(dst[i], f, src[i]);
55 void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len)
58 for (i = 0; i < len; ++i)
59 isl_int_swap_or_set(dst[i], src[i]);
62 void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len)
65 for (i = 0; i < len; ++i)
66 isl_int_mul(dst[i], src[i], m);
69 void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len)
72 for (i = 0; i < len; ++i)
73 isl_int_divexact(dst[i], src[i], m);
76 void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
79 for (i = 0; i < len; ++i)
80 isl_int_cdiv_q(dst[i], src[i], m);
83 void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
86 for (i = 0; i < len; ++i)
87 isl_int_fdiv_q(dst[i], src[i], m);
90 void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len)
93 for (i = 0; i < len; ++i)
94 isl_int_fdiv_r(dst[i], src[i], m);
97 void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1,
98 isl_int m2, isl_int *src2, unsigned len)
104 for (i = 0; i < len; ++i) {
105 isl_int_mul(tmp, m1, src1[i]);
106 isl_int_addmul(tmp, m2, src2[i]);
107 isl_int_set(dst[i], tmp);
113 * Let d = dst[pos] and s = src[pos]
114 * dst is replaced by |s| dst - sgn(s)d src
116 void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len,
122 if (isl_int_is_zero(dst[pos]))
128 isl_int_gcd(a, src[pos], dst[pos]);
129 isl_int_divexact(b, dst[pos], a);
130 if (isl_int_is_pos(src[pos]))
132 isl_int_divexact(a, src[pos], a);
134 isl_seq_combine(dst, a, dst, b, src, len);
137 isl_int_mul(*m, *m, a);
143 int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
146 for (i = 0; i < len; ++i)
147 if (isl_int_ne(p1[i], p2[i]))
152 int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
156 for (i = 0; i < len; ++i)
157 if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0)
162 int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
166 for (i = 0; i < len; ++i) {
167 if (isl_int_abs_ne(p1[i], p2[i]))
169 if (isl_int_is_zero(p1[i]))
171 if (isl_int_eq(p1[i], p2[i]))
177 int isl_seq_first_non_zero(isl_int *p, unsigned len)
181 for (i = 0; i < len; ++i)
182 if (!isl_int_is_zero(p[i]))
187 int isl_seq_last_non_zero(isl_int *p, unsigned len)
191 for (i = len - 1; i >= 0; --i)
192 if (!isl_int_is_zero(p[i]))
197 int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
199 int i, min = isl_seq_first_non_zero(p, len);
202 for (i = min + 1; i < len; ++i) {
203 if (isl_int_is_zero(p[i]))
205 if (isl_int_abs_lt(p[i], p[min]))
211 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd)
213 int i, min = isl_seq_abs_min_non_zero(p, len);
216 isl_int_set_si(*gcd, 0);
219 isl_int_abs(*gcd, p[min]);
220 for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) {
223 if (isl_int_is_zero(p[i]))
225 isl_int_gcd(*gcd, *gcd, p[i]);
229 void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
233 isl_seq_gcd(p, len, &ctx->normalize_gcd);
234 if (!isl_int_is_zero(ctx->normalize_gcd) &&
235 !isl_int_is_one(ctx->normalize_gcd))
236 isl_seq_scale_down(p, p, ctx->normalize_gcd, len);
239 void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
244 isl_int_set_si(*lcm, 1);
247 isl_int_set(*lcm, p[0]);
248 for (i = 1; i < len; ++i)
249 isl_int_lcm(*lcm, *lcm, p[i]);
252 void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len,
257 isl_int_set_si(*prod, 0);
260 isl_int_mul(*prod, p1[0], p2[0]);
261 for (i = 1; i < len; ++i)
262 isl_int_addmul(*prod, p1[i], p2[i]);
265 uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash)
268 for (i = 0; i < len; ++i) {
269 if (isl_int_is_zero(p[i]))
273 hash = isl_int_hash(p[i], hash);
278 uint32_t isl_seq_get_hash(isl_int *p, unsigned len)
280 uint32_t hash = isl_hash_init();
282 return isl_seq_hash(p, len, hash);
285 uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits)
289 hash = isl_seq_get_hash(p, len);
290 return isl_hash_bits(hash, bits);