Merge branch 'maint'
[isl.git] / isl_seq.c
blobdd80c1951cc38adfeceeb968e9a5ad8fb6fe43f6
1 /*
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
8 */
10 #include <isl_ctx_private.h>
11 #include <isl/seq.h>
13 void isl_seq_clr(isl_int *p, unsigned len)
15 int i;
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)
22 int i;
23 for (i = 0; i < len; ++i)
24 isl_int_set(p[i], v);
27 void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
29 int i;
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)
36 int i;
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)
43 int i;
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)
50 int i;
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)
57 int i;
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)
64 int i;
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)
71 int i;
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)
78 int i;
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)
85 int i;
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)
92 int i;
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)
100 int i;
101 isl_int tmp;
103 isl_int_init(tmp);
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);
109 isl_int_clear(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,
117 isl_int *m)
119 isl_int a;
120 isl_int b;
122 if (isl_int_is_zero(dst[pos]))
123 return;
125 isl_int_init(a);
126 isl_int_init(b);
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]))
131 isl_int_neg(b, b);
132 isl_int_divexact(a, src[pos], a);
133 isl_int_abs(a, a);
134 isl_seq_combine(dst, a, dst, b, src, len);
136 if (m)
137 isl_int_mul(*m, *m, a);
139 isl_int_clear(a);
140 isl_int_clear(b);
143 int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
145 int i;
146 for (i = 0; i < len; ++i)
147 if (isl_int_ne(p1[i], p2[i]))
148 return 0;
149 return 1;
152 int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
154 int i;
155 int cmp;
156 for (i = 0; i < len; ++i)
157 if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0)
158 return cmp;
159 return 0;
162 int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
164 int i;
166 for (i = 0; i < len; ++i) {
167 if (isl_int_abs_ne(p1[i], p2[i]))
168 return 0;
169 if (isl_int_is_zero(p1[i]))
170 continue;
171 if (isl_int_eq(p1[i], p2[i]))
172 return 0;
174 return 1;
177 int isl_seq_first_non_zero(isl_int *p, unsigned len)
179 int i;
181 for (i = 0; i < len; ++i)
182 if (!isl_int_is_zero(p[i]))
183 return i;
184 return -1;
187 int isl_seq_last_non_zero(isl_int *p, unsigned len)
189 int i;
191 for (i = len - 1; i >= 0; --i)
192 if (!isl_int_is_zero(p[i]))
193 return i;
194 return -1;
197 int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
199 int i, min = isl_seq_first_non_zero(p, len);
200 if (min < 0)
201 return -1;
202 for (i = min + 1; i < len; ++i) {
203 if (isl_int_is_zero(p[i]))
204 continue;
205 if (isl_int_abs_lt(p[i], p[min]))
206 min = i;
208 return 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);
215 if (min < 0) {
216 isl_int_set_si(*gcd, 0);
217 return;
219 isl_int_abs(*gcd, p[min]);
220 for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) {
221 if (i == min)
222 continue;
223 if (isl_int_is_zero(p[i]))
224 continue;
225 isl_int_gcd(*gcd, *gcd, p[i]);
229 void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
231 if (len == 0)
232 return;
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)
241 int i;
243 if (len == 0) {
244 isl_int_set_si(*lcm, 1);
245 return;
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,
253 isl_int *prod)
255 int i;
256 if (len == 0) {
257 isl_int_set_si(*prod, 0);
258 return;
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)
267 int i;
268 for (i = 0; i < len; ++i) {
269 if (isl_int_is_zero(p[i]))
270 continue;
271 hash *= 16777619;
272 hash ^= (i & 0xFF);
273 hash = isl_int_hash(p[i], hash);
275 return 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)
287 uint32_t hash;
289 hash = isl_seq_get_hash(p, len);
290 return isl_hash_bits(hash, bits);