2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the MIT 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_si(isl_int
*p
, int v
, unsigned len
)
23 for (i
= 0; i
< len
; ++i
)
24 isl_int_set_si(p
[i
], v
);
27 void isl_seq_set(isl_int
*p
, isl_int v
, unsigned len
)
30 for (i
= 0; i
< len
; ++i
)
34 void isl_seq_neg(isl_int
*dst
, isl_int
*src
, unsigned len
)
37 for (i
= 0; i
< len
; ++i
)
38 isl_int_neg(dst
[i
], src
[i
]);
41 void isl_seq_cpy(isl_int
*dst
, isl_int
*src
, unsigned len
)
44 for (i
= 0; i
< len
; ++i
)
45 isl_int_set(dst
[i
], src
[i
]);
48 void isl_seq_submul(isl_int
*dst
, isl_int f
, isl_int
*src
, unsigned len
)
51 for (i
= 0; i
< len
; ++i
)
52 isl_int_submul(dst
[i
], f
, src
[i
]);
55 void isl_seq_addmul(isl_int
*dst
, isl_int f
, isl_int
*src
, unsigned len
)
58 for (i
= 0; i
< len
; ++i
)
59 isl_int_addmul(dst
[i
], f
, src
[i
]);
62 void isl_seq_swp_or_cpy(isl_int
*dst
, isl_int
*src
, unsigned len
)
65 for (i
= 0; i
< len
; ++i
)
66 isl_int_swap_or_set(dst
[i
], src
[i
]);
69 void isl_seq_scale(isl_int
*dst
, isl_int
*src
, isl_int m
, unsigned len
)
72 for (i
= 0; i
< len
; ++i
)
73 isl_int_mul(dst
[i
], src
[i
], m
);
76 void isl_seq_scale_down(isl_int
*dst
, isl_int
*src
, isl_int m
, unsigned len
)
79 for (i
= 0; i
< len
; ++i
)
80 isl_int_divexact(dst
[i
], src
[i
], m
);
83 void isl_seq_cdiv_q(isl_int
*dst
, isl_int
*src
, isl_int m
, unsigned len
)
86 for (i
= 0; i
< len
; ++i
)
87 isl_int_cdiv_q(dst
[i
], src
[i
], m
);
90 void isl_seq_fdiv_q(isl_int
*dst
, isl_int
*src
, isl_int m
, unsigned len
)
93 for (i
= 0; i
< len
; ++i
)
94 isl_int_fdiv_q(dst
[i
], src
[i
], m
);
97 void isl_seq_fdiv_r(isl_int
*dst
, isl_int
*src
, isl_int m
, unsigned len
)
100 for (i
= 0; i
< len
; ++i
)
101 isl_int_fdiv_r(dst
[i
], src
[i
], m
);
104 void isl_seq_combine(isl_int
*dst
, isl_int m1
, isl_int
*src1
,
105 isl_int m2
, isl_int
*src2
, unsigned len
)
111 for (i
= 0; i
< len
; ++i
) {
112 isl_int_mul(tmp
, m1
, src1
[i
]);
113 isl_int_addmul(tmp
, m2
, src2
[i
]);
114 isl_int_set(dst
[i
], tmp
);
120 * Let d = dst[pos] and s = src[pos]
121 * dst is replaced by |s| dst - sgn(s)d src
123 void isl_seq_elim(isl_int
*dst
, isl_int
*src
, unsigned pos
, unsigned len
,
129 if (isl_int_is_zero(dst
[pos
]))
135 isl_int_gcd(a
, src
[pos
], dst
[pos
]);
136 isl_int_divexact(b
, dst
[pos
], a
);
137 if (isl_int_is_pos(src
[pos
]))
139 isl_int_divexact(a
, src
[pos
], a
);
141 isl_seq_combine(dst
, a
, dst
, b
, src
, len
);
144 isl_int_mul(*m
, *m
, a
);
150 int isl_seq_eq(isl_int
*p1
, isl_int
*p2
, unsigned len
)
153 for (i
= 0; i
< len
; ++i
)
154 if (isl_int_ne(p1
[i
], p2
[i
]))
159 int isl_seq_cmp(isl_int
*p1
, isl_int
*p2
, unsigned len
)
163 for (i
= 0; i
< len
; ++i
)
164 if ((cmp
= isl_int_cmp(p1
[i
], p2
[i
])) != 0)
169 int isl_seq_is_neg(isl_int
*p1
, isl_int
*p2
, unsigned len
)
173 for (i
= 0; i
< len
; ++i
) {
174 if (isl_int_abs_ne(p1
[i
], p2
[i
]))
176 if (isl_int_is_zero(p1
[i
]))
178 if (isl_int_eq(p1
[i
], p2
[i
]))
184 int isl_seq_first_non_zero(isl_int
*p
, unsigned len
)
188 for (i
= 0; i
< len
; ++i
)
189 if (!isl_int_is_zero(p
[i
]))
194 int isl_seq_last_non_zero(isl_int
*p
, unsigned len
)
198 for (i
= len
- 1; i
>= 0; --i
)
199 if (!isl_int_is_zero(p
[i
]))
204 void isl_seq_abs_max(isl_int
*p
, unsigned len
, isl_int
*max
)
208 isl_int_set_si(*max
, 0);
210 for (i
= 0; i
< len
; ++i
)
211 if (isl_int_abs_gt(p
[i
], *max
))
212 isl_int_abs(*max
, p
[i
]);
215 int isl_seq_abs_min_non_zero(isl_int
*p
, unsigned len
)
217 int i
, min
= isl_seq_first_non_zero(p
, len
);
220 for (i
= min
+ 1; i
< len
; ++i
) {
221 if (isl_int_is_zero(p
[i
]))
223 if (isl_int_abs_lt(p
[i
], p
[min
]))
229 void isl_seq_gcd(isl_int
*p
, unsigned len
, isl_int
*gcd
)
231 int i
, min
= isl_seq_abs_min_non_zero(p
, len
);
234 isl_int_set_si(*gcd
, 0);
237 isl_int_abs(*gcd
, p
[min
]);
238 for (i
= 0; isl_int_cmp_si(*gcd
, 1) > 0 && i
< len
; ++i
) {
241 if (isl_int_is_zero(p
[i
]))
243 isl_int_gcd(*gcd
, *gcd
, p
[i
]);
247 void isl_seq_normalize(struct isl_ctx
*ctx
, isl_int
*p
, unsigned len
)
251 isl_seq_gcd(p
, len
, &ctx
->normalize_gcd
);
252 if (!isl_int_is_zero(ctx
->normalize_gcd
) &&
253 !isl_int_is_one(ctx
->normalize_gcd
))
254 isl_seq_scale_down(p
, p
, ctx
->normalize_gcd
, len
);
257 void isl_seq_lcm(isl_int
*p
, unsigned len
, isl_int
*lcm
)
262 isl_int_set_si(*lcm
, 1);
265 isl_int_set(*lcm
, p
[0]);
266 for (i
= 1; i
< len
; ++i
)
267 isl_int_lcm(*lcm
, *lcm
, p
[i
]);
270 void isl_seq_inner_product(isl_int
*p1
, isl_int
*p2
, unsigned len
,
275 isl_int_set_si(*prod
, 0);
278 isl_int_mul(*prod
, p1
[0], p2
[0]);
279 for (i
= 1; i
< len
; ++i
)
280 isl_int_addmul(*prod
, p1
[i
], p2
[i
]);
283 uint32_t isl_seq_hash(isl_int
*p
, unsigned len
, uint32_t hash
)
286 for (i
= 0; i
< len
; ++i
) {
287 if (isl_int_is_zero(p
[i
]))
291 hash
= isl_int_hash(p
[i
], hash
);
296 uint32_t isl_seq_get_hash(isl_int
*p
, unsigned len
)
298 uint32_t hash
= isl_hash_init();
300 return isl_seq_hash(p
, len
, hash
);
303 uint32_t isl_seq_get_hash_bits(isl_int
*p
, unsigned len
, unsigned bits
)
307 hash
= isl_seq_get_hash(p
, len
);
308 return isl_hash_bits(hash
, bits
);
311 void isl_seq_dump(isl_int
*p
, unsigned len
)
315 for (i
= 0; i
< len
; ++i
) {
317 fprintf(stderr
, " ");
318 isl_int_print(stderr
, p
[i
], 0);
320 fprintf(stderr
, "\n");