Blame isl-0.14/isl_constraint.c

Packit fb9d21
/*
Packit fb9d21
 * Copyright 2008-2009 Katholieke Universiteit Leuven
Packit fb9d21
 * Copyright 2010      INRIA Saclay
Packit fb9d21
 *
Packit fb9d21
 * Use of this software is governed by the MIT license
Packit fb9d21
 *
Packit fb9d21
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
Packit fb9d21
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
Packit fb9d21
 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
Packit fb9d21
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France 
Packit fb9d21
 */
Packit fb9d21
Packit fb9d21
#include <isl_map_private.h>
Packit fb9d21
#include <isl_constraint_private.h>
Packit fb9d21
#include <isl_space_private.h>
Packit fb9d21
#include <isl_seq.h>
Packit fb9d21
#include <isl_aff_private.h>
Packit fb9d21
#include <isl_local_space_private.h>
Packit fb9d21
#include <isl_val_private.h>
Packit fb9d21
#include <isl_vec_private.h>
Packit fb9d21
#include <isl/deprecated/constraint_int.h>
Packit fb9d21
Packit fb9d21
#undef BASE
Packit fb9d21
#define BASE constraint
Packit fb9d21
Packit fb9d21
#include <isl_list_templ.c>
Packit fb9d21
Packit fb9d21
isl_ctx *isl_constraint_get_ctx(__isl_keep isl_constraint *c)
Packit fb9d21
{
Packit fb9d21
	return c ? isl_local_space_get_ctx(c->ls) : NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static unsigned n(struct isl_constraint *c, enum isl_dim_type type)
Packit fb9d21
{
Packit fb9d21
	return isl_local_space_dim(c->ls, type);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static unsigned offset(struct isl_constraint *c, enum isl_dim_type type)
Packit fb9d21
{
Packit fb9d21
	return isl_local_space_offset(c->ls, type);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static unsigned basic_map_offset(__isl_keep isl_basic_map *bmap,
Packit fb9d21
							enum isl_dim_type type)
Packit fb9d21
{
Packit fb9d21
	return type == isl_dim_div ? 1 + isl_space_dim(bmap->dim, isl_dim_all)
Packit fb9d21
				   : 1 + isl_space_offset(bmap->dim, type);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static unsigned basic_set_offset(struct isl_basic_set *bset,
Packit fb9d21
							enum isl_dim_type type)
Packit fb9d21
{
Packit fb9d21
	isl_space *dim = bset->dim;
Packit fb9d21
	switch (type) {
Packit fb9d21
	case isl_dim_param:	return 1;
Packit fb9d21
	case isl_dim_in:	return 1 + dim->nparam;
Packit fb9d21
	case isl_dim_out:	return 1 + dim->nparam + dim->n_in;
Packit fb9d21
	case isl_dim_div:	return 1 + dim->nparam + dim->n_in + dim->n_out;
Packit fb9d21
	default:		return 0;
Packit fb9d21
	}
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_alloc_vec(int eq,
Packit fb9d21
	__isl_take isl_local_space *ls, __isl_take isl_vec *v)
Packit fb9d21
{
Packit fb9d21
	isl_constraint *constraint;
Packit fb9d21
Packit fb9d21
	if (!ls || !v)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	constraint = isl_alloc_type(isl_vec_get_ctx(v), isl_constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	constraint->ref = 1;
Packit fb9d21
	constraint->eq = eq;
Packit fb9d21
	constraint->ls = ls;
Packit fb9d21
	constraint->v = v;
Packit fb9d21
Packit fb9d21
	return constraint;
Packit fb9d21
error:
Packit fb9d21
	isl_local_space_free(ls);
Packit fb9d21
	isl_vec_free(v);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_alloc(int eq,
Packit fb9d21
	__isl_take isl_local_space *ls)
Packit fb9d21
{
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
	isl_vec *v;
Packit fb9d21
Packit fb9d21
	if (!ls)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	ctx = isl_local_space_get_ctx(ls);
Packit fb9d21
	v = isl_vec_alloc(ctx, 1 + isl_local_space_dim(ls, isl_dim_all));
Packit fb9d21
	v = isl_vec_clr(v);
Packit fb9d21
	return isl_constraint_alloc_vec(eq, ls, v);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_basic_map_constraint(struct isl_basic_map *bmap,
Packit fb9d21
	isl_int **line)
Packit fb9d21
{
Packit fb9d21
	int eq;
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
	isl_vec *v;
Packit fb9d21
	isl_local_space *ls = NULL;
Packit fb9d21
	isl_constraint *constraint;
Packit fb9d21
Packit fb9d21
	if (!bmap || !line)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	eq = line >= bmap->eq;
Packit fb9d21
Packit fb9d21
	ctx = isl_basic_map_get_ctx(bmap);
Packit fb9d21
	ls = isl_basic_map_get_local_space(bmap);
Packit fb9d21
	v = isl_vec_alloc(ctx, 1 + isl_local_space_dim(ls, isl_dim_all));
Packit fb9d21
	if (!v)
Packit fb9d21
		goto error;
Packit fb9d21
	isl_seq_cpy(v->el, line[0], v->size);
Packit fb9d21
	constraint = isl_constraint_alloc_vec(eq, ls, v);
Packit fb9d21
Packit fb9d21
	isl_basic_map_free(bmap);
Packit fb9d21
	return constraint;
Packit fb9d21
error:
Packit fb9d21
	isl_local_space_free(ls);
Packit fb9d21
	isl_basic_map_free(bmap);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset,
Packit fb9d21
	isl_int **line)
Packit fb9d21
{
Packit fb9d21
	return isl_basic_map_constraint((struct isl_basic_map *)bset, line);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_equality_alloc(__isl_take isl_local_space *ls)
Packit fb9d21
{
Packit fb9d21
	return isl_constraint_alloc(1, ls);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_inequality_alloc(__isl_take isl_local_space *ls)
Packit fb9d21
{
Packit fb9d21
	return isl_constraint_alloc(0, ls);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_constraint_dup(struct isl_constraint *c)
Packit fb9d21
{
Packit fb9d21
	if (!c)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	return isl_constraint_alloc_vec(c->eq, isl_local_space_copy(c->ls),
Packit fb9d21
						isl_vec_copy(c->v));
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_constraint_cow(struct isl_constraint *c)
Packit fb9d21
{
Packit fb9d21
	if (!c)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (c->ref == 1)
Packit fb9d21
		return c;
Packit fb9d21
	c->ref--;
Packit fb9d21
	return isl_constraint_dup(c);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_constraint_copy(struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	constraint->ref++;
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_null isl_constraint *isl_constraint_free(__isl_take isl_constraint *c)
Packit fb9d21
{
Packit fb9d21
	if (!c)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (--c->ref > 0)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	isl_local_space_free(c->ls);
Packit fb9d21
	isl_vec_free(c->v);
Packit fb9d21
	free(c);
Packit fb9d21
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return the number of constraints in "bmap", i.e., the
Packit fb9d21
 * number of times isl_basic_map_foreach_constraint will
Packit fb9d21
 * call the callback.
Packit fb9d21
 */
Packit fb9d21
int isl_basic_map_n_constraint(__isl_keep isl_basic_map *bmap)
Packit fb9d21
{
Packit fb9d21
	if (!bmap)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	return bmap->n_eq + bmap->n_ineq;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return the number of constraints in "bset", i.e., the
Packit fb9d21
 * number of times isl_basic_set_foreach_constraint will
Packit fb9d21
 * call the callback.
Packit fb9d21
 */
Packit fb9d21
int isl_basic_set_n_constraint(__isl_keep isl_basic_set *bset)
Packit fb9d21
{
Packit fb9d21
	return isl_basic_map_n_constraint(bset);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	struct isl_constraint *c;
Packit fb9d21
Packit fb9d21
	if (!bmap)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	isl_assert(bmap->ctx, ISL_F_ISSET(bmap, ISL_BASIC_MAP_FINAL),
Packit fb9d21
			return -1);
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bmap->n_eq; ++i) {
Packit fb9d21
		c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
Packit fb9d21
						&bmap->eq[i]);
Packit fb9d21
		if (!c)
Packit fb9d21
			return -1;
Packit fb9d21
		if (fn(c, user) < 0)
Packit fb9d21
			return -1;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bmap->n_ineq; ++i) {
Packit fb9d21
		c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
Packit fb9d21
						&bmap->ineq[i]);
Packit fb9d21
		if (!c)
Packit fb9d21
			return -1;
Packit fb9d21
		if (fn(c, user) < 0)
Packit fb9d21
			return -1;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Add the constraint to the list that "user" points to, if it is not
Packit fb9d21
 * a div constraint.
Packit fb9d21
 */
Packit fb9d21
static int collect_constraint(__isl_take isl_constraint *constraint,
Packit fb9d21
	void *user)
Packit fb9d21
{
Packit fb9d21
	isl_constraint_list **list = user;
Packit fb9d21
Packit fb9d21
	if (isl_constraint_is_div_constraint(constraint))
Packit fb9d21
		isl_constraint_free(constraint);
Packit fb9d21
	else
Packit fb9d21
		*list = isl_constraint_list_add(*list, constraint);
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return a list of constraints that, when combined, are equivalent
Packit fb9d21
 * to "bmap".  The input is required to have only known divs.
Packit fb9d21
 *
Packit fb9d21
 * There is no need to include the div constraints as they are
Packit fb9d21
 * implied by the div expressions.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint_list *isl_basic_map_get_constraint_list(
Packit fb9d21
	__isl_keep isl_basic_map *bmap)
Packit fb9d21
{
Packit fb9d21
	int n;
Packit fb9d21
	int known;
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
	isl_constraint_list *list;
Packit fb9d21
Packit fb9d21
	known = isl_basic_map_divs_known(bmap);
Packit fb9d21
	if (known < 0)
Packit fb9d21
		return NULL;
Packit fb9d21
	ctx = isl_basic_map_get_ctx(bmap);
Packit fb9d21
	if (!known)
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"input involves unknown divs", return NULL);
Packit fb9d21
Packit fb9d21
	n = isl_basic_map_n_constraint(bmap);
Packit fb9d21
	list = isl_constraint_list_alloc(ctx, n);
Packit fb9d21
	if (isl_basic_map_foreach_constraint(bmap,
Packit fb9d21
					    &collect_constraint, &list) < 0)
Packit fb9d21
		list = isl_constraint_list_free(list);
Packit fb9d21
Packit fb9d21
	return list;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return a list of constraints that, when combined, are equivalent
Packit fb9d21
 * to "bset".  The input is required to have only known divs.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint_list *isl_basic_set_get_constraint_list(
Packit fb9d21
	__isl_keep isl_basic_set *bset)
Packit fb9d21
{
Packit fb9d21
	return isl_basic_map_get_constraint_list(bset);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_constraint_is_equal(struct isl_constraint *constraint1,
Packit fb9d21
	struct isl_constraint *constraint2)
Packit fb9d21
{
Packit fb9d21
	int equal;
Packit fb9d21
Packit fb9d21
	if (!constraint1 || !constraint2)
Packit fb9d21
		return 0;
Packit fb9d21
	if (constraint1->eq != constraint2->eq)
Packit fb9d21
		return 0;
Packit fb9d21
	equal = isl_local_space_is_equal(constraint1->ls, constraint2->ls);
Packit fb9d21
	if (equal < 0 || !equal)
Packit fb9d21
		return equal;
Packit fb9d21
	return isl_vec_is_equal(constraint1->v, constraint2->v);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_basic_map *isl_basic_map_add_constraint(
Packit fb9d21
	struct isl_basic_map *bmap, struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
	isl_space *dim;
Packit fb9d21
	int equal_space;
Packit fb9d21
Packit fb9d21
	if (!bmap || !constraint)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	dim = isl_constraint_get_space(constraint);
Packit fb9d21
	equal_space = isl_space_is_equal(bmap->dim, dim);
Packit fb9d21
	isl_space_free(dim);
Packit fb9d21
	isl_assert(ctx, equal_space, goto error);
Packit fb9d21
Packit fb9d21
	bmap = isl_basic_map_intersect(bmap,
Packit fb9d21
				isl_basic_map_from_constraint(constraint));
Packit fb9d21
	return bmap;
Packit fb9d21
error:
Packit fb9d21
	isl_basic_map_free(bmap);
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_basic_set *isl_basic_set_add_constraint(
Packit fb9d21
	struct isl_basic_set *bset, struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	return (struct isl_basic_set *)
Packit fb9d21
		isl_basic_map_add_constraint((struct isl_basic_map *)bset,
Packit fb9d21
						constraint);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_map *isl_map_add_constraint(__isl_take isl_map *map,
Packit fb9d21
	__isl_take isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	isl_basic_map *bmap;
Packit fb9d21
Packit fb9d21
	bmap = isl_basic_map_from_constraint(constraint);
Packit fb9d21
	map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
Packit fb9d21
Packit fb9d21
	return map;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_set *isl_set_add_constraint(__isl_take isl_set *set,
Packit fb9d21
	__isl_take isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	return isl_map_add_constraint(set, constraint);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_space *isl_constraint_get_space(
Packit fb9d21
	__isl_keep isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	return constraint ? isl_local_space_get_space(constraint->ls) : NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_local_space *isl_constraint_get_local_space(
Packit fb9d21
	__isl_keep isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	return constraint ? isl_local_space_copy(constraint->ls) : NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_constraint_dim(struct isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
	return n(constraint, type);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_constraint_involves_dims(__isl_keep isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, unsigned first, unsigned n)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
	int *active = NULL;
Packit fb9d21
	int involves = 0;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
	if (n == 0)
Packit fb9d21
		return 0;
Packit fb9d21
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	if (first + n > isl_constraint_dim(constraint, type))
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"range out of bounds", return -1);
Packit fb9d21
Packit fb9d21
	active = isl_local_space_get_active(constraint->ls,
Packit fb9d21
					    constraint->v->el + 1);
Packit fb9d21
	if (!active)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	first += isl_local_space_offset(constraint->ls, type) - 1;
Packit fb9d21
	for (i = 0; i < n; ++i)
Packit fb9d21
		if (active[first + i]) {
Packit fb9d21
			involves = 1;
Packit fb9d21
			break;
Packit fb9d21
		}
Packit fb9d21
Packit fb9d21
	free(active);
Packit fb9d21
Packit fb9d21
	return involves;
Packit fb9d21
error:
Packit fb9d21
	free(active);
Packit fb9d21
	return -1;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Does the given constraint represent a lower bound on the given
Packit fb9d21
 * dimension?
Packit fb9d21
 */
Packit fb9d21
int isl_constraint_is_lower_bound(__isl_keep isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, unsigned pos)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"position out of bounds", return -1);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	return isl_int_is_pos(constraint->v->el[pos]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Does the given constraint represent an upper bound on the given
Packit fb9d21
 * dimension?
Packit fb9d21
 */
Packit fb9d21
int isl_constraint_is_upper_bound(__isl_keep isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, unsigned pos)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"position out of bounds", return -1);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	return isl_int_is_neg(constraint->v->el[pos]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
const char *isl_constraint_get_dim_name(__isl_keep isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, unsigned pos)
Packit fb9d21
{
Packit fb9d21
	return constraint ?
Packit fb9d21
	    isl_local_space_get_dim_name(constraint->ls, type, pos) : NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
void isl_constraint_get_constant(struct isl_constraint *constraint, isl_int *v)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return;
Packit fb9d21
	isl_int_set(*v, constraint->v->el[0]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return the constant term of "constraint".
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_val *isl_constraint_get_constant_val(
Packit fb9d21
	__isl_keep isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	return isl_val_int_from_isl_int(ctx, constraint->v->el[0]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
void isl_constraint_get_coefficient(struct isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, int pos, isl_int *v)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return;
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(constraint->v->ctx, isl_error_invalid,
Packit fb9d21
			"position out of bounds", return);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	isl_int_set(*v, constraint->v->el[pos]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Return the coefficient of the variable of type "type" at position "pos"
Packit fb9d21
 * of "constraint".
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_val *isl_constraint_get_coefficient_val(
Packit fb9d21
	__isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos)
Packit fb9d21
{
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	if (pos < 0 || pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"position out of bounds", return NULL);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	return isl_val_int_from_isl_int(ctx, constraint->v->el[pos]);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_aff *isl_constraint_get_div(__isl_keep isl_constraint *constraint,
Packit fb9d21
	int pos)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	return isl_local_space_get_div(constraint->ls, pos);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_constant(
Packit fb9d21
	__isl_take isl_constraint *constraint, isl_int v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	constraint->v = isl_vec_cow(constraint->v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		return isl_constraint_free(constraint);
Packit fb9d21
Packit fb9d21
	isl_int_set(constraint->v->el[0], v);
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Replace the constant term of "constraint" by "v".
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_constant_val(
Packit fb9d21
	__isl_take isl_constraint *constraint, __isl_take isl_val *v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint || !v)
Packit fb9d21
		goto error;
Packit fb9d21
	if (!isl_val_is_int(v))
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"expecting integer value", goto error);
Packit fb9d21
	constraint->v = isl_vec_set_element_val(constraint->v, 0, v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		constraint = isl_constraint_free(constraint);
Packit fb9d21
	return constraint;
Packit fb9d21
error:
Packit fb9d21
	isl_val_free(v);
Packit fb9d21
	return isl_constraint_free(constraint);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_constant_si(
Packit fb9d21
	__isl_take isl_constraint *constraint, int v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	constraint->v = isl_vec_cow(constraint->v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		return isl_constraint_free(constraint);
Packit fb9d21
Packit fb9d21
	isl_int_set_si(constraint->v->el[0], v);
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_coefficient(
Packit fb9d21
	__isl_take isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, int pos, isl_int v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(constraint->v->ctx, isl_error_invalid,
Packit fb9d21
			"position out of bounds",
Packit fb9d21
			return isl_constraint_free(constraint));
Packit fb9d21
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	constraint->v = isl_vec_cow(constraint->v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		return isl_constraint_free(constraint);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	isl_int_set(constraint->v->el[pos], v);
Packit fb9d21
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Replace the coefficient of the variable of type "type" at position "pos"
Packit fb9d21
 * of "constraint" by "v".
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_coefficient_val(
Packit fb9d21
	__isl_take isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, int pos, __isl_take isl_val *v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint || !v)
Packit fb9d21
		goto error;
Packit fb9d21
	if (!isl_val_is_int(v))
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"expecting integer value", goto error);
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"position out of bounds", goto error);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	constraint->v = isl_vec_set_element_val(constraint->v, pos, v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		constraint = isl_constraint_free(constraint);
Packit fb9d21
	return constraint;
Packit fb9d21
error:
Packit fb9d21
	isl_val_free(v);
Packit fb9d21
	return isl_constraint_free(constraint);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_constraint *isl_constraint_set_coefficient_si(
Packit fb9d21
	__isl_take isl_constraint *constraint,
Packit fb9d21
	enum isl_dim_type type, int pos, int v)
Packit fb9d21
{
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (pos >= isl_local_space_dim(constraint->ls, type))
Packit fb9d21
		isl_die(constraint->v->ctx, isl_error_invalid,
Packit fb9d21
			"position out of bounds",
Packit fb9d21
			return isl_constraint_free(constraint));
Packit fb9d21
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	constraint->v = isl_vec_cow(constraint->v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		return isl_constraint_free(constraint);
Packit fb9d21
Packit fb9d21
	pos += isl_local_space_offset(constraint->ls, type);
Packit fb9d21
	isl_int_set_si(constraint->v->el[pos], v);
Packit fb9d21
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Drop any constraint from "bset" that is identical to "constraint".
Packit fb9d21
 * In particular, this means that the local spaces of "bset" and
Packit fb9d21
 * "constraint" need to be the same.
Packit fb9d21
 *
Packit fb9d21
 * Since the given constraint may actually be a pointer into the bset,
Packit fb9d21
 * we have to be careful not to reorder the constraints as the user
Packit fb9d21
 * may be holding on to other constraints from the same bset.
Packit fb9d21
 * This should be cleaned up when the internal representation of
Packit fb9d21
 * isl_constraint is changed to use isl_aff.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_basic_set *isl_basic_set_drop_constraint(
Packit fb9d21
	__isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	unsigned n;
Packit fb9d21
	isl_int **row;
Packit fb9d21
	unsigned total;
Packit fb9d21
	isl_local_space *ls1;
Packit fb9d21
	int equal;
Packit fb9d21
Packit fb9d21
	if (!bset || !constraint)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	ls1 = isl_basic_set_get_local_space(bset);
Packit fb9d21
	equal = isl_local_space_is_equal(ls1, constraint->ls);
Packit fb9d21
	isl_local_space_free(ls1);
Packit fb9d21
	if (equal < 0)
Packit fb9d21
		goto error;
Packit fb9d21
	if (!equal) {
Packit fb9d21
		isl_constraint_free(constraint);
Packit fb9d21
		return bset;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	if (isl_constraint_is_equality(constraint)) {
Packit fb9d21
		n = bset->n_eq;
Packit fb9d21
		row = bset->eq;
Packit fb9d21
	} else {
Packit fb9d21
		n = bset->n_ineq;
Packit fb9d21
		row = bset->ineq;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	total = isl_constraint_dim(constraint, isl_dim_all);
Packit fb9d21
	for (i = 0; i < n; ++i)
Packit fb9d21
		if (isl_seq_eq(row[i], constraint->v->el, 1 + total))
Packit fb9d21
			isl_seq_clr(row[i], 1 + total);
Packit fb9d21
			
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	return bset;
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	isl_basic_set_free(bset);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
Packit fb9d21
	constraint = isl_constraint_cow(constraint);
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	if (isl_constraint_is_equality(constraint))
Packit fb9d21
		isl_die(ctx, isl_error_invalid, "cannot negate equality",
Packit fb9d21
			return isl_constraint_free(constraint));
Packit fb9d21
	constraint->v = isl_vec_neg(constraint->v);
Packit fb9d21
	constraint->v = isl_vec_cow(constraint->v);
Packit fb9d21
	if (!constraint->v)
Packit fb9d21
		return isl_constraint_free(constraint);
Packit fb9d21
	isl_int_sub_ui(constraint->v->el[0], constraint->v->el[0], 1);
Packit fb9d21
	return constraint;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_constraint_is_equality(struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
	return constraint->eq;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	int n_div;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return -1;
Packit fb9d21
	if (isl_constraint_is_equality(constraint))
Packit fb9d21
		return 0;
Packit fb9d21
	n_div = isl_constraint_dim(constraint, isl_dim_div);
Packit fb9d21
	for (i = 0; i < n_div; ++i) {
Packit fb9d21
		if (isl_local_space_is_div_constraint(constraint->ls,
Packit fb9d21
							constraint->v->el, i))
Packit fb9d21
			return 1;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* We manually set ISL_BASIC_SET_FINAL instead of calling
Packit fb9d21
 * isl_basic_map_finalize because we want to keep the position
Packit fb9d21
 * of the divs and we therefore do not want to throw away redundant divs.
Packit fb9d21
 * This is arguably a bit fragile.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_basic_map *isl_basic_map_from_constraint(
Packit fb9d21
	__isl_take isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	int k;
Packit fb9d21
	isl_local_space *ls;
Packit fb9d21
	struct isl_basic_map *bmap;
Packit fb9d21
	isl_int *c;
Packit fb9d21
	unsigned total;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	ls = isl_local_space_copy(constraint->ls);
Packit fb9d21
	bmap = isl_basic_map_from_local_space(ls);
Packit fb9d21
	bmap = isl_basic_map_extend_constraints(bmap, 1, 1);
Packit fb9d21
	if (isl_constraint_is_equality(constraint)) {
Packit fb9d21
		k = isl_basic_map_alloc_equality(bmap);
Packit fb9d21
		if (k < 0)
Packit fb9d21
			goto error;
Packit fb9d21
		c = bmap->eq[k];
Packit fb9d21
	}
Packit fb9d21
	else {
Packit fb9d21
		k = isl_basic_map_alloc_inequality(bmap);
Packit fb9d21
		if (k < 0)
Packit fb9d21
			goto error;
Packit fb9d21
		c = bmap->ineq[k];
Packit fb9d21
	}
Packit fb9d21
	total = isl_basic_map_total_dim(bmap);
Packit fb9d21
	isl_seq_cpy(c, constraint->v->el, 1 + total);
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	if (bmap)
Packit fb9d21
		ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
Packit fb9d21
	return bmap;
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	isl_basic_map_free(bmap);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
struct isl_basic_set *isl_basic_set_from_constraint(
Packit fb9d21
	struct isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (isl_constraint_dim(constraint, isl_dim_in) != 0)
Packit fb9d21
		isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
Packit fb9d21
			"not a set constraint", goto error);
Packit fb9d21
	return (isl_basic_set *)isl_basic_map_from_constraint(constraint);
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(constraint);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Is the variable of "type" at position "pos" of "bmap" defined
Packit fb9d21
 * in terms of earlier dimensions through an equality?
Packit fb9d21
 *
Packit fb9d21
 * If so, and if c is not NULL, then return a copy of this equality in *c.
Packit fb9d21
 */
Packit fb9d21
int isl_basic_map_has_defining_equality(
Packit fb9d21
	__isl_keep isl_basic_map *bmap, enum isl_dim_type type, int pos,
Packit fb9d21
	__isl_give isl_constraint **c)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	unsigned offset;
Packit fb9d21
	unsigned total;
Packit fb9d21
Packit fb9d21
	if (!bmap)
Packit fb9d21
		return -1;
Packit fb9d21
	offset = basic_map_offset(bmap, type);
Packit fb9d21
	total = isl_basic_map_total_dim(bmap);
Packit fb9d21
	isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
Packit fb9d21
	for (i = 0; i < bmap->n_eq; ++i) {
Packit fb9d21
		if (isl_int_is_zero(bmap->eq[i][offset + pos]) ||
Packit fb9d21
		    isl_seq_first_non_zero(bmap->eq[i]+offset+pos+1,
Packit fb9d21
					   1+total-offset-pos-1) != -1)
Packit fb9d21
			continue;
Packit fb9d21
		if (c)
Packit fb9d21
			*c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
Packit fb9d21
								&bmap->eq[i]);
Packit fb9d21
		return 1;
Packit fb9d21
	}
Packit fb9d21
	return 0;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Is the variable of "type" at position "pos" of "bset" defined
Packit fb9d21
 * in terms of earlier dimensions through an equality?
Packit fb9d21
 *
Packit fb9d21
 * If so, and if c is not NULL, then return a copy of this equality in *c.
Packit fb9d21
 */
Packit fb9d21
int isl_basic_set_has_defining_equality(
Packit fb9d21
	__isl_keep isl_basic_set *bset, enum isl_dim_type type, int pos,
Packit fb9d21
	__isl_give isl_constraint **c)
Packit fb9d21
{
Packit fb9d21
	return isl_basic_map_has_defining_equality((isl_basic_map *)bset,
Packit fb9d21
						    type, pos, c);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
int isl_basic_set_has_defining_inequalities(
Packit fb9d21
	struct isl_basic_set *bset, enum isl_dim_type type, int pos,
Packit fb9d21
	struct isl_constraint **lower,
Packit fb9d21
	struct isl_constraint **upper)
Packit fb9d21
{
Packit fb9d21
	int i, j;
Packit fb9d21
	unsigned offset;
Packit fb9d21
	unsigned total;
Packit fb9d21
	isl_int m;
Packit fb9d21
	isl_int **lower_line, **upper_line;
Packit fb9d21
Packit fb9d21
	if (!bset)
Packit fb9d21
		return -1;
Packit fb9d21
	offset = basic_set_offset(bset, type);
Packit fb9d21
	total = isl_basic_set_total_dim(bset);
Packit fb9d21
	isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
Packit fb9d21
	isl_int_init(m);
Packit fb9d21
	for (i = 0; i < bset->n_ineq; ++i) {
Packit fb9d21
		if (isl_int_is_zero(bset->ineq[i][offset + pos]))
Packit fb9d21
			continue;
Packit fb9d21
		if (isl_int_is_one(bset->ineq[i][offset + pos]))
Packit fb9d21
			continue;
Packit fb9d21
		if (isl_int_is_negone(bset->ineq[i][offset + pos]))
Packit fb9d21
			continue;
Packit fb9d21
		if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1,
Packit fb9d21
						1+total-offset-pos-1) != -1)
Packit fb9d21
			continue;
Packit fb9d21
		for (j = i + 1; j < bset->n_ineq; ++j) {
Packit fb9d21
			if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1,
Packit fb9d21
					    total))
Packit fb9d21
				continue;
Packit fb9d21
			isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]);
Packit fb9d21
			if (isl_int_abs_ge(m, bset->ineq[i][offset+pos]))
Packit fb9d21
				continue;
Packit fb9d21
Packit fb9d21
			if (isl_int_is_pos(bset->ineq[i][offset+pos])) {
Packit fb9d21
				lower_line = &bset->ineq[i];
Packit fb9d21
				upper_line = &bset->ineq[j];
Packit fb9d21
			} else {
Packit fb9d21
				lower_line = &bset->ineq[j];
Packit fb9d21
				upper_line = &bset->ineq[i];
Packit fb9d21
			}
Packit fb9d21
			*lower = isl_basic_set_constraint(
Packit fb9d21
					isl_basic_set_copy(bset), lower_line);
Packit fb9d21
			*upper = isl_basic_set_constraint(
Packit fb9d21
					isl_basic_set_copy(bset), upper_line);
Packit fb9d21
			isl_int_clear(m);
Packit fb9d21
			return 1;
Packit fb9d21
		}
Packit fb9d21
	}
Packit fb9d21
	*lower = NULL;
Packit fb9d21
	*upper = NULL;
Packit fb9d21
	isl_int_clear(m);
Packit fb9d21
	return 0;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Given two constraints "a" and "b" on the variable at position "abs_pos"
Packit fb9d21
 * (in "a" and "b"), add a constraint to "bset" that ensures that the
Packit fb9d21
 * bound implied by "a" is (strictly) larger than the bound implied by "b".
Packit fb9d21
 *
Packit fb9d21
 * If both constraints imply lower bounds, then this means that "a" is
Packit fb9d21
 * active in the result.
Packit fb9d21
 * If both constraints imply upper bounds, then this means that "b" is
Packit fb9d21
 * active in the result.
Packit fb9d21
 */
Packit fb9d21
static __isl_give isl_basic_set *add_larger_bound_constraint(
Packit fb9d21
	__isl_take isl_basic_set *bset, isl_int *a, isl_int *b,
Packit fb9d21
	unsigned abs_pos, int strict)
Packit fb9d21
{
Packit fb9d21
	int k;
Packit fb9d21
	isl_int t;
Packit fb9d21
	unsigned total;
Packit fb9d21
Packit fb9d21
	k = isl_basic_set_alloc_inequality(bset);
Packit fb9d21
	if (k < 0)
Packit fb9d21
		goto error;
Packit fb9d21
Packit fb9d21
	total = isl_basic_set_dim(bset, isl_dim_all);
Packit fb9d21
Packit fb9d21
	isl_int_init(t);
Packit fb9d21
	isl_int_neg(t, b[1 + abs_pos]);
Packit fb9d21
Packit fb9d21
	isl_seq_combine(bset->ineq[k], t, a, a[1 + abs_pos], b, 1 + abs_pos);
Packit fb9d21
	isl_seq_combine(bset->ineq[k] + 1 + abs_pos,
Packit fb9d21
		t, a + 1 + abs_pos + 1, a[1 + abs_pos], b + 1 + abs_pos + 1,
Packit fb9d21
		total - abs_pos);
Packit fb9d21
Packit fb9d21
	if (strict)
Packit fb9d21
		isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
Packit fb9d21
Packit fb9d21
	isl_int_clear(t);
Packit fb9d21
Packit fb9d21
	return bset;
Packit fb9d21
error:
Packit fb9d21
	isl_basic_set_free(bset);
Packit fb9d21
	return NULL;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Add constraints to "context" that ensure that "u" is the smallest
Packit fb9d21
 * (and therefore active) upper bound on "abs_pos" in "bset" and return
Packit fb9d21
 * the resulting basic set.
Packit fb9d21
 */
Packit fb9d21
static __isl_give isl_basic_set *set_smallest_upper_bound(
Packit fb9d21
	__isl_keep isl_basic_set *context,
Packit fb9d21
	__isl_keep isl_basic_set *bset, unsigned abs_pos, int n_upper, int u)
Packit fb9d21
{
Packit fb9d21
	int j;
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_copy(context);
Packit fb9d21
	context = isl_basic_set_cow(context);
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_extend_constraints(context, 0, n_upper - 1);
Packit fb9d21
Packit fb9d21
	for (j = 0; j < bset->n_ineq; ++j) {
Packit fb9d21
		if (j == u)
Packit fb9d21
			continue;
Packit fb9d21
		if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
		context = add_larger_bound_constraint(context,
Packit fb9d21
			bset->ineq[j], bset->ineq[u], abs_pos, j > u);
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_simplify(context);
Packit fb9d21
	context = isl_basic_set_finalize(context);
Packit fb9d21
Packit fb9d21
	return context;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Add constraints to "context" that ensure that "u" is the largest
Packit fb9d21
 * (and therefore active) upper bound on "abs_pos" in "bset" and return
Packit fb9d21
 * the resulting basic set.
Packit fb9d21
 */
Packit fb9d21
static __isl_give isl_basic_set *set_largest_lower_bound(
Packit fb9d21
	__isl_keep isl_basic_set *context,
Packit fb9d21
	__isl_keep isl_basic_set *bset, unsigned abs_pos, int n_lower, int l)
Packit fb9d21
{
Packit fb9d21
	int j;
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_copy(context);
Packit fb9d21
	context = isl_basic_set_cow(context);
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_extend_constraints(context, 0, n_lower - 1);
Packit fb9d21
Packit fb9d21
	for (j = 0; j < bset->n_ineq; ++j) {
Packit fb9d21
		if (j == l)
Packit fb9d21
			continue;
Packit fb9d21
		if (!isl_int_is_pos(bset->ineq[j][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
		context = add_larger_bound_constraint(context,
Packit fb9d21
			bset->ineq[l], bset->ineq[j], abs_pos, j > l);
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_simplify(context);
Packit fb9d21
	context = isl_basic_set_finalize(context);
Packit fb9d21
Packit fb9d21
	return context;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static int foreach_upper_bound(__isl_keep isl_basic_set *bset,
Packit fb9d21
	enum isl_dim_type type, unsigned abs_pos,
Packit fb9d21
	__isl_take isl_basic_set *context, int n_upper,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *lower,
Packit fb9d21
		  __isl_take isl_constraint *upper,
Packit fb9d21
		  __isl_take isl_basic_set *bset, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	isl_basic_set *context_i;
Packit fb9d21
	isl_constraint *upper = NULL;
Packit fb9d21
	int i;
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bset->n_ineq; ++i) {
Packit fb9d21
		if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
Packit fb9d21
		context_i = set_smallest_upper_bound(context, bset,
Packit fb9d21
							abs_pos, n_upper, i);
Packit fb9d21
		if (isl_basic_set_is_empty(context_i)) {
Packit fb9d21
			isl_basic_set_free(context_i);
Packit fb9d21
			continue;
Packit fb9d21
		}
Packit fb9d21
		upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
Packit fb9d21
						&bset->ineq[i]);
Packit fb9d21
		if (!upper || !context_i)
Packit fb9d21
			goto error;
Packit fb9d21
		if (fn(NULL, upper, context_i, user) < 0)
Packit fb9d21
			break;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
Packit fb9d21
	if (i < bset->n_ineq)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(upper);
Packit fb9d21
	isl_basic_set_free(context_i);
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
	return -1;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static int foreach_lower_bound(__isl_keep isl_basic_set *bset,
Packit fb9d21
	enum isl_dim_type type, unsigned abs_pos,
Packit fb9d21
	__isl_take isl_basic_set *context, int n_lower,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *lower,
Packit fb9d21
		  __isl_take isl_constraint *upper,
Packit fb9d21
		  __isl_take isl_basic_set *bset, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	isl_basic_set *context_i;
Packit fb9d21
	isl_constraint *lower = NULL;
Packit fb9d21
	int i;
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bset->n_ineq; ++i) {
Packit fb9d21
		if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
Packit fb9d21
		context_i = set_largest_lower_bound(context, bset,
Packit fb9d21
							abs_pos, n_lower, i);
Packit fb9d21
		if (isl_basic_set_is_empty(context_i)) {
Packit fb9d21
			isl_basic_set_free(context_i);
Packit fb9d21
			continue;
Packit fb9d21
		}
Packit fb9d21
		lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
Packit fb9d21
						&bset->ineq[i]);
Packit fb9d21
		if (!lower || !context_i)
Packit fb9d21
			goto error;
Packit fb9d21
		if (fn(lower, NULL, context_i, user) < 0)
Packit fb9d21
			break;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
Packit fb9d21
	if (i < bset->n_ineq)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(lower);
Packit fb9d21
	isl_basic_set_free(context_i);
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
	return -1;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
static int foreach_bound_pair(__isl_keep isl_basic_set *bset,
Packit fb9d21
	enum isl_dim_type type, unsigned abs_pos,
Packit fb9d21
	__isl_take isl_basic_set *context, int n_lower, int n_upper,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *lower,
Packit fb9d21
		  __isl_take isl_constraint *upper,
Packit fb9d21
		  __isl_take isl_basic_set *bset, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	isl_basic_set *context_i, *context_j;
Packit fb9d21
	isl_constraint *lower = NULL;
Packit fb9d21
	isl_constraint *upper = NULL;
Packit fb9d21
	int i, j;
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bset->n_ineq; ++i) {
Packit fb9d21
		if (!isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
Packit fb9d21
		context_i = set_largest_lower_bound(context, bset,
Packit fb9d21
							abs_pos, n_lower, i);
Packit fb9d21
		if (isl_basic_set_is_empty(context_i)) {
Packit fb9d21
			isl_basic_set_free(context_i);
Packit fb9d21
			continue;
Packit fb9d21
		}
Packit fb9d21
Packit fb9d21
		for (j = 0; j < bset->n_ineq; ++j) {
Packit fb9d21
			if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
Packit fb9d21
				continue;
Packit fb9d21
Packit fb9d21
			context_j = set_smallest_upper_bound(context_i, bset,
Packit fb9d21
							    abs_pos, n_upper, j);
Packit fb9d21
			context_j = isl_basic_set_extend_constraints(context_j,
Packit fb9d21
									0, 1);
Packit fb9d21
			context_j = add_larger_bound_constraint(context_j,
Packit fb9d21
				bset->ineq[i], bset->ineq[j], abs_pos, 0);
Packit fb9d21
			context_j = isl_basic_set_simplify(context_j);
Packit fb9d21
			context_j = isl_basic_set_finalize(context_j);
Packit fb9d21
			if (isl_basic_set_is_empty(context_j)) {
Packit fb9d21
				isl_basic_set_free(context_j);
Packit fb9d21
				continue;
Packit fb9d21
			}
Packit fb9d21
			lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
Packit fb9d21
							&bset->ineq[i]);
Packit fb9d21
			upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
Packit fb9d21
							&bset->ineq[j]);
Packit fb9d21
			if (!lower || !upper || !context_j)
Packit fb9d21
				goto error;
Packit fb9d21
			if (fn(lower, upper, context_j, user) < 0)
Packit fb9d21
				break;
Packit fb9d21
		}
Packit fb9d21
Packit fb9d21
		isl_basic_set_free(context_i);
Packit fb9d21
Packit fb9d21
		if (j < bset->n_ineq)
Packit fb9d21
			break;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
Packit fb9d21
	if (i < bset->n_ineq)
Packit fb9d21
		return -1;
Packit fb9d21
Packit fb9d21
	return 0;
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(lower);
Packit fb9d21
	isl_constraint_free(upper);
Packit fb9d21
	isl_basic_set_free(context_i);
Packit fb9d21
	isl_basic_set_free(context_j);
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
	return -1;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* For each pair of lower and upper bounds on the variable "pos"
Packit fb9d21
 * of type "type", call "fn" with these lower and upper bounds and the
Packit fb9d21
 * set of constraints on the remaining variables where these bounds
Packit fb9d21
 * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds.
Packit fb9d21
 *
Packit fb9d21
 * If the designated variable is equal to an affine combination of the
Packit fb9d21
 * other variables then fn is called with both lower and upper
Packit fb9d21
 * set to the corresponding equality.
Packit fb9d21
 *
Packit fb9d21
 * If there is no lower (or upper) bound, then NULL is passed
Packit fb9d21
 * as the corresponding bound.
Packit fb9d21
 *
Packit fb9d21
 * We first check if the variable is involved in any equality.
Packit fb9d21
 * If not, we count the number of lower and upper bounds and
Packit fb9d21
 * act accordingly.
Packit fb9d21
 */
Packit fb9d21
int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset,
Packit fb9d21
	enum isl_dim_type type, unsigned pos,
Packit fb9d21
	int (*fn)(__isl_take isl_constraint *lower,
Packit fb9d21
		  __isl_take isl_constraint *upper,
Packit fb9d21
		  __isl_take isl_basic_set *bset, void *user), void *user)
Packit fb9d21
{
Packit fb9d21
	int i;
Packit fb9d21
	isl_constraint *lower = NULL;
Packit fb9d21
	isl_constraint *upper = NULL;
Packit fb9d21
	isl_basic_set *context = NULL;
Packit fb9d21
	unsigned abs_pos;
Packit fb9d21
	int n_lower, n_upper;
Packit fb9d21
Packit fb9d21
	if (!bset)
Packit fb9d21
		return -1;
Packit fb9d21
	isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
Packit fb9d21
	isl_assert(bset->ctx, type == isl_dim_param || type == isl_dim_set,
Packit fb9d21
		return -1);
Packit fb9d21
Packit fb9d21
	abs_pos = pos;
Packit fb9d21
	if (type == isl_dim_set)
Packit fb9d21
		abs_pos += isl_basic_set_dim(bset, isl_dim_param);
Packit fb9d21
Packit fb9d21
	for (i = 0; i < bset->n_eq; ++i) {
Packit fb9d21
		if (isl_int_is_zero(bset->eq[i][1 + abs_pos]))
Packit fb9d21
			continue;
Packit fb9d21
Packit fb9d21
		lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
Packit fb9d21
						&bset->eq[i]);
Packit fb9d21
		upper = isl_constraint_copy(lower);
Packit fb9d21
		context = isl_basic_set_remove_dims(isl_basic_set_copy(bset),
Packit fb9d21
					type, pos, 1);
Packit fb9d21
		if (!lower || !upper || !context)
Packit fb9d21
			goto error;
Packit fb9d21
		return fn(lower, upper, context, user);
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	n_lower = 0;
Packit fb9d21
	n_upper = 0;
Packit fb9d21
	for (i = 0; i < bset->n_ineq; ++i) {
Packit fb9d21
		if (isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
Packit fb9d21
			n_lower++;
Packit fb9d21
		else if (isl_int_is_neg(bset->ineq[i][1 + abs_pos]))
Packit fb9d21
			n_upper++;
Packit fb9d21
	}
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_copy(bset);
Packit fb9d21
	context = isl_basic_set_cow(context);
Packit fb9d21
	if (!context)
Packit fb9d21
		goto error;
Packit fb9d21
	for (i = context->n_ineq - 1; i >= 0; --i)
Packit fb9d21
		if (!isl_int_is_zero(context->ineq[i][1 + abs_pos]))
Packit fb9d21
			isl_basic_set_drop_inequality(context, i);
Packit fb9d21
Packit fb9d21
	context = isl_basic_set_drop(context, type, pos, 1);
Packit fb9d21
	if (!n_lower && !n_upper)
Packit fb9d21
		return fn(NULL, NULL, context, user);
Packit fb9d21
	if (!n_lower)
Packit fb9d21
		return foreach_upper_bound(bset, type, abs_pos, context, n_upper,
Packit fb9d21
						fn, user);
Packit fb9d21
	if (!n_upper)
Packit fb9d21
		return foreach_lower_bound(bset, type, abs_pos, context, n_lower,
Packit fb9d21
						fn, user);
Packit fb9d21
	return foreach_bound_pair(bset, type, abs_pos, context, n_lower, n_upper,
Packit fb9d21
					fn, user);
Packit fb9d21
error:
Packit fb9d21
	isl_constraint_free(lower);
Packit fb9d21
	isl_constraint_free(upper);
Packit fb9d21
	isl_basic_set_free(context);
Packit fb9d21
	return -1;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
__isl_give isl_aff *isl_constraint_get_bound(
Packit fb9d21
	__isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos)
Packit fb9d21
{
Packit fb9d21
	isl_aff *aff;
Packit fb9d21
	isl_ctx *ctx;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
	ctx = isl_constraint_get_ctx(constraint);
Packit fb9d21
	if (pos >= isl_constraint_dim(constraint, type))
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"index out of bounds", return NULL);
Packit fb9d21
	if (isl_constraint_dim(constraint, isl_dim_in) != 0)
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"not a set constraint", return NULL);
Packit fb9d21
Packit fb9d21
	pos += offset(constraint, type);
Packit fb9d21
	if (isl_int_is_zero(constraint->v->el[pos]))
Packit fb9d21
		isl_die(ctx, isl_error_invalid,
Packit fb9d21
			"constraint does not define a bound on given dimension",
Packit fb9d21
			return NULL);
Packit fb9d21
Packit fb9d21
	aff = isl_aff_alloc(isl_local_space_copy(constraint->ls));
Packit fb9d21
	if (!aff)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	if (isl_int_is_neg(constraint->v->el[pos]))
Packit fb9d21
		isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
Packit fb9d21
	else
Packit fb9d21
		isl_seq_neg(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
Packit fb9d21
	isl_int_set_si(aff->v->el[1 + pos], 0);
Packit fb9d21
	isl_int_abs(aff->v->el[0], constraint->v->el[pos]);
Packit fb9d21
Packit fb9d21
	return aff;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* For an inequality constraint
Packit fb9d21
 *
Packit fb9d21
 *	f >= 0
Packit fb9d21
 *
Packit fb9d21
 * or an equality constraint
Packit fb9d21
 *
Packit fb9d21
 *	f = 0
Packit fb9d21
 *
Packit fb9d21
 * return the affine expression f.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_aff *isl_constraint_get_aff(
Packit fb9d21
	__isl_keep isl_constraint *constraint)
Packit fb9d21
{
Packit fb9d21
	isl_aff *aff;
Packit fb9d21
Packit fb9d21
	if (!constraint)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	aff = isl_aff_alloc(isl_local_space_copy(constraint->ls));
Packit fb9d21
	if (!aff)
Packit fb9d21
		return NULL;
Packit fb9d21
Packit fb9d21
	isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
Packit fb9d21
	isl_int_set_si(aff->v->el[0], 1);
Packit fb9d21
Packit fb9d21
	return aff;
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Construct an inequality (eq = 0) or equality (eq = 1) constraint from "aff".
Packit fb9d21
 * In particular, construct aff >= 0 or aff = 0.
Packit fb9d21
 *
Packit fb9d21
 * The denominator of "aff" can be ignored.
Packit fb9d21
 */
Packit fb9d21
static __isl_give isl_constraint *isl_constraint_alloc_aff(int eq,
Packit fb9d21
	__isl_take isl_aff *aff)
Packit fb9d21
{
Packit fb9d21
	isl_local_space *ls;
Packit fb9d21
	isl_vec *v;
Packit fb9d21
Packit fb9d21
	if (!aff)
Packit fb9d21
		return NULL;
Packit fb9d21
	ls = isl_aff_get_domain_local_space(aff);
Packit fb9d21
	v = isl_vec_drop_els(isl_vec_copy(aff->v), 0, 1);
Packit fb9d21
	isl_aff_free(aff);
Packit fb9d21
Packit fb9d21
	return isl_constraint_alloc_vec(eq, ls, v);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Construct an equality constraint equating the given affine expression
Packit fb9d21
 * to zero.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint *isl_equality_from_aff(__isl_take isl_aff *aff)
Packit fb9d21
{
Packit fb9d21
	return isl_constraint_alloc_aff(1, aff);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Construct an inequality constraint enforcing the given affine expression
Packit fb9d21
 * to be non-negative.
Packit fb9d21
 */
Packit fb9d21
__isl_give isl_constraint *isl_inequality_from_aff(__isl_take isl_aff *aff)
Packit fb9d21
{
Packit fb9d21
	return isl_constraint_alloc_aff(0, aff);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Compare two isl_constraints.
Packit fb9d21
 *
Packit fb9d21
 * Return -1 if "c1" is "smaller" than "c2", 1 if "c1" is "greater"
Packit fb9d21
 * than "c2" and 0 if they are equal.
Packit fb9d21
 *
Packit fb9d21
 * The order is fairly arbitrary.  We do consider constraints that only involve
Packit fb9d21
 * earlier dimensions as "smaller".
Packit fb9d21
 */
Packit fb9d21
int isl_constraint_plain_cmp(__isl_keep isl_constraint *c1,
Packit fb9d21
	__isl_keep isl_constraint *c2)
Packit fb9d21
{
Packit fb9d21
	int cmp;
Packit fb9d21
	int last1, last2;
Packit fb9d21
Packit fb9d21
	if (c1 == c2)
Packit fb9d21
		return 0;
Packit fb9d21
	if (!c1)
Packit fb9d21
		return -1;
Packit fb9d21
	if (!c2)
Packit fb9d21
		return 1;
Packit fb9d21
	cmp = isl_local_space_cmp(c1->ls, c2->ls);
Packit fb9d21
	if (cmp != 0)
Packit fb9d21
		return cmp;
Packit fb9d21
Packit fb9d21
	last1 = isl_seq_last_non_zero(c1->v->el + 1, c1->v->size - 1);
Packit fb9d21
	last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1);
Packit fb9d21
	if (last1 != last2)
Packit fb9d21
		return last1 - last2;
Packit fb9d21
Packit fb9d21
	return isl_seq_cmp(c1->v->el, c2->v->el, c1->v->size);
Packit fb9d21
}
Packit fb9d21
Packit fb9d21
/* Compare two constraints based on their final (non-zero) coefficients.
Packit fb9d21
 * In particular, the constraint that involves later variables or
Packit fb9d21
 * that has a larger coefficient for a shared latest variable
Packit fb9d21
 * is considered "greater" than the other constraint.
Packit fb9d21
 *
Packit fb9d21
 * Return -1 if "c1" is "smaller" than "c2", 1 if "c1" is "greater"
Packit fb9d21
 * than "c2" and 0 if they are equal.
Packit fb9d21
 *
Packit fb9d21
 * If the constraints live in different local spaces, then we cannot
Packit fb9d21
 * really compare the constraints so we compare the local spaces instead.
Packit fb9d21
 */
Packit fb9d21
int isl_constraint_cmp_last_non_zero(__isl_keep isl_constraint *c1,
Packit fb9d21
	__isl_keep isl_constraint *c2)
Packit fb9d21
{
Packit fb9d21
	int cmp;
Packit fb9d21
	int last1, last2;
Packit fb9d21
Packit fb9d21
	if (c1 == c2)
Packit fb9d21
		return 0;
Packit fb9d21
	if (!c1)
Packit fb9d21
		return -1;
Packit fb9d21
	if (!c2)
Packit fb9d21
		return 1;
Packit fb9d21
	cmp = isl_local_space_cmp(c1->ls, c2->ls);
Packit fb9d21
	if (cmp != 0)
Packit fb9d21
		return cmp;
Packit fb9d21
Packit fb9d21
	last1 = isl_seq_last_non_zero(c1->v->el + 1, c1->v->size - 1);
Packit fb9d21
	last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1);
Packit fb9d21
	if (last1 != last2)
Packit fb9d21
		return last1 - last2;
Packit fb9d21
	if (last1 == -1)
Packit fb9d21
		return 0;
Packit fb9d21
	return isl_int_abs_cmp(c1->v->el[1 + last1], c2->v->el[1 + last2]);
Packit fb9d21
}