isl_map_coalesce: handle more cases
[isl.git] / isl_seq.c
blob474f9becf22a1d3bd52e1e73c7c3d831186b9742
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_seq.h"
12 void isl_seq_clr(isl_int *p, unsigned len)
14 int i;
15 for (i = 0; i < len; ++i)
16 isl_int_set_si(p[i], 0);
19 void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
21 int i;
22 for (i = 0; i < len; ++i)
23 isl_int_neg(dst[i], src[i]);
26 void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len)
28 int i;
29 for (i = 0; i < len; ++i)
30 isl_int_set(dst[i], src[i]);
33 void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
35 int i;
36 for (i = 0; i < len; ++i)
37 isl_int_submul(dst[i], f, src[i]);
40 void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len)
42 int i;
43 for (i = 0; i < len; ++i)
44 isl_int_swap_or_set(dst[i], src[i]);
47 void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len)
49 int i;
50 for (i = 0; i < len; ++i)
51 isl_int_mul(dst[i], src[i], m);
54 void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len)
56 int i;
57 for (i = 0; i < len; ++i)
58 isl_int_divexact(dst[i], src[i], m);
61 void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
63 int i;
64 for (i = 0; i < len; ++i)
65 isl_int_cdiv_q(dst[i], src[i], m);
68 void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
70 int i;
71 for (i = 0; i < len; ++i)
72 isl_int_fdiv_q(dst[i], src[i], m);
75 void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len)
77 int i;
78 for (i = 0; i < len; ++i)
79 isl_int_fdiv_r(dst[i], src[i], m);
82 void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1,
83 isl_int m2, isl_int *src2, unsigned len)
85 int i;
86 isl_int tmp;
88 isl_int_init(tmp);
89 for (i = 0; i < len; ++i) {
90 isl_int_mul(tmp, m1, src1[i]);
91 isl_int_addmul(tmp, m2, src2[i]);
92 isl_int_set(dst[i], tmp);
94 isl_int_clear(tmp);
98 * Let d = dst[pos] and s = src[pos]
99 * dst is replaced by |s| dst - sgn(s)d src
101 void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len,
102 isl_int *m)
104 isl_int a;
105 isl_int b;
107 if (isl_int_is_zero(dst[pos]))
108 return;
110 isl_int_init(a);
111 isl_int_init(b);
113 isl_int_gcd(a, src[pos], dst[pos]);
114 isl_int_divexact(b, dst[pos], a);
115 if (isl_int_is_pos(src[pos]))
116 isl_int_neg(b, b);
117 isl_int_divexact(a, src[pos], a);
118 isl_int_abs(a, a);
119 isl_seq_combine(dst, a, dst, b, src, len);
121 if (m)
122 isl_int_mul(*m, *m, a);
124 isl_int_clear(a);
125 isl_int_clear(b);
128 int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
130 int i;
131 for (i = 0; i < len; ++i)
132 if (isl_int_ne(p1[i], p2[i]))
133 return 0;
134 return 1;
137 int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
139 int i;
140 int cmp;
141 for (i = 0; i < len; ++i)
142 if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0)
143 return cmp;
144 return 0;
147 int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
149 int i;
151 for (i = 0; i < len; ++i) {
152 if (isl_int_abs_ne(p1[i], p2[i]))
153 return 0;
154 if (isl_int_is_zero(p1[i]))
155 continue;
156 if (isl_int_eq(p1[i], p2[i]))
157 return 0;
159 return 1;
162 int isl_seq_first_non_zero(isl_int *p, unsigned len)
164 int i;
166 for (i = 0; i < len; ++i)
167 if (!isl_int_is_zero(p[i]))
168 return i;
169 return -1;
172 int isl_seq_last_non_zero(isl_int *p, unsigned len)
174 int i;
176 for (i = len - 1; i >= 0; --i)
177 if (!isl_int_is_zero(p[i]))
178 return i;
179 return -1;
182 int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
184 int i, min = isl_seq_first_non_zero(p, len);
185 if (min < 0)
186 return -1;
187 for (i = min + 1; i < len; ++i) {
188 if (isl_int_is_zero(p[i]))
189 continue;
190 if (isl_int_abs_lt(p[i], p[min]))
191 min = i;
193 return min;
196 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd)
198 int i, min = isl_seq_abs_min_non_zero(p, len);
200 if (min < 0) {
201 isl_int_set_si(*gcd, 0);
202 return;
204 isl_int_abs(*gcd, p[min]);
205 for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) {
206 if (i == min)
207 continue;
208 if (isl_int_is_zero(p[i]))
209 continue;
210 isl_int_gcd(*gcd, *gcd, p[i]);
214 void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
216 if (len == 0)
217 return;
218 isl_seq_gcd(p, len, &ctx->normalize_gcd);
219 if (!isl_int_is_zero(ctx->normalize_gcd) &&
220 !isl_int_is_one(ctx->normalize_gcd))
221 isl_seq_scale_down(p, p, ctx->normalize_gcd, len);
224 void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
226 int i;
228 if (len == 0) {
229 isl_int_set_si(*lcm, 1);
230 return;
232 isl_int_set(*lcm, p[0]);
233 for (i = 1; i < len; ++i)
234 isl_int_lcm(*lcm, *lcm, p[i]);
237 void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len,
238 isl_int *prod)
240 int i;
241 if (len == 0) {
242 isl_int_set_si(*prod, 0);
243 return;
245 isl_int_mul(*prod, p1[0], p2[0]);
246 for (i = 1; i < len; ++i)
247 isl_int_addmul(*prod, p1[i], p2[i]);
250 uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash)
252 int i;
253 for (i = 0; i < len; ++i) {
254 if (isl_int_is_zero(p[i]))
255 continue;
256 hash *= 16777619;
257 hash ^= (i & 0xFF);
258 hash = isl_int_hash(p[i], hash);
260 return hash;
263 uint32_t isl_seq_get_hash(isl_int *p, unsigned len)
265 uint32_t hash = isl_hash_init();
267 return isl_seq_hash(p, len, hash);
270 uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits)
272 uint32_t hash;
274 hash = isl_seq_get_hash(p, len);
275 return isl_hash_bits(hash, bits);