add isl_polyhedron_minimize application

diff --git a/Makefile.am b/Makefile.am
index 70b501f..4bcb94f 100644 (file)
--- a/Makefile.am
+++ b/Makefile.am
@@ -8,7 +8,8 @@ DIST_SUBDIRS = $(MAYBE_PIPLIB)
 ACLOCAL_AMFLAGS = -I m4
 
 lib_LTLIBRARIES = libisl.la
-noinst_PROGRAMS = isl_test isl_polyhedron_sample isl_pip
+noinst_PROGRAMS = isl_test isl_polyhedron_sample isl_pip \
+       isl_polyhedron_minimize
 TESTS = isl_test
 
 if HAVE_POLYLIB
@@ -113,6 +114,12 @@ isl_pip_LDADD = libisl.la
 isl_pip_SOURCES = \
        pip.c
 
+isl_polyhedron_minimize_CPPFLAGS = -I$(srcdir)/include -Iinclude/ \
+       @GMP_CPPFLAGS@
+isl_polyhedron_minimize_LDADD = libisl.la
+isl_polyhedron_minimize_SOURCES = \
+       polyhedron_minimize.c
+
 nodist_pkginclude_HEADERS = \
        include/isl_ctx.h \
        include/isl_stdint.h

diff --git a/polyhedron_minimize.c b/polyhedron_minimize.c
new file mode 100644 (file)
index 0000000..fbd0e1a
--- /dev/null
+++ b/polyhedron_minimize.c
@@ -0,0 +1,89 @@
+#include <assert.h>
+#include "isl_set.h"
+#include "isl_vec.h"
+#include "isl_ilp.h"
+#include "isl_seq.h"
+
+/* The input of this program is the same as that of the "polytope_minimize"
+ * program from the barvinok distribution.
+ *
+ * Constraints of set is PolyLib format.
+ * Linear or affine objective function in PolyLib format.
+ */
+
+static struct isl_vec *isl_vec_lin_to_aff(struct isl_vec *vec)
+{
+       struct isl_vec *aff;
+
+       if (!vec)
+               return NULL;
+       aff = isl_vec_alloc(vec->ctx, 1 + vec->size);
+       if (!aff)
+               goto error;
+       isl_int_set_si(aff->el[0], 0);
+       isl_seq_cpy(aff->el + 1, vec->el, vec->size);
+       isl_vec_free(vec);
+       return aff;
+error:
+       isl_vec_free(vec);
+       return NULL;
+}
+
+/* Rotate elements of vector right.
+ * In particular, move the constant term from the end of the
+ * vector to the start of the vector.
+ */
+static struct isl_vec *vec_ror(struct isl_vec *vec)
+{
+       int i;
+
+       if (!vec)
+               return NULL;
+       for (i = vec->size - 2; i >= 0; --i)
+               isl_int_swap(vec->el[i], vec->el[i + 1]);
+       return vec;
+}
+
+int main(int argc, char **argv)
+{
+       struct isl_ctx *ctx = isl_ctx_alloc();
+       struct isl_basic_set *bset;
+       struct isl_vec *obj;
+       struct isl_vec *sol;
+       isl_int opt;
+       unsigned dim;
+       enum isl_lp_result res;
+
+       isl_int_init(opt);
+       bset = isl_basic_set_read_from_file(ctx, stdin, 0, ISL_FORMAT_POLYLIB);
+       assert(bset);
+       obj = isl_vec_read_from_file(ctx, stdin, ISL_FORMAT_POLYLIB);
+       assert(obj);
+       dim = isl_basic_set_total_dim(bset);
+       assert(obj->size >= dim && obj->size <= dim + 1);
+       if (obj->size != dim + 1)
+               obj = isl_vec_lin_to_aff(obj);
+       else
+               obj = vec_ror(obj);
+       res = isl_basic_set_solve_ilp(bset, 0, obj->el, &opt, &sol);
+       assert(res != isl_lp_error);
+       switch (res) {
+       case isl_lp_empty:
+               fprintf(stdout, "empty\n");
+               break;
+       case isl_lp_unbounded:
+               fprintf(stdout, "unbounded\n");
+               break;
+       case isl_lp_ok:
+               isl_vec_dump(sol, stdout, 0);
+               isl_int_print(stdout, opt, 0);
+               fprintf(stdout, "\n");
+       }
+       isl_basic_set_free(bset);
+       isl_vec_free(obj);
+       isl_vec_free(sol);
+       isl_ctx_free(ctx);
+       isl_int_clear(opt);
+
+       return 0;
+}