1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
|
/*
* Copyright 2008-2009 Katholieke Universiteit Leuven
* Copyright 2011 INRIA Saclay
*
* Use of this software is governed by the MIT license
*
* Written by Sven Verdoolaege, K.U.Leuven, Departement
* Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
*/
#include <isl_ctx_private.h>
#include <isl_seq.h>
void isl_seq_clr(isl_int *p, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_set_si(p[i], 0);
}
void isl_seq_set_si(isl_int *p, int v, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_set_si(p[i], v);
}
void isl_seq_set(isl_int *p, isl_int v, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_set(p[i], v);
}
void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_neg(dst[i], src[i]);
}
void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_set(dst[i], src[i]);
}
void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_submul(dst[i], f, src[i]);
}
void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_addmul(dst[i], f, src[i]);
}
void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_swap_or_set(dst[i], src[i]);
}
void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_mul(dst[i], src[i], m);
}
void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_divexact(dst[i], src[i], m);
}
void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_cdiv_q(dst[i], src[i], m);
}
void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_fdiv_q(dst[i], src[i], m);
}
void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
isl_int_fdiv_r(dst[i], src[i], m);
}
void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1,
isl_int m2, isl_int *src2, unsigned len)
{
int i;
isl_int tmp;
if (dst == src1 && isl_int_is_one(m1)) {
if (isl_int_is_zero(m2))
return;
for (i = 0; i < len; ++i)
isl_int_addmul(src1[i], m2, src2[i]);
return;
}
isl_int_init(tmp);
for (i = 0; i < len; ++i) {
isl_int_mul(tmp, m1, src1[i]);
isl_int_addmul(tmp, m2, src2[i]);
isl_int_set(dst[i], tmp);
}
isl_int_clear(tmp);
}
/* Eliminate element "pos" from "dst" using "src".
* In particular, let d = dst[pos] and s = src[pos], then
* dst is replaced by (|s| dst - sgn(s)d src)/gcd(s,d),
* such that dst[pos] is zero after the elimination.
* If "m" is not NULL, then *m is multiplied by |s|/gcd(s,d).
* That is, it is multiplied by the same factor as "dst".
*/
void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len,
isl_int *m)
{
isl_int a;
isl_int b;
if (isl_int_is_zero(dst[pos]))
return;
isl_int_init(a);
isl_int_init(b);
isl_int_gcd(a, src[pos], dst[pos]);
isl_int_divexact(b, dst[pos], a);
if (isl_int_is_pos(src[pos]))
isl_int_neg(b, b);
isl_int_divexact(a, src[pos], a);
isl_int_abs(a, a);
isl_seq_combine(dst, a, dst, b, src, len);
if (m)
isl_int_mul(*m, *m, a);
isl_int_clear(a);
isl_int_clear(b);
}
int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
if (isl_int_ne(p1[i], p2[i]))
return 0;
return 1;
}
int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len)
{
int i;
int cmp;
for (i = 0; i < len; ++i)
if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0)
return cmp;
return 0;
}
int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len)
{
int i;
for (i = 0; i < len; ++i) {
if (isl_int_abs_ne(p1[i], p2[i]))
return 0;
if (isl_int_is_zero(p1[i]))
continue;
if (isl_int_eq(p1[i], p2[i]))
return 0;
}
return 1;
}
int isl_seq_first_non_zero(isl_int *p, unsigned len)
{
int i;
for (i = 0; i < len; ++i)
if (!isl_int_is_zero(p[i]))
return i;
return -1;
}
int isl_seq_last_non_zero(isl_int *p, unsigned len)
{
int i;
for (i = len - 1; i >= 0; --i)
if (!isl_int_is_zero(p[i]))
return i;
return -1;
}
void isl_seq_abs_max(isl_int *p, unsigned len, isl_int *max)
{
int i;
isl_int_set_si(*max, 0);
for (i = 0; i < len; ++i)
if (isl_int_abs_gt(p[i], *max))
isl_int_abs(*max, p[i]);
}
int isl_seq_abs_min_non_zero(isl_int *p, unsigned len)
{
int i, min = isl_seq_first_non_zero(p, len);
if (min < 0)
return -1;
for (i = min + 1; i < len; ++i) {
if (isl_int_is_zero(p[i]))
continue;
if (isl_int_abs_lt(p[i], p[min]))
min = i;
}
return min;
}
void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd)
{
int i, min = isl_seq_abs_min_non_zero(p, len);
if (min < 0) {
isl_int_set_si(*gcd, 0);
return;
}
isl_int_abs(*gcd, p[min]);
for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) {
if (i == min)
continue;
if (isl_int_is_zero(p[i]))
continue;
isl_int_gcd(*gcd, *gcd, p[i]);
}
}
void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len)
{
if (len == 0)
return;
isl_seq_gcd(p, len, &ctx->normalize_gcd);
if (!isl_int_is_zero(ctx->normalize_gcd) &&
!isl_int_is_one(ctx->normalize_gcd))
isl_seq_scale_down(p, p, ctx->normalize_gcd, len);
}
void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm)
{
int i;
if (len == 0) {
isl_int_set_si(*lcm, 1);
return;
}
isl_int_set(*lcm, p[0]);
for (i = 1; i < len; ++i)
isl_int_lcm(*lcm, *lcm, p[i]);
}
void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len,
isl_int *prod)
{
int i;
if (len == 0) {
isl_int_set_si(*prod, 0);
return;
}
isl_int_mul(*prod, p1[0], p2[0]);
for (i = 1; i < len; ++i)
isl_int_addmul(*prod, p1[i], p2[i]);
}
uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash)
{
int i;
for (i = 0; i < len; ++i) {
if (isl_int_is_zero(p[i]))
continue;
hash *= 16777619;
hash ^= (i & 0xFF);
hash = isl_int_hash(p[i], hash);
}
return hash;
}
/* Given two affine expressions "p" of length p_len (including the
* denominator and the constant term) and "subs" of length subs_len,
* plug in "subs" for the variable at position "pos".
* The variables of "subs" and "p" are assumed to match up to subs_len,
* but "p" may have additional variables.
* "v" is an initialized isl_int that can be used internally.
*
* In particular, if "p" represents the expression
*
* (a i + g)/m
*
* with i the variable at position "pos" and "subs" represents the expression
*
* f/d
*
* then the result represents the expression
*
* (a f + d g)/(m d)
*
*/
void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
int p_len, int subs_len, isl_int v)
{
isl_int_set(v, p[1 + pos]);
isl_int_set_si(p[1 + pos], 0);
isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
isl_int_mul(p[0], p[0], subs[0]);
}
uint32_t isl_seq_get_hash(isl_int *p, unsigned len)
{
uint32_t hash = isl_hash_init();
return isl_seq_hash(p, len, hash);
}
uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits)
{
uint32_t hash;
hash = isl_seq_get_hash(p, len);
return isl_hash_bits(hash, bits);
}
void isl_seq_dump(isl_int *p, unsigned len)
{
int i;
for (i = 0; i < len; ++i) {
if (i)
fprintf(stderr, " ");
isl_int_print(stderr, p[i], 0);
}
fprintf(stderr, "\n");
}
|
