2 * Copyright 2013 Ecole Normale Superieure
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege,
7 * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
11 #include <isl_ctx_private.h>
12 #include <isl_val_private.h>
14 /* Allocate an isl_val object with indeterminate value.
16 __isl_give isl_val *isl_val_alloc(isl_ctx *ctx)
20 v = isl_alloc_type(ctx, struct isl_val);
33 /* Return a reference to an isl_val representing zero.
35 __isl_give isl_val *isl_val_zero(isl_ctx *ctx)
37 return isl_val_int_from_si(ctx, 0);
40 /* Return a reference to an isl_val representing one.
42 __isl_give isl_val *isl_val_one(isl_ctx *ctx)
44 return isl_val_int_from_si(ctx, 1);
47 /* Return a reference to an isl_val representing NaN.
49 __isl_give isl_val *isl_val_nan(isl_ctx *ctx)
53 v = isl_val_alloc(ctx);
57 isl_int_set_si(v->n, 0);
58 isl_int_set_si(v->d, 0);
63 /* Change "v" into a NaN.
65 __isl_give isl_val *isl_val_set_nan(__isl_take isl_val *v)
69 if (isl_val_is_nan(v))
75 isl_int_set_si(v->n, 0);
76 isl_int_set_si(v->d, 0);
81 /* Return a reference to an isl_val representing +infinity.
83 __isl_give isl_val *isl_val_infty(isl_ctx *ctx)
87 v = isl_val_alloc(ctx);
91 isl_int_set_si(v->n, 1);
92 isl_int_set_si(v->d, 0);
97 /* Return a reference to an isl_val representing -infinity.
99 __isl_give isl_val *isl_val_neginfty(isl_ctx *ctx)
103 v = isl_val_alloc(ctx);
107 isl_int_set_si(v->n, -1);
108 isl_int_set_si(v->d, 0);
113 /* Return a reference to an isl_val representing the integer "i".
115 __isl_give isl_val *isl_val_int_from_si(isl_ctx *ctx, long i)
119 v = isl_val_alloc(ctx);
123 isl_int_set_si(v->n, i);
124 isl_int_set_si(v->d, 1);
129 /* Change the value of "v" to be equal to the integer "i".
131 __isl_give isl_val *isl_val_set_si(__isl_take isl_val *v, long i)
135 if (isl_val_is_int(v) && isl_int_cmp_si(v->n, i) == 0)
141 isl_int_set_si(v->n, i);
142 isl_int_set_si(v->d, 1);
147 /* Change the value of "v" to be equal to zero.
149 __isl_give isl_val *isl_val_set_zero(__isl_take isl_val *v)
151 return isl_val_set_si(v, 0);
154 /* Return a reference to an isl_val representing the unsigned integer "u".
156 __isl_give isl_val *isl_val_int_from_ui(isl_ctx *ctx, unsigned long u)
160 v = isl_val_alloc(ctx);
164 isl_int_set_ui(v->n, u);
165 isl_int_set_si(v->d, 1);
170 /* Return a reference to an isl_val representing the integer "n".
172 __isl_give isl_val *isl_val_int_from_isl_int(isl_ctx *ctx, isl_int n)
176 v = isl_val_alloc(ctx);
180 isl_int_set(v->n, n);
181 isl_int_set_si(v->d, 1);
186 /* Return a reference to an isl_val representing the rational value "n"/"d".
187 * Normalizing the isl_val (if needed) is left to the caller.
189 __isl_give isl_val *isl_val_rat_from_isl_int(isl_ctx *ctx,
190 isl_int n, isl_int d)
194 v = isl_val_alloc(ctx);
198 isl_int_set(v->n, n);
199 isl_int_set(v->d, d);
204 /* Return a new reference to "v".
206 __isl_give isl_val *isl_val_copy(__isl_keep isl_val *v)
215 /* Return a fresh copy of "val".
217 __isl_give isl_val *isl_val_dup(__isl_keep isl_val *val)
224 dup = isl_val_alloc(isl_val_get_ctx(val));
228 isl_int_set(dup->n, val->n);
229 isl_int_set(dup->d, val->d);
234 /* Return an isl_val that is equal to "val" and that has only
235 * a single reference.
237 __isl_give isl_val *isl_val_cow(__isl_take isl_val *val)
245 return isl_val_dup(val);
248 /* Free "v" and return NULL.
250 void *isl_val_free(__isl_take isl_val *v)
258 isl_ctx_deref(v->ctx);
265 /* Extract the numerator of a rational value "v" as an integer.
267 * If "v" is not a rational value, then the result is undefined.
269 long isl_val_get_num_si(__isl_keep isl_val *v)
273 if (!isl_val_is_rat(v))
274 isl_die(isl_val_get_ctx(v), isl_error_invalid,
275 "expecting rational value", return 0);
276 if (!isl_int_fits_slong(v->n))
277 isl_die(isl_val_get_ctx(v), isl_error_invalid,
278 "numerator too large", return 0);
279 return isl_int_get_si(v->n);
282 /* Extract the denominator of a rational value "v" as an integer.
284 * If "v" is not a rational value, then the result is undefined.
286 long isl_val_get_den_si(__isl_keep isl_val *v)
290 if (!isl_val_is_rat(v))
291 isl_die(isl_val_get_ctx(v), isl_error_invalid,
292 "expecting rational value", return 0);
293 if (!isl_int_fits_slong(v->d))
294 isl_die(isl_val_get_ctx(v), isl_error_invalid,
295 "denominator too large", return 0);
296 return isl_int_get_si(v->d);
299 /* Return an approximation of "v" as a double.
301 double isl_val_get_d(__isl_keep isl_val *v)
305 if (!isl_val_is_rat(v))
306 isl_die(isl_val_get_ctx(v), isl_error_invalid,
307 "expecting rational value", return 0);
308 return isl_int_get_d(v->n) / isl_int_get_d(v->d);
311 /* Return the isl_ctx to which "val" belongs.
313 isl_ctx *isl_val_get_ctx(__isl_keep isl_val *val)
315 return val ? val->ctx : NULL;
320 * In particular, make sure that the denominator of a rational value
321 * is positive and the numerator and denominator do not have any
324 * This function should not be called by an external user
325 * since it will only be given normalized values.
327 __isl_give isl_val *isl_val_normalize(__isl_take isl_val *v)
333 if (isl_val_is_int(v))
335 if (!isl_val_is_rat(v))
337 if (isl_int_is_neg(v->d)) {
338 isl_int_neg(v->d, v->d);
339 isl_int_neg(v->n, v->n);
341 ctx = isl_val_get_ctx(v);
342 isl_int_gcd(ctx->normalize_gcd, v->n, v->d);
343 if (isl_int_is_one(ctx->normalize_gcd))
345 isl_int_divexact(v->n, v->n, ctx->normalize_gcd);
346 isl_int_divexact(v->d, v->d, ctx->normalize_gcd);
350 /* Return the opposite of "v".
352 __isl_give isl_val *isl_val_neg(__isl_take isl_val *v)
356 if (isl_val_is_nan(v))
358 if (isl_val_is_zero(v))
364 isl_int_neg(v->n, v->n);
369 /* Return the absolute value of "v".
371 __isl_give isl_val *isl_val_abs(__isl_take isl_val *v)
375 if (isl_val_is_nan(v))
377 if (isl_val_is_nonneg(v))
379 return isl_val_neg(v);
382 /* Return the "floor" (greatest integer part) of "v".
383 * That is, return the result of rounding towards -infinity.
385 __isl_give isl_val *isl_val_floor(__isl_take isl_val *v)
389 if (isl_val_is_int(v))
391 if (!isl_val_is_rat(v))
397 isl_int_fdiv_q(v->n, v->n, v->d);
398 isl_int_set_si(v->d, 1);
403 /* Return the "ceiling" of "v".
404 * That is, return the result of rounding towards +infinity.
406 __isl_give isl_val *isl_val_ceil(__isl_take isl_val *v)
410 if (isl_val_is_int(v))
412 if (!isl_val_is_rat(v))
418 isl_int_cdiv_q(v->n, v->n, v->d);
419 isl_int_set_si(v->d, 1);
425 * That is, return the result of rounding towards zero.
427 __isl_give isl_val *isl_val_trunc(__isl_take isl_val *v)
431 if (isl_val_is_int(v))
433 if (!isl_val_is_rat(v))
439 isl_int_tdiv_q(v->n, v->n, v->d);
440 isl_int_set_si(v->d, 1);
445 /* Return 2^v, where v is an integer (that is not too large).
447 __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v)
455 if (!isl_val_is_int(v))
456 isl_die(isl_val_get_ctx(v), isl_error_invalid,
457 "can only compute integer powers",
458 return isl_val_free(v));
459 neg = isl_val_is_neg(v);
461 isl_int_neg(v->n, v->n);
462 if (!isl_int_fits_ulong(v->n))
463 isl_die(isl_val_get_ctx(v), isl_error_invalid,
464 "exponent too large", return isl_val_free(v));
465 exp = isl_int_get_ui(v->n);
467 isl_int_mul_2exp(v->d, v->d, exp);
468 isl_int_set_si(v->n, 1);
470 isl_int_mul_2exp(v->n, v->d, exp);
476 /* Return the minimum of "v1" and "v2".
478 __isl_give isl_val *isl_val_min(__isl_take isl_val *v1, __isl_take isl_val *v2)
483 if (isl_val_is_nan(v1)) {
487 if (isl_val_is_nan(v2)) {
491 if (isl_val_le(v1, v2)) {
504 /* Return the maximum of "v1" and "v2".
506 __isl_give isl_val *isl_val_max(__isl_take isl_val *v1, __isl_take isl_val *v2)
511 if (isl_val_is_nan(v1)) {
515 if (isl_val_is_nan(v2)) {
519 if (isl_val_ge(v1, v2)) {
532 /* Return the sum of "v1" and "v2".
534 __isl_give isl_val *isl_val_add(__isl_take isl_val *v1, __isl_take isl_val *v2)
538 if (isl_val_is_nan(v1)) {
542 if (isl_val_is_nan(v2)) {
546 if ((isl_val_is_infty(v1) && isl_val_is_neginfty(v2)) ||
547 (isl_val_is_neginfty(v1) && isl_val_is_infty(v2))) {
549 return isl_val_set_nan(v1);
551 if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) {
555 if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) {
559 if (isl_val_is_zero(v1)) {
563 if (isl_val_is_zero(v2)) {
568 v1 = isl_val_cow(v1);
571 if (isl_val_is_int(v1) && isl_val_is_int(v2))
572 isl_int_add(v1->n, v1->n, v2->n);
574 if (isl_int_eq(v1->d, v2->d))
575 isl_int_add(v1->n, v1->n, v2->n);
577 isl_int_mul(v1->n, v1->n, v2->d);
578 isl_int_addmul(v1->n, v2->n, v1->d);
579 isl_int_mul(v1->d, v1->d, v2->d);
581 v1 = isl_val_normalize(v1);
591 /* Return the sum of "v1" and "v2".
593 __isl_give isl_val *isl_val_add_ui(__isl_take isl_val *v1, unsigned long v2)
597 if (!isl_val_is_rat(v1))
601 v1 = isl_val_cow(v1);
605 isl_int_addmul_ui(v1->n, v1->d, v2);
610 /* Subtract "v2" from "v1".
612 __isl_give isl_val *isl_val_sub(__isl_take isl_val *v1, __isl_take isl_val *v2)
616 if (isl_val_is_nan(v1)) {
620 if (isl_val_is_nan(v2)) {
624 if ((isl_val_is_infty(v1) && isl_val_is_infty(v2)) ||
625 (isl_val_is_neginfty(v1) && isl_val_is_neginfty(v2))) {
627 return isl_val_set_nan(v1);
629 if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) {
633 if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) {
635 return isl_val_neg(v2);
637 if (isl_val_is_zero(v2)) {
641 if (isl_val_is_zero(v1)) {
643 return isl_val_neg(v2);
646 v1 = isl_val_cow(v1);
649 if (isl_val_is_int(v1) && isl_val_is_int(v2))
650 isl_int_sub(v1->n, v1->n, v2->n);
652 if (isl_int_eq(v1->d, v2->d))
653 isl_int_sub(v1->n, v1->n, v2->n);
655 isl_int_mul(v1->n, v1->n, v2->d);
656 isl_int_submul(v1->n, v2->n, v1->d);
657 isl_int_mul(v1->d, v1->d, v2->d);
659 v1 = isl_val_normalize(v1);
669 /* Subtract "v2" from "v1".
671 __isl_give isl_val *isl_val_sub_ui(__isl_take isl_val *v1, unsigned long v2)
675 if (!isl_val_is_rat(v1))
679 v1 = isl_val_cow(v1);
683 isl_int_submul_ui(v1->n, v1->d, v2);
688 /* Return the product of "v1" and "v2".
690 __isl_give isl_val *isl_val_mul(__isl_take isl_val *v1, __isl_take isl_val *v2)
694 if (isl_val_is_nan(v1)) {
698 if (isl_val_is_nan(v2)) {
702 if ((!isl_val_is_rat(v1) && isl_val_is_zero(v2)) ||
703 (isl_val_is_zero(v1) && !isl_val_is_rat(v2))) {
705 return isl_val_set_nan(v1);
707 if (isl_val_is_zero(v1)) {
711 if (isl_val_is_zero(v2)) {
715 if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) {
716 if (isl_val_is_neg(v2))
717 v1 = isl_val_neg(v1);
721 if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) {
722 if (isl_val_is_neg(v1))
723 v2 = isl_val_neg(v2);
728 v1 = isl_val_cow(v1);
731 if (isl_val_is_int(v1) && isl_val_is_int(v2))
732 isl_int_mul(v1->n, v1->n, v2->n);
734 isl_int_mul(v1->n, v1->n, v2->n);
735 isl_int_mul(v1->d, v1->d, v2->d);
736 v1 = isl_val_normalize(v1);
746 /* Return the product of "v1" and "v2".
748 __isl_give isl_val *isl_val_mul_ui(__isl_take isl_val *v1, unsigned long v2)
752 if (isl_val_is_nan(v1))
754 if (!isl_val_is_rat(v1)) {
756 v1 = isl_val_set_nan(v1);
761 v1 = isl_val_cow(v1);
765 isl_int_mul_ui(v1->n, v1->n, v2);
767 return isl_val_normalize(v1);
770 /* Divide "v1" by "v2".
772 __isl_give isl_val *isl_val_div(__isl_take isl_val *v1, __isl_take isl_val *v2)
776 if (isl_val_is_nan(v1)) {
780 if (isl_val_is_nan(v2)) {
784 if (isl_val_is_zero(v2) ||
785 (!isl_val_is_rat(v1) && !isl_val_is_rat(v2))) {
787 return isl_val_set_nan(v1);
789 if (isl_val_is_zero(v1)) {
793 if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) {
794 if (isl_val_is_neg(v2))
795 v1 = isl_val_neg(v1);
799 if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) {
801 return isl_val_set_zero(v1);
804 v1 = isl_val_cow(v1);
807 if (isl_val_is_int(v2)) {
808 isl_int_mul(v1->d, v1->d, v2->n);
809 v1 = isl_val_normalize(v1);
811 isl_int_mul(v1->d, v1->d, v2->n);
812 isl_int_mul(v1->n, v1->n, v2->d);
813 v1 = isl_val_normalize(v1);
823 /* Given two integer values "v1" and "v2", check if "v1" is divisible by "v2".
825 int isl_val_is_divisible_by(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
830 if (!isl_val_is_int(v1) || !isl_val_is_int(v2))
831 isl_die(isl_val_get_ctx(v1), isl_error_invalid,
832 "expecting two integers", return -1);
834 return isl_int_is_divisible_by(v1->n, v2->n);
837 /* Given two integer values "v1" and "v2", return the residue of "v1"
840 __isl_give isl_val *isl_val_mod(__isl_take isl_val *v1, __isl_take isl_val *v2)
844 if (!isl_val_is_int(v1) || !isl_val_is_int(v2))
845 isl_die(isl_val_get_ctx(v1), isl_error_invalid,
846 "expecting two integers", goto error);
847 if (isl_val_is_nonneg(v1) && isl_val_lt(v1, v2)) {
851 v1 = isl_val_cow(v1);
854 isl_int_fdiv_r(v1->n, v1->n, v2->n);
863 /* Given two integer values, return their greatest common divisor.
865 __isl_give isl_val *isl_val_gcd(__isl_take isl_val *v1, __isl_take isl_val *v2)
869 if (!isl_val_is_int(v1) || !isl_val_is_int(v2))
870 isl_die(isl_val_get_ctx(v1), isl_error_invalid,
871 "expecting two integers", goto error);
872 if (isl_val_eq(v1, v2)) {
876 if (isl_val_is_one(v1)) {
880 if (isl_val_is_one(v2)) {
884 v1 = isl_val_cow(v1);
887 isl_int_gcd(v1->n, v1->n, v2->n);
896 /* Given two integer values v1 and v2, return their greatest common divisor g,
897 * as well as two integers x and y such that x * v1 + y * v2 = g.
899 __isl_give isl_val *isl_val_gcdext(__isl_take isl_val *v1,
900 __isl_take isl_val *v2, __isl_give isl_val **x, __isl_give isl_val **y)
903 isl_val *a = NULL, *b = NULL;
906 return isl_val_gcd(v1, v2);
911 ctx = isl_val_get_ctx(v1);
912 if (!isl_val_is_int(v1) || !isl_val_is_int(v2))
913 isl_die(ctx, isl_error_invalid,
914 "expecting two integers", goto error);
916 v1 = isl_val_cow(v1);
917 a = isl_val_alloc(ctx);
918 b = isl_val_alloc(ctx);
921 isl_int_gcdext(v1->n, a->n, b->n, v1->n, v2->n);
923 isl_int_set_si(a->d, 1);
928 isl_int_set_si(b->d, 1);
946 /* Does "v" represent an integer value?
948 int isl_val_is_int(__isl_keep isl_val *v)
953 return isl_int_is_one(v->d);
956 /* Does "v" represent a rational value?
958 int isl_val_is_rat(__isl_keep isl_val *v)
963 return !isl_int_is_zero(v->d);
966 /* Does "v" represent NaN?
968 int isl_val_is_nan(__isl_keep isl_val *v)
973 return isl_int_is_zero(v->n) && isl_int_is_zero(v->d);
976 /* Does "v" represent +infinity?
978 int isl_val_is_infty(__isl_keep isl_val *v)
983 return isl_int_is_pos(v->n) && isl_int_is_zero(v->d);
986 /* Does "v" represent -infinity?
988 int isl_val_is_neginfty(__isl_keep isl_val *v)
993 return isl_int_is_neg(v->n) && isl_int_is_zero(v->d);
996 /* Does "v" represent the integer zero?
998 int isl_val_is_zero(__isl_keep isl_val *v)
1003 return isl_int_is_zero(v->n) && !isl_int_is_zero(v->d);
1006 /* Does "v" represent the integer one?
1008 int isl_val_is_one(__isl_keep isl_val *v)
1013 return isl_int_eq(v->n, v->d);
1016 /* Does "v" represent the integer negative one?
1018 int isl_val_is_negone(__isl_keep isl_val *v)
1023 return isl_int_is_neg(v->n) && isl_int_abs_eq(v->n, v->d);
1026 /* Is "v" (strictly) positive?
1028 int isl_val_is_pos(__isl_keep isl_val *v)
1033 return isl_int_is_pos(v->n);
1036 /* Is "v" (strictly) negative?
1038 int isl_val_is_neg(__isl_keep isl_val *v)
1043 return isl_int_is_neg(v->n);
1046 /* Is "v" non-negative?
1048 int isl_val_is_nonneg(__isl_keep isl_val *v)
1053 if (isl_val_is_nan(v))
1056 return isl_int_is_nonneg(v->n);
1059 /* Is "v" non-positive?
1061 int isl_val_is_nonpos(__isl_keep isl_val *v)
1066 if (isl_val_is_nan(v))
1069 return isl_int_is_nonpos(v->n);
1072 /* Return the sign of "v".
1074 * The sign of NaN is undefined.
1076 int isl_val_sgn(__isl_keep isl_val *v)
1080 if (isl_val_is_zero(v))
1082 if (isl_val_is_pos(v))
1087 /* Is "v1" (strictly) less than "v2"?
1089 int isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1096 if (isl_val_is_int(v1) && isl_val_is_int(v2))
1097 return isl_int_lt(v1->n, v2->n);
1098 if (isl_val_is_nan(v1) || isl_val_is_nan(v2))
1100 if (isl_val_eq(v1, v2))
1102 if (isl_val_is_infty(v2))
1104 if (isl_val_is_infty(v1))
1106 if (isl_val_is_neginfty(v1))
1108 if (isl_val_is_neginfty(v2))
1112 isl_int_mul(t, v1->n, v2->d);
1113 isl_int_submul(t, v2->n, v1->d);
1114 lt = isl_int_is_neg(t);
1120 /* Is "v1" (strictly) greater than "v2"?
1122 int isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1124 return isl_val_lt(v2, v1);
1127 /* Is "v1" less than or equal to "v2"?
1129 int isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1136 if (isl_val_is_int(v1) && isl_val_is_int(v2))
1137 return isl_int_le(v1->n, v2->n);
1138 if (isl_val_is_nan(v1) || isl_val_is_nan(v2))
1140 if (isl_val_eq(v1, v2))
1142 if (isl_val_is_infty(v2))
1144 if (isl_val_is_infty(v1))
1146 if (isl_val_is_neginfty(v1))
1148 if (isl_val_is_neginfty(v2))
1152 isl_int_mul(t, v1->n, v2->d);
1153 isl_int_submul(t, v2->n, v1->d);
1154 le = isl_int_is_nonpos(t);
1160 /* Is "v1" greater than or equal to "v2"?
1162 int isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1164 return isl_val_le(v2, v1);
1167 /* How does "v" compare to "i"?
1169 * Return 1 if v is greater, -1 if v is smaller and 0 if v is equal to i.
1171 * If v is NaN (or NULL), then the result is undefined.
1173 int isl_val_cmp_si(__isl_keep isl_val *v, long i)
1180 if (isl_val_is_int(v))
1181 return isl_int_cmp_si(v->n, i);
1182 if (isl_val_is_nan(v))
1184 if (isl_val_is_infty(v))
1186 if (isl_val_is_neginfty(v))
1190 isl_int_mul_si(t, v->d, i);
1191 isl_int_sub(t, v->n, t);
1192 cmp = isl_int_sgn(t);
1198 /* Is "v1" equal to "v2"?
1200 int isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1204 if (isl_val_is_nan(v1) || isl_val_is_nan(v2))
1207 return isl_int_eq(v1->n, v2->n) && isl_int_eq(v1->d, v2->d);
1210 /* Is "v1" different from "v2"?
1212 int isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2)
1216 if (isl_val_is_nan(v1) || isl_val_is_nan(v2))
1219 return isl_int_ne(v1->n, v2->n) || isl_int_ne(v1->d, v2->d);
1222 /* Print a textual representation of "v" onto "p".
1224 __isl_give isl_printer *isl_printer_print_val(__isl_take isl_printer *p,
1225 __isl_keep isl_val *v)
1230 return isl_printer_free(p);
1232 neg = isl_int_is_neg(v->n);
1234 p = isl_printer_print_str(p, "-");
1235 isl_int_neg(v->n, v->n);
1237 if (isl_int_is_zero(v->d)) {
1238 int sgn = isl_int_sgn(v->n);
1239 p = isl_printer_print_str(p, sgn < 0 ? "-infty" :
1240 sgn == 0 ? "NaN" : "infty");
1242 p = isl_printer_print_isl_int(p, v->n);
1244 isl_int_neg(v->n, v->n);
1245 if (!isl_int_is_zero(v->d) && !isl_int_is_one(v->d)) {
1246 p = isl_printer_print_str(p, "/");
1247 p = isl_printer_print_isl_int(p, v->d);