polylib-5.22.5.orig/0000755000175000017500000000000011341243117015075 5ustar sylvestresylvestrepolylib-5.22.5.orig/Makefile.in0000644000175000017500000071377011341231333017156 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ noinst_PROGRAMS = testlib$(EXEEXT) example$(EXEEXT) count$(EXEEXT) \ @multi_noinst_programs@ $(am__empty) bin_PROGRAMS = c2p$(EXEEXT) r2p$(EXEEXT) findv$(EXEEXT) \ disjoint_union_sep$(EXEEXT) disjoint_union_adj$(EXEEXT) \ ehrhart_quick_apx$(EXEEXT) ehrhart_upper_bound$(EXEEXT) \ ehrhart_lower_bound$(EXEEXT) @multi_bin_programs@ subdir = . DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(srcdir)/config.h.in \ $(srcdir)/polylib.doxygen.in $(top_srcdir)/configure AUTHORS \ COPYING ChangeLog INSTALL NEWS compile config.guess config.sub \ depcomp install-sh ltmain.sh missing mp_get_memory_functions.c ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = config.h CONFIG_CLEAN_FILES = polylib.doxygen CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" LTLIBRARIES = $(lib_LTLIBRARIES) libpolylib128_la_DEPENDENCIES = @LTLIBOBJS@ am__objects_1 = libpolylib128_la-errors.lo \ libpolylib128_la-errormsg.lo libpolylib128_la-vector.lo \ libpolylib128_la-matrix.lo libpolylib128_la-polyhedron.lo \ libpolylib128_la-polyparam.lo libpolylib128_la-param.lo \ libpolylib128_la-alpha.lo libpolylib128_la-ehrhart.lo \ libpolylib128_la-ext_ehrhart.lo \ libpolylib128_la-eval_ehrhart.lo \ libpolylib128_la-homogenization.lo libpolylib128_la-ranking.lo \ libpolylib128_la-matrix_addon.lo \ libpolylib128_la-matrix_permutations.lo \ libpolylib128_la-compress_parms.lo \ libpolylib128_la-SolveDio.lo libpolylib128_la-Lattice.lo \ libpolylib128_la-Matop.lo libpolylib128_la-NormalForms.lo \ libpolylib128_la-Zpolyhedron.lo am__objects_2 = $(am__objects_1) am_libpolylib128_la_OBJECTS = $(am__objects_2) libpolylib128_la_OBJECTS = $(am_libpolylib128_la_OBJECTS) libpolylib128_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(libpolylib128_la_LDFLAGS) $(LDFLAGS) -o $@ libpolylib32_la_DEPENDENCIES = @LTLIBOBJS@ am__objects_3 = libpolylib32_la-errors.lo libpolylib32_la-errormsg.lo \ libpolylib32_la-vector.lo libpolylib32_la-matrix.lo \ libpolylib32_la-polyhedron.lo libpolylib32_la-polyparam.lo \ libpolylib32_la-param.lo libpolylib32_la-alpha.lo \ libpolylib32_la-ehrhart.lo libpolylib32_la-ext_ehrhart.lo \ libpolylib32_la-eval_ehrhart.lo \ libpolylib32_la-homogenization.lo libpolylib32_la-ranking.lo \ libpolylib32_la-matrix_addon.lo \ libpolylib32_la-matrix_permutations.lo \ libpolylib32_la-compress_parms.lo libpolylib32_la-SolveDio.lo \ libpolylib32_la-Lattice.lo libpolylib32_la-Matop.lo \ libpolylib32_la-NormalForms.lo libpolylib32_la-Zpolyhedron.lo am__objects_4 = $(am__objects_3) am_libpolylib32_la_OBJECTS = $(am__objects_4) libpolylib32_la_OBJECTS = $(am_libpolylib32_la_OBJECTS) libpolylib32_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(libpolylib32_la_LDFLAGS) $(LDFLAGS) -o $@ libpolylib64_la_DEPENDENCIES = @LTLIBOBJS@ am__objects_5 = libpolylib64_la-errors.lo libpolylib64_la-errormsg.lo \ libpolylib64_la-vector.lo libpolylib64_la-matrix.lo \ libpolylib64_la-polyhedron.lo libpolylib64_la-polyparam.lo \ libpolylib64_la-param.lo libpolylib64_la-alpha.lo \ libpolylib64_la-ehrhart.lo libpolylib64_la-ext_ehrhart.lo \ libpolylib64_la-eval_ehrhart.lo \ libpolylib64_la-homogenization.lo libpolylib64_la-ranking.lo \ libpolylib64_la-matrix_addon.lo \ libpolylib64_la-matrix_permutations.lo \ libpolylib64_la-compress_parms.lo libpolylib64_la-SolveDio.lo \ libpolylib64_la-Lattice.lo libpolylib64_la-Matop.lo \ libpolylib64_la-NormalForms.lo libpolylib64_la-Zpolyhedron.lo am__objects_6 = $(am__objects_5) am_libpolylib64_la_OBJECTS = $(am__objects_6) libpolylib64_la_OBJECTS = $(am_libpolylib64_la_OBJECTS) libpolylib64_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(libpolylib64_la_LDFLAGS) $(LDFLAGS) -o $@ libpolylibgmp_la_DEPENDENCIES = @LTLIBOBJS@ am__objects_7 = libpolylibgmp_la-errors.lo \ libpolylibgmp_la-errormsg.lo libpolylibgmp_la-vector.lo \ libpolylibgmp_la-matrix.lo libpolylibgmp_la-polyhedron.lo \ libpolylibgmp_la-polyparam.lo libpolylibgmp_la-param.lo \ libpolylibgmp_la-alpha.lo libpolylibgmp_la-ehrhart.lo \ libpolylibgmp_la-ext_ehrhart.lo \ libpolylibgmp_la-eval_ehrhart.lo \ libpolylibgmp_la-homogenization.lo libpolylibgmp_la-ranking.lo \ libpolylibgmp_la-matrix_addon.lo \ libpolylibgmp_la-matrix_permutations.lo \ libpolylibgmp_la-compress_parms.lo \ libpolylibgmp_la-SolveDio.lo libpolylibgmp_la-Lattice.lo \ libpolylibgmp_la-Matop.lo libpolylibgmp_la-NormalForms.lo \ libpolylibgmp_la-Zpolyhedron.lo am__objects_8 = $(am__objects_7) am_libpolylibgmp_la_OBJECTS = $(am__objects_8) libpolylibgmp_la_OBJECTS = $(am_libpolylibgmp_la_OBJECTS) libpolylibgmp_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(libpolylibgmp_la_LDFLAGS) $(LDFLAGS) -o $@ PROGRAMS = $(bin_PROGRAMS) $(noinst_PROGRAMS) am_Zpolytest32_OBJECTS = Zpolytest32-Zpolytest.$(OBJEXT) Zpolytest32_OBJECTS = $(am_Zpolytest32_OBJECTS) Zpolytest32_DEPENDENCIES = libpolylib32.la am_Zpolytest64_OBJECTS = Zpolytest64-Zpolytest.$(OBJEXT) Zpolytest64_OBJECTS = $(am_Zpolytest64_OBJECTS) Zpolytest64_DEPENDENCIES = libpolylib64.la am_Zpolytestgmp_OBJECTS = Zpolytestgmp-Zpolytest.$(OBJEXT) Zpolytestgmp_OBJECTS = $(am_Zpolytestgmp_OBJECTS) Zpolytestgmp_DEPENDENCIES = libpolylibgmp.la am_c2p_OBJECTS = c2p-c2p.$(OBJEXT) c2p_OBJECTS = $(am_c2p_OBJECTS) c2p_LDADD = $(LDADD) am_count_OBJECTS = count-count.$(OBJEXT) count_OBJECTS = $(am_count_OBJECTS) count_LDADD = $(LDADD) am_disjoint_union_adj_OBJECTS = \ disjoint_union_adj-disjoint_union_adj.$(OBJEXT) disjoint_union_adj_OBJECTS = $(am_disjoint_union_adj_OBJECTS) disjoint_union_adj_LDADD = $(LDADD) am_disjoint_union_sep_OBJECTS = \ disjoint_union_sep-disjoint_union_sep.$(OBJEXT) disjoint_union_sep_OBJECTS = $(am_disjoint_union_sep_OBJECTS) disjoint_union_sep_LDADD = $(LDADD) am_ehrhart_lower_bound_OBJECTS = \ ehrhart_lower_bound-ehrhart_lower_bound.$(OBJEXT) ehrhart_lower_bound_OBJECTS = $(am_ehrhart_lower_bound_OBJECTS) ehrhart_lower_bound_LDADD = $(LDADD) am_ehrhart_quick_apx_OBJECTS = \ ehrhart_quick_apx-ehrhart_quick_apx.$(OBJEXT) ehrhart_quick_apx_OBJECTS = $(am_ehrhart_quick_apx_OBJECTS) ehrhart_quick_apx_LDADD = $(LDADD) am_ehrhart_ranking32_OBJECTS = \ ehrhart_ranking32-ehrhart_ranking.$(OBJEXT) ehrhart_ranking32_OBJECTS = $(am_ehrhart_ranking32_OBJECTS) ehrhart_ranking32_DEPENDENCIES = libpolylib32.la am_ehrhart_ranking64_OBJECTS = \ ehrhart_ranking64-ehrhart_ranking.$(OBJEXT) ehrhart_ranking64_OBJECTS = $(am_ehrhart_ranking64_OBJECTS) ehrhart_ranking64_DEPENDENCIES = libpolylib64.la am_ehrhart_rankinggmp_OBJECTS = \ ehrhart_rankinggmp-ehrhart_ranking.$(OBJEXT) ehrhart_rankinggmp_OBJECTS = $(am_ehrhart_rankinggmp_OBJECTS) ehrhart_rankinggmp_DEPENDENCIES = libpolylibgmp.la am_ehrhart_union32_OBJECTS = ehrhart_union32-ehrhart_union.$(OBJEXT) ehrhart_union32_OBJECTS = $(am_ehrhart_union32_OBJECTS) ehrhart_union32_DEPENDENCIES = libpolylib32.la am_ehrhart_union64_OBJECTS = ehrhart_union64-ehrhart_union.$(OBJEXT) ehrhart_union64_OBJECTS = $(am_ehrhart_union64_OBJECTS) ehrhart_union64_DEPENDENCIES = libpolylib64.la am_ehrhart_uniongmp_OBJECTS = \ ehrhart_uniongmp-ehrhart_union.$(OBJEXT) ehrhart_uniongmp_OBJECTS = $(am_ehrhart_uniongmp_OBJECTS) ehrhart_uniongmp_DEPENDENCIES = libpolylibgmp.la am_ehrhart_upper_bound_OBJECTS = \ ehrhart_upper_bound-ehrhart_upper_bound.$(OBJEXT) ehrhart_upper_bound_OBJECTS = $(am_ehrhart_upper_bound_OBJECTS) ehrhart_upper_bound_LDADD = $(LDADD) am_example_OBJECTS = example-example.$(OBJEXT) example_OBJECTS = $(am_example_OBJECTS) example_LDADD = $(LDADD) am_findv_OBJECTS = findv-findv.$(OBJEXT) findv_OBJECTS = $(am_findv_OBJECTS) findv_LDADD = $(LDADD) am_polytest32_OBJECTS = polytest32-polytest.$(OBJEXT) polytest32_OBJECTS = $(am_polytest32_OBJECTS) polytest32_DEPENDENCIES = libpolylib32.la am_polytest64_OBJECTS = polytest64-polytest.$(OBJEXT) polytest64_OBJECTS = $(am_polytest64_OBJECTS) polytest64_DEPENDENCIES = libpolylib64.la am_polytestgmp_OBJECTS = polytestgmp-polytest.$(OBJEXT) polytestgmp_OBJECTS = $(am_polytestgmp_OBJECTS) polytestgmp_DEPENDENCIES = libpolylibgmp.la am_pp32_OBJECTS = pp32-pp.$(OBJEXT) pp32_OBJECTS = $(am_pp32_OBJECTS) pp32_DEPENDENCIES = libpolylib32.la am_pp64_OBJECTS = pp64-pp.$(OBJEXT) pp64_OBJECTS = $(am_pp64_OBJECTS) pp64_DEPENDENCIES = libpolylib64.la am_ppgmp_OBJECTS = ppgmp-pp.$(OBJEXT) ppgmp_OBJECTS = $(am_ppgmp_OBJECTS) ppgmp_DEPENDENCIES = libpolylibgmp.la am_r2p_OBJECTS = r2p-r2p.$(OBJEXT) r2p_OBJECTS = $(am_r2p_OBJECTS) r2p_LDADD = $(LDADD) am_testCompressParms32_OBJECTS = \ testCompressParms32-testCompressParms.$(OBJEXT) testCompressParms32_OBJECTS = $(am_testCompressParms32_OBJECTS) testCompressParms32_DEPENDENCIES = libpolylib32.la am_testCompressParms64_OBJECTS = \ testCompressParms64-testCompressParms.$(OBJEXT) testCompressParms64_OBJECTS = $(am_testCompressParms64_OBJECTS) testCompressParms64_DEPENDENCIES = libpolylib64.la am_testCompressParmsgmp_OBJECTS = \ testCompressParmsgmp-testCompressParms.$(OBJEXT) testCompressParmsgmp_OBJECTS = $(am_testCompressParmsgmp_OBJECTS) testCompressParmsgmp_DEPENDENCIES = libpolylibgmp.la am_testehrhart32_OBJECTS = testehrhart32-testehrhart.$(OBJEXT) testehrhart32_OBJECTS = $(am_testehrhart32_OBJECTS) testehrhart32_DEPENDENCIES = libpolylib32.la am_testehrhart64_OBJECTS = testehrhart64-testehrhart.$(OBJEXT) testehrhart64_OBJECTS = $(am_testehrhart64_OBJECTS) testehrhart64_DEPENDENCIES = libpolylib64.la am_testehrhartgmp_OBJECTS = testehrhartgmp-testehrhart.$(OBJEXT) testehrhartgmp_OBJECTS = $(am_testehrhartgmp_OBJECTS) testehrhartgmp_DEPENDENCIES = libpolylibgmp.la am_testlib_OBJECTS = testlib-testlib.$(OBJEXT) testlib_OBJECTS = $(am_testlib_OBJECTS) testlib_LDADD = $(LDADD) am_verif_ehrhart32_OBJECTS = verif_ehrhart32-verif_ehrhart.$(OBJEXT) verif_ehrhart32_OBJECTS = $(am_verif_ehrhart32_OBJECTS) verif_ehrhart32_DEPENDENCIES = libpolylib32.la am_verif_ehrhart64_OBJECTS = verif_ehrhart64-verif_ehrhart.$(OBJEXT) verif_ehrhart64_OBJECTS = $(am_verif_ehrhart64_OBJECTS) verif_ehrhart64_DEPENDENCIES = libpolylib64.la am_verif_ehrhartgmp_OBJECTS = \ verif_ehrhartgmp-verif_ehrhart.$(OBJEXT) verif_ehrhartgmp_OBJECTS = $(am_verif_ehrhartgmp_OBJECTS) verif_ehrhartgmp_DEPENDENCIES = libpolylibgmp.la DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \ --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \ $(LDFLAGS) -o $@ SOURCES = $(libpolylib128_la_SOURCES) $(libpolylib32_la_SOURCES) \ $(libpolylib64_la_SOURCES) $(libpolylibgmp_la_SOURCES) \ $(Zpolytest32_SOURCES) $(Zpolytest64_SOURCES) \ $(Zpolytestgmp_SOURCES) $(c2p_SOURCES) $(count_SOURCES) \ $(disjoint_union_adj_SOURCES) $(disjoint_union_sep_SOURCES) \ $(ehrhart_lower_bound_SOURCES) $(ehrhart_quick_apx_SOURCES) \ $(ehrhart_ranking32_SOURCES) $(ehrhart_ranking64_SOURCES) \ $(ehrhart_rankinggmp_SOURCES) $(ehrhart_union32_SOURCES) \ $(ehrhart_union64_SOURCES) $(ehrhart_uniongmp_SOURCES) \ $(ehrhart_upper_bound_SOURCES) $(example_SOURCES) \ $(findv_SOURCES) $(polytest32_SOURCES) $(polytest64_SOURCES) \ $(polytestgmp_SOURCES) $(pp32_SOURCES) $(pp64_SOURCES) \ $(ppgmp_SOURCES) $(r2p_SOURCES) $(testCompressParms32_SOURCES) \ $(testCompressParms64_SOURCES) $(testCompressParmsgmp_SOURCES) \ $(testehrhart32_SOURCES) $(testehrhart64_SOURCES) \ $(testehrhartgmp_SOURCES) $(testlib_SOURCES) \ $(verif_ehrhart32_SOURCES) $(verif_ehrhart64_SOURCES) \ $(verif_ehrhartgmp_SOURCES) DIST_SOURCES = $(libpolylib128_la_SOURCES) $(libpolylib32_la_SOURCES) \ $(libpolylib64_la_SOURCES) $(libpolylibgmp_la_SOURCES) \ $(Zpolytest32_SOURCES) $(Zpolytest64_SOURCES) \ $(Zpolytestgmp_SOURCES) $(c2p_SOURCES) $(count_SOURCES) \ $(disjoint_union_adj_SOURCES) $(disjoint_union_sep_SOURCES) \ $(ehrhart_lower_bound_SOURCES) $(ehrhart_quick_apx_SOURCES) \ $(ehrhart_ranking32_SOURCES) $(ehrhart_ranking64_SOURCES) \ $(ehrhart_rankinggmp_SOURCES) $(ehrhart_union32_SOURCES) \ $(ehrhart_union64_SOURCES) $(ehrhart_uniongmp_SOURCES) \ $(ehrhart_upper_bound_SOURCES) $(example_SOURCES) \ $(findv_SOURCES) $(polytest32_SOURCES) $(polytest64_SOURCES) \ $(polytestgmp_SOURCES) $(pp32_SOURCES) $(pp64_SOURCES) \ $(ppgmp_SOURCES) $(r2p_SOURCES) $(testCompressParms32_SOURCES) \ $(testCompressParms64_SOURCES) $(testCompressParmsgmp_SOURCES) \ $(testehrhart32_SOURCES) $(testehrhart64_SOURCES) \ $(testehrhartgmp_SOURCES) $(testlib_SOURCES) \ $(verif_ehrhart32_SOURCES) $(verif_ehrhart64_SOURCES) \ $(verif_ehrhartgmp_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir dist dist-all distcheck ETAGS = etags CTAGS = ctags DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ { test ! -d "$(distdir)" \ || { find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -fr "$(distdir)"; }; } am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ SUBDIRS = include Test EXTRA_CPPFLAGS = -I$(srcdir)/include -Iinclude @CPPFLAGS@ ACLOCAL_AMFLAGS = -I m4 poly_src = $(srcdir)/applications poly_arith = $(srcdir)/source/arith CFILES = \ source/arith/errors.c \ source/kernel/errormsg.c \ source/kernel/vector.c \ source/kernel/matrix.c \ source/kernel/polyhedron.c \ source/kernel/polyparam.c \ source/kernel/param.c \ source/kernel/alpha.c \ source/ehrhart/ehrhart.c \ source/ehrhart/ext_ehrhart.c \ source/ehrhart/eval_ehrhart.c \ source/ehrhart/homogenization.c \ source/ehrhart/ranking.c \ source/kernel/matrix_addon.c \ source/kernel/matrix_permutations.c \ source/kernel/compress_parms.c \ source/kernel/SolveDio.c \ source/kernel/Lattice.c \ source/kernel/Matop.c \ source/kernel/NormalForms.c \ source/kernel/Zpolyhedron.c sources = $(CFILES) \ $(poly_arith)/assert.h \ $(poly_arith)/arithmetique.h \ $(poly_arith)/arithmetic_errors.h EXTRA_DIST = doc source/oldpolytest.c INSTALL COPYING lib_LTLIBRARIES = @polylibs@ libpolylib32_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib32_la_SOURCES = $(sources) libpolylib32_la_CPPFLAGS = -DPOLYLIB_BITS=32 $(EXTRA_CPPFLAGS) libpolylib32_la_LIBADD = @LTLIBOBJS@ libpolylib64_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib64_la_SOURCES = $(sources) libpolylib64_la_CPPFLAGS = -DPOLYLIB_BITS=64 $(EXTRA_CPPFLAGS) libpolylib64_la_LIBADD = @LTLIBOBJS@ libpolylib128_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib128_la_SOURCES = $(sources) libpolylib128_la_CPPFLAGS = -DPOLYLIB_BITS=128 $(EXTRA_CPPFLAGS) libpolylib128_la_LIBADD = @LTLIBOBJS@ libpolylibgmp_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylibgmp_la_SOURCES = $(sources) libpolylibgmp_la_CPPFLAGS = -DGNUMP $(EXTRA_CPPFLAGS) libpolylibgmp_la_LIBADD = @LTLIBOBJS@ testlib_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) example_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) count_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) c2p_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) r2p_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) findv_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) disjoint_union_sep_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) disjoint_union_adj_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_quick_apx_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_lower_bound_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_upper_bound_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) EXTRA_LTLIBRARIES = libpolylib32.la libpolylib64.la libpolylib128.la \ libpolylibgmp.la # not using foreach GNU make extension no_inst_programs_32 = Zpolytest32$(EXEEXT) polytest32$(EXEEXT) verif_ehrhart32$(EXEEXT) testCompressParms32$(EXEEXT) no_inst_programs_64 = Zpolytest64$(EXEEXT) polytest64$(EXEEXT) verif_ehrhart64$(EXEEXT) testCompressParms64$(EXEEXT) no_inst_programs_gmp = Zpolytestgmp$(EXEEXT) polytestgmp$(EXEEXT) verif_ehrhartgmp$(EXEEXT) testCompressParmsgmp$(EXEEXT) multi_bin_programs_32 = ehrhart_ranking32$(EXEEXT) ehrhart_union32$(EXEEXT) pp32$(EXEEXT) testehrhart32$(EXEEXT) multi_bin_programs_64 = ehrhart_ranking64$(EXEEXT) ehrhart_union64$(EXEEXT) pp64$(EXEEXT) testehrhart64$(EXEEXT) multi_bin_programs_gmp = ehrhart_rankinggmp$(EXEEXT) ehrhart_uniongmp$(EXEEXT) ppgmp$(EXEEXT) testehrhartgmp$(EXEEXT) EXTRA_PROGRAMS = $(no_inst_programs_32) $(no_inst_programs_64) $(no_inst_programs_gmp) \ $(multi_bin_programs_32) $(multi_bin_programs_64) $(multi_bin_programs_gmp) LDADD = @polylib@ c2p_SOURCES = $(poly_src)/c2p.c c2p_DEPENDENCIES = @polylib@ r2p_SOURCES = $(poly_src)/r2p.c r2p_DEPENDENCIES = @polylib@ findv_SOURCES = $(poly_src)/findv.c findv_DEPENDENCIES = @polylib@ disjoint_union_sep_SOURCES = $(poly_src)/disjoint_union_sep.c disjoint_union_sep_DEPENDENCIES = @polylib@ disjoint_union_adj_SOURCES = $(poly_src)/disjoint_union_adj.c disjoint_union_adj_DEPENDENCIES = @polylib@ ehrhart_quick_apx_SOURCES = $(poly_src)/ehrhart_quick_apx.c ehrhart_quick_apx_DEPENDENCIES = @polylib@ ehrhart_upper_bound_SOURCES = $(poly_src)/ehrhart_upper_bound.c ehrhart_upper_bound_DEPENDENCIES = @polylib@ ehrhart_lower_bound_SOURCES = $(poly_src)/ehrhart_lower_bound.c ehrhart_lower_bound_DEPENDENCIES = @polylib@ testlib_SOURCES = $(poly_src)/testlib.c testlib_DEPENDENCIES = @polylib@ example_SOURCES = $(poly_src)/example.c example_DEPENDENCIES = @polylib@ count_SOURCES = source/count.c count_DEPENDENCIES = @polylib@ Zpolytest32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) Zpolytest32_SOURCES = $(poly_src)/Zpolytest.c Zpolytest32_LDADD = libpolylib32.la Zpolytest64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) Zpolytest64_SOURCES = $(poly_src)/Zpolytest.c Zpolytest64_LDADD = libpolylib64.la Zpolytestgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) Zpolytestgmp_SOURCES = $(poly_src)/Zpolytest.c Zpolytestgmp_LDADD = libpolylibgmp.la ehrhart_ranking32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) ehrhart_ranking32_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_ranking32_LDADD = libpolylib32.la ehrhart_ranking64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) ehrhart_ranking64_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_ranking64_LDADD = libpolylib64.la ehrhart_rankinggmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ehrhart_rankinggmp_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_rankinggmp_LDADD = libpolylibgmp.la ehrhart_union32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) ehrhart_union32_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_union32_LDADD = libpolylib32.la ehrhart_union64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) ehrhart_union64_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_union64_LDADD = libpolylib64.la ehrhart_uniongmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ehrhart_uniongmp_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_uniongmp_LDADD = libpolylibgmp.la polytest32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) polytest32_SOURCES = $(poly_src)/polytest.c polytest32_LDADD = libpolylib32.la polytest64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) polytest64_SOURCES = $(poly_src)/polytest.c polytest64_LDADD = libpolylib64.la polytestgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) polytestgmp_SOURCES = $(poly_src)/polytest.c polytestgmp_LDADD = libpolylibgmp.la pp32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) pp32_SOURCES = $(poly_src)/pp.c pp32_LDADD = libpolylib32.la pp64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) pp64_SOURCES = $(poly_src)/pp.c pp64_LDADD = libpolylib64.la ppgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ppgmp_SOURCES = $(poly_src)/pp.c ppgmp_LDADD = libpolylibgmp.la testehrhart32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) testehrhart32_SOURCES = $(poly_src)/testehrhart.c testehrhart32_LDADD = libpolylib32.la testehrhart64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) testehrhart64_SOURCES = $(poly_src)/testehrhart.c testehrhart64_LDADD = libpolylib64.la testehrhartgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) testehrhartgmp_SOURCES = $(poly_src)/testehrhart.c testehrhartgmp_LDADD = libpolylibgmp.la testCompressParms32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) testCompressParms32_SOURCES = $(poly_src)/testCompressParms.c testCompressParms32_LDADD = libpolylib32.la testCompressParms64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) testCompressParms64_SOURCES = $(poly_src)/testCompressParms.c testCompressParms64_LDADD = libpolylib64.la testCompressParmsgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) testCompressParmsgmp_SOURCES = $(poly_src)/testCompressParms.c testCompressParmsgmp_LDADD = libpolylibgmp.la verif_ehrhart32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) verif_ehrhart32_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhart32_LDADD = libpolylib32.la verif_ehrhart64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) verif_ehrhart64_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhart64_LDADD = libpolylib64.la verif_ehrhartgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) verif_ehrhartgmp_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhartgmp_LDADD = libpolylibgmp.la all: config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive .SUFFIXES: .SUFFIXES: .c .lo .o .obj am--refresh: @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): config.h: stamp-h1 @if test ! -f $@; then \ rm -f stamp-h1; \ $(MAKE) $(AM_MAKEFLAGS) stamp-h1; \ else :; fi stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status config.h $(srcdir)/config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f stamp-h1 touch $@ distclean-hdr: -rm -f config.h stamp-h1 polylib.doxygen: $(top_builddir)/config.status $(srcdir)/polylib.doxygen.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done libpolylib128.la: $(libpolylib128_la_OBJECTS) $(libpolylib128_la_DEPENDENCIES) $(libpolylib128_la_LINK) $(libpolylib128_la_OBJECTS) $(libpolylib128_la_LIBADD) $(LIBS) libpolylib32.la: $(libpolylib32_la_OBJECTS) $(libpolylib32_la_DEPENDENCIES) $(libpolylib32_la_LINK) $(libpolylib32_la_OBJECTS) $(libpolylib32_la_LIBADD) $(LIBS) libpolylib64.la: $(libpolylib64_la_OBJECTS) $(libpolylib64_la_DEPENDENCIES) $(libpolylib64_la_LINK) $(libpolylib64_la_OBJECTS) $(libpolylib64_la_LIBADD) $(LIBS) libpolylibgmp.la: $(libpolylibgmp_la_OBJECTS) $(libpolylibgmp_la_DEPENDENCIES) $(libpolylibgmp_la_LINK) $(libpolylibgmp_la_OBJECTS) $(libpolylibgmp_la_LIBADD) $(LIBS) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)" @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ for p in $$list; do echo "$$p $$p"; done | \ sed 's/$(EXEEXT)$$//' | \ while read p p1; do if test -f $$p || test -f $$p1; \ then echo "$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n;h' -e 's|.*|.|' \ -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \ sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) files[d] = files[d] " " $$1; \ else { print "f", $$3 "/" $$4, $$1; } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \ -e 's/$$/$(EXEEXT)/' `; \ test -n "$$list" || exit 0; \ echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(bindir)" && rm -f $$files clean-binPROGRAMS: @list='$(bin_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list clean-noinstPROGRAMS: @list='$(noinst_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list Zpolytest32$(EXEEXT): $(Zpolytest32_OBJECTS) $(Zpolytest32_DEPENDENCIES) @rm -f Zpolytest32$(EXEEXT) $(LINK) $(Zpolytest32_OBJECTS) $(Zpolytest32_LDADD) $(LIBS) Zpolytest64$(EXEEXT): $(Zpolytest64_OBJECTS) $(Zpolytest64_DEPENDENCIES) @rm -f Zpolytest64$(EXEEXT) $(LINK) $(Zpolytest64_OBJECTS) $(Zpolytest64_LDADD) $(LIBS) Zpolytestgmp$(EXEEXT): $(Zpolytestgmp_OBJECTS) $(Zpolytestgmp_DEPENDENCIES) @rm -f Zpolytestgmp$(EXEEXT) $(LINK) $(Zpolytestgmp_OBJECTS) $(Zpolytestgmp_LDADD) $(LIBS) c2p$(EXEEXT): $(c2p_OBJECTS) $(c2p_DEPENDENCIES) @rm -f c2p$(EXEEXT) $(LINK) $(c2p_OBJECTS) $(c2p_LDADD) $(LIBS) count$(EXEEXT): $(count_OBJECTS) $(count_DEPENDENCIES) @rm -f count$(EXEEXT) $(LINK) $(count_OBJECTS) $(count_LDADD) $(LIBS) disjoint_union_adj$(EXEEXT): $(disjoint_union_adj_OBJECTS) $(disjoint_union_adj_DEPENDENCIES) @rm -f disjoint_union_adj$(EXEEXT) $(LINK) $(disjoint_union_adj_OBJECTS) $(disjoint_union_adj_LDADD) $(LIBS) disjoint_union_sep$(EXEEXT): $(disjoint_union_sep_OBJECTS) $(disjoint_union_sep_DEPENDENCIES) @rm -f disjoint_union_sep$(EXEEXT) $(LINK) $(disjoint_union_sep_OBJECTS) $(disjoint_union_sep_LDADD) $(LIBS) ehrhart_lower_bound$(EXEEXT): $(ehrhart_lower_bound_OBJECTS) $(ehrhart_lower_bound_DEPENDENCIES) @rm -f ehrhart_lower_bound$(EXEEXT) $(LINK) $(ehrhart_lower_bound_OBJECTS) $(ehrhart_lower_bound_LDADD) $(LIBS) ehrhart_quick_apx$(EXEEXT): $(ehrhart_quick_apx_OBJECTS) $(ehrhart_quick_apx_DEPENDENCIES) @rm -f ehrhart_quick_apx$(EXEEXT) $(LINK) $(ehrhart_quick_apx_OBJECTS) $(ehrhart_quick_apx_LDADD) $(LIBS) ehrhart_ranking32$(EXEEXT): $(ehrhart_ranking32_OBJECTS) $(ehrhart_ranking32_DEPENDENCIES) @rm -f ehrhart_ranking32$(EXEEXT) $(LINK) $(ehrhart_ranking32_OBJECTS) $(ehrhart_ranking32_LDADD) $(LIBS) ehrhart_ranking64$(EXEEXT): $(ehrhart_ranking64_OBJECTS) $(ehrhart_ranking64_DEPENDENCIES) @rm -f ehrhart_ranking64$(EXEEXT) $(LINK) $(ehrhart_ranking64_OBJECTS) $(ehrhart_ranking64_LDADD) $(LIBS) ehrhart_rankinggmp$(EXEEXT): $(ehrhart_rankinggmp_OBJECTS) $(ehrhart_rankinggmp_DEPENDENCIES) @rm -f ehrhart_rankinggmp$(EXEEXT) $(LINK) $(ehrhart_rankinggmp_OBJECTS) $(ehrhart_rankinggmp_LDADD) $(LIBS) ehrhart_union32$(EXEEXT): $(ehrhart_union32_OBJECTS) $(ehrhart_union32_DEPENDENCIES) @rm -f ehrhart_union32$(EXEEXT) $(LINK) $(ehrhart_union32_OBJECTS) $(ehrhart_union32_LDADD) $(LIBS) ehrhart_union64$(EXEEXT): $(ehrhart_union64_OBJECTS) $(ehrhart_union64_DEPENDENCIES) @rm -f ehrhart_union64$(EXEEXT) $(LINK) $(ehrhart_union64_OBJECTS) $(ehrhart_union64_LDADD) $(LIBS) ehrhart_uniongmp$(EXEEXT): $(ehrhart_uniongmp_OBJECTS) $(ehrhart_uniongmp_DEPENDENCIES) @rm -f ehrhart_uniongmp$(EXEEXT) $(LINK) $(ehrhart_uniongmp_OBJECTS) $(ehrhart_uniongmp_LDADD) $(LIBS) ehrhart_upper_bound$(EXEEXT): $(ehrhart_upper_bound_OBJECTS) $(ehrhart_upper_bound_DEPENDENCIES) @rm -f ehrhart_upper_bound$(EXEEXT) $(LINK) $(ehrhart_upper_bound_OBJECTS) $(ehrhart_upper_bound_LDADD) $(LIBS) example$(EXEEXT): $(example_OBJECTS) $(example_DEPENDENCIES) @rm -f example$(EXEEXT) $(LINK) $(example_OBJECTS) $(example_LDADD) $(LIBS) findv$(EXEEXT): $(findv_OBJECTS) $(findv_DEPENDENCIES) @rm -f findv$(EXEEXT) $(LINK) $(findv_OBJECTS) $(findv_LDADD) $(LIBS) polytest32$(EXEEXT): $(polytest32_OBJECTS) $(polytest32_DEPENDENCIES) @rm -f polytest32$(EXEEXT) $(LINK) $(polytest32_OBJECTS) $(polytest32_LDADD) $(LIBS) polytest64$(EXEEXT): $(polytest64_OBJECTS) $(polytest64_DEPENDENCIES) @rm -f polytest64$(EXEEXT) $(LINK) $(polytest64_OBJECTS) $(polytest64_LDADD) $(LIBS) polytestgmp$(EXEEXT): $(polytestgmp_OBJECTS) $(polytestgmp_DEPENDENCIES) @rm -f polytestgmp$(EXEEXT) $(LINK) $(polytestgmp_OBJECTS) $(polytestgmp_LDADD) $(LIBS) pp32$(EXEEXT): $(pp32_OBJECTS) $(pp32_DEPENDENCIES) @rm -f pp32$(EXEEXT) $(LINK) $(pp32_OBJECTS) $(pp32_LDADD) $(LIBS) pp64$(EXEEXT): $(pp64_OBJECTS) $(pp64_DEPENDENCIES) @rm -f pp64$(EXEEXT) $(LINK) $(pp64_OBJECTS) $(pp64_LDADD) $(LIBS) ppgmp$(EXEEXT): $(ppgmp_OBJECTS) $(ppgmp_DEPENDENCIES) @rm -f ppgmp$(EXEEXT) $(LINK) $(ppgmp_OBJECTS) $(ppgmp_LDADD) $(LIBS) r2p$(EXEEXT): $(r2p_OBJECTS) $(r2p_DEPENDENCIES) @rm -f r2p$(EXEEXT) $(LINK) $(r2p_OBJECTS) $(r2p_LDADD) $(LIBS) testCompressParms32$(EXEEXT): $(testCompressParms32_OBJECTS) $(testCompressParms32_DEPENDENCIES) @rm -f testCompressParms32$(EXEEXT) $(LINK) $(testCompressParms32_OBJECTS) $(testCompressParms32_LDADD) $(LIBS) testCompressParms64$(EXEEXT): $(testCompressParms64_OBJECTS) $(testCompressParms64_DEPENDENCIES) @rm -f testCompressParms64$(EXEEXT) $(LINK) $(testCompressParms64_OBJECTS) $(testCompressParms64_LDADD) $(LIBS) testCompressParmsgmp$(EXEEXT): $(testCompressParmsgmp_OBJECTS) $(testCompressParmsgmp_DEPENDENCIES) @rm -f testCompressParmsgmp$(EXEEXT) $(LINK) $(testCompressParmsgmp_OBJECTS) $(testCompressParmsgmp_LDADD) $(LIBS) testehrhart32$(EXEEXT): $(testehrhart32_OBJECTS) $(testehrhart32_DEPENDENCIES) @rm -f testehrhart32$(EXEEXT) $(LINK) $(testehrhart32_OBJECTS) $(testehrhart32_LDADD) $(LIBS) testehrhart64$(EXEEXT): $(testehrhart64_OBJECTS) $(testehrhart64_DEPENDENCIES) @rm -f testehrhart64$(EXEEXT) $(LINK) $(testehrhart64_OBJECTS) $(testehrhart64_LDADD) $(LIBS) testehrhartgmp$(EXEEXT): $(testehrhartgmp_OBJECTS) $(testehrhartgmp_DEPENDENCIES) @rm -f testehrhartgmp$(EXEEXT) $(LINK) $(testehrhartgmp_OBJECTS) $(testehrhartgmp_LDADD) $(LIBS) testlib$(EXEEXT): $(testlib_OBJECTS) $(testlib_DEPENDENCIES) @rm -f testlib$(EXEEXT) $(LINK) $(testlib_OBJECTS) $(testlib_LDADD) $(LIBS) verif_ehrhart32$(EXEEXT): $(verif_ehrhart32_OBJECTS) $(verif_ehrhart32_DEPENDENCIES) @rm -f verif_ehrhart32$(EXEEXT) $(LINK) $(verif_ehrhart32_OBJECTS) $(verif_ehrhart32_LDADD) $(LIBS) verif_ehrhart64$(EXEEXT): $(verif_ehrhart64_OBJECTS) $(verif_ehrhart64_DEPENDENCIES) @rm -f verif_ehrhart64$(EXEEXT) $(LINK) $(verif_ehrhart64_OBJECTS) $(verif_ehrhart64_LDADD) $(LIBS) verif_ehrhartgmp$(EXEEXT): $(verif_ehrhartgmp_OBJECTS) $(verif_ehrhartgmp_DEPENDENCIES) @rm -f verif_ehrhartgmp$(EXEEXT) $(LINK) $(verif_ehrhartgmp_OBJECTS) $(verif_ehrhartgmp_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/mp_get_memory_functions.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/Zpolytest32-Zpolytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/Zpolytest64-Zpolytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/Zpolytestgmp-Zpolytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/c2p-c2p.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/count-count.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_union32-ehrhart_union.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_union64-ehrhart_union.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/example-example.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/findv-findv.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-Lattice.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-Matop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-NormalForms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-SolveDio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-Zpolyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-alpha.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-compress_parms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-errormsg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-errors.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-eval_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-ext_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-homogenization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-matrix_addon.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-matrix_permutations.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-param.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-polyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-polyparam.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-ranking.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib128_la-vector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-Lattice.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-Matop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-NormalForms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-SolveDio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-Zpolyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-alpha.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-compress_parms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-errormsg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-errors.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-eval_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-ext_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-homogenization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-matrix_addon.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-matrix_permutations.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-param.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-polyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-polyparam.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-ranking.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib32_la-vector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-Lattice.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-Matop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-NormalForms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-SolveDio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-Zpolyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-alpha.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-compress_parms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-errormsg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-errors.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-eval_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-ext_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-homogenization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-matrix_addon.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-matrix_permutations.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-param.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-polyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-polyparam.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-ranking.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylib64_la-vector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-Lattice.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-Matop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-NormalForms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-SolveDio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-Zpolyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-alpha.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-compress_parms.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-errormsg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-errors.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-eval_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-ext_ehrhart.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-homogenization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-matrix_addon.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-matrix_permutations.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-param.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-polyhedron.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-polyparam.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-ranking.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libpolylibgmp_la-vector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polytest32-polytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polytest64-polytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/polytestgmp-polytest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pp32-pp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/pp64-pp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ppgmp-pp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/r2p-r2p.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testCompressParms32-testCompressParms.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testCompressParms64-testCompressParms.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testCompressParmsgmp-testCompressParms.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testehrhart32-testehrhart.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testehrhart64-testehrhart.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testehrhartgmp-testehrhart.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/testlib-testlib.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/verif_ehrhart32-verif_ehrhart.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/verif_ehrhart64-verif_ehrhart.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LTCOMPILE) -c -o $@ $< libpolylib128_la-errors.lo: source/arith/errors.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-errors.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-errors.Tpo -c -o libpolylib128_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-errors.Tpo $(DEPDIR)/libpolylib128_la-errors.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/arith/errors.c' object='libpolylib128_la-errors.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c libpolylib128_la-errormsg.lo: source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-errormsg.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-errormsg.Tpo -c -o libpolylib128_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-errormsg.Tpo $(DEPDIR)/libpolylib128_la-errormsg.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/errormsg.c' object='libpolylib128_la-errormsg.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c libpolylib128_la-vector.lo: source/kernel/vector.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-vector.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-vector.Tpo -c -o libpolylib128_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-vector.Tpo $(DEPDIR)/libpolylib128_la-vector.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/vector.c' object='libpolylib128_la-vector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c libpolylib128_la-matrix.lo: source/kernel/matrix.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-matrix.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-matrix.Tpo -c -o libpolylib128_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-matrix.Tpo $(DEPDIR)/libpolylib128_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix.c' object='libpolylib128_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c libpolylib128_la-polyhedron.lo: source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-polyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-polyhedron.Tpo -c -o libpolylib128_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-polyhedron.Tpo $(DEPDIR)/libpolylib128_la-polyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyhedron.c' object='libpolylib128_la-polyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c libpolylib128_la-polyparam.lo: source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-polyparam.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-polyparam.Tpo -c -o libpolylib128_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-polyparam.Tpo $(DEPDIR)/libpolylib128_la-polyparam.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyparam.c' object='libpolylib128_la-polyparam.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c libpolylib128_la-param.lo: source/kernel/param.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-param.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-param.Tpo -c -o libpolylib128_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-param.Tpo $(DEPDIR)/libpolylib128_la-param.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/param.c' object='libpolylib128_la-param.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c libpolylib128_la-alpha.lo: source/kernel/alpha.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-alpha.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-alpha.Tpo -c -o libpolylib128_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-alpha.Tpo $(DEPDIR)/libpolylib128_la-alpha.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/alpha.c' object='libpolylib128_la-alpha.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c libpolylib128_la-ehrhart.lo: source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-ehrhart.Tpo -c -o libpolylib128_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-ehrhart.Tpo $(DEPDIR)/libpolylib128_la-ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ehrhart.c' object='libpolylib128_la-ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c libpolylib128_la-ext_ehrhart.lo: source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-ext_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-ext_ehrhart.Tpo -c -o libpolylib128_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-ext_ehrhart.Tpo $(DEPDIR)/libpolylib128_la-ext_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ext_ehrhart.c' object='libpolylib128_la-ext_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c libpolylib128_la-eval_ehrhart.lo: source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-eval_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-eval_ehrhart.Tpo -c -o libpolylib128_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-eval_ehrhart.Tpo $(DEPDIR)/libpolylib128_la-eval_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/eval_ehrhart.c' object='libpolylib128_la-eval_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c libpolylib128_la-homogenization.lo: source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-homogenization.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-homogenization.Tpo -c -o libpolylib128_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-homogenization.Tpo $(DEPDIR)/libpolylib128_la-homogenization.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/homogenization.c' object='libpolylib128_la-homogenization.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c libpolylib128_la-ranking.lo: source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-ranking.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-ranking.Tpo -c -o libpolylib128_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-ranking.Tpo $(DEPDIR)/libpolylib128_la-ranking.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ranking.c' object='libpolylib128_la-ranking.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c libpolylib128_la-matrix_addon.lo: source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-matrix_addon.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-matrix_addon.Tpo -c -o libpolylib128_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-matrix_addon.Tpo $(DEPDIR)/libpolylib128_la-matrix_addon.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_addon.c' object='libpolylib128_la-matrix_addon.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c libpolylib128_la-matrix_permutations.lo: source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-matrix_permutations.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-matrix_permutations.Tpo -c -o libpolylib128_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-matrix_permutations.Tpo $(DEPDIR)/libpolylib128_la-matrix_permutations.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_permutations.c' object='libpolylib128_la-matrix_permutations.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c libpolylib128_la-compress_parms.lo: source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-compress_parms.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-compress_parms.Tpo -c -o libpolylib128_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-compress_parms.Tpo $(DEPDIR)/libpolylib128_la-compress_parms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/compress_parms.c' object='libpolylib128_la-compress_parms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c libpolylib128_la-SolveDio.lo: source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-SolveDio.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-SolveDio.Tpo -c -o libpolylib128_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-SolveDio.Tpo $(DEPDIR)/libpolylib128_la-SolveDio.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/SolveDio.c' object='libpolylib128_la-SolveDio.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c libpolylib128_la-Lattice.lo: source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-Lattice.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-Lattice.Tpo -c -o libpolylib128_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-Lattice.Tpo $(DEPDIR)/libpolylib128_la-Lattice.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Lattice.c' object='libpolylib128_la-Lattice.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c libpolylib128_la-Matop.lo: source/kernel/Matop.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-Matop.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-Matop.Tpo -c -o libpolylib128_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-Matop.Tpo $(DEPDIR)/libpolylib128_la-Matop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Matop.c' object='libpolylib128_la-Matop.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c libpolylib128_la-NormalForms.lo: source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-NormalForms.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-NormalForms.Tpo -c -o libpolylib128_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-NormalForms.Tpo $(DEPDIR)/libpolylib128_la-NormalForms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/NormalForms.c' object='libpolylib128_la-NormalForms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c libpolylib128_la-Zpolyhedron.lo: source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib128_la-Zpolyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib128_la-Zpolyhedron.Tpo -c -o libpolylib128_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib128_la-Zpolyhedron.Tpo $(DEPDIR)/libpolylib128_la-Zpolyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Zpolyhedron.c' object='libpolylib128_la-Zpolyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib128_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib128_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c libpolylib32_la-errors.lo: source/arith/errors.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-errors.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-errors.Tpo -c -o libpolylib32_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-errors.Tpo $(DEPDIR)/libpolylib32_la-errors.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/arith/errors.c' object='libpolylib32_la-errors.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c libpolylib32_la-errormsg.lo: source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-errormsg.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-errormsg.Tpo -c -o libpolylib32_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-errormsg.Tpo $(DEPDIR)/libpolylib32_la-errormsg.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/errormsg.c' object='libpolylib32_la-errormsg.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c libpolylib32_la-vector.lo: source/kernel/vector.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-vector.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-vector.Tpo -c -o libpolylib32_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-vector.Tpo $(DEPDIR)/libpolylib32_la-vector.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/vector.c' object='libpolylib32_la-vector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c libpolylib32_la-matrix.lo: source/kernel/matrix.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-matrix.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-matrix.Tpo -c -o libpolylib32_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-matrix.Tpo $(DEPDIR)/libpolylib32_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix.c' object='libpolylib32_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c libpolylib32_la-polyhedron.lo: source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-polyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-polyhedron.Tpo -c -o libpolylib32_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-polyhedron.Tpo $(DEPDIR)/libpolylib32_la-polyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyhedron.c' object='libpolylib32_la-polyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c libpolylib32_la-polyparam.lo: source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-polyparam.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-polyparam.Tpo -c -o libpolylib32_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-polyparam.Tpo $(DEPDIR)/libpolylib32_la-polyparam.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyparam.c' object='libpolylib32_la-polyparam.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c libpolylib32_la-param.lo: source/kernel/param.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-param.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-param.Tpo -c -o libpolylib32_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-param.Tpo $(DEPDIR)/libpolylib32_la-param.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/param.c' object='libpolylib32_la-param.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c libpolylib32_la-alpha.lo: source/kernel/alpha.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-alpha.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-alpha.Tpo -c -o libpolylib32_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-alpha.Tpo $(DEPDIR)/libpolylib32_la-alpha.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/alpha.c' object='libpolylib32_la-alpha.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c libpolylib32_la-ehrhart.lo: source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-ehrhart.Tpo -c -o libpolylib32_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-ehrhart.Tpo $(DEPDIR)/libpolylib32_la-ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ehrhart.c' object='libpolylib32_la-ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c libpolylib32_la-ext_ehrhart.lo: source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-ext_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-ext_ehrhart.Tpo -c -o libpolylib32_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-ext_ehrhart.Tpo $(DEPDIR)/libpolylib32_la-ext_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ext_ehrhart.c' object='libpolylib32_la-ext_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c libpolylib32_la-eval_ehrhart.lo: source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-eval_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-eval_ehrhart.Tpo -c -o libpolylib32_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-eval_ehrhart.Tpo $(DEPDIR)/libpolylib32_la-eval_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/eval_ehrhart.c' object='libpolylib32_la-eval_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c libpolylib32_la-homogenization.lo: source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-homogenization.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-homogenization.Tpo -c -o libpolylib32_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-homogenization.Tpo $(DEPDIR)/libpolylib32_la-homogenization.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/homogenization.c' object='libpolylib32_la-homogenization.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c libpolylib32_la-ranking.lo: source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-ranking.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-ranking.Tpo -c -o libpolylib32_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-ranking.Tpo $(DEPDIR)/libpolylib32_la-ranking.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ranking.c' object='libpolylib32_la-ranking.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c libpolylib32_la-matrix_addon.lo: source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-matrix_addon.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-matrix_addon.Tpo -c -o libpolylib32_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-matrix_addon.Tpo $(DEPDIR)/libpolylib32_la-matrix_addon.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_addon.c' object='libpolylib32_la-matrix_addon.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c libpolylib32_la-matrix_permutations.lo: source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-matrix_permutations.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-matrix_permutations.Tpo -c -o libpolylib32_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-matrix_permutations.Tpo $(DEPDIR)/libpolylib32_la-matrix_permutations.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_permutations.c' object='libpolylib32_la-matrix_permutations.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c libpolylib32_la-compress_parms.lo: source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-compress_parms.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-compress_parms.Tpo -c -o libpolylib32_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-compress_parms.Tpo $(DEPDIR)/libpolylib32_la-compress_parms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/compress_parms.c' object='libpolylib32_la-compress_parms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c libpolylib32_la-SolveDio.lo: source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-SolveDio.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-SolveDio.Tpo -c -o libpolylib32_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-SolveDio.Tpo $(DEPDIR)/libpolylib32_la-SolveDio.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/SolveDio.c' object='libpolylib32_la-SolveDio.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c libpolylib32_la-Lattice.lo: source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-Lattice.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-Lattice.Tpo -c -o libpolylib32_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-Lattice.Tpo $(DEPDIR)/libpolylib32_la-Lattice.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Lattice.c' object='libpolylib32_la-Lattice.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c libpolylib32_la-Matop.lo: source/kernel/Matop.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-Matop.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-Matop.Tpo -c -o libpolylib32_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-Matop.Tpo $(DEPDIR)/libpolylib32_la-Matop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Matop.c' object='libpolylib32_la-Matop.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c libpolylib32_la-NormalForms.lo: source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-NormalForms.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-NormalForms.Tpo -c -o libpolylib32_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-NormalForms.Tpo $(DEPDIR)/libpolylib32_la-NormalForms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/NormalForms.c' object='libpolylib32_la-NormalForms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c libpolylib32_la-Zpolyhedron.lo: source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib32_la-Zpolyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib32_la-Zpolyhedron.Tpo -c -o libpolylib32_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib32_la-Zpolyhedron.Tpo $(DEPDIR)/libpolylib32_la-Zpolyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Zpolyhedron.c' object='libpolylib32_la-Zpolyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib32_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib32_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c libpolylib64_la-errors.lo: source/arith/errors.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-errors.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-errors.Tpo -c -o libpolylib64_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-errors.Tpo $(DEPDIR)/libpolylib64_la-errors.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/arith/errors.c' object='libpolylib64_la-errors.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c libpolylib64_la-errormsg.lo: source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-errormsg.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-errormsg.Tpo -c -o libpolylib64_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-errormsg.Tpo $(DEPDIR)/libpolylib64_la-errormsg.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/errormsg.c' object='libpolylib64_la-errormsg.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c libpolylib64_la-vector.lo: source/kernel/vector.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-vector.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-vector.Tpo -c -o libpolylib64_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-vector.Tpo $(DEPDIR)/libpolylib64_la-vector.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/vector.c' object='libpolylib64_la-vector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c libpolylib64_la-matrix.lo: source/kernel/matrix.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-matrix.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-matrix.Tpo -c -o libpolylib64_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-matrix.Tpo $(DEPDIR)/libpolylib64_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix.c' object='libpolylib64_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c libpolylib64_la-polyhedron.lo: source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-polyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-polyhedron.Tpo -c -o libpolylib64_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-polyhedron.Tpo $(DEPDIR)/libpolylib64_la-polyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyhedron.c' object='libpolylib64_la-polyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c libpolylib64_la-polyparam.lo: source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-polyparam.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-polyparam.Tpo -c -o libpolylib64_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-polyparam.Tpo $(DEPDIR)/libpolylib64_la-polyparam.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyparam.c' object='libpolylib64_la-polyparam.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c libpolylib64_la-param.lo: source/kernel/param.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-param.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-param.Tpo -c -o libpolylib64_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-param.Tpo $(DEPDIR)/libpolylib64_la-param.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/param.c' object='libpolylib64_la-param.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c libpolylib64_la-alpha.lo: source/kernel/alpha.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-alpha.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-alpha.Tpo -c -o libpolylib64_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-alpha.Tpo $(DEPDIR)/libpolylib64_la-alpha.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/alpha.c' object='libpolylib64_la-alpha.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c libpolylib64_la-ehrhart.lo: source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-ehrhart.Tpo -c -o libpolylib64_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-ehrhart.Tpo $(DEPDIR)/libpolylib64_la-ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ehrhart.c' object='libpolylib64_la-ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c libpolylib64_la-ext_ehrhart.lo: source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-ext_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-ext_ehrhart.Tpo -c -o libpolylib64_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-ext_ehrhart.Tpo $(DEPDIR)/libpolylib64_la-ext_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ext_ehrhart.c' object='libpolylib64_la-ext_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c libpolylib64_la-eval_ehrhart.lo: source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-eval_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-eval_ehrhart.Tpo -c -o libpolylib64_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-eval_ehrhart.Tpo $(DEPDIR)/libpolylib64_la-eval_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/eval_ehrhart.c' object='libpolylib64_la-eval_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c libpolylib64_la-homogenization.lo: source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-homogenization.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-homogenization.Tpo -c -o libpolylib64_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-homogenization.Tpo $(DEPDIR)/libpolylib64_la-homogenization.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/homogenization.c' object='libpolylib64_la-homogenization.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c libpolylib64_la-ranking.lo: source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-ranking.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-ranking.Tpo -c -o libpolylib64_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-ranking.Tpo $(DEPDIR)/libpolylib64_la-ranking.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ranking.c' object='libpolylib64_la-ranking.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c libpolylib64_la-matrix_addon.lo: source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-matrix_addon.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-matrix_addon.Tpo -c -o libpolylib64_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-matrix_addon.Tpo $(DEPDIR)/libpolylib64_la-matrix_addon.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_addon.c' object='libpolylib64_la-matrix_addon.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c libpolylib64_la-matrix_permutations.lo: source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-matrix_permutations.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-matrix_permutations.Tpo -c -o libpolylib64_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-matrix_permutations.Tpo $(DEPDIR)/libpolylib64_la-matrix_permutations.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_permutations.c' object='libpolylib64_la-matrix_permutations.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c libpolylib64_la-compress_parms.lo: source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-compress_parms.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-compress_parms.Tpo -c -o libpolylib64_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-compress_parms.Tpo $(DEPDIR)/libpolylib64_la-compress_parms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/compress_parms.c' object='libpolylib64_la-compress_parms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c libpolylib64_la-SolveDio.lo: source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-SolveDio.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-SolveDio.Tpo -c -o libpolylib64_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-SolveDio.Tpo $(DEPDIR)/libpolylib64_la-SolveDio.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/SolveDio.c' object='libpolylib64_la-SolveDio.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c libpolylib64_la-Lattice.lo: source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-Lattice.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-Lattice.Tpo -c -o libpolylib64_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-Lattice.Tpo $(DEPDIR)/libpolylib64_la-Lattice.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Lattice.c' object='libpolylib64_la-Lattice.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c libpolylib64_la-Matop.lo: source/kernel/Matop.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-Matop.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-Matop.Tpo -c -o libpolylib64_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-Matop.Tpo $(DEPDIR)/libpolylib64_la-Matop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Matop.c' object='libpolylib64_la-Matop.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c libpolylib64_la-NormalForms.lo: source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-NormalForms.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-NormalForms.Tpo -c -o libpolylib64_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-NormalForms.Tpo $(DEPDIR)/libpolylib64_la-NormalForms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/NormalForms.c' object='libpolylib64_la-NormalForms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c libpolylib64_la-Zpolyhedron.lo: source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylib64_la-Zpolyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylib64_la-Zpolyhedron.Tpo -c -o libpolylib64_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylib64_la-Zpolyhedron.Tpo $(DEPDIR)/libpolylib64_la-Zpolyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Zpolyhedron.c' object='libpolylib64_la-Zpolyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylib64_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylib64_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c libpolylibgmp_la-errors.lo: source/arith/errors.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-errors.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-errors.Tpo -c -o libpolylibgmp_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-errors.Tpo $(DEPDIR)/libpolylibgmp_la-errors.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/arith/errors.c' object='libpolylibgmp_la-errors.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-errors.lo `test -f 'source/arith/errors.c' || echo '$(srcdir)/'`source/arith/errors.c libpolylibgmp_la-errormsg.lo: source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-errormsg.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-errormsg.Tpo -c -o libpolylibgmp_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-errormsg.Tpo $(DEPDIR)/libpolylibgmp_la-errormsg.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/errormsg.c' object='libpolylibgmp_la-errormsg.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-errormsg.lo `test -f 'source/kernel/errormsg.c' || echo '$(srcdir)/'`source/kernel/errormsg.c libpolylibgmp_la-vector.lo: source/kernel/vector.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-vector.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-vector.Tpo -c -o libpolylibgmp_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-vector.Tpo $(DEPDIR)/libpolylibgmp_la-vector.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/vector.c' object='libpolylibgmp_la-vector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-vector.lo `test -f 'source/kernel/vector.c' || echo '$(srcdir)/'`source/kernel/vector.c libpolylibgmp_la-matrix.lo: source/kernel/matrix.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-matrix.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-matrix.Tpo -c -o libpolylibgmp_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-matrix.Tpo $(DEPDIR)/libpolylibgmp_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix.c' object='libpolylibgmp_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-matrix.lo `test -f 'source/kernel/matrix.c' || echo '$(srcdir)/'`source/kernel/matrix.c libpolylibgmp_la-polyhedron.lo: source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-polyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-polyhedron.Tpo -c -o libpolylibgmp_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-polyhedron.Tpo $(DEPDIR)/libpolylibgmp_la-polyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyhedron.c' object='libpolylibgmp_la-polyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-polyhedron.lo `test -f 'source/kernel/polyhedron.c' || echo '$(srcdir)/'`source/kernel/polyhedron.c libpolylibgmp_la-polyparam.lo: source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-polyparam.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-polyparam.Tpo -c -o libpolylibgmp_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-polyparam.Tpo $(DEPDIR)/libpolylibgmp_la-polyparam.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/polyparam.c' object='libpolylibgmp_la-polyparam.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-polyparam.lo `test -f 'source/kernel/polyparam.c' || echo '$(srcdir)/'`source/kernel/polyparam.c libpolylibgmp_la-param.lo: source/kernel/param.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-param.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-param.Tpo -c -o libpolylibgmp_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-param.Tpo $(DEPDIR)/libpolylibgmp_la-param.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/param.c' object='libpolylibgmp_la-param.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-param.lo `test -f 'source/kernel/param.c' || echo '$(srcdir)/'`source/kernel/param.c libpolylibgmp_la-alpha.lo: source/kernel/alpha.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-alpha.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-alpha.Tpo -c -o libpolylibgmp_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-alpha.Tpo $(DEPDIR)/libpolylibgmp_la-alpha.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/alpha.c' object='libpolylibgmp_la-alpha.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-alpha.lo `test -f 'source/kernel/alpha.c' || echo '$(srcdir)/'`source/kernel/alpha.c libpolylibgmp_la-ehrhart.lo: source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-ehrhart.Tpo -c -o libpolylibgmp_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-ehrhart.Tpo $(DEPDIR)/libpolylibgmp_la-ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ehrhart.c' object='libpolylibgmp_la-ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-ehrhart.lo `test -f 'source/ehrhart/ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ehrhart.c libpolylibgmp_la-ext_ehrhart.lo: source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-ext_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-ext_ehrhart.Tpo -c -o libpolylibgmp_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-ext_ehrhart.Tpo $(DEPDIR)/libpolylibgmp_la-ext_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ext_ehrhart.c' object='libpolylibgmp_la-ext_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-ext_ehrhart.lo `test -f 'source/ehrhart/ext_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/ext_ehrhart.c libpolylibgmp_la-eval_ehrhart.lo: source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-eval_ehrhart.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-eval_ehrhart.Tpo -c -o libpolylibgmp_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-eval_ehrhart.Tpo $(DEPDIR)/libpolylibgmp_la-eval_ehrhart.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/eval_ehrhart.c' object='libpolylibgmp_la-eval_ehrhart.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-eval_ehrhart.lo `test -f 'source/ehrhart/eval_ehrhart.c' || echo '$(srcdir)/'`source/ehrhart/eval_ehrhart.c libpolylibgmp_la-homogenization.lo: source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-homogenization.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-homogenization.Tpo -c -o libpolylibgmp_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-homogenization.Tpo $(DEPDIR)/libpolylibgmp_la-homogenization.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/homogenization.c' object='libpolylibgmp_la-homogenization.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-homogenization.lo `test -f 'source/ehrhart/homogenization.c' || echo '$(srcdir)/'`source/ehrhart/homogenization.c libpolylibgmp_la-ranking.lo: source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-ranking.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-ranking.Tpo -c -o libpolylibgmp_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-ranking.Tpo $(DEPDIR)/libpolylibgmp_la-ranking.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/ehrhart/ranking.c' object='libpolylibgmp_la-ranking.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-ranking.lo `test -f 'source/ehrhart/ranking.c' || echo '$(srcdir)/'`source/ehrhart/ranking.c libpolylibgmp_la-matrix_addon.lo: source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-matrix_addon.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-matrix_addon.Tpo -c -o libpolylibgmp_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-matrix_addon.Tpo $(DEPDIR)/libpolylibgmp_la-matrix_addon.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_addon.c' object='libpolylibgmp_la-matrix_addon.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-matrix_addon.lo `test -f 'source/kernel/matrix_addon.c' || echo '$(srcdir)/'`source/kernel/matrix_addon.c libpolylibgmp_la-matrix_permutations.lo: source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-matrix_permutations.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-matrix_permutations.Tpo -c -o libpolylibgmp_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-matrix_permutations.Tpo $(DEPDIR)/libpolylibgmp_la-matrix_permutations.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/matrix_permutations.c' object='libpolylibgmp_la-matrix_permutations.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-matrix_permutations.lo `test -f 'source/kernel/matrix_permutations.c' || echo '$(srcdir)/'`source/kernel/matrix_permutations.c libpolylibgmp_la-compress_parms.lo: source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-compress_parms.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-compress_parms.Tpo -c -o libpolylibgmp_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-compress_parms.Tpo $(DEPDIR)/libpolylibgmp_la-compress_parms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/compress_parms.c' object='libpolylibgmp_la-compress_parms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-compress_parms.lo `test -f 'source/kernel/compress_parms.c' || echo '$(srcdir)/'`source/kernel/compress_parms.c libpolylibgmp_la-SolveDio.lo: source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-SolveDio.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-SolveDio.Tpo -c -o libpolylibgmp_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-SolveDio.Tpo $(DEPDIR)/libpolylibgmp_la-SolveDio.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/SolveDio.c' object='libpolylibgmp_la-SolveDio.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-SolveDio.lo `test -f 'source/kernel/SolveDio.c' || echo '$(srcdir)/'`source/kernel/SolveDio.c libpolylibgmp_la-Lattice.lo: source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-Lattice.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-Lattice.Tpo -c -o libpolylibgmp_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-Lattice.Tpo $(DEPDIR)/libpolylibgmp_la-Lattice.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Lattice.c' object='libpolylibgmp_la-Lattice.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-Lattice.lo `test -f 'source/kernel/Lattice.c' || echo '$(srcdir)/'`source/kernel/Lattice.c libpolylibgmp_la-Matop.lo: source/kernel/Matop.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-Matop.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-Matop.Tpo -c -o libpolylibgmp_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-Matop.Tpo $(DEPDIR)/libpolylibgmp_la-Matop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Matop.c' object='libpolylibgmp_la-Matop.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-Matop.lo `test -f 'source/kernel/Matop.c' || echo '$(srcdir)/'`source/kernel/Matop.c libpolylibgmp_la-NormalForms.lo: source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-NormalForms.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-NormalForms.Tpo -c -o libpolylibgmp_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-NormalForms.Tpo $(DEPDIR)/libpolylibgmp_la-NormalForms.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/NormalForms.c' object='libpolylibgmp_la-NormalForms.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-NormalForms.lo `test -f 'source/kernel/NormalForms.c' || echo '$(srcdir)/'`source/kernel/NormalForms.c libpolylibgmp_la-Zpolyhedron.lo: source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libpolylibgmp_la-Zpolyhedron.lo -MD -MP -MF $(DEPDIR)/libpolylibgmp_la-Zpolyhedron.Tpo -c -o libpolylibgmp_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libpolylibgmp_la-Zpolyhedron.Tpo $(DEPDIR)/libpolylibgmp_la-Zpolyhedron.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/kernel/Zpolyhedron.c' object='libpolylibgmp_la-Zpolyhedron.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libpolylibgmp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libpolylibgmp_la-Zpolyhedron.lo `test -f 'source/kernel/Zpolyhedron.c' || echo '$(srcdir)/'`source/kernel/Zpolyhedron.c Zpolytest32-Zpolytest.o: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytest32-Zpolytest.o -MD -MP -MF $(DEPDIR)/Zpolytest32-Zpolytest.Tpo -c -o Zpolytest32-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytest32-Zpolytest.Tpo $(DEPDIR)/Zpolytest32-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytest32-Zpolytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytest32-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c Zpolytest32-Zpolytest.obj: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytest32-Zpolytest.obj -MD -MP -MF $(DEPDIR)/Zpolytest32-Zpolytest.Tpo -c -o Zpolytest32-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytest32-Zpolytest.Tpo $(DEPDIR)/Zpolytest32-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytest32-Zpolytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytest32-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` Zpolytest64-Zpolytest.o: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytest64-Zpolytest.o -MD -MP -MF $(DEPDIR)/Zpolytest64-Zpolytest.Tpo -c -o Zpolytest64-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytest64-Zpolytest.Tpo $(DEPDIR)/Zpolytest64-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytest64-Zpolytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytest64-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c Zpolytest64-Zpolytest.obj: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytest64-Zpolytest.obj -MD -MP -MF $(DEPDIR)/Zpolytest64-Zpolytest.Tpo -c -o Zpolytest64-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytest64-Zpolytest.Tpo $(DEPDIR)/Zpolytest64-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytest64-Zpolytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytest64-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` Zpolytestgmp-Zpolytest.o: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytestgmp-Zpolytest.o -MD -MP -MF $(DEPDIR)/Zpolytestgmp-Zpolytest.Tpo -c -o Zpolytestgmp-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytestgmp-Zpolytest.Tpo $(DEPDIR)/Zpolytestgmp-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytestgmp-Zpolytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytestgmp-Zpolytest.o `test -f '$(poly_src)/Zpolytest.c' || echo '$(srcdir)/'`$(poly_src)/Zpolytest.c Zpolytestgmp-Zpolytest.obj: $(poly_src)/Zpolytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT Zpolytestgmp-Zpolytest.obj -MD -MP -MF $(DEPDIR)/Zpolytestgmp-Zpolytest.Tpo -c -o Zpolytestgmp-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/Zpolytestgmp-Zpolytest.Tpo $(DEPDIR)/Zpolytestgmp-Zpolytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/Zpolytest.c' object='Zpolytestgmp-Zpolytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(Zpolytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o Zpolytestgmp-Zpolytest.obj `if test -f '$(poly_src)/Zpolytest.c'; then $(CYGPATH_W) '$(poly_src)/Zpolytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/Zpolytest.c'; fi` c2p-c2p.o: $(poly_src)/c2p.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(c2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT c2p-c2p.o -MD -MP -MF $(DEPDIR)/c2p-c2p.Tpo -c -o c2p-c2p.o `test -f '$(poly_src)/c2p.c' || echo '$(srcdir)/'`$(poly_src)/c2p.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/c2p-c2p.Tpo $(DEPDIR)/c2p-c2p.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/c2p.c' object='c2p-c2p.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(c2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o c2p-c2p.o `test -f '$(poly_src)/c2p.c' || echo '$(srcdir)/'`$(poly_src)/c2p.c c2p-c2p.obj: $(poly_src)/c2p.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(c2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT c2p-c2p.obj -MD -MP -MF $(DEPDIR)/c2p-c2p.Tpo -c -o c2p-c2p.obj `if test -f '$(poly_src)/c2p.c'; then $(CYGPATH_W) '$(poly_src)/c2p.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/c2p.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/c2p-c2p.Tpo $(DEPDIR)/c2p-c2p.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/c2p.c' object='c2p-c2p.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(c2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o c2p-c2p.obj `if test -f '$(poly_src)/c2p.c'; then $(CYGPATH_W) '$(poly_src)/c2p.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/c2p.c'; fi` count-count.o: source/count.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(count_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT count-count.o -MD -MP -MF $(DEPDIR)/count-count.Tpo -c -o count-count.o `test -f 'source/count.c' || echo '$(srcdir)/'`source/count.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/count-count.Tpo $(DEPDIR)/count-count.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/count.c' object='count-count.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(count_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o count-count.o `test -f 'source/count.c' || echo '$(srcdir)/'`source/count.c count-count.obj: source/count.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(count_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT count-count.obj -MD -MP -MF $(DEPDIR)/count-count.Tpo -c -o count-count.obj `if test -f 'source/count.c'; then $(CYGPATH_W) 'source/count.c'; else $(CYGPATH_W) '$(srcdir)/source/count.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/count-count.Tpo $(DEPDIR)/count-count.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='source/count.c' object='count-count.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(count_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o count-count.obj `if test -f 'source/count.c'; then $(CYGPATH_W) 'source/count.c'; else $(CYGPATH_W) '$(srcdir)/source/count.c'; fi` disjoint_union_adj-disjoint_union_adj.o: $(poly_src)/disjoint_union_adj.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_adj_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT disjoint_union_adj-disjoint_union_adj.o -MD -MP -MF $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Tpo -c -o disjoint_union_adj-disjoint_union_adj.o `test -f '$(poly_src)/disjoint_union_adj.c' || echo '$(srcdir)/'`$(poly_src)/disjoint_union_adj.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Tpo $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/disjoint_union_adj.c' object='disjoint_union_adj-disjoint_union_adj.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_adj_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o disjoint_union_adj-disjoint_union_adj.o `test -f '$(poly_src)/disjoint_union_adj.c' || echo '$(srcdir)/'`$(poly_src)/disjoint_union_adj.c disjoint_union_adj-disjoint_union_adj.obj: $(poly_src)/disjoint_union_adj.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_adj_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT disjoint_union_adj-disjoint_union_adj.obj -MD -MP -MF $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Tpo -c -o disjoint_union_adj-disjoint_union_adj.obj `if test -f '$(poly_src)/disjoint_union_adj.c'; then $(CYGPATH_W) '$(poly_src)/disjoint_union_adj.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/disjoint_union_adj.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Tpo $(DEPDIR)/disjoint_union_adj-disjoint_union_adj.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/disjoint_union_adj.c' object='disjoint_union_adj-disjoint_union_adj.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_adj_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o disjoint_union_adj-disjoint_union_adj.obj `if test -f '$(poly_src)/disjoint_union_adj.c'; then $(CYGPATH_W) '$(poly_src)/disjoint_union_adj.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/disjoint_union_adj.c'; fi` disjoint_union_sep-disjoint_union_sep.o: $(poly_src)/disjoint_union_sep.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_sep_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT disjoint_union_sep-disjoint_union_sep.o -MD -MP -MF $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Tpo -c -o disjoint_union_sep-disjoint_union_sep.o `test -f '$(poly_src)/disjoint_union_sep.c' || echo '$(srcdir)/'`$(poly_src)/disjoint_union_sep.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Tpo $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/disjoint_union_sep.c' object='disjoint_union_sep-disjoint_union_sep.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_sep_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o disjoint_union_sep-disjoint_union_sep.o `test -f '$(poly_src)/disjoint_union_sep.c' || echo '$(srcdir)/'`$(poly_src)/disjoint_union_sep.c disjoint_union_sep-disjoint_union_sep.obj: $(poly_src)/disjoint_union_sep.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_sep_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT disjoint_union_sep-disjoint_union_sep.obj -MD -MP -MF $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Tpo -c -o disjoint_union_sep-disjoint_union_sep.obj `if test -f '$(poly_src)/disjoint_union_sep.c'; then $(CYGPATH_W) '$(poly_src)/disjoint_union_sep.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/disjoint_union_sep.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Tpo $(DEPDIR)/disjoint_union_sep-disjoint_union_sep.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/disjoint_union_sep.c' object='disjoint_union_sep-disjoint_union_sep.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(disjoint_union_sep_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o disjoint_union_sep-disjoint_union_sep.obj `if test -f '$(poly_src)/disjoint_union_sep.c'; then $(CYGPATH_W) '$(poly_src)/disjoint_union_sep.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/disjoint_union_sep.c'; fi` ehrhart_lower_bound-ehrhart_lower_bound.o: $(poly_src)/ehrhart_lower_bound.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_lower_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_lower_bound-ehrhart_lower_bound.o -MD -MP -MF $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Tpo -c -o ehrhart_lower_bound-ehrhart_lower_bound.o `test -f '$(poly_src)/ehrhart_lower_bound.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_lower_bound.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Tpo $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_lower_bound.c' object='ehrhart_lower_bound-ehrhart_lower_bound.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_lower_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_lower_bound-ehrhart_lower_bound.o `test -f '$(poly_src)/ehrhart_lower_bound.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_lower_bound.c ehrhart_lower_bound-ehrhart_lower_bound.obj: $(poly_src)/ehrhart_lower_bound.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_lower_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_lower_bound-ehrhart_lower_bound.obj -MD -MP -MF $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Tpo -c -o ehrhart_lower_bound-ehrhart_lower_bound.obj `if test -f '$(poly_src)/ehrhart_lower_bound.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_lower_bound.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_lower_bound.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Tpo $(DEPDIR)/ehrhart_lower_bound-ehrhart_lower_bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_lower_bound.c' object='ehrhart_lower_bound-ehrhart_lower_bound.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_lower_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_lower_bound-ehrhart_lower_bound.obj `if test -f '$(poly_src)/ehrhart_lower_bound.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_lower_bound.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_lower_bound.c'; fi` ehrhart_quick_apx-ehrhart_quick_apx.o: $(poly_src)/ehrhart_quick_apx.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_quick_apx_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_quick_apx-ehrhart_quick_apx.o -MD -MP -MF $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Tpo -c -o ehrhart_quick_apx-ehrhart_quick_apx.o `test -f '$(poly_src)/ehrhart_quick_apx.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_quick_apx.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Tpo $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_quick_apx.c' object='ehrhart_quick_apx-ehrhart_quick_apx.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_quick_apx_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_quick_apx-ehrhart_quick_apx.o `test -f '$(poly_src)/ehrhart_quick_apx.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_quick_apx.c ehrhart_quick_apx-ehrhart_quick_apx.obj: $(poly_src)/ehrhart_quick_apx.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_quick_apx_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_quick_apx-ehrhart_quick_apx.obj -MD -MP -MF $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Tpo -c -o ehrhart_quick_apx-ehrhart_quick_apx.obj `if test -f '$(poly_src)/ehrhart_quick_apx.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_quick_apx.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_quick_apx.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Tpo $(DEPDIR)/ehrhart_quick_apx-ehrhart_quick_apx.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_quick_apx.c' object='ehrhart_quick_apx-ehrhart_quick_apx.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_quick_apx_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_quick_apx-ehrhart_quick_apx.obj `if test -f '$(poly_src)/ehrhart_quick_apx.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_quick_apx.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_quick_apx.c'; fi` ehrhart_ranking32-ehrhart_ranking.o: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_ranking32-ehrhart_ranking.o -MD -MP -MF $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Tpo -c -o ehrhart_ranking32-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_ranking32-ehrhart_ranking.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_ranking32-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c ehrhart_ranking32-ehrhart_ranking.obj: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_ranking32-ehrhart_ranking.obj -MD -MP -MF $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Tpo -c -o ehrhart_ranking32-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_ranking32-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_ranking32-ehrhart_ranking.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_ranking32-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` ehrhart_ranking64-ehrhart_ranking.o: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_ranking64-ehrhart_ranking.o -MD -MP -MF $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Tpo -c -o ehrhart_ranking64-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_ranking64-ehrhart_ranking.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_ranking64-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c ehrhart_ranking64-ehrhart_ranking.obj: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_ranking64-ehrhart_ranking.obj -MD -MP -MF $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Tpo -c -o ehrhart_ranking64-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_ranking64-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_ranking64-ehrhart_ranking.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_ranking64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_ranking64-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` ehrhart_rankinggmp-ehrhart_ranking.o: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_rankinggmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_rankinggmp-ehrhart_ranking.o -MD -MP -MF $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Tpo -c -o ehrhart_rankinggmp-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_rankinggmp-ehrhart_ranking.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_rankinggmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_rankinggmp-ehrhart_ranking.o `test -f '$(poly_src)/ehrhart_ranking.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_ranking.c ehrhart_rankinggmp-ehrhart_ranking.obj: $(poly_src)/ehrhart_ranking.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_rankinggmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_rankinggmp-ehrhart_ranking.obj -MD -MP -MF $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Tpo -c -o ehrhart_rankinggmp-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Tpo $(DEPDIR)/ehrhart_rankinggmp-ehrhart_ranking.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_ranking.c' object='ehrhart_rankinggmp-ehrhart_ranking.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_rankinggmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_rankinggmp-ehrhart_ranking.obj `if test -f '$(poly_src)/ehrhart_ranking.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_ranking.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_ranking.c'; fi` ehrhart_union32-ehrhart_union.o: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_union32-ehrhart_union.o -MD -MP -MF $(DEPDIR)/ehrhart_union32-ehrhart_union.Tpo -c -o ehrhart_union32-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_union32-ehrhart_union.Tpo $(DEPDIR)/ehrhart_union32-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_union32-ehrhart_union.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_union32-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c ehrhart_union32-ehrhart_union.obj: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_union32-ehrhart_union.obj -MD -MP -MF $(DEPDIR)/ehrhart_union32-ehrhart_union.Tpo -c -o ehrhart_union32-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_union32-ehrhart_union.Tpo $(DEPDIR)/ehrhart_union32-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_union32-ehrhart_union.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_union32-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` ehrhart_union64-ehrhart_union.o: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_union64-ehrhart_union.o -MD -MP -MF $(DEPDIR)/ehrhart_union64-ehrhart_union.Tpo -c -o ehrhart_union64-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_union64-ehrhart_union.Tpo $(DEPDIR)/ehrhart_union64-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_union64-ehrhart_union.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_union64-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c ehrhart_union64-ehrhart_union.obj: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_union64-ehrhart_union.obj -MD -MP -MF $(DEPDIR)/ehrhart_union64-ehrhart_union.Tpo -c -o ehrhart_union64-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_union64-ehrhart_union.Tpo $(DEPDIR)/ehrhart_union64-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_union64-ehrhart_union.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_union64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_union64-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` ehrhart_uniongmp-ehrhart_union.o: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_uniongmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_uniongmp-ehrhart_union.o -MD -MP -MF $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Tpo -c -o ehrhart_uniongmp-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Tpo $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_uniongmp-ehrhart_union.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_uniongmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_uniongmp-ehrhart_union.o `test -f '$(poly_src)/ehrhart_union.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_union.c ehrhart_uniongmp-ehrhart_union.obj: $(poly_src)/ehrhart_union.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_uniongmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_uniongmp-ehrhart_union.obj -MD -MP -MF $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Tpo -c -o ehrhart_uniongmp-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Tpo $(DEPDIR)/ehrhart_uniongmp-ehrhart_union.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_union.c' object='ehrhart_uniongmp-ehrhart_union.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_uniongmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_uniongmp-ehrhart_union.obj `if test -f '$(poly_src)/ehrhart_union.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_union.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_union.c'; fi` ehrhart_upper_bound-ehrhart_upper_bound.o: $(poly_src)/ehrhart_upper_bound.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_upper_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_upper_bound-ehrhart_upper_bound.o -MD -MP -MF $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Tpo -c -o ehrhart_upper_bound-ehrhart_upper_bound.o `test -f '$(poly_src)/ehrhart_upper_bound.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_upper_bound.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Tpo $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_upper_bound.c' object='ehrhart_upper_bound-ehrhart_upper_bound.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_upper_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_upper_bound-ehrhart_upper_bound.o `test -f '$(poly_src)/ehrhart_upper_bound.c' || echo '$(srcdir)/'`$(poly_src)/ehrhart_upper_bound.c ehrhart_upper_bound-ehrhart_upper_bound.obj: $(poly_src)/ehrhart_upper_bound.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_upper_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ehrhart_upper_bound-ehrhart_upper_bound.obj -MD -MP -MF $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Tpo -c -o ehrhart_upper_bound-ehrhart_upper_bound.obj `if test -f '$(poly_src)/ehrhart_upper_bound.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_upper_bound.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_upper_bound.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Tpo $(DEPDIR)/ehrhart_upper_bound-ehrhart_upper_bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/ehrhart_upper_bound.c' object='ehrhart_upper_bound-ehrhart_upper_bound.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ehrhart_upper_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ehrhart_upper_bound-ehrhart_upper_bound.obj `if test -f '$(poly_src)/ehrhart_upper_bound.c'; then $(CYGPATH_W) '$(poly_src)/ehrhart_upper_bound.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/ehrhart_upper_bound.c'; fi` example-example.o: $(poly_src)/example.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(example_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT example-example.o -MD -MP -MF $(DEPDIR)/example-example.Tpo -c -o example-example.o `test -f '$(poly_src)/example.c' || echo '$(srcdir)/'`$(poly_src)/example.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/example-example.Tpo $(DEPDIR)/example-example.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/example.c' object='example-example.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(example_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o example-example.o `test -f '$(poly_src)/example.c' || echo '$(srcdir)/'`$(poly_src)/example.c example-example.obj: $(poly_src)/example.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(example_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT example-example.obj -MD -MP -MF $(DEPDIR)/example-example.Tpo -c -o example-example.obj `if test -f '$(poly_src)/example.c'; then $(CYGPATH_W) '$(poly_src)/example.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/example.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/example-example.Tpo $(DEPDIR)/example-example.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/example.c' object='example-example.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(example_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o example-example.obj `if test -f '$(poly_src)/example.c'; then $(CYGPATH_W) '$(poly_src)/example.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/example.c'; fi` findv-findv.o: $(poly_src)/findv.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(findv_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT findv-findv.o -MD -MP -MF $(DEPDIR)/findv-findv.Tpo -c -o findv-findv.o `test -f '$(poly_src)/findv.c' || echo '$(srcdir)/'`$(poly_src)/findv.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/findv-findv.Tpo $(DEPDIR)/findv-findv.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/findv.c' object='findv-findv.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(findv_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o findv-findv.o `test -f '$(poly_src)/findv.c' || echo '$(srcdir)/'`$(poly_src)/findv.c findv-findv.obj: $(poly_src)/findv.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(findv_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT findv-findv.obj -MD -MP -MF $(DEPDIR)/findv-findv.Tpo -c -o findv-findv.obj `if test -f '$(poly_src)/findv.c'; then $(CYGPATH_W) '$(poly_src)/findv.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/findv.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/findv-findv.Tpo $(DEPDIR)/findv-findv.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/findv.c' object='findv-findv.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(findv_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o findv-findv.obj `if test -f '$(poly_src)/findv.c'; then $(CYGPATH_W) '$(poly_src)/findv.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/findv.c'; fi` polytest32-polytest.o: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytest32-polytest.o -MD -MP -MF $(DEPDIR)/polytest32-polytest.Tpo -c -o polytest32-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytest32-polytest.Tpo $(DEPDIR)/polytest32-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytest32-polytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytest32-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c polytest32-polytest.obj: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytest32-polytest.obj -MD -MP -MF $(DEPDIR)/polytest32-polytest.Tpo -c -o polytest32-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytest32-polytest.Tpo $(DEPDIR)/polytest32-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytest32-polytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytest32-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` polytest64-polytest.o: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytest64-polytest.o -MD -MP -MF $(DEPDIR)/polytest64-polytest.Tpo -c -o polytest64-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytest64-polytest.Tpo $(DEPDIR)/polytest64-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytest64-polytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytest64-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c polytest64-polytest.obj: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytest64-polytest.obj -MD -MP -MF $(DEPDIR)/polytest64-polytest.Tpo -c -o polytest64-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytest64-polytest.Tpo $(DEPDIR)/polytest64-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytest64-polytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytest64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytest64-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` polytestgmp-polytest.o: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytestgmp-polytest.o -MD -MP -MF $(DEPDIR)/polytestgmp-polytest.Tpo -c -o polytestgmp-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytestgmp-polytest.Tpo $(DEPDIR)/polytestgmp-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytestgmp-polytest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytestgmp-polytest.o `test -f '$(poly_src)/polytest.c' || echo '$(srcdir)/'`$(poly_src)/polytest.c polytestgmp-polytest.obj: $(poly_src)/polytest.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT polytestgmp-polytest.obj -MD -MP -MF $(DEPDIR)/polytestgmp-polytest.Tpo -c -o polytestgmp-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/polytestgmp-polytest.Tpo $(DEPDIR)/polytestgmp-polytest.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/polytest.c' object='polytestgmp-polytest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(polytestgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o polytestgmp-polytest.obj `if test -f '$(poly_src)/polytest.c'; then $(CYGPATH_W) '$(poly_src)/polytest.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/polytest.c'; fi` pp32-pp.o: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT pp32-pp.o -MD -MP -MF $(DEPDIR)/pp32-pp.Tpo -c -o pp32-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/pp32-pp.Tpo $(DEPDIR)/pp32-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='pp32-pp.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o pp32-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c pp32-pp.obj: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT pp32-pp.obj -MD -MP -MF $(DEPDIR)/pp32-pp.Tpo -c -o pp32-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/pp32-pp.Tpo $(DEPDIR)/pp32-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='pp32-pp.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o pp32-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` pp64-pp.o: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT pp64-pp.o -MD -MP -MF $(DEPDIR)/pp64-pp.Tpo -c -o pp64-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/pp64-pp.Tpo $(DEPDIR)/pp64-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='pp64-pp.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o pp64-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c pp64-pp.obj: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT pp64-pp.obj -MD -MP -MF $(DEPDIR)/pp64-pp.Tpo -c -o pp64-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/pp64-pp.Tpo $(DEPDIR)/pp64-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='pp64-pp.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(pp64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o pp64-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` ppgmp-pp.o: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ppgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ppgmp-pp.o -MD -MP -MF $(DEPDIR)/ppgmp-pp.Tpo -c -o ppgmp-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ppgmp-pp.Tpo $(DEPDIR)/ppgmp-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='ppgmp-pp.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ppgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ppgmp-pp.o `test -f '$(poly_src)/pp.c' || echo '$(srcdir)/'`$(poly_src)/pp.c ppgmp-pp.obj: $(poly_src)/pp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ppgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT ppgmp-pp.obj -MD -MP -MF $(DEPDIR)/ppgmp-pp.Tpo -c -o ppgmp-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/ppgmp-pp.Tpo $(DEPDIR)/ppgmp-pp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/pp.c' object='ppgmp-pp.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(ppgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o ppgmp-pp.obj `if test -f '$(poly_src)/pp.c'; then $(CYGPATH_W) '$(poly_src)/pp.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/pp.c'; fi` r2p-r2p.o: $(poly_src)/r2p.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(r2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT r2p-r2p.o -MD -MP -MF $(DEPDIR)/r2p-r2p.Tpo -c -o r2p-r2p.o `test -f '$(poly_src)/r2p.c' || echo '$(srcdir)/'`$(poly_src)/r2p.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/r2p-r2p.Tpo $(DEPDIR)/r2p-r2p.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/r2p.c' object='r2p-r2p.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(r2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o r2p-r2p.o `test -f '$(poly_src)/r2p.c' || echo '$(srcdir)/'`$(poly_src)/r2p.c r2p-r2p.obj: $(poly_src)/r2p.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(r2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT r2p-r2p.obj -MD -MP -MF $(DEPDIR)/r2p-r2p.Tpo -c -o r2p-r2p.obj `if test -f '$(poly_src)/r2p.c'; then $(CYGPATH_W) '$(poly_src)/r2p.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/r2p.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/r2p-r2p.Tpo $(DEPDIR)/r2p-r2p.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/r2p.c' object='r2p-r2p.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(r2p_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o r2p-r2p.obj `if test -f '$(poly_src)/r2p.c'; then $(CYGPATH_W) '$(poly_src)/r2p.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/r2p.c'; fi` testCompressParms32-testCompressParms.o: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParms32-testCompressParms.o -MD -MP -MF $(DEPDIR)/testCompressParms32-testCompressParms.Tpo -c -o testCompressParms32-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParms32-testCompressParms.Tpo $(DEPDIR)/testCompressParms32-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParms32-testCompressParms.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParms32-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c testCompressParms32-testCompressParms.obj: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParms32-testCompressParms.obj -MD -MP -MF $(DEPDIR)/testCompressParms32-testCompressParms.Tpo -c -o testCompressParms32-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParms32-testCompressParms.Tpo $(DEPDIR)/testCompressParms32-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParms32-testCompressParms.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParms32-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` testCompressParms64-testCompressParms.o: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParms64-testCompressParms.o -MD -MP -MF $(DEPDIR)/testCompressParms64-testCompressParms.Tpo -c -o testCompressParms64-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParms64-testCompressParms.Tpo $(DEPDIR)/testCompressParms64-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParms64-testCompressParms.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParms64-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c testCompressParms64-testCompressParms.obj: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParms64-testCompressParms.obj -MD -MP -MF $(DEPDIR)/testCompressParms64-testCompressParms.Tpo -c -o testCompressParms64-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParms64-testCompressParms.Tpo $(DEPDIR)/testCompressParms64-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParms64-testCompressParms.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParms64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParms64-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` testCompressParmsgmp-testCompressParms.o: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParmsgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParmsgmp-testCompressParms.o -MD -MP -MF $(DEPDIR)/testCompressParmsgmp-testCompressParms.Tpo -c -o testCompressParmsgmp-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParmsgmp-testCompressParms.Tpo $(DEPDIR)/testCompressParmsgmp-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParmsgmp-testCompressParms.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParmsgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParmsgmp-testCompressParms.o `test -f '$(poly_src)/testCompressParms.c' || echo '$(srcdir)/'`$(poly_src)/testCompressParms.c testCompressParmsgmp-testCompressParms.obj: $(poly_src)/testCompressParms.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParmsgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testCompressParmsgmp-testCompressParms.obj -MD -MP -MF $(DEPDIR)/testCompressParmsgmp-testCompressParms.Tpo -c -o testCompressParmsgmp-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testCompressParmsgmp-testCompressParms.Tpo $(DEPDIR)/testCompressParmsgmp-testCompressParms.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testCompressParms.c' object='testCompressParmsgmp-testCompressParms.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testCompressParmsgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testCompressParmsgmp-testCompressParms.obj `if test -f '$(poly_src)/testCompressParms.c'; then $(CYGPATH_W) '$(poly_src)/testCompressParms.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testCompressParms.c'; fi` testehrhart32-testehrhart.o: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhart32-testehrhart.o -MD -MP -MF $(DEPDIR)/testehrhart32-testehrhart.Tpo -c -o testehrhart32-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhart32-testehrhart.Tpo $(DEPDIR)/testehrhart32-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhart32-testehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhart32-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c testehrhart32-testehrhart.obj: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhart32-testehrhart.obj -MD -MP -MF $(DEPDIR)/testehrhart32-testehrhart.Tpo -c -o testehrhart32-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhart32-testehrhart.Tpo $(DEPDIR)/testehrhart32-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhart32-testehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhart32-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` testehrhart64-testehrhart.o: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhart64-testehrhart.o -MD -MP -MF $(DEPDIR)/testehrhart64-testehrhart.Tpo -c -o testehrhart64-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhart64-testehrhart.Tpo $(DEPDIR)/testehrhart64-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhart64-testehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhart64-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c testehrhart64-testehrhart.obj: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhart64-testehrhart.obj -MD -MP -MF $(DEPDIR)/testehrhart64-testehrhart.Tpo -c -o testehrhart64-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhart64-testehrhart.Tpo $(DEPDIR)/testehrhart64-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhart64-testehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhart64-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` testehrhartgmp-testehrhart.o: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhartgmp-testehrhart.o -MD -MP -MF $(DEPDIR)/testehrhartgmp-testehrhart.Tpo -c -o testehrhartgmp-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhartgmp-testehrhart.Tpo $(DEPDIR)/testehrhartgmp-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhartgmp-testehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhartgmp-testehrhart.o `test -f '$(poly_src)/testehrhart.c' || echo '$(srcdir)/'`$(poly_src)/testehrhart.c testehrhartgmp-testehrhart.obj: $(poly_src)/testehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testehrhartgmp-testehrhart.obj -MD -MP -MF $(DEPDIR)/testehrhartgmp-testehrhart.Tpo -c -o testehrhartgmp-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testehrhartgmp-testehrhart.Tpo $(DEPDIR)/testehrhartgmp-testehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testehrhart.c' object='testehrhartgmp-testehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testehrhartgmp-testehrhart.obj `if test -f '$(poly_src)/testehrhart.c'; then $(CYGPATH_W) '$(poly_src)/testehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testehrhart.c'; fi` testlib-testlib.o: $(poly_src)/testlib.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testlib_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testlib-testlib.o -MD -MP -MF $(DEPDIR)/testlib-testlib.Tpo -c -o testlib-testlib.o `test -f '$(poly_src)/testlib.c' || echo '$(srcdir)/'`$(poly_src)/testlib.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testlib-testlib.Tpo $(DEPDIR)/testlib-testlib.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testlib.c' object='testlib-testlib.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testlib_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testlib-testlib.o `test -f '$(poly_src)/testlib.c' || echo '$(srcdir)/'`$(poly_src)/testlib.c testlib-testlib.obj: $(poly_src)/testlib.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testlib_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT testlib-testlib.obj -MD -MP -MF $(DEPDIR)/testlib-testlib.Tpo -c -o testlib-testlib.obj `if test -f '$(poly_src)/testlib.c'; then $(CYGPATH_W) '$(poly_src)/testlib.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testlib.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/testlib-testlib.Tpo $(DEPDIR)/testlib-testlib.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/testlib.c' object='testlib-testlib.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(testlib_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o testlib-testlib.obj `if test -f '$(poly_src)/testlib.c'; then $(CYGPATH_W) '$(poly_src)/testlib.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/testlib.c'; fi` verif_ehrhart32-verif_ehrhart.o: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhart32-verif_ehrhart.o -MD -MP -MF $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Tpo -c -o verif_ehrhart32-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhart32-verif_ehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhart32-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c verif_ehrhart32-verif_ehrhart.obj: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhart32-verif_ehrhart.obj -MD -MP -MF $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Tpo -c -o verif_ehrhart32-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhart32-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhart32-verif_ehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart32_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhart32-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` verif_ehrhart64-verif_ehrhart.o: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhart64-verif_ehrhart.o -MD -MP -MF $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Tpo -c -o verif_ehrhart64-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhart64-verif_ehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhart64-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c verif_ehrhart64-verif_ehrhart.obj: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhart64-verif_ehrhart.obj -MD -MP -MF $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Tpo -c -o verif_ehrhart64-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhart64-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhart64-verif_ehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhart64_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhart64-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` verif_ehrhartgmp-verif_ehrhart.o: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhartgmp-verif_ehrhart.o -MD -MP -MF $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Tpo -c -o verif_ehrhartgmp-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhartgmp-verif_ehrhart.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhartgmp-verif_ehrhart.o `test -f '$(poly_src)/verif_ehrhart.c' || echo '$(srcdir)/'`$(poly_src)/verif_ehrhart.c verif_ehrhartgmp-verif_ehrhart.obj: $(poly_src)/verif_ehrhart.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT verif_ehrhartgmp-verif_ehrhart.obj -MD -MP -MF $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Tpo -c -o verif_ehrhartgmp-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Tpo $(DEPDIR)/verif_ehrhartgmp-verif_ehrhart.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(poly_src)/verif_ehrhart.c' object='verif_ehrhartgmp-verif_ehrhart.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(verif_ehrhartgmp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o verif_ehrhartgmp-verif_ehrhart.obj `if test -f '$(poly_src)/verif_ehrhart.c'; then $(CYGPATH_W) '$(poly_src)/verif_ehrhart.c'; else $(CYGPATH_W) '$(srcdir)/$(poly_src)/verif_ehrhart.c'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool config.lt # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | xz -c >$(distdir).tar.xz $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @$(am__cd) '$(distuninstallcheck_dir)' \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile $(LTLIBRARIES) $(PROGRAMS) config.h install-binPROGRAMS: install-libLTLIBRARIES installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool clean-local clean-noinstPROGRAMS mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(DEPDIR) ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-libtool distclean-local distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-data-local install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-binPROGRAMS install-libLTLIBRARIES install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf $(DEPDIR) ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \ uninstall-local .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all \ ctags-recursive install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-am clean clean-binPROGRAMS \ clean-generic clean-libLTLIBRARIES clean-libtool clean-local \ clean-noinstPROGRAMS ctags ctags-recursive dist dist-all \ dist-bzip2 dist-gzip dist-hook dist-lzma dist-shar dist-tarZ \ dist-xz dist-zip distcheck distclean distclean-compile \ distclean-generic distclean-hdr distclean-libtool \ distclean-local distclean-tags distcleancheck distdir \ distuninstallcheck dvi dvi-am html html-am info info-am \ install install-am install-binPROGRAMS install-data \ install-data-am install-data-local install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-libLTLIBRARIES \ install-man install-pdf install-pdf-am install-ps \ install-ps-am install-strip installcheck installcheck-am \ installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-recursive uninstall uninstall-am \ uninstall-binPROGRAMS uninstall-libLTLIBRARIES uninstall-local check: tests tests: all (cd Test; $(MAKE) tests) longtest: all (cd Test; $(MAKE) long_tests) # Make the 'javadoc' style documentation document: -mkdir doc $(DOXYGEN) polylib.doxygen dist-hook: document rm -rf `find $(distdir)/doc -name CVS` clean-local: rm -rf doc distclean-local: rm -f polylib*.pc polylib*-uninstalled.pc polylib*-uninstalled.sh polylib*.pc.in install-data-local: @test -z "$(pkgconfig_libdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfig_libdir)" $(INSTALL_DATA) $(pkgconfig_libfile) "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" uninstall-local: rm -f "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/include/0000755000175000017500000000000011341243117016520 5ustar sylvestresylvestrepolylib-5.22.5.orig/include/Makefile.in0000644000175000017500000004135111341231332020565 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = include DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir ETAGS = etags CTAGS = ctags DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ SUBDIRS = polylib all: all-recursive .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu include/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu include/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done check-am: all-am check: check-recursive all-am: Makefile installdirs: installdirs-recursive installdirs-am: install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-recursive -rm -f Makefile distclean-am: clean-am distclean-generic distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \ install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am check check-am clean clean-generic clean-libtool \ ctags ctags-recursive distclean distclean-generic \ distclean-libtool distclean-tags distdir dvi dvi-am html \ html-am info info-am install install-am install-data \ install-data-am install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-man install-pdf install-pdf-am \ install-ps install-ps-am install-strip installcheck \ installcheck-am installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/include/polylib/0000755000175000017500000000000011341243117020172 5ustar sylvestresylvestrepolylib-5.22.5.orig/include/polylib/eval_ehrhart.h0000644000175000017500000000200211341227526023007 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _eval_ehrhart_H_ #define _eval_ehrhart_H_ #if defined(__cplusplus) extern "C" { #endif extern double compute_evalue ( evalue *e, Value *list_args ); extern Value *compute_poly (Enumeration *en, Value *list_args); extern int in_domain(Polyhedron *P, Value *list_args); #if defined(__cplusplus) } #endif #endif /* _eval_ehrhart_H_ */ polylib-5.22.5.orig/include/polylib/polylib32.h0000644000175000017500000000133511341227527022173 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #define POLYLIB_BITS 32 #include polylib-5.22.5.orig/include/polylib/errormsg.h0000644000175000017500000000161211341227526022211 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _errormsg_H_ #define _errormsg_H_ #if defined(__cplusplus) extern "C" { #endif extern void errormsg1(const char *f, const char *msgname, const char *msg); #if defined(__cplusplus) } #endif #endif /* _errormsg_H_ */ polylib-5.22.5.orig/include/polylib/Makefile.in0000644000175000017500000003456411341231332022247 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = include/polylib DIST_COMMON = $(polyinclude_HEADERS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(srcdir)/polylib.h.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = polylib.h CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__installdirs = "$(DESTDIR)$(polyincludedir)" HEADERS = $(polyinclude_HEADERS) ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ polyincludedir = @includedir@/polylib polyinclude_HEADERS = \ Lattice.h \ Matop.h \ NormalForms.h \ SolveDio.h \ Zpolyhedron.h \ alpha.h \ arithmetique.h \ arithmetic_errors.h \ compress_parms.h \ ehrhart.h \ errormsg.h \ eval_ehrhart.h \ ext_ehrhart.h \ homogenization.h \ matrix.h \ matrix_addon.h \ matrix_permutations.h \ param.h \ polyhedron.h \ polylib.h \ polylib32.h \ polylib64.h \ polylibgmp.h \ polyparam.h \ ranking.h \ types.h \ vector.h poly_arith = $(top_srcdir)/source/arith all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu include/polylib/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu include/polylib/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): polylib.h: $(top_builddir)/config.status $(srcdir)/polylib.h.in cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs install-polyincludeHEADERS: $(polyinclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(polyincludedir)" || $(MKDIR_P) "$(DESTDIR)$(polyincludedir)" @list='$(polyinclude_HEADERS)'; test -n "$(polyincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(polyincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(polyincludedir)" || exit $$?; \ done uninstall-polyincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(polyinclude_HEADERS)'; test -n "$(polyincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ test -n "$$files" || exit 0; \ echo " ( cd '$(DESTDIR)$(polyincludedir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(polyincludedir)" && rm -f $$files ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(HEADERS) installdirs: for dir in "$(DESTDIR)$(polyincludedir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-polyincludeHEADERS install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-polyincludeHEADERS .MAKE: install-am install-strip .PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \ clean-libtool ctags distclean distclean-generic \ distclean-libtool distclean-tags distdir dvi dvi-am html \ html-am info info-am install install-am install-data \ install-data-am install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-man install-pdf install-pdf-am \ install-polyincludeHEADERS install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags uninstall uninstall-am uninstall-polyincludeHEADERS arithmetic_errors.h:$(poly_arith)/arithmetic_errors.h rm -f $@ $(LN_S) $(poly_arith)/arithmetic_errors.h $@ arithmetique.h:$(poly_arith)/arithmetique.h rm -f $@ $(LN_S) $(poly_arith)/arithmetique.h $@ # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/include/polylib/Zpolyhedron.h0000755000175000017500000000364311341227526022677 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _Zpolyhedron_h_ #define _Zpolyhedron_h_ #if defined(__cplusplus) extern "C" { #endif extern void CanonicalForm(ZPolyhedron *Zpol, ZPolyhedron **Result, Matrix **Basis); extern ZPolyhedron *EmptyZPolyhedron (int dimension); extern ZPolyhedron *IntegraliseLattice (ZPolyhedron *A); extern Bool isEmptyZPolyhedron (ZPolyhedron *Zpol); extern ZPolyhedron *ZDomainDifference (ZPolyhedron *A, ZPolyhedron *B); extern ZPolyhedron *ZDomainImage ( ZPolyhedron *A, Matrix *Func ); extern Bool ZDomainIncludes ( ZPolyhedron *A, ZPolyhedron *B ); extern ZPolyhedron *ZDomainIntersection ( ZPolyhedron *A, ZPolyhedron *B ); extern ZPolyhedron *ZDomainPreimage ( ZPolyhedron *A, Matrix *Func ); extern void ZDomainPrint(FILE *fp, const char *format, ZPolyhedron *A); extern ZPolyhedron *ZDomainSimplify ( ZPolyhedron *ZDom ); extern ZPolyhedron *ZDomainUnion ( ZPolyhedron *A, ZPolyhedron *B ); extern ZPolyhedron *ZDomain_Copy ( ZPolyhedron *Head ); extern void ZDomain_Free ( ZPolyhedron *Head ); extern Bool ZPolyhedronIncludes ( ZPolyhedron *A, ZPolyhedron *B ); extern ZPolyhedron *ZPolyhedron_Alloc ( Lattice *Lat, Polyhedron *Poly ); extern ZPolyhedron *SplitZpolyhedron(ZPolyhedron *ZPol, Lattice *B); #if defined(__cplusplus) } #endif #endif /* _Zpolyhedron_h_ */ polylib-5.22.5.orig/include/polylib/arithmetique.h0000644000175000017500000006512011341227527023057 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* header file built by cproto */ #ifndef arithmetique_header_included #define arithmetique_header_included /** package arithmetique * * $Id: arithmetique.h,v 1.24 2007/02/22 09:16:57 skimo Exp $ * * Francois Irigoin, mai 1989 * * Modifications * - rewrite of DIVIDE which was wrong (Remi Triolet, Francois Irigoin, * april 90) * - simplification of POSITIVE_DIVIDE by suppressing one modulo * - B.Meister : added addmul, operation existing in gmp and quite useful * (05-2005) */ /* We would like linear to be generic about the "integer" type used * to represent integer values. Thus Value is defined here. It should * be changed to "int" "long" or "long long". In an ideal world, * any source modification should be limited to this package. * * Indeed, we cannot switch easily to bignums that need constructors * dans destructors... That would lead to too many modifications... * C++ would make things easier and cleaner... * * Fabien COELHO */ #include #include /* Included for getting constants: INT_MAX, etc.. */ #ifdef GNUMP #include #include #include #ifndef mp_get_memory_functions #if defined(__cplusplus) extern "C" { #endif void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)); #if defined(__cplusplus) } #endif #endif #endif #ifdef CLN #include #define WANT_OBFUSCATING_OPERATORS #include #endif /* # #### # # #### # #### # # #### # # # ## # # # # # # ## # # # # # # # # # # # # # # # # # # # # # # # # ### # # # # # # # ### # # # # ## # # # # # # ## # # ###### #### # # #### ###### #### # # #### */ /* * Constants like LONG_LONG_MAX are not defined with ansi options, so they are * defined here. */ #ifndef LONG_LONG_MAX /* would fix on solaris: * #define LONG_LONG_MAX LLONG_MAX * #define LONG_LONG_MIN LLONG_MIN */ #ifndef __LONG_LONG_MAX__ #define __LONG_LONG_MAX__ 9223372036854775807LL #endif #undef LONG_LONG_MAX #define LONG_LONG_MAX __LONG_LONG_MAX__ #undef LONG_LONG_MIN #define LONG_LONG_MIN (-LONG_LONG_MAX-1) #undef ULONG_LONG_MAX #define ULONG_LONG_MAX (LONG_LONG_MAX * 2ULL + 1) #endif #if defined(LINEAR_VALUE_IS_LONGLONG) #define LINEAR_VALUE_STRING "long long int" typedef long long int Value; #if defined(WIN32) && !defined(unix) /* Mingw or Windows need an incompatible format string. */ # define VALUE_FMT "%I64d" #else # define VALUE_FMT "%lld" #endif #define VALUE_CONST(val) (val##LL) /* * CAUTION! 'VALUE_MIN' is defined as 'LONG_LONG_MIN +1' so as to preserve the * symmetry (-min==max) and to have a NAN value. FC */ #define VALUE_NAN LONG_LONG_MIN #define VALUE_MIN (LONG_LONG_MIN+1LL) #define VALUE_MAX LONG_LONG_MAX #define VALUE_SQRT_MIN long_to_value(LONG_MIN) #define VALUE_SQRT_MAX long_to_value(LONG_MAX) #define VALUE_ZERO (0LL) #define VALUE_ONE (1LL) #define VALUE_MONE (-1LL) #define VALUE_TO_LONG(val) \ ((long)((val)>(Value)LONG_MIN&&(val)<=(Value)LONG_MAX)?\ (val):(THROW(overflow_error), LONG_MIN)) #define VALUE_TO_INT(val) \ ((int)((val)>(Value)INT_MIN&&(val)<=(Value)INT_MAX)?\ (val):(THROW(overflow_error), INT_MIN)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* #define VALUE_TO_FLOAT(val) ((float)(val)): Doesn't seem to work with gcc */ #define VALUE_TO_FLOAT(val) ((float)((int)(val))) /* end LINEAR_VALUE_IS_LONGLONG */ /* # #### # # #### # # # ## # # # # # # # # # # # # # # # # # ### # # # # ## # # ###### #### # # #### */ #elif defined(LINEAR_VALUE_IS_LONG) #define LINEAR_VALUE_STRING "long int" typedef long Value; #define VALUE_FMT "%ld" #define VALUE_CONST(val) (val##L) #define VALUE_NAN LONG_MIN #define VALUE_MIN (LONG_MIN+1L) #define VALUE_MAX LONG_MAX #define VALUE_SQRT_MIN int_to_value(INT_MIN) #define VALUE_SQRT_MAX int_to_value(INT_MAX) #define VALUE_ZERO 0L #define VALUE_ONE 1L #define VALUE_MONE -1L #define VALUE_TO_LONG(val) (val) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* end LINEAR_VALUE_IS_LONG */ /* ###### # #### ## ##### # # # # # # # ##### # # # # # # # # # # ###### # # # # # # # # # ###### #### # # # */ /* #elif defined(LINEAR_VALUE_IS_FLOAT) #define LINEAR_VALUE_STRING "float" typedef float Value; #define VALUE_FMT "%f" #define VALUE_CONST(val) (val) #define VALUE_MIN FLOAT_MIN #define VALUE_MAX FLOAT_MAX #define VALUE_ZERO 0.0 #define VALUE_ONE 1.0 #define VALUE_MONE -1.0 #define VALUE_TO_LONG(val) ((long)(val)) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) */ /* end LINEAR_VALUE_IS_FLOAT */ /* #### # # ## ##### # # # # # # # # # # # # # ###### # # # # ####### # # # ###### ##### # # # # # # # # # # # # #### # # # # # # */ /* Char version is used to detect invalid assignments */ #elif defined(LINEAR_VALUE_IS_CHARS) #define LINEAR_VALUE_STRING "char" typedef union { char *s; long l; int i; float f; double d;} Value; #define VALUE_FMT "%s" #define VALUE_CONST(val) ((Value)(val)) #define VALUE_NAN ((Value)(long)0xdadeebee) #define VALUE_MIN ((Value)(long)0xdeadbeef) #define VALUE_MAX ((Value)(long)0xfeedabee) #define VALUE_ZERO ((Value)0) #define VALUE_ONE ((Value)1) #define VALUE_MONE ((Value)-1) #define VALUE_TO_LONG(val) (val.l) #define VALUE_TO_INT(val) (val.i) #define VALUE_TO_FLOAT(val) (val.f) #define VALUE_TO_DOUBLE(val) (val.d) /* end LINEAR_VALUE_IS_CHARS */ /* # # # ##### # ## # # # # # # # # # # # # # # ## # # # # # */ #elif defined(LINEAR_VALUE_IS_INT) #define LINEAR_VALUE_STRING "int" typedef int Value; #define VALUE_FMT "%d" #define VALUE_CONST(val) (val) #define VALUE_NAN INT_MIN #define VALUE_MIN (INT_MIN+1) #define VALUE_MAX INT_MAX #define VALUE_ZERO 0 #define VALUE_ONE 1 #define VALUE_MONE -1 #define VALUE_TO_LONG(val) ((long)(val)) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* end LINEAR_VALUE_IS_INT */ #elif defined(GNUMP) #define LINEAR_VALUE_STRING "gmp" typedef mpz_t Value; #define VALUE_FMT "%s" /* don't use these, use value_set_si instead ! */ #undef VALUE_ZERO #undef VALUE_ONE #undef VALUE_MONE #define VALUE_TO_LONG(val) (mpz_get_si(val)) #define VALUE_TO_INT(val) ((int)mpz_get_si(val)) #define VALUE_TO_FLOAT(val) ((float)((int)mpz_get_si(val))) #define VALUE_TO_DOUBLE(val) (mpz_get_d(val)) #elif defined(CLN) #define LINEAR_VALUE_STRING "cln" typedef cln::cl_I Value; #define VALUE_FMT "%s" #define VALUE_TO_INT(val) (cln::cl_I_to_int(val)) #define VALUE_TO_DOUBLE(val) (cln::double_approx(val)) #endif /* ***************** MACROS FOR MANIPULATING VALUES ******************** */ #if defined(CLN) #define value_init(val) ((val).word = ((cln::cl_uint)cl_FN_tag) << cl_tag_shift) #define value_assign(v1,v2) ((v1) = (v2)) #define value_set_si(val,i) ((val) = (i)) #define value_set_double(val,d) ((val) = cln::truncate1(cln::cl_R(d))) #define value_clear(val) ((val) = 0) #define value_read(val,str) ((val) = (str)) #define value_print(Dst,fmt,val) {std::ostringstream strm; strm << val; \ fprintf((Dst),(fmt),strm.str().c_str()); \ } #define value_swap(v1,v2) {Value tmp; tmp = v2; \ v2 = v1; v1 = tmp; \ } /* Boolean operators on 'Value' */ #define value_eq(v1,v2) ((v1)==(v2)) #define value_ne(v1,v2) ((v1)!=(v2)) #define value_gt(v1,v2) ((v1)>(v2)) #define value_ge(v1,v2) ((v1)>=(v2)) #define value_lt(v1,v2) ((v1)<(v2)) #define value_le(v1,v2) ((v1)<=(v2)) #define value_abs_eq(v1,v2) (cln::abs(v1)==cln::abs(v2)) #define value_abs_ne(v1,v2) (cln::abs(v1)!=cln::abs(v2)) #define value_abs_gt(v1,v2) (cln::abs(v1)>cln::abs(v2)) #define value_abs_ge(v1,v2) (cln::abs(v1)>=cln::abs(v2)) #define value_abs_lt(v1,v2) (cln::abs(v1) 0) #define value_neg_p(val) ((val) < 0) #define value_posz_p(val) ((val) >= 0) #define value_negz_p(val) ((val) <= 0) #define value_zero_p(val) ((val) == 0) #define value_notzero_p(val) ((val) != 0) #define value_one_p(val) ((val) == 1) #define value_notone_p(val) ((val) != 1) #define value_mone_p(val) ((val) == -1) #define value_notmone_p(val) ((val) != -1) #define value_cmp_si(val, n) (cln::compare(val,n)) #elif defined(GNUMP) /* Basic macros */ #define value_init(val) (mpz_init((val))) #define value_assign(v1,v2) (mpz_set((v1),(v2))) #define value_set_si(val,i) (mpz_set_si((val),(i))) #define value_set_double(val,d)(mpz_set_d((val),(d))) #define value_clear(val) (mpz_clear((val))) #define value_read(val,str) (mpz_set_str((val),(str),10)) typedef void (*value_print_gmp_free_t)(void *, size_t); #define value_print(Dst,fmt,val) {char *str; \ value_print_gmp_free_t gmp_free; \ str = mpz_get_str(0,10,(val)); \ fprintf((Dst),(fmt),str); \ mp_get_memory_functions(NULL, NULL, &gmp_free); \ (*gmp_free) (str, strlen(str)+1); \ } #define value_swap(val1,val2) (mpz_swap(val1, val2)) /* Boolean operators on 'Value' */ #define value_eq(v1,v2) (mpz_cmp((v1),(v2)) == 0) #define value_ne(v1,v2) (mpz_cmp((v1),(v2)) != 0) #define value_gt(v1,v2) (mpz_cmp((v1),(v2)) > 0) #define value_ge(v1,v2) (mpz_cmp((v1),(v2)) >= 0) #define value_lt(v1,v2) (mpz_cmp((v1),(v2)) < 0) #define value_le(v1,v2) (mpz_cmp((v1),(v2)) <= 0) #define value_abs_eq(v1,v2) (mpz_cmpabs((v1),(v2)) == 0) #define value_abs_ne(v1,v2) (mpz_cmpabs((v1),(v2)) != 0) #define value_abs_gt(v1,v2) (mpz_cmpabs((v1),(v2)) > 0) #define value_abs_ge(v1,v2) (mpz_cmpabs((v1),(v2)) >= 0) #define value_abs_lt(v1,v2) (mpz_cmpabs((v1),(v2)) < 0) #define value_abs_le(v1,v2) (mpz_cmpabs((v1),(v2)) <= 0) /* Trian operators on 'Value' */ #define value_sign(val) (mpz_sgn(val)) #define value_compare(v1,v2) (mpz_cmp((v1),(v2))) /* Binary operations on 'Value' */ #define value_addto(ref,val1,val2) (mpz_add((ref),(val1),(val2))) #define value_add_int(ref,val,vint) (mpz_add_ui((ref),(val),(long)(vint))) #define value_addmul(ref, val1, val2) (mpz_addmul((ref), (val1), (val2))) #define value_increment(ref,val) (mpz_add_ui((ref),(val),1)) #define value_multiply(ref,val1,val2) (mpz_mul((ref),(val1),(val2))) #define value_subtract(ref,val1,val2) (mpz_sub((ref),(val1),(val2))) #define value_sub_int(ref,val,vint) (mpz_sub_ui((ref),(val),(long)(vint))) #define value_decrement(ref,val) (mpz_sub_ui((ref),(val),1)) #define value_division(ref,val1,val2) (mpz_tdiv_q((ref),(val1),(val2))) #define value_divexact(ref,val1,val2) (mpz_divexact((ref),(val1),(val2))) #define value_modulus(ref,val1,val2) (mpz_tdiv_r((ref),(val1),(val2))) #define value_pdivision(ref,val1,val2) (mpz_fdiv_q((ref),(val1),(val2))) #define value_pmodulus(ref,val1,val2) (mpz_fdiv_r((ref),(val1),(val2))) #define value_oppose(ref,val) (mpz_neg((ref),(val))) #define value_absolute(ref,val) (mpz_abs((ref),(val))) #define value_minimum(ref,val1,val2) (value_le((val1),(val2)) ? \ mpz_set((ref),(val1)) : \ mpz_set((ref),(val2))) #define value_maximum(ref,val1,val2) (value_ge((val1),(val2)) ? \ mpz_set((ref),(val1)) : \ mpz_set((ref),(val2))) #define value_gcd(ref,val1,val2) (mpz_gcd(ref,val1,val2)) #define value_lcm(ref,val1,val2) (mpz_lcm(ref,val1,val2)) #define value_orto(ref,val1,val2) (mpz_ior((ref),(val1),(val2))) #define value_andto(ref,val1,val2) (mpz_and((ref),(val1),(val2))) /* Conditional operations on 'Value' */ #define value_pos_p(val) (mpz_sgn(val) > 0) #define value_neg_p(val) (mpz_sgn(val) < 0) #define value_posz_p(val) (mpz_sgn(val) >= 0) #define value_negz_p(val) (mpz_sgn(val) <= 0) #define value_zero_p(val) (mpz_sgn(val) == 0) #define value_notzero_p(val) (mpz_sgn(val) != 0) #define value_one_p(val) (mpz_cmp_si(val,1) == 0) #define value_notone_p(val) (mpz_cmp_si(val,1) != 0) #define value_mone_p(val) (mpz_cmp_si(val,-1) ==0) #define value_notmone_p(val) (mpz_cmp_si(val,-1) !=0) #define value_cmp_si(val, n) (mpz_cmp_si(val,n)) /* ************************************************************************* */ #else /* 'Value' set to longlong|long|float|char *|int */ /* Basic Macros */ #define value_init(val) ((val) = 0) #define value_assign(v1,v2) ((v1) = (v2)) #define value_set_si(val,i) ((val) = (Value)(i)) #define value_set_double(val,d) ((val) = (Value)(d)) #define value_clear(val) ((val) = 0) #define value_read(val,str) (sscanf((str),VALUE_FMT,&(val))) #define value_print(Dst,fmt,val) (fprintf((Dst),(fmt),(val))) #define value_swap(v1,v2) {Value tmp; tmp = v2; \ v2 = v1; v1 = tmp; \ } /* Cast to 'Value' */ #define int_to_value(i) ((Value)(i)) #define long_to_value(l) ((Value)(l)) #define float_to_value(f) ((Value)(f)) #define double_to_value(d) ((Value)(d)) /* Boolean operators on 'Value' */ #define value_eq(v1,v2) ((v1)==(v2)) #define value_ne(v1,v2) ((v1)!=(v2)) #define value_gt(v1,v2) ((v1)>(v2)) #define value_ge(v1,v2) ((v1)>=(v2)) #define value_lt(v1,v2) ((v1)<(v2)) #define value_le(v1,v2) ((v1)<=(v2)) #define value_abs_eq(v1,v2) (value_abs(v1)==value_abs(v2)) #define value_abs_ne(v1,v2) (value_abs(v1)!=value_abs(v2)) #define value_abs_gt(v1,v2) (value_abs(v1)>value_abs(v2)) #define value_abs_ge(v1,v2) (value_abs(v1)>=value_abs(v2)) #define value_abs_lt(v1,v2) (value_abs(v1)>(v2)) /* Binary operations on 'Value' */ #define value_addto(ref,val1,val2) ((ref) = (val1)+(val2)) #define value_add_int(ref,val,vint) ((ref) = (val)+(Value)(vint)) #define value_addmul(ref, val1, val2) ((ref) += (val1)*(val2)) #define value_increment(ref,val) ((ref) = (val)+VALUE_ONE) #define value_direct_product(ref,val1,val2) ((ref) = (val1)*(val2)) /* direct! */ #define value_multiply(ref,val1,val2) ((ref) = value_mult((val1),(val2))) #define value_subtract(ref,val1,val2) ((ref) = (val1)-(val2)) #define value_sub_int(ref,val,vint) ((ref) = (val)-(Value)(vint)) #define value_decrement(ref,val) ((ref) = (val)-VALUE_ONE) #define value_division(ref,val1,val2) ((ref) = (val1)/(val2)) #define value_divexact(ref,val1,val2) ((ref) = (val1)/(val2)) #define value_modulus(ref,val1,val2) ((ref) = (val1)%(val2)) #define value_pdivision(ref,val1,val2) ((ref) = value_pdiv((val1),(val2))) #define value_pmodulus(ref,val1,val2) ((ref) = value_pmod((val1),(val2))) #define value_oppose(ref,val) ((ref) = value_uminus((val))) #define value_absolute(ref,val) ((ref) = value_abs((val))) #define value_minimum(ref,val1,val2) ((ref) = value_min((val1),(val2))) #define value_maximum(ref,val1,val2) ((ref) = value_max((val1),(val2))) #define value_gcd(ref,val1,val2) Gcd((val1),(val2),&(ref)) #define value_lcm(ref,val1,val2) Lcm3((val1),(val2),&(ref)) #define value_orto(ref,val1,val2) ((ref) = (val1)|(val2)) #define value_andto(ref,val1,val2) ((ref) = (val1)&(val2)) /* Unary operators on 'Value' */ #define value_uminus(val) (-(val)) #define value_not(val) (~(val)) #define value_abs(val) (value_posz_p(val)? \ (val) : \ (value_ne((val), VALUE_NAN) ? \ value_uminus(val) : \ (THROW (overflow_error), VALUE_NAN ))) /* Conditional operations on 'Value' */ #define value_pos_p(val) value_gt(val,VALUE_ZERO) #define value_neg_p(val) value_lt(val,VALUE_ZERO) #define value_posz_p(val) value_ge(val,VALUE_ZERO) #define value_negz_p(val) value_le(val,VALUE_ZERO) #define value_zero_p(val) value_eq(val,VALUE_ZERO) #define value_notzero_p(val) value_ne(val,VALUE_ZERO) #define value_one_p(val) value_eq(val,VALUE_ONE) #define value_notone_p(val) value_ne(val,VALUE_ONE) #define value_mone_p(val) value_eq(val,VALUE_MONE) #define value_notmone_p(val) value_ne(val,VALUE_MONE) #define value_cmp_si(val, n) (val - (n)) #define value_min_p(val) value_eq(val,VALUE_MIN) #define value_max_p(val) value_eq(val,VALUE_MAX) #define value_notmin_p(val) value_ne(val,VALUE_MIN) #define value_notmax_p(val) value_ne(val,VALUE_MAX) #endif /* 'Value' set to |longlong|long|float|char *|int */ /* *********************** PROTECTED MULTIPLICATION ********************** */ #include "arithmetic_errors.h" /* (|v| < MAX / |w|) => v*w is okay * I could check ((v*w)/w)==v but a tmp would be useful */ #define value_protected_hard_idiv_multiply(v,w,throw) \ ((value_zero_p(w) || value_zero_p(v))? VALUE_ZERO: \ value_lt(value_abs(v),value_div(VALUE_MAX,value_abs(w)))? \ value_direct_multiply(v,w): (throw, VALUE_NAN)) /* is a software idiv is assumed, quick check performed first */ #if defined(LINEAR_VALUE_ASSUME_SOFTWARE_IDIV) #define value_protected_multiply(v,w,throw) \ ((value_le(v,VALUE_SQRT_MAX) && value_le(w,VALUE_SQRT_MAX) && \ value_ge(v,VALUE_SQRT_MIN) && value_ge(w,VALUE_SQRT_MIN))? \ value_direct_multiply(v,w): value_protected_hard_idiv_multiply(v,w,throw)) #else #define value_protected_multiply(v,w,throw) \ value_protected_hard_idiv_multiply(v,w,throw) #endif /* protected versions */ #define value_protected_mult(v,w) \ value_protected_multiply(v,w,THROW(overflow_error)) #define value_protected_product(v,w) \ v=value_protected_mult(v,w) /* whether the default is protected or not * this define makes no sense any more... well, doesn't matter. FC. */ #if defined(LINEAR_VALUE_PROTECT_MULTIPLY) #define value_mult(v,w) value_protected_mult(v,w) #define value_product(v,w) value_protected_product(v,w) #else /* I do enforce the protection whatever requested:-) * prints out a message and throws the exception, hoping * that some valid CATCH waits for it upwards. */ #define value_mult(v,w) \ value_protected_multiply(v,w, \ (fprintf(stderr,"[value_mult] value overflow!\n"),THROW(overflow_error))) #define value_product(v,w) v=value_mult(v,w) /* was: * #define value_mult(v,w) value_direct_multiply(v,w) * #define value_product(v,w) value_direct_product(v,w) * could be: protected versions... */ #endif /******************************************************* STATIC VALUE DEBUG */ /* LINEAR_VALUE_IS_CHARS is used for type checking. * some operations are not allowed on (char*), thus * they are switched to some other operation here... */ #if defined(LINEAR_VALUE_IS_CHARS) #define value_fake_binary(v1,v2) ((Value)((v1).i+(v2).i)) #define value_bool_binary(v1,v2) ((int)((v1).i+(v2).i)) #undef float_to_value #define float_to_value(f) ((Value)f) #undef double_to_value #define double_to_value(f) ((Value)f) #undef value_uminus #define value_uminus(v) (v) #undef value_mult #define value_mult(v1,v2) value_fake_binary(v1,v2) #undef value_mod #define value_mod(v1,v2) value_fake_binary(v1,v2) #undef value_ge #define value_ge(v1,v2) value_bool_binary(v1,v2) #undef value_gt #define value_gt(v1,v2) value_bool_binary(v1,v2) #undef value_le #define value_le(v1,v2) value_bool_binary(v1,v2) #undef value_lt #define value_lt(v1,v2) value_bool_binary(v1,v2) #undef value_ne #define value_ne(v1,v2) value_bool_binary(v1,v2) #undef value_eq #define value_eq(v1,v2) value_bool_binary(v1,v2) #undef value_plus #define value_plus(v1,v2) value_fake_binary(v1,v2) #undef value_minus #define value_minus(v1,v2) value_fake_binary(v1,v2) #undef value_pdiv #define value_pdiv(v1,v2) value_fake_binary(v1,v2) #undef value_div #define value_div(v1,v2) value_fake_binary(v1,v2) #undef value_mod #define value_mod(v1,v2) value_fake_binary(v1,v2) #undef value_addto #define value_addto(v1,v2) value_assign(v1,value_plus(v1,v2)) #undef value_subtract #define value_subtract(v1,v2) value_addto(v1,v2) #undef value_product #define value_product(v1,v2) value_addto(v1,v2) #undef value_modulus #define value_modulus(v1,v2) value_addto(v1,v2) #undef value_division #define value_division(v1,v2) value_addto(v1,v2) #undef value_divexact #define value_divexact(v1,v2) value_addto(v1,v2) #undef value_increment #define value_increment(v) value_addto(v,VALUE_ONE) #undef value_decrement #define value_decrement(v) value_addto(v,VALUE_MONE) #undef value_orto #define value_orto(ref,val) value_addto(v1,v2) #undef value_andto #define value_andto(ref,val) value_addto(v1,v2) #undef value_or #define value_or(v1,v2) value_fake_binary(v1,v2) #undef value_and #define value_and(v1,v2) value_fake_binary(v1,v2) #undef value_lshift #define value_lshift(v1,v2) value_fake_binary(v1,v2) #undef value_rshift #define value_rshift(v1,v2) value_fake_binary(v1,v2) #endif /* for backward compatibility */ #define value_substract(ref,val1,val2) (value_subtract((ref),(val1),(val2))) /* valeur absolue */ #ifndef ABS #define ABS(x) (((x)>=0) ? (x) : -(x)) #endif /* minimum et maximum * if they are defined somewhere else, they are very likely * to be defined the same way. Thus the previous def is not overwritten. */ #ifndef MIN #define MIN(x,y) (((x)>=(y))?(y):(x)) #endif #ifndef MAX #define MAX(x,y) (((x)>=(y))?(x):(y)) #endif /* signe d'un entier: -1, 0 ou 1 */ #define SIGN(x) (((x)>0)? 1 : ((x)==0? 0 : -1)) /* division avec reste toujours positif * basee sur les equations: * a/(-b) = - (a/b) * (-a)/b = - ((a+b-1)/b) * ou a et b sont des entiers positifs */ #define DIVIDE(x,y) ((y)>0? POSITIVE_DIVIDE(x,y) : \ -POSITIVE_DIVIDE((x),(-(y)))) /* division avec reste toujours positif quand y est positif: assert(y>=0) */ #define POSITIVE_DIVIDE(x,y) ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y)) /* modulo a resultat toujours positif */ #define MODULO(x,y) ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y)) /* modulo par rapport a un nombre positif: assert(y>=0) * * Ce n'est pas la macro la plus efficace que j'aie jamais ecrite: il faut * faire, dans le pire des cas, deux appels a la routine .rem, qui n'est * surement pas plus cablee que la division ou la multiplication */ #define POSITIVE_MODULO(x,y) ((x) > 0 ? (x)%(y) : \ ((x)%(y) == 0 ? 0 : ((y)-(-(x))%(y)))) /* errors.c */ extern unsigned int overflow_error; extern unsigned int simplex_arithmetic_error; extern unsigned int user_exception_error; extern unsigned int parser_exception_error; extern unsigned int any_exception_error; extern unsigned int the_last_just_thrown_exception; extern void dump_exception_stack_to_file(FILE * /*f*/); extern void dump_exception_stack(void); extern jmp_buf *push_exception_on_stack(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); extern void pop_exception_from_stack(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); extern void throw_exception(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); #endif /* arithmetique_header_included */ polylib-5.22.5.orig/include/polylib/polylib.h.in0000644000175000017500000000243011035141341022415 0ustar sylvestresylvestre/* * polylib.h V4.12 */ /* WARNING: you should not include directly this file, but use polylib32.h or polylib64.h (for 32 or 64 bits integers). */ #if POLYLIB_BITS == 32 @polylib32_defs@ #elif POLYLIB_BITS == 64 @polylib64_defs@ #endif #if ! defined(LINEAR_VALUE_IS_LONGLONG) \ && ! defined(LINEAR_VALUE_IS_LONG) \ && ! defined(LINEAR_VALUE_IS_INT) \ && ! defined(LINEAR_VALUE_IS_CHARS) \ && ! defined(GNUMP) \ && ! defined(CLN) #error Please define LINEAR_VALUE_IS_* or #include polylib32.h or polylib64.h #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* added for Ehrhart polynomial approximation + bounds */ #include #include #include #ifdef GNUMP #include #endif polylib-5.22.5.orig/include/polylib/ranking.h0000644000175000017500000000567211341227527022015 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * Tools to compute the ranking function of an iteration J: the number of * integer points in P that are lexicographically inferior to J * @author B. Meister * 6/2005 * LSIIT-ICPS, UMR 7005 CNRS Universite Louis Pasteur * HiPEAC Network */ #ifndef __BM_POLYLIB_RANKING_H__ #define __BM_POLYLIB_RANKING_H__ #include /* * Returns a list of polytopes needed to compute * the number of points in P that are lexicographically * smaller than a given point in D. * Only the first dim dimensions are taken into account * for computing the lexsmaller relation. * The remaining variables are assumed to be extra * existential/control variables. * When P == D, this is the conventional ranking function. * P and D are assumed to have the same parameter domain C. * * The first polyhedron in the list returned is the * updated context: a combination of D and C or an extended C. * * The order of the variables in the remaining polyhedra is * - first dim variables of P * - existential variables of P * - existential variables of D * - first dim variables of D * - the parameters */ Polyhedron *LexSmaller(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS); /* * Returns the number of points in P that are lexicographically * smaller than a given point in D. * Only the first dim dimensions are taken into account * for computing the lexsmaller relation. * The remaining variables are assumed to be extra * existential/control variables. * When P == D, this is the conventional ranking function. * P and D are assumed to have the same parameter domain C. * The variables in the Enumeration correspond to the first dim variables * in D followed by the parameters of D (the variables of C). */ Enumeration *Polyhedron_LexSmallerEnumerate(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS); /* * Returns a function that assigns a unique number to each point in the * polytope P ranging from zero to (number of points in P)-1. * The order of the numbers corresponds to the lexicographical order. * * C is the parameter context of the polytope */ Enumeration *Polyhedron_Ranking(Polyhedron *P, Polyhedron *C, unsigned MAXRAYS); #endif /* __BM_POLYLIB_RANKING_H__ */ polylib-5.22.5.orig/include/polylib/polylib.h0000644000175000017500000000252511341243100022011 0ustar sylvestresylvestre/* * polylib.h V4.12 */ /* WARNING: you should not include directly this file, but use polylib32.h or polylib64.h (for 32 or 64 bits integers). */ #if POLYLIB_BITS == 32 #define LINEAR_VALUE_IS_INT #elif POLYLIB_BITS == 64 #define LINEAR_VALUE_IS_LONG #define LINEAR_VALUE_PROTECT_MULTIPLY #endif #if ! defined(LINEAR_VALUE_IS_LONGLONG) \ && ! defined(LINEAR_VALUE_IS_LONG) \ && ! defined(LINEAR_VALUE_IS_INT) \ && ! defined(LINEAR_VALUE_IS_CHARS) \ && ! defined(GNUMP) \ && ! defined(CLN) #error Please define LINEAR_VALUE_IS_* or #include polylib32.h or polylib64.h #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* added for Ehrhart polynomial approximation + bounds */ #include #include #include #ifdef GNUMP #include #endif polylib-5.22.5.orig/include/polylib/polylib64.h0000644000175000017500000000133511341227527022200 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #define POLYLIB_BITS 64 #include polylib-5.22.5.orig/include/polylib/ext_ehrhart.h0000644000175000017500000000160011341227526022663 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _EXT_EHRHART_H_ #define _EXT_EHRHART_H_ extern Enumeration *Domain_Enumerate(Polyhedron *D, Polyhedron *C, unsigned MAXRAYS, const char **pn); extern void new_eadd (evalue *e1,evalue *res); #endif polylib-5.22.5.orig/include/polylib/alpha.h0000644000175000017500000000244311341227526021441 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _alpha_h_ #define _alpha_h_ #if defined(__cplusplus) extern "C" { #endif extern int GaussSimplify ( Matrix *M, Matrix *M2 ); extern int PolyhedronLTQ ( Polyhedron *P1, Polyhedron *P2, int INDEX, int PDIM, int MAXRAYS ); extern int PolyhedronTSort ( Polyhedron ** L, unsigned int n, unsigned int index, unsigned int pdim, int * time, int * pvect, unsigned int MAXRAYS ); extern int Polyhedron_Not_Empty ( Polyhedron *P, Polyhedron *C, int MAXRAYS ); #if defined(__cplusplus) } #endif #endif /* _alpha_h_ */ polylib-5.22.5.orig/include/polylib/Lattice.h0000755000175000017500000000432111341227526021741 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _Lattice_h_ #define _Lattice_h_ #if defined(__cplusplus) extern "C" { #endif extern void AffineHermite ( Lattice *A, Lattice **H, Matrix **U ); extern void AffineSmith ( Lattice *A, Lattice **U, Lattice **V, Lattice **Diag ); extern Lattice *ChangeLatticeDimension ( Lattice *A, int dimension ); extern Lattice *EmptyLattice ( int dimension ); extern Lattice *ExtractLinearPart ( Lattice *A ); extern int FindHermiteBasisofDomain ( Polyhedron *A, Matrix **B ); extern Lattice *Homogenise ( Lattice *A, Bool Forward ); extern int intcompare ( const void *a, const void *b ); extern Bool isEmptyLattice ( Lattice *A ); extern Bool isfulldim ( Matrix *m ); extern Bool IsLattice ( Matrix *m ); extern Bool isLinear ( Lattice *A ); extern LatticeUnion *LatticeDifference ( Lattice *A, Lattice *B ); extern Lattice *LatticeImage ( Lattice *A, Matrix *M ); extern Bool LatticeIncludes ( Lattice *A, Lattice *B ); extern Lattice *LatticeIntersection ( Lattice *X, Lattice *Y ); extern Lattice *LatticePreimage ( Lattice *L, Matrix *G ); extern LatticeUnion *LatticeSimplify ( LatticeUnion *latlist ); extern LatticeUnion *LatticeUnion_Alloc ( void ); extern void LatticeUnion_Free ( LatticeUnion *Head ); extern void PrintLatticeUnion ( FILE *fp, char *format, LatticeUnion *Head ); extern Bool sameAffinepart ( Lattice *A, Lattice *B ); extern Bool sameLattice ( Lattice *A, Lattice *B ); extern LatticeUnion *Lattice2LatticeUnion(Lattice *X,Lattice *Y); #if defined(__cplusplus) } #endif #endif /* _Lattice_h_ */ polylib-5.22.5.orig/include/polylib/vector.h0000644000175000017500000000577711341227527021674 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _vector_H_ #define _vector_H_ #if defined(__cplusplus) extern "C" { #endif int ConstraintSimplify(Value *old, Value *n, int len, Value* v); Value* value_alloc(int want, int *got); void value_free(Value *p, int size); extern void Factorial(int n,Value *result); extern void Binomial(int n,int p,Value *result); extern void CNP(int a,int b,Value *result); extern void Gcd(Value a,Value b,Value *result); extern int First_Non_Zero(Value *p, unsigned length); extern Vector *Vector_Alloc(unsigned length); extern void Vector_Free(Vector *vector); extern void Vector_Print(FILE *Dst, const char *Format, Vector *Vec); extern Vector *Vector_Read(void); extern void Vector_Set(Value *p,int n,unsigned length); extern void Vector_Exchange(Value *p1, Value *p2, unsigned length); extern void Vector_Copy(Value *p1, Value *p2, unsigned length); extern void Vector_Add(Value *p1,Value *p2,Value *p3,unsigned length); extern void Vector_Sub(Value *p1,Value *p2,Value *p3,unsigned length); extern void Vector_Or(Value *p1,Value *p2,Value *p3,unsigned length); extern void Vector_Scale(Value *p1, Value *p2, Value lambda, unsigned length); extern void Vector_AntiScale(Value *p1,Value *p2,Value lambda, unsigned length); extern void Vector_Oppose(Value *p1, Value *p2, unsigned length); extern void Inner_Product(Value *p1,Value *p2,unsigned length, Value *result); extern void Vector_Max(Value *p,unsigned length, Value *result); extern void Vector_Min(Value *p,unsigned length, Value *result); extern void Vector_Combine(Value *p1,Value *p2,Value *p3,Value lambda, Value mu, unsigned length); extern int Vector_Equal(Value *Vec1,Value *Vec2,unsigned n); extern void Vector_Min_Not_Zero(Value *p,unsigned length,int *index,Value *result); extern void Vector_Gcd(Value *p,unsigned length,Value *result); extern void Vector_Map(Value *p1,Value *p2,Value *p3,unsigned length, Value *(*f)(Value,Value)); extern void Vector_Normalize(Value *p,unsigned length); extern void Vector_Normalize_Positive(Value *p,int length, int pos); extern void Vector_Reduce(Value *p,unsigned length, void(*f)(Value,Value *),Value *result); extern void Vector_Sort(Value *vector,unsigned n); extern int Vector_IsZero(Value * v, unsigned length); #if defined(__cplusplus) } #endif #endif /* _vector_H_ */ polylib-5.22.5.orig/include/polylib/param.h0000644000175000017500000000164411341227527021457 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _param_H_ #define _param_H_ #if defined(__cplusplus) extern "C" { #endif extern const char **Read_ParamNames(FILE *in, int m); extern void Free_ParamNames(const char **params, int m); #if defined(__cplusplus) } #endif #endif /* _param_H_ */ polylib-5.22.5.orig/include/polylib/matrix_permutations.h0000644000175000017500000000720411341227527024473 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * Permutations on matrices * Matrices are seen either as transformations (mtransformation) or as * polyhedra (mpolyhedron or Constraints). * @author B. Meister */ #ifndef __BM_MATRIX_PERMUTATIONS_H__ #define __BM_MATRIX_PERMUTATIONS_H__ #include #include /* Permutations here are vectors that give the future position for each variable */ /* utility function : bit count */ unsigned int nb_bits(unsigned long long int x); /* gives the inverse permutation vector of a permutation vector */ unsigned int * permutation_inverse(unsigned int * perm, unsigned int nb_elems); /* * Given a linear tranformation on initial variables, and a variable * permutation, compute the tranformation for the permuted variables. perm is * a vector giving the new "position of the k^th variable, k \in [1..n] we can * call it a "permutation vector" if you wish transf[x][y] -> * permuted[permutation(x)][permutation(y)] */ Matrix * mtransformation_permute(Matrix * transf, unsigned int * permutation); /* permutes the variables of a matrix seen as a polyhedron */ Matrix * mpolyhedron_permute(Matrix * polyh, unsigned int * permutation); /* permutes the variables of a matrix seen as a polyhedron */ void Constraints_permute(Matrix * C, unsigned int * perm, Matrix ** Cp); /** Given a set of equalities, find a set of variables that can be * eliminated using these equalities. The variables that we agree to eliminate * are in a zone of contiguous variables (or parameters).

* Notes:

  • brute force, surely enhanceable algorithm
  • limited number of variables in the zone: limit = bitwidth of long long
* @param Eqs the matrix of equalities. * @param start the rank of the first variable (inclusive) of the zone in Eqs * @param end the rank of the last variable (inclusive) of the zone * return a bitfield where bits set to one define the variables to eliminate */ unsigned long long int eliminable_vars(Matrix * Eqs, unsigned start, unsigned end); /* * find a valid permutation : for a set of m equations, find m variables that * will be put at the beginning (to be eliminated) it must be possible to * eliminate these variables : the submatrix built with their columns must be * full-rank. brute force method, that tests all the combinations until finding * one which works. * LIMITATIONS : up to x-1 variables, where the long long * format is x-1 bits (often 64 in year 2005). */ unsigned int * find_a_permutation(Matrix * Eqs, unsigned int nb_parms); /* * compute the permutation of variables and parameters, according to some * variables to keep. put the variables not to be kept at the beginning, then * the parameters and finally the variables to be kept. strongly related to the * function compress_to_full_dim2 */ unsigned int * permutation_for_full_dim2(unsigned int * vars_to_keep, unsigned int nb_keep, unsigned int nb_vars_parms, unsigned int nb_parms); #endif /*__BM_MATRIX_PERMUTATIONS_H__ */ polylib-5.22.5.orig/include/polylib/matrix_addon.h0000644000175000017500000001136211341227527023026 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * Polylib matrix addons * Mainly, deals with polyhedra represented in implicit form (set of * constraints). * @author Benoit Meister */ #ifndef __BM_MATRIX_ADDON_H__ #define __BM_MATRIX_ADDON_H__ #include #include /** Shortcut for Matrix_Print */ #define show_matrix(M) { printf(#M"= \n"); \ if (M!=NULL) { \ Matrix_Print(stderr,P_VALUE_FMT,(M));} \ else {printf("\n");} \ } /** * Allocates a matrix if it is null, or else asserts that it has at least a * certain size */ #define ensureMatrix(M, r, c) { if (M==NULL) M = Matrix_Alloc(r,c); \ else assert (M->NbRows>=r && M->NbColumns>=c); \ } /* Creates a view of the constraints of a polyhedron as a Matrix * */ Matrix * constraintsView(Polyhedron * P); /* "Frees" a view of the constraints of a polyhedron */ void constraintsView_Free(Matrix * M); /* splits a matrix of constraints M into a matrix of equalities Eqs and a matrix of inequalities Ineqs allocs the new matrices. */ void split_constraints(Matrix const * M, Matrix ** Eqs, Matrix **Ineqs); /* returns the dim-dimensional identity matrix */ Matrix * Identity_Matrix(unsigned int dim); void Matrix_identity(unsigned int dim, Matrix **I); /* given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix. g is a common denominator for elements of (transf^{-1})*/ void mtransformation_inverse(Matrix * transf, Matrix ** inv, Value * g); /* simplifies a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements. */ void mpolyhedron_simplify(Matrix * polyh); /* inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra. */ void mpolyhedron_inflate(Matrix * polyh, unsigned int nb_parms); /* deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra. */ void mpolyhedron_deflate(Matrix * polyh, unsigned int nb_parms); /* use an eliminator row to eliminate a variable in a victim row (without changing the sign of the victim row -> important if it is an inequality). */ void eliminate_var_with_constr(Matrix * Eliminator, unsigned int eliminator_row, Matrix * Victim, unsigned int victim_row, unsigned int var_to_elim); /* ----- PARTIAL MAPPINGS ----- */ /* compresses the last vars/pars of the polyhedron M expressed as a polylib matrix - adresses the full-rank compressions only - modfies M */ void mpolyhedron_compress_last_vars(Matrix * M, Matrix * compression); #define Constraints_compressLastVars(a, b) mpolyhedron_compress_last_vars(a, b) /* uses a set of m equalities Eqs to eliminate m variables in the polyhedron. Ineqs represented as a matrix eliminates the m first variables - assumes that Eqs allows to eliminate the m equalities - modifies Ineqs */ unsigned int mpolyhedron_eliminate_first_variables(Matrix * Eqs, Matrix * Ineqs); #define Constraints_eliminateFirstVars(a,b) mpolyhedron_eliminate_first_variables(a,b) /** returns a contiguous submatrix of a matrix. */ void Matrix_subMatrix(Matrix * M, unsigned int sr, unsigned int sc, unsigned int nbR, unsigned int nbC, Matrix ** sub); /** * Cloning function. Similar to Matrix_Copy() but allocates the target matrix * if it is set to NULL. */ void Matrix_clone(Matrix * M, Matrix ** Cl); /** * Copies a contiguous submatrix of M1 into M2, at the indicated position. * M1 and M2 are assumed t be allocated already. */ void Matrix_copySubMatrix(Matrix *M1, unsigned int sr1, unsigned int sc1, unsigned int nbR, unsigned int nbC, Matrix * M2, unsigned int sr2, unsigned int sc2); /** * given a matrix M into -M */ void Matrix_oppose(Matrix * M); #endif /* __BM_MATRIX_ADDON_H__ */ polylib-5.22.5.orig/include/polylib/NormalForms.h0000644000175000017500000000157011341227526022613 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #if defined(__cplusplus) extern "C" { #endif extern void Smith(Matrix *A, Matrix **U, Matrix **V, Matrix **Product); extern void Hermite(Matrix *A, Matrix **H, Matrix **U); #if defined(__cplusplus) } #endif polylib-5.22.5.orig/include/polylib/arithmetic_errors.h0000644000175000017500000000747711341227527024116 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* * $Id: arithmetic_errors.h,v 1.4 2006/03/15 19:59:37 verdoolaege Exp $ * * managing arithmetic errors... * detecting and managing arithmetic errors on Values should be * systematic. These macros gives a C++ look and feel to this * management. * * (c) CA et FC, Sept 1997 * * $Log: arithmetic_errors.h,v $ * Revision 1.4 2006/03/15 19:59:37 verdoolaege * arith: add some missing consts * * Revision 1.3 2004/02/08 21:53:27 kienhuis * Update from Fabien Coelho, via Bart Kienhuis * * I've updated here in the C3/Linear library the arithmetic_error * package that I developped (with others) to handle exceptions in C. * It adds a simple callback feature which is needed for pips here. * If you do not use it, it should not harm;-) * * Revision 1.34 2003/09/03 13:59:46 coelho * ++ * * Revision 1.33 2003/09/03 13:35:34 coelho * no more callback. * * Revision 1.32 2003/08/18 14:55:38 coelho * callback fix. * * Revision 1.31 2003/08/18 14:16:45 coelho * NULL callback added. * * Revision 1.30 2003/06/13 13:59:55 coelho * hop. * * Revision 1.29 2000/07/27 15:01:55 coelho * hop. * * Revision 1.28 2000/07/26 09:11:58 coelho * hop. * * Revision 1.27 2000/07/26 09:07:32 coelho * *** empty log message *** * * Revision 1.26 2000/07/26 09:06:32 coelho * the_last_just_thrown_exception declared. * * Revision 1.25 2000/07/26 08:41:40 coelho * RETHROW added. * * Revision 1.24 1998/10/26 14:37:48 coelho * constants moved out. * * Revision 1.23 1998/10/26 14:36:13 coelho * constants explicitely defined in .h. * * Revision 1.22 1998/10/24 15:18:26 coelho * THROW macro updated to tell its source. * * Revision 1.21 1998/10/24 14:33:08 coelho * parser exception added. * * Revision 1.20 1998/10/24 14:32:45 coelho * simpler macros. * * Revision 1.19 1998/10/24 09:22:47 coelho * size update. * * Revision 1.18 1998/10/24 09:21:45 coelho * const added to constants. * */ #if !defined(linear_arithmetic_error_included) #define linear_arithmetic_error_included #include typedef void (*exception_callback_t)(const char *, const char *, int); /* const unsigned int overflow_error = 1; const unsigned int simplex_arithmetic_error = 2; const unsigned int user_exception_error = 4; const unsigned int parser_exception_error = 8; const unsigned int any_exception_error = ~0; */ /* use gnu cpp '__FUNCTION__' extension if possible. */ #if defined(__GNUC__) #define __CURRENT_FUNCTION_NAME__ __FUNCTION__ #else #define __CURRENT_FUNCTION_NAME__ "" #endif /* 'const' out because of cproto 4.6. FC 13/06/2003 */ #define EXCEPTION extern unsigned int #define THROW(what) \ (throw_exception(what, __CURRENT_FUNCTION_NAME__, __FILE__, __LINE__)) #define CATCH(what) \ if (setjmp(*push_exception_on_stack(what, __CURRENT_FUNCTION_NAME__, \ __FILE__, __LINE__))) #define UNCATCH(what) \ (pop_exception_from_stack(what, __CURRENT_FUNCTION_NAME__, \ __FILE__, __LINE__)) #define TRY else extern unsigned int the_last_just_thrown_exception; #define RETHROW() THROW(the_last_just_thrown_exception) #endif /* linear_arithmetic_error_included */ /* end of it. */ polylib-5.22.5.orig/include/polylib/homogenization.h0000644000175000017500000000212611341227526023404 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** homogenization.h -- Bavo Nootaert **/ #ifndef HOMOGENIZATION_H #define HOMOGENIZATTON_H #include Polyhedron *homogenize(Polyhedron *P, unsigned MAXRAYS); void dehomogenize_evalue(evalue *ep, int nb_param); void dehomogenize_enode(enode *p, int nb_param); void dehomogenize_enumeration(Enumeration *en, int nb_param, int maxRays); Polyhedron *dehomogenize_polyhedron(Polyhedron *p, int maxRays); #endif polylib-5.22.5.orig/include/polylib/compress_parms.h0000644000175000017500000001127211341227526023411 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * @author B. Meister 12/2003-2006 * LSIIT -ICPS * UMR 7005 CNRS * Louis Pasteur University (ULP), Strasbourg, France */ #ifndef __BM_COMPRESS_PARMS_H__ #define __BM_COMPRESS_PARMS_H__ #include "matrix_addon.h" #include "matrix_permutations.h" #include /* ----- functions applying on equalities ----- */ /** * Given a system of non-redundant equalities, looks if it has an integer * solution in the combined space, and if yes, returns one solution. */ void Equalities_integerSolution(Matrix * Eqs, Matrix ** sol); /** * Computes the validity lattice of a set of equalities. I.e., the lattice * induced on the last b variables by the equalities involving the * first a integer existential variables. */ void Equalities_validityLattice(Matrix * Eqs, int a, Matrix** vl); /** * Given an integer matrix B with m rows and integer m-vectors C and d, * computes the basis of the integer solutions to (BN+C) mod d = 0 (1). * This is an affine lattice (G): (N 1)^T= G(N' 1)^T, forall N' in Z^b. * If there is no solution, returns NULL. */ void Equalities_intModBasis(Matrix * B, Matrix * C, Matrix * d, Matrix ** imb); /* ----- functions applying on constraints ----- */ /** * Eliminates all the equalities in a set of constraints and returns the set of * constraints defining a full-dimensional polyhedron, such that there is a * bijection between integer points of the original polyhedron and these of the * resulting (projected) polyhedron). */ void Constraints_fullDimensionize(Matrix ** M, Matrix ** C, Matrix ** VL, Matrix ** Eqs, Matrix ** ParmEqs, unsigned int ** elimVars, unsigned int ** elimParms, int maxRays); /* extracts equalities involving only parameters */ #define Constraints_removeParmEqs(a,b,c,d) Constraints_Remove_parm_eqs(a,b,c,d) Matrix * Constraints_Remove_parm_eqs(Matrix ** M, Matrix ** Ctxt, int renderSpace, unsigned int ** elimParms); /** * Eliminates the columns corresponding to a list of eliminated parameters. */ void Constraints_removeElimCols(Matrix * M, unsigned int nbVars, unsigned int *elimParms, Matrix ** newM); /* ----- function applying on a lattice ----- */ /** * Given a matrix that defines a full-dimensional affine lattice, returns the * affine sub-lattice spanned in the k first dimensions. * Useful for instance when you only look for the parameters' validity lattice. */ void Lattice_extractSubLattice(Matrix * lat, unsigned int k, Matrix ** subLat); /* ----- functions applying on a polyhedron ----- */ Polyhedron * Polyhedron_Remove_parm_eqs(Polyhedron ** P, Polyhedron ** C, int renderSpace, unsigned int ** elimParms, int maxRays); #define Polyhedron_removeParmEqs(a,b,c,d,e) Polyhedron_Remove_parm_eqs(a,b,c,d,e) /* ----- functions kept for backwards compatibility ----- */ /** * given a full-row-rank nxm matrix M(made of row-vectors), * computes the basis K (made of n-m column-vectors) of the integer kernel of M * so we have: M.K = 0 */ Matrix * int_ker(Matrix * M); /* given a matrix of m parameterized equations, compress the parameters and transform the variable space into a n-m space. */ Matrix * full_dimensionize(Matrix const * M, int nb_parms, Matrix ** Validity_Lattice); /* Compute the overall period of the variables I for (MI) mod |d|, where M is a matrix and |d| a vector Produce a diagonal matrix S = (s_k) where s_k is the overall period of i_k */ Matrix * affine_periods(Matrix * M, Matrix * d); /* given a matrix B' with m rows and m-vectors C' and d, computes the basis of the integer solutions to (B'N+C') mod d = 0. returns NULL if there is no integer solution */ Matrix * int_mod_basis(Matrix * Bp, Matrix * Cp, Matrix * d); /* given a parameterized constraints matrix with m equalities, computes the compression matrix C such that there is an integer solution in the variables space for each value of N', with N = Cmp N' (N are the original parameters) */ Matrix * compress_parms(Matrix * E, int nb_parms); #endif /* __BM_COMPRESS_PARMS_H__ */ polylib-5.22.5.orig/include/polylib/polyhedron.h0000644000175000017500000001132111341227527022533 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _polyhedron_H_ #define _polyhedron_H_ /* Make sure the Constraint member is valid */ #define POL_ENSURE_INEQUALITIES(P) \ if (F_ISSET(P, POL_VALID) && !F_ISSET(P, POL_INEQUALITIES)) \ Polyhedron_Compute_Dual(P); /* Make sure the Ray member is valid */ #define POL_ENSURE_POINTS(P) \ if (F_ISSET(P, POL_VALID) && !F_ISSET(P, POL_POINTS)) \ Polyhedron_Compute_Dual(P); /* Make sure the Constraint member is valid and non-redundant */ #define POL_ENSURE_FACETS(P) \ if (F_ISSET(P, POL_VALID) && !F_ISSET(P, POL_FACETS)) \ Polyhedron_Compute_Dual(P); /* Make sure the Ray member is valid and non-redundant */ #define POL_ENSURE_VERTICES(P) \ if (F_ISSET(P, POL_VALID) && !F_ISSET(P, POL_VERTICES)) \ Polyhedron_Compute_Dual(P); #if defined(__cplusplus) extern "C" { #endif extern void Polyhedron_Compute_Dual(Polyhedron *P); Polyhedron *DomainConstraintSimplify(Polyhedron *P, unsigned MaxRays); extern Polyhedron *AddConstraints(Value *Con,unsigned NbConstraints, Polyhedron *Pol,unsigned NbMaxRays ); extern Polyhedron *AddPolyToDomain(Polyhedron *Pol,Polyhedron *PolDomain); extern Polyhedron *AddRays (Value *Ray2,unsigned NbRay2,Polyhedron *Pol1,unsigned NbMaxRays); extern Polyhedron *align_context(Polyhedron *Pol,int align_dimension, int NbMaxRays); extern Polyhedron *Constraints2Polyhedron(Matrix *Constraints, unsigned NbMaxRays); extern Polyhedron *Disjoint_Domain( Polyhedron *Pol, int flag, unsigned NbMaxRays ); extern Polyhedron *DomainAddConstraints(Polyhedron *Pol,Matrix *Mat, unsigned NbMaxRays); extern Polyhedron *DomainAddRays(Polyhedron *Pol,Matrix *Ray, unsigned NbMaxConstrs); extern Polyhedron *DomainConvex(Polyhedron *Pol,unsigned NbMaxConstrs); extern Interval *DomainCost(Polyhedron *Pol,Value *Cost); extern Polyhedron *DomainDifference(Polyhedron *Pol1,Polyhedron *Pol2, unsigned NbMaxRays); extern Polyhedron *DomainImage(Polyhedron *Pol,Matrix *Func,unsigned NbMaxConstrs); extern Polyhedron *DomainIntersection(Polyhedron *Pol1,Polyhedron *Pol2, unsigned NbMaxRays); extern Polyhedron *DomainPreimage(Polyhedron *Pol,Matrix *Func, unsigned NbMaxRays); extern Polyhedron *DomainSimplify(Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays); extern Polyhedron *Stras_DomainSimplify(Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays); extern Polyhedron *DomainUnion(Polyhedron *Pol1,Polyhedron *Pol2, unsigned NbMaxRays); extern Polyhedron *Domain_Copy(Polyhedron *Pol); extern void Domain_Free (Polyhedron *Pol); extern void Domain_PrintConstraints(FILE *Dst, const char *Format, Polyhedron *Pol); extern Polyhedron *Empty_Polyhedron(unsigned Dimension); extern int Gauss(Matrix *Mat,int NbEq,int Dimension); extern int lower_upper_bounds(int pos,Polyhedron *P,Value *context, Value *LBp,Value *UBp); extern Matrix *Polyhedron2Constraints(Polyhedron *Pol); extern Matrix *Polyhedron2Rays(Polyhedron *Pol); extern int PolyhedronIncludes(Polyhedron *Pol1,Polyhedron *Pol2); extern Polyhedron* Polyhedron_Alloc(unsigned Dimension,unsigned NbConstraints,unsigned NbRays); extern Polyhedron *Polyhedron_Copy(Polyhedron *Pol); extern void Polyhedron_Free(Polyhedron *Pol); extern Polyhedron *Polyhedron_Image(Polyhedron *Pol,Matrix *Func, unsigned NbMaxConstrs); extern Polyhedron *Polyhedron_Preimage(Polyhedron *Pol,Matrix *Func, unsigned NbMaxRays); extern void Polyhedron_Print(FILE *Dst, const char *Format, const Polyhedron *Pol); extern void Polyhedron_PrintConstraints(FILE *Dst, const char *Format, Polyhedron *Pol); extern Polyhedron *Polyhedron_Scan(Polyhedron *D,Polyhedron *C, unsigned MAXRAYS); extern void PolyPrint(Polyhedron *Pol); extern Polyhedron *Rays2Polyhedron(Matrix *Ray,unsigned NbMaxConstrs); extern Polyhedron *SubConstraint(Value *Con,Polyhedron *Pol, unsigned NbMaxRays, int Pass); extern Polyhedron *Universe_Polyhedron (unsigned Dimension); #if defined(__cplusplus) } #endif #endif /* _polyhedron_H_ */ polylib-5.22.5.orig/include/polylib/matrix.h0000644000175000017500000000316411341227526021661 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _matrix_H_ #define _matrix_H_ #if defined(__cplusplus) extern "C" { #endif extern Matrix *Matrix_Alloc(unsigned NbRows, unsigned NbColumns); extern void Matrix_Free(Matrix *Mat); extern void Matrix_Extend(Matrix *Mat, unsigned NbRows); extern void Matrix_Print(FILE * Dst, const char *Format, Matrix *Mat); extern void Matrix_Read_Input(Matrix *Mat); extern Matrix *Matrix_Read(void); extern void right_hermite(Matrix *A,Matrix **Hp,Matrix **Up,Matrix **Qp); extern void left_hermite(Matrix *A,Matrix **Hp,Matrix **Qp,Matrix **Up); extern int MatInverse(Matrix *M,Matrix *MInv); extern void rat_prodmat(Matrix *S,Matrix *X,Matrix *P); extern void Matrix_Vector_Product(Matrix *mat,Value *p1,Value *p2); extern void Vector_Matrix_Product(Value *p1,Matrix *mat,Value *p2); extern void Matrix_Product(Matrix *mat1,Matrix *mat2,Matrix *mat3); extern int Matrix_Inverse(Matrix *Mat,Matrix *MatInv); #if defined(__cplusplus) } #endif #endif /* _matrix_H_ */ polylib-5.22.5.orig/include/polylib/polylibgmp.h0000644000175000017500000000134311341227527022531 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #define GNUMP #include #include polylib-5.22.5.orig/include/polylib/types.h0000644000175000017500000002071211341227527021520 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* types-polylib.h COPYRIGHT Both this software and its documentation are Copyright 1993, IRISA /Universite de Rennes I - France Copyright 1996,1997,1998, Doran Wilde and Vincent Loechner All rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #ifndef _types_polylib_h_ #define _types_polylib_h_ #ifdef GNUMP #include #endif #include /*********************** USER DEFINES ******************************/ /* first parameter name char. */ #define FIRST_PARAMETER_NAME 'P' /******************* END OF USER DEFINES ***************************/ #define PCHAR (FIRST_PARAMETER_NAME-1) #define MAXNOOFRAYS 200 #if defined(LINEAR_VALUE_IS_LONGLONG) #define P_VALUE_FMT "%4lld " #elif defined(LINEAR_VALUE_IS_LONG) #define P_VALUE_FMT "%4ld " #elif defined(LINEAR_VALUE_IS_CHARS) #define P_VALUE_FMT "%s " #elif defined(LINEAR_VALUE_IS_INT) #define P_VALUE_FMT "%4d " #else /* GNUMP */ #define P_VALUE_FMT "%4s " #endif /* Used in lower_upper_bounds */ #define LB_INFINITY 1 #define UB_INFINITY 2 /* MSB, TOP, and NEXT are defined over integer type, not on value type */ /* Put a one in the most significant bit of an int (portable) */ #define MSB ((unsigned)(((unsigned)1)<<(sizeof(int)*8-1))) /* Largest representable positive number */ #define TOP ((int)(MSB-1)) /* Right shift the one bit in b and increment j if the last bit in b is one */ #define NEXT(j,b) { if (!((b)>>=1)) { (b)=MSB; (j)++; } } /* Status of last Polyhedron operation */ extern int Pol_status; #define POL_HIGH_BIT (UINT_MAX - (UINT_MAX >> 1)) #define POL_NO_DUAL (POL_HIGH_BIT | 0x0001) #define POL_INTEGER (POL_HIGH_BIT | 0x0002) #define POL_ISSET(flags,f) ((flags & f) == f) typedef struct { unsigned Size; Value *p; } Vector; typedef struct matrix { unsigned NbRows, NbColumns; Value **p; Value *p_Init; int p_Init_size; /* needed to free the memory allocated by mpz_init */ } Matrix; /* Macros to init/set/clear/test flags. */ #define FL_INIT(l, f) (l) = (f) /* Specific flags location. */ #define FL_SET(l, f) ((l) |= (f)) #define FL_CLR(l, f) ((l) &= ~(f)) #define FL_ISSET(l, f) ((l) & (f)) #define F_INIT(p, f) FL_INIT((p)->flags, f) /* Structure element flags. */ #define F_SET(p, f) FL_SET((p)->flags, f) #define F_CLR(p, f) FL_CLR((p)->flags, f) #define F_ISSET(p, f) FL_ISSET((p)->flags, f) typedef struct polyhedron { unsigned Dimension, NbConstraints, NbRays, NbEq, NbBid; Value **Constraint; Value **Ray; Value *p_Init; int p_Init_size; struct polyhedron *next; #define POL_INEQUALITIES 0x00000001 #define POL_FACETS 0x00000002 #define POL_POINTS 0x00000004 #define POL_VERTICES 0x00000008 /* The flags field contains "valid" information, * i.e., the structure was created by PolyLib. */ #define POL_VALID 0x00000010 unsigned flags; } Polyhedron; typedef struct interval { Value MaxN, MaxD; Value MinN, MinD; int MaxI, MinI; } Interval; /* Test whether P is an empty polyhedron */ #define emptyQ(P) \ ((F_ISSET(P, POL_INEQUALITIES) && P->NbEq > P->Dimension) || \ (F_ISSET(P, POL_POINTS) && P->NbRays == 0)) /* Test whether P is a universe polyheron */ #define universeQ(P) (P->Dimension==P->NbBid) typedef struct _Param_Vertex { Matrix *Vertex; /* Each row is a coordinate of the vertex. The first */ /* "m" values of each row are the coefficients of the */ /* parameters. The (m+1)th value is the constant, the */ /* The (m+2)th value is the common denominator. */ Matrix *Domain; /* Constraints on parameters (in Polyhedral format) */ unsigned *Facets; /* Bit array of facets defining the vertex. */ struct _Param_Vertex *next; /* Pointer to the next structure */ } Param_Vertices; typedef struct _Param_Domain { unsigned *F; /* Bit array of faces */ Polyhedron *Domain; /* Pointer to Domain (constraints on parameters) */ struct _Param_Domain *next; /* Pointer to the next structure */ } Param_Domain; typedef struct _Param_Polyhedron { int nbV; /* Number of parameterized vertices */ Param_Vertices *V; /* Pointer to the list of parameteric vertices */ Param_Domain *D; /* Pointer to the list of validity domains */ Matrix *Constraints;/* Constraints referred to by V->Facets */ Matrix *Rays; /* Lines/rays (non parametric) */ } Param_Polyhedron; #define FORALL_PVertex_in_ParamPolyhedron(_V, _D, _P) \ { int _i, _ix; \ unsigned _bx; \ for( _i=0, _ix=0, _bx=MSB, _V=_P->V ; \ _V && (_i<_P->nbV) ; _i++, _V=_V->next ) \ { if (_D->F[_ix] & _bx) \ { #define END_FORALL_PVertex_in_ParamPolyhedron \ } \ NEXT(_ix, _bx); \ } \ } /* Data structures for pseudo-polynomial */ typedef enum { polynomial, periodic, evector } enode_type; #ifdef CLN #define POLY_UNION_OR_STRUCT struct #else #define POLY_UNION_OR_STRUCT union #endif typedef struct _evalue { Value d; /* denominator */ POLY_UNION_OR_STRUCT { Value n; /* numerator (if denominator != 0) */ struct _enode *p; /* pointer (if denominator == 0) */ } x; } evalue; typedef struct _enode { enode_type type; /* polynomial or periodic or evector */ int size; /* number of attached pointers */ int pos; /* parameter position */ evalue arr[1]; /* array of rational/pointer */ } enode; typedef struct _enumeration { Polyhedron *ValidityDomain; /* contraints on the parameters */ evalue EP; /* dimension = combined space */ struct _enumeration *next; /* Ehrhart Polynomial, corresponding to parameter values inside the domain ValidityDomain below */ } Enumeration; /*-----------------------------Example Usage------------------------------*/ /* enode *e */ /* e->type = polynomial e->type = periodic e->type = evector */ /* e->size = degree+1 e->size = period e->size = length */ /* e->pos = [1..nb_param] */ /* e->arr[i].d = denominator (Value) */ /* e->arr[i].x.p = pointer to another enode (if denominator is zero) */ /* e->arr[i].x.n = numerator (Value) (if denominator is non-zero) */ /*------------------------------------------------------------------------*/ /*------------------------------------------------------------------------*/ /* This representation has the following advantages: */ /* -- its dynamic, it can grow/shrink easily */ /* -- it is easy to evaluate for a given context (values of parameters) */ /* -- it allows pseudo-polynomial to be reduced with rules */ /* -- it can be constructed recursively */ /*------------------------------------------------------------------------*/ /* *********************** |Represnting Z-Polyhedron| ******************* */ typedef enum {False = 0, True = 1} Bool; typedef Matrix Lattice; typedef struct LatticeUnion { Lattice *M; struct LatticeUnion *next; } LatticeUnion; typedef struct ZPolyhedron { Lattice *Lat ; Polyhedron *P; struct ZPolyhedron *next; } ZPolyhedron; #ifndef FOREVER #define FOREVER for(;;) #endif #endif /* _types_polylib_h_ */ polylib-5.22.5.orig/include/polylib/Makefile.am0000644000175000017500000000132211341227526022232 0ustar sylvestresylvestrepolyincludedir=@includedir@/polylib polyinclude_HEADERS = \ Lattice.h \ Matop.h \ NormalForms.h \ SolveDio.h \ Zpolyhedron.h \ alpha.h \ arithmetique.h \ arithmetic_errors.h \ compress_parms.h \ ehrhart.h \ errormsg.h \ eval_ehrhart.h \ ext_ehrhart.h \ homogenization.h \ matrix.h \ matrix_addon.h \ matrix_permutations.h \ param.h \ polyhedron.h \ polylib.h \ polylib32.h \ polylib64.h \ polylibgmp.h \ polyparam.h \ ranking.h \ types.h \ vector.h poly_arith = $(top_srcdir)/source/arith arithmetic_errors.h:$(poly_arith)/arithmetic_errors.h rm -f $@ $(LN_S) $(poly_arith)/arithmetic_errors.h $@ arithmetique.h:$(poly_arith)/arithmetique.h rm -f $@ $(LN_S) $(poly_arith)/arithmetique.h $@ polylib-5.22.5.orig/include/polylib/Matop.h0000644000175000017500000000350011341227526021427 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _Matop_h_ #define _Matop_h_ #if defined(__cplusplus) extern "C" { #endif /* computes c = lcm(a,b) using Gcd(a,b,&c) */ extern void Lcm3(Value a, Value b, Value *c); extern Matrix *AddANullColumn ( Matrix *M ); extern Matrix *AddANullRow ( Matrix *M ); extern void ExchangeColumns ( Matrix *M, int Column1, int Column2 ); extern void ExchangeRows ( Matrix *M, int Row1, int Row2 ); extern int findHermiteBasis ( Matrix *M, Matrix **Result ); extern Matrix *Identity ( unsigned size ); extern Bool isinHnf ( Matrix *A ); extern Bool isIntegral ( Matrix *A ); extern Value *Lcm (Value i, Value j); extern Matrix *Matrix_Copy(Matrix const *Src); extern void PutColumnFirst ( Matrix *X, int Columnnumber ); extern void PutColumnLast ( Matrix *X, int Columnnumber ); extern void PutRowFirst ( Matrix *X, int Rownumber ); extern void PutRowLast ( Matrix *X, int Rownumber ); extern Matrix *RemoveNColumns ( Matrix *M, int FirstColumnnumber, int NumColumns ); extern Matrix *RemoveColumn ( Matrix *M, int Columnnumber ); extern Matrix *RemoveRow ( Matrix *M, int Rownumber ); extern Matrix *Transpose ( Matrix *A ); #if defined(__cplusplus) } #endif #endif /* _Matop_h_ */ polylib-5.22.5.orig/include/polylib/ehrhart.h0000644000175000017500000000377011341227526022015 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _ehrhart_H_ #define _ehrhart_H_ /*********************** User defines ******************************/ /* Print all overflow warnings, or just one per domain */ /* #define ALL_OVERFLOW_WARNINGS */ /******************* End of user defines ***************************/ #ifndef ALL_OVERFLOW_WARNINGS extern int overflow_warning_flag; #endif #if defined(__cplusplus) extern "C" { #endif extern void count_points ( int pos, Polyhedron *P, Value *context, Value *res ); extern void eadd ( evalue *e1, evalue *res ); extern enode *ecopy ( enode *e ); extern void edot ( enode *v1, enode *v2, evalue *res ); extern enode *new_enode( enode_type type,int size, int pos ); extern void free_evalue_refs ( evalue *e ); extern Enumeration *Polyhedron_Enumerate(Polyhedron *P, Polyhedron *C, unsigned MAXRAYS, const char **pname); extern void print_enode(FILE *DST, enode *p, const char **pname); extern void print_evalue(FILE *DST, evalue *e, const char **pname); extern void reduce_evalue (evalue *e); extern void Enumeration_Free(Enumeration *en); extern Enumeration *Ehrhart_Quick_Apx(Matrix * M, Matrix * C, Matrix ** Validity_Lattice, unsigned MAXRAYS); extern Enumeration * Enumeration_zero(unsigned int nbParms, unsigned int maxRays); #if defined(__cplusplus) } #endif #endif /* _ehrhart_H_ */ polylib-5.22.5.orig/include/polylib/polyparam.h0000644000175000017500000000466411341227527022370 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _polyparam_H_ #define _polyparam_H_ #if defined(__cplusplus) extern "C" { #endif extern void Compute_PDomains ( Param_Domain *PD, int nb_domains, int working_space ); extern Param_Polyhedron *GenParamPolyhedron(Polyhedron *Pol, Matrix *Rays); extern void Param_Domain_Free (Param_Domain *PD); extern void Param_Polyhedron_Free ( Param_Polyhedron *P ); extern void Param_Vertices_Free ( Param_Vertices *PV ); extern void Param_Vertices_Print(FILE *DST, Param_Vertices *PV, const char **param_names); extern Polyhedron *PDomainDifference ( Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays ); extern Polyhedron *PDomainIntersection ( Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays ); extern Param_Polyhedron *Polyhedron2Param_Domain ( Polyhedron *Din, Polyhedron *Cin, int working_space ); extern Param_Polyhedron *Polyhedron2Param_SimplifiedDomain ( Polyhedron **Din, Polyhedron *Cin, int working_space, Polyhedron **CEq, Matrix **CT ); extern Param_Polyhedron *Polyhedron2Param_Vertices ( Polyhedron *Din, Polyhedron *Cin, int working_space ); extern void Print_Domain(FILE *DST, Polyhedron *D, const char **param_names); extern void Print_Vertex(FILE *DST, Matrix *V, const char **param_names); extern Matrix *VertexCT( Matrix *V, Matrix *CT ); void Param_Polyhedron_Scale_Integer(Param_Polyhedron *PP, Polyhedron **P, Value *det, unsigned MaxRays); #if defined(__cplusplus) } #endif #endif /* _polyparam_H_ */ polylib-5.22.5.orig/include/polylib/SolveDio.h0000644000175000017500000000160111341227526022073 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #ifndef _SolveDio_h_ #define _SolveDio_h_ #if defined(__cplusplus) extern "C" { #endif extern int SolveDiophantine ( Matrix *M, Matrix **U, Vector **X ); #if defined(__cplusplus) } #endif #endif /* _SolveDio_h_ */ polylib-5.22.5.orig/include/Makefile.am0000644000175000017500000000002211035141341020542 0ustar sylvestresylvestreSUBDIRS = polylib polylib-5.22.5.orig/configure0000755000175000017500000146466211341231330017021 0ustar sylvestresylvestre#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.65 for polylib 5.22.5. # # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV export CONFIG_SHELL exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"} fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\$\\$0,'$0','` ;; esac ECHO=${lt_ECHO-echo} if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "$0" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF $* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "$0"' 'sed 20q "$0"' 'sed 10q "$0"' 'sed 2q "$0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "$0" --no-reexec ${1+"$@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL $0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL $0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "$0"' 'sed 10q "$0"' 'sed 20q "$0"' 'sed 50q "$0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "$0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "$0" ${1+"$@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL $0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\$0 --fallback-echo" fi test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='polylib' PACKAGE_TARNAME='polylib' PACKAGE_VERSION='5.22.5' PACKAGE_STRING='polylib 5.22.5' PACKAGE_BUGREPORT='' PACKAGE_URL='' ac_unique_file="include/polylib/polylib.h.in" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS pkgconfig_libfile pkgconfig_libdir BITS DOXYGEN multi_noinst_programs multi_bin_programs polylib LIBOBJS ALL_BITS polylibs polylib128_defs polylib64_defs polylib32_defs CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL lt_ECHO RANLIB AR OBJDUMP NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL LN_S am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC versioninfo am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld enable_libtool_lock enable_int_lib enable_longint_lib enable_longlongint_lib with_libgmp enable_extra_suffix with_doxygen ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error "unrecognized option: \`$ac_option' Try \`$0 --help' for more information." ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe $as_echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures polylib 5.22.5 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/polylib] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of polylib 5.22.5:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-int-lib Build an int library --enable-longint-lib Build a long int library --enable-longlongint-lib Build a long long int library --enable-extra-suffix Add bits size suffix to executables Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-libgmp DIR Location of the GMP Distribution --with-doxygen DIR Location of the Doxygen Distribution (http://www.doxygen.org) Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF polylib configure 5.22.5 generated by GNU Autoconf 2.65 Copyright (C) 2009 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_header_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_func # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_header_mongrel # ac_fn_c_compute_int LINENO EXPR VAR INCLUDES # -------------------------------------------- # Tries to find the compile-time value of EXPR in a program that includes # INCLUDES, setting VAR accordingly. Returns whether the value could be # computed ac_fn_c_compute_int () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if test "$cross_compiling" = yes; then # Depending upon the size, compute the lo and hi bounds. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= 0)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=0 ac_mid=0 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid; break else as_fn_arith $ac_mid + 1 && ac_lo=$as_val if test $ac_lo -le $ac_mid; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) < 0)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=-1 ac_mid=-1 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=$ac_mid; break else as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val if test $ac_mid -le $ac_hi; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else ac_lo= ac_hi= fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # Binary search between lo and hi bounds. while test "x$ac_lo" != "x$ac_hi"; do as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid else as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done case $ac_lo in #(( ?*) eval "$3=\$ac_lo"; ac_retval=0 ;; '') ac_retval=1 ;; esac else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 static long int longval () { return $2; } static unsigned long int ulongval () { return $2; } #include #include int main () { FILE *f = fopen ("conftest.val", "w"); if (! f) return 1; if (($2) < 0) { long int i = longval (); if (i != ($2)) return 1; fprintf (f, "%ld", i); } else { unsigned long int i = ulongval (); if (i != ($2)) return 1; fprintf (f, "%lu", i); } /* Do not output a trailing newline, as this causes \r\n confusion on some platforms. */ return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : echo >>conftest.val; read $3 &5 $as_echo_n "checking whether $2 is declared... " >&6; } if { as_var=$3; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { #ifndef $2 (void) $2; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; test "x$as_lineno_stack" = x && { as_lineno=; unset as_lineno;} } # ac_fn_c_check_decl cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by polylib $as_me 5.22.5, which was generated by GNU Autoconf 2.65. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------------- ## ## File substitutions. ## ## ------------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then ac_site_file1=$CONFIG_SITE elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu am__api_version='1.11' ac_aux_dir= for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do for ac_t in install-sh install.sh shtool; do if test -f "$ac_dir/$ac_t"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/$ac_t -c" break 2 fi done done if test -z "$ac_aux_dir"; then as_fn_error "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi test "$2" = conftest.file ) then # Ok. : else as_fn_error "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if test "${ac_cv_path_mkdir+set}" = set; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AWK+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='polylib' VERSION='5.22.5' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' versioninfo=9:0:1 if test "x$prefix" != "xNONE"; then prefix_wd=`cd $prefix && pwd` srcdir_wd=`cd $srcdir && pwd` wd=`pwd` if test "x$prefix_wd" = "x$srcdir_wd"; then as_fn_error "Installation in source directory not supported" "$LINENO" 5 fi if test "x$prefix_wd" = "x$wd"; then as_fn_error "Installation in build directory not supported" "$LINENO" 5 fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "no acceptable C compiler found in \$PATH See \`config.log' for more details." "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "C compiler cannot create executables See \`config.log' for more details." "$LINENO" 5; }; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if test "${ac_cv_objext+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "cannot compute suffix of object files: cannot compile See \`config.log' for more details." "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if test "${ac_cv_c_compiler_gnu+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if test "${ac_cv_prog_cc_g+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if test "${ac_cv_prog_cc_c89+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.2.6b' macro_revision='1.3017' ltmain="$ac_aux_dir/ltmain.sh" # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if test "${ac_cv_build+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if test "${ac_cv_host+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if test "${ac_cv_path_SED+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if test "${ac_cv_path_GREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if test "${ac_cv_path_EGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if test "${ac_cv_path_FGREP+set}" = set; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if test "${lt_cv_path_LD+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if test "${lt_cv_prog_gnu_ld+set}" = set; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if test "${lt_cv_path_NM+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$ac_tool_prefix"; then for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in "dumpbin -symbols" "link -dump -symbols" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DUMPBIN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if test "${lt_cv_nm_interface+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:4729: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:4732: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:4735: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if test "${lt_cv_sys_max_cmd_len+set}" = set; then : $as_echo_n "(cached) " >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL $0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if test "${lt_cv_ld_reload_flag+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OBJDUMP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if test "${lt_cv_deplibs_check_method+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. if ( file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9].[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ar", so it can be a program name with args. set dummy ${ac_tool_prefix}ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AR="${ac_tool_prefix}ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_AR"; then ac_ct_AR=$AR # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_AR+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_AR="ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi else AR="$ac_cv_prog_AR" fi test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if test "${lt_cv_sys_global_symbol_pipe+set}" = set; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line 5930 "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if test "${lt_cv_cc_needs_belf+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_DSYMUTIL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_NMEDIT+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_LIPO+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_ac_ct_OTOOL64+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if test "${lt_cv_apple_cc_single_mod+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if test "${lt_cv_ld_exported_symbols_list+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if test "${ac_cv_header_stdc+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " eval as_val=\$$as_ac_Header if test "x$as_val" = x""yes; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = x""yes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; pic_mode="$withval" else pic_mode=default fi test -z "$pic_mode" && pic_mode=default # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if test "${lt_cv_objdir+set}" = set; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if test "${lt_cv_path_MAGIC_CMD+set}" = set; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC="$CC" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag=' -fno-builtin' { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:7460: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:7464: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_prog_compiler_pic" >&5 $as_echo "$lt_prog_compiler_pic" >&6; } # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if test "${lt_cv_prog_compiler_pic_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:7799: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:7803: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test x"$lt_cv_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if test "${lt_cv_prog_compiler_static_works+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test x"$lt_cv_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:7904: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:7908: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if test "${lt_cv_prog_compiler_c_o+set}" = set; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:7959: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:7963: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) link_all_deplibs=no ;; esac ld_shlibs=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; xl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld='-rpath $libdir' archive_cmds='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes=yes ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='' link_all_deplibs=yes allow_undefined_flag="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; freebsd1*) ld_shlibs=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld='+b $libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo(void) {} _ACEOF if ac_fn_c_try_link "$LINENO"; then : archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='${wl}-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test "$ld_shlibs" = no && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then archive_cmds_need_lc=no else archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* { $as_echo "$as_me:${as_lineno-$LINENO}: result: $archive_cmds_need_lc" >&5 $as_echo "$archive_cmds_need_lc" >&6; } ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[3-9]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if test "${ac_cv_lib_dld_shl_load+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = x""yes; then : lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld" else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if test "${ac_cv_lib_dl_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if test "${ac_cv_lib_svld_dlopen+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = x""yes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if test "${ac_cv_lib_dld_dld_link+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = x""yes; then : lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 10342 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if test "${lt_cv_dlopen_self_static+set}" = set; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line 10438 "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report which library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CC="$lt_save_CC" ac_config_commands="$ac_config_commands libtool" # Only expand once: if test "x$CC" != xcc; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC and cc understand -c and -o together" >&5 $as_echo_n "checking whether $CC and cc understand -c and -o together... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether cc understands -c and -o together" >&5 $as_echo_n "checking whether cc understands -c and -o together... " >&6; } fi set dummy $CC; ac_cc=`$as_echo "$2" | sed 's/[^a-zA-Z0-9_]/_/g;s/^[0-9]/_/'` if { as_var=ac_cv_prog_cc_${ac_cc}_c_o; eval "test \"\${$as_var+set}\" = set"; }; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # We do the test twice because some compilers refuse to overwrite an # existing .o file with -o, though they will create one. ac_try='$CC -c conftest.$ac_ext -o conftest2.$ac_objext >&5' rm -f conftest2.* if { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -f conftest2.$ac_objext && { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then eval ac_cv_prog_cc_${ac_cc}_c_o=yes if test "x$CC" != xcc; then # Test first that cc exists at all. if { ac_try='cc -c conftest.$ac_ext >&5' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then ac_try='cc -c conftest.$ac_ext -o conftest2.$ac_objext >&5' rm -f conftest2.* if { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -f conftest2.$ac_objext && { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # cc works too. : else # cc exists but doesn't like -o. eval ac_cv_prog_cc_${ac_cc}_c_o=no fi fi fi else eval ac_cv_prog_cc_${ac_cc}_c_o=no fi rm -f core conftest* fi if eval test \$ac_cv_prog_cc_${ac_cc}_c_o = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "#define NO_MINUS_C_MINUS_O 1" >>confdefs.h fi # FIXME: we rely on the cache variable name because # there is no other way. set dummy $CC am_cc=`echo $2 | sed 's/[^a-zA-Z0-9_]/_/g;s/^[0-9]/_/'` eval am_t=\$ac_cv_prog_cc_${am_cc}_c_o if test "$am_t" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if test "${ac_cv_c_const+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { /* FIXME: Include the comments suggested by Paul. */ #ifndef __cplusplus /* Ultrix mips cc rejects this. */ typedef int charset[2]; const charset cs; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this. */ char *t; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; }; struct s *b; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if test "${ac_cv_header_stdc+set}" = set; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi for ac_header in limits.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" eval as_val=\$$as_ac_Header if test "x$as_val" = x""yes; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in getopt.h do : ac_fn_c_check_header_mongrel "$LINENO" "getopt.h" "ac_cv_header_getopt_h" "$ac_includes_default" if test "x$ac_cv_header_getopt_h" = x""yes; then : cat >>confdefs.h <<_ACEOF #define HAVE_GETOPT_H 1 _ACEOF fi done # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5 $as_echo_n "checking size of int... " >&6; } if test "${ac_cv_sizeof_int+set}" = set; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then : else if test "$ac_cv_type_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "cannot compute sizeof (int) See \`config.log' for more details." "$LINENO" 5; }; } else ac_cv_sizeof_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5 $as_echo "$ac_cv_sizeof_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_INT $ac_cv_sizeof_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long int" >&5 $as_echo_n "checking size of long int... " >&6; } if test "${ac_cv_sizeof_long_int+set}" = set; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long int))" "ac_cv_sizeof_long_int" "$ac_includes_default"; then : else if test "$ac_cv_type_long_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "cannot compute sizeof (long int) See \`config.log' for more details." "$LINENO" 5; }; } else ac_cv_sizeof_long_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long_int" >&5 $as_echo "$ac_cv_sizeof_long_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG_INT $ac_cv_sizeof_long_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long long int" >&5 $as_echo_n "checking size of long long int... " >&6; } if test "${ac_cv_sizeof_long_long_int+set}" = set; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long long int))" "ac_cv_sizeof_long_long_int" "$ac_includes_default"; then : else if test "$ac_cv_type_long_long_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { as_fn_set_status 77 as_fn_error "cannot compute sizeof (long long int) See \`config.log' for more details." "$LINENO" 5; }; } else ac_cv_sizeof_long_long_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long_long_int" >&5 $as_echo "$ac_cv_sizeof_long_long_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG_LONG_INT $ac_cv_sizeof_long_long_int _ACEOF for type in long_long_int long_int int; do case "$type" in int) bits=`expr $ac_cv_sizeof_int \* 8` defs="#define LINEAR_VALUE_IS_INT" ;; long_int) bits=`expr $ac_cv_sizeof_long_int \* 8` defs="#define LINEAR_VALUE_IS_LONG #define LINEAR_VALUE_PROTECT_MULTIPLY" ;; long_long_int) bits=`expr $ac_cv_sizeof_long_long_int \* 8` defs="#define LINEAR_VALUE_IS_LONGLONG #define LINEAR_VALUE_PROTECT_MULTIPLY #define LINEAR_VALUE_ASSUME_SOFTWARE_IDIV" ;; esac case "$bits" in 32) polylib32_defs=$defs ;; 64) polylib64_defs=$defs ;; 128) polylib128_defs=$defs ;; esac done # Check whether --enable-int-lib was given. if test "${enable_int_lib+set}" = set; then : enableval=$enable_int_lib; lib_type=int bits=`expr $ac_cv_sizeof_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" fi # Check whether --enable-longint-lib was given. if test "${enable_longint_lib+set}" = set; then : enableval=$enable_longint_lib; lib_type=longint bits=`expr $ac_cv_sizeof_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" fi # Check whether --enable-longlongint-lib was given. if test "${enable_longlongint_lib+set}" = set; then : enableval=$enable_longlongint_lib; lib_type=longlongint bits=`expr $ac_cv_sizeof_long_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to use GMP" >&5 $as_echo_n "checking whether to use GMP... " >&6; } # Check whether --with-libgmp was given. if test "${with_libgmp+set}" = set; then : withval=$with_libgmp; gmp_package=$withval else gmp_package=no fi if test "x$gmp_package" = "xno"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } if test "x$gmp_package" != "xyes"; then GMP_DIR=$gmp_package if test ! -d "$GMP_DIR"; then as_fn_error "Directory given for GMP Distribution is not a directory" "$LINENO" 5 fi CPPFLAGS="-I$GMP_DIR/include $CPPFLAGS" LDFLAGS="-L$GMP_DIR/lib $LDFLAGS" fi ac_fn_c_check_header_mongrel "$LINENO" "gmp.h" "ac_cv_header_gmp_h" "$ac_includes_default" if test "x$ac_cv_header_gmp_h" = x""yes; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lgmp" >&5 $as_echo_n "checking for main in -lgmp... " >&6; } if test "${ac_cv_lib_gmp_main+set}" = set; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lgmp $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_gmp_main=yes else ac_cv_lib_gmp_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_gmp_main" >&5 $as_echo "$ac_cv_lib_gmp_main" >&6; } if test "x$ac_cv_lib_gmp_main" = x""yes; then : poly_cv_gmpfatal="no" else poly_cv_gmpfatal="yes" fi else poly_cv_gmpfatal="yes" fi if test "$poly_cv_gmpfatal" = "yes"; then as_fn_error "GMP not found" "$LINENO" 5 else ac_fn_c_check_decl "$LINENO" "mp_get_memory_functions" "ac_cv_have_decl_mp_get_memory_functions" "#include " if test "x$ac_cv_have_decl_mp_get_memory_functions" = x""yes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_MP_GET_MEMORY_FUNCTIONS $ac_have_decl _ACEOF if test $ac_have_decl = 1; then : else case " $LIBOBJS " in *" mp_get_memory_functions.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS mp_get_memory_functions.$ac_objext" ;; esac fi fi lib_type=gmp BITS=`expr gmp` LIBS="-lgmp $LIBS" polylibs="libpolylib$BITS.la $polylibs" ALL_BITS="$BITS $ALL_BITS" fi if test "X$lib_type" = "X"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking what the LONG representation is" >&5 $as_echo_n "checking what the LONG representation is... " >&6; } if test "$ac_cv_sizeof_long_long_int" -gt "$ac_cv_sizeof_int"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: long long int" >&5 $as_echo "long long int" >&6; } lib_type=longlongint bits=`expr $ac_cv_sizeof_long_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" elif test "$ac_cv_sizeof_long_int" -gt "$ac_cv_sizeof_int"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: long int" >&5 $as_echo "long int" >&6; } lib_type=longint bits=`expr $ac_cv_sizeof_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: NONE!" >&5 $as_echo "NONE!" >&6; } lib_type=int bits=`expr $ac_cv_sizeof_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" fi fi case "$lib_type" in int) BITS=`expr $ac_cv_sizeof_int \* 8` ;; longint) BITS=`expr $ac_cv_sizeof_long_int \* 8` ;; longlongint) BITS=`expr $ac_cv_sizeof_long_long_int \* 8` ;; esac polylib="libpolylib$BITS.la" for pl_bit in $ALL_BITS ; do multi_bin_programs="$multi_bin_programs \$(multi_bin_programs_${pl_bit})" multi_noinst_programs="$multi_noinst_programs \$(no_inst_programs_${pl_bit})" done # Check whether --enable-extra-suffix was given. if test "${enable_extra_suffix+set}" = set; then : enableval=$enable_extra_suffix; if test "$enableval" = yes; then program_transform_name="s/\$\$/$BITS/;$program_transform_name" fi fi # Check whether --with-doxygen was given. if test "${with_doxygen+set}" = set; then : withval=$with_doxygen; doxygen_package=$withval fi # Extract the first word of "doxygen", so it can be a program name with args. set dummy doxygen; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if test "${ac_cv_prog_DOXYGEN+set}" = set; then : $as_echo_n "(cached) " >&6 else if test -n "$DOXYGEN"; then ac_cv_prog_DOXYGEN="$DOXYGEN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_dummy="$PATH:$doxygen_package/bin:/usr/local/bin" for as_dir in $as_dummy do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DOXYGEN="doxygen" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_DOXYGEN" && ac_cv_prog_DOXYGEN="test" fi fi DOXYGEN=$ac_cv_prog_DOXYGEN if test -n "$DOXYGEN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DOXYGEN" >&5 $as_echo "$DOXYGEN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi PACKAGE_NAME=polylib$BITS # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig libname" >&5 $as_echo_n "checking our pkgconfig libname... " >&6; } test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="${PACKAGE_NAME}" test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="$PACKAGE" ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libname" >&5 $as_echo "$ax_create_pkgconfig_libname" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig version" >&5 $as_echo_n "checking our pkgconfig version... " >&6; } test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="${PACKAGE_VERSION}" test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="$VERSION" ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_version" >&5 $as_echo "$ax_create_pkgconfig_version" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libdir" >&5 $as_echo_n "checking our pkgconfig_libdir... " >&6; } test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' ax_create_pkgconfig_libdir=`eval echo "$pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libdir" >&5 $as_echo "$pkgconfig_libdir" >&6; } test "$pkgconfig_libdir" != "$ax_create_pkgconfig_libdir" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&5 $as_echo "expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libfile" >&5 $as_echo_n "checking our pkgconfig_libfile... " >&6; } test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_libfile=`eval echo "$pkgconfig_libfile"` ax_create_pkgconfig_libfile=`eval echo "$ax_create_pkgconfig_libfile"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libfile" >&5 $as_echo "$pkgconfig_libfile" >&6; } test "$pkgconfig_libfile" != "$ax_create_pkgconfig_libfile" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&5 $as_echo "expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our package / suffix" >&5 $as_echo_n "checking our package / suffix... " >&6; } ax_create_pkgconfig_suffix="$program_suffix" test ".$ax_create_pkgconfig_suffix" != .NONE || ax_create_pkgconfig_suffix="" { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&5 $as_echo "${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig description" >&5 $as_echo_n "checking our pkgconfig description... " >&6; } ax_create_pkgconfig_description="$PACKAGE_SUMMARY" test ".$ax_create_pkgconfig_description" != "." || \ ax_create_pkgconfig_description="$ax_create_pkgconfig_libname Library" ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_description" >&5 $as_echo "$ax_create_pkgconfig_description" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig requires" >&5 $as_echo_n "checking our pkgconfig requires... " >&6; } ax_create_pkgconfig_requires="$PACKAGE_REQUIRES" ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_requires" >&5 $as_echo "$ax_create_pkgconfig_requires" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ext libs" >&5 $as_echo_n "checking our pkgconfig ext libs... " >&6; } ax_create_pkgconfig_pkglibs="$PACKAGE_LIBS" test ".$ax_create_pkgconfig_pkglibs" != "." || ax_create_pkgconfig_pkglibs="-l$ax_create_pkgconfig_libname" ax_create_pkgconfig_libs="$ax_create_pkgconfig_pkglibs $LIBS" ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libs" >&5 $as_echo "$ax_create_pkgconfig_libs" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig cppflags" >&5 $as_echo_n "checking our pkgconfig cppflags... " >&6; } ax_create_pkgconfig_cppflags="$CPPFLAGS $PACKAGE_CFLAGS" ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_cppflags" >&5 $as_echo "$ax_create_pkgconfig_cppflags" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ldflags" >&5 $as_echo_n "checking our pkgconfig ldflags... " >&6; } ax_create_pkgconfig_ldflags="$LDFLAGS $PACKAGE_LDFLAGS" ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_ldflags" >&5 $as_echo "$ax_create_pkgconfig_ldflags" >&6; } test ".$ax_create_pkgconfig_generate" != "." || \ ax_create_pkgconfig_generate="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` test "$pkgconfig_libfile" != "$ax_create_pkgconfig_generate" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: generate the pkgconfig later... $ax_create_pkgconfig_generate" >&5 $as_echo "generate the pkgconfig later... $ax_create_pkgconfig_generate" >&6; }) if test ".$ax_create_pkgconfig_src_libdir" = "." ; then ax_create_pkgconfig_src_libdir=`pwd` ax_create_pkgconfig_src_libdir=`$as_dirname -- "$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" || $as_expr X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_libdir/src || \ ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/src" case ".$objdir" in *libs) ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/$objdir" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&5 $as_echo "noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&6; } fi if test ".$ax_create_pkgconfig_src_headers" = "." ; then ax_create_pkgconfig_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) PKG_CONFIG_src_headers="" ;; esac ax_create_pkgconfig_src_headers=`$as_dirname -- "$ax_create_pkgconfig_src_headers/$v/x" || $as_expr X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_headers/$v/x" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_headers/include || \ ax_create_pkgconfig_src_headers="$ax_create_pkgconfig_src_headers/include" { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&5 $as_echo "noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&6; } fi ac_config_commands="$ac_config_commands $ax_create_pkgconfig_generate" ac_config_headers="$ac_config_headers config.h" ac_config_files="$ac_config_files Makefile include/Makefile include/polylib/Makefile include/polylib/polylib.h Test/Makefile Test/Zpolytest/Makefile Test/ehrhart/Makefile Test/ehrhart_union/Makefile Test/ranking/Makefile Test/general/Makefile Test/pp/Makefile polylib.doxygen" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then test "x$cache_file" != "x/dev/null" && { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} cat confcache >$cache_file else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : ${CONFIG_STATUS=./config.status} ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error ERROR [LINENO LOG_FD] # --------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with status $?, using 1 if that was 0. as_fn_error () { as_status=$?; test $as_status -eq 0 && as_status=1 if test "$3"; then as_lineno=${as_lineno-"$2"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $1" >&$3 fi $as_echo "$as_me: error: $1" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by polylib $as_me 5.22.5, which was generated by GNU Autoconf 2.65. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ polylib config.status 5.22.5 configured by $0, generated by GNU Autoconf 2.65, with options \\"\$ac_cs_config\\" Copyright (C) 2009 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "X$macro_version" | $Xsed -e "$delay_single_quote_subst"`' macro_revision='`$ECHO "X$macro_revision" | $Xsed -e "$delay_single_quote_subst"`' enable_shared='`$ECHO "X$enable_shared" | $Xsed -e "$delay_single_quote_subst"`' enable_static='`$ECHO "X$enable_static" | $Xsed -e "$delay_single_quote_subst"`' pic_mode='`$ECHO "X$pic_mode" | $Xsed -e "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "X$enable_fast_install" | $Xsed -e "$delay_single_quote_subst"`' host_alias='`$ECHO "X$host_alias" | $Xsed -e "$delay_single_quote_subst"`' host='`$ECHO "X$host" | $Xsed -e "$delay_single_quote_subst"`' host_os='`$ECHO "X$host_os" | $Xsed -e "$delay_single_quote_subst"`' build_alias='`$ECHO "X$build_alias" | $Xsed -e "$delay_single_quote_subst"`' build='`$ECHO "X$build" | $Xsed -e "$delay_single_quote_subst"`' build_os='`$ECHO "X$build_os" | $Xsed -e "$delay_single_quote_subst"`' SED='`$ECHO "X$SED" | $Xsed -e "$delay_single_quote_subst"`' Xsed='`$ECHO "X$Xsed" | $Xsed -e "$delay_single_quote_subst"`' GREP='`$ECHO "X$GREP" | $Xsed -e "$delay_single_quote_subst"`' EGREP='`$ECHO "X$EGREP" | $Xsed -e "$delay_single_quote_subst"`' FGREP='`$ECHO "X$FGREP" | $Xsed -e "$delay_single_quote_subst"`' LD='`$ECHO "X$LD" | $Xsed -e "$delay_single_quote_subst"`' NM='`$ECHO "X$NM" | $Xsed -e "$delay_single_quote_subst"`' LN_S='`$ECHO "X$LN_S" | $Xsed -e "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "X$max_cmd_len" | $Xsed -e "$delay_single_quote_subst"`' ac_objext='`$ECHO "X$ac_objext" | $Xsed -e "$delay_single_quote_subst"`' exeext='`$ECHO "X$exeext" | $Xsed -e "$delay_single_quote_subst"`' lt_unset='`$ECHO "X$lt_unset" | $Xsed -e "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "X$lt_SP2NL" | $Xsed -e "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "X$lt_NL2SP" | $Xsed -e "$delay_single_quote_subst"`' reload_flag='`$ECHO "X$reload_flag" | $Xsed -e "$delay_single_quote_subst"`' reload_cmds='`$ECHO "X$reload_cmds" | $Xsed -e "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "X$OBJDUMP" | $Xsed -e "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "X$deplibs_check_method" | $Xsed -e "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "X$file_magic_cmd" | $Xsed -e "$delay_single_quote_subst"`' AR='`$ECHO "X$AR" | $Xsed -e "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "X$AR_FLAGS" | $Xsed -e "$delay_single_quote_subst"`' STRIP='`$ECHO "X$STRIP" | $Xsed -e "$delay_single_quote_subst"`' RANLIB='`$ECHO "X$RANLIB" | $Xsed -e "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "X$old_postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "X$old_postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "X$old_archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' CC='`$ECHO "X$CC" | $Xsed -e "$delay_single_quote_subst"`' CFLAGS='`$ECHO "X$CFLAGS" | $Xsed -e "$delay_single_quote_subst"`' compiler='`$ECHO "X$compiler" | $Xsed -e "$delay_single_quote_subst"`' GCC='`$ECHO "X$GCC" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "X$lt_cv_sys_global_symbol_pipe" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "X$lt_cv_sys_global_symbol_to_cdecl" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "X$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' objdir='`$ECHO "X$objdir" | $Xsed -e "$delay_single_quote_subst"`' SHELL='`$ECHO "X$SHELL" | $Xsed -e "$delay_single_quote_subst"`' ECHO='`$ECHO "X$ECHO" | $Xsed -e "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "X$MAGIC_CMD" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "X$lt_prog_compiler_no_builtin_flag" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "X$lt_prog_compiler_wl" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "X$lt_prog_compiler_pic" | $Xsed -e "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "X$lt_prog_compiler_static" | $Xsed -e "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "X$lt_cv_prog_compiler_c_o" | $Xsed -e "$delay_single_quote_subst"`' need_locks='`$ECHO "X$need_locks" | $Xsed -e "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "X$DSYMUTIL" | $Xsed -e "$delay_single_quote_subst"`' NMEDIT='`$ECHO "X$NMEDIT" | $Xsed -e "$delay_single_quote_subst"`' LIPO='`$ECHO "X$LIPO" | $Xsed -e "$delay_single_quote_subst"`' OTOOL='`$ECHO "X$OTOOL" | $Xsed -e "$delay_single_quote_subst"`' OTOOL64='`$ECHO "X$OTOOL64" | $Xsed -e "$delay_single_quote_subst"`' libext='`$ECHO "X$libext" | $Xsed -e "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "X$shrext_cmds" | $Xsed -e "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "X$extract_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "X$archive_cmds_need_lc" | $Xsed -e "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "X$enable_shared_with_static_runtimes" | $Xsed -e "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "X$export_dynamic_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "X$whole_archive_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "X$compiler_needs_object" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "X$old_archive_from_new_cmds" | $Xsed -e "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "X$old_archive_from_expsyms_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_cmds='`$ECHO "X$archive_cmds" | $Xsed -e "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "X$archive_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_cmds='`$ECHO "X$module_cmds" | $Xsed -e "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "X$module_expsym_cmds" | $Xsed -e "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "X$with_gnu_ld" | $Xsed -e "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "X$allow_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "X$no_undefined_flag" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "X$hardcode_libdir_flag_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_ld='`$ECHO "X$hardcode_libdir_flag_spec_ld" | $Xsed -e "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "X$hardcode_libdir_separator" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "X$hardcode_direct" | $Xsed -e "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "X$hardcode_direct_absolute" | $Xsed -e "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "X$hardcode_minus_L" | $Xsed -e "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "X$hardcode_shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "X$hardcode_automatic" | $Xsed -e "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "X$inherit_rpath" | $Xsed -e "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "X$link_all_deplibs" | $Xsed -e "$delay_single_quote_subst"`' fix_srcfile_path='`$ECHO "X$fix_srcfile_path" | $Xsed -e "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "X$always_export_symbols" | $Xsed -e "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "X$export_symbols_cmds" | $Xsed -e "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "X$exclude_expsyms" | $Xsed -e "$delay_single_quote_subst"`' include_expsyms='`$ECHO "X$include_expsyms" | $Xsed -e "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "X$prelink_cmds" | $Xsed -e "$delay_single_quote_subst"`' file_list_spec='`$ECHO "X$file_list_spec" | $Xsed -e "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "X$variables_saved_for_relink" | $Xsed -e "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "X$need_lib_prefix" | $Xsed -e "$delay_single_quote_subst"`' need_version='`$ECHO "X$need_version" | $Xsed -e "$delay_single_quote_subst"`' version_type='`$ECHO "X$version_type" | $Xsed -e "$delay_single_quote_subst"`' runpath_var='`$ECHO "X$runpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "X$shlibpath_var" | $Xsed -e "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "X$shlibpath_overrides_runpath" | $Xsed -e "$delay_single_quote_subst"`' libname_spec='`$ECHO "X$libname_spec" | $Xsed -e "$delay_single_quote_subst"`' library_names_spec='`$ECHO "X$library_names_spec" | $Xsed -e "$delay_single_quote_subst"`' soname_spec='`$ECHO "X$soname_spec" | $Xsed -e "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "X$postinstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "X$postuninstall_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_cmds='`$ECHO "X$finish_cmds" | $Xsed -e "$delay_single_quote_subst"`' finish_eval='`$ECHO "X$finish_eval" | $Xsed -e "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "X$hardcode_into_libs" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "X$sys_lib_search_path_spec" | $Xsed -e "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "X$sys_lib_dlsearch_path_spec" | $Xsed -e "$delay_single_quote_subst"`' hardcode_action='`$ECHO "X$hardcode_action" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "X$enable_dlopen" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "X$enable_dlopen_self" | $Xsed -e "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "X$enable_dlopen_self_static" | $Xsed -e "$delay_single_quote_subst"`' old_striplib='`$ECHO "X$old_striplib" | $Xsed -e "$delay_single_quote_subst"`' striplib='`$ECHO "X$striplib" | $Xsed -e "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ AR \ AR_FLAGS \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ SHELL \ ECHO \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_wl \ lt_prog_compiler_pic \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_flag_spec_ld \ hardcode_libdir_separator \ fix_srcfile_path \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ finish_eval \ old_striplib \ striplib; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec; do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\$0 --fallback-echo"') lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\$0 --fallback-echo"\$/\$0 --fallback-echo"/'\` ;; esac ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; "$ax_create_pkgconfig_generate") CONFIG_COMMANDS="$CONFIG_COMMANDS $ax_create_pkgconfig_generate" ;; "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "include/Makefile") CONFIG_FILES="$CONFIG_FILES include/Makefile" ;; "include/polylib/Makefile") CONFIG_FILES="$CONFIG_FILES include/polylib/Makefile" ;; "include/polylib/polylib.h") CONFIG_FILES="$CONFIG_FILES include/polylib/polylib.h" ;; "Test/Makefile") CONFIG_FILES="$CONFIG_FILES Test/Makefile" ;; "Test/Zpolytest/Makefile") CONFIG_FILES="$CONFIG_FILES Test/Zpolytest/Makefile" ;; "Test/ehrhart/Makefile") CONFIG_FILES="$CONFIG_FILES Test/ehrhart/Makefile" ;; "Test/ehrhart_union/Makefile") CONFIG_FILES="$CONFIG_FILES Test/ehrhart_union/Makefile" ;; "Test/ranking/Makefile") CONFIG_FILES="$CONFIG_FILES Test/ranking/Makefile" ;; "Test/general/Makefile") CONFIG_FILES="$CONFIG_FILES Test/general/Makefile" ;; "Test/pp/Makefile") CONFIG_FILES="$CONFIG_FILES Test/pp/Makefile" ;; "polylib.doxygen") CONFIG_FILES="$CONFIG_FILES polylib.doxygen" ;; *) as_fn_error "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= trap 'exit_status=$? { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error "cannot create a temporary directory in ." "$LINENO" 5 # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '$'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$tmp/subs1.awk" > "$tmp/subs.awk" \ || as_fn_error "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=/{ s/:*\$(srcdir):*/:/ s/:*\${srcdir}:*/:/ s/:*@srcdir@:*/:/ s/^\([^=]*=[ ]*\):*/\1/ s/:*$// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_t=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_t"; then break elif $ac_last_try; then as_fn_error "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$tmp/stdin" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$tmp/subs.awk" >$tmp/out \ || as_fn_error "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' "$tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&2;} rm -f "$tmp/stdin" case $ac_file in -) cat "$tmp/out" && rm -f "$tmp/out";; *) rm -f "$ac_file" && mv "$tmp/out" "$ac_file";; esac \ || as_fn_error "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" } >"$tmp/config.h" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$tmp/config.h" "$ac_file" \ || as_fn_error "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags="" # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == "file_magic". file_magic_cmd=$lt_file_magic_cmd # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # The name of the directory that contains temporary libtool files. objdir=$objdir # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that does not interpret backslashes. ECHO=$lt_ECHO # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # If ld is used when linking, flag to hardcode \$libdir into a binary # during linking. This must work even if \$libdir does not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path=$lt_fix_srcfile_path # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain="$ac_aux_dir/ltmain.sh" # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $* )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[^=]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[^.]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$@"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$1" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1+=\$2" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$1=\$$1\$2" } _LT_EOF ;; esac sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ;; "$ax_create_pkgconfig_generate":C) pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_generate.in" >&5 $as_echo "$as_me: creating $pkgconfig_generate.in" >&6;} cat > $pkgconfig_generate.in <&5 $as_echo "$as_me: creating $pkgconfig_generate" >&6;} cat >conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then as_fn_error "$pkgconfig_generate is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit $? fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi echo "Polylib will be built with " $ALL_BITS "integer size(s)" echo "---------------------------------------------------" echo "You can proceed with:" echo "make :to build the libs and the executables" echo "make tests :to test the library" echo "make install :to install them (to $prefix)" echo "---------------------------------------------------" polylib-5.22.5.orig/install-sh0000755000175000017500000003246411171075110017107 0ustar sylvestresylvestre#!/bin/sh # install - install a program, script, or datafile scriptversion=2006-12-25.00 # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call `install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then trap '(exit $?); exit' 1 2 13 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names starting with `-'. case $src in -*) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # Protect names starting with `-'. case $dst in -*) dst=./$dst;; esac # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writeable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; -*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test -z "$d" && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: polylib-5.22.5.orig/source/0000755000175000017500000000000011341243117016375 5ustar sylvestresylvestrepolylib-5.22.5.orig/source/oldpolytest.c0000644000175000017500000004122211341227527021133 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* polytest.c */ #include #include /* alpha.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #include #include #include /*---------------------------------------------------------------------*/ /* int exist_points(pos,P,context) */ /* pos : index position of current loop index (0..hdim-1) */ /* P: loop domain */ /* context : context values for fixed indices */ /* recursive procedure, recurs for each imbriquation */ /* returns 1 if there exists any integer points in this polyhedron */ /* returns 0 if there are none */ /*---------------------------------------------------------------------*/ static int exist_points(int pos,Polyhedron *Pol,Value *context) { Value LB, UB, k,tmp; value_init(LB); value_init(UB); value_init(k); value_init(tmp); value_set_si(LB,0); value_set_si(UB,0); /* Problem if UB or LB is INFINITY */ if (lower_upper_bounds(pos,Pol,context,&LB,&UB) !=0) { errormsg1("exist_points", "infdom", "infinite domain"); value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return -1; } value_set_si(context[pos],0); if(value_lt(UB,LB)) { value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return 0; } if (!Pol->next) { value_subtract(tmp,UB,LB); value_increment(tmp,tmp); value_clear(UB); value_clear(LB); value_clear(k); return (value_pos_p(tmp)); } for (value_assign(k,LB);value_le(k,UB);value_increment(k,k)) { /* insert k in context */ value_assign(context[pos],k); if (exist_points(pos+1,Pol->next,context) > 0 ) { value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return 1; } } /* Reset context */ value_set_si(context[pos],0); value_clear(UB); value_clear(LB); value_clear(k); value_clear(tmp); return 0; } /*--------------------------------------------------------------*/ /* Test to see if there are any integral points in a polyhedron */ /*--------------------------------------------------------------*/ int Polyhedron_Not_Empty(Polyhedron *P,Polyhedron *C,int MAXRAYS) { int res,i; Value *context; Polyhedron *L; /* Create a context vector size dim+2 and set it to all zeros */ context = (Value *) malloc((P->Dimension+2)*sizeof(Value)); /* Initialize array 'context' */ for (i=0;i<(P->Dimension+2);i++) value_init(context[i]); Vector_Set(context,0,(P->Dimension+2)); /* Set context[P->Dimension+1] = 1 (the constant) */ value_set_si(context[P->Dimension+1],1); L = Polyhedron_Scan(P,C,MAXRAYS); res = exist_points(1,L,context); Domain_Free(L); /* Clear array 'context' */ for (i=0;i<(P->Dimension+2);i++) value_clear(context[i]); free(context); return res; } /* PolyhedronLTQ ( P1, P2 ) */ /* P1 and P2 must be simple polyhedra */ /* result = 0 --> not comparable */ /* result = -1 --> P1 < P2 */ /* result = 1 --> P1 > P2 */ int PolyhedronLTQ (Polyhedron *Pol1,Polyhedron *Pol2,int NbMaxConstrs) { int res, dim, i, j, k; Polyhedron *Q1, *Q2, *Q3, *Q; Matrix *Mat; #define INDEX 1 if (Pol1->next || Pol2->next) { errormsg1("PolyhedronLTQ", "compoly", "Can only compare polyhedra"); return 0; } if (Pol1->Dimension != Pol2->Dimension) { errormsg1("PolyhedronLTQ","diffdim","Polyhedra are not same dimension"); return 0; } dim = Pol1->Dimension+2; #ifdef DEBUG fprintf(stdout, "P1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Pol1); fprintf(stdout, "P2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Pol2); #endif /* Create the Line to add */ Mat = Matrix_Alloc(1,dim); Vector_Set(Mat->p_Init,0,dim); value_set_si(Mat->p[0][INDEX],1); /* line in INDEX dimension */ Q1 = AddRays(Mat->p[0],1,Pol1,NbMaxConstrs); Q2 = AddRays(Mat->p[0],1,Pol2,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q1); fprintf(stdout, "Q2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q2); #endif Matrix_Free(Mat); Q = DomainIntersection(Q1,Q2,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q); #endif Domain_Free(Q1); Domain_Free(Q2); if (emptyQ(Q)) res = 0; /* not comparable */ else { Q1 = DomainIntersection(Pol1,Q,NbMaxConstrs); Q2 = DomainIntersection(Pol2,Q,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q1); fprintf(stdout, "Q2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q2); #endif /* Test if Q1 < Q2 */ /* Build a constraint array for >= Q1 and <= Q2 */ Mat = Matrix_Alloc(2,dim); Vector_Set(Mat->p_Init,0,2*dim); /* Choose a contraint from Q1 */ for (i=0; iNbConstraints; i++) { if (value_zero_p(Q1->Constraint[i][0])) { /* Equality */ if (value_zero_p(Q1->Constraint[i][INDEX])) { /* Ignore side constraint (they are in Q) */ continue; } else if (value_neg_p(Q1->Constraint[i][INDEX])) { /* copy -constraint to Mat */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } else { /* Copy constraint to Mat */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } } else if(value_neg_p(Q1->Constraint[i][INDEX])) { /* Upper bound -- make a lower bound from it */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } else { /* Lower or side bound -- ignore it */ continue; } /* Choose a constraint from Q2 */ for (j=0; jNbConstraints; j++) { if (value_zero_p(Q2->Constraint[j][0])) { /* equality */ if (value_zero_p(Q2->Constraint[j][INDEX])) { /* Ignore side constraint (they are in Q) */ continue; } else if (value_pos_p(Q2->Constraint[j][INDEX])) { /* Copy -constraint to Mat */ value_set_si(Mat->p[1][0],1); for (k=1; kp[1][k],Q2->Constraint[j][k]); } else { /* Copy constraint to Mat */ value_set_si(Mat->p[1][0],1); for (k=1; kp[1][k],Q2->Constraint[j][k]); }; } else if (value_pos_p(Q2->Constraint[j][INDEX])) { /* Lower bound -- make an upper bound from it */ value_set_si(Mat->p[1][0],1); for(k=1;kp[1][k],Q2->Constraint[j][k]); } else { /* Upper or side bound -- ignore it */ continue; }; #ifdef DEBUG fprintf(stdout, "i=%d j=%d M=\n", i+1, j+1); Matrix_Print(stdout,P_VALUE_FMT,Mat); #endif /* Add Mat to Q and see if anything is made */ Q3 = AddConstraints(Mat->p[0],2,Q,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q3\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q3); #endif if (!emptyQ(Q3)) { Domain_Free(Q3); #ifdef DEBUG fprintf(stdout, "not empty\n"); #endif res = -1; goto LTQdone; } #ifdef DEBUG fprintf(stdout,"empty\n"); #endif Domain_Free(Q3); } /* end for j */ } /* end for i */ res = 1; LTQdone: Matrix_Free(Mat); Domain_Free(Q1); Domain_Free(Q2); } Domain_Free(Q); #ifdef DEBUG fprintf(stdout, "res = %d\n", res); #endif return res; } /* PolyhedronLTQ */ /* GaussSimplify -- Given Mat1, a matrix of equalities, performs Gaussian elimination. Find a minimum basis, Returns the rank. Mat1 is context, Mat2 is reduced in context of Mat1 */ int GaussSimplify(Matrix *Mat1,Matrix *Mat2) { int NbRows = Mat1->NbRows; int NbCols = Mat1->NbColumns; int *column_index; int i, j, k, n, pivot, Rank; Value gcd, tmp, *cp; column_index=(int *)malloc(NbCols * sizeof(int)); if (!column_index) { errormsg1("GaussSimplify", "outofmem", "out of memory space\n"); Pol_status = 1; return 0; } /* Initialize all the 'Value' variables */ value_init(gcd); value_init(tmp); Rank=0; for (j=0; jp[i][j])) /* the first non-zero entry */ break; if (i!=NbRows) { /* was one found ? */ if (i!=Rank) /* was it found below the diagonal?*/ Vector_Exchange(Mat1->p[Rank],Mat1->p[i],NbCols); /* Normalize the pivot row */ Vector_Gcd(Mat1->p[Rank],NbCols,&gcd); /* If (gcd >= 2) */ value_set_si(tmp,2); if (value_ge(gcd,tmp)) { cp = Mat1->p[Rank]; for (k=0; kp[Rank][j])) { cp = Mat1->p[Rank]; for (k=0; kp[i][j])) { Value a, a1, a2; value_init(a); value_init(a1); value_init(a2); value_absolute(a1,Mat1->p[i][j]); value_absolute(a2,Mat1->p[Rank][j]); value_gcd(a, a1, a2)); value_divexact(a1, a1, a); value_divexact(a2, a2, a); value_oppose(a1,a1); Vector_Combine(Mat1->p[i],Mat1->p[Rank],Mat1->p[i],a2, a1,NbCols); Vector_Normalize(Mat1->p[i],NbCols); value_clear(a); value_clear(a1); value_clear(a2); } } column_index[Rank]=j; Rank++; } } /* end of Gauss elimination */ if (Mat2) { /* Mat2 is a transformation matrix (i,j->f(i,j)).... can't scale it because can't scale both sides of -> */ /* normalizes an affine transformation */ /* priority of forms */ /* 1. i' -> i (identity) */ /* 2. i' -> i + constant (uniform) */ /* 3. i' -> constant (broadcast) */ /* 4. i' -> j (permutation) */ /* 5. i' -> j + constant ( ) */ /* 6. i' -> i + j + constant (non-uniform) */ for (k=0; kNbRows-1);i++) { /* all but the last row 0...0 1 */ if ((i!=j) && value_notzero_p(Mat2->p[i][j])) { /* Remove dependency of i' on j */ Value a, a1, a2; value_init(a); value_init(a1); value_init(a2); value_absolute(a1,Mat2->p[i][j]); value_absolute(a2,Mat2->p[k][j]); value_gcd(a, a1, a2); value_divexact(a1, a1, a); value_divexact(a2, a2, a); value_oppose(a1,a1); if (value_one_p(a2)) { Vector_Combine(Mat2->p[i],Mat1->p[k],Mat2->p[i],a2, a1,NbCols); /* Vector_Normalize(Mat2->p[i],NbCols); -- can't do T */ } /* otherwise, can't do it without mult lhs prod (2i,3j->...) */ value_clear(a); value_clear(a1); value_clear(a2); } else if ((i==j) && value_zero_p(Mat2->p[i][j])) { /* 'i' does not depend on j */ for (n=j+1; n < (NbCols-1); n++) { if (value_notzero_p(Mat2->p[i][n])) { /* i' depends on some n */ value_set_si(tmp,1); Vector_Combine(Mat2->p[i],Mat1->p[k],Mat2->p[i],tmp, tmp,NbCols); break; } /* if 'i' depends on just a constant, then leave it alone.*/ } } } } /* Check last row of transformation Mat2 */ for (j=0; j<(NbCols-1); j++) if (value_notzero_p(Mat2->p[Mat2->NbRows-1][j])) { errormsg1("GaussSimplify", "corrtrans", "Corrupted transformation\n"); break; } if (value_notone_p(Mat2->p[Mat2->NbRows-1][NbCols-1])) { errormsg1("GaussSimplify", "corrtrans", "Corrupted transformation\n"); } } value_clear(gcd); value_clear(tmp); free(column_index); return Rank; } /* GaussSimplify */ char s[128]; int main() { Matrix *a=NULL, *b=NULL, *c, *d, *e, *f; Polyhedron *A, *B, *C, *D, *last, *tmp; int i, nbPol, nbMat, func; fgets(s, 128, stdin); nbPol = nbMat = 0; while ((*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); for (i=0, A=last=(Polyhedron *)0; inext = tmp; last = tmp; } } if (nbMat) { a = Matrix_Read(); } fgets(s,128,stdin); nbPol = nbMat = 0; while ( (*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); for (i=0, B=last=(Polyhedron *)0; inext = tmp; last = tmp; } } if (nbMat) { b = Matrix_Read(); } fgets(s, 128, stdin); while ((*s=='#') || (sscanf(s, "F %d", &func)<1)) fgets(s, 128, stdin); switch (func) { case 1: C = DomainUnion(A, B, 200); D = DomainConvex(C, 200); d = Polyhedron2Constraints(D); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Free(d); Domain_Free(C); Domain_Free(D); break; case 2: D = DomainSimplify(A, B, 200); d = Polyhedron2Constraints(D); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Free(d); Domain_Free(D); break; case 3: a = Polyhedron2Constraints(A); Matrix_Print(stdout,P_VALUE_FMT,a); b = Polyhedron2Constraints(B); Matrix_Print(stdout,P_VALUE_FMT,b); break; case 4: a = Polyhedron2Rays(A); Matrix_Print(stdout,P_VALUE_FMT,a); break; case 5: /* a = ec , da = c , ed = 1 */ right_hermite(a,&c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT,c); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Print(stdout,P_VALUE_FMT,e); f = Matrix_Alloc(e->NbRows,c->NbColumns); Matrix_Product(e,c,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(d->NbRows,a->NbColumns); Matrix_Product(d,a,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(e->NbRows, d->NbColumns); Matrix_Product(e,d,f); Matrix_Print(stdout,P_VALUE_FMT,f); break; case 6: /* a = ce , ad = c , de = 1 */ left_hermite(a,&c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT,c); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Print(stdout,P_VALUE_FMT,e); f = Matrix_Alloc(c->NbRows, e->NbColumns); Matrix_Product(c,e,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(a->NbRows, d->NbColumns); Matrix_Product(a,d,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(d->NbRows, e->NbColumns); Matrix_Product(d,e,f); Matrix_Print(stdout,P_VALUE_FMT,f); break; case 7: /* Polyhedron_Print(stdout,"%5d", A); */ /* Matrix_Print(stdout,"%4d", b); */ C = Polyhedron_Image(A, b, 400); Polyhedron_Print(stdout,P_VALUE_FMT,C); break; case 8: printf("%s\n", Polyhedron_Not_Empty(A,B,600) ? "Not Empty" : "Empty"); break; case 9: i = PolyhedronLTQ(A,B,600); printf("%s\n", i==-1 ? "AB" : i==0 ? "A>B" : i==0 ? "A>. */ /*************************************************/ /* count.c */ /* program to count the number of points */ /* in a parameterized polytope */ /* */ /* input : polytope */ /* context */ /* */ /* written by Vincent Loechner, aug. 2000. */ /* loechner@icps.u-strasbg.fr */ /*************************************************/ #include #include #include #include #define MAXRAYS 1024 /****************************************************************/ int main(int argc,char *argv[]) { Matrix *C1, *P1; Polyhedron *C, *P, *S; Polyhedron *CC, *PP; Enumeration *en; Value *p; int i,j,k; int m,M; char str[1024]; Value c; /******* Read the input *********/ P1 = Matrix_Read(); C1 = Matrix_Read(); if(C1->NbColumns < 2) { fprintf(stderr,"Not enough parameters !\n"); exit(0); } P = Constraints2Polyhedron(P1, MAXRAYS); C = Constraints2Polyhedron(C1, MAXRAYS); Matrix_Free(C1); Matrix_Free(P1); /******* Compute the true context *******/ CC = align_context(C,P->Dimension,MAXRAYS); PP = DomainIntersection(P,CC,MAXRAYS); Domain_Free(CC); C1 = Matrix_Alloc(C->Dimension+1,P->Dimension+1); for(i=0;iNbRows;i++) for(j=0;jNbColumns;j++) if(i==j-P->Dimension+C->Dimension) value_set_si(C1->p[i][j],1); else value_set_si(C1->p[i][j],0); CC = Polyhedron_Image(PP,C1,MAXRAYS); Domain_Free(C); Domain_Free(PP); Matrix_Free(C1); C = CC; /******* Initialize parameters *********/ p = (Value *)malloc(sizeof(Value) * (P->Dimension+2)); for(i=0;i<=P->Dimension;i++) { value_init(p[i]); value_set_si(p[i],0); } value_init(p[i]); value_set_si(p[i],1); /*** S = scanning list of polyhedra ***/ S = Polyhedron_Scan(P,C,MAXRAYS); value_init(c); /******* Count now *********/ FOREVER { fflush(stdin); printf("Enter %d parameters : ",C->Dimension); for(k=S->Dimension-C->Dimension+1;k<=S->Dimension;++k) { scanf(" %s", str); value_read(p[k],str); } printf("EP( "); value_print(stdout,VALUE_FMT,p[S->Dimension-C->Dimension+1]); for(k=S->Dimension-C->Dimension+2;k<=S->Dimension;++k) { printf(", "); value_print(stdout,VALUE_FMT,p[k]); } printf(" ) = "); count_points(1,S,p,&c); value_print(stdout,VALUE_FMT,c); printf("\n"); } for(i=0;i<=(P->Dimension+1);i++) value_clear(p[i]); value_clear(c); return(0); } /* main */ polylib-5.22.5.orig/source/kernel/0000755000175000017500000000000011341243106017653 5ustar sylvestresylvestrepolylib-5.22.5.orig/source/kernel/Zpolyhedron.c0000644000175000017500000007145511341227527022361 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include static ZPolyhedron * ZPolyhedronIntersection(ZPolyhedron *, ZPolyhedron *); static ZPolyhedron *ZPolyhedron_Copy(ZPolyhedron *A); static void ZPolyhedron_Free(ZPolyhedron *Zpol); static ZPolyhedron * ZPolyhedronDifference(ZPolyhedron *, ZPolyhedron *); static ZPolyhedron * ZPolyhedronImage(ZPolyhedron *, Matrix *); static ZPolyhedron * ZPolyhedronPreimage(ZPolyhedron *, Matrix *); static ZPolyhedron *AddZPolytoZDomain(ZPolyhedron *A, ZPolyhedron *Head); static void ZPolyhedronPrint(FILE *fp, const char *format, ZPolyhedron *A); typedef struct forsimplify { Polyhedron *Pol; LatticeUnion *LatUni; struct forsimplify *next; } ForSimplify; /* * Returns True if 'Zpol' is empty, otherwise returns False */ Bool isEmptyZPolyhedron (ZPolyhedron *Zpol) { if(Zpol == NULL) return True; if((isEmptyLattice (Zpol->Lat)) || (emptyQ(Zpol->P))) return True; return False; } /* isEmptyZPolyhedron */ /* * Given Lattice 'Lat' and a Polyhderon 'Poly', allocate space, and return * the Z-polyhderon corresponding to the image of the polyhderon 'Poly' by the * lattice 'Lat'. If the input lattice 'Lat' is not integeral, it integralises * it, i.e. the lattice of the Z-polyhderon returned is integeral. */ ZPolyhedron *ZPolyhedron_Alloc(Lattice *Lat, Polyhedron *Poly) { ZPolyhedron *A; POL_ENSURE_FACETS(Poly); POL_ENSURE_VERTICES(Poly); if(Lat->NbRows != Poly->Dimension+1) { fprintf(stderr,"\nInZPolyAlloc - The Lattice and the Polyhedron"); fprintf(stderr," are not compatible to form a ZPolyhedra\n"); return NULL; } if((!(isEmptyLattice(Lat))) && (!isfulldim (Lat))) { fprintf(stderr,"\nZPolAlloc: Lattice not Full Dimensional\n"); return NULL; } A = (ZPolyhedron *)malloc(sizeof(ZPolyhedron)); if (!A) { fprintf(stderr,"ZPolAlloc : Out of Memory\n"); return NULL; } A->next = NULL; A->P = Domain_Copy(Poly); A->Lat = Matrix_Copy(Lat); if(IsLattice(Lat) == False) { ZPolyhedron *Res; Res = IntegraliseLattice (A); ZPolyhedron_Free (A); return Res; } return A; } /* ZPolyhedron_Alloc */ /* * Free the memory used by the Z-domain 'Head' */ void ZDomain_Free (ZPolyhedron *Head) { if (Head == NULL) return; if (Head->next != NULL) ZDomain_Free(Head->next); ZPolyhedron_Free(Head); } /* ZDomain_Free */ /* * Free the memory used by the Z-polyhderon 'Zpol' */ static void ZPolyhedron_Free (ZPolyhedron *Zpol) { if (Zpol == NULL) return; Matrix_Free((Matrix *) Zpol->Lat); Domain_Free(Zpol->P); free(Zpol); return; } /* ZPolyhderon_Free */ /* * Return a copy of the Z-domain 'Head' */ ZPolyhedron *ZDomain_Copy(ZPolyhedron *Head) { ZPolyhedron *Zpol; Zpol = ZPolyhedron_Copy(Head); if (Head->next != NULL) Zpol->next = ZDomain_Copy(Head->next); return Zpol; } /* ZDomain_Copy */ /* * Return a copy of the Z-polyhderon 'A' */ static ZPolyhedron *ZPolyhedron_Copy(ZPolyhedron *A) { ZPolyhedron *Zpol; Zpol = ZPolyhedron_Alloc(A->Lat, A->P); return Zpol; } /* ZPolyhderon_Copy */ /* * Add the ZPolyhedron 'Zpol' to the Z-domain 'Result' and return a pointer * to the new Z-domain. */ static ZPolyhedron *AddZPoly2ZDomain(ZPolyhedron *Zpol, ZPolyhedron *Result) { ZPolyhedron *A; if (isEmptyZPolyhedron(Zpol)) return Result; A = ZPolyhedron_Copy(Zpol); A->next = NULL; if (isEmptyZPolyhedron (Result)) { ZDomain_Free (Result); return A; } A->next = Result; return A; } /* AddZPoly2ZDomain */ /* * Given a Z-polyhderon 'A' and a Z-domain 'Head', return a new Z-domain with * 'A' added to it. If the new Z-polyhedron 'A', is already included in the * Z-domain 'Head', it is not added in the list. Othewise, the function checks * if the new Z-polyhedron 'A' to be added to the Z-domain 'Head' has a common * lattice with some other Z-polyhderon already present in the Z-domain. If it * is so, it takes the union of the underlying polyhdera; domains and returns. * The function tries to make sure that the added Z-polyhedron 'A' is in the * canonical form. */ static ZPolyhedron *AddZPolytoZDomain(ZPolyhedron *A, ZPolyhedron *Head) { ZPolyhedron *Zpol, *temp, *temp1; Polyhedron *i; Bool Added; if ((A == NULL) || (isEmptyZPolyhedron(A))) return Head; /* For each "underlying" Pol, find the Cnf and add Zpol in Cnf*/ for(i=A->P; i!= NULL; i=i->next) { ZPolyhedron *Z, *Z1; Polyhedron *Image; Matrix *H, *U; Lattice *Lat ; Added = False; Image = Domain_Copy(i); Domain_Free(Image->next); Image->next = NULL; Z1 = ZPolyhedron_Alloc(A->Lat,Image); Domain_Free(Image); CanonicalForm(Z1,&Z,&H); ZDomain_Free(Z1); Lat = (Lattice *)Matrix_Alloc(H->NbRows,Z->Lat->NbColumns); Matrix_Product(H,Z->Lat,(Matrix *)Lat); Matrix_Free(H); AffineHermite(Lat,(Lattice **)&H,&U); Image = DomainImage(Z->P,U,MAXNOOFRAYS); ZDomain_Free(Z); Zpol=ZPolyhedron_Alloc((Lattice *)H,Image); Domain_Free(Image); Matrix_Free((Matrix *)Lat); Matrix_Free(H); Matrix_Free(U); if ((Head == NULL) || (isEmptyZPolyhedron (Head))) { Head = Zpol; continue; } temp1 = temp = Head; /* Check if the curr pol is included in the zpol or vice versa. */ for(; temp != NULL; temp = temp->next) { if (ZPolyhedronIncludes(Zpol, temp) == True) { ZPolyhedron_Free (Zpol); Added = True; break; } else if (ZPolyhedronIncludes(temp, Zpol) == True) { if (temp == Head) { Zpol->next = temp->next; Head = Zpol; ZPolyhedron_Free (temp); Added = True; break; } temp1->next = Zpol; Zpol->next = temp->next; ZPolyhedron_Free (temp); Added = True; break ; } temp1 = temp ; } if(Added == True) continue ; for(temp = Head; temp != NULL; temp = temp->next) { if(sameLattice(temp->Lat, Zpol->Lat) == True) { Polyhedron *Union; Union = DomainUnion (temp->P,Zpol->P,MAXNOOFRAYS); if (!Union) fprintf (stderr,"\n In AddZPolytoZDomain: Out of memory\n"); else { Domain_Free(temp->P); temp->P = Union; Added = True; ZPolyhedron_Free(Zpol); } break ; } temp1 = temp; } if (Added == False) temp1->next = Zpol; } return Head ; } /* AddZPolytoZDomain */ /* * Return the empty Z-polyhedron of dimension 'dimension' */ ZPolyhedron *EmptyZPolyhedron(int dimension) { ZPolyhedron *Zpol; Lattice *E ; Polyhedron *P; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered EMPTYZPOLYHEDRON\n"); fclose (fp); #endif E = EmptyLattice(dimension+1); P = Empty_Polyhedron(dimension); Zpol = ZPolyhedron_Alloc(E,P); Matrix_Free((Matrix *) E); Domain_Free(P); return Zpol; } /* EmptyZPolyhedron */ /* * Given Z-domains 'A' and 'B', return True if A is included in 'B', otherwise * return False. */ Bool ZDomainIncludes(ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Diff; Bool ret = False; Diff = ZDomainDifference(A,B); if (isEmptyZPolyhedron(Diff)) ret = True; ZDomain_Free(Diff); return ret; } /* ZDomainIncludes */ /* * Given Z-polyhedra 'A' and 'B', return True if 'A' is included in 'B', * otherwise return False */ Bool ZPolyhedronIncludes(ZPolyhedron *A, ZPolyhedron *B) { Polyhedron *Diff = NULL ; Bool retval = False; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered ZPOLYHEDRONINCLUDES\n"); fclose(fp); #endif if (LatticeIncludes(A->Lat, B->Lat) == True) { Polyhedron *ImageA, *ImageB ; ImageA = DomainImage(A->P,A->Lat,MAXNOOFRAYS); ImageB = DomainImage(B->P,B->Lat,MAXNOOFRAYS); Diff = DomainDifference(ImageA, ImageB, MAXNOOFRAYS); if(emptyQ (Diff)) retval = True ; Domain_Free (ImageA); Domain_Free (ImageB); Domain_Free (Diff); } return retval; } /* ZPolyhedronIncludes */ /* * Print the contents of a Z-domain 'A' */ void ZDomainPrint(FILE *fp, const char *format, ZPolyhedron *A) { #ifdef DOMDEBUG FILE *fp1; fp1 = fopen("_debug", "a"); fprintf(fp1,"\nEntered ZDOMAINPRINT\n"); fclose(fp1); #endif ZPolyhedronPrint(fp,format,A); if (A->next != NULL) { fprintf(fp,"\nUNIONED with\n"); ZDomainPrint(fp,format,A->next); } return; } /* ZDomainPrint */ /* * Print the contents of a ZPolyhderon 'A' */ static void ZPolyhedronPrint (FILE *fp, const char *format, ZPolyhedron *A) { if (A == NULL) return ; fprintf(fp,"\nZPOLYHEDRON: Dimension %d \n",A->Lat->NbRows-1); fprintf(fp, "\nLATTICE: \n"); Matrix_Print(fp,format,(Matrix *)A->Lat); Polyhedron_Print(fp,format,A->P); return; } /* ZPolyhedronPrint */ /* * Return the Z-domain union of the Z-domain 'A' and 'B'. The dimensions of the * Z-domains 'A' and 'B' must be equal. All the Z-polyhedra of the resulting * union are expected to be in Canonical forms. */ ZPolyhedron *ZDomainUnion (ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Result = NULL, *temp; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZDOMAINUNION\n"); fclose(fp); #endif for(temp = A; temp != NULL; temp = temp->next) Result = AddZPolytoZDomain(temp, Result); for(temp = B; temp != NULL; temp = temp->next ) Result = AddZPolytoZDomain(temp, Result); return Result; } /* ZDomainUnion */ /* * Return the Z-domain intersection of the Z-domains 'A' and 'B'.The dimensions * of domains 'A' and 'B' must be equal. */ ZPolyhedron *ZDomainIntersection (ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Result = NULL, *tempA = NULL, *tempB = NULL; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZDOMAININTERSECTION\n"); fclose(fp); #endif for(tempA = A; tempA != NULL; tempA = tempA->next) for(tempB = B; tempB != NULL; tempB = tempB->next) { ZPolyhedron *Zpol; Zpol = ZPolyhedronIntersection(tempA, tempB); Result = AddZPolytoZDomain(Zpol, Result ); ZPolyhedron_Free (Zpol); } if (Result == NULL) return EmptyZPolyhedron (A->Lat->NbRows-1); return Result; } /* ZDomainIntersection */ /* * Return the Z-domain difference of the domains 'A' and 'B'. The dimensions of * the Z-domains 'A' and 'B' must be equal. Note that the difference of two * Z-polyhedra is a Union of Z-polyhedra. The algorithms is as given below :- * Algorithm: (Given Z-domains A and B) * Result <-- NULL * for every Z-polyhderon Zpoly of A { * temp <-- Zpoly; * for every Z-polyhderon Z1 of B * temp = temp - Z1; * } * Add temp to Result; * return; */ ZPolyhedron *ZDomainDifference(ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Result = NULL, *tempA = NULL, *tempB = NULL; ZPolyhedron *templist, *res, *i, *j; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZDOMAINDIFFERENCE\n"); fclose(fp); #endif if (A->Lat->NbRows != B->Lat->NbRows) { fprintf(stderr, "In ZDomainDifference : the input ZDomains "); fprintf(stderr, "do not have compatible dimensions\n"); fprintf(stderr, "ZDomainDifference not performed\n"); return NULL; } for(tempA = A; tempA != NULL; tempA = tempA->next) { ZPolyhedron *temp = NULL; temp = ZPolyhedron_Copy(tempA); for(tempB = B; tempB != NULL; tempB = tempB->next) { templist = NULL; res = NULL; for(i = temp; i != NULL; i = i->next) { res = ZPolyhedronDifference(i,tempB); for (j = res; j != NULL; j = j->next ) templist = AddZPoly2ZDomain(j,templist); ZDomain_Free(res); } ZDomain_Free (temp); temp = NULL; for(i = templist; i != NULL; i = i->next) temp = AddZPoly2ZDomain(i, temp); ZDomain_Free (templist); } for(i = temp; i != NULL; i = i->next) Result = AddZPolytoZDomain(i, Result); ZDomain_Free(temp); } if (Result==NULL) return (EmptyZPolyhedron(A->Lat->NbRows-1)); return Result; } /* ZDomainDifference */ /* * Return the image of the Z-domain 'A' under the invertible, affine, rational * transformation function 'Func'. The matrix representing the function 'Func' * must be non-singular and the number of rows of the function must be equal * to the number of rows in the matrix representing the lattice of 'A'. * Note:: Image((Z1 U Z2),F) = Image(Z1,F) U Image(Z2 U F). */ ZPolyhedron *ZDomainImage (ZPolyhedron *A, Matrix *Func) { ZPolyhedron *Result = NULL, *temp; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered ZDOMAINIMAGE\n"); fclose (fp); #endif for(temp = A; temp != NULL; temp = temp->next) { ZPolyhedron *Zpol; Zpol = ZPolyhedronImage (temp, Func); Result = AddZPolytoZDomain (Zpol, Result); ZPolyhedron_Free (Zpol); } if(Result == NULL) return EmptyZPolyhedron(A->Lat->NbRows-1); return Result; } /* ZDomainImage */ /* * Return the preimage of the Z-domain 'A' under the invertible, affine, ratio- * nal transformation 'Func'. The number of rows of the matrix representing * the function 'Func' must be equal to the number of rows of the matrix repr- * senting the lattice of 'A'. */ ZPolyhedron *ZDomainPreimage (ZPolyhedron *A, Matrix *Func) { ZPolyhedron *Result = NULL, *temp ; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZDOMAINPREIMAGE\n"); fclose(fp); #endif if (A->Lat->NbRows != Func->NbRows) { fprintf(stderr,"\nError : In ZDomainPreimage, "); fprintf(stderr,"Incompatible dimensions of ZPolyhedron "); fprintf(stderr,"and the Function \n"); return(EmptyZPolyhedron(Func->NbColumns-1)); } for(temp = A; temp != NULL; temp = temp->next) { ZPolyhedron *Zpol; Zpol = ZPolyhedronPreimage(temp, Func); Result = AddZPolytoZDomain(Zpol, Result); ZPolyhedron_Free(Zpol); } if (Result == NULL) return(EmptyZPolyhedron(Func->NbColumns-1)); return Result; } /* ZDomainPreimage */ /* * Return the Z-polyhedron intersection of the Z-polyhedra 'A' and 'B'. * Note: If Z1 = L1 (intersect) P1 and Z2 = L2 (intersect) P2, then * Z1 (intersect) Z2 = (L1 (intersect) L2) (intersect) (P1 (intersect) P2) */ static ZPolyhedron *ZPolyhedronIntersection(ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Result = NULL; Lattice *LInter; Polyhedron *PInter, *ImageA, *ImageB, *PreImage; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered ZPOLYHEDRONINTERSECTION\n"); fclose(fp); #endif LInter = LatticeIntersection(A->Lat,B->Lat); if(isEmptyLattice(LInter) == True) { ZPolyhedron_Free (Result); Matrix_Free(LInter); return (EmptyZPolyhedron(A->Lat->NbRows-1)); } ImageA = DomainImage(A->P,A->Lat,MAXNOOFRAYS); ImageB = DomainImage(B->P,B->Lat,MAXNOOFRAYS); PInter = DomainIntersection(ImageA,ImageB,MAXNOOFRAYS); if (emptyQ(PInter)) Result = EmptyZPolyhedron(LInter->NbRows-1); else { PreImage = DomainPreimage(PInter,(Matrix *)LInter,MAXNOOFRAYS); Result = ZPolyhedron_Alloc(LInter, PreImage); Domain_Free (PreImage); } Matrix_Free(LInter); Domain_Free(PInter); Domain_Free(ImageA); Domain_Free(ImageB); return Result ; } /* ZPolyhedronIntersection */ /* * Return the difference of the two Z-polyhedra 'A' and 'B'. Below is the * procedure to find the difference of 'A' and 'B' :- * Procedure: * Let A = L1 (intersect) P1' and B = L2 (intersect) P2' where * (P1' = DomImage(P1,L1) and P2' = DomImage(P2,L2)). Then * A-B = L1 (intersect) (P1'-P2') Union * (L1-L2) (intersect) (P1' (intersect) P2') */ static ZPolyhedron *ZPolyhedronDifference(ZPolyhedron *A, ZPolyhedron *B) { ZPolyhedron *Result = NULL ; LatticeUnion *LatDiff, *temp; Polyhedron *DomDiff, *DomInter, *PreImage, *ImageA, *ImageB; Bool flag = False; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZPOLYHEDRONDIFFERENCE\n"); fclose(fp); #endif if(isEmptyZPolyhedron (A)) return NULL; if(isEmptyZPolyhedron (B)) { Result = ZDomain_Copy (A); return Result; } ImageA = DomainImage(A->P,(Matrix *)A->Lat,MAXNOOFRAYS); ImageB = DomainImage(B->P,(Matrix *)B->Lat,MAXNOOFRAYS); DomDiff = DomainDifference(ImageA,ImageB,MAXNOOFRAYS); if (emptyQ (DomDiff)) flag = True; else { ZPolyhedron *Z; PreImage = DomainPreimage(DomDiff,A->Lat,MAXNOOFRAYS); Z = ZPolyhedron_Alloc(A->Lat,PreImage); Result = AddZPolytoZDomain(Z,Result); } if (flag == True) /* DomDiff = NULL; DomInter = A */ DomInter = Domain_Copy(ImageA); else { DomInter = DomainIntersection(ImageA,ImageB,MAXNOOFRAYS); if (emptyQ(DomInter)) { if (flag == True) return (EmptyZPolyhedron(A->Lat->NbRows-1)); else return Result; } } LatDiff = LatticeDifference(A->Lat, B->Lat); if(LatDiff == NULL) if(flag == True ) return(EmptyZPolyhedron (A->Lat->NbRows-1)); while (LatDiff != NULL) { ZPolyhedron *tempZ = NULL; PreImage = DomainPreimage(DomInter, LatDiff->M, MAXNOOFRAYS); tempZ = ZPolyhedron_Alloc(LatDiff->M, PreImage); Domain_Free(PreImage); Result = AddZPoly2ZDomain(tempZ,Result); ZPolyhedron_Free(tempZ); temp = LatDiff; LatDiff = LatDiff->next; Matrix_Free ((Matrix *) temp->M); free (temp); } Domain_Free (DomInter); Domain_Free (DomDiff); return Result; } /* ZPolyhedronDifference */ /* * Return the image of the Z-polyhedron 'ZPol' under the invertible, affine, * rational transformation function 'Func'. The matrix representing the funct- * ion must be non-singular and the number of rows of the function must be * equal to the number of rows in the matrix representing the lattice of 'ZPol' * Algorithm: * 1) Let ZPol = L (intersect) Q * 2) L1 = LatticeImage(L,F) * 3) Q1 = DomainImage(Q,F) * 4) Z1 = L1(Inverse(L1)*Q1) * 5) Return Z1 */ static ZPolyhedron *ZPolyhedronImage(ZPolyhedron *ZPol,Matrix *Func) { ZPolyhedron *Result = NULL ; Matrix *LatIm ; Polyhedron *Pol, *PolImage ; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ZPOLYHEDRONIMAGE\n"); fclose(fp); #endif if ((Func->NbRows != ZPol->Lat->NbRows) || (Func->NbColumns != ZPol->Lat->NbColumns)) { fprintf (stderr, "In ZPolImage - The Function, is not compatible with the ZPolyhedron\n"); return NULL; } LatIm = LatticeImage(ZPol->Lat,Func); if (isEmptyLattice(LatIm)) { Matrix_Free(LatIm); return NULL; } Pol = DomainImage(ZPol->P,ZPol->Lat,MAXNOOFRAYS); PolImage = DomainImage(Pol,Func,MAXNOOFRAYS); Domain_Free(Pol); if(emptyQ(PolImage)) { Matrix_Free (LatIm); Domain_Free (PolImage); return NULL; } Pol = DomainPreimage(PolImage,LatIm,MAXNOOFRAYS); Result = ZPolyhedron_Alloc(LatIm,Pol); Domain_Free(Pol); Domain_Free(PolImage); Matrix_Free(LatIm); return Result; } /* ZPolyhedronImage */ /* * Return the preimage of the Z-polyhedron 'Zpol' under an affine transformati- * on function 'G'. The number of rows of matrix representing the function 'G', * must be equal to the number of rows of the matrix representing the lattice * of Z1. * Algorithm: * 1) Let Zpol = L (intersect) Q * 2) L1 =LatticePreimage(L,F); * 3) Q1 = DomainPreimage(Q,F); * 4) Z1 = L1(Inverse(L1)*Q1); * 5) Return Z1 */ static ZPolyhedron *ZPolyhedronPreimage(ZPolyhedron *Zpol, Matrix *G) { Lattice *Latpreim; Polyhedron *Qprime, *Q, *Polpreim; ZPolyhedron *Result; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered ZPOLYHEDRONPREIMAGE\n"); fclose(fp); #endif if(G->NbRows != Zpol->Lat->NbRows) { fprintf(stderr,"\nIn ZPolyhedronPreimage: Error, The dimensions of the "); fprintf(stderr,"function are not compatible with that of the Zpolyhedron"); return EmptyZPolyhedron(G->NbColumns-1); } Q = DomainImage(Zpol->P,Zpol->Lat,MAXNOOFRAYS); Polpreim = DomainPreimage(Q,G,MAXNOOFRAYS); if (emptyQ(Polpreim)) Result = NULL; else { Latpreim = LatticePreimage(Zpol->Lat,G); if(isEmptyLattice(Latpreim)) Result = NULL; else { Qprime = DomainPreimage(Polpreim, Latpreim, MAXNOOFRAYS); Result = ZPolyhedron_Alloc(Latpreim, Qprime); Domain_Free(Qprime); } Matrix_Free(Latpreim); } Domain_Free(Q); return Result; } /* ZPolyhedronPreimage */ /* * Return the Z-polyhderon 'Zpol' in canonical form: 'Result' (for the Z-poly- * hedron in canonical form) and Basis 'Basis' (for the basis with respect to * which 'Result' is in canonical form. */ void CanonicalForm(ZPolyhedron *Zpol,ZPolyhedron **Result,Matrix **Basis) { Matrix *B1 = NULL, *B2=NULL, *T1 , *B2inv; int i, l1, l2; Value tmp; Polyhedron *Image, *ImageP; Matrix *H, *U, *temp, *Hprime, *Uprime, *T2; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered CANONICALFORM\n"); fclose(fp); #endif if(isEmptyZPolyhedron (Zpol)) { Basis[0] = Identity(Zpol->Lat->NbRows); Result[0] = ZDomain_Copy (Zpol); return ; } value_init(tmp); l1 = FindHermiteBasisofDomain(Zpol->P,&B1); Image = DomainImage (Zpol->P,(Matrix *)Zpol->Lat,MAXNOOFRAYS); l2 = FindHermiteBasisofDomain(Image,&B2); if (l1 != l2) fprintf(stderr,"In CNF : Something wrong with the Input Zpolyhedra \n"); B2inv = Matrix_Alloc(B2->NbRows, B2->NbColumns); temp = Matrix_Copy(B2); Matrix_Inverse(temp,B2inv); Matrix_Free(temp); temp = Matrix_Alloc(B2inv->NbRows,Zpol->Lat->NbColumns); T1 = Matrix_Alloc(temp->NbRows,B1->NbColumns); Matrix_Product(B2inv,(Matrix *)Zpol->Lat,temp); Matrix_Product(temp,B1,T1); Matrix_Free(temp); T2 = ChangeLatticeDimension(T1,l1); temp = ChangeLatticeDimension(T2,T2->NbRows+1); /* Adding the affine part */ for(i = 0; i < l1; i ++) value_assign(temp->p[i][temp->NbColumns-1],T1->p[i][T1->NbColumns-1]); AffineHermite(temp,&H,&U); Hprime = ChangeLatticeDimension(H,Zpol->Lat->NbRows); /* Exchanging the Affine part */ for(i = 0; i < l1; i ++) { value_assign(tmp,Hprime->p[i][Hprime->NbColumns-1]); value_assign(Hprime->p[i][Hprime->NbColumns-1],Hprime->p[i][H->NbColumns-1]); value_assign(Hprime->p[i][H->NbColumns-1],tmp); } Uprime = ChangeLatticeDimension(U,Zpol->Lat->NbRows); /* Exchanging the Affine part */ for (i = 0;i < l1; i++) { value_assign(tmp,Uprime->p[i][Uprime->NbColumns-1]); value_assign(Uprime->p[i][Uprime->NbColumns-1],Uprime->p[i][U->NbColumns-1]); value_assign(Uprime->p[i][U->NbColumns-1],tmp); } Polyhedron_Free (Image); Matrix_Free (B2inv); B2inv = Matrix_Alloc(B1->NbRows, B1->NbColumns); Matrix_Inverse(B1,B2inv); ImageP = DomainImage(Zpol->P, B2inv, MAXNOOFRAYS); Matrix_Free(B2inv); Image = DomainImage(ImageP, Uprime, MAXNOOFRAYS); Domain_Free(ImageP); Result[0] = ZPolyhedron_Alloc(Hprime, Image); Basis[0] = Matrix_Copy(B2); /* Free the variables */ Polyhedron_Free (Image); Matrix_Free (B1); Matrix_Free (B2); Matrix_Free (temp); Matrix_Free (T1); Matrix_Free (T2); Matrix_Free (H); Matrix_Free (U); Matrix_Free (Hprime); Matrix_Free (Uprime); value_clear(tmp); return; } /* CanonicalForm */ /* * Given a Z-polyhedron 'A' in which the Lattice is not integral, return the * Z-polyhedron which contains all the integral points in the input lattice. */ ZPolyhedron *IntegraliseLattice(ZPolyhedron *A) { ZPolyhedron *Result; Lattice *M = NULL, *Id; Polyhedron *Im = NULL, *Preim = NULL; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered INTEGRALISELATTICE\n"); fclose(fp); #endif Im = DomainImage(A->P,A->Lat,MAXNOOFRAYS); Id = Identity(A->Lat->NbRows); M = LatticeImage(Id, A->Lat); if (isEmptyLattice(M)) Result = EmptyZPolyhedron(A->Lat->NbRows-1); else { Preim = DomainPreimage(Im,M,MAXNOOFRAYS); Result = ZPolyhedron_Alloc(M,Preim); } Matrix_Free(M); Domain_Free(Im); Domain_Free(Preim); return Result; } /* IntegraliseLattice */ /* * Return the simplified representation of the Z-domain 'ZDom'. It attempts to * convexize unions of polyhedra when they correspond to the same lattices and * to simplify union of lattices when they correspond to the same polyhdera. */ ZPolyhedron *ZDomainSimplify(ZPolyhedron *ZDom) { ZPolyhedron *Ztmp, *Result; ForSimplify *Head, *Prev, *Curr; ZPolyhedron *ZDomHead, *Emp; if (ZDom == NULL) { fprintf(stderr,"\nError in ZDomainSimplify - ZDomHead = NULL\n"); return NULL; } if (ZDom->next == NULL) return (ZPolyhedron_Copy (ZDom)); Emp = EmptyZPolyhedron(ZDom->Lat->NbRows-1); ZDomHead = ZDomainUnion(ZDom, Emp); ZPolyhedron_Free(Emp); Head = NULL; Ztmp = ZDomHead; do { Polyhedron *Img; Img = DomainImage(Ztmp->P,Ztmp->Lat,MAXNOOFRAYS); for(Curr = Head; Curr != NULL; Curr = Curr->next) { Polyhedron *Diff1; Bool flag = False; Diff1 = DomainDifference(Img,Curr->Pol,MAXNOOFRAYS); if (emptyQ(Diff1)) { Polyhedron *Diff2; Diff2 = DomainDifference(Curr->Pol,Img,MAXNOOFRAYS); if (emptyQ(Diff2)) flag = True; Domain_Free(Diff2); } Domain_Free (Diff1); if (flag == True) { LatticeUnion *temp; temp = (LatticeUnion *)malloc(sizeof(LatticeUnion)); temp->M = (Lattice *)Matrix_Copy((Matrix *)Ztmp->Lat); temp->next = Curr->LatUni; Curr->LatUni = temp; break; } } if(Curr == NULL) { Curr = (ForSimplify *)malloc(sizeof(ForSimplify)); Curr->Pol = Domain_Copy(Img); Curr->LatUni = (LatticeUnion *)malloc(sizeof(LatticeUnion)); Curr->LatUni->M = (Lattice *)Matrix_Copy((Matrix *)Ztmp->Lat); Curr->LatUni->next = NULL; Curr->next = Head; Head = Curr; } Domain_Free (Img); Ztmp = Ztmp->next; } while(Ztmp != NULL); for (Curr = Head; Curr != NULL; Curr = Curr->next) Curr->LatUni = LatticeSimplify(Curr->LatUni); Result = NULL; for(Curr = Head; Curr != NULL; Curr = Curr->next) { LatticeUnion *L; for(L = Curr->LatUni; L != NULL; L = L->next) { Polyhedron *Preim; ZPolyhedron *Zpol; Preim = DomainPreimage(Curr->Pol,L->M,MAXNOOFRAYS); Zpol = ZPolyhedron_Alloc(L->M, Preim); Zpol->next = Result; Result = Zpol; Domain_Free(Preim); } } Curr = Head; while (Curr != NULL) { Prev = Curr; Curr = Curr->next; LatticeUnion_Free(Prev->LatUni); Domain_Free(Prev->Pol); free(Prev); } return Result; } /* ZDomainSimplify */ ZPolyhedron *SplitZpolyhedron(ZPolyhedron *ZPol,Lattice *B) { Lattice *Intersection = NULL; Lattice *B1 = NULL, *B2 = NULL, *newB1 = NULL, *newB2 = NULL; Matrix *U = NULL,*M1 = NULL, *M2 = NULL, *M1Inverse = NULL,*MtProduct = NULL; Matrix *Vinv, *V , *temp, *DiagMatrix ; Matrix *H , *U1 , *X, *Y ; ZPolyhedron *zpnew, *Result; LatticeUnion *Head = NULL, *tempHead = NULL; int i; Value k; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered SplitZpolyhedron \n"); fclose(fp); #endif if (B->NbRows != B->NbColumns) { fprintf(stderr,"\n SplitZpolyhedron : The Input Matrix B is not a proper Lattice \n"); return NULL; } if (ZPol->Lat->NbRows != B->NbRows) { fprintf(stderr,"\nSplitZpolyhedron : The Lattice in Zpolyhedron and B have "); fprintf(stderr,"incompatible dimensions \n"); return NULL; } if (isinHnf (ZPol->Lat) != True) { AffineHermite(ZPol->Lat,&H,&U1); X = Matrix_Copy(H); Matrix_Free(U1); Matrix_Free(H); } else X = Matrix_Copy(ZPol->Lat); if (isinHnf(B) != True) { AffineHermite(B,&H,&U1); Y = Matrix_Copy(H); Matrix_Free(H); Matrix_Free(U1); } else Y = Matrix_Copy(B); if (isEmptyLattice(X)) { return NULL; } Head=Lattice2LatticeUnion(X,Y); /* If the spliting operation can't be done the result is the original Zplyhedron. */ if (Head == NULL) { Matrix_Free(X); Matrix_Free(Y); return ZPol; } Result=NULL; if (Head) while(Head) { tempHead = Head; Head = Head->next; zpnew=ZPolyhedron_Alloc(tempHead->M,ZPol->P); Result=AddZPoly2ZDomain(zpnew,Result); ZPolyhedron_Free(zpnew); tempHead->next = NULL; free(tempHead); } return Result; } polylib-5.22.5.orig/source/kernel/matrix_addon.c0000644000175000017500000003210611341227527022503 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * $Id: matrix_addon.c,v 1.17 2007/03/18 18:49:08 skimo Exp $ * * Polylib matrix addons * Mainly, deals with polyhedra represented as a matrix (implicit form) * @author Benoit Meister * */ #include #include #include /** Creates a view of the constraints of a polyhedron as a Matrix * */ Matrix * constraintsView(Polyhedron * P) { Matrix * view = (Matrix *)malloc(sizeof(Matrix)); view->NbRows = P->NbConstraints; view->NbColumns = P->Dimension+2; view->p = P->Constraint; return view; } /** "Frees" a view of the constraints of a polyhedron */ void constraintsView_Free(Matrix * M) { free(M); } /** * splits a matrix of constraints M into a matrix of equalities Eqs and a * matrix of inequalities Ineqs allocs the new matrices. * Allocates Eqs and Ineqs. */ void split_constraints(Matrix const * M, Matrix ** Eqs, Matrix **Ineqs) { unsigned int i, j, k_eq, k_ineq, nb_eqs=0; /* 1- count the number of equations */ for (i=0; i< M->NbRows; i++) if (value_zero_p(M->p[i][0])) nb_eqs++; /* 2- extract the two matrices of equations */ (*Eqs) = Matrix_Alloc(nb_eqs, M->NbColumns); (*Ineqs) = Matrix_Alloc(M->NbRows-nb_eqs, M->NbColumns); k_eq = k_ineq = 0; for(i=0; i< M->NbRows; i++) { if (value_zero_p(M->p[i][0])) { for(j=0; j< M->NbColumns; j++) value_assign((*Eqs)->p[k_eq][j], M->p[i][j]); k_eq++; } else { for(j=0; j< M->NbColumns; j++) value_assign((*Ineqs)->p[k_ineq][j], M->p[i][j]); k_ineq++; } } } /* returns the dim-dimensional identity matrix */ Matrix * Identity_Matrix(unsigned int dim) { Matrix * ret = Matrix_Alloc(dim, dim); unsigned int i,j; for (i=0; i< dim; i++) { for (j=0; j< dim; j++) { if (i==j) { value_set_si(ret->p[i][j], 1); } else value_set_si(ret->p[i][j], 0); } } return ret; } /* Identity_Matrix */ /** * returns the dim-dimensional identity matrix. * If I is set to NULL, allocates it first. * Else, assumes an existing, allocated Matrix. */ void Matrix_identity(unsigned int dim, Matrix ** I) { int i,j; if (*I==NULL) { (*I) = Identity_Matrix(dim); } else { assert((*I)->NbRows>=dim && (*I)->NbColumns>=dim); for (i=0; i< dim; i++) { for (j=0; j< dim; j++) { if (i==j) { value_set_si((*I)->p[i][j], 1); } else { value_set_si((*I)->p[i][j], 0); } } } } } /* Matrix_identity */ /** given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix. g is a common denominator for elements of (transf^{-1}) */ void mtransformation_inverse(Matrix * transf, Matrix ** inverse, Value * g) { Value factor; unsigned int i,j; Matrix *tmp, *inv; value_init(*g); value_set_si(*g,1); /* a - compute the inverse as usual (n x (n+1) matrix) */ tmp = Matrix_Copy(transf); inv = Matrix_Alloc(transf->NbRows, transf->NbColumns+1); MatInverse(tmp, inv); Matrix_Free(tmp); /* b - as it is rational, put it to the same denominator*/ (*inverse) = Matrix_Alloc(transf->NbRows, transf->NbRows); for (i=0; i< inv->NbRows; i++) value_lcm(*g, *g, inv->p[i][inv->NbColumns-1]); for (i=0; i< inv->NbRows; i++) { value_division(factor, *g, inv->p[i][inv->NbColumns-1]); for (j=0; j< (*inverse)->NbColumns; j++) value_multiply((*inverse)->p[i][j], inv->p[i][j], factor); } /* c- clean up */ value_clear(factor); Matrix_Free(inv); } /* mtransformation_inverse */ /** takes a transformation matrix, and expands it to a higher dimension with the identity matrix regardless of it homogeneousness */ Matrix * mtransformation_expand_left_to_dim(Matrix * M, int new_dim) { Matrix * ret = Identity_Matrix(new_dim); int offset = new_dim-M->NbRows; unsigned int i,j; assert(new_dim>=M->NbColumns); assert(M->NbRows==M->NbColumns); for (i=0; i< M->NbRows; i++) for (j=0; j< M->NbRows; j++) value_assign(ret->p[offset+i][offset+j], M->p[i][j]); return ret; } /* mtransformation_expand_left_to_dim */ /** simplify a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements. */ void mpolyhedron_simplify(Matrix * polyh) { int i, j; Value cur_gcd; value_init(cur_gcd); for (i=0; i< polyh->NbRows; i++) { Vector_Gcd(polyh->p[i]+1, polyh->NbColumns-1, &cur_gcd); printf(" gcd[%d] = ", i); value_print(stdout, VALUE_FMT, cur_gcd);printf("\n"); Vector_AntiScale(polyh->p[i]+1, polyh->p[i]+1, cur_gcd, polyh->NbColumns-1); } value_clear(cur_gcd); } /* mpolyhedron_simplify */ /** inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra. */ void mpolyhedron_inflate(Matrix * polyh, unsigned int nb_parms) { unsigned int i,j; unsigned nb_vars = polyh->NbColumns-nb_parms-2; Value infl; value_init(infl); /* subtract the sum of the negative coefficients of each inequality */ for (i=0; i< polyh->NbRows; i++) { value_set_si(infl, 0); for (j=0; j< nb_vars; j++) { if (value_neg_p(polyh->p[i][1+j])) value_addto(infl, infl, polyh->p[i][1+j]); } /* here, we subtract a negative value */ value_subtract(polyh->p[i][polyh->NbColumns-1], polyh->p[i][polyh->NbColumns-1], infl); } value_clear(infl); } /* mpolyhedron_inflate */ /** deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra. */ void mpolyhedron_deflate(Matrix * polyh, unsigned int nb_parms) { unsigned int i,j; unsigned nb_vars = polyh->NbColumns-nb_parms-2; Value defl; value_init(defl); /* substract the sum of the negative coefficients of each inequality */ for (i=0; i< polyh->NbRows; i++) { value_set_si(defl, 0); for (j=0; j< nb_vars; j++) { if (value_pos_p(polyh->p[i][1+j])) value_addto(defl, defl, polyh->p[i][1+j]); } /* here, we substract a negative value */ value_subtract(polyh->p[i][polyh->NbColumns-1], polyh->p[i][polyh->NbColumns-1], defl); } value_clear(defl); } /* mpolyhedron_deflate */ /** use an eliminator row to eliminate a variable in a victim row (without * changing the sign of the victim row -> important if it is an inequality). * @param Eliminator the matrix containing the eliminator row * @param eliminator_row the index of the eliminator row in Eliminator * @param Victim the matrix containing the row to be eliminated * @param victim_row the row to be eliminated in Victim * @param var_to_elim the variable to be eliminated. */ void eliminate_var_with_constr(Matrix * Eliminator, unsigned int eliminator_row, Matrix * Victim, unsigned int victim_row, unsigned int var_to_elim) { Value cur_lcm, mul_a, mul_b; Value tmp, tmp2; int k; value_init(cur_lcm); value_init(mul_a); value_init(mul_b); value_init(tmp); value_init(tmp2); /* if the victim coefficient is not zero */ if (value_notzero_p(Victim->p[victim_row][var_to_elim+1])) { value_lcm(cur_lcm, Eliminator->p[eliminator_row][var_to_elim+1], Victim->p[victim_row][var_to_elim+1]); /* multiplication factors */ value_division(mul_a, cur_lcm, Eliminator->p[eliminator_row][var_to_elim+1]); value_division(mul_b, cur_lcm, Victim->p[victim_row][var_to_elim+1]); /* the multiplicator for the vitim row has to be positive */ if (value_pos_p(mul_b)) { value_oppose(mul_a, mul_a); } else { value_oppose(mul_b, mul_b); } value_clear(cur_lcm); /* now we have a.mul_a = -(b.mul_b) and mul_a > 0 */ for (k=1; kNbColumns; k++) { value_multiply(tmp, Eliminator->p[eliminator_row][k], mul_a); value_multiply(tmp2, Victim->p[victim_row][k], mul_b); value_addto(Victim->p[victim_row][k], tmp, tmp2); } } value_clear(mul_a); value_clear(mul_b); value_clear(tmp); value_clear(tmp2); } /* eliminate_var_with_constr */ /* STUFF WITH PARTIAL MAPPINGS (Mappings to a subset of the variables/parameters) : on the first or last variables/parameters */ /** compress the last vars/pars of the polyhedron M expressed as a polylib matrix - adresses the full-rank compressions only - modfies M */ void mpolyhedron_compress_last_vars(Matrix * M, Matrix * compression) { unsigned int i, j, k; unsigned int offset = M->NbColumns - compression->NbRows; /* the computations on M will begin on column "offset" */ Matrix * M_tmp = Matrix_Alloc(1, M->NbColumns); assert(compression->NbRows==compression->NbColumns); /* basic matrix multiplication (using a temporary row instead of a whole temporary matrix), but with a column offset */ for(i=0; i< M->NbRows; i++) { for (j=0; j< compression->NbRows; j++) { value_set_si(M_tmp->p[0][j], 0); for (k=0; k< compression->NbRows; k++) { value_addmul(M_tmp->p[0][j], M->p[i][k+offset],compression->p[k][j]); } } for (j=0; j< compression->NbRows; j++) value_assign(M->p[i][j+offset], M_tmp->p[0][j]); } Matrix_Free(M_tmp); } /* mpolyhedron_compress_last_vars */ /** use a set of m equalities Eqs to eliminate m variables in the polyhedron Ineqs represented as a matrix eliminates the m first variables - assumes that Eqs allow to eliminate the m equalities - modifies Eqs and Ineqs */ unsigned int mpolyhedron_eliminate_first_variables(Matrix * Eqs, Matrix *Ineqs) { unsigned int i, j, k; /* eliminate one variable (index i) after each other */ for (i=0; i< Eqs->NbRows; i++) { /* find j, the first (non-marked) row of Eqs with a non-zero coefficient */ for (j=0; jNbRows && (Eqs->p[j][i+1]==0 || ( !value_cmp_si(Eqs->p[j][0],2) )); j++); /* if no row is found in Eqs that allows to eliminate variable i, return an error code (0) */ if (j==Eqs->NbRows) return 0; /* else, eliminate variable i in Eqs and Ineqs with the j^th row of Eqs (and mark this row so we don't use it again for an elimination) */ for (k=j+1; kNbRows; k++) eliminate_var_with_constr(Eqs, j, Eqs, k, i); for (k=0; k< Ineqs->NbRows; k++) eliminate_var_with_constr(Eqs, j, Ineqs, k, i); /* mark the row */ value_set_si(Eqs->p[j][0],2); } /* un-mark all the rows */ for (i=0; i< Eqs->NbRows; i++) value_set_si(Eqs->p[i][0],0); return 1; } /* mpolyhedron_eliminate_first_variables */ /** returns a contiguous submatrix of a matrix. * @param M the input matrix * @param sr the index of the starting row * @param sc the index of the starting column * @param er the index ofthe ending row (excluded) * @param ec the ined of the ending colummn (excluded) * @param sub (returned), the submatrix. Allocated if set to NULL, assumed to * be already allocated else. */ void Matrix_subMatrix(Matrix * M, unsigned int sr, unsigned int sc, unsigned int er, unsigned int ec, Matrix ** sub) { int i; int nbR = er-sr; int nbC = ec-sc; assert (er<=M->NbRows && ec<=M->NbColumns); if ((*sub)==NULL) { (*sub) = Matrix_Alloc(nbR, nbC); } if (nbR==0 || nbC==0) return; for (i=0; i< nbR; i++) { Vector_Copy(&(M->p[i+sr][sc]), (*sub)->p[i], nbC); } }/* Matrix_subMatrix */ /** * Cloning function. Similar to Matrix_Copy() but allocates the target matrix * if it is set to NULL. */ void Matrix_clone(Matrix * M, Matrix ** Cl) { Matrix_subMatrix(M, 0,0, M->NbRows, M->NbColumns, Cl); } /** * Copies a contiguous submatrix of M1 into M2, at the indicated position. * M1 and M2 are assumed t be allocated already. * @param M1 the source matrix * @param sr1 the starting source row * @param sc1 the starting source column * @param nbR the number of rows * @param nbC the number of columns * @param M2 the target matrix * @param sr2 the starting target row * @param sc2 the starting target column */ void Matrix_copySubMatrix(Matrix *M1, unsigned int sr1, unsigned int sc1, unsigned int nbR, unsigned int nbC, Matrix * M2, unsigned int sr2, unsigned int sc2) { int i; for (i=0; i< nbR; i++) { Vector_Copy(&(M1->p[i+sr1][sc1]), &(M2->p[i+sr2][sc2]), nbC); } } /* Matrix_copySubMatrix */ /** * transforms a matrix M into -M */ void Matrix_oppose(Matrix * M) { int i,j; for (i=0; iNbRows; i++) { for (j=0; j< M->NbColumns; j++) { value_oppose(M->p[i][j], M->p[i][j]); } } } polylib-5.22.5.orig/source/kernel/Lattice.c0000644000175000017500000015134411341227527021425 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include typedef struct { int count; int *fac; } factor; static factor allfactors (int num); /* * Print the contents of a list of Lattices 'Head' */ void PrintLatticeUnion(FILE *fp, char *format, LatticeUnion *Head) { LatticeUnion *temp; for(temp = Head; temp != NULL; temp = temp->next) Matrix_Print(fp,format,(Matrix *)temp->M); return; } /* PrintLatticeUnion */ /* * Free the memory allocated to a list of lattices 'Head' */ void LatticeUnion_Free(LatticeUnion *Head) { LatticeUnion *temp; while (Head != NULL) { temp = Head; Head = temp->next; Matrix_Free(temp->M); free(temp); } return; } /* LatticeUnion_Free */ /* * Allocate a heads for a list of Lattices */ LatticeUnion *LatticeUnion_Alloc(void) { LatticeUnion *temp; temp = (LatticeUnion *)malloc(sizeof(LatticeUnion)); temp->M=NULL; temp->next=NULL; return temp; } /* LatticeUnion_Alloc */ /* * Given two Lattices 'A' and 'B', return True if they have the same affine * part (the last column) otherwise return 'False'. */ Bool sameAffinepart (Lattice *A, Lattice *B) { int i; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered SAMEAFFINEPART \n"); fclose(fp); #endif for (i = 0; i < A->NbRows; i ++) if (value_ne(A->p[i][A->NbColumns-1],B->p[i][B->NbColumns-1])) return False; return True; } /* sameAffinepart */ /* * Return an empty lattice of dimension 'dimension-1'. An empty lattice is * represented as [[0 0 ... 0] .... [0 ... 0][0 0.....0 1]]. */ Lattice *EmptyLattice(int dimension) { Lattice *result; int i,j; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered NULLATTICE \n"); fclose (fp); #endif result = (Lattice *) Matrix_Alloc(dimension, dimension); for (i = 0; i < dimension; i ++) for (j = 0; j < dimension; j ++) value_set_si(result->p[i][j],0); value_set_si(result->p[i-1][i-1],1); return result; } /* EmptyLattice */ /* * Return True if Lattice 'A' is empty, otherwise return False. */ Bool isEmptyLattice (Lattice *A) { int i,j; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered ISNULLATTICE \n"); fclose(fp); #endif for (i = 0; i < A->NbRows-1; i ++) for (j = 0; j < A->NbColumns-1; j ++) if(value_notzero_p(A->p[i][j])) { return False; } if (value_one_p(A->p[i][A->NbColumns-1])) { return True ; } return False ; } /* isEmptyLaattice */ /* * Given a Lattice 'A', check whether it is linear or not, i.e. whether the * affine part is NULL or not. If affine part is empty, it returns True other- * wise it returns False. */ Bool isLinear(Lattice *A) { int i; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered ISLINEAR \n"); fclose (fp); #endif for (i = 0; i < A->NbRows-1; i ++) if (value_notzero_p(A->p[i][A->NbColumns-1])) { return False; } return True; } /* isLinear */ /* * Return the affine Hermite normal form of the affine lattice 'A'. The unique * affine Hermite form if a lattice is stored in 'H' and the unimodular matrix * corresponding to 'A = H*U' is stored in the matrix 'U'. * Algorithm : * 1) Check if the Lattice is Linear or not. * 2) If it is not Linear, then Homogenise the Lattice. * 3) Call Hermite. * 4) If the Lattice was Homogenised, the HNF H must be * Dehomogenised and also corresponding changes must * be made to the Unimodular Matrix U. * 5) Return. */ void AffineHermite (Lattice *A, Lattice **H, Matrix **U) { Lattice *temp; Bool flag = True; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered AFFINEHERMITE \n"); fclose (fp); #endif if (isLinear(A) == False) temp = Homogenise(A,True); else { flag = False ; temp = (Lattice *)Matrix_Copy(A); } Hermite((Matrix *)temp,(Matrix **) H, U); if (flag == True) { Matrix_Free ((Matrix *) temp); temp = Homogenise(H[0],False); Matrix_Free((Matrix *) H[0]); H[0] = (Lattice *)Matrix_Copy(temp); Matrix_Free((Matrix *) temp); temp = Homogenise(U[0],False); Matrix_Free ((Matrix *) U[0]); U[0] = (Matrix *)Matrix_Copy(temp); } Matrix_Free((Matrix *) temp); return; } /* AffineHermite */ /* * Given a Polylib matrix 'A' that rerepresents an affine function, return the * affine Smith normal form 'Delta' of 'A' and unimodular matrices 'U' and 'V' * such that 'A = U*Delta*V'. * Algorithm: * (1) Homogenise the Lattice. * (2) Call Smith * (3) The Smith Normal Form Delta must be Dehomogenised and also * corresponding changes must be made to the Unimodular Matrices * U and V. * 4) Bring Delta into AffineSmith Form. */ void AffineSmith(Lattice *A, Lattice **U, Lattice **V, Lattice **Diag) { Lattice *temp; Lattice *Uinv; int i,j; Value sum, quo, rem; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered AFFINESMITH \n"); fclose(fp); #endif value_init(sum); value_init(quo); value_init(rem); temp = Homogenise(A,True); Smith((Matrix *)temp, (Matrix **)U, (Matrix **)V, (Matrix **)Diag); Matrix_Free((Matrix *)temp); temp = Homogenise (*U, False); Matrix_Free ((Matrix *) *U); *U = (Lattice *)Matrix_Copy ((Matrix *)temp); Matrix_Free ((Matrix *)temp); temp = Homogenise (*V, False); Matrix_Free ((Matrix *)*V); *V = (Lattice *) Matrix_Copy ((Matrix *)temp); Matrix_Free ((Matrix *)temp); temp = Homogenise (*Diag, False); Matrix_Free ((Matrix *)*Diag); *Diag = (Lattice *)Matrix_Copy ((Matrix *)temp); Matrix_Free ((Matrix *)temp); temp = (Lattice *) Matrix_Copy ((Matrix *) *U); Uinv = (Lattice *) Matrix_Alloc (U[0]->NbRows, U[0]->NbColumns); Matrix_Inverse( (Matrix *) temp, (Matrix *) Uinv); Matrix_Free ((Matrix *) temp); for (i = 0; i < U[0]->NbRows-1; i ++) { value_set_si(sum,0); for(j = 0; j < U[0]->NbColumns-1; j ++) { value_addmul(sum, Uinv->p[i][j], U[0]->p[j][U[0]->NbColumns-1]); } value_assign(Diag[0]->p[i][j],sum); } Matrix_Free((Matrix *) Uinv); for(i = 0; i < U[0]->NbRows-1; i ++) value_set_si(U[0]->p[i][U[0]->NbColumns-1],0); for(i = 0; i < Diag[0]->NbRows-1; i ++) { value_division(quo,Diag[0]->p[i][Diag[0]->NbColumns-1],Diag[0]->p[i][i]); value_modulus(rem,Diag[0]->p[i][Diag[0]->NbColumns-1],Diag[0]->p[i][i]); fprintf(stdout," pourcent "); value_print(stdout,VALUE_FMT,rem); fprintf(stdout," quotient "); value_print(stdout,VALUE_FMT,quo); fprintf(stdout," \n"); /* Apparently the % operator is strange when sign are different */ if(value_neg_p(rem)) { value_addto(rem,rem,Diag[0]->p[i][i]); value_decrement(quo,quo); }; fprintf(stdout,"apres pourcent "); value_print(stdout,VALUE_FMT,rem); fprintf(stdout," quotient "); value_print(stdout,VALUE_FMT,quo); fprintf(stdout," \n"); value_assign( Diag[0]->p[i][Diag[0]->NbColumns-1],rem); value_assign(V[0]->p[i][V[0]->NbColumns-1],quo); } value_clear(sum); value_clear(quo); value_clear(rem); return; } /* AffineSmith */ /* * Given a lattice 'A' and a boolean variable 'Forward', homogenise the lattice * if 'Forward' is True, otherwise if 'Forward' is False, dehomogenise the * lattice 'A'. * Algorithm: * (1) If Forward == True * Put the last row first. * Put the last columns first. * (2) Else * Put the first row last. * Put the first column last. * (3) Return the result. */ Lattice *Homogenise(Lattice *A, Bool Forward) { Lattice *result; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug","a"); fprintf(fp,"\nEntered HOMOGENISE \n"); fclose(fp); #endif result = (Lattice *)Matrix_Copy(A); if (Forward == True ) { PutColumnFirst((Matrix *)result, A->NbColumns-1); PutRowFirst((Matrix *)result, result->NbRows-1); } else { PutColumnLast((Matrix *)result,0); PutRowLast((Matrix *)result,0); } return result; } /* Homogenise */ /* * Given two lattices 'A' and 'B', verify if lattice 'A' is included in 'B' or * not. If 'A' is included in 'B' the 'A' intersection 'B', will be 'A'. So, * compute 'A' intersection 'B' and check if it is the same as 'A'. */ Bool LatticeIncludes(Lattice *A, Lattice *B) { Lattice *temp, *UA, *HA; Bool flag = False; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered LATTICE INCLUDES \n"); fclose(fp); #endif AffineHermite(A,&HA,&UA); temp = LatticeIntersection(B,HA); if (sameLattice(temp, HA) == True) flag = True; Matrix_Free((Matrix *)temp); Matrix_Free((Matrix *)UA); Matrix_Free((Matrix *)HA); return flag; } /* LatticeIncludes */ /* * Given two lattices 'A' and 'B', verify if 'A' and 'B' are the same lattice. * Algorithm: * The Affine Hermite form of two full dimensional matrices are * unique. So, take the Affine Hermite form of both 'A' and 'B' and compare the * matrices. If they are equal, the function returns True, else it returns * False. */ Bool sameLattice(Lattice *A, Lattice *B) { Lattice *HA, *HB, *UA, *UB; int i,j; Bool result = True; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered SAME LATTICE \n"); fclose(fp); #endif AffineHermite(A, &HA, &UA); AffineHermite(B, &HB, &UB); for (i = 0 ; i < A->NbRows; i ++) for (j = 0; j < A->NbColumns; j ++) if (value_ne(HA->p[i][j],HB->p[i][j])) { result = False; break; } Matrix_Free ((Matrix *) HA); Matrix_Free ((Matrix *) HB); Matrix_Free ((Matrix *) UA); Matrix_Free ((Matrix *) UB); return result; } /* sameLattice */ /* * Given a matrix 'A' and an integer 'dimension', do the following: * If dimension < A->dimension), output a (dimension * dimension) submatrix of * A. Otherwise the output matrix is [A 0][0 ID]. The order if the identity * matrix is (dimension - A->dimension). The input matrix is not necessarily * a Polylib matrix but the output is a polylib matrix. */ Lattice *ChangeLatticeDimension(Lattice *A, int dimension) { int i, j; Lattice *Result ; Result = Matrix_Alloc(dimension, dimension); if(dimension <= A->NbRows) { for (i = 0; i < dimension; i ++) for (j = 0; j < dimension; j ++) value_assign(Result->p[i][j],A->p[i][j]); return Result; } for (i = 0; i < A->NbRows; i ++) for (j = 0; j < A->NbRows; j ++) value_assign(Result->p[i][j],A->p[i][j]); for (i = A->NbRows; i < dimension; i ++) for (j = 0; j < dimension; j ++) { value_set_si(Result->p[i][j],0); value_set_si(Result->p[j][i],0); } for (i = A->NbRows; i < dimension; i ++) value_set_si(Result->p[i][i],1); return Result; } /* ChangeLatticeDimension */ /* * Given an affine lattice 'A', return a matrix of the linear part of the * lattice. */ Lattice *ExtractLinearPart(Lattice *A) { Lattice *Result; int i, j; Result = (Lattice *) Matrix_Alloc(A->NbRows-1, A->NbColumns-1); for (i = 0; i < A->NbRows-1; i ++) for (j = 0; j < A->NbColumns-1; j ++) value_assign(Result->p[i][j],A->p[i][j]); return Result; } /* ExtractLinearPart */ static Matrix *MakeDioEqforInter(Matrix *A, Matrix *B); /* * Given two lattices 'A' and 'B', return the intersection of the two lattcies. * The dimension of 'A' and 'B' should be the same. * Algorithm: * (1) Verify if the lattcies 'A' and 'B' have the same affine part. * If they have same affine part, then only their Linear parts * need to be intersected. If they don't have the same affine * part then the affine part has to be taken into consideration. * For this, homogenise the lattices to get their Hermite Forms * and then find their intersection. * * (2) Step(2) involves, solving the Diophantine Equations in order * to extract the intersection of the Lattices. The Diophantine * equations are formed taking into consideration whether the * affine part has to be included or not. * * (3) Solve the Diophantine equations. * * (4) Extract the necessary information from the result. * * (5) If the lattices have different affine parts and they were * homogenised, the result is dehomogenised. */ Lattice *LatticeIntersection(Lattice *X, Lattice *Y) { int i, j, exist; Lattice *result = NULL, *U = NULL ; Lattice *A = NULL, *B = NULL, *H = NULL; Matrix *fordio; Vector *X1 = NULL; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered LATTICEINTERSECTION \n"); fclose(fp); #endif if (X->NbRows != X->NbColumns) { fprintf(stderr, "\nIn LatticeIntersection : The Input Matrix X is a not a well defined Lattice\n"); return EmptyLattice(X->NbRows); } if (Y->NbRows != Y->NbColumns) { fprintf (stderr, "\nIn LatticeIntersection : The Input Matrix Y is a not a well defined Lattice\n"); return EmptyLattice(X->NbRows); } if (Y->NbRows != X->NbRows) { fprintf (stderr, "\nIn LatticeIntersection : the input lattices X and Y are of incompatible dimensions\n"); return EmptyLattice(X->NbRows); } if (isinHnf(X)) A = (Lattice *) Matrix_Copy(X); else { AffineHermite(X, &H, &U); A = (Lattice *)Matrix_Copy (H); Matrix_Free((Matrix *) H); Matrix_Free((Matrix *) U); } if (isinHnf(Y)) B = (Lattice *)Matrix_Copy(Y); else { AffineHermite(Y, &H, &U); B = (Lattice *)Matrix_Copy (H); Matrix_Free((Matrix *) H); Matrix_Free((Matrix *) U); } if ((isEmptyLattice(A)) || (isEmptyLattice (B))) { result = EmptyLattice(X->NbRows); Matrix_Free ((Matrix *) A); Matrix_Free ((Matrix *) B); return result; } fordio = MakeDioEqforInter (A, B); Matrix_Free (A); Matrix_Free (B); exist = SolveDiophantine(fordio,(Matrix **) &U, &X1); if (exist < 0) { /* Intersection is NULL */ result = (EmptyLattice(X->NbRows)); return result; } result = (Lattice *)Matrix_Alloc(X->NbRows, X->NbColumns); for (i = 0; i < result->NbRows-1; i ++) for (j = 0; j < result->NbColumns-1; j ++) value_assign(result->p[i][j],U->p[i][j]); for (i = 0; i < result->NbRows-1; i ++) value_assign(result->p[i][result->NbColumns-1],X1->p[i]); for (i = 0; i < result->NbColumns-1; i ++) value_set_si(result->p[result->NbRows-1][i],0); value_set_si(result->p[result->NbRows-1][result->NbColumns-1],1); Matrix_Free((Matrix *) U); Vector_Free(X1); Matrix_Free(fordio); AffineHermite(result,&H,&U); Matrix_Free((Matrix *)result); result = (Lattice *)Matrix_Copy(H); Matrix_Free((Matrix *) H); Matrix_Free((Matrix *) U); /* Check whether the Lattice is NULL or not */ if (isEmptyLattice (result)) { Matrix_Free ((Matrix *)result); return (EmptyLattice (X->NbRows)); } return result; } /* LatticeIntersection */ static Matrix * MakeDioEqforInter (Lattice *A, Lattice *B) { Matrix *Dio ; int i,j; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered MAKEDIOEQFORINTER \n"); fclose(fp); #endif Dio = Matrix_Alloc(2*(A->NbRows-1) + 1, 3 * (A->NbColumns-1)+1); for (i = 0; i < Dio->NbRows; i ++) for (j = 0; j < Dio->NbColumns; j ++) value_set_si(Dio->p[i][j],0); for (i = 0; i < A->NbRows-1; i++) { value_set_si(Dio->p[i][i],1); value_set_si(Dio->p[i+A->NbRows-1][i],1); } for (i = 0; i < A->NbRows-1 ; i ++) for (j = 0; j < A->NbRows-1; j ++) { value_oppose(Dio->p[i][j+A->NbRows-1],A->p[i][j]); value_oppose(Dio->p[i+(A->NbRows-1)][j+2*(A->NbRows-1)],B->p[i][j]); } /* Adding the affine part */ for (i = 0; i < A->NbColumns-1; i++) { value_oppose(Dio->p[i][Dio->NbColumns-1],A->p[i][A->NbColumns-1]); value_oppose(Dio->p[i+A->NbRows-1][Dio->NbColumns-1],B->p[i][A->NbColumns-1]) ; } value_set_si(Dio->p[Dio->NbRows-1][Dio->NbColumns-1],1); return Dio; } /* MakeDioEqforInter */ static void AddLattice(LatticeUnion *,Matrix *, Matrix *, int , int); LatticeUnion *SplitLattice(Matrix *, Matrix *, Matrix *); /* * The function is transforming a lattice X in a union of lattices based on a starting lattice Y. * Note1: If the intersection of X and Y lattices is empty the result is identic with the first argument (X) because no operation can be made. *Note2: The function is availabe only for simple Lattices and not for a union of Lattices. * Step 1: Find Intersection = LatticeIntersection (A, B). * Step 2: Extract the Linear Parts of the Lattices A and Intersection. * (while dealing with Basis we only deal with the Linear Parts) * Step 3: Let M1 = Basis of A and M2 = Basis of B. * Let B1 and B2 be the Basis of A and B respectively, * corresponding to the above Theorem. * Then we Have B1 = M1 * U1 {a unimodular Matrix } * and B2 = M2 * U2. M1 and M2 we know, they are the linear * parts we obtained in Step 2. Our Task is now to find U1 and * U2. * We know that B1 * Delta = B2. * i.e. M1 * U1 * Delta = M2 * U2 * or U1*Delta*U2Inverse = M1Inverse * M2. * and Delta is the Diagonal Matrix which satisifies the * above properties (in the Theorem). * So Delta is nothing but the Smith Normal Form of * M1Inverse * M2. * So, first we have to find M1Inverse. * * This Step, involves finding the Inverse of the Matrix M1. * We find the Inverse using the Polylib function * Matrix_Inverse. There is a catch here, the result of this * function is an integral matrix, not necessarily the exact * Inverse (since M1 need not be Unimodular), but a multiple * of the actual inverse. The number by which we have to divide * the matrix, is not obtained here as the input matrix is not * a Polylib matrix { We input only the Linear part }. Later I * give a way for finding that number. * * M1Inverse = Matrix_Inverse ( M1 ); * * Step 4 : MtProduct = Matrix_Product (M1Inverse, M2); * Step 5 : SmithNormalFrom (MtProduct, Delta, U, V); * U1 = U and U2Inverse = V. * Step 6 : Find U2 = Matrix_Inverse (U2inverse). Here there is no prob * as U1 and its inverse are unimodular. * * Step 7 : Compute B1 = M1 * U1; * Step 8 : Compute B2 = M2 * U2; * Step 9 : Earlier when we computed M1Inverse, we knew that it was not * the exact inverse but a multiple of it. Now we find the * number, such that ( M1Inverse / number ) would give us the * exact inverse of M1. * We know that B1 * Delta = B2. * Let k = B2[0][0] / B1[0][0]. * Let number = Delta[0][0]/k; * This 'number' is the number we want. * We Divide the matrix Delta by this number, to get the actual * Delta such that B1 * Delta = B2. * Step 10 : Call Split Lattice (B1, B2, Delta ). * This function returns the Union of Lattices in such a way * that B2 is at the Head of this List. * *If the intersection between X and Y is empty then the result is NULL. */ LatticeUnion *Lattice2LatticeUnion(Lattice *X,Lattice *Y) { Lattice *B1 = NULL, *B2 = NULL, *newB1 = NULL, *newB2 = NULL, *Intersection=NULL; Matrix *U = NULL,*M1 = NULL, *M2 = NULL, *M1Inverse = NULL,*MtProduct = NULL; Matrix *Vinv, *V , *temp, *DiagMatrix ; LatticeUnion *Head = NULL, *tempHead = NULL; int i; Value k; Intersection = LatticeIntersection(X,Y); if (isEmptyLattice(Intersection) == True) { fprintf(stderr,"\nIn Lattice2LatticeUnion : the input lattices X and Y do not have any common part\n"); return NULL; } value_init(k); M1 = (Matrix *)ExtractLinearPart(X); M2 = (Matrix *)ExtractLinearPart(Intersection); M1Inverse = Matrix_Alloc(M1->NbRows,M1->NbColumns); temp = Matrix_Copy(M1); Matrix_Inverse(temp,M1Inverse); Matrix_Free(temp); MtProduct = Matrix_Alloc(M1->NbRows, M1->NbColumns); Matrix_Product(M1Inverse,M2,MtProduct) ; Smith(MtProduct, &U, &Vinv, &DiagMatrix); V = Matrix_Alloc(Vinv->NbRows,Vinv->NbColumns); Matrix_Inverse(Vinv, V); Matrix_Free(Vinv); B1 = Matrix_Alloc(M1->NbRows, U->NbColumns); B2 = Matrix_Alloc(M2->NbRows, V->NbColumns); Matrix_Product(M1, U, B1); Matrix_Product(M2, V, B2); Matrix_Free(M1); Matrix_Free(M2); value_division(k,B2->p[0][0],B1->p[0][0]); value_division(k,DiagMatrix->p[0][0],k); for (i = 0; i < DiagMatrix->NbRows; i++) value_division(DiagMatrix->p[i][i],DiagMatrix->p[i][i],k); newB1 = ChangeLatticeDimension(B1, B1->NbRows + 1); Matrix_Free(B1); newB2 = ChangeLatticeDimension(B2, B2->NbRows +1); Matrix_Free(B2); for(i = 0; i < newB1->NbRows - 1;i ++) value_assign(newB2->p[i][newB1->NbRows-1],Intersection->p[i][X->NbRows-1]); Head = SplitLattice(newB1,newB2,DiagMatrix); Matrix_Free(newB1); Matrix_Free(DiagMatrix); value_clear(k); return Head; } /** *** Method : *** **/ /* * Return the Union of lattices that constitute the difference the lattices * 'A' and 'B'. The dimensions of 'A' and 'B' should be the same. * Note : * Inorder to Find the Difference of Lattices, we make use of * the following facts. * * Theorem : Given Two Lattices L1 and L2, (L2 subset of L1) there exists a * Basis B = {b1, b2,..bn} of L1 and integers {a1, a2...,an} such * that a1 divides a2, a2 divides a3 and so on and {a1b1, a2b2 ,..., * .., anbn} is a Basis of L2. So given this theorem we can express * the Lattice L1 in terms of Union of Lattices Involving L2, such * that Lattice L1 = B1 = Union of (B2 + i1b1 + i2b2 + .. inbn) such * that 0 <= i1 < a1; 0 <= i2 < a2; ....... 0 <= in < an. We also * know that A/B = A/(A Intersection B) and that (A Intersection B) * is a subset of A. So, Making use of these two facts, we find the * A/B. We Split The Lattice A in terms of Lattice (A Int B). From * this Union of Lattices Delete the Lattice (A Int B). * * Algorithm : * * Step 1: Find Intersection = LatticeIntersection (A, B). * Step 2: Extract the Linear Parts of the Lattices A and Intersection. * (while dealing with Basis we only deal with the Linear Parts) * Step 3: Let M1 = Basis of A and M2 = Basis of B. * Let B1 and B2 be the Basis of A and B respectively, * corresponding to the above Theorem. * Then we Have B1 = M1 * U1 {a unimodular Matrix } * and B2 = M2 * U2. M1 and M2 we know, they are the linear * parts we obtained in Step 2. Our Task is now to find U1 and * U2. * We know that B1 * Delta = B2. * i.e. M1 * U1 * Delta = M2 * U2 * or U1*Delta*U2Inverse = M1Inverse * M2. * and Delta is the Diagonal Matrix which satisifies the * above properties (in the Theorem). * So Delta is nothing but the Smith Normal Form of * M1Inverse * M2. * So, first we have to find M1Inverse. * * This Step, involves finding the Inverse of the Matrix M1. * We find the Inverse using the Polylib function * Matrix_Inverse. There is a catch here, the result of this * function is an integral matrix, not necessarily the exact * Inverse (since M1 need not be Unimodular), but a multiple * of the actual inverse. The number by which we have to divide * the matrix, is not obtained here as the input matrix is not * a Polylib matrix { We input only the Linear part }. Later I * give a way for finding that number. * * M1Inverse = Matrix_Inverse ( M1 ); * * Step 4 : MtProduct = Matrix_Product (M1Inverse, M2); * Step 5 : SmithNormalFrom (MtProduct, Delta, U, V); * U1 = U and U2Inverse = V. * Step 6 : Find U2 = Matrix_Inverse (U2inverse). Here there is no prob * as U1 and its inverse are unimodular. * * Step 7 : Compute B1 = M1 * U1; * Step 8 : Compute B2 = M2 * U2; * Step 9 : Earlier when we computed M1Inverse, we knew that it was not * the exact inverse but a multiple of it. Now we find the * number, such that ( M1Inverse / number ) would give us the * exact inverse of M1. * We know that B1 * Delta = B2. * Let k = B2[0][0] / B1[0][0]. * Let number = Delta[0][0]/k; * This 'number' is the number we want. * We Divide the matrix Delta by this number, to get the actual * Delta such that B1 * Delta = B2. * Step 10 : Call Split Lattice (B1, B2, Delta ). * This function returns the Union of Lattices in such a way * that B2 is at the Head of this List. * Step 11 : To Remove B2 From the list of the Union of Lattices. * Head = Head->next; * Step 12 : Free the Memory that is now not needed and return Head. * */ LatticeUnion *LatticeDifference(Lattice *A,Lattice *B) { Lattice *Intersection = NULL; LatticeUnion *Head = NULL, *tempHead = NULL; Matrix *H , *U1 , *X, *Y ; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered LATTICEDIFFERENCE \n"); fclose(fp); #endif if (A->NbRows != A->NbColumns) { fprintf(stderr,"\nIn LatticeDifference : The Input Matrix A is not a proper Lattice \n"); return NULL; } if (B->NbRows != B->NbColumns) { fprintf(stderr,"\nIn LatticeDifference : The Input Matrix B is not a proper Lattice \n"); return NULL; } if (A->NbRows != B->NbRows) { fprintf(stderr,"\nIn Lattice Difference : The Input Lattices A and B have "); fprintf(stderr,"incompatible dimensions \n"); return NULL; } if (isinHnf (A) != True) { AffineHermite(A,&H,&U1); X = Matrix_Copy(H); Matrix_Free(U1); Matrix_Free(H); } else X = Matrix_Copy(A); if (isinHnf(B) != True) { AffineHermite(B,&H,&U1); Y = Matrix_Copy(H); Matrix_Free(H); Matrix_Free(U1); } else Y = Matrix_Copy(B); if (isEmptyLattice(X)) { return NULL; } Head=Lattice2LatticeUnion(X,Y); /* If the spliting operation can't be done the result is X. */ if (Head == NULL) { Head = (LatticeUnion *)malloc(sizeof(LatticeUnion)); Head->M = Matrix_Copy(X); Head->next = NULL; Matrix_Free(X); Matrix_Free(Y); return Head; } tempHead = Head; Head = Head->next; Matrix_Free (tempHead->M); tempHead->next = NULL; free(tempHead); if ((Head != NULL)) Head = LatticeSimplify (Head); Matrix_Free (X); Matrix_Free (Y); return Head; } /* LatticeDifference */ /* * Given a Lattice 'B1' and a Lattice 'B2' and a Diagonal Matrix 'C' such that * 'B2' is a subset of 'B1' and C[0][0] divides C[1][1], C[1][1] divides C[2] * [2] and so on, output the list of matrices whose union is B1. The function * expresses the Lattice B1 in terms of B2 Unions of B1 = Union of {B2 + i0b0 + * i1b1 + .... + inbn} where 0 <= i0 < C[0][0]; 0 <= i1 < C[1][1] and so on and * {b0 ... bn} are the columns of Lattice B1. The list is so formed that the * Lattice B2 is the Head of the list. */ LatticeUnion *SplitLattice(Lattice *B1, Lattice *B2, Matrix *C) { int i; LatticeUnion *Head = NULL; Head = (LatticeUnion *)malloc(sizeof(LatticeUnion)); Head->M = (Lattice *)B2; Head->next = NULL; for (i = 0; i < C->NbRows ; i++) AddLattice(Head,B1,B2,VALUE_TO_INT(C->p[i][i]),i); return Head; } /* SplitLattice */ /* * Given lattices 'B1' and 'B2', an integer 'NumofTimes', a column number * 'Colnumber' and a pointer to a list of lattices, the function does the * following :- * For every lattice in the list, it adds a set of lattices such that the * affine part of the new lattices is greater than the original lattice by 0 to * NumofTimes-1 * {the (ColumnNumber)-th column of B1}. * Note : * Three pointers are defined to point at various points of the list. They are: * Head -> It always points to the head of the list. * tail -> It always points to the last element in the list. * marker -> It points to the element, which is the last element of the Input * list. */ static void AddLattice (LatticeUnion *Head, Matrix *B1, Matrix *B2, int NumofTimes, int Colnumber) { LatticeUnion *temp, *tail, *marker; int i,j; Value tmp; value_init(tmp); tail = Head; while (tail->next != NULL) tail = tail->next; marker = tail; for(temp = Head; temp != NULL; temp=temp->next) { for (i = 1; i < NumofTimes; i++) { Lattice *tempMatrix, *H, *U; tempMatrix = (Lattice *)Matrix_Copy(temp->M); for (j = 0; j < B2->NbRows; j++) { value_set_si(tmp,i); value_addmul(tempMatrix->p[j][B2->NbColumns-1], tmp, B1->p[j][Colnumber]); } tail->next = (LatticeUnion *)malloc(sizeof(LatticeUnion)); AffineHermite(tempMatrix,&H,&U); Matrix_Free((Matrix *)tempMatrix); Matrix_Free(U); tail->next->M = H; tail->next->next=NULL; tail = tail->next; } if (temp == marker) break; } value_clear(tmp); return; } /* AddLattice */ /* * Given a polyhedron 'A', store the Hermite basis 'B' and return the true * dimension of the polyhedron 'A'. * Algorithm : * * 1) First we find all the vertices of the Polyhedron A. * Now suppose the vertices are [v1, v2...vn], then * a particular set of vectors governing the space of A are * given by [v1-v2, v1-v3, ... v1-vn] (let us say V). * So we initially calculate these vectors. * 2) Then there are the rays and lines which contribute to the * space in which A is going to lie. * So we append to the rays and lines. So now we get a matrix * {These are the rows} [ V ] [l1] [l2]...[lk] * where l1 to lk are either rays or lines of the Polyhedron A. * 3) The above matrix is the set of vectors which determine * the space in which A is going to lie. * Using this matrix we find a Basis which is such that * the first 'm' columns of it determine the space of A. * 4) But we also have to ensure that in the last 'n-m' * coordinates the Polyhedron is '0', this is done by * taking the image by B(inv) of A and finding the remaining * equalities, and composing it with the matrix B, so as * to get a new matrix which is the actual Hermite Basis of * the Polyhedron. */ int FindHermiteBasisofDomain(Polyhedron *A, Matrix **B) { int i, j; Matrix *temp,*temp1, *tempinv, *Newmat ; Matrix *vert, *rays, *result; Polyhedron *Image; int rank, equcount ; int noofvertices = 0, noofrays = 0; int vercount , raycount; Value lcm, fact; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered FINDHERMITEBASISOFDOMAIN \n"); fclose(fp); #endif POL_ENSURE_FACETS(A); POL_ENSURE_VERTICES(A); /* Checking is empty */ if (emptyQ(A)) { B[0] = Identity(A->Dimension+1); return(-1); } value_init(lcm); value_init(fact); value_set_si(lcm,1); /* Finding the Vertices */ for (i = 0; i < A->NbRays; i++) if ((value_notzero_p(A->Ray[i][0])) && value_notzero_p(A->Ray[i][A->Dimension+1])) noofvertices++; else noofrays ++; vert = Matrix_Alloc(noofvertices,A->Dimension+1); rays = Matrix_Alloc(noofrays,A->Dimension); vercount = 0; raycount = 0; for(i = 0; i < A->NbRays; i++) { if ((value_notzero_p(A->Ray[i][0])) && value_notzero_p(A->Ray[i][A->Dimension+1])) { for(j = 1; j < A->Dimension+2; j++) value_assign(vert->p[vercount][j-1],A->Ray[i][j]); value_lcm(lcm, lcm, A->Ray[i][j-1]); vercount++; } else { for (j = 1; j < A->Dimension+1; j++) value_assign(rays->p[raycount][j-1],A->Ray[i][j]); raycount++; } } /* Multiplying the rows by the lcm */ for(i = 0; i < vert->NbRows; i ++) { value_division(fact,lcm,vert->p[i][vert->NbColumns-1]); for (j = 0; j < vert->NbColumns-1; j++) value_multiply(vert->p[i][j],vert->p[i][j],fact); } /* Drop the Last Columns */ temp = RemoveColumn(vert,vert->NbColumns-1); Matrix_Free(vert); /* Getting the Vectors */ vert = Matrix_Alloc(temp->NbRows-1, temp->NbColumns); for (i = 1; i < temp->NbRows; i++) for (j = 0; j < temp->NbColumns ; j++) value_subtract(vert->p[i-1][j],temp->p[0][j],temp->p[i][j]); Matrix_Free(temp); /* Add the Rays and Lines */ /* Combined Matrix */ result = Matrix_Alloc(vert->NbRows+rays->NbRows, vert->NbColumns); for (i = 0; i < vert->NbRows; i++) for (j = 0 ;j < result->NbColumns ; j++) value_assign(result->p[i][j],vert->p[i][j]); for (; iNbRows; i++) for (j = 0; j < result->NbColumns; j++) value_assign(result->p[i][j],rays->p[i-vert->NbRows][j]); Matrix_Free(vert); Matrix_Free(rays); rank = findHermiteBasis(result, &temp); temp1 = ChangeLatticeDimension(temp,temp->NbRows+1); Matrix_Free(result); Matrix_Free(temp); /* Adding the Affine Part to take care of the Equalities */ temp = Matrix_Copy(temp1); tempinv = Matrix_Alloc(temp->NbRows,temp->NbColumns); Matrix_Inverse(temp,tempinv); Matrix_Free(temp); Image = DomainImage(A,tempinv,MAXNOOFRAYS); Matrix_Free(tempinv); Newmat = Matrix_Alloc(temp1->NbRows,temp1->NbColumns); for(i = 0; i < rank ; i++) for(j = 0; j < Newmat->NbColumns ; j++) value_set_si(Newmat->p[i][j],0); for(i = 0; i < rank; i++) value_set_si(Newmat->p[i][i],1); equcount = 0; for (i = 0; i < Image->NbConstraints; i ++) if (value_zero_p(Image->Constraint[i][0])) { for (j = 1; jDimension+2; j ++) value_assign(Newmat->p[rank+equcount][j-1],Image->Constraint[i][j]); ++equcount ; } Domain_Free(Image); for (i = 0; i < Newmat->NbColumns-1; i++) value_set_si(Newmat->p[Newmat->NbRows-1][i],0); value_set_si(Newmat->p[Newmat->NbRows-1][Newmat->NbColumns-1],1); temp = Matrix_Alloc(Newmat->NbRows, Newmat->NbColumns); Matrix_Inverse(Newmat,temp); Matrix_Free(Newmat); B[0] = Matrix_Alloc(temp1->NbRows,temp->NbColumns); Matrix_Product(temp1,temp,B[0]); Matrix_Free(temp1); Matrix_Free(temp); value_clear(lcm); value_clear(fact); return rank; } /* FindHermiteBasisofDomain */ /* * Return the image of a lattice 'A' by the invertible, affine, rational * function 'M'. */ Lattice *LatticeImage(Lattice *A, Matrix *M) { Lattice *Img, *temp, *Minv; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp, "\nEntered LATTICEIMAGE \n"); fclose(fp); #endif if ((A->NbRows != M->NbRows) || (M->NbRows != M->NbColumns)) return (EmptyLattice (A->NbRows)); if (value_one_p(M->p[M->NbRows-1][M->NbColumns-1])) { Img = Matrix_Alloc ( M->NbRows, A->NbColumns ); Matrix_Product (M,A,Img); return Img; } temp = Matrix_Copy(M); Minv = Matrix_Alloc(temp->NbColumns, temp->NbRows); Matrix_Inverse(temp, Minv); Matrix_Free(temp); Img = LatticePreimage(A, Minv); Matrix_Free (Minv); return Img; } /* LatticeImage */ /* * Return the preimage of a lattice 'L' by an affine, rational function 'G'. * Algorithm: * (1) Prepare Diophantine equation : * [Gl -Ll][x y] = [Ga -La]{"l-linear, a-affine"} * (2) Solve the Diophantine equations. * (3) If there is solution to the Diophantine eq., extract the * general solution and the particular solution of x and that * forms the preimage of 'L' by 'G'. */ Lattice *LatticePreimage(Lattice *L, Matrix *G) { Matrix *Dio, *U ; Lattice *Result; Vector *X; int i,j; int rank; Value divisor, tmp; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered LATTICEPREIMAGE \n"); fclose(fp); #endif /* Check for the validity of the function */ if (G->NbRows != L->NbRows) { fprintf (stderr, "\nIn LatticePreimage: Incompatible types of Lattice and the function\n"); return (EmptyLattice(G->NbColumns)); } value_init(divisor); value_init(tmp); /* Making Diophantine Equations [g -L] */ value_assign(divisor,G->p[G->NbRows-1][G->NbColumns-1]); Dio = Matrix_Alloc(G->NbRows, G->NbColumns+L->NbColumns-1); for (i = 0; i < G->NbRows-1; i++) for (j = 0; j < G->NbColumns-1; j++) value_assign(Dio->p[i][j],G->p[i][j]); for (i = 0;i < G->NbRows-1; i++) for (j = 0; j < L->NbColumns-1; j++) { value_multiply(tmp,divisor,L->p[i][j]); value_oppose(Dio->p[i][j+G->NbColumns-1],tmp); } for (i = 0; i < Dio->NbRows-1; i++) { value_multiply(tmp,divisor,L->p[i][L->NbColumns-1]); value_subtract(tmp,G->p[i][G->NbColumns-1],tmp); value_assign(Dio->p[i][Dio->NbColumns-1],tmp); } for (i = 0; i < Dio->NbColumns-1; i++) value_set_si(Dio->p[Dio->NbRows-1][i],0); value_set_si(Dio->p[Dio->NbRows-1][Dio->NbColumns-1],1); rank = SolveDiophantine(Dio, &U, &X); if (rank == -1) Result = EmptyLattice(G->NbColumns); else { Result = Matrix_Alloc (G->NbColumns, G->NbColumns); for (i = 0; i < Result->NbRows-1; i++) for (j = 0; j < Result->NbColumns-1; j++) value_assign(Result->p[i][j],U->p[i][j]); for (i = 0; i < Result->NbRows-1; i ++) value_assign(Result->p[i][Result->NbColumns-1],X->p[i]); Matrix_Free (U); Vector_Free (X); for (i = 0; i < Result->NbColumns-1; i ++) value_set_si(Result->p[Result->NbRows-1][i],0); value_set_si(Result->p[i][i],1); } Matrix_Free(Dio); value_clear(divisor); value_clear(tmp); return Result; } /* LatticePreimage */ /* * Return True if the matrix 'm' is a valid lattice, otherwise return False. * Note: A valid lattice has the last row as [0 0 0 ... 1]. */ Bool IsLattice(Matrix *m) { int i; #ifdef DOMDEBUG FILE *fp; fp = fopen ("_debug", "a"); fprintf (fp, "\nEntered ISLATTICE \n"); fclose (fp); #endif /* Is it necessary to check if the lattice is fulldimensional or not here only? */ if (m->NbRows != m->NbColumns) return False; for (i = 0; i < m->NbColumns-1; i++) if (value_notzero_p(m->p[m->NbRows-1][i])) return False ; if (value_notone_p(m->p[i][i])) return False; return True ; } /* IsLattice */ /* * Check whether the matrix 'm' is full row-rank or not. */ Bool isfulldim(Matrix *m) { Matrix *h, *u ; int i ; /* res = Hermite (m, &h, &u); if (res != m->NbRows) return False ; */ Hermite(m, &h, &u); for (i = 0; i < h->NbRows; i ++) if (value_zero_p(h->p[i][i])) { Matrix_Free (h); Matrix_Free (u); return False; } Matrix_Free (h); Matrix_Free (u); return True; } /* isfulldim */ /* * This function takes as input a lattice list in which the lattices have the * same linear part, and almost the same affinepart, i.e. if A and B are two * of the lattices in the above lattice list and [a1, .. , an] and [b1 .. bn] * are the affineparts of A and B respectively, then for 0 < i < n ai = bi and * 'an' may not be equal to 'bn'. These are not the affine parts in the n-th * dimension, but the lattices have been tranformed such that the value of the * elment in the dimension on which we are simplifying is in the last row and * also the lattices are in a sorted order. * This function also takes as input the dimension along which we * are simplifying and takes the diagonal element of the lattice along that * dimension and tries to find out the factors of that element and sees if the * list of lattices can be simplified using these factors. The output of this * function is the list of lattices in the simplified form and a flag to indic- * ate whether any form of simplification was actually done or not. */ static Bool Simplify(LatticeUnion **InputList, LatticeUnion **ResultList, int dim) { int i; LatticeUnion *prev, *temp; factor allfac; Bool retval = False; int width; Value cnt, aux, k, fac, num, tmp, foobar; if ((*InputList == NULL) || (InputList[0]->next == NULL)) return False ; value_init(aux); value_init(cnt); value_init(k); value_init(fac); value_init(num); value_init(tmp); value_init(foobar); width = InputList[0]->M->NbRows-1; allfac = allfactors(VALUE_TO_INT(InputList[0]->M->p[dim][dim])); value_set_si(cnt,0); for (temp = InputList[0]; temp != NULL; temp = temp->next) value_increment(cnt,cnt); for(i = 0; i < allfac.count; i++) { value_set_si(foobar,allfac.fac[i]); value_division(aux,InputList[0]->M->p[dim][dim],foobar); if(value_ge(cnt,aux)) break; } if (i == allfac.count) { value_clear(cnt); value_clear(aux); value_clear(k); value_clear(fac); value_clear(num); value_clear(tmp); value_clear(foobar); return False; } for (; i < allfac.count; i++) { Bool Present = False; value_set_si(k,0); if (*InputList == NULL) { value_clear(cnt); value_clear(aux); value_clear(k); value_clear(fac); value_clear(num); value_clear(tmp); value_clear(foobar); return retval; } value_set_si(foobar,allfac.fac[i]); value_division(num,InputList[0]->M->p[dim][dim],foobar); while (value_lt(k,foobar)) { Present = False; value_assign(fac,k); for (temp = *InputList; temp != NULL; temp = temp->next) { if (value_eq(temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1],fac)) { value_set_si(foobar,allfac.fac[i]); value_addto(fac,fac,foobar); if (value_ge(fac,(*InputList)->M->p[dim][dim])) { Present = True; break; } } if (value_gt(temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1],fac)) break; } if (Present == True) { retval = True; if (*ResultList == NULL) *ResultList = temp = (LatticeUnion *)malloc(sizeof(LatticeUnion)); else { for (temp = *ResultList; temp->next != NULL; temp = temp->next); temp->next = (LatticeUnion *) malloc (sizeof (LatticeUnion)); temp = temp->next; } temp->M = Matrix_Copy(InputList[0]->M); temp->next = NULL; value_set_si(foobar,allfac.fac[i]); value_assign(temp->M->p[dim][dim],foobar); value_assign(temp->M->p[dim][width],k); value_set_si(temp->M->p[width][width],1); /* Deleting the Lattices from the curlist */ value_assign(tmp,k); prev = NULL; temp = InputList[0]; while (temp != NULL) { if (value_eq(temp->M->p[width][width],tmp)) { if (temp == InputList[0]) { prev = temp; temp = InputList [0] = temp->next; Matrix_Free(prev->M); free(prev); } else { prev->next = temp->next; Matrix_Free(temp->M); free(temp); temp = prev->next; } value_set_si(foobar,allfac.fac[i]); value_addto(tmp,tmp,foobar); } else { prev = temp; temp = temp->next; } } } value_increment(k,k); } } value_clear(cnt); value_clear(aux); value_clear(k); value_clear(fac); value_clear(num); value_clear(tmp); value_clear(foobar); return retval; } /* Simplify */ /* * This function is used in the qsort function in sorting the lattices. Given * two lattices 'A' and 'B', both in HNF, where A = [ [a11 0], [a21, a22, 0] . * .... [an1, .., ann] ] and B = [ [b11 0], [b21, b22, 0] ..[bn1, .., bnn] ], * then A < B, if there exists a pair such that [aij < bij] and for every * other pair , 0<=i1NbRows-1; i++) for (j = 0; j <= i ; j++) { if (value_gt(L1[0]->p[i][j],L2[0]->p[i][j])) return 1; if (value_lt(L1[0]->p[i][j],L2[0]->p[i][j])) return -1; } return 0; } /* LinearPartCompare */ /* * This function takes as input a List of Lattices and sorts them on the basis * of their Linear parts. It sorts in place, as a result of which the input * list is modified to the sorted order. */ static void LinearPartSort (LatticeUnion *Head) { int cnt; Lattice **Latlist; LatticeUnion *temp ; cnt = 0; for (temp = Head; temp != NULL; temp = temp->next) cnt ++; Latlist = (Lattice **) malloc ( sizeof (Lattice *) * cnt); cnt = 0; for (temp = Head; temp != NULL; temp = temp->next) Latlist[cnt++] = temp->M; qsort(Latlist, cnt, sizeof(Lattice *), LinearPartCompare); cnt = 0; for (temp = Head; temp != NULL; temp = temp->next) temp->M = Latlist[cnt++]; free (Latlist); return; } /* LinearPartSort */ /* * This function is used in 'AfiinePartSort' in sorting the lattices with the * same linear part. GIven two lattices 'A' and 'B' with affineparts [a1 .. an] * and [b1 ... bn], then A < B if for some 0 < i <= n, ai < bi and for 0 < i1 < * i, ai1 = bi1. */ static int AffinePartCompare(const void *A, const void *B) { int i; Lattice **L1, **L2; L1 = (Lattice **)A; L2 = (Lattice **)B; for (i = 0; i < L1[0]->NbRows; i++) { if (value_gt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) return 1; if (value_lt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) return -1; } return 0 ; } /* AffinePartCompare */ /* * This function takes a list of lattices with the same linear part and sorts * them on the basis of their affine part. The sorting is done in place. */ static void AffinePartSort (LatticeUnion *List) { int cnt; Lattice **LatList; LatticeUnion *tmp; cnt = 0; for (tmp = List; tmp != NULL; tmp = tmp->next) cnt ++; LatList = (Lattice **) malloc (sizeof(Lattice *) * cnt); cnt = 0; for (tmp = List; tmp != NULL; tmp = tmp->next) LatList[cnt++] = tmp->M; qsort(LatList,cnt, sizeof (Lattice *), AffinePartCompare); cnt = 0; for (tmp = List; tmp != NULL; tmp = tmp->next) tmp->M = LatList[cnt++]; return; } /* AffinePartSort */ static Bool AlmostSameAffinePart(LatticeUnion *A, LatticeUnion *B) { int i; if ((A == NULL) || (B == NULL)) return False; for (i = 0; i < A->M->NbRows-1; i ++) if (value_ne(A->M->p[i][A->M->NbColumns-1],B->M->p[i][A->M->NbColumns-1])) return False; return True; } /* AlmostSameAffinePart */ /* * This function takes a list of lattices having the same linear part and tries * to simplify these lattices. This may not be the only way of simplifying the * lattices. The function returns a list of partially simplified lattices and * also a flag to tell whether any simplification was performed at all. */ static Bool AffinePartSimplify(LatticeUnion *curlist, LatticeUnion **newlist) { int i; Value aux; LatticeUnion *temp, *curr, *next; LatticeUnion *nextlist; Bool change = False, chng; if (curlist == NULL) return False; if (curlist->next == NULL) { curlist->next = newlist[0]; newlist[0] = curlist; return False ; } value_init(aux); for (i = 0; i < curlist->M->NbRows - 1; i ++) { /* Interchanging the elements of the Affine part for easy computation of the sort (using qsort) */ for (temp = curlist; temp != NULL; temp = temp->next) { value_assign(aux,temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1]); value_assign(temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1],temp->M->p[i][temp->M->NbColumns-1]); value_assign(temp->M->p[i][temp->M->NbColumns-1],aux); } AffinePartSort(curlist); nextlist = NULL; curr = curlist; while (curr != NULL) { next = curr->next; if (!AlmostSameAffinePart(curr, next)) { curr->next = NULL; chng = Simplify(&curlist, newlist, i); if (nextlist == NULL) nextlist = curlist; else { LatticeUnion *tmp; for (tmp = nextlist; tmp->next; tmp=tmp->next); tmp->next = curlist; } change = (Bool)(change | chng); curlist = next; } curr = next; } curlist = nextlist; /* Interchanging the elements of the Affine part for easy computation of the sort (using qsort) */ for(temp = curlist; temp != NULL; temp = temp->next) { value_assign(aux,temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1]); value_assign(temp->M->p[temp->M->NbRows-1][temp->M->NbColumns-1],temp->M->p[i][temp->M->NbColumns-1]); value_assign(temp->M->p[i][temp->M->NbColumns-1],aux); } if (curlist == NULL) break; } if ( *newlist == NULL) *newlist = nextlist; else { for (curr = *newlist; curr->next != NULL; curr = curr->next); curr->next = nextlist; } value_clear(aux); return change; } /* AffinePartSimplify */ static Bool SameLinearPart(LatticeUnion *A, LatticeUnion *B) { int i, j; if ((A == NULL) || (B ==NULL)) return False; for (i = 0; i < A->M->NbRows-1; i++) for (j = 0; j <= i; j++) if (value_ne(A->M->p[i][j],B->M->p[i][j])) return False; return True; } /* SameLinearPart */ /* * Given a union of lattices, return a simplified list of lattices. */ LatticeUnion *LatticeSimplify(LatticeUnion *latlist) { LatticeUnion *curlist, *nextlist; LatticeUnion *curr, *next; Bool change = True, chng; curlist = latlist; while (change == True) { change = False; LinearPartSort(curlist); curr = curlist; nextlist = NULL; while(curr != NULL) { next = curr->next; if (!SameLinearPart(curr, next)) { curr->next = NULL; chng = AffinePartSimplify(curlist, &nextlist); change = (Bool)(change | chng); curlist = next; } curr = next; } curlist = nextlist; } return curlist; } /* LatticeSimplify */ int intcompare (const void *a, const void *b) { int *i, *j; i = (int *) a; j = (int *) b; if (*i > *j) return 1; if (*i < *j) return -1; return 0; } /* intcompare */ static int polylib_sqrt(int i); static factor allfactors (int num) { int i,j, tmp; int noofelmts = 1; int *list, *newlist; int count; factor result; list = (int *)malloc(sizeof (int)); list[0] = 1; tmp = num; for (i = 2; i <= polylib_sqrt(tmp); i++) { if ((tmp % i) == 0) { if (noofelmts == 0) { list = (int *) malloc (sizeof (int)); list[0] = i; noofelmts = 1; } else { newlist = (int *) malloc (sizeof (int) * 2 * noofelmts + 1); for (j = 0; j < noofelmts; j++) newlist[j] = list[j] ; newlist[j] = i; for (j = 0; j < noofelmts; j++) newlist[j+noofelmts+1] = i * list[j]; free (list); list = newlist; noofelmts= 2*noofelmts+1; } tmp = tmp / i; i = 1; } } if ((tmp != 0) && (tmp != num)) { newlist = (int *) malloc (sizeof (int) * 2 * noofelmts + 1); for (j = 0; j < noofelmts; j ++) newlist[j] = list[j] ; newlist[j] = tmp; for (j = 0; j < noofelmts; j ++) newlist[j+noofelmts+1] = tmp * list[j]; free (list); list = newlist; noofelmts= 2*noofelmts+1; } qsort (list, noofelmts, sizeof(int), intcompare); count = 1; for (i = 1; i < noofelmts; i ++) if (list[i] != list[i-1]) list[count++] = list[i]; if (list[count-1] == num) count --; result.fac = (int *) malloc (sizeof (int) * count); result.count = count; for (i = 0; i < count; i ++) result.fac[i] = list[i]; free (list); return result; } /* allfactors */ static int polylib_sqrt (int i) { int j; j = 0; i = i > 0 ? i : -i; while (1) { if ((j * j) > i) break; else j ++; } return (j-1); } /* polylib_sqrt */ polylib-5.22.5.orig/source/kernel/NormalForms.c0000644000175000017500000004540311341227527022275 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include /* nota bene: on stocke les matrices par lignes */ /* nota bene: matrices are stored in row major order */ /*------------------------------------------------------------------------ change les signes de la ligne i de la matrice A change the sign of row i of matrix A ------------------------------------------------------------------------*/ static void moins_l(Value *a,int i,int n,int p) { int k; Value *c; c=a+(i-1)*p; for(k=1; k<=p; k++) { value_oppose(*c,*c); c++; } return; } /* moins_l */ /*------------------------------------------------------------------------ change les signes de la colonne i de la matrice A change the sign of column i of matrix A ------------------------------------------------------------------------*/ static void moins_c(Value *a,int i,int n,int p) { int k; Value *c; c=a+(i-1); for(k=1;k<=n;k++) { value_oppose(*c,*c); c=c+p; } return; } /* moins_c */ /*------------------------------------------------------------------------ echange les lignes i et j de la matrice A exchange row i and j of matrix A ------------------------------------------------------------------------*/ static void echange_l(Value *a,int i,int j,int n,int p) { int k; Value s; Value *c1,*c2; value_init(s); c1=a+(i-1)*p; c2=a+(j-1)*p; for(k=1;k<=p;k++) { value_assign(s,*c1); value_assign(*c1,*c2); value_assign(*c2,s); c1++; c2++; } value_clear(s); return; } /* echange_l */ /*------------------------------------------------------------------------ echange les colonnes i et j de la matrice A exchange columns i and j of matrix A ------------------------------------------------------------------------*/ static void echange_c(Value *a,int i,int j,int n,int p) { int k; Value s; Value *c1,*c2; value_init(s); c1=a+(i-1); c2=a+(j-1); for(k=1;k<=n;k++) { value_assign(s,*c1); value_assign(*c1,*c2); value_assign(*c2,s); c1=c1+p; c2=c2+p; } value_clear(s); return; } /* echange_c */ /*------------------------------------------------------------------------ A est une matrice de taille n*p on ajoute a la ligne i, x fois la ligne j A is a matrix of size n*p we add x times the row j to the row i ------------------------------------------------------------------------*/ static void ligne(Value *a,int i,int j,Value x,int n,int p) { int k; Value *c1,*c2; c1=a+(i-1)*p; c2=a+(j-1)*p; for(k=1;k<=p;k++) { value_addmul(*c1, x, *c2); c1++; c2++; } return; } /* ligne */ /*------------------------------------------------------------------------ A est une matrice de taille n*p on ajoute a la colonne i, x fois la colonne j A is a matrix of size n*p we add x times the column j to the column i ------------------------------------------------------------------------*/ static void colonne(Value *a,int i,int j,Value x,int n,int p) { int k; Value *c1,*c2; c1=a+(i-1); c2=a+(j-1); for(k=1;k<=n;k++) { value_addmul(*c1, x, *c2); c1=c1+p; c2=c2+p; } return; } /* colonne */ /*---------------------------------------------------------------------- trouve le numero de colonne du plus petit element non nul de la ligne q, d'indice superieur a q, de la matrice A, mais renvoie zero si tous les elements sont nuls sauf le qieme. find the column number (greater than q) of the smallest non null element of row q . it returns 0 if all the last elements of row q are null except the qth ----------------------------------------------------------------------*/ static int petit_l(Value *a,int n,int p,int q) { int numero=0, k, tousnuls; Value minus, comp; Value *c; value_init(minus); value_init(comp); c=a+(q-1)*p+(p-1); tousnuls=1; for(k=p;k>q;k--) { value_absolute(comp,*c); if (value_notzero_p(comp)) { if (tousnuls==1) { value_assign(minus,comp); numero=k; tousnuls=0; } else if (value_ge(minus,comp)) { value_assign(minus,comp); numero=k; } } c--; } if (tousnuls==1) { value_clear(minus); value_clear(comp); return(0); } else { value_absolute(comp,*c); if ((value_notzero_p(comp))&&(value_ge(minus,comp))) { value_clear(minus); value_clear(comp); return(q); } else { value_clear(minus); value_clear(comp); return(numero); } } } /* petit_l */ /*---------------------------------------------------------------------- trouve le numero de ligne du plus petit element non nul de la colonne q, d'indice superieur a q, de la matrice A, mais renvoie zero si tous les elements sont nuls sauf le qieme. find the row number (greater than q) of the smallest non null element of column q . it returns 0 if all the last elements of column q are null except the qth ----------------------------------------------------------------------*/ static int petit_c(Value *a,int n,int p,int q) { int numero=0, k, tousnuls; Value minus, comp; Value *c; value_init(minus); value_init(comp); c = a+q-1+p*(n-1); tousnuls=1; for(k=n;k>q;k--) { value_absolute(comp,*c); if (value_notzero_p(comp)) { if (tousnuls==1) { value_assign(minus,comp); numero=k; tousnuls=0; } else if (value_ge(minus,comp)) { value_assign(minus,comp); numero=k; } } c=c-p; } if (tousnuls==1) { value_clear(minus); value_clear(comp); return(0); } else { value_absolute(comp,*c); if ((value_notzero_p(comp)) && (value_ge(minus,comp))) { value_clear(minus); value_clear(comp); return(q); } else { value_clear(minus); value_clear(comp); return(numero); } } } /* petit_c */ /*----------------------------------------------------------------------- A est initialisee a une matrice "identite" de taille n*p A is initialized to an "identity" matrix of size n*p -----------------------------------------------------------------------*/ static void identite(Value *a,int n,int p) { int i,j; Value *b; b = a; for(i=1;i<=n;i++) { for(j=1;j<=p;j++) { if (i==j) value_set_si(*b,1); else value_set_si(*b,0); b++; } } return; } /* identite */ /*----------------------------------------------------------------------- transpose la sous-matrice de A dont les indices sont superieurs ou egaux a q transposition of the sub-matrix of A composed of the elements whose indices are greater or equal to q -----------------------------------------------------------------------*/ static void transpose(Value *a,int n,int q) { int i; Value val; Value *b,*c; value_init(val); if (q q mais renvoie 0 sinon find the column number of the first non-divisible by val element in the sub-matrix of a composed of the elements of indices >q. Return 0 is there is no such element ----------------------------------------------------------------------*/ static int encore(Value *a,int n,int p,int q,Value val) { int k,l; Value comp, tmp; Value *c; if ((q>=n)||(q>=p)) return(0); value_init(comp); value_init(tmp); c=a+q*p+q; k=q+1; l=q+1; while (k<=n) { value_absolute(comp,*c); if (value_zero_p(val)) { if (value_notzero_p(comp)) { value_clear(comp); value_clear(tmp); return(l); } } else { value_modulus(tmp,comp,val); if (value_notzero_p(tmp)) { value_clear(comp); value_clear(tmp); return(l); } } if (l==p) { k=k+1; l=q+1; c=c+q+1; } else { l++; c++; } } value_clear(comp); value_clear(tmp); return(0); } /* encore */ /*---------------------------------------------------------------------- transforme la matrice A (de taille n*p), a partir de la position q*q en sa forme de smith, les matrices b et c subissant les memes transformations respectivement sur les lignes et colonnes transform the matrix A (size n*p), from position (q,q) into its smith normal form. the same transformations are applied to matrices b and c, respectively on rows and on columns ----------------------------------------------------------------------*/ static void smith(Value *a,Value *b,Value *c,Value *b_inverse,Value *c_inverse,int n,int p,int q) { int i,k,fini; Value x, pivot, tmp, x_inv; Value *f; value_init(pivot); value_init(tmp); value_init(x); value_init(x_inv); if ((q<=n)&&(q<=p)) { fini = 1; while (fini!=0) { i=petit_c(a,n,p,q); while (i!=0) { if (i!=q) { echange_l(a,i,q,n,p); echange_l(b,i,q,n,n); echange_c(b_inverse,i,q,n,n); } f=a+(q-1)+(q-1)*p; value_assign(pivot,*f); if (value_neg_p(pivot)) { moins_l(a,q,n,p); moins_l(b,q,n,n); moins_c(b_inverse,q,n,n); value_oppose(pivot,pivot); } for(k=q+1;k<=n;k++) { f=f+p; if (value_notzero_p(*f)) { value_division(x,*f,pivot); value_modulus(tmp,*f,pivot); if (value_neg_p(tmp)) value_decrement(x,x); value_oppose(x_inv,x); ligne(a,k,q,x_inv,n,p); ligne(b,k,q,x_inv,n,n); colonne(b_inverse,q,k,x,n,n); } } i=petit_c(a,n,p,q); } fini=0; i=petit_l(a,n,p,q); while (i!=0) { if (i!=q) { echange_c(a,i,q,n,p); echange_c(c,i,q,p,p); echange_l(c_inverse,i,q,p,p); fini=1; } f=a+(q-1)+(q-1)*p; value_assign(pivot,*f); if (value_neg_p(pivot)) { moins_c(a,q,n,p); moins_c(c,q,p,p); moins_l(c_inverse,q,p,p); value_oppose(pivot,pivot); } for(k=q+1;k<=p;k++) { f++; if (value_notzero_p(*f)) { value_division(x,*f,pivot); value_modulus(tmp,*f,pivot); if (value_neg_p(tmp)) value_decrement(x,x); value_oppose(x_inv,x); colonne(a,k,q,x_inv,n,p); colonne(c,k,q,x_inv,p,p); ligne(c_inverse,q,k,x,p,p); } } i=petit_l(a,n,p,q); } } value_assign(pivot,*(a+(q-1)+(q-1)*p)); if (value_neg_p(pivot)) { moins_l(a,q,n,p); moins_l(b,q,n,n); moins_c(b_inverse,q,n,n); value_oppose(pivot,pivot); } i=encore(a,n,p,q,pivot); if (i!=0) { value_set_si(x,1); value_set_si(x_inv,-1); colonne(a,q,i,x,n,p); colonne(c,q,i,x,p,p); ligne(c_inverse,i,q,x_inv,p,p); smith(a,b,c,b_inverse,c_inverse,n,p,q); } else smith(a,b,c,b_inverse,c_inverse,n,p,q+1); } value_clear(pivot); value_clear(tmp); value_clear(x); value_clear(x_inv); return; } /* smith */ /*---------------------------------------------------------------------- decompose la matrice A en le produit d'une matrice B unimodulaire et d'une matrice triangulaire superieure D est l'inverse de B Decompose the matrix A in the product of a matrix B unimodular and a matrix upper triangular, D is the inverse of B ----------------------------------------------------------------------*/ static void hermite(Value *a,Value *b,Value *d,int n,int p,int q) { int i,k; Value x, pivot, x_inv, tmp; Value *c1; value_init(pivot); value_init(tmp); value_init(x); value_init(x_inv); if ((q<=p)&&(q<=n)) { i=petit_c(a,n,p,q); while (i!=0) { if (i!=q) { echange_l(a,i,q,n,p); echange_c(b,i,q,n,n); echange_l(d,i,q,n,n); } c1=a+(q-1)+(q-1)*p; value_assign(pivot,*c1); if (value_neg_p(pivot)) { moins_l(a,q,n,p); moins_l(d,q,n,n); moins_c(b,q,n,n); value_oppose(pivot,pivot); } for(k=q+1;k<=n;k++) { c1=c1+p; if (value_notzero_p(*c1)) { value_division(x,*c1,pivot); value_modulus(tmp,*c1,pivot); if (value_neg_p(tmp)) value_decrement(x,x); value_oppose(x_inv,x); ligne(a,k,q,x_inv,n,p); colonne(b,q,k,x,n,n); ligne(d,k,q,x_inv,n,n); } } i=petit_c(a,n,p,q); } c1=a+(q-1); value_assign(pivot,*(c1+(q-1)*p)); if (value_neg_p(pivot)) { moins_l(a,q,n,p); moins_l(d,q,n,n); moins_c(b,q,n,n); value_oppose(pivot,pivot); } if (value_notzero_p(pivot)) { for(k=1;kNbRows * A->NbColumns); for(i=0;iNbRows * A->NbColumns;i++) value_init(result[i]); for (i = 0; i < A->NbRows; i++) for (j = 0 ; j < A->NbColumns; j++) value_assign(result[i*A->NbColumns + j],A->p[i][j]); return result; } /* ConvertPolMattoDarMat */ /** Convert DarmattoPolmat *** This function converts the matrix from Darte representation to a matrix *** in PolyLib. *** *** Input : The matrix (a pointer to it), number of Rows, number of columns *** Output : The matrix of the PolyLib *** **/ static Matrix *ConvertDarMattoPolMat (Value *A, int NbRows, int NbCols) { int i,j; Matrix *result; result = Matrix_Alloc(NbRows, NbCols); for (i = 0; i < NbRows; i ++) for (j = 0; j < NbCols; j ++) value_assign(result->p[i][j],A[i*NbCols + j]); return result; } /* ConvertDarMattoPolMat */ /** *** Smith : This function takes a Matrix A of dim n * l as its input *** and returns the three matrices U, V and Product such that *** A = U * Product * V, where U is an unimodular matrix of dimension *** n * n and V is an unimodular matrix of dimension l * l. *** Product is a diagonal matrix of dimension n * l. *** *** We use Alan Darte's implementation of Smith for computing *** the Smith Normal Form **/ void Smith(Matrix *A, Matrix **U, Matrix **V, Matrix **Product) { int i; Matrix *u, *v; u = Identity(A->NbRows); v = Identity(A->NbColumns); *U = Identity(A->NbRows); *V = Identity(A->NbColumns); *Product = Matrix_Copy(A); smith((*Product)->p_Init, u->p_Init, v->p_Init, (*U)->p_Init, (*V)->p_Init, A->NbRows, A->NbColumns, 1); Matrix_Free(u); Matrix_Free(v); } /* Smith */ /** Hermite : *** This function takes a Matrix as its input and finds its HNF *** ( Left form ) *** *** Input : A Matrix A (The Matrix A is not necessarily a Polylib matrix. *** It is just a matrix as far as Hermite is concerned. It *** does not even check if the matrix is a Polylib matrix or not) *** Output : The Hnf matrix H and the Unimodular matrix U such that *** A = H * U. *** *** We use Alan Darte's implementation of Hermite to compute the HNF. *** Alan Darte's implementation computes the Upper Triangular HNF. *** So We work on the fact that if A = H * U then *** A (transpose) = U(transpose) * H (transpose) *** There are a set of interface functions written in Interface.c *** which convert a matrix from Polylib representationt to that of *** Alan Darte's and vice versa. *** *** This Function Does the Following *** Step 1 : Given the matrix A it finds its Transpose. *** Step 2 : Finds the HNF (Right Form) using Alan Darte's Algorithm. *** Step 3 : The H1 and U1 obtained in Step2 are both Transposed to get *** the actual H and U such that A = HU. **/ void Hermite (Matrix *A, Matrix **H, Matrix **U) { int i; Matrix *transpose, *tempH, *tempU ; Value *darte_matA, *darte_identite, *darte_id_inv; transpose = Transpose(A); darte_matA = ConvertPolMattoDarMat(transpose); darte_identite = (Value *)malloc(sizeof(Value) * A->NbColumns* A->NbColumns); darte_id_inv = (Value *) malloc(sizeof(Value) * A->NbColumns*A->NbColumns); for (i=0; i< A->NbColumns * A->NbColumns; i++) value_init(darte_identite[i]); for (i=0; i< A->NbColumns * A->NbColumns; i++) value_init(darte_id_inv[i]); identite(darte_identite, transpose->NbRows, transpose->NbRows); identite(darte_id_inv, transpose->NbRows, transpose->NbRows); hermite(darte_matA, darte_identite, darte_id_inv,A->NbColumns,A->NbRows, 1); Matrix_Free (transpose); transpose = ConvertDarMattoPolMat(darte_matA, A->NbColumns, A->NbRows); tempU = ConvertDarMattoPolMat(darte_identite, A->NbColumns, A->NbColumns); /* Finding H Transpose */ tempH = Transpose(transpose); Matrix_Free(transpose); /* Finding U Transpose */ transpose = Transpose(tempU); H[0] = Matrix_Copy(tempH); U[0] = Matrix_Copy(transpose); Matrix_Free (tempH); Matrix_Free (transpose); Matrix_Free (tempU); for (i=0; i< A->NbRows * A->NbColumns; i++) value_clear(darte_matA[i]); for (i=0; i< A->NbColumns * A->NbColumns; i++) value_clear(darte_identite[i]); for (i=0; i< A->NbColumns * A->NbColumns; i++) value_clear(darte_id_inv[i]); free (darte_matA); free (darte_identite); free (darte_id_inv); return; } /* Hermite */ polylib-5.22.5.orig/source/kernel/errormsg.c0000644000175000017500000000372611341227527021700 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* errormsg.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #include #include extern int Pol_status; /* This function allows either error messages to be sent to Mathematica, or messages to be printed to stderr. If MATHLINK is defined, then a command Message[f::msgname] is sent to Mathematica. If not, one prints on stderr. The difference with errormsg is that the control should be returned immediately to Mathematica after the call to errormsg1. Therefore, no Compound statement is sent to Mathematica. */ void errormsg1(const char *f, const char *msgname, const char *msg) { Pol_status = 1; #ifdef MATHLINK MLPutFunction(stdlink,"Message",1); MLPutFunction(stdlink,"MessageName",2); MLPutSymbol(stdlink,f); MLPutString(stdlink,msgname); #else #ifndef NO_MESSAGES fprintf(stderr, "?%s: %s\n", f, msg); #endif #endif } polylib-5.22.5.orig/source/kernel/polyhedron.c0000644000175000017500000042026211341227527022221 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* polyhedron.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ /* 1997/12/02 - Olivier Albiez Ce fichier contient les fonctions de la polylib de l'IRISA, passees en 64bits. La structure de la polylib a donc ete modifie pour permettre le passage aux Value. La fonction Chernikova a ete reecrite. */ /* 1998/26/02 - Vincent Loechner Ajout de nombreuses fonctions, a la fin de ce fichier, pour les polyedres parametres 64 bits. 1998/16/03 #define DEBUG printf tests out of memory compatibilite avec la version de doran */ #undef POLY_DEBUG /* debug printf: general functions */ #undef POLY_RR_DEBUG /* debug printf: Remove Redundants */ #undef POLY_CH_DEBUG /* debug printf: Chernikova */ #include #include #include #include #include #ifdef MAC_OS #define abs __abs #endif /* WSIZE is the number of bits in a word or int type */ #define WSIZE (8*sizeof(int)) #define bexchange(a, b, l)\ {\ char *t = (char *)malloc(l*sizeof(char));\ memcpy((t), (char *)(a), (int)(l));\ memcpy((char *)(a), (char *)(b), (int)(l));\ memcpy((char *)(b), (t), (int)(l));\ free(t); \ } #define exchange(a, b, t)\ { (t)=(a); (a)=(b); (b)=(t); } /* errormsg1 is an external function which is usually supplied by the calling program (e.g. Domlib.c, ReadAlpha, etc...). See errormsg.c for an example of such a function. */ void errormsg1(const char *f, const char *msgname, const char *msg); int Pol_status; /* error status after operations */ /* * The Saturation matrix is defined to be an integer (int type) matrix. * It is a boolean matrix which has a row for every constraint and a column * for every line or ray. The bits in the binary format of each integer in * the stauration matrix stores the information whether the corresponding * constraint is saturated by ray(line) or not. */ typedef struct { unsigned int NbRows; unsigned int NbColumns; int **p; int *p_init; } SatMatrix; /* * Allocate memory space for a saturation matrix. */ static SatMatrix *SMAlloc(int rows,int cols) { int **q, *p, i; SatMatrix *result; result = (SatMatrix *) malloc (sizeof(SatMatrix)); if(!result) { errormsg1("SMAlloc", "outofmem", "out of memory space"); return 0; } result->NbRows = rows; result->NbColumns = cols; if(rows == 0 || cols == 0) { result->p = NULL; return result; } result->p = q = (int **)malloc(rows * sizeof(int *)); if(!result->p) { errormsg1("SMAlloc", "outofmem", "out of memory space"); return 0; } result->p_init = p = (int *)malloc (rows * cols * sizeof (int)); if(!result->p_init) { errormsg1("SMAlloc", "outofmem", "out of memory space"); return 0; } for (i=0; ip) { free ((char *) SM->p_init); free ((char *) SM->p); } free ((char *) SM); *matrix = NULL; } } /* SMFree */ /* * Print the contents of a saturation matrix. * This function is defined only for debugging purpose. */ static void SMPrint (SatMatrix *matrix) { int *p; int i, j; unsigned NbRows, NbColumns; fprintf(stderr,"%d %d\n",NbRows=matrix->NbRows, NbColumns=matrix->NbColumns); for (i=0;ip+i); for (j=0;jNbRows != 0) sat_nbcolumns = (Mat->NbRows-1) /(sizeof(int)*8) + 1; else sat_nbcolumns = 0; result = SMAlloc(Ray->NbRows, sat_nbcolumns); SMVector_Init(result->p_init, Ray->NbRows * sat_nbcolumns); for(i=0,jx1=0,bx1=MSB; iNbRows; i++) { for(j=0,jx2=0,bx2=MSB; jNbRows; j++) { if (Sat->p[j][jx1] & bx1) result->p[i][jx2] |= bx2; NEXT(jx2,bx2); } NEXT(jx1, bx1); } return result; } /* TransformSat */ /* * Sort the rays (Ray, Sat) into three tiers as used in 'Chernikova' function: * NbBid <= i < equal_bound : saturates the constraint * equal_bound <= i < sup_bound : verifies the constraint * sup_bound <= i < NbRay : does not verify * * 'Ray' is the matrix of rays and 'Sat' is the corresponding saturation * matrix. (jx,bx) pair specify the constraint in the saturation matrix. The * status element of the 'Ray' matrix holds the saturation value w.r.t the * constraint specified by (jx,bx). Thus * Ray->p[i][0] = 0 -> ray(i) saturates the constraint * Ray->p[i][0] > 0 -> ray(i) verifies the constraint * Ray->p[i][0] < 0 -> ray(i) doesn't verify the constraint */ static void RaySort(Matrix *Ray,SatMatrix *Sat,int NbBid,int NbRay,int *equal_bound,int *sup_bound,unsigned RowSize1, unsigned RowSize2, unsigned bx, unsigned jx) { int inf_bound; Value **uni_eq, **uni_sup, **uni_inf; int **inc_eq, **inc_sup, **inc_inf; /* 'uni_eq' points to the first ray in the ray matrix which verifies a * constraint, 'inc_eq' is the corresponding pointer in saturation * matrix. 'uni_inf' points to the first ray (from top) which doesn't * verify a constraint, 'inc_inf' is the corresponding pointer in * saturation matrix. 'uni_sup' scans the ray matrix and 'inc_sup' is * the corresponding pointer in saturation matrix. 'inf_bound' holds the * number of the first ray which does not verify the constraints. */ *sup_bound = *equal_bound = NbBid; uni_sup = uni_eq = Ray->p+NbBid; inc_sup = inc_eq = Sat->p+NbBid; inf_bound = NbRay; uni_inf = Ray->p+NbRay; inc_inf = Sat->p+NbRay; while (inf_bound>*sup_bound) { if (value_zero_p(**uni_sup)) { /* status = satisfy */ if (inc_eq != inc_sup) { Vector_Exchange(*uni_eq,*uni_sup,RowSize1); bexchange(*inc_eq,*inc_sup,RowSize2); } (*equal_bound)++; uni_eq++; inc_eq++; (*sup_bound)++; uni_sup++; inc_sup++; } else { *((*inc_sup)+jx)|=bx; /* if (**uni_sup<0) */ if (value_neg_p(**uni_sup)) { /* Status != verify */ inf_bound--; uni_inf--; inc_inf--; if (inc_inf != inc_sup) { Vector_Exchange(*uni_inf,*uni_sup,RowSize1); bexchange(*inc_inf,*inc_sup,RowSize2); } } else { /* status == verify */ (*sup_bound)++; uni_sup++; inc_sup++; } } } } /* RaySort */ static void SatMatrix_Extend(SatMatrix *Sat, Matrix* Mat, unsigned rows) { int i; unsigned cols; cols = (Mat->NbRows - 1)/(sizeof(int)*8) + 1; Sat->p = (int **)realloc(Sat->p, rows * sizeof(int *)); if(!Sat->p) { errormsg1("SatMatrix_Extend", "outofmem", "out of memory space"); return; } Sat->p_init = (int *)realloc(Sat->p_init, rows * cols * sizeof (int)); if(!Sat->p_init) { errormsg1("SatMatrix_Extend", "outofmem", "out of memory space"); return; } for (i = 0; i < rows; ++i) Sat->p[i] = Sat->p_init + (i * cols); Sat->NbRows = rows; } /* * Compute the dual of matrix 'Mat' and place it in matrix 'Ray'.'Mat' * contains the constraints (equalities and inequalities) in rows and 'Ray' * contains the ray space (lines and rays) in its rows. 'Sat' is a boolean * saturation matrix defined as Sat(i,j)=0 if ray(i) saturates constraint(j), * otherwise 1. The constraints in the 'Mat' matrix are processed starting at * 'FirstConstraint', 'Ray' and 'Sat' matrices are changed accordingly.'NbBid' * is the number of lines in the ray matrix and 'NbMaxRays' is the maximum * number of rows (rays) permissible in the 'Ray' and 'Sat' matrix. Return 0 * if successful, otherwise return 1. */ static int Chernikova (Matrix *Mat,Matrix *Ray,SatMatrix *Sat, unsigned NbBid, unsigned NbMaxRays, unsigned FirstConstraint,unsigned dual) { unsigned NbRay, Dimension, NbConstraints, RowSize1, RowSize2, sat_nbcolumns; int sup_bound, equal_bound, index_non_zero, bound; int i, j, k, l, redundant, rayonly, nbcommonconstraints; int *Temp, aux; int *ip1, *ip2; unsigned bx, m, jx; Value *p1, *p2, *p3; #ifdef POLY_CH_DEBUG fprintf(stderr, "[Chernikova: Input]\nRay = "); Matrix_Print(stderr,0,Ray); fprintf(stderr, "\nConstraints = "); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nSat = "); SMPrint(Sat); #endif NbConstraints=Mat->NbRows; NbRay = Ray->NbRows; Dimension = Mat->NbColumns-1; /* Homogeneous Dimension */ sat_nbcolumns=Sat->NbColumns; RowSize1=(Dimension+1); RowSize2=sat_nbcolumns * sizeof(int); Temp=(int *)malloc(RowSize2); if(!Temp) { errormsg1("Chernikova", "outofmem", "out of memory space"); return 0; } CATCH(any_exception_error) { /* * In case of overflow, free the allocated memory! * Rethrow upwards the stack to forward the exception. */ free(Temp); RETHROW(); } TRY { jx = FirstConstraint/WSIZE; bx = MSB; bx >>= FirstConstraint%WSIZE; for (k=FirstConstraint; kp[i]+1; p2 = Mat->p[k]+1; p3 = Ray->p[i]; /* *p3 = *p1 * *p2 */ value_multiply(*p3,*p1,*p2); p1++; p2++; for (j=1; jp[index_non_zero][i]); } fprintf(stderr,"\n******\n"); for(i=0;ip[NbBid][i]); } fprintf(stderr,"\n*******\n"); #endif /* Compute the new lineality space */ for (i=0; ip[i][0])) Combine(Ray->p[i],Ray->p[NbBid],Ray->p[i],0,Dimension); /* Add the positive part of index_non_zero bidirectional ray to */ /* the set of unidirectional rays */ if (value_neg_p(Ray->p[NbBid][0])) { p1=Ray->p[NbBid]; for (j=0;jbound)) { i--; Vector_Copy(Ray->p[i],Ray->p[j],Dimension+1); SMVector_Copy(Sat->p[i],Sat->p[j],sat_nbcolumns); j++; } #ifdef POLY_CH_DEBUG fprintf(stderr, "i = %d\nj = %d \n", i, j); fprintf(stderr, "[Chernikova: F]\n" "sup_bound=%d\n" "equal_bound=%d\n" "bound=%d\n" "NbRay=%d\n" "Dimension = %d\n" "Ray = ",sup_bound,equal_bound,bound,NbRay, Dimension); #endif #ifdef POLY_CH_DEBUG Ray->NbRows=NbRay; fprintf(stderr, "[Chernikova: G]\nRay = "); Matrix_Print(stderr,0,Ray); #endif if (j==bound) NbRay=i; else NbRay=j; } NEXT(jx,bx); } Ray->NbRows=NbRay; Sat->NbRows=NbRay; } /* End of TRY */ UNCATCH(any_exception_error); free(Temp); #ifdef POLY_CH_DEBUG fprintf(stderr, "[Chernikova: Output]\nRay = "); Matrix_Print(stderr,0,Ray); fprintf(stderr, "\nConstraints = "); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nSat = "); SMPrint (Sat); #endif return 0; } /* Chernikova */ static int Gauss4(Value **p, int NbEq, int NbRows, int Dimension) { int i, j, k, pivot, Rank; int *column_index = NULL; Value gcd; value_init(gcd); column_index=(int *)malloc(Dimension * sizeof(int)); if(!column_index) { errormsg1("Gauss","outofmem","out of memory space"); value_clear(gcd); return 0; } Rank=0; CATCH(any_exception_error) { if (column_index) free(column_index); value_clear(gcd); RETHROW(); } TRY { for (j=1; j<=Dimension; j++) { /* for each column (except status) */ for (i=Rank; ip[i][j] != 0) */ if (value_notzero_p(p[i][j])) break; /* Find the first non zero element */ if (i!=NbEq) { /* If a non-zero element is found? */ if (i!=Rank) /* If it is found below the diagonal*/ Vector_Exchange(p[Rank]+1,p[i]+1,Dimension); /* Normalize the pivot row by dividing it by the gcd */ /* gcd = Vector_Gcd(p[Rank]+1,Dimension) */ Vector_Gcd(p[Rank]+1,Dimension,&gcd); if (value_cmp_si(gcd, 2) >= 0) Vector_AntiScale(p[Rank]+1, p[Rank]+1, gcd, Dimension); if (value_neg_p(p[Rank][j])) Vector_Oppose(p[Rank]+1, p[Rank]+1, Dimension); pivot=i; for (i=pivot+1; ip[i][j] != 0) */ if (value_notzero_p(p[i][j])) Combine(p[i],p[Rank],p[i],j,Dimension); } /* For each row with non-zero entry Mat->p[Rank], store the column */ /* number 'j' in 'column_index[Rank]'. This information will be */ /* useful in performing Gaussian elimination backward step. */ column_index[Rank]=j; Rank++; } } /* end of Gaussian elimination forward step */ /* Back Substitution -- normalize the system of equations */ for (k=Rank-1; k>=0; k--) { j = column_index[k]; /* Normalize the equations */ for (i=0; ip[i][j] != 0) */ if (value_notzero_p(p[i][j])) Combine(p[i],p[k],p[i],j,Dimension); } /* Normalize the inequalities */ for (i=NbEq;ip[i][j] != 0) */ if (value_notzero_p(p[i][j])) Combine(p[i],p[k],p[i],j,Dimension); } } } /* end of TRY */ UNCATCH(any_exception_error); free(column_index), column_index = NULL; value_clear(gcd); return Rank; } /* Gauss */ /* * Compute a minimal system of equations using Gausian elimination method. * 'Mat' is a matrix of constraints in which the first 'Nbeq' constraints * are equations. The dimension of the homogenous system is 'Dimension'. * The function returns the rank of the matrix 'Mat'. */ int Gauss(Matrix *Mat, int NbEq, int Dimension) { int Rank; #ifdef POLY_DEBUG fprintf(stderr, "[Gauss : Input]\nRay ="); Matrix_Print(stderr,0,Mat); #endif Rank = Gauss4(Mat->p, NbEq, Mat->NbRows, Dimension); #ifdef POLY_DEBUG fprintf(stderr, "[Gauss : Output]\nRay ="); Matrix_Print(stderr,0,Mat); #endif return Rank; } /* * Given 'Mat' - a matrix of equations and inequalities, 'Ray' - a matrix of * lines and rays, 'Sat' - the corresponding saturation matrix, and 'Filter' * - an array to mark (with 1) the non-redundant equalities and inequalities, * compute a polyhedron composed of 'Mat' as constraint matrix and 'Ray' as * ray matrix after reductions. This function is usually called as a follow * up to 'Chernikova' to remove redundant constraints or rays. * Note: (1) 'Chernikova' ensures that there are no redundant lines and rays. * (2) The same function can be used with constraint and ray matrix used interchangbly. */ static Polyhedron *Remove_Redundants(Matrix *Mat,Matrix *Ray,SatMatrix *Sat,unsigned *Filter) { int i, j, k; unsigned Dimension, sat_nbcolumns, NbRay, NbConstraints, RowSize2, *Trace = NULL, *bx = NULL, *jx = NULL, Dim_RaySpace, b; unsigned NbBid, NbUni, NbEq, NbIneq; unsigned NbBid2, NbUni2, NbEq2, NbIneq2; int Redundant; int aux, *temp2 = NULL; Polyhedron *Pol = NULL; Vector *temp1 = NULL; unsigned Status; Dimension = Mat->NbColumns-1; /* Homogeneous Dimension */ NbRay = Ray->NbRows; sat_nbcolumns = Sat->NbColumns; NbConstraints = Mat->NbRows; RowSize2=sat_nbcolumns * sizeof(int); temp1 = Vector_Alloc(Dimension+1); if (!temp1) { errormsg1("Remove_Redundants", "outofmem", "out of memory space"); return 0; } if (Filter) { temp2 = (int *)calloc(sat_nbcolumns, sizeof(int)); if (!temp2) goto oom; } /* Introduce indirections into saturation matrix 'Sat' to simplify */ /* processing with 'Sat' and allow easy exchanges of columns. */ bx = (unsigned *)malloc(NbConstraints * sizeof(unsigned)); if (!bx) goto oom; jx = (unsigned *)malloc(NbConstraints * sizeof(unsigned)); if (!jx) goto oom; CATCH(any_exception_error) { Vector_Free(temp1); if (temp2) free(temp2); if (bx) free(bx); if (jx) free(jx); if (Trace) free(Trace); if (Pol) Polyhedron_Free(Pol); RETHROW(); } TRY { /* For each constraint 'j' following mapping is defined to facilitate */ /* data access from saturation matrix 'Sat' :- */ /* (1) jx[j] -> floor[j/(8*sizeof(int))] */ /* (2) bx[j] -> bin(00..10..0) where position of 1 = j%(8*sizeof(int)) */ i = 0; b = MSB; for (j=0; jp[i][0] = 0 */ value_set_si(Ray->p[i][0],0); /* If ray(i) is a vertex of the Inhomogenous system */ if (value_notzero_p(Ray->p[i][Dimension])) aux++; } /* If no vertices, return an empty polyhedron. */ if (!aux) goto empty; #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Init]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRays ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(1): Compute status counts for both rays and inequalities. For each * constraint, count the number of vertices/rays saturated by that * constraint, and put the result in the status words. At the same time, * for each vertex/ray, count the number of constraints saturated by it. * Delete any positivity constraints, but give rays credit in their status * counts for saturating the positivity constraint. */ NbEq=0; #ifdef POLY_RR_DEBUG fprintf (stderr, " j = "); #endif for (j=0; jp[j][0])) temp2[jx[j]] |= bx[j]; /* Reset the status element of each constraint to zero */ value_set_si(Mat->p[j][0],0); /* Identify and remove the positivity constraint 1>=0 */ i = First_Non_Zero(Mat->p[j]+1, Dimension-1); #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : IntoStep1]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf (stderr, " j = %i \n", j); #endif /* Check if constraint(j) is a positivity constraint, 1 >= 0, or if it */ /* is 1==0. If constraint(j) saturates all the rays of the matrix 'Ray'*/ /* then it is an equality. in this case, return an empty polyhedron. */ if (i == -1) { for (i=0; ip[i][jx[j]]&bx[j])) { /* Mat->p[j][0]++ */ value_increment(Mat->p[j][0],Mat->p[j][0]); } /* if ((Mat->p[j][0] == NbRay) && : it is an equality (Mat->p[j][Dimension] != 0)) : and its not 0=0 */ if ((value_cmp_si(Mat->p[j][0], NbRay) == 0) && (value_notzero_p(Mat->p[j][Dimension]))) goto empty; /* Delete the positivity constraint */ NbConstraints--; if (j==NbConstraints) continue; Vector_Exchange(Mat->p[j], Mat->p[NbConstraints], temp1->Size); exchange(jx[j], jx[NbConstraints], aux); exchange(bx[j], bx[NbConstraints], aux); j--; continue; } /* Count the number of vertices/rays saturated by each constraint. At */ /* the same time, count the number of constraints saturated by each ray*/ for (i=0; ip[i][jx[j]]&bx[j])) { /* Mat->p[j][0]++ */ value_increment(Mat->p[j][0],Mat->p[j][0]); /* Ray->p[i][0]++ */ value_increment (Ray->p[i][0],Ray->p[i][0]); } /* if (Mat->p[j][0]==NbRay) then increment the number of eq. count */ if (value_cmp_si(Mat->p[j][0], NbRay) == 0) NbEq++; /* all vertices/rays are saturated */ } Mat->NbRows = NbConstraints; NbBid=0; for (i=0; ip[i][Dimension])) /* Ray->p[i][0]++ */ value_increment(Ray->p[i][0],Ray->p[i][0]); /* If ray(i) saturates all the constraints including positivity */ /* constraint then it is a bi-directional ray or line. Increment */ /* 'NbBid' by one. */ /* if (Ray->p[i][0]==NbConstraints+1) */ if (value_cmp_si(Ray->p[i][0], NbConstraints+1) == 0) NbBid++; } #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step1]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(2): Sort equalities to the top of constraint matrix 'Mat'. Detect * implicit equations such as y>=3; y<=3. Keep Inequalities in same * relative order. (Note: Equalities are constraints which saturate all of * the rays) */ for (i=0; ip[i][0], NbRay) != 0) { /* Skip over inequalities and find an equality */ for (k=i+1; value_cmp_si(Mat->p[k][0], NbRay) != 0 && k < NbConstraints; k++) ; if (k==NbConstraints) /* If none found then error */ break; /* Slide inequalities down the array 'Mat' and move equality up to */ /* position 'i'. */ Vector_Copy(Mat->p[k], temp1->p, temp1->Size); aux = jx[k]; j = bx[k]; for (;k>i;k--) { Vector_Copy(Mat->p[k-1], Mat->p[k], temp1->Size); jx[k] = jx[k-1]; bx[k] = bx[k-1]; } Vector_Copy(temp1->p, Mat->p[i], temp1->Size); jx[i] = aux; bx[i] = j; } } /* for SIMPLIFY */ if (Filter) { Value mone; value_init(mone); value_set_si(mone, -1); /* Normalize equalities to have lexpositive coefficients to * be able to detect identical equalities. */ for (i = 0; i < NbEq; i++) { int pos = First_Non_Zero(Mat->p[i]+1, Dimension); if (pos == -1) continue; if (value_neg_p(Mat->p[i][1+pos])) Vector_Scale(Mat->p[i]+1, Mat->p[i]+1, mone, Dimension); } value_clear(mone); for (i=0; i=3 and y<=3 */ Redundant = 0; for (j=i+1; jp[i]+1, Mat->p[j]+1, Dimension)) { Redundant=1; break; } } /* Set 'Filter' entry to 1 corresponding to the irredundant equality*/ if (!Redundant) Filter[jx[i]] |= bx[i]; /* set flag */ } } #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step2]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(3): Perform Gaussian elimiation on the list of equalities. Obtain * a minimal basis by solving for as many variables as possible. Use this * solution to reduce the inequalities by eliminating as many variables as * possible. Set NbEq2 to the rank of the system of equalities. */ NbEq2 = Gauss(Mat,NbEq,Dimension); /* If number of equalities is not less then the homogenous dimension, */ /* return an empty polyhedron. */ if (NbEq2 >= Dimension) goto empty; #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step3]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(4): Sort lines to the top of ray matrix 'Ray', leaving rays * afterwards. Detect implicit lines such as ray(1,2) and ray(-1,-2). * (Note: Lines are rays which saturate all of the constraints including * the positivity constraint 1>=0. */ for (i=0, k=NbRay; ii; i++) { /* If ray(i) doesn't saturate some constraint then it is not a line */ if (value_cmp_si(Ray->p[i][0], NbConstraints+1) != 0) { /* Skip over rays and vertices and find a line (bi-directional rays) */ while (--k > i && value_cmp_si(Ray->p[k][0], NbConstraints+1) != 0) ; /* Exchange positions of ray(i) and line(k), thus sorting lines to */ /* the top of matrix 'Ray'. */ Vector_Exchange(Ray->p[i], Ray->p[k], temp1->Size); bexchange(Sat->p[i], Sat->p[k], RowSize2); } } #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step4]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(5): Perform Gaussian elimination on the lineality space to obtain * a minimal basis of lines. Use this basis to reduce the representation * of the uniderectional rays. Set 'NbBid2' to the rank of the system of * lines. */ NbBid2 = Gauss(Ray, NbBid, Dimension); #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : After Gauss]\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* If number of lines is not less then the homogenous dimension, return */ /* an empty polyhedron. */ if (NbBid2>=Dimension) { errormsg1("RemoveRedundants", "rmrdt", "dimension error"); goto empty; } /* Compute dimension of non-homogenous ray space */ Dim_RaySpace = Dimension-1-NbEq2-NbBid2; #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step5]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(6): Do a first pass filter of inequalities and equality identifi- * cation. New positivity constraints may have been created by step(3). * Check for and eliminate them. Count the irredundant inequalities and * store count in 'NbIneq'. */ NbIneq=0; for (j=0; j=0 */ i = First_Non_Zero(Mat->p[j]+1, Dimension-1); /* Check if constraint(j) is a positivity constraint, 1>= 0, or if it */ /* is 1==0. */ if (i == -1) { /* if ((Mat->p[j][0]==NbRay) && : it is an equality (Mat->p[j][Dimension]!=0)) : and its not 0=0 */ if ((value_cmp_si(Mat->p[j][0], NbRay) == 0) && (value_notzero_p(Mat->p[j][Dimension]))) goto empty; /* Set the positivity constraint redundant by setting status element */ /* equal to 2. */ value_set_si(Mat->p[j][0],2); continue; } Status = VALUE_TO_INT(Mat->p[j][0]); if (Status == 0) value_set_si(Mat->p[j][0], 2); /* constraint is redundant */ else if (Status < Dim_RaySpace) value_set_si(Mat->p[j][0], 2); /* constraint is redundant */ else if (Status == NbRay) value_set_si(Mat->p[j][0], 0); /* constraint is an equality */ else { NbIneq++; /* constraint is an irredundant inequality */ value_set_si(Mat->p[j][0], 1); /* inequality */ } } #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step6]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(7): Do a first pass filter of rays and identification of lines. * Count the irredundant Rays and store count in 'NbUni'. */ NbUni=0; for (j=0; jp[j][0]); if (Status < Dim_RaySpace) value_set_si(Ray->p[j][0], 2); /* ray is redundant */ else if (Status == NbConstraints+1) value_set_si(Ray->p[j][0], 0); /* ray is a line */ else { NbUni++; /* an irredundant unidirectional ray. */ value_set_si(Ray->p[j][0], 1); /* ray */ } } /* * STEP(8): Create the polyhedron (using approximate sizes). * Number of constraints = NbIneq + NbEq2 + 1 * Number of rays = NbUni + NbBid2 * Partially fill the polyhedron structure with the lines computed in step * 3 and the equalities computed in step 5. */ Pol = Polyhedron_Alloc(Dimension-1, NbIneq+NbEq2+1, NbUni+NbBid2); if (!Pol) { UNCATCH(any_exception_error); goto oom; } Pol->NbBid = NbBid2; Pol->NbEq = NbEq2; /* Partially fill the polyhedron structure */ if (NbBid2) Vector_Copy(Ray->p[0], Pol->Ray[0], (Dimension+1)*NbBid2); if (NbEq2) Vector_Copy(Mat->p[0], Pol->Constraint[0], (Dimension+1)*NbEq2); #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step7]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * STEP(9): Final Pass filter of inequalities and detection of redundant * inequalities. Redundant inequalities include: * (1) Inequalities which are always true, such as 1>=0, * (2) Redundant inequalities such as y>=4 given y>=3, or x>=1 given x=2. * (3) Redundant inequalities such as x+y>=5 given x>=3 and y>=2. * Every 'good' inequality must saturate at least 'Dimension' rays and be * unique. */ /* 'Trace' is a (1 X sat_nbcolumns) row matrix to hold the union of all */ /* rows (corresponding to irredundant rays) of saturation matrix 'Sat' */ /* which saturate some constraint 'j'. See figure below:- */ Trace=(unsigned *)malloc(sat_nbcolumns * sizeof(unsigned)); if(!Trace) { UNCATCH(any_exception_error); goto oom; } /* NbEq NbConstraints |-----------> ___________j____ | | | | Mat | | |___________|___| | NbRay ^ ________ ____________|____ | |-------|--------|-----------0---|t1 |i|-------|--------|-----------0---|t2 | | Ray | | Sat | NbBid - |-------|--------|-----------0---|tk |_______| |_______________| | | -OR- (of rows t1,t2,...,tk) ________|___|____ |_____Trace_0___| */ NbIneq2 = 0; for (j=NbEq; jp[j][0]==1) : non-redundant inequality */ if (value_one_p (Mat->p[j][0])) { for (k=0; kp[i][0]==1) */ if (value_one_p(Ray->p[i][0])) { if (!(Sat->p[i][jx[j]]&bx[j])) for (k=0; kp[i][k]; } /* Only constraint(j) should saturate this set of vertices/rays. */ /* If another non-redundant constraint also saturates this set, */ /* then constraint(j) is redundant */ Redundant=0; for (i=NbEq; ip[i][0] ==1) && (i!=j) && !(Trace[jx[i]] & bx[i]) ) */ if (value_one_p(Mat->p[i][0]) && (i!=j) && !(Trace[jx[i]] & bx[i])) { Redundant=1; break; } } if (Redundant) { value_set_si(Mat->p[j][0],2); } else { Vector_Copy(Mat->p[j], Pol->Constraint[NbEq2+NbIneq2], Dimension+1); if (Filter) Filter[jx[j]] |= bx[j]; /* for SIMPLIFY */ NbIneq2++; } } } free(Trace), Trace = NULL; #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step8]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif /* * Step(10): Final pass filter of rays and detection of redundant rays. * The final list of rays is written to polyhedron. */ /* Trace is a (NbRay x 1) column matrix to hold the union of all columns */ /* (corresponding to irredundant inequalities) of saturation matrix 'Sat'*/ /* which saturate some ray 'i'. See figure below:- */ Trace=(unsigned *)malloc(NbRay * sizeof(unsigned)); if(!Trace) { UNCATCH(any_exception_error); goto oom; } /* NbEq NbConstraints |----------> ___________j_____ | | | | | | Mat | | |______|_|___|__| | | | NbRay ^ _________ _______|_|___|__ ___ | | | | | | | | |T| | | Ray | | Sat| | | | |r| | | | | | | | | |a| Trace = Union[col(t1,t2,..,tk)] |i|-------|------>i 0 0 0 | |c| NbBid - | | | | | | | |e| |_______| |______|_|___|__| |_| t1 t2 tk */ NbUni2 = 0; /* Let 'aux' be the number of rays not vertices */ aux = 0; for (i=NbBid; ip[i][0]==1) */ if (value_one_p (Ray->p[i][0])) { /* if (Ray->p[i][Dimension]!=0) : vertex */ if (value_notzero_p (Ray->p[i][Dimension])) for (k=NbBid; kp[k][Dimension]!=0); */ Trace[k] = (value_notzero_p (Ray->p[k][Dimension])); /* Compute Trace: the union of all columns of Sat where ray(i) is */ /* saturated. */ for (j=NbEq; jp[j][0]==1) : inequality */ if (value_one_p (Mat->p[j][0])) { if (!(Sat->p[i][jx[j]]&bx[j])) for (k=NbBid; kp[k][jx[j]]&bx[j]; } /* If ray i does not saturate any inequalities (other than the */ /* the positivity constraint, then it is the case that there is */ /* only one inequality and that ray is its orthogonal */ /* only ray(i) should saturate this set of inequalities. If */ /* another non-redundant ray also saturates this set, then ray(i)*/ /* is redundant */ Redundant = 0; for (j=NbBid; jp[j][0]==1) && (i!=j) && !Trace[j] ) */ if (value_one_p (Ray->p[j][0]) && (i!=j) && !Trace[j]) { Redundant=1; break; } } if (Redundant) value_set_si(Ray->p[i][0],2); else { Vector_Copy(Ray->p[i], Pol->Ray[NbBid2+NbUni2], Dimension+1); NbUni2++; /* Increment number of uni-directional rays */ /* if (Ray->p[i][Dimension]==0) */ if (value_zero_p (Ray->p[i][Dimension])) aux++; /* Increment number of rays which are not vertices */ } } } /* Include the positivity constraint */ if (aux>=Dim_RaySpace) { Vector_Set(Pol->Constraint[NbEq2+NbIneq2],0,Dimension+1); value_set_si(Pol->Constraint[NbEq2+NbIneq2][0],1); value_set_si(Pol->Constraint[NbEq2+NbIneq2][Dimension],1); NbIneq2++; } } /* end of TRY */ UNCATCH(any_exception_error); #ifdef POLY_RR_DEBUG fprintf(stderr, "[Remove_redundants : Step9]\nConstraints ="); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nRay ="); Matrix_Print(stderr,0,Ray); #endif free(Trace); free(bx); free(jx); if (temp2) free(temp2); Pol->NbConstraints = NbEq2 + NbIneq2; Pol->NbRays = NbBid2 + NbUni2; Vector_Free(temp1); F_SET(Pol, POL_VALID | POL_INEQUALITIES | POL_FACETS | POL_POINTS | POL_VERTICES); return Pol; oom: errormsg1("Remove_Redundants", "outofmem", "out of memory space"); Vector_Free(temp1); if (temp2) free(temp2); if (bx) free(bx); if (jx) free(jx); return NULL; empty: Vector_Free(temp1); if (temp2) free(temp2); if (bx) free(bx); if (jx) free(jx); UNCATCH(any_exception_error); return Empty_Polyhedron(Dimension-1); } /* Remove_Redundants */ /* * Allocate memory space for polyhedron. */ Polyhedron* Polyhedron_Alloc(unsigned Dimension,unsigned NbConstraints,unsigned NbRays) { Polyhedron *Pol; unsigned NbRows,NbColumns; int i,j; Value *p, **q; Pol=(Polyhedron *)malloc(sizeof(Polyhedron)); if(!Pol) { errormsg1("Polyhedron_Alloc", "outofmem", "out of memory space"); return 0; } Pol->next = (Polyhedron *)0; Pol->Dimension = Dimension; Pol->NbConstraints = NbConstraints; Pol->NbRays = NbRays; Pol->NbEq = 0; Pol->NbBid = 0; Pol->flags = 0; NbRows = NbConstraints + NbRays; NbColumns = Dimension + 2; q = (Value **)malloc(NbRows * sizeof(Value *)); if(!q) { errormsg1("Polyhedron_Alloc", "outofmem", "out of memory space"); return 0; } p = value_alloc(NbRows*NbColumns, &Pol->p_Init_size); if(!p) { free(q); errormsg1("Polyhedron_Alloc", "outofmem", "out of memory space"); return 0; } Pol->Constraint = q; Pol->Ray = q + NbConstraints; Pol->p_Init = p; for (i=0;ip_Init, Pol->p_Init_size); free(Pol->Constraint); free(Pol); return; } /* Polyhedron_Free */ /* * Free the memory space occupied by the domain. */ void Domain_Free(Polyhedron *Pol) { Polyhedron *Next; for (; Pol; Pol = Next) { Next = Pol->next; Polyhedron_Free(Pol); } return; } /* Domain_Free */ /* * Print the contents of a polyhedron. */ void Polyhedron_Print(FILE *Dst, const char *Format, const Polyhedron *Pol) { unsigned Dimension, NbConstraints, NbRays; int i, j; Value *p; if (!Pol) { fprintf(Dst, "\n"); return; } Dimension = Pol->Dimension + 2; /* Homogenous Dimension + status */ NbConstraints = Pol->NbConstraints; NbRays = Pol->NbRays; fprintf(Dst, "POLYHEDRON Dimension:%d\n", Pol->Dimension); fprintf(Dst," Constraints:%d Equations:%d Rays:%d Lines:%d\n", Pol->NbConstraints, Pol->NbEq, Pol->NbRays, Pol->NbBid); fprintf(Dst,"Constraints %d %d\n", NbConstraints, Dimension); for (i=0;iConstraint[i]; /* if (*p) */ if (value_notzero_p (*p)) fprintf(Dst,"Inequality: ["); else fprintf(Dst,"Equality: ["); p++; for (j=1;jRay[i]; /* if (*p) */ if (value_notzero_p (*p)) { p++; /* if ( p[Dimension-2] ) */ if (value_notzero_p (p[Dimension-2])) fprintf(Dst, "Vertex: ["); else fprintf(Dst, "Ray: ["); } else { p++; fprintf(Dst, "Line: ["); } for (j=1; j < Dimension-1; j++) { value_print(Dst,Format,*p++); } /* if (*p) */ if (value_notzero_p (*p)) { fprintf( Dst, " ]/" ); value_print(Dst,VALUE_FMT,*p); fprintf( Dst, "\n" ); } else fprintf(Dst, " ]\n"); } if (Pol->next) { fprintf(Dst, "UNION "); Polyhedron_Print(Dst,Format,Pol->next); } } /* Polyhedron_Print */ /* * Print the contents of a polyhedron 'Pol' (used for debugging purpose). */ void PolyPrint (Polyhedron *Pol) { Polyhedron_Print(stderr,"%4d",Pol); } /* PolyPrint */ /* * Create and return an empty polyhedron of non-homogenous dimension * 'Dimension'. An empty polyhedron is characterized by :- * (a) The dimension of the ray-space is -1. * (b) There is an over-constrained system of equations given by: * x=0, y=0, ...... z=0, 1=0 */ Polyhedron *Empty_Polyhedron(unsigned Dimension) { Polyhedron *Pol; int i; Pol = Polyhedron_Alloc(Dimension, Dimension+1, 0); if (!Pol) { errormsg1("Empty_Polyhedron", "outofmem", "out of memory space"); return 0; } Vector_Set(Pol->Constraint[0],0,(Dimension+1)*(Dimension+2)); for (i=0; i<=Dimension; i++) { /* Pol->Constraint[i][i+1]=1 */ value_set_si(Pol->Constraint[i][i+1],1); } Pol->NbEq = Dimension+1; Pol->NbBid = 0; F_SET(Pol, POL_VALID | POL_INEQUALITIES | POL_FACETS | POL_POINTS | POL_VERTICES); return Pol; } /* Empty_Polyhedron */ /* * Create and return a universe polyhedron of non-homogenous dimension * 'Dimension'. A universe polyhedron is characterized by :- * (a) The dimension of rayspace is zero. * (b) The dimension of lineality space is the dimension of the polyhedron. * (c) There is only one constraint (positivity constraint) in the constraint * set given by : 1 >= 0. * (d) The bi-directional ray set is the canonical set of vectors. * (e) The only vertex is the origin (0,0,0,....0). */ Polyhedron *Universe_Polyhedron(unsigned Dimension) { Polyhedron *Pol; int i; Pol = Polyhedron_Alloc(Dimension,1,Dimension+1); if (!Pol) { errormsg1("Universe_Polyhedron", "outofmem", "out of memory space"); return 0; } Vector_Set(Pol->Constraint[0],0,(Dimension+2)); /* Pol->Constraint[0][0] = 1 */ value_set_si(Pol->Constraint[0][0],1); /* Pol->Constraint[0][Dimension+1] = 1 */ value_set_si(Pol->Constraint[0][Dimension+1],1); Vector_Set(Pol->Ray[0],0,(Dimension+1)*(Dimension+2)); for (i=0;i<=Dimension;i++) { /* Pol->Ray[i][i+1]=1 */ value_set_si(Pol->Ray[i][i+1],1); } /* Pol->Ray[Dimension][0] = 1 : vertex status */ value_set_si(Pol->Ray[Dimension][0],1); Pol->NbEq = 0; Pol->NbBid = Dimension; F_SET(Pol, POL_VALID | POL_INEQUALITIES | POL_FACETS | POL_POINTS | POL_VERTICES); return Pol; } /* Universe_Polyhedron */ /* Sort constraints and remove trivially redundant constraints. */ static void SortConstraints(Matrix *Constraints, unsigned NbEq) { int i, j, k; for (i = NbEq; i < Constraints->NbRows; ++i) { int max = i; for (k = i+1; k < Constraints->NbRows; ++k) { for (j = 1; j < Constraints->NbColumns-1; ++j) { if (value_eq(Constraints->p[k][j], Constraints->p[max][j])) continue; if (value_abs_lt(Constraints->p[k][j], Constraints->p[max][j])) break; if (value_abs_eq(Constraints->p[k][j], Constraints->p[max][j]) && value_pos_p(Constraints->p[max][j])) break; max = k; break; } /* equal, except for possibly the constant * => remove constraint with biggest constant */ if (j == Constraints->NbColumns-1) { if (value_lt(Constraints->p[k][j], Constraints->p[max][j])) Vector_Exchange(Constraints->p[k], Constraints->p[max], Constraints->NbColumns); Constraints->NbRows--; if (k < Constraints->NbRows) Vector_Exchange(Constraints->p[k], Constraints->p[Constraints->NbRows], Constraints->NbColumns); k--; } } if (max != i) Vector_Exchange(Constraints->p[max], Constraints->p[i], Constraints->NbColumns); } } /* Search for trivial implicit equalities, assuming the constraints have been sorted. */ static int ImplicitEqualities(Matrix *Constraints, unsigned NbEq) { int row, nrow, k; int found = 0; Value tmp; for (row = NbEq; row < Constraints->NbRows; ++row) { int d = First_Non_Zero(Constraints->p[row]+1, Constraints->NbColumns-2); if (d == -1) { /* -n >= 0 */ if (value_neg_p(Constraints->p[row][Constraints->NbColumns-1])) { value_set_si(Constraints->p[row][0], 0); found = 1; } break; } if (value_neg_p(Constraints->p[row][1+d])) continue; for (nrow = row+1; nrow < Constraints->NbRows; ++nrow) { if (value_zero_p(Constraints->p[nrow][1+d])) break; if (value_pos_p(Constraints->p[nrow][1+d])) continue; for (k = d; k < Constraints->NbColumns-1; ++k) { if (value_abs_ne(Constraints->p[row][1+k], Constraints->p[nrow][1+k])) break; if (value_zero_p(Constraints->p[row][1+k])) continue; if (value_eq(Constraints->p[row][1+k], Constraints->p[nrow][1+k])) break; } if (k == Constraints->NbColumns-1) { value_set_si(Constraints->p[row][0], 0); value_set_si(Constraints->p[nrow][0], 0); found = 1; break; } if (k != Constraints->NbColumns-2) continue; /* if the constants are such that * the sum c1+c2 is negative then the constraints conflict */ value_init(tmp); value_addto(tmp, Constraints->p[row][1+k], Constraints->p[nrow][1+k]); if (value_sign(tmp) < 0) { Vector_Set(Constraints->p[row], 0, Constraints->NbColumns-1); Vector_Set(Constraints->p[nrow], 0, Constraints->NbColumns-1); value_set_si(Constraints->p[row][1+k], 1); value_set_si(Constraints->p[nrow][1+k], 1); found = 1; } value_clear(tmp); if (found) break; } } return found; } /** Given a matrix of constraints ('Constraints'), construct and return a polyhedron. @param Constraints Constraints (may be modified!) @param NbMaxRays Estimated number of rays in the ray matrix of the polyhedron. @return newly allocated Polyhedron */ Polyhedron *Constraints2Polyhedron(Matrix *Constraints,unsigned NbMaxRays) { Polyhedron *Pol = NULL; Matrix *Ray = NULL; SatMatrix *Sat = NULL; unsigned Dimension, nbcolumns; int i; Dimension = Constraints->NbColumns - 1; /* Homogeneous Dimension */ if (Dimension < 1) { errormsg1("Constraints2Polyhedron","invalidpoly","invalid polyhedron dimension"); return 0; } /* If there is no constraint in the constraint matrix, return universe */ /* polyhderon. */ if (Constraints->NbRows==0) { Pol = Universe_Polyhedron(Dimension-1); return Pol; } if (POL_ISSET(NbMaxRays, POL_NO_DUAL)) { unsigned NbEq; unsigned Rank; Value tmp; if (POL_ISSET(NbMaxRays, POL_INTEGER)) value_init(tmp); do { NbEq = 0; /* Move equalities up */ for (i = 0; i < Constraints->NbRows; ++i) if (value_zero_p(Constraints->p[i][0])) { if (POL_ISSET(NbMaxRays, POL_INTEGER) && ConstraintSimplify(Constraints->p[i], Constraints->p[i], Dimension+1, &tmp)) { value_clear(tmp); return Empty_Polyhedron(Dimension-1); } /* detect 1 == 0, possibly created by ImplicitEqualities */ if (First_Non_Zero(Constraints->p[i]+1, Dimension-1) == -1 && value_notzero_p(Constraints->p[i][Dimension])) { if (POL_ISSET(NbMaxRays, POL_INTEGER)) value_clear(tmp); return Empty_Polyhedron(Dimension-1); } if (i != NbEq) ExchangeRows(Constraints, i, NbEq); ++NbEq; } Rank = Gauss(Constraints, NbEq, Dimension); if (POL_ISSET(NbMaxRays, POL_INTEGER)) for (i = NbEq; i < Constraints->NbRows; ++i) ConstraintSimplify(Constraints->p[i], Constraints->p[i], Dimension+1, &tmp); SortConstraints(Constraints, NbEq); } while (ImplicitEqualities(Constraints, NbEq)); if (POL_ISSET(NbMaxRays, POL_INTEGER)) value_clear(tmp); Pol = Polyhedron_Alloc(Dimension-1, Constraints->NbRows - (NbEq-Rank), 0); if (Rank > 0) Vector_Copy(Constraints->p[0], Pol->Constraint[0], Rank * Constraints->NbColumns); if (Constraints->NbRows > NbEq) Vector_Copy(Constraints->p[NbEq], Pol->Constraint[Rank], (Constraints->NbRows - NbEq) * Constraints->NbColumns); Pol->NbEq = Rank; /* Make sure nobody accesses the rays by accident */ Pol->Ray = 0; F_SET(Pol, POL_VALID | POL_INEQUALITIES); return Pol; } if (Dimension > NbMaxRays) NbMaxRays = Dimension; /* * Rather than adding a 'positivity constraint', it is better to * initialize the lineality space with line in each of the index * dimensions, but no line in the lambda dimension. Then initialize * the ray space with an origin at 0. This is what you get anyway, * after the positivity constraint has been processed by Chernikova * function. */ /* Allocate and initialize the Ray Space */ Ray = Matrix_Alloc(NbMaxRays, Dimension+1); if(!Ray) { errormsg1("Constraints2Polyhedron","outofmem","out of memory space"); return 0; } Vector_Set(Ray->p_Init,0, NbMaxRays * (Dimension+1)); for (i=0; ip[i][i+1] = 1 */ value_set_si(Ray->p[i][i+1],1); } /* Ray->p[Dimension-1][0] = 1 : mark for ray */ value_set_si(Ray->p[Dimension-1][0],1); Ray->NbRows = Dimension; /* Initialize the Sat Matrix */ nbcolumns = (Constraints->NbRows - 1)/(sizeof(int)*8) + 1; Sat = SMAlloc(NbMaxRays, nbcolumns); SMVector_Init(Sat->p_init,Dimension*nbcolumns); Sat->NbRows = Dimension; CATCH(any_exception_error) { /* In case of overflow, free the allocated memory and forward. */ if (Sat) SMFree(&Sat); if (Ray) Matrix_Free(Ray); if (Pol) Polyhedron_Free(Pol); RETHROW(); } TRY { /* Create ray matrix 'Ray' from constraint matrix 'Constraints' */ Chernikova(Constraints,Ray,Sat,Dimension-1,NbMaxRays,0,0); #ifdef POLY_DEBUG fprintf(stderr, "[constraints2polyhedron]\nConstraints = "); Matrix_Print(stderr,0,Constraints); fprintf(stderr, "\nRay = "); Matrix_Print(stderr,0,Ray); fprintf(stderr, "\nSat = "); SMPrint(Sat); #endif /* Remove the redundant constraints and create the polyhedron */ Pol = Remove_Redundants(Constraints,Ray,Sat,0); } /* end of TRY */ UNCATCH(any_exception_error); #ifdef POLY_DEBUG fprintf(stderr, "\nPol = "); Polyhedron_Print(stderr,"%4d",Pol); #endif SMFree(&Sat), Sat = NULL; Matrix_Free(Ray), Ray = NULL; return Pol; } /* Constraints2Polyhedron */ #undef POLY_DEBUG /* * Given a polyhedron 'Pol', return a matrix of constraints. */ Matrix *Polyhedron2Constraints(Polyhedron *Pol) { Matrix *Mat; unsigned NbConstraints,Dimension; POL_ENSURE_INEQUALITIES(Pol); NbConstraints = Pol->NbConstraints; Dimension = Pol->Dimension+2; Mat = Matrix_Alloc(NbConstraints,Dimension); if(!Mat) { errormsg1("Polyhedron2Constraints", "outofmem", "out of memory space"); return 0; } Vector_Copy(Pol->Constraint[0],Mat->p_Init,NbConstraints * Dimension); return Mat; } /* Polyhedron2Constraints */ /** Given a matrix of rays 'Ray', create and return a polyhedron. @param Ray Rays (may be modified!) @param NbMaxConstrs Estimated number of constraints in the polyhedron. @return newly allocated Polyhedron */ Polyhedron *Rays2Polyhedron(Matrix *Ray,unsigned NbMaxConstrs) { Polyhedron *Pol = NULL; Matrix *Mat = NULL; SatMatrix *Sat = NULL, *SatTranspose = NULL; unsigned Dimension, nbcolumns; int i; Dimension = Ray->NbColumns-1; /* Homogeneous Dimension */ Sat = NULL; SatTranspose = NULL; Mat = NULL; if (Ray->NbRows==0) { /* If there is no ray in the matrix 'Ray', return an empty polyhedron */ Pol = Empty_Polyhedron(Dimension-1); return(Pol); } /* Ignore for now */ if (POL_ISSET(NbMaxConstrs, POL_NO_DUAL)) NbMaxConstrs = 0; if (Dimension > NbMaxConstrs) NbMaxConstrs = Dimension; /* Allocate space for constraint matrix 'Mat' */ Mat = Matrix_Alloc(NbMaxConstrs,Dimension+1); if(!Mat) { errormsg1("Rays2Polyhedron","outofmem","out of memory space"); return 0; } /* Initialize the constraint matrix 'Mat' */ Vector_Set(Mat->p_Init,0,NbMaxConstrs * (Dimension+1)); for (i=0; ip[i][i+1]=1 */ value_set_si(Mat->p[i][i+1],1); } /* Allocate and assign the saturation matrix. Remember we are using a */ /* transposed saturation matrix referenced by (constraint,ray) pair. */ Mat->NbRows = Dimension; nbcolumns = (Ray->NbRows -1)/(sizeof(int)*8) + 1; SatTranspose = SMAlloc(NbMaxConstrs,nbcolumns); SMVector_Init(SatTranspose->p[0],Dimension * nbcolumns); SatTranspose->NbRows = Dimension; #ifdef POLY_DEBUG fprintf(stderr, "[ray2polyhedron: Before]\nRay = "); Matrix_Print(stderr,0,Ray); fprintf(stderr, "\nConstraints = "); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nSatTranspose = "); SMPrint (SatTranspose); #endif CATCH(any_exception_error) { /* In case of overflow, free the allocated memory before forwarding * the exception. */ if (SatTranspose) SMFree(&SatTranspose); if (Sat) SMFree(&Sat); if (Mat) Matrix_Free(Mat); if (Pol) Polyhedron_Free(Pol); RETHROW(); } TRY { /* Create constraint matrix 'Mat' from ray matrix 'Ray' */ Chernikova(Ray,Mat,SatTranspose,Dimension,NbMaxConstrs,0,1); #ifdef POLY_DEBUG fprintf(stderr, "[ray2polyhedron: After]\nRay = "); Matrix_Print(stderr,0,Ray); fprintf(stderr, "\nConstraints = "); Matrix_Print(stderr,0,Mat); fprintf(stderr, "\nSatTranspose = "); SMPrint (SatTranspose); #endif /* Transform the saturation matrix 'SatTranspose' in the standard */ /* format, that is, ray X constraint format. */ Sat = TransformSat(Mat,Ray,SatTranspose); #ifdef POLY_DEBUG fprintf(stderr, "\nSat ="); SMPrint(Sat); #endif SMFree(&SatTranspose), SatTranspose = NULL; /* Remove redundant rays from the ray matrix 'Ray' */ Pol = Remove_Redundants(Mat,Ray,Sat,0); } /* of TRY */ UNCATCH(any_exception_error); #ifdef POLY_DEBUG fprintf(stderr, "\nPol = "); Polyhedron_Print(stderr,"%4d",Pol); #endif SMFree(&Sat); Matrix_Free(Mat); return Pol; } /* Rays2Polyhedron */ /* * Compute the dual representation if P only contains one representation. * Currently only handles the case where only the equalities are known. */ void Polyhedron_Compute_Dual(Polyhedron *P) { if (!F_ISSET(P, POL_VALID)) return; if (F_ISSET(P, POL_FACETS | POL_VERTICES)) return; if (F_ISSET(P, POL_INEQUALITIES)) { Matrix M; Polyhedron tmp, *Q; /* Pretend P is a Matrix for a second */ M.NbRows = P->NbConstraints; M.NbColumns = P->Dimension+2; M.p_Init = P->p_Init; M.p = P->Constraint; Q = Constraints2Polyhedron(&M, 0); /* Switch contents of P and Q ... */ tmp = *Q; *Q = *P; *P = tmp; /* ... but keep the next pointer */ P->next = Q->next; Polyhedron_Free(Q); return; } /* other cases not handled yet */ assert(0); } /* * Build a saturation matrix from constraint matrix 'Mat' and ray matrix * 'Ray'. Only 'NbConstraints' constraint of matrix 'Mat' are considered * in creating the saturation matrix. 'NbMaxRays' is the maximum number * of rows (rays) allowed in the saturation matrix. * Vin100's stuff, for the polyparam vertices to work. */ static SatMatrix *BuildSat(Matrix *Mat,Matrix *Ray,unsigned NbConstraints,unsigned NbMaxRays) { SatMatrix *Sat = NULL; int i, j, k, jx; Value *p1, *p2, *p3; unsigned Dimension, NbRay, bx, nbcolumns; CATCH(any_exception_error) { if (Sat) SMFree(&Sat); RETHROW(); } TRY { NbRay = Ray->NbRows; Dimension = Mat->NbColumns-1; /* Homogeneous Dimension */ /* Build the Sat matrix */ nbcolumns = (Mat->NbRows - 1)/(sizeof(int)*8) + 1; Sat = SMAlloc(NbMaxRays,nbcolumns); Sat->NbRows = NbRay; SMVector_Init(Sat->p_init, nbcolumns * NbRay); jx=0; bx=MSB; for (k=0; kp[i]+1; p2 = Mat->p[k]+1; p3 = Ray->p[i]; value_set_si(*p3,0); for (j=0; jp[j][0])) Sat->p[j][jx]|=bx; } NEXT(jx, bx); } } /* end of TRY */ UNCATCH(any_exception_error); return Sat; } /* BuildSat */ /* * Add 'Nbconstraints' new constraints to polyhedron 'Pol'. Constraints are * pointed by 'Con' and the maximum allowed rays in the new polyhedron is * 'NbMaxRays'. */ Polyhedron *AddConstraints(Value *Con,unsigned NbConstraints,Polyhedron *Pol,unsigned NbMaxRays) { Polyhedron *NewPol = NULL; Matrix *Mat = NULL, *Ray = NULL; SatMatrix *Sat = NULL; unsigned NbRay, NbCon, Dimension; if (NbConstraints == 0) return Polyhedron_Copy(Pol); POL_ENSURE_INEQUALITIES(Pol); Dimension = Pol->Dimension + 2; /* Homogeneous Dimension + Status */ if (POL_ISSET(NbMaxRays, POL_NO_DUAL)) { NbCon = Pol->NbConstraints + NbConstraints; Mat = Matrix_Alloc(NbCon, Dimension); if (!Mat) { errormsg1("AddConstraints", "outofmem", "out of memory space"); return NULL; } Vector_Copy(Pol->Constraint[0], Mat->p[0], Pol->NbConstraints * Dimension); Vector_Copy(Con, Mat->p[Pol->NbConstraints], NbConstraints * Dimension); NewPol = Constraints2Polyhedron(Mat, NbMaxRays); Matrix_Free(Mat); return NewPol; } POL_ENSURE_VERTICES(Pol); CATCH(any_exception_error) { if (NewPol) Polyhedron_Free(NewPol); if (Mat) Matrix_Free(Mat); if (Ray) Matrix_Free(Ray); if (Sat) SMFree(&Sat); RETHROW(); } TRY { NbRay = Pol->NbRays; NbCon = Pol->NbConstraints + NbConstraints; if (NbRay > NbMaxRays) NbMaxRays = NbRay; Mat = Matrix_Alloc(NbCon, Dimension); if(!Mat) { errormsg1("AddConstraints", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Copy constraints of polyhedron 'Pol' to matrix 'Mat' */ Vector_Copy(Pol->Constraint[0], Mat->p[0], Pol->NbConstraints * Dimension); /* Add the new constraints pointed by 'Con' to matrix 'Mat' */ Vector_Copy(Con, Mat->p[Pol->NbConstraints], NbConstraints * Dimension); /* Allocate space for ray matrix 'Ray' */ Ray = Matrix_Alloc(NbMaxRays, Dimension); if(!Ray) { errormsg1("AddConstraints", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } Ray->NbRows = NbRay; /* Copy rays of polyhedron 'Pol' to matrix 'Ray' */ if (NbRay) Vector_Copy(Pol->Ray[0], Ray->p[0], NbRay * Dimension); /* Create the saturation matrix 'Sat' from constraint matrix 'Mat' and */ /* ray matrix 'Ray' . */ Sat = BuildSat(Mat, Ray, Pol->NbConstraints, NbMaxRays); /* Create the ray matrix 'Ray' from the constraint matrix 'Mat' */ Pol_status = Chernikova(Mat, Ray, Sat, Pol->NbBid, NbMaxRays, Pol->NbConstraints,0); /* Remove redundant constraints from matrix 'Mat' */ NewPol = Remove_Redundants(Mat, Ray, Sat, 0); } /* end of TRY */ UNCATCH(any_exception_error); SMFree(&Sat); Matrix_Free(Ray); Matrix_Free(Mat); return NewPol; } /* AddConstraints */ /* * Return 1 if 'Pol1' includes (covers) 'Pol2', 0 otherwise. * Polyhedron 'A' includes polyhedron 'B' if the rays of 'B' saturate * the equalities and verify the inequalities of 'A'. Both 'Pol1' and * 'Pol2' have same dimensions. */ int PolyhedronIncludes(Polyhedron *Pol1,Polyhedron *Pol2) { int Dimension = Pol1->Dimension + 1; /* Homogenous Dimension */ int i, j, k; Value *p1, *p2, p3; POL_ENSURE_FACETS(Pol1); POL_ENSURE_VERTICES(Pol1); POL_ENSURE_FACETS(Pol2); POL_ENSURE_VERTICES(Pol2); value_init(p3); for (k=0; kNbConstraints; k++) { for (i=0;iNbRays;i++) { /* Compute the dot product of ray(i) and constraint(k) and store in p3 */ p1 = Pol2->Ray[i]+1; p2 = Pol1->Constraint[k]+1; value_set_si(p3,0); for(j=0;j 0 and (constraint(k) is equality or ray(i) is a line)), return 0 */ if(value_neg_p(p3) || (value_notzero_p(p3) && (value_zero_p(Pol1->Constraint[k][0]) || (value_zero_p(Pol2->Ray[i][0])) ) )) { value_clear(p3); return 0; } } } value_clear(p3); return 1; } /* PolyhedronIncludes */ /* * Add Polyhedron 'Pol' to polhedral domain 'PolDomain'. If 'Pol' covers * some polyhedron in the domain 'PolDomain', it is removed from the list. * On the other hand if some polyhedron in the domain covers polyhedron * 'Pol' then 'Pol' is not included in the domain. */ Polyhedron *AddPolyToDomain(Polyhedron *Pol,Polyhedron *PolDomain) { Polyhedron *p, *pnext, *p_domain_end = (Polyhedron *) 0; int Redundant; if (!Pol) return PolDomain; if (!PolDomain) return Pol; POL_ENSURE_FACETS(Pol); POL_ENSURE_VERTICES(Pol); /* Check for emptiness of polyhedron 'Pol' */ if (emptyQ(Pol)) { Polyhedron_Free(Pol); return PolDomain; } POL_ENSURE_FACETS(PolDomain); POL_ENSURE_VERTICES(PolDomain); /* Check for emptiness of polyhedral domain 'PolDomain' */ if (emptyQ(PolDomain)) { Polyhedron_Free(PolDomain); return Pol; } /* Test 'Pol' against the domain 'PolDomain' */ Redundant = 0; for (p=PolDomain,PolDomain=(Polyhedron *)0; p; p=pnext) { /* If 'Pol' covers 'p' */ if (PolyhedronIncludes(Pol, p)) { /* free p */ pnext = p->next; Polyhedron_Free( p ); continue; } /* Add polyhedron p to the new domain list */ if (!PolDomain) PolDomain = p; else p_domain_end->next = p; p_domain_end = p; /* If p covers Pol */ if (PolyhedronIncludes(p,Pol)) { Redundant = 1; break; } pnext = p->next; } if (!Redundant) { /* The whole list has been checked. Add new polyhedron 'Pol' to the */ /* new domain list. */ if (!PolDomain) PolDomain = Pol; else p_domain_end->next = Pol; } else { /* The rest of the list is just inherited from p */ Polyhedron_Free(Pol); } return PolDomain; } /* AddPolyToDomain */ /* * Given a polyhedra 'Pol' and a single constraint 'Con' and an integer 'Pass' * whose value ranges from 0 to 3, add the inverse of constraint 'Con' to the * constraint set of 'Pol' and return the new polyhedron. 'NbMaxRays' is the * maximum allowed rays in the new generated polyhedron. * If Pass == 0, add ( -constraint -1) >= 0 * If Pass == 1, add ( +constraint -1) >= 0 * If Pass == 2, add ( -constraint ) >= 0 * If Pass == 3, add ( +constraint ) >= 0 */ Polyhedron *SubConstraint(Value *Con,Polyhedron *Pol,unsigned NbMaxRays,int Pass) { Polyhedron *NewPol = NULL; Matrix *Mat = NULL, *Ray = NULL; SatMatrix *Sat = NULL; unsigned NbRay, NbCon, NbEle1, Dimension; int i; POL_ENSURE_FACETS(Pol); POL_ENSURE_VERTICES(Pol); CATCH(any_exception_error) { if (NewPol) Polyhedron_Free(NewPol); if (Mat) Matrix_Free(Mat); if (Ray) Matrix_Free(Ray); if (Sat) SMFree(&Sat); RETHROW(); } TRY { /* If 'Con' is the positivity constraint, return Null */ Dimension = Pol->Dimension+1; /* Homogeneous Dimension */ for (i=1; iNbRays; NbCon = Pol->NbConstraints; Dimension = Pol->Dimension+2; /* Homogeneous Dimension + Status */ NbEle1 = NbCon * Dimension; /* Ignore for now */ if (POL_ISSET(NbMaxRays, POL_NO_DUAL)) NbMaxRays = 0; if (NbRay > NbMaxRays) NbMaxRays = NbRay; Mat = Matrix_Alloc(NbCon + 1, Dimension); if(!Mat) { errormsg1("SubConstraint", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Set the constraints of Pol */ Vector_Copy(Pol->Constraint[0], Mat->p[0], NbEle1); /* Add the new constraint */ value_set_si(Mat->p[NbCon][0],1); if (!(Pass&1)) for(i=1; ip[NbCon][i],Con[i]); else for(i=1; ip[NbCon][i],Con[i]); if (!(Pass&2)) value_decrement(Mat->p[NbCon][Dimension-1],Mat->p[NbCon][Dimension-1]); /* Allocate the ray matrix. */ Ray = Matrix_Alloc(NbMaxRays, Dimension); if(!Ray) { errormsg1("SubConstraint", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Initialize the ray matrix with the rays of polyhedron 'Pol' */ Ray->NbRows = NbRay; if (NbRay) Vector_Copy(Pol->Ray[0], Ray->p[0], NbRay * Dimension); /* Create the saturation matrix from the constraint matrix 'mat' and */ /* ray matrix 'Ray'. */ Sat = BuildSat(Mat, Ray, NbCon, NbMaxRays); /* Create the ray matrix 'Ray' from consraint matrix 'Mat' */ Pol_status = Chernikova(Mat, Ray, Sat, Pol->NbBid, NbMaxRays, NbCon,0); /* Remove redundant constraints from matrix 'Mat' */ NewPol = Remove_Redundants(Mat, Ray, Sat, 0); } /* end of TRY */ UNCATCH(any_exception_error); SMFree(&Sat); Matrix_Free(Ray); Matrix_Free(Mat); return NewPol; } /* SubConstraint */ /* * Return the intersection of two polyhedral domains 'Pol1' and 'Pol2'. * The maximum allowed rays in the new polyhedron generated is 'NbMaxRays'. */ Polyhedron *DomainIntersection(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3, *d; if (!Pol1 || !Pol2) return (Polyhedron*) 0; if (Pol1->Dimension != Pol2->Dimension) { errormsg1( "DomainIntersection", "diffdim", "operation on different dimensions"); return (Polyhedron*) 0; } /* For every polyhedron pair (p1,p2) where p1 belongs to domain Pol1 and */ /* p2 belongs to domain Pol2, compute the intersection and add it to the */ /* new domain 'd'. */ d = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { for (p2=Pol2; p2; p2=p2->next) { p3 = AddConstraints(p2->Constraint[0], p2->NbConstraints, p1, NbMaxRays); d = AddPolyToDomain(p3,d); } } if (!d) return Empty_Polyhedron(Pol1->Dimension); else return d; } /* DomainIntersection */ /* * Given a polyhedron 'Pol', return a matrix of rays. */ Matrix *Polyhedron2Rays(Polyhedron *Pol) { Matrix *Ray; unsigned NbRays, Dimension; POL_ENSURE_POINTS(Pol); NbRays = Pol->NbRays; Dimension = Pol->Dimension+2; /* Homogeneous Dimension + Status */ Ray = Matrix_Alloc(NbRays, Dimension); if(!Ray) { errormsg1("Polyhedron2Rays", "outofmem", "out of memory space"); return 0; } Vector_Copy(Pol->Ray[0], Ray->p_Init, NbRays*Dimension); return Ray; } /* Polyhedron2Rays */ /* * Add 'NbAddedRays' rays to polyhedron 'Pol'. Rays are pointed by 'AddedRays' * and the maximum allowed constraints in the new polyhedron is 'NbMaxConstrs'. */ Polyhedron *AddRays(Value *AddedRays,unsigned NbAddedRays,Polyhedron *Pol,unsigned NbMaxConstrs) { Polyhedron *NewPol = NULL; Matrix *Mat = NULL, *Ray = NULL; SatMatrix *Sat = NULL, *SatTranspose = NULL; unsigned NbCon, NbRay,NbEle1, Dimension; POL_ENSURE_FACETS(Pol); POL_ENSURE_VERTICES(Pol); CATCH(any_exception_error) { if (NewPol) Polyhedron_Free(NewPol); if (Mat) Matrix_Free(Mat); if (Ray) Matrix_Free(Ray); if (Sat) SMFree(&Sat); if (SatTranspose) SMFree(&SatTranspose); RETHROW(); } TRY { NbCon = Pol->NbConstraints; NbRay = Pol->NbRays; Dimension = Pol->Dimension + 2; /* Homogeneous Dimension + Status */ NbEle1 = NbRay * Dimension; Ray = Matrix_Alloc(NbAddedRays + NbRay, Dimension); if(!Ray) { errormsg1("AddRays", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Copy rays of polyhedron 'Pol' to matrix 'Ray' */ if (NbRay) Vector_Copy(Pol->Ray[0], Ray->p_Init, NbEle1); /* Add the new rays pointed by 'AddedRays' to matrix 'Ray' */ Vector_Copy(AddedRays, Ray->p_Init+NbEle1, NbAddedRays * Dimension); /* Ignore for now */ if (POL_ISSET(NbMaxConstrs, POL_NO_DUAL)) NbMaxConstrs = 0; /* We need at least NbCon rows */ if (NbMaxConstrs < NbCon) NbMaxConstrs = NbCon; /* Allocate space for constraint matrix 'Mat' */ Mat = Matrix_Alloc(NbMaxConstrs, Dimension); if(!Mat) { errormsg1("AddRays", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } Mat->NbRows = NbCon; /* Copy constraints of polyhedron 'Pol' to matrix 'Mat' */ Vector_Copy(Pol->Constraint[0], Mat->p_Init, NbCon*Dimension); /* Create the saturation matrix 'SatTranspose' from constraint matrix */ /* 'Mat' and ray matrix 'Ray'. Remember the saturation matrix is */ /* referenced by (constraint,ray) pair */ SatTranspose = BuildSat(Ray, Mat, NbRay, NbMaxConstrs); /* Create the constraint matrix 'Mat' from the ray matrix 'Ray' */ Pol_status = Chernikova(Ray, Mat, SatTranspose, Pol->NbEq, NbMaxConstrs, NbRay,1); /* Transform the saturation matrix 'SatTranspose' in the standard format */ /* , that is, (ray X constraint) format. */ Sat = TransformSat(Mat, Ray, SatTranspose); SMFree(&SatTranspose), SatTranspose = NULL; /* Remove redundant rays from the ray matrix 'Ray' */ NewPol = Remove_Redundants(Mat, Ray, Sat, 0); SMFree(&Sat), Sat = NULL; Matrix_Free(Mat), Mat = NULL; Matrix_Free(Ray), Ray = NULL; } /* end of TRY */ UNCATCH(any_exception_error); return NewPol; } /* AddRays */ /* * Add rays pointed by 'Ray' to each and every polyhedron in the polyhedral * domain 'Pol'. 'NbMaxConstrs' is maximum allowed constraints in the * constraint set of a polyhedron. */ Polyhedron *DomainAddRays(Polyhedron *Pol,Matrix *Ray,unsigned NbMaxConstrs) { Polyhedron *PolA, *PolEndA, *p1, *p2, *p3; int Redundant; if (!Pol) return (Polyhedron*) 0; if (!Ray || Ray->NbRows == 0) return Domain_Copy(Pol); if (Pol->Dimension != Ray->NbColumns-2) { errormsg1( "DomainAddRays", "diffdim", "operation on different dimensions"); return (Polyhedron*) 0; } /* Copy Pol to PolA */ PolA = PolEndA = (Polyhedron *)0; for (p1=Pol; p1; p1=p1->next) { p3 = AddRays(Ray->p[0], Ray->NbRows, p1, NbMaxConstrs); /* Does any component of PolA cover 'p3' ? */ Redundant = 0; for (p2=PolA; p2; p2=p2->next) { if (PolyhedronIncludes(p2, p3)) { /* If p2 covers p3 */ Redundant = 1; break; } } /* If the new polyheron is not redundant, add it ('p3') to the list */ if (Redundant) Polyhedron_Free(p3); else { if (!PolEndA) PolEndA = PolA = p3; else { PolEndA->next = p3; PolEndA = PolEndA->next; } } } return PolA; } /* DomainAddRays */ /* * Create a copy of the polyhedron 'Pol' */ Polyhedron *Polyhedron_Copy(Polyhedron *Pol) { Polyhedron *Pol1; if (!Pol) return (Polyhedron *)0; /* Allocate space for the new polyhedron */ Pol1 = Polyhedron_Alloc(Pol->Dimension, Pol->NbConstraints, Pol->NbRays); if (!Pol1) { errormsg1("Polyhedron_Copy", "outofmem", "out of memory space"); return 0; } if( Pol->NbConstraints ) Vector_Copy(Pol->Constraint[0], Pol1->Constraint[0], Pol->NbConstraints*(Pol->Dimension+2)); if( Pol->NbRays ) Vector_Copy(Pol->Ray[0], Pol1->Ray[0], Pol->NbRays*(Pol->Dimension+2)); Pol1->NbBid = Pol->NbBid; Pol1->NbEq = Pol->NbEq; Pol1->flags = Pol->flags; return Pol1; } /* Polyhedron_Copy */ /* * Create a copy of a polyhedral domain. */ Polyhedron *Domain_Copy(Polyhedron *Pol) { Polyhedron *Pol1; if (!Pol) return (Polyhedron *) 0; Pol1 = Polyhedron_Copy(Pol); if (Pol->next) Pol1->next = Domain_Copy(Pol->next); return Pol1; } /* Domain_Copy */ /* * Given constraint number 'k' of a polyhedron, and an array 'Filter' to store * the non-redundant constraints of the polyhedron in bit-wise notation, and * a Matrix 'Sat', add the constraint 'k' in 'Filter' array. tmpR[i] stores the * number of constraints, other than those in 'Filter', which ray(i) saturates * or verifies. In case, ray(i) does not saturate or verify a constraint in * array 'Filter', it is assigned to -1. Similarly, tmpC[j] stores the number * of rays which constraint(j), if it doesn't belong to Filter, saturates or * verifies. If constraint(j) belongs to 'Filter', then tmpC[j] is assigned to * -1. 'NbConstraints' is the number of constraints in the constraint matrix of * the polyhedron. * NOTE: (1) 'Sat' is not the saturation matrix of the polyhedron. In fact, * entry in 'Sat' is set to 1 if ray(i) of polyhedron1 verifies or * saturates the constraint(j) of polyhedron2 and otherwise it is set * to 0. So here the difference with saturation matrix is in terms * definition and entries(1<->0) of the matrix 'Sat'. * * ALGORITHM:-> * (1) Include constraint(k) in array 'Filter'. * (2) Set tmpC[k] to -1. * (3) For all ray(i) { * If ray(i) saturates or verifies constraint(k) then --(tmpR[i]) * Else { * Discard ray(i) by assigning tmpR[i] = -1 * Decrement tmpC[j] for all constraint(j) not in array 'Filter'. * } * } */ static void addToFilter(int k, unsigned *Filter, SatMatrix *Sat,Value *tmpR,Value *tmpC,int NbRays,int NbConstraints) { int kj, i,j, jx; unsigned kb, bx; /* Remove constraint k */ kj = k/WSIZE; kb = MSB; kb >>= k%WSIZE; Filter[kj]|=kb; value_set_si(tmpC[k],-1); /* Remove rays excluded by constraint k */ for(i=0; ip[i][kj]&kb) value_decrement(tmpR[i],tmpR[i]); /* adjust included ray */ else { /* Constraint k excludes ray i -- delete ray i */ value_set_si(tmpR[i],-1); /* Adjust non-deleted constraints */ jx=0; bx=MSB; for(j=0; jp[i][jx]&bx) ) value_decrement(tmpC[j],tmpC[j]); NEXT(jx,bx); } } } } /* addToFilter */ /* * Given polyhedra 'P1' and 'P2' such that their intersection is an empty * polyhedron, find the minimal set of constraints of 'P1' which contradict * all of the constraints of 'P2'. This is believed to be an NP-hard problem * and so a heuristic is employed to solve it in worst case. The heuristic is * to select in every turn that constraint of 'P1' which excludes most rays of * 'P2'. A bit in the binary format of an element of array 'Filter' is set to * 1 if the corresponding constraint is to be included in the minimal set of * constraints otherwise it is set to 0. */ static void FindSimple(Polyhedron *P1,Polyhedron *P2,unsigned *Filter,unsigned NbMaxRays) { Matrix *Mat = NULL; SatMatrix *Sat = NULL; int i, j, k, jx, found; Value *p1, *p2, p3; unsigned Dimension, NbRays, NbConstraints, bx, nc; Value NbConstraintsLeft, tmp; Value *tmpC = NULL, *tmpR = NULL; Polyhedron *Pol = NULL, *Pol2 = NULL; /* Initialize all the 'Value' variables */ value_init(p3); value_init(NbConstraintsLeft); value_init(tmp); CATCH(any_exception_error) { if (tmpC) free(tmpC); if (tmpR) free(tmpR); if (Mat) Matrix_Free(Mat); if (Sat) SMFree(&Sat); if (Pol2 && Pol2!=P2) Polyhedron_Free(Pol2); if (Pol && Pol!=Pol2 && Pol!=P2) Polyhedron_Free(Pol); /* Clear all the 'Value' variables */ value_clear(p3); value_clear(NbConstraintsLeft); value_clear(tmp); RETHROW(); } TRY { Dimension = P1->Dimension+2; /* status + homogeneous Dimension */ Mat = Matrix_Alloc(P1->NbConstraints, Dimension); if(!Mat) { errormsg1("FindSimple", "outofmem", "out of memory space"); UNCATCH(any_exception_error); /* Clear all the 'Value' variables */ value_clear(p3); value_clear(NbConstraintsLeft); value_clear(tmp); return; } /* Post constraints in P1 already included by Filter */ jx = 0; bx = MSB; Mat->NbRows=0; value_set_si(NbConstraintsLeft,0); for (k=0; kNbConstraints; k++) { if (Filter[jx]&bx) { Vector_Copy(P1->Constraint[k], Mat->p[Mat->NbRows], Dimension); Mat->NbRows++; } else value_increment(NbConstraintsLeft,NbConstraintsLeft); NEXT(jx,bx); } Pol2 = P2; for (;;) { if (Mat->NbRows==0) Pol = Polyhedron_Copy(Pol2); else { Pol = AddConstraints(Mat->p_Init, Mat->NbRows, Pol2, NbMaxRays); if (Pol2 != P2) Polyhedron_Free(Pol2), Pol2 = NULL; } if (emptyQ(Pol)) { Matrix_Free(Mat), Mat = NULL; Polyhedron_Free(Pol), Pol = NULL; UNCATCH(any_exception_error); /* Clear all the 'Value' variables */ value_clear(p3); value_clear(NbConstraintsLeft); value_clear(tmp); return; } Mat->NbRows = 0; /* Reset Mat */ Pol2 = Pol; /* Its not enough-- find some more constraints */ Dimension = Pol->Dimension+1; /* homogeneous Dimension */ NbRays = Pol->NbRays; NbConstraints = P1->NbConstraints; tmpR = (Value *)malloc(NbRays*sizeof(Value)); if(!tmpR) { errormsg1("FindSimple", "outofmem", "out of memory space"); UNCATCH(any_exception_error); /* Clear all the 'Value' variables */ value_clear(p3); value_clear(NbConstraintsLeft); value_clear(tmp); return; } for(i=0;iNbRows = NbRays; SMVector_Init(Sat->p_init, nc*NbRays); jx=0; bx=MSB; for (k=0; kRay[i]+1; p2 = P1->Constraint[k]+1; value_set_si(p3,0); for (j=0; jConstraint[k][0]))) { Sat->p[i][jx]|=bx; /* constraint includes ray, set flag */ value_increment(tmpR[i],tmpR[i]); value_increment(tmpC[k],tmpC[k]); } } NEXT(jx, bx); } do { /* find all of the essential constraints */ found = 0; for(i=0; ip[i][jx]&bx)==0)) { addToFilter(k, Filter, Sat, tmpR, tmpC, NbRays, NbConstraints); Vector_Copy(P1->Constraint[k], Mat->p[Mat->NbRows],Dimension+1); Mat->NbRows++; value_decrement(NbConstraintsLeft,NbConstraintsLeft); found=1; break; } NEXT(jx,bx); } break; } } } while (found); if (!Mat->NbRows) { /* Well then, just use a stupid heuristic */ /* find the constraint which excludes the most */ Value cmax; value_init(cmax); #ifndef LINEAR_VALUE_IS_CHARS value_set_si(cmax,(NbRays * NbConstraints+1)); #else value_set_si(cmax,1); #endif j = -1; for(k=0; kConstraint[j],Mat->p[Mat->NbRows],Dimension+1); Mat->NbRows++; value_decrement(NbConstraintsLeft,NbConstraintsLeft); } } SMFree(&Sat), Sat = NULL; free(tmpC), tmpC = NULL; free(tmpR), tmpR = NULL; } } /* end of TRY */ /* Clear all the 'Value' variables */ value_clear(p3); value_clear(NbConstraintsLeft); value_clear(tmp); for(i=0;iNbRays; NbCon1 = Pol1->NbConstraints; NbCon2 = Pol2->NbConstraints; NbCon = NbCon1 + NbCon2; Dimension = Pol1->Dimension+2; /* Homogeneous Dimension + Status */ NbEle1 = NbCon1*Dimension; /* Ignore for now */ if (POL_ISSET(NbMaxRays, POL_NO_DUAL)) NbMaxRays = 0; if (NbRay > NbMaxRays) NbMaxRays = NbRay; /* Allocate space for constraint matrix 'Mat' */ Mat = Matrix_Alloc(NbCon, Dimension); if(!Mat) { errormsg1("SimplifyConstraints", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Copy constraints of 'Pol1' to matrix 'Mat' */ Vector_Copy(Pol1->Constraint[0], Mat->p_Init, NbEle1); /* Add constraints of 'Pol2' to matrix 'Mat'*/ Vector_Copy(Pol2->Constraint[0], Mat->p_Init+NbEle1, NbCon2*Dimension); /* Allocate space for ray matrix 'Ray' */ Ray = Matrix_Alloc(NbMaxRays, Dimension); if(!Ray) { errormsg1("SimplifyConstraints", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } Ray->NbRows = NbRay; /* Copy rays of polyhedron 'Pol1' to matrix 'Ray' */ Vector_Copy(Pol1->Ray[0], Ray->p_Init, NbRay*Dimension); /* Create saturation matrix from constraint matrix 'Mat' and ray matrix */ /* 'Ray'. */ Sat = BuildSat(Mat, Ray, NbCon1, NbMaxRays); /* Create the ray matrix 'Ray' from the constraint matrix 'Mat' */ Pol_status = Chernikova(Mat, Ray, Sat, Pol1->NbBid, NbMaxRays, NbCon1,0); /* Remove redundant constraints from the constraint matrix 'Mat' */ Pol = Remove_Redundants(Mat, Ray, Sat, Filter); notempty = 1; if (Filter && emptyQ(Pol)) { notempty = 0; FindSimple(Pol1, Pol2, Filter, NbMaxRays); } /* Polyhedron_Print(stderr,"%4d",Pol1); */ Polyhedron_Free(Pol), Pol = NULL; SMFree(&Sat), Sat = NULL; Matrix_Free(Ray), Ray = NULL; Matrix_Free(Mat), Mat = NULL; } /* end of TRY */ UNCATCH(any_exception_error); return notempty; } /* SimplifyConstraints */ /* * Eliminate equations of Pol1 using equations of Pol2. Mark as needed, * equations of Pol1 that are not eliminated. Or info into Filter vector. */ static void SimplifyEqualities(Polyhedron *Pol1, Polyhedron *Pol2, unsigned *Filter) { int i,j; unsigned ix, bx, NbEqn, NbEqn1, NbEqn2, NbEle2, Dimension; Matrix *Mat; NbEqn1 = Pol1->NbEq; NbEqn2 = Pol2->NbEq; NbEqn = NbEqn1 + NbEqn2; Dimension = Pol1->Dimension+2; /* Homogeneous Dimension + Status */ NbEle2 = NbEqn2*Dimension; Mat = Matrix_Alloc(NbEqn, Dimension); if (!Mat) { errormsg1("SimplifyEqualities", "outofmem", "out of memory space"); Pol_status = 1; return; } /* Set the equalities of Pol2 */ Vector_Copy(Pol2->Constraint[0], Mat->p_Init, NbEle2); /* Add the equalities of Pol1 */ Vector_Copy(Pol1->Constraint[0], Mat->p_Init+NbEle2, NbEqn1*Dimension); Gauss(Mat, NbEqn2, Dimension-1); ix = 0; bx = MSB; for (i=NbEqn2; ip[i][j])) { /* If any coefficient of the equation is non-zero */ /* Set the filter bit for the equation */ Filter[ix] |= bx; break; } } NEXT(ix,bx); } Matrix_Free(Mat); return; } /* SimplifyEqualities */ /* * Given two polyhedral domains 'Pol1' and 'Pol2', find the largest domain * set (or the smallest list of non-redundant constraints), that when * intersected with polyhedral domain 'Pol2' equals (Pol1)intersect(Pol2). * The output is a polyhedral domain with the "redundant" constraints removed. * 'NbMaxRays' is the maximium allowed rays in the new polyhedra. */ Polyhedron *DomainSimplify(Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3, *d; unsigned k, jx, bx, nbentries, NbConstraints, Dimension, NbCon, empty; unsigned *Filter; Matrix *Constraints; if (!Pol1 || !Pol2) return Pol1; if (Pol1->Dimension != Pol2->Dimension) { errormsg1("DomSimplify","diffdim","operation on different dimensions"); Pol_status = 1; return 0; } POL_ENSURE_VERTICES(Pol1); POL_ENSURE_VERTICES(Pol2); if (emptyQ(Pol1)||emptyQ(Pol2)) return Empty_Polyhedron(Pol1->Dimension); /* Find the maximum number of constraints over all polyhedron in the */ /* polyhedral domain 'Pol2' and store in 'NbCon'. */ NbCon = 0; for (p2=Pol2; p2; p2=p2->next) if (p2->NbConstraints > NbCon) NbCon = p2->NbConstraints; Dimension = Pol1->Dimension+2; /* Homogenous Dimension + Status */ d = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { POL_ENSURE_VERTICES(p1); /* Filter is an array of integers, each bit in an element of Filter */ /* array corresponds to a constraint. The bit is marked 1 if the */ /* corresponding constraint is non-redundant and is 0 if it is */ /* redundant. */ NbConstraints = p1->NbConstraints; nbentries = (NbConstraints + NbCon - 1) / (sizeof(int)*8) + 1; /* Allocate space for array 'Filter' */ Filter = (unsigned *)malloc(nbentries * sizeof(int)); if (!Filter) { errormsg1("DomSimplify", "outofmem", "out of memory space\n"); Pol_status = 1; return 0; } /* Initialize 'Filter' with zeros */ SMVector_Init(Filter, nbentries); /* Filter the constraints of p1 in context of polyhedra p2(s) */ empty = 1; for (p2=Pol2; p2; p2=p2->next) { POL_ENSURE_VERTICES(p2); /* Store the non-redundant constraints in array 'Filter'. With */ /* successive loops, the array 'Filter' holds the union of all */ /* non-redundant constraints. 'empty' is set to zero if the */ /* intersection of two polyhedra is non-empty and Filter is !Null */ SimplifyEqualities(p1, p2, Filter); if (SimplifyConstraints(p1, p2, Filter, NbMaxRays)) empty=0; /* takes the union of all non redundant constraints */ } if (!empty) { /* Copy all non-redundant constraints to matrix 'Constraints' */ Constraints = Matrix_Alloc(NbConstraints, Dimension); if (!Constraints) { errormsg1("DomSimplify", "outofmem", "out of memory space\n"); Pol_status = 1; return 0; } Constraints->NbRows = 0; for (k=0, jx=0, bx=MSB; kConstraint[k], Constraints->p[Constraints->NbRows], Dimension); Constraints->NbRows++; } NEXT(jx,bx); } /* Create the polyhedron 'p3' corresponding to the constraints in */ /* matrix 'Constraints'. */ p3 = Constraints2Polyhedron(Constraints,NbMaxRays); Matrix_Free(Constraints); /* Add polyhedron 'p3' in the domain 'd'. */ d = AddPolyToDomain (p3, d); p3 = NULL; } free(Filter); } if (!d) return Empty_Polyhedron(Pol1->Dimension); else return d; } /* DomainSimplify */ /* * Domain Simplify as defined in Strasborg Polylib version. */ Polyhedron *Stras_DomainSimplify(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3 = NULL, *d = NULL; unsigned k, jx, bx, nbentries, NbConstraints, Dimension, NbCon, empty; unsigned *Filter = NULL; Matrix *Constraints = NULL; CATCH(any_exception_error) { if (Constraints) Matrix_Free(Constraints); if (Filter) free(Filter); if (d) Polyhedron_Free(d); if (p2) Polyhedron_Free(p3); RETHROW(); } TRY { if (!Pol1 || !Pol2) { UNCATCH(any_exception_error); return Pol1; } if (Pol1->Dimension != Pol2->Dimension) { errormsg1("DomainSimplify","diffdim","operation on different dimensions"); UNCATCH(any_exception_error); return 0; } POL_ENSURE_VERTICES(Pol1); POL_ENSURE_VERTICES(Pol2); if (emptyQ(Pol1)||emptyQ(Pol2)) { UNCATCH(any_exception_error); return Empty_Polyhedron(Pol1->Dimension); } /* Find the maximum number of constraints over all polyhedron in the */ /* polyhedral domain 'Pol2' and store in 'NbCon'. */ NbCon = 0; for (p2=Pol2; p2; p2=p2->next) if (p2->NbConstraints > NbCon) NbCon = p2->NbConstraints; Dimension = Pol1->Dimension+2; /* Homogenous Dimension + Status */ d = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { /* Filter is an array of integers, each bit in an element of Filter */ /* array corresponds to a constraint. The bit is marked 1 if the */ /* corresponding constraint is non-redundant and is 0 if it is */ /* redundant. */ NbConstraints = p1->NbConstraints; nbentries = (NbConstraints + NbCon - 1)/(sizeof(int)*8) + 1; /* Allocate space for array 'Filter' */ Filter = (unsigned *)malloc(nbentries * sizeof(int)); if(!Filter) { errormsg1("DomainSimplify", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } /* Initialize 'Filter' with zeros */ SMVector_Init(Filter, nbentries); /* Filter the constraints of p1 in context to the polyhedra p2(s) */ empty = 1; for (p2=Pol2; p2; p2=p2->next) { /* Store the non-redundant constraints in array 'Filter'. With */ /* successive loops, the array 'Filter' holds the union of all */ /* non-redundant constraints. 'empty' is set to zero if the */ /* intersection of two polyhedra is non-empty and Filter is !Null */ if (SimplifyConstraints(p1, p2, Filter, NbMaxRays)) empty=0; } if (!empty) { /* Copy all non-redundant constraints to matrix 'Constraints' */ Constraints = Matrix_Alloc(NbConstraints,Dimension); if(!Constraints) { errormsg1("DomainSimplify", "outofmem", "out of memory space"); UNCATCH(any_exception_error); return 0; } Constraints->NbRows = 0; for (k=0, jx=0, bx=MSB; kConstraint[k], Constraints->p[Constraints->NbRows], Dimension); Constraints->NbRows++; } NEXT(jx,bx); } /* Create the polyhedron 'p3' corresponding to the constraints in */ /* matrix 'Constraints'. */ p3 = Constraints2Polyhedron(Constraints,NbMaxRays); Matrix_Free(Constraints), Constraints = NULL; /* Add polyhedron 'p3' in the domain 'd'. */ d = AddPolyToDomain (p3, d); p3 = NULL; } free(Filter), Filter = NULL; } } /* end of TRY */ UNCATCH(any_exception_error); if (!d) return Empty_Polyhedron(Pol1->Dimension); else return d; } /* DomainSimplify */ /* * Return the Union of two polyhedral domains 'Pol1' and Pol2'. The result is * a new polyhedral domain. */ Polyhedron *DomainUnion(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *PolA, *PolEndA, *PolB, *PolEndB, *p1, *p2; int Redundant; if (!Pol1 || !Pol2) return (Polyhedron *) 0; if (Pol1->Dimension != Pol2->Dimension) { errormsg1("DomainUnion","diffdim","operation on different dimensions"); return (Polyhedron*) 0; } /* Copy 'Pol1' to 'PolA' */ PolA = PolEndA = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { /* Does any component of 'Pol2' cover 'p1' ? */ Redundant = 0; for (p2=Pol2; p2; p2=p2->next) { if (PolyhedronIncludes(p2, p1) ) { /* p2 covers p1 */ Redundant = 1; break; } } if (!Redundant) { /* Add 'p1' to 'PolA' */ if (!PolEndA) PolEndA = PolA = Polyhedron_Copy(p1); else { PolEndA->next = Polyhedron_Copy(p1); PolEndA = PolEndA->next; } } } /* Copy 'Pol2' to PolB */ PolB = PolEndB = (Polyhedron *)0; for (p2=Pol2; p2; p2=p2->next) { /* Does any component of PolA cover 'p2' ? */ Redundant = 0; for (p1=PolA; p1; p1=p1->next) { if (PolyhedronIncludes(p1, p2)) { /* p1 covers p2 */ Redundant = 1; break; } } if (!Redundant) { /* Add 'p2' to 'PolB' */ if (!PolEndB) PolEndB = PolB = Polyhedron_Copy(p2); else { PolEndB->next = Polyhedron_Copy(p2); PolEndB = PolEndB->next; } } } if (!PolA) return PolB; PolEndA->next = PolB; return PolA; } /* DomainUnion */ /* * Given a polyhedral domain 'Pol', concatenate the lists of rays and lines * of the two (or more) polyhedra in the domain into one combined list, and * find the set of constraints which tightly bound all of those objects. * 'NbMaxConstrs' is the maximum allowed constraints in the new polyhedron. */ Polyhedron *DomainConvex(Polyhedron *Pol,unsigned NbMaxConstrs) { Polyhedron *p, *q, *NewPol = NULL; CATCH(any_exception_error) { if (NewPol) Polyhedron_Free(NewPol); RETHROW(); } TRY { if (!Pol) { UNCATCH(any_exception_error); return (Polyhedron*) 0; } POL_ENSURE_VERTICES(Pol); NewPol = Polyhedron_Copy(Pol); for (p=Pol->next; p; p=p->next) { POL_ENSURE_VERTICES(p); q = AddRays(p->Ray[0], p->NbRays, NewPol, NbMaxConstrs); Polyhedron_Free(NewPol); NewPol = q; } } /* end of TRY */ UNCATCH(any_exception_error); return NewPol; } /* DomainConvex */ /* * Given polyhedral domains 'Pol1' and 'Pol2', create a new polyhedral * domain which is mathematically the differnce of the two domains. */ Polyhedron *DomainDifference(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3, *d; int i; if (!Pol1 || !Pol2) return (Polyhedron*) 0; if (Pol1->Dimension != Pol2->Dimension) { errormsg1("DomainDifference", "diffdim", "operation on different dimensions"); return (Polyhedron*) 0; } POL_ENSURE_FACETS(Pol1); POL_ENSURE_VERTICES(Pol1); POL_ENSURE_FACETS(Pol2); POL_ENSURE_VERTICES(Pol2); if (emptyQ(Pol1) || emptyQ(Pol2)) return (Domain_Copy(Pol1)); d = (Polyhedron *)0; for (p2=Pol2; p2; p2=p2->next) { for (p1=Pol1; p1; p1=p1->next) { for (i=0; iNbConstraints; i++) { /* Add the constraint ( -p2->constraint[i] -1) >= 0 in 'p1' */ /* and create the new polyhedron 'p3'. */ p3 = SubConstraint(p2->Constraint[i], p1, NbMaxRays,0); /* Add 'p3' in the new domain 'd' */ d = AddPolyToDomain (p3, d); /* If the constraint p2->constraint[i][0] is an equality, then */ /* add the constraint ( +p2->constraint[i] -1) >= 0 in 'p1' and*/ /* create the new polyhedron 'p3'. */ if( value_notzero_p(p2->Constraint[i][0]) ) /* Inequality */ continue; p3 = SubConstraint(p2->Constraint[i], p1, NbMaxRays,1); /* Add 'p3' in the new domain 'd' */ d = AddPolyToDomain (p3, d); } } if (p2 != Pol2) Domain_Free(Pol1); Pol1 = d; d = (Polyhedron *)0; } if (!Pol1) return Empty_Polyhedron(Pol2->Dimension); else return Pol1; } /* DomainDifference */ /* * Given a polyhedral domain 'Pol', convert it to a new polyhedral domain * with dimension expanded to 'align_dimension'. 'NbMaxRays' is the maximum * allowed rays in the new polyhedra. */ Polyhedron *align_context(Polyhedron *Pol,int align_dimension,int NbMaxRays) { int i, j, k; Polyhedron *p = NULL, **next, *result = NULL; unsigned dim; CATCH(any_exception_error) { if (result) Polyhedron_Free(result); RETHROW(); } TRY { if (!Pol) return Pol; dim = Pol->Dimension; if (align_dimension < Pol->Dimension) { errormsg1("align_context", "diffdim", "context dimension exceeds data"); UNCATCH(any_exception_error); return NULL; } if (align_dimension == Pol->Dimension) { UNCATCH(any_exception_error); return Domain_Copy(Pol); } /* 'k' is the dimension increment */ k = align_dimension - Pol->Dimension; next = &result; /* Expand the dimension of all polyhedra in the polyhedral domain 'Pol' */ for (; Pol; Pol=Pol->next) { int have_cons = !F_ISSET(Pol, POL_VALID) || F_ISSET(Pol, POL_INEQUALITIES); int have_rays = !F_ISSET(Pol, POL_VALID) || F_ISSET(Pol, POL_POINTS); unsigned NbCons = have_cons ? Pol->NbConstraints : 0; unsigned NbRays = have_rays ? Pol->NbRays + k : 0; if (Pol->Dimension != dim) { Domain_Free(result); errormsg1("align_context", "diffdim", "context not of uniform dimension"); UNCATCH(any_exception_error); return NULL; } p = Polyhedron_Alloc(align_dimension, NbCons, NbRays); if (have_cons) { for (i = 0; i < NbCons; ++i) { value_assign(p->Constraint[i][0], Pol->Constraint[i][0]); /* Status bit */ Vector_Copy(Pol->Constraint[i]+1, p->Constraint[i]+k+1, Pol->Dimension+1); } p->NbEq = Pol->NbEq; } if (have_rays) { for (i = 0; i < k; ++i) value_set_si(p->Ray[i][1+i], 1); /* A line */ for (i = 0; i < Pol->NbRays; ++i) { value_assign(p->Ray[k+i][0], Pol->Ray[i][0]); /* Status bit */ Vector_Copy(Pol->Ray[i]+1, p->Ray[i+k]+k+1, Pol->Dimension+1); } p->NbBid = Pol->NbBid + k; } p->flags = Pol->flags; *next = p; next = &p->next; } } /* end of TRY */ UNCATCH(any_exception_error); return result; } /* align_context */ /*----------------------------------------------------------------------*/ /* Polyhedron *Polyhedron_Scan(D, C, NbMaxRays) */ /* D : Domain to be scanned (single polyhedron only) */ /* C : Context domain */ /* NbMaxRays : Workspace size */ /* Returns a linked list of scan domains, outer loop first */ /*----------------------------------------------------------------------*/ Polyhedron *Polyhedron_Scan(Polyhedron *D, Polyhedron *C,unsigned NbMaxRays) { int i, j, dim ; Matrix *Mat; Polyhedron *C1, *C2, *D1, *D2; Polyhedron *res, *last, *tmp; dim = D->Dimension - C->Dimension; res = last = (Polyhedron *) 0; if (dim==0) return (Polyhedron *)0; assert(!D->next); POL_ENSURE_FACETS(D); POL_ENSURE_VERTICES(D); POL_ENSURE_FACETS(C); POL_ENSURE_VERTICES(C); /* Allocate space for constraint matrix. */ Mat = Matrix_Alloc(D->Dimension, D->Dimension+2); if(!Mat) { errormsg1("Polyhedron_Scan", "outofmem", "out of memory space"); return 0; } C1 = align_context(C,D->Dimension,NbMaxRays); if(!C1) { return 0; } /* Vin100, aug 16, 2001: The context is intersected with D */ D2 = DomainIntersection( C1, D, NbMaxRays); for (i=0; ip_Init,0,D2->Dimension*(D2->Dimension + 2)); for (j=i+1; jp[j-i-1][j+1],1); } Mat->NbRows = dim-i-1; D1 = Mat->NbRows ? DomainAddRays(D2, Mat, NbMaxRays) : D2; tmp = DomainSimplify(D1, C1, NbMaxRays); if (!last) res = last = tmp; else { last->next = tmp; last = tmp; } C2 = DomainIntersection(C1, D1, NbMaxRays); Domain_Free(C1); C1 = C2; if (Mat->NbRows) Domain_Free(D1); } Domain_Free(D2); Domain_Free(C1); Matrix_Free(Mat); return res; } /* Polyhedron_Scan */ /*---------------------------------------------------------------------*/ /* int lower_upper_bounds(pos,P,context,LBp,UBp) */ /* pos : index position of current loop index (1..hdim-1) */ /* P: loop domain */ /* context : context values for fixed indices */ /* notice that context[hdim] must be 1 */ /* LBp, UBp : pointers to resulting bounds */ /* returns the flag = (UB_INFINITY, LB_INFINITY) */ /*---------------------------------------------------------------------*/ int lower_upper_bounds(int pos,Polyhedron *P,Value *context,Value *LBp,Value *UBp) { Value LB, UB; int flag, i; Value n, n1, d, tmp; POL_ENSURE_FACETS(P); POL_ENSURE_VERTICES(P); /* Initialize all the 'Value' variables */ value_init(LB); value_init(UB); value_init(tmp); value_init(n); value_init(n1); value_init(d); value_set_si(LB,0); value_set_si(UB,0); /* Compute Upper Bound and Lower Bound for current loop */ flag = LB_INFINITY | UB_INFINITY; for (i=0; iNbConstraints; i++) { value_assign(d,P->Constraint[i][pos]); Inner_Product(&context[1],&(P->Constraint[i][1]),P->Dimension+1,&n); if (value_zero_p(d)) { /* If context doesn't satisfy constraints, return empty loop. */ if (value_neg_p(n) || (value_zero_p(P->Constraint[i][0]) && value_notzero_p(n))) goto empty_loop; continue; } value_oppose(n,n); /*---------------------------------------------------*/ /* Compute n/d n/d<0 n/d>0 */ /*---------------------------------------------------*/ /* n%d == 0 floor = n/d floor = n/d */ /* ceiling = n/d ceiling = n/d */ /*---------------------------------------------------*/ /* n%d != 0 floor = n/d - 1 floor = n/d */ /* ceiling = n/d ceiling = n/d + 1 */ /*---------------------------------------------------*/ /* Check to see if constraint is inequality */ /* if constraint is equality, both upper and lower bounds are fixed */ if(value_zero_p(P->Constraint[i][0])) { /* Equality */ value_modulus(tmp,n,d); /* if not integer, return 0; */ if (value_notzero_p(tmp)) goto empty_loop; value_division(n1,n,d); /* Upper and Lower bounds found */ if((flag&LB_INFINITY) || value_gt(n1,LB)) value_assign(LB,n1); if((flag&UB_INFINITY) || value_lt(n1,UB)) value_assign(UB,n1); flag = 0; } if (value_pos_p(d)) { /* Lower Bound */ value_modulus(tmp,n,d); /* n1 = ceiling(n/d) */ if (value_pos_p(n) && value_notzero_p(tmp)) { value_division(n1,n,d); value_add_int(n1,n1,1); } else value_division(n1,n,d); if (flag&LB_INFINITY) { value_assign(LB,n1); flag^=LB_INFINITY; } else if(value_gt(n1,LB)) value_assign(LB,n1); } if (value_neg_p(d)) { /* Upper Bound */ value_modulus(tmp,n,d); /* n1 = floor(n/d) */ if (value_pos_p(n) && value_notzero_p(tmp)) { value_division(n1,n,d); value_sub_int(n1,n1,1); } else value_division(n1,n,d); if (flag&UB_INFINITY) { value_assign(UB,n1); flag^=UB_INFINITY; } else if (value_lt(n1,UB)) value_assign(UB, n1); } } if ((flag & LB_INFINITY)==0) value_assign(*LBp,LB); if ((flag & UB_INFINITY)==0) value_assign(*UBp,UB); if (0) { empty_loop: flag = 0; value_set_si(*LBp, 1); value_set_si(*UBp, 0); /* empty loop */ } /* Clear all the 'Value' variables */ value_clear(LB); value_clear(UB); value_clear(tmp); value_clear(n); value_clear(n1); value_clear(d); return flag; } /* lower_upper_bounds */ /* * C = A x B */ static void Rays_Mult(Value **A, Matrix *B, Value **C, unsigned NbRays) { int i, j, k; unsigned Dimension1, Dimension2; Value Sum, tmp; value_init(Sum); value_init(tmp); CATCH(any_exception_error) { value_clear(Sum); value_clear(tmp); RETHROW(); } TRY { Dimension1 = B->NbRows; Dimension2 = B->NbColumns; for (i=0; ip[k][j]; */ value_addmul(Sum, A[i][k+1], B->p[k][j]); } value_assign(C[i][j+1],Sum); } Vector_Gcd(C[i]+1, Dimension2, &tmp); if (value_notone_p(tmp)) Vector_AntiScale(C[i]+1, C[i]+1, tmp, Dimension2); } } UNCATCH(any_exception_error); value_clear(Sum); value_clear(tmp); } /* * C = A x B^T */ static void Rays_Mult_Transpose(Value **A, Matrix *B, Value **C, unsigned NbRays) { int i, j, k; unsigned Dimension1, Dimension2; Value Sum, tmp; value_init(Sum); value_init(tmp); CATCH(any_exception_error) { value_clear(Sum); value_clear(tmp); RETHROW(); } TRY { Dimension1 = B->NbColumns; Dimension2 = B->NbRows; for (i=0; ip[j][k]; */ value_addmul(Sum, A[i][k+1], B->p[j][k]); } value_assign(C[i][j+1],Sum); } Vector_Gcd(C[i]+1, Dimension2, &tmp); if (value_notone_p(tmp)) Vector_AntiScale(C[i]+1, C[i]+1, tmp, Dimension2); } } UNCATCH(any_exception_error); value_clear(Sum); value_clear(tmp); } /* * Given a polyhedron 'Pol' and a transformation matrix 'Func', return the * polyhedron which when transformed by mapping function 'Func' gives 'Pol'. * 'NbMaxRays' is the maximum number of rays that can be in the ray matrix * of the resulting polyhedron. */ Polyhedron *Polyhedron_Preimage(Polyhedron *Pol,Matrix *Func,unsigned NbMaxRays) { Matrix *Constraints = NULL; Polyhedron *NewPol = NULL; unsigned NbConstraints, Dimension1, Dimension2; POL_ENSURE_INEQUALITIES(Pol); CATCH(any_exception_error) { if (Constraints) Matrix_Free(Constraints); if (NewPol) Polyhedron_Free(NewPol); RETHROW(); } TRY { NbConstraints = Pol->NbConstraints; Dimension1 = Pol->Dimension+1; /* Homogeneous Dimension */ Dimension2 = Func->NbColumns; /* Homogeneous Dimension */ if (Dimension1!=(Func->NbRows)) { errormsg1("Polyhedron_Preimage", "dimincomp", "incompatable dimensions"); UNCATCH(any_exception_error); return Empty_Polyhedron(Dimension2-1); } /* Dim1 Dim2 Dim2 __k__ __j__ __j__ NbCon | | X Dim1| | = NbCon | | i |___| k |___| i |___| Pol->Constraints Function Constraints */ /* Allocate space for the resulting constraint matrix */ Constraints = Matrix_Alloc(NbConstraints, Dimension2+1); if (!Constraints) { errormsg1("Polyhedron_Preimage", "outofmem", "out of memory space\n"); Pol_status = 1; UNCATCH(any_exception_error); return 0; } /* The new constraint matrix is the product of constraint matrix of the */ /* polyhedron and the function matrix. */ Rays_Mult(Pol->Constraint, Func, Constraints->p, NbConstraints); NewPol = Constraints2Polyhedron(Constraints, NbMaxRays); Matrix_Free(Constraints), Constraints = NULL; } /* end of TRY */ UNCATCH(any_exception_error); return NewPol; } /* Polyhedron_Preimage */ /* * Given a polyhedral domain 'Pol' and a transformation matrix 'Func', return * the polyhedral domain which when transformed by mapping function 'Func' * gives 'Pol'. 'NbMaxRays' is the maximum number of rays that can be in the * ray matrix of the resulting domain. */ Polyhedron *DomainPreimage(Polyhedron *Pol,Matrix *Func,unsigned NbMaxRays) { Polyhedron *p, *q, *d = NULL; CATCH(any_exception_error) { if (d) Polyhedron_Free(d); RETHROW(); } TRY { if (!Pol || !Func) { UNCATCH(any_exception_error); return (Polyhedron *) 0; } d = (Polyhedron *) 0; for (p=Pol; p; p=p->next) { q = Polyhedron_Preimage(p, Func, NbMaxRays); d = AddPolyToDomain (q, d); } } /* end of TRY */ UNCATCH(any_exception_error); return d; } /* DomainPreimage */ /* * Transform a polyhedron 'Pol' into another polyhedron according to a given * affine mapping function 'Func'. 'NbMaxConstrs' is the maximum number of * constraints that can be in the constraint matrix of the new polyhedron. */ Polyhedron *Polyhedron_Image(Polyhedron *Pol, Matrix *Func,unsigned NbMaxConstrs) { Matrix *Rays = NULL; Polyhedron *NewPol = NULL; unsigned NbRays, Dimension1, Dimension2; POL_ENSURE_FACETS(Pol); POL_ENSURE_VERTICES(Pol); CATCH(any_exception_error) { if (Rays) Matrix_Free(Rays); if (NewPol) Polyhedron_Free(NewPol); RETHROW(); } TRY { NbRays = Pol->NbRays; Dimension1 = Pol->Dimension+1; /* Homogeneous Dimension */ Dimension2 = Func->NbRows; /* Homogeneous Dimension */ if (Dimension1!=Func->NbColumns) { errormsg1("Polyhedron_Image", "dimincomp", "incompatible dimensions"); UNCATCH(any_exception_error); return Empty_Polyhedron(Dimension2-1); } /* Dim1 / Dim1 \Transpose Dim2 __k__ | __k__ | __j__ NbRays| | X | Dim2 | | | = NbRays| | i |___| | j |___| | i |___| Pol->Rays \ Func / Rays */ if (Dimension1 == Dimension2) { Matrix *M, *M2; int ok; M = Matrix_Copy(Func); M2 = Matrix_Alloc(Dimension2, Dimension1); if (!M2) { errormsg1("Polyhedron_Image", "outofmem", "out of memory space\n"); UNCATCH(any_exception_error); return 0; } ok = Matrix_Inverse(M, M2); Matrix_Free(M); if (ok) { NewPol = Polyhedron_Alloc(Pol->Dimension, Pol->NbConstraints, Pol->NbRays); if (!NewPol) { errormsg1("Polyhedron_Image", "outofmem", "out of memory space\n"); UNCATCH(any_exception_error); return 0; } Rays_Mult_Transpose(Pol->Ray, Func, NewPol->Ray, NbRays); Rays_Mult(Pol->Constraint, M2, NewPol->Constraint, Pol->NbConstraints); NewPol->NbEq = Pol->NbEq; NewPol->NbBid = Pol->NbBid; if (NewPol->NbEq) Gauss4(NewPol->Constraint, NewPol->NbEq, NewPol->NbConstraints, NewPol->Dimension+1); if (NewPol->NbBid) Gauss4(NewPol->Ray, NewPol->NbBid, NewPol->NbRays, NewPol->Dimension+1); } Matrix_Free(M2); } if (!NewPol) { /* Allocate space for the resulting ray matrix */ Rays = Matrix_Alloc(NbRays, Dimension2+1); if (!Rays) { errormsg1("Polyhedron_Image", "outofmem", "out of memory space\n"); UNCATCH(any_exception_error); return 0; } /* The new ray space is the product of ray matrix of the polyhedron and */ /* the transpose matrix of the mapping function. */ Rays_Mult_Transpose(Pol->Ray, Func, Rays->p, NbRays); NewPol = Rays2Polyhedron(Rays, NbMaxConstrs); Matrix_Free(Rays), Rays = NULL; } } /* end of TRY */ UNCATCH(any_exception_error); return NewPol; } /* Polyhedron_Image */ /* *Transform a polyhedral domain 'Pol' into another domain according to a given * affine mapping function 'Func'. 'NbMaxConstrs' is the maximum number of * constraints that can be in the constraint matrix of the resulting domain. */ Polyhedron *DomainImage(Polyhedron *Pol,Matrix *Func,unsigned NbMaxConstrs) { Polyhedron *p, *q, *d = NULL; CATCH(any_exception_error) { if (d) Polyhedron_Free(d); RETHROW(); } TRY { if (!Pol || !Func) { UNCATCH(any_exception_error); return (Polyhedron *) 0; } d = (Polyhedron *) 0; for (p=Pol; p; p=p->next) { q = Polyhedron_Image(p, Func, NbMaxConstrs); d = AddPolyToDomain (q, d); } } /* end of TRY */ UNCATCH(any_exception_error); return d; } /* DomainImage */ /* * Given a polyhedron 'Pol' and an affine cost function 'Cost', compute the * maximum and minimum value of the function over set of points representing * polyhedron. * Note: If Polyhedron 'Pol' is empty, then there is no feasible solution. * Otherwise, if there is a bidirectional ray with Sum[cost(i)*ray(i)] != 0 or * a unidirectional ray with Sum[cost(i)*ray(i)] >0, then the maximum is un- * bounded else the finite optimal solution occurs at one of the vertices of * the polyhderon. */ Interval *DomainCost(Polyhedron *Pol,Value *Cost) { int i, j, NbRay, Dim; Value *p1, *p2, p3, d, status; Value tmp1, tmp2, tmp3; Value **Ray; Interval *I = NULL; value_init(p3); value_init(d); value_init(status); value_init(tmp1); value_init(tmp2); value_init(tmp3); POL_ENSURE_FACETS(Pol); POL_ENSURE_VERTICES(Pol); CATCH(any_exception_error) { if (I) free(I); RETHROW(); value_clear(p3); value_clear(d); value_clear(status); value_clear(tmp1); value_clear(tmp2); value_clear(tmp3); } TRY { Ray = Pol->Ray; NbRay = Pol->NbRays; Dim = Pol->Dimension+1; /* Homogenous Dimension */ I = (Interval *) malloc (sizeof(Interval)); if (!I) { errormsg1("DomainCost", "outofmem", "out of memory space\n"); UNCATCH(any_exception_error); value_clear(p3); value_clear(d); value_clear(status); value_clear(tmp1); value_clear(tmp2); value_clear(tmp3); return 0; } /* The maximum and minimum values of the cost function over polyhedral */ /* domain is stored in 'I'. I->MaxN and I->MaxD store the numerator and */ /* denominator of the maximum value. Likewise,I->MinN and I->MinD store */ /* the numerator and denominator of the minimum value. I->MaxI and */ /* I->MinI store the ray indices corresponding to the max and min values*/ /* of the function. */ value_set_si(I->MaxN,-1); value_set_si(I->MaxD,0); /* Actual cost is MaxN/MaxD */ I->MaxI = -1; value_set_si(I->MinN,1); value_set_si(I->MinD,0); I->MinI = -1; /* Compute the cost of each ray[i] */ for (i=0; iMaxD); value_multiply(tmp2,I->MaxN,d); value_set_si(tmp3,1); /* Compare p3/d with MaxN/MaxD to assign new maximum cost value */ if (I->MaxI==-1 || value_gt(tmp1,tmp2) || (value_eq(tmp1,tmp2) && value_eq(d,tmp3) && value_ne(I->MaxD,tmp3))) { value_assign(I->MaxN,p3); value_assign(I->MaxD,d); I->MaxI = i; } value_multiply(tmp1,p3,I->MinD); value_multiply(tmp2,I->MinN,d); value_set_si(tmp3,1); /* Compare p3/d with MinN/MinD to assign new minimum cost value */ if (I->MinI==-1 || value_lt(tmp1,tmp2) || (value_eq(tmp1,tmp2) && value_eq(d,tmp3) && value_ne(I->MinD,tmp3))) { value_assign(I->MinN, p3); value_assign(I->MinD, d); I->MinI = i; } value_multiply(tmp1,p3,I->MaxD); value_set_si(tmp2,0); /* If there is a line, assign max to +infinity and min to -infinity */ if (value_zero_p(status)) { /* line , d is 0 */ if (value_lt(tmp1,tmp2)) { value_oppose(I->MaxN,p3); value_set_si(I->MaxD,0); I->MaxI = i; } value_multiply(tmp1,p3,I->MinD); value_set_si(tmp2,0); if (value_gt(tmp1,tmp2)) { value_oppose(I->MinN,p3); value_set_si(I->MinD,0); I->MinI = i; } } } } /* end of TRY */ UNCATCH(any_exception_error); value_clear(p3); value_clear(d); value_clear(status); value_clear(tmp1); value_clear(tmp2); value_clear(tmp3); return I; } /* DomainCost */ /* * Add constraints pointed by 'Mat' to each and every polyhedron in the * polyhedral domain 'Pol'. 'NbMaxRays' is maximum allowed rays in the ray * matrix of a polyhedron. */ Polyhedron *DomainAddConstraints(Polyhedron *Pol,Matrix *Mat,unsigned NbMaxRays) { Polyhedron *PolA, *PolEndA, *p1, *p2, *p3; int Redundant; if (!Pol) return (Polyhedron*) 0; if (!Mat) return Pol; if (Pol->Dimension != Mat->NbColumns-2) { errormsg1("DomainAddConstraints", "diffdim", "operation on different dimensions"); return (Polyhedron*) 0; } /* Copy 'Pol' to 'PolA' */ PolA = PolEndA = (Polyhedron *)0; for (p1=Pol; p1; p1=p1->next) { p3 = AddConstraints(Mat->p_Init, Mat->NbRows, p1, NbMaxRays); /* Does any component of 'PolA' cover 'p3' */ Redundant = 0; for (p2=PolA; p2; p2=p2->next) { if (PolyhedronIncludes(p2, p3)) { /* 'p2' covers 'p3' */ Redundant = 1; break; } } /* If the new polyhedron 'p3' is not redundant, add it to the domain */ if (Redundant) Polyhedron_Free(p3); else { if (!PolEndA) PolEndA = PolA = p3; else { PolEndA->next = p3; PolEndA = PolEndA->next; } } } return PolA; } /* DomainAddConstraints */ /* * Computes the disjoint union of a union of polyhedra. * If flag = 0 the result is such that there are no intersections * between the resulting polyhedra, * if flag = 1 it computes a joint union, the resulting polyhedra are * adjacent (they have their facets in common). * * WARNING: if all polyhedra are not of same geometrical dimension * duplicates may appear. */ Polyhedron *Disjoint_Domain( Polyhedron *P, int flag, unsigned NbMaxRays ) { Polyhedron *lP, *tmp, *Result, *lR, *prec, *reste; Polyhedron *p1, *p2, *p3, *Pol1, *dx, *d1, *d2, *pi, *newpi; int i; if( flag!=0 && flag!=1 ) { errormsg1("Disjoint_Domain", "invalidarg", "flag should be equal to 0 or 1"); return (Polyhedron*) 0; } if(!P) return (Polyhedron*) 0; if(!P->next) return Polyhedron_Copy(P); Result = (Polyhedron *)0; for(lP=P;lP;lP=lP->next) { reste = Polyhedron_Copy(lP); prec = (Polyhedron *)0; /* preceeding lR */ /* Intersection with each polyhedron of the current Result */ lR=Result; while( lR && reste ) { /* dx = DomainIntersection(reste,lR->P,WS); */ dx = (Polyhedron *)0; for( p1=reste; p1; p1=p1->next ) { p3 = AddConstraints(lR->Constraint[0], lR->NbConstraints, p1, NbMaxRays); dx = AddPolyToDomain(p3,dx); } /* if empty intersection, continue */ if(!dx) { prec = lR; lR=lR->next; continue; } if (emptyQ(dx)) { Domain_Free(dx); prec = lR; lR=lR->next; continue; } /* intersection is not empty, we need to compute the differences */ /* between the intersection and the two polyhedra, such that the */ /* results are disjoint unions (according to flag) */ /* d1 = reste \ P = DomainDifference(reste,lR->P,WS); */ /* d2 = P \ reste = DomainDifference(lR->P,reste,WS); */ /* compute d1 */ d1 = (Polyhedron *)0; for (p1=reste; p1; p1=p1->next) { pi = p1; for (i=0; iNbConstraints && pi ; i++) { /* Add the constraint ( -P->constraint[i] [-1 if flag=0]) >= 0 in 'p1' */ /* and create the new polyhedron 'p3'. */ p3 = SubConstraint(P->Constraint[i], pi, NbMaxRays,2*flag); /* Add 'p3' in the new domain 'd1' */ d1 = AddPolyToDomain (p3, d1); /* If the constraint P->constraint[i][0] is an equality, then add */ /* the constraint ( +P->constraint[i] [-1 if flag=0]) >= 0 in 'pi' */ /* and create the new polyhedron 'p3'. */ if( value_zero_p(P->Constraint[i][0]) ) /* Inequality */ { p3 = SubConstraint(P->Constraint[i], pi, NbMaxRays,1+2*flag); /* Add 'p3' in the new domain 'd1' */ d1 = AddPolyToDomain (p3, d1); /* newpi : add constraint P->constraint[i]==0 to pi */ newpi = AddConstraints( P->Constraint[i], 1, pi, NbMaxRays); } else { /* newpi : add constraint +P->constraint[i] >= 0 in pi */ newpi = SubConstraint(P->Constraint[i], pi, NbMaxRays,3); } if( newpi && emptyQ( newpi ) ) { Domain_Free( newpi ); newpi = (Polyhedron *)0; } if( pi != p1 ) Domain_Free( pi ); pi = newpi; } if( pi != p1 ) Domain_Free( pi ); } /* and now d2 */ Pol1 = Polyhedron_Copy( lR ); for (p2=reste; p2; p2=p2->next) { d2 = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { pi = p1; for (i=0; iNbConstraints && pi ; i++) { /* Add the constraint ( -p2->constraint[i] [-1 if flag=0]) >= 0 in 'pi' */ /* and create the new polyhedron 'p3'. */ p3 = SubConstraint(p2->Constraint[i], pi, NbMaxRays,2*flag); /* Add 'p3' in the new domain 'd2' */ d2 = AddPolyToDomain (p3, d2); /* If the constraint p2->constraint[i][0] is an equality, then add */ /* the constraint ( +p2->constraint[i] [-1 if flag=0]) >= 0 in 'pi' */ /* and create the new polyhedron 'p3'. */ if( value_zero_p(p2->Constraint[i][0]) ) /* Inequality */ { p3 = SubConstraint(p2->Constraint[i], pi, NbMaxRays,1+2*flag); /* Add 'p3' in the new domain 'd2' */ d2 = AddPolyToDomain (p3, d2); /* newpi : add constraint p2->constraint[i]==0 to pi */ newpi = AddConstraints( p2->Constraint[i], 1, pi, NbMaxRays); } else { /* newpi : add constraint +p2->constraint[i] >= 0 in pi */ newpi = SubConstraint(p2->Constraint[i], pi, NbMaxRays,3); } if( newpi && emptyQ( newpi ) ) { Domain_Free( newpi ); newpi = (Polyhedron *)0; } if( pi != p1 ) Domain_Free( pi ); pi = newpi; } if( pi && pi!=p1 ) Domain_Free( pi ); } if( Pol1 ) Domain_Free( Pol1 ); Pol1 = d2; } /* ok, d1 and d2 are computed */ /* now, replace lR by d2+dx (at least dx is nonempty) and set reste to d1 */ if( d1 && emptyQ(d1) ) { Domain_Free( d1 ); d1 = NULL; } if( d2 && emptyQ(d2) ) { Domain_Free( d2 ); d2 = NULL; } /* set reste */ Domain_Free( reste ); reste = d1; /* add d2 at beginning of Result */ if( d2 ) { for( tmp=d2 ; tmp->next ; tmp=tmp->next ) ; tmp->next = Result; Result = d2; if( !prec ) prec = tmp; } /* add dx at beginning of Result */ for( tmp=dx ; tmp->next ; tmp=tmp->next ) ; tmp->next = Result; Result = dx; if( !prec ) prec = tmp; /* suppress current lR */ if( !prec ) errormsg1( "Disjoint_Domain","internalerror","internal error"); prec->next = lR->next; Polyhedron_Free( lR ); lR = prec->next; } /* end for result */ /* if there is something left, add it to Result : */ if(reste) { if(emptyQ(reste)) { Domain_Free( reste ); reste = NULL; } else { Polyhedron *tnext; for( tmp=reste ; tmp ; tmp=tnext ) { tnext = tmp->next; tmp->next = NULL; Result = AddPolyToDomain(tmp, Result); } } } } return( Result ); } /* Procedure to print constraint matrix of a polyhedron */ void Polyhedron_PrintConstraints(FILE *Dst, const char *Format, Polyhedron *Pol) { int i,j; fprintf( Dst, "%d %d\n", Pol->NbConstraints, Pol->Dimension+2 ); for( i=0 ; iNbConstraints ; i++ ) { for( j=0 ; jDimension+2 ; j++ ) value_print( Dst, Format, Pol->Constraint[i][j] ); fprintf( Dst, "\n" ); } } /* Procedure to print constraint matrix of a domain */ void Domain_PrintConstraints(FILE *Dst, const char *Format, Polyhedron *Pol) { Polyhedron *Q; for (Q = Pol; Q; Q = Q->next) Polyhedron_PrintConstraints(Dst, Format, Q); } static Polyhedron *p_simplify_constraints(Polyhedron *P, Vector *row, Value *g, unsigned MaxRays) { Polyhedron *T, *R = P; int len = P->Dimension+2; int r; /* Also look at equalities. * If an equality can be "simplified" then there * are no integer solutions and we return an empty polyhedron */ for (r = 0; r < R->NbConstraints; ++r) { if (ConstraintSimplify(R->Constraint[r], row->p, len, g)) { T = R; if (value_zero_p(R->Constraint[r][0])) { R = Empty_Polyhedron(R->Dimension); r = R->NbConstraints; } else if (POL_ISSET(MaxRays, POL_NO_DUAL)) { R = Polyhedron_Copy(R); F_CLR(R, POL_FACETS | POL_VERTICES | POL_POINTS); Vector_Copy(row->p+1, R->Constraint[r]+1, R->Dimension+1); } else { R = AddConstraints(row->p, 1, R, MaxRays); r = -1; } if (T != P) Polyhedron_Free(T); } } if (R != P) Polyhedron_Free(P); return R; } /* * Replaces constraint a x >= c by x >= ceil(c/a) * where "a" is a common factor in the coefficients * Destroys P and returns a newly allocated Polyhedron * or just returns P in case no changes were made */ Polyhedron *DomainConstraintSimplify(Polyhedron *P, unsigned MaxRays) { Polyhedron **prev; int len = P->Dimension+2; Vector *row = Vector_Alloc(len); Value g; Polyhedron *R = P, *N; value_set_si(row->p[0], 1); value_init(g); for (prev = &R; P; P = N) { Polyhedron *T; N = P->next; T = p_simplify_constraints(P, row, &g, MaxRays); if (emptyQ(T) && prev != &R) { Polyhedron_Free(T); *prev = NULL; continue; } if (T != P) T->next = N; *prev = T; prev = &T->next; } if (R->next && emptyQ(R)) { N = R->next; Polyhedron_Free(R); R = N; } value_clear(g); Vector_Free(row); return R; } polylib-5.22.5.orig/source/kernel/SolveDio.c0000644000175000017500000002433111341227527021557 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include static void RearrangeMatforSolveDio(Matrix *M); /* * Solve Diophantine Equations : * This function takes as input a system of equations in the form * Ax + C = 0 and finds the solution for it, if it exists * * Input : The matrix form the system of the equations Ax + C = 0 * ( a pointer to a Matrix. ) * A pointer to the pointer, where the matrix U * corresponding to the free variables of the equation * is stored. * A pointer to the pointer of a vector is a solution to T. * * * Output : The above matrix U and the vector T. * * Algorithm : * Given an integral matrix A, we can split it such that * A = HU, where H is in HNF (lowr triangular) * and U is unimodular. * So Ax = c -> HUx = c -> Ht = c ( where Ux = t). * Solving for Ht = c is easy. * Using 't' we find x = U(inverse) * t. * * Steps : * 1) For the above algorithm to work correctly to * need the condition that the first 'rank' rows are * the rows which contribute to the rank of the matrix. * So first we copy Input into a matrix 'A' and * rearrange the rows of A (if required) such that * the first rank rows contribute to the rank. * 2) Extract A and C from the matrix 'A'. A = n * l matrix. * 3) Find the Hermite normal form of the matrix A. * ( the matrices the lower tri. H and the unimod U). * 4) Using H, find the values of T one by one. * Here we use a sort of Gaussian elimination to find * the solution. You have a lower triangular matrix * and a vector, * [ [a11, 0], [a21, a22, 0] ...,[arank1...a rankrank 0]] * and the solution vector [t1.. tn] and the vector * [ c1, c2 .. cl], now as we are traversing down the * rows one by one, we will have all the information * needed to calculate the next 't'. * * That is to say, when you want to calculate t2, * you would have already calculated the value of t1 * and similarly if you are calculating t3, you will * need t1 and t2 which will be available by that time. * So, we apply a sort of Gaussian Elimination inorder * to find the vector T. * * 5) After finding t_rank, the remaining (l-rank) t's are * made equal to zero, and we verify, if these values * agree with the remaining (n-rank) rows of A. * * 6) If a solution exists, find the values of X using * U (inverse) * T. */ int SolveDiophantine(Matrix *M, Matrix **U, Vector **X) { int i, j, k1, k2, min, rank; Matrix *A, *temp, *hermi, *unimod, *unimodinv ; Value *C; /* temp storage for the vector C */ Value *T; /* storage for the vector t */ Value sum, tmp; #ifdef DOMDEBUG FILE *fp; fp = fopen("_debug", "a"); fprintf(fp,"\nEntered SOLVEDIOPHANTINE\n"); fclose(fp); #endif value_init(sum); value_init(tmp); /* Ensuring that the first rank row of A contribute to the rank*/ A = Matrix_Copy(M); RearrangeMatforSolveDio(A); temp = Matrix_Alloc(A->NbRows-1, A->NbColumns-1); /* Copying A into temp, ignoring the Homogeneous part */ for (i = 0; i < A->NbRows -1; i++) for (j = 0; j < A->NbColumns-1; j++) value_assign(temp->p[i][j],A->p[i][j]); /* Copying C into a temp, ignoring the Homogeneous part */ C = (Value *) malloc (sizeof(Value) * (A->NbRows-1)); k1 = A->NbRows-1; for (i = 0; i < k1; i++) { value_init(C[i]); value_oppose(C[i],A->p[i][A->NbColumns-1]); } Matrix_Free (A); /* Finding the HNF of temp */ Hermite(temp, &hermi, &unimod); /* Testing for existence of a Solution */ min=(hermi->NbRows <= hermi->NbColumns ) ? hermi->NbRows : hermi->NbColumns ; rank = 0; for (i = 0; i < min ; i++) { if (value_notzero_p(hermi->p[i][i])) rank ++; else break ; } /* Solving the Equation using Gaussian Elimination*/ T = (Value *) malloc(sizeof(Value) * temp->NbColumns); k2 = temp->NbColumns; for(i=0;i< k2; i++) value_init(T[i]); for (i = 0; i < rank ; i++) { value_set_si(sum,0); for (j = 0; j < i; j++) { value_addmul(sum, T[j], hermi->p[i][j]); } value_subtract(tmp,C[i],sum); value_modulus(tmp,tmp,hermi->p[i][i]); if (value_notzero_p(tmp)) { /* no solution to the equation */ *U = Matrix_Alloc(0,0); *X = Vector_Alloc (0); value_clear(sum); value_clear(tmp); for (i = 0; i < k1; i++) value_clear(C[i]); for (i = 0; i < k2; i++) value_clear(T[i]); free(C); free(T); return (-1); }; value_subtract(tmp,C[i],sum); value_division(T[i],tmp,hermi->p[i][i]); } /** Case when rank < Number of Columns; **/ for (i = rank; i < hermi->NbColumns; i++) value_set_si(T[i],0); /** Solved the equtions **/ /** When rank < hermi->NbRows; Verifying whether the solution agrees with the remaining n-rank rows as well. **/ for (i = rank; i < hermi->NbRows; i++) { value_set_si(sum,0); for (j = 0; j < hermi->NbColumns; j++) { value_addmul(sum, T[j], hermi->p[i][j]); } if (value_ne(sum,C[i])) { *U = Matrix_Alloc(0,0); *X = Vector_Alloc (0); value_clear(sum); value_clear(tmp); for (i = 0; i < k1; i++) value_clear(C[i]); for (i = 0; i < k2; i++) value_clear(T[i]); free(C); free(T); return (-1); } } unimodinv = Matrix_Alloc(unimod->NbRows, unimod->NbColumns); Matrix_Inverse(unimod, unimodinv); Matrix_Free(unimod); *X = Vector_Alloc(M->NbColumns-1); if (rank == hermi->NbColumns) *U = Matrix_Alloc(0,0); else { /* Extracting the General solution form U(inverse) */ *U = Matrix_Alloc(hermi->NbColumns, hermi->NbColumns-rank); for (i = 0; i < U[0]->NbRows; i++) for (j = 0; j < U[0]->NbColumns; j++) value_assign(U[0]->p[i][j],unimodinv->p[i][j+rank]); } for (i = 0; i < unimodinv->NbRows; i++) { /* Calculating the vector X = Uinv * T */ value_set_si(sum,0); for (j = 0; j < unimodinv->NbColumns; j++) { value_addmul(sum, unimodinv->p[i][j], T[j]); } value_assign(X[0]->p[i],sum); } /* for (i = rank; i < A->NbColumns; i ++) X[0]->p[i] = 0; */ Matrix_Free (unimodinv); Matrix_Free (hermi); Matrix_Free (temp); value_clear(sum); value_clear(tmp); for (i = 0; i < k1; i++) value_clear(C[i]); for (i = 0; i < k2; i++) value_clear(T[i]); free(C); free(T); return (rank); } /* SolveDiophantine */ /* * Rearrange : * This function takes as input a matrix M (pointer to it) * and it returns the tranformed matrix M, such that the first * 'rank' rows of the new matrix M are the ones which contribute * to the rank of the matrix M. * * 1) For a start we try to put all the zero rows at the end. * 2) Then cur = 1st row of the remaining matrix. * 3) nextrow = 2ndrow of M. * 4) temp = cur + nextrow * 5) If (rank(temp) == temp->NbRows.) {cur = temp;nextrow ++} * 6) Else (Exchange the nextrow of M with the currentlastrow. * and currentlastrow --). * 7) Repeat steps 4,5,6 till it is no longer possible. * */ static void RearrangeMatforSolveDio(Matrix *M) { int i, j, curend, curRow, min, rank=1; Bool add = True; Matrix *A, *L, *H, *U; /* Though I could have used the Lattice function Extract Linear Part, I chose not to use it so that this function can be independent of Lattice Operations */ L = Matrix_Alloc(M->NbRows-1,M->NbColumns-1); for (i = 0; i < L->NbRows; i++) for (j = 0; j < L->NbColumns; j++) value_assign(L->p[i][j],M->p[i][j]); /* Putting the zero rows at the end */ curend = L->NbRows-1; for (i = 0; i < curend; i++) { for (j = 0; j < L->NbColumns; j++) if (value_notzero_p(L->p[i][j])) break; if (j == L->NbColumns) { ExchangeRows(M,i,curend); curend --; } } /* Trying to put the redundant rows at the end */ if (curend > 0) { /* there are some useful rows */ Matrix *temp; A = Matrix_Alloc(1, L->NbColumns); for (i = 0; i NbColumns; i++) value_assign(A->p[0][i],L->p[0][i]); curRow = 1; while (add == True ) { temp= AddANullRow(A); for (i = 0;i NbColumns; i++) value_assign(temp->p[curRow][i],L->p[curRow][i]); Hermite(temp, &H, &U); for (i = 0; i < H->NbRows; i++) if (value_zero_p(H->p[i][i])) break; if (i != H->NbRows) { ExchangeRows(M, curRow, curend); curend --; } else { curRow ++; rank ++; Matrix_Free (A); A = Matrix_Copy (temp); Matrix_Free (temp); } Matrix_Free (H); Matrix_Free (U); min = (curend >= L->NbColumns) ? L->NbColumns : curend ; if (rank==min || curRow >= curend) break; } Matrix_Free (A); } Matrix_Free (L); return; } /* RearrangeMatforSolveDio */ polylib-5.22.5.orig/source/kernel/vector.c0000644000175000017500000004044611341227527021342 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* vector.c COPYRIGHT Both this software and its documentation are Copyrighted 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #include #include #include #ifdef MAC_OS #define abs __abs #endif /* * Compute n! */ void Factorial(int n, Value *fact) { int i; Value tmp; value_init(tmp); value_set_si(*fact,1); for (i=1;i<=n;i++) { value_set_si(tmp,i); value_multiply(*fact,*fact,tmp); } value_clear(tmp); } /* Factorial */ /* * Compute n!/(p!(n-p)!) */ void Binomial(int n, int p, Value *result) { int i; Value tmp; Value f; value_init(tmp);value_init(f); if (n-pb;--i) { value_set_si(tmp,i); value_multiply(*result,*result,tmp); } for(i=1;i<=(a-b);++i) { value_set_si(tmp,i); value_division(*result,*result,tmp); } value_clear(tmp); } /* CNP */ /* * Compute GCD of 'a' and 'b' */ void Gcd(Value a,Value b,Value *result) { Value acopy, bcopy; value_init(acopy); value_init(bcopy); value_assign(acopy,a); value_assign(bcopy,b); while(value_notzero_p(acopy)) { value_modulus(*result,bcopy,acopy); value_assign(bcopy,acopy); value_assign(acopy,*result); } value_absolute(*result,bcopy); value_clear(acopy); value_clear(bcopy); } /* Gcd */ /* * Return the smallest component index in 'p' whose value is non-zero */ int First_Non_Zero(Value *p,unsigned length) { Value *cp; int i; cp = p; for (i=0;iSize=length; vector->p=(Value *)malloc(length * sizeof(Value)); if (!vector->p) { errormsg1("Vector_Alloc", "outofmem", "out of memory space"); free(vector); return 0; } for(i=0;ip[i]); return vector; } /* Vector_Alloc */ /* * Free the memory space occupied by Vector */ void Vector_Free(Vector *vector) { int i; if (!vector) return; for(i=0;iSize;i++) value_clear(vector->p[i]); free(vector->p); free(vector); } /* Vector_Free */ /* * Print the contents of a Vector */ void Vector_Print(FILE *Dst, const char *Format, Vector *vector) { int i; Value *p; unsigned length; fprintf(Dst, "%d\n", length=vector->Size); p = vector->p; for (i=0;ip; for (i=0;i=0;i--) { /* Phase 1 : build the heap */ j=i; value_assign(temp,*(vector+i)); /* While not a leaf */ while (j<=(n-1)/2) { current_node = vector+j; left_son = vector+(j<<1)+1; /* If only one son */ if ((j<<1)+2>=n) { if (value_lt(temp,*left_son)) { value_assign(*current_node,*left_son); j=(j<<1)+1; } else break; } else { /* If two sons */ right_son=left_son+1; if (value_lt(*right_son,*left_son)) { if (value_lt(temp,*left_son)) { value_assign(*current_node,*left_son); j=(j<<1)+1; } else break; } else { if (value_lt(temp,*right_son)) { value_assign(*current_node,*right_son ); j=(j<<1)+2; } else break; } } } value_assign(*current_node,temp); } for(i=n-1;i>0;i--) { /* Phase 2 : sort the heap */ value_assign(temp, *(vector+i)); value_assign(*(vector+i),*vector); j=0; /* While not a leaf */ while (j=i) { if (value_lt(temp,*left_son)) { value_assign(*current_node,*left_son); j=(j<<1)+1; } else break; } else { /* If two sons */ right_son=left_son+1; if (value_lt(*right_son,*left_son)) { if (value_lt(temp,*left_son)) { value_assign(*current_node,*left_son); j=(j<<1)+1; } else break; } else { if (value_lt(temp,*right_son)) { value_assign(*current_node,*right_son ); j=(j<<1)+2; } else break; } } } value_assign(*current_node,temp); } value_clear(temp); return; } /* Vector_Sort */ /* * Replaces constraint a x >= c by x >= ceil(c/a) * where "a" is a common factor in the coefficients * old is the constraint; v points to an initialized * value that this procedure can use. * Return non-zero if something changed. * Result is placed in newp. */ int ConstraintSimplify(Value *old, Value *newp, int len, Value* v) { /* first remove common factor of all coefficients (including "c") */ Vector_Gcd(old+1, len - 1, v); if (value_notone_p(*v)) Vector_AntiScale(old+1, newp+1, *v, len-1); Vector_Gcd(old+1, len - 2, v); if (value_one_p(*v)) return 0; Vector_AntiScale(old+1, newp+1, *v, len-2); value_pdivision(newp[len-1], old[len-1], *v); return 1; } int Vector_IsZero(Value * v, unsigned length) { unsigned i; if (value_notzero_p(v[0])) return 0; else { value_set_si(v[0], 1); for (i=length-1; value_zero_p(v[i]); i--); value_set_si(v[0], 0); return (i==0); } } #define MAX_CACHE_SIZE 20 static struct { Value *p; int size; } cache[MAX_CACHE_SIZE]; static int cache_size = 0; Value* value_alloc(int want, int *got) { int i; Value *p; if (cache_size) { int best; for (i = 0; i < cache_size; ++i) { if (cache[i].size >= want) { Value *p = cache[i].p; *got = cache[i].size; if (--cache_size != i) cache[i] = cache[cache_size]; Vector_Set(p, 0, want); return p; } if (i == 0) best = 0; else if (cache[i].size > cache[best].size) best = i; } p = (Value *)realloc(cache[best].p, want * sizeof(Value)); *got = cache[best].size; if (--cache_size != best) cache[best] = cache[cache_size]; Vector_Set(p, 0, *got); } else { p = (Value *)malloc(want * sizeof(Value)); *got = 0; } if (!p) return p; for (i = *got; i < want; ++i) value_init(p[i]); *got = want; return p; } void value_free(Value *p, int size) { int i; if (cache_size < MAX_CACHE_SIZE) { cache[cache_size].p = p; cache[cache_size].size = size; ++cache_size; return; } for (i=0; i < size; i++) value_clear(p[i]); free(p); } polylib-5.22.5.orig/source/kernel/Matop.c0000644000175000017500000002446611341227527021124 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include /* computes c = lcm(a,b) using Gcd(a,b,&c) */ void Lcm3(Value a, Value b, Value *c) { Value tmp; if (value_zero_p(a)) { value_assign(*c, b); return; } if (value_zero_p(b)) { value_assign(*c, a); return; } value_init(tmp); value_multiply(tmp, a, b); value_absolute(tmp, tmp); Gcd(a,b,c); value_division(*c, tmp, *c); value_clear(tmp); } /* * Return the lcm of 'i' and 'j' */ Value *Lcm (Value i, Value j) { Value *tmp; tmp = (Value *) malloc (sizeof(Value)); value_init(*tmp); Lcm3(i, j, tmp); return tmp; } /* Lcm */ /* * Return an identity matrix of size 'size'. */ Matrix *Identity(unsigned size) { unsigned i; Matrix *A; A = Matrix_Alloc(size, size); for (i = 0; i < size; i++) value_set_si(A->p[i][i], 1); return A; } /* Identity */ /* * Exchange the rows 'Row1' and 'Row2' of the matrix 'M' */ void ExchangeRows(Matrix *M, int Row1, int Row2) { int i; Value temp; value_init(temp); for (i = 0; i < (int)M->NbColumns; i++) { value_assign(temp,M->p[Row1][i]); value_assign(M->p[Row1][i],M->p[Row2][i]); value_assign(M->p[Row2][i],temp); } value_clear(temp); return ; } /* ExchangeRows */ /* * Exchange the columns 'Column1' and 'Column2' of the matrix 'M' */ void ExchangeColumns(Matrix *M, int Column1, int Column2) { int i; for (i = 0; i < M->NbRows; i++) value_swap(M->p[i][Column1],M->p[i][Column2]); return; } /* ExchangeColumns */ /* * Return the Transpose of a matrix 'A' */ Matrix *Transpose (Matrix *A) { int i,j; Matrix *transpose; transpose = Matrix_Alloc (A->NbColumns, A->NbRows); for (i = 0; i < (int)A->NbRows; i++) for (j = 0; j < (int)A->NbColumns; j++) value_assign(transpose->p[j][i],A->p[i][j]); return transpose; } /* Transpose */ /* * Return a copy of the contents of a matrix 'Src'. */ Matrix *Matrix_Copy(Matrix const *Src ) { Matrix *Dst; unsigned i, j; Dst = Matrix_Alloc(Src->NbRows, Src->NbColumns); for (i = 0; i < Src->NbRows; i++) for (j = 0; j < Src->NbColumns; j++) value_assign(Dst->p[i][j],Src->p[i][j]); return Dst; } /* Matrix_copy */ /* * Test if the input matrix is integral or not. */ Bool isIntegral (Matrix *A) { unsigned i, j; Value divisor, tmp; value_init(divisor); value_init(tmp); value_assign(divisor,A->p[A->NbRows-1][A->NbColumns-1]); for (i = 0; i < A->NbRows ; i++) for (j = 0; j < A->NbColumns ; j++) { value_modulus(tmp,A->p[i][j],divisor); if (value_notzero_p(tmp)) { value_clear(divisor); value_clear(tmp); return False; } } value_clear(divisor); value_clear(tmp); return True ; } /* isIntegral */ /* * Check if the matrix 'A' is in Hermite normal form or not. */ Bool isinHnf(Matrix *A) { Matrix *temp ; unsigned i, j ; Value rem; value_init(rem); temp = Homogenise(A,True) ; for (i = 0; i < temp->NbRows; i++) { value_assign(rem,temp->p[i][i]); for (j = 0; j < i ; j++) if (value_ge(temp->p[i][j],rem)) { Matrix_Free(temp); value_clear(rem); return False ; } for (j = i+1; j < temp->NbColumns ; j++) if (value_notzero_p(temp->p[i][j])) { Matrix_Free(temp); value_clear(rem); return False ; } } Matrix_Free(temp); value_clear(rem); return True ; } /* isinHnf */ /* * Remove the row 'Rownumber' and place it at the end of the matrix 'X' */ void PutRowLast (Matrix *X, int Rownumber) { int i, j ; Value temp; if (Rownumber == X->NbRows-1) return; value_init(temp); for (j = 0; j < X->NbColumns; j++) { value_assign(temp,X->p[Rownumber][j]); for (i = Rownumber; i < X->NbRows-1; i++) value_assign(X->p[i][j],X->p[i+1][j]); value_assign(X->p[i][j],temp); } value_clear(temp); return; } /* PutRowLast */ /* * Remove the row 'Rownumber' and place it at the begining of the matrix 'X' */ void PutRowFirst(Matrix *X, int Rownumber) { int i, j ; Value temp; value_init(temp); for (j = 0; j < X->NbColumns; j++) { value_assign(temp,X->p[Rownumber][j]); for (i = Rownumber; i > 0; i--) value_assign(X->p[i][j],X->p[i-1][j]); value_assign(X->p[i][j],temp); } value_clear(temp); return; } /* PutRowFirst */ /* * Remove the column 'Columnnumber' and place it at the begining of the matrix * 'X' */ void PutColumnFirst (Matrix *X, int Columnnumber) { int i, j ; Value temp; value_init(temp); for (i = 0; i < X->NbRows; i ++) { value_assign(temp,X->p[i][Columnnumber]); for (j = Columnnumber; j > 0; j --) value_assign(X->p[i][j],X->p[i][j-1]); value_assign(X->p[i][0],temp); } value_clear(temp); return ; } /* PutColumnFirst */ /* * Remove the column 'Columnnumber' and place it at the end of the matrix 'X' */ void PutColumnLast (Matrix *X, int Columnnumber) { int i, j ; Value temp; value_init(temp); for (i = 0; i < X->NbRows; i++) { value_assign(temp,X->p[i][Columnnumber]); for (j = Columnnumber; j < X->NbColumns-1; j++) value_assign(X->p[i][j],X->p[i][j+1]); value_assign(X->p[i][X->NbColumns-1],temp); } value_clear(temp); return ; } /* PutColumnLast */ /* * Add a row of zeros at the end of the matrix 'M' and return the new matrix */ Matrix *AddANullRow (Matrix *M) { int i,j; Matrix *Result; Result = Matrix_Alloc(M->NbRows+1,M->NbColumns); for (i = 0;i < M->NbRows; i++) for (j = 0; j < M->NbColumns ; j++) value_assign(Result->p[i][j],M->p[i][j]); for (j = 0; j < M->NbColumns; j++) value_set_si(Result->p[i][j],0); return Result; } /* AddANullRow */ /* * Add a column of zeros at the end of the matrix 'M' and return the new * matrix */ Matrix *AddANullColumn(Matrix *M) { int i,j; Matrix *Result; Result = Matrix_Alloc(M->NbRows, M->NbColumns+1); for (i = 0;i < M->NbRows; i++) for (j = 0; j < M->NbColumns ; j++) value_assign(Result->p[i][j],M->p[i][j]); for (i = 0; i < M->NbRows; i++) value_set_si(Result->p[i][M->NbColumns],0); return Result; } /* AddANullColumn */ /* * Remove a row 'Rownumber' from matrix 'M' and return the new matrix. */ Matrix *RemoveRow(Matrix *M, int Rownumber) { Matrix *Result; int i; Result = Matrix_Alloc(M->NbRows-1, M->NbColumns); for (i = 0; i < Rownumber; i++) Vector_Copy(M->p[i], Result->p[i], M->NbColumns); for ( ; i < Result->NbRows; i++) Vector_Copy(M->p[i+1], Result->p[i], M->NbColumns); return Result; } /* RemoveRow */ /* * Remove NumColumns columns starting at column number 'FirstColumnnumber' from matrix 'M' * and return the new matrix. */ Matrix *RemoveNColumns (Matrix *M, int FirstColumnnumber, int NumColumns) { Matrix *Result; int i; Result = Matrix_Alloc (M->NbRows, M->NbColumns-NumColumns); for (i = 0; i < Result->NbRows; i++) { Vector_Copy(M->p[i], Result->p[i], FirstColumnnumber); Vector_Copy(M->p[i]+FirstColumnnumber+NumColumns, Result->p[i]+FirstColumnnumber, M->NbColumns-NumColumns-FirstColumnnumber); } return Result; } /* RemoveColumn */ /* * Remove a column 'Columnnumber' from matrix 'M' and return the new matrix. */ Matrix *RemoveColumn (Matrix *M, int Columnnumber) { Matrix *Result; int i; Result = Matrix_Alloc (M->NbRows, M->NbColumns-1); for (i = 0; i < Result->NbRows; i++) { Vector_Copy(M->p[i], Result->p[i], Columnnumber); Vector_Copy(M->p[i]+Columnnumber+1, Result->p[i]+Columnnumber, M->NbColumns-1-Columnnumber); } return Result; } /* RemoveColumn */ /* * Given a Matrix M of dimesnion n * l and rank l1, find a unimodular matrix * 'Result' such that the Vector Space spanned by M is the subset of the vector * Space spanned by the first l1 Rows of Result. The function returns the rank * l1 and the Matrix Result. */ int findHermiteBasis(Matrix *M, Matrix **Result) { int i, j; Matrix *C, *curMat, *temp1, *temp2; Matrix *H, *U; Vector *V; int dim, curDim, curVect,rank; if (M->NbRows == 0) { Result[0] = Identity (M->NbColumns); return 0; } if (M->NbRows <= M->NbColumns) { Hermite(M, &H, &U); for (i = 0; i < H->NbRows; i++) if (value_zero_p(H->p[i][i])) break; if (i == H->NbRows) { Result[0] = Transpose(U); Matrix_Free(H); Matrix_Free(U); return(i); } Matrix_Free (H); Matrix_Free (U); } /* Eliminating the Zero Rows */ C = Matrix_Copy (M); for (i = 0; i < C->NbRows; i++) { for (j = 0; j < C->NbColumns; j++) if (value_notzero_p(C->p[i][j])) break; if (j == C->NbColumns) { Matrix *temp; temp = RemoveRow(C, i); Matrix_Free(C); C = Matrix_Copy(temp); Matrix_Free(temp); i --; } } /* Eliminating the Redundant Rows */ curDim = 1; curVect = 1; dim = C->NbColumns; curMat = Matrix_Alloc(1,C->NbColumns); for (i = 0; i < C->NbColumns; i ++) value_assign(curMat->p[0][i],C->p[0][i]); while((curVect < C->NbRows) && (curDim < dim)) { Matrix *temp; temp = AddANullRow(curMat); for (i = 0; i < C->NbColumns; i++) value_assign(temp->p[temp->NbRows-1][i],C->p[curVect][i]); temp1 = AddANullRow(temp); temp2 = AddANullColumn(temp1); rank = SolveDiophantine(temp2, &U, &V); if (rank == temp->NbRows) { Matrix_Free(curMat); curMat = Matrix_Copy(temp); curDim ++; } curVect ++; Matrix_Free (U); Vector_Free (V); Matrix_Free (temp1); Matrix_Free (temp); Matrix_Free (temp2); } Matrix_Free(C); Hermite(curMat, &H, &U); rank = curMat->NbRows; Matrix_Free(curMat); Result[0] = Transpose (U); Matrix_Free (H); Matrix_Free (U); return (rank); } /* findHermiteBasis */ polylib-5.22.5.orig/source/kernel/alpha.c0000644000175000017500000004635211341227527021127 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* polytest.c */ #include #include /* alpha.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #include #include #include /*---------------------------------------------------------------------*/ /* int exist_points(pos,P,context) */ /* pos : index position of current loop index (0..hdim-1) */ /* P: loop domain */ /* context : context values for fixed indices */ /* recursive procedure, recurs for each imbriquation */ /* returns 1 if there exists any integer points in this polyhedron */ /* returns 0 if there are none */ /*---------------------------------------------------------------------*/ static int exist_points(int pos,Polyhedron *Pol,Value *context) { Value LB, UB, k,tmp; value_init(LB); value_init(UB); value_init(k); value_init(tmp); value_set_si(LB,0); value_set_si(UB,0); /* Problem if UB or LB is INFINITY */ if (lower_upper_bounds(pos,Pol,context,&LB,&UB) !=0) { errormsg1("exist_points", "infdom", "infinite domain"); value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return -1; } value_set_si(context[pos],0); if(value_lt(UB,LB)) { value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return 0; } if (!Pol->next) { value_subtract(tmp,UB,LB); value_increment(tmp,tmp); value_clear(UB); value_clear(LB); value_clear(k); return (value_pos_p(tmp)); } for (value_assign(k,LB);value_le(k,UB);value_increment(k,k)) { /* insert k in context */ value_assign(context[pos],k); if (exist_points(pos+1,Pol->next,context) > 0 ) { value_clear(LB); value_clear(UB); value_clear(k); value_clear(tmp); return 1; } } /* Reset context */ value_set_si(context[pos],0); value_clear(UB); value_clear(LB); value_clear(k); value_clear(tmp); return 0; } /*--------------------------------------------------------------*/ /* Test to see if there are any integral points in a polyhedron */ /*--------------------------------------------------------------*/ int Polyhedron_Not_Empty(Polyhedron *P,Polyhedron *C,int MAXRAYS) { int res,i; Value *context; Polyhedron *L; POL_ENSURE_FACETS(P); POL_ENSURE_VERTICES(P); POL_ENSURE_FACETS(C); POL_ENSURE_VERTICES(C); /* Create a context vector size dim+2 and set it to all zeros */ context = (Value *) malloc((P->Dimension+2)*sizeof(Value)); /* Initialize array 'context' */ for (i=0;i<(P->Dimension+2);i++) value_init(context[i]); Vector_Set(context,0,(P->Dimension+2)); /* Set context[P->Dimension+1] = 1 (the constant) */ value_set_si(context[P->Dimension+1],1); L = Polyhedron_Scan(P,C,MAXRAYS); res = exist_points(1,L,context); Domain_Free(L); /* Clear array 'context' */ for (i=0;i<(P->Dimension+2);i++) value_clear(context[i]); free(context); return res; } /* PolyhedronLTQ ( P1, P2 ) */ /* P1 and P2 must be simple polyhedra */ /* result = 0 --> not comparable */ /* result = -1 --> P1 < P2 */ /* result = 1 --> P1 > P2 */ /* INDEX = 1 .... Dimension */ int PolyhedronLTQ (Polyhedron *Pol1,Polyhedron *Pol2,int INDEX, int PDIM, int NbMaxConstrs) { int res, dim, i, j, k; Polyhedron *Q1, *Q2, *Q3, *Q4, *Q; Matrix *Mat; if (Pol1->next || Pol2->next) { errormsg1("PolyhedronLTQ", "compoly", "Can only compare polyhedra"); return 0; } if (Pol1->Dimension != Pol2->Dimension) { errormsg1("PolyhedronLTQ","diffdim","Polyhedra are not same dimension"); return 0; } dim = Pol1->Dimension+2; POL_ENSURE_FACETS(Pol1); POL_ENSURE_VERTICES(Pol1); POL_ENSURE_FACETS(Pol2); POL_ENSURE_VERTICES(Pol2); #ifdef DEBUG fprintf(stdout, "P1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Pol1); fprintf(stdout, "P2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Pol2); #endif /* Create the Line to add */ k = Pol1->Dimension-INDEX+1-PDIM; Mat = Matrix_Alloc(k,dim); Vector_Set(Mat->p_Init,0,dim*k); for(j=0,i=INDEX;jp[j][i],1); Q1 = AddRays(Mat->p[0],k,Pol1,NbMaxConstrs); Q2 = AddRays(Mat->p[0],k,Pol2,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q1); fprintf(stdout, "Q2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q2); #endif Matrix_Free(Mat); Q = DomainIntersection(Q1,Q2,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q); #endif Domain_Free(Q1); Domain_Free(Q2); if (emptyQ(Q)) res = 0; /* not comparable */ else { Q1 = DomainIntersection(Pol1,Q,NbMaxConstrs); Q2 = DomainIntersection(Pol2,Q,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q1\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q1); fprintf(stdout, "Q2\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q2); #endif k = Q1->NbConstraints + Q2->NbConstraints; Mat = Matrix_Alloc(k, dim); Vector_Set(Mat->p_Init,0,k*dim); /* First compute surrounding polyhedron */ j=0; for (i=0; iNbConstraints; i++) { if ((value_one_p(Q1->Constraint[i][0])) && (value_pos_p(Q1->Constraint[i][INDEX]))) { /* keep Q1's lower bounds */ for (k=0; kp[j][k],Q1->Constraint[i][k]); j++; } } for (i=0; iNbConstraints; i++) { if ((value_one_p(Q2->Constraint[i][0])) && (value_neg_p(Q2->Constraint[i][INDEX]))) { /* and keep Q2's upper bounds */ for (k=0; kp[j][k],Q2->Constraint[i][k]); j++; } } Q4 = AddConstraints(Mat->p[0], j, Q, NbMaxConstrs); Matrix_Free(Mat); #ifdef debug fprintf(stderr, "Q4 surrounding polyhedron\n"); Polyhderon_Print(stderr,P_VALUE_FMT, Q4); #endif /* if surrounding polyhedron is empty, D1>D2 */ if (emptyQ(Q4)) { res = 1; #ifdef debug fprintf(stderr, "Surrounding polyhedron is empty\n"); #endif goto LTQdone2; } /* Test if Q1 < Q2 */ /* Build a constraint array for >= Q1 and <= Q2 */ Mat = Matrix_Alloc(2,dim); Vector_Set(Mat->p_Init,0,2*dim); /* Choose a contraint from Q1 */ for (i=0; iNbConstraints; i++) { if (value_zero_p(Q1->Constraint[i][0])) { /* Equality */ if (value_zero_p(Q1->Constraint[i][INDEX])) { /* Ignore side constraint (they are in Q) */ continue; } else if (value_neg_p(Q1->Constraint[i][INDEX])) { /* copy -constraint to Mat */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } else { /* Copy constraint to Mat */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } } else if(value_neg_p(Q1->Constraint[i][INDEX])) { /* Upper bound -- make a lower bound from it */ value_set_si(Mat->p[0][0],1); for (k=1; kp[0][k],Q1->Constraint[i][k]); } else { /* Lower or side bound -- ignore it */ continue; } /* Choose a constraint from Q2 */ for (j=0; jNbConstraints; j++) { if (value_zero_p(Q2->Constraint[j][0])) { /* equality */ if (value_zero_p(Q2->Constraint[j][INDEX])) { /* Ignore side constraint (they are in Q) */ continue; } else if (value_pos_p(Q2->Constraint[j][INDEX])) { /* Copy -constraint to Mat */ value_set_si(Mat->p[1][0],1); for (k=1; kp[1][k],Q2->Constraint[j][k]); } else { /* Copy constraint to Mat */ value_set_si(Mat->p[1][0],1); for (k=1; kp[1][k],Q2->Constraint[j][k]); }; } else if (value_pos_p(Q2->Constraint[j][INDEX])) { /* Lower bound -- make an upper bound from it */ value_set_si(Mat->p[1][0],1); for(k=1;kp[1][k],Q2->Constraint[j][k]); } else { /* Upper or side bound -- ignore it */ continue; }; #ifdef DEBUG fprintf(stdout, "i=%d j=%d M=\n", i+1, j+1); Matrix_Print(stdout,P_VALUE_FMT,Mat); #endif /* Add Mat to Q and see if anything is made */ Q3 = AddConstraints(Mat->p[0],2,Q,NbMaxConstrs); #ifdef DEBUG fprintf(stdout, "Q3\n"); Polyhedron_Print(stdout,P_VALUE_FMT,Q3); #endif if (!emptyQ(Q3)) { Domain_Free(Q3); #ifdef DEBUG fprintf(stdout, "not empty\n"); #endif res = -1; goto LTQdone; } #ifdef DEBUG fprintf(stdout,"empty\n"); #endif Domain_Free(Q3); } /* end for j */ } /* end for i */ res = 1; LTQdone: Matrix_Free(Mat); LTQdone2: Domain_Free(Q4); Domain_Free(Q1); Domain_Free(Q2); } Domain_Free(Q); #ifdef DEBUG fprintf(stdout, "res = %d\n", res); #endif return res; } /* PolyhedronLTQ */ /* GaussSimplify -- Given Mat1, a matrix of equalities, performs Gaussian elimination. Find a minimum basis, Returns the rank. Mat1 is context, Mat2 is reduced in context of Mat1 */ int GaussSimplify(Matrix *Mat1,Matrix *Mat2) { int NbRows = Mat1->NbRows; int NbCols = Mat1->NbColumns; int *column_index; int i, j, k, n, t, pivot, Rank; Value gcd, tmp, *cp; column_index=(int *)malloc(NbCols * sizeof(int)); if (!column_index) { errormsg1("GaussSimplify", "outofmem", "out of memory space\n"); Pol_status = 1; return 0; } /* Initialize all the 'Value' variables */ value_init(gcd); value_init(tmp); Rank=0; for (j=0; jp[i][j])) /* the first non-zero entry */ break; if (i!=NbRows) { /* was one found ? */ if (i!=Rank) /* was it found below the diagonal?*/ Vector_Exchange(Mat1->p[Rank],Mat1->p[i],NbCols); /* Normalize the pivot row */ Vector_Gcd(Mat1->p[Rank],NbCols,&gcd); /* If (gcd >= 2) */ value_set_si(tmp,2); if (value_ge(gcd,tmp)) { cp = Mat1->p[Rank]; for (k=0; kp[Rank][j])) { cp = Mat1->p[Rank]; for (k=0; kp[i][j])) { Value a, a1, a2, a1abs, a2abs; value_init(a); value_init(a1); value_init(a2); value_init(a1abs); value_init(a2abs); value_assign(a1,Mat1->p[i][j]); value_absolute(a1abs,a1); value_assign(a2,Mat1->p[Rank][j]); value_absolute(a2abs,a2); value_gcd(a, a1abs, a2abs); value_divexact(a1, a1, a); value_divexact(a2, a2, a); value_oppose(a1,a1); Vector_Combine(Mat1->p[i],Mat1->p[Rank],Mat1->p[i],a2, a1,NbCols); Vector_Normalize(Mat1->p[i],NbCols); value_clear(a); value_clear(a1); value_clear(a2); value_clear(a1abs); value_clear(a2abs); } } column_index[Rank]=j; Rank++; } } /* end of Gauss elimination */ if (Mat2) { /* Mat2 is a transformation matrix (i,j->f(i,j)).... can't scale it because can't scale both sides of -> */ /* normalizes an affine transformation */ /* priority of forms */ /* 1. i' -> i (identity) */ /* 2. i' -> i + constant (uniform) */ /* 3. i' -> constant (broadcast) */ /* 4. i' -> j (permutation) */ /* 5. i' -> j + constant ( ) */ /* 6. i' -> i + j + constant (non-uniform) */ for (k=0; kNbRows-1);i++) { /* all but the last row 0...0 1 */ if ((i!=j) && value_notzero_p(Mat2->p[i][j])) { /* Remove dependency of i' on j */ Value a, a1, a1abs, a2, a2abs; value_init(a); value_init(a1); value_init(a2); value_init(a1abs); value_init(a2abs); value_assign(a1,Mat2->p[i][j]); value_absolute(a1abs,a1); value_assign(a2,Mat1->p[k][j]); value_absolute(a2abs,a2); value_gcd(a, a1abs, a2abs); value_divexact(a1, a1, a); value_divexact(a2, a2, a); value_oppose(a1,a1); if (value_one_p(a2)) { Vector_Combine(Mat2->p[i],Mat1->p[k],Mat2->p[i],a2, a1,NbCols); /* Vector_Normalize(Mat2->p[i],NbCols); -- can't do T */ } /* otherwise, can't do it without mult lhs prod (2i,3j->...) */ value_clear(a); value_clear(a1); value_clear(a2); value_clear(a1abs); value_clear(a2abs); } else if ((i==j) && value_zero_p(Mat2->p[i][j])) { /* 'i' does not depend on j */ for (n=j+1; n < (NbCols-1); n++) { if (value_notzero_p(Mat2->p[i][n])) { /* i' depends on some n */ value_set_si(tmp,1); Vector_Combine(Mat2->p[i],Mat1->p[k],Mat2->p[i],tmp, tmp,NbCols); break; } /* if 'i' depends on just a constant, then leave it alone.*/ } } } } /* Check last row of transformation Mat2 */ for (j=0; j<(NbCols-1); j++) if (value_notzero_p(Mat2->p[Mat2->NbRows-1][j])) { errormsg1("GaussSimplify", "corrtrans", "Corrupted transformation\n"); break; } if (value_notone_p(Mat2->p[Mat2->NbRows-1][NbCols-1])) { errormsg1("GaussSimplify", "corrtrans", "Corrupted transformation\n"); } } value_clear(gcd); value_clear(tmp); free(column_index); return Rank; } /* GaussSimplify */ /* * Topologically sort 'n' polyhdera and return 0 on failure, otherwise return * 1 on success. Here 'L' is a an array of pointers to polyhedra, 'n' is the * number of polyhedra, 'index' is the level to consider for partial ordering * 'pdim' is the parameter space dimension, 'time' is an array of 'n' integers * to store logical time values, 'pvect', if not NULL, is an array of 'n' * integers that contains a permutation specification after call and MAXRAYS is * the workspace size for polyhedra operations. */ int PolyhedronTSort (Polyhedron **L,unsigned int n,unsigned int index,unsigned int pdim,int *time,int *pvect,unsigned int MAXRAYS) { unsigned int const nbcells = ((n*(n-1))>>1); /* Number of memory cells to allocate, see below */ int *dag; /* The upper triangular matrix */ int **p; /* Array of matrix row addresses */ unsigned int i, j, k; unsigned int t, nb, isroot; if (n<2) return 0; /* we need an upper triangular matrix (example with n=4): . o o o . . o o . are unuseful cells, o are useful cells . . . o . . . . so we need to allocate (n)(n-1)/2 cells - dag will point to this memory. - p[i] will point to row i of the matrix p[0] = dag - 1 (such that p[0][1] == dag[0]) p[1] = dag - 1 + (n-1) p[2] = dag - 1 + (n-1) + (n-2) ... p[i] = p[i-1] + (n-1-i) */ /* malloc n(n-1)/2 for dag and n-1 for p (node n does not have any row) */ dag = (int *) malloc(nbcells*sizeof(int)); if (!dag) return 0; p = (int **) malloc ((n-1) * sizeof(int *)); if (!p) { free(dag); return 0; } /* Initialize 'p' and 'dag' */ p[0] = dag-1; for (i=1; i p[j][k] = p[i][k] (transitivity) note: p[r][c] == -p[c][r], use this to avoid reading or writing under the matrix diagonal */ /* first, kj same search but */ for (k=j+1; k. */ /* matrix.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU, Provo, Utah all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). */ #include #include #include #include #include #ifdef mac_os #define abs __abs #endif /* * Allocate space for matrix dimensioned by 'NbRows X NbColumns'. */ Matrix *Matrix_Alloc(unsigned NbRows,unsigned NbColumns) { Matrix *Mat; Value *p, **q; int i,j; Mat=(Matrix *)malloc(sizeof(Matrix)); if(!Mat) { errormsg1("Matrix_Alloc", "outofmem", "out of memory space"); return 0; } Mat->NbRows=NbRows; Mat->NbColumns=NbColumns; if (NbRows==0 || NbColumns==0) { Mat->p = (Value **)0; Mat->p_Init= (Value *)0; Mat->p_Init_size = 0; } else { q = (Value **)malloc(NbRows * sizeof(*q)); if(!q) { free(Mat); errormsg1("Matrix_Alloc", "outofmem", "out of memory space"); return 0; } p = value_alloc(NbRows * NbColumns, &Mat->p_Init_size); if(!p) { free(q); free(Mat); errormsg1("Matrix_Alloc", "outofmem", "out of memory space"); return 0; } Mat->p = q; Mat->p_Init = p; for (i=0;ip_Init) value_free(Mat->p_Init, Mat->p_Init_size); if (Mat->p) free(Mat->p); free(Mat); } /* Matrix_Free */ void Matrix_Extend(Matrix *Mat, unsigned NbRows) { Value *p, **q; int i,j; q = (Value **)realloc(Mat->p, NbRows * sizeof(*q)); if(!q) { errormsg1("Matrix_Extend", "outofmem", "out of memory space"); return; } Mat->p = q; if (Mat->p_Init_size < NbRows * Mat->NbColumns) { p = (Value *)realloc(Mat->p_Init, NbRows * Mat->NbColumns * sizeof(Value)); if(!p) { errormsg1("Matrix_Extend", "outofmem", "out of memory space"); return; } Mat->p_Init = p; Vector_Set(Mat->p_Init + Mat->NbRows*Mat->NbColumns, 0, Mat->p_Init_size - Mat->NbRows*Mat->NbColumns); for (i = Mat->p_Init_size; i < Mat->NbColumns*NbRows; ++i) value_init(Mat->p_Init[i]); Mat->p_Init_size = Mat->NbColumns*NbRows; } else Vector_Set(Mat->p_Init + Mat->NbRows*Mat->NbColumns, 0, (NbRows - Mat->NbRows) * Mat->NbColumns); for (i=0;ip[i] = Mat->p_Init + (i * Mat->NbColumns); } Mat->NbRows = NbRows; } /* * Print the contents of the Matrix 'Mat' */ void Matrix_Print(FILE *Dst, const char *Format, Matrix *Mat) { Value *p; int i, j; unsigned NbRows, NbColumns; fprintf(Dst,"%d %d\n", NbRows=Mat->NbRows, NbColumns=Mat->NbColumns); if (NbColumns ==0) { fprintf(Dst, "\n"); return; } for (i=0;ip+i); for (j=0;jp_Init; for (i=0;iNbRows;i++) { do { c = fgets(s, 1024, stdin); while(isspace(*c) && *c!='\n') ++c; } while(c && (*c =='#' || *c== '\n')); if (!c) { errormsg1( "Matrix_Read", "baddim", "not enough rows" ); break; } for (j=0;jNbColumns;j++) { if(!c || *c=='\n' || *c=='#') { errormsg1("Matrix_Read", "baddim", "not enough columns"); break; } if (sscanf(c,"%s%n",str,&n) == 0) { errormsg1( "Matrix_Read", "baddim", "not enough columns" ); break; } value_read(*(p++),str); c += n; } } } /* Matrix_Read_Input */ /* * Read the contents of the matrix 'Mat' from standard input. * A '#' in the first column is a comment line */ Matrix *Matrix_Read(void) { Matrix *Mat; unsigned NbRows, NbColumns; char s[1024]; if (fgets(s, 1024, stdin) == NULL) return NULL; while ((*s=='#' || *s=='\n') || (sscanf(s, "%d %d", &NbRows, &NbColumns)<2)) { if (fgets(s, 1024, stdin) == NULL) return NULL; } Mat = Matrix_Alloc(NbRows,NbColumns); if(!Mat) { errormsg1("Matrix_Read", "outofmem", "out of memory space"); return(NULL); } Matrix_Read_Input(Mat); return Mat; } /* Matrix_Read */ /* * Basic hermite engine */ static int hermite(Matrix *H,Matrix *U,Matrix *Q) { int nc, nr, i, j, k, rank, reduced, pivotrow; Value pivot,x,aux; Value *temp1, *temp2; /* T -1 T */ /* Computes form: A = Q H and U A = H and U = Q */ if (!H) { errormsg1("Domlib", "nullH", "hermite: ? Null H"); return -1; } nc = H->NbColumns; nr = H->NbRows; temp1 = (Value *) malloc(nc * sizeof(Value)); temp2 = (Value *) malloc(nr * sizeof(Value)); if (!temp1 ||!temp2) { errormsg1("Domlib", "outofmem", "out of memory space"); return -1; } /* Initialize all the 'Value' variables */ value_init(pivot); value_init(x); value_init(aux); for(i=0;ip[rank][k]); /* the kth-diagonal element */ pivotrow = rank; /* find the row i>rank with smallest nonzero element in col k */ for (i=rank+1; ip[i][k]); if (value_notzero_p(x) && (value_lt(x,pivot) || value_zero_p(pivot))) { value_assign(pivot,x); pivotrow = i; } } /* 2. Bring pivot to diagonal (exchange rows pivotrow and rank) */ if (pivotrow != rank) { Vector_Exchange(H->p[pivotrow],H->p[rank],nc); if (U) Vector_Exchange(U->p[pivotrow],U->p[rank],nr); if (Q) Vector_Exchange(Q->p[pivotrow],Q->p[rank],nr); #ifdef DEBUG fprintf(stderr,"Exchange rows %d and %d -----------\n", rank+1, pivotrow+1); Matrix_Print(stderr,0,H); #endif } value_assign(pivot,H->p[rank][k]); /* actual ( no abs() ) pivot */ /* 3. Invert the row 'rank' if pivot is negative */ if (value_neg_p(pivot)) { value_oppose(pivot,pivot); /* pivot = -pivot */ for (j=0; jp[rank][j],H->p[rank][j]); /* H->p[rank][j] = -(H->p[rank][j]); */ if (U) for (j=0; jp[rank][j],U->p[rank][j]); /* U->p[rank][j] = -(U->p[rank][j]); */ if (Q) for (j=0; jp[rank][j],Q->p[rank][j]); /* Q->p[rank][j] = -(Q->p[rank][j]); */ #ifdef DEBUG fprintf(stderr,"Negate row %d -----------\n", rank+1); Matrix_Print(stderr,0,H); #endif } if (value_notzero_p(pivot)) { /* 4. Reduce the column modulo the pivot */ /* This eventually zeros out everything below the */ /* diagonal and produces an upper triangular matrix */ for (i=rank+1;ip[i][k]); if (value_notzero_p(x)) { value_modulus(aux,x,pivot); /* floor[integer division] (corrected for neg x) */ if (value_neg_p(x) && value_notzero_p(aux)) { /* x=(x/pivot)-1; */ value_division(x,x,pivot); value_decrement(x,x); } else value_division(x,x,pivot); for (j=0; jp[rank][j]); value_subtract(H->p[i][j],H->p[i][j],aux); } /* U->p[i][j] -= (x * U->p[rank][j]); */ if (U) for (j=0; jp[rank][j]); value_subtract(U->p[i][j],U->p[i][j],aux); } /* Q->p[rank][j] += (x * Q->p[i][j]); */ if (Q) for(j=0;jp[rank][j], x, Q->p[i][j]); } reduced = 1; #ifdef DEBUG fprintf(stderr, "row %d = row %d - %d row %d -----------\n", i+1, i+1, x, rank+1); Matrix_Print(stderr,0,H); #endif } /* if (x) */ } /* for (i) */ } /* if (pivot != 0) */ } /* while (reduced) */ /* Last finish up this column */ /* 5. Make pivot column positive (above pivot row) */ /* x should be zero for i>k */ if (value_notzero_p(pivot)) { for (i=0; ip[i][k]); if (value_notzero_p(x)) { value_modulus(aux,x,pivot); /* floor[integer division] (corrected for neg x) */ if (value_neg_p(x) && value_notzero_p(aux)) { value_division(x,x,pivot); value_decrement(x,x); /* x=(x/pivot)-1; */ } else value_division(x,x,pivot); /* H->p[i][j] -= x * H->p[rank][j]; */ for (j=0; jp[rank][j]); value_subtract(H->p[i][j],H->p[i][j],aux); } /* U->p[i][j] -= x * U->p[rank][j]; */ if (U) for (j=0; jp[rank][j]); value_subtract(U->p[i][j],U->p[i][j],aux); } /* Q->p[rank][j] += x * Q->p[i][j]; */ if (Q) for (j=0; jp[rank][j], x, Q->p[i][j]); } #ifdef DEBUG fprintf(stderr, "row %d = row %d - %d row %d -----------\n", i+1, i+1, x, rank+1); Matrix_Print(stderr,0,H); #endif } /* if (x) */ } /* for (i) */ rank++; } /* if (pivot!=0) */ } /* for (k) */ /* Clear all the 'Value' variables */ value_clear(pivot); value_clear(x); value_clear(aux); for(i=0;iNbColumns; nr = A->NbRows; /* H = A */ *Hp = H = Matrix_Alloc(nr,nc); if (!H) { errormsg1("DomRightHermite", "outofmem", "out of memory space"); return; } /* Initialize all the 'Value' variables */ value_init(tmp); Vector_Copy(A->p_Init,H->p_Init,nr*nc); /* U = I */ if (Up) { *Up = U = Matrix_Alloc(nr, nr); if (!U) { errormsg1("DomRightHermite", "outofmem", "out of memory space"); value_clear(tmp); return; } Vector_Set(U->p_Init,0,nr*nr); /* zero's */ for(i=0;ip[i][i],1); } else U = (Matrix *)0; /* Q = I */ /* Actually I compute Q transpose... its easier */ if (Qp) { *Qp = Q = Matrix_Alloc(nr,nr); if (!Q) { errormsg1("DomRightHermite", "outofmem", "out of memory space"); value_clear(tmp); return; } Vector_Set(Q->p_Init,0,nr*nr); /* zero's */ for (i=0;ip[i][i],1); } else Q = (Matrix *)0; rank = hermite(H,U,Q); /* Q is returned transposed */ /* Transpose Q */ if (Q) { for (i=0; ip[i][j]); value_assign(Q->p[i][j],Q->p[j][i] ); value_assign(Q->p[j][i],tmp); } } } value_clear(tmp); return; } /* right_hermite */ void left_hermite(Matrix *A,Matrix **Hp,Matrix **Qp,Matrix **Up) { Matrix *H, *HT, *Q, *U; int i, j, nc, nr, rank; Value tmp; /* Computes left form: A = HQ , AU = H , T T T T T T using right form A = Q H , U A = H */ nr = A->NbRows; nc = A->NbColumns; /* HT = A transpose */ HT = Matrix_Alloc(nc, nr); if (!HT) { errormsg1("DomLeftHermite", "outofmem", "out of memory space"); return; } value_init(tmp); for (i=0; ip[j][i],A->p[i][j]); /* U = I */ if (Up) { *Up = U = Matrix_Alloc(nc,nc); if (!U) { errormsg1("DomLeftHermite", "outofmem", "out of memory space"); value_clear(tmp); return; } Vector_Set(U->p_Init,0,nc*nc); /* zero's */ for (i=0;ip[i][i],1); } else U=(Matrix *)0; /* Q = I */ if (Qp) { *Qp = Q = Matrix_Alloc(nc, nc); if (!Q) { errormsg1("DomLeftHermite", "outofmem", "out of memory space"); value_clear(tmp); return; } Vector_Set(Q->p_Init,0,nc*nc); /* zero's */ for (i=0;ip[i][i],1); } else Q=(Matrix *)0; rank = hermite(HT,U,Q); /* H = HT transpose */ *Hp = H = Matrix_Alloc(nr,nc); if (!H) { errormsg1("DomLeftHermite", "outofmem", "out of memory space"); value_clear(tmp); return; } for (i=0; ip[i][j],HT->p[j][i]); Matrix_Free(HT); /* Transpose U */ if (U) { for (i=0; ip[i][j]); value_assign(U->p[i][j],U->p[j][i] ); value_assign(U->p[j][i],tmp); } } } value_clear(tmp); } /* left_hermite */ /* * Given a integer matrix 'Mat'(k x k), compute its inverse rational matrix * 'MatInv' k x (k+1). The last column of each row in matrix MatInv is used * to store the common denominator of the entries in a row. The output is 1, * if 'Mat' is non-singular (invertible), otherwise the output is 0. Note:: * (1) Matrix 'Mat' is modified during the inverse operation. * (2) Matrix 'MatInv' must be preallocated before passing into this function. */ int MatInverse(Matrix *Mat,Matrix *MatInv ) { int i, k, j, c; Value x, gcd, piv; Value m1,m2; if(Mat->NbRows != Mat->NbColumns) { fprintf(stderr,"Trying to invert a non-square matrix !\n"); return 0; } /* Initialize all the 'Value' variables */ value_init(x); value_init(gcd); value_init(piv); value_init(m1); value_init(m2); k = Mat->NbRows; /* Initialise MatInv */ Vector_Set(MatInv->p[0],0,k*(k+1)); /* Initialize 'MatInv' to Identity matrix form. Each diagonal entry is set*/ /* to 1. Last column of each row (denominator of each entry in a row) is */ /* also set to 1. */ for(i=0;ip[i][i],1); value_set_si(MatInv->p[i][k],1); /* denum */ } /* Apply Gauss-Jordan elimination method on the two matrices 'Mat' and */ /* 'MatInv' in parallel. */ for(i=0;ip[i][i])) { /* Search for a non-zero pivot down the column(i) */ for(j=i;jp[j][i])) break; /* If no non-zero pivot is found, the matrix 'Mat' is non-invertible */ /* Return 0. */ if(j==k) { /* Clear all the 'Value' variables */ value_clear(x); value_clear(gcd); value_clear(piv); value_clear(m1); value_clear(m2); return 0; } /* Exchange the rows, row(i) and row(j) so that the diagonal element */ /* Mat->p[i][i] (pivot) is non-zero. Repeat the same operations on */ /* matrix 'MatInv'. */ for(c=0;cp[j][c]); value_assign(Mat->p[j][c],Mat->p[i][c]); value_assign(Mat->p[i][c],x); /* Interchange rows, row(i) and row(j) of matrix 'MatInv' */ value_assign(x,MatInv->p[j][c]); value_assign(MatInv->p[j][c],MatInv->p[i][c]); value_assign(MatInv->p[i][c],x); } } /* Make all the entries in column(i) of matrix 'Mat' zero except the */ /* diagonal entry. Repeat the same sequence of operations on matrix */ /* 'MatInv'. */ for(j=0;jp[j][i]); if(value_notzero_p(x)) { value_assign(piv,Mat->p[i][i]); value_gcd(gcd, x, piv); if (value_notone_p(gcd) ) { value_divexact(x, x, gcd); value_divexact(piv, piv, gcd); } for(c=((j>i)?i:0);cp[j][c]); value_multiply(m2,x,Mat->p[i][c]); value_subtract(Mat->p[j][c],m1,m2); } for(c=0;cp[j][c]); value_multiply(m2,x,MatInv->p[i][c]); value_subtract(MatInv->p[j][c],m1,m2); } /* Simplify row(j) of the two matrices 'Mat' and 'MatInv' by */ /* dividing the rows with the common GCD. */ Vector_Gcd(&MatInv->p[j][0],k,&m1); Vector_Gcd(&Mat->p[j][0],k,&m2); value_gcd(gcd, m1, m2); if(value_notone_p(gcd)) { for(c=0;cp[j][c], Mat->p[j][c], gcd); value_divexact(MatInv->p[j][c], MatInv->p[j][c], gcd); } } } } } /* Simplify every row so that 'Mat' reduces to Identity matrix. Perform */ /* the same sequence of operations on the matrix 'MatInv'. */ for(j=0;jp[j][k],Mat->p[j][j]); /* Make the last column (denominator of each entry) of every row greater */ /* than zero. */ Vector_Normalize_Positive(&MatInv->p[j][0],k+1,k); } /* Clear all the 'Value' variables */ value_clear(x); value_clear(gcd); value_clear(piv); value_clear(m1); value_clear(m2); return 1; } /* Mat_Inverse */ /* * Given (m x n) integer matrix 'X' and n x (k+1) rational matrix 'P', compute * the rational m x (k+1) rational matrix 'S'. The last column in each row of * the rational matrices is used to store the common denominator of elements * in a row. */ void rat_prodmat(Matrix *S,Matrix *X,Matrix *P) { int i,j,k; int last_column_index = P->NbColumns - 1; Value lcm, old_lcm,gcd,last_column_entry,s1; Value m1,m2; /* Initialize all the 'Value' variables */ value_init(lcm); value_init(old_lcm); value_init(gcd); value_init(last_column_entry); value_init(s1); value_init(m1); value_init(m2); /* Compute the LCM of last column entries (denominators) of rows */ value_assign(lcm,P->p[0][last_column_index]); for(k=1;kNbRows;++k) { value_assign(old_lcm,lcm); value_assign(last_column_entry,P->p[k][last_column_index]); value_gcd(gcd, lcm, last_column_entry); value_divexact(m1, last_column_entry, gcd); value_multiply(lcm,lcm,m1); } /* S[i][j] = Sum(X[i][k] * P[k][j] where Sum is extended over k = 1..nbrows*/ for(i=0;iNbRows;++i) for(j=0;jNbColumns-1;++j) { /* Initialize s1 to zero. */ value_set_si(s1,0); for(k=0;kNbRows;++k) { /* If the LCM of last column entries is one, simply add the products */ if(value_one_p(lcm)) { value_addmul(s1, X->p[i][k], P->p[k][j]); } /* Numerator (num) and denominator (denom) of S[i][j] is given by :- */ /* numerator = Sum(X[i][k]*P[k][j]*lcm/P[k][last_column_index]) and */ /* denominator= lcm where Sum is extended over k = 1..nbrows. */ else { value_multiply(m1,X->p[i][k],P->p[k][j]); value_division(m2,lcm,P->p[k][last_column_index]); value_addmul(s1, m1, m2); } } value_assign(S->p[i][j],s1); } for(i=0;iNbRows;++i) { value_assign(S->p[i][last_column_index],lcm); /* Normalize the rows so that last element >=0 */ Vector_Normalize_Positive(&S->p[i][0],S->NbColumns,S->NbColumns-1); } /* Clear all the 'Value' variables */ value_clear(lcm); value_clear(old_lcm); value_clear(gcd); value_clear(last_column_entry); value_clear(s1); value_clear(m1); value_clear(m2); return; } /* rat_prodmat */ /* * Given a matrix 'Mat' and vector 'p1', compute the matrix-vector product * and store the result in vector 'p2'. */ void Matrix_Vector_Product(Matrix *Mat,Value *p1,Value *p2) { int NbRows, NbColumns, i, j; Value **cm, *q, *cp1, *cp2; NbRows=Mat->NbRows; NbColumns=Mat->NbColumns; cm = Mat->p; cp2 = p2; for(i=0;iNbRows; NbColumns=Mat->NbColumns; cp2 = p2; cm = Mat->p; for (j=0;jNbRows; NbColumns = Mat2->NbColumns; Size = Mat1->NbColumns; if(Mat2->NbRows!=Size||Mat3->NbRows!=NbRows||Mat3->NbColumns!=NbColumns) { fprintf(stderr, "? Matrix_Product : incompatable matrix dimension\n"); return; } value_init(sum); p3 = Mat3->p_Init; q1 = Mat1->p; q2 = Mat2->p; /* Mat3[i][j] = Sum(Mat1[i][k]*Mat2[k][j] where sum is over k = 1..nbrows */ for (i=0;iNbRows != Mat->NbColumns) { fprintf(stderr,"Trying to invert a non-square matrix !\n"); return 0; } /* Initialize all the 'Value' variables */ value_init(x); value_init(gcd); value_init(piv); value_init(m1); value_init(m2); k = Mat->NbRows; /* Initialise MatInv */ Vector_Set(MatInv->p[0],0,k*k); /* Initialize 'MatInv' to Identity matrix form. Each diagonal entry is set*/ /* to 1. Last column of each row (denominator of each entry in a row) is */ /* also set to 1. */ for(i=0;ip[i][i],1); /* value_set_si(MatInv->p[i][k],1); /* denum */ } /* Apply Gauss-Jordan elimination method on the two matrices 'Mat' and */ /* 'MatInv' in parallel. */ for(i=0;ip[i][i])) { /* Search for a non-zero pivot down the column(i) */ for(j=i;jp[j][i])) break; /* If no non-zero pivot is found, the matrix 'Mat' is non-invertible */ /* Return 0. */ if(j==k) { /* Clear all the 'Value' variables */ value_clear(x); value_clear(gcd); value_clear(piv); value_clear(m1); value_clear(m2); return 0; } /* Exchange the rows, row(i) and row(j) so that the diagonal element */ /* Mat->p[i][i] (pivot) is non-zero. Repeat the same operations on */ /* matrix 'MatInv'. */ for(c=0;cp[j][c]); value_assign(Mat->p[j][c],Mat->p[i][c]); value_assign(Mat->p[i][c],x); /* Interchange rows, row(i) and row(j) of matrix 'MatInv' */ value_assign(x,MatInv->p[j][c]); value_assign(MatInv->p[j][c],MatInv->p[i][c]); value_assign(MatInv->p[i][c],x); } } /* Make all the entries in column(i) of matrix 'Mat' zero except the */ /* diagonal entry. Repeat the same sequence of operations on matrix */ /* 'MatInv'. */ for(j=0;jp[j][i]); if(value_notzero_p(x)) { value_assign(piv,Mat->p[i][i]); value_gcd(gcd, x, piv); if (value_notone_p(gcd) ) { value_divexact(x, x, gcd); value_divexact(piv, piv, gcd); } for(c=((j>i)?i:0);cp[j][c]); value_multiply(m2,x,Mat->p[i][c]); value_subtract(Mat->p[j][c],m1,m2); } for(c=0;cp[j][c]); value_multiply(m2,x,MatInv->p[i][c]); value_subtract(MatInv->p[j][c],m1,m2); } /* Simplify row(j) of the two matrices 'Mat' and 'MatInv' by */ /* dividing the rows with the common GCD. */ Vector_Gcd(&MatInv->p[j][0],k,&m1); Vector_Gcd(&Mat->p[j][0],k,&m2); value_gcd(gcd, m1, m2); if(value_notone_p(gcd)) { for(c=0;cp[j][c], Mat->p[j][c], gcd); value_divexact(MatInv->p[j][c], MatInv->p[j][c], gcd); } } } } } /* Find common denom for each row */ den = (Value *)malloc(k*sizeof(Value)); value_set_si(x,1); for(j=0 ; jp[j][j]); /* gcd is always positive */ Vector_Gcd(&MatInv->p[j][0],k,&gcd); value_gcd(gcd, gcd, den[j]); if (value_neg_p(den[j])) value_oppose(gcd,gcd); /* make denominator positive */ if (value_notone_p(gcd)) { for (c=0; cp[j][c], MatInv->p[j][c], gcd); /* normalize */ value_divexact(den[j], den[j], gcd); } value_gcd(gcd, x, den[j]); value_divexact(m1, den[j], gcd); value_multiply(x,x,m1); } if (value_notone_p(x)) for(j=0 ; jp[j][c],MatInv->p[j][c],m1); /* normalize */ } } /* Clear all the 'Value' variables */ for(j=0 ; j. */ #include #include #include #include /****************************************************/ /* Read_ParamNames() : */ /* Reads FILE *in for the parameter names */ /* if in==NULL or not enough parameters on input, */ /* use default names */ /* returns an n-array of strings */ /****************************************************/ const char **Read_ParamNames(FILE *in,int m) { char **param_name; int c, i, j, f; char s[1024],param[32]; if(!in) f = 0; else do f = (fgets(s, 1024, in)!=NULL); while (f && (*s=='#' || *s=='\n')); param_name = (char **)malloc(m*sizeof(char *)); i = 0; if(f) { c = 0; for(;i= 0) free((char *)params[m]); free(params); } polylib-5.22.5.orig/source/kernel/compress_parms.c0000644000175000017500000007664211341227527023104 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * $Id: compress_parms.c,v 1.32 2006/11/03 17:34:26 skimo Exp $ * * The integer points in a parametric linear subspace of Q^n are generally * lying on a sub-lattice of Z^n. * Functions here use and compute validity lattices, i.e. lattices induced on a * set of variables by such equalities involving another set of integer * variables. * @author B. Meister 12/2003-2006 meister@icps.u-strasbg.fr * LSIIT -ICPS * UMR 7005 CNRS * Louis Pasteur University (ULP), Strasbourg, France */ #include #include /** * debug flags (2 levels) */ #define dbgCompParm 0 #define dbgCompParmMore 0 #define dbgStart(a) if (dbgCompParmMore) { printf(" -- begin "); \ printf(#a); \ printf(" --\n"); } \ while(0) #define dbgEnd(a) if (dbgCompParmMore) { printf(" -- end "); \ printf(#a); \ printf(" --\n"); } \ while(0) /** * Given a full-row-rank nxm matrix M made of m row-vectors), computes the * basis K (made of n-m column-vectors) of the integer kernel of the rows of M * so we have: M.K = 0 */ Matrix * int_ker(Matrix * M) { Matrix *U, *Q, *H, *H2, *K=NULL; int i, j, rk; if (dbgCompParm) show_matrix(M); /* eliminate redundant rows : UM = H*/ right_hermite(M, &H, &Q, &U); for (rk=H->NbRows-1; (rk>=0) && Vector_IsZero(H->p[rk], H->NbColumns); rk--); rk++; if (dbgCompParmMore) { printf("rank = %d\n", rk); } /* there is a non-null kernel if and only if the dimension m of the space spanned by the rows is inferior to the number n of variables */ if (M->NbColumns <= rk) { Matrix_Free(H); Matrix_Free(Q); Matrix_Free(U); K = Matrix_Alloc(M->NbColumns, 0); return K; } Matrix_Free(U); Matrix_Free(Q); /* fool left_hermite by giving NbRows =rank of M*/ H->NbRows=rk; /* computes MU = [H 0] */ left_hermite(H, &H2, &Q, &U); if (dbgCompParmMore) { printf("-- Int. Kernel -- \n"); show_matrix(M); printf(" = \n"); show_matrix(H2); show_matrix(U); } H->NbRows==M->NbRows; Matrix_Free(H); /* the Integer Kernel is made of the last n-rk columns of U */ Matrix_subMatrix(U, 0, rk, U->NbRows, U->NbColumns, &K); /* clean up */ Matrix_Free(H2); Matrix_Free(U); Matrix_Free(Q); return K; } /* int_ker */ /** * Computes the intersection of two linear lattices, whose base vectors are * respectively represented in A and B. * If I and/or Lb is set to NULL, then the matrix is allocated. * Else, the matrix is assumed to be allocated already. * I and Lb are rk x rk, where rk is the rank of A (or B). * @param A the full-row rank matrix whose column-vectors are the basis for the * first linear lattice. * @param B the matrix whose column-vectors are the basis for the second linear * lattice. * @param Lb the matrix such that B.Lb = I, where I is the intersection. * @return their intersection. */ static void linearInter(Matrix * A, Matrix * B, Matrix ** I, Matrix **Lb) { Matrix * AB=NULL; int rk = A->NbRows; int a = A->NbColumns; int b = B->NbColumns; int i,j, z=0; Matrix * H, *U, *Q; /* ensure that the spanning vectors are in the same space */ assert(B->NbRows==rk); /* 1- build the matrix * (A 0 1) * (0 B 1) */ AB = Matrix_Alloc(2*rk, a+b+rk); Matrix_copySubMatrix(A, 0, 0, rk, a, AB, 0, 0); Matrix_copySubMatrix(B, 0, 0, rk, b, AB, rk, a); for (i=0; i< rk; i++) { value_set_si(AB->p[i][a+b+i], 1); value_set_si(AB->p[i+rk][a+b+i], 1); } if (dbgCompParm) { show_matrix(AB); } /* 2- Compute its left Hermite normal form. AB.U = [H 0] */ left_hermite(AB, &H, &Q, &U); Matrix_Free(AB); Matrix_Free(Q); /* count the number of non-zero colums in H */ for (z=H->NbColumns-1; value_zero_p(H->p[H->NbRows-1][z]); z--); z++; if (dbgCompParm) { show_matrix(H); printf("z=%d\n", z); } Matrix_Free(H); /* if you split U in 9 submatrices, you have: * A.U_13 = -U_33 * B.U_23 = -U_33, * where the nb of cols of U_{*3} equals the nb of zero-cols of H * U_33 is a (the smallest) combination of col-vectors of A and B at the same * time: their intersection. */ Matrix_subMatrix(U, a+b, z, U->NbColumns, U->NbColumns, I); Matrix_subMatrix(U, a, z, a+b, U->NbColumns, Lb); if (dbgCompParm) { show_matrix(U); } Matrix_Free(U); } /* linearInter */ /** * Given a system of equalities, looks if it has an integer solution in the * combined space, and if yes, returns one solution. *

pre-condition: the equalities are full-row rank (without the constant * part)

* @param Eqs the system of equations (as constraints) * @param I a feasible integer solution if it exists, else NULL. Allocated if * initially set to NULL, else reused. */ void Equalities_integerSolution(Matrix * Eqs, Matrix **I) { Matrix * Hm, *H=NULL, *U, *Q, *M=NULL, *C=NULL, *Hi; Matrix *Ip; int i; Value mod; unsigned int rk; if (Eqs==NULL){ if ((*I)!=NULL) Matrix_Free(*I); I = NULL; return; } /* we use: AI = C = (Ha 0).Q.I = (Ha 0)(I' 0)^T */ /* with I = Qinv.I' = U.I'*/ /* 1- compute I' = Hainv.(-C) */ /* HYP: the equalities are full-row rank */ rk = Eqs->NbRows; Matrix_subMatrix(Eqs, 0, 1, rk, Eqs->NbColumns-1, &M); left_hermite(M, &Hm, &Q, &U); Matrix_Free(M); Matrix_subMatrix(Hm, 0, 0, rk, rk, &H); if (dbgCompParmMore) { show_matrix(Hm); show_matrix(H); show_matrix(U); } Matrix_Free(Q); Matrix_Free(Hm); Matrix_subMatrix(Eqs, 0, Eqs->NbColumns-1, rk, Eqs->NbColumns, &C); Matrix_oppose(C); Hi = Matrix_Alloc(rk, rk+1); MatInverse(H, Hi); if (dbgCompParmMore) { show_matrix(C); show_matrix(Hi); } /* put the numerator of Hinv back into H */ Matrix_subMatrix(Hi, 0, 0, rk, rk, &H); Ip = Matrix_Alloc(Eqs->NbColumns-2, 1); /* fool Matrix_Product on the size of Ip */ Ip->NbRows = rk; Matrix_Product(H, C, Ip); Ip->NbRows = Eqs->NbColumns-2; Matrix_Free(H); Matrix_Free(C); value_init(mod); for (i=0; i< rk; i++) { /* if Hinv.C is not integer, return NULL (no solution) */ value_pmodulus(mod, Ip->p[i][0], Hi->p[i][rk]); if (value_notzero_p(mod)) { if ((*I)!=NULL) Matrix_Free(*I); value_clear(mod); Matrix_Free(U); Matrix_Free(Ip); Matrix_Free(Hi); I = NULL; return; } else { value_pdivision(Ip->p[i][0], Ip->p[i][0], Hi->p[i][rk]); } } /* fill the rest of I' with zeros */ for (i=rk; i< Eqs->NbColumns-2; i++) { value_set_si(Ip->p[i][0], 0); } value_clear(mod); Matrix_Free(Hi); /* 2 - Compute the particular solution I = U.(I' 0) */ ensureMatrix((*I), Eqs->NbColumns-2, 1); Matrix_Product(U, Ip, (*I)); Matrix_Free(U); Matrix_Free(Ip); if (dbgCompParm) { show_matrix(*I); } } /** * Computes the validity lattice of a set of equalities. I.e., the lattice * induced on the last b variables by the equalities involving the * first a integer existential variables. The submatrix of Eqs that * concerns only the existential variables (so the first a columns) is assumed * to be full-row rank. * @param Eqs the equalities * @param a the number of existential integer variables, placed as first * variables * @param vl the (returned) validity lattice, in homogeneous form. It is * allocated if initially set to null, or reused if already allocated. */ void Equalities_validityLattice(Matrix * Eqs, int a, Matrix** vl) { unsigned int b = Eqs->NbColumns-2-a; unsigned int r = Eqs->NbRows; Matrix * A=NULL, * B=NULL, *I = NULL, *Lb=NULL, *sol=NULL; Matrix *H, *U, *Q; unsigned int i; if (dbgCompParm) { printf("Computing validity lattice induced by the %d first variables of:" ,a); show_matrix(Eqs); } if (b==0) { ensureMatrix((*vl), 1, 1); value_set_si((*vl)->p[0][0], 1); return; } /* 1- check that there is an integer solution to the equalities */ /* OPT: could change integerSolution's profile to allocate or not*/ Equalities_integerSolution(Eqs, &sol); /* if there is no integer solution, there is no validity lattice */ if (sol==NULL) { if ((*vl)!=NULL) Matrix_Free(*vl); return; } Matrix_subMatrix(Eqs, 0, 1, r, 1+a, &A); Matrix_subMatrix(Eqs, 0, 1+a, r, 1+a+b, &B); linearInter(A, B, &I, &Lb); Matrix_Free(A); Matrix_Free(B); Matrix_Free(I); if (dbgCompParm) { show_matrix(Lb); } /* 2- The linear part of the validity lattice is the left HNF of Lb */ left_hermite(Lb, &H, &Q, &U); Matrix_Free(Lb); Matrix_Free(Q); Matrix_Free(U); /* 3- build the validity lattice */ ensureMatrix((*vl), b+1, b+1); Matrix_copySubMatrix(H, 0, 0, b, b, (*vl), 0,0); Matrix_Free(H); for (i=0; i< b; i++) { value_assign((*vl)->p[i][b], sol->p[0][a+i]); } Matrix_Free(sol); Vector_Set((*vl)->p[b],0, b); value_set_si((*vl)->p[b][b], 1); } /* validityLattice */ /** * Eliminate the columns corresponding to a list of eliminated parameters. * @param M the constraints matrix whose columns are to be removed * @param nbVars an offset to be added to the ranks of the variables to be * removed * @param elimParms the list of ranks of the variables to be removed * @param newM (output) the matrix without the removed columns */ void Constraints_removeElimCols(Matrix * M, unsigned int nbVars, unsigned int *elimParms, Matrix ** newM) { unsigned int i, j, k; if (elimParms[0]==0) { Matrix_clone(M, newM); return; } if ((*newM)==NULL) { (*newM) = Matrix_Alloc(M->NbRows, M->NbColumns - elimParms[0]); } else { assert ((*newM)->NbColumns==M->NbColumns - elimParms[0]); } for (i=0; i< M->NbRows; i++) { value_assign((*newM)->p[i][0], M->p[i][0]); /* kind of cstr */ k=0; Vector_Copy(&(M->p[i][1]), &((*newM)->p[i][1]), nbVars); for (j=0; j< M->NbColumns-2-nbVars; j++) { if (j!=elimParms[k+1]) { value_assign((*newM)->p[i][j-k+nbVars+1], M->p[i][j+nbVars+1]); } else { k++; } } value_assign((*newM)->p[i][(*newM)->NbColumns-1], M->p[i][M->NbColumns-1]); /* cst part */ } } /* Constraints_removeElimCols */ /** * Eliminates all the equalities in a set of constraints and returns the set of * constraints defining a full-dimensional polyhedron, such that there is a * bijection between integer points of the original polyhedron and these of the * resulting (projected) polyhedron). * If VL is set to NULL, this funciton allocates it. Else, it assumes that * (*VL) points to a matrix of the right size. *

The following things are done: *

    *
  1. remove equalities involving only parameters, and remove as many * parameters as there are such equalities. From that, the list of * eliminated parameters elimParms is built. *
  2. remove equalities that involve variables. This requires a compression * of the parameters and of the other variables that are not eliminated. * The affine compresson is represented by matrix VL (for validity * lattice) and is such that (N I 1)^T = VL.(N' I' 1), where N', I' * are integer (they are the parameters and variables after compression). *
*

*/ void Constraints_fullDimensionize(Matrix ** M, Matrix ** C, Matrix ** VL, Matrix ** Eqs, Matrix ** ParmEqs, unsigned int ** elimVars, unsigned int ** elimParms, int maxRays) { unsigned int i, j; Matrix * A=NULL, *B=NULL; Matrix * Ineqs=NULL; unsigned int nbVars = (*M)->NbColumns - (*C)->NbColumns; unsigned int nbParms; int nbElimVars; Matrix * fullDim = NULL; /* variables for permutations */ unsigned int * permutation; Matrix * permutedEqs=NULL, * permutedIneqs=NULL; /* 1- Eliminate the equalities involving only parameters. */ (*ParmEqs) = Constraints_removeParmEqs(M, C, 0, elimParms); /* if the polyehdron is empty, return now. */ if ((*M)->NbColumns==0) return; /* eliminate the columns corresponding to the eliminated parameters */ if (elimParms[0]!=0) { Constraints_removeElimCols(*M, nbVars, (*elimParms), &A); Matrix_Free(*M); (*M) = A; Constraints_removeElimCols(*C, 0, (*elimParms), &B); Matrix_Free(*C); (*C) = B; if (dbgCompParm) { printf("After false parameter elimination: \n"); show_matrix(*M); show_matrix(*C); } } nbParms = (*C)->NbColumns-2; /* 2- Eliminate the equalities involving variables */ /* a- extract the (remaining) equalities from the poyhedron */ split_constraints((*M), Eqs, &Ineqs); nbElimVars = (*Eqs)->NbRows; /* if the polyhedron is already full-dimensional, return */ if ((*Eqs)->NbRows==0) { Matrix_identity(nbParms+1, VL); return; } /* b- choose variables to be eliminated */ permutation = find_a_permutation((*Eqs), nbParms); if (dbgCompParm) { printf("Permuting the vars/parms this way: [ "); for (i=0; i< (*Eqs)->NbColumns-2; i++) { printf("%d ", permutation[i]); } printf("]\n"); } Constraints_permute((*Eqs), permutation, &permutedEqs); Equalities_validityLattice(permutedEqs, (*Eqs)->NbRows, VL); if (dbgCompParm) { printf("Validity lattice: "); show_matrix(*VL); } Constraints_compressLastVars(permutedEqs, (*VL)); Constraints_permute(Ineqs, permutation, &permutedIneqs); if (dbgCompParmMore) { show_matrix(permutedIneqs); show_matrix(permutedEqs); } Matrix_Free(*Eqs); Matrix_Free(Ineqs); Constraints_compressLastVars(permutedIneqs, (*VL)); if (dbgCompParm) { printf("After compression: "); show_matrix(permutedIneqs); } /* c- eliminate the first variables */ assert(Constraints_eliminateFirstVars(permutedEqs, permutedIneqs)); if (dbgCompParmMore) { printf("After elimination of the variables: "); show_matrix(permutedIneqs); } /* d- get rid of the first (zero) columns, which are now useless, and put the parameters back at the end */ fullDim = Matrix_Alloc(permutedIneqs->NbRows, permutedIneqs->NbColumns-nbElimVars); for (i=0; i< permutedIneqs->NbRows; i++) { value_set_si(fullDim->p[i][0], 1); for (j=0; j< nbParms; j++) { value_assign(fullDim->p[i][j+fullDim->NbColumns-nbParms-1], permutedIneqs->p[i][j+nbElimVars+1]); } for (j=0; j< permutedIneqs->NbColumns-nbParms-2-nbElimVars; j++) { value_assign(fullDim->p[i][j+1], permutedIneqs->p[i][nbElimVars+nbParms+j+1]); } value_assign(fullDim->p[i][fullDim->NbColumns-1], permutedIneqs->p[i][permutedIneqs->NbColumns-1]); } Matrix_Free(permutedIneqs); } /* Constraints_fullDimensionize */ /** * Given a matrix that defines a full-dimensional affine lattice, returns the * affine sub-lattice spanned in the k first dimensions. * Useful for instance when you only look for the parameters' validity lattice. * @param lat the original full-dimensional lattice * @param subLat the sublattice */ void Lattice_extractSubLattice(Matrix * lat, unsigned int k, Matrix ** subLat) { Matrix * H, *Q, *U, *linLat = NULL; unsigned int i; dbgStart(Lattice_extractSubLattice); /* if the dimension is already good, just copy the initial lattice */ if (k==lat->NbRows-1) { if (*subLat==NULL) { (*subLat) = Matrix_Copy(lat); } else { Matrix_copySubMatrix(lat, 0, 0, lat->NbRows, lat->NbColumns, (*subLat), 0, 0); } return; } assert(kNbRows-1); /* 1- Make the linear part of the lattice triangular to eliminate terms from other dimensions */ Matrix_subMatrix(lat, 0, 0, lat->NbRows, lat->NbColumns-1, &linLat); /* OPT: any integer column-vector elimination is ok indeed. */ /* OPT: could test if the lattice is already in triangular form. */ left_hermite(linLat, &H, &Q, &U); if (dbgCompParmMore) { show_matrix(H); } Matrix_Free(Q); Matrix_Free(U); Matrix_Free(linLat); /* if not allocated yet, allocate it */ if (*subLat==NULL) { (*subLat) = Matrix_Alloc(k+1, k+1); } Matrix_copySubMatrix(H, 0, 0, k, k, (*subLat), 0, 0); Matrix_Free(H); Matrix_copySubMatrix(lat, 0, lat->NbColumns-1, k, 1, (*subLat), 0, k); for (i=0; ip[k][i], 0); } value_set_si((*subLat)->p[k][k], 1); dbgEnd(Lattice_extractSubLattice); } /* Lattice_extractSubLattice */ /** * Computes the overall period of the variables I for (MI) mod |d|, where M is * a matrix and |d| a vector. Produce a diagonal matrix S = (s_k) where s_k is * the overall period of i_k * @param M the set of affine functions of I (row-vectors) * @param d the column-vector representing the modulos */ Matrix * affine_periods(Matrix * M, Matrix * d) { Matrix * S; unsigned int i,j; Value tmp; Value * periods = (Value *)malloc(sizeof(Value) * M->NbColumns); value_init(tmp); for(i=0; i< M->NbColumns; i++) { value_init(periods[i]); value_set_si(periods[i], 1); } for (i=0; iNbRows; i++) { for (j=0; j< M->NbColumns; j++) { value_gcd(tmp, d->p[i][0], M->p[i][j]); value_divexact(tmp, d->p[i][0], tmp); value_lcm(periods[j], periods[j], tmp); } } value_clear(tmp); /* 2- build S */ S = Matrix_Alloc(M->NbColumns, M->NbColumns); for (i=0; i< M->NbColumns; i++) for (j=0; j< M->NbColumns; j++) if (i==j) value_assign(S->p[i][j],periods[j]); else value_set_si(S->p[i][j], 0); /* 3- clean up */ for(i=0; i< M->NbColumns; i++) value_clear(periods[i]); free(periods); return S; } /* affine_periods */ /** * Given an integer matrix B with m rows and integer m-vectors C and d, * computes the basis of the integer solutions to (BN+C) mod d = 0 (1). * This is an affine lattice (G): (N 1)^T= G(N' 1)^T, forall N' in Z^b. * If there is no solution, returns NULL. * @param B B, a (m x b) matrix * @param C C, a (m x 1) integer matrix * @param d d, a (1 x m) integer matrix * @param imb the affine (b+1)x(b+1) basis of solutions, in the homogeneous * form. Allocated if initially set to NULL, reused if not. */ void Equalities_intModBasis(Matrix * B, Matrix * C, Matrix * d, Matrix ** imb) { int b = B->NbColumns; /* FIXME: treat the case d=0 as a regular equality B_kN+C_k = 0: */ /* OPT: could keep only equalities for which d>1 */ int nbEqs = B->NbRows; unsigned int i; /* 1- buid the problem DI+BN+C = 0 */ Matrix * eqs = Matrix_Alloc(nbEqs, nbEqs+b+1); for (i=0; i< nbEqs; i++) { value_assign(eqs->p[i][i], d->p[0][i]); } Matrix_copySubMatrix(B, 0, 0, nbEqs, b, eqs, 0, nbEqs); Matrix_copySubMatrix(C, 0, 0, nbEqs, 1, eqs, 0, nbEqs+b); /* 2- the solution is the validity lattice of the equalities */ Equalities_validityLattice(eqs, nbEqs, imb); Matrix_Free(eqs); } /* Equalities_intModBasis */ /** kept here for backwards compatiblity. Wrapper to Equalities_intModBasis() */ Matrix * int_mod_basis(Matrix * B, Matrix * C, Matrix * d) { Matrix * imb = NULL; Equalities_intModBasis(B, C, d, &imb); return imb; } /* int_mod_basis */ /** * Given a parameterized constraints matrix with m equalities, computes the * compression matrix G such that there is an integer solution in the variables * space for each value of N', with N = G N' (N are the "nb_parms" parameters) * @param E a matrix of parametric equalities @param nb_parms the number of * parameters * Note: this function is mostly here for backwards * compatibility. Prefer the use of Equalities_validityLattice. */ Matrix * compress_parms(Matrix * E, int nbParms) { Matrix * vl=NULL; Equalities_validityLattice(E, E->NbColumns-2-nbParms, &vl); return vl; }/* compress_parms */ /** Removes the equalities that involve only parameters, by eliminating some * parameters in the polyhedron's constraints and in the context.

* Updates M and Ctxt. * @param M1 the polyhedron's constraints * @param Ctxt1 the constraints of the polyhedron's context * @param renderSpace tells if the returned equalities must be expressed in the * parameters space (renderSpace=0) or in the combined var/parms space * (renderSpace = 1) * @param elimParms the list of parameters that have been removed: an array * whose 1st element is the number of elements in the list. (returned) * @return the system of equalities that involve only parameters. */ Matrix * Constraints_Remove_parm_eqs(Matrix ** M1, Matrix ** Ctxt1, int renderSpace, unsigned int ** elimParms) { int i, j, k, nbEqsParms =0; int nbEqsM, nbEqsCtxt, allZeros, nbTautoM = 0, nbTautoCtxt = 0; Matrix * M = (*M1); Matrix * Ctxt = (*Ctxt1); int nbVars = M->NbColumns-Ctxt->NbColumns; Matrix * Eqs; Matrix * EqsMTmp; /* 1- build the equality matrix(ces) */ nbEqsM = 0; for (i=0; i< M->NbRows; i++) { k = First_Non_Zero(M->p[i], M->NbColumns); /* if it is a tautology, count it as such */ if (k==-1) { nbTautoM++; } else { /* if it only involves parameters, count it */ if (k>= nbVars+1) nbEqsM++; } } nbEqsCtxt = 0; for (i=0; i< Ctxt->NbRows; i++) { if (value_zero_p(Ctxt->p[i][0])) { if (First_Non_Zero(Ctxt->p[i], Ctxt->NbColumns)==-1) { nbTautoCtxt++; } else { nbEqsCtxt ++; } } } nbEqsParms = nbEqsM + nbEqsCtxt; /* nothing to do in this case */ if (nbEqsParms+nbTautoM+nbTautoCtxt==0) { (*elimParms) = (unsigned int*) malloc(sizeof(int)); (*elimParms)[0] = 0; if (renderSpace==0) { return Matrix_Alloc(0,Ctxt->NbColumns); } else { return Matrix_Alloc(0,M->NbColumns); } } Eqs= Matrix_Alloc(nbEqsParms, Ctxt->NbColumns); EqsMTmp= Matrix_Alloc(nbEqsParms, M->NbColumns); /* copy equalities from the context */ k = 0; for (i=0; i< Ctxt->NbRows; i++) { if (value_zero_p(Ctxt->p[i][0]) && First_Non_Zero(Ctxt->p[i], Ctxt->NbColumns)!=-1) { Vector_Copy(Ctxt->p[i], Eqs->p[k], Ctxt->NbColumns); Vector_Copy(Ctxt->p[i]+1, EqsMTmp->p[k]+nbVars+1, Ctxt->NbColumns-1); k++; } } for (i=0; i< M->NbRows; i++) { j=First_Non_Zero(M->p[i], M->NbColumns); /* copy equalities that involve only parameters from M */ if (j>=nbVars+1) { Vector_Copy(M->p[i]+nbVars+1, Eqs->p[k]+1, Ctxt->NbColumns-1); Vector_Copy(M->p[i]+nbVars+1, EqsMTmp->p[k]+nbVars+1, Ctxt->NbColumns-1); /* mark these equalities for removal */ value_set_si(M->p[i][0], 2); k++; } /* mark the all-zero equalities for removal */ if (j==-1) { value_set_si(M->p[i][0], 2); } } /* 2- eliminate parameters until all equalities are used or until we find a contradiction (overconstrained system) */ (*elimParms) = (unsigned int *) malloc((Eqs->NbRows+1) * sizeof(int)); (*elimParms)[0] = 0; allZeros = 0; for (i=0; i< Eqs->NbRows; i++) { /* find a variable that can be eliminated */ k = First_Non_Zero(Eqs->p[i], Eqs->NbColumns); if (k!=-1) { /* nothing special to do for tautologies */ /* if there is a contradiction, return empty matrices */ if (k==Eqs->NbColumns-1) { printf("Contradiction in %dth row of Eqs: ",k); show_matrix(Eqs); Matrix_Free(Eqs); Matrix_Free(EqsMTmp); (*M1) = Matrix_Alloc(0, M->NbColumns); Matrix_Free(M); (*Ctxt1) = Matrix_Alloc(0,Ctxt->NbColumns); Matrix_Free(Ctxt); free(*elimParms); (*elimParms) = (unsigned int *) malloc(sizeof(int)); (*elimParms)[0] = 0; if (renderSpace==1) { return Matrix_Alloc(0,(*M1)->NbColumns); } else { return Matrix_Alloc(0,(*Ctxt1)->NbColumns); } } /* if we have something we can eliminate, do it in 3 places: Eqs, Ctxt, and M */ else { k--; /* k is the rank of the variable, now */ (*elimParms)[0]++; (*elimParms)[(*elimParms[0])]=k; for (j=0; j< Eqs->NbRows; j++) { if (i!=j) { eliminate_var_with_constr(Eqs, i, Eqs, j, k); eliminate_var_with_constr(EqsMTmp, i, EqsMTmp, j, k+nbVars); } } for (j=0; j< Ctxt->NbRows; j++) { if (value_notzero_p(Ctxt->p[i][0])) { eliminate_var_with_constr(Eqs, i, Ctxt, j, k); } } for (j=0; j< M->NbRows; j++) { if (value_cmp_si(M->p[i][0], 2)) { eliminate_var_with_constr(EqsMTmp, i, M, j, k+nbVars); } } } } /* if (k==-1): count the tautologies in Eqs to remove them later */ else { allZeros++; } } /* elimParms may have been overallocated. Now we know how many parms have been eliminated so we can reallocate the right amount of memory. */ if (!realloc((*elimParms), ((*elimParms)[0]+1)*sizeof(int))) { fprintf(stderr, "Constraints_Remove_parm_eqs > cannot realloc()"); } Matrix_Free(EqsMTmp); /* 3- remove the "bad" equalities from the input matrices and copy the equalities involving only parameters */ EqsMTmp = Matrix_Alloc(M->NbRows-nbEqsM-nbTautoM, M->NbColumns); k=0; for (i=0; i< M->NbRows; i++) { if (value_cmp_si(M->p[i][0], 2)) { Vector_Copy(M->p[i], EqsMTmp->p[k], M->NbColumns); k++; } } Matrix_Free(M); (*M1) = EqsMTmp; EqsMTmp = Matrix_Alloc(Ctxt->NbRows-nbEqsCtxt-nbTautoCtxt, Ctxt->NbColumns); k=0; for (i=0; i< Ctxt->NbRows; i++) { if (value_notzero_p(Ctxt->p[i][0])) { Vector_Copy(Ctxt->p[i], EqsMTmp->p[k], Ctxt->NbColumns); k++; } } Matrix_Free(Ctxt); (*Ctxt1) = EqsMTmp; if (renderSpace==0) {/* renderSpace=0: equalities in the parameter space */ EqsMTmp = Matrix_Alloc(Eqs->NbRows-allZeros, Eqs->NbColumns); k=0; for (i=0; iNbRows; i++) { if (First_Non_Zero(Eqs->p[i], Eqs->NbColumns)!=-1) { Vector_Copy(Eqs->p[i], EqsMTmp->p[k], Eqs->NbColumns); k++; } } } else {/* renderSpace=1: equalities rendered in the combined space */ EqsMTmp = Matrix_Alloc(Eqs->NbRows-allZeros, (*M1)->NbColumns); k=0; for (i=0; iNbRows; i++) { if (First_Non_Zero(Eqs->p[i], Eqs->NbColumns)!=-1) { Vector_Copy(Eqs->p[i], &(EqsMTmp->p[k][nbVars]), Eqs->NbColumns); k++; } } } Matrix_Free(Eqs); Eqs = EqsMTmp; return Eqs; } /* Constraints_Remove_parm_eqs */ /** Removes equalities involving only parameters, but starting from a * Polyhedron and its context. * @param P the polyhedron * @param C P's context * @param renderSpace: 0 for the parameter space, =1 for the combined space. * @maxRays Polylib's usual workspace. */ Polyhedron * Polyhedron_Remove_parm_eqs(Polyhedron ** P, Polyhedron ** C, int renderSpace, unsigned int ** elimParms, int maxRays) { Matrix * Eqs; Polyhedron * Peqs; Matrix * M = Polyhedron2Constraints((*P)); Matrix * Ct = Polyhedron2Constraints((*C)); /* if the Minkowski representation is not computed yet, do not compute it in Constraints2Polyhedron */ if (F_ISSET((*P), POL_VALID | POL_INEQUALITIES) && (F_ISSET((*C), POL_VALID | POL_INEQUALITIES))) { FL_INIT(maxRays, POL_NO_DUAL); } Eqs = Constraints_Remove_parm_eqs(&M, &Ct, renderSpace, elimParms); Peqs = Constraints2Polyhedron(Eqs, maxRays); Matrix_Free(Eqs); /* particular case: no equality involving only parms is found */ if (Eqs->NbRows==0) { Matrix_Free(M); Matrix_Free(Ct); return Peqs; } Polyhedron_Free(*P); Polyhedron_Free(*C); (*P) = Constraints2Polyhedron(M, maxRays); (*C) = Constraints2Polyhedron(Ct, maxRays); Matrix_Free(M); Matrix_Free(Ct); return Peqs; } /* Polyhedron_Remove_parm_eqs */ /** * Given a matrix with m parameterized equations, compress the nb_parms * parameters and n-m variables so that m variables are integer, and transform * the variable space into a n-m space by eliminating the m variables (using * the equalities) the variables to be eliminated are chosen automatically by * the function. * Deprecated. Try to use Constraints_fullDimensionize instead. * @param M the constraints * @param the number of parameters * @param validityLattice the the integer lattice underlying the integer * solutions. */ Matrix * full_dimensionize(Matrix const * M, int nbParms, Matrix ** validityLattice) { Matrix * Eqs, * Ineqs; Matrix * permutedEqs, * permutedIneqs; Matrix * Full_Dim; Matrix * WVL; /* The Whole Validity Lattice (vars+parms) */ unsigned int i,j; int nbElimVars; unsigned int * permutation, * permutationInv; /* 0- Split the equalities and inequalities from each other */ split_constraints(M, &Eqs, &Ineqs); /* 1- if the polyhedron is already full-dimensional, return it */ if (Eqs->NbRows==0) { Matrix_Free(Eqs); (*validityLattice) = Identity_Matrix(nbParms+1); return Ineqs; } nbElimVars = Eqs->NbRows; /* 2- put the vars to be eliminated at the first positions, and compress the other vars/parms -> [ variables to eliminate / parameters / variables to keep ] */ permutation = find_a_permutation(Eqs, nbParms); if (dbgCompParm) { printf("Permuting the vars/parms this way: [ "); for (i=0; i< Eqs->NbColumns; i++) { printf("%d ", permutation[i]); } printf("]\n"); } permutedEqs = mpolyhedron_permute(Eqs, permutation); WVL = compress_parms(permutedEqs, Eqs->NbColumns-2-Eqs->NbRows); if (dbgCompParm) { printf("Whole validity lattice: "); show_matrix(WVL); } mpolyhedron_compress_last_vars(permutedEqs, WVL); permutedIneqs = mpolyhedron_permute(Ineqs, permutation); if (dbgCompParm) { show_matrix(permutedEqs); } Matrix_Free(Eqs); Matrix_Free(Ineqs); mpolyhedron_compress_last_vars(permutedIneqs, WVL); if (dbgCompParm) { printf("After compression: "); show_matrix(permutedIneqs); } /* 3- eliminate the first variables */ if (!mpolyhedron_eliminate_first_variables(permutedEqs, permutedIneqs)) { fprintf(stderr,"full-dimensionize > variable elimination failed. \n"); return NULL; } if (dbgCompParm) { printf("After elimination of the variables: "); show_matrix(permutedIneqs); } /* 4- get rid of the first (zero) columns, which are now useless, and put the parameters back at the end */ Full_Dim = Matrix_Alloc(permutedIneqs->NbRows, permutedIneqs->NbColumns-nbElimVars); for (i=0; i< permutedIneqs->NbRows; i++) { value_set_si(Full_Dim->p[i][0], 1); for (j=0; j< nbParms; j++) value_assign(Full_Dim->p[i][j+Full_Dim->NbColumns-nbParms-1], permutedIneqs->p[i][j+nbElimVars+1]); for (j=0; j< permutedIneqs->NbColumns-nbParms-2-nbElimVars; j++) value_assign(Full_Dim->p[i][j+1], permutedIneqs->p[i][nbElimVars+nbParms+j+1]); value_assign(Full_Dim->p[i][Full_Dim->NbColumns-1], permutedIneqs->p[i][permutedIneqs->NbColumns-1]); } Matrix_Free(permutedIneqs); /* 5- Keep only the the validity lattice restricted to the parameters */ *validityLattice = Matrix_Alloc(nbParms+1, nbParms+1); for (i=0; i< nbParms; i++) { for (j=0; j< nbParms; j++) value_assign((*validityLattice)->p[i][j], WVL->p[i][j]); value_assign((*validityLattice)->p[i][nbParms], WVL->p[i][WVL->NbColumns-1]); } for (j=0; j< nbParms; j++) value_set_si((*validityLattice)->p[nbParms][j], 0); value_assign((*validityLattice)->p[nbParms][nbParms], WVL->p[WVL->NbColumns-1][WVL->NbColumns-1]); /* 6- Clean up */ Matrix_Free(WVL); return Full_Dim; } /* full_dimensionize */ #undef dbgCompParm #undef dbgCompParmMore polylib-5.22.5.orig/source/kernel/polyparam.c0000644000175000017500000015777411341227527022061 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /***********************************************************************/ /* Parametrized polyhedra V4.20 */ /* copyright 1995-2000 Vincent Loechner */ /* copyright 1996-1997, Doran Wilde */ /* Permission is granted to copy, use, and distribute */ /* for any commercial or noncommercial purpose under the terms */ /* of the GNU General Public license, version 2, June 1991 */ /* (see file : LICENSING). */ /***********************************************************************/ /********************* -----------USER #DEFS-------- ***********************/ /* These are mainly for debug purposes. You shouldn't need to change */ /* anything for daily usage... */ /***************************************************************************/ /* you may define each macro independently */ /* #define DEBUGPP */ /* #define DEBUGPP3 */ /* initialization of domain, context, ... */ /* #define DEBUGPP31 */ /* even more init-domains */ /* #define DEBUGPP32 */ /* even even more... (Elim_Columns) */ /* #define DEBUGPP4 */ /* m-faces scan */ /* #define DEBUGPP41 */ /* inverse Di in scan */ /* #define DEBUGPP5 */ /* Compute_PDomains */ /********************* ---------END USER #DEFS------ ***********************/ #include #include #include #include #ifdef DEBUGPP #include #endif #include static void traite_m_face(Polyhedron *, unsigned int *, unsigned int *); static void scan_m_face(int,int,Polyhedron *,unsigned int *); /* * Return the intersection of two polyhedral domains 'Pol1' and 'Pol2' such * that if the intersection is a polyhedron of lower dimension (a degenerate * polyhedron) than the operands, it is discarded from the resulting polyhedra * list. */ Polyhedron *PDomainIntersection(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3, *d; if (!Pol1 || !Pol2) return (Polyhedron*) 0; if((Pol1->Dimension != Pol2->Dimension) || (Pol1->NbEq != Pol2->NbEq)) { fprintf(stderr, "? PDomainIntersection: operation on different dimensions\n"); return (Polyhedron*) 0; } POL_ENSURE_FACETS(Pol1); POL_ENSURE_VERTICES(Pol1); POL_ENSURE_FACETS(Pol2); POL_ENSURE_VERTICES(Pol2); d = (Polyhedron *)0; for (p1=Pol1; p1; p1=p1->next) { for (p2=Pol2; p2; p2=p2->next) { p3 = AddConstraints(p2->Constraint[0], p2->NbConstraints,p1,NbMaxRays); if (!p3) continue; /* If the new polyhedron 'p3' has lower dimension, discard it */ if (p3->NbEq!=Pol1->NbEq) Polyhedron_Free(p3) ; /* Otherwise add it to the new polyhderal domain 'd'. */ else d = AddPolyToDomain(p3,d); } } return d; } /* PDomainIntersection */ /* * Given polyhderal domains 'Pol1' and 'Pol2', return the difference of the * two domains with a modification that the resulting polyhedra in the new * domain don't have a 1 unit space around cut and the degenerate results * (of smaller dimension) are discarded. */ Polyhedron *PDomainDifference(Polyhedron *Pol1,Polyhedron *Pol2,unsigned NbMaxRays) { Polyhedron *p1, *p2, *p3, *d; int i; if (!Pol1 || !Pol2) return (Polyhedron*) 0; if((Pol1->Dimension != Pol2->Dimension) || (Pol1->NbEq != Pol2->NbEq)) { fprintf(stderr, "? PDomainDifference: operation on different dimensions\n"); return (Polyhedron*) 0; } POL_ENSURE_FACETS(Pol1); POL_ENSURE_VERTICES(Pol1); POL_ENSURE_FACETS(Pol2); POL_ENSURE_VERTICES(Pol2); d = (Polyhedron *)0; for (p2=Pol2; p2; p2=p2->next) { for (p1=Pol1; p1; p1=p1->next) { for (i=0; iNbConstraints; i++) { /* Add the constraint (-p2->Constraint[i]) >= 0 in 'p1' */ p3 = SubConstraint(p2->Constraint[i],p1,NbMaxRays,2); if (!p3) continue; /* If the new polyhedron 'p3' is empty or is a polyhedron of lower */ /* dimension, discard it. */ if (emptyQ(p3) || p3->NbEq!=Pol1->NbEq) Polyhedron_Free(p3); /* Otherwise add 'p3' to the new polyhderal domain 'd' */ else d = AddPolyToDomain(p3,d); } } if (p2 != Pol2) Domain_Free(Pol1); Pol1 = d; d = (Polyhedron *)0; } return Pol1; } /* PDomainDifference */ /* * Return 1 if matrix 'Mat' is full column ranked, otherwise return 0. */ static int TestRank(Matrix *Mat) { int i,j,k; Value m1,m2,m3,gcd,tmp; /* Initialize all the 'Value' variables */ value_init(m1); value_init(m2); value_init(m3); value_init(gcd); value_init(tmp); for(k=0;kNbColumns;++k) { /* If the digonal entry (k,k) is zero, search down the column(k) */ /* starting from row(k) to find a non-zero entry */ if(value_zero_p(Mat->p[k][k])) { for(j=k+1;jNbRows;++j) { /* If a non-zero entry (j,k) is found */ if(value_notzero_p(Mat->p[j][k])) { /* Exchange row(k) and row(j) */ for(i=k;iNbColumns;++i) { value_assign(tmp,Mat->p[j][i]); value_assign(Mat->p[j][i],Mat->p[k][i]); value_assign(Mat->p[k][i],tmp); } break; } } /* If no non-zero entry is found then the matrix 'Mat' is not full */ /* ranked. Return zero. */ if(j>=Mat->NbRows) { /* Clear all the 'Value' variables */ value_clear(m1); value_clear(m2); value_clear(m3); value_clear(gcd); value_clear(tmp); return 0; } } /* Now Mat[k][k] is the pivot element */ for(j=k+1;jNbRows;++j) { /* Make every other entry (below row(k)) in column(k) zero */ value_gcd(gcd, Mat->p[j][k], Mat->p[k][k]); for(i=k+1;iNbColumns;++i) { /* pour tous les indices i > k */ value_multiply(m1,Mat->p[j][i],Mat->p[k][k]); value_multiply(m2,Mat->p[j][k],Mat->p[k][i]); value_subtract(m3,m1,m2); value_division(Mat->p[j][i],m3,gcd); } } } /* Clear all the 'Value' variables */ value_clear(m1); value_clear(m2); value_clear(m3); value_clear(gcd); value_clear(tmp); /* The matrix 'Mat' is full ranked, return 1 */ return 1; } /* TestRank */ /* * The Saturation matrix is defined to be an integer (int type) matrix. It is * a boolean matrix which has a row for every constraint and a column for * every line or ray. The bits in the binary format of each integer in the * saturation matrix stores the information whether the corresponding constr- * aint is saturated by ray(line) or not. */ typedef struct { unsigned int NbRows; unsigned int NbColumns; unsigned int **p; unsigned int *p_init; } SatMatrix; static SatMatrix *SMAlloc(int rows,int cols) { unsigned int **q, *p; int i; SatMatrix *result = (SatMatrix *)malloc(sizeof(SatMatrix)); assert (result != NULL); result->NbRows = rows; result->NbColumns = cols; result->p = q = (unsigned int **)malloc(rows * sizeof(unsigned int *)); assert (result->p != NULL); result->p_init = p = (unsigned int *)malloc(rows * cols * sizeof(unsigned int)); assert (result->p_init != NULL); for (i=0;iNbRows, NbColumns=matrix->NbColumns); for (i=0;ip+i); for (j=0;jp_init); free ((char *) matrix->p); free ((char *) matrix); return; } /* SMFree */ /* ------------------------------------------------------------------------- * Shared Global Variables: * Used by procedures: Find_m_face, scan_m_face, Poly2Sat, traite_m_face, * count_sat * ------------------------------------------------------------------------- */ static int m; /* number of parameters */ static int m_dim; /* dimension of m-face */ static int n; /* dimension (not including parameters) */ static int ws; /* Working Space size */ static int nr; /* (NbRays-1)/32 + 1 */ static Polyhedron *CEqualities;/* Equalities in the context */ static SatMatrix *Sat; /* Saturation Matrix (row=constraint, col=ray)*/ static unsigned int *egalite; /* Bool vector marking constraints in m-face */ static Matrix *Xi, *Pi; /* Xi and Pi */ static Matrix *PiTest; /* Matrix used to test if Pi is full ranked? */ static Matrix *CTest; static Matrix *PiInv; /* Matrix inverse Pi, with the last col of */ /* each line = denominator of the line */ static Matrix *RaysDi; /* Constraint matrix for computing Di */ static int KD; /* Flag : keep the full domains in memory ? */ /* 1 = yes; 0 = no, keep constraints only */ static int nbPV; /* The number of parameterized vertices */ static Param_Vertices *PV_Result; /* List of parameterized vertices */ static Param_Domain *PDomains; /* List of domains. */ #ifdef DEBUGPP static int nbfaces; #endif /* * Add the constraints from the context polyhedron 'CEqualities' to the * constraints of polyhedra in the polyhedral domain 'D' and return the new * polyhedral domain. Polyhedral domain 'D' is subsequently deleted from memory */ static Polyhedron *Add_CEqualities(Polyhedron *D) { Polyhedron *d,*r,*tmp; if(!CEqualities) return D; else { if(!D || emptyQ(D)) { if(D) Domain_Free(D); return(Polyhedron_Copy(CEqualities)); } r = AddConstraints(D->Constraint[0],D->NbConstraints, CEqualities,ws); tmp = r; for(d=D->next;d;d=d->next) { tmp->next = AddConstraints(d->Constraint[0],d->NbConstraints, CEqualities,ws); tmp = tmp->next; } Domain_Free(D); return(r); } } /* Add_CEqualities */ #define INT_BITS (sizeof(unsigned) * 8) unsigned int *int_array2bit_vector(unsigned int *array, int n) { int i, ix; unsigned bx; int words = (n+INT_BITS-1)/INT_BITS; unsigned int *bv = (unsigned int *)calloc(words, sizeof(unsigned)); assert(bv); for (i = 0, ix = 0, bx = MSB; i < n; ++i) { if (array[i]) bv[ix] |= bx; NEXT(ix, bx); } return bv; } /*----------------------------------------------------------------------*/ /* traite_m_face */ /* Given an m-face, compute the parameterized vertex */ /* D - The entire domain */ /* mf - Bit vector marking the lines/rays in the m-face */ /* egalite - boolean vector marking saturated constraints in m-face */ /*----------------------------------------------------------------------*/ static void traite_m_face(Polyhedron *D, unsigned int *mf, unsigned int *egalite) { Matrix *Si; /* Solution */ Polyhedron *PDi; /* polyhedron Di */ Param_Vertices *PV; int j,k,c,r; unsigned kx, bx; #ifdef DEBUGPP ++nbfaces; #endif /* Extract Xi, Pi, and RaysDi from D */ RaysDi->NbRows = 0; for(k=0,c=0,kx=0,bx=MSB;kNbRays;++k) { if(mf[kx]&bx) { /* this ray is in the current m-face */ if(cp[j][i],Pi->p[j][i]); /* la nouvelle */ value_assign(PiTest->p[j][c],D->Ray[k][j+1+n]); } PiTest->NbColumns = c+1; r = TestRank(PiTest); if(r /* TestRank(PiTest) */) { /* Ok, c'est lin. indep. */ for (j=0;jp[j][c],D->Ray[k][j+1]); /* Xi */ for (j=0;jp[j][c],D->Ray[k][j+1+n]); /* Pi */ value_assign(Xi->p[n][c],D->Ray[k][n+m+1]); /* const */ value_assign(Pi->p[m][c],D->Ray[k][n+m+1]); /* const */ c++; } } /* Status bit */ value_assign(RaysDi->p[RaysDi->NbRows][0],D->Ray[k][0]); Vector_Copy(&D->Ray[k][n+1],&RaysDi->p[RaysDi->NbRows][1],(m+1)); ++RaysDi->NbRows; } NEXT(kx,bx); } #ifdef DEBUGPP41 fprintf(stderr, "\nRaysDi=\n"); Matrix_Print(stderr,P_VALUE_FMT,RaysDi); if(c < m+1) fprintf(stderr, "Invalid "); fprintf(stderr, "Pi=\n"); Matrix_Print(stderr,P_VALUE_FMT,Pi); #endif #ifdef DEBUGPP4 if(c < m+1) fprintf(stderr,"Eliminated because of no vertex\n"); #endif if(c < m+1) return; /* RaysDi->numColumns = m+2; */ /* stays the same */ /* Xi->NbColumns = m+1;*/ /* VIN100: stays the same. was 'c'! */ /* Xi->NbRows = n+1; */ /* stays the same */ /* Pi->NbColumns = m+1;*/ /* VIN100: stays the same. was 'c'! */ /* Pi->NbRows = m+1; */ /* stays the same */ #ifdef DEBUGPP4 fprintf(stderr,"Xi = "); Matrix_Print(stderr,P_VALUE_FMT,Xi); fprintf(stderr,"Pi = "); Matrix_Print(stderr,P_VALUE_FMT,Pi); #endif /* (Right) invert Pi if POSSIBLE, if not then next m-face */ /* Pi is destroyed */ if(!MatInverse(Pi,PiInv)) { #ifdef DEBUGPP4 fprintf(stderr, "Eliminated because of no inverse Pi\n"); #endif return; } #ifdef DEBUGPP4 fprintf(stderr,"FACE GENERATED!\n"); fprintf(stderr,"PiInv = "); Matrix_Print(stderr,P_VALUE_FMT,PiInv); #endif /* Compute Si (now called Ti in the paper) */ Si = Matrix_Alloc(Xi->NbRows,PiInv->NbColumns); rat_prodmat(Si,Xi,PiInv); #ifdef DEBUGPP4 fprintf(stderr,"Si = "); Matrix_Print(stderr,P_VALUE_FMT,Si); #endif Si->NbRows--; /* throw out the last row = 0 ... 0 1 */ /* Copy all of that into the PV structure */ PV = (Param_Vertices *) malloc(sizeof(Param_Vertices)); PV->next = PV_Result; PV->Vertex = Si; PV->Domain = NULL; PV->Facets = int_array2bit_vector(egalite, D->NbConstraints); PV_Result = PV; nbPV++; /* increment vertex count */ /* Ok... now compute the parameter domain */ PDi = Rays2Polyhedron(RaysDi,ws); #ifdef DEBUGPP3 fprintf(stderr,"RaysDi = "); Matrix_Print(stderr,P_VALUE_FMT,RaysDi); fprintf(stderr,"PDi = "); Polyhedron_Print(stderr,P_VALUE_FMT,PDi); #endif if(KD==0) { /* Add the equalities again to the domain */ PDi = Add_CEqualities(PDi); PV->Domain = Polyhedron2Constraints(PDi); Polyhedron_Free(PDi); } else { Param_Domain *PD; PD = (Param_Domain *) malloc(sizeof(Param_Domain)); PD->Domain = PDi; PD->F = NULL; PD->next = PDomains; PDomains = PD; } return; } /* traite_m_face */ /*----------------------------------------------------------------------*/ /* count_sat */ /* count the number of saturated rays in the bit vector mf */ /* Uses nr from global area */ /*----------------------------------------------------------------------*/ int cntbit[256] = { /* counts for 8 bits */ 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8 }; static int count_sat (unsigned int *mf) { register unsigned int i, tmp, cnt=0; for (i=0; i>8) & 0xff ] + cntbit[ (tmp>>16) & 0xff ] + cntbit[ (tmp>>24) & 0xff ] ; } return cnt; } /* count_sat */ /* Returns true if all bits in part are also set in bv */ static int bit_vector_includes(unsigned int *bv, int len, unsigned int *part) { int j; for (j = 0; j < len; j++) { #ifdef DEBUGPP4 fprintf(stderr, "mf=%08X Sat=%08X &=%08X\n", part[j],bv[j], (part[j] & bv[j])); #endif if ((part[j] & bv[j]) != part[j]) return 0; } return 1; } /*----------------------------------------------------------------------*/ /* let D + E + L be the dimension of the polyhedron */ /* D = Dimension of polytope (ray space) */ /* L = Dimension of Lineality space (number of lines, bid) */ /* E = Dimension of Affine hull (number of equations) */ /* n = number of data indices */ /* m = number of parameters */ /* full domain: */ /* n + m = D + E + L */ /* projected domains: */ /* m = D_m + E_m + L_m */ /* n = D_n + E_n + L_n */ /* What dimension M-face, when projected onto parameter space, */ /* will give an L_m-face? */ /* What are the conditions? */ /* - at least one vertex */ /* - number of rays >= D_m+1 after removal of redundants */ /* */ /* dim of face nb saturated constraints nb saturated lines,rays */ /* ----------- ------------------------ ----------------------- */ /* (0+L)-face all E eqns + >=D ineq all L lines + 1 ray */ /* (M+L)-face all E eqns + >=(D-M) ineq all L lines + >=(M+1) rays */ /* (D+L)-face all E eqns + 0 ineq all L lines + >=(D+1) rays */ /*----------------------------------------------------------------------*/ /*----------------------------------------------------------------------*/ /* scan_m_face */ /* pos : the next candidate constraint position */ /* nb_un : number of saturated constraints needed to finish a face */ /* D : the source polyhedron (context included ) */ /* mf : bit-array marking rays which are saturated so far */ /* From Global area: */ /* ---------------- */ /* n : number of data indices */ /* m : number of parameters */ /* egalite : boolean vector marking saturated constraints in m-face */ /* Sat : Saturation Matrix (row=constraints, col=rays) */ /* ws : working space size */ /* nr : (NbRays-1)/32 + 1 */ /* */ /* Recursive function to find the rays and vertices of each m-face */ /*----------------------------------------------------------------------*/ static void scan_m_face(int pos,int nb_un,Polyhedron *D,unsigned int *mf) { /* pos - the next candidate constraint position */ /* nb_un - the number of constraints needed to finish a face */ /* D - the source polyhedron */ /* mf - (bit vector) marks rays that are saturated so far */ unsigned int *new_mf; #ifdef DEBUGPP4 fprintf(stderr,"Start scan_m_face(pos=%d, nb_un=%d, n=%d, m=%d\n", pos,nb_un,n,m); fprintf(stderr,"mf = "); { int i; for(i=0;iNbConstraints;i++) fprintf(stderr," %1d",egalite[i]); fprintf(stderr,"]\n"); } #endif if(nb_un == 0) { /* Base case */ int i; /*********** ELIMINATION OF REDUNDANT FACES ***********/ /* if all these vertices also verify a previous constraint */ /* which is NOT already selected, we eliminate this face */ /* This keeps the lexicographically greatest selection */ for(i=0;ip[i], nr, mf)) { #ifdef DEBUGPP4 fprintf(stderr, "Redundant with constraint %d\n", i); #endif return; /* it is redundant */ } } /********* END OF ELIMINATION OF DEGENERATE FACES *********/ /* Now check for other constraints that are verified */ for (i = pos; i < D->NbConstraints; ++i) { if (bit_vector_includes(Sat->p[i], nr, mf)) egalite[i] = 1; } /* if we haven't found a constraint verified by all */ /* the rays, its OK, it's a new face. */ traite_m_face(D, mf, egalite); for (i = pos; i < D->NbConstraints; ++i) egalite[i] = 0; return; } /* See if there are enough constraints left to finish */ if((pos+nb_un)>D->NbConstraints) return; /* Recurring part of the procedure */ /* Add the pos'th constraint, compute new saturation vector */ { int k; new_mf = (unsigned int *)malloc(nr*sizeof(unsigned int)); for (k=0; kp[pos][k]; } #ifdef DEBUGPP4 fprintf(stderr,"new_mf = "); { int i; for(i=0;im_dim ) { int redundant = 0; egalite[pos]=1; /* Try it with the pos-th constraint */ /* If this constraint does not change anything, * it is redundant with respect to the selected * equalities and the remaining inequalities. * Check whether it is redundant with respect * to just the selected equalities. */ if( c==count_sat(mf) ) { int i, c, j; for (i = 0, c = 0; i < D->NbConstraints; ++i) { if (egalite[i] == 0 || egalite[i] == -1) continue; for (j = 0; j < D->Dimension+1; ++j) value_assign(CTest->p[j][c], D->Constraint[i][j+1]); ++c; } CTest->NbColumns = c; #ifdef DEBUGPP41 Matrix_Print(stderr,P_VALUE_FMT,CTest); #endif redundant = !TestRank(CTest); } /* Do not decrement nb_un if equality is redundant. */ if( redundant ) { egalite[pos]=-1; /* Don't use in further redundance test */ scan_m_face(pos+1,nb_un,D,new_mf); } else { scan_m_face(pos+1,nb_un-1,D,new_mf); } } } free(new_mf); egalite[pos]=0; /* Try it without the pos-th constraint */ if ((pos+nb_un)>=D->NbConstraints) return; scan_m_face(pos+1,nb_un,D,mf); return; } /* scan_m_face */ /* * Create a saturation matrix with rows correspond to the constraints and * columns correspond to the rays of the polyhedron 'Pol'. Global variable * 'nr' is set in the function. */ static SatMatrix *Poly2Sat(Polyhedron *Pol,unsigned int **L) { SatMatrix *Sat; int i, j, k, kx; unsigned int *Temp; Value *p1, *p2, p3,tmp; unsigned Dimension, NbRay, NbCon, bx; /* Initialize all the 'Value' variables */ value_init(p3); value_init(tmp); NbRay = Pol->NbRays; NbCon = Pol->NbConstraints; Dimension = Pol->Dimension+1; /* Homogeneous Dimension */ /* Build the Sat matrix */ nr = (NbRay - 1)/(sizeof(int)*8) + 1; /* Set globally */ Sat = SMAlloc(NbCon,nr); Temp = (unsigned int *)malloc(nr*sizeof(unsigned int)); memset(Sat->p_init,0,nr*NbCon*sizeof(int)); memset(Temp,0,nr*sizeof(unsigned int)); kx=0; bx=MSB; for (k=0; kConstraint[i][1]; p2 = &Pol->Ray[k][1]; value_set_si(p3,0); for (j=0;jp[i][kx]|=bx; } Temp[kx] |= bx; NEXT(kx, bx); } /* Set 'L' to an array containing ones in every bit position of its */ /* elements. */ *L = Temp; /* Clear all the 'Value' variables */ value_clear(p3); value_clear(tmp); return Sat; } /* Poly2Sat */ /* * Create a parametrized polyhedron with zero parameters. This function was * first written by Xavier Redon, and was later modified by others. */ Param_Polyhedron *GenParamPolyhedron(Polyhedron *Pol, Matrix *Rays) { Param_Polyhedron *result; int nbRows, nbColumns; int i, size, rays; nbRows=Pol->NbRays; nbColumns=Pol->Dimension+2; /* Count the number of rays */ for(i=0, rays=0; iRay[i][0]) || value_zero_p(Pol->Ray[i][nbColumns-1])) ++rays; /* Initialize the result */ result=(Param_Polyhedron *)malloc(sizeof(Param_Polyhedron)); result->nbV=nbRows-rays; result->V=NULL; result->Constraints = Polyhedron2Constraints(Pol); result->Rays = Rays; /* Build the parametric vertices */ for(i=0;iRay[i][0]) || value_zero_p(Pol->Ray[i][nbColumns-1])) continue; vertex=Matrix_Alloc(nbColumns-2,2); for(j=1;jp[j-1][0],Pol->Ray[i][j]); value_assign(vertex->p[j-1][1],Pol->Ray[i][nbColumns-1]); } paramVertex=(Param_Vertices *)malloc(sizeof(Param_Vertices)); paramVertex->Vertex=vertex; /* There is one validity domain : universe of dimension 0 */ paramVertex->Domain=Matrix_Alloc(1,2); value_set_si(paramVertex->Domain->p[0][0],1); value_set_si(paramVertex->Domain->p[0][1],1); paramVertex->Facets = NULL; paramVertex->next=result->V; result->V=paramVertex; } /* Build the parametric domains (only one here) */ if (nbRows > 1) size=(nbRows-1)/(8*sizeof(int))+1; else size = 1; result->D=(Param_Domain *)malloc(sizeof(Param_Domain)); result->D->next=NULL; result->D->Domain=Universe_Polyhedron(0); result->D->F=(unsigned int *)malloc(size*sizeof(int)); memset(&result->D->F[0],0xFF,size*sizeof(int)); return result; } /* GenParamPolyhedron */ /*----------------------------------------------------------------------*/ /* PreElim_Columns */ /* function being called before Elim_Columns */ /* Equalities in E are analysed to initialize ref and p. */ /* These two vectors are used to construct the new constraint matrix */ /* PreElim_Columns returns the transformation matrix to re-convert the */ /* resulting domains in the same format (by adding empty columns) */ /* in the parameter space */ /*----------------------------------------------------------------------*/ Matrix *PreElim_Columns(Polyhedron *E,int *p,int *ref,int m) { int i,j,l; Matrix *T; /* find which columns to eliminate */ /* p contains, for each line in E, the column to eliminate */ /* (i.e. the corresponding parameter index to eliminate) */ /* 0 <= i <= E->NbEq, and 1 <= p[i] <= E->Dimension */ memset(p,0,sizeof(int)*(E->NbEq)); #ifdef DEBUGPP32 fprintf(stderr,"\n\nPreElim_Columns starting\n"); fprintf(stderr,"E =\n"); Polyhedron_Print(stderr,P_VALUE_FMT,E); #endif for(l=0;lNbEq;++l) { if(value_notzero_p(E->Constraint[l][0])) { fprintf(stderr,"Internal error: Elim_Columns (polyparam.c), expecting equalities first in E.\n"); free(p); return(NULL); } for(i=1;value_zero_p(E->Constraint[l][i]);++i) { if(i==E->Dimension+1) { fprintf(stderr,"Internal error: Elim_Columns (polyparam.c), expecting non-empty constraint in E.\n"); free(p); return( NULL ); } } p[l] = i; #ifdef DEBUGPP32 fprintf(stderr,"p[%d] = %d,",l,p[l]); #endif } /* Reference vector: column ref[i] in A corresponds to column i in M */ for(i=0;iDimension+2-E->NbEq;++i) { ref[i]=i; for(j=0;jNbEq;++j) if(p[j]<=ref[i]) ref[i]++; #ifdef DEBUGPP32 fprintf(stderr,"ref[%d] = %d,",i,ref[i]); #endif } /* Size of T : phdim-nbEq * phdim */ T = Matrix_Alloc(m+1-E->NbEq,m+1); for(i=0;iNbColumns;i++) for(j=0;jNbRows;j++) if(ref[E->Dimension-m+j+1] == E->Dimension-m+i+1) value_set_si(T->p[j][i],1); else value_set_si(T->p[j][i],0); #ifdef DEBUGPP32 fprintf(stderr,"\nTransMatrix =\n"); Matrix_Print(stderr,P_VALUE_FMT,T); #endif return(T); } /* PreElim_Columns */ /*----------------------------------------------------------------------*/ /* Elim_Columns */ /* Eliminate columns from A, using the equalities in E. */ /* ref and p are precalculated by PreElim_Columns, using E; */ /* these two vectors are used to construct the new constraint matrix */ /*----------------------------------------------------------------------*/ Polyhedron *Elim_Columns(Polyhedron *A,Polyhedron *E,int *p,int *ref) { int i,l,c; Matrix *M, *C; Polyhedron *R; Value tmp1,tmp2; /* Initialize all the 'Value' variables */ value_init(tmp1); value_init(tmp2); #ifdef DEBUGPP32 fprintf(stderr,"\nElim_Columns starting\n"); fprintf(stderr,"A =\n" ); Polyhedron_Print(stderr,P_VALUE_FMT,A); #endif /* Builds M = constraint matrix of A, useless columns zeroed */ M = Polyhedron2Constraints(A); for(l=0;lNbEq;++l) { for(c=0;cNbRows;++c) { if(value_notzero_p(M->p[c][p[l]])) { /* A parameter to eliminate here ! */ for(i=1;iNbColumns;++i) { value_multiply(tmp1,M->p[c][i],E->Constraint[l][p[l]]); value_multiply(tmp2,E->Constraint[l][i],M->p[c][p[l]]); value_subtract(M->p[c][i],tmp1,tmp2); } } } } #ifdef DEBUGPP32 fprintf(stderr,"\nElim_Columns after zeroing columns of A.\n"); fprintf(stderr,"M =\n"); Matrix_Print(stderr,P_VALUE_FMT,M); #endif /* Builds C = constraint matrix, useless columns eliminated */ C = Matrix_Alloc(M->NbRows,M->NbColumns - E->NbEq); for(l=0;lNbRows;++l) for(c=0;cNbColumns;++c) { value_assign(C->p[l][c],M->p[l][ref[c]]); } #ifdef DEBUGPP32 fprintf(stderr,"\nElim_Columns after eliminating columns of A.\n"); fprintf(stderr,"C =\n"); Matrix_Print(stderr,P_VALUE_FMT,C); #endif R = Constraints2Polyhedron(C,ws); Matrix_Free(C); Matrix_Free(M); value_clear(tmp1); value_clear(tmp2); return(R); } /* Elim_Columns */ static Polyhedron *Recession_Cone(Polyhedron *P, unsigned nvar, unsigned MaxRays) { int i; Matrix *M = Matrix_Alloc(P->NbConstraints, 1 + nvar + 1); Polyhedron *R; for (i = 0; i < P->NbConstraints; ++i) Vector_Copy(P->Constraint[i], M->p[i], 1+nvar); R = Constraints2Polyhedron(M, MaxRays); Matrix_Free(M); return R; } /* Compute lines/unidirectional rays of the (non parametric) polyhedron */ /* Input : * D1 : combined polyhedron, * Output : * Rays : non parametric ray matrix * return value : number of lines */ static int ComputeNPLinesRays(int n, Polyhedron *D1, Matrix **Rays) { int i, j, nbr, dimfaces; Polyhedron *RC; /* Recession Cone */ RC = Recession_Cone(D1, n, ws); /* get the rays/lines from RC */ nbr = 0; for (i = 0; i < RC->NbRays ;i++) if (value_zero_p(RC->Ray[i][n+1])) nbr++; *Rays=Matrix_Alloc(nbr, n+2); for (i = 0, j = 0; j < nbr ;i++) if (value_zero_p(RC->Ray[i][n+1])) Vector_Copy(RC->Ray[i], (*Rays)->p[j++], n+2); dimfaces = RC->NbBid; Polyhedron_Free(RC); #ifdef DEBUGPP31 fprintf(stderr, "Rays = "); Matrix_Print(stderr, P_VALUE_FMT, *Rays); fprintf(stderr, "dimfaces = %d\n", dimfaces); #endif return dimfaces; } /* * Given a polyhedron 'Di' in combined data and parameter space and a context * polyhedron 'C' representing the constraints on the parameter space, create * a list of parameterized vertices and assign values to global variables: * m,n,ws,Sat,egalite,mf,Xi,Pi,PiInv,RaysDi,CEqualities. */ Param_Polyhedron *Find_m_faces(Polyhedron **Di,Polyhedron *C,int keep_dom,int working_space,Polyhedron **CEq,Matrix **CT) { unsigned int *mf; int i, j, dimfaces; Polyhedron *D=*Di, *C1, /* true context */ *D1; /* the combined polyhedron, including context C */ Matrix *Rays, /* lines/rays (non parametric) */ *M; Param_Polyhedron *res; int *p, *ref; CEqualities = NULL; if(CT) { *CEq = NULL; *CT = NULL; } if(!D || !C) return (Param_Polyhedron *) 0; ws = working_space; m = C->Dimension; n = D->Dimension - m; if(n<0) { fprintf(stderr, "Find_m_faces: ?%d parameters of a %d-polyhedron !\n",m,n); return (Param_Polyhedron *) 0; } if (m==0) return GenParamPolyhedron(D,Matrix_Alloc(0,2)); /* Add constraints from Context to D -> result in D1 */ C1 = align_context(C,D->Dimension,ws); #ifdef DEBUGPP31 fprintf(stderr,"m = %d\n",m); fprintf(stderr, "D = "); Polyhedron_Print(stderr,P_VALUE_FMT,D); fprintf(stderr,"C1 = "); Polyhedron_Print(stderr,P_VALUE_FMT,C1); #endif D1 = DomainIntersection(D,C1,ws); #ifdef DEBUGPP31 fprintf(stderr,"D1 = "); Polyhedron_Print(stderr,P_VALUE_FMT,D1); #endif Domain_Free(C1); if (!D1) return(NULL); if (emptyQ(D1)) { Polyhedron_Free(D1); return(NULL); } /* Compute the true context C1 */ /* M : lines in the direction of the first n indices (index space) */ M = Matrix_Alloc(n, D1->Dimension+2); for (i=0; ip[i][i+1],1); C1 = DomainAddRays(D1,M,ws); Matrix_Free(M); #ifdef DEBUGPP31 fprintf(stderr,"True context C1 = "); Polyhedron_Print(stderr,P_VALUE_FMT,C1); #endif dimfaces = ComputeNPLinesRays(n, D1, &Rays); /* CEqualities contains the constraints (to be added again later) */ /* *CT is the transformation matrix to add the removed parameters */ if(!CT) { if (C1->NbEq == 0) { Polyhedron_Free(C1); C1 = NULL; } else { Polyhedron *CEq1, /* CEqualities, in homogeneous dim */ *D2; /* D1, (temporary) simplified */ /* Remove equalities from true context C1 and from D1 */ /* Compute CEqualities = matrix of equalities in C1, projected in */ /* the parameter space */ M = Matrix_Alloc(C1->NbEq,m+2); for(j=0,i=0;iNbEq;++i,++j) { while(value_notzero_p(C1->Constraint[j][0])) ++j; value_assign(M->p[i][0],C1->Constraint[j][0]); Vector_Copy(&C1->Constraint[j][D->Dimension-m+1],&M->p[i][1],(m+1)); } CEqualities = Constraints2Polyhedron(M,ws); Matrix_Free(M); CEq1 = align_context(CEqualities,D->Dimension,ws); /* Simplify D1 and C1 (remove the equalities) */ D2 = DomainSimplify(D1,CEq1,ws); Polyhedron_Free(D1); Polyhedron_Free(C1); Polyhedron_Free(CEq1); D1 = D2; C1 = NULL; } } else { /* if( CT ) */ Polyhedron *CEq1, /* CEqualities */ *D2; /* D1, (temporary) simplified */ /* Suppress all useless constraints in parameter domain */ /* when CT is not NULL (ehrhart) */ /* Vin100, march 01 */ CEq1 = C1; M = Matrix_Alloc(C1->NbConstraints,m+2); for(i=0;iNbConstraints;++i) { value_assign(M->p[i][0],C1->Constraint[i][0]); Vector_Copy(&C1->Constraint[i][D->Dimension-m+1],&M->p[i][1],(m+1)); } CEqualities = Constraints2Polyhedron( M, ws ); Matrix_Free(M); D2 = DomainSimplify(D1,CEq1,ws); Polyhedron_Free(D1); D1 = D2; C1 = Universe_Polyhedron(D2->Dimension); /* if CT is not NULL, the constraints are eliminated */ /* *CT will contain the transformation matrix to come back to the */ /* original dimension (for a polyhedron, in the parameter space) */ if( CEq1->NbEq ) { m -= CEq1->NbEq; p = (int *)malloc(sizeof(int)*(CEq1->NbEq)); } else p = NULL; ref = (int*) malloc(sizeof(int)* (CEq1->Dimension+2-CEq1->NbEq)); *CT = PreElim_Columns(CEq1,p,ref,CEqualities->Dimension); D2 = Elim_Columns(D1,CEq1,p,ref); if (p) free(p); free(ref); #ifdef DEBUGPP3 fprintf(stderr,"D2\t Dim = %3d\tNbEq = %3d\tLines = %3d\n", D2->Dimension,D2->NbEq,D2->NbBid); C2 = Elim_Columns(C1,CEq1,p,ref); fprintf(stderr,"C2\t Dim = %3d\tNbEq = %3d\tLines = %3d\n", C2->Dimension,C2->NbEq,C2->NbBid); Polyhedron_Free(C2); #endif Polyhedron_Free(D1); Polyhedron_Free(C1); D1 = D2; C1 = NULL; *CEq = CEqualities; #ifdef DEBUGPP3 fprintf(stderr,"Polyhedron CEq = "); Polyhedron_Print(stderr,P_VALUE_FMT,*CEq); fprintf(stderr,"Matrix CT = "); Matrix_Print(stderr,P_VALUE_FMT,*CT); #endif Polyhedron_Free(CEq1); CEqualities = NULL; /* don't simplify ! */ /* m changed !!! */ if(m==0) { /* return the new D1 too */ *Di = D1; return GenParamPolyhedron(D1, Rays); } } #ifdef DEBUGPP3 fprintf(stderr,"Polyhedron D1 (D AND C) = "); Polyhedron_Print(stderr,P_VALUE_FMT, D1); fprintf(stderr,"Polyhedron CEqualities = "); if(CEqualities) Polyhedron_Print(stderr,P_VALUE_FMT, CEqualities); else fprintf(stderr,"NULL\n"); #endif KD = keep_dom; PDomains = NULL; PV_Result = NULL; nbPV = 0; if (emptyQ(D1)) { Polyhedron_Free(D1); Matrix_Free(Rays); return NULL; } /* mf : a bit array indicating which rays are part of the m-face */ /* Poly2Sat initializes mf to all ones */ /* set global variable nr to size (number of words) of mf */ Sat = Poly2Sat(D1,&mf); #ifdef DEBUGPP4 fprintf(stderr,"Sat = "); SMPrint(Sat); fprintf(stderr,"mf = "); for (i=0; iNbConstraints); memset(egalite,0, sizeof(int)*D1->NbConstraints); for (i=0; iNbEq; i++) egalite[i] = 1; Xi = Matrix_Alloc(n+1,m+1); Pi = Matrix_Alloc(m+1,m+1); PiTest = Matrix_Alloc(m+1,m+1); CTest = Matrix_Alloc(D->Dimension+1,D->NbConstraints); PiInv = Matrix_Alloc(m+1,m+2); RaysDi = Matrix_Alloc(D1->NbRays,m+2); m_dim = m; /* m_dim has to be increased by the dimension of the smallest faces * of the (non parametric) polyhedron */ m_dim += dimfaces; /* if the smallest face is of smaller dimension than m_dim, * then increase m_dim (I think this should never happen --Vincent) */ #ifdef DEBUGPP3 if (m_dim < D1->NbBid) fprintf(stderr, "m_dim (%d) < D1->NbBid (%d)\n", m_dim, D1->NbBid ); #endif if (m_dim < D1->NbBid) m_dim = D1->NbBid; #ifdef DEBUGPP nbfaces=0; #endif #ifdef DEBUGPP3 fprintf(stderr, "m_dim = %d\n", m_dim); fprintf(stderr, "Target: find faces that saturate %d constraints and %d rays/lines\n", D1->Dimension - m_dim,m_dim+1); #endif /* D1->NbEq constraints already saturated ! */ scan_m_face(D1->NbEq,(D1->Dimension - m_dim - D1->NbEq),D1,mf); /* pos, number of constraints needed */ #ifdef DEBUGPP fprintf( stderr, "Number of m-faces: %d\n", nbfaces ); #endif Matrix_Free(RaysDi); Matrix_Free(PiInv); Matrix_Free(PiTest); Matrix_Free(CTest); Matrix_Free(Pi); Matrix_Free(Xi); free(egalite); free(mf); SMFree(Sat); /* if(CEqualities && keep_dom==0) { Domain_Free(CEqualities); } */ res = (Param_Polyhedron *) malloc (sizeof(Param_Polyhedron)); res->nbV = nbPV; res->V = PV_Result; res->D = PDomains; res->Constraints = Polyhedron2Constraints(D1); res->Rays = Rays; if(CT) /* return the new D1 too ! */ *Di = D1; else Domain_Free(D1); return(res); } /* Find_m_faces */ /* * Given parametric domain 'PD' and number of parametric vertices 'nb_domains', * find the vertices that belong to distinct sub-domains. */ void Compute_PDomains(Param_Domain *PD,int nb_domains,int working_space) { unsigned bx; int i, ix, nv; Polyhedron *dx, *d1, *d2; Param_Domain *p1, *p2, *p2prev, *PDNew; if (nb_domains==0) { #ifdef DEBUGPP5 fprintf(stderr,"No domains\n"); #endif return; } /* Already filled out by GenParamPolyhedron */ if (!PD->next && PD->F) return; /* Initialization */ nv = (nb_domains - 1)/(8*sizeof(int)) + 1; #ifdef DEBUGPP5 fprintf(stderr,"nv = %d\n",nv); #endif for(p1=PD,i=0,ix=0,bx=MSB;p1;p1=p1->next,i++) { /* Assign a bit array 'p1->F' of suitable size to include the vertices */ p1->F = (unsigned *) malloc (nv * sizeof(unsigned)); /* Set the bit array to zeros */ memset(p1->F,0,nv * sizeof(unsigned)); p1->F[ix] |= bx; /* Set i'th bit to one */ NEXT(ix, bx); } #ifdef DEBUGPP5 fprintf(stderr,"nb of vertices=%d\n",i); #endif /* Walk the PD list with two pointers */ ix = 0; bx=MSB; for (p1=PD;p1;p1=p1->next) { for (p2prev=p1,p2=p1->next;p2;p2prev=p2,p2=p2->next) { /* Find intersection */ dx = PDomainIntersection(p1->Domain,p2->Domain,working_space); if (!dx || emptyQ(dx)) { #ifdef DEBUGPP5 fprintf( stderr, "Empty dx (p1 inter p2). Continuing\n"); #endif if(dx) Domain_Free(dx); continue; } #ifdef DEBUGPP5 fprintf(stderr,"Begin PDomainDifference\n"); fprintf(stderr, "p1="); Polyhedron_Print(stderr,P_VALUE_FMT,p1->Domain); fprintf(stderr,"p2="); Polyhedron_Print(stderr,P_VALUE_FMT,p2->Domain); #endif d1 = PDomainDifference(p1->Domain,p2->Domain,working_space); d2 = PDomainDifference(p2->Domain,p1->Domain,working_space); #ifdef DEBUGPP5 fprintf(stderr,"p1\\p2="); Polyhedron_Print(stderr,P_VALUE_FMT,d1); fprintf(stderr,"p2\\p1="); Polyhedron_Print(stderr,P_VALUE_FMT,d2); fprintf(stderr,"END PDomainDifference\n\n"); #endif if (!d1 || emptyQ(d1) || d1->NbEq!=0) { #ifdef DEBUGPP5 fprintf(stderr,"Empty d1\n"); #endif if (d1) Domain_Free(d1); Domain_Free(dx); if (!d2 || emptyQ(d2) || d2->NbEq!=0) { #ifdef DEBUGPP5 fprintf( stderr, "Empty d2 (deleting)\n"); #endif /* dx = p1->Domain = p2->Domain */ if (d2) Domain_Free(d2); /* Update p1 */ for (i=0;iF[i] |= p2->F[i]; /* Delete p2 */ p2prev->next = p2->next; Domain_Free(p2->Domain); free(p2->F); free(p2); p2 = p2prev; } else { /* d2 is not empty --> dx==p1->domain */ #ifdef DEBUGPP5 fprintf( stderr, "p2 replaced by d2\n"); #endif /* Update p1 */ for(i=0;iF[i] |= p2->F[i]; /* Replace p2 with d2 */ Domain_Free( p2->Domain ); p2->Domain = d2; } } else { /* d1 is not empty */ if (!d2 || emptyQ(d2) || d2->NbEq!=0) { #ifdef DEBUGPP5 fprintf( stderr, "p1 replaced by d1\n"); #endif if (d2) Domain_Free(d2); /* dx = p2->domain */ Domain_Free(dx); /* Update p2 */ for(i=0;iF[i] |= p1->F[i]; /* Replace p1 with d1 */ Domain_Free(p1->Domain); p1->Domain = d1; } else { /*d2 is not empty-->d1,d2,dx are distinct */ #ifdef DEBUGPP5 fprintf(stderr,"Non-empty d1 and d2\nNew node created\n"); #endif /* Create a new node for dx */ PDNew = (Param_Domain *) malloc( sizeof(Param_Domain) ); PDNew->F = (unsigned int *)malloc( nv*sizeof(int) ); memset(PDNew->F,0,nv*sizeof(int)); PDNew->Domain = dx; for (i=0;iF[i] = p1->F[i] | p2->F[i]; /* Replace p1 with d1 */ Domain_Free( p1->Domain ); p1->Domain = d1; /* Replace p2 with d2 */ Domain_Free( p2->Domain ); p2->Domain = d2; /* Insert new node after p1 */ PDNew->next = p1->next; p1->next = PDNew; } } } /* end of p2 scan */ if (p1->Domain->next) { Polyhedron *C = DomainConvex(p1->Domain, working_space); Domain_Free(p1->Domain); p1->Domain = C; } } /* end of p1 scan */ } /* Compute_PDomains */ /* * Given a polyhedron 'Din' in combined data and parametre space, a context * polyhedron 'Cin' representing the constraints on the parameter space and * a working space size 'working_space', return a parametric polyhedron with * a list of parametric vertices and their defining domains. */ Param_Polyhedron *Polyhedron2Param_Vertices(Polyhedron *Din,Polyhedron *Cin,int working_space) { Param_Polyhedron *result; POL_ENSURE_FACETS(Din); POL_ENSURE_VERTICES(Din); POL_ENSURE_FACETS(Cin); POL_ENSURE_VERTICES(Cin); #ifdef DEBUGPP fprintf(stderr,"Polyhedron2Param_Vertices algorithm starting at : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif /***************** Scan the m-faces ****************/ result = Find_m_faces(&Din,Cin,0,working_space,NULL,NULL); #ifdef DEBUGPP fprintf(stderr, "nb of points : %d\n",result->nbV); #endif #ifdef DEBUGPP fprintf(stderr, "end main loop : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif return(result); } /* Polyhedron2Param_Vertices */ /* * Free the memory allocated to a list of parametrized vertices */ void Param_Vertices_Free(Param_Vertices *PV) { Param_Vertices *next_pv; while(PV) { next_pv = PV->next; if (PV->Vertex) Matrix_Free(PV->Vertex); if (PV->Domain) Matrix_Free(PV->Domain); if (PV->Facets) free(PV->Facets); free(PV); PV = next_pv; } } /* Param_Vertices_Free */ /* * Print a list of parametrized vertices * */ void Print_Vertex(FILE *DST, Matrix *V, const char **param_names) { int l, v; int first; Value gcd,tmp; value_init(gcd); value_init(tmp); fprintf(DST, "[" ); for(l=0;lNbRows;++l){ /* Variables */ first=1; fprintf(DST, " " ); for(v=0;v < V->NbColumns-2;++v) { if(value_notzero_p(V->p[l][v])) { value_gcd(gcd, V->p[l][v], V->p[l][V->NbColumns-1]); value_divexact(tmp, V->p[l][v], gcd); if(value_posz_p(tmp)) { if(!first) fprintf(DST, "+"); if(value_notone_p(tmp)) { value_print(DST,VALUE_FMT,tmp); } } else { /* V->p[l][v]/gcd<0 */ if(value_mone_p(tmp)) fprintf(DST, "-" ); else { value_print(DST,VALUE_FMT,tmp); } } value_divexact(tmp, V->p[l][V->NbColumns-1], gcd); if(value_notone_p(tmp)) { fprintf(DST, "%s/", param_names[v]); value_print(DST,VALUE_FMT,tmp); } else fprintf(DST, "%s", param_names[v]); first=0; } } /* Constant */ if(value_notzero_p(V->p[l][v]) || first) { if(value_posz_p(V->p[l][v]) && !first) fprintf(DST,"+"); value_gcd(gcd, V->p[l][v], V->p[l][V->NbColumns-1]); value_divexact(tmp, V->p[l][v], gcd); value_print(DST,VALUE_FMT,tmp); value_divexact(tmp, V->p[l][V->NbColumns-1], gcd); if(value_notone_p(tmp)) { fprintf(DST,"/"); value_print(DST,VALUE_FMT,tmp); fprintf(DST," "); } } if (lNbRows-1) fprintf(DST, ", "); } fprintf(DST, " ]"); value_clear(gcd); value_clear(tmp); return; } /* Print_Vertex */ /*----------------------------------------------------------------------*/ /* VertexCT */ /* convert a paramvertex from reduced space to normal m-space */ /*----------------------------------------------------------------------*/ Matrix *VertexCT(Matrix *V,Matrix *CT) { Matrix *Vt; int i,j,k; if(CT) { /* Have to transform the vertices to original dimension */ Vt = Matrix_Alloc(V->NbRows,CT->NbColumns+1); for(i=0;iNbRows;++i) { value_assign(Vt->p[i][CT->NbColumns],V->p[i][V->NbColumns-1]); for(j=0;jNbColumns;j++) { for(k=0;kNbRows;k++) if(value_notzero_p(CT->p[k][j])) break; if(kNbRows) value_assign(Vt->p[i][j],V->p[i][k]); else value_set_si(Vt->p[i][j],0); } } return(Vt); } else return(NULL); } /* VertexCT */ /* * Print the validity Domain 'D' of a parametric polyhedron */ void Print_Domain(FILE *DST, Polyhedron *D, const char **pname) { int l, v; int first; POL_ENSURE_FACETS(D); POL_ENSURE_VERTICES(D); for(l=0;lNbConstraints;++l) { fprintf(DST, " "); first = 1; for(v=1;v<=D->Dimension;++v) { if(value_notzero_p(D->Constraint[l][v])) { if(value_one_p(D->Constraint[l][v])) { if(first) fprintf(DST, "%s ", pname[v-1]); else fprintf(DST, "+ %s ", pname[v-1] ); } else if(value_mone_p(D->Constraint[l][v])) fprintf(DST, "- %s ", pname[v-1] ); else { if(value_pos_p(D->Constraint[l][v]) && !first ) fprintf(DST, "+ " ); value_print(DST,VALUE_FMT,D->Constraint[l][v]); fprintf(DST,"%s ",pname[v-1]); } first = 0; } } if(value_notzero_p(D->Constraint[l][v])) { if(value_pos_p(D->Constraint[l][v]) && !first) fprintf(DST,"+"); fprintf(DST," "); value_print(DST,VALUE_FMT,D->Constraint[l][v]); } fprintf(DST,(value_notzero_p(D->Constraint[l][0])) ?" >= 0":" = 0"); fprintf(DST, "\n" ); } fprintf(DST, "\n"); if( D->next ) { fprintf( DST, "UNION\n" ); Print_Domain( DST, D->next, pname ); } return; } /* Print_Domain */ /* * Given a list of parametrized vertices and an array of parameter names, Print * a list of parametrized vertices in a comprehensible format. */ void Param_Vertices_Print(FILE *DST, Param_Vertices *PV, const char **param_names) { Polyhedron *poly; while(PV) { fprintf(DST, "Vertex :\n" ); Print_Vertex(DST,PV->Vertex,param_names); /* Pour le domaine : */ fprintf(DST, " If :\n" ); poly = Constraints2Polyhedron(PV->Domain,200); Print_Domain(DST,poly,param_names); Domain_Free(poly); PV = PV->next; } return; } /* Param_Vertices_Print */ /* * Given a polyhedron 'Din' in combined data and parametre space, a context * polyhedron 'Cin' representing the constraints on the parameter space and * a working space size 'working_space', return a parametric polyhedron with * a list of distinct validity domains and a complete list of valid vertices * associated to each validity domain. */ Param_Polyhedron *Polyhedron2Param_Domain(Polyhedron *Din,Polyhedron *Cin,int working_space) { Param_Polyhedron *result; Param_Domain *D; POL_ENSURE_FACETS(Din); POL_ENSURE_VERTICES(Din); POL_ENSURE_FACETS(Cin); POL_ENSURE_VERTICES(Cin); if (emptyQ(Din) || emptyQ(Cin)) return NULL; #ifdef DEBUGPP fprintf(stderr,"Polyhedron2Param_Polyhedron algorithm starting at : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif /* Find the m-faces, keeping the corresponding domains */ /* in the linked list PDomains */ result = Find_m_faces(&Din,Cin,1,working_space,NULL,NULL); #ifdef DEBUGPP if(result) fprintf(stderr, "Number of vertices : %d\n",result->nbV); fprintf(stderr,"Vertices found at : %.2fs\n",(float)clock()/CLOCKS_PER_SEC); #endif /* Processing of PVResult and PDomains */ if(result && Cin->Dimension>0) /* at least 1 parameter */ Compute_PDomains(result->D,result->nbV,working_space); if(result && CEqualities) for(D=result->D;D;D=D->next) D->Domain = Add_CEqualities(D->Domain); Polyhedron_Free(CEqualities); #ifdef DEBUGPP fprintf(stderr, "domains found at : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif return(result); } /* Polyhedon2Param_Domain */ /* * */ Param_Polyhedron *Polyhedron2Param_SimplifiedDomain(Polyhedron **Din,Polyhedron *Cin,int working_space,Polyhedron **CEq,Matrix **CT) { Param_Polyhedron *result; assert(CEq != NULL); assert(CT != NULL); POL_ENSURE_FACETS(*Din); POL_ENSURE_VERTICES(*Din); POL_ENSURE_FACETS(Cin); POL_ENSURE_VERTICES(Cin); #ifdef DEBUGPP fprintf(stderr,"Polyhedron2Param_Polyhedron algorithm starting at : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif /* Find the m-faces, keeping the corresponding domains */ /* in the linked list PDomains */ result = Find_m_faces(Din,Cin,1,working_space,CEq,CT); #ifdef DEBUGPP if(result) fprintf(stderr, "Number of vertices : %d\n",result->nbV); fprintf(stderr,"Vertices found at : %.2fs\n",(float)clock()/CLOCKS_PER_SEC); #endif /* Processing of PVResult and PDomains */ if(result && Cin->Dimension>0) /* at least 1 parameter */ Compute_PDomains(result->D,result->nbV,working_space); /* Removed this, Vin100, March 01 */ /* if(result && CEqualities ) for(D=result->D;D;D=D->next) D->Domain = Add_CEqualities(D->Domain); */ #ifdef DEBUGPP fprintf(stderr, "domains found at : %.2fs\n", (float)clock()/CLOCKS_PER_SEC); #endif return(result); } /* Polyhedron2Param_SimplifiedDomain */ /* * Free the memory allocated to a list of validity domain of a parametrized * polyhedron. */ void Param_Domain_Free(Param_Domain *PD) { Param_Domain *next_pd; while(PD) { free(PD->F); Domain_Free(PD->Domain); next_pd = PD->next; free(PD); PD = next_pd; } return; } /* Param_Domain_Free */ /* * Free the memory allocated to a parametric polyhedron 'P' */ void Param_Polyhedron_Free(Param_Polyhedron *P) { if (!P) return; Param_Vertices_Free(P->V); Param_Domain_Free(P->D); if (P->Constraints) Matrix_Free(P->Constraints); if (P->Rays) Matrix_Free(P->Rays); free(P); return; } /* Param_Polyhedron_Free */ /* * Scales the parametric polyhedron such that all vertices are integer. */ void Param_Polyhedron_Scale_Integer(Param_Polyhedron *PP, Polyhedron **P, Value *det, unsigned MaxRays) { int i; int nb_param, nb_vars; Vector *denoms; Param_Vertices *V; Value global_var_lcm; Matrix *expansion; value_set_si(*det, 1); if (!PP->nbV) return; nb_param = PP->D->Domain->Dimension; nb_vars = PP->V->Vertex->NbRows; /* Scan the vertices and make an orthogonal expansion of the variable space */ /* a- prepare the array of common denominators */ denoms = Vector_Alloc(nb_vars); value_init(global_var_lcm); /* b- scan the vertices and compute the variables' global lcms */ for (V = PP->V; V; V = V->next) for (i = 0; i < nb_vars; i++) value_lcm(denoms->p[i], denoms->p[i], V->Vertex->p[i][nb_param+1]); value_set_si(global_var_lcm, 1); for (i = 0; i < nb_vars; i++) { value_multiply(*det, *det, denoms->p[i]); value_lcm(global_var_lcm, global_var_lcm, denoms->p[i]); } /* scale vertices */ for (V = PP->V; V; V = V->next) for (i = 0; i < nb_vars; i++) { Vector_Scale(V->Vertex->p[i], V->Vertex->p[i], denoms->p[i], nb_param+1); Vector_Normalize(V->Vertex->p[i], nb_param+2); } /* the expansion can be actually writen as global_var_lcm.L^{-1} */ /* this is equivalent to multiply the rows of P by denoms_det */ for (i = 0; i < nb_vars; i++) value_division(denoms->p[i], global_var_lcm, denoms->p[i]); /* OPT : we could use a vector instead of a diagonal matrix here (c- and d-).*/ /* c- make the quick expansion matrix */ expansion = Matrix_Alloc(nb_vars+nb_param+1, nb_vars+nb_param+1); for (i = 0; i < nb_vars; i++) value_assign(expansion->p[i][i], denoms->p[i]); for (i = nb_vars; i < nb_vars+nb_param+1; i++) value_assign(expansion->p[i][i], global_var_lcm); /* d- apply the variable expansion to the polyhedron */ if (P) *P = Polyhedron_Preimage(*P, expansion, MaxRays); Matrix_Free(expansion); value_clear(global_var_lcm); Vector_Free(denoms); } polylib-5.22.5.orig/source/kernel/matrix_permutations.c0000644000175000017500000002225211341227527024151 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * $Id: matrix_permutations.c,v 1.8 2006/10/01 02:10:46 meister Exp $ * * Permutations on matrices Matrices are seen either as transformations * (mtransformation) or as polyhedra (mpolyhedron) * @author B. Meister * LSIIT -ICPS * UMR 7005 CNRS * Louis Pasteur University (ULP), Strasbourg, France * * Permutations are just indirection vectors: the k^th element of a permutation * vector is the position of the k^th variable in the permuted object. */ #include #include /** utility function : bit count (i know, there are faster methods) */ unsigned int nb_bits(unsigned long long int x) { unsigned int i,n=0; unsigned long long int y=x; for (i=0; i< 64; i++) { n+=y%2; y>>=1; } return n; } /** Gives the inverse permutation vector of a permutation vector * @param perm the permutation vector * @param */ unsigned int * permutation_inverse(unsigned int * perm, unsigned int nb_elems) { int i; unsigned int * inv_perm = (unsigned int *)malloc(sizeof(unsigned int) * nb_elems); for (i=0; i< nb_elems; i++) inv_perm[perm[i]] = i; return inv_perm; } /** * Given a linear tranformation on initial variables, and a variable * permutation, computes the tranformation for the permuted variables. perm is * a vector giving the new "position of the k^th variable, k \in [1..n] we can * call it a "permutation vector" if you wish transf[x][y] -> * permuted[permutation(x)][permutation(y)] */ Matrix * mtransformation_permute(Matrix * transf, unsigned int * permutation) { Matrix * permuted; unsigned int i,j; /* the transformation is supposed to be from Q^n to Q^n, so a square matrix. */ assert(transf->NbRows==transf->NbColumns); permuted = Matrix_Alloc(transf->NbRows, transf->NbRows); for (i= 0; i< transf->NbRows; i++) { for (j= 0; j< transf->NbRows; j++) { value_assign(permuted->p[permutation[i]][permutation[j]], transf->p[i][j]); } } return permuted; } /** permutes the variables of the constraints of a polyhedron * @param polyh the constraints of the polyhedron * @param permutation a permutation vector */ Matrix * mpolyhedron_permute(Matrix * polyh, unsigned int * permutation) { unsigned int i,j; Matrix * permuted = Matrix_Alloc(polyh->NbRows, polyh->NbColumns); for (i= 0; i< polyh->NbRows; i++) { value_assign(permuted->p[i][0], polyh->p[i][0]); for (j= 1; j< polyh->NbColumns; j++) { value_assign(permuted->p[i][permutation[j-1]+1], polyh->p[i][j]); } } return permuted; } /** permutes the variables of the constraints of a polyhedron * @param C the original set of constraints * @param perm a permutation vector * @param Cp (returned) the set of constraints whose variables are * permuted. Allocated if set to NULL, assumed to be already allocated if not. */ void Constraints_permute(Matrix * C, unsigned int * perm, Matrix ** Cp) { unsigned int i,j; if ((*Cp)==NULL) { (*Cp) = Matrix_Alloc(C->NbRows, C->NbColumns); } else { assert((*Cp)->NbRows == C->NbRows && (*Cp)->NbColumns==C->NbColumns); } for (i= 0; i< C->NbRows; i++) { value_assign((*Cp)->p[i][0], C->p[i][0]); for (j= 1; j< C->NbColumns; j++) { value_assign((*Cp)->p[i][perm[j-1]+1], C->p[i][j]); } } } /* Constraints_permute */ /** Given a set of equalities, find a set of variables that can be * eliminated using these equalities. The variables that we agree to eliminate * are in a zone of contiguous variables (or parameters).

* Notes:

  • brute force, surely enhanceable algorithm
  • limited number of variables in the zone: limit = bitwidth of long long
* @param Eqs the matrix of equalities. * @param start the rank of the first variable (inclusive) of the zone in Eqs * @param end the rank of the last variable (inclusive) of the zone * return a bitfield where bits set to one define the variables to eliminate */ unsigned long long int eliminable_vars(Matrix * Eqs, unsigned start, unsigned end) { unsigned long long int combination; unsigned int i,j,k; Matrix * M, * H, * Q, *U; Matrix * Square_Mat, *Eqs2; unsigned nb_vars = end - start + 1 ; Polyhedron * OverConstrained; assert (start>0 && end < Eqs->NbColumns-1); /* if the affine hull is overconstrained, return 0 */ if (Eqs->NbRows >nb_vars) { /* FIXME: there is a magic maximum number of rays here */ Eqs2 = Matrix_Copy(Eqs); OverConstrained = Constraints2Polyhedron(Eqs2, Eqs->NbColumns*Eqs->NbColumns); Matrix_Free(Eqs2); if (emptyQ(OverConstrained)) { Polyhedron_Free(OverConstrained); return 0; } Polyhedron_Free(OverConstrained); } /* do not accept 0 = 0 equalities */ for (i=0; i< Eqs->NbRows; i++) { assert (!Vector_IsZero(Eqs->p[i], Eqs->NbColumns)); } Square_Mat= Matrix_Alloc(Eqs->NbRows, Eqs->NbRows); /* There are Eqs->NbRows variables to eliminate. Generate all the combinations of Eqs->NbRows variables (-> bits to 1 in the word "combination") among nb_vars WARNING : we assume here that we have not more than 64 variables. You may convert it to use GNU MP to set it to an infinite number of bits */ for (combination = ((unsigned long long int) 1<<(Eqs->NbRows))-1; (combination < ((unsigned long long int) 1 << nb_vars)) ; combination++) { if (nb_bits(combination) == Eqs->NbRows) { k=0; /* 1- put the m colums in a square matrix */ for (j=0; j< nb_vars; j++) { if ((combination>>j)%2) { for (i=0; i< Eqs->NbRows; i++) { value_assign(Square_Mat->p[i][k], Eqs->p[i][j+start]); } k++; } } /* 2- see if the matrix is full-row-rank */ right_hermite(Square_Mat, &H, &Q, &U); Matrix_Free(Q); Matrix_Free(U); /* if it is full-row-rank, we have found a set of variables that can be eliminated. */ if ( value_notzero_p((H->p[Eqs->NbRows-1][Eqs->NbRows-1])) ) { Matrix_Free(Square_Mat); Matrix_Free(H); return combination; } Matrix_Free(H); } } Matrix_Free(Square_Mat); return (unsigned long long int) 0; } /* eliminable_vars */ /** * finds a valid permutation : for a set of m equations, find m variables that * will be put at the beginning (to be eliminated). * Note: inherits the limited the number of variables from * eliminable_vars */ unsigned int * find_a_permutation(Matrix * Eqs, unsigned int nb_parms) { unsigned int i, j, k; int nb_vars = Eqs->NbColumns-nb_parms-2; unsigned long long int combination; unsigned int * permutation = (unsigned int *)malloc(sizeof(unsigned int) * Eqs->NbColumns-1); /* 1- find a set of variables to eliminate */ if ((combination = eliminable_vars(Eqs, 1, nb_vars)) == 0) { /* if it is impossible to eliminate enough variables, return error code */ return NULL; } /* 2- make the permutation matrix * a- deal with the variables */ k=0; for (i=0; i< nb_vars; i++) { /* if the variable has to be eliminated, put them at the beginning */ if (combination%2) { permutation[i] = k; k++; } /* if not, put the variables at the end */ else permutation[i] = Eqs->NbRows+nb_parms+ i-k; combination>>=1; } /* b- deal with the parameters */ for (i=0; i< nb_parms; i++) { permutation[nb_vars+i] = Eqs->NbRows+i; } /* c- deal with the constant */ permutation[Eqs->NbColumns-2] = Eqs->NbColumns-2; return permutation; } /* find_a_permutation */ /** computes the permutation of variables and parameters, according to some * variables to keep. put the variables not to be kept at the beginning, then * the parameters and finally the variables to be kept. strongly related to * the function compress_to_full_dim2 */ unsigned int * permutation_for_full_dim2(unsigned int * vars_to_keep, unsigned int nb_keep, unsigned int nb_vars_parms, unsigned int nb_parms) { unsigned int * permutation = (unsigned int*)malloc(sizeof(unsigned int) * nb_vars_parms+1); unsigned int i; int cur_keep =0, cur_go = 0;/*current number of variables to eliminate/keep*/ for (i=0; i< nb_vars_parms - nb_parms; i++) { if (i==vars_to_keep[cur_keep]) { permutation[i] = nb_vars_parms-nb_keep+cur_keep; cur_keep++; } else { permutation[i] = cur_go; cur_go++; } } /* parameters are just left-shifted */ for (i=0; i< nb_parms; i++) permutation[i+nb_vars_parms-nb_parms] = i+nb_vars_parms-nb_parms-nb_keep; /* contants stay where they are */ permutation[nb_vars_parms] = nb_vars_parms; return permutation; } /* permutation_for_full_dim2 */ polylib-5.22.5.orig/source/ehrhart/0000755000175000017500000000000011341243106020030 5ustar sylvestresylvestrepolylib-5.22.5.orig/source/ehrhart/homogenization.c0000644000175000017500000001211711341227527023241 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** homogenization.c copyright 2004-2005 Bavo Nootaert **/ #include #include #include #include #include static evalue *dehomogenize_periodic(enode *en); static evalue *dehomogenize_polynomial(enode *en); Polyhedron *homogenize(Polyhedron *P, unsigned MAXRAYS) { Matrix M, *M2; /* Pretend P is a Matrix for a second */ M.NbRows = P->NbConstraints; M.NbColumns = P->Dimension+2; M.p_Init = P->p_Init; M.p = P->Constraint; M2 = AddANullColumn(&M); P = Constraints2Polyhedron(M2, MAXRAYS); Matrix_Free(M2); return P; } /** dehomogenize an evalue. The last parameter (nb_param) is replaced by 1. This function is mutually recursive with dehomogenize_enode. **/ void dehomogenize_evalue(evalue *ep, int nb_param){ evalue *w; /** cannot dehomogenize rationals **/ if (value_zero_p(ep->d)){ /** we need to replace the last parameter **/ if (ep->x.p->pos == nb_param){ if (ep->x.p->type == periodic && ep->x.p->size > 1){ w = dehomogenize_periodic(ep->x.p); } else{ w = dehomogenize_polynomial(ep->x.p); } free_evalue_refs(ep); memcpy(ep, w, sizeof(evalue)); free(w); } else{ /** Not the last parameter. Recurse **/ dehomogenize_enode(ep->x.p, nb_param); } } } /** dehomogenize all evalues in an enode. This function is mutually recursive with dehomogenize_evalue. **/ void dehomogenize_enode(enode *p, int nb_param){ evalue *temp; int i; for (i = 0; i < p->size; i++){ dehomogenize_evalue(&p->arr[i], nb_param); } } /** return the 1st element of an enode representing a periodic **/ static evalue *dehomogenize_periodic(enode *en){ evalue *w; assert(en->type == periodic); assert(en->size > 1); assert(value_notzero_p(en->arr[1].d)); w = (evalue*)malloc(sizeof(evalue)); value_init(w->d); value_init(w->x.n); value_assign(w->d, en->arr[1].d); value_assign(w->x.n, en->arr[1].x.n); return w; } /** dehomogenize a polynomial. Assume the enode contains a polynomial in one variable, the homogenous parameter. Returns an new evalue, representing a rational. **/ static evalue *dehomogenize_polynomial(enode *en){ evalue *enn; evalue *ev; int i; double som; Value num, den, gcd, f1, f2; assert(en->type == polynomial); som = 0; value_init(num); value_init(den); value_init(gcd); value_init(f1); value_init(f2); value_set_si(den, 1); /** enumerate over all coefficients (which are either periodic or rational, but not polynomial) **/ for (i = 0; i < en->size; i++){ if (value_zero_p(en->arr[i].d)){ if (en->arr[i].x.p->size > 1) ev = &en->arr[i].x.p->arr[1]; else ev = &en->arr[i].x.p->arr[0]; } else{ ev = &en->arr[i]; } /** add ev (fraction) to num/den **/ value_multiply(f1, den, ev->x.n); value_multiply(f2, num, ev->d); value_addto(num, f1, f2); value_multiply(den, den, ev->d); } /** simplify num/den **/ value_gcd(gcd, num, den); value_divexact(num, num, gcd); value_divexact(den, den, gcd); /** create new evalue representing num/den**/ enn = (evalue*)malloc(sizeof(evalue)); value_init(enn->d); value_init(enn->x.n); value_assign(enn->d, den); value_assign(enn->x.n, num); /** cleanup **/ value_clear(gcd); value_clear(f1); value_clear(f2); value_clear(num); value_clear(den); return enn; } /** dehomogenize a polyhedron. Assume the polyhedron p is homogenous. Returns a new polyhedron. **/ Polyhedron *dehomogenize_polyhedron(Polyhedron *p, int maxRays){ Matrix *constr, *constrh; Polyhedron *ph; int i; constr = Polyhedron2Constraints(p); constrh = Matrix_Alloc(constr->NbRows, constr->NbColumns - 1); for (i = 0; i < constr->NbRows; i++){ Vector_Copy(constr->p[i], constrh->p[i], constr->NbColumns - 1); } ph = Constraints2Polyhedron(constrh, maxRays); Matrix_Free(constr); Matrix_Free(constrh); return ph; } /** dehomogenize an enumeration. Replaces each validity domain and Ehrhart polynomial in the Enumeration en with the dehomogenized form. **/ void dehomogenize_enumeration(Enumeration* en, int nb_params, int maxRays){ Enumeration *en2; Polyhedron *vd; for (en2 = en; en2; en2 = en2->next) { vd = dehomogenize_polyhedron(en2->ValidityDomain, maxRays); Polyhedron_Free(en2->ValidityDomain); en2->ValidityDomain = vd; dehomogenize_evalue(&en2->EP, nb_params); } } polylib-5.22.5.orig/source/ehrhart/ranking.c0000644000175000017500000001676711341227527021657 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /** * Tools to compute the ranking function of an iteration J: the number of * integer points in P that are lexicographically inferior to J * B. Meister * 6/2005 * LSIIT-ICPS, UMR 7005 CNRS Universite Louis Pasteur * HiPEAC Network */ #include #include /** * Returns a list of polytopes needed to compute * the number of points in P that are lexicographically * smaller than a given point in D. * Only the first dim dimensions are taken into account * for computing the lexsmaller relation. * The remaining variables are assumed to be extra * existential/control variables. * When P == D, this is the conventional ranking function. * P and D are assumed to have the same parameter domain C. * * The first polyhedron in the list returned is the * updated context: a combination of D and C or an extended C. * * The order of the variables in the remaining polyhedra is * - first dim variables of P * - existential variables of P * - existential variables of D * - first dim variables of D * - the parameters */ Polyhedron *LexSmaller(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS) { unsigned i, j, k, r; unsigned nb_parms = C->Dimension; unsigned nb_vars = dim; unsigned P_extra = P->Dimension - nb_vars - nb_parms; unsigned D_extra = D->Dimension - nb_vars - nb_parms; unsigned nb_new_parms; unsigned ncons; Matrix * cur_element, * C_times_J, * Klon; Polyhedron * P1, *C1; Polyhedron * lexico_lesser_union = NULL; POL_ENSURE_INEQUALITIES(C); POL_ENSURE_INEQUALITIES(D); POL_ENSURE_INEQUALITIES(P); assert(P->Dimension >= C->Dimension + dim); assert(D->Dimension >= C->Dimension + dim); nb_new_parms = nb_vars; /* the number of variables must be positive */ if (nb_vars<=0) { printf("\nRanking > No variables, returning NULL.\n"); return NULL; } /* * if D has extra variables, then we can't squeeze the contraints * of D in the new context, so we simply add them to each element. */ if (D_extra) cur_element = Matrix_Alloc(P->NbConstraints+D->NbConstraints+nb_new_parms, P->Dimension+D_extra+nb_new_parms+2); else cur_element = Matrix_Alloc(P->NbConstraints+nb_new_parms, P->Dimension+D_extra+nb_new_parms+2); /* 0- Put P in the first rows of cur_element */ for (i=0; i < P->NbConstraints; i++) { Vector_Copy(P->Constraint[i], cur_element->p[i], nb_vars+P_extra+1); Vector_Copy(P->Constraint[i]+1+nb_vars+P_extra, cur_element->p[i]+1+nb_vars+P_extra+D_extra+nb_new_parms, nb_parms+1); } ncons = P->NbConstraints; if (D_extra) { for (i=0; i < D->NbConstraints; i++) { r = P->NbConstraints + i; Vector_Copy(D->Constraint[i], cur_element->p[r], 1); Vector_Copy(D->Constraint[i]+1, cur_element->p[r]+1+nb_vars+P_extra+D_extra, nb_new_parms); Vector_Copy(D->Constraint[i]+1+nb_new_parms, cur_element->p[r]+1+nb_vars+P_extra, D_extra); Vector_Copy(D->Constraint[i]+1+nb_new_parms+D_extra, cur_element->p[r]+1+nb_vars+P_extra+D_extra+nb_new_parms, nb_parms+1); } ncons += D->NbConstraints; } /* 1- compute the Ehrhart polynomial of each disjoint polyhedron defining the lexicographic order */ for (k=0, r = ncons; k < nb_vars; k++, r++) { /* a- build the corresponding matrix * the nb of rows of cur_element is fake, so that we do not have to * re-allocate it. */ cur_element->NbRows = r+1; /* convert the previous (strict) inequality into an equality */ if (k>=1) { value_set_si(cur_element->p[r-1][0], 0); value_set_si(cur_element->p[r-1][cur_element->NbColumns-1], 0); } /* build the k-th inequality from P */ value_set_si(cur_element->p[r][0], 1); value_set_si(cur_element->p[r][k+1], -1); value_set_si(cur_element->p[r][nb_vars+P_extra+D_extra+k+1], 1); /* we want a strict inequality */ value_set_si(cur_element->p[r][cur_element->NbColumns-1], -1); #ifdef ERDEBUG show_matrix(cur_element); #endif /* b- add it to the current union as Constraints2Polyhedron modifies its input, we must clone cur_element */ Klon = Matrix_Copy(cur_element); P1 = Constraints2Polyhedron(Klon, MAXRAYS); Matrix_Free(Klon); P1->next = lexico_lesser_union; lexico_lesser_union = P1; } /* 2- as we introduce n parameters, we must introduce them into the context * as well. * The added constraints are P.M.(J N 1 )^T >=0 */ if (D_extra) C_times_J = Matrix_Alloc(C->NbConstraints, nb_new_parms+nb_parms+2); else C_times_J = Matrix_Alloc(C->NbConstraints + D->NbConstraints, D->Dimension+2); /* copy the initial context while adding the new parameters */ for (i = 0; i < C->NbConstraints; i++) { value_assign(C_times_J->p[i][0], C->Constraint[i][0]); Vector_Copy(C->Constraint[i]+1, C_times_J->p[i]+1+nb_new_parms, nb_parms+1); } /* copy constraints from evaluation domain */ if (!D_extra) for (i = 0; i < D->NbConstraints; i++) Vector_Copy(D->Constraint[i], C_times_J->p[C->NbConstraints+i], D->Dimension+2); #ifdef ERDEBUG show_matrix(C_times_J); #endif C1 = Constraints2Polyhedron(C_times_J, POL_NO_DUAL); /* 4- clean up */ Matrix_Free(cur_element); Matrix_Free(C_times_J); C1->next = P1; return C1; } /* LexSmaller */ /** * Returns the number of points in P that are lexicographically * smaller than a given point in D. * Only the first dim dimensions are taken into account * for computing the lexsmaller relation. * The remaining variables are assumed to be extra * existential/control variables. * When P == D, this is the conventional ranking function. * P and D are assumed to have the same parameter domain C. * The variables in the Enumeration correspond to the first dim variables * in D followed by the parameters of D (the variables of C). */ Enumeration *Polyhedron_LexSmallerEnumerate(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS) { Enumeration * ranking; Polyhedron *RC, *RD; RC = LexSmaller(P, D, dim, C, MAXRAYS); RD = RC->next; RC->next = NULL; /* Compute the ranking, which is the sum of the Ehrhart polynomials of the n disjoint polyhedra we just put in P1. */ /* OPT : our polyhdera are (already) disjoint, so Domain_Enumerate does probably too much work uselessly */ ranking = Domain_Enumerate(RD, RC, MAXRAYS, NULL); Domain_Free(RD); Polyhedron_Free(RC); return ranking; } /* * Returns a function that assigns a unique number to each point in the * polytope P ranging from zero to (number of points in P)-1. * The order of the numbers corresponds to the lexicographical order. * * C is the parameter context of the polytope */ Enumeration *Polyhedron_Ranking(Polyhedron *P, Polyhedron *C, unsigned MAXRAYS) { return Polyhedron_LexSmallerEnumerate(P, P, P->Dimension-C->Dimension, C, MAXRAYS); } polylib-5.22.5.orig/source/ehrhart/eval_ehrhart.c0000644000175000017500000001374611341227527022664 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /************************************************/ /* eval_ehrhart.c */ /* functions to evaluate an Ehrhart polynomial. */ /* written by Emmanuel Jeannot (c) 1997. */ /* Emmanuel.Jeannot@ens-lyon.fr */ /* http://www.ens-lyon.fr/~ejeannot */ /* */ /* modified 1998, 2000, Vincent Loechner */ /* (ArithmetiqueLib, Param_Names) */ /************************************************/ #include #include #include #include #include /* #define EVAL_EHRHART_DEBUG */ /********************************************************/ /* function in domain */ /* check if the parameters in list_args */ /* verifies the constraints of Domain P */ /********************************************************/ int in_domain(Polyhedron *P, Value *list_args) { int col,row; Value v; /* value of the constraint of a row when parameters are instanciated*/ if( !P ) return( 0 ); POL_ENSURE_INEQUALITIES(P); value_init(v); /* P->Constraint constraint matrice of polyhedron P */ for(row=0;rowNbConstraints;row++) { value_assign(v,P->Constraint[row][P->Dimension+1]); /*constant part*/ for(col=1;colDimension+1;col++) { value_addmul(v, P->Constraint[row][col], list_args[col-1]); } if (value_notzero_p(P->Constraint[row][0])) { /*if v is not >=0 then this constraint is not respected */ if (value_neg_p(v)) { value_clear(v); return( in_domain(P->next, list_args) ); } } else { /*if v is not = 0 then this constraint is not respected */ if (value_notzero_p(v)) { value_clear(v); return( in_domain(P->next, list_args) ); } } } /* if not return before this point => all the constraints are respected */ value_clear(v); return 1; } /* in_domain */ /****************************************************/ /* function compute enode */ /* compute the value of enode p with parameters */ /* list "list_args */ /* compute the polynomial or the periodic */ /****************************************************/ static double compute_enode(enode *p, Value *list_args) { int i; Value m, param; double res=0.0; if (!p) return(0.); value_init(m); value_init(param); if (p->type == polynomial) { if (p->size > 1) value_assign(param,list_args[p->pos-1]); /* Compute the polynomial using Horner's rule */ for (i=p->size-1;i>0;i--) { res +=compute_evalue(&p->arr[i],list_args); res *=VALUE_TO_DOUBLE(param); } res +=compute_evalue(&p->arr[0],list_args); } else if (p->type == periodic) { value_assign(m,list_args[p->pos-1]); /* Choose the right element of the periodic */ value_set_si(param,p->size); value_pmodulus(m,m,param); res = compute_evalue(&p->arr[VALUE_TO_INT(m)],list_args); } value_clear(m); value_clear(param); return res; } /* compute_enode */ /*************************************************/ /* return the value of Ehrhart Polynomial */ /* It returns a double, because since it is */ /* a recursive function, some intermediate value */ /* might not be integral */ /*************************************************/ double compute_evalue(evalue *e,Value *list_args) { double res; if (value_notzero_p(e->d)) { if (value_notone_p(e->d)) res = VALUE_TO_DOUBLE(e->x.n) / VALUE_TO_DOUBLE(e->d); else res = VALUE_TO_DOUBLE(e->x.n); } else res = compute_enode(e->x.p,list_args); return res; } /* compute_evalue */ /****************************************************/ /* function compute_poly : */ /* Check for the good validity domain */ /* return the number of point in the Polyhedron */ /* in allocated memory */ /* Using the Ehrhart pseudo-polynomial */ /****************************************************/ Value *compute_poly(Enumeration *en,Value *list_args) { Value *tmp; /* double d; int i; */ tmp = (Value *) malloc (sizeof(Value)); assert(tmp != NULL); value_init(*tmp); value_set_si(*tmp,0); if(!en) return(tmp); /* no ehrhart polynomial */ if(en->ValidityDomain) { if(!en->ValidityDomain->Dimension) { /* no parameters */ value_set_double(*tmp,compute_evalue(&en->EP,list_args)+.25); return(tmp); } } else return(tmp); /* no Validity Domain */ while(en) { if(in_domain(en->ValidityDomain,list_args)) { #ifdef EVAL_EHRHART_DEBUG Print_Domain(stdout,en->ValidityDomain,NULL); print_evalue(stdout,&en->EP,NULL); #endif /* d = compute_evalue(&en->EP,list_args); i = d; printf("(double)%lf = %d\n", d, i ); */ value_set_double(*tmp,compute_evalue(&en->EP,list_args)+.25); return(tmp); } else en=en->next; } value_set_si(*tmp,0); return(tmp); /* no compatible domain with the arguments */ } /* compute_poly */ polylib-5.22.5.orig/source/ehrhart/ext_ehrhart.c0000644000175000017500000006540311341227527022532 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #define WS 200 /* #define UE_DEBUG */ typedef struct _Polyhedron_union { Enumeration *pt; struct _Polyhedron_union *next;} Polyhedron_union; static int ppcm1 (int a, int b); Matrix *CalcBase( Matrix *R); /**** ker.c ****/ static void Soustraire_ligne(Matrix *R, int l1, int l2, int piv ); static int existepivot( Matrix *R, int l ); static void swap_line(Matrix *R, int l1, int l2); /* Caclule une base du noyau de l'application definie par la matrice _carree_ R (completee par des 0..0) */ /* /!\ R est alteree par cette fonction. */ Matrix *CalcBase( Matrix *R ) { Matrix *B/*,*BTran*/; /* matrice des vect. de la base */ int i, j; Value p; int l; /* ligne en cours de `pivotage' */ int lnn; int dimbase; int u; /* vecteur util en cours de calcul */ Value som; int c; /* diagonalisation de R : algo du pivot */ /* avec conservation des pivots nuls */ for( l=0 ; lNbRows ; ++l ) { /* cherche le prochain pivot non nul */ if( (lnn=existepivot(R,l)) != -1 ) { swap_line( R, l, lnn ); /* met la colonne dessous a 0 */ for( j=l+1 ; jNbRows ; ++j ) if(value_notzero_p( R->p[j][l]) ) Soustraire_ligne( R, l, j, l ); /* et celle dessus aussi */ for( j=0 ; jp[j][l]) ) Soustraire_ligne( R, l, j, l ); } /* s'ils sont tous nuls on passe au suivant */ /* en laissant cette ligne inchangee. */ } dimbase = 0; for( l=0 ; lNbRows ; ++l ) if( value_zero_p(R->p[l][l]) ) ++dimbase; /* = nb de 0 dans la diagonale */ B = Matrix_Alloc( dimbase, R->NbRows ); l=0; for( u=0 ; up[l][l]) ) ++l; /* calcul effectif de ce vecteur : chaque coord en commencant par le bas */ for( i=R->NbRows-1 ; i>l ; --i ) value_set_si(B->p[u][i], 0); value_set_si(B->p[u][l], 1); for( i=l-1 ; i>=0 ; --i ) /* i=chaque coord du vecteur */ { if(value_zero_p( R->p[i][i]) ) /* on a deux 0... un seul dans */ /* ce vect util suffit */ value_set_si(B->p[u][i],0); else { /* somme des coef deja calcules * coef dans la matrice */ value_set_si(som,0); for( c=l ; c>i ; --c ) { value_addmul(som, R->p[i][c], B->p[u][c]); value_multiply(B->p[u][c] ,B->p[u][c] , R->p[i][i]); } value_oppose(B->p[u][i] , som ); } } /* reste a faire le pgcd du vecteur et a l'orienter */ value_set_si(p,0); for( i=0 ; iNbRows ; ++i ) value_gcd(p, p, B->p[u][i]); if( value_zero_p(p)) value_set_si(p,1); for( i=0 ; iNbRows && value_zero_p(B->p[u][i]); ++i ) ; if( iNbRows ) if( value_neg_p(B->p[u][i]) ) value_oppose( p,p ); for( i=0 ; iNbRows ; ++i ) value_divexact(B->p[u][i], B->p[u][i], p); /* incrementer le compteur de lignes */ ++l; } return B; } /* fonction qui calcule les vect generateurs de l'espace vectoriel contenant le polyhedre P */ /* Matrix *CalcPolyhedronBase( Polyhedron *P ) { Matrix *R; Matrix *B; int n, lines; if( emptyQ(P) ) return( Matrix_Alloc( 0, P->Dimension ) ); */ /* pas de vect. gen */ /* R = Matrix_Alloc( P->Dimension, P->Dimension ); */ /* recopie le 'lineality space' du polyedre dans la matrice R */ /* for( lines=0,n=0 ; nNbConstraints ; ++n ) { if( P->Constraint[n][0]==0 ) */ /* c'est une direction definissant un ss-espace */ /* { memcpy( &R->p[lines][0], &P->Constraint[n][1], sizeof(int)*P->Dimension ); ++lines; } } */ /* remplit le reste de 0..0 */ /* for( ; linesNbRows ; ++lines ) memset( &R->p[lines][0], 0, sizeof(int)*P->Dimension ); B = CalcBase( R ); Matrix_Free( R ); return( B ); }*/ /* fonction qui calcule l'espace vectoriel non parametre de dimension dim contenant le polyhedre parametre P */ /* les _egalites_ sont stockees par la polylib sous forme triangulaire superieure donc il suffit de prendre les premieres. */ /*Matrix *CalcEVPolyhedronNP( Polyhedron *P, int dim ) { Matrix *R; Matrix *B; int n, lines; if( emptyQ(P) ) */ /* pas de vect. gen */ /* { B = Matrix_Alloc( 1, dim ); */ /* on ne peut pas allouer 0 lignes ! */ /* B->NbRows = 0; return( B ); } R = Matrix_Alloc( dim, dim ); */ /* recopie le 'lineality space' du polyedre dans la matrice R */ /* for( lines=0,n=0 ; nNbConstraints && linesConstraint[n][0]==0 ) */ /* c'est une direction definissant un ss-espace */ /* { memcpy( &R->p[lines][0], &P->Constraint[n][1], sizeof(int)*P->Dimension ); ++lines; } } */ /* remplit le reste de 0..0 */ /* for( ; linesNbRows ; ++lines ) memset( &R->p[lines][0], 0, sizeof(int)*dim ); B = CalcBase( R ); Matrix_Free( R ); return( B ); }*/ /* renvoie la ligne sur laquelle on a trouve un coef non nul */ /* pareil mais cherche dans toutes les lignes */ /* et -1 s'il n'y en a pas. */ static int existepivot( Matrix *R, int l ) { int j, c; for( j=l ; jNbRows ; ++j ) if(value_notzero_p( R->p[j][l]) ) return( j ); /* on ne l'a pas trouve pour l'instant... on cherche au dessus */ /* les lignes ayant que des 0 jusqu'a la position l */ for( j=0 ; jp[j][c]) ; c++ ) ; if( c==l && value_notzero_p(R->p[j][l]) ) return( j ); } return( -1 ); } /* echange les lignes l1 et l2 dans la matrice R */ static void swap_line(Matrix *R, int l1, int l2) { int i; Value tmp; if( l1 != l2 ) for(i = 0;i < R->NbColumns;i ++) { value_assign(tmp , R->p[l1][i]); value_assign(R->p[l1][i] , R->p[l2][i]); value_assign(R->p[l2][i] , tmp); } } int pgcd1( int a, int b) { int r; if( a== 0 ) return( abs(b) ); if(b==0 ) return(abs(a) ); do { r= a % b; a= b; b = r; } while ( r!=0 ); return(abs(a)); } /* Soustraire la ligne l1 de l2 */ /* On effectue l2 = (l1[piv]/pgcd)*l2 - l1 * (l2[piv]/pgcd) */ static void Soustraire_ligne(Matrix *R, int l1, int l2, int piv ) { int i; Value a, b, p, t; /* l2 = a*l2 - b*l1 */ if (value_zero_p(R->p[l2][piv] )) /* c'est deja fait ! */ return; value_init(a); value_init(b); value_init(p); value_init(t); value_gcd(p, R->p[l1][piv], R->p[l2][piv]); value_divexact(a, R->p[l1][piv], p); value_divexact(b, R->p[l2][piv], p); value_set_si(R->p[l2][piv] , 0); value_set_si(p,0); for(i = piv + 1;i < R->NbColumns;i ++) { value_multiply(t,b,R->p[l1][i]); value_multiply(R->p[l2][i],a,R->p[l2][i]); value_subtract(R->p[l2][i],R->p[l2][i],t); value_gcd(p, p, R->p[l2][i]); } /* Simplification par le pgcd de toute la ligne */ for( i=piv+1 ; iNbColumns && p!=0 ; i++ ) value_divexact(R->p[l2][i], R->p[l2][i], p); value_clear(a); value_clear(b); value_clear(p); value_clear(t); } /*** ext_ehrhart.c ****/ void new_eadd(evalue *e1,evalue *res) { int i, p, x, y; evalue *ne; Value g,m1,m2; value_init(g); value_init(m1); value_init(m2); if (value_notzero_p(e1->d) && value_notzero_p(res->d)) { /* Add two rational numbers*/ value_multiply(m1,e1->x.n,res->d); value_multiply(m2,res->x.n,e1->d); value_addto(res->x.n,m1,m2); value_multiply(res->d,e1->d,res->d); value_gcd(g, res->x.n,res->d); if (value_notone_p(g)) { value_divexact(res->d, res->d, g); value_divexact(res->x.n, res->x.n, g); } value_clear(g); value_clear(m1); value_clear(m2); return ; } else if (value_notzero_p(e1->d) && value_zero_p(res->d)) { if (res->x.p->type==polynomial) { /* Add the constant to the constant term of a polynomial*/ new_eadd(e1, &res->x.p->arr[0]); value_clear(g); value_clear(m1); value_clear(m2); return ; } else if (res->x.p->type==periodic) { /* Add the constant to all elements of a periodic number */ for (i=0; ix.p->size; i++) { new_eadd(e1, &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return ; } else { fprintf(stderr, "eadd: cannot add const with vector\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } } /* ######### add polynomial or periodic to constant ############# you have to exchange e1 and res, before doing addition */ else if (value_zero_p(e1->d) && value_notzero_p(res->d)) { enode *tmp; evalue x; x=*res; tmp= ecopy(e1->x.p); value_init(res->d); value_set_si( res->d, 0 ); res->x.p=tmp; new_eadd(&x,res); value_clear(g); value_clear(m1); value_clear(m2); return ; } else { /* ((e1->d==0) && (res->d==0)) */ if ((e1->x.p->type != res->x.p->type) ) { /* ##### adding to evalues of different type. two cases are possible #### #### res is periodic and e1 is polynomial, you have to exchange e1 and res then to add e1 to the constant term of res #### */ if ((res->x.p->type == periodic)&&(e1->x.p->type == polynomial)) { evalue eval; value_set_si( eval.d, 0 ); eval.x.p=ecopy(res->x.p); res->x.p= ecopy(e1->x.p); new_eadd(&eval,&res->x.p->arr[0]); } else if ((res->x.p->type == polynomial)&&(e1->x.p->type == periodic)) { /* #### res is polynomial and e1 is periodic, add e1 to the constant term of res #### */ new_eadd(e1,&res->x.p->arr[0]); } value_clear(g); value_clear(m1); value_clear(m2); return; } else if (e1->x.p->pos != res->x.p->pos ) { /* ### adding evalues of different position (i.e function of different unknowns to case are possible ### */ if (res->x.p->type == polynomial) {/* ### res and e1 are polynomials add e1 to the constant term of res */ new_eadd(e1,&res->x.p->arr[0]); value_clear(g); value_clear(m1); value_clear(m2); return; } else { /* ### res and e1 are pointers to periodic numbers add e1 to all elements of res */ for (i=0;ix.p->size;i++) { new_eadd(e1,&res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return; } } /* ### */ /* same type , same pos and same size */ if (e1->x.p->size == res->x.p->size) { /* add any element in e1 to the corresponding element in res */ for (i=0; ix.p->size; i++) { new_eadd(&e1->x.p->arr[i], &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return ; } /* Sizes are different */ if (res->x.p->type==polynomial) { /* VIN100: if e1-size > res-size you have to copy e1 in a */ /* new enode and add res to that new node. If you do not do */ /* that, you lose the the upper weight part of e1 ! */ if(e1->x.p->size > res->x.p->size) { enode *tmp; tmp = ecopy(e1->x.p); for(i=0;ix.p->size;++i) { new_eadd(&res->x.p->arr[i], &tmp->arr[i]); /* free_evalue_refs(&res->x.p->arr[i]); */ } res->x.p = tmp; } else { for (i=0; ix.p->size ; i++) { new_eadd(&e1->x.p->arr[i], &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return ; } } /* ### add two periodics of the same pos (unknown) but whith different sizes (periods) ### */ else if (res->x.p->type==periodic) { /* you have to create a new evalue 'ne' in whitch size equals to the scm of the sizes of e1 and res, then to copy res periodicaly in ne, after to add periodicaly elements of e1 to elements of ne, and finaly to return ne. */ x=e1->x.p->size; y= res->x.p->size; p=ppcm1(x,y); ne= (evalue *) malloc (sizeof(evalue)); value_init(ne->d); value_set_si( ne->d,0); ne->x.p=new_enode(res->x.p->type,p, res->x.p->pos); for(i=0;ix.p->arr[i].d, res->x.p->arr[i%y].d); if (value_notzero_p(ne->x.p->arr[i].d)) { value_init(ne->x.p->arr[i].x.n); value_assign(ne->x.p->arr[i].x.n, res->x.p->arr[i%y].x.n); } else { ne->x.p->arr[i].x.p =ecopy(res->x.p->arr[i%y].x.p); } } for(i=0;ix.p->arr[i%x], &ne->x.p->arr[i]); } res=ne; value_clear(g); value_clear(m1); value_clear(m2); return ; } else { /* evector */ fprintf(stderr, "eadd: ?cannot add vectors of different length\n"); value_clear(g); value_clear(m1); value_clear(m2); return ; } } value_clear(g); value_clear(m1); value_clear(m2); return ; } /* new_eadd */ /* remove the last row and the last column of a matrix Mat */ Matrix *Reduce_Matrix (Matrix *Mat) { int i; Value *p; p=*(Mat->p+(Mat->NbRows-1)); for (i=0;iNbColumns; i++) { value_clear(*p++); } for (i=0; iNbRows-1; i++) { p=*(Mat->p+i); value_clear(*(p+(Mat->NbColumns-1))); } Mat->NbRows--; Mat->NbColumns--; return Mat; } /* Reduce_Matrix */ /* Computes the scalar product (in euclidien space) of two vectors */ void Scalar_product(Value *p1,Value *p2,unsigned length, Value *r) { Value *cp1, *cp2; int i; cp1=p1; cp2=p2; value_set_si(*r,0); for (i=0;iNbRows,Mat->NbColumns); length=Mat->NbColumns; for(k=0; kp[0][k],Mat->p[0][k]); } f=Vector_Alloc(length); p=Vector_Alloc(length); q=Vector_Alloc(length); for(i=1; iNbRows; i++) { for(k=0;kp[k],Mat->p[i][k]); value_assign(q->p[k],Mat->p[i][k]); } value_set_si(d,1); for(j=0; jp[k],OrthMat->p[j][k]); } Scalar_product(p->p,f->p,length,&a); Scalar_product(p->p,p->p,length,&b); value_gcd(c, a, b); value_divexact(a, a, c); value_divexact(b, b, c); for(k=0;kp[k],p->p[k],a); } if(value_notone_p(d)|value_notone_p(b)) { value_lcm(c, d, b); value_divexact(a, c, b); value_divexact(b, c, d); value_assign(d,c); for(k=0;kp[k],p->p[k],a); value_multiply(q->p[k],q->p[k],b); } } for(k=0;kp[k],q->p[k],p->p[k]); } } Vector_Gcd(q->p,length,&c); Vector_AntiScale(q->p, OrthMat->p[i], c, length); } value_clear(a); value_clear(b); value_clear(c); value_clear(d); return OrthMat; } /* Orthogonal_Base */ /* Remove an element of a list */ void Remove_Element(Enumeration *en,Enumeration **re, Enumeration *prev) { if (en== *re) { *re= (*re)->next; } else { prev->next=en->next; } } /* Remove_Element */ /* Remove validite domains and correspending ehrhart polynomials whitch are redundant after the enumeration of a polyhedron */ void Remove_RedundantDomains (Enumeration **Ures) { Enumeration *ren1, *ren2, *previous=NULL; int red; for (ren1=*Ures; ren1; ren1=ren1->next) { red=0; for (ren2=*Ures; ren2; ren2=ren2->next) { if (ren1!=ren2) { if (PolyhedronIncludes(ren2->ValidityDomain, ren1->ValidityDomain)) { red= 1; break; } } } if (red) { Remove_Element(ren1,Ures,previous); } previous=ren1; } }/*Remove_RedendentDomains */ int IncludeInRes (Polyhedron *p, Enumeration *e, unsigned MR) { Enumeration *en; for (en=e; en; en=en->next) { if (PolyhedronIncludes(e->ValidityDomain,p)) return 1; } return 0; } Polyhedron *DMUnion(Enumeration *en, unsigned MR) { Enumeration *e1; Polyhedron *d; e1=en; d=e1->ValidityDomain; for (e1=en->next; e1; e1=e1->next) { d= DomainUnion( d, e1->ValidityDomain, MR); } return d; } void AffConstraints(Polyhedron *Poldisj) { Polyhedron *p; for(p=Poldisj;p;p=p->next) { Polyhedron_PrintConstraints( stdout, P_VALUE_FMT, p); printf("\n"); } } int Degenerate (Enumeration *en) { if(value_notzero_p(en->EP.d)) { if(value_mone_p(en->EP.x.n )) { return 1; } } return 0; } /* Enumeration of a domain D */ Enumeration *Domain_Enumerate(Polyhedron *D, Polyhedron *C, unsigned MAXRAYS, const char **pn) { Polyhedron_union *Polun,*pu; Polyhedron *lp, *lp1, *lp1next; Polyhedron *d1,*d2,*d; Enumeration *e,*pr,*en,*en1, *en2,*tmp, *res, *sen; Polun=NULL; for (d = D; d; d = d->next) { POL_ENSURE_FACETS(d); POL_ENSURE_VERTICES(d); } POL_ENSURE_FACETS(C); POL_ENSURE_VERTICES(C); lp = Disjoint_Domain( D, 0, MAXRAYS ); #ifdef UE_DEBUG printf("##############################################################\n"); printf("\n###### DISJOINT UNION ######\n\n"); AffConstraints(lp); printf("##############################################################\n"); #endif for (lp1=lp ; lp1; lp1=lp1->next) { Enumeration *enext; lp1next = lp1->next; lp1->next = NULL; en= Polyhedron_Enumerate(lp1, C, MAXRAYS,NULL); lp1->next = lp1next; sen= NULL; for (e=en;e;e=enext) { enext = e->next; if (!Degenerate(e)) { e->next = sen; sen=e; } else { free_evalue_refs(&e->EP); Domain_Free(e->ValidityDomain); free(e); } } if(sen!= NULL) { pu = (Polyhedron_union *)malloc(sizeof(Polyhedron_union)); pu->pt=sen; pu->next = Polun; Polun = pu; } } if(!Polun) { #ifdef UE_DEBUG fprintf(stdout,"Empty Polun\n"); #endif return ((Enumeration *) 0); } while(Polun->next != NULL) { Enumeration *enext; res=NULL; en1=Polun->pt; en2=(Polun->next)->pt; d1=DMUnion(en1, MAXRAYS); d2=DMUnion(en2, MAXRAYS); for (en1=Polun->pt;en1;en1=enext) { enext = en1->next; for(en2=(Polun->next)->pt;en2;en2=en2->next) { d = DomainIntersection(en1->ValidityDomain,en2->ValidityDomain,MAXRAYS); if( d && !emptyQ(d)&&!IncludeInRes(d,res,MAXRAYS)) { tmp = (Enumeration *)malloc(sizeof(Enumeration)); value_init(tmp->EP.d); value_assign( tmp->EP.d, en2->EP.d ); if(value_zero_p(tmp->EP.d)) tmp->EP.x.p=ecopy(en2->EP.x.p); else { value_init(tmp->EP.x.n); value_assign( tmp->EP.x.n, en2->EP.x.n ); } new_eadd(&en1->EP,&tmp->EP); tmp->ValidityDomain =d; tmp->next= res; res=tmp; } } d=DomainDifference(en1->ValidityDomain,d2 ,MAXRAYS); if (d && !emptyQ(d) && !IncludeInRes(d,res,MAXRAYS)) { en1->ValidityDomain = d; en1->next= res; res=en1; } else { free_evalue_refs(&en1->EP); free(en1); } } for (en2=(Polun->next)->pt; en2; en2 = enext) { enext = en2->next; d= DomainDifference(en2->ValidityDomain,d1,MAXRAYS); if (d && !emptyQ(d)&&!IncludeInRes(d,res,MAXRAYS)) { en2->ValidityDomain = d; en2->next = res; res = en2; } else { free_evalue_refs(&en2->EP); free(en2); } } Domain_Free(d1); Domain_Free(d2); Polun->pt=res; Polun->next= (Polun->next)->next; } res=Polun->pt; Remove_RedundantDomains(&res); return(res); } /********** DO NOT USE THE FOLLOWING FUNCTION IT'S NOT WORKING PROPERLY YET. **********/ /* Enumeration of the image by T of domain D */ Enumeration *Polyhedron_Image_Enumerate(Polyhedron *D, Polyhedron *C, Matrix *T, unsigned MAXRAYS, const char **par_name) { Polyhedron *polun,*pol; Enumeration *ee; Matrix *TCopy,*Tred, *d1,*d; Vector *v1,*v2; Value h; int i,j,k; POL_ENSURE_FACETS(D); POL_ENSURE_VERTICES(D); POL_ENSURE_FACETS(C); POL_ENSURE_VERTICES(C); value_init(h); if(!D) { fprintf(stdout," Error: in reading input domain \n"); value_clear(h); return ((Enumeration *) 0); } else { printf("\n ################ INPUT POLYHEDRON #######################\n\n"); AffConstraints(D); } #ifdef DOMAIN_IMAGE fpol=DomainImage(D,T,MAXRAYS); printf("\n $$$$$$$$$$$$$ THE DOMAIN IMAGE $$$$$$$$$$$$$\n\n"); AffConstraints(fpol); if(emptyQ(fpol)) { value_clear(h); return ((Enumeration *) 0); } ee = Domain_Enumerate(fpol,C,MAXRAYS,par_name); value_clear(h); return (ee); #endif TCopy= Matrix_Copy(T); Tred= Reduce_Matrix(TCopy); printf("\n ################## INPUT REDUCED TRANSFORMATION MATRIX ##################\n" ); Matrix_Print(stdout,P_VALUE_FMT,Tred); if (Tred->NbRows NbColumns) { d1=(Matrix *) Matrix_Alloc(Tred->NbColumns,Tred->NbColumns); for (i=0;iNbRows;i++) { for (j=0; jNbColumns;j++) { value_assign( d1->p[i][j], Tred->p[i][j] ); } } for(i=Tred->NbRows;iNbColumns;i++) { for (j=0;jNbColumns;j++) { value_set_si( d1->p[i][j], 0 ); } } d= (Matrix *) CalcBase(d1); Matrix_Free(Tred); Matrix_Free(d1); } else { d=(Matrix *) CalcBase(Tred); Matrix_Free(Tred); } if(d->NbRows==0) { if(emptyQ(D)) { value_clear(h); return ((Enumeration *) 0); } else { printf( " Ker(A)=0 implys directly Enumeration on input polyhedron\n\n"); ee=Domain_Enumerate(D,C,MAXRAYS,par_name); value_clear(h); return ee; } } d1=Transpose(d); Matrix_Free(d); if(d1->NbRows!=D->Dimension) { fprintf(stdout," \n Error: incompatible dimension \n"); value_clear(h); return ((Enumeration *) 0); } if(d1->NbColumns > 1) { fprintf(stdout," \n Error: Can not compute integral points : More then vector in ker(A)! \n"); value_clear(h); return ((Enumeration *) 0); } printf( " \n Ker(A)=1 implys adding constraints befor Enumeration\n"); v1=Vector_Alloc(d1->NbRows); v2=Vector_Alloc(d1->NbRows); polun=(Polyhedron *) NULL; for (k=0;kNbRows;k++) { value_assign(v1->p[k],d1->p[k][0]) ; } /* adding a new constraint for all constraints of D in which the scalar product of the*/ /* normal whith vector v1 is greter then zero*/ for (j=0;jNbConstraints;j++) { for (k=0;k<=D->Dimension-1;k++) { value_assign(v2->p[k],D->Constraint[j][k+1]) ; } Scalar_product(v1->p,v2->p,D->Dimension,&h); if(value_pos_p(h)&&!value_zero_p(D->Constraint[j][0])) { Vector *NCont; Value val; value_init( val ); /* Create a new contraint whitch is added to the polyhedron*/ NCont=Vector_Alloc(d1->NbRows+2); value_set_si( NCont->p[0],1); /* the constraint is an inequality */ for (k=1;k<=D->Dimension;k++) { value_oppose( NCont->p[k], D->Constraint[j][k]); } value_decrement(val,h); value_subtract(val,val,D->Constraint[j][D->Dimension+1]); value_assign (NCont->p[D->Dimension+1],val); value_clear(val); /* add the new constraint to polyhedron D */ pol=AddConstraints(NCont->p,1,D,MAXRAYS); POL_ENSURE_VERTICES(pol); polun=AddPolyToDomain(Polyhedron_Copy(pol),polun); Polyhedron_Free(pol); Vector_Free(NCont); value_clear( val ); } } if(polun==NULL) { /* No constraint is added to input polyhedron */ if(emptyQ(D)) { value_clear(h); return ((Enumeration *) 0); } else { ee= Domain_Enumerate(D,C,MAXRAYS,par_name); } } else { /* some constraintes are added to input polyhedron */ if(emptyQ(polun)){ value_clear(h); return ((Enumeration *) 0); } else { printf("\n ##################################################################"); printf("\n ****** THE RESULT OF ADDING CONSTRAINTS TO THE INPUT POLYHEDRON ****** \n"); AffConstraints(polun); ee= Domain_Enumerate(polun,C,MAXRAYS,par_name); value_clear(h); return (ee ); } } return( NULL ); } polylib-5.22.5.orig/source/ehrhart/ehrhart.c0000644000175000017500000022672511341227527021660 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /***********************************************************************/ /* Ehrhart V4.20 */ /* copyright 1997, Doran Wilde */ /* copyright 1997-2000, Vincent Loechner */ /* Permission is granted to copy, use, and distribute */ /* for any commercial or noncommercial purpose under the terms */ /* of the GNU General Public license, version 2, June 1991 */ /* (see file : LICENSING). */ /***********************************************************************/ #include #include #include #include #include #include #include #include /*! \class Ehrhart The following are mainly for debug purposes. You shouldn't need to change anything for daily usage...

you may define each macro independently

  1. #define EDEBUG minimal debug
  2. #define EDEBUG1 prints enumeration points
  3. #define EDEBUG11 prints number of points
  4. #define EDEBUG2 prints domains
  5. #define EDEBUG21 prints more domains
  6. #define EDEBUG3 prints systems of equations that are solved
  7. #define EDEBUG4 prints message for degree reduction
  8. #define EDEBUG5 prints result before simplification
  9. #define EDEBUG6 prints domains in Preprocess
  10. #define EDEBUG61 prints even more in Preprocess
  11. #define EDEBUG62 prints domains in Preprocess2
*/ /** define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed */ #define EPRINT_ALL_VALIDITY_CONSTRAINTS /* #define EDEBUG */ /* minimal debug */ /* #define EDEBUG1 */ /* prints enumeration points */ /* #define EDEBUG11 */ /* prints number of points */ /* #define EDEBUG2 */ /* prints domains */ /* #define EDEBUG21 */ /* prints more domains */ /* #define EDEBUG3 */ /* prints systems of equations that are solved */ /* #define EDEBUG4 */ /* prints message for degree reduction */ /* #define EDEBUG5 */ /* prints result before simplification */ /* #define EDEBUG6 */ /* prints domains in Preprocess */ /* #define EDEBUG61 */ /* prints even more in Preprocess */ /* #define EDEBUG62 */ /* prints domains in Preprocess2 */ /** Reduce the degree of resulting polynomials */ #define REDUCE_DEGREE /** define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20 */ #define ALL_OVERFLOW_WARNINGS /******************* -----------END USER #DEFS-------- *********************/ int overflow_warning_flag = 1; /*-------------------------------------------------------------------*/ /* EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM */ /*-------------------------------------------------------------------*/ /** EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM. The newly allocated enode can be freed with a simple free(x) @param type : enode type @param size : degree+1 for polynomial, period for periodic @param pos : 1..nb_param, position of parameter @return a newly allocated enode */ enode *new_enode(enode_type type,int size,int pos) { enode *res; int i; if(size == 0) { fprintf(stderr, "Allocating enode of size 0 !\n" ); return NULL; } res = (enode *) malloc(sizeof(enode) + (size-1)*sizeof(evalue)); res->type = type; res->size = size; res->pos = pos; for(i=0; iarr[i].d); value_set_si(res->arr[i].d,0); res->arr[i].x.p = 0; } return res; } /* new_enode */ /** releases all memory referenced by e. (recursive) @param e pointer to an evalue */ void free_evalue_refs(evalue *e) { enode *p; int i; if (value_notzero_p(e->d)) { /* 'e' stores a constant */ value_clear(e->d); value_clear(e->x.n); return; } value_clear(e->d); p = e->x.p; if (!p) return; /* null pointer */ for (i=0; isize; i++) { free_evalue_refs(&(p->arr[i])); } free(p); return; } /* free_evalue_refs */ /** @param e pointer to an evalue @return description */ enode *ecopy(enode *e) { enode *res; int i; res = new_enode(e->type,e->size,e->pos); for(i=0;isize;++i) { value_assign(res->arr[i].d,e->arr[i].d); if(value_zero_p(res->arr[i].d)) res->arr[i].x.p = ecopy(e->arr[i].x.p); else { value_init(res->arr[i].x.n); value_assign(res->arr[i].x.n,e->arr[i].x.n); } } return(res); } /* ecopy */ /** @param DST destination file @param e pointer to evalue to be printed @param pname array of strings, name of the parameters */ void print_evalue(FILE *DST, evalue *e, const char **pname) { if(value_notzero_p(e->d)) { if(value_notone_p(e->d)) { value_print(DST,VALUE_FMT,e->x.n); fprintf(DST,"/"); value_print(DST,VALUE_FMT,e->d); } else { value_print(DST,VALUE_FMT,e->x.n); } } else print_enode(DST,e->x.p,pname); return; } /* print_evalue */ /** prints the enode to DST @param DST destination file @param p pointer to enode to be printed @param pname array of strings, name of the parameters */ void print_enode(FILE *DST, enode *p, const char **pname) { int i; if (!p) { fprintf(DST, "NULL"); return; } if (p->type == evector) { fprintf(DST, "{ "); for (i=0; isize; i++) { print_evalue(DST, &p->arr[i], pname); if (i!=(p->size-1)) fprintf(DST, ", "); } fprintf(DST, " }\n"); } else if (p->type == polynomial) { fprintf(DST, "( "); for (i=p->size-1; i>=0; i--) { print_evalue(DST, &p->arr[i], pname); if (i==1) fprintf(DST, " * %s + ", pname[p->pos-1]); else if (i>1) fprintf(DST, " * %s^%d + ", pname[p->pos-1], i); } fprintf(DST, " )\n"); } else if (p->type == periodic) { fprintf(DST, "[ "); for (i=0; isize; i++) { print_evalue(DST, &p->arr[i], pname); if (i!=(p->size-1)) fprintf(DST, ", "); } fprintf(DST," ]_%s", pname[p->pos-1]); } return; } /* print_enode */ /** @param e1 pointers to evalues @param e2 pointers to evalues @return 1 (true) if they are equal, 0 (false) if not */ static int eequal(evalue *e1,evalue *e2) { int i; enode *p1, *p2; if (value_ne(e1->d,e2->d)) return 0; /* e1->d == e2->d */ if (value_notzero_p(e1->d)) { if (value_ne(e1->x.n,e2->x.n)) return 0; /* e1->d == e2->d != 0 AND e1->n == e2->n */ return 1; } /* e1->d == e2->d == 0 */ p1 = e1->x.p; p2 = e2->x.p; if (p1->type != p2->type) return 0; if (p1->size != p2->size) return 0; if (p1->pos != p2->pos) return 0; for (i=0; isize; i++) if (!eequal(&p1->arr[i], &p2->arr[i]) ) return 0; return 1; } /* eequal */ /** @param e pointer to an evalue */ void reduce_evalue (evalue *e) { enode *p; int i, j, k; if (value_notzero_p(e->d)) return; /* a rational number, its already reduced */ if(!(p = e->x.p)) return; /* hum... an overflow probably occured */ /* First reduce the components of p */ for (i=0; isize; i++) reduce_evalue(&p->arr[i]); if (p->type==periodic) { /* Try to reduce the period */ for (i=1; i<=(p->size)/2; i++) { if ((p->size % i)==0) { /* Can we reduce the size to i ? */ for (j=0; jx.p->size; k+=i) if (!eequal(&p->arr[j], &p->arr[k])) goto you_lose; /* OK, lets do it */ for (j=i; jsize; j++) free_evalue_refs(&p->arr[j]); p->size = i; break; you_lose: /* OK, lets not do it */ continue; } } /* Try to reduce its strength */ if (p->size == 1) { value_clear(e->d); memcpy(e,&p->arr[0],sizeof(evalue)); free(p); } } else if (p->type==polynomial) { /* Try to reduce the degree */ for (i=p->size-1;i>=1;i--) { if (!(value_one_p(p->arr[i].d) && value_zero_p(p->arr[i].x.n))) break; /* Zero coefficient */ free_evalue_refs(&p->arr[i]); } if (i+1size) p->size = i+1; /* Try to reduce its strength */ if (p->size == 1) { value_clear(e->d); memcpy(e,&p->arr[0],sizeof(evalue)); free(p); } } } /* reduce_evalue */ /** multiplies two evalues and puts the result in res @param e1 pointer to an evalue @param e2 pointer to a constant evalue @param res pointer to result evalue = e1 * e2 */ static void emul (evalue *e1,evalue *e2,evalue *res) { enode *p; int i; Value g; if (value_zero_p(e2->d)) { fprintf(stderr, "emul: ?expecting constant value\n"); return; } value_init(g); if (value_notzero_p(e1->d)) { value_init(res->x.n); /* Product of two rational numbers */ value_multiply(res->d,e1->d,e2->d); value_multiply(res->x.n,e1->x.n,e2->x.n ); value_gcd(g, res->x.n, res->d); if (value_notone_p(g)) { value_divexact(res->d, res->d, g); value_divexact(res->x.n, res->x.n, g); } } else { /* e1 is an expression */ value_set_si(res->d,0); p = e1->x.p; res->x.p = new_enode(p->type, p->size, p->pos); for (i=0; isize; i++) { emul(&p->arr[i], e2, &(res->x.p->arr[i]) ); } } value_clear(g); return; } /* emul */ /** adds one evalue to evalue 'res. result = res + e1 @param e1 an evalue @param res */ void eadd(evalue *e1,evalue *res) { int i; Value g,m1,m2; value_init(g); value_init(m1); value_init(m2); if (value_notzero_p(e1->d) && value_notzero_p(res->d)) { /* Add two rational numbers*/ value_multiply(m1,e1->x.n,res->d); value_multiply(m2,res->x.n,e1->d); value_addto(res->x.n,m1,m2); value_multiply(res->d,e1->d,res->d); value_gcd(g, res->x.n, res->d); if (value_notone_p(g)) { value_divexact(res->d, res->d, g); value_divexact(res->x.n, res->x.n, g); } value_clear(g); value_clear(m1); value_clear(m2); return; } else if (value_notzero_p(e1->d) && value_zero_p(res->d)) { if (res->x.p->type==polynomial) { /* Add the constant to the constant term */ eadd(e1, &res->x.p->arr[0]); value_clear(g); value_clear(m1); value_clear(m2); return; } else if (res->x.p->type==periodic) { /* Add the constant to all elements of periodic number */ for (i=0; ix.p->size; i++) { eadd(e1, &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return; } else { fprintf(stderr, "eadd: cannot add const with vector\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } } else if (value_zero_p(e1->d) && value_notzero_p(res->d)) { fprintf(stderr,"eadd: cannot add evalue to const\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } else { /* ((e1->d==0) && (res->d==0)) */ if ((e1->x.p->type != res->x.p->type) || (e1->x.p->pos != res->x.p->pos )) { fprintf(stderr, "eadd: ?cannot add, incompatible types\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } if (e1->x.p->size == res->x.p->size) { for (i=0; ix.p->size; i++) { eadd(&e1->x.p->arr[i], &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return; } /* Sizes are different */ if (res->x.p->type==polynomial) { /* VIN100: if e1-size > res-size you have to copy e1 in a */ /* new enode and add res to that new node. If you do not do */ /* that, you lose the the upper weight part of e1 ! */ if(e1->x.p->size > res->x.p->size) { enode *tmp; tmp = ecopy(e1->x.p); for(i=0;ix.p->size;++i) { eadd(&res->x.p->arr[i], &tmp->arr[i]); free_evalue_refs(&res->x.p->arr[i]); } res->x.p = tmp; } else { for (i=0; ix.p->size ; i++) { eadd(&e1->x.p->arr[i], &res->x.p->arr[i]); } value_clear(g); value_clear(m1); value_clear(m2); return; } } else if (res->x.p->type==periodic) { fprintf(stderr, "eadd: ?addition of different sized periodic nos\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } else { /* evector */ fprintf(stderr, "eadd: ?cannot add vectors of different length\n"); value_clear(g); value_clear(m1); value_clear(m2); return; } } value_clear(g); value_clear(m1); value_clear(m2); return; } /* eadd */ /** computes the inner product of two vectors. Result = result (evalue) = v1.v2 (dot product) @param v1 an enode (vector) @param v2 an enode (vector of constants) @param res result (evalue) */ void edot(enode *v1,enode *v2,evalue *res) { int i; evalue tmp; if ((v1->type != evector) || (v2->type != evector)) { fprintf(stderr, "edot: ?expecting vectors\n"); return; } if (v1->size != v2->size) { fprintf(stderr, "edot: ? vector lengths do not agree\n"); return; } if (v1->size<=0) { value_set_si(res->d,1); /* set result to 0/1 */ value_init(res->x.n); value_set_si(res->x.n,0); return; } /* vector v2 is expected to have only rational numbers in */ /* the array. No pointers. */ emul(&v1->arr[0],&v2->arr[0],res); for (i=1; isize; i++) { value_init(tmp.d); /* res = res + v1[i]*v2[i] */ emul(&v1->arr[i],&v2->arr[i],&tmp); eadd(&tmp,res); free_evalue_refs(&tmp); } return; } /* edot */ /** local recursive function used in the following ref contains the new position for each old index position @param e pointer to an evalue @param ref transformation Matrix */ static void aep_evalue(evalue *e, int *ref) { enode *p; int i; if (value_notzero_p(e->d)) return; /* a rational number, its already reduced */ if(!(p = e->x.p)) return; /* hum... an overflow probably occured */ /* First check the components of p */ for (i=0;isize;i++) aep_evalue(&p->arr[i],ref); /* Then p itself */ p->pos = ref[p->pos-1]+1; return; } /* aep_evalue */ /** Comments */ static void addeliminatedparams_evalue(evalue *e,Matrix *CT) { enode *p; int i, j; int *ref; if (value_notzero_p(e->d)) return; /* a rational number, its already reduced */ if(!(p = e->x.p)) return; /* hum... an overflow probably occured */ /* Compute ref */ ref = (int *)malloc(sizeof(int)*(CT->NbRows-1)); for(i=0;iNbRows-1;i++) for(j=0;jNbColumns;j++) if(value_notzero_p(CT->p[i][j])) { ref[i] = j; break; } /* Transform the references in e, using ref */ aep_evalue(e,ref); free( ref ); return; } /* addeliminatedparams_evalue */ /** This procedure finds an integer point contained in polyhedron D / first checks for positive values, then for negative values returns TRUE on success. Result is in min. returns FALSE if no integer point is found

This is the maximum number of iterations for a given parameter to find a integer point inside the context. Kind of weird. cherche_min should

@param min @param D @param pos */ /* FIXME: needs to be rewritten ! */ #define MAXITER 100 int cherche_min(Value *min,Polyhedron *D,int pos) { Value binf, bsup; /* upper & lower bound */ Value i; int flag, maxiter; if(!D) return(1); if(pos > D->Dimension) return(1); value_init(binf); value_init(bsup); value_init(i); #ifdef EDEBUG61 fprintf(stderr,"Entering Cherche min --> \n"); fprintf(stderr,"LowerUpperBounds :\n"); fprintf(stderr,"pos = %d\n",pos); fprintf(stderr,"current min = ("); value_print(stderr,P_VALUE_FMT,min[1]); {int j; for(j=2;j<=D->Dimension ; j++) { fprintf(stderr,", "); value_print(stderr,P_VALUE_FMT,min[j]); } } fprintf(stderr,")\n"); #endif flag = lower_upper_bounds(pos,D,min,&binf,&bsup); #ifdef EDEBUG61 fprintf(stderr, "flag = %d\n", flag); fprintf(stderr,"binf = "); value_print(stderr,P_VALUE_FMT,binf); fprintf(stderr,"\n"); fprintf(stderr,"bsup = "); value_print(stderr,P_VALUE_FMT,bsup); fprintf(stderr,"\n"); #endif if(flag&LB_INFINITY) value_set_si(binf,0); /* Loop from 0 (or binf if positive) to bsup */ for(maxiter=0,(((flag&LB_INFINITY) || value_neg_p(binf)) ? value_set_si(i,0) : value_assign(i,binf)); ((flag&UB_INFINITY) || value_le(i,bsup)) && maxiternext,pos+1)) { value_clear(binf); value_clear(bsup); value_clear(i); return(1); } } /* Descending loop from -1 (or bsup if negative) to binf */ if((flag&LB_INFINITY) || value_neg_p(binf)) for(maxiter=0,(((flag&UB_INFINITY) || value_pos_p(bsup))? value_set_si(i,-1) :value_assign(i,bsup)); ((flag&LB_INFINITY) || value_ge(i,binf)) && maxiternext,pos+1)) { value_clear(binf); value_clear(bsup); value_clear(i); return(1); } } value_clear(binf); value_clear(bsup); value_clear(i); value_set_si(min[pos],0); return(0); /* not found :-( */ } /* cherche_min */ /** This procedure finds the smallest parallelepiped of size 'size[i]' for every dimension i, contained in polyhedron D. If this is not possible, NULL is returned

written by vin100, 2000, for version 4.19
modified 2002, version 5.10

It first finds the coordinates of the lexicographically smallest edge of the hypercube, obtained by transforming the constraints of D (by adding 'size' as many times as there are negative coeficients in each constraint), and finding the lexicographical min of this polyhedron. Then it builds the hypercube and returns it.

@param D @param size @param MAXRAYS */ Polyhedron *Polyhedron_Preprocess(Polyhedron *D,Value *size,unsigned MAXRAYS) { Matrix *M; int i, j, d; Polyhedron *T, *S, *H, *C; Value *min; d = D->Dimension; if (MAXRAYS < 2*D->NbConstraints) MAXRAYS = 2*D->NbConstraints; M = Matrix_Alloc(MAXRAYS, D->Dimension+2); M->NbRows = D->NbConstraints; /* Original constraints */ for(i=0;iNbConstraints;i++) Vector_Copy(D->Constraint[i],M->p[i],(d+2)); #ifdef EDEBUG6 fprintf(stderr,"M for PreProcess : "); Matrix_Print(stderr,P_VALUE_FMT,M); fprintf(stderr,"\nsize == "); for( i=0 ; iNbConstraints;i++) { if(value_zero_p(D->Constraint[i][0])) { fprintf(stderr,"Polyhedron_Preprocess: "); fprintf(stderr, "an equality was found where I did expect an inequality.\n"); fprintf(stderr,"Trying to continue...\n"); continue; } Vector_Copy(D->Constraint[i],M->p[M->NbRows],(d+2)); for(j=1;j<=d;j++) if(value_neg_p(D->Constraint[i][j])) { value_addmul(M->p[M->NbRows][d+1], D->Constraint[i][j], size[j-1]); } /* If anything changed, add this new constraint */ if(value_ne(M->p[M->NbRows][d+1],D->Constraint[i][d+1])) M->NbRows ++ ; } #ifdef EDEBUG6 fprintf(stderr,"M used to find min : "); Matrix_Print(stderr,P_VALUE_FMT,M); #endif T = Constraints2Polyhedron(M,MAXRAYS); Matrix_Free(M); if (!T || emptyQ(T)) { if(T) Polyhedron_Free(T); return(NULL); } /* Ok, now find the lexicographical min of T */ min = (Value *) malloc(sizeof(Value) * (d+2)); for(i=0;i<=d;i++) { value_init(min[i]); value_set_si(min[i],0); } value_init(min[i]); value_set_si(min[i],1); C = Universe_Polyhedron(0); S = Polyhedron_Scan(T,C,MAXRAYS); Polyhedron_Free(C); Polyhedron_Free(T); #ifdef EDEBUG6 for(i=0;i<=(d+1);i++) { value_print(stderr,P_VALUE_FMT,min[i]); fprintf(stderr," ,"); } fprintf(stderr,"\n"); Polyhedron_Print(stderr,P_VALUE_FMT,S); fprintf(stderr,"\n"); #endif if (!cherche_min(min,S,1)) { for(i=0;i<=(d+1);i++) value_clear(min[i]); return(NULL); } Domain_Free(S); #ifdef EDEBUG6 fprintf(stderr,"min = ( "); value_print(stderr,P_VALUE_FMT,min[1]); for(i=2;i<=d;i++) { fprintf(stderr,", "); value_print(stderr,P_VALUE_FMT,min[i]); } fprintf(stderr,")\n"); #endif /* Min is the point from which we can construct the hypercube */ M = Matrix_Alloc(d*2,d+2); for(i=0;ip[2*i][0],1); for(j=1;j<=d;j++) value_set_si(M->p[2*i][j],0); value_set_si(M->p[2*i][i+1],1); value_oppose(M->p[2*i][d+1],min[i+1]); /* Creates inequality 1 0..0 -1 0..0 min[i+1]+size -1 */ value_set_si(M->p[2*i+1][0],1); for(j=1;j<=d;j++) value_set_si(M->p[2*i+1][j],0); value_set_si(M->p[2*i+1][i+1],-1); value_addto(M->p[2*i+1][d+1],min[i+1],size[i]); value_sub_int(M->p[2*i+1][d+1],M->p[2*i+1][d+1],1); } #ifdef EDEBUG6 fprintf(stderr,"PolyhedronPreprocess: constraints H = "); Matrix_Print(stderr,P_VALUE_FMT,M); #endif H = Constraints2Polyhedron(M,MAXRAYS); #ifdef EDEBUG6 Polyhedron_Print(stderr,P_VALUE_FMT,H); fprintf(stderr,"\n"); #endif Matrix_Free(M); for(i=0;i<=(d+1);i++) value_clear(min[i]); free(min); assert(!emptyQ(H)); return(H); } /* Polyhedron_Preprocess */ /** This procedure finds an hypercube of size 'size', containing polyhedron D increases size and lcm if necessary (and not "too big") If this is not possible, an empty polyhedron is returned

 written by vin100, 2001, for version 4.19
@param D @param size @param lcm @param MAXRAYS */ Polyhedron *Polyhedron_Preprocess2(Polyhedron *D,Value *size, Value *lcm,unsigned MAXRAYS) { Matrix *c; Polyhedron *H; int i,j,r; Value n; /* smallest/biggest value */ Value s; /* size in this dimension */ Value tmp1,tmp2; #ifdef EDEBUG62 int np; #endif value_init(n); value_init(s); value_init(tmp1); value_init(tmp2); c = Matrix_Alloc(D->Dimension*2,D->Dimension+2); #ifdef EDEBUG62 fprintf(stderr,"\nPreProcess2 : starting\n"); fprintf(stderr,"lcm = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,lcm[np]); fprintf(stderr,", size = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,size[np]); fprintf(stderr,"\n"); #endif for(i=0;iDimension;i++) { /* Create constraint 1 0..0 1 0..0 -min */ value_set_si(c->p[2*i][0],1); for(j=0;jDimension;j++) value_set_si(c->p[2*i][1+j],0); value_division(n,D->Ray[0][i+1],D->Ray[0][D->Dimension+1]); for(r=1;rNbRays;r++) { value_division(tmp1,D->Ray[r][i+1],D->Ray[r][D->Dimension+1]); if(value_gt(n,tmp1)) { /* New min */ value_division(n,D->Ray[r][i+1],D->Ray[r][D->Dimension+1]); } } value_set_si(c->p[2*i][i+1],1); value_oppose(c->p[2*i][D->Dimension+1],n); /* Create constraint 1 0..0 -1 0..0 max */ value_set_si(c->p[2*i+1][0],1); for(j=0;jDimension;j++) value_set_si(c->p[2*i+1][1+j],0); /* n = (num+den-1)/den */ value_addto(tmp1,D->Ray[0][i+1],D->Ray[0][D->Dimension+1]); value_sub_int(tmp1,tmp1,1); value_division(n,tmp1,D->Ray[0][D->Dimension+1]); for(r=1;rNbRays;r++) { value_addto(tmp1,D->Ray[r][i+1],D->Ray[r][D->Dimension+1]); value_sub_int(tmp1,tmp1,1); value_division(tmp1,tmp1,D->Ray[r][D->Dimension+1]); if (value_lt(n,tmp1)) { /* New max */ value_addto(tmp1,D->Ray[r][i+1],D->Ray[r][D->Dimension+1]); value_sub_int(tmp1,tmp1,1); value_division(n,tmp1,D->Ray[r][D->Dimension+1]); } } value_set_si(c->p[2*i+1][i+1],-1); value_assign(c->p[2*i+1][D->Dimension+1],n); value_addto(s,c->p[2*i+1][D->Dimension+1],c->p[2*i][D->Dimension+1]); /* Now test if the dimension of the cube is greater than the size */ if(value_gt(s,size[i])) { #ifdef EDEBUG62 fprintf(stderr,"size on dimension %d\n",i); fprintf(stderr,"lcm = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,lcm[np]); fprintf(stderr,", size = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,size[np]); fprintf(stderr,"\n"); fprintf(stderr,"required size (s) = "); value_print(stderr,VALUE_FMT,s); fprintf(stderr,"\n"); #endif /* If the needed size is "small enough"(<=20 or less than twice *size), then increase *size, and artificially increase lcm too !*/ value_set_si(tmp1,20); value_addto(tmp2,size[i],size[i]); if(value_le(s,tmp1) || value_le(s,tmp2)) { if( value_zero_p(lcm[i]) ) value_set_si(lcm[i],1); /* lcm divides size... */ value_division(tmp1,size[i],lcm[i]); /* lcm = ceil(s/h) */ value_addto(tmp2,s,tmp1); value_add_int(tmp2,tmp2,1); value_division(lcm[i],tmp2,tmp1); /* new size = lcm*h */ value_multiply(size[i],lcm[i],tmp1); #ifdef EDEBUG62 fprintf(stderr,"new size = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,size[np]); fprintf(stderr,", new lcm = "); for( np=0 ; npDimension; np++ ) value_print(stderr,VALUE_FMT,lcm[np]); fprintf(stderr,"\n"); #endif } else { #ifdef EDEBUG62 fprintf(stderr,"Failed on dimension %d.\n",i); #endif break; } } } if(i!=D->Dimension) { Matrix_Free(c); value_clear(n); value_clear(s); value_clear(tmp1); value_clear(tmp2); return(NULL); } for(i=0;iDimension;i++) { value_subtract(c->p[2*i+1][D->Dimension+1],size[i], c->p[2*i][D->Dimension+1]); } #ifdef EDEBUG62 fprintf(stderr,"PreProcess2 : c ="); Matrix_Print(stderr,P_VALUE_FMT,c); #endif H = Constraints2Polyhedron(c,MAXRAYS); Matrix_Free(c); value_clear(n); value_clear(s); value_clear(tmp1); value_clear(tmp2); return(H); } /* Polyhedron_Preprocess2 */ /** This procedure adds additional constraints to D so that as each parameter is scanned, it will have a minimum of 'size' points If this is not possible, an empty polyhedron is returned @param D @param size @param MAXRAYS */ Polyhedron *old_Polyhedron_Preprocess(Polyhedron *D,Value size, unsigned MAXRAYS) { int p, p1, ub, lb; Value a, a1, b, b1, g, aa; Value abs_a, abs_b, size_copy; int dim, con, newi, needed; Value **C; Matrix *M; Polyhedron *D1; value_init(a); value_init(a1); value_init(b); value_init(b1); value_init(g); value_init(aa); value_init(abs_a); value_init(abs_b); value_init(size_copy); dim = D->Dimension; con = D->NbConstraints; M = Matrix_Alloc(MAXRAYS,dim+2); newi = 0; value_assign(size_copy,size); C = D->Constraint; for (p=1; p<=dim; p++) { for (ub=0; ub= 0 */ continue; /* not an upper bound */ for (lb=0;lb= a*b*size */ value_gcd(g, abs_a, abs_b); value_divexact(a1, a, g); value_divexact(b1, b, g); value_set_si(M->p[newi][0],1); value_oppose(abs_a,a1); /* abs_a = -a1 */ Vector_Combine(&(C[ub][1]),&(C[lb][1]),&(M->p[newi][1]), b1,abs_a,dim+1); value_multiply(aa,a1,b1); value_addmul(M->p[newi][dim+1], aa, size_copy); Vector_Normalize(&(M->p[newi][1]),(dim+1)); newi++; } } } D1 = AddConstraints(M->p_Init,newi,D,MAXRAYS); Matrix_Free(M); value_clear(a); value_clear(a1); value_clear(b); value_clear(b1); value_clear(g); value_clear(aa); value_clear(abs_a); value_clear(abs_b); value_clear(size_copy); return D1; } /* old_Polyhedron_Preprocess */ /** PROCEDURES TO COMPUTE ENUMERATION. recursive procedure, recurse for each imbriquation @param pos index position of current loop index (1..hdim-1) @param P loop domain @param context context values for fixed indices @param res the number of integer points in this polyhedron */ void count_points (int pos,Polyhedron *P,Value *context, Value *res) { Value LB, UB, k, c; POL_ENSURE_FACETS(P); POL_ENSURE_VERTICES(P); if (emptyQ(P)) { value_set_si(*res, 0); return; } value_init(LB); value_init(UB); value_init(k); value_set_si(LB,0); value_set_si(UB,0); if (lower_upper_bounds(pos,P,context,&LB,&UB) !=0) { /* Problem if UB or LB is INFINITY */ fprintf(stderr, "count_points: ? infinite domain\n"); value_clear(LB); value_clear(UB); value_clear(k); value_set_si(*res, -1); return; } #ifdef EDEBUG1 if (!P->next) { int i; for (value_assign(k,LB); value_le(k,UB); value_increment(k,k)) { fprintf(stderr, "("); for (i=1; inext) { value_subtract(k,UB,LB); value_add_int(k,k,1); value_assign(*res, k); value_clear(LB); value_clear(UB); value_clear(k); return; } /*-----------------------------------------------------------------*/ /* Optimization idea */ /* If inner loops are not a function of k (the current index) */ /* i.e. if P->Constraint[i][pos]==0 for all P following this and */ /* for all i, */ /* Then CNT = (UB-LB+1)*count_points(pos+1, P->next, context) */ /* (skip the for loop) */ /*-----------------------------------------------------------------*/ value_init(c); value_set_si(*res, 0); for (value_assign(k,LB);value_le(k,UB);value_increment(k,k)) { /* Insert k in context */ value_assign(context[pos],k); count_points(pos+1,P->next,context,&c); if(value_notmone_p(c)) value_addto(*res, *res, c); else { value_set_si(*res, -1); break; } } value_clear(c); #ifdef EDEBUG11 fprintf(stderr,"%d\n",CNT); #endif /* Reset context */ value_set_si(context[pos],0); value_clear(LB); value_clear(UB); value_clear(k); return; } /* count_points */ /*-------------------------------------------------------------------*/ /* enode *P_Enum(L, LQ, context, pos, nb_param, dim, lcm,param_name) */ /* L : list of polyhedra for the loop nest */ /* LQ : list of polyhedra for the parameter loop nest */ /* pos : 1..nb_param, position of the parameter */ /* nb_param : number of parameters total */ /* dim : total dimension of the polyhedron, param incl. */ /* lcm : denominator array [0..dim-1] of the polyhedron */ /* param_name : name of the parameters */ /* Returns an enode tree representing the pseudo polynomial */ /* expression for the enumeration of the polyhedron. */ /* A recursive procedure. */ /*-------------------------------------------------------------------*/ static enode *P_Enum(Polyhedron *L,Polyhedron *LQ,Value *context,int pos, int nb_param,int dim,Value *lcm, const char **param_name) { enode *res,*B,*C; int hdim,i,j,rank,flag; Value n,g,nLB,nUB,nlcm,noff,nexp,k1,nm,hdv,k,lcm_copy; Value tmp; Matrix *A; #ifdef EDEBUG fprintf(stderr,"-------------------- begin P_Enum -------------------\n"); fprintf(stderr,"Calling P_Enum with pos = %d\n",pos); #endif /* Initialize all the 'Value' variables */ value_init(n); value_init(g); value_init(nLB); value_init(nUB); value_init(nlcm); value_init(noff); value_init(nexp); value_init(k1); value_init(nm); value_init(hdv); value_init(k); value_init(tmp); value_init(lcm_copy); if( value_zero_p(lcm[pos-1]) ) { hdim = 1; value_set_si( lcm_copy, 1 ); } else { /* hdim is the degree of the polynomial + 1 */ hdim = dim-nb_param+1; /* homogenous dim w/o parameters */ value_assign( lcm_copy, lcm[pos-1] ); } /* code to limit generation of equations to valid parameters only */ /*----------------------------------------------------------------*/ flag = lower_upper_bounds(pos,LQ,&context[dim-nb_param],&nLB,&nUB); if (flag & LB_INFINITY) { if (!(flag & UB_INFINITY)) { /* Only an upper limit: set lower limit */ /* Compute nLB such that (nUB-nLB+1) >= (hdim*lcm) */ value_sub_int(nLB,nUB,1); value_set_si(hdv,hdim); value_multiply(tmp,hdv,lcm_copy); value_subtract(nLB,nLB,tmp); if(value_pos_p(nLB)) value_set_si(nLB,0); } else { value_set_si(nLB,0); /* No upper nor lower limit: set lower limit to 0 */ value_set_si(hdv,hdim); value_multiply(nUB,hdv,lcm_copy); value_add_int(nUB,nUB,1); } } /* if (nUB-nLB+1) < (hdim*lcm) then we have more unknowns than equations */ /* We can: 1. Find more equations by changing the context parameters, or */ /* 2. Assign extra unknowns values in such a way as to simplify result. */ /* Think about ways to scan parameter space to get as much info out of it*/ /* as possible. */ #ifdef REDUCE_DEGREE if (pos==1 && (flag & UB_INFINITY)==0) { /* only for finite upper bound on first parameter */ /* NOTE: only first parameter because subsequent parameters may be artificially limited by the choice of the first parameter */ #ifdef EDEBUG fprintf(stderr,"*************** n **********\n"); value_print(stderr,VALUE_FMT,n); fprintf(stderr,"\n"); #endif value_subtract(n,nUB,nLB); value_increment(n,n); #ifdef EDEBUG value_print(stderr,VALUE_FMT,n); fprintf(stderr,"\n*************** n ************\n"); #endif /* Total number of samples>0 */ if(value_neg_p(n)) i=0; else { value_modulus(tmp,n,lcm_copy); if(value_notzero_p(tmp)) { value_division(tmp,n,lcm_copy); value_increment(tmp,tmp); i = VALUE_TO_INT(tmp); } else { value_division(tmp,n,lcm_copy); i = VALUE_TO_INT(tmp); /* ceiling of n/lcm */ } } #ifdef EDEBUG value_print(stderr,VALUE_FMT,n); fprintf(stderr,"\n*************** n ************\n"); #endif /* Reduce degree of polynomial based on number of sample points */ if (i < hdim){ hdim=i; #ifdef EDEBUG4 fprintf(stdout,"Parameter #%d: LB=",pos); value_print(stdout,VALUE_FMT,nLB); fprintf(stdout," UB="); value_print(stdout,VALUE_FMT,nUB); fprintf(stdout," lcm="); value_print(stdout,VALUE_FMT,lcm_copy); fprintf(stdout," degree reduced to %d\n",hdim-1); #endif } } #endif /* REDUCE_DEGREE */ /* hdim is now set */ /* allocate result structure */ res = new_enode(polynomial,hdim,pos); for (i=0;iarr[i].x.p = new_enode(periodic,l,pos); } /* Utility arrays */ A = Matrix_Alloc(hdim, 2*hdim+1); /* used for Gauss */ B = new_enode(evector, hdim, 0); C = new_enode(evector, hdim, 0); /* We'll create these again when we need them */ for (j = 0; j < hdim; ++j) free_evalue_refs(&C->arr[j]); /*----------------------------------------------------------------*/ /* */ /* 0<-----+---k---------> */ /* |---------noff----------------->-nlcm->-------lcm----> */ /* |--- . . . -----|--------------|------+-------|------+-------|-*/ /* 0 (q-1)*lcm q*lcm | (q+1)*lcm | */ /* nLB nLB+lcm */ /* */ /*----------------------------------------------------------------*/ if(value_neg_p(nLB)) { value_modulus(nlcm,nLB,lcm_copy); value_addto(nlcm,nlcm,lcm_copy); } else { value_modulus(nlcm,nLB,lcm_copy); } /* noff is a multiple of lcm */ value_subtract(noff,nLB,nlcm); value_addto(tmp,lcm_copy,nlcm); for (value_assign(k,nlcm);value_lt(k,tmp);) { #ifdef EDEBUG fprintf(stderr,"Finding "); value_print(stderr,VALUE_FMT,k); fprintf(stderr,"-th elements of periodic coefficients\n"); #endif value_set_si(hdv,hdim); value_multiply(nm,hdv,lcm_copy); value_addto(nm,nm,nLB); i=0; for (value_addto(n,k,noff); value_lt(n,nm); value_addto(n,n,lcm_copy),i++) { /* n == i*lcm + k + noff; */ /* nlcm <= k < nlcm+lcm */ /* n mod lcm == k1 */ #ifdef ALL_OVERFLOW_WARNINGS if (((flag & UB_INFINITY)==0) && value_gt(n,nUB)) { fprintf(stdout,"Domain Overflow: Parameter #%d:",pos); fprintf(stdout,"nLB="); value_print(stdout,VALUE_FMT,nLB); fprintf(stdout," n="); value_print(stdout,VALUE_FMT,n); fprintf(stdout," nUB="); value_print(stdout,VALUE_FMT,nUB); fprintf(stdout,"\n"); } #else if (overflow_warning_flag && ((flag & UB_INFINITY)==0) && value_gt(n,nUB)) { fprintf(stdout,"\nWARNING: Parameter Domain Overflow."); fprintf(stdout," Result may be incorrect on this domain.\n"); overflow_warning_flag = 0; } #endif /* Set parameter to n */ value_assign(context[dim-nb_param+pos],n); #ifdef EDEBUG1 if( param_name ) { fprintf(stderr,"%s = ",param_name[pos-1]); value_print(stderr,VALUE_FMT,n); fprintf(stderr," (hdim=%d, lcm[%d]=",hdim,pos-1); value_print(stderr,VALUE_FMT,lcm_copy); fprintf(stderr,")\n"); } else { fprintf(stderr,"P%d = ",pos); value_print(stderr,VALUE_FMT,n); fprintf(stderr," (hdim=%d, lcm[%d]=",hdim,pos-1); value_print(stderr,VALUE_FMT,lcm_copy); fprintf(stderr,")\n"); } #endif /* Setup B vector */ if (pos==nb_param) { #ifdef EDEBUG fprintf(stderr,"Yes\n"); #endif /* call count */ /* count can only be called when the context is fully specified */ value_set_si(B->arr[i].d,1); value_init(B->arr[i].x.n); count_points(1,L,context,&B->arr[i].x.n); #ifdef EDEBUG3 for (j=1; jarr[i].d,0); B->arr[i].x.p = P_Enum(L,LQ->next,context,pos+1, nb_param,dim,lcm,param_name); #ifdef EDEBUG3 if( param_name ) { for (j=1; jp[i][0],0); /* status bit = equality */ value_set_si(nexp,1); for (j=1;j<=hdim;j++) { value_assign(A->p[i][j],nexp); value_set_si(A->p[i][j+hdim],0); #ifdef EDEBUG3 fprintf(stdout," + "); value_print(stdout,VALUE_FMT,nexp); fprintf(stdout," c%d",j); #endif value_multiply(nexp,nexp,n); } #ifdef EDEBUG3 fprintf(stdout, "\n"); #endif value_set_si(A->p[i][i+1+hdim],1); } /* Assertion check */ if (i!=hdim) fprintf(stderr, "P_Enum: ?expecting i==hdim\n"); #ifdef EDEBUG if( param_name ) { fprintf(stderr,"B (enode) =\n"); print_enode(stderr,B,param_name); } fprintf(stderr,"A (Before Gauss) =\n"); Matrix_Print(stderr,P_VALUE_FMT,A); #endif /* Solve hdim (=dim+1) equations with hdim unknowns, result in CNT */ rank = Gauss(A,hdim,2*hdim); #ifdef EDEBUG fprintf(stderr,"A (After Gauss) =\n"); Matrix_Print(stderr,P_VALUE_FMT,A); #endif /* Assertion check */ if (rank!=hdim) { fprintf(stderr, "P_Enum: ?expecting rank==hdim\n"); } /* if (rank < hdim) then set the last hdim-rank coefficients to ? */ /* if (rank == 0) then set all coefficients to 0 */ /* copy result as k1-th element of periodic numbers */ if(value_lt(k,lcm_copy)) value_assign(k1,k); else value_subtract(k1,k,lcm_copy); for (i=0; ip[i][i+1], A->p[i][j+1+hdim]); value_init(C->arr[j].d); value_divexact(C->arr[j].d, A->p[i][i+1], g); value_init(C->arr[j].x.n); value_divexact(C->arr[j].x.n, A->p[i][j+1+hdim], g); } #ifdef EDEBUG if( param_name ) { fprintf(stderr, "C (enode) =\n"); print_enode(stderr, C, param_name); } #endif /* The i-th enode is the lcm-periodic coefficient of term n**i */ edot(B,C,&(res->arr[i].x.p->arr[VALUE_TO_INT(k1)])); #ifdef EDEBUG if( param_name ) { fprintf(stderr, "B.C (evalue)=\n"); print_evalue(stderr,&(res->arr[i].x.p->arr[VALUE_TO_INT(k1)]), param_name); fprintf(stderr,"\n"); } #endif for (j = 0; j < rank; ++j) free_evalue_refs(&C->arr[j]); } value_addto(tmp,lcm_copy,nlcm); value_increment(k,k); for (i = 0; i < hdim; ++i) { free_evalue_refs(&B->arr[i]); if (value_lt(k,tmp)) value_init(B->arr[i].d); } } #ifdef EDEBUG if( param_name ) { fprintf(stderr,"res (enode) =\n"); print_enode(stderr,res,param_name); } fprintf(stderr, "-------------------- end P_Enum -----------------------\n"); #endif /* Reset context */ value_set_si(context[dim-nb_param+pos],0); /* Release memory */ Matrix_Free(A); free(B); free(C); /* Clear all the 'Value' variables */ value_clear(n); value_clear(g); value_clear(nLB); value_clear(nUB); value_clear(nlcm); value_clear(noff); value_clear(nexp); value_clear(k1); value_clear(nm); value_clear(hdv); value_clear(k); value_clear(tmp); value_clear(lcm_copy); return res; } /* P_Enum */ /*----------------------------------------------------------------*/ /* Scan_Vertices(PP, Q, CT) */ /* PP : ParamPolyhedron */ /* Q : Domain */ /* CT : Context transformation matrix */ /* lcm : lcm array (output) */ /* nbp : number of parameters */ /* param_name : name of the parameters */ /*----------------------------------------------------------------*/ static void Scan_Vertices(Param_Polyhedron *PP,Param_Domain *Q,Matrix *CT, Value *lcm, int nbp, const char **param_name) { Param_Vertices *V; int i, j, ix, l, np; unsigned bx; Value k,m1; /* Compute the denominator of P */ /* lcm = Least Common Multiple of the denominators of the vertices of P */ /* and print the vertices */ value_init(k); value_init(m1); for( np=0 ; npV; V && inbV; i++,V=V->next) { if (Q->F[ix] & bx) { if( param_name ) { if(CT) { Matrix *v; v = VertexCT(V->Vertex,CT); Print_Vertex(stdout,v,param_name); Matrix_Free(v); } else Print_Vertex(stdout,V->Vertex,param_name); fprintf(stdout,"\n"); } for(j=0;jVertex->NbRows;j++) { /* A matrix */ for( l=0 ; lVertex->NbColumns-1 ; l++ ) { if( value_notzero_p(V->Vertex->p[j][l]) ) { value_gcd(m1, V->Vertex->p[j][V->Vertex->NbColumns-1], V->Vertex->p[j][l]); value_divexact(k, V->Vertex->p[j][V->Vertex->NbColumns-1], m1); if( value_notzero_p(lcm[l]) ) { /* lcm[l] = lcm[l] * k / gcd(k,lcm[l]) */ if (value_notzero_p(k) && value_notone_p(k)) { value_gcd(m1, lcm[l], k); value_divexact(k, k, m1); value_multiply(lcm[l],lcm[l],k); } } else { value_assign(lcm[l],k); } } } } } NEXT(ix,bx); } value_clear(k); value_clear(m1); } /* Scan_Vertices */ /** Procedure to count points in a non-parameterized polytope. @param P Polyhedron to count @param C Parameter Context domain @param CT Matrix to transform context to original @param CEq additionnal equalities in context @param MAXRAYS workspace size @param param_name parameter names */ Enumeration *Enumerate_NoParameters(Polyhedron *P,Polyhedron *C, Matrix *CT,Polyhedron *CEq, unsigned MAXRAYS, const char **param_name) { Polyhedron *L; Enumeration *res; Value *context; int j; int hdim = P->Dimension + 1; int r,i; /* Create a context vector size dim+2 */ context = (Value *) malloc((hdim+1)*sizeof(Value)); for (j=0;j<= hdim;j++) value_init(context[j]); res = (Enumeration *)malloc(sizeof(Enumeration)); res->next = NULL; res->ValidityDomain = Universe_Polyhedron(0); /* no parameters */ value_init(res->EP.d); value_set_si(res->EP.d,0); L = Polyhedron_Scan(P,res->ValidityDomain,MAXRAYS); #ifdef EDEBUG2 fprintf(stderr, "L = \n"); Polyhedron_Print(stderr, P_VALUE_FMT, L); #endif if(CT) { Polyhedron *Dt; /* Add parameters to validity domain */ Dt = Polyhedron_Preimage(res->ValidityDomain,CT,MAXRAYS); Polyhedron_Free(res->ValidityDomain); res->ValidityDomain = DomainIntersection(Dt,CEq,MAXRAYS); Polyhedron_Free(Dt); } if( param_name ) { fprintf(stdout,"---------------------------------------\n"); fprintf(stdout,"Domain:\n"); Print_Domain(stdout,res->ValidityDomain, param_name); /* Print the vertices */ printf("Vertices:\n"); for(r=0;rNbRays;++r) { if(value_zero_p(P->Ray[r][0])) printf("(line) "); printf("["); if (P->Dimension > 0) value_print(stdout,P_VALUE_FMT,P->Ray[r][1]); for(i=1;iDimension;i++) { printf(", "); value_print(stdout,P_VALUE_FMT,P->Ray[r][i+1]); } printf("]"); if(value_notone_p(P->Ray[r][P->Dimension+1])) { printf("/"); value_print(stdout,P_VALUE_FMT, P->Ray[r][P->Dimension+1]); } printf("\n"); } } res->EP.x.p = new_enode(polynomial,1,0);; value_set_si(res->EP.x.p->arr[0].d, 1); value_init(res->EP.x.p->arr[0].x.n); if (emptyQ(P)) { value_set_si(res->EP.x.p->arr[0].x.n, 0); } else if (!L) { /* Non-empty zero-dimensional domain */ value_set_si(res->EP.x.p->arr[0].x.n, 1); } else { CATCH(overflow_error) { fprintf(stderr,"Enumerate: arithmetic overflow error.\n"); fprintf(stderr,"You should rebuild PolyLib using GNU-MP" " or increasing the size of integers.\n"); overflow_warning_flag = 0; assert(overflow_warning_flag); } TRY { Vector_Set(context,0,(hdim+1)); /* Set context[hdim] = 1 (the constant) */ value_set_si(context[hdim],1); count_points(1, L, context, &res->EP.x.p->arr[0].x.n); UNCATCH(overflow_error); } } Domain_Free(L); /* **USELESS, there are no references to parameters in res** if( CT ) addeliminatedparams_evalue(&res->EP, CT); */ if( param_name ) { fprintf(stdout,"\nEhrhart Polynomial:\n"); print_evalue(stdout,&res->EP,param_name); fprintf(stdout, "\n"); } for (j=0;j<= hdim;j++) value_clear(context[j]); free(context); return(res); } /* Enumerate_NoParameters */ /** Procedure to count points in a parameterized polytope. @param Pi Polyhedron to enumerate @param C Context Domain @param MAXRAYS size of workspace @param param_name parameter names (array of strings), may be NULL @return a list of validity domains + evalues EP */ Enumeration *Polyhedron_Enumerate(Polyhedron *Pi,Polyhedron *C, unsigned MAXRAYS, const char **param_name) { Polyhedron *L, *CQ, *CQ2, *LQ, *U, *CEq, *rVD, *P, *Ph = NULL; Matrix *CT; Param_Polyhedron *PP; Param_Domain *Q; int i,hdim, dim, nb_param, np; Value *lcm, *m1, hdv; Value *context; Enumeration *en, *res; if (POL_ISSET(MAXRAYS, POL_NO_DUAL)) MAXRAYS = 0; POL_ENSURE_FACETS(Pi); POL_ENSURE_VERTICES(Pi); POL_ENSURE_FACETS(C); POL_ENSURE_VERTICES(C); res = NULL; P = Pi; #ifdef EDEBUG2 fprintf(stderr,"C = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,C); fprintf(stderr,"P = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,P); #endif hdim = P->Dimension + 1; dim = P->Dimension; nb_param = C->Dimension; /* Don't call Polyhedron2Param_Domain if there are no parameters */ if(nb_param == 0) { return(Enumerate_NoParameters(P,C,NULL,NULL,MAXRAYS,param_name)); } if(nb_param == dim) { res = (Enumeration *)malloc(sizeof(Enumeration)); res->next = 0; res->ValidityDomain = DomainIntersection(P,C,MAXRAYS); value_init(res->EP.d); value_init(res->EP.x.n); value_set_si(res->EP.d,1); value_set_si(res->EP.x.n,1); if( param_name ) { fprintf(stdout,"---------------------------------------\n"); fprintf(stdout,"Domain:\n"); Print_Domain(stdout,res->ValidityDomain, param_name); fprintf(stdout,"\nEhrhart Polynomial:\n"); print_evalue(stdout,&res->EP,param_name); fprintf(stdout, "\n"); } return res; } PP = Polyhedron2Param_SimplifiedDomain(&P,C,MAXRAYS,&CEq,&CT); if(!PP) { if( param_name ) fprintf(stdout, "\nEhrhart Polynomial:\nNULL\n"); return(NULL); } /* CT : transformation matrix to eliminate useless ("false") parameters */ if(CT) { nb_param -= CT->NbColumns-CT->NbRows; dim -= CT->NbColumns-CT->NbRows; hdim -= CT->NbColumns-CT->NbRows; /* Don't call Polyhedron2Param_Domain if there are no parameters */ if(nb_param == 0) { res = Enumerate_NoParameters(P,C,CT,CEq,MAXRAYS,param_name); Param_Polyhedron_Free(PP); goto out; } } /* get memory for Values */ lcm = (Value *)malloc((nb_param+1) * sizeof(Value)); m1 = (Value *)malloc((nb_param+1) * sizeof(Value)); /* Initialize all the 'Value' variables */ for( np=0 ; np < nb_param+1; np++ ) { value_init(lcm[np]); value_init(m1[np]); } value_init(hdv); for(Q=PP->D;Q;Q=Q->next) { int hom = 0; if(CT) { Polyhedron *Dt; CQ = Q->Domain; Dt = Polyhedron_Preimage(Q->Domain,CT,MAXRAYS); rVD = DomainIntersection(Dt,CEq,MAXRAYS); /* if rVD is empty or too small in geometric dimension */ if(!rVD || emptyQ(rVD) || (rVD->Dimension-rVD->NbEq < Dt->Dimension-Dt->NbEq-CEq->NbEq)) { if(rVD) Polyhedron_Free(rVD); Polyhedron_Free(Dt); Polyhedron_Free(CQ); continue; /* empty validity domain */ } Polyhedron_Free(Dt); } else rVD = CQ = Q->Domain; en = (Enumeration *)malloc(sizeof(Enumeration)); en->next = res; res = en; res->ValidityDomain = rVD; if( param_name ) { fprintf(stdout,"---------------------------------------\n"); fprintf(stdout,"Domain:\n"); #ifdef EPRINT_ALL_VALIDITY_CONSTRAINTS Print_Domain(stdout,res->ValidityDomain,param_name); #else { Polyhedron *VD; VD = DomainSimplify(res->ValidityDomain,C,MAXRAYS); Print_Domain(stdout,VD,param_name); Domain_Free(VD); } #endif /* EPRINT_ALL_VALIDITY_CONSTRAINTS */ } overflow_warning_flag = 1; /* Scan the vertices and compute lcm */ Scan_Vertices(PP,Q,CT,lcm,nb_param,param_name); #ifdef EDEBUG2 fprintf(stderr,"Denominator = "); for( np=0;npNbRays;r++) { if(value_zero_p(CQ->Ray[r][0]) || value_zero_p(CQ->Ray[r][CQ->Dimension+1])) break; } if(r==CQ->NbRays) { /* ok, CQ is bounded */ /* now find if CQ is contained in a hypercube of size m1 */ CQ2 = Polyhedron_Preprocess2(CQ,m1,lcm,MAXRAYS); } } if (!CQ2) { Polyhedron *tmp; #ifdef EDEBUG2 fprintf(stderr,"Homogenize.\n"); #endif hom = 1; tmp = homogenize(CQ, MAXRAYS); CQ2 = Polyhedron_Preprocess(tmp,m1,MAXRAYS); Polyhedron_Free(tmp); if (!Ph) Ph = homogenize(P, MAXRAYS); for (np=0; np < nb_param+1; np++) if (value_notzero_p(lcm[np])) value_addto(m1[np],m1[np],lcm[np]); } if (!CQ2 || emptyQ(CQ2)) { #ifdef EDEBUG2 fprintf(stderr,"Degenerate.\n"); #endif fprintf(stdout,"Degenerate Domain. Can not continue.\n"); value_init(res->EP.d); value_init(res->EP.x.n); value_set_si(res->EP.d,1); value_set_si(res->EP.x.n,-1); } else { #ifdef EDEBUG2 fprintf(stderr,"CQ2 = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,CQ2); if( ! PolyhedronIncludes(CQ, CQ2) ) fprintf( stderr,"CQ does not include CQ2 !\n"); else fprintf( stderr,"CQ includes CQ2.\n"); if( ! PolyhedronIncludes(res->ValidityDomain, CQ2) ) fprintf( stderr,"CQ2 is *not* included in validity domain !\n"); else fprintf( stderr,"CQ2 is included in validity domain.\n"); #endif /* L is used in counting the number of points in the base cases */ L = Polyhedron_Scan(hom ? Ph : P,CQ2,MAXRAYS); U = Universe_Polyhedron(0); /* LQ is used to scan the parameter space */ LQ = Polyhedron_Scan(CQ2,U,MAXRAYS); /* bounds on parameters */ Domain_Free(U); if(CT) /* we did compute another Q->Domain */ Domain_Free(CQ); /* Else, CQ was Q->Domain (used in res) */ Domain_Free(CQ2); #ifdef EDEBUG2 fprintf(stderr,"L = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,L); fprintf(stderr,"LQ = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,LQ); #endif #ifdef EDEBUG3 fprintf(stdout,"\nSystem of Equations:\n"); #endif value_init(res->EP.d); value_set_si(res->EP.d,0); /* Create a context vector size dim+2 */ context = (Value *) malloc ((hdim+1+hom)*sizeof(Value)); for(i=0;i<=(hdim+hom);i++) value_init(context[i]); Vector_Set(context,0,(hdim+1+hom)); /* Set context[hdim] = 1 (the constant) */ value_set_si(context[hdim+hom],1); CATCH(overflow_error) { fprintf(stderr,"Enumerate: arithmetic overflow error.\n"); fprintf(stderr,"You should rebuild PolyLib using GNU-MP " "or increasing the size of integers.\n"); overflow_warning_flag = 0; assert(overflow_warning_flag); } TRY { res->EP.x.p = P_Enum(L,LQ,context,1,nb_param+hom, dim+hom,lcm,param_name); UNCATCH(overflow_error); } if (hom) dehomogenize_evalue(&res->EP, nb_param+1); for(i=0;i<=(hdim+hom);i++) value_clear(context[i]); free(context); Domain_Free(L); Domain_Free(LQ); #ifdef EDEBUG5 if( param_name ) { fprintf(stdout,"\nEhrhart Polynomial (before simplification):\n"); print_evalue(stdout,&res->EP,param_name); } #endif /* Try to simplify the result */ reduce_evalue(&res->EP); /* Put back the original parameters into result */ /* (equalities have been eliminated) */ if(CT) addeliminatedparams_evalue(&res->EP,CT); if (param_name) { fprintf(stdout,"\nEhrhart Polynomial:\n"); print_evalue(stdout,&res->EP, param_name); fprintf(stdout,"\n"); /* sometimes the final \n lacks (when a single constant is printed) */ } } } if (Ph) Polyhedron_Free(Ph); /* Clear all the 'Value' variables */ for (np=0; np < nb_param+1; np++) { value_clear(lcm[np]); value_clear(m1[np]); } value_clear(hdv); free(lcm); free(m1); /* We can't simply call Param_Polyhedron_Free because we've reused the domains */ Param_Vertices_Free(PP->V); while (PP->D) { Q = PP->D; PP->D = PP->D->next; free(Q->F); free(Q); } free(PP); out: if (CEq) Polyhedron_Free(CEq); if (CT) Matrix_Free(CT); if( P != Pi ) Polyhedron_Free( P ); return res; } /* Polyhedron_Enumerate */ void Enumeration_Free(Enumeration *en) { Enumeration *ee; while( en ) { free_evalue_refs( &(en->EP) ); Domain_Free( en->ValidityDomain ); ee = en ->next; free( en ); en = ee; } } /* adds by B. Meister for Ehrhart Polynomial approximation */ /** * Divides the evalue e by the integer n
* recursive function
* Warning : modifies e * @param e an evalue (to be divided by n) * @param n */ void evalue_div(evalue * e, Value n) { int i; Value gc; value_init(gc); if (value_zero_p(e->d)) { for (i=0; i< e->x.p->size; i++) { evalue_div(&(e->x.p->arr[i]), n); } } else { value_multiply(e->d, e->d, n); /* simplify the new rational if needed */ value_gcd(gc, e->x.n, e->d); if (value_notone_p(gc)) { value_divexact(e->d, e->d, gc); value_divexact(e->x.n, e->x.n, gc); } } value_clear(gc); } /* evalue_div */ /** Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names) Procedure to estimate the number of points in a parameterized polytope. Returns a list of validity domains + evalues EP B.M. The most rough and quick approximation by variables expansion Deals with the full-dimensional case. @param Pi : Polyhedron to enumerate (approximatively) @param C : Context Domain @param MAXRAYS : size of workspace @param param_name : names for the parameters (char strings) */ Enumeration *Ehrhart_Quick_Apx_Full_Dim(Polyhedron *Pi,Polyhedron *C, unsigned MAXRAYS, const char **param_name) { Polyhedron *L, *CQ, *CQ2, *LQ, *U, *CEq, *rVD, *P; Matrix *CT; Param_Polyhedron *PP; Param_Domain *Q; int i,j,hdim, dim, nb_param, np; Value *lcm, *m1, hdv; Value *context; Enumeration *en, *res; Value expansion_det; Polyhedron * Expanded; /* used to scan the vertices */ Param_Vertices * V_tmp; res = NULL; P = Pi; value_init(expansion_det); #ifdef EDEBUG2 fprintf(stderr,"C = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,C); fprintf(stderr,"P = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,P); #endif hdim = P->Dimension + 1; dim = P->Dimension; nb_param = C->Dimension; /* Don't call Polyhedron2Param_Domain if there are no parameters */ if(nb_param == 0) { return(Enumerate_NoParameters(P,C,NULL,NULL,MAXRAYS, param_name)); } #if EDEBUG2 printf("Enumerating polyhedron : \n"); Polyhedron_Print(stdout, P_VALUE_FMT, P); #endif PP = Polyhedron2Param_SimplifiedDomain(&P,C,MAXRAYS,&CEq,&CT); if(!PP) { if( param_name ) fprintf(stdout, "\nEhrhart Polynomial:\nNULL\n"); return(NULL); } /* CT : transformation matrix to eliminate useless ("false") parameters */ if(CT) { nb_param -= CT->NbColumns-CT->NbRows; dim -= CT->NbColumns-CT->NbRows; hdim -= CT->NbColumns-CT->NbRows; /* Don't call Polyhedron2Param_Domain if there are no parameters */ if(nb_param == 0) { res = Enumerate_NoParameters(P,C,CT,CEq,MAXRAYS,param_name); if( P != Pi ) Polyhedron_Free( P ); return( res ); } } if (!PP->nbV) /* Leaks memory */ return NULL; /* get memory for Values */ lcm = (Value *)malloc( nb_param * sizeof(Value)); m1 = (Value *)malloc( nb_param * sizeof(Value)); /* Initialize all the 'Value' variables */ for( np=0 ; npD;Q;Q=Q->next) { if(CT) { Polyhedron *Dt; CQ = Q->Domain; Dt = Polyhedron_Preimage(Q->Domain,CT,MAXRAYS); rVD = DomainIntersection(Dt,CEq,MAXRAYS); /* if rVD is empty or too small in geometric dimension */ if(!rVD || emptyQ(rVD) || (rVD->Dimension-rVD->NbEq < Dt->Dimension-Dt->NbEq-CEq->NbEq)) { if(rVD) Polyhedron_Free(rVD); Polyhedron_Free(Dt); continue; /* empty validity domain */ } Polyhedron_Free(Dt); } else rVD = CQ = Q->Domain; en = (Enumeration *)malloc(sizeof(Enumeration)); en->next = res; res = en; res->ValidityDomain = rVD; if( param_name ) { fprintf(stdout,"---------------------------------------\n"); fprintf(stdout,"Domain:\n"); #ifdef EPRINT_ALL_VALIDITY_CONSTRAINTS Print_Domain(stdout,res->ValidityDomain,param_name); #else { Polyhedron *VD; VD = DomainSimplify(res->ValidityDomain,C,MAXRAYS); Print_Domain(stdout,VD,param_name); Domain_Free(VD); } #endif /* EPRINT_ALL_VALIDITY_CONSTRAINTS */ } overflow_warning_flag = 1; #ifdef EDEBUG2 fprintf(stderr,"Denominator = "); for( np=0;npNbRays;r++) { if(value_zero_p(CQ->Ray[r][0]) || value_zero_p(CQ->Ray[r][CQ->Dimension+1])) break; } if(r==CQ->NbRays) { /* ok, CQ is bounded */ /* now find if CQ is contained in a hypercube of size m1 */ CQ2 = Polyhedron_Preprocess2(CQ,m1,lcm,MAXRAYS); } } if (!CQ2 || emptyQ(CQ2)) { #ifdef EDEBUG2 fprintf(stderr,"Degenerate.\n"); #endif fprintf(stdout,"Degenerate Domain. Can not continue.\n"); value_init(res->EP.d); value_init(res->EP.x.n); value_set_si(res->EP.d,1); value_set_si(res->EP.x.n,-1); } else { #ifdef EDEBUG2 fprintf(stderr,"CQ2 = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,CQ2); if( ! PolyhedronIncludes(CQ, CQ2) ) fprintf( stderr,"CQ does not include CQ2 !\n"); else fprintf( stderr,"CQ includes CQ2.\n"); if( ! PolyhedronIncludes(res->ValidityDomain, CQ2) ) fprintf( stderr,"CQ2 is *not* included in validity domain !\n"); else fprintf( stderr,"CQ2 is included in validity domain.\n"); #endif /* L is used in counting the number of points in the base cases */ L = Polyhedron_Scan(P,CQ,MAXRAYS); U = Universe_Polyhedron(0); /* LQ is used to scan the parameter space */ LQ = Polyhedron_Scan(CQ2,U,MAXRAYS); /* bounds on parameters */ Domain_Free(U); if(CT) /* we did compute another Q->Domain */ Domain_Free(CQ); /* Else, CQ was Q->Domain (used in res) */ Domain_Free(CQ2); #ifdef EDEBUG2 fprintf(stderr,"L = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,L); fprintf(stderr,"LQ = \n"); Polyhedron_Print(stderr,P_VALUE_FMT,LQ); #endif #ifdef EDEBUG3 fprintf(stdout,"\nSystem of Equations:\n"); #endif value_init(res->EP.d); value_set_si(res->EP.d,0); /* Create a context vector size dim+2 */ context = (Value *) malloc ((hdim+1)*sizeof(Value)); for(i=0;i<=(hdim);i++) value_init(context[i]); Vector_Set(context,0,(hdim+1)); /* Set context[hdim] = 1 (the constant) */ value_set_si(context[hdim],1); CATCH(overflow_error) { fprintf(stderr,"Enumerate: arithmetic overflow error.\n"); fprintf(stderr,"You should rebuild PolyLib using GNU-MP " "or increasing the size of integers.\n"); overflow_warning_flag = 0; assert(overflow_warning_flag); } TRY { res->EP.x.p = P_Enum(L,LQ,context,1,nb_param,dim,lcm, param_name); UNCATCH(overflow_error); } for(i=0;i<=(hdim);i++) value_clear(context[i]); free(context); Domain_Free(L); Domain_Free(LQ); #ifdef EDEBUG5 if( param_name ) { fprintf(stdout,"\nEhrhart Polynomial (before simplification):\n"); print_evalue(stdout,&res->EP,param_name); } /* BM: divide EP by denom_det, the expansion factor */ fprintf(stdout,"\nEhrhart Polynomial (before division):\n"); print_evalue(stdout,&(res->EP),param_name); #endif evalue_div(&(res->EP), expansion_det); /* Try to simplify the result */ reduce_evalue(&res->EP); /* Put back the original parameters into result */ /* (equalities have been eliminated) */ if(CT) addeliminatedparams_evalue(&res->EP,CT); if( param_name ) { fprintf(stdout,"\nEhrhart Polynomial:\n"); print_evalue(stdout,&res->EP, param_name); fprintf(stdout,"\n"); /* sometimes the final \n lacks (when a single constant is printed) */ } } } value_clear(expansion_det); if( P != Pi ) Polyhedron_Free( P ); /* Clear all the 'Value' variables */ for( np=0; np matrix), treating the non-full-dimensional case. * @param M a polyhedron under implicit form * @param C M's context under implicit form * @param Validity_Lattice a pointer to the parameter's validity lattice * @param MAXRAYS the needed "working space" for other polylib functions used here * @param param_name the names of the parameters, */ Enumeration *Ehrhart_Quick_Apx(Matrix * M, Matrix * C, Matrix **Validity_Lattice, unsigned maxRays) { /* char ** param_name) {*/ /* 0- compute a full-dimensional polyhedron with the same number of points, and its parameter's validity lattice */ Matrix * M_full; Polyhedron * P, * PC; Enumeration *en; M_full = full_dimensionize(M, C->NbColumns-2, Validity_Lattice); /* 1- apply the same tranformation to the context that what has been applied to the parameters space of the polyhedron. */ mpolyhedron_compress_last_vars(C, *Validity_Lattice); show_matrix(M_full); P = Constraints2Polyhedron(M_full, maxRays); PC = Constraints2Polyhedron(C, maxRays); Matrix_Free(M_full); /* compute the Ehrhart polynomial of the "equivalent" polyhedron */ en = Ehrhart_Quick_Apx_Full_Dim(P, PC, maxRays, NULL); /* clean up */ Polyhedron_Free(P); Polyhedron_Free(PC); return en; } /* Ehrhart_Quick_Apx */ /** * Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit * form -> matrix), treating the non-full-dimensional case. If there are some * equalities involving only parameters, these are used to eliminate useless * parameters. * @param M a polyhedron under implicit form * @param C M's context under implicit form * @param validityLattice a pointer to the parameter's validity lattice * (returned) * @param parmsEqualities Equalities involving only the parameters * @param maxRays the needed "working space" for other polylib functions used here * @param elimParams array of the indices of the eliminated parameters (returned) */ Enumeration *Constraints_EhrhartQuickApx(Matrix const * M, Matrix const * C, Matrix ** validityLattice, Matrix ** parmEqualities, unsigned int ** elimParms, unsigned maxRays) { Enumeration *EP; Matrix * Mp = Matrix_Copy(M); Matrix * Cp = Matrix_Copy(C); /* remove useless equalities involving only parameters, using these equalities to remove parameters. */ (*parmEqualities) = Constraints_Remove_parm_eqs(&Mp, &Cp, 0, elimParms); if (Mp->NbRows>=0) {/* if there is no contradiction */ EP = Ehrhart_Quick_Apx(Mp, Cp, validityLattice, maxRays); return EP; } else { /* if there are contradictions, return a zero Ehrhart polynomial */ return NULL; } } /** * Returns the array of parameter names after some of them have been eliminated. * @param parmNames the initial names of the parameters * @param elimParms a list of parameters that have been eliminated from the * original parameters. The first element of this array is the number of * elements. *

Note: does not copy the parameters names themselves.

* @param nbParms the initial number of parameters */ const char **parmsWithoutElim(char const **parmNames, unsigned int const *elimParms, unsigned int nbParms) { int i=0, j=0,k; int newParmNb = nbParms - elimParms[0]; const char **newParmNames = (const char **)malloc(newParmNb * sizeof(char *)); for (k=1; k<= elimParms[0]; k++) { while (i!=elimParms[k]) { newParmNames[i-k+1] = parmNames[i]; i++; } } return newParmNames; } /** * returns a constant Ehrhart polynomial whose value is zero for any value of * the parameters. * @param nbParms the number of parameters, i.e., the number of arguments to * the Ehrhart polynomial */ Enumeration * Enumeration_zero(unsigned int nbParms, unsigned int maxRays) { Matrix * Mz = Matrix_Alloc(1, nbParms+3); Polyhedron * emptyP; Polyhedron * universe; Enumeration * zero; /* 1- build an empty polyhedron with the right dimension */ /* here we choose to take 2i = -1 */ value_set_si(Mz->p[0][1], 2); value_set_si(Mz->p[0][nbParms+2], 1); emptyP = Constraints2Polyhedron(Mz, maxRays); Matrix_Free(Mz); universe = Universe_Polyhedron(nbParms); zero = Polyhedron_Enumerate(emptyP, universe, maxRays, NULL); Polyhedron_Free(emptyP); Polyhedron_Free(universe); return zero; } /* Enumeration_zero() */ polylib-5.22.5.orig/source/arith/0000755000175000017500000000000011341243106017502 5ustar sylvestresylvestrepolylib-5.22.5.orig/source/arith/arithmetique.h0000644000175000017500000006512011341227527022371 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* header file built by cproto */ #ifndef arithmetique_header_included #define arithmetique_header_included /** package arithmetique * * $Id: arithmetique.h,v 1.24 2007/02/22 09:16:57 skimo Exp $ * * Francois Irigoin, mai 1989 * * Modifications * - rewrite of DIVIDE which was wrong (Remi Triolet, Francois Irigoin, * april 90) * - simplification of POSITIVE_DIVIDE by suppressing one modulo * - B.Meister : added addmul, operation existing in gmp and quite useful * (05-2005) */ /* We would like linear to be generic about the "integer" type used * to represent integer values. Thus Value is defined here. It should * be changed to "int" "long" or "long long". In an ideal world, * any source modification should be limited to this package. * * Indeed, we cannot switch easily to bignums that need constructors * dans destructors... That would lead to too many modifications... * C++ would make things easier and cleaner... * * Fabien COELHO */ #include #include /* Included for getting constants: INT_MAX, etc.. */ #ifdef GNUMP #include #include #include #ifndef mp_get_memory_functions #if defined(__cplusplus) extern "C" { #endif void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)); #if defined(__cplusplus) } #endif #endif #endif #ifdef CLN #include #define WANT_OBFUSCATING_OPERATORS #include #endif /* # #### # # #### # #### # # #### # # # ## # # # # # # ## # # # # # # # # # # # # # # # # # # # # # # # # ### # # # # # # # ### # # # # ## # # # # # # ## # # ###### #### # # #### ###### #### # # #### */ /* * Constants like LONG_LONG_MAX are not defined with ansi options, so they are * defined here. */ #ifndef LONG_LONG_MAX /* would fix on solaris: * #define LONG_LONG_MAX LLONG_MAX * #define LONG_LONG_MIN LLONG_MIN */ #ifndef __LONG_LONG_MAX__ #define __LONG_LONG_MAX__ 9223372036854775807LL #endif #undef LONG_LONG_MAX #define LONG_LONG_MAX __LONG_LONG_MAX__ #undef LONG_LONG_MIN #define LONG_LONG_MIN (-LONG_LONG_MAX-1) #undef ULONG_LONG_MAX #define ULONG_LONG_MAX (LONG_LONG_MAX * 2ULL + 1) #endif #if defined(LINEAR_VALUE_IS_LONGLONG) #define LINEAR_VALUE_STRING "long long int" typedef long long int Value; #if defined(WIN32) && !defined(unix) /* Mingw or Windows need an incompatible format string. */ # define VALUE_FMT "%I64d" #else # define VALUE_FMT "%lld" #endif #define VALUE_CONST(val) (val##LL) /* * CAUTION! 'VALUE_MIN' is defined as 'LONG_LONG_MIN +1' so as to preserve the * symmetry (-min==max) and to have a NAN value. FC */ #define VALUE_NAN LONG_LONG_MIN #define VALUE_MIN (LONG_LONG_MIN+1LL) #define VALUE_MAX LONG_LONG_MAX #define VALUE_SQRT_MIN long_to_value(LONG_MIN) #define VALUE_SQRT_MAX long_to_value(LONG_MAX) #define VALUE_ZERO (0LL) #define VALUE_ONE (1LL) #define VALUE_MONE (-1LL) #define VALUE_TO_LONG(val) \ ((long)((val)>(Value)LONG_MIN&&(val)<=(Value)LONG_MAX)?\ (val):(THROW(overflow_error), LONG_MIN)) #define VALUE_TO_INT(val) \ ((int)((val)>(Value)INT_MIN&&(val)<=(Value)INT_MAX)?\ (val):(THROW(overflow_error), INT_MIN)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* #define VALUE_TO_FLOAT(val) ((float)(val)): Doesn't seem to work with gcc */ #define VALUE_TO_FLOAT(val) ((float)((int)(val))) /* end LINEAR_VALUE_IS_LONGLONG */ /* # #### # # #### # # # ## # # # # # # # # # # # # # # # # # ### # # # # ## # # ###### #### # # #### */ #elif defined(LINEAR_VALUE_IS_LONG) #define LINEAR_VALUE_STRING "long int" typedef long Value; #define VALUE_FMT "%ld" #define VALUE_CONST(val) (val##L) #define VALUE_NAN LONG_MIN #define VALUE_MIN (LONG_MIN+1L) #define VALUE_MAX LONG_MAX #define VALUE_SQRT_MIN int_to_value(INT_MIN) #define VALUE_SQRT_MAX int_to_value(INT_MAX) #define VALUE_ZERO 0L #define VALUE_ONE 1L #define VALUE_MONE -1L #define VALUE_TO_LONG(val) (val) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* end LINEAR_VALUE_IS_LONG */ /* ###### # #### ## ##### # # # # # # # ##### # # # # # # # # # # ###### # # # # # # # # # ###### #### # # # */ /* #elif defined(LINEAR_VALUE_IS_FLOAT) #define LINEAR_VALUE_STRING "float" typedef float Value; #define VALUE_FMT "%f" #define VALUE_CONST(val) (val) #define VALUE_MIN FLOAT_MIN #define VALUE_MAX FLOAT_MAX #define VALUE_ZERO 0.0 #define VALUE_ONE 1.0 #define VALUE_MONE -1.0 #define VALUE_TO_LONG(val) ((long)(val)) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) */ /* end LINEAR_VALUE_IS_FLOAT */ /* #### # # ## ##### # # # # # # # # # # # # # ###### # # # # ####### # # # ###### ##### # # # # # # # # # # # # #### # # # # # # */ /* Char version is used to detect invalid assignments */ #elif defined(LINEAR_VALUE_IS_CHARS) #define LINEAR_VALUE_STRING "char" typedef union { char *s; long l; int i; float f; double d;} Value; #define VALUE_FMT "%s" #define VALUE_CONST(val) ((Value)(val)) #define VALUE_NAN ((Value)(long)0xdadeebee) #define VALUE_MIN ((Value)(long)0xdeadbeef) #define VALUE_MAX ((Value)(long)0xfeedabee) #define VALUE_ZERO ((Value)0) #define VALUE_ONE ((Value)1) #define VALUE_MONE ((Value)-1) #define VALUE_TO_LONG(val) (val.l) #define VALUE_TO_INT(val) (val.i) #define VALUE_TO_FLOAT(val) (val.f) #define VALUE_TO_DOUBLE(val) (val.d) /* end LINEAR_VALUE_IS_CHARS */ /* # # # ##### # ## # # # # # # # # # # # # # # ## # # # # # */ #elif defined(LINEAR_VALUE_IS_INT) #define LINEAR_VALUE_STRING "int" typedef int Value; #define VALUE_FMT "%d" #define VALUE_CONST(val) (val) #define VALUE_NAN INT_MIN #define VALUE_MIN (INT_MIN+1) #define VALUE_MAX INT_MAX #define VALUE_ZERO 0 #define VALUE_ONE 1 #define VALUE_MONE -1 #define VALUE_TO_LONG(val) ((long)(val)) #define VALUE_TO_INT(val) ((int)(val)) #define VALUE_TO_FLOAT(val) ((float)(val)) #define VALUE_TO_DOUBLE(val) ((double)(val)) /* end LINEAR_VALUE_IS_INT */ #elif defined(GNUMP) #define LINEAR_VALUE_STRING "gmp" typedef mpz_t Value; #define VALUE_FMT "%s" /* don't use these, use value_set_si instead ! */ #undef VALUE_ZERO #undef VALUE_ONE #undef VALUE_MONE #define VALUE_TO_LONG(val) (mpz_get_si(val)) #define VALUE_TO_INT(val) ((int)mpz_get_si(val)) #define VALUE_TO_FLOAT(val) ((float)((int)mpz_get_si(val))) #define VALUE_TO_DOUBLE(val) (mpz_get_d(val)) #elif defined(CLN) #define LINEAR_VALUE_STRING "cln" typedef cln::cl_I Value; #define VALUE_FMT "%s" #define VALUE_TO_INT(val) (cln::cl_I_to_int(val)) #define VALUE_TO_DOUBLE(val) (cln::double_approx(val)) #endif /* ***************** MACROS FOR MANIPULATING VALUES ******************** */ #if defined(CLN) #define value_init(val) ((val).word = ((cln::cl_uint)cl_FN_tag) << cl_tag_shift) #define value_assign(v1,v2) ((v1) = (v2)) #define value_set_si(val,i) ((val) = (i)) #define value_set_double(val,d) ((val) = cln::truncate1(cln::cl_R(d))) #define value_clear(val) ((val) = 0) #define value_read(val,str) ((val) = (str)) #define value_print(Dst,fmt,val) {std::ostringstream strm; strm << val; \ fprintf((Dst),(fmt),strm.str().c_str()); \ } #define value_swap(v1,v2) {Value tmp; tmp = v2; \ v2 = v1; v1 = tmp; \ } /* Boolean operators on 'Value' */ #define value_eq(v1,v2) ((v1)==(v2)) #define value_ne(v1,v2) ((v1)!=(v2)) #define value_gt(v1,v2) ((v1)>(v2)) #define value_ge(v1,v2) ((v1)>=(v2)) #define value_lt(v1,v2) ((v1)<(v2)) #define value_le(v1,v2) ((v1)<=(v2)) #define value_abs_eq(v1,v2) (cln::abs(v1)==cln::abs(v2)) #define value_abs_ne(v1,v2) (cln::abs(v1)!=cln::abs(v2)) #define value_abs_gt(v1,v2) (cln::abs(v1)>cln::abs(v2)) #define value_abs_ge(v1,v2) (cln::abs(v1)>=cln::abs(v2)) #define value_abs_lt(v1,v2) (cln::abs(v1) 0) #define value_neg_p(val) ((val) < 0) #define value_posz_p(val) ((val) >= 0) #define value_negz_p(val) ((val) <= 0) #define value_zero_p(val) ((val) == 0) #define value_notzero_p(val) ((val) != 0) #define value_one_p(val) ((val) == 1) #define value_notone_p(val) ((val) != 1) #define value_mone_p(val) ((val) == -1) #define value_notmone_p(val) ((val) != -1) #define value_cmp_si(val, n) (cln::compare(val,n)) #elif defined(GNUMP) /* Basic macros */ #define value_init(val) (mpz_init((val))) #define value_assign(v1,v2) (mpz_set((v1),(v2))) #define value_set_si(val,i) (mpz_set_si((val),(i))) #define value_set_double(val,d)(mpz_set_d((val),(d))) #define value_clear(val) (mpz_clear((val))) #define value_read(val,str) (mpz_set_str((val),(str),10)) typedef void (*value_print_gmp_free_t)(void *, size_t); #define value_print(Dst,fmt,val) {char *str; \ value_print_gmp_free_t gmp_free; \ str = mpz_get_str(0,10,(val)); \ fprintf((Dst),(fmt),str); \ mp_get_memory_functions(NULL, NULL, &gmp_free); \ (*gmp_free) (str, strlen(str)+1); \ } #define value_swap(val1,val2) (mpz_swap(val1, val2)) /* Boolean operators on 'Value' */ #define value_eq(v1,v2) (mpz_cmp((v1),(v2)) == 0) #define value_ne(v1,v2) (mpz_cmp((v1),(v2)) != 0) #define value_gt(v1,v2) (mpz_cmp((v1),(v2)) > 0) #define value_ge(v1,v2) (mpz_cmp((v1),(v2)) >= 0) #define value_lt(v1,v2) (mpz_cmp((v1),(v2)) < 0) #define value_le(v1,v2) (mpz_cmp((v1),(v2)) <= 0) #define value_abs_eq(v1,v2) (mpz_cmpabs((v1),(v2)) == 0) #define value_abs_ne(v1,v2) (mpz_cmpabs((v1),(v2)) != 0) #define value_abs_gt(v1,v2) (mpz_cmpabs((v1),(v2)) > 0) #define value_abs_ge(v1,v2) (mpz_cmpabs((v1),(v2)) >= 0) #define value_abs_lt(v1,v2) (mpz_cmpabs((v1),(v2)) < 0) #define value_abs_le(v1,v2) (mpz_cmpabs((v1),(v2)) <= 0) /* Trian operators on 'Value' */ #define value_sign(val) (mpz_sgn(val)) #define value_compare(v1,v2) (mpz_cmp((v1),(v2))) /* Binary operations on 'Value' */ #define value_addto(ref,val1,val2) (mpz_add((ref),(val1),(val2))) #define value_add_int(ref,val,vint) (mpz_add_ui((ref),(val),(long)(vint))) #define value_addmul(ref, val1, val2) (mpz_addmul((ref), (val1), (val2))) #define value_increment(ref,val) (mpz_add_ui((ref),(val),1)) #define value_multiply(ref,val1,val2) (mpz_mul((ref),(val1),(val2))) #define value_subtract(ref,val1,val2) (mpz_sub((ref),(val1),(val2))) #define value_sub_int(ref,val,vint) (mpz_sub_ui((ref),(val),(long)(vint))) #define value_decrement(ref,val) (mpz_sub_ui((ref),(val),1)) #define value_division(ref,val1,val2) (mpz_tdiv_q((ref),(val1),(val2))) #define value_divexact(ref,val1,val2) (mpz_divexact((ref),(val1),(val2))) #define value_modulus(ref,val1,val2) (mpz_tdiv_r((ref),(val1),(val2))) #define value_pdivision(ref,val1,val2) (mpz_fdiv_q((ref),(val1),(val2))) #define value_pmodulus(ref,val1,val2) (mpz_fdiv_r((ref),(val1),(val2))) #define value_oppose(ref,val) (mpz_neg((ref),(val))) #define value_absolute(ref,val) (mpz_abs((ref),(val))) #define value_minimum(ref,val1,val2) (value_le((val1),(val2)) ? \ mpz_set((ref),(val1)) : \ mpz_set((ref),(val2))) #define value_maximum(ref,val1,val2) (value_ge((val1),(val2)) ? \ mpz_set((ref),(val1)) : \ mpz_set((ref),(val2))) #define value_gcd(ref,val1,val2) (mpz_gcd(ref,val1,val2)) #define value_lcm(ref,val1,val2) (mpz_lcm(ref,val1,val2)) #define value_orto(ref,val1,val2) (mpz_ior((ref),(val1),(val2))) #define value_andto(ref,val1,val2) (mpz_and((ref),(val1),(val2))) /* Conditional operations on 'Value' */ #define value_pos_p(val) (mpz_sgn(val) > 0) #define value_neg_p(val) (mpz_sgn(val) < 0) #define value_posz_p(val) (mpz_sgn(val) >= 0) #define value_negz_p(val) (mpz_sgn(val) <= 0) #define value_zero_p(val) (mpz_sgn(val) == 0) #define value_notzero_p(val) (mpz_sgn(val) != 0) #define value_one_p(val) (mpz_cmp_si(val,1) == 0) #define value_notone_p(val) (mpz_cmp_si(val,1) != 0) #define value_mone_p(val) (mpz_cmp_si(val,-1) ==0) #define value_notmone_p(val) (mpz_cmp_si(val,-1) !=0) #define value_cmp_si(val, n) (mpz_cmp_si(val,n)) /* ************************************************************************* */ #else /* 'Value' set to longlong|long|float|char *|int */ /* Basic Macros */ #define value_init(val) ((val) = 0) #define value_assign(v1,v2) ((v1) = (v2)) #define value_set_si(val,i) ((val) = (Value)(i)) #define value_set_double(val,d) ((val) = (Value)(d)) #define value_clear(val) ((val) = 0) #define value_read(val,str) (sscanf((str),VALUE_FMT,&(val))) #define value_print(Dst,fmt,val) (fprintf((Dst),(fmt),(val))) #define value_swap(v1,v2) {Value tmp; tmp = v2; \ v2 = v1; v1 = tmp; \ } /* Cast to 'Value' */ #define int_to_value(i) ((Value)(i)) #define long_to_value(l) ((Value)(l)) #define float_to_value(f) ((Value)(f)) #define double_to_value(d) ((Value)(d)) /* Boolean operators on 'Value' */ #define value_eq(v1,v2) ((v1)==(v2)) #define value_ne(v1,v2) ((v1)!=(v2)) #define value_gt(v1,v2) ((v1)>(v2)) #define value_ge(v1,v2) ((v1)>=(v2)) #define value_lt(v1,v2) ((v1)<(v2)) #define value_le(v1,v2) ((v1)<=(v2)) #define value_abs_eq(v1,v2) (value_abs(v1)==value_abs(v2)) #define value_abs_ne(v1,v2) (value_abs(v1)!=value_abs(v2)) #define value_abs_gt(v1,v2) (value_abs(v1)>value_abs(v2)) #define value_abs_ge(v1,v2) (value_abs(v1)>=value_abs(v2)) #define value_abs_lt(v1,v2) (value_abs(v1)>(v2)) /* Binary operations on 'Value' */ #define value_addto(ref,val1,val2) ((ref) = (val1)+(val2)) #define value_add_int(ref,val,vint) ((ref) = (val)+(Value)(vint)) #define value_addmul(ref, val1, val2) ((ref) += (val1)*(val2)) #define value_increment(ref,val) ((ref) = (val)+VALUE_ONE) #define value_direct_product(ref,val1,val2) ((ref) = (val1)*(val2)) /* direct! */ #define value_multiply(ref,val1,val2) ((ref) = value_mult((val1),(val2))) #define value_subtract(ref,val1,val2) ((ref) = (val1)-(val2)) #define value_sub_int(ref,val,vint) ((ref) = (val)-(Value)(vint)) #define value_decrement(ref,val) ((ref) = (val)-VALUE_ONE) #define value_division(ref,val1,val2) ((ref) = (val1)/(val2)) #define value_divexact(ref,val1,val2) ((ref) = (val1)/(val2)) #define value_modulus(ref,val1,val2) ((ref) = (val1)%(val2)) #define value_pdivision(ref,val1,val2) ((ref) = value_pdiv((val1),(val2))) #define value_pmodulus(ref,val1,val2) ((ref) = value_pmod((val1),(val2))) #define value_oppose(ref,val) ((ref) = value_uminus((val))) #define value_absolute(ref,val) ((ref) = value_abs((val))) #define value_minimum(ref,val1,val2) ((ref) = value_min((val1),(val2))) #define value_maximum(ref,val1,val2) ((ref) = value_max((val1),(val2))) #define value_gcd(ref,val1,val2) Gcd((val1),(val2),&(ref)) #define value_lcm(ref,val1,val2) Lcm3((val1),(val2),&(ref)) #define value_orto(ref,val1,val2) ((ref) = (val1)|(val2)) #define value_andto(ref,val1,val2) ((ref) = (val1)&(val2)) /* Unary operators on 'Value' */ #define value_uminus(val) (-(val)) #define value_not(val) (~(val)) #define value_abs(val) (value_posz_p(val)? \ (val) : \ (value_ne((val), VALUE_NAN) ? \ value_uminus(val) : \ (THROW (overflow_error), VALUE_NAN ))) /* Conditional operations on 'Value' */ #define value_pos_p(val) value_gt(val,VALUE_ZERO) #define value_neg_p(val) value_lt(val,VALUE_ZERO) #define value_posz_p(val) value_ge(val,VALUE_ZERO) #define value_negz_p(val) value_le(val,VALUE_ZERO) #define value_zero_p(val) value_eq(val,VALUE_ZERO) #define value_notzero_p(val) value_ne(val,VALUE_ZERO) #define value_one_p(val) value_eq(val,VALUE_ONE) #define value_notone_p(val) value_ne(val,VALUE_ONE) #define value_mone_p(val) value_eq(val,VALUE_MONE) #define value_notmone_p(val) value_ne(val,VALUE_MONE) #define value_cmp_si(val, n) (val - (n)) #define value_min_p(val) value_eq(val,VALUE_MIN) #define value_max_p(val) value_eq(val,VALUE_MAX) #define value_notmin_p(val) value_ne(val,VALUE_MIN) #define value_notmax_p(val) value_ne(val,VALUE_MAX) #endif /* 'Value' set to |longlong|long|float|char *|int */ /* *********************** PROTECTED MULTIPLICATION ********************** */ #include "arithmetic_errors.h" /* (|v| < MAX / |w|) => v*w is okay * I could check ((v*w)/w)==v but a tmp would be useful */ #define value_protected_hard_idiv_multiply(v,w,throw) \ ((value_zero_p(w) || value_zero_p(v))? VALUE_ZERO: \ value_lt(value_abs(v),value_div(VALUE_MAX,value_abs(w)))? \ value_direct_multiply(v,w): (throw, VALUE_NAN)) /* is a software idiv is assumed, quick check performed first */ #if defined(LINEAR_VALUE_ASSUME_SOFTWARE_IDIV) #define value_protected_multiply(v,w,throw) \ ((value_le(v,VALUE_SQRT_MAX) && value_le(w,VALUE_SQRT_MAX) && \ value_ge(v,VALUE_SQRT_MIN) && value_ge(w,VALUE_SQRT_MIN))? \ value_direct_multiply(v,w): value_protected_hard_idiv_multiply(v,w,throw)) #else #define value_protected_multiply(v,w,throw) \ value_protected_hard_idiv_multiply(v,w,throw) #endif /* protected versions */ #define value_protected_mult(v,w) \ value_protected_multiply(v,w,THROW(overflow_error)) #define value_protected_product(v,w) \ v=value_protected_mult(v,w) /* whether the default is protected or not * this define makes no sense any more... well, doesn't matter. FC. */ #if defined(LINEAR_VALUE_PROTECT_MULTIPLY) #define value_mult(v,w) value_protected_mult(v,w) #define value_product(v,w) value_protected_product(v,w) #else /* I do enforce the protection whatever requested:-) * prints out a message and throws the exception, hoping * that some valid CATCH waits for it upwards. */ #define value_mult(v,w) \ value_protected_multiply(v,w, \ (fprintf(stderr,"[value_mult] value overflow!\n"),THROW(overflow_error))) #define value_product(v,w) v=value_mult(v,w) /* was: * #define value_mult(v,w) value_direct_multiply(v,w) * #define value_product(v,w) value_direct_product(v,w) * could be: protected versions... */ #endif /******************************************************* STATIC VALUE DEBUG */ /* LINEAR_VALUE_IS_CHARS is used for type checking. * some operations are not allowed on (char*), thus * they are switched to some other operation here... */ #if defined(LINEAR_VALUE_IS_CHARS) #define value_fake_binary(v1,v2) ((Value)((v1).i+(v2).i)) #define value_bool_binary(v1,v2) ((int)((v1).i+(v2).i)) #undef float_to_value #define float_to_value(f) ((Value)f) #undef double_to_value #define double_to_value(f) ((Value)f) #undef value_uminus #define value_uminus(v) (v) #undef value_mult #define value_mult(v1,v2) value_fake_binary(v1,v2) #undef value_mod #define value_mod(v1,v2) value_fake_binary(v1,v2) #undef value_ge #define value_ge(v1,v2) value_bool_binary(v1,v2) #undef value_gt #define value_gt(v1,v2) value_bool_binary(v1,v2) #undef value_le #define value_le(v1,v2) value_bool_binary(v1,v2) #undef value_lt #define value_lt(v1,v2) value_bool_binary(v1,v2) #undef value_ne #define value_ne(v1,v2) value_bool_binary(v1,v2) #undef value_eq #define value_eq(v1,v2) value_bool_binary(v1,v2) #undef value_plus #define value_plus(v1,v2) value_fake_binary(v1,v2) #undef value_minus #define value_minus(v1,v2) value_fake_binary(v1,v2) #undef value_pdiv #define value_pdiv(v1,v2) value_fake_binary(v1,v2) #undef value_div #define value_div(v1,v2) value_fake_binary(v1,v2) #undef value_mod #define value_mod(v1,v2) value_fake_binary(v1,v2) #undef value_addto #define value_addto(v1,v2) value_assign(v1,value_plus(v1,v2)) #undef value_subtract #define value_subtract(v1,v2) value_addto(v1,v2) #undef value_product #define value_product(v1,v2) value_addto(v1,v2) #undef value_modulus #define value_modulus(v1,v2) value_addto(v1,v2) #undef value_division #define value_division(v1,v2) value_addto(v1,v2) #undef value_divexact #define value_divexact(v1,v2) value_addto(v1,v2) #undef value_increment #define value_increment(v) value_addto(v,VALUE_ONE) #undef value_decrement #define value_decrement(v) value_addto(v,VALUE_MONE) #undef value_orto #define value_orto(ref,val) value_addto(v1,v2) #undef value_andto #define value_andto(ref,val) value_addto(v1,v2) #undef value_or #define value_or(v1,v2) value_fake_binary(v1,v2) #undef value_and #define value_and(v1,v2) value_fake_binary(v1,v2) #undef value_lshift #define value_lshift(v1,v2) value_fake_binary(v1,v2) #undef value_rshift #define value_rshift(v1,v2) value_fake_binary(v1,v2) #endif /* for backward compatibility */ #define value_substract(ref,val1,val2) (value_subtract((ref),(val1),(val2))) /* valeur absolue */ #ifndef ABS #define ABS(x) (((x)>=0) ? (x) : -(x)) #endif /* minimum et maximum * if they are defined somewhere else, they are very likely * to be defined the same way. Thus the previous def is not overwritten. */ #ifndef MIN #define MIN(x,y) (((x)>=(y))?(y):(x)) #endif #ifndef MAX #define MAX(x,y) (((x)>=(y))?(x):(y)) #endif /* signe d'un entier: -1, 0 ou 1 */ #define SIGN(x) (((x)>0)? 1 : ((x)==0? 0 : -1)) /* division avec reste toujours positif * basee sur les equations: * a/(-b) = - (a/b) * (-a)/b = - ((a+b-1)/b) * ou a et b sont des entiers positifs */ #define DIVIDE(x,y) ((y)>0? POSITIVE_DIVIDE(x,y) : \ -POSITIVE_DIVIDE((x),(-(y)))) /* division avec reste toujours positif quand y est positif: assert(y>=0) */ #define POSITIVE_DIVIDE(x,y) ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y)) /* modulo a resultat toujours positif */ #define MODULO(x,y) ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y)) /* modulo par rapport a un nombre positif: assert(y>=0) * * Ce n'est pas la macro la plus efficace que j'aie jamais ecrite: il faut * faire, dans le pire des cas, deux appels a la routine .rem, qui n'est * surement pas plus cablee que la division ou la multiplication */ #define POSITIVE_MODULO(x,y) ((x) > 0 ? (x)%(y) : \ ((x)%(y) == 0 ? 0 : ((y)-(-(x))%(y)))) /* errors.c */ extern unsigned int overflow_error; extern unsigned int simplex_arithmetic_error; extern unsigned int user_exception_error; extern unsigned int parser_exception_error; extern unsigned int any_exception_error; extern unsigned int the_last_just_thrown_exception; extern void dump_exception_stack_to_file(FILE * /*f*/); extern void dump_exception_stack(void); extern jmp_buf *push_exception_on_stack(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); extern void pop_exception_from_stack(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); extern void throw_exception(int /*what*/, const char * /*function*/, const char * /*file*/, int /*line*/); #endif /* arithmetique_header_included */ polylib-5.22.5.orig/source/arith/errors.c0000644000175000017500000002333311341227527021177 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* $Id: errors.c,v 1.6 2006/03/15 19:59:37 verdoolaege Exp $ Exception management. See "arithmetic_errors.h". $Log: errors.c,v $ Revision 1.6 2006/03/15 19:59:37 verdoolaege arith: add some missing consts Revision 1.5 2004/08/31 18:01:56 verdoolaege remove warning Revision 1.4 2004/02/11 10:19:54 verdoolaege add const qualifier Revision 1.3 2004/02/08 21:53:27 kienhuis Update from Fabien Coelho, via Bart Kienhuis I've updated here in the C3/Linear library the arithmetic_error package that I developped (with others) to handle exceptions in C. It adds a simple callback feature which is needed for pips here. If you do not use it, it should not harm;-) Revision 1.27 2003/09/04 09:40:37 coelho init added. verbosity mask added. Revision 1.26 2003/09/03 14:05:20 coelho push/pop callbacks called. Revision 1.20 2003/08/18 09:55:09 coelho get_exception_name added... Revision 1.19 2003/06/13 13:59:07 coelho const out. Revision 1.18 2003/06/13 13:54:47 coelho hop. Revision 1.17 2002/04/02 08:44:54 coelho timeout_error ajoute. Revision 1.16 2000/10/27 13:26:03 ancourt exception_thrown -> linear_number_of_exception_thrown Revision 1.15 2000/07/27 15:21:55 coelho message++ Revision 1.14 2000/07/27 14:59:59 coelho trace added. Revision 1.13 2000/07/26 08:41:23 coelho the_last_just_thrown_exception management added. Revision 1.12 1998/10/26 18:48:34 coelho message++. Revision 1.11 1998/10/26 14:38:06 coelho constants back in. Revision 1.10 1998/10/26 14:35:47 coelho constants in .h. Revision 1.9 1998/10/24 15:36:22 coelho better exception error messages... Revision 1.8 1998/10/24 15:19:17 coelho more verbose throw... Revision 1.7 1998/10/24 14:31:13 coelho new stack implementation. checks for matching catch/uncatch. debug mode. Revision 1.6 1998/10/24 09:31:06 coelho RCS headers. 'const' tried. */ #include #include #include #include "arithmetique.h" /* global constants to designate exceptions. to be put in the type field bellow. cproto 4.6 does not line 'const'... */ unsigned int overflow_error = 1; unsigned int simplex_arithmetic_error = 2; unsigned int user_exception_error = 4; unsigned int parser_exception_error = 8; unsigned int timeout_error = 16; /* catch all */ unsigned int any_exception_error = ~0; /* * On a few systems, type boolean and/or its values FALSE, TRUE may appear * in standard header files. Or you may have conflicts with application- * specific header files that you want to include together with these files. * Defining HAVE_BOOLEAN before including jpeglib.h should make it work. */ #ifndef HAVE_BOOLEAN typedef int boolean; #endif #ifndef FALSE /* in case these macros already exist */ #define FALSE 0 /* values of boolean */ #endif #ifndef TRUE #define TRUE 1 #endif const char *get_exception_name(unsigned int exception) { if (exception==overflow_error) return "overflow_error exception"; if (exception==simplex_arithmetic_error) return "simplex_arithmetic_error exception"; if (exception==user_exception_error) return "user_exception_error exception"; if (exception==parser_exception_error) return "parser_exception_error exception"; if (exception==timeout_error) return "timeout_error exception"; if (exception==any_exception_error) return "all exceptions mask"; return "unknown or mixed exception"; } /* keep track of last thrown exception for RETHROW() */ unsigned int the_last_just_thrown_exception = 0; /* whether to run in debug mode (that is to trace catch/uncatch/throw) */ static int linear_exception_debug_mode = FALSE; static unsigned int linear_exception_verbose = 1 | 2 | 16 ; /* A structure for the exception stack. */ typedef struct { /* exception type. */ int what; /* where to jump to. */ jmp_buf where; /* location of the CATCH to be matched against the UNCATCH. */ const char * function; const char * file; int line; } linear_exception_holder; /* exception stack. maximum extension. current index (next available bucket) */ #define MAX_STACKED_CONTEXTS 64 static linear_exception_holder exception_stack[MAX_STACKED_CONTEXTS]; static int exception_index = 0; /* callbacks... */ static exception_callback_t push_callback = NULL; static exception_callback_t pop_callback = NULL; void set_exception_callbacks(exception_callback_t push, exception_callback_t pop) { if (push_callback!=NULL || pop_callback!=NULL) { fprintf(stderr, "exception callbacks already defined! (%p, %p)\n", push_callback, pop_callback); abort(); } push_callback = push; pop_callback = pop; } /* total number of exceptions thrown, for statistics. */ int linear_number_of_exception_thrown = 0; /* dump stack */ void dump_exception_stack_to_file(FILE * f) { int i; fprintf(f, "[dump_exception_stack_to_file] size=%d\n", exception_index); for (i=0; i=0; i--) { if (pop_callback) /* pop with push parameters! */ pop_callback(exception_stack[i].file, exception_stack[i].function, exception_stack[i].line); if (exception_stack[i].what & what) { exception_index = i; linear_number_of_exception_thrown++; if (linear_exception_debug_mode) fprintf(stderr, "---->[%s:%d %s (%d)/%d]\n", exception_stack[i].file, exception_stack[i].line, exception_stack[i].function, exception_stack[i].what, i); /* trace some exceptions... */ if (linear_exception_verbose & what) fprintf(stderr, "exception %d/%d: %s(%s:%d) -> %s(%s:%d)\n", what, exception_stack[i].what, function, file, line, exception_stack[i].function, exception_stack[i].file, exception_stack[i].line); longjmp(exception_stack[i].where, 0); } } /* error. */ exception_debug_message("throw"); fprintf(stderr, "exception not found in stack:\n" "an exception was THROWN without a proper matching CATCH\n"); dump_exception_stack(); abort(); } void linear_initialize_exception_stack( unsigned int verbose_exceptions, exception_callback_t push, exception_callback_t pop) { linear_exception_verbose = verbose_exceptions; set_exception_callbacks(push, pop); } polylib-5.22.5.orig/source/arith/arithmetic_errors.h0000644000175000017500000000747711341227527023430 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* * $Id: arithmetic_errors.h,v 1.4 2006/03/15 19:59:37 verdoolaege Exp $ * * managing arithmetic errors... * detecting and managing arithmetic errors on Values should be * systematic. These macros gives a C++ look and feel to this * management. * * (c) CA et FC, Sept 1997 * * $Log: arithmetic_errors.h,v $ * Revision 1.4 2006/03/15 19:59:37 verdoolaege * arith: add some missing consts * * Revision 1.3 2004/02/08 21:53:27 kienhuis * Update from Fabien Coelho, via Bart Kienhuis * * I've updated here in the C3/Linear library the arithmetic_error * package that I developped (with others) to handle exceptions in C. * It adds a simple callback feature which is needed for pips here. * If you do not use it, it should not harm;-) * * Revision 1.34 2003/09/03 13:59:46 coelho * ++ * * Revision 1.33 2003/09/03 13:35:34 coelho * no more callback. * * Revision 1.32 2003/08/18 14:55:38 coelho * callback fix. * * Revision 1.31 2003/08/18 14:16:45 coelho * NULL callback added. * * Revision 1.30 2003/06/13 13:59:55 coelho * hop. * * Revision 1.29 2000/07/27 15:01:55 coelho * hop. * * Revision 1.28 2000/07/26 09:11:58 coelho * hop. * * Revision 1.27 2000/07/26 09:07:32 coelho * *** empty log message *** * * Revision 1.26 2000/07/26 09:06:32 coelho * the_last_just_thrown_exception declared. * * Revision 1.25 2000/07/26 08:41:40 coelho * RETHROW added. * * Revision 1.24 1998/10/26 14:37:48 coelho * constants moved out. * * Revision 1.23 1998/10/26 14:36:13 coelho * constants explicitely defined in .h. * * Revision 1.22 1998/10/24 15:18:26 coelho * THROW macro updated to tell its source. * * Revision 1.21 1998/10/24 14:33:08 coelho * parser exception added. * * Revision 1.20 1998/10/24 14:32:45 coelho * simpler macros. * * Revision 1.19 1998/10/24 09:22:47 coelho * size update. * * Revision 1.18 1998/10/24 09:21:45 coelho * const added to constants. * */ #if !defined(linear_arithmetic_error_included) #define linear_arithmetic_error_included #include typedef void (*exception_callback_t)(const char *, const char *, int); /* const unsigned int overflow_error = 1; const unsigned int simplex_arithmetic_error = 2; const unsigned int user_exception_error = 4; const unsigned int parser_exception_error = 8; const unsigned int any_exception_error = ~0; */ /* use gnu cpp '__FUNCTION__' extension if possible. */ #if defined(__GNUC__) #define __CURRENT_FUNCTION_NAME__ __FUNCTION__ #else #define __CURRENT_FUNCTION_NAME__ "" #endif /* 'const' out because of cproto 4.6. FC 13/06/2003 */ #define EXCEPTION extern unsigned int #define THROW(what) \ (throw_exception(what, __CURRENT_FUNCTION_NAME__, __FILE__, __LINE__)) #define CATCH(what) \ if (setjmp(*push_exception_on_stack(what, __CURRENT_FUNCTION_NAME__, \ __FILE__, __LINE__))) #define UNCATCH(what) \ (pop_exception_from_stack(what, __CURRENT_FUNCTION_NAME__, \ __FILE__, __LINE__)) #define TRY else extern unsigned int the_last_just_thrown_exception; #define RETHROW() THROW(the_last_just_thrown_exception) #endif /* linear_arithmetic_error_included */ /* end of it. */ polylib-5.22.5.orig/source/arith/assert.h0000644000175000017500000000213411341227527021165 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* Version "abort" de l'assert de /usr/include/assert.h * Il est installe dans Linear de maniere a masquer /usr/include/assert.h * * Il faut faire un include de pour l'utiliser. */ # ifndef NDEBUG # define _assert(ex) {if (!(ex)){(void)fprintf(stderr,"Assertion failed: file \"%s\", line %d\n", __FILE__, __LINE__);(void) abort();}} # define assert(ex) _assert(ex) # else # define _assert(ex) # define assert(ex) # endif polylib-5.22.5.orig/INSTALL0000644000175000017500000000142411035141337016130 0ustar sylvestresylvestreBasic installation procedure. You need the GNU tools : aclocal, autoconf, automake (some old versions do not work), libtool. First, build your configure, ltmain.sh and Makefile scripts with autogen.sh Then, you can run the scripts ./configure [options] make make install The options for "configure" are given by ./configure --help Specific options to PolyLib are: --enable-int-lib Build an int library --enable-longint-lib Build a long int library --enable-longlongint-lib Build a long long int library --enable-extra-suffix Add bits size suffix to executables --with-libgmp DIR Location of the GMP Distribution --with-doxygen DIR Location of the Doxygen Distribution (http://www.doxygen.org) You may want to specify: --prefix=/usr polylib-5.22.5.orig/README0000644000175000017500000000000011341224573015750 0ustar sylvestresylvestrepolylib-5.22.5.orig/config.sub0000755000175000017500000010115310756112266017072 0ustar sylvestresylvestre#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 # Free Software Foundation, Inc. timestamp='2008-01-16' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray) os= basic_machine=$1 ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | mcore | mep \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64vr | mips64vrel \ | mips64orion | mips64orionel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | mt \ | msp430 \ | nios | nios2 \ | ns16k | ns32k \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | score \ | sh | sh[1234] | sh[24]a | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ | z8k) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64vr-* | mips64vrel-* \ | mips64orion-* | mips64orionel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; c90) basic_machine=c90-cray os=-unicos ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; mvs) basic_machine=i370-ibm os=-mvs ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tile*) basic_machine=tile-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -kaos*) os=-kaos ;; -zvmoe) os=-zvmoe ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: polylib-5.22.5.orig/m4/0000755000175000017500000000000011341243106015413 5ustar sylvestresylvestrepolylib-5.22.5.orig/m4/libtool.m40000644000175000017500000077437411303244542017352 0ustar sylvestresylvestre# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 56 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl _LT_PROG_ECHO_BACKSLASH case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from `configure', and `config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # `config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain="$ac_aux_dir/ltmain.sh" ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the `libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to `config.status' so that its # declaration there will have the same value as in `configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "X$][$1" | $Xsed -e "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "X$" | $Xsed -e "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags="_LT_TAGS"dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the `libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into `config.status', and then the shell code to quote escape them in # for loops in `config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO "X\\\\\$\$var"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"X\\\$\$var\\" | \\\$Xsed -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Fix-up fallback echo if it was mangled by the above quoting rules. case \$lt_ECHO in *'\\\[$]0 --fallback-echo"')dnl " lt_ECHO=\`\$ECHO "X\$lt_ECHO" | \$Xsed -e 's/\\\\\\\\\\\\\\\[$]0 --fallback-echo"\[$]/\[$]0 --fallback-echo"/'\` ;; esac _LT_OUTPUT_LIBTOOL_INIT ]) # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) cat >"$CONFIG_LT" <<_LTEOF #! $SHELL # Generated by $as_me. # Run this file to recreate a libtool stub with the current configuration. lt_cl_silent=false SHELL=\${CONFIG_SHELL-$SHELL} _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ \`$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2008 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test $[#] != 0 do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try \`$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try \`$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. if test "$no_create" != yes; then lt_cl_success=: test "$silent" = yes && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) fi ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '/^# Generated shell functions inserted here/q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) _LT_PROG_XSI_SHELLFNS sed -n '/^# Generated shell functions inserted here/,$p' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS="$save_LDFLAGS" ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES # -------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(whole_archive_flag_spec, $1)='' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=echo _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" m4_if([$1], [CXX], [ if test "$lt_cv_apple_cc_single_mod" != "yes"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX # ----------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl AC_LINK_IFELSE(AC_LANG_PROGRAM,[ lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/ p } }' aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [ifdef([AC_DIVERSION_NOTICE], [AC_DIVERT_PUSH(AC_DIVERSION_NOTICE)], [AC_DIVERT_PUSH(NOTICE)]) $1 AC_DIVERT_POP ])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Add some code to the start of the generated configure script which # will find an echo command which doesn't interpret backslashes. m4_defun([_LT_PROG_ECHO_BACKSLASH], [_LT_SHELL_INIT([ # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$lt_ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$lt_ECHO" | sed 's,\\\\\[$]\\[$]0,'[$]0','` ;; esac ECHO=${lt_ECHO-echo} if test "X[$]1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X[$]1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' ; then # Yippee, $ECHO works! : else # Restart under the correct shell. exec $SHELL "[$]0" --no-reexec ${1+"[$]@"} fi if test "X[$]1" = X--fallback-echo; then # used as fallback echo shift cat <<_LT_EOF [$]* _LT_EOF exit 0 fi # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test -z "$lt_ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "[$]0"' 'sed 20q "[$]0"' 'sed 10q "[$]0"' 'sed 2q "[$]0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if { echo_test_string=`eval $cmd`; } 2>/dev/null && { test "X$echo_test_string" = "X$echo_test_string"; } 2>/dev/null then break fi done fi if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$ECHO" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`{ print -r '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ print -r "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. ECHO='print -r' elif { test -f /bin/ksh || test -f /bin/ksh$ac_exeext; } && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "[$]0" --no-reexec ${1+"[$]@"} else # Try using printf. ECHO='printf %s\n' if test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t' && echo_testing_string=`{ $ECHO "$echo_test_string"; } 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL ECHO="$CONFIG_SHELL [$]0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then ECHO="$CONFIG_SHELL [$]0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "[$]0"' 'sed 10q "[$]0"' 'sed 20q "[$]0"' 'sed 50q "[$]0"'; do if { test "X$echo_test_string" = "X`eval $cmd`"; } 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "[$]0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "[$]0" ${1+"[$]@"} else # Oops. We lost completely, so just stick with echo. ECHO=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. lt_ECHO=$ECHO if test "X$lt_ECHO" = "X$CONFIG_SHELL [$]0 --fallback-echo"; then lt_ECHO="$CONFIG_SHELL \\\$\[$]0 --fallback-echo" fi AC_SUBST(lt_ECHO) ]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that does not interpret backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '[#]line __oline__ "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ])# _LT_ENABLE_LOCK # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [AC_CHECK_TOOL(AR, ar, false) test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1]) AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test x"[$]$2" = xyes; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" ]) if test x"[$]$2" = xyes; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`$SHELL [$]0 --fallback-echo "X$teststring$teststring" 2>/dev/null` \ = "XX$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n $lt_cv_sys_max_cmd_len ; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "$cross_compiling" = yes; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line __oline__ "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[ lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen="shl_load"], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen="dlopen"], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"]) ]) ]) ]) ]) ]) ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links="nottested" if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test "$hard_links" = no; then AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/", [Define to the sub-directory in which libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$lt_search_path_spec" | $GREP ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e 's/;/ /g'` else lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO $lt_tmp_lt_search_path_spec | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` sys_lib_search_path_spec=`$ECHO $lt_search_path_spec` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[[4-9]]*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" | $Xsed -e '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32* | yes,cegcc*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | $GREP "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[123]]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix[[3-9]]*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux* | k*bsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program which can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$1; then lt_cv_path_MAGIC_CMD="$ac_dir/$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac]) MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program which can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]].[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux* | k*bsd*-gnu) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method == "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi]) if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. AC_CHECK_TOOLS(DUMPBIN, ["dumpbin -symbols" "link -dump -symbols"], :) AC_SUBST([DUMPBIN]) if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:__oline__: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:__oline__: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cygwin* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw") AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM="-lm") ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ const struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= AC_MSG_CHECKING([for $compiler option to produce PIC]) m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC*) # IBM XL 8.0 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl*) # IBM XL C 8.0/Fortran 10.1 on PPC _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Sun\ F*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_MSG_RESULT([$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;/^.*[[ ]]__nm__/s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu) _LT_TAGVAR(link_all_deplibs, $1)=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag= tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; xl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='-rpath $libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $compiler_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $compiler_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `$ECHO "X$deplibs" | $Xsed -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(fix_srcfile_path, $1)='`cygpath -w "$srcfile"`' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; freebsd1*) _LT_TAGVAR(ld_shlibs, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" AC_LINK_IFELSE(int foo(void) {}, _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' ) LDFLAGS="$save_LDFLAGS" else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' else case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' ;; esac fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$ECHO DATA >> $output_objdir/$libname.def~$ECHO " SINGLE NONSHARED" >> $output_objdir/$libname.def~$ECHO EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_MSG_CHECKING([whether -lc should be explicitly linked in]) $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then _LT_TAGVAR(archive_cmds_need_lc, $1)=no else _LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* AC_MSG_RESULT([$_LT_TAGVAR(archive_cmds_need_lc, $1)]) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_flag_spec_ld], [1], [[If ld is used when linking, flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting ${shlibpath_var} if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [fix_srcfile_path], [1], [Fix the shell variable $srcfile for the compiler]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC="$CC" AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report which library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC="$lt_save_CC" ])# _LT_LANG_C_CONFIG # _LT_PROG_CXX # ------------ # Since AC_PROG_CXX is broken, in that it returns g++ if there is no c++ # compiler, we have our own version here. m4_defun([_LT_PROG_CXX], [ pushdef([AC_MSG_ERROR], [_lt_caught_CXX_error=yes]) AC_PROG_CXX if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_CXX dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_CXX], []) # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [AC_REQUIRE([_LT_PROG_CXX])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then $ECHO "X${wl}${allow_undefined_flag}" | $Xsed; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd[[12]]*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; gnu*) ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]]* | *pgcpp\ [[1-5]]*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 will use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; xl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; $ECHO \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=echo else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && $ECHO "X${wl}-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "X-set_version $verstring" | $Xsed` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`$ECHO "X$templist" | $Xsed -e "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; $ECHO "X$list" | $Xsed' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "X${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && $ECHO "${wl}-set_version ${wl}$verstring" | $Xsed` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(GCC, $1)="$GXX" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ]) dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}" else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)="${prev}${p}" else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)="$p" else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)="$p" else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_PROG_F77 # ------------ # Since AC_PROG_F77 is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_F77], [ pushdef([AC_MSG_ERROR], [_lt_disable_F77=yes]) AC_PROG_F77 if test -z "$F77" || test "X$F77" = "Xno"; then _lt_disable_F77=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_F77 dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_F77], []) # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_REQUIRE([_LT_PROG_F77])dnl AC_LANG_PUSH(Fortran 77) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_F77" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${F77-"f77"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$G77" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_F77" != yes AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_PROG_FC # ----------- # Since AC_PROG_FC is broken, in that it returns the empty string # if there is no fortran compiler, we have our own version here. m4_defun([_LT_PROG_FC], [ pushdef([AC_MSG_ERROR], [_lt_disable_FC=yes]) AC_PROG_FC if test -z "$FC" || test "X$FC" = "Xno"; then _lt_disable_FC=yes fi popdef([AC_MSG_ERROR]) ])# _LT_PROG_FC dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([_LT_PROG_FC], []) # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_REQUIRE([_LT_PROG_FC])dnl AC_LANG_PUSH(Fortran) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_flag_spec_ld, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_FC" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC CC=${FC-"f95"} compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" fi # test "$_lt_disable_FC" != yes AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC="$lt_save_CC" ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC GCC= CC=${RC-"windres"} compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC="$lt_save_CC" ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PROG_XSI_SHELLFNS # --------------------- # Bourne and XSI compatible variants of some useful shell functions. m4_defun([_LT_PROG_XSI_SHELLFNS], [case $xsi_shell in yes) cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac } # func_basename file func_basename () { func_basename_result="${1##*/}" } # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}" } # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). func_stripname () { # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"} } # func_opt_split func_opt_split () { func_opt_split_opt=${1%%=*} func_opt_split_arg=${1#*=} } # func_lo2o object func_lo2o () { case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac } # func_xform libobj-or-source func_xform () { func_xform_result=${1%.*}.lo } # func_arith arithmetic-term... func_arith () { func_arith_result=$(( $[*] )) } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=${#1} } _LT_EOF ;; *) # Bourne compatible functions. cat << \_LT_EOF >> "$cfgfile" # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_basename file func_basename () { func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } dnl func_dirname_and_basename dnl A portable version of this function is already defined in general.m4sh dnl so there is no need for it here. # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "X${3}" \ | $Xsed -e "s%^${1}%%" -e "s%${2}\$%%"`;; esac } # sed scripts: my_sed_long_opt='1s/^\(-[[^=]]*\)=.*/\1/;q' my_sed_long_arg='1s/^-[[^=]]*=//' # func_opt_split func_opt_split () { func_opt_split_opt=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_opt"` func_opt_split_arg=`$ECHO "X${1}" | $Xsed -e "$my_sed_long_arg"` } # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "X${1}" | $Xsed -e "$lo2o"` } # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "X${1}" | $Xsed -e 's/\.[[^.]]*$/.lo/'` } # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "$[@]"` } # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "$[1]" : ".*" 2>/dev/null || echo $max_cmd_len` } _LT_EOF esac case $lt_shell_append in yes) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]+=\$[2]" } _LT_EOF ;; *) cat << \_LT_EOF >> "$cfgfile" # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "$[1]=\$$[1]\$[2]" } _LT_EOF ;; esac ]) polylib-5.22.5.orig/m4/ax_create_pkgconfig_info.m40000644000175000017500000003064311035141341022656 0ustar sylvestresylvestrednl @* AX_CREATE_PKGCONFIG_INFO [(outputfile, [requires [,libs [,summary [,cflags [,ldflags]]]]])] dnl defaults: dnl $1 = $PACKAGE_NAME.pc dnl $2 = (empty) dnl $3 = $PACKAGE_LIBS $LIBS (as set at that point in configure.ac) dnl $4 = $PACKAGE_SUMMARY (or $1 Library) dnl $5 = $CPPFLAGS $PACKAGE_CFLAGS (as set at the point in configure.ac) dnl $6 = $LDFLAGS $PACKAGE_LDFLAGS (as set at the point in configure.ac) dnl dnl PACKAGE_NAME defaults to $PACKAGE if not set. dnl PACKAGE_LIBS defaults to -l$PACKAGE_NAME if not set. dnl dnl the resulting file is called $PACKAGE.pc.in / $PACKAGE.pc dnl dnl You will find this macro most useful in conjunction with ax_spec_defaults dnl that can read good initializers from the .spec file. In consequencd, most dnl of the generatable installable stuff can be made from information being dnl updated in a single place for the whole project. dnl dnl @$Id: ax_create_pkgconfig_info.m4,v 1.1 2005/08/03 12:23:32 verdoolaege Exp $ AC_DEFUN([AX_CREATE_PKGCONFIG_INFO],[dnl AS_VAR_PUSHDEF([PKGCONFIG_suffix],[ax_create_pkgconfig_suffix])dnl AS_VAR_PUSHDEF([PKGCONFIG_libdir],[ax_create_pkgconfig_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_libfile],[ax_create_pkgconfig_libfile])dnl AS_VAR_PUSHDEF([PKGCONFIG_libname],[ax_create_pkgconfig_libname])dnl AS_VAR_PUSHDEF([PKGCONFIG_version],[ax_create_pkgconfig_version])dnl AS_VAR_PUSHDEF([PKGCONFIG_description],[ax_create_pkgconfig_description])dnl AS_VAR_PUSHDEF([PKGCONFIG_requires],[ax_create_pkgconfig_requires])dnl AS_VAR_PUSHDEF([PKGCONFIG_pkglibs],[ax_create_pkgconfig_pkglibs])dnl AS_VAR_PUSHDEF([PKGCONFIG_libs],[ax_create_pkgconfig_libs])dnl AS_VAR_PUSHDEF([PKGCONFIG_ldflags],[ax_create_pkgconfig_ldflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_cppflags],[ax_create_pkgconfig_cppflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_generate],[ax_create_pkgconfig_generate])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_libdir],[ax_create_pkgconfig_src_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_headers],[ax_create_pkgconfig_src_headers])dnl # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' AC_MSG_CHECKING(our pkgconfig libname) test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="ifelse($1,,${PACKAGE_NAME},`basename $1 .pc`)" test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="$PACKAGE" PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` AC_MSG_RESULT($PKGCONFIG_libname) AC_MSG_CHECKING(our pkgconfig version) test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="${PACKAGE_VERSION}" test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="$VERSION" PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` AC_MSG_RESULT($PKGCONFIG_version) AC_MSG_CHECKING(our pkgconfig_libdir) test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' PKGCONFIG_libdir=`eval echo "$pkgconfig_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` AC_MSG_RESULT($pkgconfig_libdir) test "$pkgconfig_libdir" != "$PKGCONFIG_libdir" && ( AC_MSG_RESULT(expanded our pkgconfig_libdir... $PKGCONFIG_libdir)) AC_SUBST([pkgconfig_libdir]) AC_MSG_CHECKING(our pkgconfig_libfile) test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="ifelse($1,,$PKGCONFIG_libname.pc,`basename $1`)" PKGCONFIG_libfile=`eval echo "$pkgconfig_libfile"` PKGCONFIG_libfile=`eval echo "$PKGCONFIG_libfile"` AC_MSG_RESULT($pkgconfig_libfile) test "$pkgconfig_libfile" != "$PKGCONFIG_libfile" && ( AC_MSG_RESULT(expanded our pkgconfig_libfile... $PKGCONFIG_libfile)) AC_SUBST([pkgconfig_libfile]) AC_MSG_CHECKING(our package / suffix) PKGCONFIG_suffix="$program_suffix" test ".$PKGCONFIG_suffix" != .NONE || PKGCONFIG_suffix="" AC_MSG_RESULT(${PACKAGE_NAME} / ${PKGCONFIG_suffix}) AC_MSG_CHECKING(our pkgconfig description) PKGCONFIG_description="ifelse($4,,$PACKAGE_SUMMARY,$4)" test ".$PKGCONFIG_description" != "." || \ PKGCONFIG_description="$PKGCONFIG_libname Library" PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` AC_MSG_RESULT($PKGCONFIG_description) AC_MSG_CHECKING(our pkgconfig requires) PKGCONFIG_requires="ifelse($2,,$PACKAGE_REQUIRES,$2)" PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` AC_MSG_RESULT($PKGCONFIG_requires) AC_MSG_CHECKING(our pkgconfig ext libs) PKGCONFIG_pkglibs="$PACKAGE_LIBS" test ".$PKGCONFIG_pkglibs" != "." || PKGCONFIG_pkglibs="-l$PKGCONFIG_libname" PKGCONFIG_libs="ifelse($3,,$PKGCONFIG_pkglibs $LIBS,$3)" PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` AC_MSG_RESULT($PKGCONFIG_libs) AC_MSG_CHECKING(our pkgconfig cppflags) PKGCONFIG_cppflags="ifelse($5,,$CPPFLAGS $PACKAGE_CFLAGS,$5)" PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` AC_MSG_RESULT($PKGCONFIG_cppflags) AC_MSG_CHECKING(our pkgconfig ldflags) PKGCONFIG_ldflags="ifelse($6,,$LDFLAGS $PACKAGE_LDFLAGS,$5)" PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` AC_MSG_RESULT($PKGCONFIG_ldflags) test ".$PKGCONFIG_generate" != "." || \ PKGCONFIG_generate="ifelse($1,,$PKGCONFIG_libname.pc,$1)" PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` test "$pkgconfig_libfile" != "$PKGCONFIG_generate" && ( AC_MSG_RESULT(generate the pkgconfig later... $PKGCONFIG_generate)) if test ".$PKGCONFIG_src_libdir" = "." ; then PKGCONFIG_src_libdir=`pwd` PKGCONFIG_src_libdir=`AS_DIRNAME("$PKGCONFIG_src_libdir/$PKGCONFIG_generate")` test ! -d $PKGCONFIG_src_libdir/src || \ PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/src" case ".$objdir" in *libs) PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/$objdir" ;; esac AC_MSG_RESULT(noninstalled pkgconfig -L $PKGCONFIG_src_libdir) fi if test ".$PKGCONFIG_src_headers" = "." ; then PKGCONFIG_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) PKG_CONFIG_src_headers="" ;; esac PKGCONFIG_src_headers=`AS_DIRNAME("$PKGCONFIG_src_headers/$v/x")` test ! -d $PKGCONFIG_src_headers/incl[]ude || \ PKGCONFIG_src_headers="$PKGCONFIG_src_headers/incl[]ude" AC_MSG_RESULT(noninstalled pkgconfig -I $PKGCONFIG_src_headers) fi dnl AC_CONFIG_COMMANDS crap disallows to use $PKGCONFIG_libfile here... AC_CONFIG_COMMANDS([$ax_create_pkgconfig_generate],[ pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then AC_MSG_NOTICE(creating $pkgconfig_generate.in) cat > $pkgconfig_generate.in <conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then AC_MSG_ERROR([$pkgconfig_generate is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ],[ dnl AC_CONFIG_COMMANDS crap, the AS_PUSHVAR defines are invalid here... ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' ])dnl AS_VAR_POPDEF([PKGCONFIG_suffix])dnl AS_VAR_POPDEF([PKGCONFIG_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_libfile])dnl AS_VAR_POPDEF([PKGCONFIG_libname])dnl AS_VAR_POPDEF([PKGCONFIG_version])dnl AS_VAR_POPDEF([PKGCONFIG_description])dnl AS_VAR_POPDEF([PKGCONFIG_requires])dnl AS_VAR_POPDEF([PKGCONFIG_pkglibs])dnl AS_VAR_POPDEF([PKGCONFIG_libs])dnl AS_VAR_POPDEF([PKGCONFIG_ldflags])dnl AS_VAR_POPDEF([PKGCONFIG_cppflags])dnl AS_VAR_POPDEF([PKGCONFIG_generate])dnl AS_VAR_POPDEF([PKGCONFIG_src_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_src_headers])dnl ]) polylib-5.22.5.orig/m4/ltoptions.m40000644000175000017500000002724211303244542017722 0ustar sylvestresylvestre# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option `$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl `shared' nor `disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [0], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [0], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [0], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the `shared' and # `disable-shared' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the `static' and # `disable-static' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the `fast-install' # and `disable-fast-install' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the `pic-only' and `no-pic' # LT_INIT options. # MODE is either `yes' or `no'. If omitted, it defaults to `both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [pic_mode="$withval"], [pic_mode=default]) test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) polylib-5.22.5.orig/m4/ltsugar.m40000644000175000017500000001042411303244543017343 0ustar sylvestresylvestre# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59 which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) polylib-5.22.5.orig/m4/lt~obsolete.m40000644000175000017500000001311311303244543020232 0ustar sylvestresylvestre# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 4 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_RC], [AC_DEFUN([AC_LIBTOOL_RC])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) polylib-5.22.5.orig/m4/ltversion.m40000644000175000017500000000127711341220523017707 0ustar sylvestresylvestre# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # Generated from ltversion.in. # serial 3017 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.2.6b]) m4_define([LT_PACKAGE_REVISION], [1.3017]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.2.6b' macro_revision='1.3017' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) polylib-5.22.5.orig/ltmain.sh0000755000175000017500000073337711341220522016737 0ustar sylvestresylvestre# Generated from ltmain.m4sh. # ltmain.sh (GNU libtool) 2.2.6b # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007 2008 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, # or obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --config show all configuration variables # --debug enable verbose shell tracing # -n, --dry-run display commands without modifying any files # --features display basic configuration information and exit # --mode=MODE use operation mode MODE # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print informational messages (default) # --version print version information # -h, --help print short or long help message # # MODE must be one of the following: # # clean remove files from the build directory # compile compile a source file into a libtool object # execute automatically set library path, then run a program # finish complete the installation of libtool libraries # install install libraries or executables # link create a library or an executable # uninstall remove libraries from an installed directory # # MODE-ARGS vary depending on the MODE. # Try `$progname --help --mode=MODE' for a more detailed description of MODE. # # When reporting a bug, please describe a test case to reproduce it and # include the following information: # # host-triplet: $host # shell: $SHELL # compiler: $LTCC # compiler flags: $LTCFLAGS # linker: $LD (gnu? $with_gnu_ld) # $progname: (GNU libtool) 2.2.6b Debian-2.2.6b-2 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . PROGRAM=ltmain.sh PACKAGE=libtool VERSION="2.2.6b Debian-2.2.6b-2" TIMESTAMP="" package_revision=1.3017 # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # NLS nuisances: We save the old values to restore during execute mode. # Only set LANG and LC_ALL to C if already set. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done $lt_unset CDPATH : ${CP="cp -f"} : ${ECHO="echo"} : ${EGREP="/bin/grep -E"} : ${FGREP="/bin/grep -F"} : ${GREP="/bin/grep"} : ${LN_S="ln -s"} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SED="/bin/sed"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "X${1}" | $Xsed -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "X${1}" | $Xsed -e "$basename"` } # Generated shell functions inserted here. # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" # The name of this program: # In the unlikely event $progname began with a '-', it would play havoc with # func_echo (imagine progname=-n), so we prepend ./ in that case: func_dirname_and_basename "$progpath" progname=$func_basename_result case $progname in -*) progname=./$progname ;; esac # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=: for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to double_quote_subst, that '$' was protected from expansion. # Since each input `\' is now two `\'s, look for any number of runs of # four `\'s followed by two `\'s and then a '$'. `\' that '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname${mode+: }$mode: $*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname${mode+: }$mode: "${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname${mode+: }$mode: warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "X$my_directory_path" | $Xsed -e "$dirname"` done my_dir_list=`$ECHO "X$my_dir_list" | $Xsed -e 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_mkdir_p_IFS" # mkdir can fail with a `File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "X$my_tmpdir" | $Xsed } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "X$1" | $Xsed -e "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # func_quote_for_expand arg # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "X$1" | $Xsed \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_version # Echo version message to standard output and exit. func_version () { $SED -n '/^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $SED -n '/^# Usage:/,/# -h/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" $ECHO $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help # Echo long help message to standard output and exit. func_help () { $SED -n '/^# Usage:/,/# Report bugs to/ { s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(automake --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(autoconf --version) 2>/dev/null |$SED 1q`"'/ p }' < "$progpath" exit $? } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { func_error "missing argument for $1" exit_cmd=exit } exit_cmd=: # Check that we have a working $ECHO. if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`{ $ECHO '\t'; } 2>/dev/null`" = 'X\t'; then # Yippee, $ECHO works! : else # Restart under the correct shell, and then maybe $ECHO will work. exec $SHELL "$progpath" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat </dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # Parse options once, thoroughly. This comes as soon as possible in # the script to make things like `libtool --version' happen quickly. { # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Parse non-mode specific arguments: while test "$#" -gt 0; do opt="$1" shift case $opt in --config) func_config ;; --debug) preserve_args="$preserve_args $opt" func_echo "enabling shell trace mode" opt_debug='set -x' $opt_debug ;; -dlopen) test "$#" -eq 0 && func_missing_arg "$opt" && break execute_dlfiles="$execute_dlfiles $1" shift ;; --dry-run | -n) opt_dry_run=: ;; --features) func_features ;; --finish) mode="finish" ;; --mode) test "$#" -eq 0 && func_missing_arg "$opt" && break case $1 in # Valid mode arguments: clean) ;; compile) ;; execute) ;; finish) ;; install) ;; link) ;; relink) ;; uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac mode="$1" shift ;; --preserve-dup-deps) opt_duplicate_deps=: ;; --quiet|--silent) preserve_args="$preserve_args $opt" opt_silent=: ;; --verbose| -v) preserve_args="$preserve_args $opt" opt_silent=false ;; --tag) test "$#" -eq 0 && func_missing_arg "$opt" && break preserve_args="$preserve_args $opt $1" func_enable_tag "$1" # tagname is set here shift ;; # Separate optargs to long options: -dlopen=*|--mode=*|--tag=*) func_opt_split "$opt" set dummy "$func_opt_split_opt" "$func_opt_split_arg" ${1+"$@"} shift ;; -\?|-h) func_usage ;; --help) opt_help=: ;; --version) func_version ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) nonopt="$opt" break ;; esac done case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_duplicate_deps ;; esac # Having warned about all mis-specified options, bail out if # anything was wrong. $exit_cmd $EXIT_FAILURE } # func_check_version_match # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } ## ----------- ## ## Main. ## ## ----------- ## $opt_help || { # Sanity checks first: func_check_version_match if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi test -z "$mode" && func_fatal_error "error: you must specify a MODE." # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$execute_dlfiles" && test "$mode" != execute; then func_error "unrecognized option \`-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$progname --help --mode=$mode' for more information." } # func_lalib_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if `file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case "$lalib_p_line" in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test "$lalib_p" = yes } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_ltwrapper_scriptname_result="" if func_ltwrapper_executable_p "$1"; then func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper" fi } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. func_source () { $opt_debug case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $opt_debug if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_quote_for_eval "$arg" CC_quoted="$CC_quoted $func_quote_for_eval_result" done case "$@ " in " $CC "* | "$CC "* | " `$ECHO $CC` "* | "`$ECHO $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$ECHO $CC_quoted` "* | "`$ECHO $CC_quoted` "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with \`--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=${1} if test "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; then write_oldobj=\'${3}\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T <?"'"'"' &()|`$[]' \ && func_warning "libobj name \`$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname="$func_basename_result" xdir="$func_dirname_result" lobj=${xdir}$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$ECHO "X$srcfile" | $Xsed -e 's%^.*/%%' -e 's%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi removelist="$removelist $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist removelist="$removelist $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 if test -n "$fix_srcfile_path"; then eval srcfile=\"$fix_srcfile_path\" fi func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir command="$command -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; then command="$command -o $obj" fi # Suppress compiler output if we already did a PIC compilation. command="$command$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$mode" = compile && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to building PIC objects only -prefer-non-pic try to building non-PIC objects only -shared do not build a \`.o' file suitable for static linking -static only build a \`.o' file suitable for static linking COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode \`$mode'" ;; esac $ECHO $ECHO "Try \`$progname --help' for more information about other modes." exit $? } # Now that we've collected a possible --mode arg, show help if necessary $opt_help && func_mode_help # func_mode_execute arg... func_mode_execute () { $opt_debug # The first argument is the command name. cmd="$nonopt" test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $execute_dlfiles; do test -f "$file" \ || func_fatal_help "\`$file' is not a file" dir= case $file in *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "\`$file' was not linked with \`-export-dynamic'" continue fi func_dirname "$file" "" "." dir="$func_dirname_result" if test -f "$dir/$objdir/$dlname"; then dir="$dir/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir="$func_dirname_result" ;; *) func_warning "\`-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -*) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file="$progdir/$program" elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). func_quote_for_eval "$file" args="$args $func_quote_for_eval_result" done if test "X$opt_dry_run" = Xfalse; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" $ECHO "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS fi } test "$mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug libdirs="$nonopt" admincmds= if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for dir do libdirs="$libdirs $dir" done for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || admincmds="$admincmds $cmds" fi done fi # Exit here if they wanted silent mode. $opt_silent && exit $EXIT_SUCCESS $ECHO "X----------------------------------------------------------------------" | $Xsed $ECHO "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done $ECHO $ECHO "If you ever happen to want to link against installed libraries" $ECHO "in a given directory, LIBDIR, you must either use libtool, and" $ECHO "specify the full pathname of the library, or use the \`-LLIBDIR'" $ECHO "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then $ECHO " - add LIBDIR to the \`$shlibpath_var' environment variable" $ECHO " during execution" fi if test -n "$runpath_var"; then $ECHO " - add LIBDIR to the \`$runpath_var' environment variable" $ECHO " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then $ECHO " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi $ECHO $ECHO "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) $ECHO "more information, such as the ld(1), crle(1) and ld.so(8) manual" $ECHO "pages." ;; *) $ECHO "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac $ECHO "X----------------------------------------------------------------------" | $Xsed exit $EXIT_SUCCESS } test "$mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. $ECHO "X$nonopt" | $GREP shtool >/dev/null; then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" install_prog="$install_prog$func_quote_for_eval_result" # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= for arg do if test -n "$dest"; then files="$files $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) case " $install_prog " in *[\\\ /]cp\ *) ;; *) prev=$arg ;; esac ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" install_prog="$install_prog $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the \`$prev' option requires an argument" if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else func_dirname_and_basename "$dest" "" "." destdir="$func_dirname_result" destname="$func_basename_result" # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "\`$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "\`$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. staticlibs="$staticlibs $file" ;; *.la) # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) current_libdirs="$current_libdirs $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) future_libdirs="$future_libdirs $libdir" ;; esac fi func_dirname "$file" "/" "" dir="$func_dirname_result" dir="$dir$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "X$destdir" | $Xsed -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "X$relink_command" | $Xsed -e "s%@inst_prefix_dir@%%"` fi func_warning "relinking \`$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname="$1" shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. func_show_eval "$install_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme="$stripme" case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme="" ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib="$destdir/$realname" func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name="$func_basename_result" instname="$dir/$name"i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest="$destfile" destfile= ;; *) func_fatal_help "cannot copy a libtool object to \`$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script \`$wrapper'" finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile="$libdir/"`$ECHO "X$lib" | $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file="$func_basename_result" outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$ECHO "X$relink_command" | $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'` $opt_silent || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink \`$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file="$outputname" else func_warning "cannot relink \`$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "X$file$stripped_ext" | $Xsed -e "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name="$func_basename_result" # Set up the ranlib parameters. oldlib="$destdir/$name" func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run \`$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test "$mode" = install && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms="${my_outputname}S.c" else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${my_outputname}.nm" func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then func_verbose "generating symbol list for \`$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "X$objs$old_deplibs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` for progfile in $progfiles; do func_verbose "extracting global C symbols from \`$progfile'" $opt_dry_run || eval "$NM $progfile | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $opt_dry_run || { $RM $export_symbols eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from \`$dlprefile'" func_basename "$dlprefile" name="$func_basename_result" $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' eval "$NM $dlprefile 2>/dev/null | $global_symbol_pipe >> '$nlist'" } done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else $ECHO '/* NONE */' >> "$output_objdir/$my_dlsyms" fi $ECHO >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; " case $host in *cygwin* | *mingw* | *cegcc* ) $ECHO >> "$output_objdir/$my_dlsyms" "\ /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */" lt_dlsym_const= ;; *osf5*) echo >> "$output_objdir/$my_dlsyms" "\ /* This system does not cope well with relocations in const data */" lt_dlsym_const= ;; *) lt_dlsym_const=const ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ extern $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[]; $lt_dlsym_const lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac $ECHO >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) symtab_cflags="$symtab_cflags $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"' # Transform the symbol file into the correct name. symfileobj="$output_objdir/${my_outputname}S.$objext" case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "X$compile_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for \`$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "X$compile_command" | $Xsed -e "s% @SYMFILE@%%"` finalize_command=`$ECHO "X$finalize_command" | $Xsed -e "s% @SYMFILE@%%"` fi } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. func_win32_libid () { $opt_debug win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then win32_nmres=`eval $NM -f posix -A $1 | $SED -n -e ' 1,100{ / I /{ s,.*,import, p q } }'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_extract_an_archive dir oldlib func_extract_an_archive () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" 'exit $?' if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $opt_debug my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib="$func_basename_result" my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir="$my_gentop/$my_xlib_u" func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`basename "$darwin_archive"` darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}" $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # func_emit_wrapper_part1 [arg=no] # # Emit the first part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part1 () { func_emit_wrapper_part1_arg1=no if test -n "$1" ; then func_emit_wrapper_part1_arg1=$1 fi $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='${SED} -e 1s/^X//' sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then ECHO=\"$qecho\" file=\"\$0\" # Make sure echo works. if test \"X\$1\" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test \"X\`{ \$ECHO '\t'; } 2>/dev/null\`\" = 'X\t'; then # Yippee, \$ECHO works! : else # Restart under the correct shell, and then maybe \$ECHO will work. exec $SHELL \"\$0\" --no-reexec \${1+\"\$@\"} fi fi\ " $ECHO "\ # Find the directory that this script lives in. thisdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | ${SED} -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"X\$file\" | \$Xsed -e 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"X\$file\" | \$Xsed -e 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | ${SED} -n 's/.*-> //p'\` done " } # end: func_emit_wrapper_part1 # func_emit_wrapper_part2 [arg=no] # # Emit the second part of a libtool wrapper script on stdout. # For more information, see the description associated with # func_emit_wrapper(), below. func_emit_wrapper_part2 () { func_emit_wrapper_part2_arg1=no if test -n "$1" ; then func_emit_wrapper_part2_arg1=$1 fi $ECHO "\ # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_part2_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"X\$thisdir\" | \$Xsed -e 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"X\$$shlibpath_var\" | \$Xsed -e 's/::*\$//'\` export $shlibpath_var " fi # fixup the dll searchpath if we need to. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 fi else # The program doesn't exist. \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 $ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # end: func_emit_wrapper_part2 # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory in which it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=no if test -n "$1" ; then func_emit_wrapper_arg1=$1 fi # split this up so that func_emit_cwrapperexe_src # can call each part independently. func_emit_wrapper_part1 "${func_emit_wrapper_arg1}" func_emit_wrapper_part2 "${func_emit_wrapper_arg1}" } # func_to_host_path arg # # Convert paths to host format when used with build tools. # Intended for use with "native" mingw (where libtool itself # is running under the msys shell), or in the following cross- # build environments: # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # where wine is equipped with the `winepath' executable. # In the native mingw case, the (msys) shell automatically # converts paths for any non-msys applications it launches, # but that facility isn't available from inside the cwrapper. # Similar accommodations are necessary for $host mingw and # $build cygwin. Calling this function does no harm for other # $host/$build combinations not listed above. # # ARG is the path (on $build) that should be converted to # the proper representation for $host. The result is stored # in $func_to_host_path_result. func_to_host_path () { func_to_host_path_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' case $build in *mingw* ) # actually, msys # awkward: cmd appends spaces to result lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_path_tmp1=`( cmd //c echo "$1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_path_tmp1=`cygpath -w "$1"` func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # Unfortunately, winepath does not exit with a non-zero # error code, so we are forced to check the contents of # stdout. On the other hand, if the command is not # found, the shell will set an exit code of 127 and print # *an error message* to stdout. So we must check for both # error code of zero AND non-empty stdout, which explains # the odd construction: func_to_host_path_tmp1=`winepath -w "$1" 2>/dev/null` if test "$?" -eq 0 && test -n "${func_to_host_path_tmp1}"; then func_to_host_path_result=`echo "$func_to_host_path_tmp1" |\ $SED -e "$lt_sed_naive_backslashify"` else # Allow warning below. func_to_host_path_result="" fi ;; esac if test -z "$func_to_host_path_result" ; then func_error "Could not determine host path corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_path_result="$1" fi ;; esac fi } # end: func_to_host_path # func_to_host_pathlist arg # # Convert pathlists to host format when used with build tools. # See func_to_host_path(), above. This function supports the # following $build/$host combinations (but does no harm for # combinations not listed here): # $build $host # mingw (msys) mingw [e.g. native] # cygwin mingw # *nix + wine mingw # # Path separators are also converted from $build format to # $host format. If ARG begins or ends with a path separator # character, it is preserved (but converted to $host format) # on output. # # ARG is a pathlist (on $build) that should be converted to # the proper representation on $host. The result is stored # in $func_to_host_pathlist_result. func_to_host_pathlist () { func_to_host_pathlist_result="$1" if test -n "$1" ; then case $host in *mingw* ) lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_to_host_pathlist_tmp2="$1" # Once set for this call, this variable should not be # reassigned. It is used in tha fallback case. func_to_host_pathlist_tmp1=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e 's|^:*||' -e 's|:*$||'` case $build in *mingw* ) # Actually, msys. # Awkward: cmd appends spaces to result. lt_sed_strip_trailing_spaces="s/[ ]*\$//" func_to_host_pathlist_tmp2=`( cmd //c echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null || echo ""` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; *cygwin* ) func_to_host_pathlist_tmp2=`cygpath -w -p "$func_to_host_pathlist_tmp1"` func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" |\ $SED -e "$lt_sed_naive_backslashify"` ;; * ) # unfortunately, winepath doesn't convert pathlists func_to_host_pathlist_result="" func_to_host_pathlist_oldIFS=$IFS IFS=: for func_to_host_pathlist_f in $func_to_host_pathlist_tmp1 ; do IFS=$func_to_host_pathlist_oldIFS if test -n "$func_to_host_pathlist_f" ; then func_to_host_path "$func_to_host_pathlist_f" if test -n "$func_to_host_path_result" ; then if test -z "$func_to_host_pathlist_result" ; then func_to_host_pathlist_result="$func_to_host_path_result" else func_to_host_pathlist_result="$func_to_host_pathlist_result;$func_to_host_path_result" fi fi fi IFS=: done IFS=$func_to_host_pathlist_oldIFS ;; esac if test -z "$func_to_host_pathlist_result" ; then func_error "Could not determine the host path(s) corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This may break if $1 contains DOS-style drive # specifications. The fix is not to complicate the expression # below, but for the user to provide a working wine installation # with winepath so that path translation in the cross-to-mingw # case works properly. lt_replace_pathsep_nix_to_dos="s|:|;|g" func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp1" |\ $SED -e "$lt_replace_pathsep_nix_to_dos"` fi # Now, add the leading and trailing path separators back case "$1" in :* ) func_to_host_pathlist_result=";$func_to_host_pathlist_result" ;; esac case "$1" in *: ) func_to_host_pathlist_result="$func_to_host_pathlist_result;" ;; esac ;; esac fi } # end: func_to_host_pathlist # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include # define setmode _setmode #else # include # include # ifdef __CYGWIN__ # include # define HAVE_SETENV # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif # endif #endif #include #include #include #include #include #include #include #include #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif #ifdef _MSC_VER # define S_IXUSR _S_IEXEC # define stat _stat # ifndef _INTPTR_T_DEFINED # define intptr_t int # endif #endif #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifdef __CYGWIN__ # define FOPEN_WB "wb" #endif #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) #undef LTWRAPPER_DEBUGPRINTF #if defined DEBUGWRAPPER # define LTWRAPPER_DEBUGPRINTF(args) ltwrapper_debugprintf args static void ltwrapper_debugprintf (const char *fmt, ...) { va_list args; va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } #else # define LTWRAPPER_DEBUGPRINTF(args) #endif const char *program_name = NULL; void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_fatal (const char *message, ...); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_opt_process_env_set (const char *arg); void lt_opt_process_env_prepend (const char *arg); void lt_opt_process_env_append (const char *arg); int lt_split_name_value (const char *arg, char** name, char** value); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); static const char *script_text_part1 = EOF func_emit_wrapper_part1 yes | $SED -e 's/\([\\"]\)/\\\1/g' \ -e 's/^/ "/' -e 's/$/\\n"/' echo ";" cat <"))); for (i = 0; i < newargc; i++) { LTWRAPPER_DEBUGPRINTF (("(main) newargz[%d] : %s\n", i, (newargz[i] ? newargz[i] : ""))); } EOF case $host_os in mingw*) cat <<"EOF" /* execv doesn't actually work on mingw as expected on unix */ rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz); if (rval == -1) { /* failed to start process */ LTWRAPPER_DEBUGPRINTF (("(main) failed to launch target \"%s\": errno = %d\n", lt_argv_zero, errno)); return 127; } return rval; EOF ;; *) cat <<"EOF" execv (lt_argv_zero, newargz); return rval; /* =127, but avoids unused variable warning */ EOF ;; esac cat <<"EOF" } void * xmalloc (size_t num) { void *p = (void *) malloc (num); if (!p) lt_fatal ("Memory exhausted"); return p; } char * xstrdup (const char *string) { return string ? strcpy ((char *) xmalloc (strlen (string) + 1), string) : NULL; } const char * base_name (const char *name) { const char *base; #if defined (HAVE_DOS_BASED_FILE_SYSTEM) /* Skip over the disk name in MSDOS pathnames. */ if (isalpha ((unsigned char) name[0]) && name[1] == ':') name += 2; #endif for (base = name; *name; name++) if (IS_DIR_SEPARATOR (*name)) base = name + 1; return base; } int check_executable (const char *path) { struct stat st; LTWRAPPER_DEBUGPRINTF (("(check_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if ((stat (path, &st) >= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; LTWRAPPER_DEBUGPRINTF (("(make_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!")); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char *concat_name; LTWRAPPER_DEBUGPRINTF (("(find_executable) : %s\n", wrapper ? (*wrapper ? wrapper : "EMPTY!") : "NULL!")); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { LTWRAPPER_DEBUGPRINTF (("checking path component for symlinks: %s\n", tmp_pathspec)); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { char *errstr = strerror (errno); lt_fatal ("Error accessing file %s (%s)", tmp_pathspec, errstr); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal ("Could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (strcmp (str, pat) == 0) *str = '\0'; } return str; } static void lt_error_core (int exit_status, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s: %s: ", program_name, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, "FATAL", message, ap); va_end (ap); } void lt_setenv (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_setenv) setting '%s' to '%s'\n", (name ? name : ""), (value ? value : ""))); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else int len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { int orig_value_len = strlen (orig_value); int add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } int lt_split_name_value (const char *arg, char** name, char** value) { const char *p; int len; if (!arg || !*arg) return 1; p = strchr (arg, (int)'='); if (!p) return 1; *value = xstrdup (++p); len = strlen (arg) - strlen (*value); *name = XMALLOC (char, len); strncpy (*name, arg, len-1); (*name)[len - 1] = '\0'; return 0; } void lt_opt_process_env_set (const char *arg) { char *name = NULL; char *value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_set_opt, arg); } lt_setenv (name, value); XFREE (name); XFREE (value); } void lt_opt_process_env_prepend (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_prepend_opt, arg); } new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_opt_process_env_append (const char *arg) { char *name = NULL; char *value = NULL; char *new_value = NULL; if (lt_split_name_value (arg, &name, &value) != 0) { XFREE (name); XFREE (value); lt_fatal ("bad argument for %s: '%s'", env_append_opt, arg); } new_value = lt_extend_str (getenv (name), value, 1); lt_setenv (name, new_value); XFREE (new_value); XFREE (name); XFREE (value); } void lt_update_exe_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_exe_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { LTWRAPPER_DEBUGPRINTF (("(lt_update_lib_path) modifying '%s' by prepending '%s'\n", (name ? name : ""), (value ? value : ""))); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF } # end: func_emit_cwrapperexe_src # func_mode_link arg... func_mode_link () { $opt_debug case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # which system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll which has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=no prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module="${wl}-single_module" func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then dlfiles="$dlfiles $arg" else dlprefiles="$dlprefiles $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" test -f "$arg" \ || func_fatal_error "symbol file \`$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) deplibs="$deplibs $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # moreargs="$moreargs $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file \`$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) rpath="$rpath $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) xrpath="$xrpath $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds="$arg" prev= continue ;; weak) weak_libs="$weak_libs $arg" prev= continue ;; xcclinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) compiler_flags="$compiler_flags $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "\`-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname '-L' '' "$arg" dir=$func_stripname_result if test -z "$dir"; then if test "$#" -gt 0; then func_fatal_error "require no space between \`-L' and \`$1'" else func_fatal_error "need path for \`-L' option" fi fi # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of \`$dir'" dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "*) ;; *) deplibs="$deplibs -L$dir" lib_search_path="$lib_search_path $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "X$dir" | $Xsed -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) dllsearchpath="$dllsearchpath:$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework deplibs="$deplibs System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi deplibs="$deplibs $arg" continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) compiler_flags="$compiler_flags $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $arg" ;; esac continue ;; -multi_module) single_module="${wl}-multi_module" continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "\`-no-install' is ignored for $host" func_warning "assuming \`-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" arg="$arg $wl$func_quote_for_eval_result" compiler_flags="$compiler_flags $wl$func_quote_for_eval_result" linker_flags="$linker_flags $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; # -64, -mips[0-9] enable 64-bit mode on the SGI compiler # -r[0-9][0-9]* specifies the processor on the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode on the Sun compiler # +DA*, +DD* enable 64-bit mode on the HP compiler # -q* pass through compiler args for the IBM compiler # -m*, -t[45]*, -txscale* pass through architecture-specific # compiler args for GCC # -F/path gives path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* pass through profiling flag for GCC # @file GCC response files -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" func_append compile_command " $arg" func_append finalize_command " $arg" compiler_flags="$compiler_flags $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; *.$objext) # A standard object. objs="$objs $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. deplibs="$deplibs $arg" old_deplibs="$old_deplibs $arg" continue ;; *.la) # A libtool-controlled library. if test "$prev" = dlfiles; then # This library was specified with -dlopen. dlfiles="$dlfiles $arg" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. dlprefiles="$dlprefiles $arg" prev= else deplibs="$deplibs $arg" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the \`$prevarg' option requires an argument" if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname="$func_basename_result" libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"X\${$shlibpath_var}\" \| \$Xsed -e \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir="$func_dirname_result$objdir" # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_duplicate_deps ; then case "$libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi libs="$libs $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) specialdeplibs="$specialdeplibs $pre_post_deps" ;; esac pre_post_deps="$pre_post_deps $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test "$linkmode,$pass" = "lib,link"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs="$tmp_deplibs" fi if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= case $lib in *.la) func_source "$lib" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do deplib_base=`$ECHO "X$deplib" | $Xsed -e "$basename"` case " $weak_libs " in *" $deplib_base "*) ;; *) deplibs="$deplibs $deplib" ;; esac done done libs="$dlprefiles" fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe|-threads) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else compiler_flags="$compiler_flags $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) new_inherited_linker_flags="$new_inherited_linker_flags $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; *) func_warning "\`-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then func_stripname '-R' '' "$deplib" dir=$func_stripname_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) lib="$deplib" ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"X$deplib\"" 2>/dev/null | $Xsed -e 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then $ECHO $ECHO "*** Warning: Trying to link with static lib archive $deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because the file extensions .$libext of this argument makes me believe" $ECHO "*** that it is just a static archive that I should not use here." else $ECHO $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. newdlprefiles="$newdlprefiles $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else newdlfiles="$newdlfiles $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "\`$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir="$func_dirname_result" dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "X$inherited_linker_flags" | $Xsed -e 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) new_inherited_linker_flags="$new_inherited_linker_flags $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO "X $dependency_libs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && dlfiles="$dlfiles $dlopen" test -n "$dlpreopen" && dlprefiles="$dlprefiles $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # It is a libtool convenience library, so add in its objects. convenience="$convenience $ladir/$objdir/$old_library" old_convenience="$old_convenience $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= for l in $old_library $library_names; do linklib="$l" done if test -z "$linklib"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. dlprefiles="$dlprefiles $lib $dependency_libs" else newdlfiles="$newdlfiles $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of \`$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir="$ladir" fi ;; esac func_basename "$lib" laname="$func_basename_result" # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library \`$lib' was moved." dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$libdir" absdir="$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; then func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'" fi # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then newdlprefiles="$newdlprefiles $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ dlpreconveniencelibs="$dlpreconveniencelibs $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then newdlprefiles="$newdlprefiles $dir/$dlname" else newdlprefiles="$newdlprefiles $dir/$linklib" fi fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then newlib_search_path="$newlib_search_path $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" newlib_search_path="$newlib_search_path $func_stripname_result" ;; esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath:" in *"$absdir:"*) ;; *) temp_rpath="$temp_rpath$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded notinst_deplibs="$notinst_deplibs $lib" need_relink=no ;; *) if test "$installed" = no; then notinst_deplibs="$notinst_deplibs $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule="" for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule="$dlpremoduletest" break fi done if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then $ECHO if test "$linkmode" = prog; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname="$1" shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" func_basename "$soroot" soname="$func_basename_result" func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from \`$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for \`$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we can not # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null ; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library" ; then $ECHO $ECHO "*** And there doesn't seem to be a static archive available" $ECHO "*** The link will probably fail, sorry" else add="$dir/$old_library" fi elif test -n "$old_library"; then add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$dir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) compile_shlibpath="$compile_shlibpath$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. $ECHO $ECHO "*** Warning: This system can not link to static lib archive $lib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then $ECHO "*** But as you try to build a module library, libtool will still create " $ECHO "*** a static module, that should work as long as the dlopening application" $ECHO "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) xrpath="$xrpath $temp_xrpath";; esac;; *) temp_deplibs="$temp_deplibs $libdir";; esac done dependency_libs="$temp_deplibs" fi newlib_search_path="$newlib_search_path $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" if $opt_duplicate_deps ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path="$deplib" ;; *.la) func_dirname "$deplib" "" "." dir="$func_dirname_result" # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of \`$dir'" absdir="$dir" fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl" ; then depdepl="$absdir/$objdir/$depdepl" darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`${OTOOL64} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi compiler_flags="$compiler_flags ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}" linker_flags="$linker_flags -dylib_file ${darwin_install_name}:${depdepl}" path= fi fi ;; *) path="-L$absdir/$objdir" ;; esac else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "\`$deplib' seems to be moved" path="-L$absdir" fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test "$pass" = link; then if test "$linkmode" = "prog"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) lib_search_path="$lib_search_path $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) tmp_libs="$tmp_libs $deplib" ;; esac ;; *) tmp_libs="$tmp_libs $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then tmp_libs="$tmp_libs $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "\`-R' is ignored for archives" test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "\`-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "\`-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" objs="$objs$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs" else $ECHO $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" libobjs="$libobjs $objs" fi fi test "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "\`-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 shift IFS="$save_ifs" test -n "$7" && \ func_fatal_help "too many parameters to \`-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$1" number_minor="$2" number_revision="$3" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_minor" lt_irix_increment=no ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; esac ;; no) current="$1" revision="$2" age="$3" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT \`$current' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION \`$revision' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE \`$age' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE \`$age' is greater than the current interface number \`$current'" func_fatal_error "\`$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring:${iface}.0" done # Make executables depend on our current version. verstring="$verstring:${current}.0" ;; qnx) major=".$current" versuffix=".$current" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; *) func_fatal_configuration "unknown library version type \`$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" libobjs="$libobjs $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi removelist="$removelist $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then oldlibs="$oldlibs $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}'$/d' -e "$lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "X$lib_search_path " | $Xsed -e "s% $path % %g"` # deplibs=`$ECHO "X$deplibs " | $Xsed -e "s% -L$path % %g"` # dependency_libs=`$ECHO "X$dependency_libs " | $Xsed -e "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do temp_xrpath="$temp_xrpath -R$libdir" case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) dlfiles="$dlfiles $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) dlprefiles="$dlprefiles $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework deplibs="$deplibs System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then deplibs="$deplibs -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$ECHO "X$potlib" | $Xsed -e 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) newdeplibs="$newdeplibs $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval "\$ECHO \"X$potent_lib\"" 2>/dev/null | $Xsed -e 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $ECHO $ECHO "*** Warning: linker path does not have real file for library $a_deplib." $ECHO "*** I have the capability to make that library automatically link in when" $ECHO "*** you link to this library. But I can only do this if you have a" $ECHO "*** shared version of the library, which you do not appear to have" $ECHO "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$ECHO "X $deplibs" | $Xsed \ -e 's/ -lc$//' -e 's/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO "X $tmp_deplibs" | $Xsed -e "s,$i,,"` done fi if $ECHO "X $tmp_deplibs" | $Xsed -e 's/[ ]//g' | $GREP . >/dev/null; then $ECHO if test "X$deplibs_check_method" = "Xnone"; then $ECHO "*** Warning: inter-library dependencies are not supported in this platform." else $ECHO "*** Warning: inter-library dependencies are not known to be supported." fi $ECHO "*** All declared inter-library dependencies are being dropped." droppeddeps=yes fi ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then $ECHO $ECHO "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" $ECHO "*** a static module, that should work as long as the dlopening" $ECHO "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then $ECHO $ECHO "*** However, this would only work if libtool was able to extract symbol" $ECHO "*** lists from a program, using \`nm' or equivalent, but libtool could" $ECHO "*** not find such a program. So, this module is probably useless." $ECHO "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else $ECHO "*** The inter-library dependencies that have been dropped here will be" $ECHO "*** automatically added whenever a program is linked with this library" $ECHO "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then $ECHO $ECHO "*** Since this library must not contain undefined symbols," $ECHO "*** because either the platform does not support them or" $ECHO "*** it was explicitly requested with -no-undefined," $ECHO "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO "X $newdeplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO "X $new_inherited_linker_flags" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO "X $deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" dep_rpath="$dep_rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" if test -n "$hardcode_libdir_flag_spec_ld"; then eval dep_rpath=\"$hardcode_libdir_flag_spec_ld\" else eval dep_rpath=\"$hardcode_libdir_flag_spec\" fi fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname="$1" shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do linknames="$linknames $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "X$libobjs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols="$output_objdir/$libname.uexp" delfiles="$delfiles $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols="$export_symbols" export_symbols= always_export_symbols=yes fi fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" func_len " $cmd" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then func_show_eval "$cmd" 'exit $?' skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) tmp_deplibs="$tmp_deplibs $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test "$compiler_needs_object" = yes && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $convenience libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" linker_flags="$linker_flags $flag" fi # Make a backup of the uninstalled library when relinking if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output output_la=`$ECHO "X$output" | $Xsed -e "$basename"` # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then output=${output_objdir}/${output_la}.lnkscript func_verbose "creating GNU ld script: $output" $ECHO 'INPUT (' > $output for obj in $save_libobjs do $ECHO "$obj" >> $output done $ECHO ')' >> $output delfiles="$delfiles $output" elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; then firstobj="$1 " shift fi for obj do $ECHO "$obj" >> $output done delfiles="$delfiles $output" output=$firstobj\"$file_list_spec$output\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-${k}.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test "X$objlist" = X || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. eval concat_cmds=\"$reload_cmds $objlist $last_robj\" else # All subsequent reloadable object files will link in # the last one created. eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-${k}.$objext objlist=$obj func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$reload_cmds $objlist $last_robj\" if test -n "$last_robj"; then eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\" fi delfiles="$delfiles $output" else output= fi if ${skipped_export-false}; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi fi test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi if ${skipped_export-false}; then if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "X$include_expsyms" | $Xsed | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter delfiles="$delfiles $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi fi libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles libobjs="$libobjs $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "\`-R' is ignored for objects" test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for objects" test -n "$release" && \ func_warning "\`-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object \`$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "X$tmp_whole_archive_flags" | $Xsed -e 's|,| |g'` else gentop="$output_objdir/${obj}x" generated="$generated $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # Create the old-style object. reload_objs="$objs$old_deplibs "`$ECHO "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}$'/d' -e '/\.lib$/d' -e "$lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for programs" test -n "$release" && \ func_warning "\`-release' is ignored for programs" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test "$tagname" = CXX ; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) compile_command="$compile_command ${wl}-bind_at_load" finalize_command="$finalize_command ${wl}-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO "X $compile_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO "X $finalize_deplibs" | $Xsed -e 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done compile_deplibs="$new_libs" compile_command="$compile_command $compile_deplibs" finalize_command="$finalize_command $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) dllsearchpath="$dllsearchpath:$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) finalize_perm_rpath="$finalize_perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$ECHO "X$compile_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` finalize_command=`$ECHO "X$finalize_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *cegcc) # Disable wrappers for cegcc, we are cross compiling anyway. wrappers_required=no ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # Replace the output file specification. compile_command=`$ECHO "X$compile_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' # Delete the generated files. if test -f "$output_objdir/${outputname}S.${objext}"; then func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"' fi exit $exit_status fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do rpath="$rpath$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" func_warning "this platform does not like uninstalled shared libraries" func_warning "\`$output' will be relinked during installation" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "X$compile_var$compile_command$compile_rpath" | $Xsed -e 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$ECHO "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` fi # Quote $ECHO for shipping. if test "X$ECHO" = "X$SHELL $progpath --fallback-echo"; then case $progpath in [\\/]* | [A-Za-z]:[\\/]*) qecho="$SHELL $progpath --fallback-echo";; *) qecho="$SHELL `pwd`/$progpath --fallback-echo";; esac qecho=`$ECHO "X$qecho" | $Xsed -e "$sed_quote_subst"` else qecho=`$ECHO "X$ECHO" | $Xsed -e "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host" ; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then oldobjs="$oldobjs $symfileobj" fi fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $addlibs oldobjs="$oldobjs $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $dlprefiles oldobjs="$oldobjs $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else $ECHO "copying selected object files to avoid basename conflicts..." gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase="$func_basename_result" case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" oldobjs="$oldobjs $gentop/$newobj" ;; *) oldobjs="$oldobjs $obj" ;; esac done fi eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "X$relink_command" | $Xsed -e "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" newdependency_libs="$newdependency_libs $libdir/$name" ;; *) newdependency_libs="$newdependency_libs $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlfiles="$newdlfiles $libdir/$name" ;; *) newdlfiles="$newdlfiles $lib" ;; esac done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" newdlprefiles="$newdlprefiles $libdir/$name" ;; esac done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlfiles="$newdlfiles $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlprefiles="$newdlprefiles $abs" done dlprefiles="$newdlprefiles" fi $RM $output # place dlname in correct position for cygwin tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) tdlname=../bin/$dlname ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that can not go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } { test "$mode" = link || test "$mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) RM="$RM $arg"; rmforce=yes ;; -*) RM="$RM $arg" ;; *) files="$files $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= origobjdir="$objdir" for file in $files; do func_dirname "$file" "" "." dir="$func_dirname_result" if test "X$dir" = X.; then objdir="$origobjdir" else objdir="$dir/$origobjdir" fi func_basename "$file" name="$func_basename_result" test "$mode" = uninstall && objdir="$dir" # Remember objdir for removal later, being careful to avoid duplicates if test "$mode" = clean; then case " $rmdirs " in *" $objdir "*) ;; *) rmdirs="$rmdirs $objdir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do rmfiles="$rmfiles $objdir/$n" done test -n "$old_library" && rmfiles="$rmfiles $objdir/$old_library" case "$mode" in clean) case " $library_names " in # " " in the beginning catches empty $dlname *" $dlname "*) ;; *) rmfiles="$rmfiles $objdir/$dlname" ;; esac test -n "$libdir" && rmfiles="$rmfiles $objdir/$name $objdir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test "$pic_object" != none; then rmfiles="$rmfiles $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test "$non_pic_object" != none; then rmfiles="$rmfiles $dir/$non_pic_object" fi fi ;; *) if test "$mode" = clean ; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe rmfiles="$rmfiles $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result rmfiles="$rmfiles $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles rmfiles="$rmfiles $objdir/$name $objdir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then rmfiles="$rmfiles $objdir/lt-$name" fi if test "X$noexename" != "X$name" ; then rmfiles="$rmfiles $objdir/lt-${noexename}.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done objdir="$origobjdir" # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } { test "$mode" = uninstall || test "$mode" = clean; } && func_mode_uninstall ${1+"$@"} test -z "$mode" && { help="$generic_help" func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode \`$mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: # vi:sw=2 polylib-5.22.5.orig/applications/0000755000175000017500000000000011341243106017561 5ustar sylvestresylvestrepolylib-5.22.5.orig/applications/disjoint_union_adj.c0000644000175000017500000000306111341227526023606 0ustar sylvestresylvestre/* Polyhedron disjoint intersections */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* disjoint_union_adj computes the disjoint union of the given list of domains. input: (integer) # of polyhedra list of polyhedra in the usual matrix (constraints) format output: list of polyhedra (constraint matrices) having their facets in common */ #include #include #include #define WS 0 /* Procedure to print constraints of a domain */ void AffContraintes(Polyhedron *p) { for( ;p;p=p->next) { Polyhedron_PrintConstraints(stdout, P_VALUE_FMT, p ); printf("\n"); } } int main() { int np, i; Matrix *a; Polyhedron *A, *tmp, *DD; scanf( "%d", &np ); A = NULL; for( i=0 ; inext = A; A = tmp; } DD = Disjoint_Domain( A, 1, WS ); AffContraintes(DD); return 0; } polylib-5.22.5.orig/applications/ehrhart_ranking.c0000644000175000017500000000556611341227526023117 0ustar sylvestresylvestre/* Program for testing the ranking function. */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include #include int main( int argc, char **argv) { int i; const char **param_name = NULL; Matrix *M; Polyhedron *P, *D, *C; Enumeration *e, *en; int nb_parms; #ifdef EP_EVALUATION Value *p, *tmp; int k; #endif M = Matrix_Read(); P = Constraints2Polyhedron(M, POL_NO_DUAL); Matrix_Free(M); M = Matrix_Read(); D = Constraints2Polyhedron(M, POL_NO_DUAL); Matrix_Free(M); M = Matrix_Read(); C = Constraints2Polyhedron(M, POL_NO_DUAL); Matrix_Free(M); nb_parms = D->Dimension; /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,nb_parms); /* compute a polynomial approximation of the Ehrhart polynomial */ printf("============ Ranking function ============\n"); e = Polyhedron_LexSmallerEnumerate(P, D, D->Dimension-C->Dimension, C, POL_NO_DUAL); Polyhedron_Free(P); Polyhedron_Free(D); Polyhedron_Free(C); for (en=e; en; en=en->next) { Print_Domain(stdout,en->ValidityDomain, param_name); print_evalue(stdout,&en->EP, param_name); printf( "\n-----------------------------------\n" ); } #ifdef EP_EVALUATION if( isatty(0) && nb_parms != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); p = (Value *)malloc(sizeof(Value) * (nb_parms)); for(i=0;iEP) ); Polyhedron_Free( e->ValidityDomain ); en = e ->next; free( e ); e = en; } Free_ParamNames(param_name, nb_parms); return 0; } polylib-5.22.5.orig/applications/ehrhart_lower_bound.c0000644000175000017500000000555511341227526024003 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include int main( int argc, char **argv) { int i; const char **param_name; Matrix *C1, *P1; Polyhedron *P, *C; Enumeration *e, *en; Matrix * Validity_Lattice; int nb_parms; #ifdef EP_EVALUATION Value *p, *tmp; int k; #endif P1 = Matrix_Read(); C1 = Matrix_Read(); nb_parms = C1->NbColumns-2; if(nb_parms < 0) { fprintf( stderr, "Not enough parameters !\n" ); exit(0); } /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,nb_parms); /* inflate the polyhedron, so that the inflated EP approximation will be an upper bound for the EP's polyhedron. */ mpolyhedron_deflate(P1,nb_parms); /* compute a polynomial approximation of the Ehrhart polynomial */ e = Ehrhart_Quick_Apx(P1, C1, &Validity_Lattice, 1024); Matrix_Free(C1); Matrix_Free(P1); printf("============ Ehrhart polynomial quick polynomial lower bound ============\n"); show_matrix(Validity_Lattice); for( en=e ; en ; en=en->next ) { Print_Domain(stdout,en->ValidityDomain, param_name); print_evalue(stdout,&en->EP, param_name); printf( "\n-----------------------------------\n" ); } #ifdef EP_EVALUATION if( isatty(0) && nb_parms != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); p = (Value *)malloc(sizeof(Value) * (nb_parms)); for(i=0;iEP) ); Polyhedron_Free( e->ValidityDomain ); en = e ->next; free( e ); e = en; } Free_ParamNames(param_name, nb_parms); return 0; } polylib-5.22.5.orig/applications/pp.c0000644000175000017500000000522111341227526020354 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #define WS 0 int main() { Matrix *a, *b; Polyhedron *A, *B; Param_Polyhedron *PA; Param_Domain *P; Param_Vertices *V; int nbPV, i, j; const char **param_name; a = Matrix_Read(); if(!a || a->NbColumns == 0) { fprintf(stderr,"Input error: empty matrix\n"); exit(0); } A = Constraints2Polyhedron(a, WS); Matrix_Free(a); b = Matrix_Read(); if(!b || b->NbColumns == 0) { fprintf(stderr, "Input error: empty matrix\n"); exit(0); } B = Constraints2Polyhedron(b, WS); Matrix_Free(b); /* Read the name of the parameters */ param_name = Read_ParamNames(stdin, B->Dimension); PA = Polyhedron2Param_Domain(A,B,WS); if(!PA || PA->D==NULL) { printf("---------------------------------------\n"); printf("Empty polyhedron\n"); return 0; } nbPV = PA->nbV; Domain_Free(A); Domain_Free(B); if (PA->Rays->NbRows > 0) { printf( "---------------------------------------\n" ); printf( "Overall rays :\n"); for (i = 0; i < PA->Rays->NbRows; i++) { if (value_zero_p(PA->Rays->p[i][0])) printf("Line: ["); else printf("Ray: ["); for (j = 1; j < PA->Rays->NbColumns-1; j++) { value_print(stdout,P_VALUE_FMT,PA->Rays->p[i][j]); } printf(" ]\n"); } } /*****************************/ /* Scan the validity domains */ for(P=PA->D;P;P=P->next) { /* prints current val. dom. */ printf( "---------------------------------------\n" ); printf( "Domain :\n"); Print_Domain( stdout, P->Domain, param_name ); /* scan the vertices */ printf( "Vertices :\n"); FORALL_PVertex_in_ParamPolyhedron(V,P,PA) { /* prints each vertex */ Print_Vertex( stdout, V->Vertex, param_name ); printf( "\n" ); } END_FORALL_PVertex_in_ParamPolyhedron; } /*****************************/ Param_Polyhedron_Free( PA ); free(param_name); return 0; } /* main */ polylib-5.22.5.orig/applications/ehrhart_quick_apx.c0000644000175000017500000000531211341227526023437 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include int main( int argc, char **argv) { int i; const char **param_name = NULL; Matrix *C1, *P1; Polyhedron *P, *C; Enumeration *e, *en; Matrix * Validity_Lattice; int nb_parms; #ifdef EP_EVALUATION Value *p, *tmp; int k; #endif P1 = Matrix_Read(); C1 = Matrix_Read(); nb_parms = C1->NbColumns-2; if(nb_parms < 0) { fprintf( stderr, "Not enough parameters !\n" ); exit(0); } /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,nb_parms); /* compute a polynomial approximation of the Ehrhart polynomial */ printf("============ Ehrhart polynomial quick approximation ============\n"); e = Ehrhart_Quick_Apx(P1, C1, &Validity_Lattice, 1024); Matrix_Free(C1); Matrix_Free(P1); show_matrix(Validity_Lattice); for( en=e ; en ; en=en->next ) { Print_Domain(stdout,en->ValidityDomain, param_name); print_evalue(stdout,&en->EP, param_name); printf( "\n-----------------------------------\n" ); } #ifdef EP_EVALUATION if( isatty(0) && nb_parms != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); p = (Value *)malloc(sizeof(Value) * (nb_parms)); for(i=0;iEP) ); Polyhedron_Free( e->ValidityDomain ); en = e ->next; free( e ); e = en; } Free_ParamNames(param_name, nb_parms); return 0; } polylib-5.22.5.orig/applications/polytest.c0000644000175000017500000001121511341227526021620 0ustar sylvestresylvestre/* polytest.c */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #define WS 0 char s[128]; int main() { Matrix *a=NULL, *b=NULL, *c, *d, *e, *f; Polyhedron *A, *B, *C, *D, *last, *tmp; int i, nbPol, nbMat, func; fgets(s, 128, stdin); nbPol = nbMat = 0; while ((*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); for (i=0, A=last=(Polyhedron *)0; inext = tmp; last = tmp; } } if (nbMat) { a = Matrix_Read(); } fgets(s,128,stdin); nbPol = nbMat = 0; while ( (*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); for (i=0, B=last=(Polyhedron *)0; inext = tmp; last = tmp; } } if (nbMat) { b = Matrix_Read(); } fgets(s, 128, stdin); while ((*s=='#') || (sscanf(s, "F %d", &func)<1)) fgets(s, 128, stdin); switch (func) { case 1: C = DomainUnion(A, B, WS); D = DomainConvex(C, WS); d = Polyhedron2Constraints(D); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Free(d); Domain_Free(C); Domain_Free(D); break; case 2: D = DomainSimplify(A, B, WS); d = Polyhedron2Constraints(D); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Free(d); Domain_Free(D); break; case 3: a = Polyhedron2Constraints(A); Matrix_Print(stdout,P_VALUE_FMT,a); b = Polyhedron2Constraints(B); Matrix_Print(stdout,P_VALUE_FMT,b); break; case 4: a = Polyhedron2Rays(A); Matrix_Print(stdout,P_VALUE_FMT,a); break; case 5: /* a = ec , da = c , ed = 1 */ right_hermite(a,&c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT,c); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Print(stdout,P_VALUE_FMT,e); f = Matrix_Alloc(e->NbRows,c->NbColumns); Matrix_Product(e,c,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(d->NbRows,a->NbColumns); Matrix_Product(d,a,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(e->NbRows, d->NbColumns); Matrix_Product(e,d,f); Matrix_Print(stdout,P_VALUE_FMT,f); break; case 6: /* a = ce , ad = c , de = 1 */ left_hermite(a,&c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT,c); Matrix_Print(stdout,P_VALUE_FMT,d); Matrix_Print(stdout,P_VALUE_FMT,e); f = Matrix_Alloc(c->NbRows, e->NbColumns); Matrix_Product(c,e,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(a->NbRows, d->NbColumns); Matrix_Product(a,d,f); Matrix_Print(stdout,P_VALUE_FMT,f); Matrix_Free(f); f = Matrix_Alloc(d->NbRows, e->NbColumns); Matrix_Product(d,e,f); Matrix_Print(stdout,P_VALUE_FMT,f); break; case 7: /* Polyhedron_Print(stdout,"%5d", A); */ /* Matrix_Print(stdout,"%4d", b); */ C = Polyhedron_Image(A, b, WS); Polyhedron_Print(stdout,P_VALUE_FMT,C); break; case 8: printf("%s\n", Polyhedron_Not_Empty(A,B,WS) ? "Not Empty" : "Empty"); break; case 9: i = PolyhedronLTQ(A,B,1,0,WS); printf("%s\n", i==-1 ? "AB" : i==0 ? "A>B" : i==0 ? "A>. */ #include #include #include int main() { Matrix *a, *b; Polyhedron *A, *B; Param_Polyhedron *PA; const char **param_name; a = Matrix_Read(); A = Constraints2Polyhedron(a,200); Matrix_Free(a); b = Matrix_Read(); B = Constraints2Polyhedron(b,200); Matrix_Free(b); /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,B->Dimension); PA = Polyhedron2Param_Vertices(A,B,500); Param_Vertices_Print(stdout,PA->V,param_name); Domain_Free(A); Domain_Free(B); Param_Polyhedron_Free( PA ); free(param_name); return 0; } /* main */ polylib-5.22.5.orig/applications/testCompressParms.c0000644000175000017500000003052611341227526023441 0ustar sylvestresylvestre/** * $Id: testCompressParms.c,v 1.4 2006/09/18 03:09:03 meister Exp $ * * Test routines for kernel/compress_parms.c functions * @author B. Meister, 3/2006 * */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include #ifdef dbg #undef dbg #endif #define dbg 1 #define TEST(a) if (isOk = a) { \ printf(#a" tested ok.\n"); \ } \ else { \ printf(#a" NOT OK\n"); \ } #define maxRays 200 const char *origNames[] = {"n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"}; int main(int argc, char ** argv) { int isOk = 0; Matrix * A, * B; if (argc>1) { printf("Warning: No arguments taken into account: testing" "remove_parm_eqs().\n"); } A = Matrix_Read(); B = Matrix_Read(); TEST( test_Constraints_Remove_parm_eqs(A, B) ) TEST( test_Polyhedron_Remove_parm_eqs(A, B) ) TEST( test_Constraints_fullDimensionize(A, B, 4) ) Matrix_Free(A); Matrix_Free(B); return (1-isOk); } /** extracts the equalities involving the parameters only, try to introduce them back and compare the two polyhedra. Reads a polyhedron and a context. */ int test_Constraints_Remove_parm_eqs(Matrix * A, Matrix * B) { int isOk = 1; Matrix * M, *C, *Cp, * Eqs, *M1, *C1; Polyhedron *Pm, *Pc, *Pcp, *Peqs, *Pint; unsigned int * elimParms; printf("----- test_Constraints_Remove_parm_eqs() -----\n"); M1 = Matrix_Copy(A); C1 = Matrix_Copy(B); M = Matrix_Copy(M1); C = Matrix_Copy(C1); /* compute the combined polyhedron */ Pm = Constraints2Polyhedron(M, maxRays); Pc = Constraints2Polyhedron(C, maxRays); Pcp = align_context(Pc, Pm->Dimension, maxRays); Polyhedron_Free(Pc); Pc = DomainIntersection(Pm, Pcp, maxRays); Polyhedron_Free(Pm); Polyhedron_Free(Pcp); Matrix_Free(M); Matrix_Free(C); /* extract the parm-equalities, expressed in the combined space */ Eqs = Constraints_Remove_parm_eqs(&M1, &C1, 1, &elimParms); printf("Removed equalities: \n"); show_matrix(Eqs); printf("Polyhedron without equalities involving only parameters: \n"); show_matrix(M1); printf("Context without equalities: \n"); show_matrix(C1); /* compute the supposedly-same polyhedron, using the extracted equalities */ Pm = Constraints2Polyhedron(M1, maxRays); Pcp = Constraints2Polyhedron(C1, maxRays); Peqs = align_context(Pcp, Pm->Dimension, maxRays); Polyhedron_Free(Pcp); Pcp = DomainIntersection(Pm, Peqs, maxRays); Polyhedron_Free(Peqs); Polyhedron_Free(Pm); Peqs = Constraints2Polyhedron(Eqs, maxRays); Matrix_Free(Eqs); Matrix_Free(M1); Matrix_Free(C1); Pint = DomainIntersection(Pcp, Peqs, maxRays); Polyhedron_Free(Pcp); Polyhedron_Free(Peqs); /* test their equality */ if (!PolyhedronIncludes(Pint, Pc)) { isOk = 0; } else { if (!PolyhedronIncludes(Pc, Pint)) { isOk = 0; } } Polyhedron_Free(Pc); Polyhedron_Free(Pint); return isOk; } /* test_Constraints_Remove_parm_eqs() */ /** extracts the equalities holding on the parameters only, try to introduce them back and compare the two polyhedra. Reads a polyhedron and a context. */ int test_Polyhedron_Remove_parm_eqs(Matrix * A, Matrix * B) { int isOk = 1; Matrix * M, *C; Polyhedron *Pm, *Pc, *Pcp, *Peqs, *Pint, *Pint1; unsigned int * elimParms; printf("----- test_Polyhedron_Remove_parm_eqs() -----\n"); M = Matrix_Copy(A); C = Matrix_Copy(B); /* compute the combined polyhedron */ Pm = Constraints2Polyhedron(M, maxRays); Pc = Constraints2Polyhedron(C, maxRays); Pcp = align_context(Pc, Pm->Dimension, maxRays); Polyhedron_Free(Pc); Pint1 = DomainIntersection(Pm, Pcp, maxRays); Polyhedron_Free(Pm); Polyhedron_Free(Pcp); Matrix_Free(M); Matrix_Free(C); M = Matrix_Copy(A); C = Matrix_Copy(B); /* extract the parm-equalities, expressed in the combined space */ Pm = Constraints2Polyhedron(M, maxRays); Pc = Constraints2Polyhedron(C, maxRays); Matrix_Free(M); Matrix_Free(C); Peqs = Polyhedron_Remove_parm_eqs(&Pm, &Pc, 1, &elimParms, 200); /* compute the supposedly-same polyhedron, using the extracted equalities */ Pcp = align_context(Pc, Pm->Dimension, maxRays); Polyhedron_Free(Pc); Pc = DomainIntersection(Pm, Pcp, maxRays); Polyhedron_Free(Pm); Polyhedron_Free(Pcp); Pint = DomainIntersection(Pc, Peqs, maxRays); Polyhedron_Free(Pc); Polyhedron_Free(Peqs); /* test their equality */ if (!PolyhedronIncludes(Pint, Pint1)) { isOk = 0; } else { if (!PolyhedronIncludes(Pint1, Pint)) { isOk = 0; } } Polyhedron_Free(Pint1); Polyhedron_Free(Pint); return isOk; } /* test_Polyhedron_remove_parm_eqs() */ /** * Eliminates certain parameters from a vector of values for parameters * @param origParms the initial vector of values of parameters * @param elimParms the list of parameters to be eliminated in the vector * @param newParms the vector of values without the eliminated ones. */ void valuesWithoutElim(Matrix * origParms, unsigned int * elimParms, Matrix ** newParms) { unsigned int i, j=0; if (*newParms==NULL) { *newParms = Matrix_Alloc(1, origParms->NbColumns-elimParms[0]); } /* else assume enough space is allocated */ if (elimParms[0] ==0) { for (i=0; i< origParms->NbColumns; i++) { value_assign((*newParms)->p[0][i], origParms->p[0][i]); } } for (i=0; i< origParms->NbColumns; i++) { if (i!=elimParms[j+1]) { value_assign((*newParms)->p[0][i-j], origParms->p[0][i]); } else { j++; } } }/* valuesWithoutElim */ /** * takes a list of parameter names, a list ofparameters to eliminate, and * returns the list of parameters without the eliminated ones. * @param parms the original parameter names * @param nbParms the number of original parmaeters * @param elimParms the array-list of indices of parameters to eliminate (first * element set to the number of its elements) * @param newParms the returned list of parm names. Allocated if set to NULL, * reused if not. * @return the number of names in the returned list. */ unsigned int namesWithoutElim(const char **parms, unsigned nbParms, unsigned int * elimParms, const char ***newParms) { unsigned int i, j=0; unsigned int newSize = nbParms -elimParms[0]; if (dbg) { printf("Size of the new parm vector: %d\n", newSize); } if (*newParms==NULL) { *newParms = malloc(newSize*sizeof(char *)); } if (elimParms[0]==0) { for (i=0; i< nbParms; i++) { (*newParms)[i] = strdup(parms[i]); } return newSize; } for (i=0; i< nbParms; i++) { if (i!=elimParms[j+1]) { (*newParms)[i-j] = strdup(parms[i]); } else { j++; } } return newSize; } /** * Tests Constraints_fullDimensionize by comparing the Ehrhart polynomials * @param A the input set of constraints * @param B the corresponding context * @param the number of samples to generate for the test * @return 1 if the Ehrhart polynomial had the same value for the * full-dimensional and non-full-dimensional sets of constraints, for their * corresponding sample parameters values. */ int test_Constraints_fullDimensionize(Matrix * A, Matrix * B, unsigned int nbSamples) { Matrix * Eqs= NULL, *ParmEqs=NULL, *VL=NULL; unsigned int * elimVars=NULL, * elimParms=NULL; Matrix * sample, * smallerSample=NULL; Matrix * transfSample=NULL; Matrix * parmVL=NULL; unsigned int i, j, r, nbOrigParms, nbParms; Value div, mod, *origVal=NULL, *fullVal=NULL; Matrix * VLInv; Polyhedron * P, *PC; Matrix * M, *C; Enumeration * origEP, * fullEP=NULL; const char **fullNames = NULL; int isOk = 1; /* holds the result */ /* compute the origial Ehrhart polynomial */ M = Matrix_Copy(A); C = Matrix_Copy(B); P = Constraints2Polyhedron(M, maxRays); PC = Constraints2Polyhedron(C, maxRays); origEP = Polyhedron_Enumerate(P, PC, maxRays, origNames); Matrix_Free(M); Matrix_Free(C); Polyhedron_Free(P); Polyhedron_Free(PC); /* compute the full-dimensional polyhedron corresponding to A and its Ehrhart polynomial */ M = Matrix_Copy(A); C = Matrix_Copy(B); nbOrigParms = B->NbColumns-2; Constraints_fullDimensionize(&M, &C, &VL, &Eqs, &ParmEqs, &elimVars, &elimParms, maxRays); if ((Eqs->NbRows==0) && (ParmEqs->NbRows==0)) { Matrix_Free(M); Matrix_Free(C); Matrix_Free(Eqs); Matrix_Free(ParmEqs); free(elimVars); free(elimParms); return 1; } nbParms = C->NbColumns-2; P = Constraints2Polyhedron(M, maxRays); PC = Constraints2Polyhedron(C, maxRays); namesWithoutElim(origNames, nbOrigParms, elimParms, &fullNames); fullEP = Polyhedron_Enumerate(P, PC, maxRays, fullNames); Matrix_Free(M); Matrix_Free(C); Polyhedron_Free(P); Polyhedron_Free(PC); /* make a set of sample parameter values and compare the corresponding Ehrhart polnomials */ sample = Matrix_Alloc(1,nbOrigParms); transfSample = Matrix_Alloc(1, nbParms); Lattice_extractSubLattice(VL, nbParms, &parmVL); VLInv = Matrix_Alloc(parmVL->NbRows, parmVL->NbRows+1); MatInverse(parmVL, VLInv); if (dbg) { show_matrix(parmVL); show_matrix(VLInv); } srand(nbSamples); value_init(mod); value_init(div); for (i = 0; i< nbSamples; i++) { /* create a random sample */ for (j=0; j< nbOrigParms; j++) { value_set_si(sample->p[0][j], rand()%100); } /* compute the corresponding value for the full-dimensional constraints */ valuesWithoutElim(sample, elimParms, &smallerSample); /* (N' i' 1)^T = VLinv.(N i 1)^T*/ for (r = 0; r < nbParms; r++) { Inner_Product(&(VLInv->p[r][0]), smallerSample->p[0], nbParms, &(transfSample->p[0][r])); /* add the constant part */ value_addto(transfSample->p[0][r], transfSample->p[0][r], VLInv->p[r][VLInv->NbColumns-2]); value_pdivision(div, transfSample->p[0][r], VLInv->p[r][VLInv->NbColumns-1]); value_subtract(mod, transfSample->p[0][r], div); /* if the parameters value does not belong to the validity lattice, the Ehrhart polynomial is zero. */ if (!value_zero_p(mod)) { fullEP = Enumeration_zero(nbParms, maxRays); break; } } /* compare the two forms of the Ehrhart polynomial.*/ if (origEP ==NULL) break; /* NULL has loose semantics for EPs */ origVal = compute_poly(origEP, sample->p[0]); fullVal = compute_poly(fullEP, transfSample->p[0]); if (!value_eq(*origVal, *fullVal)) { isOk = 0; printf("EPs don't match. \n Original value = "); value_print(stdout, VALUE_FMT, *origVal); printf("\n Original sample = ["); for (j=0; jNbColumns; j++) { value_print(stdout, VALUE_FMT, sample->p[0][j]); printf(" "); } printf("] \n EP = "); if(origEP!=NULL) { print_evalue(stdout, &(origEP->EP), origNames); } else { printf("NULL"); } printf(" \n Full-dimensional value = "); value_print(stdout, P_VALUE_FMT, *fullVal); printf("\n full-dimensional sample = ["); for (j=0; jNbColumns; j++) { value_print(stdout, VALUE_FMT, transfSample->p[0][j]); printf(" "); } printf("] \n EP = "); if(origEP!=NULL) { print_evalue(stdout, &(origEP->EP), fullNames); } else { printf("NULL"); } } if (dbg) { printf("\nOriginal value = "); value_print(stdout, VALUE_FMT, *origVal); printf("\nFull-dimensional value = "); value_print(stdout, P_VALUE_FMT, *fullVal); printf("\n"); } value_clear(*origVal); value_clear(*fullVal); } value_clear(mod); value_clear(div); Matrix_Free(sample); Matrix_Free(smallerSample); Matrix_Free(transfSample); Enumeration_Free(origEP); Enumeration_Free(fullEP); return isOk; } /* test_Constraints_fullDimensionize */ polylib-5.22.5.orig/applications/ehrhart_upper_bound.c0000644000175000017500000000555511341227526024006 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include int main( int argc, char **argv) { int i; const char **param_name; Matrix *C1, *P1; Polyhedron *P, *C; Enumeration *e, *en; Matrix * Validity_Lattice; int nb_parms; #ifdef EP_EVALUATION Value *p, *tmp; int k; #endif P1 = Matrix_Read(); C1 = Matrix_Read(); nb_parms = C1->NbColumns-2; if(nb_parms < 0) { fprintf( stderr, "Not enough parameters !\n" ); exit(0); } /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,nb_parms); /* inflate the polyhedron, so that the inflated EP approximation will be an upper bound for the EP's polyhedron. */ mpolyhedron_inflate(P1,nb_parms); /* compute a polynomial approximation of the Ehrhart polynomial */ e = Ehrhart_Quick_Apx(P1, C1, &Validity_Lattice, 1024); Matrix_Free(C1); Matrix_Free(P1); printf("============ Ehrhart polynomial quick polynomial upper bound ============\n"); show_matrix(Validity_Lattice); for( en=e ; en ; en=en->next ) { Print_Domain(stdout,en->ValidityDomain, param_name); print_evalue(stdout,&en->EP, param_name); printf( "\n-----------------------------------\n" ); } #ifdef EP_EVALUATION if( isatty(0) && nb_parms != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); p = (Value *)malloc(sizeof(Value) * (nb_parms)); for(i=0;iEP) ); Polyhedron_Free( e->ValidityDomain ); en = e ->next; free( e ); e = en; } Free_ParamNames(param_name, nb_parms); return 0; } polylib-5.22.5.orig/applications/ehrhart_union.c0000644000175000017500000001145011341227526022603 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include #include void Union_Read(Polyhedron **P, Polyhedron **C, const char ***param_name) { Matrix *pm; Polyhedron *ptmp; unsigned NbRows, NbColumns; char s[1025], param[1025]; int i, j, c, f; *P = NULL; pm = Matrix_Read(); f=1; while( f ) { do { if( fgets(s, 1024, stdin) == 0 ) f=0; } while ( (*s=='#' || *s=='\n') && f ); if( f && sscanf(s, "%d %d", &NbRows, &NbColumns)==2 ) { /* gets old pm and add it to the union */ if( *P ) if( pm->NbColumns != ((*P)->Dimension)+2 ) { fprintf( stderr, "Polyhedra must be in the same dimension space !\n"); exit(0); } ptmp = Constraints2Polyhedron(pm, 200); ptmp->next = *P; *P = ptmp; Matrix_Free(pm); /* reads the new pm */ pm = Matrix_Alloc(NbRows, NbColumns); Matrix_Read_Input( pm ); } else break; } /* Context : last read pm */ *C = Constraints2Polyhedron(pm, 200); Matrix_Free(pm); if( f ) { char **pp = (char **)malloc((*C)->Dimension*sizeof(char *)); *param_name = (const char **)pp; /* read the parameter names */ c = 0; for( i=0 ; i<(*C)->Dimension ; ++i ) { j=0; for( ; ; ++c ) { if( s[c]==' ' || s[c]=='\n' || s[c]==0 ) { if( j==0 ) continue; else break; } param[j++] = s[c]; } /* else, no parameters (use default) */ if( j==0 ) break; param[j] = 0; pp[i] = (char *)malloc(j); strcpy(pp[i], param); } if( i != (*C)->Dimension ) { free( *param_name ); *param_name = Read_ParamNames(NULL,(*C)->Dimension); } } else *param_name = Read_ParamNames(NULL,(*C)->Dimension); } void recurse(Polyhedron *C, const char **param_name, Enumeration *e, Value *pmin, Value *pmax, Value *p, int l ) { Value z, *tmp; int k; value_init( z ); if( l == C->Dimension ) { fprintf(stdout,"EP( "); value_print(stdout,VALUE_FMT,p[0]); for(k=1;kDimension;++k) { fprintf(stdout,","); value_print(stdout,VALUE_FMT,p[k]); } fprintf(stdout," ) = "); value_print(stdout,VALUE_FMT,*(tmp=compute_poly(e,p))); value_clear( *tmp ); free(tmp); fprintf(stdout,"\n"); } else { for( value_assign( z, pmin[l]) ; value_le(z,pmax[l]) ; value_increment(z,z) ) { value_assign( p[l], z ); recurse ( C, param_name, e, pmin, pmax, p, l+1 ); } } } int main( int argc, char **argv) { Polyhedron *P, *C; const char **param_name; Enumeration *e, *en; Value *pmin, *pmax, *p; int i, k; char str[256], *s; if( argc != 1 ) { fprintf( stderr, " Usage : %s [< file]\n", argv[0] ); return( -1 ); } Union_Read( &P, &C, ¶m_name ); e = Domain_Enumerate( P, C, 200, param_name ); for( en=e ; en ; en=en->next ) { Print_Domain(stdout,en->ValidityDomain, param_name); print_evalue(stdout,&en->EP, param_name); printf( "\n-----------------------------------\n" ); } if( isatty(0) && C->Dimension != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); pmin = (Value *)malloc(sizeof(Value) * (C->Dimension)); pmax = (Value *)malloc(sizeof(Value) * (C->Dimension)); p = (Value *)malloc(sizeof(Value) * (C->Dimension)); for(i=0;iDimension;i++) { value_init(pmin[i]); value_init(pmax[i]); value_init(p[i]); } FOREVER { fflush(stdin); printf("Enter %d parameters (or intervals, comma separated) : ",C->Dimension); for(k=0;kDimension;++k) { scanf("%s",str); if( (s=strpbrk(str,",")) ) { *s = 0; value_read(pmin[k],str); value_read(pmax[k],(s+1)); } else { value_read(pmin[k],str); value_assign(pmax[k],pmin[k]); } } recurse( C, param_name, e, pmin, pmax, p, 0 ); } } return( 0 ); } polylib-5.22.5.orig/applications/Zpolytest.c0000644000175000017500000002307511341227526021761 0ustar sylvestresylvestre/* zpolytest.c This is a testbench for the Zpolylib (part of polylib manipulating Z-polyhedra. */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #define WS 0 char s[128]; int main() { Matrix *a=NULL, *b=NULL, *c=NULL, *d, *e, *g; LatticeUnion *l1,*l2,*l3,*l4,*temp; Polyhedron *A=NULL, *B=NULL, *C=NULL, *D; ZPolyhedron *ZA, *ZB, *ZC, *ZD, *Zlast; int nbPol, nbMat, func, rank ; Vector *v=NULL; /* The structure of the input file to this program is the following: First a line containing M nbMat Where nbMat is an integer indicating how many Matrices will be described in the following. temporary debugging. Next the matrice are described. For each matrix, the first row is two integers: nbRows nbColumns Then the matrix is written row by row. a line starting with a `#' is considered as a comment Then a line containing D nbDomain where nbDomain is an integer indicating how many domain will be described in the following. Domains are describled as for polylib, the first row is two integers: nbConstraints dimension then the constraints are described in the Polylib format. The last line of the input file contains : F numTest which indicates which test will be performed on the data. Warning, currently no more than 3 matrice of Polyhedra can be read*/ fgets(s, 128, stdin); nbPol = nbMat = 0; while ( (*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); /* debug */ /* fprintf(stdout,"nbMat=%d",nbMat);fflush(stdout); */ switch (nbMat) { case 1: a = Matrix_Read(); break; case 2: a = Matrix_Read(); b = Matrix_Read(); break; case 3: a = Matrix_Read(); b = Matrix_Read(); c = Matrix_Read(); break; } fgets(s, 128, stdin); while ((*s=='#') || ((sscanf(s, "D %d", &nbPol)<1) && (sscanf(s, "M %d", &nbMat)<1)) ) fgets(s, 128, stdin); /* debug */ /* fprintf(stdout,"nbPol=%d",nbPol);fflush(stdout); */ switch (nbPol) { case 1: g = Matrix_Read(); A = Constraints2Polyhedron(g,WS); Matrix_Free(g); break; case 2: g = Matrix_Read(); A = Constraints2Polyhedron(g,WS); Matrix_Free(g); g = Matrix_Read(); B = Constraints2Polyhedron(g,WS); Matrix_Free(g); break; case 3: g = Matrix_Read(); A = Constraints2Polyhedron(g,WS); Matrix_Free(g); g = Matrix_Read(); B = Constraints2Polyhedron(g,WS); Matrix_Free(g); g = Matrix_Read(); C = Constraints2Polyhedron(g,WS); Matrix_Free(g); break; } fgets(s, 128, stdin); while ((*s=='#') || (sscanf(s, "F %d", &func)<1) ) fgets(s, 128, stdin); switch (func) { case 1: /* just a test of polylib functions */ C = DomainUnion(A, B, 200); D = DomainConvex(C, 200); d = Polyhedron2Constraints(D); Matrix_Print(stdout,P_VALUE_FMT, d); Matrix_Free(d); Domain_Free(D); break; case 2: /* AffineHermite */ AffineHermite(a,&b,&c); Matrix_Print(stdout,P_VALUE_FMT, b); Matrix_Print(stdout,P_VALUE_FMT, c); break; case 3: /* LatticeIntersection */ c = LatticeIntersection(a,b); Matrix_Print(stdout,P_VALUE_FMT, c); break; case 4: /* LatticeDifference */ fprintf(stdout," 2 in 1 : %d\n",LatticeIncludes(b,a)); fprintf(stdout," 1 in 3 : %d\n",LatticeIncludes(c,a)); fprintf(stdout," 1 in 2 : %d\n",LatticeIncludes(a,b)); break; case 5: /* LatticeDifference */ l1=LatticeDifference(a,b); l2=LatticeDifference(b,a); l3=LatticeDifference(c,a); l4=LatticeDifference(b,c); fprintf(stdout,"L1 - L2 :\n"); temp=l1; while (temp!=NULL) { Matrix_Print(stdout,P_VALUE_FMT,temp->M); temp=temp->next; }; fprintf(stdout,"Diff2:\n"); temp=l2; while (temp!=NULL) { Matrix_Print(stdout,P_VALUE_FMT, temp->M); temp=temp->next; }; fprintf(stdout,"Diff3:\n"); temp=l3; while (temp!=NULL) { Matrix_Print(stdout,P_VALUE_FMT, temp->M); temp=temp->next; }; fprintf(stdout,"Diff4:\n"); temp=l4; while (temp!=NULL) { Matrix_Print(stdout,P_VALUE_FMT, temp->M); temp=temp->next; }; break; case 6: /* isEmptyZPolyhedron */ ZA=ZPolyhedron_Alloc(a,A); fprintf(stdout,"is Empty? :%d \n", isEmptyZPolyhedron(ZA)); ZDomain_Free(ZA); break; case 7: /* ZDomainIntersection */ ZA=ZPolyhedron_Alloc(a,A); ZB=ZPolyhedron_Alloc(b,B); ZC = ZDomainIntersection(ZA,ZB); ZDomainPrint(stdout,P_VALUE_FMT, ZC); ZDomain_Free(ZA); ZDomain_Free(ZB); ZDomain_Free(ZC); break; case 8: /* ZDomainUnion */ ZA=ZPolyhedron_Alloc(a,A); ZB=ZPolyhedron_Alloc(b,B); ZC = ZDomainUnion(ZA,ZB); ZDomainPrint(stdout,P_VALUE_FMT, ZC); break; case 9: /* ZDomainDifference */ ZA=ZPolyhedron_Alloc(a,A); ZB=ZPolyhedron_Alloc(b,B); ZC = ZDomainDifference(ZA,ZB); ZDomainPrint(stdout,P_VALUE_FMT, ZC); break; case 10: /* ZDomainImage */ ZA=ZPolyhedron_Alloc(a,A); ZC = ZDomainImage(ZA,b); ZDomainPrint(stdout,P_VALUE_FMT, ZC); break; case 11: /* ZDomainPreimage */ ZA=ZPolyhedron_Alloc(a,A); ZC = ZDomainPreimage(ZA,b); ZDomainPrint(stdout,P_VALUE_FMT, ZC); break; case 12: /* ZDomainDifference */ ZA=ZPolyhedron_Alloc(a,A); ZC = ZDomainPreimage(ZA,b); ZD = ZDomainImage(ZC,b); Zlast=ZDomainDifference(ZD,ZC); fprintf(stdout,"the Two zpol are equal? :%d\n", isEmptyZPolyhedron(Zlast)); break; case 13: /* ZDomainSimplify */ ZA=ZPolyhedron_Alloc(a,A); ZA->next = ZPolyhedron_Alloc(b,B); ZDomainPrint(stdout,P_VALUE_FMT, ZA); ZD = ZDomainSimplify(ZA); ZDomainPrint(stdout,P_VALUE_FMT, ZD); break; case 14: /* EmptyZpolyhedron */ ZA=EmptyZPolyhedron(3); fprintf(stdout,"is Empty? :%d \n", isEmptyZPolyhedron(ZA)); ZDomain_Free(ZA); break; case 15: /* ZDomainInclude */ ZA=ZPolyhedron_Alloc(a,A); ZB=ZPolyhedron_Alloc(b,B); fprintf(stdout,"A in B :%d \nB in A :%d \n", ZPolyhedronIncludes(ZA,ZB), ZPolyhedronIncludes(ZB,ZA)); break; case 16: /* LatticePreimage */ c = LatticePreimage(a,b); Matrix_Print(stdout,P_VALUE_FMT, c); AffineHermite(c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT, d); break; case 17: /* LatticeImage */ c = LatticeImage(a,b); Matrix_Print(stdout,P_VALUE_FMT, c); AffineHermite(c,&d,&e); Matrix_Print(stdout,P_VALUE_FMT, d); break; case 18: /* EmptyLattice */ fprintf(stdout,"is Empty? :%d \n", isEmptyLattice(a)); fprintf(stdout,"is Empty? :%d \n", isEmptyLattice(EmptyLattice(3))); break; case 19: /* CanonicalForm */ ZA=ZPolyhedron_Alloc(a,A); ZB=ZPolyhedron_Alloc(a,B); CanonicalForm(ZA,&ZC,&c); CanonicalForm(ZB,&ZD,&d); ZDomainPrint(stdout,P_VALUE_FMT, ZC); ZDomainPrint(stdout,P_VALUE_FMT, ZD); break; case 20: /* LatticeSimplify */ l1=LatticeUnion_Alloc(); l2=LatticeUnion_Alloc(); l1->M=Matrix_Copy(a); l1->next=l2; l2->M=Matrix_Copy(b); l1=LatticeSimplify(l1); PrintLatticeUnion(stdout,P_VALUE_FMT,l1); LatticeUnion_Free(l1); break; case 21: /* AffineSmith */ AffineSmith(a,&b,&c, &d); Matrix_Print(stdout,P_VALUE_FMT, b); Matrix_Print(stdout,P_VALUE_FMT, c); Matrix_Print(stdout,P_VALUE_FMT, d); Matrix_Free(d); break; case 22: /* SolveDiophantine */ rank=SolveDiophantine(a,&d,&v); Matrix_Print(stdout,P_VALUE_FMT, a); fprintf(stdout," rank: %d \n ",rank); Matrix_Print(stdout,P_VALUE_FMT, d); Vector_Print(stdout,P_VALUE_FMT, v); rank=SolveDiophantine(b,&d,&v); Matrix_Print(stdout,P_VALUE_FMT, b); fprintf(stdout," rank: %d \n ",rank); Matrix_Print(stdout,P_VALUE_FMT, d); Vector_Print(stdout,P_VALUE_FMT, v); rank=SolveDiophantine(c,&d,&v); Matrix_Print(stdout,P_VALUE_FMT, c); fprintf(stdout," rank: %d \n ",rank); Matrix_Print(stdout,P_VALUE_FMT, d); Vector_Print(stdout,P_VALUE_FMT, v); Vector_Free(v); break; case 23: /* SplitZPolyhedron */ ZA=ZPolyhedron_Alloc(a,A); ZC = SplitZpolyhedron(ZA,b); ZDomainPrint(stdout,P_VALUE_FMT, ZC); break; case 100: /* debug */ ZA=ZPolyhedron_Alloc(a,A); ZDomainPrint(stdout,P_VALUE_FMT, ZA); ZDomain_Free(ZA); break; default: printf("? unknown function\n"); } /* Polyhedron_Free(A); */ if (a) Matrix_Free(a); if (b) Matrix_Free(b); if (c) Matrix_Free(c); if (A) Domain_Free(A); if (B) Domain_Free(B); if (C) Domain_Free(C); return 0; } /* main */ polylib-5.22.5.orig/applications/example.c0000644000175000017500000000345411341227526021376 0ustar sylvestresylvestre /* main.c This file along with Zpolyhedron.c, polyhedron.c, Lattice.c, Matop.c SolveDio.c, matrix.c and vector.c does the following : - Intersection of two Z-Domains. - Difference of two Z-domains. - Image of a Z-domain by a invertible, affine rational function. */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include int main () { Matrix *a, *b; Polyhedron *P; ZPolyhedron *Z1, *Z2, *Z3, *Z4; a = Matrix_Read (); b = Matrix_Read (); P = Constraints2Polyhedron (b, 200); Z1 = ZPolyhedron_Alloc (a, P); Matrix_Free (a); Matrix_Free (b); Domain_Free (P); a = Matrix_Read (); b = Matrix_Read (); P = Constraints2Polyhedron (b, 200); Z2 = ZPolyhedron_Alloc (a, P); Matrix_Free (a); Matrix_Free (b); Domain_Free (P); Z3 = ZDomainIntersection (Z1, Z2); printf ("\nZ3 = Z1 and Z2"); ZDomainPrint(stdout,P_VALUE_FMT, Z3); a = Matrix_Read (); Z4 = ZDomainImage (Z1, a); printf ("\nZ4 = image (Z1 by a)"); ZDomainPrint (stdout,P_VALUE_FMT, Z4); Matrix_Free (a); ZDomain_Free (Z1); ZDomain_Free (Z2); ZDomain_Free (Z3); ZDomain_Free (Z4); return 0; } /* main */ polylib-5.22.5.orig/applications/disjoint_union_sep.c0000644000175000017500000000313411341227526023640 0ustar sylvestresylvestre/* Polyhedron disjoint intersections */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* disjoint_union_sep computes the disjoint union of the given list of domains. input: (integer) # of polyhedra list of polyhedra in the usual matrix (constraints) format output: list of polyhedra (constraint matrices) having no integer point in common */ #include #include #include #define WS 0 /* Procedure to print constraints of a domain */ void AffContraintes(Polyhedron *p) { for( ;p;p=p->next) { Polyhedron_PrintConstraints(stdout, P_VALUE_FMT, p ); printf("\n"); } } int main() { int np, i; Matrix *a; Polyhedron *A, *tmp, *DD; scanf( "%d", &np ); A = NULL; for( i=0 ; inext = A; A = tmp; } DD = Disjoint_Domain( A, 0, WS ); AffContraintes(DD); Domain_Free( DD ); Domain_Free( A ); return 0; } polylib-5.22.5.orig/applications/c2p.c0000644000175000017500000000211411341227526020417 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #define WS 0 #include #include int main() { Matrix *A; Polyhedron *P; A = Matrix_Read(); if(A->NbColumns < 2) { printf("Wrong input: %d columns\n", A->NbColumns ); Matrix_Free(A); exit(1); } Matrix_Print(stdout,P_VALUE_FMT,A); P = Constraints2Polyhedron(A,WS); Matrix_Free(A); Polyhedron_Print(stdout,P_VALUE_FMT,P); Domain_Free(P); return 0; } polylib-5.22.5.orig/applications/r2p.c0000644000175000017500000000212211341227526020435 0ustar sylvestresylvestre/* Rays 2 Polyhedron */ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #define WS 0 #include #include #include int main() { Matrix *R; Polyhedron *P; R = Matrix_Read(); if(R->NbColumns < 2) { printf("Wrong input: %d columns\n", R->NbColumns ); Matrix_Free(R); exit(1); } P = Rays2Polyhedron(R,WS); Matrix_Free(R); Polyhedron_Print(stdout,P_VALUE_FMT,P); Domain_Free(P); return 0; } polylib-5.22.5.orig/applications/testlib.c0000644000175000017500000001362311341227526021410 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ /* main.c COPYRIGHT Both this software and its documentation are Copyright 1993 by IRISA /Universite de Rennes I - France, Copyright 1995,1996 by BYU all rights reserved. Permission is granted to copy, use, and distribute for any commercial or noncommercial purpose under the terms of the GNU General Public license, version 2, June 1991 (see file : LICENSING). This file along with polyhedron.c and vector.c do the following functions: - Extraction of a minimal set of constraints from some set of constraints - Intersection of two convexes - Application of a linear function to some convex - Verification that a convex is included in some other convex They are compiled together into an executable file called "test". The file test.in contains sample input data for the program. The file test.out contains the output produced by the program. This directory also contains a makefile to build and run the test. This file is a tutorial on how to use the library. The comments explain whats going on. You can use this file as a pattern for your own program. Good Luck ! --Doran */ #include #include int main() { Matrix *a, *b, *t; Polyhedron *A, *B, *C, *D; printf("Polyhedral Library Test\n\n"); /* read in a matrix containing your equations */ /* for example, run this program and type in these five lines: 4 4 1 0 1 -1 1 -1 0 6 1 0 -1 7 1 1 0 -2 This is a matrix for the following inequalities 1 = inequality, 0x + 1y -1 >=0 --> y >= 1 1 = inequality, -1x + 0y +6 >=0 --> x <= 6 1 = inequality, 0x + -1y +7 >=0 --> y <= 7 1 = inequality, 1x + 0y -2 >=0 --> x >= 2 If the first number is a 0 instead of a 1, then that constraint is an 'equality' instead of an 'inequality'. */ a = Matrix_Read(); /* read in a second matrix containing a second set of constraints: for example : 4 4 1 1 0 -1 1 -1 0 3 1 0 -1 5 1 0 1 -2 */ b = Matrix_Read(); /* Convert the constraints to a Polyhedron. This operation 1. Computes the dual ray/vertice form of the system, and 2. Eliminates redundant constraints and reduces them to a minimal form. */ A = Constraints2Polyhedron(a, 200); B = Constraints2Polyhedron(b, 200); /* the 200 is the size of the working space (in terms of number of rays) that is allocated temporarily -- you can enlarge or reduce it as needed */ /* There is likewise a rays to polyhedron procedure */ /* Since you are done with the matrices a and b, be a good citizen and clean up your garbage */ Matrix_Free(a); Matrix_Free(b); /* If you want the the reduced set of equations back, you can either learn to read the polyhedron structure (not hard, look in "types.h"... or you can get the matrix back in the same format it started in... */ a = Polyhedron2Constraints(A); b = Polyhedron2Constraints(B); /* Take a look at them if you want */ printf("\na ="); Matrix_Print(stdout,P_VALUE_FMT,a); printf("\nb ="); Matrix_Print(stdout,P_VALUE_FMT,b); Matrix_Free(a); Matrix_Free(b); /* To intersect the two systems, use the polyhedron formats... */ C = DomainIntersection(A, B, 200); /* Again, the 200 is the size of the working space */ /* This time, lets look a the polyhedron itself... */ printf("\nC = A and B ="); Polyhedron_Print(stdout,P_VALUE_FMT,C); /* * The operations DomainUnion, DomainDifference, and DomainConvex * are also available */ /* * Read in a third matrix containing a transformation matrix, * this one swaps the indices (x,y --> y,x): * 3 3 * 0 1 0 * 1 0 0 * 0 0 1 */ t = Matrix_Read(); /* Take the preimage (transform the equations) of the domain C to get D. Are you catching on to this 200 thing yet ??? */ D = Polyhedron_Preimage(C, t, 200); /* cleanup please */ Matrix_Free(t); printf("\nD = transformed C ="); Polyhedron_Print(stdout,P_VALUE_FMT,D); Domain_Free(D); /* in a similar way, Polyhedron_Image(dom, mat, 200), takes the image of dom under matrix mat (transforms the vertices/rays) */ /* The function PolyhedronIncludes(Pol1, Pol2) returns 1 if Pol1 includes (covers) Pol2, and a 0 otherwise */ if (PolyhedronIncludes(A,C)) printf("\nWe expected A to cover C since C = A intersect B\n"); if (!PolyhedronIncludes(C,B)) printf("and C does not cover B...\n"); /* Final note: some functions are defined for Domains, others * for Polyhedrons. A domain is simply a list of polyhedrons. * Every polyhedron structure has a "next" pointer used to * make a list of polyhedrons... For instance, the union of * two disjoint polyhedra is a domain consisting of two polyhedra. * If you want the convex domain... you have to call * DomainConvex(Pol1, 200) explicity. * Note that includes does not work on domains, only on simple * polyhedrons... * Thats the end of the demo... write me if you have questions. * And remember to clean up... */ Domain_Free(A); Domain_Free(B); Domain_Free(C); return 0; } polylib-5.22.5.orig/applications/testehrhart.c0000644000175000017500000001534411341227526022301 0ustar sylvestresylvestre/***********************************************************************/ /* Ehrhart V4.20 */ /* copyright 1997, Doran Wilde */ /* copyright 1997-2000, Vincent Loechner */ /* Permission is granted to copy, use, and distribute */ /* for any commercial or noncommercial purpose under the terms */ /* of the GNU General Public license, version 2, June 1991 */ /* (see file : LICENSING). */ /***********************************************************************/ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include #include #include #include #include #include "config.h" #define EP_EVALUATION #ifndef HAVE_GETOPT_H #define getopt_long(a,b,c,d,e) getopt(a,b,c) #else #include struct option options[] = { { "homogenized", no_argument, 0, 'h' }, { 0, 0, 0, 0 } }; #endif #define WS 0 /** define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed */ #define EPRINT_ALL_VALIDITY_CONSTRAINTS /** The following are mainly for debug purposes. You shouldn't need to change anything for daily usage... */ /** you may define each macro independently
  1. #define EDEBUG minimal debug
  2. #define EDEBUG1 prints enumeration points
  3. #define EDEBUG11 prints number of points
  4. #define EDEBUG2 prints domains
  5. #define EDEBUG21 prints more domains
  6. #define EDEBUG3 prints systems of equations that are solved
  7. #define EDEBUG4 prints message for degree reduction
  8. #define EDEBUG5 prints result before simplification
  9. #define EDEBUG6 prints domains in Preprocess
  10. #define EDEBUG61 prints even more in Preprocess
  11. #define EDEBUG62 prints domains in Preprocess2
*/ /* #define EDEBUG */ /* minimal debug */ /* #define EDEBUG1 */ /* prints enumeration points */ /* #define EDEBUG11 */ /* prints number of points */ /* #define EDEBUG2 */ /* prints domains */ /* #define EDEBUG21 */ /* prints more domains */ /* #define EDEBUG3 */ /* prints systems of equations that are solved */ /* #define EDEBUG4 */ /* prints message for degree reduction */ /* #define EDEBUG5 */ /* prints result before simplification */ /* #define EDEBUG6 */ /* prints domains in Preprocess */ /* #define EDEBUG61 */ /* prints even more in Preprocess */ /* #define EDEBUG62 */ /* prints domains in Preprocess2 */ /** Reduce the degree of resulting polynomials */ #define REDUCE_DEGREE /** define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20 */ #define ALL_OVERFLOW_WARNINGS /** EPRINT : print results while computing the ehrhart polynomial. this is done by default if you build the executable ehrhart. (If EMAIN is defined). Don't define EMAIN here, it is defined when necessary in the makefile.

Notice: you may however define EPRINT without defining EMAIN, but in this case, you have to initialize the global variable param_name by calling Read_ParamNames before any call to ehrhart. This is NOT recommanded, unless you know what you do. EPRINT causes more debug messages to be printed. */ /* #define EPRINT */ int main(int argc, char **argv) { int i; char str[1024]; Matrix *C1, *P1; Polyhedron *C, *P; Enumeration *en; const char **param_name; int c, ind = 0; int hom = 0; #ifdef EP_EVALUATION Value *p, *tmp; int k; #endif while ((c = getopt_long(argc, argv, "h", options, &ind)) != -1) { switch (c) { case 'h': hom = 1; break; } } P1 = Matrix_Read(); C1 = Matrix_Read(); if(C1->NbColumns < 2) { fprintf( stderr, "Not enough parameters !\n" ); exit(0); } if (hom) { Matrix *C2, *P2; P2 = AddANullColumn(P1); Matrix_Free(P1); P1 = P2; C2 = AddANullColumn(C1); Matrix_Free(C1); C1 = C2; } P = Constraints2Polyhedron(P1,WS); C = Constraints2Polyhedron(C1,WS); Matrix_Free(P1); Matrix_Free(C1); /* Read the name of the parameters */ param_name = Read_ParamNames(stdin,C->Dimension - hom); if (hom) { const char **param_name2; param_name2 = (const char**)malloc(sizeof(char*) * (C->Dimension)); for (i = 0; i < C->Dimension - 1; i++) param_name2[i] = param_name[i]; param_name2[C->Dimension-1] = "_H"; free(param_name); param_name=param_name2; } en = Polyhedron_Enumerate(P,C,WS,param_name); if (hom) { Enumeration *en2; printf("inhomogeneous form:\n"); dehomogenize_enumeration(en, C->Dimension, WS); for (en2 = en; en2; en2 = en2->next) { Print_Domain(stdout, en2->ValidityDomain, param_name); print_evalue(stdout, &en2->EP, param_name); } } #ifdef EP_EVALUATION if( isatty(0) && C->Dimension != 0) { /* no tty input or no polyhedron -> no evaluation. */ printf("Evaluation of the Ehrhart polynomial :\n"); p = (Value *)malloc(sizeof(Value) * (C->Dimension)); for(i=0;iDimension;i++) value_init(p[i]); FOREVER { fflush(stdin); printf("Enter %d parameters : ",C->Dimension); for(k=0;kDimension;++k) { scanf("%s",str); value_read(p[k],str); } fprintf(stdout,"EP( "); value_print(stdout,VALUE_FMT,p[0]); for(k=1;kDimension;++k) { fprintf(stdout,","); value_print(stdout,VALUE_FMT,p[k]); } fprintf(stdout," ) = "); value_print(stdout,VALUE_FMT,*(tmp=compute_poly(en,p))); free(tmp); fprintf(stdout,"\n"); } } #endif /* EP_EVALUATION */ Enumeration_Free(en); Free_ParamNames(param_name, C->Dimension-hom); Polyhedron_Free( P ); Polyhedron_Free( C ); return 0; } polylib-5.22.5.orig/applications/verif_ehrhart.c0000644000175000017500000001650311341227526022572 0ustar sylvestresylvestre/*************************************************/ /* verif_ehrhart.c */ /* program to compare effective number of points */ /* in a polytope with the corresponding */ /* evaluation of the Ehrhart polynomial. */ /* Parameters vary in range -RANGE to RANGE */ /* (define below) by default. */ /* Can be overridden by specifying */ /* -r, or -m and -M */ /* */ /* written by Vincent Loechner (c) 2000. */ /* loechner@icps.u-strasbg.fr */ /*************************************************/ /* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include #include #include #include #define MAXRAYS 1024 /* define this to print all the results */ /* else, only a progress bar is printed */ /* #define PRINT_ALL_RESULTS */ /* define this to continue the test after first error found */ /* #define DONT_BREAK_ON_ERROR */ /* RANGE : normal range for evalutations (-RANGE -> RANGE) */ #define RANGE 50 /* SRANGE : small range for evalutations */ #define SRANGE 15 /* if dimension >= BIDDIM, use SRANGE */ #define BIGDIM 5 /* VSRANGE : very small range for evalutations */ #define VSRANGE 5 /* if dimension >= VBIDDIM, use VSRANGE */ #define VBIGDIM 8 Value min, max; #ifdef DONT_BREAK_ON_ERROR #define PRINT_ALL_RESULTS #endif #ifndef PRINT_ALL_RESULTS int st; #endif /****************************************************/ /* function check_poly : */ /* scans the parameter space from min to max (all */ /* directions). Computes the number of points in */ /* the polytope using both methods, and compare them*/ /* returns 1 on success */ /****************************************************/ int check_poly(Polyhedron *S,Polyhedron *C,Enumeration *en, int nparam,int pos,Value *z) { int cc,k; Value c,tmp,*ctmp; value_init(c); value_init(tmp); if(pos == nparam) { /* Computes the ehrhart polynomial */ value_assign(c,*(ctmp=compute_poly(en,&z[S->Dimension-nparam+1]))); free(ctmp); /* if c=0 we may be out of context. */ /* scanning is useless in this case*/ if(!in_domain(C,&z[S->Dimension-nparam+1])) { /* ok */ ; } else { #ifdef PRINT_ALL_RESULTS printf("EP( "); value_print(stdout,VALUE_FMT,z[S->Dimension-nparam+1]); for(k=S->Dimension-nparam+2;k<=S->Dimension;++k) { printf(", "); value_print(stdout,VALUE_FMT,z[k]); } printf(" ) = "); value_print(stdout,VALUE_FMT,c); printf(" "); #endif /* Count manually the number of points */ count_points(1,S,z,&tmp); #ifdef PRINT_ALL_RESULTS printf(", count = "); value_print(stdout, P_VALUE_FMT, tmp); printf(". "); #endif if(value_ne(tmp,c)) { printf("\n"); fflush(stdout); fprintf(stderr,"Error !\n"); fprintf(stderr,"EP( "); value_print(stderr,VALUE_FMT,z[S->Dimension-nparam+1]); for(k=S->Dimension-nparam+2;k<=S->Dimension;++k) { fprintf(stderr,", "); value_print(stderr,VALUE_FMT,z[k]); } fprintf(stderr," ) should be "); value_print(stderr,VALUE_FMT,tmp); fprintf(stderr,", while EP eval gives "); value_print(stderr,VALUE_FMT,c); fprintf(stderr,".\n"); #ifndef DONT_BREAK_ON_ERROR value_clear(c); value_clear(tmp); return(0); #endif } #ifdef PRINT_ALL_RESULTS else printf("OK.\n"); #endif } } else for(value_assign(tmp,min); value_le(tmp,max); value_increment(tmp,tmp)) { #ifndef PRINT_ALL_RESULTS k = VALUE_TO_INT(tmp); if(!pos && !(k%st)) { printf("o"); fflush(stdout); } #endif value_assign(z[pos+S->Dimension-nparam+1],tmp); if(!check_poly(S,C,en,nparam,pos+1,z)) { value_clear(c); value_clear(tmp); return(0); } } value_clear(c); value_clear(tmp); return(1); } /* check_poly */ int main(int argc,char *argv[]) { Matrix *C1, *P1; Polyhedron *C, *P, *S; Polyhedron *CC, *PP; Enumeration *en; Value *p, tmp; int i,j; int m,M; /******* Read the input *********/ P1 = Matrix_Read(); C1 = Matrix_Read(); if(C1->NbColumns < 2) { fprintf(stderr,"Not enough parameters !\n"); exit(0); } P = Constraints2Polyhedron(P1,MAXRAYS); C = Constraints2Polyhedron(C1,MAXRAYS); Matrix_Free(C1); Matrix_Free(P1); /******* Read the options: initialize min and max ********/ if(P->Dimension >= VBIGDIM) M = VSRANGE; else if(P->Dimension >= BIGDIM) M = SRANGE; else M = RANGE; m = -M; if(argc != 1 ) { for(i=1;i][-M<>][-r<>]\n",argv[0]); return(-1); } } } if(m > M) { fprintf(stderr,"Nothing to do: min > max !\n"); return(0); } value_init(min); value_init(max); value_set_si(min,m); value_set_si(max,M); value_init(tmp); /******* Compute true context *******/ CC = align_context(C,P->Dimension,MAXRAYS); PP = DomainIntersection(P,CC,MAXRAYS); Domain_Free(CC); C1 = Matrix_Alloc(C->Dimension+1,P->Dimension+1); for(i=0;iNbRows;i++) for(j=0;jNbColumns;j++) if(i==j-P->Dimension+C->Dimension) value_set_si(C1->p[i][j],1); else value_set_si(C1->p[i][j],0); CC = Polyhedron_Image(PP,C1,MAXRAYS); Domain_Free(C); C = CC; /******* Compute EP *********/ en = Polyhedron_Enumerate(P,C,MAXRAYS,NULL); /******* Initializations for check *********/ p = (Value *)malloc(sizeof(Value) * (P->Dimension+2)); for(i=0;i<=P->Dimension;i++) { value_init(p[i]); value_set_si(p[i],0); } value_init(p[i]); value_set_si(p[i],1); /* S = scanning list of polyhedra */ S = Polyhedron_Scan(P,C,MAXRAYS); #ifndef PRINT_ALL_RESULTS if(C->Dimension > 0) { value_subtract(tmp,max,min); if (VALUE_TO_INT(tmp) > 80) st = 1+(VALUE_TO_INT(tmp))/80; else st=1; for(i=VALUE_TO_INT(min);i<=VALUE_TO_INT(max);i+=st) printf("."); printf( "\r" ); fflush(stdout); } #endif /******* CHECK NOW *********/ if(S && !check_poly(S,C,en,C->Dimension,0,p)) { fprintf(stderr,"Check failed !\n"); for(i=0;i<=(P->Dimension+1);i++) value_clear(p[i]); value_clear(tmp); return(-1); } #ifndef PRINT_ALL_RESULTS printf( "\n" ); #endif for(i=0;i<=(P->Dimension+1);i++) value_clear(p[i]); value_clear(tmp); return(0); } /* main */ polylib-5.22.5.orig/NEWS0000644000175000017500000000000011341224570015564 0ustar sylvestresylvestrepolylib-5.22.5.orig/missing0000755000175000017500000002557711171075110016511 0ustar sylvestresylvestre#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2006-05-10.23 # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006 # Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). case $1 in lex|yacc) # Not GNU programs, they don't have --version. ;; tar) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $1 in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison|yacc) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex|flex) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit 1 fi ;; makeinfo) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case $firstarg in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case $firstarg in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: polylib-5.22.5.orig/ChangeLog0000644000175000017500000000000011341224604016635 0ustar sylvestresylvestrepolylib-5.22.5.orig/aclocal.m40000644000175000017500000010633011341231311016731 0ustar sylvestresylvestre# generated automatically by aclocal 1.11.1 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.65],, [m4_warning([this file was generated for autoconf 2.65. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.11' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.11.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.11.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 10 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 5 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 16 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The `parallel-tests' driver may need to know about EXEEXT, so add the dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Copyright (C) 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_PROG_CC_C_O # -------------- # Like AC_PROG_CC_C_O, but changed for automake. AC_DEFUN([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC_C_O])dnl AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl # FIXME: we rely on the cache variable name because # there is no other way. set dummy $CC am_cc=`echo $[2] | sed ['s/[^a-zA-Z0-9_]/_/g;s/^[0-9]/_/']` eval am_t=\$ac_cv_prog_cc_${am_cc}_c_o if test "$am_t" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi dnl Make sure AC_PROG_CC is never called again, or it will override our dnl setting of CC. m4_define([AC_PROG_CC], [m4_fatal([AC_PROG_CC cannot be called after AM_PROG_CC_C_O])]) ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # ------------------------------ # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ---------------------------------- # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. AM_MISSING_PROG([AMTAR], [tar]) m4_if([$1], [v7], [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/ax_create_pkgconfig_info.m4]) m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4]) polylib-5.22.5.orig/config.h.in0000644000175000017500000000442611341243105017123 0ustar sylvestresylvestre/* config.h.in. Generated from configure.in by autoheader. */ /* Define to 1 if you have the declaration of `mp_get_memory_functions', and to 0 if you don't. */ #undef HAVE_DECL_MP_GET_MEMORY_FUNCTIONS /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_GETOPT_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_LIMITS_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to the sub-directory in which libtool stores uninstalled libraries. */ #undef LT_OBJDIR /* Define to 1 if your C compiler doesn't accept -c and -o together. */ #undef NO_MINUS_C_MINUS_O /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* The size of `int', as computed by sizeof. */ #undef SIZEOF_INT /* The size of `long int', as computed by sizeof. */ #undef SIZEOF_LONG_INT /* The size of `long long int', as computed by sizeof. */ #undef SIZEOF_LONG_LONG_INT /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Version number of package */ #undef VERSION /* Define to empty if `const' does not conform to ANSI C. */ #undef const polylib-5.22.5.orig/config.guess0000755000175000017500000012753410756112266017442 0ustar sylvestresylvestre#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 # Free Software Foundation, Inc. timestamp='2008-01-23' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep __ELF__ >/dev/null then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm:riscos:*:*|arm:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[456]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep __LP64__ >/dev/null then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) case ${UNAME_MACHINE} in pc98) echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:[3456]*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; EM64T | authenticamd) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-gnu else echo ${UNAME_MACHINE}-unknown-linux-gnueabi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit ;; crisv32:Linux:*:*) echo crisv32-axis-linux-gnu exit ;; frv:Linux:*:*) echo frv-unknown-linux-gnu exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; mips:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips #undef mipsel #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mipsel #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips64 #undef mips64el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mips64el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips64 #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; or32:Linux:*:*) echo or32-unknown-linux-gnu exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-gnu exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-gnu exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep ld.so.1 >/dev/null if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-gnu exit ;; x86_64:Linux:*:*) echo x86_64-unknown-linux-gnu exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; a.out-i386-linux) echo "${UNAME_MACHINE}-pc-linux-gnuaout" exit ;; coff-i386) echo "${UNAME_MACHINE}-pc-linux-gnucoff" exit ;; "") # Either a pre-BFD a.out linker (linux-gnuoldld) or # one that does not give us useful --help. echo "${UNAME_MACHINE}-pc-linux-gnuoldld" exit ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) LIBC=gnu #else LIBC=gnuaout #endif #endif #ifdef __dietlibc__ LIBC=dietlibc #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^LIBC/{ s: ::g p }'`" test x"${LIBC}" != x && { echo "${UNAME_MACHINE}-pc-linux-${LIBC}" exit } test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i386. echo i386-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NSE-?:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: polylib-5.22.5.orig/COPYING0000644000175000017500000010451411341227526016143 0ustar sylvestresylvestre GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . polylib-5.22.5.orig/mp_get_memory_functions.c0000644000175000017500000000204111341227527022200 0ustar sylvestresylvestre/* This file is part of PolyLib. PolyLib is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. PolyLib is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with PolyLib. If not, see . */ #include void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)) { if (alloc_func_ptr) *alloc_func_ptr = __gmp_allocate_func; if (realloc_func_ptr) *realloc_func_ptr = __gmp_reallocate_func; if (free_func_ptr) *free_func_ptr = __gmp_free_func; } polylib-5.22.5.orig/compile0000755000175000017500000000727111341224534016464 0ustar sylvestresylvestre#! /bin/sh # Wrapper for compilers which do not understand `-c -o'. scriptversion=2009-10-06.20; # UTC # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2009 Free Software # Foundation, Inc. # Written by Tom Tromey . # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # This file is maintained in Automake, please report # bugs to or send patches to # . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand `-c -o'. Remove `-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file `INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; esac ofile= cfile= eat= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as `compile cc -o foo foo.c'. # So we strip `-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no `-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # `.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use `[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: polylib-5.22.5.orig/doc/0000755000175000017500000000000011253740764015656 5ustar sylvestresylvestrepolylib-5.22.5.orig/doc/codeDoc/0000755000175000017500000000000011303257450017205 5ustar sylvestresylvestrepolylib-5.22.5.orig/doc/codeDoc/html/0000755000175000017500000000000011303257450020151 5ustar sylvestresylvestrepolylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8h.html0000644000175000017500000012315311303257447023766 0ustar sylvestresylvestre polylib: Zpolyhedron.h File Reference

Zpolyhedron.h File Reference

Go to the source code of this file.

Functions

void CanonicalForm (ZPolyhedron *Zpol, ZPolyhedron **Result, Matrix **Basis)
ZPolyhedronEmptyZPolyhedron (int dimension)
ZPolyhedronIntegraliseLattice (ZPolyhedron *A)
Bool isEmptyZPolyhedron (ZPolyhedron *Zpol)
ZPolyhedronZDomainDifference (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainImage (ZPolyhedron *A, Matrix *Func)
Bool ZDomainIncludes (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainIntersection (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainPreimage (ZPolyhedron *A, Matrix *Func)
void ZDomainPrint (FILE *fp, const char *format, ZPolyhedron *A)
ZPolyhedronZDomainSimplify (ZPolyhedron *ZDom)
ZPolyhedronZDomainUnion (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomain_Copy (ZPolyhedron *Head)
void ZDomain_Free (ZPolyhedron *Head)
Bool ZPolyhedronIncludes (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZPolyhedron_Alloc (Lattice *Lat, Polyhedron *Poly)
ZPolyhedronSplitZpolyhedron (ZPolyhedron *ZPol, Lattice *B)

Function Documentation

Bool isEmptyZPolyhedron ( ZPolyhedron Zpol  ) 
ZPolyhedron* ZDomain_Copy ( ZPolyhedron Head  ) 
void ZDomain_Free ( ZPolyhedron Head  ) 
ZPolyhedron* ZDomainImage ( ZPolyhedron A,
Matrix Func 
)
Bool ZDomainIncludes ( ZPolyhedron A,
ZPolyhedron B 
)

Definition at line 289 of file Zpolyhedron.c.

References False, isEmptyZPolyhedron(), True, ZDomain_Free(), and ZDomainDifference().

void ZDomainPrint ( FILE *  fp,
const char *  format,
ZPolyhedron A 
)

Definition at line 338 of file Zpolyhedron.c.

References ZPolyhedron::next, ZDomainPrint(), and ZPolyhedronPrint().

Referenced by main(), and ZDomainPrint().

ZPolyhedron* ZDomainUnion ( ZPolyhedron A,
ZPolyhedron B 
)

Definition at line 374 of file Zpolyhedron.c.

References AddZPolytoZDomain(), and ZPolyhedron::next.

Referenced by main(), and ZDomainSimplify().

Bool ZPolyhedronIncludes ( ZPolyhedron A,
ZPolyhedron B 
)

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8c-source.html0000644000175000017500000040272011253740770025257 0ustar sylvestresylvestre polylib: Zpolyhedron.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x7a.html0000644000175000017500000001576611303257447023346 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- z -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8c-source.html0000644000175000017500000122421011253740767024402 0ustar sylvestresylvestre polylib: ehrhart.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x77.html0000644000175000017500000001041411303257450024250 0ustar sylvestresylvestre polylib: Class Members
Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x6f.html0000644000175000017500000000711711303257447024354 0ustar sylvestresylvestre polylib: Class Members
 

- o -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Vertex.html0000644000175000017500000001624411303257447025353 0ustar sylvestresylvestre polylib: _Param_Vertex Struct Reference

_Param_Vertex Struct Reference

#include <types.h>

List of all members.

Public Attributes

MatrixVertex
MatrixDomain
unsigned * Facets
struct _Param_Vertexnext

Detailed Description

Definition at line 141 of file types.h.


Member Data Documentation

Definition at line 147 of file types.h.

Referenced by GenParamPolyhedron(), Param_Vertices_Free(), and traite_m_face().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8h_source.html0000644000175000017500000001067511303257446025273 0ustar sylvestresylvestre polylib: NormalForms.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/types_8h.html0000644000175000017500000016722611303257447022626 0ustar sylvestresylvestre polylib: types.h File Reference

types.h File Reference

#include <gmp.h>
#include <limits.h>

Go to the source code of this file.

Classes

struct  Vector
struct  matrix
struct  polyhedron
struct  interval
struct  _Param_Vertex
struct  _Param_Domain
struct  _Param_Polyhedron
struct  _evalue
struct  _enode
struct  _enumeration
struct  LatticeUnion
struct  ZPolyhedron

Defines

#define FIRST_PARAMETER_NAME   'P'
#define PCHAR   (FIRST_PARAMETER_NAME-1)
#define MAXNOOFRAYS   200
#define P_VALUE_FMT   "%4s "
#define LB_INFINITY   1
#define UB_INFINITY   2
#define MSB   ((unsigned)(((unsigned)1)<<(sizeof(int)*8-1)))
#define TOP   ((int)(MSB-1))
#define NEXT(j, b)   { if (!((b)>>=1)) { (b)=MSB; (j)++; } }
#define POL_HIGH_BIT   (UINT_MAX - (UINT_MAX >> 1))
#define POL_NO_DUAL   (POL_HIGH_BIT | 0x0001)
#define POL_INTEGER   (POL_HIGH_BIT | 0x0002)
#define POL_ISSET(flags, f)   ((flags & f) == f)
#define FL_INIT(l, f)   (l) = (f)
#define FL_SET(l, f)   ((l) |= (f))
#define FL_CLR(l, f)   ((l) &= ~(f))
#define FL_ISSET(l, f)   ((l) & (f))
#define F_INIT(p, f)   FL_INIT((p)->flags, f)
#define F_SET(p, f)   FL_SET((p)->flags, f)
#define F_CLR(p, f)   FL_CLR((p)->flags, f)
#define F_ISSET(p, f)   FL_ISSET((p)->flags, f)
#define POL_INEQUALITIES   0x00000001
#define POL_FACETS   0x00000002
#define POL_POINTS   0x00000004
#define POL_VERTICES   0x00000008
#define POL_VALID   0x00000010
#define emptyQ(P)
#define universeQ(P)   (P->Dimension==P->NbBid)
#define FORALL_PVertex_in_ParamPolyhedron(_V, _D, _P)
#define END_FORALL_PVertex_in_ParamPolyhedron
#define POLY_UNION_OR_STRUCT   union
#define FOREVER   for(;;)

Typedefs

typedef struct matrix Matrix
typedef struct polyhedron Polyhedron
typedef struct interval Interval
typedef struct _Param_Vertex Param_Vertices
typedef struct _Param_Domain Param_Domain
typedef struct _Param_Polyhedron Param_Polyhedron
typedef struct _evalue evalue
typedef struct _enode enode
typedef struct _enumeration Enumeration
typedef Matrix Lattice

Enumerations

enum  enode_type { polynomial, periodic, evector }
enum  Bool { False = 0, True = 1 }

Variables

int Pol_status

Define Documentation

#define END_FORALL_PVertex_in_ParamPolyhedron
Value:
}                                \
              NEXT(_ix, _bx);                  \
      }                                        \
}

Definition at line 173 of file types.h.

Referenced by main().

#define F_CLR ( p,
 )     FL_CLR((p)->flags, f)

Definition at line 106 of file types.h.

Referenced by p_simplify_constraints().

#define F_INIT ( p,
 )     FL_INIT((p)->flags, f)

Definition at line 104 of file types.h.

#define F_ISSET ( p,
 )     FL_ISSET((p)->flags, f)

Definition at line 107 of file types.h.

Referenced by align_context(), Polyhedron_Compute_Dual(), and Polyhedron_Remove_parm_eqs().

#define F_SET ( p,
 )     FL_SET((p)->flags, f)
#define FIRST_PARAMETER_NAME   'P'

Definition at line 44 of file types.h.

#define FL_CLR ( l,
 )     ((l) &= ~(f))

Definition at line 101 of file types.h.

#define FL_INIT ( l,
 )     (l) = (f)

Definition at line 99 of file types.h.

Referenced by Polyhedron_Remove_parm_eqs().

#define FL_ISSET ( l,
 )     ((l) & (f))

Definition at line 102 of file types.h.

#define FL_SET ( l,
 )     ((l) |= (f))

Definition at line 100 of file types.h.

#define FORALL_PVertex_in_ParamPolyhedron ( _V,
_D,
_P   ) 
Value:
{     int _i, _ix;                                   \
      unsigned _bx;                                  \
      for( _i=0, _ix=0, _bx=MSB, _V=_P->V ;            \
           _V && (_i<_P->nbV) ; _i++, _V=_V->next )      \
      {       if (_D->F[_ix] & _bx)                   \
              {

Definition at line 165 of file types.h.

Referenced by main().

#define FOREVER   for(;;)

Definition at line 248 of file types.h.

Referenced by main().

#define LB_INFINITY   1

Definition at line 65 of file types.h.

Referenced by cherche_min(), lower_upper_bounds(), and P_Enum().

#define PCHAR   (FIRST_PARAMETER_NAME-1)

Definition at line 49 of file types.h.

Referenced by Read_ParamNames().

#define POL_FACETS   0x00000002
#define POL_HIGH_BIT   (UINT_MAX - (UINT_MAX >> 1))

Definition at line 81 of file types.h.

#define POL_INTEGER   (POL_HIGH_BIT | 0x0002)

Definition at line 83 of file types.h.

Referenced by Constraints2Polyhedron().

#define POL_ISSET ( flags,
 )     ((flags & f) == f)
#define POL_POINTS   0x00000004
#define POL_VERTICES   0x00000008
#define POLY_UNION_OR_STRUCT   union

Definition at line 186 of file types.h.

#define TOP   ((int)(MSB-1))

Definition at line 73 of file types.h.

#define UB_INFINITY   2

Definition at line 66 of file types.h.

Referenced by cherche_min(), lower_upper_bounds(), and P_Enum().

#define universeQ (  )     (P->Dimension==P->NbBid)

Definition at line 139 of file types.h.


Typedef Documentation

typedef struct _enode enode
typedef struct _enumeration Enumeration
typedef struct _evalue evalue
typedef struct interval Interval
typedef Matrix Lattice

Definition at line 235 of file types.h.

typedef struct matrix Matrix
typedef struct _Param_Domain Param_Domain
typedef struct _Param_Vertex Param_Vertices
typedef struct polyhedron Polyhedron

Enumeration Type Documentation

enum Bool
Enumerator:
False 
True 

Definition at line 234 of file types.h.

enum enode_type
Enumerator:
polynomial 
periodic 
evector 

Definition at line 181 of file types.h.


Variable Documentation

Definition at line 89 of file polyhedron.c.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__enode-members.html0000644000175000017500000000414111303257447025332 0ustar sylvestresylvestre polylib: Member List

_enode Member List

This is the complete list of members for _enode, including all inherited members.
arr_enode
pos_enode
size_enode
type_enode

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x6c.html0000644000175000017500000001026411303257450024326 0ustar sylvestresylvestre polylib: Class Members
 

- l -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8c-source.html0000644000175000017500000207652211253740767025144 0ustar sylvestresylvestre polylib: polyhedron.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x62.html0000644000175000017500000000740211303257447024265 0ustar sylvestresylvestre polylib: Class Members
 

- b -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8c-source.html0000644000175000017500000036021411253740767024255 0ustar sylvestresylvestre polylib: matrix.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x6b.html0000644000175000017500000000726611303257447023342 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- k -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structmatrix-members.html0000644000175000017500000000444011303257447025250 0ustar sylvestresylvestre polylib: Member List

matrix Member List

This is the complete list of members for matrix, including all inherited members.
NbColumnsmatrix
NbRowsmatrix
pmatrix
p_Initmatrix
p_Init_sizematrix

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x7a.html0000644000175000017500000001537611303257450024350 0ustar sylvestresylvestre polylib: Class Members
 

- z -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/param_8h.html0000644000175000017500000001062411303257447022547 0ustar sylvestresylvestre polylib: param.h File Reference

param.h File Reference

Go to the source code of this file.

Functions

const char ** Read_ParamNames (FILE *in, int m)
void Free_ParamNames (const char **params, int m)

Function Documentation

void Free_ParamNames ( const char **  params,
int  m 
)

Definition at line 81 of file param.c.

Referenced by main().

const char** Read_ParamNames ( FILE *  in,
int  m 
)

Definition at line 31 of file param.c.

References PCHAR, and s.

Referenced by main(), and Union_Read().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/tab_b.gif0000644000175000017500000000004311303257445021710 0ustar sylvestresylvestreGIF89a€„°Ç,D;polylib-5.22.5.orig/doc/codeDoc/html/Matop_8c-source.html0000644000175000017500000015222411253740767024031 0ustar sylvestresylvestre polylib: Matop.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8h.html0000644000175000017500000014173111303257447022757 0ustar sylvestresylvestre polylib: matrix.h File Reference

matrix.h File Reference

Go to the source code of this file.

Functions

MatrixMatrix_Alloc (unsigned NbRows, unsigned NbColumns)
void Matrix_Free (Matrix *Mat)
void Matrix_Extend (Matrix *Mat, unsigned NbRows)
void Matrix_Print (FILE *Dst, const char *Format, Matrix *Mat)
void Matrix_Read_Input (Matrix *Mat)
MatrixMatrix_Read (void)
void right_hermite (Matrix *A, Matrix **Hp, Matrix **Up, Matrix **Qp)
void left_hermite (Matrix *A, Matrix **Hp, Matrix **Qp, Matrix **Up)
int MatInverse (Matrix *M, Matrix *MInv)
void rat_prodmat (Matrix *S, Matrix *X, Matrix *P)
void Matrix_Vector_Product (Matrix *mat, Value *p1, Value *p2)
void Vector_Matrix_Product (Value *p1, Matrix *mat, Value *p2)
void Matrix_Product (Matrix *mat1, Matrix *mat2, Matrix *mat3)
int Matrix_Inverse (Matrix *Mat, Matrix *MatInv)

Function Documentation

Matrix* Matrix_Alloc ( unsigned  NbRows,
unsigned  NbColumns 
)

Definition at line 45 of file matrix.c.

References errormsg1(), matrix::NbColumns, matrix::NbRows, matrix::p, p, matrix::p_Init, matrix::p_Init_size, and value_alloc().

Referenced by AddANullColumn(), AddANullRow(), AddConstraints(), AddRays(), AddZPolytoZDomain(), affine_periods(), AffineSmith(), CalcBase(), CanonicalForm(), ChangeLatticeDimension(), ComputeNPLinesRays(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_Remove_parm_eqs(), Constraints_removeElimCols(), ConvertDarMattoPolMat(), dehomogenize_polyhedron(), DomainSimplify(), Elim_Columns(), eliminable_vars(), EmptyLattice(), Enumeration_zero(), Equalities_integerSolution(), Equalities_intModBasis(), ExtractLinearPart(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), GenParamPolyhedron(), Identity(), Identity_Matrix(), int_ker(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeImage(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), main(), MakeDioEqforInter(), Matrix_Copy(), Matrix_Read(), Matrix_subMatrix(), mpolyhedron_compress_last_vars(), mpolyhedron_permute(), mtransformation_inverse(), mtransformation_permute(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), Polyhedron2Constraints(), Polyhedron2Rays(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Scan(), PolyhedronLTQ(), PreElim_Columns(), Rays2Polyhedron(), RearrangeMatforSolveDio(), Recession_Cone(), RemoveColumn(), RemoveNColumns(), RemoveRow(), right_hermite(), SimplifyConstraints(), SimplifyEqualities(), SolveDiophantine(), split_constraints(), Stras_DomainSimplify(), SubConstraint(), test_Constraints_fullDimensionize(), traite_m_face(), Transpose(), Union_Read(), valuesWithoutElim(), and VertexCT().

void Matrix_Extend ( Matrix Mat,
unsigned  NbRows 
)
void Matrix_Free ( Matrix Mat  ) 

Definition at line 92 of file matrix.c.

References matrix::p, matrix::p_Init, matrix::p_Init_size, and value_free().

Referenced by AddConstraints(), AddLattice(), AddRays(), AddZPolytoZDomain(), AffineHermite(), AffineSmith(), CanonicalForm(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_Remove_parm_eqs(), dehomogenize_polyhedron(), DomainSimplify(), Ehrhart_Quick_Apx(), Elim_Columns(), eliminable_vars(), EmptyZPolyhedron(), Enumeration_zero(), Equalities_integerSolution(), Equalities_intModBasis(), Equalities_validityLattice(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), Hermite(), homogenize(), int_ker(), IntegraliseLattice(), isfulldim(), isinHnf(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeDifference(), LatticeImage(), LatticeIncludes(), LatticeIntersection(), LatticePreimage(), LatticeUnion_Free(), left_hermite(), LexSmaller(), linearInter(), main(), mpolyhedron_compress_last_vars(), mtransformation_inverse(), old_Polyhedron_Preprocess(), P_Enum(), Param_Polyhedron_Free(), Param_Polyhedron_Scale_Integer(), Param_Vertices_Free(), Polyhedron_Enumerate(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Remove_parm_eqs(), Polyhedron_Scan(), PolyhedronLTQ(), Rays2Polyhedron(), RearrangeMatforSolveDio(), Recession_Cone(), sameLattice(), Scan_Vertices(), Simplify(), SimplifyConstraints(), SimplifyEqualities(), Smith(), SolveDiophantine(), SplitZpolyhedron(), Stras_DomainSimplify(), SubConstraint(), test_Constraints_fullDimensionize(), test_Constraints_Remove_parm_eqs(), test_Polyhedron_Remove_parm_eqs(), Union_Read(), ZPolyhedron_Free(), ZPolyhedronDifference(), ZPolyhedronImage(), ZPolyhedronIntersection(), and ZPolyhedronPreimage().

Matrix* Matrix_Read ( void   ) 

Definition at line 203 of file matrix.c.

References errormsg1(), Matrix_Alloc(), Matrix_Read_Input(), and s.

Referenced by main(), and Union_Read().

void Matrix_Read_Input ( Matrix Mat  ) 

Definition at line 166 of file matrix.c.

References errormsg1(), n, matrix::NbColumns, matrix::NbRows, p, matrix::p_Init, s, and value_read.

Referenced by Matrix_Read(), and Union_Read().

void Matrix_Vector_Product ( Matrix mat,
Value *  p1,
Value *  p2 
)

Definition at line 785 of file matrix.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, and value_multiply.

void right_hermite ( Matrix A,
Matrix **  Hp,
Matrix **  Up,
Matrix **  Qp 
)
void Vector_Matrix_Product ( Value *  p1,
Matrix mat,
Value *  p2 
)

Definition at line 817 of file matrix.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, and value_multiply.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x65.html0000644000175000017500000001100511303257450024242 0ustar sylvestresylvestre polylib: Class Members
 

- e -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib64_8h.html0000644000175000017500000000452511303257447023276 0ustar sylvestresylvestre polylib: polylib64.h File Reference

polylib64.h File Reference

#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define POLYLIB_BITS   64

Define Documentation

#define POLYLIB_BITS   64

Definition at line 18 of file polylib64.h.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x74.html0000644000175000017500000000770311303257450024254 0ustar sylvestresylvestre polylib: Class Members
Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Matop_8c_source.html0000644000175000017500000015707011303257445024107 0ustar sylvestresylvestre polylib: Matop.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__sep_8c-source.html0000644000175000017500000001474711253740766027157 0ustar sylvestresylvestre polylib: disjoint_union_sep.c Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8h-source.html0000644000175000017500000004023311253740767025562 0ustar sylvestresylvestre polylib: matrix_addon.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x63.html0000644000175000017500000002033411303257447024265 0ustar sylvestresylvestre polylib: Class Members
 

- c -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x63.html0000644000175000017500000000761411303257450024253 0ustar sylvestresylvestre polylib: Class Members
 

- c -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x72.html0000644000175000017500000001557011303257447023260 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- r -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetique_8h_source.html0000644000175000017500000027604511303257445031142 0ustar sylvestresylvestre polylib: arithmetique.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/example_8c_source.html0000644000175000017500000002077611303257445024464 0ustar sylvestresylvestre polylib: example.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x65.html0000644000175000017500000002547711303257447023271 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- e -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8c-source.html0000644000175000017500000005323211253740767025553 0ustar sylvestresylvestre polylib: eval_ehrhart.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8c.html0000644000175000017500000015155611303257447022760 0ustar sylvestresylvestre polylib: matrix.c File Reference

matrix.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

MatrixMatrix_Alloc (unsigned NbRows, unsigned NbColumns)
void Matrix_Free (Matrix *Mat)
void Matrix_Extend (Matrix *Mat, unsigned NbRows)
void Matrix_Print (FILE *Dst, const char *Format, Matrix *Mat)
void Matrix_Read_Input (Matrix *Mat)
MatrixMatrix_Read (void)
static int hermite (Matrix *H, Matrix *U, Matrix *Q)
void right_hermite (Matrix *A, Matrix **Hp, Matrix **Up, Matrix **Qp)
void left_hermite (Matrix *A, Matrix **Hp, Matrix **Qp, Matrix **Up)
int MatInverse (Matrix *Mat, Matrix *MatInv)
void rat_prodmat (Matrix *S, Matrix *X, Matrix *P)
void Matrix_Vector_Product (Matrix *Mat, Value *p1, Value *p2)
void Vector_Matrix_Product (Value *p1, Matrix *Mat, Value *p2)
void Matrix_Product (Matrix *Mat1, Matrix *Mat2, Matrix *Mat3)
int Matrix_Inverse (Matrix *Mat, Matrix *MatInv)

Function Documentation

Matrix* Matrix_Alloc ( unsigned  NbRows,
unsigned  NbColumns 
)

Definition at line 45 of file matrix.c.

References errormsg1(), matrix::NbColumns, matrix::NbRows, matrix::p, p, matrix::p_Init, matrix::p_Init_size, and value_alloc().

Referenced by AddANullColumn(), AddANullRow(), AddConstraints(), AddRays(), AddZPolytoZDomain(), affine_periods(), AffineSmith(), CalcBase(), CanonicalForm(), ChangeLatticeDimension(), ComputeNPLinesRays(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_Remove_parm_eqs(), Constraints_removeElimCols(), ConvertDarMattoPolMat(), dehomogenize_polyhedron(), DomainSimplify(), Elim_Columns(), eliminable_vars(), EmptyLattice(), Enumeration_zero(), Equalities_integerSolution(), Equalities_intModBasis(), ExtractLinearPart(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), GenParamPolyhedron(), Identity(), Identity_Matrix(), int_ker(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeImage(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), main(), MakeDioEqforInter(), Matrix_Copy(), Matrix_Read(), Matrix_subMatrix(), mpolyhedron_compress_last_vars(), mpolyhedron_permute(), mtransformation_inverse(), mtransformation_permute(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), Polyhedron2Constraints(), Polyhedron2Rays(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Scan(), PolyhedronLTQ(), PreElim_Columns(), Rays2Polyhedron(), RearrangeMatforSolveDio(), Recession_Cone(), RemoveColumn(), RemoveNColumns(), RemoveRow(), right_hermite(), SimplifyConstraints(), SimplifyEqualities(), SolveDiophantine(), split_constraints(), Stras_DomainSimplify(), SubConstraint(), test_Constraints_fullDimensionize(), traite_m_face(), Transpose(), Union_Read(), valuesWithoutElim(), and VertexCT().

void Matrix_Extend ( Matrix Mat,
unsigned  NbRows 
)
void Matrix_Free ( Matrix Mat  ) 

Definition at line 92 of file matrix.c.

References matrix::p, matrix::p_Init, matrix::p_Init_size, and value_free().

Referenced by AddConstraints(), AddLattice(), AddRays(), AddZPolytoZDomain(), AffineHermite(), AffineSmith(), CanonicalForm(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_Remove_parm_eqs(), dehomogenize_polyhedron(), DomainSimplify(), Ehrhart_Quick_Apx(), Elim_Columns(), eliminable_vars(), EmptyZPolyhedron(), Enumeration_zero(), Equalities_integerSolution(), Equalities_intModBasis(), Equalities_validityLattice(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), Hermite(), homogenize(), int_ker(), IntegraliseLattice(), isfulldim(), isinHnf(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeDifference(), LatticeImage(), LatticeIncludes(), LatticeIntersection(), LatticePreimage(), LatticeUnion_Free(), left_hermite(), LexSmaller(), linearInter(), main(), mpolyhedron_compress_last_vars(), mtransformation_inverse(), old_Polyhedron_Preprocess(), P_Enum(), Param_Polyhedron_Free(), Param_Polyhedron_Scale_Integer(), Param_Vertices_Free(), Polyhedron_Enumerate(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Remove_parm_eqs(), Polyhedron_Scan(), PolyhedronLTQ(), Rays2Polyhedron(), RearrangeMatforSolveDio(), Recession_Cone(), sameLattice(), Scan_Vertices(), Simplify(), SimplifyConstraints(), SimplifyEqualities(), Smith(), SolveDiophantine(), SplitZpolyhedron(), Stras_DomainSimplify(), SubConstraint(), test_Constraints_fullDimensionize(), test_Constraints_Remove_parm_eqs(), test_Polyhedron_Remove_parm_eqs(), Union_Read(), ZPolyhedron_Free(), ZPolyhedronDifference(), ZPolyhedronImage(), ZPolyhedronIntersection(), and ZPolyhedronPreimage().

Matrix* Matrix_Read ( void   ) 

Definition at line 203 of file matrix.c.

References errormsg1(), Matrix_Alloc(), Matrix_Read_Input(), and s.

Referenced by main(), and Union_Read().

void Matrix_Read_Input ( Matrix Mat  ) 

Definition at line 166 of file matrix.c.

References errormsg1(), n, matrix::NbColumns, matrix::NbRows, p, matrix::p_Init, s, and value_read.

Referenced by Matrix_Read(), and Union_Read().

void Matrix_Vector_Product ( Matrix Mat,
Value *  p1,
Value *  p2 
)

Definition at line 785 of file matrix.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, and value_multiply.

void right_hermite ( Matrix A,
Matrix **  Hp,
Matrix **  Up,
Matrix **  Qp 
)
void Vector_Matrix_Product ( Value *  p1,
Matrix Mat,
Value *  p2 
)

Definition at line 817 of file matrix.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, and value_multiply.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x6e.html0000644000175000017500000000667011303257450024336 0ustar sylvestresylvestre polylib: Class Members
 

- n -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8c_source.html0000644000175000017500000005714211303257445025631 0ustar sylvestresylvestre polylib: eval_ehrhart.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testlib_8c.html0000644000175000017500000000637311303257447023116 0ustar sylvestresylvestre polylib: testlib.c File Reference

testlib.c File Reference

#include <stdio.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main ()

Function Documentation


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8h.html0000644000175000017500000013330011303257446023100 0ustar sylvestresylvestre polylib: ehrhart.h File Reference

ehrhart.h File Reference

Go to the source code of this file.

Functions

void count_points (int pos, Polyhedron *P, Value *context, Value *res)
 PROCEDURES TO COMPUTE ENUMERATION.
void eadd (evalue *e1, evalue *res)
 adds one evalue to evalue 'res.
enodeecopy (enode *e)
void edot (enode *v1, enode *v2, evalue *res)
 computes the inner product of two vectors.
enodenew_enode (enode_type type, int size, int pos)
 EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.
void free_evalue_refs (evalue *e)
 releases all memory referenced by e.
EnumerationPolyhedron_Enumerate (Polyhedron *P, Polyhedron *C, unsigned MAXRAYS, const char **pname)
 Procedure to count points in a parameterized polytope.
void print_enode (FILE *DST, enode *p, const char **pname)
 prints the enode to DST
void print_evalue (FILE *DST, evalue *e, const char **pname)
void reduce_evalue (evalue *e)
void Enumeration_Free (Enumeration *en)
EnumerationEhrhart_Quick_Apx (Matrix *M, Matrix *C, Matrix **Validity_Lattice, unsigned MAXRAYS)
 Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.
EnumerationEnumeration_zero (unsigned int nbParms, unsigned int maxRays)
 returns a constant Ehrhart polynomial whose value is zero for any value of the parameters.

Function Documentation

void count_points ( int  pos,
Polyhedron P,
Value *  context,
Value *  res 
)

PROCEDURES TO COMPUTE ENUMERATION.

recursive procedure, recurse for each imbriquation

Parameters:
pos index position of current loop index (1..hdim-1)
P loop domain
context context values for fixed indices
res the number of integer points in this polyhedron

Definition at line 1145 of file ehrhart.c.

References count_points(), emptyQ, lower_upper_bounds(), polyhedron::next, P_VALUE_FMT, POL_ENSURE_FACETS, POL_ENSURE_VERTICES, value_add_int, value_addto, value_assign, value_clear, value_increment, value_init, value_le, value_lt, value_notmone_p, value_print, value_set_si, and value_subtract.

Referenced by check_poly(), count_points(), Enumerate_NoParameters(), and P_Enum().

void eadd ( evalue e1,
evalue res 
)

adds one evalue to evalue 'res.

result = res + e1

Parameters:
e1 an evalue
res 

Definition at line 410 of file ehrhart.c.

References _enode::arr, _evalue::d, eadd(), ecopy(), free_evalue_refs(), periodic, polynomial, value_addto, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_notone_p, value_notzero_p, and value_zero_p.

Referenced by eadd(), and edot().

enode* ecopy ( enode e  ) 
Parameters:
e pointer to an evalue
Returns:
description

Definition at line 167 of file ehrhart.c.

References _enode::arr, _evalue::d, ecopy(), new_enode(), _enode::pos, _enode::size, _enode::type, value_assign, value_init, and value_zero_p.

Referenced by Domain_Enumerate(), eadd(), ecopy(), and new_eadd().

void edot ( enode v1,
enode v2,
evalue res 
)

computes the inner product of two vectors.

Result = result (evalue) = v1.v2 (dot product)

Parameters:
v1 an enode (vector)
v2 an enode (vector of constants)
res result (evalue)

Definition at line 526 of file ehrhart.c.

References _enode::arr, _evalue::d, eadd(), emul(), evector, free_evalue_refs(), _enode::size, _enode::type, value_init, and value_set_si.

Referenced by P_Enum().

Enumeration* Ehrhart_Quick_Apx ( Matrix M,
Matrix C,
Matrix **  Validity_Lattice,
unsigned  maxRays 
)

Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.

Parameters:
M a polyhedron under implicit form
C M's context under implicit form
Validity_Lattice a pointer to the parameter's validity lattice
MAXRAYS the needed "working space" for other polylib functions used here
param_name the names of the parameters,

Definition at line 2635 of file ehrhart.c.

References Constraints2Polyhedron(), Ehrhart_Quick_Apx_Full_Dim(), full_dimensionize(), Matrix_Free(), mpolyhedron_compress_last_vars(), matrix::NbColumns, Polyhedron_Free(), and show_matrix.

Referenced by Constraints_EhrhartQuickApx(), and main().

void Enumeration_Free ( Enumeration en  ) 
Enumeration* Enumeration_zero ( unsigned int  nbParms,
unsigned int  maxRays 
)

returns a constant Ehrhart polynomial whose value is zero for any value of the parameters.

Parameters:
nbParms the number of parameters, i.e., the number of arguments to the Ehrhart polynomial

Definition at line 2732 of file ehrhart.c.

References Constraints2Polyhedron(), Matrix_Alloc(), Matrix_Free(), matrix::p, Polyhedron_Enumerate(), Polyhedron_Free(), Universe_Polyhedron(), and value_set_si.

Referenced by test_Constraints_fullDimensionize().

void free_evalue_refs ( evalue e  ) 

releases all memory referenced by e.

(recursive)

Parameters:
e pointer to an evalue

Definition at line 139 of file ehrhart.c.

References _enode::arr, _evalue::d, free_evalue_refs(), p, _enode::size, value_clear, and value_notzero_p.

Referenced by dehomogenize_evalue(), Domain_Enumerate(), eadd(), edot(), Enumeration_Free(), free_evalue_refs(), main(), P_Enum(), and reduce_evalue().

enode* new_enode ( enode_type  type,
int  size,
int  pos 
)

EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.

The newly allocated enode can be freed with a simple free(x)

Parameters:
type : enode type
size : degree+1 for polynomial, period for periodic
pos : 1..nb_param, position of parameter
Returns:
a newly allocated enode

Definition at line 114 of file ehrhart.c.

References _enode::arr, _evalue::d, _enode::pos, _enode::size, _enode::type, value_init, and value_set_si.

Referenced by ecopy(), emul(), Enumerate_NoParameters(), new_eadd(), and P_Enum().

Enumeration* Polyhedron_Enumerate ( Polyhedron Pi,
Polyhedron C,
unsigned  MAXRAYS,
const char **  param_name 
)

Procedure to count points in a parameterized polytope.

Parameters:
Pi Polyhedron to enumerate
C Context Domain
MAXRAYS size of workspace
param_name parameter names (array of strings), may be NULL
Returns:
a list of validity domains + evalues EP

Definition at line 1860 of file ehrhart.c.

References addeliminatedparams_evalue(), assert, CATCH, _Param_Polyhedron::D, _evalue::d, dehomogenize_evalue(), polyhedron::Dimension, _Param_Domain::Domain, Domain_Free(), DomainIntersection(), DomainSimplify(), emptyQ, Enumerate_NoParameters(), _enumeration::EP, _Param_Domain::F, homogenize(), Matrix_Free(), polyhedron::NbBid, matrix::NbColumns, polyhedron::NbEq, polyhedron::NbRays, matrix::NbRows, _Param_Domain::next, _enumeration::next, overflow_error, overflow_warning_flag, P_Enum(), P_VALUE_FMT, Param_Polyhedron_Free(), Param_Vertices_Free(), POL_ENSURE_FACETS, POL_ENSURE_VERTICES, POL_ISSET, POL_NO_DUAL, Polyhedron2Param_SimplifiedDomain(), Polyhedron_Free(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Print(), Polyhedron_Scan(), PolyhedronIncludes(), Print_Domain(), print_evalue(), polyhedron::Ray, reduce_evalue(), Scan_Vertices(), TRY, UNCATCH, Universe_Polyhedron(), _Param_Polyhedron::V, _enumeration::ValidityDomain, value_addto, value_clear, value_init, value_multiply, value_notzero_p, value_print, value_set_si, value_zero_p, and Vector_Set().

Referenced by Domain_Enumerate(), Enumeration_zero(), main(), and test_Constraints_fullDimensionize().

void print_enode ( FILE *  DST,
enode p,
const char **  pname 
)

prints the enode to DST

Parameters:
DST destination file
p pointer to enode to be printed
pname array of strings, name of the parameters

Definition at line 216 of file ehrhart.c.

References _enode::arr, evector, periodic, polynomial, _enode::pos, print_evalue(), _enode::size, and _enode::type.

Referenced by P_Enum(), and print_evalue().

void print_evalue ( FILE *  DST,
evalue e,
const char **  pname 
)
Parameters:
DST destination file
e pointer to evalue to be printed
pname array of strings, name of the parameters

Definition at line 192 of file ehrhart.c.

References _evalue::d, print_enode(), value_notone_p, value_notzero_p, and value_print.

Referenced by compute_poly(), Ehrhart_Quick_Apx_Full_Dim(), Enumerate_NoParameters(), main(), P_Enum(), Polyhedron_Enumerate(), print_enode(), and test_Constraints_fullDimensionize().

void reduce_evalue ( evalue e  ) 

Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals.html0000644000175000017500000000777211303257447022505 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- _ -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8h-source.html0000644000175000017500000000571311253740767025561 0ustar sylvestresylvestre polylib: eval_ehrhart.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x70.html0000644000175000017500000004634611303257447023263 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- p -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/alpha_8h-source.html0000644000175000017500000001052211253740766024034 0ustar sylvestresylvestre polylib: alpha.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/tree.html0000644000175000017500000006356611303257450022016 0ustar sylvestresylvestre TreeView polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8h-source.html0000644000175000017500000000464511253740770024477 0ustar sylvestresylvestre polylib: SolveDio.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x68.html0000644000175000017500000001101611303257447023254 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- h -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8h_source.html0000644000175000017500000001042311303257446024547 0ustar sylvestresylvestre polylib: SolveDio.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structSatMatrix.html0000644000175000017500000002227311303257447024234 0ustar sylvestresylvestre polylib: SatMatrix Struct Reference

SatMatrix Struct Reference

List of all members.

Public Attributes

unsigned int NbRows
unsigned int NbColumns
int ** p
int * p_init
unsigned int ** p
unsigned int * p_init

Detailed Description

Definition at line 99 of file polyhedron.c.


Member Data Documentation

unsigned int SatMatrix::NbColumns

Definition at line 101 of file polyhedron.c.

Referenced by Chernikova(), Remove_Redundants(), SMAlloc(), and SMPrint().

unsigned int** SatMatrix::p

Definition at line 225 of file polyparam.c.

unsigned int* SatMatrix::p_init

Definition at line 226 of file polyparam.c.


The documentation for this struct was generated from the following files:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/tabs.css0000644000175000017500000000346411303257445021627 0ustar sylvestresylvestre/* tabs styles, based on http://www.alistapart.com/articles/slidingdoors */ DIV.tabs { float : left; width : 100%; background : url("tab_b.gif") repeat-x bottom; margin-bottom : 4px; } DIV.tabs UL { margin : 0px; padding-left : 10px; list-style : none; } DIV.tabs LI, DIV.tabs FORM { display : inline; margin : 0px; padding : 0px; } DIV.tabs FORM { float : right; } DIV.tabs A { float : left; background : url("tab_r.gif") no-repeat right top; border-bottom : 1px solid #84B0C7; font-size : 80%; font-weight : bold; text-decoration : none; } DIV.tabs A:hover { background-position: 100% -150px; } DIV.tabs A:link, DIV.tabs A:visited, DIV.tabs A:active, DIV.tabs A:hover { color: #1A419D; } DIV.tabs SPAN { float : left; display : block; background : url("tab_l.gif") no-repeat left top; padding : 5px 9px; white-space : nowrap; } DIV.tabs #MSearchBox { float : right; display : inline; font-size : 1em; } DIV.tabs TD { font-size : 80%; font-weight : bold; text-decoration : none; } /* Commented Backslash Hack hides rule from IE5-Mac \*/ DIV.tabs SPAN {float : none;} /* End IE5-Mac hack */ DIV.tabs A:hover SPAN { background-position: 0% -150px; } DIV.tabs LI.current A { background-position: 100% -150px; border-width : 0px; } DIV.tabs LI.current SPAN { background-position: 0% -150px; padding-bottom : 6px; } DIV.navpath { background : none; border : none; border-bottom : 1px solid #84B0C7; text-align : center; margin : 2px; padding : 2px; } polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetique_8h-source.html0000644000175000017500000027207311253740766030376 0ustar sylvestresylvestre polylib: arithmetique.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ftv2node.png0000644000175000017500000000035311303257450022407 0ustar sylvestresylvestre‰PNG  IHDRLƒ1Ù0PLTEÿÿÿ€€€Ó tRNS@æØftEXtSoftwaregif2png 2.4.2£^G&tEXtCommentUlead GIF SmartSaver Ver 2.0io?ÍIDATxÚc`0ÀO ˆVŒÂ.RâúE:áIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8h-source.html0000644000175000017500000000743011253740767026006 0ustar sylvestresylvestre polylib: homogenization.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Polyhedron-members.html0000644000175000017500000000475711303257447027657 0ustar sylvestresylvestre polylib: Member List

_Param_Polyhedron Member List

This is the complete list of members for _Param_Polyhedron, including all inherited members.
Constraints_Param_Polyhedron
D_Param_Polyhedron
nbV_Param_Polyhedron
Rays_Param_Polyhedron
V_Param_Polyhedron

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x73.html0000644000175000017500000001647711303257450024275 0ustar sylvestresylvestre polylib: Class Members
 

- s -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/doxygen.css0000644000175000017500000001473311303257445022354 0ustar sylvestresylvestre/* The standard CSS for doxygen */ body, table, div, p, dl { font-family: Lucida Grande, Verdana, Geneva, Arial, sans-serif; font-size: 12px; } /* @group Heading Levels */ h1 { text-align: center; font-size: 150%; } h2 { font-size: 120%; } h3 { font-size: 100%; } dt { font-weight: bold; } div.multicol { -moz-column-gap: 1em; -webkit-column-gap: 1em; -moz-column-count: 3; -webkit-column-count: 3; } p.startli, p.startdd { margin-top: 2px; } p.endli { margin-bottom: 0px; } p.enddd { margin-bottom: 4px; } /* @end */ caption { font-weight: bold; } span.legend { font-size: 70%; text-align: center; } div.qindex, div.navtab{ background-color: #e8eef2; border: 1px solid #84b0c7; text-align: center; margin: 2px; padding: 2px; } div.qindex, div.navpath { width: 100%; line-height: 140%; } div.navtab { margin-right: 15px; } /* @group Link Styling */ a { color: #153788; font-weight: normal; text-decoration: none; } .contents a:visited { color: #1b77c5; } a:hover { text-decoration: underline; } a.qindex { font-weight: bold; } a.qindexHL { font-weight: bold; background-color: #6666cc; color: #ffffff; border: 1px double #9295C2; } .contents a.qindexHL:visited { color: #ffffff; } a.el { font-weight: bold; } a.elRef { } a.code { } a.codeRef { } /* @end */ dl.el { margin-left: -1cm; } .fragment { font-family: monospace, fixed; font-size: 105%; } pre.fragment { border: 1px solid #CCCCCC; background-color: #f5f5f5; padding: 4px 6px; margin: 4px 8px 4px 2px; } div.ah { background-color: black; font-weight: bold; color: #ffffff; margin-bottom: 3px; margin-top: 3px } div.groupHeader { margin-left: 16px; margin-top: 12px; margin-bottom: 6px; font-weight: bold; } div.groupText { margin-left: 16px; font-style: italic; } body { background: white; color: black; margin-right: 20px; margin-left: 20px; } td.indexkey { background-color: #e8eef2; font-weight: bold; border: 1px solid #CCCCCC; margin: 2px 0px 2px 0; padding: 2px 10px; } td.indexvalue { background-color: #e8eef2; border: 1px solid #CCCCCC; padding: 2px 10px; margin: 2px 0px; } tr.memlist { background-color: #f0f0f0; } p.formulaDsp { text-align: center; } img.formulaDsp { } img.formulaInl { vertical-align: middle; } div.center { text-align: center; margin-top: 0px; margin-bottom: 0px; padding: 0px; } div.center img { border: 0px; } img.footer { border: 0px; vertical-align: middle; } /* @group Code Colorization */ span.keyword { color: #008000 } span.keywordtype { color: #604020 } span.keywordflow { color: #e08000 } span.comment { color: #800000 } span.preprocessor { color: #806020 } span.stringliteral { color: #002080 } span.charliteral { color: #008080 } span.vhdldigit { color: #ff00ff } span.vhdlchar { color: #000000 } span.vhdlkeyword { color: #700070 } span.vhdllogic { color: #ff0000 } /* @end */ .search { color: #003399; font-weight: bold; } form.search { margin-bottom: 0px; margin-top: 0px; } input.search { font-size: 75%; color: #000080; font-weight: normal; background-color: #e8eef2; } td.tiny { font-size: 75%; } .dirtab { padding: 4px; border-collapse: collapse; border: 1px solid #84b0c7; } th.dirtab { background: #e8eef2; font-weight: bold; } hr { height: 0; border: none; border-top: 1px solid #666; } /* @group Member Descriptions */ .mdescLeft, .mdescRight, .memItemLeft, .memItemRight, .memTemplItemLeft, .memTemplItemRight, .memTemplParams { background-color: #FAFAFA; border: none; margin: 4px; padding: 1px 0 0 8px; } .mdescLeft, .mdescRight { padding: 0px 8px 4px 8px; color: #555; } .memItemLeft, .memItemRight, .memTemplParams { border-top: 1px solid #ccc; } .memItemLeft, .memTemplItemLeft { white-space: nowrap; } .memTemplParams { color: #606060; white-space: nowrap; } /* @end */ /* @group Member Details */ /* Styles for detailed member documentation */ .memtemplate { font-size: 80%; color: #606060; font-weight: normal; margin-left: 3px; } .memnav { background-color: #e8eef2; border: 1px solid #84b0c7; text-align: center; margin: 2px; margin-right: 15px; padding: 2px; } .memitem { padding: 0; margin-bottom: 10px; } .memname { white-space: nowrap; font-weight: bold; } .memproto, .memdoc { border: 1px solid #84b0c7; } .memproto { padding: 0; background-color: #d5e1e8; font-weight: bold; -webkit-border-top-left-radius: 8px; -webkit-border-top-right-radius: 8px; -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); -moz-border-radius-topleft: 8px; -moz-border-radius-topright: 8px; -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; } .memdoc { padding: 2px 5px; background-color: #eef3f5; border-top-width: 0; -webkit-border-bottom-left-radius: 8px; -webkit-border-bottom-right-radius: 8px; -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); -moz-border-radius-bottomleft: 8px; -moz-border-radius-bottomright: 8px; -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; } .paramkey { text-align: right; } .paramtype { white-space: nowrap; } .paramname { color: #602020; white-space: nowrap; } .paramname em { font-style: normal; } /* @end */ /* @group Directory (tree) */ /* for the tree view */ .ftvtree { font-family: sans-serif; margin: 0.5em; } /* these are for tree view when used as main index */ .directory { font-size: 9pt; font-weight: bold; } .directory h3 { margin: 0px; margin-top: 1em; font-size: 11pt; } /* The following two styles can be used to replace the root node title with an image of your choice. Simply uncomment the next two styles, specify the name of your image and be sure to set 'height' to the proper pixel height of your image. */ /* .directory h3.swap { height: 61px; background-repeat: no-repeat; background-image: url("yourimage.gif"); } .directory h3.swap span { display: none; } */ .directory > h3 { margin-top: 0; } .directory p { margin: 0px; white-space: nowrap; } .directory div { display: none; margin: 0px; } .directory img { vertical-align: -30%; } /* these are for tree view when not used as main index */ .directory-alt { font-size: 100%; font-weight: bold; } .directory-alt h3 { margin: 0px; margin-top: 1em; font-size: 11pt; } .directory-alt > h3 { margin-top: 0; } .directory-alt p { margin: 0px; white-space: nowrap; } .directory-alt div { display: none; margin: 0px; } .directory-alt img { vertical-align: -30%; } /* @end */ address { font-style: normal; color: #333; } polylib-5.22.5.orig/doc/codeDoc/html/functions.html0000644000175000017500000002423511303257447023063 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all class members with links to the classes they belong to:

- a -

- c -

- d -

- e -

- f -

- l -

- m -

- n -

- p -

- r -

- s -

- t -

- v -

- w -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testehrhart_8c-source.html0000644000175000017500000006001711253740770025276 0ustar sylvestresylvestre polylib: testehrhart.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x77.html0000644000175000017500000001117111303257447023256 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- w -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__union_8c_source.html0000644000175000017500000005435511303257445026035 0ustar sylvestresylvestre polylib: ehrhart_union.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structforsimplify.html0000644000175000017500000001206711303257447024663 0ustar sylvestresylvestre polylib: forsimplify Struct Reference

forsimplify Struct Reference

List of all members.

Public Attributes

PolyhedronPol
LatticeUnionLatUni
struct forsimplifynext

Detailed Description

Definition at line 30 of file Zpolyhedron.c.


Member Data Documentation

Definition at line 32 of file Zpolyhedron.c.

Referenced by ZDomainSimplify().

Definition at line 33 of file Zpolyhedron.c.

Referenced by ZDomainSimplify().

Definition at line 31 of file Zpolyhedron.c.

Referenced by ZDomainSimplify(), and ZPolyhedronImage().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8c_source.html0000644000175000017500000074222111303257446025032 0ustar sylvestresylvestre polylib: polyparam.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetic__errors_8h-source.html0000644000175000017500000003076211253740766032244 0ustar sylvestresylvestre polylib: arithmetic_errors.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Domain.html0000644000175000017500000001471611303257447025307 0ustar sylvestresylvestre polylib: _Param_Domain Struct Reference

_Param_Domain Struct Reference

#include <types.h>

List of all members.

Public Attributes

unsigned * F
PolyhedronDomain
struct _Param_Domainnext

Detailed Description

Definition at line 151 of file types.h.


Member Data Documentation


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x76.html0000644000175000017500000006370211303257450024257 0ustar sylvestresylvestre polylib: Class Members
 

- v -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8h_source.html0000644000175000017500000002366111303257446024464 0ustar sylvestresylvestre polylib: ranking.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/alpha_8c.html0000644000175000017500000004236411303257446022534 0ustar sylvestresylvestre polylib: alpha.c File Reference

alpha.c File Reference

#include <stdio.h>
#include <polylib/polylib.h>
#include <stdlib.h>
#include <string.h>

Go to the source code of this file.

Functions

static int exist_points (int pos, Polyhedron *Pol, Value *context)
int Polyhedron_Not_Empty (Polyhedron *P, Polyhedron *C, int MAXRAYS)
int PolyhedronLTQ (Polyhedron *Pol1, Polyhedron *Pol2, int INDEX, int PDIM, int NbMaxConstrs)
int GaussSimplify (Matrix *Mat1, Matrix *Mat2)
int PolyhedronTSort (Polyhedron **L, unsigned int n, unsigned int index, unsigned int pdim, int *time, int *pvect, unsigned int MAXRAYS)

Function Documentation

static int exist_points ( int  pos,
Polyhedron Pol,
Value *  context 
) [static]
int Polyhedron_Not_Empty ( Polyhedron P,
Polyhedron C,
int  MAXRAYS 
)
int PolyhedronTSort ( Polyhedron **  L,
unsigned int  n,
unsigned int  index,
unsigned int  pdim,
int *  time,
int *  pvect,
unsigned int  MAXRAYS 
)

Definition at line 532 of file alpha.c.

References p, POL_ENSURE_FACETS, POL_ENSURE_VERTICES, and PolyhedronLTQ().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__union_8c.html0000644000175000017500000002344411303257446024451 0ustar sylvestresylvestre polylib: ehrhart_union.c File Reference

ehrhart_union.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

void Union_Read (Polyhedron **P, Polyhedron **C, const char ***param_name)
void recurse (Polyhedron *C, const char **param_name, Enumeration *e, Value *pmin, Value *pmax, Value *p, int l)
int main (int argc, char **argv)

Function Documentation

void recurse ( Polyhedron C,
const char **  param_name,
Enumeration e,
Value *  pmin,
Value *  pmax,
Value *  p,
int  l 
)
void Union_Read ( Polyhedron **  P,
Polyhedron **  C,
const char ***  param_name 
)

Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8c.html0000644000175000017500000013552511303257447023711 0ustar sylvestresylvestre polylib: NormalForms.c File Reference

NormalForms.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

static void moins_l (Value *a, int i, int n, int p)
static void moins_c (Value *a, int i, int n, int p)
static void echange_l (Value *a, int i, int j, int n, int p)
static void echange_c (Value *a, int i, int j, int n, int p)
static void ligne (Value *a, int i, int j, Value x, int n, int p)
static void colonne (Value *a, int i, int j, Value x, int n, int p)
static int petit_l (Value *a, int n, int p, int q)
static int petit_c (Value *a, int n, int p, int q)
static void identite (Value *a, int n, int p)
static void transpose (Value *a, int n, int q)
static int encore (Value *a, int n, int p, int q, Value val)
static void smith (Value *a, Value *b, Value *c, Value *b_inverse, Value *c_inverse, int n, int p, int q)
static void hermite (Value *a, Value *b, Value *d, int n, int p, int q)
static Value * ConvertPolMattoDarMat (Matrix *A)
 Convert PolmattoDarmat : This function converts the matrix of a Polylib to a int * as necessary for the functions in Darte's implementation.
static MatrixConvertDarMattoPolMat (Value *A, int NbRows, int NbCols)
 Convert DarmattoPolmat This function converts the matrix from Darte representation to a matrix in PolyLib.
void Smith (Matrix *A, Matrix **U, Matrix **V, Matrix **Product)
 Smith : This function takes a Matrix A of dim n * l as its input and returns the three matrices U, V and Product such that A = U * Product * V, where U is an unimodular matrix of dimension n * n and V is an unimodular matrix of dimension l * l.
void Hermite (Matrix *A, Matrix **H, Matrix **U)
 Hermite : This function takes a Matrix as its input and finds its HNF ( Left form ).

Function Documentation

static void colonne ( Value *  a,
int  i,
int  j,
Value  x,
int  n,
int  p 
) [static]

Definition at line 146 of file NormalForms.c.

References value_addmul.

Referenced by hermite(), and smith().

static Matrix* ConvertDarMattoPolMat ( Value *  A,
int  NbRows,
int  NbCols 
) [static]

Convert DarmattoPolmat This function converts the matrix from Darte representation to a matrix in PolyLib.

Input : The matrix (a pointer to it), number of Rows, number of columns Output : The matrix of the PolyLib

Definition at line 604 of file NormalForms.c.

References Matrix_Alloc(), matrix::p, and value_assign.

Referenced by Hermite().

static Value* ConvertPolMattoDarMat ( Matrix A  )  [static]

Convert PolmattoDarmat : This function converts the matrix of a Polylib to a int * as necessary for the functions in Darte's implementation.

Input : A Polylib Matrix ( a pointer to it ); Output : An int * with the matrix copied into it

Definition at line 580 of file NormalForms.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, and value_init.

Referenced by Hermite().

static void echange_c ( Value *  a,
int  i,
int  j,
int  n,
int  p 
) [static]

Definition at line 93 of file NormalForms.c.

References s, value_assign, value_clear, and value_init.

Referenced by hermite(), and smith().

static void echange_l ( Value *  a,
int  i,
int  j,
int  n,
int  p 
) [static]

Definition at line 67 of file NormalForms.c.

References s, value_assign, value_clear, and value_init.

Referenced by hermite(), and smith().

static int encore ( Value *  a,
int  n,
int  p,
int  q,
Value  val 
) [static]

Definition at line 329 of file NormalForms.c.

References value_absolute, value_clear, value_init, value_modulus, value_notzero_p, and value_zero_p.

Referenced by smith().

void Hermite ( Matrix A,
Matrix **  H,
Matrix **  U 
)

Hermite : This function takes a Matrix as its input and finds its HNF ( Left form ).

Input : A Matrix A (The Matrix A is not necessarily a Polylib matrix. It is just a matrix as far as Hermite is concerned. It does not even check if the matrix is a Polylib matrix or not) Output : The Hnf matrix H and the Unimodular matrix U such that A = H * U.

We use Alan Darte's implementation of Hermite to compute the HNF. Alan Darte's implementation computes the Upper Triangular HNF. So We work on the fact that if A = H * U then A (transpose) = U(transpose) * H (transpose) There are a set of interface functions written in Interface.c which convert a matrix from Polylib representationt to that of Alan Darte's and vice versa.

This Function Does the Following Step 1 : Given the matrix A it finds its Transpose. Step 2 : Finds the HNF (Right Form) using Alan Darte's Algorithm. Step 3 : The H1 and U1 obtained in Step2 are both Transposed to get the actual H and U such that A = HU.

Definition at line 670 of file NormalForms.c.

References ConvertDarMattoPolMat(), ConvertPolMattoDarMat(), hermite(), identite(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, Transpose(), transpose(), value_clear, and value_init.

Referenced by AffineHermite(), findHermiteBasis(), isfulldim(), RearrangeMatforSolveDio(), and SolveDiophantine().

static void hermite ( Value *  a,
Value *  b,
Value *  d,
int  n,
int  p,
int  q 
) [static]
static void identite ( Value *  a,
int  n,
int  p 
) [static]

Definition at line 272 of file NormalForms.c.

References value_set_si.

Referenced by Hermite().

static void ligne ( Value *  a,
int  i,
int  j,
Value  x,
int  n,
int  p 
) [static]

Definition at line 121 of file NormalForms.c.

References value_addmul.

Referenced by hermite(), and smith().

static void moins_c ( Value *  a,
int  i,
int  n,
int  p 
) [static]

Definition at line 48 of file NormalForms.c.

References value_oppose.

Referenced by hermite(), and smith().

static void moins_l ( Value *  a,
int  i,
int  n,
int  p 
) [static]

Definition at line 29 of file NormalForms.c.

References value_oppose.

Referenced by hermite(), and smith().

static int petit_c ( Value *  a,
int  n,
int  p,
int  q 
) [static]

Definition at line 225 of file NormalForms.c.

References value_absolute, value_assign, value_clear, value_ge, value_init, and value_notzero_p.

Referenced by hermite(), and smith().

static int petit_l ( Value *  a,
int  n,
int  p,
int  q 
) [static]

Definition at line 173 of file NormalForms.c.

References value_absolute, value_assign, value_clear, value_ge, value_init, and value_notzero_p.

Referenced by smith().

void Smith ( Matrix A,
Matrix **  U,
Matrix **  V,
Matrix **  Product 
)

Smith : This function takes a Matrix A of dim n * l as its input and returns the three matrices U, V and Product such that A = U * Product * V, where U is an unimodular matrix of dimension n * n and V is an unimodular matrix of dimension l * l.

Product is a diagonal matrix of dimension n * l.

We use Alan Darte's implementation of Smith for computing the Smith Normal Form

Definition at line 627 of file NormalForms.c.

References Identity(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p_Init, and smith().

Referenced by AffineSmith(), and Lattice2LatticeUnion().

static void smith ( Value *  a,
Value *  b,
Value *  c,
Value *  b_inverse,
Value *  c_inverse,
int  n,
int  p,
int  q 
) [static]
static void transpose ( Value *  a,
int  n,
int  q 
) [static]

Definition at line 297 of file NormalForms.c.

References value_assign, value_clear, and value_init.

Referenced by Hermite(), and Transpose().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structLatticeUnion-members.html0000644000175000017500000000343311303257447026343 0ustar sylvestresylvestre polylib: Member List

LatticeUnion Member List

This is the complete list of members for LatticeUnion, including all inherited members.
MLatticeUnion
nextLatticeUnion

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8c.html0000644000175000017500000003040311303257447023070 0ustar sylvestresylvestre polylib: ranking.c File Reference

ranking.c File Reference

#include <polylib/polylib.h>
#include <polylib/ranking.h>

Go to the source code of this file.

Functions

PolyhedronLexSmaller (Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)
 Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J B.
EnumerationPolyhedron_LexSmallerEnumerate (Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)
 Returns the number of points in P that are lexicographically smaller than a given point in D.
EnumerationPolyhedron_Ranking (Polyhedron *P, Polyhedron *C, unsigned MAXRAYS)

Function Documentation

Polyhedron* LexSmaller ( Polyhedron P,
Polyhedron D,
unsigned  dim,
Polyhedron C,
unsigned  MAXRAYS 
)

Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J B.

Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J.

Meister 6/2005 LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur HiPEAC Network Returns a list of polytopes needed to compute the number of points in P that are lexicographically smaller than a given point in D. Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C.

The first polyhedron in the list returned is the updated context: a combination of D and C or an extended C.

The order of the variables in the remaining polyhedra is

  • first dim variables of P
  • existential variables of P
  • existential variables of D
  • first dim variables of D
  • the parameters

Definition at line 51 of file ranking.c.

References assert, polyhedron::Constraint, Constraints2Polyhedron(), polyhedron::Dimension, Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, polyhedron::NbConstraints, matrix::NbRows, polyhedron::next, matrix::p, POL_ENSURE_INEQUALITIES, POL_NO_DUAL, show_matrix, value_assign, value_set_si, and Vector_Copy().

Referenced by Polyhedron_LexSmallerEnumerate().

Enumeration* Polyhedron_LexSmallerEnumerate ( Polyhedron P,
Polyhedron D,
unsigned  dim,
Polyhedron C,
unsigned  MAXRAYS 
)

Returns the number of points in P that are lexicographically smaller than a given point in D.

Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C. The variables in the Enumeration correspond to the first dim variables in D followed by the parameters of D (the variables of C).

Definition at line 192 of file ranking.c.

References Domain_Enumerate(), Domain_Free(), LexSmaller(), polyhedron::next, and Polyhedron_Free().

Referenced by main(), and Polyhedron_Ranking().

Enumeration* Polyhedron_Ranking ( Polyhedron P,
Polyhedron C,
unsigned  MAXRAYS 
)

Definition at line 223 of file ranking.c.

References polyhedron::Dimension, and Polyhedron_LexSmallerEnumerate().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/pp_8c.html0000644000175000017500000001222011303257447022053 0ustar sylvestresylvestre polylib: pp.c File Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__ranking_8c_source.html0000644000175000017500000003227611303257445026334 0ustar sylvestresylvestre polylib: ehrhart_ranking.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2link.png0000644000175000017500000000054611303257450022423 0ustar sylvestresylvestre‰PNG  IHDR_Tq-0PLTEÿÿÿ€ÿÿ€ÿ€€€€€ÀÀÀ~›tRNS@æØftEXtSoftwaregif2png 2.4.2£^G&tEXtCommentUlead GIF SmartSaver Ver 2.0Ù åJIDATxÚ}Œ± Â0Eo3´c~¡SW‹~€n®Z²¾:d5¸dì/Ÿy!PÐÉÍᾨ‚àf}ÀžQp@Ï­tÛbâ ÁÌa;j»;éhº¬Q$ìÜKhíÒ^~ý’¨m„²((8ÊÒLF-YÌ8\‹Ìãþ+qúy¼gy…TiÞÞ/øÏq•+¡xÐÿIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/globals_0x66.html0000644000175000017500000001626611303257447023266 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- f -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__upper__bound_8c.html0000644000175000017500000001100211303257446025765 0ustar sylvestresylvestre polylib: ehrhart_upper_bound.c File Reference

ehrhart_upper_bound.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main (int argc, char **argv)

Function Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/verif__ehrhart_8c.html0000644000175000017500000004241311303257447024432 0ustar sylvestresylvestre polylib: verif_ehrhart.c File Reference

verif_ehrhart.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define MAXRAYS   1024
#define RANGE   50
#define SRANGE   15
#define BIGDIM   5
#define VSRANGE   5
#define VBIGDIM   8

Functions

int check_poly (Polyhedron *S, Polyhedron *C, Enumeration *en, int nparam, int pos, Value *z)
int main (int argc, char *argv[])

Variables

Value min
Value max
int st

Define Documentation

#define BIGDIM   5

Definition at line 52 of file verif_ehrhart.c.

Referenced by main().

#define MAXRAYS   1024

Definition at line 37 of file verif_ehrhart.c.

Referenced by main().

#define RANGE   50

Definition at line 46 of file verif_ehrhart.c.

Referenced by main().

#define SRANGE   15

Definition at line 49 of file verif_ehrhart.c.

Referenced by main().

#define VBIGDIM   8

Definition at line 58 of file verif_ehrhart.c.

Referenced by main().

#define VSRANGE   5

Definition at line 55 of file verif_ehrhart.c.

Referenced by main().


Function Documentation

int check_poly ( Polyhedron S,
Polyhedron C,
Enumeration en,
int  nparam,
int  pos,
Value *  z 
)

Variable Documentation

Value max

Definition at line 60 of file verif_ehrhart.c.

Referenced by check_poly(), main(), and SortConstraints().

int st

Definition at line 67 of file verif_ehrhart.c.

Referenced by check_poly(), and main().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetique_8h.html0000644000175000017500000062717411303257446027100 0ustar sylvestresylvestre polylib: arithmetique.h File Reference

arithmetique.h File Reference

#include <stdio.h>
#include <limits.h>
#include "arithmetic_errors.h"

Go to the source code of this file.

Defines

#define __LONG_LONG_MAX__   9223372036854775807LL
 package arithmetique
#define LONG_LONG_MAX   __LONG_LONG_MAX__
#define LONG_LONG_MIN   (-LONG_LONG_MAX-1)
#define ULONG_LONG_MAX   (LONG_LONG_MAX * 2ULL + 1)
#define value_init(val)   ((val) = 0)
#define value_assign(v1, v2)   ((v1) = (v2))
#define value_set_si(val, i)   ((val) = (Value)(i))
#define value_set_double(val, d)   ((val) = (Value)(d))
#define value_clear(val)   ((val) = 0)
#define value_read(val, str)   (sscanf((str),VALUE_FMT,&(val)))
#define value_print(Dst, fmt, val)   (fprintf((Dst),(fmt),(val)))
#define value_swap(v1, v2)
#define int_to_value(i)   ((Value)(i))
#define long_to_value(l)   ((Value)(l))
#define float_to_value(f)   ((Value)(f))
#define double_to_value(d)   ((Value)(d))
#define value_eq(v1, v2)   ((v1)==(v2))
#define value_ne(v1, v2)   ((v1)!=(v2))
#define value_gt(v1, v2)   ((v1)>(v2))
#define value_ge(v1, v2)   ((v1)>=(v2))
#define value_lt(v1, v2)   ((v1)<(v2))
#define value_le(v1, v2)   ((v1)<=(v2))
#define value_abs_eq(v1, v2)   (value_abs(v1)==value_abs(v2))
#define value_abs_ne(v1, v2)   (value_abs(v1)!=value_abs(v2))
#define value_abs_gt(v1, v2)   (value_abs(v1)>value_abs(v2))
#define value_abs_ge(v1, v2)   (value_abs(v1)>=value_abs(v2))
#define value_abs_lt(v1, v2)   (value_abs(v1)<value_abs(v2))
#define value_abs_le(v1, v2)   (value_abs(v1)<=value_abs(v2))
#define value_sign(v)   (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)
#define value_compare(v1, v2)   (value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)
#define value_plus(v1, v2)   ((v1)+(v2))
#define value_div(v1, v2)   ((v1)/(v2))
#define value_mod(v1, v2)   ((v1)%(v2))
#define value_direct_multiply(v1, v2)   ((v1)*(v2))
#define value_minus(v1, v2)   ((v1)-(v2))
#define value_pdiv(v1, v2)   (DIVIDE((v1),(v2)))
#define value_pmod(v1, v2)   (MODULO((v1),(v2)))
#define value_min(v1, v2)   (value_le((v1),(v2))? (v1): (v2))
#define value_max(v1, v2)   (value_ge((v1),(v2))? (v1): (v2))
#define value_or(v1, v2)   ((v1)|(v2))
#define value_and(v1, v2)   ((v1)&(v2))
#define value_lshift(v1, v2)   ((v1)<<(v2))
#define value_rshift(v1, v2)   ((v1)>>(v2))
#define value_addto(ref, val1, val2)   ((ref) = (val1)+(val2))
#define value_add_int(ref, val, vint)   ((ref) = (val)+(Value)(vint))
#define value_addmul(ref, val1, val2)   ((ref) += (val1)*(val2))
#define value_increment(ref, val)   ((ref) = (val)+VALUE_ONE)
#define value_direct_product(ref, val1, val2)   ((ref) = (val1)*(val2))
#define value_multiply(ref, val1, val2)   ((ref) = value_mult((val1),(val2)))
#define value_subtract(ref, val1, val2)   ((ref) = (val1)-(val2))
#define value_sub_int(ref, val, vint)   ((ref) = (val)-(Value)(vint))
#define value_decrement(ref, val)   ((ref) = (val)-VALUE_ONE)
#define value_division(ref, val1, val2)   ((ref) = (val1)/(val2))
#define value_divexact(ref, val1, val2)   ((ref) = (val1)/(val2))
#define value_modulus(ref, val1, val2)   ((ref) = (val1)%(val2))
#define value_pdivision(ref, val1, val2)   ((ref) = value_pdiv((val1),(val2)))
#define value_pmodulus(ref, val1, val2)   ((ref) = value_pmod((val1),(val2)))
#define value_oppose(ref, val)   ((ref) = value_uminus((val)))
#define value_absolute(ref, val)   ((ref) = value_abs((val)))
#define value_minimum(ref, val1, val2)   ((ref) = value_min((val1),(val2)))
#define value_maximum(ref, val1, val2)   ((ref) = value_max((val1),(val2)))
#define value_gcd(ref, val1, val2)   Gcd((val1),(val2),&(ref))
#define value_lcm(ref, val1, val2)   Lcm3((val1),(val2),&(ref))
#define value_orto(ref, val1, val2)   ((ref) = (val1)|(val2))
#define value_andto(ref, val1, val2)   ((ref) = (val1)&(val2))
#define value_uminus(val)   (-(val))
#define value_not(val)   (~(val))
#define value_abs(val)
#define value_pos_p(val)   value_gt(val,VALUE_ZERO)
#define value_neg_p(val)   value_lt(val,VALUE_ZERO)
#define value_posz_p(val)   value_ge(val,VALUE_ZERO)
#define value_negz_p(val)   value_le(val,VALUE_ZERO)
#define value_zero_p(val)   value_eq(val,VALUE_ZERO)
#define value_notzero_p(val)   value_ne(val,VALUE_ZERO)
#define value_one_p(val)   value_eq(val,VALUE_ONE)
#define value_notone_p(val)   value_ne(val,VALUE_ONE)
#define value_mone_p(val)   value_eq(val,VALUE_MONE)
#define value_notmone_p(val)   value_ne(val,VALUE_MONE)
#define value_cmp_si(val, n)   (val - (n))
#define value_min_p(val)   value_eq(val,VALUE_MIN)
#define value_max_p(val)   value_eq(val,VALUE_MAX)
#define value_notmin_p(val)   value_ne(val,VALUE_MIN)
#define value_notmax_p(val)   value_ne(val,VALUE_MAX)
#define value_protected_hard_idiv_multiply(v, w, throw)
#define value_protected_multiply(v, w, throw)   value_protected_hard_idiv_multiply(v,w,throw)
#define value_protected_mult(v, w)   value_protected_multiply(v,w,THROW(overflow_error))
#define value_protected_product(v, w)   v=value_protected_mult(v,w)
#define value_mult(v, w)
#define value_product(v, w)   v=value_mult(v,w)
#define value_substract(ref, val1, val2)   (value_subtract((ref),(val1),(val2)))
#define ABS(x)   (((x)>=0) ? (x) : -(x))
#define MIN(x, y)   (((x)>=(y))?(y):(x))
#define MAX(x, y)   (((x)>=(y))?(x):(y))
#define SIGN(x)   (((x)>0)? 1 : ((x)==0? 0 : -1))
#define DIVIDE(x, y)
#define POSITIVE_DIVIDE(x, y)   ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))
#define MODULO(x, y)   ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))
#define POSITIVE_MODULO(x, y)

Functions

void dump_exception_stack_to_file (FILE *)
void dump_exception_stack (void)
jmp_buf * push_exception_on_stack (int, const char *, const char *, int)
void pop_exception_from_stack (int, const char *, const char *, int)
void throw_exception (int, const char *, const char *, int)

Variables

unsigned int overflow_error
unsigned int simplex_arithmetic_error
unsigned int user_exception_error
unsigned int parser_exception_error
unsigned int any_exception_error
unsigned int the_last_just_thrown_exception

Define Documentation

#define __LONG_LONG_MAX__   9223372036854775807LL

package arithmetique

Id
arithmetique.h,v 1.24 2007/02/22 09:16:57 skimo Exp

Francois Irigoin, mai 1989

Modifications

  • rewrite of DIVIDE which was wrong (Remi Triolet, Francois Irigoin, april 90)
  • simplification of POSITIVE_DIVIDE by suppressing one modulo
  • B.Meister : added addmul, operation existing in gmp and quite useful (05-2005)

Definition at line 98 of file source/arith/arithmetique.h.

#define ABS (  )     (((x)>=0) ? (x) : -(x))

Definition at line 700 of file source/arith/arithmetique.h.

#define DIVIDE ( x,
 ) 
Value:
((y)>0? POSITIVE_DIVIDE(x,y) : \
                     -POSITIVE_DIVIDE((x),(-(y))))

Definition at line 723 of file source/arith/arithmetique.h.

#define double_to_value (  )     ((Value)(d))

Definition at line 473 of file source/arith/arithmetique.h.

#define float_to_value (  )     ((Value)(f))

Definition at line 472 of file source/arith/arithmetique.h.

#define int_to_value (  )     ((Value)(i))

Definition at line 470 of file source/arith/arithmetique.h.

#define LONG_LONG_MAX   __LONG_LONG_MAX__

Definition at line 101 of file source/arith/arithmetique.h.

#define LONG_LONG_MIN   (-LONG_LONG_MAX-1)

Definition at line 103 of file source/arith/arithmetique.h.

#define long_to_value (  )     ((Value)(l))

Definition at line 471 of file source/arith/arithmetique.h.

#define MAX ( x,
 )     (((x)>=(y))?(x):(y))

Definition at line 711 of file source/arith/arithmetique.h.

#define MIN ( x,
 )     (((x)>=(y))?(y):(x))

Definition at line 708 of file source/arith/arithmetique.h.

#define MODULO ( x,
 )     ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))

Definition at line 730 of file source/arith/arithmetique.h.

#define POSITIVE_DIVIDE ( x,
 )     ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))

Definition at line 727 of file source/arith/arithmetique.h.

#define POSITIVE_MODULO ( x,
 ) 
Value:
((x) > 0 ? (x)%(y) : \
                              ((x)%(y) == 0 ? 0 : ((y)-(-(x))%(y))))

Definition at line 738 of file source/arith/arithmetique.h.

#define SIGN (  )     (((x)>0)? 1 : ((x)==0? 0 : -1))

Definition at line 715 of file source/arith/arithmetique.h.

#define ULONG_LONG_MAX   (LONG_LONG_MAX * 2ULL + 1)

Definition at line 105 of file source/arith/arithmetique.h.

#define value_abs ( val   ) 
Value:
(value_posz_p(val)? \
    (val) :                                \
    (value_ne((val), VALUE_NAN) ?          \
     value_uminus(val) :                   \
    (THROW (overflow_error), VALUE_NAN )))

Definition at line 541 of file source/arith/arithmetique.h.

#define value_abs_eq ( v1,
v2   )     (value_abs(v1)==value_abs(v2))

Definition at line 484 of file source/arith/arithmetique.h.

Referenced by SortConstraints().

#define value_abs_ge ( v1,
v2   )     (value_abs(v1)>=value_abs(v2))

Definition at line 487 of file source/arith/arithmetique.h.

#define value_abs_gt ( v1,
v2   )     (value_abs(v1)>value_abs(v2))

Definition at line 486 of file source/arith/arithmetique.h.

#define value_abs_le ( v1,
v2   )     (value_abs(v1)<=value_abs(v2))

Definition at line 489 of file source/arith/arithmetique.h.

#define value_abs_lt ( v1,
v2   )     (value_abs(v1)<value_abs(v2))

Definition at line 488 of file source/arith/arithmetique.h.

Referenced by SortConstraints().

#define value_abs_ne ( v1,
v2   )     (value_abs(v1)!=value_abs(v2))

Definition at line 485 of file source/arith/arithmetique.h.

Referenced by ImplicitEqualities().

#define value_absolute ( ref,
val   )     ((ref) = value_abs((val)))
#define value_add_int ( ref,
val,
vint   )     ((ref) = (val)+(Value)(vint))
#define value_and ( v1,
v2   )     ((v1)&(v2))

Definition at line 508 of file source/arith/arithmetique.h.

#define value_andto ( ref,
val1,
val2   )     ((ref) = (val1)&(val2))

Definition at line 535 of file source/arith/arithmetique.h.

#define value_assign ( v1,
v2   )     ((v1) = (v2))

Definition at line 459 of file source/arith/arithmetique.h.

Referenced by AddANullColumn(), AddANullRow(), affine_periods(), AffinePartSimplify(), AffineSmith(), align_context(), CanonicalForm(), ChangeLatticeDimension(), check_poly(), cherche_min(), Combine(), compute_enode(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_removeElimCols(), ConvertDarMattoPolMat(), ConvertPolMattoDarMat(), count_points(), dehomogenize_periodic(), dehomogenize_polynomial(), Domain_Enumerate(), DomainCost(), echange_c(), echange_l(), ecopy(), Elim_Columns(), eliminable_vars(), Equalities_intModBasis(), Equalities_validityLattice(), ExchangeRows(), exist_points(), ExtractLinearPart(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), GaussSimplify(), Gcd(), GenParamPolyhedron(), hermite(), in_domain(), isinHnf(), isIntegral(), Lattice2LatticeUnion(), LatticeIntersection(), LatticePreimage(), Lcm3(), left_hermite(), LexSmaller(), lower_upper_bounds(), main(), MatInverse(), Matrix_Copy(), Matrix_Inverse(), Matrix_Product(), mpolyhedron_compress_last_vars(), mpolyhedron_permute(), mtransformation_expand_left_to_dim(), mtransformation_permute(), new_eadd(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), petit_c(), petit_l(), Polyhedron_Image_Enumerate(), Polyhedron_Preprocess2(), PolyhedronLTQ(), PutColumnFirst(), PutColumnLast(), PutRowFirst(), PutRowLast(), rat_prodmat(), Rays_Mult(), Rays_Mult_Transpose(), RearrangeMatforSolveDio(), recurse(), right_hermite(), scan_m_face(), Scan_Vertices(), Simplify(), smith(), SolveDiophantine(), split_constraints(), SubConstraint(), swap_line(), TestRank(), traite_m_face(), transpose(), Transpose(), valuesWithoutElim(), Vector_Combine(), Vector_Copy(), Vector_Map(), Vector_Max(), Vector_Min(), Vector_Min_Not_Zero(), Vector_Reduce(), Vector_Sort(), and VertexCT().

#define value_clear ( val   )     ((val) = 0)

Definition at line 462 of file source/arith/arithmetique.h.

Referenced by AddLattice(), affine_periods(), AffinePartSimplify(), AffineSmith(), Binomial(), CanonicalForm(), check_poly(), cherche_min(), CNP(), Combine(), compute_enode(), Constraints2Polyhedron(), count_points(), dehomogenize_polynomial(), DomainConstraintSimplify(), DomainCost(), eadd(), echange_c(), echange_l(), Ehrhart_Quick_Apx_Full_Dim(), Elim_Columns(), eliminate_var_with_constr(), emul(), encore(), Enumerate_NoParameters(), Equalities_integerSolution(), evalue_div(), ExchangeRows(), exist_points(), Factorial(), FindHermiteBasisofDomain(), FindSimple(), free_evalue_refs(), Gauss4(), GaussSimplify(), Gcd(), Hermite(), hermite(), ImplicitEqualities(), in_domain(), isinHnf(), isIntegral(), Lattice2LatticeUnion(), LatticePreimage(), Lcm3(), left_hermite(), lower_upper_bounds(), main(), MatInverse(), Matrix_Inverse(), Matrix_Product(), mpolyhedron_deflate(), mpolyhedron_inflate(), mpolyhedron_simplify(), mtransformation_inverse(), new_eadd(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), petit_c(), petit_l(), Poly2Sat(), Polyhedron_Enumerate(), Polyhedron_Image_Enumerate(), Polyhedron_Not_Empty(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), PolyhedronIncludes(), Print_Vertex(), PutColumnFirst(), PutColumnLast(), PutRowFirst(), PutRowLast(), rat_prodmat(), Rays_Mult(), Rays_Mult_Transpose(), recurse(), reduce_evalue(), Reduce_Matrix(), Remove_Redundants(), right_hermite(), Scan_Vertices(), Simplify(), smith(), SolveDiophantine(), Soustraire_ligne(), test_Constraints_fullDimensionize(), TestRank(), transpose(), value_free(), Vector_Combine(), Vector_Free(), Vector_Gcd(), Vector_Min_Not_Zero(), Vector_Normalize(), Vector_Normalize_Positive(), and Vector_Sort().

#define value_cmp_si ( val,
n   )     (val - (n))
#define value_compare ( v1,
v2   )     (value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)

Definition at line 494 of file source/arith/arithmetique.h.

#define value_decrement ( ref,
val   )     ((ref) = (val)-VALUE_ONE)
#define value_direct_multiply ( v1,
v2   )     ((v1)*(v2))

Definition at line 501 of file source/arith/arithmetique.h.

#define value_direct_product ( ref,
val1,
val2   )     ((ref) = (val1)*(val2))

Definition at line 518 of file source/arith/arithmetique.h.

#define value_div ( v1,
v2   )     ((v1)/(v2))

Definition at line 499 of file source/arith/arithmetique.h.

#define value_eq ( v1,
v2   )     ((v1)==(v2))
#define value_ge ( v1,
v2   )     ((v1)>=(v2))
#define value_gt ( v1,
v2   )     ((v1)>(v2))
#define value_increment ( ref,
val   )     ((ref) = (val)+VALUE_ONE)
#define value_init ( val   )     ((val) = 0)

Definition at line 458 of file source/arith/arithmetique.h.

Referenced by AddLattice(), affine_periods(), AffinePartSimplify(), AffineSmith(), Binomial(), CanonicalForm(), check_poly(), cherche_min(), CNP(), Combine(), compute_enode(), compute_poly(), Constraints2Polyhedron(), ConvertPolMattoDarMat(), count_points(), dehomogenize_periodic(), dehomogenize_polynomial(), Domain_Enumerate(), DomainConstraintSimplify(), DomainCost(), eadd(), echange_c(), echange_l(), ecopy(), edot(), Ehrhart_Quick_Apx_Full_Dim(), Elim_Columns(), eliminate_var_with_constr(), emul(), encore(), Enumerate_NoParameters(), Equalities_integerSolution(), evalue_div(), ExchangeRows(), exist_points(), Factorial(), FindHermiteBasisofDomain(), FindSimple(), Gauss4(), GaussSimplify(), Gcd(), Hermite(), hermite(), ImplicitEqualities(), in_domain(), isinHnf(), isIntegral(), Lattice2LatticeUnion(), LatticePreimage(), Lcm(), Lcm3(), left_hermite(), lower_upper_bounds(), main(), MatInverse(), Matrix_Extend(), Matrix_Inverse(), Matrix_Product(), mpolyhedron_deflate(), mpolyhedron_inflate(), mpolyhedron_simplify(), mtransformation_inverse(), new_eadd(), new_enode(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), petit_c(), petit_l(), Poly2Sat(), Polyhedron_Enumerate(), Polyhedron_Image_Enumerate(), Polyhedron_Not_Empty(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), PolyhedronIncludes(), Print_Vertex(), PutColumnFirst(), PutColumnLast(), PutRowFirst(), PutRowLast(), rat_prodmat(), Rays_Mult(), Rays_Mult_Transpose(), recurse(), Remove_Redundants(), right_hermite(), Scan_Vertices(), Simplify(), smith(), SolveDiophantine(), Soustraire_ligne(), test_Constraints_fullDimensionize(), TestRank(), transpose(), value_alloc(), Vector_Alloc(), Vector_Combine(), Vector_Gcd(), Vector_Min_Not_Zero(), Vector_Normalize(), Vector_Normalize_Positive(), and Vector_Sort().

#define value_lcm ( ref,
val1,
val2   )     Lcm3((val1),(val2),&(ref))
#define value_le ( v1,
v2   )     ((v1)<=(v2))
#define value_lshift ( v1,
v2   )     ((v1)<<(v2))

Definition at line 509 of file source/arith/arithmetique.h.

#define value_max ( v1,
v2   )     (value_ge((v1),(v2))? (v1): (v2))

Definition at line 506 of file source/arith/arithmetique.h.

#define value_max_p ( val   )     value_eq(val,VALUE_MAX)

Definition at line 561 of file source/arith/arithmetique.h.

#define value_maximum ( ref,
val1,
val2   )     ((ref) = value_max((val1),(val2)))

Definition at line 531 of file source/arith/arithmetique.h.

Referenced by Vector_Max().

#define value_min ( v1,
v2   )     (value_le((v1),(v2))? (v1): (v2))

Definition at line 505 of file source/arith/arithmetique.h.

#define value_min_p ( val   )     value_eq(val,VALUE_MIN)

Definition at line 560 of file source/arith/arithmetique.h.

#define value_minimum ( ref,
val1,
val2   )     ((ref) = value_min((val1),(val2)))

Definition at line 530 of file source/arith/arithmetique.h.

Referenced by Vector_Min().

#define value_minus ( v1,
v2   )     ((v1)-(v2))

Definition at line 502 of file source/arith/arithmetique.h.

#define value_mod ( v1,
v2   )     ((v1)%(v2))

Definition at line 500 of file source/arith/arithmetique.h.

#define value_modulus ( ref,
val1,
val2   )     ((ref) = (val1)%(val2))
#define value_mone_p ( val   )     value_eq(val,VALUE_MONE)

Definition at line 557 of file source/arith/arithmetique.h.

Referenced by Degenerate(), Print_Domain(), and Print_Vertex().

#define value_mult ( v,
 ) 
Value:
value_protected_multiply(v,w,                                                 \
    (fprintf(stderr,"[value_mult] value overflow!\n"),THROW(overflow_error)))

Definition at line 611 of file source/arith/arithmetique.h.

#define value_negz_p ( val   )     value_le(val,VALUE_ZERO)

Definition at line 552 of file source/arith/arithmetique.h.

Referenced by old_Polyhedron_Preprocess().

#define value_not ( val   )     (~(val))

Definition at line 540 of file source/arith/arithmetique.h.

#define value_notmax_p ( val   )     value_ne(val,VALUE_MAX)

Definition at line 563 of file source/arith/arithmetique.h.

#define value_notmin_p ( val   )     value_ne(val,VALUE_MIN)

Definition at line 562 of file source/arith/arithmetique.h.

#define value_notmone_p ( val   )     value_ne(val,VALUE_MONE)

Definition at line 558 of file source/arith/arithmetique.h.

Referenced by count_points().

#define value_one_p ( val   )     value_eq(val,VALUE_ONE)
#define value_or ( v1,
v2   )     ((v1)|(v2))

Definition at line 507 of file source/arith/arithmetique.h.

#define value_orto ( ref,
val1,
val2   )     ((ref) = (val1)|(val2))

Definition at line 534 of file source/arith/arithmetique.h.

Referenced by Vector_Or().

#define value_pdiv ( v1,
v2   )     (DIVIDE((v1),(v2)))

Definition at line 503 of file source/arith/arithmetique.h.

#define value_pdivision ( ref,
val1,
val2   )     ((ref) = value_pdiv((val1),(val2)))
#define value_plus ( v1,
v2   )     ((v1)+(v2))

Definition at line 498 of file source/arith/arithmetique.h.

#define value_pmod ( v1,
v2   )     (MODULO((v1),(v2)))

Definition at line 504 of file source/arith/arithmetique.h.

#define value_pmodulus ( ref,
val1,
val2   )     ((ref) = value_pmod((val1),(val2)))

Definition at line 527 of file source/arith/arithmetique.h.

Referenced by compute_enode(), and Equalities_integerSolution().

#define value_posz_p ( val   )     value_ge(val,VALUE_ZERO)
#define value_product ( v,
 )     v=value_mult(v,w)

Definition at line 614 of file source/arith/arithmetique.h.

#define value_protected_hard_idiv_multiply ( v,
w,
throw   ) 
Value:
((value_zero_p(w) || value_zero_p(v))? VALUE_ZERO:              \
   value_lt(value_abs(v),value_div(VALUE_MAX,value_abs(w)))?    \
   value_direct_multiply(v,w): (throw, VALUE_NAN))

Definition at line 575 of file source/arith/arithmetique.h.

#define value_protected_mult ( v,
 )     value_protected_multiply(v,w,THROW(overflow_error))

Definition at line 594 of file source/arith/arithmetique.h.

#define value_protected_multiply ( v,
w,
throw   )     value_protected_hard_idiv_multiply(v,w,throw)

Definition at line 588 of file source/arith/arithmetique.h.

#define value_protected_product ( v,
 )     v=value_protected_mult(v,w)

Definition at line 596 of file source/arith/arithmetique.h.

#define value_read ( val,
str   )     (sscanf((str),VALUE_FMT,&(val)))

Definition at line 463 of file source/arith/arithmetique.h.

Referenced by main(), Matrix_Read_Input(), and Vector_Read().

#define value_rshift ( v1,
v2   )     ((v1)>>(v2))

Definition at line 510 of file source/arith/arithmetique.h.

#define value_set_double ( val,
 )     ((val) = (Value)(d))

Definition at line 461 of file source/arith/arithmetique.h.

Referenced by compute_poly().

#define value_set_si ( val,
 )     ((val) = (Value)(i))

Definition at line 460 of file source/arith/arithmetique.h.

Referenced by AddANullColumn(), AddANullRow(), AddLattice(), addToFilter(), affine_periods(), AffineSmith(), align_context(), Binomial(), BuildSat(), CalcBase(), ChangeLatticeDimension(), cherche_min(), CNP(), compute_enode(), compute_poly(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_Remove_parm_eqs(), count_points(), dehomogenize_polynomial(), DomainConstraintSimplify(), DomainCost(), edot(), Ehrhart_Quick_Apx_Full_Dim(), Empty_Polyhedron(), EmptyLattice(), emul(), Enumerate_NoParameters(), Enumeration_zero(), Equalities_integerSolution(), Equalities_validityLattice(), exist_points(), Factorial(), Find_m_faces(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), GaussSimplify(), GenParamPolyhedron(), identite(), Identity(), Identity_Matrix(), ImplicitEqualities(), Inner_Product(), Lattice_extractSubLattice(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), lower_upper_bounds(), main(), MakeDioEqforInter(), MatInverse(), Matrix_identity(), Matrix_Inverse(), Matrix_Product(), mpolyhedron_compress_last_vars(), mpolyhedron_deflate(), mpolyhedron_eliminate_first_variables(), mpolyhedron_inflate(), mtransformation_inverse(), new_eadd(), new_enode(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), Poly2Sat(), Polyhedron_Enumerate(), Polyhedron_Image_Enumerate(), Polyhedron_Not_Empty(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Scan(), PolyhedronIncludes(), PolyhedronLTQ(), PreElim_Columns(), rat_prodmat(), Rays2Polyhedron(), Rays_Mult(), Rays_Mult_Transpose(), Remove_Redundants(), right_hermite(), Scalar_product(), Scan_Vertices(), Simplify(), smith(), SolveDiophantine(), Soustraire_ligne(), SubConstraint(), test_Constraints_fullDimensionize(), Universe_Polyhedron(), Vector_IsZero(), Vector_Min_Not_Zero(), Vector_Set(), and VertexCT().

#define value_sign (  )     (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)

Definition at line 493 of file source/arith/arithmetique.h.

Referenced by ImplicitEqualities().

#define value_sub_int ( ref,
val,
vint   )     ((ref) = (val)-(Value)(vint))
#define value_substract ( ref,
val1,
val2   )     (value_subtract((ref),(val1),(val2)))

Definition at line 695 of file source/arith/arithmetique.h.

#define value_swap ( v1,
v2   ) 
Value:
{Value tmp; tmp = v2; \
                                    v2 = v1; v1 = tmp;   \
                                   }

Definition at line 465 of file source/arith/arithmetique.h.

Referenced by ExchangeColumns(), and Vector_Exchange().

#define value_uminus ( val   )     (-(val))

Definition at line 539 of file source/arith/arithmetique.h.


Function Documentation

void dump_exception_stack ( void   ) 

Definition at line 233 of file errors.c.

Referenced by pop_exception_from_stack(), push_exception_on_stack(), and throw_exception().

void dump_exception_stack_to_file ( FILE *   ) 

Definition at line 216 of file errors.c.

Referenced by dump_exception_stack().

void pop_exception_from_stack ( int  ,
const char *  ,
const char *  ,
int   
)

Definition at line 285 of file errors.c.

jmp_buf* push_exception_on_stack ( int  ,
const char *  ,
const char *  ,
int   
)

Definition at line 249 of file errors.c.

void throw_exception ( int  ,
const char *  ,
const char *  ,
int   
)

Definition at line 329 of file errors.c.


Variable Documentation

unsigned int parser_exception_error

Definition at line 112 of file errors.c.

Referenced by get_exception_name().

Definition at line 110 of file errors.c.

Referenced by get_exception_name().

Definition at line 156 of file errors.c.

unsigned int user_exception_error

Definition at line 111 of file errors.c.

Referenced by get_exception_name().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2mnode.png0000644000175000017500000000030211303257450022556 0ustar sylvestresylvestre‰PNG  IHDRLƒ1Ù$PLTEÀÀÀ€€€S¾™tRNS@æØftEXtSoftwaregif2png 2.4.2£^G*IDATxÚc` .àBt§RT÷n €ñÁbÜLJJÜÜÜÈ"05˜ÚÑ·y'ª÷–IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/param_8h_source.html0000644000175000017500000001120211303257446024117 0ustar sylvestresylvestre polylib: param.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/verif__ehrhart_8c_source.html0000644000175000017500000010567011303257446026016 0ustar sylvestresylvestre polylib: verif_ehrhart.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_enum.html0000644000175000017500000000372511303257450023515 0ustar sylvestresylvestre polylib: Class Members
 

Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testehrhart_8c.html0000644000175000017500000003174411303257447024005 0ustar sylvestresylvestre polylib: testehrhart.c File Reference

testehrhart.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <polylib/polylib.h>
#include <polylib/homogenization.h>
#include "config.h"

Go to the source code of this file.

Defines

#define EP_EVALUATION
#define getopt_long(a, b, c, d, e)   getopt(a,b,c)
#define WS   0
#define EPRINT_ALL_VALIDITY_CONSTRAINTS
 define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed
#define REDUCE_DEGREE
 The following are mainly for debug purposes.
#define ALL_OVERFLOW_WARNINGS
 define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20

Functions

int main (int argc, char **argv)
 EPRINT : print results while computing the ehrhart polynomial.

Define Documentation

#define ALL_OVERFLOW_WARNINGS

define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20

Definition at line 110 of file testehrhart.c.

#define EP_EVALUATION

Definition at line 38 of file testehrhart.c.

#define EPRINT_ALL_VALIDITY_CONSTRAINTS

define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed

Definition at line 59 of file testehrhart.c.

#define getopt_long ( a,
b,
c,
d,
 )     getopt(a,b,c)

Definition at line 41 of file testehrhart.c.

Referenced by main().

#define REDUCE_DEGREE

The following are mainly for debug purposes.

You shouldn't need to change anything for daily usage... you may define each macro independently

  1. define EDEBUG minimal debug
  2. define EDEBUG1 prints enumeration points
  3. define EDEBUG11 prints number of points
  4. define EDEBUG2 prints domains
  5. define EDEBUG21 prints more domains
  6. define EDEBUG3 prints systems of equations that are solved
  7. define EDEBUG4 prints message for degree reduction
  8. define EDEBUG5 prints result before simplification
  9. define EDEBUG6 prints domains in Preprocess
  10. define EDEBUG61 prints even more in Preprocess
  11. define EDEBUG62 prints domains in Preprocess2

Reduce the degree of resulting polynomials

Definition at line 102 of file testehrhart.c.

#define WS   0

Definition at line 50 of file testehrhart.c.


Function Documentation

int main ( int  argc,
char **  argv 
)

EPRINT : print results while computing the ehrhart polynomial.

this is done by default if you build the executable ehrhart. (If EMAIN is defined). Don't define EMAIN here, it is defined when necessary in the makefile.

Notice: you may however define EPRINT without defining EMAIN, but in this case, you have to initialize the global variable param_name by calling Read_ParamNames before any call to ehrhart. This is NOT recommanded, unless you know what you do. EPRINT causes more debug messages to be printed.

Definition at line 130 of file testehrhart.c.

References AddANullColumn(), compute_poly(), Constraints2Polyhedron(), dehomogenize_enumeration(), polyhedron::Dimension, Enumeration_Free(), _enumeration::EP, FOREVER, Free_ParamNames(), getopt_long, Matrix_Free(), Matrix_Read(), matrix::NbColumns, _enumeration::next, p, Polyhedron_Enumerate(), Polyhedron_Free(), Print_Domain(), print_evalue(), Read_ParamNames(), _enumeration::ValidityDomain, value_init, value_print, value_read, and WS.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolytest_8c_source.html0000644000175000017500000013100111303257446025027 0ustar sylvestresylvestre polylib: Zpolytest.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/types_8h-source.html0000644000175000017500000011072411253740770024113 0ustar sylvestresylvestre polylib: types.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__sep_8c_source.html0000644000175000017500000002056111303257445027221 0ustar sylvestresylvestre polylib: disjoint_union_sep.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__upper__bound_8c-source.html0000644000175000017500000002421611253740767027305 0ustar sylvestresylvestre polylib: ehrhart_upper_bound.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8c_source.html0000644000175000017500000016060611303257446025637 0ustar sylvestresylvestre polylib: matrix_addon.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8c.html0000644000175000017500000004657111303257447024506 0ustar sylvestresylvestre polylib: homogenization.c File Reference

homogenization.c File Reference

#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <polylib/polylib.h>
#include <polylib/homogenization.h>

Go to the source code of this file.

Functions

static evaluedehomogenize_periodic (enode *en)
 homogenization.c copyright 2004-2005 Bavo Nootaert
static evaluedehomogenize_polynomial (enode *en)
 dehomogenize a polynomial.
Polyhedronhomogenize (Polyhedron *P, unsigned MAXRAYS)
void dehomogenize_evalue (evalue *ep, int nb_param)
 dehomogenize an evalue.
void dehomogenize_enode (enode *p, int nb_param)
 dehomogenize all evalues in an enode.
Polyhedrondehomogenize_polyhedron (Polyhedron *p, int maxRays)
 dehomogenize a polyhedron.
void dehomogenize_enumeration (Enumeration *en, int nb_params, int maxRays)
 dehomogenize an enumeration.

Function Documentation

void dehomogenize_enode ( enode p,
int  nb_param 
)

dehomogenize all evalues in an enode.

This function is mutually recursive with dehomogenize_evalue.

Definition at line 77 of file homogenization.c.

References _enode::arr, dehomogenize_evalue(), and _enode::size.

Referenced by dehomogenize_evalue().

void dehomogenize_enumeration ( Enumeration en,
int  nb_params,
int  maxRays 
)

dehomogenize an enumeration.

Replaces each validity domain and Ehrhart polynomial in the Enumeration en with the dehomogenized form.

Definition at line 172 of file homogenization.c.

References dehomogenize_evalue(), dehomogenize_polyhedron(), _enumeration::EP, _enumeration::next, Polyhedron_Free(), and _enumeration::ValidityDomain.

Referenced by main().

void dehomogenize_evalue ( evalue ep,
int  nb_param 
)

dehomogenize an evalue.

The last parameter (nb_param) is replaced by 1. This function is mutually recursive with dehomogenize_enode.

cannot dehomogenize rationals

we need to replace the last parameter

Not the last parameter. Recurse

Definition at line 48 of file homogenization.c.

References _evalue::d, dehomogenize_enode(), dehomogenize_periodic(), dehomogenize_polynomial(), free_evalue_refs(), periodic, and value_zero_p.

Referenced by dehomogenize_enode(), dehomogenize_enumeration(), and Polyhedron_Enumerate().

static evalue * dehomogenize_periodic ( enode en  )  [static]

homogenization.c copyright 2004-2005 Bavo Nootaert

return the 1st element of an enode representing a periodic

Definition at line 87 of file homogenization.c.

References _enode::arr, assert, _evalue::d, periodic, _enode::size, _enode::type, value_assign, value_init, and value_notzero_p.

Referenced by dehomogenize_evalue().

Polyhedron* dehomogenize_polyhedron ( Polyhedron p,
int  maxRays 
)

dehomogenize a polyhedron.

Assume the polyhedron p is homogenous. Returns a new polyhedron.

Definition at line 155 of file homogenization.c.

References Constraints2Polyhedron(), Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, Polyhedron2Constraints(), and Vector_Copy().

Referenced by dehomogenize_enumeration().

static evalue * dehomogenize_polynomial ( enode en  )  [static]

dehomogenize a polynomial.

Assume the enode contains a polynomial in one variable, the homogenous parameter. Returns an new evalue, representing a rational.

enumerate over all coefficients (which are either periodic or rational, but not polynomial)

add ev (fraction) to num/den

simplify num/den

create new evalue representing num/den

cleanup

Definition at line 102 of file homogenization.c.

References _enode::arr, assert, _evalue::d, polynomial, _enode::size, _enode::type, value_addto, value_assign, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_set_si, and value_zero_p.

Referenced by dehomogenize_evalue().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8h-source.html0000644000175000017500000001471711253740767024266 0ustar sylvestresylvestre polylib: matrix.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x72.html0000644000175000017500000001407011303257450024257 0ustar sylvestresylvestre polylib: Class Members
 

- r -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x61.html0000644000175000017500000000743511303257450024252 0ustar sylvestresylvestre polylib: Class Members
 

- a -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/vector_8h_source.html0000644000175000017500000003477311303257446024343 0ustar sylvestresylvestre polylib: vector.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8h_source.html0000644000175000017500000001051711303257445024666 0ustar sylvestresylvestre polylib: errormsg.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylibgmp_8h-source.html0000644000175000017500000000274411253740767025135 0ustar sylvestresylvestre polylib: polylibgmp.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x65.html0000644000175000017500000002061011303257447024264 0ustar sylvestresylvestre polylib: Class Members
 

- e -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__enumeration-members.html0000644000175000017500000000377011303257447026575 0ustar sylvestresylvestre polylib: Member List

_enumeration Member List

This is the complete list of members for _enumeration, including all inherited members.
EP_enumeration
next_enumeration
ValidityDomain_enumeration

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x62.html0000644000175000017500000000707411303257450024252 0ustar sylvestresylvestre polylib: Class Members
 

- b -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__lower__bound_8c.html0000644000175000017500000001100211303257446025762 0ustar sylvestresylvestre polylib: ehrhart_lower_bound.c File Reference

ehrhart_lower_bound.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main (int argc, char **argv)

Function Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errors_8c.html0000644000175000017500000012201111303257446022747 0ustar sylvestresylvestre polylib: errors.c File Reference

errors.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "arithmetique.h"

Go to the source code of this file.

Classes

struct  linear_exception_holder

Defines

#define FALSE   0
#define TRUE   1
#define MAX_STACKED_CONTEXTS   64
#define exception_debug_message(type)
#define exception_debug_trace(type)   if (linear_exception_debug_mode) { exception_debug_message(type); }
#define same_string_p(s1, s2)   (strcmp((s1),(s2))==0)

Typedefs

typedef int boolean

Functions

const char * get_exception_name (unsigned int exception)
void set_exception_callbacks (exception_callback_t push, exception_callback_t pop)
void dump_exception_stack_to_file (FILE *f)
void dump_exception_stack ()
jmp_buf * push_exception_on_stack (int what, const char *function, const char *file, int line)
void pop_exception_from_stack (int what, const char *function, const char *file, int line)
void throw_exception (int what, const char *function, const char *file, int line)
void linear_initialize_exception_stack (unsigned int verbose_exceptions, exception_callback_t push, exception_callback_t pop)

Variables

unsigned int overflow_error = 1
unsigned int simplex_arithmetic_error = 2
unsigned int user_exception_error = 4
unsigned int parser_exception_error = 8
unsigned int timeout_error = 16
unsigned int any_exception_error = ~0
unsigned int the_last_just_thrown_exception = 0
static int linear_exception_debug_mode = FALSE
static unsigned int linear_exception_verbose = 1 | 2 | 16
static linear_exception_holder exception_stack [MAX_STACKED_CONTEXTS]
static int exception_index = 0
static exception_callback_t push_callback = NULL
static exception_callback_t pop_callback = NULL
int linear_number_of_exception_thrown = 0

Define Documentation

#define exception_debug_message ( type   ) 
Value:
fprintf(stderr, "%s[%s:%d %s (%d)/%d]\n",                         \
            type, file, line, function, what, exception_index)

Definition at line 238 of file errors.c.

Referenced by pop_exception_from_stack(), push_exception_on_stack(), and throw_exception().

#define exception_debug_trace ( type   )     if (linear_exception_debug_mode) { exception_debug_message(type); }

Definition at line 242 of file errors.c.

Referenced by pop_exception_from_stack(), push_exception_on_stack(), and throw_exception().

#define FALSE   0

Definition at line 130 of file errors.c.

#define MAX_STACKED_CONTEXTS   64

Definition at line 187 of file errors.c.

Referenced by push_exception_on_stack().

#define same_string_p ( s1,
s2   )     (strcmp((s1),(s2))==0)

Definition at line 278 of file errors.c.

Referenced by pop_exception_from_stack().

#define TRUE   1

Definition at line 133 of file errors.c.


Typedef Documentation

typedef int boolean

Definition at line 127 of file errors.c.


Function Documentation

void dump_exception_stack ( void   ) 
void dump_exception_stack_to_file ( FILE *  f  ) 

Definition at line 216 of file errors.c.

References exception_index.

Referenced by dump_exception_stack().

const char* get_exception_name ( unsigned int  exception  ) 
void linear_initialize_exception_stack ( unsigned int  verbose_exceptions,
exception_callback_t  push,
exception_callback_t  pop 
)

Definition at line 384 of file errors.c.

References linear_exception_verbose, and set_exception_callbacks().

void pop_exception_from_stack ( int  what,
const char *  function,
const char *  file,
int  line 
)
void set_exception_callbacks ( exception_callback_t  push,
exception_callback_t  pop 
)

Definition at line 196 of file errors.c.

References pop_callback, and push_callback.

Referenced by linear_initialize_exception_stack().

void throw_exception ( int  what,
const char *  function,
const char *  file,
int  line 
)

Variable Documentation

linear_exception_holder exception_stack[MAX_STACKED_CONTEXTS] [static]

Definition at line 188 of file errors.c.

int linear_exception_debug_mode = FALSE [static]

Definition at line 160 of file errors.c.

Referenced by throw_exception().

unsigned int linear_exception_verbose = 1 | 2 | 16 [static]

Definition at line 161 of file errors.c.

Referenced by linear_initialize_exception_stack(), and throw_exception().

Definition at line 212 of file errors.c.

Referenced by throw_exception().

unsigned int parser_exception_error = 8

Definition at line 112 of file errors.c.

Referenced by get_exception_name().

Definition at line 193 of file errors.c.

Referenced by push_exception_on_stack(), and set_exception_callbacks().

unsigned int simplex_arithmetic_error = 2

Definition at line 110 of file errors.c.

Referenced by get_exception_name().

Definition at line 156 of file errors.c.

Referenced by pop_exception_from_stack(), push_exception_on_stack(), and throw_exception().

unsigned int timeout_error = 16

Definition at line 113 of file errors.c.

Referenced by get_exception_name().

unsigned int user_exception_error = 4

Definition at line 111 of file errors.c.

Referenced by get_exception_name().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func.html0000644000175000017500000001561511303257447023513 0ustar sylvestresylvestre polylib: Class Members
 

- a -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8h.html0000644000175000017500000015576011303257447024272 0ustar sylvestresylvestre polylib: matrix_addon.h File Reference

matrix_addon.h File Reference

#include <polylib/polylib.h>
#include <assert.h>

Go to the source code of this file.

Defines

#define show_matrix(M)
 Polylib matrix addons Mainly, deals with polyhedra represented in implicit form (set of constraints).
#define ensureMatrix(M, r, c)
 Allocates a matrix if it is null, or else asserts that it has at least a certain size.
#define Constraints_compressLastVars(a, b)   mpolyhedron_compress_last_vars(a, b)
#define Constraints_eliminateFirstVars(a, b)   mpolyhedron_eliminate_first_variables(a,b)

Functions

MatrixconstraintsView (Polyhedron *P)
 
Id
matrix_addon.c,v 1.17 2007/03/18 18:49:08 skimo Exp

void constraintsView_Free (Matrix *M)
 "Frees" a view of the constraints of a polyhedron
void split_constraints (Matrix const *M, Matrix **Eqs, Matrix **Ineqs)
 splits a matrix of constraints M into a matrix of equalities Eqs and a matrix of inequalities Ineqs allocs the new matrices.
MatrixIdentity_Matrix (unsigned int dim)
void Matrix_identity (unsigned int dim, Matrix **I)
 returns the dim-dimensional identity matrix.
void mtransformation_inverse (Matrix *transf, Matrix **inv, Value *g)
 given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix.
void mpolyhedron_simplify (Matrix *polyh)
 simplify a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements.
void mpolyhedron_inflate (Matrix *polyh, unsigned int nb_parms)
 inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra.
void mpolyhedron_deflate (Matrix *polyh, unsigned int nb_parms)
 deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra.
void eliminate_var_with_constr (Matrix *Eliminator, unsigned int eliminator_row, Matrix *Victim, unsigned int victim_row, unsigned int var_to_elim)
 use an eliminator row to eliminate a variable in a victim row (without changing the sign of the victim row -> important if it is an inequality).
void mpolyhedron_compress_last_vars (Matrix *M, Matrix *compression)
 compress the last vars/pars of the polyhedron M expressed as a polylib matrix

  • adresses the full-rank compressions only
  • modfies M

unsigned int mpolyhedron_eliminate_first_variables (Matrix *Eqs, Matrix *Ineqs)
 use a set of m equalities Eqs to eliminate m variables in the polyhedron Ineqs represented as a matrix eliminates the m first variables

  • assumes that Eqs allow to eliminate the m equalities
  • modifies Eqs and Ineqs

void Matrix_subMatrix (Matrix *M, unsigned int sr, unsigned int sc, unsigned int nbR, unsigned int nbC, Matrix **sub)
 returns a contiguous submatrix of a matrix.
void Matrix_clone (Matrix *M, Matrix **Cl)
 Cloning function.
void Matrix_copySubMatrix (Matrix *M1, unsigned int sr1, unsigned int sc1, unsigned int nbR, unsigned int nbC, Matrix *M2, unsigned int sr2, unsigned int sc2)
 Copies a contiguous submatrix of M1 into M2, at the indicated position.
void Matrix_oppose (Matrix *M)
 given a matrix M into -M

Define Documentation

#define Constraints_compressLastVars ( a,
 )     mpolyhedron_compress_last_vars(a, b)

Definition at line 94 of file matrix_addon.h.

Referenced by Constraints_fullDimensionize().

#define Constraints_eliminateFirstVars ( a,
 )     mpolyhedron_eliminate_first_variables(a,b)

Definition at line 102 of file matrix_addon.h.

Referenced by Constraints_fullDimensionize().

#define ensureMatrix ( M,
r,
 ) 
Value:
{ if (M==NULL) M = Matrix_Alloc(r,c); \
                                else assert (M->NbRows>=r && M->NbColumns>=c); \
                              }

Allocates a matrix if it is null, or else asserts that it has at least a certain size.

Definition at line 41 of file matrix_addon.h.

Referenced by Equalities_integerSolution(), and Equalities_validityLattice().

#define show_matrix (  ) 
Value:
{ printf(#M"= \n"); \
                         if (M!=NULL) { \
                         Matrix_Print(stderr,P_VALUE_FMT,(M));} \
                         else {printf("<NULL>\n");} \
                       }

Polylib matrix addons Mainly, deals with polyhedra represented in implicit form (set of constraints).

Author:
Benoit Meister Shortcut for Matrix_Print

Definition at line 32 of file matrix_addon.h.

Referenced by Constraints_fullDimensionize(), Constraints_Remove_parm_eqs(), Ehrhart_Quick_Apx(), Equalities_integerSolution(), Equalities_validityLattice(), full_dimensionize(), int_ker(), Lattice_extractSubLattice(), LexSmaller(), linearInter(), main(), test_Constraints_fullDimensionize(), and test_Constraints_Remove_parm_eqs().


Function Documentation

Matrix* constraintsView ( Polyhedron P  ) 

Id
matrix_addon.c,v 1.17 2007/03/18 18:49:08 skimo Exp

Polylib matrix addons Mainly, deals with polyhedra represented as a matrix (implicit form)

Author:
Benoit Meister <meister@icps.u-strasbg.fr> Creates a view of the constraints of a polyhedron as a Matrix *

Definition at line 32 of file matrix_addon.c.

References polyhedron::Constraint, polyhedron::Dimension, matrix::NbColumns, polyhedron::NbConstraints, matrix::NbRows, and matrix::p.

void constraintsView_Free ( Matrix M  ) 

"Frees" a view of the constraints of a polyhedron

Definition at line 41 of file matrix_addon.c.

void eliminate_var_with_constr ( Matrix Eliminator,
unsigned int  eliminator_row,
Matrix Victim,
unsigned int  victim_row,
unsigned int  var_to_elim 
)

use an eliminator row to eliminate a variable in a victim row (without changing the sign of the victim row -> important if it is an inequality).

Parameters:
Eliminator the matrix containing the eliminator row
eliminator_row the index of the eliminator row in Eliminator
Victim the matrix containing the row to be eliminated
victim_row the row to be eliminated in Victim
var_to_elim the variable to be eliminated.

Definition at line 241 of file matrix_addon.c.

References matrix::NbColumns, matrix::p, value_addto, value_clear, value_division, value_init, value_lcm, value_multiply, value_notzero_p, value_oppose, and value_pos_p.

Referenced by Constraints_Remove_parm_eqs(), and mpolyhedron_eliminate_first_variables().

Matrix* Identity_Matrix ( unsigned int  dim  ) 
void Matrix_clone ( Matrix M,
Matrix **  Cl 
)

Cloning function.

Similar to Matrix_Copy() but allocates the target matrix if it is set to NULL.

Definition at line 377 of file matrix_addon.c.

References Matrix_subMatrix(), matrix::NbColumns, and matrix::NbRows.

Referenced by Constraints_removeElimCols().

void Matrix_copySubMatrix ( Matrix M1,
unsigned int  sr1,
unsigned int  sc1,
unsigned int  nbR,
unsigned int  nbC,
Matrix M2,
unsigned int  sr2,
unsigned int  sc2 
)

Copies a contiguous submatrix of M1 into M2, at the indicated position.

M1 and M2 are assumed t be allocated already.

M1 and M2 are assumed t be allocated already.

Parameters:
M1 the source matrix
sr1 the starting source row
sc1 the starting source column
nbR the number of rows
nbC the number of columns
M2 the target matrix
sr2 the starting target row
sc2 the starting target column

Definition at line 394 of file matrix_addon.c.

References matrix::p, and Vector_Copy().

Referenced by Equalities_intModBasis(), Equalities_validityLattice(), Lattice_extractSubLattice(), and linearInter().

void Matrix_identity ( unsigned int  dim,
Matrix **  I 
)

returns the dim-dimensional identity matrix.

If I is set to NULL, allocates it first. Else, assumes an existing, allocated Matrix.

Definition at line 99 of file matrix_addon.c.

References assert, Identity_Matrix(), and value_set_si.

Referenced by Constraints_fullDimensionize().

void Matrix_oppose ( Matrix M  ) 

given a matrix M into -M

Definition at line 409 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, and value_oppose.

Referenced by Equalities_integerSolution().

void Matrix_subMatrix ( Matrix M,
unsigned int  sr,
unsigned int  sc,
unsigned int  er,
unsigned int  ec,
Matrix **  sub 
)

returns a contiguous submatrix of a matrix.

Parameters:
M the input matrix
sr the index of the starting row
sc the index of the starting column
er the index ofthe ending row (excluded)
ec the ined of the ending colummn (excluded)
sub (returned), the submatrix. Allocated if set to NULL, assumed to be already allocated else.

Definition at line 357 of file matrix_addon.c.

References assert, Matrix_Alloc(), matrix::p, and Vector_Copy().

Referenced by Equalities_integerSolution(), Equalities_validityLattice(), int_ker(), Lattice_extractSubLattice(), linearInter(), and Matrix_clone().

void mpolyhedron_compress_last_vars ( Matrix M,
Matrix compression 
)

compress the last vars/pars of the polyhedron M expressed as a polylib matrix

  • adresses the full-rank compressions only
  • modfies M

Definition at line 293 of file matrix_addon.c.

References assert, Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, value_assign, and value_set_si.

Referenced by Ehrhart_Quick_Apx(), and full_dimensionize().

void mpolyhedron_deflate ( Matrix polyh,
unsigned int  nb_parms 
)

deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra.

Definition at line 213 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addto, value_clear, value_init, value_pos_p, value_set_si, and value_subtract.

Referenced by main().

unsigned int mpolyhedron_eliminate_first_variables ( Matrix Eqs,
Matrix Ineqs 
)

use a set of m equalities Eqs to eliminate m variables in the polyhedron Ineqs represented as a matrix eliminates the m first variables

  • assumes that Eqs allow to eliminate the m equalities
  • modifies Eqs and Ineqs

Definition at line 321 of file matrix_addon.c.

References eliminate_var_with_constr(), matrix::NbRows, matrix::p, value_cmp_si, and value_set_si.

Referenced by full_dimensionize().

void mpolyhedron_inflate ( Matrix polyh,
unsigned int  nb_parms 
)

inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra.

Definition at line 190 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addto, value_clear, value_init, value_neg_p, value_set_si, and value_subtract.

Referenced by main().

void mpolyhedron_simplify ( Matrix polyh  ) 

simplify a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements.

Definition at line 172 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_clear, value_init, value_print, Vector_AntiScale(), and Vector_Gcd().

void mtransformation_inverse ( Matrix transf,
Matrix **  inverse,
Value *  g 
)

given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix.

g is a common denominator for elements of (transf^{-1})

Definition at line 123 of file matrix_addon.c.

References MatInverse(), Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, value_clear, value_division, value_init, value_lcm, value_multiply, and value_set_si.

void split_constraints ( Matrix const *  M,
Matrix **  Eqs,
Matrix **  Ineqs 
)

splits a matrix of constraints M into a matrix of equalities Eqs and a matrix of inequalities Ineqs allocs the new matrices.

Allocates Eqs and Ineqs.

Definition at line 50 of file matrix_addon.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, and value_zero_p.

Referenced by Constraints_fullDimensionize(), and full_dimensionize().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2lastnode.png0000644000175000017500000000035111303257450023271 0ustar sylvestresylvestre‰PNG  IHDRLƒ1Ù0PLTEÿÿÿ€€€Ó tRNS@æØftEXtSoftwaregif2png 2.4.2£^G&tEXtCommentUlead GIF SmartSaver Ver 2.0io?ÍIDATxÚc`0ÀO È3$§ˆÊ3=IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8h-source.html0000644000175000017500000004744711253740767025153 0ustar sylvestresylvestre polylib: polyhedron.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8c.html0000644000175000017500000031660311303257447023454 0ustar sylvestresylvestre polylib: polyparam.c File Reference

polyparam.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Classes

struct  SatMatrix

Defines

#define INT_BITS   (sizeof(unsigned) * 8)

Functions

static void traite_m_face (Polyhedron *, unsigned int *, unsigned int *)
static void scan_m_face (int, int, Polyhedron *, unsigned int *)
PolyhedronPDomainIntersection (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronPDomainDifference (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
static int TestRank (Matrix *Mat)
static SatMatrixSMAlloc (int rows, int cols)
static void SMPrint (SatMatrix *matrix)
static void SMFree (SatMatrix *matrix)
static PolyhedronAdd_CEqualities (Polyhedron *D)
unsigned int * int_array2bit_vector (unsigned int *array, int n)
static int count_sat (unsigned int *mf)
static int bit_vector_includes (unsigned int *bv, int len, unsigned int *part)
static SatMatrixPoly2Sat (Polyhedron *Pol, unsigned int **L)
Param_PolyhedronGenParamPolyhedron (Polyhedron *Pol, Matrix *Rays)
MatrixPreElim_Columns (Polyhedron *E, int *p, int *ref, int m)
PolyhedronElim_Columns (Polyhedron *A, Polyhedron *E, int *p, int *ref)
static PolyhedronRecession_Cone (Polyhedron *P, unsigned nvar, unsigned MaxRays)
static int ComputeNPLinesRays (int n, Polyhedron *D1, Matrix **Rays)
Param_PolyhedronFind_m_faces (Polyhedron **Di, Polyhedron *C, int keep_dom, int working_space, Polyhedron **CEq, Matrix **CT)
void Compute_PDomains (Param_Domain *PD, int nb_domains, int working_space)
Param_PolyhedronPolyhedron2Param_Vertices (Polyhedron *Din, Polyhedron *Cin, int working_space)
void Param_Vertices_Free (Param_Vertices *PV)
void Print_Vertex (FILE *DST, Matrix *V, const char **param_names)
MatrixVertexCT (Matrix *V, Matrix *CT)
void Print_Domain (FILE *DST, Polyhedron *D, const char **pname)
void Param_Vertices_Print (FILE *DST, Param_Vertices *PV, const char **param_names)
Param_PolyhedronPolyhedron2Param_Domain (Polyhedron *Din, Polyhedron *Cin, int working_space)
Param_PolyhedronPolyhedron2Param_SimplifiedDomain (Polyhedron **Din, Polyhedron *Cin, int working_space, Polyhedron **CEq, Matrix **CT)
void Param_Domain_Free (Param_Domain *PD)
void Param_Polyhedron_Free (Param_Polyhedron *P)
void Param_Polyhedron_Scale_Integer (Param_Polyhedron *PP, Polyhedron **P, Value *det, unsigned MaxRays)

Variables

static int m
static int m_dim
static int n
static int ws
static int nr
static PolyhedronCEqualities
static SatMatrixSat
static unsigned int * egalite
static MatrixXi
static MatrixPi
static MatrixPiTest
static MatrixCTest
static MatrixPiInv
static MatrixRaysDi
static int KD
static int nbPV
static Param_VerticesPV_Result
static Param_DomainPDomains
int cntbit [256]

Define Documentation

#define INT_BITS   (sizeof(unsigned) * 8)

Definition at line 339 of file polyparam.c.

Referenced by int_array2bit_vector().


Function Documentation

static Polyhedron* Add_CEqualities ( Polyhedron D  )  [static]
static int bit_vector_includes ( unsigned int *  bv,
int  len,
unsigned int *  part 
) [static]

Definition at line 559 of file polyparam.c.

Referenced by scan_m_face().

static int ComputeNPLinesRays ( int  n,
Polyhedron D1,
Matrix **  Rays 
) [static]
static int count_sat ( unsigned int *  mf  )  [static]

Definition at line 542 of file polyparam.c.

References cntbit, and nr.

Referenced by scan_m_face().

unsigned int* int_array2bit_vector ( unsigned int *  array,
int  n 
)

Definition at line 341 of file polyparam.c.

References assert, INT_BITS, MSB, and NEXT.

Referenced by traite_m_face().

void Param_Domain_Free ( Param_Domain PD  ) 
void Param_Vertices_Free ( Param_Vertices PV  ) 
void Param_Vertices_Print ( FILE *  DST,
Param_Vertices PV,
const char **  param_names 
)
Param_Polyhedron* Polyhedron2Param_SimplifiedDomain ( Polyhedron **  Din,
Polyhedron Cin,
int  working_space,
Polyhedron **  CEq,
Matrix **  CT 
)
Param_Polyhedron* Polyhedron2Param_Vertices ( Polyhedron Din,
Polyhedron Cin,
int  working_space 
)

Definition at line 1546 of file polyparam.c.

References Find_m_faces(), _Param_Polyhedron::nbV, POL_ENSURE_FACETS, and POL_ENSURE_VERTICES.

Referenced by main().

void Print_Vertex ( FILE *  DST,
Matrix V,
const char **  param_names 
)
static Polyhedron* Recession_Cone ( Polyhedron P,
unsigned  nvar,
unsigned  MaxRays 
) [static]
static void scan_m_face ( int  pos,
int  nb_un,
Polyhedron D,
unsigned int *  mf 
) [static]
static SatMatrix* SMAlloc ( int  rows,
int  cols 
) [static]

Definition at line 229 of file polyparam.c.

References assert, SatMatrix::NbColumns, SatMatrix::NbRows, SatMatrix::p, p, and SatMatrix::p_init.

Referenced by Poly2Sat().

static void SMFree ( SatMatrix matrix  )  [static]

Definition at line 268 of file polyparam.c.

References SatMatrix::p, and SatMatrix::p_init.

Referenced by Find_m_faces().

static void SMPrint ( SatMatrix matrix  )  [static]

Definition at line 252 of file polyparam.c.

References SatMatrix::NbColumns, SatMatrix::NbRows, SatMatrix::p, and p.

Referenced by Find_m_faces().

static int TestRank ( Matrix Mat  )  [static]
Matrix* VertexCT ( Matrix V,
Matrix CT 
)

Variable Documentation

Definition at line 288 of file polyparam.c.

int cntbit[256]
Initial value:
 {                              
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,

1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,

1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,

2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8 }

Definition at line 521 of file polyparam.c.

Referenced by count_sat().

Matrix* CTest [static]

Definition at line 293 of file polyparam.c.

unsigned int* egalite [static]

Definition at line 290 of file polyparam.c.

Referenced by Find_m_faces(), and scan_m_face().

int KD [static]

Definition at line 298 of file polyparam.c.

Referenced by Find_m_faces(), and traite_m_face().

int m [static]

Definition at line 282 of file polyparam.c.

Referenced by Chernikova(), compute_enode(), Find_m_faces(), main(), scan_m_face(), and traite_m_face().

int m_dim [static]

Definition at line 283 of file polyparam.c.

Referenced by Find_m_faces(), and scan_m_face().

int nbPV [static]

Definition at line 301 of file polyparam.c.

Referenced by Find_m_faces(), main(), and traite_m_face().

int nr [static]

Definition at line 303 of file polyparam.c.

Matrix * Pi [static]

Definition at line 291 of file polyparam.c.

Matrix* PiInv [static]

Definition at line 294 of file polyparam.c.

Matrix* PiTest [static]

Definition at line 292 of file polyparam.c.

Definition at line 302 of file polyparam.c.

Matrix* RaysDi [static]

Definition at line 296 of file polyparam.c.

int ws [static]
Matrix* Xi [static]

Definition at line 291 of file polyparam.c.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/classEhrhart.html0000644000175000017500000000444611303257447023500 0ustar sylvestresylvestre polylib: Ehrhart Class Reference

Ehrhart Class Reference


Detailed Description

The following are mainly for debug purposes. You shouldn't need to change anything for daily usage...

you may define each macro independently

  1. define EDEBUG minimal debug
  2. define EDEBUG1 prints enumeration points
  3. define EDEBUG11 prints number of points
  4. define EDEBUG2 prints domains
  5. define EDEBUG21 prints more domains
  6. define EDEBUG3 prints systems of equations that are solved
  7. define EDEBUG4 prints message for degree reduction
  8. define EDEBUG5 prints result before simplification
  9. define EDEBUG6 prints domains in Preprocess
  10. define EDEBUG61 prints even more in Preprocess
  11. define EDEBUG62 prints domains in Preprocess2

The documentation for this class was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetique_8h_source.html0000644000175000017500000027667011303257445030460 0ustar sylvestresylvestre polylib: arithmetique.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testCompressParms_8c-source.html0000644000175000017500000015174011253740770026443 0ustar sylvestresylvestre polylib: testCompressParms.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x70.html0000644000175000017500000001367411303257450024254 0ustar sylvestresylvestre polylib: Class Members
 

- p -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x6e.html0000644000175000017500000001137611303257447023342 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- n -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8c.html0000644000175000017500000024453711303257447023043 0ustar sylvestresylvestre polylib: Lattice.c File Reference

Lattice.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Classes

struct  factor

Functions

static factor allfactors (int num)
void PrintLatticeUnion (FILE *fp, char *format, LatticeUnion *Head)
void LatticeUnion_Free (LatticeUnion *Head)
LatticeUnionLatticeUnion_Alloc (void)
Bool sameAffinepart (Lattice *A, Lattice *B)
LatticeEmptyLattice (int dimension)
Bool isEmptyLattice (Lattice *A)
Bool isLinear (Lattice *A)
void AffineHermite (Lattice *A, Lattice **H, Matrix **U)
void AffineSmith (Lattice *A, Lattice **U, Lattice **V, Lattice **Diag)
LatticeHomogenise (Lattice *A, Bool Forward)
Bool LatticeIncludes (Lattice *A, Lattice *B)
Bool sameLattice (Lattice *A, Lattice *B)
LatticeChangeLatticeDimension (Lattice *A, int dimension)
LatticeExtractLinearPart (Lattice *A)
static MatrixMakeDioEqforInter (Matrix *A, Matrix *B)
LatticeLatticeIntersection (Lattice *X, Lattice *Y)
static void AddLattice (LatticeUnion *, Matrix *, Matrix *, int, int)
LatticeUnionSplitLattice (Matrix *, Matrix *, Matrix *)
LatticeUnionLattice2LatticeUnion (Lattice *X, Lattice *Y)
LatticeUnionLatticeDifference (Lattice *A, Lattice *B)
 Method :.
int FindHermiteBasisofDomain (Polyhedron *A, Matrix **B)
LatticeLatticeImage (Lattice *A, Matrix *M)
LatticeLatticePreimage (Lattice *L, Matrix *G)
Bool IsLattice (Matrix *m)
Bool isfulldim (Matrix *m)
static Bool Simplify (LatticeUnion **InputList, LatticeUnion **ResultList, int dim)
static int LinearPartCompare (const void *A, const void *B)
static void LinearPartSort (LatticeUnion *Head)
static int AffinePartCompare (const void *A, const void *B)
static void AffinePartSort (LatticeUnion *List)
static Bool AlmostSameAffinePart (LatticeUnion *A, LatticeUnion *B)
static Bool AffinePartSimplify (LatticeUnion *curlist, LatticeUnion **newlist)
static Bool SameLinearPart (LatticeUnion *A, LatticeUnion *B)
LatticeUnionLatticeSimplify (LatticeUnion *latlist)
int intcompare (const void *a, const void *b)
static int polylib_sqrt (int i)

Function Documentation

static void AddLattice ( LatticeUnion Head,
Matrix B1,
Matrix B2,
int  NumofTimes,
int  Colnumber 
) [static]
static int AffinePartCompare ( const void *  A,
const void *  B 
) [static]

Definition at line 1484 of file Lattice.c.

References matrix::NbRows, p, value_gt, and value_lt.

Referenced by AffinePartSort().

static Bool AffinePartSimplify ( LatticeUnion curlist,
LatticeUnion **  newlist 
) [static]
static void AffinePartSort ( LatticeUnion List  )  [static]

Definition at line 1506 of file Lattice.c.

References AffinePartCompare(), LatticeUnion::M, and LatticeUnion::next.

Referenced by AffinePartSimplify().

static factor allfactors ( int  num  )  [static]

Definition at line 1677 of file Lattice.c.

References factor::count, factor::fac, intcompare(), and polylib_sqrt().

Referenced by Simplify().

static Bool AlmostSameAffinePart ( LatticeUnion A,
LatticeUnion B 
) [static]

Definition at line 1530 of file Lattice.c.

References False, LatticeUnion::M, matrix::NbColumns, matrix::NbRows, matrix::p, True, and value_ne.

Referenced by AffinePartSimplify().

Lattice* ChangeLatticeDimension ( Lattice A,
int  dimension 
)
Lattice* EmptyLattice ( int  dimension  ) 
Lattice* ExtractLinearPart ( Lattice A  ) 

Definition at line 439 of file Lattice.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by Lattice2LatticeUnion().

Lattice* Homogenise ( Lattice A,
Bool  Forward 
)
int intcompare ( const void *  a,
const void *  b 
)

Definition at line 1663 of file Lattice.c.

Referenced by allfactors().

Bool isfulldim ( Matrix m  ) 

Definition at line 1267 of file Lattice.c.

References False, Hermite(), Matrix_Free(), matrix::NbRows, matrix::p, True, and value_zero_p.

Referenced by ZPolyhedron_Alloc().

Bool IsLattice ( Matrix m  ) 

Definition at line 1239 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, value_notone_p, and value_notzero_p.

Referenced by ZPolyhedron_Alloc().

Bool isLinear ( Lattice A  ) 

Definition at line 145 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, and value_notzero_p.

Referenced by AffineHermite().

Bool LatticeIncludes ( Lattice A,
Lattice B 
)

Definition at line 340 of file Lattice.c.

References AffineHermite(), False, LatticeIntersection(), Matrix_Free(), sameLattice(), and True.

Referenced by main(), and ZPolyhedronIncludes().

LatticeUnion* LatticeSimplify ( LatticeUnion latlist  ) 
LatticeUnion* LatticeUnion_Alloc ( void   ) 

Definition at line 60 of file Lattice.c.

References LatticeUnion::M, and LatticeUnion::next.

Referenced by main().

void LatticeUnion_Free ( LatticeUnion Head  ) 

Definition at line 44 of file Lattice.c.

References LatticeUnion::M, Matrix_Free(), and LatticeUnion::next.

Referenced by main(), and ZDomainSimplify().

static int LinearPartCompare ( const void *  A,
const void *  B 
) [static]

Definition at line 1429 of file Lattice.c.

References matrix::NbRows, p, value_gt, and value_lt.

Referenced by LinearPartSort().

static void LinearPartSort ( LatticeUnion Head  )  [static]

Definition at line 1452 of file Lattice.c.

References LinearPartCompare(), LatticeUnion::M, and LatticeUnion::next.

Referenced by LatticeSimplify().

static Matrix * MakeDioEqforInter ( Matrix A,
Matrix B 
) [static]

Definition at line 569 of file Lattice.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, value_oppose, and value_set_si.

Referenced by LatticeIntersection().

static int polylib_sqrt ( int  i  )  [static]

Definition at line 1739 of file Lattice.c.

Referenced by allfactors().

void PrintLatticeUnion ( FILE *  fp,
char *  format,
LatticeUnion Head 
)

Definition at line 32 of file Lattice.c.

References LatticeUnion::M, Matrix_Print(), and LatticeUnion::next.

Referenced by main().

Bool sameAffinepart ( Lattice A,
Lattice B 
)

Definition at line 74 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, and value_ne.

Bool sameLattice ( Lattice A,
Lattice B 
)
static Bool SameLinearPart ( LatticeUnion A,
LatticeUnion B 
) [static]

Definition at line 1620 of file Lattice.c.

References False, LatticeUnion::M, matrix::NbRows, matrix::p, True, and value_ne.

Referenced by LatticeSimplify().

LatticeUnion * SplitLattice ( Matrix B1,
Matrix B2,
Matrix C 
)

Definition at line 901 of file Lattice.c.

References AddLattice(), LatticeUnion::M, matrix::NbRows, LatticeUnion::next, and matrix::p.

Referenced by Lattice2LatticeUnion().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2folderopen.png0000644000175000017500000000040511303257450023615 0ustar sylvestresylvestre‰PNG  IHDR_Tq-PLTEÿÿÿÿÿÿÿÿÀÀÀ€€€€€’2ŒåtRNS@æØftEXtSoftwaregif2png 2.4.2£^G|IDATxÚ…A‚0E_õ-SÖÆ××Ò ±Þÿ: !¢oóþÿ‹€ j<*aÅÓCiÁ´«ùp¬ƒÊ»û¤‹®&F¶LèÃú³}¨ë¥FTFN*âΕ=º°d“…› sqƒu×ò§ò ûÒëCùýò ¤)ËÚG¬DIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/structLatticeUnion.html0000644000175000017500000001400511303257447024710 0ustar sylvestresylvestre polylib: LatticeUnion Struct Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylibgmp_8h_source.html0000644000175000017500000000651011303257446025203 0ustar sylvestresylvestre polylib: polylibgmp.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testlib_8c-source.html0000644000175000017500000004200311253740770024402 0ustar sylvestresylvestre polylib: testlib.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polylib_8h.html0000644000175000017500000000713711303257447023126 0ustar sylvestresylvestre polylib: polylib.h File Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x6d.html0000644000175000017500000001120511303257450024323 0ustar sylvestresylvestre polylib: Class Members
 

- m -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testCompressParms_8c_source.html0000644000175000017500000015663311303257446026532 0ustar sylvestresylvestre polylib: testCompressParms.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x73.html0000644000175000017500000002240011303257447023247 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- s -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_vars.html0000644000175000017500000002416511303257450023525 0ustar sylvestresylvestre polylib: Class Members
 

- a -

- c -

- e -

- k -

- l -

  • linear_exception_debug_mode : errors.c
  • linear_exception_verbose : errors.c
  • linear_number_of_exception_thrown : errors.c

- m -

- n -

- o -

- p -

- r -

- s -

- t -

- u -

- w -

- x -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x6e.html0000644000175000017500000001015311303257447024345 0ustar sylvestresylvestre polylib: Class Members
 

- n -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/annotated.html0000644000175000017500000000703511303257447023027 0ustar sylvestresylvestre polylib: Class List
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x69.html0000644000175000017500000001704711303257447023267 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- i -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_eval.html0000644000175000017500000000465011303257450023476 0ustar sylvestresylvestre polylib: Class Members
 

Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Vertex-members.html0000644000175000017500000000433311303257447026777 0ustar sylvestresylvestre polylib: Member List

_Param_Vertex Member List

This is the complete list of members for _Param_Vertex, including all inherited members.
Domain_Param_Vertex
Facets_Param_Vertex
next_Param_Vertex
Vertex_Param_Vertex

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8c-source.html0000644000175000017500000015437511253740767025572 0ustar sylvestresylvestre polylib: matrix_addon.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polylib32_8h-source.html0000644000175000017500000000262711253740767024576 0ustar sylvestresylvestre polylib: polylib32.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs.html0000644000175000017500000000740211303257450023466 0ustar sylvestresylvestre polylib: Class Members
 

- _ -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetic__errors_8h_source.html0000644000175000017500000003454511303257445031634 0ustar sylvestresylvestre polylib: arithmetic_errors.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8c.html0000644000175000017500000020457311303257447023767 0ustar sylvestresylvestre polylib: Zpolyhedron.c File Reference

Zpolyhedron.c File Reference

#include <polylib/polylib.h>
#include <stdlib.h>

Go to the source code of this file.

Classes

struct  forsimplify

Typedefs

typedef struct forsimplify ForSimplify

Functions

static ZPolyhedronZPolyhedronIntersection (ZPolyhedron *, ZPolyhedron *)
static ZPolyhedronZPolyhedron_Copy (ZPolyhedron *A)
static void ZPolyhedron_Free (ZPolyhedron *Zpol)
static ZPolyhedronZPolyhedronDifference (ZPolyhedron *, ZPolyhedron *)
static ZPolyhedronZPolyhedronImage (ZPolyhedron *, Matrix *)
static ZPolyhedronZPolyhedronPreimage (ZPolyhedron *, Matrix *)
static ZPolyhedronAddZPolytoZDomain (ZPolyhedron *A, ZPolyhedron *Head)
static void ZPolyhedronPrint (FILE *fp, const char *format, ZPolyhedron *A)
Bool isEmptyZPolyhedron (ZPolyhedron *Zpol)
ZPolyhedronZPolyhedron_Alloc (Lattice *Lat, Polyhedron *Poly)
void ZDomain_Free (ZPolyhedron *Head)
ZPolyhedronZDomain_Copy (ZPolyhedron *Head)
static ZPolyhedronAddZPoly2ZDomain (ZPolyhedron *Zpol, ZPolyhedron *Result)
ZPolyhedronEmptyZPolyhedron (int dimension)
Bool ZDomainIncludes (ZPolyhedron *A, ZPolyhedron *B)
Bool ZPolyhedronIncludes (ZPolyhedron *A, ZPolyhedron *B)
void ZDomainPrint (FILE *fp, const char *format, ZPolyhedron *A)
ZPolyhedronZDomainUnion (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainIntersection (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainDifference (ZPolyhedron *A, ZPolyhedron *B)
ZPolyhedronZDomainImage (ZPolyhedron *A, Matrix *Func)
ZPolyhedronZDomainPreimage (ZPolyhedron *A, Matrix *Func)
void CanonicalForm (ZPolyhedron *Zpol, ZPolyhedron **Result, Matrix **Basis)
ZPolyhedronIntegraliseLattice (ZPolyhedron *A)
ZPolyhedronZDomainSimplify (ZPolyhedron *ZDom)
ZPolyhedronSplitZpolyhedron (ZPolyhedron *ZPol, Lattice *B)

Typedef Documentation

typedef struct forsimplify ForSimplify

Function Documentation

static ZPolyhedron* AddZPoly2ZDomain ( ZPolyhedron Zpol,
ZPolyhedron Result 
) [static]
Bool isEmptyZPolyhedron ( ZPolyhedron Zpol  ) 
ZPolyhedron* ZDomain_Copy ( ZPolyhedron Head  ) 
void ZDomain_Free ( ZPolyhedron Head  ) 
ZPolyhedron* ZDomainImage ( ZPolyhedron A,
Matrix Func 
)
Bool ZDomainIncludes ( ZPolyhedron A,
ZPolyhedron B 
)

Definition at line 289 of file Zpolyhedron.c.

References False, isEmptyZPolyhedron(), True, ZDomain_Free(), and ZDomainDifference().

void ZDomainPrint ( FILE *  fp,
const char *  format,
ZPolyhedron A 
)

Definition at line 338 of file Zpolyhedron.c.

References ZPolyhedron::next, ZDomainPrint(), and ZPolyhedronPrint().

Referenced by main(), and ZDomainPrint().

ZPolyhedron* ZDomainUnion ( ZPolyhedron A,
ZPolyhedron B 
)

Definition at line 374 of file Zpolyhedron.c.

References AddZPolytoZDomain(), and ZPolyhedron::next.

Referenced by main(), and ZDomainSimplify().

static ZPolyhedron * ZPolyhedron_Copy ( ZPolyhedron A  )  [static]
Bool ZPolyhedronIncludes ( ZPolyhedron A,
ZPolyhedron B 
)
static void ZPolyhedronPrint ( FILE *  fp,
const char *  format,
ZPolyhedron A 
) [static]

Definition at line 358 of file Zpolyhedron.c.

References ZPolyhedron::Lat, Matrix_Print(), matrix::NbRows, ZPolyhedron::P, and Polyhedron_Print().

Referenced by ZDomainPrint().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8h_source.html0000644000175000017500000002411011303257446025025 0ustar sylvestresylvestre polylib: polyparam.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x76.html0000644000175000017500000002202311303257450024260 0ustar sylvestresylvestre polylib: Class Members
 

- v -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structinterval-members.html0000644000175000017500000000476611303257447025603 0ustar sylvestresylvestre polylib: Member List

interval Member List

This is the complete list of members for interval, including all inherited members.
MaxDinterval
MaxIinterval
MaxNinterval
MinDinterval
MinIinterval
MinNinterval

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2folderclosed.png0000644000175000017500000000040311303257450024123 0ustar sylvestresylvestre‰PNG  IHDR_Tq-PLTEÿÿÿÿÿÿÀÀÀ€€€€€Bî@átRNS@æØftEXtSoftwaregif2png 2.4.2£^G}IDATxÚŽÁ „0C#ŒwûB½+øemï¢ÍÿÿŠ3­îZö°Úð†¦ˆ@S‚š×QB%®zv íêyyIsáò2_I¹í#` Í6fä@K´ÛÛåîx ù–m‹¢nùPd¦p¶P Óx†˜¦Þ]%Íþ߯ ˜`½ IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x69.html0000644000175000017500000000733311303257450024257 0ustar sylvestresylvestre polylib: Class Members
Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8h-source.html0000644000175000017500000002031411253740770024746 0ustar sylvestresylvestre polylib: polyparam.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x68.html0000644000175000017500000000672611303257450024263 0ustar sylvestresylvestre polylib: Class Members
 

- h -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/files.html0000644000175000017500000003164411303257447022157 0ustar sylvestresylvestre polylib: File Index
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8c_source.html0000644000175000017500000067743711303257445024432 0ustar sylvestresylvestre polylib: Lattice.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/types_8h_source.html0000644000175000017500000011502611303257446024174 0ustar sylvestresylvestre polylib: types.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8h.html0000644000175000017500000043520711303257447023642 0ustar sylvestresylvestre polylib: polyhedron.h File Reference

polyhedron.h File Reference

Go to the source code of this file.

Defines

#define POL_ENSURE_INEQUALITIES(P)
#define POL_ENSURE_POINTS(P)
#define POL_ENSURE_FACETS(P)
#define POL_ENSURE_VERTICES(P)

Functions

void Polyhedron_Compute_Dual (Polyhedron *P)
PolyhedronDomainConstraintSimplify (Polyhedron *P, unsigned MaxRays)
PolyhedronAddConstraints (Value *Con, unsigned NbConstraints, Polyhedron *Pol, unsigned NbMaxRays)
PolyhedronAddPolyToDomain (Polyhedron *Pol, Polyhedron *PolDomain)
PolyhedronAddRays (Value *Ray2, unsigned NbRay2, Polyhedron *Pol1, unsigned NbMaxRays)
Polyhedronalign_context (Polyhedron *Pol, int align_dimension, int NbMaxRays)
PolyhedronConstraints2Polyhedron (Matrix *Constraints, unsigned NbMaxRays)
 Given a matrix of constraints ('Constraints'), construct and return a polyhedron.
PolyhedronDisjoint_Domain (Polyhedron *Pol, int flag, unsigned NbMaxRays)
PolyhedronDomainAddConstraints (Polyhedron *Pol, Matrix *Mat, unsigned NbMaxRays)
PolyhedronDomainAddRays (Polyhedron *Pol, Matrix *Ray, unsigned NbMaxConstrs)
PolyhedronDomainConvex (Polyhedron *Pol, unsigned NbMaxConstrs)
IntervalDomainCost (Polyhedron *Pol, Value *Cost)
PolyhedronDomainDifference (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomainImage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxConstrs)
PolyhedronDomainIntersection (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomainPreimage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxRays)
PolyhedronDomainSimplify (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronStras_DomainSimplify (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomainUnion (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomain_Copy (Polyhedron *Pol)
void Domain_Free (Polyhedron *Pol)
void Domain_PrintConstraints (FILE *Dst, const char *Format, Polyhedron *Pol)
PolyhedronEmpty_Polyhedron (unsigned Dimension)
int Gauss (Matrix *Mat, int NbEq, int Dimension)
int lower_upper_bounds (int pos, Polyhedron *P, Value *context, Value *LBp, Value *UBp)
MatrixPolyhedron2Constraints (Polyhedron *Pol)
MatrixPolyhedron2Rays (Polyhedron *Pol)
int PolyhedronIncludes (Polyhedron *Pol1, Polyhedron *Pol2)
PolyhedronPolyhedron_Alloc (unsigned Dimension, unsigned NbConstraints, unsigned NbRays)
PolyhedronPolyhedron_Copy (Polyhedron *Pol)
void Polyhedron_Free (Polyhedron *Pol)
PolyhedronPolyhedron_Image (Polyhedron *Pol, Matrix *Func, unsigned NbMaxConstrs)
PolyhedronPolyhedron_Preimage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxRays)
void Polyhedron_Print (FILE *Dst, const char *Format, const Polyhedron *Pol)
void Polyhedron_PrintConstraints (FILE *Dst, const char *Format, Polyhedron *Pol)
PolyhedronPolyhedron_Scan (Polyhedron *D, Polyhedron *C, unsigned MAXRAYS)
void PolyPrint (Polyhedron *Pol)
PolyhedronRays2Polyhedron (Matrix *Ray, unsigned NbMaxConstrs)
 Given a matrix of rays 'Ray', create and return a polyhedron.
PolyhedronSubConstraint (Value *Con, Polyhedron *Pol, unsigned NbMaxRays, int Pass)
PolyhedronUniverse_Polyhedron (unsigned Dimension)

Define Documentation

#define POL_ENSURE_INEQUALITIES (  ) 
#define POL_ENSURE_POINTS (  ) 
Value:

Definition at line 26 of file polyhedron.h.

Referenced by Polyhedron2Rays().


Function Documentation

Polyhedron* Constraints2Polyhedron ( Matrix Constraints,
unsigned  NbMaxRays 
)

Given a matrix of constraints ('Constraints'), construct and return a polyhedron.

Parameters:
Constraints Constraints (may be modified!)
NbMaxRays Estimated number of rays in the ray matrix of the polyhedron.
Returns:
newly allocated Polyhedron

Definition at line 1906 of file polyhedron.c.

References any_exception_error, CATCH, Chernikova(), polyhedron::Constraint, ConstraintSimplify(), Empty_Polyhedron(), errormsg1(), ExchangeRows(), F_SET, First_Non_Zero(), Gauss(), ImplicitEqualities(), Matrix_Alloc(), Matrix_Free(), Matrix_Print(), matrix::NbColumns, polyhedron::NbEq, SatMatrix::NbRows, matrix::NbRows, matrix::p, SatMatrix::p_init, matrix::p_Init, POL_INEQUALITIES, POL_INTEGER, POL_ISSET, POL_NO_DUAL, POL_VALID, Polyhedron_Alloc(), Polyhedron_Free(), Polyhedron_Print(), polyhedron::Ray, Remove_Redundants(), RETHROW, Sat, SMAlloc(), SMFree(), SMPrint(), SMVector_Init, SortConstraints(), TRY, UNCATCH, Universe_Polyhedron(), value_clear, value_init, value_notzero_p, value_set_si, value_zero_p, Vector_Copy(), and Vector_Set().

Referenced by AddConstraints(), dehomogenize_polyhedron(), DomainSimplify(), Ehrhart_Quick_Apx(), Elim_Columns(), eliminable_vars(), Enumeration_zero(), Find_m_faces(), homogenize(), LexSmaller(), main(), Param_Vertices_Print(), Polyhedron_Compute_Dual(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Remove_parm_eqs(), Recession_Cone(), Stras_DomainSimplify(), test_Constraints_fullDimensionize(), test_Constraints_Remove_parm_eqs(), test_Polyhedron_Remove_parm_eqs(), and Union_Read().

void Domain_PrintConstraints ( FILE *  Dst,
const char *  Format,
Polyhedron Pol 
)

Definition at line 4638 of file polyhedron.c.

References polyhedron::next, and Polyhedron_PrintConstraints().

Polyhedron* DomainAddConstraints ( Polyhedron Pol,
Matrix Mat,
unsigned  NbMaxRays 
)
Polyhedron* DomainAddRays ( Polyhedron Pol,
Matrix Ray,
unsigned  NbMaxConstrs 
)
Polyhedron* DomainConstraintSimplify ( Polyhedron P,
unsigned  MaxRays 
)
Polyhedron* DomainConvex ( Polyhedron Pol,
unsigned  NbMaxConstrs 
)
Polyhedron* DomainUnion ( Polyhedron Pol1,
Polyhedron Pol2,
unsigned  NbMaxRays 
)
int Gauss ( Matrix Mat,
int  NbEq,
int  Dimension 
)
Matrix* Polyhedron2Rays ( Polyhedron Pol  ) 
void Polyhedron_PrintConstraints ( FILE *  Dst,
const char *  Format,
Polyhedron Pol 
)
void PolyPrint ( Polyhedron Pol  ) 

Definition at line 1704 of file polyhedron.c.

References Polyhedron_Print().

Polyhedron* Rays2Polyhedron ( Matrix Ray,
unsigned  NbMaxConstrs 
)

Given a matrix of rays 'Ray', create and return a polyhedron.

Parameters:
Ray Rays (may be modified!)
NbMaxConstrs Estimated number of constraints in the polyhedron.
Returns:
newly allocated Polyhedron

Definition at line 2083 of file polyhedron.c.

References any_exception_error, CATCH, Chernikova(), Empty_Polyhedron(), errormsg1(), Matrix_Alloc(), Matrix_Free(), Matrix_Print(), matrix::NbColumns, matrix::NbRows, matrix::p, matrix::p_Init, POL_ISSET, POL_NO_DUAL, Polyhedron_Free(), Polyhedron_Print(), Remove_Redundants(), RETHROW, Sat, SMAlloc(), SMFree(), SMPrint(), SMVector_Init, TransformSat(), TRY, UNCATCH, value_set_si, and Vector_Set().

Referenced by main(), Polyhedron_Image(), and traite_m_face().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x74.html0000644000175000017500000001456611303257447023266 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- t -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x72.html0000644000175000017500000000746211303257450024254 0ustar sylvestresylvestre polylib: Class Members
Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/param_8c.html0000644000175000017500000001117411303257447022543 0ustar sylvestresylvestre polylib: param.c File Reference

param.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

const char ** Read_ParamNames (FILE *in, int m)
void Free_ParamNames (const char **params, int m)

Function Documentation

void Free_ParamNames ( const char **  params,
int  m 
)

Definition at line 81 of file param.c.

Referenced by main().

const char** Read_ParamNames ( FILE *  in,
int  m 
)

Definition at line 31 of file param.c.

References PCHAR, and s.

Referenced by main(), and Union_Read().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8c.html0000644000175000017500000017666411303257446024656 0ustar sylvestresylvestre polylib: compress_parms.c File Reference

compress_parms.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define dbgCompParm   0
 
Id
compress_parms.c,v 1.32 2006/11/03 17:34:26 skimo Exp

#define dbgCompParmMore   0
#define dbgStart(a)
#define dbgEnd(a)

Functions

Matrixint_ker (Matrix *M)
 Given a full-row-rank nxm matrix M made of m row-vectors), computes the basis K (made of n-m column-vectors) of the integer kernel of the rows of M so we have: M.K = 0.
static void linearInter (Matrix *A, Matrix *B, Matrix **I, Matrix **Lb)
 Computes the intersection of two linear lattices, whose base vectors are respectively represented in A and B.
void Equalities_integerSolution (Matrix *Eqs, Matrix **I)
 Given a system of equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.
void Equalities_validityLattice (Matrix *Eqs, int a, Matrix **vl)
 Computes the validity lattice of a set of equalities.
void Constraints_removeElimCols (Matrix *M, unsigned int nbVars, unsigned int *elimParms, Matrix **newM)
 Eliminate the columns corresponding to a list of eliminated parameters.
void Constraints_fullDimensionize (Matrix **M, Matrix **C, Matrix **VL, Matrix **Eqs, Matrix **ParmEqs, unsigned int **elimVars, unsigned int **elimParms, int maxRays)
 Eliminates all the equalities in a set of constraints and returns the set of constraints defining a full-dimensional polyhedron, such that there is a bijection between integer points of the original polyhedron and these of the resulting (projected) polyhedron).
void Lattice_extractSubLattice (Matrix *lat, unsigned int k, Matrix **subLat)
 Given a matrix that defines a full-dimensional affine lattice, returns the affine sub-lattice spanned in the k first dimensions.
Matrixaffine_periods (Matrix *M, Matrix *d)
 Computes the overall period of the variables I for (MI) mod |d|, where M is a matrix and |d| a vector.
void Equalities_intModBasis (Matrix *B, Matrix *C, Matrix *d, Matrix **imb)
 Given an integer matrix B with m rows and integer m-vectors C and d, computes the basis of the integer solutions to (BN+C) mod d = 0 (1).
Matrixint_mod_basis (Matrix *B, Matrix *C, Matrix *d)
 kept here for backwards compatiblity.
Matrixcompress_parms (Matrix *E, int nbParms)
 Given a parameterized constraints matrix with m equalities, computes the compression matrix G such that there is an integer solution in the variables space for each value of N', with N = G N' (N are the "nb_parms" parameters).
MatrixConstraints_Remove_parm_eqs (Matrix **M1, Matrix **Ctxt1, int renderSpace, unsigned int **elimParms)
 Removes the equalities that involve only parameters, by eliminating some parameters in the polyhedron's constraints and in the context.
PolyhedronPolyhedron_Remove_parm_eqs (Polyhedron **P, Polyhedron **C, int renderSpace, unsigned int **elimParms, int maxRays)
 Removes equalities involving only parameters, but starting from a Polyhedron and its context.
Matrixfull_dimensionize (Matrix const *M, int nbParms, Matrix **validityLattice)
 Given a matrix with m parameterized equations, compress the nb_parms parameters and n-m variables so that m variables are integer, and transform the variable space into a n-m space by eliminating the m variables (using the equalities) the variables to be eliminated are chosen automatically by the function.

Define Documentation

#define dbgCompParm   0

Id
compress_parms.c,v 1.32 2006/11/03 17:34:26 skimo Exp

The integer points in a parametric linear subspace of Q^n are generally lying on a sub-lattice of Z^n. Functions here use and compute validity lattices, i.e. lattices induced on a set of variables by such equalities involving another set of integer variables.

Author:
B. Meister 12/2003-2006 meister@icps.u-strasbg.fr LSIIT -ICPS UMR 7005 CNRS Louis Pasteur University (ULP), Strasbourg, France debug flags (2 levels)

Definition at line 38 of file compress_parms.c.

Referenced by Constraints_fullDimensionize(), Equalities_integerSolution(), Equalities_validityLattice(), full_dimensionize(), int_ker(), and linearInter().

#define dbgCompParmMore   0
#define dbgEnd (  ) 
Value:
if (dbgCompParmMore) { printf(" -- end "); \
                                         printf(#a);      \
                                         printf(" --\n"); } \
                                         while(0)

Definition at line 45 of file compress_parms.c.

Referenced by Lattice_extractSubLattice().

#define dbgStart (  ) 
Value:
if (dbgCompParmMore) { printf(" -- begin "); \
                                           printf(#a);        \
                                           printf(" --\n"); }   \
                                           while(0)

Definition at line 41 of file compress_parms.c.

Referenced by Lattice_extractSubLattice().


Function Documentation

Matrix* affine_periods ( Matrix M,
Matrix d 
)

Computes the overall period of the variables I for (MI) mod |d|, where M is a matrix and |d| a vector.

Produce a diagonal matrix S = (s_k) where s_k is the overall period of i_k

Parameters:
M the set of affine functions of I (row-vectors)
d the column-vector representing the modulos

Definition at line 548 of file compress_parms.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, value_divexact, value_gcd, value_init, value_lcm, and value_set_si.

Matrix* compress_parms ( Matrix E,
int  nbParms 
)

Given a parameterized constraints matrix with m equalities, computes the compression matrix G such that there is an integer solution in the variables space for each value of N', with N = G N' (N are the "nb_parms" parameters).

Parameters:
E a matrix of parametric equalities
nb_parms the number of parameters Note: this function is mostly here for backwards compatibility. Prefer the use of Equalities_validityLattice.

Definition at line 630 of file compress_parms.c.

References Equalities_validityLattice(), and matrix::NbColumns.

Referenced by full_dimensionize().

void Constraints_fullDimensionize ( Matrix **  M,
Matrix **  C,
Matrix **  VL,
Matrix **  Eqs,
Matrix **  ParmEqs,
unsigned int **  elimVars,
unsigned int **  elimParms,
int  maxRays 
)

Eliminates all the equalities in a set of constraints and returns the set of constraints defining a full-dimensional polyhedron, such that there is a bijection between integer points of the original polyhedron and these of the resulting (projected) polyhedron).

If VL is set to NULL, this funciton allocates it. Else, it assumes that (*VL) points to a matrix of the right size.

The following things are done:

  1. remove equalities involving only parameters, and remove as many parameters as there are such equalities. From that, the list of eliminated parameters elimParms is built.
  2. remove equalities that involve variables. This requires a compression of the parameters and of the other variables that are not eliminated. The affine compresson is represented by matrix VL (for validity lattice) and is such that (N I 1)^T = VL.(N' I' 1), where N', I' are integer (they are the parameters and variables after compression).

Definition at line 386 of file compress_parms.c.

References assert, Constraints_compressLastVars, Constraints_eliminateFirstVars, Constraints_permute(), Constraints_removeElimCols(), Constraints_removeParmEqs, dbgCompParm, dbgCompParmMore, Equalities_validityLattice(), find_a_permutation(), Matrix_Alloc(), Matrix_Free(), Matrix_identity(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, split_constraints(), value_assign, and value_set_si.

Referenced by test_Constraints_fullDimensionize().

Matrix* Constraints_Remove_parm_eqs ( Matrix **  M1,
Matrix **  Ctxt1,
int  renderSpace,
unsigned int **  elimParms 
)

Removes the equalities that involve only parameters, by eliminating some parameters in the polyhedron's constraints and in the context.

Updates M and Ctxt.

Parameters:
M1 the polyhedron's constraints
Ctxt1 the constraints of the polyhedron's context
renderSpace tells if the returned equalities must be expressed in the parameters space (renderSpace=0) or in the combined var/parms space (renderSpace = 1)
elimParms the list of parameters that have been removed: an array whose 1st element is the number of elements in the list. (returned)
Returns:
the system of equalities that involve only parameters.

Definition at line 649 of file compress_parms.c.

References eliminate_var_with_constr(), First_Non_Zero(), Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, value_cmp_si, value_notzero_p, value_set_si, value_zero_p, and Vector_Copy().

Referenced by Constraints_EhrhartQuickApx(), Polyhedron_Remove_parm_eqs(), and test_Constraints_Remove_parm_eqs().

void Constraints_removeElimCols ( Matrix M,
unsigned int  nbVars,
unsigned int *  elimParms,
Matrix **  newM 
)

Eliminate the columns corresponding to a list of eliminated parameters.

Eliminates the columns corresponding to a list of eliminated parameters.

Parameters:
M the constraints matrix whose columns are to be removed
nbVars an offset to be added to the ranks of the variables to be removed
elimParms the list of ranks of the variables to be removed
newM (output) the matrix without the removed columns

Definition at line 335 of file compress_parms.c.

References assert, Matrix_Alloc(), Matrix_clone(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, and Vector_Copy().

Referenced by Constraints_fullDimensionize().

void Equalities_integerSolution ( Matrix Eqs,
Matrix **  I 
)

Given a system of equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.

Given a system of non-redundant equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.

pre-condition: the equalities are full-row rank (without the constant part)

Parameters:
Eqs the system of equations (as constraints)
I a feasible integer solution if it exists, else NULL. Allocated if initially set to NULL, else reused.

Definition at line 181 of file compress_parms.c.

References dbgCompParm, dbgCompParmMore, ensureMatrix, left_hermite(), MatInverse(), Matrix_Alloc(), Matrix_Free(), Matrix_oppose(), Matrix_Product(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, value_clear, value_init, value_notzero_p, value_pdivision, value_pmodulus, and value_set_si.

Referenced by Equalities_validityLattice().

void Equalities_intModBasis ( Matrix B,
Matrix C,
Matrix d,
Matrix **  imb 
)

Given an integer matrix B with m rows and integer m-vectors C and d, computes the basis of the integer solutions to (BN+C) mod d = 0 (1).

This is an affine lattice (G): (N 1)^T= G(N' 1)^T, forall N' in Z^b. If there is no solution, returns NULL.

Parameters:
B B, a (m x b) matrix
C C, a (m x 1) integer matrix
d d, a (1 x m) integer matrix
imb the affine (b+1)x(b+1) basis of solutions, in the homogeneous form. Allocated if initially set to NULL, reused if not.

Definition at line 592 of file compress_parms.c.

References Equalities_validityLattice(), Matrix_Alloc(), Matrix_copySubMatrix(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by int_mod_basis().

void Equalities_validityLattice ( Matrix Eqs,
int  a,
Matrix **  vl 
)

Computes the validity lattice of a set of equalities.

I.e., the lattice induced on the last b variables by the equalities involving the first a integer existential variables. The submatrix of Eqs that concerns only the existential variables (so the first a columns) is assumed to be full-row rank.

Parameters:
Eqs the equalities
a the number of existential integer variables, placed as first variables
vl the (returned) validity lattice, in homogeneous form. It is allocated if initially set to null, or reused if already allocated.

Definition at line 271 of file compress_parms.c.

References dbgCompParm, ensureMatrix, Equalities_integerSolution(), left_hermite(), linearInter(), Matrix_copySubMatrix(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, show_matrix, value_assign, value_set_si, and Vector_Set().

Referenced by compress_parms(), Constraints_fullDimensionize(), and Equalities_intModBasis().

Matrix* full_dimensionize ( Matrix const *  M,
int  nbParms,
Matrix **  validityLattice 
)

Given a matrix with m parameterized equations, compress the nb_parms parameters and n-m variables so that m variables are integer, and transform the variable space into a n-m space by eliminating the m variables (using the equalities) the variables to be eliminated are chosen automatically by the function.

Deprecated. Try to use Constraints_fullDimensionize instead.

Parameters:
M the constraints
the number of parameters
validityLattice the the integer lattice underlying the integer solutions.

Definition at line 904 of file compress_parms.c.

References compress_parms(), dbgCompParm, find_a_permutation(), Identity_Matrix(), Matrix_Alloc(), Matrix_Free(), mpolyhedron_compress_last_vars(), mpolyhedron_eliminate_first_variables(), mpolyhedron_permute(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, split_constraints(), value_assign, and value_set_si.

Referenced by Ehrhart_Quick_Apx().

Matrix* int_ker ( Matrix M  ) 

Given a full-row-rank nxm matrix M made of m row-vectors), computes the basis K (made of n-m column-vectors) of the integer kernel of the rows of M so we have: M.K = 0.

given a full-row-rank nxm matrix M(made of row-vectors), computes the basis K (made of n-m column-vectors) of the integer kernel of M so we have: M.K = 0

Definition at line 56 of file compress_parms.c.

References dbgCompParm, dbgCompParmMore, left_hermite(), Matrix_Alloc(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, matrix::p, right_hermite(), show_matrix, and Vector_IsZero().

Matrix* int_mod_basis ( Matrix B,
Matrix C,
Matrix d 
)

kept here for backwards compatiblity.

Wrapper to Equalities_intModBasis()

Definition at line 614 of file compress_parms.c.

References Equalities_intModBasis().

void Lattice_extractSubLattice ( Matrix lat,
unsigned int  k,
Matrix **  subLat 
)

Given a matrix that defines a full-dimensional affine lattice, returns the affine sub-lattice spanned in the k first dimensions.

Useful for instance when you only look for the parameters' validity lattice.

Parameters:
lat the original full-dimensional lattice
subLat the sublattice

Definition at line 499 of file compress_parms.c.

References assert, dbgCompParmMore, dbgEnd, dbgStart, Lattice_extractSubLattice(), left_hermite(), Matrix_Alloc(), Matrix_Copy(), Matrix_copySubMatrix(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, show_matrix, and value_set_si.

Referenced by Lattice_extractSubLattice(), and test_Constraints_fullDimensionize().

static void linearInter ( Matrix A,
Matrix B,
Matrix **  I,
Matrix **  Lb 
) [static]

Computes the intersection of two linear lattices, whose base vectors are respectively represented in A and B.

If I and/or Lb is set to NULL, then the matrix is allocated. Else, the matrix is assumed to be allocated already. I and Lb are rk x rk, where rk is the rank of A (or B).

Parameters:
A the full-row rank matrix whose column-vectors are the basis for the first linear lattice.
B the matrix whose column-vectors are the basis for the second linear lattice.
Lb the matrix such that B.Lb = I, where I is the intersection.
Returns:
their intersection.

Definition at line 119 of file compress_parms.c.

References assert, dbgCompParm, left_hermite(), Matrix_Alloc(), Matrix_copySubMatrix(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, value_set_si, and value_zero_p.

Referenced by Equalities_validityLattice().

Polyhedron* Polyhedron_Remove_parm_eqs ( Polyhedron **  P,
Polyhedron **  C,
int  renderSpace,
unsigned int **  elimParms,
int  maxRays 
)

Removes equalities involving only parameters, but starting from a Polyhedron and its context.

Parameters:
P the polyhedron
C P's context
renderSpace,: 0 for the parameter space, =1 for the combined space. Polylib's usual workspace.

Definition at line 856 of file compress_parms.c.

References Constraints2Polyhedron(), Constraints_Remove_parm_eqs(), F_ISSET, FL_INIT, Matrix_Free(), matrix::NbRows, POL_INEQUALITIES, POL_NO_DUAL, POL_VALID, Polyhedron2Constraints(), and Polyhedron_Free().

Referenced by test_Polyhedron_Remove_parm_eqs().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__lower__bound_8c-source.html0000644000175000017500000002421611253740767027302 0ustar sylvestresylvestre polylib: ehrhart_lower_bound.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8h_source.html0000644000175000017500000005330111303257446025210 0ustar sylvestresylvestre polylib: polyhedron.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8h_source.html0000644000175000017500000003144711303257446027311 0ustar sylvestresylvestre polylib: matrix_permutations.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x69.html0000644000175000017500000001550411303257447024276 0ustar sylvestresylvestre polylib: Class Members
 

- i -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8h_source.html0000644000175000017500000001147311303257445025633 0ustar sylvestresylvestre polylib: eval_ehrhart.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8c_source.html0000644000175000017500000041245311303257446025344 0ustar sylvestresylvestre polylib: Zpolyhedron.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x6c.html0000644000175000017500000002070511303257447023334 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- l -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x78.html0000644000175000017500000000726611303257447023271 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- x -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8c_source.html0000644000175000017500000010661711303257446027306 0ustar sylvestresylvestre polylib: matrix_permutations.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8h-source.html0000644000175000017500000002354311253740767024344 0ustar sylvestresylvestre polylib: Lattice.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/Zpolytest_8c.html0000644000175000017500000001662711303257447023470 0ustar sylvestresylvestre polylib: Zpolytest.c File Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/vector_8c.html0000644000175000017500000023245111303257447022750 0ustar sylvestresylvestre polylib: vector.c File Reference

vector.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define MAX_CACHE_SIZE   20

Functions

void Factorial (int n, Value *fact)
void Binomial (int n, int p, Value *result)
void CNP (int a, int b, Value *result)
void Gcd (Value a, Value b, Value *result)
int First_Non_Zero (Value *p, unsigned length)
VectorVector_Alloc (unsigned length)
void Vector_Free (Vector *vector)
void Vector_Print (FILE *Dst, const char *Format, Vector *vector)
VectorVector_Read ()
void Vector_Set (Value *p, int n, unsigned length)
void Vector_Exchange (Value *p1, Value *p2, unsigned length)
void Vector_Copy (Value *p1, Value *p2, unsigned length)
void Vector_Add (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Sub (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Or (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Scale (Value *p1, Value *p2, Value lambda, unsigned length)
void Vector_AntiScale (Value *p1, Value *p2, Value lambda, unsigned length)
void Vector_Oppose (Value *p1, Value *p2, unsigned len)
void Inner_Product (Value *p1, Value *p2, unsigned length, Value *ip)
void Vector_Max (Value *p, unsigned length, Value *max)
void Vector_Min (Value *p, unsigned length, Value *min)
void Vector_Combine (Value *p1, Value *p2, Value *p3, Value lambda, Value mu, unsigned length)
int Vector_Equal (Value *Vec1, Value *Vec2, unsigned n)
void Vector_Min_Not_Zero (Value *p, unsigned length, int *index, Value *min)
void Vector_Gcd (Value *p, unsigned length, Value *min)
void Vector_Map (Value *p1, Value *p2, Value *p3, unsigned length, Value *(*f)(Value, Value))
void Vector_Normalize (Value *p, unsigned length)
void Vector_Normalize_Positive (Value *p, int length, int pos)
void Vector_Reduce (Value *p, unsigned length, void(*f)(Value, Value *), Value *r)
void Vector_Sort (Value *vector, unsigned n)
int ConstraintSimplify (Value *old, Value *newp, int len, Value *v)
int Vector_IsZero (Value *v, unsigned length)
Value * value_alloc (int want, int *got)
void value_free (Value *p, int size)

Variables

struct {
   Value *   p
   int   size
cache [MAX_CACHE_SIZE]
static int cache_size = 0

Define Documentation

#define MAX_CACHE_SIZE   20

Definition at line 758 of file vector.c.

Referenced by value_free().


Function Documentation

void Binomial ( int  n,
int  p,
Value *  result 
)

Definition at line 61 of file vector.c.

References Factorial(), value_clear, value_division, value_init, value_multiply, and value_set_si.

void CNP ( int  a,
int  b,
Value *  result 
)

Definition at line 89 of file vector.c.

References value_clear, value_division, value_init, value_multiply, and value_set_si.

int ConstraintSimplify ( Value *  old,
Value *  newp,
int  len,
Value *  v 
)
void Factorial ( int  n,
Value *  fact 
)

Definition at line 43 of file vector.c.

References value_clear, value_init, value_multiply, and value_set_si.

Referenced by Binomial().

int First_Non_Zero ( Value *  p,
unsigned  length 
)
void Gcd ( Value  a,
Value  b,
Value *  result 
)

Definition at line 116 of file vector.c.

References value_absolute, value_assign, value_clear, value_init, value_modulus, and value_notzero_p.

Referenced by Lcm3().

void Inner_Product ( Value *  p1,
Value *  p2,
unsigned  length,
Value *  ip 
)

Definition at line 384 of file vector.c.

References value_addmul, value_multiply, and value_set_si.

Referenced by lower_upper_bounds(), and test_Constraints_fullDimensionize().

Value* value_alloc ( int  want,
int *  got 
)

Definition at line 765 of file vector.c.

References cache, size, value_init, and Vector_Set().

Referenced by Matrix_Alloc(), and Polyhedron_Alloc().

void value_free ( Value *  p,
int  size 
)

Definition at line 807 of file vector.c.

References cache, MAX_CACHE_SIZE, and value_clear.

Referenced by Matrix_Free(), and Polyhedron_Free().

void Vector_Add ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 286 of file vector.c.

References value_addto.

void Vector_AntiScale ( Value *  p1,
Value *  p2,
Value  lambda,
unsigned  length 
)
void Vector_Combine ( Value *  p1,
Value *  p2,
Value *  p3,
Value  lambda,
Value  mu,
unsigned  length 
)
int Vector_Equal ( Value *  Vec1,
Value *  Vec2,
unsigned  n 
)

Definition at line 453 of file vector.c.

References value_ne.

Referenced by Remove_Redundants().

void Vector_Exchange ( Value *  p1,
Value *  p2,
unsigned  length 
)

Definition at line 256 of file vector.c.

References value_swap.

Referenced by Chernikova(), Gauss4(), GaussSimplify(), hermite(), RaySort(), Remove_Redundants(), and SortConstraints().

int Vector_IsZero ( Value *  v,
unsigned  length 
)

Definition at line 747 of file vector.c.

References value_notzero_p, value_set_si, and value_zero_p.

Referenced by eliminable_vars(), and int_ker().

void Vector_Map ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length,
Value *(*)(Value, Value)  f 
)

Definition at line 547 of file vector.c.

References value_assign.

void Vector_Max ( Value *  p,
unsigned  length,
Value *  max 
)

Definition at line 399 of file vector.c.

References value_assign, and value_maximum.

void Vector_Min ( Value *  p,
unsigned  length,
Value *  min 
)

Definition at line 416 of file vector.c.

References value_assign, and value_minimum.

void Vector_Min_Not_Zero ( Value *  p,
unsigned  length,
int *  index,
Value *  min 
)
void Vector_Normalize ( Value *  p,
unsigned  length 
)
void Vector_Normalize_Positive ( Value *  p,
int  length,
int  pos 
)
void Vector_Oppose ( Value *  p1,
Value *  p2,
unsigned  len 
)

Definition at line 373 of file vector.c.

References value_oppose.

Referenced by Gauss4().

void Vector_Or ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 324 of file vector.c.

References value_orto.

void Vector_Print ( FILE *  Dst,
const char *  Format,
Vector vector 
)

Definition at line 193 of file vector.c.

References Vector::p, p, P_VALUE_FMT, Vector::Size, and value_print.

Referenced by main().

Vector* Vector_Read ( void   ) 

Definition at line 215 of file vector.c.

References errormsg1(), Vector::p, p, value_read, and Vector_Alloc().

void Vector_Reduce ( Value *  p,
unsigned  length,
void(*)(Value, Value *)  f,
Value *  r 
)

Definition at line 604 of file vector.c.

References value_assign.

void Vector_Scale ( Value *  p1,
Value *  p2,
Value  lambda,
unsigned  length 
)

Definition at line 343 of file vector.c.

References value_multiply.

Referenced by Param_Polyhedron_Scale_Integer(), and Remove_Redundants().

void Vector_Sort ( Value *  vector,
unsigned  n 
)

Definition at line 620 of file vector.c.

References value_assign, value_clear, value_init, and value_lt.

void Vector_Sub ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 305 of file vector.c.

References value_subtract.


Variable Documentation

struct { ... } cache[MAX_CACHE_SIZE] [static]

Referenced by value_alloc(), and value_free().

int cache_size = 0 [static]

Definition at line 763 of file vector.c.

int size

Definition at line 761 of file vector.c.

Referenced by GenParamPolyhedron(), and value_alloc().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8h.html0000644000175000017500000005556511303257447025741 0ustar sylvestresylvestre polylib: matrix_permutations.h File Reference

matrix_permutations.h File Reference

#include <polylib/polylib.h>
#include <assert.h>

Go to the source code of this file.

Functions

unsigned int nb_bits (unsigned long long int x)
 Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron or Constraints).
unsigned int * permutation_inverse (unsigned int *perm, unsigned int nb_elems)
 Gives the inverse permutation vector of a permutation vector.
Matrixmtransformation_permute (Matrix *transf, unsigned int *permutation)
 Given a linear tranformation on initial variables, and a variable permutation, computes the tranformation for the permuted variables.
Matrixmpolyhedron_permute (Matrix *polyh, unsigned int *permutation)
 permutes the variables of the constraints of a polyhedron
void Constraints_permute (Matrix *C, unsigned int *perm, Matrix **Cp)
 permutes the variables of the constraints of a polyhedron
unsigned long long int eliminable_vars (Matrix *Eqs, unsigned start, unsigned end)
 Given a set of equalities, find a set of variables that can be eliminated using these equalities.
unsigned int * find_a_permutation (Matrix *Eqs, unsigned int nb_parms)
 finds a valid permutation : for a set of m equations, find m variables that will be put at the beginning (to be eliminated).
unsigned int * permutation_for_full_dim2 (unsigned int *vars_to_keep, unsigned int nb_keep, unsigned int nb_vars_parms, unsigned int nb_parms)
 computes the permutation of variables and parameters, according to some variables to keep.

Function Documentation

void Constraints_permute ( Matrix C,
unsigned int *  perm,
Matrix **  Cp 
)

permutes the variables of the constraints of a polyhedron

Parameters:
C the original set of constraints
perm a permutation vector
Cp (returned) the set of constraints whose variables are permuted. Allocated if set to NULL, assumed to be already allocated if not.

Definition at line 104 of file matrix_permutations.c.

References assert, Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by Constraints_fullDimensionize().

unsigned long long int eliminable_vars ( Matrix Eqs,
unsigned  start,
unsigned  end 
)

Given a set of equalities, find a set of variables that can be eliminated using these equalities.

The variables that we agree to eliminate are in a zone of contiguous variables (or parameters).

Notes:

  • brute force, surely enhanceable algorithm
  • limited number of variables in the zone: limit = bitwidth of long long
Parameters:
Eqs the matrix of equalities.
start the rank of the first variable (inclusive) of the zone in Eqs
end the rank of the last variable (inclusive) of the zone return a bitfield where bits set to one define the variables to eliminate

Definition at line 134 of file matrix_permutations.c.

References assert, Constraints2Polyhedron(), emptyQ, Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), nb_bits(), matrix::NbColumns, matrix::NbRows, matrix::p, Polyhedron_Free(), right_hermite(), value_assign, value_notzero_p, and Vector_IsZero().

Referenced by find_a_permutation().

unsigned int* find_a_permutation ( Matrix Eqs,
unsigned int  nb_parms 
)

finds a valid permutation : for a set of m equations, find m variables that will be put at the beginning (to be eliminated).

Note: inherits the limited the number of variables from eliminable_vars

Definition at line 213 of file matrix_permutations.c.

References eliminable_vars(), matrix::NbColumns, and matrix::NbRows.

Referenced by Constraints_fullDimensionize(), and full_dimensionize().

Matrix* mpolyhedron_permute ( Matrix polyh,
unsigned int *  permutation 
)

permutes the variables of the constraints of a polyhedron

Parameters:
polyh the constraints of the polyhedron
permutation a permutation vector

Definition at line 85 of file matrix_permutations.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by full_dimensionize().

Matrix* mtransformation_permute ( Matrix transf,
unsigned int *  permutation 
)

Given a linear tranformation on initial variables, and a variable permutation, computes the tranformation for the permuted variables.

perm is a vector giving the new "position of the k^th variable, k \in [1..n] we can call it a "permutation vector if you wish transf[x][y] -> permuted[permutation(x)][permutation(y)]

Definition at line 66 of file matrix_permutations.c.

References assert, Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

unsigned int nb_bits ( unsigned long long int  x  ) 

Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron or Constraints).

Author:
B. Meister

Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron or Constraints).

Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron)

Author:
B. Meister LSIIT -ICPS UMR 7005 CNRS Louis Pasteur University (ULP), Strasbourg, France

Permutations are just indirection vectors: the k^th element of a permutation vector is the position of the k^th variable in the permuted object. utility function : bit count (i know, there are faster methods)

Definition at line 36 of file matrix_permutations.c.

References n.

Referenced by eliminable_vars().

unsigned int* permutation_for_full_dim2 ( unsigned int *  vars_to_keep,
unsigned int  nb_keep,
unsigned int  nb_vars_parms,
unsigned int  nb_parms 
)

computes the permutation of variables and parameters, according to some variables to keep.

put the variables not to be kept at the beginning, then the parameters and finally the variables to be kept. strongly related to the function compress_to_full_dim2

Definition at line 256 of file matrix_permutations.c.

unsigned int* permutation_inverse ( unsigned int *  perm,
unsigned int  nb_elems 
)

Gives the inverse permutation vector of a permutation vector.

Parameters:
perm the permutation vector
 

Definition at line 51 of file matrix_permutations.c.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structfactor.html0000644000175000017500000000734111303257447023575 0ustar sylvestresylvestre polylib: factor Struct Reference

factor Struct Reference

List of all members.

Public Attributes

int count
int * fac

Detailed Description

Definition at line 22 of file Lattice.c.


Member Data Documentation

Definition at line 23 of file Lattice.c.

Referenced by allfactors(), and Simplify().

Definition at line 24 of file Lattice.c.

Referenced by allfactors(), and Simplify().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8c-source.html0000644000175000017500000023214411253740767025210 0ustar sylvestresylvestre polylib: NormalForms.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ftv2blank.png0000644000175000017500000000025611303257450022553 0ustar sylvestresylvestre‰PNG  IHDR–ÖGtRNS”ý®tEXtSoftwaregif2png 2.4.2£^G%tEXtCommentUlead GIF SmartSaver Ver 2.0!ø×^SIDATxÚc8À€€0àBx<2Ër|IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8h.html0000644000175000017500000001265411303257447023200 0ustar sylvestresylvestre polylib: SolveDio.h File Reference

SolveDio.h File Reference

Go to the source code of this file.

Functions

int SolveDiophantine (Matrix *M, Matrix **U, Vector **X)

Function Documentation

int SolveDiophantine ( Matrix M,
Matrix **  U,
Vector **  X 
)

Case when rank < Number of Columns;

Solved the equtions

When rank < hermi->NbRows; Verifying whether the solution agrees with the remaining n-rank rows as well.

Definition at line 81 of file SolveDio.c.

References Hermite(), Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), Matrix_Inverse(), min, matrix::NbColumns, matrix::NbRows, p, matrix::p, RearrangeMatforSolveDio(), value_addmul, value_assign, value_clear, value_division, value_init, value_modulus, value_ne, value_notzero_p, value_oppose, value_set_si, value_subtract, and Vector_Alloc().

Referenced by findHermiteBasis(), LatticeIntersection(), LatticePreimage(), and main().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x64.html0000644000175000017500000001074611303257450024254 0ustar sylvestresylvestre polylib: Class Members
Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8h.html0000644000175000017500000012037211303257447023455 0ustar sylvestresylvestre polylib: polyparam.h File Reference

polyparam.h File Reference

Go to the source code of this file.

Functions

void Compute_PDomains (Param_Domain *PD, int nb_domains, int working_space)
Param_PolyhedronGenParamPolyhedron (Polyhedron *Pol, Matrix *Rays)
void Param_Domain_Free (Param_Domain *PD)
void Param_Polyhedron_Free (Param_Polyhedron *P)
void Param_Vertices_Free (Param_Vertices *PV)
void Param_Vertices_Print (FILE *DST, Param_Vertices *PV, const char **param_names)
PolyhedronPDomainDifference (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronPDomainIntersection (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
Param_PolyhedronPolyhedron2Param_Domain (Polyhedron *Din, Polyhedron *Cin, int working_space)
Param_PolyhedronPolyhedron2Param_SimplifiedDomain (Polyhedron **Din, Polyhedron *Cin, int working_space, Polyhedron **CEq, Matrix **CT)
Param_PolyhedronPolyhedron2Param_Vertices (Polyhedron *Din, Polyhedron *Cin, int working_space)
void Print_Domain (FILE *DST, Polyhedron *D, const char **param_names)
void Print_Vertex (FILE *DST, Matrix *V, const char **param_names)
MatrixVertexCT (Matrix *V, Matrix *CT)
void Param_Polyhedron_Scale_Integer (Param_Polyhedron *PP, Polyhedron **P, Value *det, unsigned MaxRays)

Function Documentation

void Param_Domain_Free ( Param_Domain PD  ) 
void Param_Vertices_Free ( Param_Vertices PV  ) 
void Param_Vertices_Print ( FILE *  DST,
Param_Vertices PV,
const char **  param_names 
)
Param_Polyhedron* Polyhedron2Param_SimplifiedDomain ( Polyhedron **  Din,
Polyhedron Cin,
int  working_space,
Polyhedron **  CEq,
Matrix **  CT 
)
Param_Polyhedron* Polyhedron2Param_Vertices ( Polyhedron Din,
Polyhedron Cin,
int  working_space 
)

Definition at line 1546 of file polyparam.c.

References Find_m_faces(), _Param_Polyhedron::nbV, POL_ENSURE_FACETS, and POL_ENSURE_VERTICES.

Referenced by main().

void Print_Vertex ( FILE *  DST,
Matrix V,
const char **  param_names 
)
Matrix* VertexCT ( Matrix V,
Matrix CT 
)

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8h.html0000644000175000017500000001436511303257446023314 0ustar sylvestresylvestre polylib: errormsg.h File Reference
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib_8h_source.html0000644000175000017500000001606311303257446024503 0ustar sylvestresylvestre polylib: polylib.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8c-source.html0000644000175000017500000037766711253740766026170 0ustar sylvestresylvestre polylib: compress_parms.c Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8h.html0000644000175000017500000002147111303257447024125 0ustar sylvestresylvestre polylib: ext_ehrhart.h File Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2plastnode.png0000644000175000017500000000024511303257450023453 0ustar sylvestresylvestre‰PNG  IHDRÃÃÄy PLTEÿÿÿ€€€<^»,tRNS@æØftEXtSoftwaregif2png 2.4.2£^G(IDATxÚc` 0ach(`2µ BY 1,nÁÂåíu§IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/alpha_8c_source.html0000644000175000017500000024027411303257445024113 0ustar sylvestresylvestre polylib: alpha.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/r2p_8c.html0000644000175000017500000000744711303257447022156 0ustar sylvestresylvestre polylib: r2p.c File Reference

r2p.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define WS   0

Functions

int main ()

Define Documentation

#define WS   0

Definition at line 21 of file r2p.c.


Function Documentation

int main (  ) 

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/param_8c-source.html0000644000175000017500000001577011253740767024055 0ustar sylvestresylvestre polylib: param.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/r2p_8c_source.html0000644000175000017500000001313711303257446023526 0ustar sylvestresylvestre polylib: r2p.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetic__errors_8h_source.html0000644000175000017500000003271111303257445032313 0ustar sylvestresylvestre polylib: arithmetic_errors.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8h_source.html0000644000175000017500000004411511303257446025640 0ustar sylvestresylvestre polylib: matrix_addon.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x66.html0000644000175000017500000001151411303257450024250 0ustar sylvestresylvestre polylib: Class Members
 

- f -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8h-source.html0000644000175000017500000003770211253740766026154 0ustar sylvestresylvestre polylib: compress_parms.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x67.html0000644000175000017500000001145711303257447023264 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- g -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testCompressParms_8c.html0000644000175000017500000006522511303257447025147 0ustar sylvestresylvestre polylib: testCompressParms.c File Reference

testCompressParms.c File Reference

#include <polylib/polylib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

Go to the source code of this file.

Defines

#define dbg   1
 
Id
testCompressParms.c,v 1.4 2006/09/18 03:09:03 meister Exp

#define TEST(a)
#define maxRays   200

Functions

int main (int argc, char **argv)
int test_Constraints_Remove_parm_eqs (Matrix *A, Matrix *B)
 extracts the equalities involving the parameters only, try to introduce them back and compare the two polyhedra.
int test_Polyhedron_Remove_parm_eqs (Matrix *A, Matrix *B)
 extracts the equalities holding on the parameters only, try to introduce them back and compare the two polyhedra.
void valuesWithoutElim (Matrix *origParms, unsigned int *elimParms, Matrix **newParms)
 Eliminates certain parameters from a vector of values for parameters.
unsigned int namesWithoutElim (const char **parms, unsigned nbParms, unsigned int *elimParms, const char ***newParms)
 takes a list of parameter names, a list ofparameters to eliminate, and returns the list of parameters without the eliminated ones.
int test_Constraints_fullDimensionize (Matrix *A, Matrix *B, unsigned int nbSamples)
 Tests Constraints_fullDimensionize by comparing the Ehrhart polynomials.

Variables

const char * origNames []

Define Documentation

#define dbg   1

Id
testCompressParms.c,v 1.4 2006/09/18 03:09:03 meister Exp

Test routines for kernel/compress_parms.c functions

Author:
B. Meister, 3/2006

Definition at line 34 of file testCompressParms.c.

Referenced by namesWithoutElim(), and test_Constraints_fullDimensionize().

#define TEST (  ) 
Value:
if (isOk = a) { \
                  printf(#a" tested ok.\n"); \
                } \
                else { \
                  printf(#a" NOT OK\n"); \
                }

Definition at line 36 of file testCompressParms.c.

Referenced by main().


Function Documentation

unsigned int namesWithoutElim ( const char **  parms,
unsigned  nbParms,
unsigned int *  elimParms,
const char ***  newParms 
)

takes a list of parameter names, a list ofparameters to eliminate, and returns the list of parameters without the eliminated ones.

Parameters:
parms the original parameter names
nbParms the number of original parmaeters
elimParms the array-list of indices of parameters to eliminate (first element set to the number of its elements)
newParms the returned list of parm names. Allocated if set to NULL, reused if not.
Returns:
the number of names in the returned list.

Definition at line 234 of file testCompressParms.c.

References dbg.

Referenced by test_Constraints_fullDimensionize().

int test_Constraints_fullDimensionize ( Matrix A,
Matrix B,
unsigned int  nbSamples 
)

Tests Constraints_fullDimensionize by comparing the Ehrhart polynomials.

Parameters:
A the input set of constraints
B the corresponding context
the number of samples to generate for the test
Returns:
1 if the Ehrhart polynomial had the same value for the full-dimensional and non-full-dimensional sets of constraints, for their corresponding sample parameters values.

Definition at line 273 of file testCompressParms.c.

References compute_poly(), Constraints2Polyhedron(), Constraints_fullDimensionize(), dbg, Enumeration_Free(), Enumeration_zero(), _enumeration::EP, Inner_Product(), Lattice_extractSubLattice(), MatInverse(), Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), maxRays, namesWithoutElim(), matrix::NbColumns, matrix::NbRows, origNames, matrix::p, P_VALUE_FMT, Polyhedron_Enumerate(), Polyhedron_Free(), print_evalue(), show_matrix, value_addto, value_clear, value_eq, value_init, value_pdivision, value_print, value_set_si, value_subtract, value_zero_p, and valuesWithoutElim().

Referenced by main().

int test_Constraints_Remove_parm_eqs ( Matrix A,
Matrix B 
)

extracts the equalities involving the parameters only, try to introduce them back and compare the two polyhedra.

Reads a polyhedron and a context.

Definition at line 71 of file testCompressParms.c.

References align_context(), Constraints2Polyhedron(), Constraints_Remove_parm_eqs(), polyhedron::Dimension, DomainIntersection(), Matrix_Copy(), Matrix_Free(), maxRays, Polyhedron_Free(), PolyhedronIncludes(), and show_matrix.

Referenced by main().

int test_Polyhedron_Remove_parm_eqs ( Matrix A,
Matrix B 
)

extracts the equalities holding on the parameters only, try to introduce them back and compare the two polyhedra.

Reads a polyhedron and a context.

Definition at line 139 of file testCompressParms.c.

References align_context(), Constraints2Polyhedron(), polyhedron::Dimension, DomainIntersection(), Matrix_Copy(), Matrix_Free(), maxRays, Polyhedron_Free(), Polyhedron_Remove_parm_eqs(), and PolyhedronIncludes().

Referenced by main().

void valuesWithoutElim ( Matrix origParms,
unsigned int *  elimParms,
Matrix **  newParms 
)

Eliminates certain parameters from a vector of values for parameters.

Parameters:
origParms the initial vector of values of parameters
elimParms the list of parameters to be eliminated in the vector
newParms the vector of values without the eliminated ones.

Definition at line 201 of file testCompressParms.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::p, and value_assign.

Referenced by test_Constraints_fullDimensionize().


Variable Documentation

const char* origNames[]
Initial value:
        {"n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"}

Definition at line 45 of file testCompressParms.c.

Referenced by test_Constraints_fullDimensionize().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x64.html0000644000175000017500000002434211303257447023256 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- d -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8h_source.html0000644000175000017500000001324311303257445026057 0ustar sylvestresylvestre polylib: homogenization.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x75.html0000644000175000017500000000725311303257450024267 0ustar sylvestresylvestre polylib: Class Members
 

- u -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__enode.html0000644000175000017500000002113011303257447023677 0ustar sylvestresylvestre polylib: _enode Struct Reference

_enode Struct Reference

#include <types.h>

List of all members.

Public Attributes

enode_type type
int size
int pos
evalue arr [1]

Detailed Description

Definition at line 197 of file types.h.


Member Data Documentation

Definition at line 200 of file types.h.

Referenced by aep_evalue(), compute_enode(), ecopy(), eequal(), emul(), new_enode(), and print_enode().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8c.html0000644000175000017500000002652011303257447024247 0ustar sylvestresylvestre polylib: eval_ehrhart.c File Reference

eval_ehrhart.c File Reference

#include <stdio.h>
#include <math.h>
#include <assert.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int in_domain (Polyhedron *P, Value *list_args)
static double compute_enode (enode *p, Value *list_args)
double compute_evalue (evalue *e, Value *list_args)
Value * compute_poly (Enumeration *en, Value *list_args)

Function Documentation

static double compute_enode ( enode p,
Value *  list_args 
) [static]
double compute_evalue ( evalue e,
Value *  list_args 
)

Definition at line 135 of file eval_ehrhart.c.

References compute_enode(), _evalue::d, value_notone_p, and value_notzero_p.

Referenced by compute_enode(), and compute_poly().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib_8h-source.html0000644000175000017500000001543011253740767024425 0ustar sylvestresylvestre polylib: polylib.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/structlinear__exception__holder.html0000644000175000017500000001527611303257447027510 0ustar sylvestresylvestre polylib: linear_exception_holder Struct Reference

linear_exception_holder Struct Reference

List of all members.

Public Attributes

int what
jmp_buf where
const char * function
const char * file
int line

Detailed Description

Definition at line 165 of file errors.c.


Member Data Documentation

Definition at line 178 of file errors.c.

Referenced by push_exception_on_stack().

Definition at line 177 of file errors.c.

Referenced by push_exception_on_stack().

Definition at line 179 of file errors.c.

Referenced by push_exception_on_stack().

Definition at line 169 of file errors.c.

Referenced by push_exception_on_stack().

Definition at line 173 of file errors.c.

Referenced by push_exception_on_stack().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testehrhart_8c_source.html0000644000175000017500000006373611303257446025372 0ustar sylvestresylvestre polylib: testehrhart.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__union_8c-source.html0000644000175000017500000005026111253740767025753 0ustar sylvestresylvestre polylib: ehrhart_union.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetic__errors_8h.html0000644000175000017500000004753611303257446030261 0ustar sylvestresylvestre polylib: arithmetic_errors.h File Reference

arithmetic_errors.h File Reference

#include <setjmp.h>

Go to the source code of this file.

Defines

#define linear_arithmetic_error_included
#define __CURRENT_FUNCTION_NAME__   "<unknown>"
#define EXCEPTION   extern unsigned int
#define THROW(what)   (throw_exception(what, __CURRENT_FUNCTION_NAME__, __FILE__, __LINE__))
#define CATCH(what)
#define UNCATCH(what)
#define TRY   else
#define RETHROW()   THROW(the_last_just_thrown_exception)

Typedefs

typedef void(* exception_callback_t )(const char *, const char *, int)

Variables

unsigned int the_last_just_thrown_exception

Define Documentation

#define __CURRENT_FUNCTION_NAME__   "<unknown>"

Definition at line 113 of file source/arith/arithmetic_errors.h.

#define EXCEPTION   extern unsigned int

Definition at line 117 of file source/arith/arithmetic_errors.h.

#define linear_arithmetic_error_included

Definition at line 94 of file source/arith/arithmetic_errors.h.

#define THROW ( what   )     (throw_exception(what, __CURRENT_FUNCTION_NAME__, __FILE__, __LINE__))

Definition at line 119 of file source/arith/arithmetic_errors.h.


Typedef Documentation

typedef void(* exception_callback_t)(const char *, const char *, int)

Definition at line 98 of file source/arith/arithmetic_errors.h.


Variable Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Matop_8h.html0000644000175000017500000011616711303257447022540 0ustar sylvestresylvestre polylib: Matop.h File Reference

Matop.h File Reference

Go to the source code of this file.

Functions

void Lcm3 (Value a, Value b, Value *c)
MatrixAddANullColumn (Matrix *M)
MatrixAddANullRow (Matrix *M)
void ExchangeColumns (Matrix *M, int Column1, int Column2)
void ExchangeRows (Matrix *M, int Row1, int Row2)
int findHermiteBasis (Matrix *M, Matrix **Result)
MatrixIdentity (unsigned size)
Bool isinHnf (Matrix *A)
Bool isIntegral (Matrix *A)
Value * Lcm (Value i, Value j)
MatrixMatrix_Copy (Matrix const *Src)
void PutColumnFirst (Matrix *X, int Columnnumber)
void PutColumnLast (Matrix *X, int Columnnumber)
void PutRowFirst (Matrix *X, int Rownumber)
void PutRowLast (Matrix *X, int Rownumber)
MatrixRemoveNColumns (Matrix *M, int FirstColumnnumber, int NumColumns)
MatrixRemoveColumn (Matrix *M, int Columnnumber)
MatrixRemoveRow (Matrix *M, int Rownumber)
MatrixTranspose (Matrix *A)

Function Documentation

Matrix* AddANullColumn ( Matrix M  ) 
Matrix* AddANullRow ( Matrix M  ) 
void ExchangeColumns ( Matrix M,
int  Column1,
int  Column2 
)

Definition at line 90 of file Matop.c.

References matrix::NbRows, matrix::p, and value_swap.

void ExchangeRows ( Matrix M,
int  Row1,
int  Row2 
)

Definition at line 72 of file Matop.c.

References matrix::NbColumns, matrix::p, value_assign, value_clear, and value_init.

Referenced by Constraints2Polyhedron(), and RearrangeMatforSolveDio().

Matrix* Identity ( unsigned  size  ) 
Bool isIntegral ( Matrix A  ) 
Value* Lcm ( Value  i,
Value  j 
)

Definition at line 45 of file Matop.c.

References Lcm3(), and value_init.

void Lcm3 ( Value  a,
Value  b,
Value *  c 
)

Definition at line 22 of file Matop.c.

References Gcd(), value_absolute, value_assign, value_clear, value_division, value_init, value_multiply, and value_zero_p.

Referenced by Lcm().

void PutColumnFirst ( Matrix X,
int  Columnnumber 
)

Definition at line 230 of file Matop.c.

References matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutColumnLast ( Matrix X,
int  Columnnumber 
)

Definition at line 249 of file Matop.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutRowFirst ( Matrix X,
int  Rownumber 
)

Definition at line 210 of file Matop.c.

References matrix::NbColumns, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutRowLast ( Matrix X,
int  Rownumber 
)

Definition at line 188 of file Matop.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

Matrix* RemoveColumn ( Matrix M,
int  Columnnumber 
)

Definition at line 340 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Referenced by FindHermiteBasisofDomain().

Matrix* RemoveNColumns ( Matrix M,
int  FirstColumnnumber,
int  NumColumns 
)

Definition at line 322 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Matrix* RemoveRow ( Matrix M,
int  Rownumber 
)

Definition at line 303 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Referenced by findHermiteBasis().

Matrix* Transpose ( Matrix A  ) 

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x6c.html0000644000175000017500000001562611303257447024355 0ustar sylvestresylvestre polylib: Class Members
 

- l -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8h_source.html0000644000175000017500000002051211303257446024327 0ustar sylvestresylvestre polylib: matrix.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__evalue-members.html0000644000175000017500000000306511303257447025525 0ustar sylvestresylvestre polylib: Member List

_evalue Member List

This is the complete list of members for _evalue, including all inherited members.
d_evalue

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structforsimplify-members.html0000644000175000017500000000373611303257447026316 0ustar sylvestresylvestre polylib: Member List

forsimplify Member List

This is the complete list of members for forsimplify, including all inherited members.
LatUniforsimplify
nextforsimplify
Polforsimplify

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Polyhedron__union-members.html0000644000175000017500000000352311303257447027735 0ustar sylvestresylvestre polylib: Member List

_Polyhedron_union Member List

This is the complete list of members for _Polyhedron_union, including all inherited members.
next_Polyhedron_union
pt_Polyhedron_union

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8h-source.html0000644000175000017500000002562011253740767027232 0ustar sylvestresylvestre polylib: matrix_permutations.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/alpha_8h_source.html0000644000175000017500000001430711303257445024114 0ustar sylvestresylvestre polylib: alpha.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__ranking_8c-source.html0000644000175000017500000002632711253740767026262 0ustar sylvestresylvestre polylib: ehrhart_ranking.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8h_source.html0000644000175000017500000001031511303257445025476 0ustar sylvestresylvestre polylib: ext_ehrhart.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/index.html0000644000175000017500000000101711303257450022145 0ustar sylvestresylvestre polylib <body> <a href="main.html">Frames are disabled. Click here to go to the main page.</a> </body> polylib-5.22.5.orig/doc/codeDoc/html/globals_0x63.html0000644000175000017500000002304111303257447023250 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- c -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8h_source.html0000644000175000017500000002311611303257446025343 0ustar sylvestresylvestre polylib: Zpolyhedron.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8c-source.html0000644000175000017500000010751011253740770024465 0ustar sylvestresylvestre polylib: SolveDio.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x70.html0000644000175000017500000003414711303257447024272 0ustar sylvestresylvestre polylib: Class Members
 

- p -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errors_8c-source.html0000644000175000017500000011761311253740767024270 0ustar sylvestresylvestre polylib: errors.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8h.html0000644000175000017500000016007311303257446024646 0ustar sylvestresylvestre polylib: compress_parms.h File Reference

compress_parms.h File Reference

#include "matrix_addon.h"
#include "matrix_permutations.h"
#include <assert.h>

Go to the source code of this file.

Defines

#define Constraints_removeParmEqs(a, b, c, d)   Constraints_Remove_parm_eqs(a,b,c,d)
#define Polyhedron_removeParmEqs(a, b, c, d, e)   Polyhedron_Remove_parm_eqs(a,b,c,d,e)

Functions

void Equalities_integerSolution (Matrix *Eqs, Matrix **sol)
 Given a system of non-redundant equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.
void Equalities_validityLattice (Matrix *Eqs, int a, Matrix **vl)
 Computes the validity lattice of a set of equalities.
void Equalities_intModBasis (Matrix *B, Matrix *C, Matrix *d, Matrix **imb)
 Given an integer matrix B with m rows and integer m-vectors C and d, computes the basis of the integer solutions to (BN+C) mod d = 0 (1).
void Constraints_fullDimensionize (Matrix **M, Matrix **C, Matrix **VL, Matrix **Eqs, Matrix **ParmEqs, unsigned int **elimVars, unsigned int **elimParms, int maxRays)
 Eliminates all the equalities in a set of constraints and returns the set of constraints defining a full-dimensional polyhedron, such that there is a bijection between integer points of the original polyhedron and these of the resulting (projected) polyhedron).
MatrixConstraints_Remove_parm_eqs (Matrix **M, Matrix **Ctxt, int renderSpace, unsigned int **elimParms)
 Removes the equalities that involve only parameters, by eliminating some parameters in the polyhedron's constraints and in the context.
void Constraints_removeElimCols (Matrix *M, unsigned int nbVars, unsigned int *elimParms, Matrix **newM)
 Eliminates the columns corresponding to a list of eliminated parameters.
void Lattice_extractSubLattice (Matrix *lat, unsigned int k, Matrix **subLat)
 Given a matrix that defines a full-dimensional affine lattice, returns the affine sub-lattice spanned in the k first dimensions.
PolyhedronPolyhedron_Remove_parm_eqs (Polyhedron **P, Polyhedron **C, int renderSpace, unsigned int **elimParms, int maxRays)
 Removes equalities involving only parameters, but starting from a Polyhedron and its context.
Matrixint_ker (Matrix *M)
 given a full-row-rank nxm matrix M(made of row-vectors), computes the basis K (made of n-m column-vectors) of the integer kernel of M so we have: M.K = 0
Matrixfull_dimensionize (Matrix const *M, int nb_parms, Matrix **Validity_Lattice)
 Given a matrix with m parameterized equations, compress the nb_parms parameters and n-m variables so that m variables are integer, and transform the variable space into a n-m space by eliminating the m variables (using the equalities) the variables to be eliminated are chosen automatically by the function.
Matrixaffine_periods (Matrix *M, Matrix *d)
 Computes the overall period of the variables I for (MI) mod |d|, where M is a matrix and |d| a vector.
Matrixint_mod_basis (Matrix *Bp, Matrix *Cp, Matrix *d)
 kept here for backwards compatiblity.
Matrixcompress_parms (Matrix *E, int nb_parms)
 Given a parameterized constraints matrix with m equalities, computes the compression matrix G such that there is an integer solution in the variables space for each value of N', with N = G N' (N are the "nb_parms" parameters).

Define Documentation

#define Constraints_removeParmEqs ( a,
b,
c,
 )     Constraints_Remove_parm_eqs(a,b,c,d)

Definition at line 72 of file compress_parms.h.

Referenced by Constraints_fullDimensionize().

#define Polyhedron_removeParmEqs ( a,
b,
c,
d,
 )     Polyhedron_Remove_parm_eqs(a,b,c,d,e)

Definition at line 101 of file compress_parms.h.


Function Documentation

Matrix* affine_periods ( Matrix M,
Matrix d 
)

Computes the overall period of the variables I for (MI) mod |d|, where M is a matrix and |d| a vector.

Produce a diagonal matrix S = (s_k) where s_k is the overall period of i_k

Parameters:
M the set of affine functions of I (row-vectors)
d the column-vector representing the modulos

Definition at line 548 of file compress_parms.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, value_divexact, value_gcd, value_init, value_lcm, and value_set_si.

Matrix* compress_parms ( Matrix E,
int  nbParms 
)

Given a parameterized constraints matrix with m equalities, computes the compression matrix G such that there is an integer solution in the variables space for each value of N', with N = G N' (N are the "nb_parms" parameters).

Parameters:
E a matrix of parametric equalities
nb_parms the number of parameters Note: this function is mostly here for backwards compatibility. Prefer the use of Equalities_validityLattice.

Definition at line 630 of file compress_parms.c.

References Equalities_validityLattice(), and matrix::NbColumns.

Referenced by full_dimensionize().

void Constraints_fullDimensionize ( Matrix **  M,
Matrix **  C,
Matrix **  VL,
Matrix **  Eqs,
Matrix **  ParmEqs,
unsigned int **  elimVars,
unsigned int **  elimParms,
int  maxRays 
)

Eliminates all the equalities in a set of constraints and returns the set of constraints defining a full-dimensional polyhedron, such that there is a bijection between integer points of the original polyhedron and these of the resulting (projected) polyhedron).

If VL is set to NULL, this funciton allocates it. Else, it assumes that (*VL) points to a matrix of the right size.

The following things are done:

  1. remove equalities involving only parameters, and remove as many parameters as there are such equalities. From that, the list of eliminated parameters elimParms is built.
  2. remove equalities that involve variables. This requires a compression of the parameters and of the other variables that are not eliminated. The affine compresson is represented by matrix VL (for validity lattice) and is such that (N I 1)^T = VL.(N' I' 1), where N', I' are integer (they are the parameters and variables after compression).

Definition at line 386 of file compress_parms.c.

References assert, Constraints_compressLastVars, Constraints_eliminateFirstVars, Constraints_permute(), Constraints_removeElimCols(), Constraints_removeParmEqs, dbgCompParm, dbgCompParmMore, Equalities_validityLattice(), find_a_permutation(), Matrix_Alloc(), Matrix_Free(), Matrix_identity(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, split_constraints(), value_assign, and value_set_si.

Referenced by test_Constraints_fullDimensionize().

Matrix* Constraints_Remove_parm_eqs ( Matrix **  M1,
Matrix **  Ctxt1,
int  renderSpace,
unsigned int **  elimParms 
)

Removes the equalities that involve only parameters, by eliminating some parameters in the polyhedron's constraints and in the context.

Updates M and Ctxt.

Parameters:
M1 the polyhedron's constraints
Ctxt1 the constraints of the polyhedron's context
renderSpace tells if the returned equalities must be expressed in the parameters space (renderSpace=0) or in the combined var/parms space (renderSpace = 1)
elimParms the list of parameters that have been removed: an array whose 1st element is the number of elements in the list. (returned)
Returns:
the system of equalities that involve only parameters.

Definition at line 649 of file compress_parms.c.

References eliminate_var_with_constr(), First_Non_Zero(), Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, value_cmp_si, value_notzero_p, value_set_si, value_zero_p, and Vector_Copy().

Referenced by Constraints_EhrhartQuickApx(), Polyhedron_Remove_parm_eqs(), and test_Constraints_Remove_parm_eqs().

void Constraints_removeElimCols ( Matrix M,
unsigned int  nbVars,
unsigned int *  elimParms,
Matrix **  newM 
)

Eliminates the columns corresponding to a list of eliminated parameters.

Eliminates the columns corresponding to a list of eliminated parameters.

Parameters:
M the constraints matrix whose columns are to be removed
nbVars an offset to be added to the ranks of the variables to be removed
elimParms the list of ranks of the variables to be removed
newM (output) the matrix without the removed columns

Definition at line 335 of file compress_parms.c.

References assert, Matrix_Alloc(), Matrix_clone(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, and Vector_Copy().

Referenced by Constraints_fullDimensionize().

void Equalities_integerSolution ( Matrix Eqs,
Matrix **  I 
)

Given a system of non-redundant equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.

Author:
B. Meister 12/2003-2006 LSIIT -ICPS UMR 7005 CNRS Louis Pasteur University (ULP), Strasbourg, France

Given a system of non-redundant equalities, looks if it has an integer solution in the combined space, and if yes, returns one solution.

pre-condition: the equalities are full-row rank (without the constant part)

Parameters:
Eqs the system of equations (as constraints)
I a feasible integer solution if it exists, else NULL. Allocated if initially set to NULL, else reused.

Definition at line 181 of file compress_parms.c.

References dbgCompParm, dbgCompParmMore, ensureMatrix, left_hermite(), MatInverse(), Matrix_Alloc(), Matrix_Free(), Matrix_oppose(), Matrix_Product(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, value_clear, value_init, value_notzero_p, value_pdivision, value_pmodulus, and value_set_si.

Referenced by Equalities_validityLattice().

void Equalities_intModBasis ( Matrix B,
Matrix C,
Matrix d,
Matrix **  imb 
)

Given an integer matrix B with m rows and integer m-vectors C and d, computes the basis of the integer solutions to (BN+C) mod d = 0 (1).

This is an affine lattice (G): (N 1)^T= G(N' 1)^T, forall N' in Z^b. If there is no solution, returns NULL.

This is an affine lattice (G): (N 1)^T= G(N' 1)^T, forall N' in Z^b. If there is no solution, returns NULL.

Parameters:
B B, a (m x b) matrix
C C, a (m x 1) integer matrix
d d, a (1 x m) integer matrix
imb the affine (b+1)x(b+1) basis of solutions, in the homogeneous form. Allocated if initially set to NULL, reused if not.

Definition at line 592 of file compress_parms.c.

References Equalities_validityLattice(), Matrix_Alloc(), Matrix_copySubMatrix(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by int_mod_basis().

void Equalities_validityLattice ( Matrix Eqs,
int  a,
Matrix **  vl 
)

Computes the validity lattice of a set of equalities.

I.e., the lattice induced on the last b variables by the equalities involving the first a integer existential variables.

I.e., the lattice induced on the last b variables by the equalities involving the first a integer existential variables. The submatrix of Eqs that concerns only the existential variables (so the first a columns) is assumed to be full-row rank.

Parameters:
Eqs the equalities
a the number of existential integer variables, placed as first variables
vl the (returned) validity lattice, in homogeneous form. It is allocated if initially set to null, or reused if already allocated.

Definition at line 271 of file compress_parms.c.

References dbgCompParm, ensureMatrix, Equalities_integerSolution(), left_hermite(), linearInter(), Matrix_copySubMatrix(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, show_matrix, value_assign, value_set_si, and Vector_Set().

Referenced by compress_parms(), Constraints_fullDimensionize(), and Equalities_intModBasis().

Matrix* full_dimensionize ( Matrix const *  M,
int  nbParms,
Matrix **  validityLattice 
)

Given a matrix with m parameterized equations, compress the nb_parms parameters and n-m variables so that m variables are integer, and transform the variable space into a n-m space by eliminating the m variables (using the equalities) the variables to be eliminated are chosen automatically by the function.

Deprecated. Try to use Constraints_fullDimensionize instead.

Parameters:
M the constraints
the number of parameters
validityLattice the the integer lattice underlying the integer solutions.

Definition at line 904 of file compress_parms.c.

References compress_parms(), dbgCompParm, find_a_permutation(), Identity_Matrix(), Matrix_Alloc(), Matrix_Free(), mpolyhedron_compress_last_vars(), mpolyhedron_eliminate_first_variables(), mpolyhedron_permute(), matrix::NbColumns, matrix::NbRows, matrix::p, show_matrix, split_constraints(), value_assign, and value_set_si.

Referenced by Ehrhart_Quick_Apx().

Matrix* int_ker ( Matrix M  ) 

given a full-row-rank nxm matrix M(made of row-vectors), computes the basis K (made of n-m column-vectors) of the integer kernel of M so we have: M.K = 0

Definition at line 56 of file compress_parms.c.

References dbgCompParm, dbgCompParmMore, left_hermite(), Matrix_Alloc(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, matrix::p, right_hermite(), show_matrix, and Vector_IsZero().

Matrix* int_mod_basis ( Matrix B,
Matrix C,
Matrix d 
)

kept here for backwards compatiblity.

Wrapper to Equalities_intModBasis()

Definition at line 614 of file compress_parms.c.

References Equalities_intModBasis().

void Lattice_extractSubLattice ( Matrix lat,
unsigned int  k,
Matrix **  subLat 
)

Given a matrix that defines a full-dimensional affine lattice, returns the affine sub-lattice spanned in the k first dimensions.

Useful for instance when you only look for the parameters' validity lattice.

Useful for instance when you only look for the parameters' validity lattice.

Parameters:
lat the original full-dimensional lattice
subLat the sublattice

Definition at line 499 of file compress_parms.c.

References assert, dbgCompParmMore, dbgEnd, dbgStart, Lattice_extractSubLattice(), left_hermite(), Matrix_Alloc(), Matrix_Copy(), Matrix_copySubMatrix(), Matrix_Free(), Matrix_subMatrix(), matrix::NbColumns, matrix::NbRows, show_matrix, and value_set_si.

Referenced by Lattice_extractSubLattice(), and test_Constraints_fullDimensionize().

Polyhedron* Polyhedron_Remove_parm_eqs ( Polyhedron **  P,
Polyhedron **  C,
int  renderSpace,
unsigned int **  elimParms,
int  maxRays 
)

Removes equalities involving only parameters, but starting from a Polyhedron and its context.

Parameters:
P the polyhedron
C P's context
renderSpace,: 0 for the parameter space, =1 for the combined space. Polylib's usual workspace.

Definition at line 856 of file compress_parms.c.

References Constraints2Polyhedron(), Constraints_Remove_parm_eqs(), F_ISSET, FL_INIT, Matrix_Free(), matrix::NbRows, POL_INEQUALITIES, POL_NO_DUAL, POL_VALID, Polyhedron2Constraints(), and Polyhedron_Free().

Referenced by test_Polyhedron_Remove_parm_eqs().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structlinear__exception__holder-members.html0000644000175000017500000000514011303257447031125 0ustar sylvestresylvestre polylib: Member List

linear_exception_holder Member List

This is the complete list of members for linear_exception_holder, including all inherited members.
filelinear_exception_holder
functionlinear_exception_holder
linelinear_exception_holder
whatlinear_exception_holder
wherelinear_exception_holder

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/r2p_8c-source.html0000644000175000017500000000734511253740770023451 0ustar sylvestresylvestre polylib: r2p.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/structVector.html0000644000175000017500000001111111303257447023547 0ustar sylvestresylvestre polylib: Vector Struct Reference

Vector Struct Reference

#include <types.h>

List of all members.

Public Attributes

unsigned Size
Value * p

Detailed Description

Definition at line 86 of file types.h.


Member Data Documentation

unsigned Vector::Size

Definition at line 87 of file types.h.

Referenced by Vector_Alloc(), Vector_Free(), and Vector_Print().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/example_8c.html0000644000175000017500000000617211303257447023100 0ustar sylvestresylvestre polylib: example.c File Reference

example.c File Reference

#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main ()

Function Documentation


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__adj_8c.html0000644000175000017500000001267711303257446025622 0ustar sylvestresylvestre polylib: disjoint_union_adj.c File Reference

disjoint_union_adj.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define WS   0

Functions

void AffContraintes (Polyhedron *p)
int main ()

Define Documentation

#define WS   0

Definition at line 37 of file disjoint_union_adj.c.


Function Documentation

void AffContraintes ( Polyhedron p  ) 

Definition at line 41 of file disjoint_union_adj.c.

References polyhedron::next, P_VALUE_FMT, and Polyhedron_PrintConstraints().

Referenced by main().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/alpha_8h.html0000644000175000017500000003452711303257446022543 0ustar sylvestresylvestre polylib: alpha.h File Reference

alpha.h File Reference

Go to the source code of this file.

Functions

int GaussSimplify (Matrix *M, Matrix *M2)
int PolyhedronLTQ (Polyhedron *P1, Polyhedron *P2, int INDEX, int PDIM, int MAXRAYS)
int PolyhedronTSort (Polyhedron **L, unsigned int n, unsigned int index, unsigned int pdim, int *time, int *pvect, unsigned int MAXRAYS)
int Polyhedron_Not_Empty (Polyhedron *P, Polyhedron *C, int MAXRAYS)

Function Documentation

int Polyhedron_Not_Empty ( Polyhedron P,
Polyhedron C,
int  MAXRAYS 
)
int PolyhedronTSort ( Polyhedron **  L,
unsigned int  n,
unsigned int  index,
unsigned int  pdim,
int *  time,
int *  pvect,
unsigned int  MAXRAYS 
)

Definition at line 532 of file alpha.c.

References p, POL_ENSURE_FACETS, POL_ENSURE_VERTICES, and PolyhedronLTQ().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8c_source.html0000644000175000017500000001620311303257445024657 0ustar sylvestresylvestre polylib: errormsg.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structZPolyhedron-members.html0000644000175000017500000000373111303257447026223 0ustar sylvestresylvestre polylib: Member List

ZPolyhedron Member List

This is the complete list of members for ZPolyhedron, including all inherited members.
LatZPolyhedron
nextZPolyhedron
PZPolyhedron

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8c-source.html0000644000175000017500000006633611253740770024404 0ustar sylvestresylvestre polylib: ranking.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8c_source.html0000644000175000017500000023654111303257446025270 0ustar sylvestresylvestre polylib: NormalForms.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Polyhedron__union.html0000644000175000017500000001011111303257447026274 0ustar sylvestresylvestre polylib: _Polyhedron_union Struct Reference

_Polyhedron_union Struct Reference

List of all members.

Public Attributes

Enumerationpt
struct _Polyhedron_unionnext

Detailed Description

Definition at line 25 of file ext_ehrhart.c.


Member Data Documentation

Definition at line 27 of file ext_ehrhart.c.

Referenced by Domain_Enumerate().

Definition at line 26 of file ext_ehrhart.c.

Referenced by Domain_Enumerate().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x6d.html0000644000175000017500000002514411303257447024352 0ustar sylvestresylvestre polylib: Class Members
 

- m -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/testlib_8c_source.html0000644000175000017500000004574011303257446024476 0ustar sylvestresylvestre polylib: testlib.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetique_8h-source.html0000644000175000017500000027254711253740766031072 0ustar sylvestresylvestre polylib: arithmetique.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/structpolyhedron.html0000644000175000017500000010133011303257447024473 0ustar sylvestresylvestre polylib: polyhedron Struct Reference

polyhedron Struct Reference

#include <types.h>

List of all members.

Public Attributes

unsigned Dimension
unsigned NbConstraints
unsigned NbRays
unsigned NbEq
unsigned NbBid
Value ** Constraint
Value ** Ray
Value * p_Init
int p_Init_size
struct polyhedronnext
unsigned flags

Detailed Description

Definition at line 109 of file types.h.


Member Data Documentation

Definition at line 124 of file types.h.

Referenced by align_context(), Polyhedron_Alloc(), and Polyhedron_Copy().

Definition at line 114 of file types.h.

Referenced by Polyhedron_Alloc(), and Polyhedron_Free().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8c_source.html0000644000175000017500000007233011303257446024454 0ustar sylvestresylvestre polylib: ranking.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/c2p_8c.html0000644000175000017500000000751111303257446022126 0ustar sylvestresylvestre polylib: c2p.c File Reference

c2p.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define WS   0

Functions

int main ()

Define Documentation

#define WS   0

Definition at line 18 of file c2p.c.


Function Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structmatrix.html0000644000175000017500000011527711303257447023633 0ustar sylvestresylvestre polylib: matrix Struct Reference

matrix Struct Reference

#include <types.h>

List of all members.

Public Attributes

unsigned NbRows
unsigned NbColumns
Value ** p
Value * p_Init
int p_Init_size

Detailed Description

Definition at line 91 of file types.h.


Member Data Documentation

Definition at line 92 of file types.h.

Referenced by AddANullColumn(), AddANullRow(), addeliminatedparams_evalue(), AddLattice(), AddZPolytoZDomain(), affine_periods(), AffinePartSimplify(), AffineSmith(), AlmostSameAffinePart(), BuildSat(), CanonicalForm(), Chernikova(), compress_parms(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_Remove_parm_eqs(), Constraints_removeElimCols(), constraintsView(), ConvertPolMattoDarMat(), dehomogenize_polyhedron(), DomainAddConstraints(), DomainAddRays(), Ehrhart_Quick_Apx(), Ehrhart_Quick_Apx_Full_Dim(), Elim_Columns(), eliminable_vars(), eliminate_var_with_constr(), Equalities_integerSolution(), Equalities_intModBasis(), Equalities_validityLattice(), ExchangeRows(), ExtractLinearPart(), find_a_permutation(), findHermiteBasis(), FindHermiteBasisofDomain(), full_dimensionize(), GaussSimplify(), Hermite(), hermite(), Homogenise(), homogenize(), ImplicitEqualities(), int_ker(), isEmptyLattice(), isinHnf(), isIntegral(), IsLattice(), isLinear(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeDifference(), LatticeImage(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), main(), MakeDioEqforInter(), MatInverse(), Matrix_Alloc(), Matrix_clone(), Matrix_Copy(), Matrix_Extend(), Matrix_Inverse(), Matrix_oppose(), Matrix_Print(), Matrix_Product(), Matrix_Read_Input(), Matrix_Vector_Product(), mpolyhedron_compress_last_vars(), mpolyhedron_deflate(), mpolyhedron_inflate(), mpolyhedron_permute(), mpolyhedron_simplify(), mtransformation_expand_left_to_dim(), mtransformation_inverse(), mtransformation_permute(), Orthogonal_Base(), Polyhedron_Compute_Dual(), Polyhedron_Enumerate(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), PreElim_Columns(), Print_Vertex(), PutColumnLast(), PutRowFirst(), PutRowLast(), rat_prodmat(), Rays2Polyhedron(), Rays_Mult(), Rays_Mult_Transpose(), RearrangeMatforSolveDio(), Reduce_Matrix(), Remove_Redundants(), RemoveColumn(), RemoveNColumns(), RemoveRow(), right_hermite(), sameAffinepart(), sameLattice(), scan_m_face(), Scan_Vertices(), Simplify(), Smith(), SolveDiophantine(), SortConstraints(), Soustraire_ligne(), split_constraints(), SplitZpolyhedron(), swap_line(), test_Constraints_fullDimensionize(), TestRank(), traite_m_face(), Transpose(), Union_Read(), valuesWithoutElim(), Vector_Matrix_Product(), VertexCT(), ZDomainPreimage(), ZPolyhedronImage(), and ZPolyhedronPreimage().

unsigned matrix::NbRows

Definition at line 92 of file types.h.

Referenced by AddANullColumn(), AddANullRow(), addeliminatedparams_evalue(), AddLattice(), AddRays(), AddZPolytoZDomain(), affine_periods(), AffinePartCompare(), AffinePartSimplify(), AffineSmith(), AlmostSameAffinePart(), BuildSat(), CalcBase(), CanonicalForm(), ChangeLatticeDimension(), Chernikova(), Constraints2Polyhedron(), Constraints_EhrhartQuickApx(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_Remove_parm_eqs(), Constraints_removeElimCols(), constraintsView(), ConvertPolMattoDarMat(), dehomogenize_polyhedron(), DomainAddConstraints(), DomainAddRays(), DomainSimplify(), Ehrhart_Quick_Apx_Full_Dim(), Elim_Columns(), eliminable_vars(), Equalities_integerSolution(), Equalities_intModBasis(), Equalities_validityLattice(), ExchangeColumns(), existepivot(), ExtractLinearPart(), find_a_permutation(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), Gauss(), GaussSimplify(), Hermite(), hermite(), Homogenise(), homogenize(), ImplicitEqualities(), int_ker(), IntegraliseLattice(), isEmptyLattice(), isfulldim(), isinHnf(), isIntegral(), IsLattice(), isLinear(), Lattice2LatticeUnion(), Lattice_extractSubLattice(), LatticeDifference(), LatticeImage(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), LinearPartCompare(), main(), MakeDioEqforInter(), MatInverse(), Matrix_Alloc(), Matrix_clone(), Matrix_Copy(), Matrix_Extend(), Matrix_Inverse(), Matrix_oppose(), Matrix_Print(), Matrix_Product(), Matrix_Read_Input(), Matrix_Vector_Product(), mpolyhedron_compress_last_vars(), mpolyhedron_deflate(), mpolyhedron_eliminate_first_variables(), mpolyhedron_inflate(), mpolyhedron_permute(), mpolyhedron_simplify(), mtransformation_expand_left_to_dim(), mtransformation_inverse(), mtransformation_permute(), Orthogonal_Base(), Param_Polyhedron_Scale_Integer(), Polyhedron_Compute_Dual(), Polyhedron_Enumerate(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Remove_parm_eqs(), Polyhedron_Scan(), PreElim_Columns(), Print_Vertex(), PutColumnFirst(), PutColumnLast(), PutRowLast(), rat_prodmat(), Rays2Polyhedron(), Rays_Mult(), Rays_Mult_Transpose(), RearrangeMatforSolveDio(), Reduce_Matrix(), Remove_Redundants(), RemoveColumn(), RemoveNColumns(), RemoveRow(), right_hermite(), sameAffinepart(), sameLattice(), SameLinearPart(), SatMatrix_Extend(), Scan_Vertices(), Simplify(), Smith(), SolveDiophantine(), SortConstraints(), split_constraints(), SplitLattice(), SplitZpolyhedron(), Stras_DomainSimplify(), test_Constraints_fullDimensionize(), TestRank(), traite_m_face(), TransformSat(), Transpose(), Vector_Matrix_Product(), VertexCT(), ZDomainDifference(), ZDomainImage(), ZDomainIntersection(), ZDomainPreimage(), ZDomainSimplify(), ZPolyhedron_Alloc(), ZPolyhedronDifference(), ZPolyhedronImage(), ZPolyhedronIntersection(), ZPolyhedronPreimage(), and ZPolyhedronPrint().

Value** matrix::p

Definition at line 93 of file types.h.

Referenced by AddANullColumn(), AddANullRow(), AddConstraints(), addeliminatedparams_evalue(), AddLattice(), affine_periods(), AffinePartSimplify(), AffineSmith(), AlmostSameAffinePart(), BuildSat(), CalcBase(), CanonicalForm(), ChangeLatticeDimension(), Chernikova(), Constraints2Polyhedron(), Constraints_fullDimensionize(), Constraints_permute(), Constraints_Remove_parm_eqs(), Constraints_removeElimCols(), constraintsView(), ConvertDarMattoPolMat(), ConvertPolMattoDarMat(), dehomogenize_polyhedron(), DomainAddRays(), DomainSimplify(), Elim_Columns(), eliminable_vars(), eliminate_var_with_constr(), EmptyLattice(), Enumeration_zero(), Equalities_integerSolution(), Equalities_intModBasis(), ExchangeColumns(), ExchangeRows(), existepivot(), ExtractLinearPart(), Find_m_faces(), findHermiteBasis(), FindHermiteBasisofDomain(), FindSimple(), full_dimensionize(), Gauss(), GaussSimplify(), GenParamPolyhedron(), hermite(), homogenize(), Identity(), Identity_Matrix(), ImplicitEqualities(), int_ker(), isEmptyLattice(), isfulldim(), isinHnf(), isIntegral(), IsLattice(), isLinear(), Lattice2LatticeUnion(), LatticeImage(), LatticeIntersection(), LatticePreimage(), left_hermite(), LexSmaller(), linearInter(), main(), MakeDioEqforInter(), MatInverse(), Matrix_Alloc(), Matrix_Copy(), Matrix_copySubMatrix(), Matrix_Extend(), Matrix_Free(), Matrix_Inverse(), Matrix_oppose(), Matrix_Print(), Matrix_Product(), Matrix_subMatrix(), Matrix_Vector_Product(), mpolyhedron_compress_last_vars(), mpolyhedron_deflate(), mpolyhedron_eliminate_first_variables(), mpolyhedron_inflate(), mpolyhedron_permute(), mpolyhedron_simplify(), mtransformation_expand_left_to_dim(), mtransformation_inverse(), mtransformation_permute(), old_Polyhedron_Preprocess(), Orthogonal_Base(), P_Enum(), Param_Polyhedron_Scale_Integer(), Polyhedron_Compute_Dual(), Polyhedron_Image(), Polyhedron_Image_Enumerate(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Scan(), PolyhedronLTQ(), PreElim_Columns(), Print_Vertex(), PutColumnFirst(), PutColumnLast(), PutRowFirst(), PutRowLast(), rat_prodmat(), Rays2Polyhedron(), Rays_Mult(), Rays_Mult_Transpose(), RaySort(), RearrangeMatforSolveDio(), Recession_Cone(), Reduce_Matrix(), Remove_Redundants(), RemoveColumn(), RemoveNColumns(), RemoveRow(), right_hermite(), sameAffinepart(), sameLattice(), SameLinearPart(), scan_m_face(), Scan_Vertices(), Simplify(), SimplifyEqualities(), SolveDiophantine(), SortConstraints(), Soustraire_ligne(), split_constraints(), SplitLattice(), Stras_DomainSimplify(), SubConstraint(), swap_line(), test_Constraints_fullDimensionize(), TestRank(), traite_m_face(), Transpose(), valuesWithoutElim(), Vector_Matrix_Product(), and VertexCT().

Definition at line 95 of file types.h.

Referenced by Matrix_Alloc(), Matrix_Extend(), and Matrix_Free().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polytest_8c.html0000644000175000017500000001475411303257447023335 0ustar sylvestresylvestre polylib: polytest.c File Reference

polytest.c File Reference

#include <stdio.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define WS   0

Functions

int main ()

Variables

char s [128]

Define Documentation

#define WS   0

Definition at line 22 of file polytest.c.


Function Documentation


Variable Documentation


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__upper__bound_8c_source.html0000644000175000017500000003017011303257445027353 0ustar sylvestresylvestre polylib: ehrhart_upper_bound.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8c_source.html0000644000175000017500000212236711303257446025216 0ustar sylvestresylvestre polylib: polyhedron.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/findv_8c_source.html0000644000175000017500000001447011303257445024131 0ustar sylvestresylvestre polylib: findv.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8h-source.html0000644000175000017500000002106711253740767024413 0ustar sylvestresylvestre polylib: ehrhart.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetic__errors_8h.html0000644000175000017500000000266311303257446030737 0ustar sylvestresylvestre polylib: arithmetic_errors.h File Reference

arithmetic_errors.h File Reference

Go to the source code of this file.


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/pp_8c_source.html0000644000175000017500000003133311303257446023440 0ustar sylvestresylvestre polylib: pp.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x74.html0000644000175000017500000001146111303257450024262 0ustar sylvestresylvestre polylib: Class Members
 

- t -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__quick__apx_8c_source.html0000644000175000017500000002712711303257445027025 0ustar sylvestresylvestre polylib: ehrhart_quick_apx.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Domain-members.html0000644000175000017500000000400211303257447026722 0ustar sylvestresylvestre polylib: Member List

_Param_Domain Member List

This is the complete list of members for _Param_Domain, including all inherited members.
Domain_Param_Domain
F_Param_Domain
next_Param_Domain

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8h_source.html0000644000175000017500000002467011303257445024470 0ustar sylvestresylvestre polylib: ehrhart.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8c-source.html0000644000175000017500000066673111253740767024353 0ustar sylvestresylvestre polylib: Lattice.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__adj_8c-source.html0000644000175000017500000001436711253740766027124 0ustar sylvestresylvestre polylib: disjoint_union_adj.c Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/example_8c-source.html0000644000175000017500000001515311253740767024403 0ustar sylvestresylvestre polylib: example.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8c.html0000644000175000017500000001736311303257447023175 0ustar sylvestresylvestre polylib: SolveDio.c File Reference

SolveDio.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

static void RearrangeMatforSolveDio (Matrix *M)
int SolveDiophantine (Matrix *M, Matrix **U, Vector **X)

Function Documentation

static void RearrangeMatforSolveDio ( Matrix M  )  [static]
int SolveDiophantine ( Matrix M,
Matrix **  U,
Vector **  X 
)

Case when rank < Number of Columns;

Solved the equtions

When rank < hermi->NbRows; Verifying whether the solution agrees with the remaining n-rank rows as well.

Definition at line 81 of file SolveDio.c.

References Hermite(), Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), Matrix_Inverse(), min, matrix::NbColumns, matrix::NbRows, p, matrix::p, RearrangeMatforSolveDio(), value_addmul, value_assign, value_clear, value_division, value_init, value_modulus, value_ne, value_notzero_p, value_oppose, value_set_si, value_subtract, and Vector_Alloc().

Referenced by findHermiteBasis(), LatticeIntersection(), LatticePreimage(), and main().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polytest_8c_source.html0000644000175000017500000005571611303257446024717 0ustar sylvestresylvestre polylib: polytest.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8h_source.html0000644000175000017500000004362411303257445026227 0ustar sylvestresylvestre polylib: compress_parms.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/vector_8c_source.html0000644000175000017500000023120411303257446024322 0ustar sylvestresylvestre polylib: vector.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structSatMatrix-members.html0000644000175000017500000000502011303257447025653 0ustar sylvestresylvestre polylib: Member List

SatMatrix Member List

This is the complete list of members for SatMatrix, including all inherited members.
NbColumnsSatMatrix
NbRowsSatMatrix
pSatMatrix
pSatMatrix
p_initSatMatrix
p_initSatMatrix

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/assert_8h_source.html0000644000175000017500000001066111303257445024327 0ustar sylvestresylvestre polylib: assert.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/verif__ehrhart_8c-source.html0000644000175000017500000010132311253740770025724 0ustar sylvestresylvestre polylib: verif_ehrhart.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ftv2vertline.png0000644000175000017500000000034511303257450023313 0ustar sylvestresylvestre‰PNG  IHDRLƒ1Ù0PLTEÿÿÿ€€€Ó tRNS@æØftEXtSoftwaregif2png 2.4.2£^G&tEXtCommentUlead GIF SmartSaver Ver 2.0io?ÍIDATxÚc`0ÀO[!¦å<è:IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/structpolyhedron-members.html0000644000175000017500000000703111303257447026126 0ustar sylvestresylvestre polylib: Member List
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2mlastnode.png0000644000175000017500000000024011303257450023443 0ustar sylvestresylvestre‰PNG  IHDRÃÃÄy PLTEÿÿÿ€€€<^»,tRNS@æØftEXtSoftwaregif2png 2.4.2£^G#IDATxÚc`   `„Œ¡¡ ɨµPʉamºÀÜiÈIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/Matop_8h-source.html0000644000175000017500000001704611253740767024040 0ustar sylvestresylvestre polylib: Matop.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x68.html0000644000175000017500000001022611303257447024271 0ustar sylvestresylvestre polylib: Class Members
 

- h -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structVector-members.html0000644000175000017500000000334511303257447025211 0ustar sylvestresylvestre polylib: Member List

Vector Member List

This is the complete list of members for Vector, including all inherited members.
pVector
SizeVector

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Matop_8h_source.html0000644000175000017500000002265111303257445024110 0ustar sylvestresylvestre polylib: Matop.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/tab_l.gif0000644000175000017500000000130211303257445021721 0ustar sylvestresylvestreGIF89a ,Õö÷ùñô÷öøúüýþúûüùúûøùúêïóïóöÆÕßÒÞæØâéÞçíÝæìåìñèîòô÷ùóöø³ÈÕÁÒÝËÙâÏÜäÖá薴ŹɯÂÍ»ÎÙÃÔÞÂÓÝÈ×àÌÚâÕáèÙäê×âèåìðëðó„°ÇÑÞåÜæëãëïëñôîóõ÷úûûüüÿÿÿþþþ, ,ÿ@–P±É`H$!%CqVe2X­ŠÌJ(“Ä +€˜3 2$ÀÆ ¼kvŠä-Ëçõu*…"}ã|}|~q(" $f„ 'Žl(Œ&&$r‘™ › & ! )¢¤›{¨£¥r­ª°©¯„±¯¬´¦·»º³®«§¾¶ÃÂÀ¿²¹ÇÄËÆ²ÌÉεҽͼ„ÔÈÓ×иÙÝÕÏÙÊâÜßãçæê¾äÛÅëÇíáîÖìéïøñ÷õüÑðåùü¤Pß?‚ƒœÇÛBm åAœÎáÀ†%V܈î!Çk÷Ø/áÄ;^¤¨²$Æ–#Mf)f͇(WÎL‰“æKçÒ„° ’I)L:eD ¡Cµ´x*4 U¨h  %A«£^ÁNKb¬Ùe§X±‚´k»x!ÁÖí—2tÝÖ !¯š5tÛæé—À]$¬´%ƒXíâ.i[¬]Y­•ÊfžEëõkg`µ††:zëçÒž;£}ºµj×aa‹–Mš¶é׸cçž½»vïÛºƒóî›8ðáÈ‹'?®¼9óç©G_>Ýyuè¬_ßž]zwêß­‡Ç¾º¼mîæµG~½ûôÞთ/ž>ùööÙ«Ïÿ¿ÿýÿÅà|ÖWà}v;polylib-5.22.5.orig/doc/codeDoc/html/findv_8c.html0000644000175000017500000000632411303257447022552 0ustar sylvestresylvestre polylib: findv.c File Reference

findv.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main ()

Function Documentation


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8h-source.html0000644000175000017500000002005111253740770024371 0ustar sylvestresylvestre polylib: ranking.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8h_source.html0000644000175000017500000002736211303257445024421 0ustar sylvestresylvestre polylib: Lattice.h Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8c.html0000644000175000017500000035065411303257446023110 0ustar sylvestresylvestre polylib: ehrhart.c File Reference

ehrhart.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <polylib/polylib.h>
#include <polylib/homogenization.h>

Go to the source code of this file.

Defines

#define EPRINT_ALL_VALIDITY_CONSTRAINTS
 define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed
#define REDUCE_DEGREE
 Reduce the degree of resulting polynomials.
#define ALL_OVERFLOW_WARNINGS
 define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20
#define MAXITER   100
 This procedure finds an integer point contained in polyhedron D / first checks for positive values, then for negative values returns TRUE on success.

Functions

enodenew_enode (enode_type type, int size, int pos)
 EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.
void free_evalue_refs (evalue *e)
 releases all memory referenced by e.
enodeecopy (enode *e)
void print_evalue (FILE *DST, evalue *e, const char **pname)
void print_enode (FILE *DST, enode *p, const char **pname)
 prints the enode to DST
static int eequal (evalue *e1, evalue *e2)
void reduce_evalue (evalue *e)
static void emul (evalue *e1, evalue *e2, evalue *res)
 multiplies two evalues and puts the result in res
void eadd (evalue *e1, evalue *res)
 adds one evalue to evalue 'res.
void edot (enode *v1, enode *v2, evalue *res)
 computes the inner product of two vectors.
static void aep_evalue (evalue *e, int *ref)
 local recursive function used in the following ref contains the new position for each old index position
static void addeliminatedparams_evalue (evalue *e, Matrix *CT)
 Comments.
int cherche_min (Value *min, Polyhedron *D, int pos)
PolyhedronPolyhedron_Preprocess (Polyhedron *D, Value *size, unsigned MAXRAYS)
 This procedure finds the smallest parallelepiped of size 'size[i]' for every dimension i, contained in polyhedron D.
PolyhedronPolyhedron_Preprocess2 (Polyhedron *D, Value *size, Value *lcm, unsigned MAXRAYS)
 This procedure finds an hypercube of size 'size', containing polyhedron D increases size and lcm if necessary (and not "too big") If this is not possible, an empty polyhedron is returned.
Polyhedronold_Polyhedron_Preprocess (Polyhedron *D, Value size, unsigned MAXRAYS)
 This procedure adds additional constraints to D so that as each parameter is scanned, it will have a minimum of 'size' points If this is not possible, an empty polyhedron is returned.
void count_points (int pos, Polyhedron *P, Value *context, Value *res)
 PROCEDURES TO COMPUTE ENUMERATION.
static enodeP_Enum (Polyhedron *L, Polyhedron *LQ, Value *context, int pos, int nb_param, int dim, Value *lcm, const char **param_name)
static void Scan_Vertices (Param_Polyhedron *PP, Param_Domain *Q, Matrix *CT, Value *lcm, int nbp, const char **param_name)
EnumerationEnumerate_NoParameters (Polyhedron *P, Polyhedron *C, Matrix *CT, Polyhedron *CEq, unsigned MAXRAYS, const char **param_name)
 Procedure to count points in a non-parameterized polytope.
EnumerationPolyhedron_Enumerate (Polyhedron *Pi, Polyhedron *C, unsigned MAXRAYS, const char **param_name)
 Procedure to count points in a parameterized polytope.
void Enumeration_Free (Enumeration *en)
void evalue_div (evalue *e, Value n)
 Divides the evalue e by the integer n
recursive function
Warning : modifies e.
EnumerationEhrhart_Quick_Apx_Full_Dim (Polyhedron *Pi, Polyhedron *C, unsigned MAXRAYS, const char **param_name)
 Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names).
EnumerationEhrhart_Quick_Apx (Matrix *M, Matrix *C, Matrix **Validity_Lattice, unsigned maxRays)
 Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.
EnumerationConstraints_EhrhartQuickApx (Matrix const *M, Matrix const *C, Matrix **validityLattice, Matrix **parmEqualities, unsigned int **elimParms, unsigned maxRays)
 Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.
const char ** parmsWithoutElim (char const **parmNames, unsigned int const *elimParms, unsigned int nbParms)
 Returns the array of parameter names after some of them have been eliminated.
EnumerationEnumeration_zero (unsigned int nbParms, unsigned int maxRays)
 returns a constant Ehrhart polynomial whose value is zero for any value of the parameters.

Variables

int overflow_warning_flag = 1

Define Documentation

#define ALL_OVERFLOW_WARNINGS

define this to print one warning message per domain overflow these overflows should no longer happen since version 4.20

Definition at line 94 of file ehrhart.c.

#define EPRINT_ALL_VALIDITY_CONSTRAINTS

define this to print all constraints on the validity domains if not defined, only new constraints (not in validity domain given by the user) are printed

Definition at line 70 of file ehrhart.c.

#define MAXITER   100

This procedure finds an integer point contained in polyhedron D / first checks for positive values, then for negative values returns TRUE on success.

Result is in min. returns FALSE if no integer point is found

This is the maximum number of iterations for a given parameter to find a integer point inside the context. Kind of weird. cherche_min should

Parameters:
min 
D 
pos 

Definition at line 635 of file ehrhart.c.

Referenced by cherche_min().

#define REDUCE_DEGREE

Reduce the degree of resulting polynomials.

Definition at line 88 of file ehrhart.c.


Function Documentation

static void addeliminatedparams_evalue ( evalue e,
Matrix CT 
) [static]
static void aep_evalue ( evalue e,
int *  ref 
) [static]

local recursive function used in the following ref contains the new position for each old index position

Parameters:
e pointer to an evalue
ref transformation Matrix

Definition at line 569 of file ehrhart.c.

References _enode::arr, _evalue::d, p, _enode::pos, _enode::size, and value_notzero_p.

Referenced by addeliminatedparams_evalue().

Enumeration* Constraints_EhrhartQuickApx ( Matrix const *  M,
Matrix const *  C,
Matrix **  validityLattice,
Matrix **  parmEqualities,
unsigned int **  elimParms,
unsigned  maxRays 
)

Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.

If there are some equalities involving only parameters, these are used to eliminate useless parameters.

Parameters:
M a polyhedron under implicit form
C M's context under implicit form
validityLattice a pointer to the parameter's validity lattice (returned)
parmsEqualities Equalities involving only the parameters
maxRays the needed "working space" for other polylib functions used here
elimParams array of the indices of the eliminated parameters (returned)

Definition at line 2677 of file ehrhart.c.

References Constraints_Remove_parm_eqs(), Ehrhart_Quick_Apx(), Matrix_Copy(), and matrix::NbRows.

void count_points ( int  pos,
Polyhedron P,
Value *  context,
Value *  res 
)

PROCEDURES TO COMPUTE ENUMERATION.

recursive procedure, recurse for each imbriquation

Parameters:
pos index position of current loop index (1..hdim-1)
P loop domain
context context values for fixed indices
res the number of integer points in this polyhedron

Definition at line 1145 of file ehrhart.c.

References count_points(), emptyQ, lower_upper_bounds(), polyhedron::next, P_VALUE_FMT, POL_ENSURE_FACETS, POL_ENSURE_VERTICES, value_add_int, value_addto, value_assign, value_clear, value_increment, value_init, value_le, value_lt, value_notmone_p, value_print, value_set_si, and value_subtract.

Referenced by check_poly(), count_points(), Enumerate_NoParameters(), and P_Enum().

void eadd ( evalue e1,
evalue res 
)

adds one evalue to evalue 'res.

result = res + e1

Parameters:
e1 an evalue
res 

Definition at line 410 of file ehrhart.c.

References _enode::arr, _evalue::d, eadd(), ecopy(), free_evalue_refs(), periodic, polynomial, value_addto, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_notone_p, value_notzero_p, and value_zero_p.

Referenced by eadd(), and edot().

enode* ecopy ( enode e  ) 
Parameters:
e pointer to an evalue
Returns:
description

Definition at line 167 of file ehrhart.c.

References _enode::arr, _evalue::d, ecopy(), new_enode(), _enode::pos, _enode::size, _enode::type, value_assign, value_init, and value_zero_p.

Referenced by Domain_Enumerate(), eadd(), ecopy(), and new_eadd().

void edot ( enode v1,
enode v2,
evalue res 
)

computes the inner product of two vectors.

Result = result (evalue) = v1.v2 (dot product)

Parameters:
v1 an enode (vector)
v2 an enode (vector of constants)
res result (evalue)

Definition at line 526 of file ehrhart.c.

References _enode::arr, _evalue::d, eadd(), emul(), evector, free_evalue_refs(), _enode::size, _enode::type, value_init, and value_set_si.

Referenced by P_Enum().

static int eequal ( evalue e1,
evalue e2 
) [static]
Parameters:
e1 pointers to evalues
e2 pointers to evalues
Returns:
1 (true) if they are equal, 0 (false) if not

Definition at line 261 of file ehrhart.c.

References _enode::arr, _evalue::d, _enode::pos, _enode::size, _enode::type, value_ne, and value_notzero_p.

Referenced by reduce_evalue().

Enumeration* Ehrhart_Quick_Apx ( Matrix M,
Matrix C,
Matrix **  Validity_Lattice,
unsigned  maxRays 
)

Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix), treating the non-full-dimensional case.

Parameters:
M a polyhedron under implicit form
C M's context under implicit form
Validity_Lattice a pointer to the parameter's validity lattice
MAXRAYS the needed "working space" for other polylib functions used here
param_name the names of the parameters,

Definition at line 2635 of file ehrhart.c.

References Constraints2Polyhedron(), Ehrhart_Quick_Apx_Full_Dim(), full_dimensionize(), Matrix_Free(), mpolyhedron_compress_last_vars(), matrix::NbColumns, Polyhedron_Free(), and show_matrix.

Referenced by Constraints_EhrhartQuickApx(), and main().

Enumeration* Ehrhart_Quick_Apx_Full_Dim ( Polyhedron Pi,
Polyhedron C,
unsigned  MAXRAYS,
const char **  param_name 
)

Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names).

Procedure to estimate the number of points in a parameterized polytope. Returns a list of validity domains + evalues EP B.M. The most rough and quick approximation by variables expansion Deals with the full-dimensional case.

Parameters:
Pi : Polyhedron to enumerate (approximatively)
C : Context Domain
MAXRAYS : size of workspace
param_name : names for the parameters (char strings)

Definition at line 2281 of file ehrhart.c.

References addeliminatedparams_evalue(), assert, CATCH, _evalue::d, _Param_Polyhedron::D, polyhedron::Dimension, _Param_Domain::Domain, Domain_Free(), DomainIntersection(), DomainSimplify(), emptyQ, Enumerate_NoParameters(), _enumeration::EP, evalue_div(), polyhedron::NbBid, matrix::NbColumns, polyhedron::NbEq, polyhedron::NbRays, matrix::NbRows, _Param_Polyhedron::nbV, _enumeration::next, _Param_Domain::next, overflow_error, overflow_warning_flag, P_Enum(), P_VALUE_FMT, Param_Polyhedron_Scale_Integer(), Polyhedron2Param_SimplifiedDomain(), Polyhedron_Free(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Print(), Polyhedron_Scan(), PolyhedronIncludes(), Print_Domain(), print_evalue(), polyhedron::Ray, reduce_evalue(), TRY, UNCATCH, Universe_Polyhedron(), _enumeration::ValidityDomain, value_clear, value_init, value_multiply, value_notzero_p, value_print, value_set_si, value_zero_p, and Vector_Set().

Referenced by Ehrhart_Quick_Apx().

static void emul ( evalue e1,
evalue e2,
evalue res 
) [static]

multiplies two evalues and puts the result in res

Parameters:
e1 pointer to an evalue
e2 pointer to a constant evalue
res pointer to result evalue = e1 * e2

Definition at line 368 of file ehrhart.c.

References _enode::arr, _evalue::d, new_enode(), p, _enode::pos, _enode::size, _enode::type, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_notone_p, value_notzero_p, value_set_si, and value_zero_p.

Referenced by edot().

Enumeration* Enumerate_NoParameters ( Polyhedron P,
Polyhedron C,
Matrix CT,
Polyhedron CEq,
unsigned  MAXRAYS,
const char **  param_name 
)

Procedure to count points in a non-parameterized polytope.

Parameters:
P Polyhedron to count
C Parameter Context domain
CT Matrix to transform context to original
CEq additionnal equalities in context
MAXRAYS workspace size
param_name parameter names

Definition at line 1738 of file ehrhart.c.

References assert, CATCH, count_points(), _evalue::d, polyhedron::Dimension, Domain_Free(), DomainIntersection(), emptyQ, _enumeration::EP, polyhedron::NbRays, new_enode(), _enumeration::next, overflow_error, overflow_warning_flag, P_VALUE_FMT, Polyhedron_Free(), Polyhedron_Preimage(), Polyhedron_Print(), Polyhedron_Scan(), polynomial, Print_Domain(), print_evalue(), polyhedron::Ray, TRY, UNCATCH, Universe_Polyhedron(), _enumeration::ValidityDomain, value_clear, value_init, value_notone_p, value_print, value_set_si, value_zero_p, and Vector_Set().

Referenced by Ehrhart_Quick_Apx_Full_Dim(), and Polyhedron_Enumerate().

void Enumeration_Free ( Enumeration en  ) 
Enumeration* Enumeration_zero ( unsigned int  nbParms,
unsigned int  maxRays 
)

returns a constant Ehrhart polynomial whose value is zero for any value of the parameters.

Parameters:
nbParms the number of parameters, i.e., the number of arguments to the Ehrhart polynomial

Definition at line 2732 of file ehrhart.c.

References Constraints2Polyhedron(), Matrix_Alloc(), Matrix_Free(), matrix::p, Polyhedron_Enumerate(), Polyhedron_Free(), Universe_Polyhedron(), and value_set_si.

Referenced by test_Constraints_fullDimensionize().

void evalue_div ( evalue e,
Value  n 
)

Divides the evalue e by the integer n
recursive function
Warning : modifies e.

Parameters:
e an evalue (to be divided by n)
n 

Definition at line 2244 of file ehrhart.c.

References _evalue::d, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_notone_p, and value_zero_p.

Referenced by Ehrhart_Quick_Apx_Full_Dim().

void free_evalue_refs ( evalue e  ) 

releases all memory referenced by e.

(recursive)

Parameters:
e pointer to an evalue

Definition at line 139 of file ehrhart.c.

References _enode::arr, _evalue::d, free_evalue_refs(), p, _enode::size, value_clear, and value_notzero_p.

Referenced by dehomogenize_evalue(), Domain_Enumerate(), eadd(), edot(), Enumeration_Free(), free_evalue_refs(), main(), P_Enum(), and reduce_evalue().

enode* new_enode ( enode_type  type,
int  size,
int  pos 
)

EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.

The newly allocated enode can be freed with a simple free(x)

Parameters:
type : enode type
size : degree+1 for polynomial, period for periodic
pos : 1..nb_param, position of parameter
Returns:
a newly allocated enode

Definition at line 114 of file ehrhart.c.

References _enode::arr, _evalue::d, _enode::pos, _enode::size, _enode::type, value_init, and value_set_si.

Referenced by ecopy(), emul(), Enumerate_NoParameters(), new_eadd(), and P_Enum().

Polyhedron* old_Polyhedron_Preprocess ( Polyhedron D,
Value  size,
unsigned  MAXRAYS 
)

This procedure adds additional constraints to D so that as each parameter is scanned, it will have a minimum of 'size' points If this is not possible, an empty polyhedron is returned.

Parameters:
D 
size 
MAXRAYS 

Definition at line 1063 of file ehrhart.c.

References AddConstraints(), polyhedron::Constraint, polyhedron::Dimension, Matrix_Alloc(), Matrix_Free(), polyhedron::NbConstraints, matrix::p, p, matrix::p_Init, value_absolute, value_addmul, value_assign, value_clear, value_divexact, value_gcd, value_init, value_multiply, value_negz_p, value_notzero_p, value_oppose, value_posz_p, value_set_si, Vector_Combine(), and Vector_Normalize().

const char** parmsWithoutElim ( char const **  parmNames,
unsigned int const *  elimParms,
unsigned int  nbParms 
)

Returns the array of parameter names after some of them have been eliminated.

Parameters:
parmNames the initial names of the parameters
elimParms a list of parameters that have been eliminated from the original parameters. The first element of this array is the number of elements.

Note: does not copy the parameters names themselves.

Parameters:
nbParms the initial number of parameters

Definition at line 2709 of file ehrhart.c.

Enumeration* Polyhedron_Enumerate ( Polyhedron Pi,
Polyhedron C,
unsigned  MAXRAYS,
const char **  param_name 
)

Procedure to count points in a parameterized polytope.

Parameters:
Pi Polyhedron to enumerate
C Context Domain
MAXRAYS size of workspace
param_name parameter names (array of strings), may be NULL
Returns:
a list of validity domains + evalues EP

Definition at line 1860 of file ehrhart.c.

References addeliminatedparams_evalue(), assert, CATCH, _Param_Polyhedron::D, _evalue::d, dehomogenize_evalue(), polyhedron::Dimension, _Param_Domain::Domain, Domain_Free(), DomainIntersection(), DomainSimplify(), emptyQ, Enumerate_NoParameters(), _enumeration::EP, _Param_Domain::F, homogenize(), Matrix_Free(), polyhedron::NbBid, matrix::NbColumns, polyhedron::NbEq, polyhedron::NbRays, matrix::NbRows, _Param_Domain::next, _enumeration::next, overflow_error, overflow_warning_flag, P_Enum(), P_VALUE_FMT, Param_Polyhedron_Free(), Param_Vertices_Free(), POL_ENSURE_FACETS, POL_ENSURE_VERTICES, POL_ISSET, POL_NO_DUAL, Polyhedron2Param_SimplifiedDomain(), Polyhedron_Free(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Print(), Polyhedron_Scan(), PolyhedronIncludes(), Print_Domain(), print_evalue(), polyhedron::Ray, reduce_evalue(), Scan_Vertices(), TRY, UNCATCH, Universe_Polyhedron(), _Param_Polyhedron::V, _enumeration::ValidityDomain, value_addto, value_clear, value_init, value_multiply, value_notzero_p, value_print, value_set_si, value_zero_p, and Vector_Set().

Referenced by Domain_Enumerate(), Enumeration_zero(), main(), and test_Constraints_fullDimensionize().

Polyhedron* Polyhedron_Preprocess ( Polyhedron D,
Value *  size,
unsigned  MAXRAYS 
)

This procedure finds the smallest parallelepiped of size 'size[i]' for every dimension i, contained in polyhedron D.

If this is not possible, NULL is returned

written by vin100, 2000, for version 4.19
modified 2002, version 5.10

It first finds the coordinates of the lexicographically smallest edge of the hypercube, obtained by transforming the constraints of D (by adding 'size' as many times as there are negative coeficients in each constraint), and finding the lexicographical min of this polyhedron. Then it builds the hypercube and returns it.

Parameters:
D 
size 
MAXRAYS 

Definition at line 744 of file ehrhart.c.

References assert, cherche_min(), polyhedron::Constraint, Constraints2Polyhedron(), polyhedron::Dimension, Domain_Free(), emptyQ, Matrix_Alloc(), Matrix_Free(), Matrix_Print(), min, polyhedron::NbConstraints, matrix::NbRows, matrix::p, P_VALUE_FMT, Polyhedron_Free(), Polyhedron_Print(), Polyhedron_Scan(), Universe_Polyhedron(), value_addmul, value_addto, value_clear, value_init, value_ne, value_neg_p, value_oppose, value_print, value_set_si, value_sub_int, value_zero_p, and Vector_Copy().

Referenced by Ehrhart_Quick_Apx_Full_Dim(), and Polyhedron_Enumerate().

Polyhedron* Polyhedron_Preprocess2 ( Polyhedron D,
Value *  size,
Value *  lcm,
unsigned  MAXRAYS 
)

This procedure finds an hypercube of size 'size', containing polyhedron D increases size and lcm if necessary (and not "too big") If this is not possible, an empty polyhedron is returned.

 written by vin100, 2001, for version 4.19
Parameters:
D 
size 
lcm 
MAXRAYS 

Definition at line 899 of file ehrhart.c.

References Constraints2Polyhedron(), polyhedron::Dimension, Matrix_Alloc(), Matrix_Free(), Matrix_Print(), n, polyhedron::NbRays, matrix::p, P_VALUE_FMT, polyhedron::Ray, s, value_add_int, value_addto, value_assign, value_clear, value_division, value_gt, value_init, value_le, value_lt, value_multiply, value_oppose, value_print, value_set_si, value_sub_int, value_subtract, and value_zero_p.

Referenced by Ehrhart_Quick_Apx_Full_Dim(), and Polyhedron_Enumerate().

void print_enode ( FILE *  DST,
enode p,
const char **  pname 
)

prints the enode to DST

Parameters:
DST destination file
p pointer to enode to be printed
pname array of strings, name of the parameters

Definition at line 216 of file ehrhart.c.

References _enode::arr, evector, periodic, polynomial, _enode::pos, print_evalue(), _enode::size, and _enode::type.

Referenced by P_Enum(), and print_evalue().

void print_evalue ( FILE *  DST,
evalue e,
const char **  pname 
)
Parameters:
DST destination file
e pointer to evalue to be printed
pname array of strings, name of the parameters

Definition at line 192 of file ehrhart.c.

References _evalue::d, print_enode(), value_notone_p, value_notzero_p, and value_print.

Referenced by compute_poly(), Ehrhart_Quick_Apx_Full_Dim(), Enumerate_NoParameters(), main(), P_Enum(), Polyhedron_Enumerate(), print_enode(), and test_Constraints_fullDimensionize().

void reduce_evalue ( evalue e  ) 

Variable Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ftv2pnode.png0000644000175000017500000000031011303257450022560 0ustar sylvestresylvestre‰PNG  IHDRLƒ1Ù$PLTEÀÀÀ€€€S¾™tRNS@æØftEXtSoftwaregif2png 2.4.2£^G0IDATxÚc` .àBn&8ââTŠÊàÞ >DŒ›II‰››Y¦S;:ºk/ªËoIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/vector_8c-source.html0000644000175000017500000022360611253740770024250 0ustar sylvestresylvestre polylib: vector.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/param_8c_source.html0000644000175000017500000002162511303257446024124 0ustar sylvestresylvestre polylib: param.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structfactor-members.html0000644000175000017500000000335011303257447025221 0ustar sylvestresylvestre polylib: Member List

factor Member List

This is the complete list of members for factor, including all inherited members.
countfactor
facfactor

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errors_8c_source.html0000644000175000017500000012430311303257445024334 0ustar sylvestresylvestre polylib: errors.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/param_8h-source.html0000644000175000017500000000542111253740767024052 0ustar sylvestresylvestre polylib: param.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_type.html0000644000175000017500000000642411303257450023531 0ustar sylvestresylvestre polylib: Class Members
 

Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8h-source.html0000644000175000017500000000511611253740767025212 0ustar sylvestresylvestre polylib: NormalForms.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x61.html0000644000175000017500000001767711303257447023270 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- a -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/pp_8c-source.html0000644000175000017500000002531211253740770023357 0ustar sylvestresylvestre polylib: pp.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x6d.html0000644000175000017500000003124511303257447023336 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- m -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__quick__apx_8c.html0000644000175000017500000001063611303257446025443 0ustar sylvestresylvestre polylib: ehrhart_quick_apx.c File Reference

ehrhart_quick_apx.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

int main (int argc, char **argv)

Function Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/vector_8h.html0000644000175000017500000021417111303257447022754 0ustar sylvestresylvestre polylib: vector.h File Reference

vector.h File Reference

Go to the source code of this file.

Functions

int ConstraintSimplify (Value *old, Value *n, int len, Value *v)
Value * value_alloc (int want, int *got)
void value_free (Value *p, int size)
void Factorial (int n, Value *result)
void Binomial (int n, int p, Value *result)
void CNP (int a, int b, Value *result)
void Gcd (Value a, Value b, Value *result)
int First_Non_Zero (Value *p, unsigned length)
VectorVector_Alloc (unsigned length)
void Vector_Free (Vector *vector)
void Vector_Print (FILE *Dst, const char *Format, Vector *Vec)
VectorVector_Read (void)
void Vector_Set (Value *p, int n, unsigned length)
void Vector_Exchange (Value *p1, Value *p2, unsigned length)
void Vector_Copy (Value *p1, Value *p2, unsigned length)
void Vector_Add (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Sub (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Or (Value *p1, Value *p2, Value *p3, unsigned length)
void Vector_Scale (Value *p1, Value *p2, Value lambda, unsigned length)
void Vector_AntiScale (Value *p1, Value *p2, Value lambda, unsigned length)
void Vector_Oppose (Value *p1, Value *p2, unsigned length)
void Inner_Product (Value *p1, Value *p2, unsigned length, Value *result)
void Vector_Max (Value *p, unsigned length, Value *result)
void Vector_Min (Value *p, unsigned length, Value *result)
void Vector_Combine (Value *p1, Value *p2, Value *p3, Value lambda, Value mu, unsigned length)
int Vector_Equal (Value *Vec1, Value *Vec2, unsigned n)
void Vector_Min_Not_Zero (Value *p, unsigned length, int *index, Value *result)
void Vector_Gcd (Value *p, unsigned length, Value *result)
void Vector_Map (Value *p1, Value *p2, Value *p3, unsigned length, Value *(*f)(Value, Value))
void Vector_Normalize (Value *p, unsigned length)
void Vector_Normalize_Positive (Value *p, int length, int pos)
void Vector_Reduce (Value *p, unsigned length, void(*f)(Value, Value *), Value *result)
void Vector_Sort (Value *vector, unsigned n)
int Vector_IsZero (Value *v, unsigned length)

Function Documentation

void Binomial ( int  n,
int  p,
Value *  result 
)

Definition at line 61 of file vector.c.

References Factorial(), value_clear, value_division, value_init, value_multiply, and value_set_si.

void CNP ( int  a,
int  b,
Value *  result 
)

Definition at line 89 of file vector.c.

References value_clear, value_division, value_init, value_multiply, and value_set_si.

int ConstraintSimplify ( Value *  old,
Value *  n,
int  len,
Value *  v 
)
void Factorial ( int  n,
Value *  result 
)

Definition at line 43 of file vector.c.

References value_clear, value_init, value_multiply, and value_set_si.

Referenced by Binomial().

int First_Non_Zero ( Value *  p,
unsigned  length 
)
void Gcd ( Value  a,
Value  b,
Value *  result 
)

Definition at line 116 of file vector.c.

References value_absolute, value_assign, value_clear, value_init, value_modulus, and value_notzero_p.

Referenced by Lcm3().

void Inner_Product ( Value *  p1,
Value *  p2,
unsigned  length,
Value *  result 
)

Definition at line 384 of file vector.c.

References value_addmul, value_multiply, and value_set_si.

Referenced by lower_upper_bounds(), and test_Constraints_fullDimensionize().

Value* value_alloc ( int  want,
int *  got 
)

Definition at line 765 of file vector.c.

References cache, size, value_init, and Vector_Set().

Referenced by Matrix_Alloc(), and Polyhedron_Alloc().

void value_free ( Value *  p,
int  size 
)

Definition at line 807 of file vector.c.

References cache, MAX_CACHE_SIZE, and value_clear.

Referenced by Matrix_Free(), and Polyhedron_Free().

void Vector_Add ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 286 of file vector.c.

References value_addto.

void Vector_AntiScale ( Value *  p1,
Value *  p2,
Value  lambda,
unsigned  length 
)
void Vector_Combine ( Value *  p1,
Value *  p2,
Value *  p3,
Value  lambda,
Value  mu,
unsigned  length 
)
int Vector_Equal ( Value *  Vec1,
Value *  Vec2,
unsigned  n 
)

Definition at line 453 of file vector.c.

References value_ne.

Referenced by Remove_Redundants().

void Vector_Exchange ( Value *  p1,
Value *  p2,
unsigned  length 
)

Definition at line 256 of file vector.c.

References value_swap.

Referenced by Chernikova(), Gauss4(), GaussSimplify(), hermite(), RaySort(), Remove_Redundants(), and SortConstraints().

int Vector_IsZero ( Value *  v,
unsigned  length 
)

Definition at line 747 of file vector.c.

References value_notzero_p, value_set_si, and value_zero_p.

Referenced by eliminable_vars(), and int_ker().

void Vector_Map ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length,
Value *(*)(Value, Value)  f 
)

Definition at line 547 of file vector.c.

References value_assign.

void Vector_Max ( Value *  p,
unsigned  length,
Value *  result 
)

Definition at line 399 of file vector.c.

References value_assign, and value_maximum.

void Vector_Min ( Value *  p,
unsigned  length,
Value *  result 
)

Definition at line 416 of file vector.c.

References value_assign, and value_minimum.

void Vector_Min_Not_Zero ( Value *  p,
unsigned  length,
int *  index,
Value *  result 
)
void Vector_Normalize ( Value *  p,
unsigned  length 
)
void Vector_Normalize_Positive ( Value *  p,
int  length,
int  pos 
)
void Vector_Oppose ( Value *  p1,
Value *  p2,
unsigned  length 
)

Definition at line 373 of file vector.c.

References value_oppose.

Referenced by Gauss4().

void Vector_Or ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 324 of file vector.c.

References value_orto.

void Vector_Print ( FILE *  Dst,
const char *  Format,
Vector Vec 
)

Definition at line 193 of file vector.c.

References Vector::p, p, P_VALUE_FMT, Vector::Size, and value_print.

Referenced by main().

Vector* Vector_Read ( void   ) 

Definition at line 215 of file vector.c.

References errormsg1(), Vector::p, p, value_read, and Vector_Alloc().

void Vector_Reduce ( Value *  p,
unsigned  length,
void(*)(Value, Value *)  f,
Value *  result 
)

Definition at line 604 of file vector.c.

References value_assign.

void Vector_Scale ( Value *  p1,
Value *  p2,
Value  lambda,
unsigned  length 
)

Definition at line 343 of file vector.c.

References value_multiply.

Referenced by Param_Polyhedron_Scale_Integer(), and Remove_Redundants().

void Vector_Sort ( Value *  vector,
unsigned  n 
)

Definition at line 620 of file vector.c.

References value_assign, value_clear, value_init, and value_lt.

void Vector_Sub ( Value *  p1,
Value *  p2,
Value *  p3,
unsigned  length 
)

Definition at line 305 of file vector.c.

References value_subtract.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structinterval.html0000644000175000017500000001625311303257447024145 0ustar sylvestresylvestre polylib: interval Struct Reference

interval Struct Reference

#include <types.h>

List of all members.

Public Attributes

Value MaxN
Value MaxD
Value MinN
Value MinD
int MaxI
int MinI

Detailed Description

Definition at line 127 of file types.h.


Member Data Documentation

Definition at line 128 of file types.h.

Referenced by DomainCost().

Definition at line 130 of file types.h.

Referenced by DomainCost().

Definition at line 128 of file types.h.

Referenced by DomainCost().

Definition at line 129 of file types.h.

Referenced by DomainCost().

Definition at line 130 of file types.h.

Referenced by DomainCost().

Definition at line 129 of file types.h.

Referenced by DomainCost().


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__ranking_8c.html0000644000175000017500000001111411303257446024741 0ustar sylvestresylvestre polylib: ehrhart_ranking.c File Reference

ehrhart_ranking.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <polylib/polylib.h>
#include <polylib/ranking.h>

Go to the source code of this file.

Functions

int main (int argc, char **argv)

Function Documentation


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8c_source.html0000644000175000017500000040211011303257445025467 0ustar sylvestresylvestre polylib: ext_ehrhart.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__sep_8c.html0000644000175000017500000001264611303257446025647 0ustar sylvestresylvestre polylib: disjoint_union_sep.c File Reference

disjoint_union_sep.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define WS   0

Functions

void AffContraintes (Polyhedron *p)
int main ()

Define Documentation

#define WS   0

Definition at line 36 of file disjoint_union_sep.c.


Function Documentation

void AffContraintes ( Polyhedron p  ) 

Definition at line 40 of file disjoint_union_sep.c.

References polyhedron::next, P_VALUE_FMT, and Polyhedron_PrintConstraints().


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__addon_8c.html0000644000175000017500000014277611303257447024270 0ustar sylvestresylvestre polylib: matrix_addon.c File Reference

matrix_addon.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>
#include <polylib/matrix_addon.h>

Go to the source code of this file.

Functions

MatrixconstraintsView (Polyhedron *P)
 
Id
matrix_addon.c,v 1.17 2007/03/18 18:49:08 skimo Exp

void constraintsView_Free (Matrix *M)
 "Frees" a view of the constraints of a polyhedron
void split_constraints (Matrix const *M, Matrix **Eqs, Matrix **Ineqs)
 splits a matrix of constraints M into a matrix of equalities Eqs and a matrix of inequalities Ineqs allocs the new matrices.
MatrixIdentity_Matrix (unsigned int dim)
void Matrix_identity (unsigned int dim, Matrix **I)
 returns the dim-dimensional identity matrix.
void mtransformation_inverse (Matrix *transf, Matrix **inverse, Value *g)
 given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix.
Matrixmtransformation_expand_left_to_dim (Matrix *M, int new_dim)
 takes a transformation matrix, and expands it to a higher dimension with the identity matrix regardless of it homogeneousness
void mpolyhedron_simplify (Matrix *polyh)
 simplify a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements.
void mpolyhedron_inflate (Matrix *polyh, unsigned int nb_parms)
 inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra.
void mpolyhedron_deflate (Matrix *polyh, unsigned int nb_parms)
 deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra.
void eliminate_var_with_constr (Matrix *Eliminator, unsigned int eliminator_row, Matrix *Victim, unsigned int victim_row, unsigned int var_to_elim)
 use an eliminator row to eliminate a variable in a victim row (without changing the sign of the victim row -> important if it is an inequality).
void mpolyhedron_compress_last_vars (Matrix *M, Matrix *compression)
 compress the last vars/pars of the polyhedron M expressed as a polylib matrix

  • adresses the full-rank compressions only
  • modfies M

unsigned int mpolyhedron_eliminate_first_variables (Matrix *Eqs, Matrix *Ineqs)
 use a set of m equalities Eqs to eliminate m variables in the polyhedron Ineqs represented as a matrix eliminates the m first variables

  • assumes that Eqs allow to eliminate the m equalities
  • modifies Eqs and Ineqs

void Matrix_subMatrix (Matrix *M, unsigned int sr, unsigned int sc, unsigned int er, unsigned int ec, Matrix **sub)
 returns a contiguous submatrix of a matrix.
void Matrix_clone (Matrix *M, Matrix **Cl)
 Cloning function.
void Matrix_copySubMatrix (Matrix *M1, unsigned int sr1, unsigned int sc1, unsigned int nbR, unsigned int nbC, Matrix *M2, unsigned int sr2, unsigned int sc2)
 Copies a contiguous submatrix of M1 into M2, at the indicated position.
void Matrix_oppose (Matrix *M)
 transforms a matrix M into -M

Function Documentation

Matrix* constraintsView ( Polyhedron P  ) 

Id
matrix_addon.c,v 1.17 2007/03/18 18:49:08 skimo Exp

Polylib matrix addons Mainly, deals with polyhedra represented as a matrix (implicit form)

Author:
Benoit Meister <meister@icps.u-strasbg.fr> Creates a view of the constraints of a polyhedron as a Matrix *

Definition at line 32 of file matrix_addon.c.

References polyhedron::Constraint, polyhedron::Dimension, matrix::NbColumns, polyhedron::NbConstraints, matrix::NbRows, and matrix::p.

void constraintsView_Free ( Matrix M  ) 

"Frees" a view of the constraints of a polyhedron

Definition at line 41 of file matrix_addon.c.

void eliminate_var_with_constr ( Matrix Eliminator,
unsigned int  eliminator_row,
Matrix Victim,
unsigned int  victim_row,
unsigned int  var_to_elim 
)

use an eliminator row to eliminate a variable in a victim row (without changing the sign of the victim row -> important if it is an inequality).

Parameters:
Eliminator the matrix containing the eliminator row
eliminator_row the index of the eliminator row in Eliminator
Victim the matrix containing the row to be eliminated
victim_row the row to be eliminated in Victim
var_to_elim the variable to be eliminated.

Definition at line 241 of file matrix_addon.c.

References matrix::NbColumns, matrix::p, value_addto, value_clear, value_division, value_init, value_lcm, value_multiply, value_notzero_p, value_oppose, and value_pos_p.

Referenced by Constraints_Remove_parm_eqs(), and mpolyhedron_eliminate_first_variables().

Matrix* Identity_Matrix ( unsigned int  dim  ) 
void Matrix_clone ( Matrix M,
Matrix **  Cl 
)

Cloning function.

Similar to Matrix_Copy() but allocates the target matrix if it is set to NULL.

Definition at line 377 of file matrix_addon.c.

References Matrix_subMatrix(), matrix::NbColumns, and matrix::NbRows.

Referenced by Constraints_removeElimCols().

void Matrix_copySubMatrix ( Matrix M1,
unsigned int  sr1,
unsigned int  sc1,
unsigned int  nbR,
unsigned int  nbC,
Matrix M2,
unsigned int  sr2,
unsigned int  sc2 
)

Copies a contiguous submatrix of M1 into M2, at the indicated position.

M1 and M2 are assumed t be allocated already.

Parameters:
M1 the source matrix
sr1 the starting source row
sc1 the starting source column
nbR the number of rows
nbC the number of columns
M2 the target matrix
sr2 the starting target row
sc2 the starting target column

Definition at line 394 of file matrix_addon.c.

References matrix::p, and Vector_Copy().

Referenced by Equalities_intModBasis(), Equalities_validityLattice(), Lattice_extractSubLattice(), and linearInter().

void Matrix_identity ( unsigned int  dim,
Matrix **  I 
)

returns the dim-dimensional identity matrix.

If I is set to NULL, allocates it first. Else, assumes an existing, allocated Matrix.

Definition at line 99 of file matrix_addon.c.

References assert, Identity_Matrix(), and value_set_si.

Referenced by Constraints_fullDimensionize().

void Matrix_oppose ( Matrix M  ) 

transforms a matrix M into -M

given a matrix M into -M

Definition at line 409 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, and value_oppose.

Referenced by Equalities_integerSolution().

void Matrix_subMatrix ( Matrix M,
unsigned int  sr,
unsigned int  sc,
unsigned int  er,
unsigned int  ec,
Matrix **  sub 
)

returns a contiguous submatrix of a matrix.

Parameters:
M the input matrix
sr the index of the starting row
sc the index of the starting column
er the index ofthe ending row (excluded)
ec the ined of the ending colummn (excluded)
sub (returned), the submatrix. Allocated if set to NULL, assumed to be already allocated else.

Definition at line 357 of file matrix_addon.c.

References assert, Matrix_Alloc(), matrix::p, and Vector_Copy().

Referenced by Equalities_integerSolution(), Equalities_validityLattice(), int_ker(), Lattice_extractSubLattice(), linearInter(), and Matrix_clone().

void mpolyhedron_compress_last_vars ( Matrix M,
Matrix compression 
)

compress the last vars/pars of the polyhedron M expressed as a polylib matrix

  • adresses the full-rank compressions only
  • modfies M

Definition at line 293 of file matrix_addon.c.

References assert, Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, value_addmul, value_assign, and value_set_si.

Referenced by Ehrhart_Quick_Apx(), and full_dimensionize().

void mpolyhedron_deflate ( Matrix polyh,
unsigned int  nb_parms 
)

deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a lower bound of the Ehrhart polynomial of P WARNING: this deflation is supposed to be applied on full-dimensional polyhedra.

Definition at line 213 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addto, value_clear, value_init, value_pos_p, value_set_si, and value_subtract.

Referenced by main().

unsigned int mpolyhedron_eliminate_first_variables ( Matrix Eqs,
Matrix Ineqs 
)

use a set of m equalities Eqs to eliminate m variables in the polyhedron Ineqs represented as a matrix eliminates the m first variables

  • assumes that Eqs allow to eliminate the m equalities
  • modifies Eqs and Ineqs

Definition at line 321 of file matrix_addon.c.

References eliminate_var_with_constr(), matrix::NbRows, matrix::p, value_cmp_si, and value_set_si.

Referenced by full_dimensionize().

void mpolyhedron_inflate ( Matrix polyh,
unsigned int  nb_parms 
)

inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an upper bound of the Ehrhart polynomial of P WARNING: this inflation is supposed to be applied on full-dimensional polyhedra.

Definition at line 190 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_addto, value_clear, value_init, value_neg_p, value_set_si, and value_subtract.

Referenced by main().

void mpolyhedron_simplify ( Matrix polyh  ) 

simplify a matrix seen as a polyhedron, by dividing its rows by the gcd of their elements.

Definition at line 172 of file matrix_addon.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_clear, value_init, value_print, Vector_AntiScale(), and Vector_Gcd().

Matrix* mtransformation_expand_left_to_dim ( Matrix M,
int  new_dim 
)

takes a transformation matrix, and expands it to a higher dimension with the identity matrix regardless of it homogeneousness

Definition at line 155 of file matrix_addon.c.

References assert, Identity_Matrix(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

void mtransformation_inverse ( Matrix transf,
Matrix **  inverse,
Value *  g 
)

given a n x n integer transformation matrix transf, compute its inverse M/g, where M is a nxn integer matrix.

g is a common denominator for elements of (transf^{-1})

Definition at line 123 of file matrix_addon.c.

References MatInverse(), Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, value_clear, value_division, value_init, value_lcm, value_multiply, and value_set_si.

void split_constraints ( Matrix const *  M,
Matrix **  Eqs,
Matrix **  Ineqs 
)

splits a matrix of constraints M into a matrix of equalities Eqs and a matrix of inequalities Ineqs allocs the new matrices.

Allocates Eqs and Ineqs.

Definition at line 50 of file matrix_addon.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, and value_zero_p.

Referenced by Constraints_fullDimensionize(), and full_dimensionize().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/c2p_8c_source.html0000644000175000017500000001307011303257445023502 0ustar sylvestresylvestre polylib: c2p.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8c-source.html0000644000175000017500000037466411253740767025443 0ustar sylvestresylvestre polylib: ext_ehrhart.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__quick__apx_8c-source.html0000644000175000017500000002316311253740767026747 0ustar sylvestresylvestre polylib: ehrhart_quick_apx.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polylib32_8h.html0000644000175000017500000000452511303257447023271 0ustar sylvestresylvestre polylib: polylib32.h File Reference

polylib32.h File Reference

#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define POLYLIB_BITS   32

Define Documentation

#define POLYLIB_BITS   32

Definition at line 18 of file polylib32.h.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8c_source.html0000644000175000017500000006522511303257445026061 0ustar sylvestresylvestre polylib: homogenization.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x76.html0000644000175000017500000007756711303257447023302 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- v -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/alpha_8c-source.html0000644000175000017500000023276011253740766024041 0ustar sylvestresylvestre polylib: alpha.c Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/compress__parms_8c_source.html0000644000175000017500000040525011303257445026217 0ustar sylvestresylvestre polylib: compress_parms.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x62.html0000644000175000017500000001065111303257447023252 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- b -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/SolveDio_8c_source.html0000644000175000017500000011353611303257446024553 0ustar sylvestresylvestre polylib: SolveDio.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Matop_8c.html0000644000175000017500000011641011303257447022522 0ustar sylvestresylvestre polylib: Matop.c File Reference

Matop.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Functions

void Lcm3 (Value a, Value b, Value *c)
Value * Lcm (Value i, Value j)
MatrixIdentity (unsigned size)
void ExchangeRows (Matrix *M, int Row1, int Row2)
void ExchangeColumns (Matrix *M, int Column1, int Column2)
MatrixTranspose (Matrix *A)
MatrixMatrix_Copy (Matrix const *Src)
Bool isIntegral (Matrix *A)
Bool isinHnf (Matrix *A)
void PutRowLast (Matrix *X, int Rownumber)
void PutRowFirst (Matrix *X, int Rownumber)
void PutColumnFirst (Matrix *X, int Columnnumber)
void PutColumnLast (Matrix *X, int Columnnumber)
MatrixAddANullRow (Matrix *M)
MatrixAddANullColumn (Matrix *M)
MatrixRemoveRow (Matrix *M, int Rownumber)
MatrixRemoveNColumns (Matrix *M, int FirstColumnnumber, int NumColumns)
MatrixRemoveColumn (Matrix *M, int Columnnumber)
int findHermiteBasis (Matrix *M, Matrix **Result)

Function Documentation

Matrix* AddANullColumn ( Matrix M  ) 
Matrix* AddANullRow ( Matrix M  ) 
void ExchangeColumns ( Matrix M,
int  Column1,
int  Column2 
)

Definition at line 90 of file Matop.c.

References matrix::NbRows, matrix::p, and value_swap.

void ExchangeRows ( Matrix M,
int  Row1,
int  Row2 
)

Definition at line 72 of file Matop.c.

References matrix::NbColumns, matrix::p, value_assign, value_clear, and value_init.

Referenced by Constraints2Polyhedron(), and RearrangeMatforSolveDio().

Matrix* Identity ( unsigned  size  ) 
Bool isIntegral ( Matrix A  ) 
Value* Lcm ( Value  i,
Value  j 
)

Definition at line 45 of file Matop.c.

References Lcm3(), and value_init.

void Lcm3 ( Value  a,
Value  b,
Value *  c 
)

Definition at line 22 of file Matop.c.

References Gcd(), value_absolute, value_assign, value_clear, value_division, value_init, value_multiply, and value_zero_p.

Referenced by Lcm().

void PutColumnFirst ( Matrix X,
int  Columnnumber 
)

Definition at line 230 of file Matop.c.

References matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutColumnLast ( Matrix X,
int  Columnnumber 
)

Definition at line 249 of file Matop.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutRowFirst ( Matrix X,
int  Rownumber 
)

Definition at line 210 of file Matop.c.

References matrix::NbColumns, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

void PutRowLast ( Matrix X,
int  Rownumber 
)

Definition at line 188 of file Matop.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, value_assign, value_clear, and value_init.

Referenced by Homogenise().

Matrix* RemoveColumn ( Matrix M,
int  Columnnumber 
)

Definition at line 340 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Referenced by FindHermiteBasisofDomain().

Matrix* RemoveNColumns ( Matrix M,
int  FirstColumnnumber,
int  NumColumns 
)

Definition at line 322 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Matrix* RemoveRow ( Matrix M,
int  Rownumber 
)

Definition at line 303 of file Matop.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and Vector_Copy().

Referenced by findHermiteBasis().

Matrix* Transpose ( Matrix A  ) 

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/assert_8h-source.html0000644000175000017500000000504411253740766024253 0ustar sylvestresylvestre polylib: assert.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/main.html0000644000175000017500000000206511303257445021772 0ustar sylvestresylvestre polylib: Main Page

polylib Documentation

5.22.4


Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8c-source.html0000644000175000017500000001237611253740767024614 0ustar sylvestresylvestre polylib: errormsg.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polytest_8c-source.html0000644000175000017500000005140711253740770024627 0ustar sylvestresylvestre polylib: polytest.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ehrhart_8c_source.html0000644000175000017500000123701411303257445024462 0ustar sylvestresylvestre polylib: ehrhart.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__evalue.html0000644000175000017500000001062711303257447024077 0ustar sylvestresylvestre polylib: _evalue Struct Reference

_evalue Struct Reference

#include <types.h>

List of all members.

Public Attributes

Value d

Detailed Description

Definition at line 189 of file types.h.


Member Data Documentation


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/disjoint__union__adj_8c_source.html0000644000175000017500000002017711303257445027173 0ustar sylvestresylvestre polylib: disjoint_union_adj.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/structZPolyhedron.html0000644000175000017500000002056711303257447024601 0ustar sylvestresylvestre polylib: ZPolyhedron Struct Reference

ZPolyhedron Struct Reference

#include <types.h>

List of all members.

Public Attributes

LatticeLat
PolyhedronP
struct ZPolyhedronnext

Detailed Description

Definition at line 241 of file types.h.


Member Data Documentation


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8h-source.html0000644000175000017500000000454711253740767025436 0ustar sylvestresylvestre polylib: ext_ehrhart.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polylibgmp_8h.html0000644000175000017500000000451111303257447023623 0ustar sylvestresylvestre polylib: polylibgmp.h File Reference

polylibgmp.h File Reference

#include <gmp.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define GNUMP

Define Documentation

#define GNUMP

Definition at line 18 of file polylibgmp.h.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/source_2arith_2arithmetic__errors_8h-source.html0000644000175000017500000003072411253740766031554 0ustar sylvestresylvestre polylib: arithmetic_errors.h Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8c.html0000644000175000017500000001770411303257446023307 0ustar sylvestresylvestre polylib: errormsg.c File Reference
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/classes.html0000644000175000017500000001273511303257447022512 0ustar sylvestresylvestre polylib: Alphabetical List

Class Index

E | F | I | L | M | P | S | V | Z | _
  E  
interval   
  P  
  Z  
_evalue   
Ehrhart   
  L  
polyhedron   ZPolyhedron   _Param_Domain   
  F  
LatticeUnion   
  S  
  _  
_Param_Polyhedron   
factor   linear_exception_holder   SatMatrix   _enode   _Param_Vertex   
forsimplify   
  M  
  V  
_enumeration   _Polyhedron_union   
  I  
matrix   Vector   
E | F | I | L | M | P | S | V | Z | _

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8c.html0000644000175000017500000005553011303257447025724 0ustar sylvestresylvestre polylib: matrix_permutations.c File Reference

matrix_permutations.c File Reference

#include <stdlib.h>
#include <polylib/matrix_permutations.h>

Go to the source code of this file.

Functions

unsigned int nb_bits (unsigned long long int x)
 
Id
matrix_permutations.c,v 1.8 2006/10/01 02:10:46 meister Exp

unsigned int * permutation_inverse (unsigned int *perm, unsigned int nb_elems)
 Gives the inverse permutation vector of a permutation vector.
Matrixmtransformation_permute (Matrix *transf, unsigned int *permutation)
 Given a linear tranformation on initial variables, and a variable permutation, computes the tranformation for the permuted variables.
Matrixmpolyhedron_permute (Matrix *polyh, unsigned int *permutation)
 permutes the variables of the constraints of a polyhedron
void Constraints_permute (Matrix *C, unsigned int *perm, Matrix **Cp)
 permutes the variables of the constraints of a polyhedron
unsigned long long int eliminable_vars (Matrix *Eqs, unsigned start, unsigned end)
 Given a set of equalities, find a set of variables that can be eliminated using these equalities.
unsigned int * find_a_permutation (Matrix *Eqs, unsigned int nb_parms)
 finds a valid permutation : for a set of m equations, find m variables that will be put at the beginning (to be eliminated).
unsigned int * permutation_for_full_dim2 (unsigned int *vars_to_keep, unsigned int nb_keep, unsigned int nb_vars_parms, unsigned int nb_parms)
 computes the permutation of variables and parameters, according to some variables to keep.

Function Documentation

void Constraints_permute ( Matrix C,
unsigned int *  perm,
Matrix **  Cp 
)

permutes the variables of the constraints of a polyhedron

Parameters:
C the original set of constraints
perm a permutation vector
Cp (returned) the set of constraints whose variables are permuted. Allocated if set to NULL, assumed to be already allocated if not.

Definition at line 104 of file matrix_permutations.c.

References assert, Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by Constraints_fullDimensionize().

unsigned long long int eliminable_vars ( Matrix Eqs,
unsigned  start,
unsigned  end 
)

Given a set of equalities, find a set of variables that can be eliminated using these equalities.

The variables that we agree to eliminate are in a zone of contiguous variables (or parameters).

Notes:

  • brute force, surely enhanceable algorithm
  • limited number of variables in the zone: limit = bitwidth of long long
Parameters:
Eqs the matrix of equalities.
start the rank of the first variable (inclusive) of the zone in Eqs
end the rank of the last variable (inclusive) of the zone return a bitfield where bits set to one define the variables to eliminate

Definition at line 134 of file matrix_permutations.c.

References assert, Constraints2Polyhedron(), emptyQ, Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), nb_bits(), matrix::NbColumns, matrix::NbRows, matrix::p, Polyhedron_Free(), right_hermite(), value_assign, value_notzero_p, and Vector_IsZero().

Referenced by find_a_permutation().

unsigned int* find_a_permutation ( Matrix Eqs,
unsigned int  nb_parms 
)

finds a valid permutation : for a set of m equations, find m variables that will be put at the beginning (to be eliminated).

Note: inherits the limited the number of variables from eliminable_vars

Definition at line 213 of file matrix_permutations.c.

References eliminable_vars(), matrix::NbColumns, and matrix::NbRows.

Referenced by Constraints_fullDimensionize(), and full_dimensionize().

Matrix* mpolyhedron_permute ( Matrix polyh,
unsigned int *  permutation 
)

permutes the variables of the constraints of a polyhedron

Parameters:
polyh the constraints of the polyhedron
permutation a permutation vector

Definition at line 85 of file matrix_permutations.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by full_dimensionize().

Matrix* mtransformation_permute ( Matrix transf,
unsigned int *  permutation 
)

Given a linear tranformation on initial variables, and a variable permutation, computes the tranformation for the permuted variables.

perm is a vector giving the new "position of the k^th variable, k \in [1..n] we can call it a "permutation vector if you wish transf[x][y] -> permuted[permutation(x)][permutation(y)]

Definition at line 66 of file matrix_permutations.c.

References assert, Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

unsigned int nb_bits ( unsigned long long int  x  ) 

Id
matrix_permutations.c,v 1.8 2006/10/01 02:10:46 meister Exp

Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron or Constraints).

Permutations on matrices Matrices are seen either as transformations (mtransformation) or as polyhedra (mpolyhedron)

Author:
B. Meister LSIIT -ICPS UMR 7005 CNRS Louis Pasteur University (ULP), Strasbourg, France

Permutations are just indirection vectors: the k^th element of a permutation vector is the position of the k^th variable in the permuted object. utility function : bit count (i know, there are faster methods)

Definition at line 36 of file matrix_permutations.c.

References n.

Referenced by eliminable_vars().

unsigned int* permutation_for_full_dim2 ( unsigned int *  vars_to_keep,
unsigned int  nb_keep,
unsigned int  nb_vars_parms,
unsigned int  nb_parms 
)

computes the permutation of variables and parameters, according to some variables to keep.

put the variables not to be kept at the beginning, then the parameters and finally the variables to be kept. strongly related to the function compress_to_full_dim2

Definition at line 256 of file matrix_permutations.c.

unsigned int* permutation_inverse ( unsigned int *  perm,
unsigned int  nb_elems 
)

Gives the inverse permutation vector of a permutation vector.

Parameters:
perm the permutation vector
 

Definition at line 51 of file matrix_permutations.c.


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/tab_r.gif0000644000175000017500000000503111303257445021732 0ustar sylvestresylvestreGIF89a,Õö÷ùñô÷öøúüýþúûüùúûøùúêïóïóöÆÕßÒÞæØâéÞçíÝæìåìñèîòô÷ùóöø³ÈÕÁÒÝËÙâÏÜäÖá薴ŹɯÂÍ»ÎÙÃÔÞÂÓÝÈ×àÌÚâÕáèÙäê×âèåìðëðó„°ÇÑÞåÜæëãëïëñôîóõ÷úûûüüÿÿÿþþþ,,ÿ@’pH,ȤrÉl:ŸÐ¨tJ­Z¯Ø¬v •h<¬pkL.›Ïè´zÍn»ßð¸|N¯Ûïø¼~ÏwVa+‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ “*)^,*ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂö)'ÆÎÏÐÑÒÓÔÕÖרÙÚÛÜÝÞßàáâãäåæÚ¥(" ðñòóôõö÷øùúûüýþÿ H° ÁƒòK"ƒRHœH±¢Å‹3jÜȱ£Ç CŠI²¤É“(Sª\éÅu&@€ Á²¦Í›8sêÜɳ§Oÿ–(±€DУH“*]Ê´©Ó§P£JJµªÕ«X³jÝʵ«×¯S84± ‰hÓª]˶­Û·pãÊK·®Ý»xóêÝË·¯ß¿€Ó} âDÌf(^̸±ãÇ#KžL¹²å˘3kÞ̹³çÏ C‹m¹ðCÄHœXͺµë×°cËžM»¶íÛ¸sëÞÍ»·ïßÀƒ N÷ÃJ” Á®¹óçУKŸN½ºõëØ³kßν»÷ïàËO¾úñ€ dÇ@€‚‚L¤"ÉÈF:ò‘Œ¤$9† (8…&ÉÉNzò“  ¥(G©FB^²!˨)WÉÊVºò•°l¤)1™ wÄò–¸Ì¥.wÊYºäƒà¥0‡IÌbó¾|ÉHpÌf:ó™Ðìe pJ±ˆ€}Ȧ6·ÉÍnzó›à §8û0Â%"¸æ8×ÉÎvºóðŒ§<ÉPÎQ`ò%×$€>÷ÉÏ~úóŸ ¨@JЂô M¨BÊІ:ô¡¨D'ZPKF Ö¼&16ÊÑŽzô£ ©HGJRb ÷Lç5ÏÁÒ–ºô¥ÿ0©LgJÓšš#(e>¯‰Óžúô§@ ªP‡JÔ¢õ¨HMªR—ÊÔ¦:õ©PªT§JÕª&5;%U·ÊÕ®zõ«` «XÇJV«ÂC§‹ÑjY×ÊÖ¶ºõ­p«\ŠU´À¦xÍ«^÷Ê×¾úõ¯ÐÀi)$‚”ô°ˆM¬bËØÆ:vˆ, ಘͬf7ËÙÎzö³  ­hGKÚÒšö´¨M­jWËÚÖºöµ°­*$ÛSPô¶¸Í­nwËÛÞúö·ÀÅm +„â¸ÈM®r—ËÜæ:÷¹ÐE®?±9ÏêZ÷ºØÍ®v¿9€î"‚ºÛ ¯xÇKÞòb—™ÑLÿ¯z×Ë^A¢·½ð¯|ç†÷Ò÷¾øÍ¯0í«ßþú÷¿¡ä/€Là»×ÀN°‚ï(à;øÁ n0„'LaýJ¸ÂÎ0{/¬á{ؘþ°ˆG|Ë“øÄ(¥‰SÌâCrÅ.ޱŒ ãÛøÆv¬1ŽwÌc6ê¸Ç@ÞñƒLd¹ÈHNñ‘“Ìd/¹ÉPÎð“£LeO¹ÊXŽp–·|â+sùËýõ2˜ÇL_1“ùÌí53š×M5³ùÍÇt3œç¼_:ÛÙÂwÎs™õÌgøÊ¹Ï€p ýÌ?úÐ/F´¢ë¼èFãÒÐŽŽt!-éJã‘Ò–Îô1­éN»‘ÓžuÿA-êP“ºÔ>5ª3­êUWºÕ®Ž4¬cÝèYÓZѶ¾õ¡s­ëAóº×€þ5°ù,ìaç¹ØÆ¶3²“=çe3ûÍÎ~öš£-í3S»Úc¾6¶¿¬ímo¹ÛÞÆ2¸ÃMåq“Êæ>7“Ó­n$³»ÝD~7¼,ïyó¸ÞöÆ1¾ómã}óÛÈÿvµ¿Þâ\É/µÁNâ…3ÜÉ÷´Ã#Þá‰S\ÊguÆ-mñO¸ã0ÈC¾à‘“\Ë'_´ÉS^à•³|À.ùc.ó0לÐ4¿9~s®ó=÷¼Ï<ÿy|ƒ.ô4]ÏD?ºz“®ô67]ÙO§3Ó£ÞÌ©SÄW‡vÖÙl>õ­3Úëdî:Øu)ö±?ÚìÙF;˜Ë®öW²½í­|;ÜW)÷¹²îvtÞ˽w¾÷Ý|à×=xÂÞÝA;polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x73.html0000644000175000017500000001025111303257450024243 0ustar sylvestresylvestre polylib: Class Members
 

- s -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/struct__Param__Polyhedron.html0000644000175000017500000002177611303257447026227 0ustar sylvestresylvestre polylib: _Param_Polyhedron Struct Reference

_Param_Polyhedron Struct Reference

#include <types.h>

List of all members.

Public Attributes

int nbV
Param_VerticesV
Param_DomainD
MatrixConstraints
MatrixRays

Detailed Description

Definition at line 157 of file types.h.


Member Data Documentation


The documentation for this struct was generated from the following file:

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Lattice_8h.html0000644000175000017500000015672211303257447023046 0ustar sylvestresylvestre polylib: Lattice.h File Reference

Lattice.h File Reference

Go to the source code of this file.

Functions

void AffineHermite (Lattice *A, Lattice **H, Matrix **U)
void AffineSmith (Lattice *A, Lattice **U, Lattice **V, Lattice **Diag)
LatticeChangeLatticeDimension (Lattice *A, int dimension)
LatticeEmptyLattice (int dimension)
LatticeExtractLinearPart (Lattice *A)
int FindHermiteBasisofDomain (Polyhedron *A, Matrix **B)
LatticeHomogenise (Lattice *A, Bool Forward)
int intcompare (const void *a, const void *b)
Bool isEmptyLattice (Lattice *A)
Bool isfulldim (Matrix *m)
Bool IsLattice (Matrix *m)
Bool isLinear (Lattice *A)
LatticeUnionLatticeDifference (Lattice *A, Lattice *B)
 Method :.
LatticeLatticeImage (Lattice *A, Matrix *M)
Bool LatticeIncludes (Lattice *A, Lattice *B)
LatticeLatticeIntersection (Lattice *X, Lattice *Y)
LatticeLatticePreimage (Lattice *L, Matrix *G)
LatticeUnionLatticeSimplify (LatticeUnion *latlist)
LatticeUnionLatticeUnion_Alloc (void)
void LatticeUnion_Free (LatticeUnion *Head)
void PrintLatticeUnion (FILE *fp, char *format, LatticeUnion *Head)
Bool sameAffinepart (Lattice *A, Lattice *B)
Bool sameLattice (Lattice *A, Lattice *B)
LatticeUnionLattice2LatticeUnion (Lattice *X, Lattice *Y)

Function Documentation

Lattice* ChangeLatticeDimension ( Lattice A,
int  dimension 
)
Lattice* EmptyLattice ( int  dimension  ) 
Lattice* ExtractLinearPart ( Lattice A  ) 

Definition at line 439 of file Lattice.c.

References Matrix_Alloc(), matrix::NbColumns, matrix::NbRows, matrix::p, and value_assign.

Referenced by Lattice2LatticeUnion().

Lattice* Homogenise ( Lattice A,
Bool  Forward 
)
int intcompare ( const void *  a,
const void *  b 
)

Definition at line 1663 of file Lattice.c.

Referenced by allfactors().

Bool isfulldim ( Matrix m  ) 

Definition at line 1267 of file Lattice.c.

References False, Hermite(), Matrix_Free(), matrix::NbRows, matrix::p, True, and value_zero_p.

Referenced by ZPolyhedron_Alloc().

Bool IsLattice ( Matrix m  ) 

Definition at line 1239 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, value_notone_p, and value_notzero_p.

Referenced by ZPolyhedron_Alloc().

Bool isLinear ( Lattice A  ) 

Definition at line 145 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, and value_notzero_p.

Referenced by AffineHermite().

Bool LatticeIncludes ( Lattice A,
Lattice B 
)

Definition at line 340 of file Lattice.c.

References AffineHermite(), False, LatticeIntersection(), Matrix_Free(), sameLattice(), and True.

Referenced by main(), and ZPolyhedronIncludes().

LatticeUnion* LatticeSimplify ( LatticeUnion latlist  ) 
LatticeUnion* LatticeUnion_Alloc ( void   ) 

Definition at line 60 of file Lattice.c.

References LatticeUnion::M, and LatticeUnion::next.

Referenced by main().

void LatticeUnion_Free ( LatticeUnion Head  ) 

Definition at line 44 of file Lattice.c.

References LatticeUnion::M, Matrix_Free(), and LatticeUnion::next.

Referenced by main(), and ZDomainSimplify().

void PrintLatticeUnion ( FILE *  fp,
char *  format,
LatticeUnion Head 
)

Definition at line 32 of file Lattice.c.

References LatticeUnion::M, Matrix_Print(), and LatticeUnion::next.

Referenced by main().

Bool sameAffinepart ( Lattice A,
Lattice B 
)

Definition at line 74 of file Lattice.c.

References False, matrix::NbColumns, matrix::NbRows, matrix::p, True, and value_ne.

Bool sameLattice ( Lattice A,
Lattice B 
)

Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/vector_8h-source.html0000644000175000017500000003113211253740770024244 0ustar sylvestresylvestre polylib: vector.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/matrix__permutations_8c-source.html0000644000175000017500000010263011253740767027222 0ustar sylvestresylvestre polylib: matrix_permutations.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/struct__enumeration.html0000644000175000017500000001661311303257447025145 0ustar sylvestresylvestre polylib: _enumeration Struct Reference
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/errormsg_8h-source.html0000644000175000017500000000474111253740767024616 0ustar sylvestresylvestre polylib: errormsg.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x67.html0000644000175000017500000001052511303257447024272 0ustar sylvestresylvestre polylib: Class Members
 

- g -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8h.html0000644000175000017500000003553711303257447024513 0ustar sylvestresylvestre polylib: homogenization.h File Reference

homogenization.h File Reference

#include <polylib/polylib.h>

Go to the source code of this file.

Defines

#define HOMOGENIZATTON_H
 homogenization.h -- Bavo Nootaert

Functions

Polyhedronhomogenize (Polyhedron *P, unsigned MAXRAYS)
void dehomogenize_evalue (evalue *ep, int nb_param)
 dehomogenize an evalue.
void dehomogenize_enode (enode *p, int nb_param)
 dehomogenize all evalues in an enode.
void dehomogenize_enumeration (Enumeration *en, int nb_param, int maxRays)
 dehomogenize an enumeration.
Polyhedrondehomogenize_polyhedron (Polyhedron *p, int maxRays)
 dehomogenize a polyhedron.

Define Documentation

#define HOMOGENIZATTON_H

homogenization.h -- Bavo Nootaert

Definition at line 20 of file homogenization.h.


Function Documentation

void dehomogenize_enode ( enode p,
int  nb_param 
)

dehomogenize all evalues in an enode.

This function is mutually recursive with dehomogenize_evalue.

Definition at line 77 of file homogenization.c.

References _enode::arr, dehomogenize_evalue(), and _enode::size.

Referenced by dehomogenize_evalue().

void dehomogenize_enumeration ( Enumeration en,
int  nb_params,
int  maxRays 
)

dehomogenize an enumeration.

Replaces each validity domain and Ehrhart polynomial in the Enumeration en with the dehomogenized form.

Definition at line 172 of file homogenization.c.

References dehomogenize_evalue(), dehomogenize_polyhedron(), _enumeration::EP, _enumeration::next, Polyhedron_Free(), and _enumeration::ValidityDomain.

Referenced by main().

void dehomogenize_evalue ( evalue ep,
int  nb_param 
)

dehomogenize an evalue.

The last parameter (nb_param) is replaced by 1. This function is mutually recursive with dehomogenize_enode.

cannot dehomogenize rationals

we need to replace the last parameter

Not the last parameter. Recurse

Definition at line 48 of file homogenization.c.

References _evalue::d, dehomogenize_enode(), dehomogenize_periodic(), dehomogenize_polynomial(), free_evalue_refs(), periodic, and value_zero_p.

Referenced by dehomogenize_enode(), dehomogenize_enumeration(), and Polyhedron_Enumerate().

Polyhedron* dehomogenize_polyhedron ( Polyhedron p,
int  maxRays 
)

dehomogenize a polyhedron.

Assume the polyhedron p is homogenous. Returns a new polyhedron.

Definition at line 155 of file homogenization.c.

References Constraints2Polyhedron(), Matrix_Alloc(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p, Polyhedron2Constraints(), and Vector_Copy().

Referenced by dehomogenize_enumeration().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/doxygen.png0000644000175000017500000000240111303257445022335 0ustar sylvestresylvestre‰PNG  IHDRd-ok>ÂgAMAÖØÔOX2tEXtSoftwareAdobe ImageReadyqÉe<]PLTEǾÏ"&©ÈÎï¶»ÖÓÚú“¢Þ ¬à¶Âõ‡§ÕÙêÉÊÎáâæ{ŽÔ¡ëˆ™× ²ø§¬¹ÀÀ±ÝÝÎùùéõõçëëåED9×ÖËhg]_X<@:#mhUÿÿÿÝÀ1tRNSÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÍvÿIDATxÚbC£: d#„„………h` @¡X",***LKˆ.–], ºX@t± €èb @ÑÅ€BµD„6–š%""´° € ˜% ˆ™B:H¢ˆ²Áf@• ˆRPy"K`\PbC(!II!h©…ëƒ(ñ„Ä!ꈬC„Ä…àl!0[X\J\$TMˆ(’>a$S„ Ù@ Ш@R.$‚¬LJBR¢‰AÌG1 ¬ Â(FȃÔPhhÁTÀ¢„%!`€&q°%u P ¹¢ ¬ € ¹CT$B¢à|‚ºW„¤Àl £!B`R$( …Ĉ‘’ž@AÅ%ĤÄ%@,(—ʂڱ%$ÁââRPmB U`1IˆYB  99€\1 yCCCÿf"[N 'Ü=TGÈ’øl8˜^Kû5<êSæRɤ”%î@@ à›Ê b1 qÅAXHˆ¸&ØB’R y n˜P„Ìã–4A €€j¹€€>Ü ˜ t!˜+(.ÈÅWQ±A2ÜÜMUÜ‚’’‚‚â `1 %`19€F< 3cZÄ`óe!\ˆ DÈ+. 83‹³Àä¸!lYYA -6‚EJŠ¢V €@©žXXX 4„å Ê@86Ð`RdB´€4I "Ý "–@xrÊŒ‚H€AÊ`—f ÉȰCŒ"XV0ɲ³C b@2…¬H ¬È“ p)!(ì‚ 0Ž4ˆ)(%RÁÎ ¶$€TÊ€¥Àþb‡b,säÐ@7À üѰ‚Òî?f¥Ö—\PIx!I´¦"”Ȉ’3¨ QY˜ÿt^^ÛØgv- }>WJOAV`$&#”¦8ùøø8€\FF ›SFJ$ÂÆ€ÐƊС䈉ÀÀ 4ª…Èäå -Á§‡ €H²…—ŸŸŸf ?ðâ5„ €k1Âd‰,ŒÃ ³ƒ“€.€"­F™ËË€àñ‚½ÁIÈ€"±Ù4ÉH gx|‚f©m)))9´. aMDƒ& ºX@t± €èb @ÑÅ€¢‹%DKˆ.–], ºX@t± €èb @€d`‚ɽSµOIEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/ehrhart__lower__bound_8c_source.html0000644000175000017500000003017011303257445027350 0ustar sylvestresylvestre polylib: ehrhart_lower_bound.c Source File
Generated on Wed Nov 25 17:45:25 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/functions_vars.html0000644000175000017500000002414211303257447024113 0ustar sylvestresylvestre polylib: Class Members - Variables
Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/ext__ehrhart_8c.html0000644000175000017500000013015011303257447024113 0ustar sylvestresylvestre polylib: ext_ehrhart.c File Reference

ext_ehrhart.c File Reference

#include <stdlib.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Classes

struct  _Polyhedron_union

Defines

#define WS   200

Typedefs

typedef struct _Polyhedron_union Polyhedron_union

Functions

static int ppcm1 (int a, int b)
MatrixCalcBase (Matrix *R)
static void Soustraire_ligne (Matrix *R, int l1, int l2, int piv)
static int existepivot (Matrix *R, int l)
static void swap_line (Matrix *R, int l1, int l2)
int pgcd1 (int a, int b)
void new_eadd (evalue *e1, evalue *res)
MatrixReduce_Matrix (Matrix *Mat)
void Scalar_product (Value *p1, Value *p2, unsigned length, Value *r)
MatrixOrthogonal_Base (Matrix *Mat)
void Remove_Element (Enumeration *en, Enumeration **re, Enumeration *prev)
void Remove_RedundantDomains (Enumeration **Ures)
int IncludeInRes (Polyhedron *p, Enumeration *e, unsigned MR)
PolyhedronDMUnion (Enumeration *en, unsigned MR)
void AffConstraints (Polyhedron *Poldisj)
int Degenerate (Enumeration *en)
EnumerationDomain_Enumerate (Polyhedron *D, Polyhedron *C, unsigned MAXRAYS, const char **pn)
EnumerationPolyhedron_Image_Enumerate (Polyhedron *D, Polyhedron *C, Matrix *T, unsigned MAXRAYS, const char **par_name)

Define Documentation

#define WS   200

Definition at line 20 of file ext_ehrhart.c.

Referenced by main().


Typedef Documentation


Function Documentation

void AffConstraints ( Polyhedron Poldisj  ) 
int Degenerate ( Enumeration en  ) 

Definition at line 690 of file ext_ehrhart.c.

References _evalue::d, _enumeration::EP, value_mone_p, and value_notzero_p.

Referenced by Domain_Enumerate().

Polyhedron* DMUnion ( Enumeration en,
unsigned  MR 
)

Definition at line 668 of file ext_ehrhart.c.

References DomainUnion(), _enumeration::next, and _enumeration::ValidityDomain.

Referenced by Domain_Enumerate().

static int existepivot ( Matrix R,
int  l 
) [static]

Definition at line 218 of file ext_ehrhart.c.

References matrix::NbRows, matrix::p, value_notzero_p, and value_zero_p.

Referenced by CalcBase().

int IncludeInRes ( Polyhedron p,
Enumeration e,
unsigned  MR 
)

Definition at line 658 of file ext_ehrhart.c.

References _enumeration::next, PolyhedronIncludes(), and _enumeration::ValidityDomain.

Referenced by Domain_Enumerate().

int pgcd1 ( int  a,
int  b 
)

Definition at line 257 of file ext_ehrhart.c.

Referenced by ppcm1().

int ppcm1 ( int  a,
int  b 
) [static]

Definition at line 548 of file ext_ehrhart.c.

References pgcd1().

Referenced by new_eadd().

Matrix* Reduce_Matrix ( Matrix Mat  ) 

Definition at line 514 of file ext_ehrhart.c.

References matrix::NbColumns, matrix::NbRows, matrix::p, p, and value_clear.

Referenced by Polyhedron_Image_Enumerate().

void Remove_Element ( Enumeration en,
Enumeration **  re,
Enumeration prev 
)

Definition at line 622 of file ext_ehrhart.c.

References _enumeration::next.

Referenced by Remove_RedundantDomains().

void Remove_RedundantDomains ( Enumeration **  Ures  ) 
void Scalar_product ( Value *  p1,
Value *  p2,
unsigned  length,
Value *  r 
)

Definition at line 533 of file ext_ehrhart.c.

References value_addmul, and value_set_si.

Referenced by Orthogonal_Base(), and Polyhedron_Image_Enumerate().

static void Soustraire_ligne ( Matrix R,
int  l1,
int  l2,
int  piv 
) [static]
static void swap_line ( Matrix R,
int  l1,
int  l2 
) [static]

Definition at line 241 of file ext_ehrhart.c.

References matrix::NbColumns, matrix::p, and value_assign.

Referenced by CalcBase().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib64_8h-source.html0000644000175000017500000000262711253740767024603 0ustar sylvestresylvestre polylib: polylib64.h Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ranking_8h.html0000644000175000017500000003057111303257447023103 0ustar sylvestresylvestre polylib: ranking.h File Reference

ranking.h File Reference

#include <polylib/polylib.h>

Go to the source code of this file.

Functions

PolyhedronLexSmaller (Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)
 Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J.
EnumerationPolyhedron_LexSmallerEnumerate (Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)
 Returns the number of points in P that are lexicographically smaller than a given point in D.
EnumerationPolyhedron_Ranking (Polyhedron *P, Polyhedron *C, unsigned MAXRAYS)

Function Documentation

Polyhedron* LexSmaller ( Polyhedron P,
Polyhedron D,
unsigned  dim,
Polyhedron C,
unsigned  MAXRAYS 
)

Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J.

Author:
B. Meister <meister@icps.u-strasbg.fr> 6/2005 LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur HiPEAC Network

Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J.

Meister 6/2005 LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur HiPEAC Network Returns a list of polytopes needed to compute the number of points in P that are lexicographically smaller than a given point in D. Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C.

The first polyhedron in the list returned is the updated context: a combination of D and C or an extended C.

The order of the variables in the remaining polyhedra is

  • first dim variables of P
  • existential variables of P
  • existential variables of D
  • first dim variables of D
  • the parameters

Definition at line 51 of file ranking.c.

References assert, polyhedron::Constraint, Constraints2Polyhedron(), polyhedron::Dimension, Matrix_Alloc(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, polyhedron::NbConstraints, matrix::NbRows, polyhedron::next, matrix::p, POL_ENSURE_INEQUALITIES, POL_NO_DUAL, show_matrix, value_assign, value_set_si, and Vector_Copy().

Referenced by Polyhedron_LexSmallerEnumerate().

Enumeration* Polyhedron_LexSmallerEnumerate ( Polyhedron P,
Polyhedron D,
unsigned  dim,
Polyhedron C,
unsigned  MAXRAYS 
)

Returns the number of points in P that are lexicographically smaller than a given point in D.

Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C. The variables in the Enumeration correspond to the first dim variables in D followed by the parameters of D (the variables of C).

Definition at line 192 of file ranking.c.

References Domain_Enumerate(), Domain_Free(), LexSmaller(), polyhedron::next, and Polyhedron_Free().

Referenced by main(), and Polyhedron_Ranking().

Enumeration* Polyhedron_Ranking ( Polyhedron P,
Polyhedron C,
unsigned  MAXRAYS 
)

Definition at line 223 of file ranking.c.

References polyhedron::Dimension, and Polyhedron_LexSmallerEnumerate().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polyparam_8c-source.html0000644000175000017500000073141211253740770024751 0ustar sylvestresylvestre polylib: polyparam.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/polyhedron_8c.html0000644000175000017500000064535311303257447023642 0ustar sylvestresylvestre polylib: polyhedron.c File Reference

polyhedron.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <polylib/polylib.h>

Go to the source code of this file.

Classes

struct  SatMatrix

Defines

#define WSIZE   (8*sizeof(int))
#define bexchange(a, b, l)
#define exchange(a, b, t)   { (t)=(a); (a)=(b); (b)=(t); }
#define SMVector_Copy(p1, p2, length)   memcpy((char *)(p2), (char *)(p1), (int)((length)*sizeof(int)))
#define SMVector_Init(p1, length)   memset((char *)(p1), 0, (int)((length)*sizeof(int)))

Functions

void errormsg1 (const char *f, const char *msgname, const char *msg)
static SatMatrixSMAlloc (int rows, int cols)
static void SMFree (SatMatrix **matrix)
static void SMPrint (SatMatrix *matrix)
static void SatVector_OR (int *p1, int *p2, int *p3, unsigned length)
static void Combine (Value *p1, Value *p2, Value *p3, int pos, unsigned length)
static SatMatrixTransformSat (Matrix *Mat, Matrix *Ray, SatMatrix *Sat)
static void RaySort (Matrix *Ray, SatMatrix *Sat, int NbBid, int NbRay, int *equal_bound, int *sup_bound, unsigned RowSize1, unsigned RowSize2, unsigned bx, unsigned jx)
static void SatMatrix_Extend (SatMatrix *Sat, Matrix *Mat, unsigned rows)
static int Chernikova (Matrix *Mat, Matrix *Ray, SatMatrix *Sat, unsigned NbBid, unsigned NbMaxRays, unsigned FirstConstraint, unsigned dual)
static int Gauss4 (Value **p, int NbEq, int NbRows, int Dimension)
int Gauss (Matrix *Mat, int NbEq, int Dimension)
static PolyhedronRemove_Redundants (Matrix *Mat, Matrix *Ray, SatMatrix *Sat, unsigned *Filter)
PolyhedronPolyhedron_Alloc (unsigned Dimension, unsigned NbConstraints, unsigned NbRays)
void Polyhedron_Free (Polyhedron *Pol)
void Domain_Free (Polyhedron *Pol)
void Polyhedron_Print (FILE *Dst, const char *Format, const Polyhedron *Pol)
void PolyPrint (Polyhedron *Pol)
PolyhedronEmpty_Polyhedron (unsigned Dimension)
PolyhedronUniverse_Polyhedron (unsigned Dimension)
static void SortConstraints (Matrix *Constraints, unsigned NbEq)
static int ImplicitEqualities (Matrix *Constraints, unsigned NbEq)
PolyhedronConstraints2Polyhedron (Matrix *Constraints, unsigned NbMaxRays)
 Given a matrix of constraints ('Constraints'), construct and return a polyhedron.
MatrixPolyhedron2Constraints (Polyhedron *Pol)
PolyhedronRays2Polyhedron (Matrix *Ray, unsigned NbMaxConstrs)
 Given a matrix of rays 'Ray', create and return a polyhedron.
void Polyhedron_Compute_Dual (Polyhedron *P)
static SatMatrixBuildSat (Matrix *Mat, Matrix *Ray, unsigned NbConstraints, unsigned NbMaxRays)
PolyhedronAddConstraints (Value *Con, unsigned NbConstraints, Polyhedron *Pol, unsigned NbMaxRays)
int PolyhedronIncludes (Polyhedron *Pol1, Polyhedron *Pol2)
PolyhedronAddPolyToDomain (Polyhedron *Pol, Polyhedron *PolDomain)
PolyhedronSubConstraint (Value *Con, Polyhedron *Pol, unsigned NbMaxRays, int Pass)
PolyhedronDomainIntersection (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
MatrixPolyhedron2Rays (Polyhedron *Pol)
PolyhedronAddRays (Value *AddedRays, unsigned NbAddedRays, Polyhedron *Pol, unsigned NbMaxConstrs)
PolyhedronDomainAddRays (Polyhedron *Pol, Matrix *Ray, unsigned NbMaxConstrs)
PolyhedronPolyhedron_Copy (Polyhedron *Pol)
PolyhedronDomain_Copy (Polyhedron *Pol)
static void addToFilter (int k, unsigned *Filter, SatMatrix *Sat, Value *tmpR, Value *tmpC, int NbRays, int NbConstraints)
static void FindSimple (Polyhedron *P1, Polyhedron *P2, unsigned *Filter, unsigned NbMaxRays)
static int SimplifyConstraints (Polyhedron *Pol1, Polyhedron *Pol2, unsigned *Filter, unsigned NbMaxRays)
static void SimplifyEqualities (Polyhedron *Pol1, Polyhedron *Pol2, unsigned *Filter)
PolyhedronDomainSimplify (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronStras_DomainSimplify (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomainUnion (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
PolyhedronDomainConvex (Polyhedron *Pol, unsigned NbMaxConstrs)
PolyhedronDomainDifference (Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays)
Polyhedronalign_context (Polyhedron *Pol, int align_dimension, int NbMaxRays)
PolyhedronPolyhedron_Scan (Polyhedron *D, Polyhedron *C, unsigned NbMaxRays)
int lower_upper_bounds (int pos, Polyhedron *P, Value *context, Value *LBp, Value *UBp)
static void Rays_Mult (Value **A, Matrix *B, Value **C, unsigned NbRays)
static void Rays_Mult_Transpose (Value **A, Matrix *B, Value **C, unsigned NbRays)
PolyhedronPolyhedron_Preimage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxRays)
PolyhedronDomainPreimage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxRays)
PolyhedronPolyhedron_Image (Polyhedron *Pol, Matrix *Func, unsigned NbMaxConstrs)
PolyhedronDomainImage (Polyhedron *Pol, Matrix *Func, unsigned NbMaxConstrs)
IntervalDomainCost (Polyhedron *Pol, Value *Cost)
PolyhedronDomainAddConstraints (Polyhedron *Pol, Matrix *Mat, unsigned NbMaxRays)
PolyhedronDisjoint_Domain (Polyhedron *P, int flag, unsigned NbMaxRays)
void Polyhedron_PrintConstraints (FILE *Dst, const char *Format, Polyhedron *Pol)
void Domain_PrintConstraints (FILE *Dst, const char *Format, Polyhedron *Pol)
static Polyhedronp_simplify_constraints (Polyhedron *P, Vector *row, Value *g, unsigned MaxRays)
PolyhedronDomainConstraintSimplify (Polyhedron *P, unsigned MaxRays)

Variables

int Pol_status

Define Documentation

#define bexchange ( a,
b,
 ) 
Value:
{\
  char *t = (char *)malloc(l*sizeof(char));\
  memcpy((t), (char *)(a), (int)(l));\
  memcpy((char *)(a), (char *)(b), (int)(l));\
  memcpy((char *)(b), (t), (int)(l));\
  free(t); \
}

Definition at line 71 of file polyhedron.c.

Referenced by RaySort(), and Remove_Redundants().

#define exchange ( a,
b,
 )     { (t)=(a); (a)=(b); (b)=(t); }

Definition at line 80 of file polyhedron.c.

Referenced by Remove_Redundants().

#define SMVector_Copy ( p1,
p2,
length   )     memcpy((char *)(p2), (char *)(p1), (int)((length)*sizeof(int)))

Definition at line 199 of file polyhedron.c.

Referenced by Chernikova().

#define SMVector_Init ( p1,
length   )     memset((char *)(p1), 0, (int)((length)*sizeof(int)))
#define WSIZE   (8*sizeof(int))

Definition at line 69 of file polyhedron.c.

Referenced by addToFilter(), and Chernikova().


Function Documentation

static void addToFilter ( int  k,
unsigned *  Filter,
SatMatrix Sat,
Value *  tmpR,
Value *  tmpC,
int  NbRays,
int  NbConstraints 
) [static]

Definition at line 2861 of file polyhedron.c.

References MSB, NEXT, SatMatrix::p, value_decrement, value_posz_p, value_set_si, and WSIZE.

Referenced by FindSimple().

static SatMatrix* BuildSat ( Matrix Mat,
Matrix Ray,
unsigned  NbConstraints,
unsigned  NbMaxRays 
) [static]
static void Combine ( Value *  p1,
Value *  p2,
Value *  p3,
int  pos,
unsigned  length 
) [static]
Polyhedron* Constraints2Polyhedron ( Matrix Constraints,
unsigned  NbMaxRays 
)

Given a matrix of constraints ('Constraints'), construct and return a polyhedron.

Parameters:
Constraints Constraints (may be modified!)
NbMaxRays Estimated number of rays in the ray matrix of the polyhedron.
Returns:
newly allocated Polyhedron

Definition at line 1906 of file polyhedron.c.

References any_exception_error, CATCH, Chernikova(), polyhedron::Constraint, ConstraintSimplify(), Empty_Polyhedron(), errormsg1(), ExchangeRows(), F_SET, First_Non_Zero(), Gauss(), ImplicitEqualities(), Matrix_Alloc(), Matrix_Free(), Matrix_Print(), matrix::NbColumns, polyhedron::NbEq, SatMatrix::NbRows, matrix::NbRows, matrix::p, SatMatrix::p_init, matrix::p_Init, POL_INEQUALITIES, POL_INTEGER, POL_ISSET, POL_NO_DUAL, POL_VALID, Polyhedron_Alloc(), Polyhedron_Free(), Polyhedron_Print(), polyhedron::Ray, Remove_Redundants(), RETHROW, Sat, SMAlloc(), SMFree(), SMPrint(), SMVector_Init, SortConstraints(), TRY, UNCATCH, Universe_Polyhedron(), value_clear, value_init, value_notzero_p, value_set_si, value_zero_p, Vector_Copy(), and Vector_Set().

Referenced by AddConstraints(), dehomogenize_polyhedron(), DomainSimplify(), Ehrhart_Quick_Apx(), Elim_Columns(), eliminable_vars(), Enumeration_zero(), Find_m_faces(), homogenize(), LexSmaller(), main(), Param_Vertices_Print(), Polyhedron_Compute_Dual(), Polyhedron_Preimage(), Polyhedron_Preprocess(), Polyhedron_Preprocess2(), Polyhedron_Remove_parm_eqs(), Recession_Cone(), Stras_DomainSimplify(), test_Constraints_fullDimensionize(), test_Constraints_Remove_parm_eqs(), test_Polyhedron_Remove_parm_eqs(), and Union_Read().

void Domain_PrintConstraints ( FILE *  Dst,
const char *  Format,
Polyhedron Pol 
)

Definition at line 4638 of file polyhedron.c.

References polyhedron::next, and Polyhedron_PrintConstraints().

Polyhedron* DomainAddConstraints ( Polyhedron Pol,
Matrix Mat,
unsigned  NbMaxRays 
)
Polyhedron* DomainAddRays ( Polyhedron Pol,
Matrix Ray,
unsigned  NbMaxConstrs 
)
Polyhedron* DomainConstraintSimplify ( Polyhedron P,
unsigned  MaxRays 
)
Polyhedron* DomainConvex ( Polyhedron Pol,
unsigned  NbMaxConstrs 
)
Polyhedron* DomainUnion ( Polyhedron Pol1,
Polyhedron Pol2,
unsigned  NbMaxRays 
)
void errormsg1 ( const char *  f,
const char *  msgname,
const char *  msg 
)

Definition at line 46 of file errormsg.c.

int Gauss ( Matrix Mat,
int  NbEq,
int  Dimension 
)
static int Gauss4 ( Value **  p,
int  NbEq,
int  NbRows,
int  Dimension 
) [static]
static int ImplicitEqualities ( Matrix Constraints,
unsigned  NbEq 
) [static]
Matrix* Polyhedron2Rays ( Polyhedron Pol  ) 
void Polyhedron_PrintConstraints ( FILE *  Dst,
const char *  Format,
Polyhedron Pol 
)
void PolyPrint ( Polyhedron Pol  ) 

Definition at line 1704 of file polyhedron.c.

References Polyhedron_Print().

Polyhedron* Rays2Polyhedron ( Matrix Ray,
unsigned  NbMaxConstrs 
)

Given a matrix of rays 'Ray', create and return a polyhedron.

Parameters:
Ray Rays (may be modified!)
NbMaxConstrs Estimated number of constraints in the polyhedron.
Returns:
newly allocated Polyhedron

Definition at line 2083 of file polyhedron.c.

References any_exception_error, CATCH, Chernikova(), Empty_Polyhedron(), errormsg1(), Matrix_Alloc(), Matrix_Free(), Matrix_Print(), matrix::NbColumns, matrix::NbRows, matrix::p, matrix::p_Init, POL_ISSET, POL_NO_DUAL, Polyhedron_Free(), Polyhedron_Print(), Remove_Redundants(), RETHROW, Sat, SMAlloc(), SMFree(), SMPrint(), SMVector_Init, TransformSat(), TRY, UNCATCH, value_set_si, and Vector_Set().

Referenced by main(), Polyhedron_Image(), and traite_m_face().

static void Rays_Mult ( Value **  A,
Matrix B,
Value **  C,
unsigned  NbRays 
) [static]
static void Rays_Mult_Transpose ( Value **  A,
Matrix B,
Value **  C,
unsigned  NbRays 
) [static]
static void RaySort ( Matrix Ray,
SatMatrix Sat,
int  NbBid,
int  NbRay,
int *  equal_bound,
int *  sup_bound,
unsigned  RowSize1,
unsigned  RowSize2,
unsigned  bx,
unsigned  jx 
) [static]

Definition at line 305 of file polyhedron.c.

References bexchange, SatMatrix::p, matrix::p, value_neg_p, value_zero_p, and Vector_Exchange().

Referenced by Chernikova().

static void SatMatrix_Extend ( SatMatrix Sat,
Matrix Mat,
unsigned  rows 
) [static]

Definition at line 354 of file polyhedron.c.

References errormsg1(), SatMatrix::NbRows, matrix::NbRows, SatMatrix::p, and SatMatrix::p_init.

Referenced by Chernikova().

static void SatVector_OR ( int *  p1,
int *  p2,
int *  p3,
unsigned  length 
) [static]

Definition at line 180 of file polyhedron.c.

Referenced by Chernikova().

static void SimplifyEqualities ( Polyhedron Pol1,
Polyhedron Pol2,
unsigned *  Filter 
) [static]
static SatMatrix* SMAlloc ( int  rows,
int  cols 
) [static]
static void SMFree ( SatMatrix **  matrix  )  [static]
static void SMPrint ( SatMatrix matrix  )  [static]
static void SortConstraints ( Matrix Constraints,
unsigned  NbEq 
) [static]
static SatMatrix* TransformSat ( Matrix Mat,
Matrix Ray,
SatMatrix Sat 
) [static]

Definition at line 266 of file polyhedron.c.

References MSB, matrix::NbRows, NEXT, SatMatrix::p, SatMatrix::p_init, SMAlloc(), and SMVector_Init.

Referenced by AddRays(), and Rays2Polyhedron().


Variable Documentation


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x66.html0000644000175000017500000001231711303257447024272 0ustar sylvestresylvestre polylib: Class Members
 

- f -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib64_8h_source.html0000644000175000017500000000637311303257446024660 0ustar sylvestresylvestre polylib: polylib64.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolytest_8c-source.html0000644000175000017500000012426511253740770024764 0ustar sylvestresylvestre polylib: Zpolytest.c Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/assert_8h.html0000644000175000017500000001331611303257446022750 0ustar sylvestresylvestre polylib: assert.h File Reference

assert.h File Reference

Go to the source code of this file.

Defines

#define _assert(ex)   {if (!(ex)){(void)fprintf(stderr,"Assertion failed: file \"%s\", line %d\n", __FILE__, __LINE__);(void) abort();}}
#define assert(ex)   _assert(ex)

Define Documentation

#define _assert ( ex   )     {if (!(ex)){(void)fprintf(stderr,"Assertion failed: file \"%s\", line %d\n", __FILE__, __LINE__);(void) abort();}}

Definition at line 25 of file assert.h.


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/findv_8c-source.html0000644000175000017500000001070511253740767024054 0ustar sylvestresylvestre polylib: findv.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/eval__ehrhart_8h.html0000644000175000017500000002101511303257447024246 0ustar sylvestresylvestre polylib: eval_ehrhart.h File Reference

eval_ehrhart.h File Reference

Go to the source code of this file.

Functions

double compute_evalue (evalue *e, Value *list_args)
Value * compute_poly (Enumeration *en, Value *list_args)
int in_domain (Polyhedron *P, Value *list_args)

Function Documentation

double compute_evalue ( evalue e,
Value *  list_args 
)

Definition at line 135 of file eval_ehrhart.c.

References compute_enode(), _evalue::d, value_notone_p, and value_notzero_p.

Referenced by compute_enode(), and compute_poly().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/Zpolyhedron_8h-source.html0000644000175000017500000001731511253740770025266 0ustar sylvestresylvestre polylib: Zpolyhedron.h Source File
Generated on Tue Sep 15 18:34:00 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x67.html0000644000175000017500000000707011303257450024253 0ustar sylvestresylvestre polylib: Class Members
 

- g -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_func_0x64.html0000644000175000017500000002153211303257447024267 0ustar sylvestresylvestre polylib: Class Members
 

- d -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x6f.html0000644000175000017500000001065311303257447023340 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- o -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/polylib32_8h_source.html0000644000175000017500000000637311303257446024653 0ustar sylvestresylvestre polylib: polylib32.h Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/matrix_8c_source.html0000644000175000017500000036763511303257446024346 0ustar sylvestresylvestre polylib: matrix.c Source File
Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/homogenization_8c-source.html0000644000175000017500000006123511253740767026004 0ustar sylvestresylvestre polylib: homogenization.c Source File
Generated on Tue Sep 15 18:33:59 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/codeDoc/html/ftv2doc.png0000644000175000017500000000037711303257450022235 0ustar sylvestresylvestre‰PNG  IHDR_Tq-PLTEÿÿÿÿÿÿÿÿÀÀÀ€€€ÿ³½ûÈtRNS@æØftEXtSoftwaregif2png 2.4.2£^GvIDATxÚc````c``d'0bqâ$8`qÊ'3001£2 pT2Si`q'Ê€\\À”¢ˆRKRSiÈ”„RRÅi 6त¤h‚ÄQ‚kqMaNUò`'E$pgc 0Åo#õÐàUƒG½IEND®B`‚polylib-5.22.5.orig/doc/codeDoc/html/NormalForms_8h.html0000644000175000017500000002301611303257447023705 0ustar sylvestresylvestre polylib: NormalForms.h File Reference

NormalForms.h File Reference

Go to the source code of this file.

Functions

void Smith (Matrix *A, Matrix **U, Matrix **V, Matrix **Product)
 Smith : This function takes a Matrix A of dim n * l as its input and returns the three matrices U, V and Product such that A = U * Product * V, where U is an unimodular matrix of dimension n * n and V is an unimodular matrix of dimension l * l.
void Hermite (Matrix *A, Matrix **H, Matrix **U)
 Hermite : This function takes a Matrix as its input and finds its HNF ( Left form ).

Function Documentation

void Hermite ( Matrix A,
Matrix **  H,
Matrix **  U 
)

Hermite : This function takes a Matrix as its input and finds its HNF ( Left form ).

Input : A Matrix A (The Matrix A is not necessarily a Polylib matrix. It is just a matrix as far as Hermite is concerned. It does not even check if the matrix is a Polylib matrix or not) Output : The Hnf matrix H and the Unimodular matrix U such that A = H * U.

We use Alan Darte's implementation of Hermite to compute the HNF. Alan Darte's implementation computes the Upper Triangular HNF. So We work on the fact that if A = H * U then A (transpose) = U(transpose) * H (transpose) There are a set of interface functions written in Interface.c which convert a matrix from Polylib representationt to that of Alan Darte's and vice versa.

This Function Does the Following Step 1 : Given the matrix A it finds its Transpose. Step 2 : Finds the HNF (Right Form) using Alan Darte's Algorithm. Step 3 : The H1 and U1 obtained in Step2 are both Transposed to get the actual H and U such that A = HU.

Definition at line 670 of file NormalForms.c.

References ConvertDarMattoPolMat(), ConvertPolMattoDarMat(), hermite(), identite(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, Transpose(), transpose(), value_clear, and value_init.

Referenced by AffineHermite(), findHermiteBasis(), isfulldim(), RearrangeMatforSolveDio(), and SolveDiophantine().

void Smith ( Matrix A,
Matrix **  U,
Matrix **  V,
Matrix **  Product 
)

Smith : This function takes a Matrix A of dim n * l as its input and returns the three matrices U, V and Product such that A = U * Product * V, where U is an unimodular matrix of dimension n * n and V is an unimodular matrix of dimension l * l.

Product is a diagonal matrix of dimension n * l.

We use Alan Darte's implementation of Smith for computing the Smith Normal Form

Definition at line 627 of file NormalForms.c.

References Identity(), Matrix_Copy(), Matrix_Free(), matrix::NbColumns, matrix::NbRows, matrix::p_Init, and smith().

Referenced by AffineSmith(), and Lattice2LatticeUnion().


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_defs_0x75.html0000644000175000017500000000752611303257450024260 0ustar sylvestresylvestre polylib: Class Members
 

- u -


Generated on Wed Nov 25 17:45:28 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/include_2polylib_2arithmetique_8h.html0000644000175000017500000040340611303257446027554 0ustar sylvestresylvestre polylib: arithmetique.h File Reference

arithmetique.h File Reference

#include <stdio.h>
#include <limits.h>
#include "arithmetic_errors.h"

Go to the source code of this file.

Defines

#define value_init(val)   ((val) = 0)
 package arithmetique
#define value_assign(v1, v2)   ((v1) = (v2))
#define value_set_si(val, i)   ((val) = (Value)(i))
#define value_set_double(val, d)   ((val) = (Value)(d))
#define value_clear(val)   ((val) = 0)
#define value_read(val, str)   (sscanf((str),VALUE_FMT,&(val)))
#define value_print(Dst, fmt, val)   (fprintf((Dst),(fmt),(val)))
#define value_swap(v1, v2)
#define int_to_value(i)   ((Value)(i))
#define long_to_value(l)   ((Value)(l))
#define float_to_value(f)   ((Value)(f))
#define double_to_value(d)   ((Value)(d))
#define value_eq(v1, v2)   ((v1)==(v2))
#define value_ne(v1, v2)   ((v1)!=(v2))
#define value_gt(v1, v2)   ((v1)>(v2))
#define value_ge(v1, v2)   ((v1)>=(v2))
#define value_lt(v1, v2)   ((v1)<(v2))
#define value_le(v1, v2)   ((v1)<=(v2))
#define value_abs_eq(v1, v2)   (value_abs(v1)==value_abs(v2))
#define value_abs_ne(v1, v2)   (value_abs(v1)!=value_abs(v2))
#define value_abs_gt(v1, v2)   (value_abs(v1)>value_abs(v2))
#define value_abs_ge(v1, v2)   (value_abs(v1)>=value_abs(v2))
#define value_abs_lt(v1, v2)   (value_abs(v1)<value_abs(v2))
#define value_abs_le(v1, v2)   (value_abs(v1)<=value_abs(v2))
#define value_sign(v)   (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)
#define value_compare(v1, v2)   (value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)
#define value_plus(v1, v2)   ((v1)+(v2))
#define value_div(v1, v2)   ((v1)/(v2))
#define value_mod(v1, v2)   ((v1)%(v2))
#define value_direct_multiply(v1, v2)   ((v1)*(v2))
#define value_minus(v1, v2)   ((v1)-(v2))
#define value_pdiv(v1, v2)   (DIVIDE((v1),(v2)))
#define value_pmod(v1, v2)   (MODULO((v1),(v2)))
#define value_min(v1, v2)   (value_le((v1),(v2))? (v1): (v2))
#define value_max(v1, v2)   (value_ge((v1),(v2))? (v1): (v2))
#define value_or(v1, v2)   ((v1)|(v2))
#define value_and(v1, v2)   ((v1)&(v2))
#define value_lshift(v1, v2)   ((v1)<<(v2))
#define value_rshift(v1, v2)   ((v1)>>(v2))
#define value_addto(ref, val1, val2)   ((ref) = (val1)+(val2))
#define value_add_int(ref, val, vint)   ((ref) = (val)+(Value)(vint))
#define value_addmul(ref, val1, val2)   ((ref) += (val1)*(val2))
#define value_increment(ref, val)   ((ref) = (val)+VALUE_ONE)
#define value_direct_product(ref, val1, val2)   ((ref) = (val1)*(val2))
#define value_multiply(ref, val1, val2)   ((ref) = value_mult((val1),(val2)))
#define value_subtract(ref, val1, val2)   ((ref) = (val1)-(val2))
#define value_sub_int(ref, val, vint)   ((ref) = (val)-(Value)(vint))
#define value_decrement(ref, val)   ((ref) = (val)-VALUE_ONE)
#define value_division(ref, val1, val2)   ((ref) = (val1)/(val2))
#define value_divexact(ref, val1, val2)   ((ref) = (val1)/(val2))
#define value_modulus(ref, val1, val2)   ((ref) = (val1)%(val2))
#define value_pdivision(ref, val1, val2)   ((ref) = value_pdiv((val1),(val2)))
#define value_pmodulus(ref, val1, val2)   ((ref) = value_pmod((val1),(val2)))
#define value_oppose(ref, val)   ((ref) = value_uminus((val)))
#define value_absolute(ref, val)   ((ref) = value_abs((val)))
#define value_minimum(ref, val1, val2)   ((ref) = value_min((val1),(val2)))
#define value_maximum(ref, val1, val2)   ((ref) = value_max((val1),(val2)))
#define value_gcd(ref, val1, val2)   Gcd((val1),(val2),&(ref))
#define value_lcm(ref, val1, val2)   Lcm3((val1),(val2),&(ref))
#define value_orto(ref, val1, val2)   ((ref) = (val1)|(val2))
#define value_andto(ref, val1, val2)   ((ref) = (val1)&(val2))
#define value_uminus(val)   (-(val))
#define value_not(val)   (~(val))
#define value_abs(val)
#define value_pos_p(val)   value_gt(val,VALUE_ZERO)
#define value_neg_p(val)   value_lt(val,VALUE_ZERO)
#define value_posz_p(val)   value_ge(val,VALUE_ZERO)
#define value_negz_p(val)   value_le(val,VALUE_ZERO)
#define value_zero_p(val)   value_eq(val,VALUE_ZERO)
#define value_notzero_p(val)   value_ne(val,VALUE_ZERO)
#define value_one_p(val)   value_eq(val,VALUE_ONE)
#define value_notone_p(val)   value_ne(val,VALUE_ONE)
#define value_mone_p(val)   value_eq(val,VALUE_MONE)
#define value_notmone_p(val)   value_ne(val,VALUE_MONE)
#define value_cmp_si(val, n)   (val - (n))
#define value_min_p(val)   value_eq(val,VALUE_MIN)
#define value_max_p(val)   value_eq(val,VALUE_MAX)
#define value_notmin_p(val)   value_ne(val,VALUE_MIN)
#define value_notmax_p(val)   value_ne(val,VALUE_MAX)
#define value_protected_hard_idiv_multiply(v, w, throw)
#define value_protected_multiply(v, w, throw)   value_protected_hard_idiv_multiply(v,w,throw)
#define value_protected_mult(v, w)   value_protected_multiply(v,w,THROW(overflow_error))
#define value_protected_product(v, w)   v=value_protected_mult(v,w)
#define value_mult(v, w)
#define value_product(v, w)   v=value_mult(v,w)
#define value_substract(ref, val1, val2)   (value_subtract((ref),(val1),(val2)))
#define SIGN(x)   (((x)>0)? 1 : ((x)==0? 0 : -1))
#define DIVIDE(x, y)
#define POSITIVE_DIVIDE(x, y)   ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))
#define MODULO(x, y)   ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))
#define POSITIVE_MODULO(x, y)

Functions

void dump_exception_stack_to_file (FILE *)
void dump_exception_stack (void)
jmp_buf * push_exception_on_stack (int, const char *, const char *, int)
void pop_exception_from_stack (int, const char *, const char *, int)
void throw_exception (int, const char *, const char *, int)

Variables

unsigned int overflow_error
unsigned int simplex_arithmetic_error
unsigned int user_exception_error
unsigned int parser_exception_error
unsigned int any_exception_error
unsigned int the_last_just_thrown_exception

Define Documentation

#define DIVIDE ( x,
 ) 
Value:
((y)>0? POSITIVE_DIVIDE(x,y) : \
                     -POSITIVE_DIVIDE((x),(-(y))))

Definition at line 723 of file include/polylib/arithmetique.h.

#define double_to_value (  )     ((Value)(d))

Definition at line 473 of file include/polylib/arithmetique.h.

#define float_to_value (  )     ((Value)(f))

Definition at line 472 of file include/polylib/arithmetique.h.

#define int_to_value (  )     ((Value)(i))

Definition at line 470 of file include/polylib/arithmetique.h.

#define long_to_value (  )     ((Value)(l))

Definition at line 471 of file include/polylib/arithmetique.h.

#define MODULO ( x,
 )     ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))

Definition at line 730 of file include/polylib/arithmetique.h.

#define POSITIVE_DIVIDE ( x,
 )     ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))

Definition at line 727 of file include/polylib/arithmetique.h.

#define POSITIVE_MODULO ( x,
 ) 
Value:
((x) > 0 ? (x)%(y) : \
                              ((x)%(y) == 0 ? 0 : ((y)-(-(x))%(y))))

Definition at line 738 of file include/polylib/arithmetique.h.

#define SIGN (  )     (((x)>0)? 1 : ((x)==0? 0 : -1))

Definition at line 715 of file include/polylib/arithmetique.h.

#define value_abs ( val   ) 
Value:
(value_posz_p(val)? \
    (val) :                                \
    (value_ne((val), VALUE_NAN) ?          \
     value_uminus(val) :                   \
    (THROW (overflow_error), VALUE_NAN )))

Definition at line 541 of file include/polylib/arithmetique.h.

#define value_abs_eq ( v1,
v2   )     (value_abs(v1)==value_abs(v2))

Definition at line 484 of file include/polylib/arithmetique.h.

#define value_abs_ge ( v1,
v2   )     (value_abs(v1)>=value_abs(v2))

Definition at line 487 of file include/polylib/arithmetique.h.

#define value_abs_gt ( v1,
v2   )     (value_abs(v1)>value_abs(v2))

Definition at line 486 of file include/polylib/arithmetique.h.

#define value_abs_le ( v1,
v2   )     (value_abs(v1)<=value_abs(v2))

Definition at line 489 of file include/polylib/arithmetique.h.

#define value_abs_lt ( v1,
v2   )     (value_abs(v1)<value_abs(v2))

Definition at line 488 of file include/polylib/arithmetique.h.

#define value_abs_ne ( v1,
v2   )     (value_abs(v1)!=value_abs(v2))

Definition at line 485 of file include/polylib/arithmetique.h.

#define value_absolute ( ref,
val   )     ((ref) = value_abs((val)))

Definition at line 529 of file include/polylib/arithmetique.h.

#define value_add_int ( ref,
val,
vint   )     ((ref) = (val)+(Value)(vint))

Definition at line 515 of file include/polylib/arithmetique.h.

#define value_addmul ( ref,
val1,
val2   )     ((ref) += (val1)*(val2))

Definition at line 516 of file include/polylib/arithmetique.h.

#define value_addto ( ref,
val1,
val2   )     ((ref) = (val1)+(val2))

Definition at line 514 of file include/polylib/arithmetique.h.

#define value_and ( v1,
v2   )     ((v1)&(v2))

Definition at line 508 of file include/polylib/arithmetique.h.

#define value_andto ( ref,
val1,
val2   )     ((ref) = (val1)&(val2))

Definition at line 535 of file include/polylib/arithmetique.h.

#define value_assign ( v1,
v2   )     ((v1) = (v2))

Definition at line 459 of file include/polylib/arithmetique.h.

#define value_clear ( val   )     ((val) = 0)

Definition at line 462 of file include/polylib/arithmetique.h.

#define value_cmp_si ( val,
n   )     (val - (n))

Definition at line 559 of file include/polylib/arithmetique.h.

#define value_compare ( v1,
v2   )     (value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)

Definition at line 494 of file include/polylib/arithmetique.h.

#define value_decrement ( ref,
val   )     ((ref) = (val)-VALUE_ONE)

Definition at line 522 of file include/polylib/arithmetique.h.

#define value_direct_multiply ( v1,
v2   )     ((v1)*(v2))

Definition at line 501 of file include/polylib/arithmetique.h.

#define value_direct_product ( ref,
val1,
val2   )     ((ref) = (val1)*(val2))

Definition at line 518 of file include/polylib/arithmetique.h.

#define value_div ( v1,
v2   )     ((v1)/(v2))

Definition at line 499 of file include/polylib/arithmetique.h.

#define value_divexact ( ref,
val1,
val2   )     ((ref) = (val1)/(val2))

Definition at line 524 of file include/polylib/arithmetique.h.

#define value_division ( ref,
val1,
val2   )     ((ref) = (val1)/(val2))

Definition at line 523 of file include/polylib/arithmetique.h.

#define value_eq ( v1,
v2   )     ((v1)==(v2))

Definition at line 477 of file include/polylib/arithmetique.h.

#define value_gcd ( ref,
val1,
val2   )     Gcd((val1),(val2),&(ref))

Definition at line 532 of file include/polylib/arithmetique.h.

#define value_ge ( v1,
v2   )     ((v1)>=(v2))

Definition at line 480 of file include/polylib/arithmetique.h.

#define value_gt ( v1,
v2   )     ((v1)>(v2))

Definition at line 479 of file include/polylib/arithmetique.h.

#define value_increment ( ref,
val   )     ((ref) = (val)+VALUE_ONE)

Definition at line 517 of file include/polylib/arithmetique.h.

#define value_init ( val   )     ((val) = 0)

package arithmetique

Id
arithmetique.h,v 1.24 2007/02/22 09:16:57 skimo Exp

Francois Irigoin, mai 1989

Modifications

  • rewrite of DIVIDE which was wrong (Remi Triolet, Francois Irigoin, april 90)
  • simplification of POSITIVE_DIVIDE by suppressing one modulo
  • B.Meister : added addmul, operation existing in gmp and quite useful (05-2005)

Definition at line 458 of file include/polylib/arithmetique.h.

#define value_lcm ( ref,
val1,
val2   )     Lcm3((val1),(val2),&(ref))

Definition at line 533 of file include/polylib/arithmetique.h.

#define value_le ( v1,
v2   )     ((v1)<=(v2))

Definition at line 482 of file include/polylib/arithmetique.h.

#define value_lshift ( v1,
v2   )     ((v1)<<(v2))

Definition at line 509 of file include/polylib/arithmetique.h.

#define value_lt ( v1,
v2   )     ((v1)<(v2))

Definition at line 481 of file include/polylib/arithmetique.h.

#define value_max ( v1,
v2   )     (value_ge((v1),(v2))? (v1): (v2))

Definition at line 506 of file include/polylib/arithmetique.h.

#define value_max_p ( val   )     value_eq(val,VALUE_MAX)

Definition at line 561 of file include/polylib/arithmetique.h.

#define value_maximum ( ref,
val1,
val2   )     ((ref) = value_max((val1),(val2)))

Definition at line 531 of file include/polylib/arithmetique.h.

#define value_min ( v1,
v2   )     (value_le((v1),(v2))? (v1): (v2))

Definition at line 505 of file include/polylib/arithmetique.h.

#define value_min_p ( val   )     value_eq(val,VALUE_MIN)

Definition at line 560 of file include/polylib/arithmetique.h.

#define value_minimum ( ref,
val1,
val2   )     ((ref) = value_min((val1),(val2)))

Definition at line 530 of file include/polylib/arithmetique.h.

#define value_minus ( v1,
v2   )     ((v1)-(v2))

Definition at line 502 of file include/polylib/arithmetique.h.

#define value_mod ( v1,
v2   )     ((v1)%(v2))

Definition at line 500 of file include/polylib/arithmetique.h.

#define value_modulus ( ref,
val1,
val2   )     ((ref) = (val1)%(val2))

Definition at line 525 of file include/polylib/arithmetique.h.

#define value_mone_p ( val   )     value_eq(val,VALUE_MONE)

Definition at line 557 of file include/polylib/arithmetique.h.

#define value_mult ( v,
 ) 
Value:
value_protected_multiply(v,w,                                                 \
    (fprintf(stderr,"[value_mult] value overflow!\n"),THROW(overflow_error)))

Definition at line 611 of file include/polylib/arithmetique.h.

#define value_multiply ( ref,
val1,
val2   )     ((ref) = value_mult((val1),(val2)))

Definition at line 519 of file include/polylib/arithmetique.h.

#define value_ne ( v1,
v2   )     ((v1)!=(v2))

Definition at line 478 of file include/polylib/arithmetique.h.

#define value_neg_p ( val   )     value_lt(val,VALUE_ZERO)

Definition at line 550 of file include/polylib/arithmetique.h.

#define value_negz_p ( val   )     value_le(val,VALUE_ZERO)

Definition at line 552 of file include/polylib/arithmetique.h.

#define value_not ( val   )     (~(val))

Definition at line 540 of file include/polylib/arithmetique.h.

#define value_notmax_p ( val   )     value_ne(val,VALUE_MAX)

Definition at line 563 of file include/polylib/arithmetique.h.

#define value_notmin_p ( val   )     value_ne(val,VALUE_MIN)

Definition at line 562 of file include/polylib/arithmetique.h.

#define value_notmone_p ( val   )     value_ne(val,VALUE_MONE)

Definition at line 558 of file include/polylib/arithmetique.h.

#define value_notone_p ( val   )     value_ne(val,VALUE_ONE)

Definition at line 556 of file include/polylib/arithmetique.h.

#define value_notzero_p ( val   )     value_ne(val,VALUE_ZERO)

Definition at line 554 of file include/polylib/arithmetique.h.

#define value_one_p ( val   )     value_eq(val,VALUE_ONE)

Definition at line 555 of file include/polylib/arithmetique.h.

#define value_oppose ( ref,
val   )     ((ref) = value_uminus((val)))

Definition at line 528 of file include/polylib/arithmetique.h.

#define value_or ( v1,
v2   )     ((v1)|(v2))

Definition at line 507 of file include/polylib/arithmetique.h.

#define value_orto ( ref,
val1,
val2   )     ((ref) = (val1)|(val2))

Definition at line 534 of file include/polylib/arithmetique.h.

#define value_pdiv ( v1,
v2   )     (DIVIDE((v1),(v2)))

Definition at line 503 of file include/polylib/arithmetique.h.

#define value_pdivision ( ref,
val1,
val2   )     ((ref) = value_pdiv((val1),(val2)))

Definition at line 526 of file include/polylib/arithmetique.h.

#define value_plus ( v1,
v2   )     ((v1)+(v2))

Definition at line 498 of file include/polylib/arithmetique.h.

#define value_pmod ( v1,
v2   )     (MODULO((v1),(v2)))

Definition at line 504 of file include/polylib/arithmetique.h.

#define value_pmodulus ( ref,
val1,
val2   )     ((ref) = value_pmod((val1),(val2)))

Definition at line 527 of file include/polylib/arithmetique.h.

#define value_pos_p ( val   )     value_gt(val,VALUE_ZERO)

Definition at line 549 of file include/polylib/arithmetique.h.

#define value_posz_p ( val   )     value_ge(val,VALUE_ZERO)

Definition at line 551 of file include/polylib/arithmetique.h.

#define value_print ( Dst,
fmt,
val   )     (fprintf((Dst),(fmt),(val)))

Definition at line 464 of file include/polylib/arithmetique.h.

#define value_product ( v,
 )     v=value_mult(v,w)

Definition at line 614 of file include/polylib/arithmetique.h.

#define value_protected_hard_idiv_multiply ( v,
w,
throw   ) 
Value:
((value_zero_p(w) || value_zero_p(v))? VALUE_ZERO:              \
   value_lt(value_abs(v),value_div(VALUE_MAX,value_abs(w)))?    \
   value_direct_multiply(v,w): (throw, VALUE_NAN))

Definition at line 575 of file include/polylib/arithmetique.h.

#define value_protected_mult ( v,
 )     value_protected_multiply(v,w,THROW(overflow_error))

Definition at line 594 of file include/polylib/arithmetique.h.

#define value_protected_multiply ( v,
w,
throw   )     value_protected_hard_idiv_multiply(v,w,throw)

Definition at line 588 of file include/polylib/arithmetique.h.

#define value_protected_product ( v,
 )     v=value_protected_mult(v,w)

Definition at line 596 of file include/polylib/arithmetique.h.

#define value_read ( val,
str   )     (sscanf((str),VALUE_FMT,&(val)))

Definition at line 463 of file include/polylib/arithmetique.h.

#define value_rshift ( v1,
v2   )     ((v1)>>(v2))

Definition at line 510 of file include/polylib/arithmetique.h.

#define value_set_double ( val,
 )     ((val) = (Value)(d))

Definition at line 461 of file include/polylib/arithmetique.h.

#define value_set_si ( val,
 )     ((val) = (Value)(i))

Definition at line 460 of file include/polylib/arithmetique.h.

#define value_sign (  )     (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)

Definition at line 493 of file include/polylib/arithmetique.h.

#define value_sub_int ( ref,
val,
vint   )     ((ref) = (val)-(Value)(vint))

Definition at line 521 of file include/polylib/arithmetique.h.

#define value_substract ( ref,
val1,
val2   )     (value_subtract((ref),(val1),(val2)))

Definition at line 695 of file include/polylib/arithmetique.h.

#define value_subtract ( ref,
val1,
val2   )     ((ref) = (val1)-(val2))

Definition at line 520 of file include/polylib/arithmetique.h.

#define value_swap ( v1,
v2   ) 
Value:
{Value tmp; tmp = v2; \
                                    v2 = v1; v1 = tmp;   \
                                   }

Definition at line 465 of file include/polylib/arithmetique.h.

#define value_uminus ( val   )     (-(val))

Definition at line 539 of file include/polylib/arithmetique.h.

#define value_zero_p ( val   )     value_eq(val,VALUE_ZERO)

Definition at line 553 of file include/polylib/arithmetique.h.


Function Documentation

void dump_exception_stack ( void   ) 

Definition at line 233 of file errors.c.

References dump_exception_stack_to_file().

void dump_exception_stack_to_file ( FILE *   ) 

Definition at line 216 of file errors.c.

References exception_index.

void pop_exception_from_stack ( int  ,
const char *  ,
const char *  ,
int   
)

Variable Documentation

unsigned int any_exception_error

Definition at line 116 of file errors.c.

unsigned int overflow_error

Definition at line 109 of file errors.c.

unsigned int parser_exception_error

Definition at line 112 of file errors.c.

Definition at line 110 of file errors.c.

Definition at line 156 of file errors.c.

unsigned int user_exception_error

Definition at line 111 of file errors.c.


Generated on Wed Nov 25 17:45:26 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/globals_0x75.html0000644000175000017500000001142711303257447023260 0ustar sylvestresylvestre polylib: Class Members
Here is a list of all file members with links to the files they belong to:

- u -


Generated on Wed Nov 25 17:45:27 2009 for polylib by  doxygen 1.6.1
polylib-5.22.5.orig/doc/codeDoc/html/c2p_8c-source.html0000644000175000017500000000727411253740766023440 0ustar sylvestresylvestre polylib: c2p.c Source File
Generated on Tue Sep 15 18:33:58 2009 for polylib by  doxygen 1.5.6
polylib-5.22.5.orig/doc/Changes0000644000175000017500000005724511035141341017146 0ustar sylvestresylvestreThe new polylib library combines both the Strasbourg version and IRISA version and includes option to support 32 bit or 64 bit or GNU muti-precision integers. It also includes the recent (April 2001) changes suggested by Doran Wilde and the changes made by Vincent Loechner in polylib4.20. A new feature: computati- ons on Z-polyhedron has been added into the new polylib version. The new version has following changes compared to the polylib version at Strassbourg:- ******************************************************************************* Directory: ./include/polylib (1) Arithmetique.h * Included "GMP" value-type. eg: #else /* If defined(GNUMP) */ #define LINEAR_VALUE_GMP "gmp" typedef mpz_t Value; * Added macros corresponding to "GMP" value-type :- eg:- ! Basic Macros :- value_init(val), etc.. ! Boolean operators on 'Value' :- value_eq(v1,v2), etc... ! Trian operators on 'Value' :- value_sign(val),etc.. ! Binary operations on 'Value' :- value_addto(ref,val) ! Conditional operations on 'Value' :- value_pos_p(val), etc... * A few macros are not defined for "GMP" value-types compared to other defined value-types, as there is no way to do so in "GMP". eg:- (i) VALUE_CONST, VALUE_NAN, VALUE_MAX, VALUE_MIN, etc... (ii) ! Cast to value macros :- int_to_value(i), etc.... (iii)! Binary operators on 'Value' :- value_plus(v1,v2), etc.. (iV) ! Unary operators on 'Value' :- value_not(val), etc... * A few macros not defined for "GMP" value-types compared to other defined value-types, as they seemed redundant in "GMP". eg:- (i) value_direct_product(ref,val) /* No overflow check reqd. */ (ii) ! Various macros for protected multiplication :- value_protected_multiply(v,w) * A new set of macro defintions included in every value-type to handle initialization and clear operations in "GMP". eg:- value_init(val), value_assign(v1,v2),value_clear(val), etc .. * A few macro definitions changed. eg:- value_addto(ref,val) -> value_addto(ref,val1,val2) value_increment(ref) -> value_increment(ref,val). etc... * A few function prototype definitions removed as they were redundant. eg:- extern Value abs_ofl_ctrl(...): abs.c extern Value divide_fast(....): divide.c extern Value pgcd_slow(......): pgcd.c * Comments added and modified wherever seemed appropriate. (2) arithmetic_errors.h * added a test on the cygwin flag for CATCH and THROW macros (3) eval_ehrhart.h * Changes in function prototype definitions to match with the changes made in the file 'eval_ehrhart.c'. (4) matrix.h * Changes in function prototype definitions to match with the changes made in the file 'matrix.c'. (5) polyhedron.h * Added Statement : extern Polyhedron *Stras_DomainSimplify(Polyhedron *Pol1, Polyhedron *Pol2, unsigned NbMaxRays); * Changes in function prototype definitions to match with the changes made in the file 'polyhedron.c'. (6) polylib.h * Added statement: && !defined(GNUMP) * Removed few statements. eg:- #include #include #include (7) polyparam.h * Changes in function prototype definitions to match with the changes made in the file 'polyparam.c'. (8) types.h * Added macro: #ifdef DGNUMP #include #endif $define MAXNOOFRAYS 200 * Added statement: #else /* Default : GNUMP */ #define P_VALUE_FMT "%4s" #endif * Added Data-structures to represent Z-Polyhedron eg: Lattice, LatticeUnion, ZPolyhedron * Deleted a few redundant macros: eg: (1) Vector_Copy (2) Vector_Init (3) Vector_Exchange * Deleted file "types_mp.h", as it is not required now. * Comments added and modified wherever seemed appropriate. (9) vector.h * Changes in function prototype definitions to match with the changes made in the file 'vector.c'. (10) Addition of new header files eg: Solvedio.h, Lattice.h, Matop.h, NormalForms.h and Zpolyhedron.h (11) Makefile * Changes in Makefile to match with the changes made in the library. ******************************************************************************* Directory: ./ArithLib (1) arithmetic_errors.h (copied from ./include/polylib/arithmetic_errors.h) (2) arithmetique.h (copied from ./include/polylib/arithmetique.h) (3) Deleted redundant files "arithmetique-local.h", "abs.c", "divide.c", "doc.h", "exp.c", "io.c", "linear.h" "modulo.c", "pgcd.c", "pgcm.c". ******************************************************************************* Directory: ./source (1) count.c * Changes in local variable names in function declarations eg: (1) main : Value k -> int k str (added) (2) ehrhart.c * Programming code changed from K&R C to ANSI C. * Changes in parameter names or return type in function declarations eg: (1) Scan_Vertices : returned type changed to (Value*) from Value * Changes in local variable names in function declarations eg: (1) cherche_min : j (added) (2) Polyhedron_Preprocess : tmp, size_copy (added) (3) Polyhedron_Preprocess2 : tmp1, tmp2 (added) (4) old_Polyhedron_Preprocess : temp (deleted) abs_a, abs_b, size_copy (added) (5) count_points : result (added) (5) P_Enum : temp (deleted) tmp, lcm_copy (added) (6) Enumerate_NoParametres : j, tmp (added) (7) Polyhedron_Enumerate : i (added) (8) main : i,str (added) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. * Deleted file "ehrhart_mp.c" as it is not required now. (3) eval_ehrhart.c * Changes in parameter names or return type in function declarations eg: (1) compute_poly : return type changed to (Value *) from Value * Changes in local variable names in function declarations eg: (1) in_domain : tmp (added) (2) compute_poly : tmp (added) * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (4) example.c : * Added file "example.c" in ./source directory. * A few macro definitions removed: eg: #include "types.h" #include "ztypes.h" #include "vector.h", etc.... * A few macro definitions added: eg: #include "polylib/polylib.h" (5) Lattice.c * Added file "Lattice.c" in ./source directory. * Removed macro header definitions eg: #include "types.h" #include "ztypes.h" etc.. * Added macro header definitions eg: #include * Changes in parameter names or return type in function declarations eg: * Changes in local variable names in function declarations eg: (1) AffineSmith : sum, quo, rem (added) (2) LatticeDifference : int k -> Value k (3) AddLattice : tmp (added) (4) FindHermiteBasisofDomain : fact(added) int lcm -> Value lcm (5) LatticePreimage : tmp (added) int divisor -> Value divisor (6) Simplify : aux,k,fac, num, tmp, foobar (added) int cnt -> Value cnt (7) AffinePartSimplify : aux (added) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (6) Matop.c * Added file "Matop.c" in ./source directory. * Removed macro header definitions eg: #include "types.h" #include "ztypes.h" etc.. * Added macro header definitions eg: #include * Changes in parameter names or return type in function declarations eg: (1) Lcm : return type changed to (Value *) from (int) int i -> Value i int j -> Value j * Changes in local variable names in function declarations eg: (1) Lcm : tmp, aux (added) (2) ExchangeRows : int *temp -> Value *temp (3) ExchangeColumns : int *temp -> Value *temp; (4) isIntegral : int divisor -> Value divisor tmp (added) (5) isinHnf : int rem -> Value rem (6) PutRowLast : int *vector -> Value *vector (7) PutRowFirst : int *vector -> Value *vector (8) PutColumnFirst : int *vector -> Value *vector (9) PutColumnLast : int *vector -> Value *vector * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (7) matrix.c * Programming code changed from K&R C to ANSI C. * A few functions added: eg: int Matrix_Inverse(Matrix *Mat, Matrix *MatInv) * Changes in parameter names or return type in function declarations eg: (1) MatInverse : M -> Mat MInv -> MatInv (2) Matrix_Vector_Product : mat -> Mat (3) Vector_Matrix_Product : mat -> Mat (4) Matrix_Product : mat1 -> Mat1 mat2 -> Mat2 mat3 -> Mat3 * Changes in local variable names in function declarations eg: (1) Matrix_Alloc : j (added) (2) Matrix_Free : (i,j,p) (added) (3) Matrix_Read_Input : str (added) (4) hermite : aux (added) tmp -> temp1 tmp2 -> temp2 (5) MatInverse : g -> gcd p -> i li -> j, tmp (deleted) (6) rat_prodmat : denom -> last column_index dcom -> lcm old_dc -> old_lcm g -> gcd d -> last_column_entry s -> s1, s2(added), tmp (deleted) (7) Matrix_Vector_Product : s (added) (8) Vector_Matrix_Product : s (added) (9) Matrix_Product : s (added) * Error correction in code eg: (1) rat_prodmat : if (value_zero_p(dcom)) -> if (value_one_p(dcom)) * Deleted file "matrix_mp.c", as it is not required now. * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (8) NormalForms.c * Added file "NormalForms.c" in ./source directory. * Programming code changed from K&R C to ANSI C. * Removed macro header definitions eg: #include "types.h" #include "ztypes.h" etc.. * Added macro header definitions eg: #include * Removed function: static int abs(int x) * Changes in parameter names or return type in function declarations eg: (1) moins_l : int *a -> Value *a (2) moins_c : int *a -> Value *a (3) echange_l : int *a -> Value *a (4) echange_c : int *a -> Value *a (5) ligne : int *a -> Value *a int x -> Value x (6) colonne : int *a -> Value *a int x -> Value x (7) petit_l : int *a -> Value *a (8) petit_c : int *a -> Value *a (9) identite : int *a -> Value *a (10) transpose: int *a -> Value *a (11) encore : int *a -> Value *a int val -> Value val (12) smith : int *a -> Value *a int *b -> Value *b int *c -> Value *c int *b_inverse -> Value *b_inverse int *c_inverse -> Value *c_inverse (13) hermite : int *a, -> Value *a int *b -> Value *b int *d -> Value *d (14) ConvertpolMattoDarMat : return type changed to (Value *) from (int *) (15) ConvertDarMattoPolMat : int *A -> Value *A * Changes in local variable names in function declarations eg: (1) moins_l : int *c -> Value *c (2) moins_c : int *c -> Value *c (3) echange_l : int s -> Value s int *c1, *c2 -> Value *c1, *c2 (4) echange_c : int s -> Value s int *c1, *c2 -> Value *c1, *c2 (5) ligne : int *c1, *c2 :-> Value *c1, *c2 tmp (added) (6) colonne : int *c1, *c2 -> Value *c1, *c2 tmp (added) (7) petit_l : int *c -> Value *c int minus, comp -> Value minus, comp (8) petit_c : int *c -> Value *c int minus, comp -> Value minus, comp (9) identite : int *b -> Value *b (10) transpose : int *b, *c -> Value *b, *c int val -> Value val (11) encore : int *c -> Value *c int comp -> Vale comp tmp (added) (12) smith : int *f -> Value *f int x, pivot -> Value x, pivot tmp, x_inv (added) (13) hermite : int *c1 -> Value *c1 int x, pivot -> Value x, pivot tmp, x_inv (added) (14) ConvertPolMattoDarMat : int *result -> Value *result (15) Smith : int *a, *u, *v, *u_inv, *v_inv -> Value *a, *u, *v, *u_inv, *v_inv i (added) (16) Hermite : int *darte_matA -> Value *darte_matA int *darte_identite -> Value *darte_identite int *darte_id_inv -> Value *darte_id_inv i (added) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (9) polyhedron.c * Programming code changed from K&R C to ANSI C. * A few function declarations removed. eg: VVPd,IVPd,MPd (functions) * A few function names changed. eg: SMPd -> SMPrint SatVector_Or -> SatVector_OR PPd -> PolyPrint * A few functions added eg: (1) Stras_DomainSimplify(Pol1, Pol2, NbMaxRays) (2) SimplifyEqualities(Pol1, Pol2, Filter) * Changes in Macro definition eg: bexchange(a,b,t,l) -> bexchange(a,b,l) * Changes in parameter names in function declarations eg: (1) Combine : temp (deleted) (2) RaySort : Temp1 (deleted), Temp2 (deleted) (3) Gauss : temp (deleted) (4) Rays2Polyhedron : NbMaxRays -> NbMaxConstrs (5) BuildSat : NbCon -> NbConstraints (6) AddConstraints : Con2 -> Con NbCon2 -> NbConstraints Pol1 -> Pol (7) AddPolyToDomain : p3 -> Pol p3beg -> PolDomain (8) SubConstraint : Con2 -> Con Pol1 -> Pol (9) AddRays : Ray2 ->AddedRays NbRay2 -> NbAddedRays Pol1 -> Pol NbMaxRays -> NbMaxConstrs (10) DomainAddRays : Pol1 -> Pol Mat2 -> Ray NbMaxRays -> NbMaxConstrs (11) DomainConvex : Pol1 -> Pol NbMaxRays -> NbMaxConstrs (12) align_context : D -> Pol n -> align_dimension MAXRAYS -> NbMaxRays (13) Polyhedron_Scan : MAXRAYS -> NbMaxRays (14) Polyhedron_Preimage : Pol1 -> Pol (15) DomainPreimage : Pol1 -> Pol (16) Polyhedron_Image : Pol1 -> Pol NbMaxrays -> NbMaxConstrs (17) DomainImage : Pol1 -> Pol NbMaxRays -> NbMaxConstrs (18) DomainCost : Pol1 -> Pol (19) DomainAddConstraints : Pol1 -> Pol Mat2 -> Mat * Changes in local variable names in function declarations eg: (1) Combine : a -> gcd abs_a1,abs_a2,neg_a1 (added) (2) TransformSat : nc2 -> sat_nbcolumns Sat2 -> result (3) Chernikova : nc -> sat_nbcolumns Temp1 (deleted) Temp2 -> Temp (4) Gauss : col_of_rank -> column_index tmp (added) RowSize (deleted) (5) Remove_Redundants : nc -> sat_nbcolumns Dim -> Dim_RaySpace tmp1,tmp2,tmp3 (added) (6) Polyhedron_Alloc : j (added) (7) Polyhedron_Free : size,p,NbRows,NbColumns (added) (8) Domain_Free : size,p,NbRows,NbColumns (added) (9) Constraints2Polyhedron : nc -> nbcolumns (10) Rays2Polyhedron: Sat -> SatTranspose Sat2 -> Sat nc -> nbcolumns (11) BuildSat : nc -> nbcolumns tmp (added) (12) AddConstraints : Pol -> NewPol NbCon1, NbEle1 (deleted) (13) PolyhedronIncludes : tmp (added) (14) AddPolyToDomain : p3end -> p_domain_end (15) SubConstraint : Pol -> NewPol NbCon1 -> NbCon NbCon (deleted) (16) AddRays : Pol -> NewPol Sat -> SatTranspose Sat2 -> Sat NbRay1 -> NbRay NbRay (deleted) (17) FindSimple : tmp (added) (18) SimplifyConstraints : notvid ->notempty (19) SimplifyEqualities : temp (deleted) (20) DomainSimplify : nc -> nbentries NbCon2 -> NbCon vid -> empty RowSize (deleted) (21) DomainConvex : Pol -> NewPol PolNew -> q (22) align_context : p1 -> q M -> Mat (23) Polyhedron_Scan : dim2 (deleted) numP (deleted) M -> Mat (24) lower_upper_bounds : tmp (added) (25) Polyhedron_Preimage : Pol2 -> NewPol tmp (added) (26) DomainPreimage : p1 -> q (27) Polyhedron_Image : Pol2 -> NewPol tmp (added) (28) DomainImage : p1 -> q (29) DomainCost : tmp1,tmp2,tmp3 (added) * Error correction in code eg: (1) Gauss: column_index = (int *)malloc(Dimension*sizeof(Value)) -> column_index = (int *)malloc(Dimension*sizeof(int)) (2) DomainAddRays: if (PolyhedronIncludes(p2,p1)) -> if (PolyhedronIncludes(p2,p3)) (3) DomainAddConstraints: if (PolyhedronIncludes(p2,p1)) -> if (PolyhedronIncludes(p2,p3)) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (10) polyparam.c :-> * Programming code changed from K&R C to ANSI C. * A few macro definitions removed. eg: Vector_Init (deleted) * A few function declarations removed. eg: TestRank_mp * Changes in parametres names in function declarations eg: (1) TestRank : M -> Mat gcd,tmp (added) (2) SMaAlloc : m -> matrix (3) Poly2Sat : P -> Pol (4) GenParamPolyhedron : poly -> Pol (5) Param_Domain_Free : PP -> PD * Changes in local variable names in function declarations eg: (1) TestRank : gcd (added) (2) Poly2Sat : Tmp -> Temp tmp (added) (3) Elim_Columns : tmp1, tmp2 (added) (4) Polyhedron2Param_Vertices : res -> result (5) Param_Vertices_Free : n -> next_pv (6) Print_Vertex : t (deleted), tmp (added) g -> gcd (7) Param_Vertices_Print : a -> poly (8) Polyhedron2Param_Domain : res -> result (9) Polyhedron2Param_SimplifiedDomain : res ->result (10) Param_Domain_Free : n -> next_pd * Error correction in code: eg: (1) PDomainIntersection : Uncommented statement - Polyhedron_Free(p3); * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (11) polytest.c * Programming code changed from K&R C to ANSI C. * Changes in Macro definition eg: bexchange(a,b,t,l) (deleted) * Changes in parameter names or return type in function declarations eg: (1) exist_points : P -> Pol (2) PolyhedronLTQ : P1 -> Pol1 P2 -> Pol2 MAXRAYS -> NbMaxConstrs (3) GaussSimplify : M -> Mat1 M2 -> Mat2 * Changes in local variable names or types in function declarations eg: (1) exist_points : tmp (added) (2) Polyhedron_Not_Empty : i (added) (3) PolyhedronLTQ : M -> Mat (4) GaussSimplify : col_of_rank :-> column_index tmp (added) temp,RowSize (deleted) * Error correction in code: eg: (1) GaussSimplify : if(value_gt(gcd,int_to_value(2))) -> if(value_ge(...)) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (12) SolveDio.c * Added file "SolveDio.c" in ./source directory. * Removed macro header definitions eg: #include "types.h" #include "ztypes.h" etc.. * Added macro header definitions eg: #include * Changes in local variable names or types in function declarations eg: (1) SolveDiophantine : int *C -> Value *C int *T -> Value *T int sum -> Value sum k1, k2, tmp (added) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (13) vector.c * Programming code changed from K&R C to ANSI C. * Functions added eg: void Vector_Copy(Value *,Value *,unsigned) void Vector_Exchange(Value *,Value *,unsigned) * Changes in parameter names or return type in function declarations eg: (1) Factorial : return type changed to (Value *) from (Value) (2) Binomial : return type changed to (Value *) from (Value) (3) CNP : return type changed to (Value *) from (Value) (4) GCD : return type changed to (Value *) from (Value) (5) Vector_Free : vec -> vector (6) Vector_Print : vec -> vector (7) Vector_Set : Value n -> int n (8) Inner_Product : return type changed to (Value *) from (Value) (9) Vector_Max : return type changed to (Value *) from (Value) (10) Vector_Min : return type changed to (Value *) from (Value) (11) Vector_Min_Not_Zero : return type changed to (Value *) from (Value) (12) Vector_Gcd : return type changed to (Value *) from (Value) q (deleted) (13) Vector_Map : Value (*f)() -> Value *(*f)() (14) Vector_Normalize : q (deleted) (15) Vector_Normalize_Positive : tmp (deleted) (16) Vector_Reduce : return type changed to (Value *) from (Value) Value (*f)() -> Value *(*f)() (17) Vector_Sort : Vecv -> vector * Changes in local variable names or types in function declarations eg: (1) Factorial : Value fact -> Value *fact tmp (added) (2) Binomial : Value prod -> Value *result f (deleted), tmp (added) (3) CNP : Value c -> Value *result tmp (added) (4) GCD : Value aux -> Value *result acopy,bcopy (added) (5) Vector_Alloc : vec -> vector i (added) (6) Vector_Free : i (added) (7) Vector_Read : vec -> vector str (added) (8) Inner_Product : Value ip -> Value *ip tmp (added) (9) Vector_Max : Value max -> Value *max (10) Vector_Min : Value min -> Value *min (11) Vector_Min_Not_Zero : Value min -> Value *min j (added) (12) Vector_Gcd : Value min -> Value *min q (added) (13) Vector_Normalize : Value gcd -> Value *gcd tmp (added) (14) Vector_Normalize_positive : Value g -> Value *gcd (15) Vector_Reduce : Value r -> Value *r * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (14) verif_ehrhart.c * Changes in local variable names or types in function declarations eg: (1) check_poly : Value k -> int k tmp (added) (2) main : tmp (added) * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (15) Zpolyhedron.c -> * Added file "Zpolyhderon.c" in ./source directory. * A few macro definitions removed: eg: #include "types.h" #include "ztypes.h" #include "vector.h", etc.... * A few macro definitions added: eg: #include "polylib/polylib.h" * Changes in local variable names or types in function declarations eg: (1) CanonicalForm : tmp (added) * Comments added wherever seemed appropriate. * Changes in almost all the functions in order to make it generic and allow handling of all the 'Value' types including GMP. (16) Zpolytest.c * Added file "Zpolytest.c" in ./source directory. * A few macro definitions removed: eg: #include "types.h" #include "ztypes.h" #include "vector.h", etc.... * A few macro definitions added: eg: #include "polylib/polylib.h" ******************************************************************************* polylib-5.22.5.orig/doc/INSTALL0000644000175000017500000000314211035141341016667 0ustar sylvestresylvestre This is version 5.22 of the Polyhedral Library. http://icps.u-strasbg.fr/polylib REQUIREMENTS: ============= All you need to build the polylib is a C compiler like gcc. If you want the library to be overflow proof, you might install the GNU-MP library, version 2.0.2 or more. You can get it from: ftp://ftp.gnu.org or from any GNU mirror site. You should run './configure --with-libgmp' to use gmp. You can also build the polylib if you don't have gmp, but it will fail when an overflow occurs. BUILDING, if you have root access: ================================= 1. Run ./configure 2. Become root 3. Run 'make install' 4. Run 'make test' to test the library on a given set of examples 5. Run 'make longtest' to run a longer test on the examples BUILDING, if you don't have root access (WITHOUT INSTALLING THE LIB) ==================================================================== Run './configure --disable-install-lib' at step 1. The executables will be built in the Obj.*.* directory, linked with the static library. You can run the tests after 'make' in this case. INSTALLING THE LIB IN A PRIVATE DIRECTORY ========================================= Run './configure --prefix=MyDirectory' I suggest that you also add option '--enable-onlystatic'. It does not make much sense to build a shared object in a private directory. If you do however, you will have to set your LD_LIBRARY_PATH before using the lib. OTHER OPTIONS ============= Type './configure --help' to get a complete list of options supported by the configure script. If something fails, send me an e-report: loechner@icps.u-strasbg.fr --Vincent polylib-5.22.5.orig/Makefile.am0000644000175000017500000002101211341227526017133 0ustar sylvestresylvestreSUBDIRS = include Test EXTRA_CPPFLAGS = -I$(srcdir)/include -Iinclude @CPPFLAGS@ ACLOCAL_AMFLAGS = -I m4 poly_src = $(srcdir)/applications poly_arith = $(srcdir)/source/arith CFILES= \ source/arith/errors.c \ source/kernel/errormsg.c \ source/kernel/vector.c \ source/kernel/matrix.c \ source/kernel/polyhedron.c \ source/kernel/polyparam.c \ source/kernel/param.c \ source/kernel/alpha.c \ source/ehrhart/ehrhart.c \ source/ehrhart/ext_ehrhart.c \ source/ehrhart/eval_ehrhart.c \ source/ehrhart/homogenization.c \ source/ehrhart/ranking.c \ source/kernel/matrix_addon.c \ source/kernel/matrix_permutations.c \ source/kernel/compress_parms.c \ source/kernel/SolveDio.c \ source/kernel/Lattice.c \ source/kernel/Matop.c \ source/kernel/NormalForms.c \ source/kernel/Zpolyhedron.c sources = $(CFILES) \ $(poly_arith)/assert.h \ $(poly_arith)/arithmetique.h \ $(poly_arith)/arithmetic_errors.h EXTRA_DIST = doc source/oldpolytest.c INSTALL COPYING lib_LTLIBRARIES = @polylibs@ libpolylib32_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib32_la_SOURCES = $(sources) libpolylib32_la_CPPFLAGS = -DPOLYLIB_BITS=32 $(EXTRA_CPPFLAGS) libpolylib32_la_LIBADD = @LTLIBOBJS@ libpolylib64_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib64_la_SOURCES = $(sources) libpolylib64_la_CPPFLAGS = -DPOLYLIB_BITS=64 $(EXTRA_CPPFLAGS) libpolylib64_la_LIBADD = @LTLIBOBJS@ libpolylib128_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylib128_la_SOURCES = $(sources) libpolylib128_la_CPPFLAGS = -DPOLYLIB_BITS=128 $(EXTRA_CPPFLAGS) libpolylib128_la_LIBADD = @LTLIBOBJS@ libpolylibgmp_la_LDFLAGS = -rpath $(libdir) -version-info @versioninfo@ libpolylibgmp_la_SOURCES = $(sources) libpolylibgmp_la_CPPFLAGS = -DGNUMP $(EXTRA_CPPFLAGS) libpolylibgmp_la_LIBADD = @LTLIBOBJS@ testlib_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) example_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) count_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) c2p_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) r2p_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) findv_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) disjoint_union_sep_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) disjoint_union_adj_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_quick_apx_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_lower_bound_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) ehrhart_upper_bound_CPPFLAGS = $(libpolylib@BITS@_la_CPPFLAGS) EXTRA_LTLIBRARIES = libpolylib32.la libpolylib64.la libpolylib128.la \ libpolylibgmp.la # not using foreach GNU make extension no_inst_programs_32=Zpolytest32$(EXEEXT) polytest32$(EXEEXT) verif_ehrhart32$(EXEEXT) testCompressParms32$(EXEEXT) no_inst_programs_64=Zpolytest64$(EXEEXT) polytest64$(EXEEXT) verif_ehrhart64$(EXEEXT) testCompressParms64$(EXEEXT) no_inst_programs_gmp=Zpolytestgmp$(EXEEXT) polytestgmp$(EXEEXT) verif_ehrhartgmp$(EXEEXT) testCompressParmsgmp$(EXEEXT) noinst_PROGRAMS = \ testlib \ example \ count \ @multi_noinst_programs@ multi_bin_programs_32=ehrhart_ranking32$(EXEEXT) ehrhart_union32$(EXEEXT) pp32$(EXEEXT) testehrhart32$(EXEEXT) multi_bin_programs_64=ehrhart_ranking64$(EXEEXT) ehrhart_union64$(EXEEXT) pp64$(EXEEXT) testehrhart64$(EXEEXT) multi_bin_programs_gmp=ehrhart_rankinggmp$(EXEEXT) ehrhart_uniongmp$(EXEEXT) ppgmp$(EXEEXT) testehrhartgmp$(EXEEXT) bin_PROGRAMS = \ c2p \ r2p \ findv \ disjoint_union_sep \ disjoint_union_adj \ ehrhart_quick_apx \ ehrhart_upper_bound \ ehrhart_lower_bound \ @multi_bin_programs@ EXTRA_PROGRAMS = $(no_inst_programs_32) $(no_inst_programs_64) $(no_inst_programs_gmp) \ $(multi_bin_programs_32) $(multi_bin_programs_64) $(multi_bin_programs_gmp) LDADD = @polylib@ c2p_SOURCES = $(poly_src)/c2p.c c2p_DEPENDENCIES = @polylib@ r2p_SOURCES = $(poly_src)/r2p.c r2p_DEPENDENCIES = @polylib@ findv_SOURCES = $(poly_src)/findv.c findv_DEPENDENCIES = @polylib@ disjoint_union_sep_SOURCES = $(poly_src)/disjoint_union_sep.c disjoint_union_sep_DEPENDENCIES = @polylib@ disjoint_union_adj_SOURCES = $(poly_src)/disjoint_union_adj.c disjoint_union_adj_DEPENDENCIES = @polylib@ ehrhart_quick_apx_SOURCES = $(poly_src)/ehrhart_quick_apx.c ehrhart_quick_apx_DEPENDENCIES = @polylib@ ehrhart_upper_bound_SOURCES = $(poly_src)/ehrhart_upper_bound.c ehrhart_upper_bound_DEPENDENCIES = @polylib@ ehrhart_lower_bound_SOURCES = $(poly_src)/ehrhart_lower_bound.c ehrhart_lower_bound_DEPENDENCIES = @polylib@ testlib_SOURCES = $(poly_src)/testlib.c testlib_DEPENDENCIES = @polylib@ example_SOURCES = $(poly_src)/example.c example_DEPENDENCIES = @polylib@ count_SOURCES = source/count.c count_DEPENDENCIES = @polylib@ Zpolytest32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) Zpolytest32_SOURCES = $(poly_src)/Zpolytest.c Zpolytest32_LDADD = libpolylib32.la Zpolytest64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) Zpolytest64_SOURCES = $(poly_src)/Zpolytest.c Zpolytest64_LDADD = libpolylib64.la Zpolytestgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) Zpolytestgmp_SOURCES = $(poly_src)/Zpolytest.c Zpolytestgmp_LDADD = libpolylibgmp.la ehrhart_ranking32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) ehrhart_ranking32_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_ranking32_LDADD = libpolylib32.la ehrhart_ranking64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) ehrhart_ranking64_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_ranking64_LDADD = libpolylib64.la ehrhart_rankinggmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ehrhart_rankinggmp_SOURCES = $(poly_src)/ehrhart_ranking.c ehrhart_rankinggmp_LDADD = libpolylibgmp.la ehrhart_union32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) ehrhart_union32_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_union32_LDADD = libpolylib32.la ehrhart_union64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) ehrhart_union64_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_union64_LDADD = libpolylib64.la ehrhart_uniongmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ehrhart_uniongmp_SOURCES = $(poly_src)/ehrhart_union.c ehrhart_uniongmp_LDADD = libpolylibgmp.la polytest32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) polytest32_SOURCES = $(poly_src)/polytest.c polytest32_LDADD = libpolylib32.la polytest64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) polytest64_SOURCES = $(poly_src)/polytest.c polytest64_LDADD = libpolylib64.la polytestgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) polytestgmp_SOURCES = $(poly_src)/polytest.c polytestgmp_LDADD = libpolylibgmp.la pp32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) pp32_SOURCES = $(poly_src)/pp.c pp32_LDADD = libpolylib32.la pp64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) pp64_SOURCES = $(poly_src)/pp.c pp64_LDADD = libpolylib64.la ppgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) ppgmp_SOURCES = $(poly_src)/pp.c ppgmp_LDADD = libpolylibgmp.la testehrhart32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) testehrhart32_SOURCES = $(poly_src)/testehrhart.c testehrhart32_LDADD = libpolylib32.la testehrhart64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) testehrhart64_SOURCES = $(poly_src)/testehrhart.c testehrhart64_LDADD = libpolylib64.la testehrhartgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) testehrhartgmp_SOURCES = $(poly_src)/testehrhart.c testehrhartgmp_LDADD = libpolylibgmp.la testCompressParms32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) testCompressParms32_SOURCES = $(poly_src)/testCompressParms.c testCompressParms32_LDADD = libpolylib32.la testCompressParms64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) testCompressParms64_SOURCES = $(poly_src)/testCompressParms.c testCompressParms64_LDADD = libpolylib64.la testCompressParmsgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) testCompressParmsgmp_SOURCES = $(poly_src)/testCompressParms.c testCompressParmsgmp_LDADD = libpolylibgmp.la verif_ehrhart32_CPPFLAGS = $(libpolylib32_la_CPPFLAGS) verif_ehrhart32_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhart32_LDADD = libpolylib32.la verif_ehrhart64_CPPFLAGS = $(libpolylib64_la_CPPFLAGS) verif_ehrhart64_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhart64_LDADD = libpolylib64.la verif_ehrhartgmp_CPPFLAGS = $(libpolylibgmp_la_CPPFLAGS) verif_ehrhartgmp_SOURCES = $(poly_src)/verif_ehrhart.c verif_ehrhartgmp_LDADD = libpolylibgmp.la check: tests tests: all (cd Test; $(MAKE) tests) longtest: all (cd Test; $(MAKE) long_tests) # Make the 'javadoc' style documentation document: -mkdir doc $(DOXYGEN) polylib.doxygen dist-hook: document rm -rf `find $(distdir)/doc -name CVS` clean-local: rm -rf doc distclean-local: rm -f polylib*.pc polylib*-uninstalled.pc polylib*-uninstalled.sh polylib*.pc.in install-data-local: @test -z "$(pkgconfig_libdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfig_libdir)" $(INSTALL_DATA) $(pkgconfig_libfile) "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" uninstall-local: rm -f "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" polylib-5.22.5.orig/Test/0000755000175000017500000000000011341243121016007 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/cases/0000755000175000017500000000000011035141337017113 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/cases/loopreorder0.in0000644000175000017500000000023011035141337022052 0ustar sylvestresylvestre# Polylib test file 6 6 1 1 0 0 0 -1 1 -1 0 0 0 4 1 -1 1 0 0 0 1 0 -1 0 0 8 1 0 0 1 0 -9 0 0 0 0 0 0 4 4 0 1 0 -8 1 0 0 1 0 0 1 -4 1 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr13.in0000644000175000017500000000037511035141337020506 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 0 -1 0 0 0 0 1 1 0 -1 1 0 0 0 -1 0 0 0 0 0 0 0 0 7 6 0 1 0 0 0 -1 1 0 0 0 1 -1 1 0 0 1 0 -1 1 0 0 0 0 1 1 0 -1 0 1 0 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr4.in0000644000175000017500000000035711035141337020426 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 -1 0 0 0 0 0 1 1 0 -1 1 0 0 0 -1 0 0 0 0 0 0 0 0 6 6 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 0 0 1 -1 1 0 0 0 0 1 0 1 -1 0 0 0 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/loopreorder3.in0000644000175000017500000000021311035141337022056 0ustar sylvestresylvestre# Polylib test file 5 6 0 1 0 0 0 -8 0 0 1 0 0 -4 1 0 0 0 0 1 0 -1 0 1 0 0 1 0 -1 0 1 -1 4 4 0 1 0 -8 1 0 0 1 0 0 1 -4 1 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr19.in0000644000175000017500000000063611035141337020514 0ustar sylvestresylvestre# Polylib test file 10 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 -1 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 -2 0 0 0 -1 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 1 -1 0 0 0 0 1 0 0 0 10 7 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 -1 0 0 1 0 0 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr3.in0000644000175000017500000000037711035141337020427 0ustar sylvestresylvestre# Polylib test file 7 8 1 -1 0 0 0 1 0 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 0 1 -1 1 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 1 0 -1 0 1 0 0 -1 7 6 1 1 0 0 0 -1 1 0 0 0 1 -2 1 -1 0 1 0 0 1 0 0 0 0 1 1 0 -1 0 1 -1 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr20.in0000644000175000017500000000060611035141337020501 0ustar sylvestresylvestre# Polylib test file 9 10 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 1 -1 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 0 0 1 0 0 -1 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 1 1 -1 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 10 7 1 -1 0 0 1 0 0 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 -1 0 1 -1 1 0 0 1 0 0 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr18.in0000644000175000017500000000063611035141337020513 0ustar sylvestresylvestre# Polylib test file 10 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 -1 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 -2 0 0 0 -1 1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 10 7 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 -1 0 0 1 0 0 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr1.in0000644000175000017500000000037611035141337020424 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 1 0 0 0 0 0 -2 0 0 -1 1 0 0 0 0 1 -1 0 0 1 0 0 0 7 6 1 0 0 0 1 -2 1 -1 0 1 0 0 1 1 0 0 0 -1 1 0 0 0 0 1 1 0 1 0 0 -1 1 0 -1 0 1 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr21.in0000644000175000017500000000060711035141337020503 0ustar sylvestresylvestre# Polylib test file 9 10 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 1 -1 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 0 0 1 0 0 -1 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 10 7 1 -1 0 0 1 0 0 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 -1 0 1 -1 1 0 0 1 0 0 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr12.in0000644000175000017500000000056611035141337020507 0ustar sylvestresylvestre# Polylib test file 9 10 0 1 -1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 -1 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 1 0 0 -1 0 0 1 0 0 -1 9 7 1 1 0 0 0 0 -2 1 -1 0 0 1 0 0 1 0 0 0 0 1 -1 1 0 0 0 0 0 1 0 1 -1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/loopreorder1.in0000644000175000017500000000023111035141337022054 0ustar sylvestresylvestre# Polylib test file 6 6 1 1 0 0 0 -1 1 -1 0 0 0 4 1 -1 1 0 0 0 1 0 -1 0 0 8 0 0 0 1 0 -8 1 0 0 0 1 -5 4 4 0 1 0 -8 1 0 0 1 0 0 1 -4 1 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr10.in0000644000175000017500000000056411035141337020503 0ustar sylvestresylvestre# Polylib test file 9 10 0 1 -1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 -1 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 1 -1 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 7 1 1 0 0 0 0 -2 1 -1 0 0 1 0 0 1 0 0 0 0 1 -1 1 0 0 0 0 0 1 0 1 -1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr8.in0000644000175000017500000000036011035141337020424 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 0 1 0 0 0 0 -2 1 0 -1 1 0 0 0 -1 0 0 0 0 0 0 0 0 6 6 1 0 0 0 1 -1 1 1 0 0 0 -2 1 -1 0 1 0 0 1 0 0 0 0 1 0 1 -1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr15.in0000644000175000017500000000037411035141337020507 0ustar sylvestresylvestre# Polylib test file 7 8 0 1 0 0 0 0 0 -1 1 0 1 0 0 0 0 -1 1 0 -1 0 0 0 1 0 1 0 0 0 0 1 0 -1 1 0 0 0 0 0 0 1 1 -1 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 7 6 0 1 0 0 0 -1 1 0 0 1 0 -1 1 0 0 0 1 -1 1 0 0 0 0 1 1 0 -1 0 1 0 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr16.in0000644000175000017500000000037511035141337020511 0ustar sylvestresylvestre# Polylib test file 7 8 0 1 0 0 0 0 0 -1 1 0 1 0 0 0 0 -1 1 0 -1 0 0 0 1 0 1 0 0 0 0 1 0 -1 1 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 1 0 -1 0 1 0 0 -1 7 6 0 1 0 0 0 -1 1 0 0 1 0 -1 1 0 0 0 1 -1 1 0 0 0 0 1 1 0 -1 0 1 0 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/loopreorder2.in0000644000175000017500000000021211035141337022054 0ustar sylvestresylvestre# Polylib test file 5 6 0 1 0 0 0 -8 0 0 1 0 0 -4 1 0 0 0 0 1 1 -1 0 1 0 -1 0 0 0 0 0 0 4 4 0 1 0 -8 1 0 0 1 0 0 1 -4 1 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr7.in0000644000175000017500000000035711035141337020431 0ustar sylvestresylvestre# Polylib test file 7 8 0 1 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 1 0 0 0 0 0 1 -1 1 0 1 0 0 0 0 -1 1 0 0 0 0 0 0 1 0 -1 0 1 0 0 0 0 1 0 -1 0 1 0 0 -1 6 6 1 0 0 0 1 -1 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 0 0 0 1 0 1 -1 0 0 0 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr22.in0000644000175000017500000000061011035141337020476 0ustar sylvestresylvestre# Polylib test file 9 10 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 1 -1 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 0 0 1 0 0 -1 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 1 0 0 -1 0 0 1 0 0 -1 10 7 1 -1 0 0 1 0 0 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 -1 0 1 -1 1 0 0 1 0 0 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr5.in0000644000175000017500000000036011035141337020421 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 -1 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 1 0 -1 0 1 0 0 -1 6 6 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 0 0 1 -1 1 0 0 0 0 1 0 1 -1 0 0 0 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr6.in0000644000175000017500000000035611035141337020427 0ustar sylvestresylvestre# Polylib test file 7 8 0 1 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 1 0 0 0 0 0 1 -1 1 0 1 0 0 0 0 -1 1 0 0 0 0 0 0 1 1 -1 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 6 6 1 0 0 0 1 -1 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 0 0 0 1 0 1 -1 0 0 0 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr9.in0000644000175000017500000000036111035141337020426 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 0 1 0 0 0 0 -2 0 0 -1 1 0 0 0 0 1 0 -1 0 1 0 0 -1 6 6 1 0 0 0 1 -1 1 1 0 0 0 -2 1 -1 0 1 0 0 1 0 0 0 0 1 0 1 -1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr17.in0000644000175000017500000000063511035141337020511 0ustar sylvestresylvestre# Polylib test file 10 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 -1 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 10 7 1 1 0 0 0 0 -2 1 0 0 0 0 1 -2 1 -1 0 0 1 0 0 1 0 0 0 0 0 1 1 1 -1 0 0 0 -1 1 0 1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr2.in0000644000175000017500000000037611035141337020425 0ustar sylvestresylvestre# Polylib test file 7 8 1 -1 0 0 0 1 0 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 0 1 -1 1 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 1 1 -1 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 7 6 1 1 0 0 0 -1 1 0 0 0 1 -2 1 -1 0 1 0 0 1 0 0 0 0 1 1 0 -1 0 1 -1 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr14.in0000644000175000017500000000037611035141337020510 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 0 -1 0 0 0 0 1 0 0 -1 1 0 0 0 0 1 -1 0 0 1 0 0 -1 7 6 0 1 0 0 0 -1 1 0 0 0 1 -1 1 0 0 1 0 -1 1 0 0 0 0 1 1 0 -1 0 1 0 1 0 1 0 0 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr0.in0000644000175000017500000000037611035141337020423 0ustar sylvestresylvestre# Polylib test file 7 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 1 0 0 1 1 0 0 0 0 0 -2 1 0 -1 1 0 0 0 -1 0 0 0 0 0 0 0 0 7 6 1 0 0 0 1 -2 1 -1 0 1 0 0 1 1 0 0 0 -1 1 0 0 0 0 1 1 0 1 0 0 -1 1 0 -1 0 1 -1 1 0 0 0 0 1 polylib-5.22.5.orig/Test/cases/QRvr11.in0000644000175000017500000000056511035141337020505 0ustar sylvestresylvestre# Polylib test file 9 10 0 1 -1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 -1 1 0 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 9 7 1 1 0 0 0 0 -2 1 -1 0 0 1 0 0 1 0 0 0 0 1 -1 1 0 0 0 0 0 1 0 1 -1 0 0 0 -1 1 0 0 0 0 0 1 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/Makefile.in0000644000175000017500000004240011341231331020054 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir ETAGS = etags CTAGS = ctags DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ EXTRA_DIST = cases old others SUBDIRS = Zpolytest ehrhart ehrhart_union ranking general pp all: all-recursive .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook check-am: all-am check: check-recursive all-am: Makefile installdirs: installdirs-recursive installdirs-am: install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-recursive -rm -f Makefile distclean-am: clean-am distclean-generic distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \ install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am check check-am clean clean-generic clean-libtool \ ctags ctags-recursive dist-hook distclean distclean-generic \ distclean-libtool distclean-tags distdir dvi dvi-am html \ html-am info info-am install install-am install-data \ install-data-am install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-man install-pdf install-pdf-am \ install-ps install-ps-am install-strip installcheck \ installcheck-am installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am tests: @for BITS in $(ALL_BITS); do \ echo "Performing $$BITS tests"; \ for d in $(SUBDIRS); do \ (cd $$d; $(MAKE) TEST_BITS=$$BITS tests) \ done \ done long_tests: @for BITS in $(ALL_BITS); do \ echo "Performing $$BITS tests"; \ (cd ehrhart; $(MAKE) TEST_BITS=$$BITS longtest) \ done dist-hook: rm -rf `find $(distdir) -name CVS` # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/general/0000755000175000017500000000000011341243124017427 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/general/simpl4.out0000644000175000017500000000012211035141337021366 0ustar sylvestresylvestre3 5 1 1 0 0 -1 1 -1 0 0 10 1 0 -1 0 10 polylib-5.22.5.orig/Test/general/convex2.out0000644000175000017500000000024011035141337021543 0ustar sylvestresylvestre6 5 1 0 0 1 -2 1 -1 0 1 0 1 0 -1 1 0 1 1 0 0 -1 1 0 1 0 0 1 0 0 0 1 polylib-5.22.5.orig/Test/general/simpl6.out0000644000175000017500000000012211035141337021370 0ustar sylvestresylvestre3 5 0 0 1 0 1 0 0 0 1 -3 1 0 0 0 1 polylib-5.22.5.orig/Test/general/Makefile.in0000644000175000017500000002510211341231332021472 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.3 2007/02/21 21:26:35 skimo Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/general DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) GENERAL = \ convex1.in \ convex2.in \ gauss1.in \ herve.in \ simpl1.in \ simpl2.in \ simpl3.in \ simpl4.in \ simpl5.in \ simpl6.in \ simpl7.in \ simpl8.in \ simpl9.in \ test1.in EXTRA_DIST = $(GENERAL) \ $(GENERAL:%.in=%.out) CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/general/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/general/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am # test.in tests: @failedtest=0; \ for x in $(GENERAL) ; do \ echo "Verify file $$x"; \ $(OBJ_DIR)/polytest$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test polytest works correctly"; \ fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/general/simpl7.out0000644000175000017500000000003111035141337021370 0ustar sylvestresylvestre1 4 1 0 0 1 polylib-5.22.5.orig/Test/general/simpl5.out0000644000175000017500000000007011035141337021371 0ustar sylvestresylvestre2 5 1 1 0 0 -28 1 -1 0 0 31 polylib-5.22.5.orig/Test/general/simpl6.in0000644000175000017500000000067611035141337021205 0ustar sylvestresylvestre# {Z,t,p|Z=1;t+1=0;p=3} D 1 4 5 0 1 0 0 -1 0 0 1 0 1 0 0 0 1 -3 1 0 0 0 1 # {Z,t,p|Z=1;t+p=2;p>=0;3>=p} D 1 4 5 0 1 0 0 -1 0 0 1 1 -2 1 0 0 1 0 1 0 0 -1 3 F 2 dom3 = DomSimplify[readDom["{Z,t,p|Z=1;t+1=0;p=3}"], readDom["{Z,t,p|Z=1;t+p=2;p>=0;3>=p}"]] (*answer = domain[3, {Z, t, p}, {pol[3, 2, 2, 1, {{0, 0, 1, 0, 1}, {0, 0, 0, 1, -3}, {1, 0, 0, 0, 1}}, {{0, 1, 0, 0, 0}, {1, 0, -1, 3, 1}}]}] {Z,t,p|t+1=0;p-3=0} *) polylib-5.22.5.orig/Test/general/simpl3.in0000644000175000017500000000073611035141337021177 0ustar sylvestresylvestre# {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0} D 1 5 5 0 0 0 1 0 1 0 1 0 -1 1 1 0 0 -1 1 0 -1 0 10 1 -1 0 0 10 # {i,j,k|k=0;i+j>=25; i<=25; j<=25} D 1 4 5 0 0 0 1 0 1 1 1 0 -25 1 -1 0 0 25 1 0 -1 0 25 F 2 DomSimplify[readDom["{i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0}"], readDom["{i,j,k|k=0;i+j>=25; i<=25; j<=25}"]] (* answer = domain[3, {i, j, k}, {pol[4, 0, 4, 0, {{0, 1, 0, 0, 0}, {0, 0, 1, 0, 0}, {0, 0, 0, 1, 0}, {0, 0, 0, 0, 1}}, {}]} ] {i,j,k|1=0} *) polylib-5.22.5.orig/Test/general/test1.out0000644000175000017500000000050011035141337021216 0ustar sylvestresylvestre6 5 1 0 0 1 0 1 0 1 0 -1 1 1 -1 0 0 1 1 0 -32 0 1 -1 0 32 31 1 -1 0 0 128 6 5 1 0 0 1 0 1 1 -1 0 0 1 1 0 -32 0 1 -1 0 32 31 1 -1 0 0 128 1 0 1 0 -1 polylib-5.22.5.orig/Test/general/herve.out0000644000175000017500000005135511035141337021305 0ustar sylvestresylvestre262 16 1 0 1 0 0 0 0 0 0 0 0 -5 0 0 0 0 1 -5 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 80 -18 400 0 40 800 20 60 800 820 80 -15 410 10 20 1 80 22 390 380 800 20 780 820 20 40 80 23 400 390 20 1 40 11 395 190 400 400 390 410 400 410 40 12 395 200 10 1 80 -15 20 10 40 20 20 60 20 40 80 -14 20 20 20 1 16 -3 82 2 8 160 4 12 160 164 16 -3 84 2 4 1 80 -15 410 10 40 800 20 60 800 820 80 -14 420 20 20 1 80 23 400 390 800 20 780 820 20 40 80 23 410 390 20 1 80 23 790 390 800 800 780 820 800 820 80 23 800 390 20 1 80 23 790 390 800 800 780 820 800 820 80 24 800 400 20 1 80 23 400 390 800 20 780 820 20 40 80 24 410 400 20 1 80 -15 20 10 40 20 20 60 20 40 80 -14 30 20 20 1 16 -3 4 2 8 4 4 12 4 8 16 -3 6 2 4 1 16 -3 4 2 8 4 4 12 4 8 16 -3 4 2 4 1 16 -3 82 2 8 160 4 12 160 164 16 -3 82 2 4 1 80 -15 410 10 40 800 20 60 800 820 80 -14 410 20 20 1 80 23 400 390 800 20 780 820 20 40 80 23 400 390 20 1 80 23 790 390 800 800 780 820 800 820 80 23 790 390 20 1 80 23 790 390 800 800 780 820 800 820 80 24 790 400 20 1 80 23 400 390 800 20 780 820 20 40 80 24 400 400 20 1 40 11 200 190 400 10 390 410 10 20 40 12 200 200 10 1 40 -8 10 0 20 10 10 30 10 20 40 -7 10 10 10 1 80 -16 410 0 40 800 20 60 800 820 80 -15 420 10 20 1 40 -8 205 0 20 400 10 30 400 410 40 -7 210 10 10 1 80 22 400 380 800 20 780 820 20 40 80 23 410 390 20 1 80 22 790 380 800 800 780 820 800 820 80 23 800 390 20 1 40 11 395 190 400 400 390 410 400 410 40 12 400 200 10 1 40 11 200 190 400 10 390 410 10 20 40 12 205 200 10 1 40 -8 10 0 20 10 10 30 10 20 40 -7 15 10 10 1 80 -16 20 0 40 20 20 60 20 40 80 -15 30 10 20 1 80 -16 20 0 40 20 20 60 20 40 80 -15 20 10 20 1 80 -16 410 0 40 800 20 60 800 820 80 -15 410 10 20 1 40 -8 205 0 20 400 10 30 400 410 40 -7 205 10 10 1 80 22 400 380 800 20 780 820 20 40 80 23 400 390 20 1 80 22 790 380 800 800 780 820 800 820 80 23 790 390 20 1 80 22 780 380 800 800 780 820 800 820 80 23 790 390 20 1 40 11 390 190 400 400 390 410 400 410 40 12 395 200 10 1 80 -15 10 10 40 20 20 60 20 40 80 -14 20 20 20 1 16 -3 80 2 8 160 4 12 160 164 16 -3 84 2 4 1 80 -15 400 10 40 800 20 60 800 820 80 -14 420 20 20 1 80 23 390 390 800 20 780 820 20 40 80 23 410 390 20 1 80 23 780 390 800 800 780 820 800 820 80 23 800 390 20 1 80 23 780 390 800 800 780 820 800 820 80 24 800 400 20 1 80 23 390 390 800 20 780 820 20 40 80 24 410 400 20 1 80 -15 10 10 40 20 20 60 20 40 80 -14 30 20 20 1 16 -3 2 2 8 4 4 12 4 8 16 -3 6 2 4 1 16 -3 2 2 8 4 4 12 4 8 16 -3 4 2 4 1 16 -3 80 2 8 160 4 12 160 164 16 -3 82 2 4 1 80 -15 400 10 40 800 20 60 800 820 80 -14 410 20 20 1 80 23 390 390 800 20 780 820 20 40 80 23 400 390 20 1 80 23 780 390 800 800 780 820 800 820 80 23 790 390 20 1 80 23 780 390 800 800 780 820 800 820 80 24 790 400 20 1 80 23 390 390 800 20 780 820 20 40 80 24 400 400 20 1 40 11 195 190 400 10 390 410 10 20 40 12 200 200 10 1 40 -8 5 0 20 10 10 30 10 20 40 -7 10 10 10 1 80 -16 400 0 40 800 20 60 800 820 80 -15 420 10 20 1 40 -8 200 0 20 400 10 30 400 410 40 -7 210 10 10 1 80 22 390 380 800 20 780 820 20 40 80 23 410 390 20 1 80 22 780 380 800 800 780 820 800 820 80 23 800 390 20 1 40 11 390 190 400 400 390 410 400 410 40 12 400 200 10 1 40 11 195 190 400 10 390 410 10 20 40 12 205 200 10 1 40 -8 5 0 20 10 10 30 10 20 40 -7 15 10 10 1 80 -16 10 0 40 20 20 60 20 40 80 -15 30 10 20 1 80 -16 10 0 40 20 20 60 20 40 80 -15 20 10 20 1 80 -16 400 0 40 800 20 60 800 820 80 -15 410 10 20 1 40 -8 200 0 20 400 10 30 400 410 40 -7 205 10 10 1 40 -9 200 0 20 400 10 30 400 410 40 -7 205 10 10 1 80 20 390 380 800 20 780 820 20 40 80 23 400 390 20 1 40 10 395 190 400 400 390 410 400 410 40 12 395 200 10 1 80 -17 20 10 40 20 20 60 20 40 80 -14 20 20 20 1 80 -17 410 10 40 800 20 60 800 820 80 -15 420 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -14 420 20 20 1 80 21 400 390 800 20 780 820 20 40 80 23 410 390 20 1 80 21 790 390 800 800 780 820 800 820 80 23 800 390 20 1 80 21 790 390 800 800 780 820 800 820 80 24 800 400 20 1 80 21 400 390 800 20 780 820 20 40 80 24 410 400 20 1 80 -17 20 10 40 20 20 60 20 40 80 -14 30 20 20 1 80 -17 20 10 40 20 20 60 20 40 80 -15 30 10 20 1 80 -17 20 10 40 20 20 60 20 40 80 -15 20 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -15 410 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -14 410 20 20 1 80 21 400 390 800 20 780 820 20 40 80 23 400 390 20 1 80 21 790 390 800 800 780 820 800 820 80 23 790 390 20 1 80 21 790 390 800 800 780 820 800 820 80 24 790 400 20 1 80 21 400 390 800 20 780 820 20 40 80 24 400 400 20 1 20 5 100 95 200 5 195 205 5 10 20 6 100 100 5 1 40 -9 10 0 20 10 10 30 10 20 40 -7 10 10 10 1 80 -18 410 0 40 800 20 60 800 820 80 -15 420 10 20 1 40 -9 205 0 20 400 10 30 400 410 40 -7 210 10 10 1 80 20 400 380 800 20 780 820 20 40 80 23 410 390 20 1 80 20 790 380 800 800 780 820 800 820 80 23 800 390 20 1 40 10 395 190 400 400 390 410 400 410 40 12 400 200 10 1 40 10 200 190 400 10 390 410 10 20 40 12 205 200 10 1 40 -9 10 0 20 10 10 30 10 20 40 -7 15 10 10 1 80 -18 20 0 40 20 20 60 20 40 80 -15 30 10 20 1 80 -18 20 0 40 20 20 60 20 40 80 -15 20 10 20 1 80 -18 410 0 40 800 20 60 800 820 80 -15 410 10 20 1 40 -9 205 0 20 400 10 30 400 410 40 -7 205 10 10 1 80 20 400 380 800 20 780 820 20 40 80 23 400 390 20 1 80 20 790 380 800 800 780 820 800 820 80 23 790 390 20 1 80 20 780 380 800 800 780 820 800 820 80 23 790 390 20 1 40 10 390 190 400 400 390 410 400 410 40 12 395 200 10 1 80 -17 10 10 40 20 20 60 20 40 80 -14 20 20 20 1 80 -17 400 10 40 800 20 60 800 820 80 -15 420 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -14 420 20 20 1 80 21 390 390 800 20 780 820 20 40 80 23 410 390 20 1 80 21 780 390 800 800 780 820 800 820 80 23 800 390 20 1 80 21 780 390 800 800 780 820 800 820 80 24 800 400 20 1 80 21 390 390 800 20 780 820 20 40 80 24 410 400 20 1 80 -17 10 10 40 20 20 60 20 40 80 -14 30 20 20 1 80 -17 10 10 40 20 20 60 20 40 80 -15 30 10 20 1 80 -17 10 10 40 20 20 60 20 40 80 -15 20 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -15 410 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -14 410 20 20 1 80 21 390 390 800 20 780 820 20 40 80 23 400 390 20 1 80 21 780 390 800 800 780 820 800 820 80 23 790 390 20 1 80 21 780 390 800 800 780 820 800 820 80 24 790 400 20 1 80 21 390 390 800 20 780 820 20 40 80 24 400 400 20 1 40 10 195 190 400 10 390 410 10 20 40 12 200 200 10 1 40 -9 5 0 20 10 10 30 10 20 40 -7 10 10 10 1 80 -18 400 0 40 800 20 60 800 820 80 -15 420 10 20 1 40 -9 200 0 20 400 10 30 400 410 40 -7 210 10 10 1 80 20 390 380 800 20 780 820 20 40 80 23 410 390 20 1 80 20 780 380 800 800 780 820 800 820 80 23 800 390 20 1 20 5 195 95 200 200 195 205 200 205 20 6 200 100 5 1 40 10 195 190 400 10 390 410 10 20 40 12 205 200 10 1 40 -9 5 0 20 10 10 30 10 20 40 -7 15 10 10 1 80 -18 10 0 40 20 20 60 20 40 80 -15 30 10 20 1 80 -18 10 0 40 20 20 60 20 40 80 -15 20 10 20 1 80 -18 10 0 40 20 20 60 20 40 80 -17 20 10 20 1 80 -18 400 0 40 800 20 60 800 820 80 -17 410 10 20 1 80 22 390 380 800 20 780 820 20 40 80 21 400 390 20 1 40 11 395 190 400 400 390 410 400 410 40 11 395 200 10 1 80 -15 20 10 40 20 20 60 20 40 80 -16 20 20 20 1 80 -15 410 10 40 800 20 60 800 820 80 -17 420 10 20 1 80 -15 410 10 40 800 20 60 800 820 80 -16 420 20 20 1 80 23 400 390 800 20 780 820 20 40 80 21 410 390 20 1 80 23 790 390 800 800 780 820 800 820 80 21 800 390 20 1 80 23 790 390 800 800 780 820 800 820 80 22 800 400 20 1 80 23 400 390 800 20 780 820 20 40 80 22 410 400 20 1 80 -15 20 10 40 20 20 60 20 40 80 -16 30 20 20 1 80 -15 20 10 40 20 20 60 20 40 80 -17 30 10 20 1 80 -15 20 10 40 20 20 60 20 40 80 -17 20 10 20 1 80 -15 410 10 40 800 20 60 800 820 80 -17 410 10 20 1 80 -15 410 10 40 800 20 60 800 820 80 -16 410 20 20 1 80 23 400 390 800 20 780 820 20 40 80 21 400 390 20 1 80 23 790 390 800 800 780 820 800 820 80 21 790 390 20 1 80 23 790 390 800 800 780 820 800 820 80 22 790 400 20 1 80 23 400 390 800 20 780 820 20 40 80 22 400 400 20 1 40 11 200 190 400 10 390 410 10 20 40 11 200 200 10 1 20 -4 5 0 10 5 5 15 5 10 20 -4 5 5 5 1 80 -16 410 0 40 800 20 60 800 820 80 -17 420 10 20 1 40 -8 205 0 20 400 10 30 400 410 40 -8 210 10 10 1 80 22 400 380 800 20 780 820 20 40 80 21 410 390 20 1 80 22 790 380 800 800 780 820 800 820 80 21 800 390 20 1 40 11 395 190 400 400 390 410 400 410 40 11 400 200 10 1 40 11 200 190 400 10 390 410 10 20 40 11 205 200 10 1 40 -8 10 0 20 10 10 30 10 20 40 -8 15 10 10 1 80 -16 20 0 40 20 20 60 20 40 80 -17 30 10 20 1 80 -16 20 0 40 20 20 60 20 40 80 -17 20 10 20 1 80 -16 410 0 40 800 20 60 800 820 80 -17 410 10 20 1 40 -8 205 0 20 400 10 30 400 410 40 -8 205 10 10 1 80 22 400 380 800 20 780 820 20 40 80 21 400 390 20 1 80 22 790 380 800 800 780 820 800 820 80 21 790 390 20 1 80 22 780 380 800 800 780 820 800 820 80 21 790 390 20 1 40 11 390 190 400 400 390 410 400 410 40 11 395 200 10 1 80 -15 10 10 40 20 20 60 20 40 80 -16 20 20 20 1 80 -15 400 10 40 800 20 60 800 820 80 -17 420 10 20 1 80 -15 400 10 40 800 20 60 800 820 80 -16 420 20 20 1 80 23 390 390 800 20 780 820 20 40 80 21 410 390 20 1 80 23 780 390 800 800 780 820 800 820 80 21 800 390 20 1 80 23 780 390 800 800 780 820 800 820 80 22 800 400 20 1 80 23 390 390 800 20 780 820 20 40 80 22 410 400 20 1 80 -15 10 10 40 20 20 60 20 40 80 -16 30 20 20 1 80 -15 10 10 40 20 20 60 20 40 80 -17 30 10 20 1 80 -15 10 10 40 20 20 60 20 40 80 -17 20 10 20 1 80 -15 400 10 40 800 20 60 800 820 80 -17 410 10 20 1 80 -15 400 10 40 800 20 60 800 820 80 -16 410 20 20 1 80 23 390 390 800 20 780 820 20 40 80 21 400 390 20 1 80 23 780 390 800 800 780 820 800 820 80 21 790 390 20 1 80 23 780 390 800 800 780 820 800 820 80 22 790 400 20 1 80 23 390 390 800 20 780 820 20 40 80 22 400 400 20 1 40 11 195 190 400 10 390 410 10 20 40 11 200 200 10 1 40 -8 5 0 20 10 10 30 10 20 40 -8 10 10 10 1 80 -16 400 0 40 800 20 60 800 820 80 -17 420 10 20 1 20 -4 100 0 10 200 5 15 200 205 20 -4 105 5 5 1 80 22 390 380 800 20 780 820 20 40 80 21 410 390 20 1 80 22 780 380 800 800 780 820 800 820 80 21 800 390 20 1 40 11 390 190 400 400 390 410 400 410 40 11 400 200 10 1 40 11 195 190 400 10 390 410 10 20 40 11 205 200 10 1 40 -8 5 0 20 10 10 30 10 20 40 -8 15 10 10 1 80 -16 10 0 40 20 20 60 20 40 80 -17 30 10 20 1 80 -16 10 0 40 20 20 60 20 40 80 -17 20 10 20 1 80 -16 400 0 40 800 20 60 800 820 80 -17 410 10 20 1 40 -8 200 0 20 400 10 30 400 410 40 -8 205 10 10 1 40 -9 200 0 20 400 10 30 400 410 40 -8 205 10 10 1 80 20 390 380 800 20 780 820 20 40 80 21 400 390 20 1 40 10 395 190 400 400 390 410 400 410 40 11 395 200 10 1 80 -17 20 10 40 20 20 60 20 40 80 -16 20 20 20 1 80 -17 410 10 40 800 20 60 800 820 80 -17 420 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -16 420 20 20 1 80 21 400 390 800 20 780 820 20 40 80 21 410 390 20 1 80 21 790 390 800 800 780 820 800 820 80 21 800 390 20 1 80 21 790 390 800 800 780 820 800 820 80 22 800 400 20 1 80 21 400 390 800 20 780 820 20 40 80 22 410 400 20 1 80 -17 20 10 40 20 20 60 20 40 80 -16 30 20 20 1 80 -17 20 10 40 20 20 60 20 40 80 -17 30 10 20 1 80 -17 20 10 40 20 20 60 20 40 80 -17 20 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -17 410 10 20 1 80 -17 410 10 40 800 20 60 800 820 80 -16 410 20 20 1 80 21 400 390 800 20 780 820 20 40 80 21 400 390 20 1 80 21 790 390 800 800 780 820 800 820 80 21 790 390 20 1 80 21 790 390 800 800 780 820 800 820 80 22 790 400 20 1 80 21 400 390 800 20 780 820 20 40 80 22 400 400 20 1 40 10 200 190 400 10 390 410 10 20 40 11 200 200 10 1 40 -9 10 0 20 10 10 30 10 20 40 -8 10 10 10 1 80 -18 410 0 40 800 20 60 800 820 80 -17 420 10 20 1 40 -9 205 0 20 400 10 30 400 410 40 -8 210 10 10 1 80 20 400 380 800 20 780 820 20 40 80 21 410 390 20 1 80 20 790 380 800 800 780 820 800 820 80 21 800 390 20 1 40 10 395 190 400 400 390 410 400 410 40 11 400 200 10 1 40 10 200 190 400 10 390 410 10 20 40 11 205 200 10 1 40 -9 10 0 20 10 10 30 10 20 40 -8 15 10 10 1 80 -18 20 0 40 20 20 60 20 40 80 -17 30 10 20 1 80 -18 20 0 40 20 20 60 20 40 80 -17 20 10 20 1 80 -18 410 0 40 800 20 60 800 820 80 -17 410 10 20 1 40 -9 205 0 20 400 10 30 400 410 40 -8 205 10 10 1 80 20 400 380 800 20 780 820 20 40 80 21 400 390 20 1 80 20 790 380 800 800 780 820 800 820 80 21 790 390 20 1 80 20 780 380 800 800 780 820 800 820 80 21 790 390 20 1 40 10 390 190 400 400 390 410 400 410 40 11 395 200 10 1 80 -17 10 10 40 20 20 60 20 40 80 -16 20 20 20 1 80 -17 400 10 40 800 20 60 800 820 80 -17 420 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -16 420 20 20 1 80 21 390 390 800 20 780 820 20 40 80 21 410 390 20 1 80 21 780 390 800 800 780 820 800 820 80 21 800 390 20 1 80 21 780 390 800 800 780 820 800 820 80 22 800 400 20 1 80 21 390 390 800 20 780 820 20 40 80 22 410 400 20 1 80 -17 10 10 40 20 20 60 20 40 80 -16 30 20 20 1 80 -17 10 10 40 20 20 60 20 40 80 -17 30 10 20 1 80 -17 10 10 40 20 20 60 20 40 80 -17 20 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -17 410 10 20 1 80 -17 400 10 40 800 20 60 800 820 80 -16 410 20 20 1 80 21 390 390 800 20 780 820 20 40 80 21 400 390 20 1 80 21 780 390 800 800 780 820 800 820 80 21 790 390 20 1 80 21 780 390 800 800 780 820 800 820 80 22 790 400 20 1 80 21 390 390 800 20 780 820 20 40 80 22 400 400 20 1 40 10 195 190 400 10 390 410 10 20 40 11 200 200 10 1 40 -9 5 0 20 10 10 30 10 20 40 -8 10 10 10 1 80 -18 400 0 40 800 20 60 800 820 80 -17 420 10 20 1 40 -9 200 0 20 400 10 30 400 410 40 -8 210 10 10 1 80 20 390 380 800 20 780 820 20 40 80 21 410 390 20 1 80 20 780 380 800 800 780 820 800 820 80 21 800 390 20 1 40 10 390 190 400 400 390 410 400 410 40 11 400 200 10 1 40 10 195 190 400 10 390 410 10 20 40 11 205 200 10 1 40 -9 5 0 20 10 10 30 10 20 40 -8 15 10 10 1 80 -18 10 0 40 20 20 60 20 40 80 -17 30 10 20 polylib-5.22.5.orig/Test/general/gauss1.in0000644000175000017500000000030011035141337021156 0ustar sylvestresylvestre# mat1=readMat["(t,p->t-2p)"]; # dom0=readDom["{t,p| p=0}"]; # DomMatrixSimplify[mat1,DomEqualities[dom1]] # D1 = readDom["{j,N | 0<=j<=N-1; 2<=N}"] M 1 1 3 0 1 0 M 1 2 3 1 -2 0 0 0 1 F 10 polylib-5.22.5.orig/Test/general/simpl4.in0000644000175000017500000000126511035141337021176 0ustar sylvestresylvestre# {i,j,k | k=0; 1<=i<=10; 1<=j<=10} D 1 5 5 0 0 0 1 0 1 1 0 0 -1 1 -1 0 0 10 1 0 1 0 -1 1 0 -1 0 10 # {i,j,k | k=0; i+j>=25; i<=25; j<=25} | # {i,j,k | k=0; 2<=j<=9; 0<=i<=2} D 2 4 5 0 0 0 1 0 1 1 1 0 -25 1 -1 0 0 25 1 0 -1 0 25 5 5 0 0 0 1 0 1 0 1 0 -2 1 0 -1 0 9 1 1 0 0 0 1 -1 0 0 2 F 2 DomSimplify[readDom["{i,j,k | k=0; 1<=i<=10; 1<=j<=10}"], readDom["{i,j,k | k=0; i+j>=25; i<=25; j<=25} | {i,j,k | k=0; 2<=j<=9; 0<=i<=2}"]] (*answer = domain[3, {i, j, k}, {pol[3, 4, 0, 1, {{1, 1, 0, 0, -1}, {1, -1, 0, 0, 10}, {1, 0, -1, 0, 10}}, {{0, 0, 0, 1, 0}, {1, 0, -1, 0, 0}, {1, 1, 10, 0, 1}, {1, 10, 10, 0, 1}}]} ] {i,j,k|i-1>=0;-i+10>=0;-j+10>=0} *) polylib-5.22.5.orig/Test/general/simpl7.in0000644000175000017500000000045011035141337021174 0ustar sylvestresylvestre# A = readDom["{i,j|j>=i}"] D 1 2 4 1 -1 1 0 1 0 0 1 # B = readDom["{i,j|i=j}"] D 1 2 4 0 1 -1 0 1 0 0 1 F 2 DomSimplify[readDom["{i,j|j>=i}"],readDom["{i,j|i=j}"]] (* answer ={i,j | 1>=0} domain[2, {i, j}, {pol[1, 3, 0, 2, {{1, 0, 0, 1}}, {{0, 1, 0, 0}, {0, 0, 1, 0}, {1, 0, 0, 1}}]}] *) polylib-5.22.5.orig/Test/general/gauss1.out0000644000175000017500000000004411035141337021364 0ustar sylvestresylvestre2 3 1 0 0 0 0 1 polylib-5.22.5.orig/Test/general/simpl9.out0000644000175000017500000000007011035141337021375 0ustar sylvestresylvestre2 5 1 1 -1 0 0 1 0 0 0 1 polylib-5.22.5.orig/Test/general/simpl1.out0000644000175000017500000000007011035141337021365 0ustar sylvestresylvestre2 5 0 0 0 1 0 1 0 0 0 1 polylib-5.22.5.orig/Test/general/simpl1.in0000644000175000017500000000137711035141337021177 0ustar sylvestresylvestre# A = {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0} D 1 5 5 0 0 0 1 0 1 0 1 0 -1 1 1 0 0 -1 1 0 -1 0 10 1 -1 0 0 10 # B = {i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0} | # {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0} D 2 6 5 1 1 0 0 -1 1 0 0 1 -1 1 0 1 0 -1 1 -1 0 0 10 1 0 0 -1 10 1 0 -1 0 10 5 5 0 0 0 1 0 1 0 1 0 -1 1 1 0 0 -1 1 0 -1 0 10 1 -1 0 0 10 F 2 DomSimplify[readDom["{i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0}"], readDom["{i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0} | {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0}"] ] (* answer = domain[3, {i, j, k}, {pol[2, 3, 1, 2, {{0, 0, 0, 1, 0}, {1, 0, 0, 0, 1}}, {{0, 1, 0, 0, 0}, {0, 0, 1, 0, 0}, {1, 0, 0, 0, 1}}]}] {i,j,k|k=0} *) polylib-5.22.5.orig/Test/general/herve.in0000644000175000017500000000313411035141337021074 0ustar sylvestresylvestre# Herve's Polyhedron # From: Herve Leverge D 1 25 16 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 40 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 -1 1 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 -1 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 2 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 40 1 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 1 0 0 0 0 1 1 0 0 0 0 0 0 -2 0 0 1 0 0 0 0 -1 -1 0 0 0 0 0 0 2 0 1 1 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 2 -1 0 0 0 0 0 0 0 0 0 2 1 0 0 -2 0 1 1 0 0 0 0 0 0 0 0 -1 1 0 0 2 0 -1 -1 0 0 0 0 0 0 0 0 2 1 0 -10 0 1 0 0 0 0 0 0 -2 0 0 0 0 1 0 10 0 -1 0 0 0 0 0 0 2 0 0 0 1 1 -2 0 0 0 0 0 0 0 0 0 0 -10 0 1 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 4 1 2 0 0 0 0 0 0 0 0 0 0 10 0 -1 1 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 4 D 0 F 4 polylib-5.22.5.orig/Test/general/simpl2.out0000644000175000017500000000007011035141337021366 0ustar sylvestresylvestre2 5 1 0 0 1 -1 1 0 0 0 1 polylib-5.22.5.orig/Test/general/simpl8.in0000644000175000017500000000004311035141337021173 0ustar sylvestresylvestreD 1 1 3 1 1 0 D 1 1 3 1 -1 0 F 2 polylib-5.22.5.orig/Test/general/simpl2.in0000644000175000017500000000143511035141337021173 0ustar sylvestresylvestre# {i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0} D 1 6 5 1 1 0 0 -1 1 0 0 1 -1 1 0 1 0 -1 1 -1 0 0 10 1 0 0 -1 10 1 0 -1 0 10 # {i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0} | # {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0} D 2 6 5 1 1 0 0 -1 1 0 0 1 -1 1 0 1 0 -1 1 -1 0 0 10 1 0 0 -1 10 1 0 -1 0 10 5 5 0 0 0 1 0 1 0 1 0 -1 1 1 0 0 -1 1 0 -1 0 10 1 -1 0 0 10 F 2 DomSimplify[readDom["{i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0}"], readDom["{i,j,k|i-1>=0;k-1>=0;j-1>=0;-i+10>=0;-k+10>=0;-j+10>=0} | {i,j,k|k=0;j-1>=0;i-1>=0;-j+10>=0;-i+10>=0}"] ] (* answer = domain[3, {i, j, k}, {pol[2, 4, 0, 2, {{1, 0, 0, 1, -1}, {1, 0, 0, 0, 1}}, {{0, 1, 0, 0, 0}, {0, 0, 1, 0, 0}, {1, 0, 0, 1, 0}, {1, 0, 0, 1, 1}}]}] {i,j,k|k-1>=0} *) polylib-5.22.5.orig/Test/general/Makefile.am0000644000175000017500000000157011341227526021476 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.3 2007/02/21 21:26:35 skimo Exp $ # OBJ_DIR = $(top_builddir) GENERAL = \ convex1.in \ convex2.in \ gauss1.in \ herve.in \ simpl1.in \ simpl2.in \ simpl3.in \ simpl4.in \ simpl5.in \ simpl6.in \ simpl7.in \ simpl8.in \ simpl9.in \ test1.in EXTRA_DIST = $(GENERAL) \ $(GENERAL:%.in=%.out) # test.in tests: @failedtest=0; \ for x in $(GENERAL) ; do \ echo "Verify file $$x"; \ $(OBJ_DIR)/polytest$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test polytest works correctly"; \ fi CLEANFILES=xyz polylib-5.22.5.orig/Test/general/convex2.in0000644000175000017500000000057111035141337021351 0ustar sylvestresylvestre# D1 = readDom["{i,j,N | 1<=i<=N; 0<=j<=N-1; 2<=N}"] D 1 6 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 -1 1 0 0 1 -2 1 0 0 0 1 # D2 = readDom["{i,j,N | 1<=i<=N; 1<=j<=N; 2<=N}"] D 1 6 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 1 -2 1 0 0 0 1 F 1 # D12 = DomConvex[DomUnion[D1,D2]] # ashow[D12] = {i,j,N | 1<=i<=N; 0<=j<=N; 2<=N} polylib-5.22.5.orig/Test/general/simpl3.out0000644000175000017500000000015411035141337021372 0ustar sylvestresylvestre4 5 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 polylib-5.22.5.orig/Test/general/convex1.in0000644000175000017500000000042311035141337021344 0ustar sylvestresylvestre# D1 = readDom["{j,N | 0<=j<=N-1; 2<=N}"] D 1 4 4 1 1 0 0 1 -1 1 -1 1 0 1 -2 1 0 0 1 # D2 = readDom["{j, N | 1<=j<=N; 2<=N}"] D 1 4 4 1 1 0 -1 1 -1 1 0 1 0 1 -2 1 0 0 1 F 1 # D12 = DomConvex[DomUnion[D1,D2]] # ashow[D12] = {j,N | 0<=j<=N; 2<=N} polylib-5.22.5.orig/Test/general/simpl5.in0000644000175000017500000000147611035141337021203 0ustar sylvestresylvestre# {i,j,k | k=0; 1<=i<=10; 1<=j<=10} | # {i,j,k | k=0; 28<=i<=31; 1<=j<=10} D 2 5 5 0 0 0 1 0 1 1 0 0 -1 1 -1 0 0 10 1 0 1 0 -1 1 0 -1 0 10 5 5 0 0 0 1 0 1 1 0 0 -28 1 -1 0 0 31 1 0 1 0 -1 1 0 -1 0 10 # {i,j,k | k=0; i+j>=25; i<=25; j<=25} | # {i,j,k | k=0; 2<=j<=9; 30<=i<=32} D 2 4 5 0 0 0 1 0 1 1 1 0 -25 1 -1 0 0 25 1 0 -1 0 25 5 5 0 0 0 1 0 1 0 1 0 -2 1 0 -1 0 9 1 1 0 0 -30 1 -1 0 0 32 F 2 DomSimplify[readDom["{i,j,k | k=0; 1<=i<=10; 1<=j<=10} | {i,j,k | k=0; 28<=i<=31; 1<=j<=10}"], readDom["{i,j,k | k=0; i+j>=25; i<=25; j<=25} | {i,j,k | k=0; 2<=j<=9; 30<=i<=32}"]] (*answer = domain[3, {i, j, k}, {pol[2, 4, 0, 2, {{1, 1, 0, 0, -28}, {1, -1, 0, 0, 31}}, {{0, 0, 1, 0, 0}, {0, 0, 0, 1, 0}, {1, 28, 0, 0, 1}, {1, 31, 0, 0, 1}}]}] {i,j,k|i-28>=0;-i+31>=0} *) polylib-5.22.5.orig/Test/general/convex1.out0000644000175000017500000000013011035141337021540 0ustar sylvestresylvestre4 4 1 0 1 -2 1 1 0 0 1 -1 1 0 1 0 0 1 polylib-5.22.5.orig/Test/general/simpl8.out0000644000175000017500000000004411035141337021375 0ustar sylvestresylvestre2 3 1 1 0 1 0 1 polylib-5.22.5.orig/Test/general/simpl9.in0000644000175000017500000000006711035141337021202 0ustar sylvestresylvestreD 1 1 5 1 1 -1 0 0 D 1 2 5 1 0 1 -1 0 1 -1 0 1 0 F 2 polylib-5.22.5.orig/Test/general/test1.in0000644000175000017500000000114411035141337021022 0ustar sylvestresylvestreD 1 9 5 1 0 0 1 0 1 0 1 0 -1 1 1 -1 0 0 1 1 0 -32 0 1 0 0 -1 4 1 0 -1 0 128 1 0 -1 32 31 1 -1 0 32 31 1 -1 0 0 128 D 1 9 5 1 0 0 1 0 1 1 -1 0 0 1 1 0 -32 0 1 0 0 -1 4 1 0 -1 0 128 1 0 -1 32 31 1 -1 0 32 31 1 -1 0 0 128 1 0 1 0 -1 F 3 fshow[DomConstraints[a]] {i,j,k | k>=0;j-1>=0;i-j>=0;i-32k>=0;-i+32k+31>=0;-i+128>=0} {i,j,k | (j,32k)<=i<=(32k+31,128); 1<=j; 0<=k} fshow[DomConstraints[b]] {i,j,k | k>=0;i-j>=0;i-32k>=0;-i+32k+31>=0;-i+128>=0;j-1>=0} {i,j,k | (j,32k)<=i<=(32k+31,128); 1<=j; 0<=k} polylib-5.22.5.orig/Test/Zpolytest/0000755000175000017500000000000011341243122020025 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/Zpolytest/ZPre1.out0000644000175000017500000000064011035141337021524 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 1 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 3 0 1 ] Inequality: [ -2 5 -3 ] Inequality: [ -3 0 98 ] Inequality: [ 2 -5 102 ] Rays 4 4 Vertex: [ 98 41 ]/3 Vertex: [ -5 7 ]/15 Vertex: [ -5 304 ]/15 Vertex: [ 490 502 ]/15 polylib-5.22.5.orig/Test/Zpolytest/ZPre3.out0000644000175000017500000000100411035141337021521 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 3 LATTICE: 4 4 2 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 POLYHEDRON Dimension:3 Constraints:4 Equations:0 Rays:5 Lines:1 Constraints 4 5 Inequality: [ 3 0 1 1 ] Inequality: [ 2 1 -1 0 ] Inequality: [ -3 0 -1 98 ] Inequality: [ -4 -2 2 99 ] Rays 5 5 Line: [ 1 -5 -3 ] Vertex: [ 0 98 98 ]/1 Vertex: [ 0 -1 -1 ]/1 Vertex: [ 0 97 -2 ]/2 Vertex: [ 0 295 196 ]/2 polylib-5.22.5.orig/Test/Zpolytest/ZEmpty2.in0000644000175000017500000000007711035141337021700 0ustar sylvestresylvestre#Empty Zpol M 1 3 3 1 0 0 0 3 0 0 0 1 D 1 1 4 0 0 0 1 F 6 polylib-5.22.5.orig/Test/Zpolytest/LatInter2.out0000644000175000017500000000011011035141337022357 0ustar sylvestresylvestre4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 polylib-5.22.5.orig/Test/Zpolytest/LatInc1.in0000644000175000017500000000035211035141337021615 0ustar sylvestresylvestre#inculsion between the affine lattices M 3 4 4 2 18 4 0 5 60 10 0 1 2 3 0 0 0 0 1 4 4 4 18 4 0 5 60 10 0 1 2 3 0 0 0 0 1 4 4 2 18 4 0 5 60 10 0 1 2 3 0 0 0 0 1 4 4 2 0 0 0 0 5 0 0 0 0 1 0 0 0 0 1 D 0 F 4 2 \in 1 1 \in 3 1 \notIn 2polylib-5.22.5.orig/Test/Zpolytest/ZImPre1.out0000644000175000017500000000003311035141337022006 0ustar sylvestresylvestrethe Two zpol are equal? :1 polylib-5.22.5.orig/Test/Zpolytest/Makefile.in0000644000175000017500000002543011341231331022075 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/Zpolytest DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) ZPOLYTESTS = \ LatHNF1.in \ LatHNF2.in \ LatHNF3.in \ LatInter1.in \ LatInter2.in \ LatInc1.in \ LatInc2.in \ ZEmpty1.in \ ZEmpty2.in \ ZInter1.in \ ZInter2.in \ ZInter3.in \ ZUnion1.in \ ZUnion2.in \ ZDiff1.in \ ZDiff2.in \ ZImage1.in \ ZPre1.in \ ZPre2.in \ ZPre3.in \ ZImPre1.in \ SplitZpol1.in \ SplitZpol2.in \ SplitZpol3.in EXTRA_DIST = $(ZPOLYTESTS) \ $(ZPOLYTESTS:%.in=%.out) TEST = $(ZPOLYTESTS:%.in=%.tested) CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/Zpolytest/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/Zpolytest/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am tests: @failedtest=0; \ for x in $(ZPOLYTESTS) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/Zpolytest$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test Zpolytest works correctly"; \ fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/Zpolytest/SplitZpol3.out0000644000175000017500000000063511035141337022612 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 2 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 polylib-5.22.5.orig/Test/Zpolytest/LatHNF1.out0000644000175000017500000000033211035141337021716 0ustar sylvestresylvestre5 5 1 0 0 0 0 0 4 0 0 0 0 0 3 0 0 0 9 8 10 7 0 0 0 0 1 5 5 0 0 0 1 0 1 0 1 0 -1 4 5 0 0 -1 -4 -4 -1 0 2 0 0 0 0 1 polylib-5.22.5.orig/Test/Zpolytest/LatInter2.in0000644000175000017500000000023511035141337022166 0ustar sylvestresylvestre#INtersection of these two affine lattices M 2 4 4 2 18 4 0 5 60 10 0 1 2 3 0 0 0 0 1 4 4 2 18 4 1 5 60 10 0 1 2 3 0 0 0 0 1 D 0 F 3 result should be Empty polylib-5.22.5.orig/Test/Zpolytest/ZDiff2.in0000644000175000017500000000050411035141337021445 0ustar sylvestresylvestre#Difference of Zpol Intersceting with same lattice M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 5<= i,j<=15}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 4 4 1 1 0 -5 1 0 1 -5 1 -1 0 15 1 0 -1 15 F 9 polylib-5.22.5.orig/Test/Zpolytest/ZDiff1.out0000644000175000017500000000176311035141337021655 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 1 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 2 -1 10 ] Inequality: [ -2 1 -2 ] Inequality: [ -2 0 19 ] Rays 4 4 Vertex: [ 1 4 ]/1 Vertex: [ 1 12 ]/1 Vertex: [ 19 58 ]/2 Vertex: [ 19 42 ]/2 UNION POLYHEDRON Dimension:2 Constraints:3 Equations:1 Rays:2 Lines:0 Constraints 3 4 Equality: [ 2 -1 1 ] Inequality: [ 0 1 -3 ] Inequality: [ 0 -1 21 ] Rays 2 4 Vertex: [ 1 3 ]/1 Vertex: [ 10 21 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 1 0 0 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:3 Equations:1 Rays:2 Lines:0 Constraints 3 4 Equality: [ 1 0 -21 ] Inequality: [ 0 1 -21 ] Inequality: [ 0 -1 30 ] Rays 2 4 Vertex: [ 21 21 ]/1 Vertex: [ 21 30 ]/1 polylib-5.22.5.orig/Test/Zpolytest/ZPre3.in0000644000175000017500000000037211035141337021327 0ustar sylvestresylvestre# Preimage by readMat["(i,j,k->3i+2k,2j+5i)"] of readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 2 1 0 0 0 1 3 4 3 0 2 1 5 2 0 0 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 100 1 0 -1 100 F 11 polylib-5.22.5.orig/Test/Zpolytest/LatHNF2.out0000644000175000017500000000045611035141337021726 0ustar sylvestresylvestre9 5 1 0 0 0 0 0 4 0 0 0 0 0 3 0 0 0 9 8 10 7 0 0 0 0 1 0 4 0 0 0 0 0 3 0 1 0 -19 -13 -18 14 0 0 0 0 1 5 5 0 0 0 1 0 1 0 1 0 -1 4 5 0 0 -1 -4 -4 -1 0 2 0 0 0 0 1 polylib-5.22.5.orig/Test/Zpolytest/SplitZpol2.in0000644000175000017500000000033411035141337022404 0ustar sylvestresylvestre#readMat["(i,j->2i,2j)"] #readMat["(i,j->2i+1,2j+1)"] M 2 3 3 2 0 0 0 2 0 0 0 1 3 3 2 0 1 0 2 1 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 23 polylib-5.22.5.orig/Test/Zpolytest/ZEmpty1.out0000644000175000017500000000001611035141337022071 0ustar sylvestresylvestreis Empty? :1 polylib-5.22.5.orig/Test/Zpolytest/LatHNF1.in0000644000175000017500000000033411035141337021517 0ustar sylvestresylvestre# HNF of this lattice M 1 5 5 0 0 0 1 0 4 0 4 0 -4 12 15 0 0 -3 1 0 -1 0 10 0 0 0 0 1 D 0 F 2 m1=Alpha`matrix[5,5,{}, {{0, 0, 0, 1,0}, {4, 0, 4, 0,-4},{12, 15, 0, 0,-3},{1, 0, -1, 0,10 },{0, 0, 0, 0, 1}}] hermiteL[m1]polylib-5.22.5.orig/Test/Zpolytest/ZUnion2.in0000644000175000017500000000051611035141337021670 0ustar sylvestresylvestre#readMat["(i,j->2i+1,2i+j)"] #readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 D 2 4 4 1 1 0 -5 1 0 1 -5 1 -1 0 15 1 0 -1 15 F 8 polylib-5.22.5.orig/Test/Zpolytest/ZInter2.out0000644000175000017500000000063511035141337022064 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ -1 0 10 ] Inequality: [ 2 -1 10 ] Inequality: [ 1 0 -5 ] Inequality: [ -2 1 -5 ] Rays 4 4 Vertex: [ 5 20 ]/1 Vertex: [ 10 30 ]/1 Vertex: [ 10 25 ]/1 Vertex: [ 5 15 ]/1 polylib-5.22.5.orig/Test/Zpolytest/ZPre1.in0000644000175000017500000000036111035141337021323 0ustar sylvestresylvestre# Preimage by readMat["(i,j->3i+1,2i+5j)"] of readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 3 0 1 2 5 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 100 1 0 -1 100 F 11 polylib-5.22.5.orig/Test/Zpolytest/ZUnion2.out0000644000175000017500000000134611035141337022073 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 2 -1 10 ] Rays 4 4 Vertex: [ 10 21 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 1 12 ]/1 Vertex: [ 10 30 ]/1 UNION POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -5 ] Inequality: [ -2 1 -5 ] Inequality: [ -1 0 15 ] Inequality: [ 2 -1 15 ] Rays 4 4 Vertex: [ 15 35 ]/1 Vertex: [ 5 15 ]/1 Vertex: [ 5 25 ]/1 Vertex: [ 15 45 ]/1 polylib-5.22.5.orig/Test/Zpolytest/LatHNF3.in0000644000175000017500000000015411035141337021521 0ustar sylvestresylvestre# HNF of this Matrix (not a lattice) M 1 5 5 0 0 0 1 0 4 0 4 0 -4 4 0 4 0 -4 4 0 4 0 -4 0 0 0 0 1 D 0 F 2 polylib-5.22.5.orig/Test/Zpolytest/ZInter1.out0000644000175000017500000000043611035141337022062 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 0 0 0 0 0 0 0 0 1 POLYHEDRON Dimension:2 Constraints:3 Equations:3 Rays:0 Lines:0 Constraints 3 4 Equality: [ 1 0 0 ] Equality: [ 0 1 0 ] Equality: [ 0 0 1 ] Rays 0 4 polylib-5.22.5.orig/Test/Zpolytest/ZInter3.in0000644000175000017500000000045711035141337021666 0ustar sylvestresylvestre#readMat["(i,j->2i+1,2i+5j)"] #readMat["(i,j->3i,6i+2j)"] M 2 3 3 2 0 1 2 5 0 0 0 1 3 3 3 0 0 6 2 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 7 polylib-5.22.5.orig/Test/Zpolytest/ZInter2.in0000644000175000017500000000051311035141337021656 0ustar sylvestresylvestre#readMat["(i,j->2i+1,2i+j)"] #readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 4 4 1 1 0 -5 1 0 1 -5 1 -1 0 15 1 0 -1 15 F 7 polylib-5.22.5.orig/Test/Zpolytest/ZUnion1.out0000644000175000017500000000151011035141337022063 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 1 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 2 -1 10 ] Rays 4 4 Vertex: [ 10 21 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 1 12 ]/1 Vertex: [ 10 30 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 2 -1 10 ] Rays 4 4 Vertex: [ 10 21 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 1 12 ]/1 Vertex: [ 10 30 ]/1 polylib-5.22.5.orig/Test/Zpolytest/SplitZpol3.in0000644000175000017500000000034111035141337022403 0ustar sylvestresylvestre#readMat["(i,j->2i,2j)"] #readMat["(i,j->2i+j+1,2i+2j+1)"] M 2 3 3 2 0 0 0 2 0 0 0 1 3 3 2 1 1 2 2 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 23 polylib-5.22.5.orig/Test/Zpolytest/ZDiff2.out0000644000175000017500000000134611035141337021653 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 1 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ 2 -1 10 ] Inequality: [ -2 0 9 ] Rays 4 4 Vertex: [ 1 12 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 9 20 ]/2 Vertex: [ 9 38 ]/2 UNION POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 2 -1 4 ] Rays 4 4 Vertex: [ 10 21 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 1 6 ]/1 Vertex: [ 10 24 ]/1 polylib-5.22.5.orig/Test/Zpolytest/LatInc2.out0000644000175000017500000000004411035141337022015 0ustar sylvestresylvestre 2 in 1 : 1 1 in 3 : 1 1 in 2 : 1 polylib-5.22.5.orig/Test/Zpolytest/LatInc2.in0000644000175000017500000000021211035141337021611 0ustar sylvestresylvestre#inculsion between the affine lattices M 3 3 3 2 0 0 0 5 0 0 0 1 3 3 2 0 4 5 5 15 0 0 1 3 3 4 0 8 15 15 15 0 0 1 D 0 F 4 2 = 1 2 \in 3polylib-5.22.5.orig/Test/Zpolytest/ZEmpty1.in0000644000175000017500000000015011035141337021667 0ustar sylvestresylvestre#Empty Zpol M 1 3 3 0 0 0 0 0 0 0 0 1 D 1 4 4 1 1 0 0 1 -1 1 -1 1 0 1 -2 1 0 0 1 F 6 polylib-5.22.5.orig/Test/Zpolytest/ZImage1.in0000644000175000017500000000045211035141337021620 0ustar sylvestresylvestre#Difference of Lattice intersection woth different lattices # image by readMat["(i,j->3i+1,2i+5j)"] of readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 3 0 1 2 5 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 100 1 0 -1 100 F 10 polylib-5.22.5.orig/Test/Zpolytest/ZInter3.out0000644000175000017500000000063511035141337022065 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 3 6 10 2 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ -1 0 3 ] Inequality: [ 1 0 0 ] Inequality: [ -3 5 -3 ] Inequality: [ 3 -5 12 ] Rays 4 4 Vertex: [ 0 3 ]/5 Vertex: [ 15 12 ]/5 Vertex: [ 15 21 ]/5 Vertex: [ 0 12 ]/5 polylib-5.22.5.orig/Test/Zpolytest/LatInter1.out0000644000175000017500000000011011035141337022356 0ustar sylvestresylvestre4 4 2 0 0 0 5 15 0 0 13 15 66 0 0 0 0 1 polylib-5.22.5.orig/Test/Zpolytest/LatInc1.out0000644000175000017500000000004411035141337022014 0ustar sylvestresylvestre 2 in 1 : 0 1 in 3 : 1 1 in 2 : 0 polylib-5.22.5.orig/Test/Zpolytest/LatHNF3.out0000644000175000017500000000033211035141337021720 0ustar sylvestresylvestre5 5 1 0 0 0 0 0 4 0 0 0 0 4 0 0 0 0 4 0 0 0 0 0 0 0 1 5 5 0 0 0 1 0 1 0 1 0 -1 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 polylib-5.22.5.orig/Test/Zpolytest/ZImPre1.in0000644000175000017500000000025611035141337021614 0ustar sylvestresylvestre# M 2 3 3 2 0 0 2 1 0 0 0 1 3 3 1 0 0 0 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=100}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 100 1 0 -1 100 F 12 polylib-5.22.5.orig/Test/Zpolytest/ZUnion1.in0000644000175000017500000000051111035141337021662 0ustar sylvestresylvestre#readMat["(i,j->2i+1,2i+j)"] #readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 1 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 8 polylib-5.22.5.orig/Test/Zpolytest/ZPre2.out0000644000175000017500000000040211035141337021521 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 1 LATTICE: 2 2 2 1 0 1 POLYHEDRON Dimension:1 Constraints:2 Equations:0 Rays:2 Lines:0 Constraints 2 3 Inequality: [ 3 1 ] Inequality: [ -14 93 ] Rays 2 3 Vertex: [ -1 ]/3 Vertex: [ 93 ]/14 polylib-5.22.5.orig/Test/Zpolytest/ZEmpty2.out0000644000175000017500000000001611035141337022072 0ustar sylvestresylvestreis Empty? :1 polylib-5.22.5.orig/Test/Zpolytest/LatInter1.in0000644000175000017500000000027611035141337022172 0ustar sylvestresylvestre#INtersection of these two linear lattices M 2 4 4 2 18 4 0 5 60 10 0 1 2 3 0 0 0 0 1 4 4 2 20 16 0 15 15 10 0 1 7 8 0 0 0 0 1 D 0 F 3 result should be {{2, 0, 0}, {5, 15, 0}, {13, 15, 66}}polylib-5.22.5.orig/Test/Zpolytest/Makefile.am0000644000175000017500000000210711341227526022073 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # OBJ_DIR = $(top_builddir) ZPOLYTESTS = \ LatHNF1.in \ LatHNF2.in \ LatHNF3.in \ LatInter1.in \ LatInter2.in \ LatInc1.in \ LatInc2.in \ ZEmpty1.in \ ZEmpty2.in \ ZInter1.in \ ZInter2.in \ ZInter3.in \ ZUnion1.in \ ZUnion2.in \ ZDiff1.in \ ZDiff2.in \ ZImage1.in \ ZPre1.in \ ZPre2.in \ ZPre3.in \ ZImPre1.in \ SplitZpol1.in \ SplitZpol2.in \ SplitZpol3.in EXTRA_DIST = $(ZPOLYTESTS) \ $(ZPOLYTESTS:%.in=%.out) TEST=$(ZPOLYTESTS:%.in=%.tested) tests: @failedtest=0; \ for x in $(ZPOLYTESTS) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/Zpolytest$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test Zpolytest works correctly"; \ fi CLEANFILES=xyz polylib-5.22.5.orig/Test/Zpolytest/ZImage1.out0000644000175000017500000000063511035141337022024 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 1 4 5 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ -2 1 -1 ] Inequality: [ -1 0 100 ] Inequality: [ 2 -1 100 ] Rays 4 4 Vertex: [ 100 201 ]/1 Vertex: [ 1 3 ]/1 Vertex: [ 1 102 ]/1 Vertex: [ 100 300 ]/1 polylib-5.22.5.orig/Test/Zpolytest/ZPre2.in0000644000175000017500000000035111035141337021323 0ustar sylvestresylvestre# Preimage by readMat["(i->3i+1,2i+5i)"] of readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 0 0 1 0 0 0 1 3 2 3 1 7 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 100 1 0 -1 100 F 11 polylib-5.22.5.orig/Test/Zpolytest/SplitZpol1.in0000644000175000017500000000033411035141337022403 0ustar sylvestresylvestre#readMat["(i,j->2i,2j)"] #readMat["(i,j->3i+1,3j+1)"] M 2 3 3 2 0 0 0 2 0 0 0 1 3 3 3 0 1 0 3 1 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] D 1 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 23 polylib-5.22.5.orig/Test/Zpolytest/SplitZpol2.out0000644000175000017500000000063511035141337022611 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 2 0 0 0 2 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 polylib-5.22.5.orig/Test/Zpolytest/SplitZpol1.out0000644000175000017500000000736511035141337022617 0ustar sylvestresylvestre ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 2 0 6 2 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 2 0 6 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 0 0 6 2 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 0 0 6 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 4 0 6 2 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 4 0 6 0 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 2 0 6 4 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 0 0 6 4 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 UNIONED with ZPOLYHEDRON: Dimension 2 LATTICE: 3 3 6 0 4 0 6 4 0 0 1 POLYHEDRON Dimension:2 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 4 Inequality: [ 1 0 -1 ] Inequality: [ 0 1 -1 ] Inequality: [ -1 0 10 ] Inequality: [ 0 -1 10 ] Rays 4 4 Vertex: [ 10 1 ]/1 Vertex: [ 1 1 ]/1 Vertex: [ 1 10 ]/1 Vertex: [ 10 10 ]/1 polylib-5.22.5.orig/Test/Zpolytest/ZDiff1.in0000644000175000017500000000046611035141337021453 0ustar sylvestresylvestre#Difference of Zpol not intersecting M 2 3 3 2 0 1 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 F 9 polylib-5.22.5.orig/Test/Zpolytest/LatHNF2.in0000644000175000017500000000043211035141337021517 0ustar sylvestresylvestre# HNF of this Matrix (not a lattice) M 1 9 5 0 0 0 1 0 4 0 4 0 -4 12 15 0 0 -3 1 0 -1 0 10 0 0 0 0 1 4 0 4 0 -4 12 15 0 0 -2 1 7 -1 0 10 0 0 0 0 1 D 0 F 2 m1=Alpha`matrix[5,5,{}, {{0, 0, 0, 1,0}, {4, 0, 4, 0,-4},{12, 15, 0, 0,-3},{1, 0, -1, 0,10 },{0, 0, 0, 0, 1}}] hermiteL[m1]polylib-5.22.5.orig/Test/Zpolytest/ZInter1.in0000644000175000017500000000051111035141337021653 0ustar sylvestresylvestre#readMat["(i,j->2i+1,2i+j)"] #readMat["(i,j->2i,2i+j)"] M 2 3 3 2 0 1 2 1 0 0 0 1 3 3 2 0 0 2 1 0 0 0 1 #readDom["{i,j| 1<= i,j<=10}"] #readDom["{i,j| 1<= i,j<=10}"] D 2 4 4 1 1 0 -1 1 0 1 -1 1 -1 0 10 1 0 -1 10 4 4 1 1 0 -5 1 0 1 -5 1 -1 0 15 1 0 -1 15 F 7 polylib-5.22.5.orig/Test/old/0000755000175000017500000000000011035141337016573 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/old/ray30000644000175000017500000000055011035141337017374 0ustar sylvestresylvestre# points at (1,2) and (2,1) and ray in (1,1) and (1,0) in (x,N) space. 3 4 1 1 1 -3 x+N>=3 1 0 1 -1 N>=1 1 1 -1 1 x-N>=-1 1 3 1 1 -1 N>=1 --------------------------------------- Domain : P -2 >= 0 1 >= 0 Vertices : [ P-1 ] --------------------------------------- Domain : P -1 >= 0 - P + 2 >= 0 Vertices : [ -P+3 ] polylib-5.22.5.orig/Test/old/line20000644000175000017500000000026511035141337017532 0ustar sylvestresylvestre# This test is a line at X=1 in (X,N) space. 1 4 0 -1 0 1 X=1 1 3 1 1 0 N>=0 --------------------------------------- Domain : P >= 0 1 >= 0 Vertices : [ 1 ] polylib-5.22.5.orig/Test/old/ray10000644000175000017500000000035311035141337017373 0ustar sylvestresylvestre# points at (1,1) and (2,1) and ray in (0,1) in (X,N) space. 3 4 1 1 0 -1 x>=1 1 -1 0 2 x<=2 1 0 1 -1 n>=1 1 3 1 1 -1 n>=1 --------------------------------------- Domain : P -1 >= 0 1 >= 0 Vertices : [ 2 ] [ 1 ] polylib-5.22.5.orig/Test/old/ray20000644000175000017500000000055711035141337017402 0ustar sylvestresylvestre# points at (1,2) and (2,1) and ray in (1,1) in (X,N) space. 3 4 1 1 1 -3 x+N>=3 1 -1 1 1 x-N<=1 1 1 -1 1 x-N>=-1 1 3 1 1 -1 n>=1 --------------------------------------- Domain : P -2 >= 0 1 >= 0 Vertices : [ P-1 ] [ P+1 ] --------------------------------------- Domain : P -1 >= 0 - P + 2 >= 0 Vertices : [ P+1 ] [ -P+3 ] polylib-5.22.5.orig/Test/old/line30000644000175000017500000000027311035141337017532 0ustar sylvestresylvestre# This test is a line at X=N, N>=0 in (X,N) space. 1 4 0 -1 1 0 X=N 1 3 1 1 0 N>=0 --------------------------------------- Domain : P >= 0 1 >= 0 Vertices : [ P ] polylib-5.22.5.orig/Test/old/ray40000644000175000017500000000035311035141337017376 0ustar sylvestresylvestre# points at (1,2) and (1,1) and ray in (1,0) in (x,N) space. 3 4 1 1 0 -1 x>=1 1 0 1 -1 N>=1 1 0 -1 2 2>=N 1 3 1 1 -1 N>=1 --------------------------------------- Domain : P -1 >= 0 - P + 2 >= 0 Vertices : [ 1 ] polylib-5.22.5.orig/Test/old/line10000644000175000017500000000017211035141337017526 0ustar sylvestresylvestre# This test is a line at N=1 in (X,N) space. 0 4 1 3 0 -1 1 N=1 ------------------------- VERTEX [0] if N=1 LINE [1] polylib-5.22.5.orig/Test/Makefile.am0000644000175000017500000000071111035141337020050 0ustar sylvestresylvestreEXTRA_DIST = cases old others SUBDIRS = Zpolytest ehrhart ehrhart_union ranking general pp tests: @for BITS in $(ALL_BITS); do \ echo "Performing $$BITS tests"; \ for d in $(SUBDIRS); do \ (cd $$d; $(MAKE) TEST_BITS=$$BITS tests) \ done \ done long_tests: @for BITS in $(ALL_BITS); do \ echo "Performing $$BITS tests"; \ (cd ehrhart; $(MAKE) TEST_BITS=$$BITS longtest) \ done dist-hook: rm -rf `find $(distdir) -name CVS` polylib-5.22.5.orig/Test/ehrhart/0000755000175000017500000000000011341243123017446 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/ehrhart/e13.in0000644000175000017500000000042311035141337020371 0ustar sylvestresylvestre# example 13 # i j k n m p cons 6 8 1 1 0 0 0 0 0 0 1 -1 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 2 -2 0 0 1 0 0 1 0 0 1 0 0 0 0 1 1 0 -1 -1 0 1 0 3 5 1 1 0 0 -9 1 0 1 0 -1 1 0 0 1 -1 n m p example 13 polylib-5.22.5.orig/Test/ehrhart/g5.out0000644000175000017500000000353311035141337020522 0ustar sylvestresylvestre--------------------------------------- Domain: - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 - j0 - k0 + a1 >= 0 N - a1 + 1 >= 0 N - a0 >= 0 k0 >= 0 1 >= 0 Vertices: [ a0, a1, k0+1 ] [ a0, a1, 1 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain: - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 j0 + k0 - a1 >= 0 N - a1 + 1 >= 0 N - a0 >= 0 - j0 + a1 >= 0 1 >= 0 Vertices: [ a0, a1, k0+1 ] [ a0, a1, j0+k0-a1+1 ] Ehrhart Polynomial: ( -1 * j0 + ( 1 * a1 + 1 ) ) --------------------------------------- Domain: j0 + k0 - a1 >= 0 k0 - a1 + 2 >= 0 a0 - a1 >= 0 - j0 - k0 + 2a1 -2 >= 0 N - a0 >= 0 1 >= 0 Vertices: [ a0, a1, j0+k0-a1+1 ] [ a0, a1, a1-1 ] Ehrhart Polynomial: ( -1 * j0 + ( -1 * k0 + ( 2 * a1 + -1 ) ) ) --------------------------------------- Domain: j0 + k0 - a1 >= 0 k0 - a0 + 2 >= 0 - a0 + a1 >= 0 - j0 - k0 + a0 + a1 -2 >= 0 N - a1 + 1 >= 0 N - a0 >= 0 1 >= 0 Vertices: [ a0, a1, j0+k0-a1+1 ] [ a0, a1, a0-1 ] Ehrhart Polynomial: ( -1 * j0 + ( -1 * k0 + ( 1 * a0 + ( 1 * a1 + -1 ) ) ) ) --------------------------------------- Domain: - j0 - k0 + a1 >= 0 k0 - a1 + 2 >= 0 a0 - a1 >= 0 N - a0 >= 0 a1 -2 >= 0 1 >= 0 Vertices: [ a0, a1, 1 ] [ a0, a1, a1-1 ] Ehrhart Polynomial: ( 1 * a1 + -1 ) --------------------------------------- Domain: k0 - a0 + 2 >= 0 - a0 + a1 >= 0 - j0 - k0 + a1 >= 0 N - a1 + 1 >= 0 N - a0 >= 0 a0 -2 >= 0 1 >= 0 Vertices: [ a0, a1, 1 ] [ a0, a1, a0-1 ] Ehrhart Polynomial: ( 1 * a0 + -1 ) polylib-5.22.5.orig/Test/ehrhart/0D2.out0000644000175000017500000000030711035141337020530 0ustar sylvestresylvestre--------------------------------------- Domain: - R + 19 >= 0 P -1 >= 0 Q -17 >= 0 - P + 19 >= 0 - Q + 19 >= 0 R >= 0 Ehrhart Polynomial: 1 polylib-5.22.5.orig/Test/ehrhart/bart8.out0000644000175000017500000000066511035141337021232 0ustar sylvestresylvestre--------------------------------------- Domain: - P + 1 >= 0 P - T + 1 >= 0 T >= 0 Q -1 >= 0 - R + S >= 0 - Q + R -1 >= 0 Vertices: [ Q, R, T/3+1/3 , P/3-1/3 , T/3-1/3 ] [ Q, R, T/3+1/3 , P/3-1/3 , 1/3 ] [ Q, R, T/3+2/3 , P/3-1/3 , T/3-1/3 ] [ Q, R, T/3+2/3 , P/3-1/3 , 1/3 ] Ehrhart Polynomial: [ 0, ( [ 0, -1/3, -1/3 ]_T * T + [ 0, 4/3, 2/3 ]_T ) , 0 ]_P polylib-5.22.5.orig/Test/ehrhart/g13.in0000644000175000017500000000204411035141337020374 0ustar sylvestresylvestre# Gauss Anticipated memory: dependence 3 # # lambda = ( 0 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte # i0 j0 k0 N a0 a1 8 11 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 0 0 0 0 0 0 -1 0 # j = a_1 1 -1 0 0 0 0 1 0 0 0 1 # i <= k0 + 1 1 1 0 0 0 -1 -1 0 0 1 -1 # i >= j0 + k0 - a1 + 1 1 1 0 0 0 0 0 0 0 0 -1 # i >= 1 1 -1 0 0 0 0 0 1 0 0 -1 # i <= N-1 1 -1 0 0 0 0 0 0 1 0 -1 # i<= a0-1 1 -1 0 0 0 0 0 0 0 1 -1 # i<= a1-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 -1 # N >= 1 0 1 0 -1 0 0 0 -1 # i0 = k0 + 1 1 0 1 -1 0 0 0 -2 # j0 >= k0 + 2 1 0 -1 0 1 0 0 1 # j0 <= N + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 1 0 0 -1 0 1 0 -1 # a0 >= k0 + 1 1 0 0 0 1 -1 0 0 # a0 <= N 0 0 -1 0 0 0 1 0 # a1 = j0 i0 j0 k0 N a0 a1 Memory - Gauss Pivot polylib-5.22.5.orig/Test/ehrhart/isnm2.in0000644000175000017500000000044411035141337021034 0ustar sylvestresylvestre 6 8 # i j k l P Q 0 3 0 2 1 -1 0 0 # 3i + 2k + l = P 0 4 -1 3 2 0 -1 0 # 4i - j + 3k + 2l = Q 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 # i,j,k,l >= 0 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 2 4 1 1 0 0 # P,Q >= 0 1 0 1 0 P Q ISNM2 example polylib-5.22.5.orig/Test/ehrhart/e7.out0000644000175000017500000000072411035141337020521 0ustar sylvestresylvestre--------------------------------------- Domain: N -5 >= 0 1 >= 0 Vertices: [ 5, 5, 5 ] [ 3, 3, 5 ] [ 3, 3, 3 ] [ N, 5, 5 ] [ N, 3, 5 ] [ N, 3, 3 ] Ehrhart Polynomial: ( 6 * N + -16 ) --------------------------------------- Domain: - N + 5 >= 0 N -3 >= 0 Vertices: [ 3, 3, 5 ] [ 3, 3, 3 ] [ N, N, 5 ] [ N, N, N ] [ N, 3, 5 ] [ N, 3, 3 ] Ehrhart Polynomial: ( -1/6 * N^3 + 5/2 * N^2 + -19/3 * N + 4 ) polylib-5.22.5.orig/Test/ehrhart/e2.in0000644000175000017500000000054511035141337020314 0ustar sylvestresylvestre# 0 <= i <= P # 0 <= j <= 2i+Q # 0 <= k <= i-P+R # 0 <= P,Q,R #---------------- # i j k P Q R cte 6 8 1 1 0 0 0 0 0 0 # i >= 0 1 -1 0 0 1 0 0 0 # i <= P 1 0 1 0 0 0 0 0 # j >= 0 1 2 -1 0 0 1 0 0 # j <= 2i+Q 1 0 0 1 0 0 0 0 # k >= 0 1 1 0 -1 -1 0 1 0 # k <= i-P+R 3 5 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 polylib-5.22.5.orig/Test/ehrhart/t12.in0000644000175000017500000000037411035141337020414 0ustar sylvestresylvestre9 7 1 0 0 0 0 1 -18 1 0 0 -20 0 19 1 1 0 1 20 0 -20 16 1 0 0 0 0 -1 19 1 0 -1 0 0 0 4 1 4 -20 0 0 -1 23 1 -4 20 0 0 1 -22 1 0 1 0 20 -20 16 1 0 0 0 -20 19 1 0 3 polylib-5.22.5.orig/Test/ehrhart/e12.in0000644000175000017500000000044611035141337020375 0ustar sylvestresylvestre# A Tawbi example # 1 <= i <= n # 1 <= j <= i # j <= k <= m # 1 i j k n m c 6 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -1 1 1 -1 0 0 0 0 1 0 -1 1 0 0 0 1 0 0 -1 0 1 0 2 4 1 1 0 -1 1 0 1 -1 n m Nadia Tawbi's example polylib-5.22.5.orig/Test/ehrhart/t3.out0000644000175000017500000000022211035141337020525 0ustar sylvestresylvestre--------------------------------------- Domain: P -11 = 0 1 >= 0 Vertices: [ 0 ] [ 11 ]/ 2 Ehrhart Polynomial: ( 6 ) polylib-5.22.5.orig/Test/ehrhart/isnm2.out0000644000175000017500000000165211035141337021237 0ustar sylvestresylvestre--------------------------------------- Domain: 4P -3Q >= 0 Q >= 0 1 >= 0 Vertices: [ P/3, 4P/3-Q, 0, 0 ] [ 0, 3P/2-Q, P/2, 0 ] [ 0, 2P-Q, 0, P ] Ehrhart Polynomial: ( 1/12 * P^2 + 1/2 * P + [ 1, 5/12, 2/3, 3/4, 2/3, 5/12 ]_P ) --------------------------------------- Domain: -4P + 3Q >= 0 3P -2Q >= 0 1 >= 0 Vertices: [ 3P-2Q, 0, -4P+3Q, 0 ] [ P-Q/2, 0, 0, -2P+3Q/2 ] [ 0, 3P/2-Q, P/2, 0 ] [ 0, 2P-Q, 0, P ] Ehrhart Polynomial: ( -5/4 * P^2 + ( 2 * Q + 1/2 ) * P + [ ( -3/4 * Q^2 + 0 * Q + [ 1, 3/4 ]_Q ) , ( -3/4 * Q^2 + 0 * Q + [ 3/4, 1/2 ]_Q ) ]_P ) --------------------------------------- Domain: -3P + 2Q >= 0 2P - Q >= 0 1 >= 0 Vertices: [ P-Q/2, 0, 0, -2P+3Q/2 ] [ 0, 2P-Q, 0, P ] [ 0, 0, 2P-Q, -3P+2Q ] Ehrhart Polynomial: ( 1 * P^2 + ( -1 * Q + 2 ) * P + ( 1/4 * Q^2 + -1 * Q + [ 1, 3/4 ]_Q ) ) polylib-5.22.5.orig/Test/ehrhart/e0.in0000644000175000017500000000012011035141337020277 0ustar sylvestresylvestre4 5 1 1 0 0 0 1 -2 0 1 0 1 0 1 0 0 1 0 -2 1 0 1 3 1 1 0 P First example polylib-5.22.5.orig/Test/ehrhart/e9.out0000644000175000017500000000030211035141337020513 0ustar sylvestresylvestre--------------------------------------- Domain: n -1 >= 0 1 >= 0 Vertices: [ 3n/2, n ] [ 1, 2/3 ] [ 1, n ] Ehrhart Polynomial: ( 3/4 * n^2 + 1/2 * n + [ 0, -1/4 ]_n ) polylib-5.22.5.orig/Test/ehrhart/Makefile.in0000644000175000017500000002665411341231332021527 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.8 2005/10/20 11:35:25 verdoolaege Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/ehrhart DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) EHRHART_BASE = \ 0D.in \ 0D2.in \ 8hedron.in \ alex11.in \ alex1.in \ bart6.in \ bart8.in \ c3.in\ c4.in\ e0.in\ e10.in\ e11.in\ e12.in\ e13.in\ e14.in\ e15.in\ e16.in\ e1.in\ e2b.in\ e2.in\ e3.in\ e4.in\ e5.in\ e6.in\ e7.in\ e8.in\ e9.in\ esum.in \ g12.in\ g13.in\ g14.in\ g1.in\ g2.in\ g4.in\ g5.in\ isnm2.in\ t1.in\ t2.in\ t31.in\ t3.in\ t4.in\ t12.in\ tpar.in EHRHART_EXTRA = bart8.in isnm2.in e16.in esum.in t12.in EHRHART = $(EHRHART_BASE) $(EHRHART_EXTRA) EXTRA_DIST = $(EHRHART) # not using filter-out gnu extension EHRHART_TESTS = `if test $(TEST_BITS) = 32 ; then echo $(EHRHART_BASE) ; else echo $(EHRHART) ; fi ` CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/ehrhart/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/ehrhart/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ dist-hook distclean distclean-generic distclean-libtool \ distdir dvi dvi-am html html-am info info-am install \ install-am install-data install-data-am install-dvi \ install-dvi-am install-exec install-exec-am install-html \ install-html-am install-info install-info-am install-man \ install-pdf install-pdf-am install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ uninstall uninstall-am # not using %.in GNU extension dist-hook: for pl_file in $(EHRHART) ; do test -f $(distdir)/`basename $$pl_file .in`.out || cp -p $(srcdir)/`basename $$pl_file .in`.out $(distdir) ; done tests: @failedtest=0; \ for x in $(EHRHART_TESTS) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/testehrhart$(TEST_BITS) < $(srcdir)/$$x >xyz; \ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart works correctly"; \ fi longtest: @for x in $(EHRHART_TESTS) ; do \ echo "Verify Ehrhart for $$x"; \ $(OBJ_DIR)/verif_ehrhart$(TEST_BITS) < $(srcdir)/$$x ;\ done ; # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/ehrhart/g2.out0000644000175000017500000000127011035141337020513 0ustar sylvestresylvestre--------------------------------------- Domain: i0 - a0 = 0 j0 - k0 -1 = 0 -2k0 + a1 -1 >= 0 - k0 + a0 -2 >= 0 - k0 + a1 -2 >= 0 k0 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 1 >= 0 Vertices: [ a0, 1, 0 ] [ a0, k0+1, k0 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain: i0 - a0 = 0 j0 - k0 -1 = 0 2k0 - a1 + 1 >= 0 - k0 + a0 -2 >= 0 - k0 + a1 -2 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 1 >= 0 Vertices: [ a0, 2k0-a1+2, 2k0-a1+1 ] [ a0, k0+1, k0 ] Ehrhart Polynomial: ( -1 * k0 + ( 1 * a1 + 0 ) ) polylib-5.22.5.orig/Test/ehrhart/e7.in0000644000175000017500000000040711035141337020316 0ustar sylvestresylvestre# Haghighat and Polychronopoulos example # 0 <= i <= N # 3 <= j <= i # j <= k <= 5 #------------ 6 6 1 1 0 0 0 0 1 -1 0 0 1 0 1 0 1 0 0 -3 1 1 -1 0 0 0 1 0 -1 1 0 0 1 0 0 -1 0 5 1 3 1 1 0 N Haghighat and Polychronopoulos first example polylib-5.22.5.orig/Test/ehrhart/bart6.in0000644000175000017500000000115311035141337021020 0ustar sylvestresylvestre# Degenerate Problem Generated by Compaan # Copyright (c) LIACS 2004 # Problem: QR_unfold_mod # Date: 2004.08.18 at 02:39:57 PM GMT+01:00 13 11 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 3 0 -1 0 0 0 1 1 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 -3 0 0 0 0 0 1 2 1 0 0 3 0 0 0 0 0 -1 -1 1 0 0 0 0 -3 0 0 0 0 1 1 0 0 0 0 0 1 0 0 -1 1 1 0 0 0 0 0 -1 0 0 1 1 1 0 0 0 0 -3 0 0 0 1 1 1 0 0 0 0 3 0 0 0 -1 1 1 6 1 0 0 0 -1 0 polylib-5.22.5.orig/Test/ehrhart/e6.in0000644000175000017500000000031211035141337020310 0ustar sylvestresylvestre# Here's an example where we need to check to see if constraint is inequality 5 5 0 1 1 0 -1 1 0 1 1 -1 1 0 -1 1 0 1 0 0 1 -1 1 0 0 0 1 2 3 1 1 -2 1 0 1 P 6th example polylib-5.22.5.orig/Test/ehrhart/e5.out0000644000175000017500000000112411035141337020512 0ustar sylvestresylvestre--------------------------------------- Domain: N - M >= 0 M -1 >= 0 1 >= 0 Vertices: [ M, M, M ] [ 1, 1, M ] [ 1, 1, 1 ] [ N, M, M ] [ N, 1, M ] [ N, 1, 1 ] Ehrhart Polynomial: ( ( 1/2 * M^2 + 1/2 * M + 0 ) * N + ( -1/6 * M^3 + 0 * M^2 + 1/6 * M + 0 ) ) --------------------------------------- Domain: - N + M >= 0 N -1 >= 0 1 >= 0 Vertices: [ 1, 1, M ] [ 1, 1, 1 ] [ N, N, M ] [ N, N, N ] [ N, 1, M ] [ N, 1, 1 ] Ehrhart Polynomial: ( -1/6 * N^3 + ( 1/2 * M + 0 ) * N^2 + ( 1/2 * M + 1/6 ) * N + 0 ) polylib-5.22.5.orig/Test/ehrhart/g14.out0000644000175000017500000000423511035141337020602 0ustar sylvestresylvestre--------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 k0 - a1 + 2 >= 0 a0 - a1 >= 0 2k0 - a1 + 1 >= 0 N - a0 >= 0 -2k0 + 2a1 -3 >= 0 - k0 + N -2 >= 0 Vertices: [ a1-1, a1-1, a1-2 ] [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] Ehrhart Polynomial: ( -2 * k0 + ( 2 * a1 + -2 ) ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 k0 - a1 + 2 >= 0 a0 - a1 >= 0 -2k0 + a1 -1 >= 0 N - a0 >= 0 - k0 + N -2 >= 0 a1 -2 >= 0 Vertices: [ a1-1, a1-1, a1-2 ] [ 1, 1, 0 ] Ehrhart Polynomial: ( 1 * a1 + -1 ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 k0 - a0 + 2 >= 0 - a0 + a1 >= 0 2k0 - a1 + 1 >= 0 -2k0 + a0 + a1 -3 >= 0 - k0 + a0 -1 >= 0 - k0 + N -2 >= 0 N - a1 + 1 >= 0 Vertices: [ a0-1, a0-1, a0-2 ] [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] Ehrhart Polynomial: ( -2 * k0 + ( 1 * a0 + ( 1 * a1 + -2 ) ) ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 k0 - a0 + 2 >= 0 - a0 + a1 >= 0 -2k0 + a1 -1 >= 0 - k0 + a0 -1 >= 0 - k0 + N -2 >= 0 N - a1 + 1 >= 0 a0 -2 >= 0 Vertices: [ a0-1, a0-1, a0-2 ] [ 1, 1, 0 ] Ehrhart Polynomial: ( 1 * a0 + -1 ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 -2k0 + a1 -1 >= 0 - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 k0 >= 0 1 >= 0 Vertices: [ 1, 1, 0 ] [ k0+1, k0+1, k0 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 2k0 - a1 + 1 >= 0 - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 1 >= 0 Vertices: [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] [ k0+1, k0+1, k0 ] Ehrhart Polynomial: ( -1 * k0 + ( 1 * a1 + 0 ) ) polylib-5.22.5.orig/Test/ehrhart/e2b.out0000644000175000017500000000156011035141337020655 0ustar sylvestresylvestre--------------------------------------- Domain: P - R >= 0 R >= 0 - Q + 10 >= 0 - P + 4 >= 0 Q >= 0 Vertices: [ P-R, 2P+Q-2R, 0 ] [ P-R, 0, 0 ] [ P, 2P+Q, R ] [ P, 2P+Q, 0 ] [ P, 0, R ] [ P, 0, 0 ] Ehrhart Polynomial: ( ( 1 * R^2 + 3 * R + 2 ) * P + ( ( 1/2 * R^2 + 3/2 * R + 1 ) * Q + ( -1/3 * R^3 + -1/2 * R^2 + 5/6 * R + 1 ) ) ) --------------------------------------- Domain: - P + R >= 0 - Q + 10 >= 0 - R + 10 >= 0 - P + 4 >= 0 Q >= 0 P >= 0 Vertices: [ P, 2P+Q, R ] [ P, 2P+Q, 0 ] [ P, 0, R ] [ P, 0, 0 ] [ 0, Q, -P+R ] [ 0, Q, 0 ] [ 0, 0, -P+R ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -1/3 * P^3 + ( -1/2 * Q + ( 1 * R + 1/2 ) ) * P^2 + ( ( 1 * R + 1/2 ) * Q + ( 2 * R + 11/6 ) ) * P + ( ( 1 * R + 1 ) * Q + ( 1 * R + 1 ) ) ) polylib-5.22.5.orig/Test/ehrhart/alex11.in0000644000175000017500000000042411035141337021075 0ustar sylvestresylvestre# test file from alexandru modified by vin100 # -> corrected a bug in cherche_min (ehrhart.c) 6 7 # i j P Q R c 1 3 -1 0 0 0 -5 1 0 -1 1 0 0 0 1 0 1 0 0 0 -1 1 -3 1 0 1 0 1 1 0 0 0 0 0 1 1 -1 0 0 0 1 -1 0 5 P Q R polylib-5.22.5.orig/Test/ehrhart/tpar.out0000644000175000017500000000026111035141337021150 0ustar sylvestresylvestre--------------------------------------- Domain: 2M - N = 0 N >= 0 1 >= 0 Vertices: [ N/2 ] [ 0 ] Ehrhart Polynomial: ( 1/2 * N + [ 1, 1/2 ]_N ) polylib-5.22.5.orig/Test/ehrhart/e1.out0000644000175000017500000000043511035141337020512 0ustar sylvestresylvestre--------------------------------------- Domain: P >= 0 Q >= 0 1 >= 0 Vertices: [ P/2, Q/2 ] [ P/2, 0 ] [ 0, Q/2 ] [ 0, 0 ] Ehrhart Polynomial: ( ( 1/4 * Q + [ 1/2, 1/4 ]_Q ) * P + [ ( 1/2 * Q + [ 1, 1/2 ]_Q ) , ( 1/4 * Q + [ 1/2, 1/4 ]_Q ) ]_P ) polylib-5.22.5.orig/Test/ehrhart/e6.out0000644000175000017500000000023611035141337020516 0ustar sylvestresylvestre--------------------------------------- Domain: P -2 >= 0 1 >= 0 Vertices: [ -P+1, P ] [ P, -P+1 ] Ehrhart Polynomial: ( 2 * P + 0 ) polylib-5.22.5.orig/Test/ehrhart/c4.out0000644000175000017500000001123311035141337020511 0ustar sylvestresylvestre--------------------------------------- Domain: R - S >= 0 P - S >= 0 Q - S >= 0 S >= 0 1 >= 0 Vertices: [ S, S, S, S ] [ 0, S, S, S ] [ 0, 0, S, S ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( 1/24 * S^4 + 5/12 * S^3 + 35/24 * S^2 + 25/12 * S + 1 ) --------------------------------------- Domain: - R + S >= 0 P - R >= 0 Q - R >= 0 R >= 0 1 >= 0 Vertices: [ R, R, R, S ] [ R, R, R, R ] [ 0, R, R, S ] [ 0, R, R, R ] [ 0, 0, R, S ] [ 0, 0, R, R ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( -1/8 * R^4 + ( 1/6 * S + -7/12 ) * R^3 + ( 1 * S + -3/8 ) * R^2 + ( 11/6 * S + 13/12 ) * R + ( 1 * S + 1 ) ) --------------------------------------- Domain: R - S >= 0 P - Q >= 0 - Q + S >= 0 Q >= 0 1 >= 0 Vertices: [ Q, Q, S, S ] [ Q, Q, Q, S ] [ Q, Q, Q, Q ] [ 0, Q, S, S ] [ 0, Q, Q, S ] [ 0, Q, Q, Q ] [ 0, 0, S, S ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( 1/8 * Q^4 + ( -1/3 * S + -1/12 ) * Q^3 + ( 1/4 * S^2 + -1/4 * S + -5/8 ) * Q^2 + ( 3/4 * S^2 + 19/12 * S + 7/12 ) * Q + ( 1/2 * S^2 + 3/2 * S + 1 ) ) --------------------------------------- Domain: - R + S >= 0 P - Q >= 0 - Q + R >= 0 Q >= 0 1 >= 0 Vertices: [ Q, Q, R, S ] [ Q, Q, R, R ] [ Q, Q, Q, S ] [ Q, Q, Q, Q ] [ 0, Q, R, S ] [ 0, Q, R, R ] [ 0, Q, Q, S ] [ 0, Q, Q, Q ] [ 0, 0, R, S ] [ 0, 0, R, R ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( 1/8 * Q^4 + ( -1/3 * S + -1/12 ) * Q^3 + ( -1/4 * R^2 + ( 1/2 * S + 1/4 ) * R + ( -1/2 * S + -5/8 ) ) * Q^2 + ( -3/4 * R^2 + ( 3/2 * S + 3/4 ) * R + ( 5/6 * S + 7/12 ) ) * Q + ( -1/2 * R^2 + ( 1 * S + 1/2 ) * R + ( 1 * S + 1 ) ) ) --------------------------------------- Domain: R - S >= 0 - P + S >= 0 Q - S >= 0 P >= 0 1 >= 0 Vertices: [ P, S, S, S ] [ P, P, S, S ] [ P, P, P, S ] [ P, P, P, P ] [ 0, S, S, S ] [ 0, 0, S, S ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( -1/24 * P^4 + ( 1/6 * S + 1/4 ) * P^3 + ( -1/4 * S^2 + -3/4 * S + -11/24 ) * P^2 + ( 1/6 * S^3 + 3/4 * S^2 + 11/12 * S + 1/4 ) * P + ( 1/6 * S^3 + 1 * S^2 + 11/6 * S + 1 ) ) --------------------------------------- Domain: - R + S >= 0 - P + R >= 0 Q - R >= 0 P >= 0 1 >= 0 Vertices: [ P, R, R, S ] [ P, R, R, R ] [ P, P, R, S ] [ P, P, R, R ] [ P, P, P, S ] [ P, P, P, P ] [ 0, R, R, S ] [ 0, R, R, R ] [ 0, 0, R, S ] [ 0, 0, R, R ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( -1/24 * P^4 + ( 1/6 * S + 1/4 ) * P^3 + ( 1/4 * R^2 + ( -1/2 * S + -1/4 ) * R + ( -1/2 * S + -11/24 ) ) * P^2 + ( -1/3 * R^3 + ( 1/2 * S + -1/4 ) * R^2 + ( 1 * S + 7/12 ) * R + ( 1/3 * S + 1/4 ) ) * P + ( -1/3 * R^3 + ( 1/2 * S + -1/2 ) * R^2 + ( 3/2 * S + 5/6 ) * R + ( 1 * S + 1 ) ) ) --------------------------------------- Domain: R - S >= 0 - P + Q >= 0 - Q + S >= 0 P >= 0 1 >= 0 Vertices: [ P, Q, S, S ] [ P, Q, Q, S ] [ P, Q, Q, Q ] [ P, P, S, S ] [ P, P, P, S ] [ P, P, P, P ] [ 0, Q, S, S ] [ 0, Q, Q, S ] [ 0, Q, Q, Q ] [ 0, 0, S, S ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( -1/24 * P^4 + ( 1/6 * S + 1/4 ) * P^3 + ( -1/4 * S^2 + -3/4 * S + -11/24 ) * P^2 + ( 1/6 * Q^3 + ( -1/2 * S + -1/2 ) * Q^2 + ( 1/2 * S^2 + 1 * S + 1/3 ) * Q + ( 1/4 * S^2 + 7/12 * S + 1/4 ) ) * P + ( 1/6 * Q^3 + ( -1/2 * S + -1/2 ) * Q^2 + ( 1/2 * S^2 + 1 * S + 1/3 ) * Q + ( 1/2 * S^2 + 3/2 * S + 1 ) ) ) --------------------------------------- Domain: - R + S >= 0 - P + Q >= 0 - Q + R >= 0 P >= 0 1 >= 0 Vertices: [ P, Q, R, S ] [ P, Q, R, R ] [ P, Q, Q, S ] [ P, Q, Q, Q ] [ P, P, R, S ] [ P, P, R, R ] [ P, P, P, S ] [ P, P, P, P ] [ 0, Q, R, S ] [ 0, Q, R, R ] [ 0, Q, Q, S ] [ 0, Q, Q, Q ] [ 0, 0, R, S ] [ 0, 0, R, R ] [ 0, 0, 0, S ] [ 0, 0, 0, 0 ] Ehrhart Polynomial: ( -1/24 * P^4 + ( 1/6 * S + 1/4 ) * P^3 + ( 1/4 * R^2 + ( -1/2 * S + -1/4 ) * R + ( -1/2 * S + -11/24 ) ) * P^2 + ( 1/6 * Q^3 + ( -1/2 * S + -1/2 ) * Q^2 + ( -1/2 * R^2 + ( 1 * S + 1/2 ) * R + ( 1/2 * S + 1/3 ) ) * Q + ( -1/4 * R^2 + ( 1/2 * S + 1/4 ) * R + ( 1/3 * S + 1/4 ) ) ) * P + ( 1/6 * Q^3 + ( -1/2 * S + -1/2 ) * Q^2 + ( -1/2 * R^2 + ( 1 * S + 1/2 ) * R + ( 1/2 * S + 1/3 ) ) * Q + ( -1/2 * R^2 + ( 1 * S + 1/2 ) * R + ( 1 * S + 1 ) ) ) ) polylib-5.22.5.orig/Test/ehrhart/e10.out0000644000175000017500000000104111035141337020564 0ustar sylvestresylvestre--------------------------------------- Domain: - P - Q >= 0 2P + Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ -P, P+Q, 0 ] [ -P, 0, P+Q ] Ehrhart Polynomial: ( -1/2 * P^2 + ( -1 * Q + 1/2 ) * P + ( -3/8 * Q^2 + [ -1/4, 0 ]_Q * Q + [ 1, 3/8 ]_Q ) ) --------------------------------------- Domain: P + Q >= 0 - Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ Q, 0, 0 ] Ehrhart Polynomial: ( 1/8 * Q^2 + [ -3/4, -1/2 ]_Q * Q + [ 1, 3/8 ]_Q ) polylib-5.22.5.orig/Test/ehrhart/0D.out0000644000175000017500000000015311035141337020445 0ustar sylvestresylvestre--------------------------------------- Domain: 1 >= 0 Vertices: [] Ehrhart Polynomial: ( 1 ) polylib-5.22.5.orig/Test/ehrhart/alex11.out0000644000175000017500000000354411035141337021304 0ustar sylvestresylvestre--------------------------------------- Domain: - Q + 3R -5 >= 0 P -3R + 8 >= 0 Q -4 >= 0 1 >= 0 Vertices: [ R-1, -Q+3R-4 ] [ Q/3+2/3 , 1 ] [ R-1, 3R-8 ] [ 2, 1 ] Ehrhart Polynomial: ( -1/6 * Q^2 + ( 1 * R + -7/6 ) * Q + [ ( -3 * R + 5 ) , ( -3 * R + 16/3 ) , ( -3 * R + 5 ) ]_Q ) --------------------------------------- Domain: - Q + 3R -5 >= 0 P + Q -3R + 4 >= 0 - P + 3R -8 >= 0 1 >= 0 Vertices: [ R-1, -Q+3R-4 ] [ Q/3+2/3 , 1 ] [ R-1, P ] [ 2, 1 ] [ P/3+5/3 , P ] Ehrhart Polynomial: ( -1/6 * P^2 + ( 1 * R + -13/6 ) * P + [ ( -1/6 * Q^2 + ( 1 * R + -7/6 ) * Q + [ ( -3/2 * R^2 + 7/2 * R + -2 ) , ( -3/2 * R^2 + 7/2 * R + -5/3 ) , ( -3/2 * R^2 + 7/2 * R + -2 ) ]_Q ) , ( -1/6 * Q^2 + ( 1 * R + -7/6 ) * Q + [ ( -3/2 * R^2 + 7/2 * R + -5/3 ) , ( -3/2 * R^2 + 7/2 * R + -4/3 ) , ( -3/2 * R^2 + 7/2 * R + -5/3 ) ]_Q ) , ( -1/6 * Q^2 + ( 1 * R + -7/6 ) * Q + [ ( -3/2 * R^2 + 7/2 * R + -2 ) , ( -3/2 * R^2 + 7/2 * R + -5/3 ) , ( -3/2 * R^2 + 7/2 * R + -2 ) ]_Q ) ]_P ) --------------------------------------- Domain: Q -3R + 5 >= 0 P -3R + 8 >= 0 R -3 >= 0 1 >= 0 Vertices: [ R-1, 1 ] [ R-1, 3R-8 ] [ 2, 1 ] Ehrhart Polynomial: ( 3/2 * R^2 + -13/2 * R + 7 ) --------------------------------------- Domain: - P - Q + 3R -4 >= 0 P -1 >= 0 Q -4 >= 0 1 >= 0 Vertices: [ Q/3+2/3 , 1 ] [ P/3+Q/3+1/3 , P ] [ 2, 1 ] [ P/3+5/3 , P ] Ehrhart Polynomial: ( ( 1/3 * Q + -1 ) * P + [ 0, [ 0, 2/3, 1/3 ]_Q, [ 0, 1/3, -1/3 ]_Q ]_P ) --------------------------------------- Domain: - P + 3R -8 >= 0 Q -3R + 5 >= 0 P -1 >= 0 1 >= 0 Vertices: [ R-1, 1 ] [ R-1, P ] [ 2, 1 ] [ P/3+5/3 , P ] Ehrhart Polynomial: ( -1/6 * P^2 + ( 1 * R + -13/6 ) * P + [ 0, 1/3, 0 ]_P ) polylib-5.22.5.orig/Test/ehrhart/e11.out0000644000175000017500000000103311035141337020566 0ustar sylvestresylvestre--------------------------------------- Domain: - P + Q >= 0 2P - Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ P, -P+Q, 0 ] [ P, 0, -P+Q ] Ehrhart Polynomial: ( -1/2 * P^2 + ( 1 * Q + 1/2 ) * P + ( -3/8 * Q^2 + [ 1/4, 0 ]_Q * Q + [ 1, 3/8 ]_Q ) ) --------------------------------------- Domain: P - Q >= 0 Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ Q, 0, 0 ] Ehrhart Polynomial: ( 1/8 * Q^2 + [ 3/4, 1/2 ]_Q * Q + [ 1, 3/8 ]_Q ) polylib-5.22.5.orig/Test/ehrhart/e2b.in0000644000175000017500000000070411035141337020453 0ustar sylvestresylvestre# 0 <= i <= P # 0 <= j <= 2i+Q # 0 <= k <= i-P+R # 0 <= P,Q,R #---------------- # i j k P Q R cte 6 8 1 1 0 0 0 0 0 0 # i >= 0 1 -1 0 0 1 0 0 0 # i <= P 1 0 1 0 0 0 0 0 # j >= 0 1 2 -1 0 0 1 0 0 # j <= 2i+Q 1 0 0 1 0 0 0 0 # k >= 0 1 1 0 -1 -1 0 1 0 # k <= i-P+R # artificially bounded validity domain to check Preprocess2 6 5 1 1 0 0 0 1 -1 0 0 4 1 0 1 0 0 1 0 0 1 0 1 0 -1 0 10 1 0 0 -1 10 polylib-5.22.5.orig/Test/ehrhart/e0.out0000644000175000017500000000032311035141337020505 0ustar sylvestresylvestre--------------------------------------- Domain: P >= 0 1 >= 0 Vertices: [ P/2, P/2 ] [ P/2, 0 ] [ 0, P/2 ] [ 0, 0 ] Ehrhart Polynomial: ( 1/4 * P^2 + [ 1, 1/2 ]_P * P + [ 1, 1/4 ]_P ) polylib-5.22.5.orig/Test/ehrhart/g1.out0000644000175000017500000000544411035141337020521 0ustar sylvestresylvestre--------------------------------------- Domain: 2P + Q - T -2U -1 >= 0 P + 2Q - T -2U -1 >= 0 P + Q - R - S - T >= 0 - P + U + 1 >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 1 >= 0 Vertices: [ -P-Q+T+2U+2, -P-Q+T+2U+2, -P-Q+T+2U+1 ] [ 2, 2, 1 ] Ehrhart Polynomial: ( -1 * P + ( -1 * Q + ( 1 * T + ( 2 * U + 1 ) ) ) ) --------------------------------------- Domain: 2P + Q - T -2U -1 >= 0 P + 2Q - T -2U -1 >= 0 - P - Q + R + S + T >= 0 - R - S + 2U >= 0 - P + U + 1 >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 1 >= 0 Vertices: [ -P-Q+T+2U+2, -P-Q+T+2U+2, -P-Q+T+2U+1 ] [ -P-Q+R+S+T+2, -P-Q+R+S+T+2, -P-Q+R+S+T+1 ] Ehrhart Polynomial: ( -1 * R + ( -1 * S + ( 2 * U + 1 ) ) ) --------------------------------------- Domain: - P - Q + R + S + T >= 0 -2P - Q + T + 2U + 1 >= 0 - P + Q >= 0 P - T >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 2P + Q - R - S - T -1 >= 0 1 >= 0 Vertices: [ -P-Q+R+S+T+2, -P-Q+R+S+T+2, -P-Q+R+S+T+1 ] [ P+1, P+1, P ] Ehrhart Polynomial: ( 2 * P + ( 1 * Q + ( -1 * R + ( -1 * S + ( -1 * T + 0 ) ) ) ) ) --------------------------------------- Domain: - P - Q + R + S + T >= 0 - P -2Q + T + 2U + 1 >= 0 P - Q >= 0 P + 2Q - R - S - T -1 >= 0 Q - T >= 0 - P + U + 1 >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 1 >= 0 Vertices: [ -P-Q+R+S+T+2, -P-Q+R+S+T+2, -P-Q+R+S+T+1 ] [ Q+1, Q+1, Q ] Ehrhart Polynomial: ( 1 * P + ( 2 * Q + ( -1 * R + ( -1 * S + ( -1 * T + 0 ) ) ) ) ) --------------------------------------- Domain: - P -2Q + T + 2U + 1 >= 0 P - Q >= 0 P + Q - R - S - T >= 0 Q - T >= 0 - P + U + 1 >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 1 >= 0 Vertices: [ Q+1, Q+1, Q ] [ 2, 2, 1 ] Ehrhart Polynomial: ( 1 * Q + 0 ) --------------------------------------- Domain: -2P - Q + T + 2U + 1 >= 0 - P + Q >= 0 P + Q - R - S - T >= 0 P - T >= 0 T -1 >= 0 - Q + U >= 0 R - T >= 0 - R + U + 1 >= 0 S - T >= 0 - S + U >= 0 1 >= 0 Vertices: [ P+1, P+1, P ] [ 2, 2, 1 ] Ehrhart Polynomial: ( 1 * P + 0 ) polylib-5.22.5.orig/Test/ehrhart/t3.in0000644000175000017500000000024411035141337020330 0ustar sylvestresylvestre2 4 1 1 0 0 # x >= 0 1 -2 1 0 # x <= P 1 3 0 1 -11 P=11 P instanciated parameter test --------------------------- 0 <= x <= P P=10 --------------------------- polylib-5.22.5.orig/Test/ehrhart/g14.in0000644000175000017500000000167611035141337020407 0ustar sylvestresylvestre# Gauss Anticipated memory: dependence 4 # # lambda = ( 0 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) 8 11 # i j k i0 j0 k0 N a0 a1 cte 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 -1 0 0 0 0 1 0 0 0 1 # i <= k0 + 1 1 1 0 0 0 -1 -1 0 0 1 -1 # i >= j0 + k0 - a1 + 1 1 1 0 0 0 0 0 0 0 0 -1 # i>= 1 1 -1 0 0 0 0 0 1 0 0 -1 # i<= N-1 1 -1 0 0 0 0 0 0 1 0 -1 # i<= a0-1 1 -1 0 0 0 0 0 0 0 1 -1 # i<= a1-1 # 6 params 9 8 # i0 j0 k0 N a0 a1 1 0 0 0 1 0 0 -1 # N >= 1 0 1 0 -1 0 0 0 -1 # i0 = k0 + 1 0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 1 0 0 -1 0 1 0 -1 # a0 >= k0 + 1 1 0 0 0 1 -1 0 0 # a0 <= N 1 0 0 -1 0 0 1 -1 # a1 >= k0 + 1 1 0 0 0 1 0 -1 1 # a1 <= N + 1 i0 j0 k0 N a0 a1 Memory - Gauss Pivot polylib-5.22.5.orig/Test/ehrhart/e4.out0000644000175000017500000000025111035141337020511 0ustar sylvestresylvestre--------------------------------------- Domain: N >= 0 1 >= 0 Vertices: [ 5, N ] [ 5, 0 ] [ 0, N ] [ 0, 0 ] Ehrhart Polynomial: ( 6 * N + 6 ) polylib-5.22.5.orig/Test/ehrhart/e3.in0000644000175000017500000000536411035141337020321 0ustar sylvestresylvestre7 8 1 1 0 0 0 0 0 0 1 -1 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 2 -1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 1 0 -1 -1 0 1 0 1 0 0 0 0 0 0 1 4 5 1 0 1 0 0 1 1 0 0 0 1 -1 0 1 0 1 0 0 0 1 P Q R 3rd example There was a (corrected) : ------------------------------------------- Fault in Polyhedron_Scan at DomainIntersection: C1 = call Polyhedron_Print(yyout, " %4d", C1) POLYHEDRON Dimension:6 Constraints:4 Equations:0 Rays:7 Lines:3 Constraints 4 8 Inequality: [ 0 0 0 208 142380 1 0 ] Inequality: [ 0 0 0 0 0 1 -1 ] Inequality: [ 0 0 0 1 0 1 0 ] Inequality: [ 0 0 0 0 0 0 1 ] Rays 7 8 Line: [ 1 0 0 0 0 0 ] Line: [ 0 1 0 0 0 0 ] Line: [ 0 0 1 0 0 0 ] Ray: [ 0 0 0 35595 -52 0 ] Ray: [ 0 0 0 0 1 0 ] Ray: [ 0 0 0 -15820 23 15820 ] Vertex: [ 0 0 0 -15820 23 15820 ]/15820 call Polyhedron_Print(yyout, " %4d", D1) POLYHEDRON Dimension:6 Constraints:5 Equations:0 Rays:7 Lines:2 Constraints 5 8 Inequality: [ 1 0 0 0 0 0 0 ] Inequality: [ -1 0 0 1 0 0 0 ] Inequality: [ 1 0 0 -1 0 1 0 ] Inequality: [ 2 0 0 0 1 0 0 ] Inequality: [ 0 0 0 0 0 0 1 ] Rays 7 8 Line: [ 0 1 0 0 0 0 ] Line: [ 0 0 1 0 0 0 ] Ray: [ 0 0 0 0 1 0 ] Ray: [ 0 0 0 1 0 1 ] Ray: [ 1 0 0 1 -2 0 ] Vertex: [ 0 0 0 0 0 0 ]/1 Ray: [ 0 0 0 0 0 1 ] I suspect align_context... call Polyhedron_Print(yyout, " %4d", C) POLYHEDRON Dimension:3 Constraints:4 Equations:0 Rays:4 Lines:0 Constraints 4 5 Inequality: [ 0 1 0 0 ] Inequality: [ 1 0 0 0 ] Inequality: [ -1 0 1 0 ] Inequality: [ 0 0 0 1 ] Rays 4 5 Ray: [ 1 0 1 ] Ray: [ 0 0 1 ] Ray: [ 0 1 0 ] Vertex: [ 0 0 0 ]/1 stopped in Polyhedron_Scan at line 435 in file "erhart.c" 435 C1 = align_context(C, dim2, MAXRAYS); print dim2 dim2 = 6 print n `cca032041`align_context`n = 6 call Matrix_Print(yyout, " %4d", M) 4 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 stopped in align_context at line 393 in file "erhart.c" 393 for (i=0; iNbConstraints; i++) polylib-5.22.5.orig/Test/ehrhart/c3.out0000644000175000017500000000311211035141337020505 0ustar sylvestresylvestre--------------------------------------- Domain: 2Q - R >= 0 2P - R >= 0 R >= 0 1 >= 0 Vertices: [ R/2, R/2, R/2 ] [ 0, R/2, R/2 ] [ 0, 0, R/2 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( 1/48 * R^3 + [ 1/4, 3/16 ]_R * R^2 + [ 11/12, 23/48 ]_R * R + [ 1, 5/16 ]_R ) --------------------------------------- Domain: -2Q + R >= 0 P - Q >= 0 Q >= 0 1 >= 0 Vertices: [ Q, Q, R/2 ] [ Q, Q, Q ] [ 0, Q, R/2 ] [ 0, Q, Q ] [ 0, 0, R/2 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -1/3 * Q^3 + ( 1/4 * R + [ -1/2, -3/4 ]_R ) * Q^2 + ( 3/4 * R + [ 5/6, 1/12 ]_R ) * Q + ( 1/2 * R + [ 1, 1/2 ]_R ) ) --------------------------------------- Domain: 2Q - R >= 0 -2P + R >= 0 P >= 0 1 >= 0 Vertices: [ P, R/2, R/2 ] [ P, P, R/2 ] [ P, P, P ] [ 0, R/2, R/2 ] [ 0, 0, R/2 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( 1/6 * P^3 + ( -1/4 * R + [ -1/2, -1/4 ]_R ) * P^2 + ( 1/8 * R^2 + [ 1/2, 1/4 ]_R * R + [ 1/3, -1/24 ]_R ) * P + ( 1/8 * R^2 + [ 3/4, 1/2 ]_R * R + [ 1, 3/8 ]_R ) ) --------------------------------------- Domain: -2Q + R >= 0 - P + Q >= 0 P >= 0 1 >= 0 Vertices: [ P, Q, R/2 ] [ P, Q, Q ] [ P, P, R/2 ] [ P, P, P ] [ 0, Q, R/2 ] [ 0, Q, Q ] [ 0, 0, R/2 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( 1/6 * P^3 + ( -1/4 * R + [ -1/2, -1/4 ]_R ) * P^2 + ( -1/2 * Q^2 + ( 1/2 * R + [ 1/2, 0 ]_R ) * Q + ( 1/4 * R + [ 1/3, 1/12 ]_R ) ) * P + ( -1/2 * Q^2 + ( 1/2 * R + [ 1/2, 0 ]_R ) * Q + ( 1/2 * R + [ 1, 1/2 ]_R ) ) ) polylib-5.22.5.orig/Test/ehrhart/e14.out0000644000175000017500000000145711035141337020603 0ustar sylvestresylvestre--------------------------------------- Domain: -2N + M + 1 >= 0 3N - M -2 >= 0 1 >= 0 Vertices: [ -2N+M+2, N, N ] [ N, -2N+M+2, N ] [ N, N, -2N+M+2 ] Ehrhart Polynomial: ( 9/2 * N^2 + ( -3 * M + -3/2 ) * N + ( 1/2 * M^2 + 1/2 * M + 0 ) ) --------------------------------------- Domain: 2N - M -1 >= 0 - N + M >= 0 1 >= 0 Vertices: [ -N+M+1, N, 1 ] [ -N+M+1, 1, N ] [ N, -N+M+1, 1 ] [ N, 1, -N+M+1 ] [ 1, -N+M+1, N ] [ 1, N, -N+M+1 ] Ehrhart Polynomial: ( -3/2 * N^2 + ( 3 * M + 3/2 ) * N + ( -1 * M^2 + -1 * M + 0 ) ) --------------------------------------- Domain: N - M >= 0 M -1 >= 0 1 >= 0 Vertices: [ M, 1, 1 ] [ 1, M, 1 ] [ 1, 1, M ] Ehrhart Polynomial: ( 1/2 * M^2 + 1/2 * M + 0 ) polylib-5.22.5.orig/Test/ehrhart/e11.in0000644000175000017500000000104511035141337020370 0ustar sylvestresylvestre#asap96 paper example, section 5 # 0 <= i <= P # 0 <= j <= i # 0 <= k <= i-j # Q = i + j + k #------------------------------- 7 7 1 1 0 0 0 0 0 1 -1 0 0 1 0 0 1 0 1 0 0 0 0 1 1 -1 0 0 0 0 1 0 0 1 0 0 0 1 1 -1 -1 0 0 0 0 1 1 1 0 -1 0 0 4 P Q ASAP'96 paper #------------------------------------------------------- # ANSWER: # 0 <= Q <= P : 1/8 Q^2 + [3/4, 1/2]_Q Q + [1, 3/8]_Q # P <= Q <= 2P : PQ - 1/2 P^2 + 1/2 P - 3/8 Q^2 + [1/4, 0]_Q Q + [1, 3/8]_Q polylib-5.22.5.orig/Test/ehrhart/t4.out0000644000175000017500000000023411035141337020531 0ustar sylvestresylvestre--------------------------------------- Domain: M - N + 5 = 0 N -5 >= 0 1 >= 0 Vertices: [ N ] [ N-5 ] Ehrhart Polynomial: 6 polylib-5.22.5.orig/Test/ehrhart/g12.in0000644000175000017500000000215011035141337020371 0ustar sylvestresylvestre# Gauss Anticipated memory: second dependence # # lambda = ( 0 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte # i0 j0 k0 N a0 a1 8 11 0 1 0 0 0 0 0 0 -1 0 0 # i = a_0 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 0 -1 0 0 0 1 0 0 0 1 # j <= k0 + 1 1 0 1 0 0 -1 -1 0 0 1 -1 # j >= j0 + k0 - a1 + 1 1 0 1 0 0 0 0 0 0 0 -1 # j>= 1 1 0 -1 0 0 0 0 1 0 0 -1 # j<= N-1 1 0 -1 0 0 0 0 0 1 0 -1 # j<= a0-1 1 0 -1 0 0 0 0 0 0 1 -1 # j<= a1-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 1 # N >= 1 1 1 0 -1 0 0 0 -2 # i0 >= k0+2 (i0,j0,k0) an emission point 1 -1 0 0 1 0 0 0 # i0 <= N 0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 0 1 0 0 0 -1 0 0 # a0 = i0 (a0,a1) a utilization proc. 1 0 0 -1 0 0 1 -2 # a1 >= k0 + 2 1 0 0 0 1 0 -1 1 # a1 <= N + 1 i0 j0 k0 N a0 a1 Memory - Gauss Pivot polylib-5.22.5.orig/Test/ehrhart/e10.in0000644000175000017500000000041611035141337020370 0ustar sylvestresylvestre7 7 1 -1 0 0 0 0 0 # -P <= i <= 0 1 1 0 0 1 0 0 1 0 -1 0 0 0 0 # i <= j <= 0 1 -1 1 0 0 0 0 1 0 0 -1 0 0 0 # i-j <= k <= 0 1 -1 1 1 0 0 0 0 1 1 1 0 -1 0 # i+j+k=Q 0 4 P Q Negative i example polylib-5.22.5.orig/Test/ehrhart/g4.in0000644000175000017500000000343011035141337020314 0ustar sylvestresylvestre# Gauss Anticipated memory: dependence 4 # # lambda = ( 1 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte 6 11 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 -1 0 0 0 0 1 0 0 0 1 # i <= k0 + 1 1 1 0 0 -1 -1 -1 0 1 1 -1 # i >= i0 + j0 + k0 - a0 - a1 + 1 1 1 0 0 0 0 0 0 0 0 -1 # i>= 1 1 -1 0 0 0 0 0 1 0 0 -1 # i<= N-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 -1 # N >= 1 0 1 0 -1 0 0 0 -1 # i0 = k0 + 1 0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 1 0 0 -1 0 1 0 -1 # a0 >= k0 + 1 1 0 0 0 1 -1 0 0 # a0 <= N 1 0 0 -1 0 0 1 -1 # a1 >= k0 + 1 1 0 0 0 1 0 -1 1 # a1 <= N + 1 i0 j0 k0 N a0 a1 Memory - Gauss Pivot # Result : --------------------------------------- Domain : 3R - T - U + 2 >= 0 P - R -1 = 0 Q - R -1 = 0 - R + T -1 >= 0 - R + S -2 >= 0 S - T >= 0 - R + U -1 >= 0 S - U + 1 >= 0 1 >= 0 Vertices : [ 3R-T-U+4, 3R-T-U+4, 3R-T-U+3 ] [ R+2, R+2, R+1 ] Ehrhart Polynomial: ( -1 * P + ( -1 * Q + ( 1 * T + ( 1 * U + 1 ) ) ) ) tststs ( -1 * P + ( -1 * Q + ( 1 * T + ( 1 * U + 1 ) ) ) ) # P Q R S T U cte # i0 j0 k0 N a0 a1 --------------------------------------- Domain : -3R + T + U -2 >= 0 R >= 0 P - R -1 = 0 Q - R -1 = 0 - R + U -1 >= 0 S - T >= 0 - R + S -2 >= 0 - R + T -1 >= 0 S - U + 1 >= 0 1 >= 0 Vertices : [ 2, 2, 1 ] Ehrhart Polynomial: ( 1 ) polylib-5.22.5.orig/Test/ehrhart/c3.in0000644000175000017500000000015611035141337020311 0ustar sylvestresylvestre6 8 1 1 0 0 0 0 0 0 1 -1 0 0 1 0 0 0 1 -1 1 0 0 0 0 0 1 0 -1 0 0 1 0 0 1 0 -1 1 0 0 0 0 1 0 0 -2 0 0 1 0 0 5 polylib-5.22.5.orig/Test/ehrhart/g13.out0000644000175000017500000000043611035141337020600 0ustar sylvestresylvestre--------------------------------------- Domain: i0 - k0 -1 = 0 j0 - a1 = 0 N - a0 >= 0 N - a1 + 1 >= 0 k0 >= 0 - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 1 >= 0 Vertices: [ k0+1, a1, k0 ] Ehrhart Polynomial: 1 polylib-5.22.5.orig/Test/ehrhart/e8.in0000644000175000017500000000034511035141337020320 0ustar sylvestresylvestre# another example by Haghighat and Polychronopoulos # 1 <= i <= 2n # 1 <= j <= i # 1 <= j <= 2n-i #--------------- 5 5 1 1 0 0 -1 1 -1 0 2 0 1 0 1 0 -1 1 1 -1 0 0 1 -1 -1 2 0 1 3 1 1 -1 n Haghighat and Polychronopoulos example polylib-5.22.5.orig/Test/ehrhart/alex1.out0000644000175000017500000000341511035141337021220 0ustar sylvestresylvestre--------------------------------------- Domain: - Q + 3S -5 >= 0 P -3S + 8 >= 0 - R + 3S -5 >= 0 P - R >= 0 Q + R -3S + 1 >= 0 1 >= 0 Vertices: [ S-1, -Q+3S-4 ] [ Q/3+2/3 , 1 ] [ S-1, 3S-8 ] [ 2, 1 ] Ehrhart Polynomial: ( -1/6 * Q^2 + ( 1 * S + -7/6 ) * Q + [ ( -3 * S + 5 ) , ( -3 * S + 16/3 ) , ( -3 * S + 5 ) ]_Q ) --------------------------------------- Domain: - Q + 3S -5 >= 0 - P + 3S -8 >= 0 P - R >= 0 Q + R -3S + 1 >= 0 1 >= 0 Vertices: [ S-1, -Q+3S-4 ] [ Q/3+2/3 , 1 ] [ S-1, P ] [ 2, 1 ] [ P/3+5/3 , P ] Ehrhart Polynomial: ( -1/6 * P^2 + ( 1 * S + -13/6 ) * P + [ ( -1/6 * Q^2 + ( 1 * S + -7/6 ) * Q + [ ( -3/2 * S^2 + 7/2 * S + -2 ) , ( -3/2 * S^2 + 7/2 * S + -5/3 ) , ( -3/2 * S^2 + 7/2 * S + -2 ) ]_Q ) , ( -1/6 * Q^2 + ( 1 * S + -7/6 ) * Q + [ ( -3/2 * S^2 + 7/2 * S + -5/3 ) , ( -3/2 * S^2 + 7/2 * S + -4/3 ) , ( -3/2 * S^2 + 7/2 * S + -5/3 ) ]_Q ) , ( -1/6 * Q^2 + ( 1 * S + -7/6 ) * Q + [ ( -3/2 * S^2 + 7/2 * S + -2 ) , ( -3/2 * S^2 + 7/2 * S + -5/3 ) , ( -3/2 * S^2 + 7/2 * S + -2 ) ]_Q ) ]_P ) --------------------------------------- Domain: Q -3S + 5 >= 0 P -3S + 8 >= 0 - R + 3S -5 >= 0 P - R >= 0 S -3 >= 0 R -1 >= 0 Q + R -3S + 1 >= 0 1 >= 0 Vertices: [ S-1, 1 ] [ S-1, 3S-8 ] [ 2, 1 ] Ehrhart Polynomial: ( 3/2 * S^2 + -13/2 * S + 7 ) --------------------------------------- Domain: - P + 3S -8 >= 0 Q -3S + 5 >= 0 P - R >= 0 R -1 >= 0 Q + R -3S + 1 >= 0 1 >= 0 Vertices: [ S-1, 1 ] [ S-1, P ] [ 2, 1 ] [ P/3+5/3 , P ] Ehrhart Polynomial: ( -1/6 * P^2 + ( 1 * S + -13/6 ) * P + [ 0, 1/3, 0 ]_P ) polylib-5.22.5.orig/Test/ehrhart/e13.out0000644000175000017500000000172611035141337020601 0ustar sylvestresylvestre--------------------------------------- Domain: n - p >= 0 n -9 >= 0 m -1 >= 0 p -1 >= 0 1 >= 0 Vertices: [ n-p, n+m/2-p, 0 ] [ n-p, 0, 0 ] [ n, n+m/2, p ] [ n, n+m/2, 0 ] [ n, 0, p ] [ n, 0, 0 ] Ehrhart Polynomial: ( ( 1/2 * p^2 + 3/2 * p + 1 ) * n + ( ( 1/4 * p^2 + 3/4 * p + 1/2 ) * m + [ ( -1/6 * p^3 + 0 * p^2 + 7/6 * p + 1 ) , ( -1/6 * p^3 + -1/4 * p^2 + 5/12 * p + 1/2 ) ]_m ) ) --------------------------------------- Domain: - n + p >= 0 n -9 >= 0 m -1 >= 0 1 >= 0 Vertices: [ n, n+m/2, p ] [ n, n+m/2, 0 ] [ n, 0, p ] [ n, 0, 0 ] [ 0, m/2, -n+p ] [ 0, m/2, 0 ] [ 0, 0, -n+p ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -1/6 * n^3 + ( -1/4 * m + [ ( 1/2 * p + 0 ) , ( 1/2 * p + 1/4 ) ]_m ) * n^2 + ( ( 1/2 * p + 1/4 ) * m + [ ( 3/2 * p + 7/6 ) , ( 1 * p + 11/12 ) ]_m ) * n + ( ( 1/2 * p + 1/2 ) * m + [ ( 1 * p + 1 ) , ( 1/2 * p + 1/2 ) ]_m ) ) polylib-5.22.5.orig/Test/ehrhart/tpar.in0000644000175000017500000000011211035141337020742 0ustar sylvestresylvestre# two parameters: 2M=N test 2 5 1 1 0 0 0 1 -1 1 0 0 1 4 0 2 -1 0 M N polylib-5.22.5.orig/Test/ehrhart/t1.in0000644000175000017500000000041111035141337020322 0ustar sylvestresylvestre 4 5 1 0 1 0 0 # j>=0 1 1 -1 0 0 # i>=j 1 1 0 -1 0 # i>=P 1 -1 0 0 10 # 10>=i 1 3 1 1 0 # P>=0 P First simple test --------------------------------------- Domain : - P + 10 >= 0 P >= 0 Vertices : [ 10, 10 ] [ P, P ] [ 10, 0 ] [ P, 0 ] polylib-5.22.5.orig/Test/ehrhart/8hedron.out0000644000175000017500000000036011035141337021551 0ustar sylvestresylvestre--------------------------------------- Domain: N >= 0 1 >= 0 Vertices: [ -N, 0, 0 ] [ 0, -N, 0 ] [ 0, 0, -N ] [ 0, 0, N ] [ 0, N, 0 ] [ N, 0, 0 ] Ehrhart Polynomial: ( 4/3 * N^3 + 2 * N^2 + 8/3 * N + 1 ) polylib-5.22.5.orig/Test/ehrhart/8hedron.in0000644000175000017500000000020611035141337021347 0ustar sylvestresylvestre 8 6 1 -1 -1 -1 1 0 1 -1 -1 1 1 0 1 -1 1 -1 1 0 1 -1 1 1 1 0 1 1 -1 -1 1 0 1 1 -1 1 1 0 1 1 1 -1 1 0 1 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/ehrhart/g4.out0000644000175000017500000000143711035141337020522 0ustar sylvestresylvestre--------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 -3k0 + a0 + a1 -2 >= 0 - k0 + a0 -1 >= 0 - k0 + a1 -1 >= 0 k0 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 - k0 + N -2 >= 0 1 >= 0 Vertices: [ 1, 1, 0 ] [ k0+1, k0+1, k0 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain: i0 - k0 -1 = 0 j0 - k0 -1 = 0 3k0 - a0 - a1 + 2 >= 0 - k0 + a0 -1 >= 0 - k0 + a1 -1 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 - k0 + N -2 >= 0 1 >= 0 Vertices: [ 3k0-a0-a1+3, 3k0-a0-a1+3, 3k0-a0-a1+2 ] [ k0+1, k0+1, k0 ] Ehrhart Polynomial: ( -2 * k0 + ( 1 * a0 + ( 1 * a1 + -1 ) ) ) polylib-5.22.5.orig/Test/ehrhart/esum.out0000644000175000017500000000366311035141337021164 0ustar sylvestresylvestre--------------------------------------- Domain: P -1 >= 0 -13P + 29 >= 0 Vertices: [ 1, 1, 1, 1 ] [ -13P/9+38/9 , -P/9+146/117 , -P/9+146/117 , -P/9+146/117 ] [ -13P/9+38/9 , 1, -P/9+146/117 , -P/9+146/117 ] [ -13P/9+38/9 , -P/9+146/117 , 1, -P/9+146/117 ] [ -13P/9+38/9 , 1, 1, -P/9+146/117 ] [ -13P/9+38/9 , -P/9+146/117 , -P/9+146/117 , 1 ] [ -13P/9+38/9 , 1, -P/9+146/117 , 1 ] [ -13P/9+38/9 , -P/9+146/117 , 1, 1 ] [ -13P/9+38/9 , 1, 1, 1 ] Ehrhart Polynomial: ( [ 0, 1/78732, 1/157464, 0, 0, 0, 0, 0, 0 ]_P * P^4 + [ 0, -47/39366, -49/78732, 0, 0, 0, 0, 0, 0 ]_P * P^3 + [ 0, 1037/26244, 1133/52488, 0, 0, 0, 0, 0, 0 ]_P * P^2 + [ 0, -21197/39366, -24451/78732, 0, 0, 0, 0, 0, 0 ]_P * P + [ 0, 49210/19683, 30305/19683, 0, 0, 0, 0, 0, 0 ]_P ) --------------------------------------- Domain: - P + 1 >= 0 P >= 0 Vertices: [ -13P/9+38/9 , -P/9+146/117 , -P/9+146/117 , -P/9+146/117 ] [ -13P/9+38/9 , 1, -P/9+146/117 , -P/9+146/117 ] [ -13P/9+38/9 , -P/9+146/117 , 1, -P/9+146/117 ] [ -13P/9+38/9 , 1, 1, -P/9+146/117 ] [ -13P/9+38/9 , -P/9+146/117 , -P/9+146/117 , 1 ] [ -13P/9+38/9 , 1, -P/9+146/117 , 1 ] [ -13P/9+38/9 , -P/9+146/117 , 1, 1 ] [ -13P/9+38/9 , 1, 1, 1 ] [ -13P/9+22/9 , -P/9+10/9 , -P/9+10/9 , -P/9+10/9 ] [ -13P/9+22/9 , 1, -P/9+10/9 , -P/9+10/9 ] [ -13P/9+22/9 , -P/9+10/9 , 1, -P/9+10/9 ] [ -13P/9+22/9 , 1, 1, -P/9+10/9 ] [ -13P/9+22/9 , -P/9+10/9 , -P/9+10/9 , 1 ] [ -13P/9+22/9 , 1, -P/9+10/9 , 1 ] [ -13P/9+22/9 , -P/9+10/9 , 1, 1 ] [ -13P/9+22/9 , 1, 1, 1 ] Ehrhart Polynomial: ( [ -2/729, -2/729, -2/729, -1/729, -2/729, -2/729, -2/729, -2/729, -2/729 ]_P * P^3 + [ 2/27, 20/243, 13/243, 1/81, 8/243, 10/243, 4/81, 14/243, 16/243 ]_P * P^2 + [ -2/3, -200/243, -125/243, -1/27, -32/243, -50/243, -8/27, -98/243, -128/243 ]_P * P + [ 2, 2000/729, 1339/729, 1/27, 128/729, 250/729, 16/27, 686/729, 1024/729 ]_P ) polylib-5.22.5.orig/Test/ehrhart/g1.in0000644000175000017500000000172011035141337020311 0ustar sylvestresylvestre# Gauss Anticipated memory # # lambda = ( 1 1 1 ) # # sigma = ( 1 0 0 ) # ( 0 1 0 ) # P = a1, Q = a2 # R = i0, S = j0, T = k0 # U = N # i j k P Q R S T U cte 7 11 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 0 0 1 0 0 0 0 0 0 -1 # k >= 1 1 0 0 -1 1 0 0 0 0 0 0 # k <= a1 1 0 0 -1 0 1 0 0 0 0 0 # k <= a2 1 0 0 1 1 1 -1 -1 -1 0 -1 # a1 + a2 + k >= i0 + j0 + k0 + 1 1 0 0 -1 -1 -1 0 0 1 2 1 # a1 + a2 + k <= k0 + 2 N + 1 # 6 params # P Q R S T U cte 11 8 1 0 0 0 0 0 1 0 # N >= 0 1 0 0 1 0 -1 0 0 # i0 >= k0 1 0 0 -1 0 0 1 1 # i0 <= N + 1 1 0 0 0 1 -1 0 0 # j0 >= k 1 0 0 0 -1 0 1 0 # j0 <= N 1 0 0 0 0 1 0 -1 # k0 >= 1 1 0 0 0 0 -1 1 0 # k0 <= N 1 1 0 0 0 -1 0 0 # a1 >= k0 1 -1 0 0 0 0 1 1 # a1 <= N + 1 1 0 1 0 0 -1 0 0 # a2 >= k 1 0 -1 0 0 0 1 0 # a2 <= N polylib-5.22.5.orig/Test/ehrhart/e4.in0000644000175000017500000000017111035141337020311 0ustar sylvestresylvestre# 0 <= i <= 5 # 0 <= j <= N #------------ 4 5 1 1 0 0 0 1 -1 0 0 5 1 0 1 0 0 1 0 -1 1 0 1 3 1 1 0 N 4th example polylib-5.22.5.orig/Test/ehrhart/t1.out0000644000175000017500000000030311035141337020523 0ustar sylvestresylvestre--------------------------------------- Domain: P >= 0 - P + 10 >= 0 Vertices: [ 10, 10 ] [ P, P ] [ 10, 0 ] [ P, 0 ] Ehrhart Polynomial: ( -1/2 * P^2 + -1/2 * P + 66 ) polylib-5.22.5.orig/Test/ehrhart/Makefile.am0000644000175000017500000000316611341227526021521 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.8 2005/10/20 11:35:25 verdoolaege Exp $ # OBJ_DIR = $(top_builddir) EHRHART_BASE = \ 0D.in \ 0D2.in \ 8hedron.in \ alex11.in \ alex1.in \ bart6.in \ bart8.in \ c3.in\ c4.in\ e0.in\ e10.in\ e11.in\ e12.in\ e13.in\ e14.in\ e15.in\ e16.in\ e1.in\ e2b.in\ e2.in\ e3.in\ e4.in\ e5.in\ e6.in\ e7.in\ e8.in\ e9.in\ esum.in \ g12.in\ g13.in\ g14.in\ g1.in\ g2.in\ g4.in\ g5.in\ isnm2.in\ t1.in\ t2.in\ t31.in\ t3.in\ t4.in\ t12.in\ tpar.in EHRHART_EXTRA=bart8.in isnm2.in e16.in esum.in t12.in EHRHART=$(EHRHART_BASE) $(EHRHART_EXTRA) EXTRA_DIST = $(EHRHART) # not using %.in GNU extension dist-hook: for pl_file in $(EHRHART) ; do test -f $(distdir)/`basename $$pl_file .in`.out || cp -p $(srcdir)/`basename $$pl_file .in`.out $(distdir) ; done # not using filter-out gnu extension EHRHART_TESTS = `if test $(TEST_BITS) = 32 ; then echo $(EHRHART_BASE) ; else echo $(EHRHART) ; fi ` tests: @failedtest=0; \ for x in $(EHRHART_TESTS) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/testehrhart$(TEST_BITS) < $(srcdir)/$$x >xyz; \ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart works correctly"; \ fi longtest: @for x in $(EHRHART_TESTS) ; do \ echo "Verify Ehrhart for $$x"; \ $(OBJ_DIR)/verif_ehrhart$(TEST_BITS) < $(srcdir)/$$x ;\ done ; CLEANFILES=xyz polylib-5.22.5.orig/Test/ehrhart/e8.out0000644000175000017500000000025711035141337020523 0ustar sylvestresylvestre--------------------------------------- Domain: n -1 >= 0 1 >= 0 Vertices: [ n, n ] [ 2n-1, 1 ] [ 1, 1 ] Ehrhart Polynomial: ( 1 * n^2 + 0 * n + 0 ) polylib-5.22.5.orig/Test/ehrhart/e16.out0000644000175000017500000002051711035141337020603 0ustar sylvestresylvestre--------------------------------------- Domain: n -100 >= 0 p -100 >= 0 m >= 0 - n + 150 >= 0 Vertices: [ n-100, n+m/2-100, 0 ] [ n-100, 0, 0 ] [ n/3, n/3+m/2, -n/6+25 ] [ n/3, n/3+m/2, 0 ] [ n/3, 0, -n/6+25 ] [ n/3, 0, 0 ] Ehrhart Polynomial: ( 5/162 * n^3 + [ ( 1/36 * m + [ -409/36, -205/18 ]_m ) , ( 1/36 * m + [ -1225/108, -307/27 ]_m ) , ( 1/36 * m + [ -1223/108, -613/54 ]_m ) ]_n * n^2 + [ ( -103/12 * m + [ 11702/9, 47117/36 ]_m ) , ( -77/9 * m + [ 70055/54, 70517/54 ]_m ) , ( -307/36 * m + [ 69911/54, 140743/108 ]_m ) , ( -103/12 * m + [ 11702/9, 47117/36 ]_m ) , ( -77/9 * m + [ 35032/27, 35263/27 ]_m ) , ( -307/36 * m + [ 69911/54, 140743/108 ]_m ) ]_n * n + [ ( 663 * m + [ -43524, -44187 ]_m ) , ( 23707/36 * m + [ -14105665/324, -3579757/81 ]_m ) , ( 5890/9 * m + [ -3527084/81, -3580094/81 ]_m ) , ( 663 * m + [ -174097/4, -176749/4 ]_m ) , ( 5929/9 * m + [ -3526369/81, -3579730/81 ]_m ) , ( 5890/9 * m + [ -14108255/324, -14320295/324 ]_m ) ]_n ) --------------------------------------- Domain: n - p >= 0 - p + 100 >= 0 m >= 0 -2n + 3p >= 0 Vertices: [ n-p, n+m/2-p, 0 ] [ n-p, 0, 0 ] [ n/3, n/3+m/2, -n/6+p/4 ] [ n/3, n/3+m/2, 0 ] [ n/3, 0, -n/6+p/4 ] [ n/3, 0, 0 ] Ehrhart Polynomial: ( 5/162 * n^3 + [ ( 1/36 * m + [ ( -1/9 * p + -1/4 ) , ( -1/9 * p + -5/18 ) ]_m ) , ( 1/36 * m + [ ( -1/9 * p + -25/108 ) , ( -1/9 * p + -7/27 ) ]_m ) , ( 1/36 * m + [ ( -1/9 * p + -23/108 ) , ( -1/9 * p + -13/54 ) ]_m ) ]_n * n^2 + [ ( ( -1/12 * p + -1/4 ) * m + [ ( 1/8 * p^2 + 1/2 * p + [ 2/9, 19/72, 2/9, 7/72 ]_p ) , ( 1/8 * p^2 + 7/12 * p + [ 17/36, 37/72, 17/36, 25/72 ]_p ) ]_m ) , ( ( -1/12 * p + -2/9 ) * m + [ ( 1/8 * p^2 + 17/36 * p + [ 5/54, 47/216, 7/27, 47/216 ]_p ) , ( 1/8 * p^2 + 5/9 * p + [ 17/54, 95/216, 13/27, 95/216 ]_p ) ]_m ) , ( ( -1/12 * p + -7/36 ) * m + [ ( 1/8 * p^2 + 4/9 * p + [ 11/54, 17/216, 11/54, 53/216 ]_p ) , ( 1/8 * p^2 + 19/36 * p + [ 43/108, 59/216, 43/108, 95/216 ]_p ) ]_m ) , ( ( -1/12 * p + -1/4 ) * m + [ ( 1/8 * p^2 + 1/2 * p + [ 2/9, 7/72, 2/9, 19/72 ]_p ) , ( 1/8 * p^2 + 7/12 * p + [ 17/36, 25/72, 17/36, 37/72 ]_p ) ]_m ) , ( ( -1/12 * p + -2/9 ) * m + [ ( 1/8 * p^2 + 17/36 * p + [ 7/27, 47/216, 5/54, 47/216 ]_p ) , ( 1/8 * p^2 + 5/9 * p + [ 13/27, 95/216, 17/54, 95/216 ]_p ) ]_m ) , ( ( -1/12 * p + -7/36 ) * m + [ ( 1/8 * p^2 + 4/9 * p + [ 11/54, 53/216, 11/54, 17/216 ]_p ) , ( 1/8 * p^2 + 19/36 * p + [ 43/108, 95/216, 43/108, 59/216 ]_p ) ]_m ) ]_n * n + [ ( ( 1/16 * p^2 + 3/8 * p + [ 1/2, 9/16, 1/2, 5/16 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + 1/6 * p + [ 1, 17/16, 3/4, 5/16 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -5/24 * p + [ 1/2, 1/2, 1/4, 0 ]_p ) ]_m ) , ( ( 1/16 * p^2 + 1/3 * p + [ 7/36, 55/144, 4/9, 55/144 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + 1/18 * p + [ 35/324, 869/1296, 56/81, 545/1296 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -5/18 * p + [ -7/81, 187/648, 20/81, 25/648 ]_p ) ]_m ) , ( ( 1/16 * p^2 + 7/24 * p + [ 5/18, 13/144, 5/18, 49/144 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + -1/36 * p + [ 16/81, 13/1296, 145/324, 553/1296 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -23/72 * p + [ -13/162, -13/162, 55/324, 7/81 ]_p ) ]_m ) , ( ( 1/16 * p^2 + 3/8 * p + [ 1/2, 5/16, 1/2, 9/16 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + 1/6 * p + [ 3/4, 5/16, 1, 17/16 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -5/24 * p + [ 1/4, 0, 1/2, 1/2 ]_p ) ]_m ) , ( ( 1/16 * p^2 + 1/3 * p + [ 4/9, 55/144, 7/36, 55/144 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + 1/18 * p + [ 56/81, 545/1296, 35/324, 869/1296 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -5/18 * p + [ 20/81, 25/648, -7/81, 187/648 ]_p ) ]_m ) , ( ( 1/16 * p^2 + 7/24 * p + [ 5/18, 49/144, 5/18, 13/144 ]_p ) * m + [ ( -1/24 * p^3 + -3/16 * p^2 + -1/36 * p + [ 145/324, 553/1296, 16/81, 13/1296 ]_p ) , ( -1/24 * p^3 + -1/4 * p^2 + -23/72 * p + [ 55/324, 7/81, -13/162, -13/162 ]_p ) ]_m ) ]_n ) --------------------------------------- Domain: p -100 >= 0 - n + 100 >= 0 m >= 0 n >= 0 Vertices: [ n/3, n/3+m/2, -n/6+25 ] [ n/3, n/3+m/2, 0 ] [ n/3, 0, -n/6+25 ] [ n/3, 0, 0 ] [ 0, m/2, -n/4+25 ] [ 0, m/2, 0 ] [ 0, 0, -n/4+25 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -7/648 * n^3 + [ ( -5/144 * m + [ 191/144, 49/36 ]_m ) , ( -5/144 * m + [ 581/432, 149/108 ]_m ) , ( -5/144 * m + [ 589/432, 151/108 ]_m ) ]_n * n^2 + [ ( 25/6 * m + [ 455/36, 305/36 ]_m ) , ( 151/36 * m + [ 1051/108, 299/54 ]_m ) , ( 38/9 * m + [ 763/108, 307/108 ]_m ) , ( 25/6 * m + [ 455/36, 305/36 ]_m ) , ( 151/36 * m + [ 1069/108, 154/27 ]_m ) , ( 38/9 * m + [ 763/108, 307/108 ]_m ) ]_n * n + [ ( 13 * m + [ 26, 13 ]_m ) , ( 1201/144 * m + [ 18059/1296, 3625/648 ]_m ) , ( 151/36 * m + [ 1783/324, 106/81 ]_m ) , ( 205/16 * m + [ 407/16, 101/8 ]_m ) , ( 79/9 * m + [ 1181/81, 470/81 ]_m ) , ( 613/144 * m + [ 7699/1296, 1091/648 ]_m ) , ( 51/4 * m + [ 103/4, 13 ]_m ) , ( 1201/144 * m + [ 17735/1296, 3463/648 ]_m ) , ( 40/9 * m + [ 466/81, 106/81 ]_m ) , ( 205/16 * m + [ 411/16, 103/8 ]_m ) , ( 307/36 * m + [ 4643/324, 470/81 ]_m ) , ( 613/144 * m + [ 7375/1296, 929/648 ]_m ) ]_n ) --------------------------------------- Domain: - p + 100 >= 0 - n + p >= 0 m >= 0 n >= 0 Vertices: [ n/3, n/3+m/2, -n/6+p/4 ] [ n/3, n/3+m/2, 0 ] [ n/3, 0, -n/6+p/4 ] [ n/3, 0, 0 ] [ 0, m/2, -n/4+p/4 ] [ 0, m/2, 0 ] [ 0, 0, -n/4+p/4 ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -7/648 * n^3 + [ ( -5/144 * m + [ ( 1/72 * p + -1/16 ) , ( 1/72 * p + -1/36 ) ]_m ) , ( -5/144 * m + [ ( 1/72 * p + -19/432 ) , ( 1/72 * p + -1/108 ) ]_m ) , ( -5/144 * m + [ ( 1/72 * p + -11/432 ) , ( 1/72 * p + 1/108 ) ]_m ) ]_n * n^2 + [ ( ( 1/24 * p + 0 ) * m + [ ( 1/8 * p + [ 5/36, 13/72, 5/36, 1/72 ]_p ) , ( 1/12 * p + [ 5/36, 13/72, 5/36, 1/72 ]_p ) ]_m ) , ( ( 1/24 * p + 1/36 ) * m + [ ( 7/72 * p + [ 1/108, 29/216, 19/108, 29/216 ]_p ) , ( 1/18 * p + [ -1/54, 23/216, 4/27, 23/216 ]_p ) ]_m ) , ( ( 1/24 * p + 1/18 ) * m + [ ( 5/72 * p + [ 13/108, -1/216, 13/108, 35/216 ]_p ) , ( 1/36 * p + [ 7/108, -13/216, 7/108, 23/216 ]_p ) ]_m ) , ( ( 1/24 * p + 0 ) * m + [ ( 1/8 * p + [ 5/36, 1/72, 5/36, 13/72 ]_p ) , ( 1/12 * p + [ 5/36, 1/72, 5/36, 13/72 ]_p ) ]_m ) , ( ( 1/24 * p + 1/36 ) * m + [ ( 7/72 * p + [ 19/108, 29/216, 1/108, 29/216 ]_p ) , ( 1/18 * p + [ 4/27, 23/216, -1/54, 23/216 ]_p ) ]_m ) , ( ( 1/24 * p + 1/18 ) * m + [ ( 5/72 * p + [ 13/108, 35/216, 13/108, -1/216 ]_p ) , ( 1/36 * p + [ 7/108, 23/216, 7/108, -13/216 ]_p ) ]_m ) ]_n * n + [ ( ( 1/8 * p + [ 1/2, 3/8, 1/4, 1/8 ]_p ) * m + [ ( 1/4 * p + [ 1, 3/4, 1/2, 1/4 ]_p ) , ( 1/8 * p + [ 1/2, 3/8, 1/4, 1/8 ]_p ) ]_m ) , ( ( 1/12 * p + [ 1/144, 55/144, 37/144, 19/144 ]_p ) * m + [ ( 5/36 * p + [ 59/1296, 869/1296, 491/1296, 221/1296 ]_p ) , ( 1/18 * p + [ 25/648, 187/648, 79/648, 25/648 ]_p ) ]_m ) , ( ( 1/24 * p + [ 1/36, -7/72, 5/18, 11/72 ]_p ) * m + [ ( 1/18 * p + [ -17/324, -17/324, 145/324, 37/324 ]_p ) , ( 1/72 * p + [ -13/162, 29/648, 55/324, -25/648 ]_p ) ]_m ) , ( ( 1/8 * p + [ 5/16, 1/16, 5/16, 9/16 ]_p ) * m + [ ( 1/4 * p + [ 7/16, 1/16, 15/16, 17/16 ]_p ) , ( 1/8 * p + [ 1/8, 0, 5/8, 1/2 ]_p ) ]_m ) , ( ( 1/12 * p + [ 4/9, 7/36, -1/18, 7/36 ]_p ) * m + [ ( 5/36 * p + [ 56/81, 35/324, -23/162, 197/324 ]_p ) , ( 1/18 * p + [ 20/81, -7/81, -7/81, 67/162 ]_p ) ]_m ) , ( ( 1/24 * p + [ 13/144, 49/144, 13/144, -23/144 ]_p ) * m + [ ( 1/18 * p + [ 499/1296, 553/1296, -149/1296, -311/1296 ]_p ) , ( 1/72 * p + [ 191/648, 7/81, -133/648, -13/162 ]_p ) ]_m ) , ( ( 1/8 * p + [ 1/4, 3/8, 1/2, 1/8 ]_p ) * m + [ ( 1/4 * p + [ 3/4, 1, 3/4, 0 ]_p ) , ( 1/8 * p + [ 1/2, 5/8, 1/4, -1/8 ]_p ) ]_m ) , ( ( 1/12 * p + [ 1/144, 19/144, 37/144, 55/144 ]_p ) * m + [ ( 5/36 * p + [ -265/1296, 545/1296, 815/1296, 545/1296 ]_p ) , ( 1/18 * p + [ -137/648, 187/648, 241/648, 25/648 ]_p ) ]_m ) , ( ( 1/24 * p + [ 5/18, -7/72, 1/36, 11/72 ]_p ) * m + [ ( 1/18 * p + [ 16/81, -49/162, 16/81, 59/162 ]_p ) , ( 1/72 * p + [ -13/162, -133/648, 55/324, 137/648 ]_p ) ]_m ) , ( ( 1/8 * p + 5/16 ) * m + [ ( 1/4 * p + [ 11/16, 5/16, 11/16, 13/16 ]_p ) , ( 1/8 * p + [ 3/8, 0, 3/8, 1/2 ]_p ) ]_m ) , ( ( 1/12 * p + 7/36 ) * m + [ ( 5/36 * p + [ 143/324, 29/81, 35/324, 29/81 ]_p ) , ( 1/18 * p + [ 20/81, 53/324, -7/81, 53/324 ]_p ) ]_m ) , ( ( 1/24 * p + 13/144 ) * m + [ ( 1/18 * p + [ 175/1296, 229/1296, 175/1296, 13/1296 ]_p ) , ( 1/72 * p + [ 29/648, 7/81, 29/648, -13/162 ]_p ) ]_m ) ]_n ) polylib-5.22.5.orig/Test/ehrhart/e2.out0000644000175000017500000000144111035141337020511 0ustar sylvestresylvestre--------------------------------------- Domain: P - R >= 0 R >= 0 Q >= 0 1 >= 0 Vertices: [ P-R, 2P+Q-2R, 0 ] [ P-R, 0, 0 ] [ P, 2P+Q, R ] [ P, 2P+Q, 0 ] [ P, 0, R ] [ P, 0, 0 ] Ehrhart Polynomial: ( ( 1 * R^2 + 3 * R + 2 ) * P + ( ( 1/2 * R^2 + 3/2 * R + 1 ) * Q + ( -1/3 * R^3 + -1/2 * R^2 + 5/6 * R + 1 ) ) ) --------------------------------------- Domain: - P + R >= 0 P >= 0 Q >= 0 1 >= 0 Vertices: [ P, 2P+Q, R ] [ P, 2P+Q, 0 ] [ P, 0, R ] [ P, 0, 0 ] [ 0, Q, -P+R ] [ 0, Q, 0 ] [ 0, 0, -P+R ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -1/3 * P^3 + ( -1/2 * Q + ( 1 * R + 1/2 ) ) * P^2 + ( ( 1 * R + 1/2 ) * Q + ( 2 * R + 11/6 ) ) * P + ( ( 1 * R + 1 ) * Q + ( 1 * R + 1 ) ) ) polylib-5.22.5.orig/Test/ehrhart/g12.out0000644000175000017500000000127011035141337020574 0ustar sylvestresylvestre--------------------------------------- Domain: i0 - a0 = 0 j0 - k0 -1 = 0 -2k0 + a1 -1 >= 0 - k0 + a0 -2 >= 0 - k0 + a1 -2 >= 0 k0 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 1 >= 0 Vertices: [ a0, 1, 0 ] [ a0, k0+1, k0 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain: i0 - a0 = 0 j0 - k0 -1 = 0 2k0 - a1 + 1 >= 0 - k0 + a0 -2 >= 0 - k0 + a1 -2 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 1 >= 0 Vertices: [ a0, 2k0-a1+2, 2k0-a1+1 ] [ a0, k0+1, k0 ] Ehrhart Polynomial: ( -1 * k0 + ( 1 * a1 + 0 ) ) polylib-5.22.5.orig/Test/ehrhart/e5.in0000644000175000017500000000040711035141337020314 0ustar sylvestresylvestre# 1 <= i <= N # 1 <= j <= i # j <= k <= M # 1 <= N,M #------------- # i j k N M 6 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -1 1 1 -1 0 0 0 0 1 0 -1 1 0 0 0 1 0 0 -1 0 1 0 2 4 1 1 0 -1 1 0 1 -1 N M 5th example polylib-5.22.5.orig/Test/ehrhart/e3.out0000644000175000017500000000065611035141337020521 0ustar sylvestresylvestre--------------------------------------- Domain: Q >= 0 P >= 0 - P + R >= 0 1 >= 0 Vertices: [ P, 2P+Q, R ] [ P, 2P+Q, 0 ] [ P, 0, R ] [ P, 0, 0 ] [ 0, Q, -P+R ] [ 0, Q, 0 ] [ 0, 0, -P+R ] [ 0, 0, 0 ] Ehrhart Polynomial: ( -1/3 * P^3 + ( -1/2 * Q + ( 1 * R + 1/2 ) ) * P^2 + ( ( 1 * R + 1/2 ) * Q + ( 2 * R + 11/6 ) ) * P + ( ( 1 * R + 1 ) * Q + ( 1 * R + 1 ) ) ) polylib-5.22.5.orig/Test/ehrhart/e15.in0000644000175000017500000000056411035141337020401 0ustar sylvestresylvestre# Vincent's example 7 7 # i j k P Q 1 -1 0 0 0 0 0 # -P <= i <= 0 1 1 0 0 1 0 0 # 1 0 -1 0 0 0 0 # i <= j <= 0 1 -1 1 0 0 0 0 # 1 0 0 -1 0 0 0 # i-j <= k <= 0 1 -1 1 1 0 0 0 # 0 1 1 1 0 -1 0 # Q = i+j+k 0 4 P Q Little parameter domain example polylib-5.22.5.orig/Test/ehrhart/bart6.out0000644000175000017500000000060611035141337021223 0ustar sylvestresylvestre--------------------------------------- Domain: P - S + 1 >= 0 - P + S + 1 >= 0 - S >= 0 Q -1 >= 0 - Q + R >= 0 Vertices: [ Q, Q, S/3+1/3 , P/3-1/3 , S/3-1/3 ] [ Q, Q, S/3+1/3 , P/3-1/3 , S/3+1/3 ] [ Q, Q, S/3+2/3 , P/3-1/3 , S/3-1/3 ] [ Q, Q, S/3+2/3 , P/3-1/3 , S/3+1/3 ] Ehrhart Polynomial: [ 0, [ 0, 1, 1 ]_S, 0 ]_P polylib-5.22.5.orig/Test/ehrhart/e14.in0000644000175000017500000000121111035141337020366 0ustar sylvestresylvestre# Philippe's simple example #-------------------------- # 1 <= i <= N # 1 <= j <= N # 1 <= k <= N # i+j+k-2 = M #-------------------------- 7 7 # i j k N M 1 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -1 1 0 -1 0 1 0 0 1 0 0 1 0 0 -1 1 0 0 -1 1 0 0 0 -1 -1 -1 0 1 2 #-------------------------- 0 4 N M Philippe's simple example #-------------------------- # I have done the work by hand, and here is the right # answer : # # If 1 <= M <= N then EP(N,M) = 1/2 M^2 + 1/2 M # If N <= M <= 2N-1 then EP(N,M) = -3/2 N^2 - M^2 + 3NM - M # If 2N-1 <= M <= 3N-2 then EP(N,M) = 9/2 N^2 + 1/2 M^2 - 3NM - 3/2 N + 1/2 M polylib-5.22.5.orig/Test/ehrhart/0D.in0000644000175000017500000000001111035141337020235 0ustar sylvestresylvestre0 2 0 2 polylib-5.22.5.orig/Test/ehrhart/c4.in0000644000175000017500000000034211035141337020307 0ustar sylvestresylvestre8 10 1 1 0 0 0 0 0 0 0 0 1 -1 0 0 0 1 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 1 0 -1 0 0 0 1 0 0 0 1 0 -1 1 0 0 0 0 0 0 1 0 0 -1 0 0 0 1 0 0 1 0 0 -1 1 0 0 0 0 0 1 0 0 0 -1 0 0 0 1 0 4 6 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 polylib-5.22.5.orig/Test/ehrhart/0D2.in0000644000175000017500000000030311035141337020323 0ustar sylvestresylvestre6 5 1 0 0 -1 19 1 1 0 0 -1 1 0 1 0 -17 1 -1 0 0 19 1 0 -1 0 19 1 0 0 1 0 0 5 polylib-5.22.5.orig/Test/ehrhart/alex1.in0000644000175000017500000000045011035141337021013 0ustar sylvestresylvestre# From Alexandru (TU Delft) 6 8 1 3 -1 0 0 0 0 -5 1 0 -1 1 0 0 0 0 1 0 1 0 0 0 0 -1 1 -3 1 0 1 0 0 1 1 0 0 0 0 0 0 1 1 -1 0 0 0 0 1 -1 7 6 1 0 0 -1 3 -5 1 1 0 -1 0 0 1 0 0 1 0 -1 1 0 1 1 -3 1 1 0 0 0 0 1 # 1 -1 0 0 0 1000 1 1 0 0 0 0 # 1 0 -1 0 0 1000 1 0 1 0 0 0 polylib-5.22.5.orig/Test/ehrhart/g5.in0000644000175000017500000000212111035141337020311 0ustar sylvestresylvestre# Gauss Anticipated memory # # lambda = ( 0 1 1 ) # # sigma = ( 1 0 0 ) # ( 0 1 0 ) # S(z_0,p,a) = # P = i0, Q = j0, R = k0 # S = N # T = a_0, U = a_1 # i j k P Q R S T U cte 10 11 0 1 0 0 0 0 0 0 -1 0 0 # i = a_0 0 0 1 0 0 0 0 0 0 -1 0 # j = a_1 1 0 1 -1 0 0 0 0 0 0 -1 # j >= k + 1 1 0 -1 0 0 0 0 1 0 0 1 # j <= N + 1 1 1 0 -1 0 0 0 0 0 0 -1 # i >= k + 1 1 -1 0 0 0 0 0 1 0 0 0 # i <= N 1 0 0 1 0 0 0 0 0 0 -1 # k >= 1 1 0 0 -1 0 0 0 1 0 0 -1 # k <= N-1 1 0 1 1 0 -1 -1 0 0 0 -1 # j+k >= j0 + k0 + 1 1 0 -1 -1 0 0 1 0 0 1 1 # j+k <= a1 + k0 +1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 1 8 1 0 0 0 1 0 0 1 # N >= -1 i0 j0 k0 N a0 a1 #1 1 0 -1 0 0 0 -2 # i0 >= k0+2 #1 -1 0 0 1 0 0 0 # i0 <= N #0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 #1 0 0 1 0 0 0 0 # k0 >= 0 #1 0 0 -1 1 0 0 -2 # k0 <= N-2 #0 1 0 0 0 -1 0 0 # a0 = i0 #1 0 0 -1 0 0 1 -1 # a1 >= k0 + 1 #1 0 0 0 1 0 -1 1 # a1 <= N + 1 polylib-5.22.5.orig/Test/ehrhart/t31.out0000644000175000017500000000021511035141337020610 0ustar sylvestresylvestre--------------------------------------- Domain: P -10 = 0 1 >= 0 Vertices: [ 0 ] [ 10 ] Ehrhart Polynomial: ( 11 ) polylib-5.22.5.orig/Test/ehrhart/esum.in0000644000175000017500000000041511035141337020753 0ustar sylvestresylvestre9 7 1 0 0 0 0 1 0 1 9 0 0 0 13 -22 1 -9 0 0 0 -13 38 1 0 0 0 1 0 -1 1 1 0 0 -13 0 12 1 0 0 1 0 0 -1 1 1 0 -13 0 0 12 1 0 1 0 0 0 -1 1 1 -13 0 0 0 12 0 3 polylib-5.22.5.orig/Test/ehrhart/t31.in0000644000175000017500000000024411035141337020411 0ustar sylvestresylvestre2 4 1 1 0 0 # x >= 0 1 -1 1 0 # x <= P 1 3 0 1 -10 P=10 P instanciated parameter test --------------------------- 0 <= x <= P P=10 --------------------------- polylib-5.22.5.orig/Test/ehrhart/e1.in0000644000175000017500000000031511035141337020306 0ustar sylvestresylvestre# This is the first example in the Ehrhart paper 4 6 1 1 0 0 0 0 i >= 0 1 -2 0 1 0 0 -2i + P >= 0 1 0 1 0 0 0 j >= 0 1 0 -2 0 1 0 -2j + Q >= 0 2 4 1 1 0 0 P >= 0 1 0 1 0 Q >= 0 P Q CL'96 example polylib-5.22.5.orig/Test/ehrhart/t2.in0000644000175000017500000000072411035141337020332 0ustar sylvestresylvestre5 5 1 2 0 -1 0 1 -1 1 0 20 1 -1 -1 0 20 1 1 1 0 0 1 1 -1 0 0 1 3 1 1 0 # P>=0 P 2nd simple test x >= n/2 x <= y <= -x 20-x <= y <= x-20 --------------------------------------- Domain : - P + 20 >= 0 P >= 0 Vertices : [ 10, 10 ] [ 10, -10 ] [ 20, 0 ] [ P/2, P/2 ] [ P/2, -P/2 ] --------------------------------------- Domain : - P + 40 >= 0 P -20 >= 0 Vertices : [ 20, 0 ] [ P/2, -P/2+20 ] [ P/2, P/2-20 ] polylib-5.22.5.orig/Test/ehrhart/e15.out0000644000175000017500000000104111035141337020571 0ustar sylvestresylvestre--------------------------------------- Domain: - P - Q >= 0 2P + Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ -P, P+Q, 0 ] [ -P, 0, P+Q ] Ehrhart Polynomial: ( -1/2 * P^2 + ( -1 * Q + 1/2 ) * P + ( -3/8 * Q^2 + [ -1/4, 0 ]_Q * Q + [ 1, 3/8 ]_Q ) ) --------------------------------------- Domain: P + Q >= 0 - Q >= 0 1 >= 0 Vertices: [ Q/2, Q/2, 0 ] [ Q/2, 0, Q/2 ] [ Q, 0, 0 ] Ehrhart Polynomial: ( 1/8 * Q^2 + [ -3/4, -1/2 ]_Q * Q + [ 1, 3/8 ]_Q ) polylib-5.22.5.orig/Test/ehrhart/g2.in0000644000175000017500000000212411035141337020311 0ustar sylvestresylvestre# Gauss Anticipated memory: second dependence # # lambda = ( 1 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte 8 11 0 1 0 0 0 0 0 0 -1 0 0 # i = a_0 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 0 -1 0 0 0 1 0 0 0 1 # j <= k0 + 1 1 0 1 0 -1 -1 -1 0 1 1 -1 # j >= i0 + j0 + k0 - a0 - a1 + 1 1 0 1 0 0 0 0 0 0 0 -1 # j>= 1 1 0 -1 0 0 0 0 1 0 0 -1 # j<= N-1 1 0 -1 0 0 0 0 0 1 0 -1 # j<= a0-1 1 0 -1 0 0 0 0 0 0 1 -1 # j<= a1-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 1 # N >= 1 1 1 0 -1 0 0 0 -2 # i0 >= k0+2 (i0,j0,k0) an emission point 1 -1 0 0 1 0 0 0 # i0 <= N 0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 0 1 0 0 0 -1 0 0 # a0 = i0 (a0,a1) a utilization proc. 1 0 0 -1 0 0 1 -2 # a1 >= k0 + 2 1 0 0 0 1 0 -1 1 # a1 <= N + 1 i0 j0 k0 N a0 a1 Memory - Gauss Pivot polylib-5.22.5.orig/Test/ehrhart/t12.out0000644000175000017500000000167511035141337020622 0ustar sylvestresylvestre--------------------------------------- Domain: - P + 19 >= 0 P -18 >= 0 Vertices: [ P/4+29/2 , 4, P-1, 19P/20+1/20 ] [ P/4+29/2 , 4, P-1, P-1 ] [ P/4+57/4 , 4, P-1, 19P/20+1/20 ] [ P/4+57/4 , 4, P-1, P-1 ] [ P/4+29/2 , 4, 19P/20+1/20 , 19P/20+1/20 ] [ P/4+29/2 , 4, 19P/20+1/20 , P-1 ] [ P/4+57/4 , 4, 19P/20+1/20 , 19P/20+1/20 ] [ P/4+57/4 , 4, 19P/20+1/20 , P-1 ] [ 21P/4-181/2 , P-17, 19P/20+1/20 , 19P/20+1/20 ] [ 21P/4-363/4 , P-17, 19P/20+1/20 , 19P/20+1/20 ] Ehrhart Polynomial: ( [ 0, 0, -1/1200, -1/1200 ]_P * P^3 + [ 0, 0, 13/400, 7/200, 0, 0, 17/400, 9/200, 0, 0, 21/400, 11/200, 0, 0, 1/16, 13/200, 0, 0, 29/400, 3/40 ]_P * P^2 + [ 0, 0, -29/75, -109/240, 0, 0, -103/150, -929/1200, 0, 0, -16/15, -1409/1200, 0, 0, -229/150, -397/240, 0, 0, -31/15, -2657/1200 ]_P * P + [ 0, 0, 33/20, 207/100, 0, 0, 377/100, 9/2, 0, 0, 29/4, 837/100, 0, 0, 1241/100, 14, 0, 0, 1957/100, 2171/100 ]_P ) polylib-5.22.5.orig/Test/ehrhart/bart8.in0000644000175000017500000000127111035141337021023 0ustar sylvestresylvestre# Degenerate Problem Generated by Compaan # Copyright (c) LIACS 2004 # Problem: QR_unfold_mod # Date: 2004.08.18 at 02:40:10 PM GMT+01:00 14 12 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 3 0 -1 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 -1 0 0 0 0 1 1 0 0 -3 0 0 0 0 0 0 1 2 1 0 0 3 0 0 0 0 0 0 -1 -1 1 0 0 0 0 -3 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 -1 1 1 0 0 0 0 0 -1 0 0 0 1 1 1 0 0 0 0 -3 0 0 0 0 1 1 1 0 0 0 0 3 0 0 0 0 -1 1 1 7 1 0 0 0 0 1 0 polylib-5.22.5.orig/Test/ehrhart/e12.out0000644000175000017500000000112411035141337020570 0ustar sylvestresylvestre--------------------------------------- Domain: n - m >= 0 m -1 >= 0 1 >= 0 Vertices: [ m, m, m ] [ 1, 1, m ] [ 1, 1, 1 ] [ n, m, m ] [ n, 1, m ] [ n, 1, 1 ] Ehrhart Polynomial: ( ( 1/2 * m^2 + 1/2 * m + 0 ) * n + ( -1/6 * m^3 + 0 * m^2 + 1/6 * m + 0 ) ) --------------------------------------- Domain: - n + m >= 0 n -1 >= 0 1 >= 0 Vertices: [ 1, 1, m ] [ 1, 1, 1 ] [ n, n, m ] [ n, n, n ] [ n, 1, m ] [ n, 1, 1 ] Ehrhart Polynomial: ( -1/6 * n^3 + ( 1/2 * m + 0 ) * n^2 + ( 1/2 * m + 1/6 ) * n + 0 ) polylib-5.22.5.orig/Test/ehrhart/t2.out0000644000175000017500000000072411035141337020533 0ustar sylvestresylvestre--------------------------------------- Domain: - P + 20 >= 0 P >= 0 Vertices: [ 10, 10 ] [ 10, -10 ] [ 20, 0 ] [ P/2, P/2 ] [ P/2, -P/2 ] Ehrhart Polynomial: ( -1/4 * P^2 + [ 0, -1/2 ]_P * P + [ 221, 883/4 ]_P ) --------------------------------------- Domain: P -20 >= 0 - P + 40 >= 0 Vertices: [ 20, 0 ] [ P/2, -P/2+20 ] [ P/2, P/2-20 ] Ehrhart Polynomial: ( 1/4 * P^2 + [ -21, -41/2 ]_P * P + [ 441, 1681/4 ]_P ) polylib-5.22.5.orig/Test/ehrhart/e9.in0000644000175000017500000000022111035141337020312 0ustar sylvestresylvestre# Pugh's more elaborate example # 1 <= i # j <= n # 2i <= 3j #-------------- 3 5 1 1 0 0 -1 1 0 -1 1 0 1 -2 3 0 0 1 3 1 1 -1 n Pugh's example polylib-5.22.5.orig/Test/ehrhart/t4.in0000644000175000017500000000020311035141337020324 0ustar sylvestresylvestre3 5 0 0 1 -1 5 1 1 -1 0 0 1 -1 0 1 0 2 4 1 1 0 0 1 0 1 0 M N depending parameters test -------------------- m = n-5 m <= x <= n polylib-5.22.5.orig/Test/ehrhart/e16.in0000644000175000017500000000045111035141337020375 0ustar sylvestresylvestre# example 13 # i j k n m p cons 7 8 1 1 0 0 0 0 0 0 1 -3 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 2 -2 0 0 1 0 0 1 0 0 1 0 0 0 0 1 1 0 -4 -1 0 1 0 1 1 0 -4 -1 0 0 100 3 5 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 n m p example 13 polylib-5.22.5.orig/Test/ehrhart_union/0000755000175000017500000000000011341243124020657 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/ehrhart_union/Makefile.in0000644000175000017500000002476711341231332022742 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/ehrhart_union DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) EHRHART_UNION = \ ue1.in \ ue2.in EXTRA_DIST = $(EHRHART_UNION) \ $(EHRHART_UNION:%.in=%.out) TEST = $(EHRHART_UNION:%.in=%.tested) CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/ehrhart_union/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/ehrhart_union/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am tests: @failedtest=0; \ for x in $(EHRHART_UNION) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/ehrhart_union$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart_union works correctly"; \ fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/ehrhart_union/ue2.in0000644000175000017500000000136211035141337021707 0ustar sylvestresylvestre 4 5 1 -1 0 1 0 1 0 1 0 0 1 1 -1 0 0 1 0 -1 0 10 4 5 1 1 0 0 -4 1 -1 0 1 0 1 0 1 0 -4 1 0 -1 1 0 4 5 1 1 0 1 -7 1 -1 0 0 7 1 1 1 0 -7 1 -1 -1 1 7 1 3 1 1 0 # P>=0 N test ##### # 4 domaines disjoints à trouver au début : 4 5 1 -1 0 1 0 1 0 1 0 0 1 1 -1 0 0 1 0 -1 0 3 5 5 1 1 0 0 -4 1 0 -1 1 0 1 -1 1 0 -1 1 0 0 0 1 1 0 -1 0 10 5 5 1 1 0 0 -4 1 -1 0 1 0 1 0 -1 1 0 1 0 1 0 -11 1 0 0 0 1 4 5 1 1 -1 0 0 1 0 -1 0 10 1 -1 0 1 0 1 0 1 0 -4 ##### # polylib-5.22.5.orig/Test/ehrhart_union/ue1.out0000644000175000017500000000063611035141337022112 0ustar sylvestresylvestre N -5 >= 0 - N + 10 >= 0 ( 1 * N^2 + -2 * N + 7 ) ----------------------------------- N -4 = 0 1 >= 0 ( 1/2 * N^2 + 3/2 * N + 1 ) ----------------------------------- N -11 >= 0 1 >= 0 ( 1 * N^2 + -2 * N + 7 ) ----------------------------------- N >= 0 - N + 3 >= 0 ( 1/2 * N^2 + 3/2 * N + 1 ) ----------------------------------- polylib-5.22.5.orig/Test/ehrhart_union/ue2.out0000644000175000017500000000147411035141337022114 0ustar sylvestresylvestre N >= 0 - N + 3 >= 0 ( 3/2 * N^2 + 7/2 * N + 2 ) ----------------------------------- N -8 = 0 1 >= 0 ( 3/2 * N^2 + 7/2 * N + -18 ) ----------------------------------- - N + 10 >= 0 N -9 >= 0 ( 2 * N^2 + -4 * N + 10 ) ----------------------------------- N -11 >= 0 1 >= 0 ( 2 * N^2 + -4 * N + 10 ) ----------------------------------- N -7 = 0 1 >= 0 ( 2 * N^2 + -8 * N + 38 ) ----------------------------------- - N + 6 >= 0 N -5 >= 0 ( 1/2 * N^2 + 17/2 * N + -4 ) ----------------------------------- N -4 = 0 1 >= 0 ( 0 * N^2 + 12 * N + -10 ) ----------------------------------- N -6 = 0 1 >= 0 ( 1 * N^2 + 2 * N + 17 ) ----------------------------------- polylib-5.22.5.orig/Test/ehrhart_union/ue1.in0000644000175000017500000000126511035141337021710 0ustar sylvestresylvestre 4 5 1 -1 0 1 0 1 0 1 0 0 1 1 -1 0 0 1 0 -1 0 10 4 5 1 1 0 0 -4 1 -1 0 1 0 1 0 1 0 -4 1 0 -1 1 0 1 3 1 1 0 # P>=0 N test ##### # 4 domaines disjoints à trouver au début : 4 5 1 -1 0 1 0 1 0 1 0 0 1 1 -1 0 0 1 0 -1 0 3 5 5 1 1 0 0 -4 1 0 -1 1 0 1 -1 1 0 -1 1 0 0 0 1 1 0 -1 0 10 5 5 1 1 0 0 -4 1 -1 0 1 0 1 0 -1 1 0 1 0 1 0 -11 1 0 0 0 1 4 5 1 1 -1 0 0 1 0 -1 0 10 1 -1 0 1 0 1 0 1 0 -4 ##### # polylib-5.22.5.orig/Test/ehrhart_union/Makefile.am0000644000175000017500000000143211341227526022723 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # OBJ_DIR = $(top_builddir) EHRHART_UNION = \ ue1.in \ ue2.in EXTRA_DIST = $(EHRHART_UNION) \ $(EHRHART_UNION:%.in=%.out) TEST=$(EHRHART_UNION:%.in=%.tested) tests: @failedtest=0; \ for x in $(EHRHART_UNION) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/ehrhart_union$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart_union works correctly"; \ fi CLEANFILES=xyz polylib-5.22.5.orig/Test/ranking/0000755000175000017500000000000011341243124017443 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/ranking/Makefile.in0000644000175000017500000002465011341231332021515 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/ranking DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) RANKING = \ asci03-core.in EXTRA_DIST = $(RANKING) \ $(RANKING:%.in=%.out) CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/ranking/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/ranking/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am tests: @failedtest=0; \ for x in $(RANKING) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/ehrhart_ranking$(TEST_BITS) < $(srcdir)/$$x >xyz; \ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart_ranking works correctly"; \ fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/ranking/asci03-core.in0000644000175000017500000000013611035141340022000 0ustar sylvestresylvestre4 4 1 -1 0 5 1 0 1 -1 1 0 -1 4 1 1 0 -1 4 4 1 -1 0 6 1 0 1 -1 1 0 -1 4 1 1 0 -2 0 2 polylib-5.22.5.orig/Test/ranking/Makefile.am0000644000175000017500000000133611341227526021512 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # OBJ_DIR = $(top_builddir) RANKING = \ asci03-core.in EXTRA_DIST = $(RANKING) \ $(RANKING:%.in=%.out) tests: @failedtest=0; \ for x in $(RANKING) ; do \ echo "Verify file $$x" ; \ $(OBJ_DIR)/ehrhart_ranking$(TEST_BITS) < $(srcdir)/$$x >xyz; \ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test ehrhart_ranking works correctly"; \ fi CLEANFILES=xyz polylib-5.22.5.orig/Test/ranking/asci03-core.out0000644000175000017500000000056711035141340022211 0ustar sylvestresylvestre============ Ranking function ============ Q -1 = 0 P -2 >= 0 - P + 6 >= 0 UNION P -6 = 0 Q -1 >= 0 - Q + 4 >= 0 ( 4 * P + -4 ) ----------------------------------- P -2 >= 0 - P + 5 >= 0 Q -2 >= 0 - Q + 4 >= 0 ( 1 * Q + ( 4 * P + -5 ) ) ----------------------------------- polylib-5.22.5.orig/Test/others/0000755000175000017500000000000011035141337017321 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/others/frank0000644000175000017500000000061711035141337020351 0ustar sylvestresylvestre# Example 4 in Philippe's supercomputing paper (96) # run union_disjointe on this input to get a set of 4 disjoint # convex polyhedra. 2 5 5 1 1 0 0 -1 1 <= i 1 -1 0 0 3 i <= 3 1 0 1 0 -1 1 <= j 1 0 -1 1 0 j <= n 1 0 0 1 -1 n>=1 5 5 1 1 0 0 -1 1 <= i 1 -1 0 1 3 i <= n+3 1 0 1 -1 1 n-1 <= j 1 0 -1 1 0 j <= n 1 0 0 1 -1 n>=1 polylib-5.22.5.orig/Test/others/somnath20000644000175000017500000000052511035141337021001 0ustar sylvestresylvestre 7 8 # h_d i_d b n P Q cst 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 29 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 -1 1 0 0 0 197 1 -1 -1024 0 1 0 0 0 0 1 0 0 0 3 # context: two free parameters 0 4 polylib-5.22.5.orig/Test/others/e7.out0000644000175000017500000000071211035141337020365 0ustar sylvestresylvestre--------------------------------------- Domain : P -5 >= 0 1 >= 0 Vertices : [ 5, 5, 5 ] [ 3, 3, 5 ] [ 3, 3, 3 ] [ P, 5, 5 ] [ P, 3, 5 ] [ P, 3, 3 ] Ehrhart Polynomial: ( 6 * P + -16 ) --------------------------------------- Domain : P -3 >= 0 - P + 5 >= 0 Vertices : [ 3, 3, 5 ] [ 3, 3, 3 ] [ P, P, 5 ] [ P, P, P ] [ P, 3, 5 ] [ P, 3, 3 ] Ehrhart Polynomial: ( 1/2 * P^2 + 3/2 * P + -6 ) polylib-5.22.5.orig/Test/others/e7.in0000644000175000017500000000040711035141337020165 0ustar sylvestresylvestre# Haghighat and Polychronopoulos example # 0 <= i <= N # 3 <= j <= i # j <= k <= 5 #------------ 6 6 1 1 0 0 0 0 1 -1 0 0 1 0 1 0 1 0 0 -3 1 1 -1 0 0 0 1 0 -1 1 0 0 1 0 0 -1 0 5 1 3 1 1 0 N Haghighat and Polychronopoulos first example polylib-5.22.5.orig/Test/others/ben20000644000175000017500000000053511035141337020075 0ustar sylvestresylvestre # Benoit's problem, 32 bits overflow in testrank. # (polyparam.c) Solved calling GNU MP. 9 9 0 1 1 0 0 0 -1 0 -1 0 1 0 1 0 -1 0 0 2 0 0 1 1 -1 0 0 0 0 1 1 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 0 1 -1 1 0 0 0 0 0 0 1 2 -1 0 0 0 0 0 -1 1 -1 1 1 0 0 0 0 0 1 1 1 -1 0 0 0 0 0 1 6 0 0 0 0 -1 15000 polylib-5.22.5.orig/Test/others/somnath0000644000175000017500000000057011035141337020717 0ustar sylvestresylvestre# An example provided by # Somnath Ghosh 6 8 # h_d i_d b n P Q cst 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 29 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 -1 1 0 0 0 197 1 -1 -1024 0 1 0 # context: two free parameters 0 4 polylib-5.22.5.orig/Test/others/16hedron0000644000175000017500000000045711035141337020700 0ustar sylvestresylvestre 16 7 1 -1 -1 -1 -1 1 0 1 -1 -1 -1 1 1 0 1 -1 -1 1 -1 1 0 1 -1 -1 1 1 1 0 1 -1 1 -1 -1 1 0 1 -1 1 -1 1 1 0 1 -1 1 1 -1 1 0 1 -1 1 1 1 1 0 1 1 -1 -1 -1 1 0 1 1 -1 -1 1 1 0 1 1 -1 1 -1 1 0 1 1 -1 1 1 1 0 1 1 1 -1 -1 1 0 1 1 1 -1 1 1 0 1 1 1 1 -1 1 0 1 1 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/others/g3.out0000644000175000017500000000256111035141337020367 0ustar sylvestresylvestre--------------------------------------- Domain : i0 - k0 -1 = 0 j0 - a1 = 0 -2k0 + 2a0 -3 >= 0 - k0 + N -2 >= 0 - k0 + a1 -2 >= 0 k0 - a0 + 2 >= 0 N - a1 + 1 >= 0 2k0 - a0 + 1 >= 0 Vertices : [ a0-1, a1, a0-2 ] [ 2k0-a0+2, a1, 2k0-a0+1 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - a1 = 0 k0 - a0 + 2 >= 0 -2k0 + a0 -1 >= 0 N - a1 + 1 >= 0 - k0 + N -2 >= 0 a0 -2 >= 0 - k0 + a1 -2 >= 0 Vertices : [ a0-1, a1, a0-2 ] [ 1, a1, 0 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - a1 = 0 -2k0 + a0 -1 >= 0 N - a0 >= 0 N - a1 + 1 >= 0 k0 >= 0 - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 1 >= 0 Vertices : [ 1, a1, 0 ] [ k0+1, a1, k0 ] Ehrhart Polynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - a1 = 0 2k0 - a0 + 1 >= 0 N - a1 + 1 >= 0 N - a0 >= 0 - k0 + a1 -2 >= 0 - k0 + a0 -2 >= 0 1 >= 0 Vertices : [ 2k0-a0+2, a1, 2k0-a0+1 ] [ k0+1, a1, k0 ] Ehrhart Polynomial: ( -1 * k0 + ( 1 * a0 + 0 ) ) polylib-5.22.5.orig/Test/others/francois0000644000175000017500000000337311035141337021056 0ustar sylvestresylvestre # exemple de Francois Irigoin qui fait boucler (?) chernikova 28 15 # A B C D E F G H I J K L M 1 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 # G-F <= 0 1 0 0 0 -4 4 -4 4 4 0 -1 -4 1 0 4 # -L+4K+J-4H-4G+4F-4E+4D <= 4 1 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 # E-D <= 0 1 0 0 0 -4 4 -4 4 4 0 1 -4 -1 0 4 # L+4K-J-4H-4G+4F-4E+4D <= 4 1 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 # M-L <= -1 1 0 0 0 0 0 0 0 0 -1 1 0 -1 0 5 # L-J+I <= 5 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 # I <= 5 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 # B <= 33 1 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 # -C <= -5 1 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 # K-C <= -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 33 # A <= 33 1 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 # F-A <= -1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # -D <= -2 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 5 # J <= 5 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 # L <= 5 1 0 0 0 0 0 0 0 0 1 -1 0 1 0 -1 # -L+J-I <= -1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 # -I <= -1 1 0 0 0 0 0 0 0 -3 0 0 3 -1 1 1 # -M+L-3K+3H <= 1 1 0 0 0 0 0 0 0 0 0 3 0 -4 4 1 # -4M+4L-3J <= 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 # -F <= -2 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 # -K <= -2 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 # -M <= -1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 # -B <= -5 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 -1 # D-B <= -1 1 0 0 0 12 -12 12 -12 -12 -3 3 12 -4 4 4 # -4M+4L-12K-3J+3I+12H+12G-12F+12E-12D <= 4 1 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 # -A <= -5 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 # C <= 33 1 0 0 0 4 -4 4 -4 -4 1 -1 4 0 0 0 # -4K+J-I+4H+4G-4F+4E-4D <= 0 polylib-5.22.5.orig/Test/others/g14.out0000644000175000017500000000453711035141337020456 0ustar sylvestresylvestreenide> ../Obj.64.solaris/ehrhart < AM_gauss14 --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - k0 -1 = 0 2k0 - a1 + 1 >= 0 -2k0 + 2a1 -3 >= 0 a0 - a1 >= 0 - k0 + N -2 >= 0 N - a0 >= 0 k0 - a1 + 2 >= 0 Vertices : [ a1-1, a1-1, a1-2 ] [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - k0 -1 = 0 a1 -2 >= 0 a0 - a1 >= 0 k0 - a1 + 2 >= 0 N - a0 >= 0 -2k0 + a1 -1 >= 0 - k0 + N -2 >= 0 Vertices : [ a1-1, a1-1, a1-2 ] [ 1, 1, 0 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - k0 -1 = 0 2k0 - a1 + 1 >= 0 - k0 + N -2 >= 0 - k0 + a0 -1 >= 0 k0 - a0 + 2 >= 0 N - a1 + 1 >= 0 - a0 + a1 >= 0 -2k0 + a0 + a1 -3 >= 0 Vertices : [ a0-1, a0-1, a0-2 ] [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : i0 - k0 -1 = 0 j0 - k0 -1 = 0 - a0 + a1 >= 0 k0 - a0 + 2 >= 0 -2k0 + a1 -1 >= 0 N - a1 + 1 >= 0 a0 -2 >= 0 - k0 + N -2 >= 0 - k0 + a0 -1 >= 0 Vertices : [ a0-1, a0-1, a0-2 ] [ 1, 1, 0 ] Degenerate Domain. Can not continue. --------------------------------------- Domain : x i0 - k0 -1 = 0 x j0 - k0 -1 = 0 x - k0 + a0 -2 >= 0 x N - a0 >= 0 -2k0 + a1 -1 >= 0 x N - a1 + 1 >= 0 k0 >= 0 x - k0 + a1 -2 >= 0 1 >= 0 Vertices : [ 1, 1, 0 ] [ k0+1, k0+1, k0 ] WAk0NING: i0arameter Domain Overflow. k0esult may be incorrect on this domain. Ehrhart i0olynomial: ( 1 * k0 + 1 ) --------------------------------------- Domain : x i0 - k0 -1 = 0 x j0 - k0 -1 = 0 x - k0 + a0 -2 >= 0 2k0 - a1 + 1 >= 0 x N - a0 >= 0 x N - a1 + 1 >= 0 x - k0 + a1 -2 >= 0 1 >= 0 Vertices : [ 2k0-a1+2, 2k0-a1+2, 2k0-a1+1 ] [ k0+1, k0+1, k0 ] WAk0NING: i0arameter Domain Overflow. k0esult may be incorrect on this domain. Ehrhart i0olynomial: ( -1 * j0 + ( 1 * a1 + 1 ) ) polylib-5.22.5.orig/Test/others/francois.out0000644000175000017500000045512211035141337021667 0ustar sylvestresylvestrePOLYHEDRON Dimension:13 Constraints:28 Equations:0 Rays:2304 Lines:0 Constraints 28 15 Inequality: [ 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 ] Inequality: [ 0 0 0 -4 4 -4 4 4 0 -1 -4 1 0 4 ] Inequality: [ 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 ] Inequality: [ 0 0 0 -4 4 -4 4 4 0 1 -4 -1 0 4 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 1 0 -1 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 ] Inequality: [ 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 ] Inequality: [ -1 0 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 -1 0 0 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 1 -1 0 1 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 -3 0 0 3 -1 1 1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 3 0 -4 4 1 ] Inequality: [ 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 ] Inequality: [ 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 1 0 -1 0 0 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 12 -12 12 -12 -12 -3 3 12 -4 4 4 ] Inequality: [ 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 0 4 -4 4 -4 -4 1 -1 4 0 0 0 ] Rays 2304 15 Vertex: [ 33 33 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 1 1 4 2 1 ]/1 Vertex: [132 132 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 5 5 4 2 1 ]/1 Vertex: [132 20 20 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 1 1 4 5 4 ]/1 Vertex: [132 20 20 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [132 132 20 8 8 128 128 15 16 20 16 8 4 ]/4 Vertex: [132 20 20 16 15 128 128 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 127 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 16 16 8 7 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 16 15 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [132 132 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [132 20 20 16 15 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [132 20 20 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [132 20 20 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 20 20 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 8 16 20 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 127 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 8 7 128 128 16 16 20 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 1 5 2 5 4 ]/1 Vertex: [132 20 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [132 132 20 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 1 5 4 5 4 ]/1 Vertex: [132 20 20 8 8 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 5 32 5 4 ]/1 Vertex: [132 20 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 5 4 5 1 ]/1 Vertex: [132 132 20 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 1 5 4 5 4 ]/1 Vertex: [132 20 20 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [132 132 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 5 4 5 4 ]/1 Vertex: [132 132 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [132 132 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [132 132 20 128 128 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 128 127 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 8 15 16 20 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 15 16 20 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 127 16 16 20 16 8 4 ]/4 Vertex: [132 132 20 128 127 8 8 16 16 20 16 8 4 ]/4 Vertex: [132 132 20 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 7 16 16 20 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 127 16 16 20 16 8 4 ]/4 Vertex: [132 132 20 128 127 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [132 132 20 8 7 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [132 132 20 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 128 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 128 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 20 132 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 132 16 15 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 20 20 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 20 20 20 16 15 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 15 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 1 1 32 2 1 ]/1 Vertex: [132 132 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 5 5 32 2 1 ]/1 Vertex: [132 20 132 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 1 1 32 5 4 ]/1 Vertex: [132 20 132 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [132 132 132 8 8 128 128 127 16 20 128 8 4 ]/4 Vertex: [132 20 132 16 15 128 128 128 16 20 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 127 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 2 1 1 2 5 4 ]/1 Vertex: [132 20 132 16 16 8 7 128 16 20 128 8 4 ]/4 Vertex: [132 20 132 16 15 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [132 132 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [132 20 132 16 15 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 20 132 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 20 132 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 20 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [132 20 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 127 128 16 20 128 8 4 ]/4 Vertex: [132 20 132 8 7 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 1 1 32 2 1 ]/1 Vertex: [132 20 132 16 16 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 1 5 2 5 4 ]/1 Vertex: [132 20 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 1 1 32 2 1 ]/1 Vertex: [132 132 132 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 20 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 3 2 2 32 1 5 32 5 4 ]/1 Vertex: [132 20 132 8 8 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 1 1 32 2 1 ]/1 Vertex: [132 20 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 1 5 32 5 1 ]/1 Vertex: [132 132 132 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 5 32 5 4 ]/1 Vertex: [132 20 132 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [132 132 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 1 5 32 5 4 ]/1 Vertex: [132 132 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 1 5 2 5 4 ]/1 Vertex: [132 132 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 7 16 20 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 127 8 16 20 8 8 4 ]/4 Vertex: [132 132 132 128 127 128 128 8 16 20 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 127 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [132 132 132 8 8 128 127 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 7 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 127 128 16 20 128 8 4 ]/4 Vertex: [132 132 132 128 127 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [132 132 132 8 7 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [132 132 132 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 7 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 31 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 20 132 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 16 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 13 4 4 16 8 4 ]/4 Vertex: [132 132 20 128 125 128 128 8 20 8 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 125 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 5 2 4 2 1 ]/1 Vertex: [132 132 20 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 125 16 4 4 16 8 4 ]/4 Vertex: [132 132 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 8 5 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 125 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [132 20 20 8 5 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [132 20 20 8 8 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [132 132 20 8 8 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 20 20 16 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [132 132 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 7 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 16 16 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 20 20 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 20 20 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 16 15 128 128 8 20 20 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 16 4 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 20 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [132 132 20 128 125 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [132 132 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 8 5 16 20 8 16 8 4 ]/4 Vertex: [132 132 20 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 16 4 16 8 4 ]/4 Vertex: [132 20 20 16 16 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 5 5 2 5 1 ]/1 Vertex: [132 132 20 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 128 128 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [132 20 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 4 5 2 4 2 1 ]/1 Vertex: [132 132 20 8 8 128 127 16 20 20 16 8 4 ]/4 Vertex: [132 20 20 8 7 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 16 4 16 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [132 20 20 16 16 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [132 132 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 5 4 5 1 ]/1 Vertex: [132 132 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [132 20 20 16 16 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 2 4 2 1 ]/1 Vertex: [132 132 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 1 2 4 2 1 ]/1 Vertex: [132 132 20 8 8 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 5 32 5 4 ]/1 Vertex: [132 20 20 16 13 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [132 132 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 15 20 20 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 132 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 20 20 16 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 20 16 15 16 16 16 20 20 16 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 1 2 4 2 1 ]/1 Vertex: [132 20 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 2 4 2 1 ]/1 Vertex: [132 132 20 128 128 128 125 8 16 4 8 8 4 ]/4 Vertex: [132 132 20 128 125 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 128 128 5 16 4 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [132 132 20 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 13 16 4 4 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [132 132 20 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 4 4 16 8 4 ]/4 Vertex: [132 20 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 16 15 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [132 132 132 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [132 20 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 20 20 8 8 128 128 13 4 4 16 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [132 20 20 8 5 128 128 16 4 4 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 125 16 4 4 16 8 4 ]/4 Vertex: [132 132 132 8 8 128 125 128 20 8 128 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 5 20 8 8 8 4 ]/4 Vertex: [132 20 20 16 13 128 128 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 128 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 5 5 4 5 4 ]/1 Vertex: [132 132 20 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 1 2 4 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 132 20 8 8 128 125 16 16 4 16 8 4 ]/4 Vertex: [132 20 132 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 125 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 13 16 4 16 8 4 ]/4 Vertex: [132 132 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [132 20 132 16 16 8 5 128 20 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 125 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 125 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [132 132 20 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 8 8 128 125 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 8 5 128 128 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [132 132 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [132 132 132 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [132 132 132 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 20 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 125 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 5 2 4 2 1 ]/1 Vertex: [132 20 20 8 8 128 128 15 20 20 16 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 5 4 5 4 ]/1 Vertex: [132 20 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [132 20 20 16 13 128 128 16 16 4 16 8 4 ]/4 Vertex: [132 132 20 8 5 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [132 20 132 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 125 16 16 4 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 125 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 13 8 8 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 8 5 128 128 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 125 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 5 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [132 20 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [132 132 132 128 125 128 128 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 128 125 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 125 128 128 128 20 8 128 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [132 20 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 125 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [132 132 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 5 5 32 5 1 ]/1 Vertex: [132 132 132 128 128 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 128 128 125 20 8 128 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 128 20 8 128 8 4 ]/4 Vertex: [132 20 20 16 13 128 128 16 20 8 16 8 4 ]/4 Vertex: [132 20 20 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 132 132 128 128 128 125 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 128 125 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 5 16 4 8 8 4 ]/4 Vertex: [132 132 20 128 125 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 128 8 8 13 16 4 16 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 125 20 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 125 128 20 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 5 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 13 16 4 16 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 125 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [132 20 132 16 16 128 125 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 125 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 128 20 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 5 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 125 16 4 128 8 4 ]/4 Vertex: [132 132 20 128 128 8 5 16 16 4 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 125 16 16 4 16 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 125 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 125 128 128 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 4 4 128 8 4 ]/4 Vertex: [132 132 20 128 125 128 128 16 16 4 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 132 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 5 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 16 16 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [132 20 132 16 16 8 8 125 16 4 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 125 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 5 4 5 1 ]/1 Vertex: [132 20 132 16 13 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [132 20 132 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 132 20 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [132 132 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 31 5 2 32 2 1 ]/1 Vertex: [132 132 132 8 8 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [132 132 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 32 1 2 32 2 1 ]/1 Vertex: [132 132 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [132 20 132 16 16 8 7 128 20 20 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 5 2 32 2 1 ]/1 Vertex: [132 20 20 16 13 8 8 16 4 4 16 8 4 ]/4 Vertex: [132 20 132 16 15 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 2 32 2 1 ]/1 Vertex: [132 132 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 32 5 5 32 5 4 ]/1 Vertex: [132 132 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 2 32 2 1 ]/1 Vertex: [132 132 20 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [132 132 20 128 128 8 7 16 20 20 16 8 4 ]/4 Vertex: [132 20 132 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 20 132 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 132 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 8 128 128 13 20 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [132 132 20 128 127 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [132 132 132 8 8 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 31 32 32 2 5 5 2 5 4 ]/1 Vertex: [132 132 132 8 5 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 5 2 4 2 1 ]/1 Vertex: [132 20 20 16 16 8 8 13 16 4 16 8 4 ]/4 Vertex: [132 132 20 8 7 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 4 5 2 4 2 1 ]/1 Vertex: [132 132 132 8 8 128 128 125 4 4 128 8 4 ]/4 Vertex: [132 20 20 16 16 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [132 132 20 128 128 128 128 15 20 20 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 132 20 128 125 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [132 132 20 128 128 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [132 20 132 16 16 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [132 20 132 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 16 13 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 20 132 16 15 128 128 8 20 20 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [132 20 132 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 125 16 4 4 16 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 1 2 2 2 1 ]/1 Vertex: [132 132 132 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 3 32 32 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 16 16 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [132 132 132 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 20 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 2 32 2 1 ]/1 Vertex: [132 132 132 8 8 128 127 128 20 20 128 8 4 ]/4 Vertex: [132 20 132 8 7 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [132 20 132 16 16 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [132 132 20 128 128 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 5 2 2 2 1 ]/1 Vertex: [132 132 20 128 127 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 16 16 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 5 2 32 2 1 ]/1 Vertex: [132 132 20 128 128 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 1 32 32 32 1 2 32 2 1 ]/1 Vertex: [132 20 20 16 13 128 128 16 4 4 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 125 16 4 128 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 8 4 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [132 20 20 16 13 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 125 16 16 128 16 4 128 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [132 132 132 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 128 128 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 1 2 32 2 1 ]/1 Vertex: [132 132 132 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [132 20 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [132 132 20 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 15 8 8 128 20 20 128 8 4 ]/4 Vertex: [132 132 20 128 128 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 2 4 2 1 ]/1 Vertex: [132 20 132 8 8 128 128 125 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 5 128 128 128 4 4 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 5 5 32 5 4 ]/1 Vertex: [132 20 20 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [132 20 20 16 16 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [132 20 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 31 5 2 32 2 1 ]/1 Vertex: [132 20 132 8 8 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [132 20 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [132 132 20 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [132 20 20 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 4 1 2 4 2 1 ]/1 Vertex: [132 132 20 128 127 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 31 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 1 2 4 2 1 ]/1 Vertex: [132 20 20 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [132 20 20 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 128 16 4 128 8 4 ]/4 Vertex: [132 132 20 128 128 128 125 16 4 4 16 8 4 ]/4 Vertex: [ 33 5 33 4 3 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 125 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 128 128 128 13 4 4 16 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 1 2 4 2 1 ]/1 Vertex: [132 20 20 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [132 132 20 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 5 5 32 5 4 ]/1 Vertex: [132 132 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 5 5 32 5 4 ]/1 Vertex: [132 20 132 16 13 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [132 132 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [132 132 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 5 5 32 5 4 ]/1 Vertex: [132 132 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 132 20 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 5 5 2 5 4 ]/1 Vertex: [132 132 20 128 125 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 8 7 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 32 5 2 32 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [132 132 132 128 128 128 128 127 20 20 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 5 4 4 8 8 4 ]/4 Vertex: [132 132 132 128 125 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 5 2 32 2 1 ]/1 Vertex: [132 132 132 128 128 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [132 20 132 16 16 128 125 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 1 2 2 2 1 ]/1 Vertex: [132 132 20 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 31 32 32 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 127 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 128 127 8 20 20 8 8 4 ]/4 Vertex: [132 20 132 16 13 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 16 4 128 8 4 ]/4 Vertex: [132 132 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 5 2 32 2 1 ]/1 Vertex: [132 132 20 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 32 32 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 1 32 32 32 1 2 32 2 1 ]/1 Vertex: [132 132 132 128 127 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 31 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [132 132 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 128 125 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 128 125 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 16 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 5 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 20 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [132 132 132 128 125 8 8 128 4 4 128 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 125 4 4 128 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [132 132 132 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 128 4 4 128 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [132 20 20 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 20 20 132 16 13 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 125 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 7 16 16 128 20 20 128 8 4 ]/4 Vertex: [132 132 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 125 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 128 127 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 5 5 32 5 4 ]/1 Vertex: [132 132 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 1 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [132 20 20 16 16 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 3 2 2 32 5 2 32 2 1 ]/1 Vertex: [132 20 20 16 16 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 20 8 128 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [132 20 20 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 3 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 128 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 1 5 2 2 2 1 ]/1 Vertex: [132 20 20 16 15 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 125 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 15 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 128 20 20 128 8 4 ]/4 Vertex: [132 20 20 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 125 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 1 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 16 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 1 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 7 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [132 20 20 16 13 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 5 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 127 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 4 5 5 4 5 4 ]/1 Vertex: [132 132 20 8 5 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 20 8 128 8 4 ]/4 Vertex: [132 20 20 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 16 20 20 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 13 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 125 20 8 128 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [132 20 20 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 128 125 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 16 4 128 8 4 ]/4 Vertex: [132 132 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 128 4 8 128 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 7 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 16 4 8 16 8 4 ]/4 Vertex: [132 20 20 16 15 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 16 4 8 16 8 4 ]/4 Vertex: [132 20 20 16 16 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 7 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 127 128 128 128 4 8 128 8 4 ]/4 Vertex: [132 132 132 128 128 128 127 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 8 7 128 4 8 128 8 4 ]/4 Vertex: [132 132 20 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 128 4 8 128 8 4 ]/4 Vertex: [132 20 20 16 16 128 127 16 4 8 16 8 4 ]/4 Vertex: [132 132 132 8 7 128 128 128 4 8 128 8 4 ]/4 Vertex: [132 132 132 8 8 128 127 128 4 8 128 8 4 ]/4 Vertex: [132 20 20 16 15 128 128 16 4 8 16 8 4 ]/4 Vertex: [132 132 132 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 127 4 8 128 8 4 ]/4 Vertex: [132 132 132 128 128 8 8 127 4 8 128 8 4 ]/4 Vertex: [132 132 132 128 127 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 128 128 128 128 7 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [132 132 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 127 128 128 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 128 128 128 127 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 128 128 8 7 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 128 127 8 8 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 8 7 128 128 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 127 16 4 8 16 8 4 ]/4 Vertex: [132 20 132 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 15 4 8 16 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 127 4 8 128 8 4 ]/4 Vertex: [132 20 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 128 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 127 4 8 128 8 4 ]/4 Vertex: [132 132 20 128 127 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 128 128 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 7 128 128 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 8 8 128 127 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 127 4 8 128 8 4 ]/4 Vertex: [132 132 20 128 128 128 128 7 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 20 132 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [132 20 132 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [132 20 132 16 16 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 20 132 16 15 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 128 128 127 4 8 128 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 20 132 16 15 8 8 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 16 16 8 7 128 4 8 128 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 20 132 16 16 128 127 128 4 8 128 8 4 ]/4 Vertex: [132 20 132 16 15 128 128 128 4 8 128 8 4 ]/4 Vertex: [132 20 20 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 132 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [132 20 132 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [132 132 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [132 20 20 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 132 20 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 16 4 8 16 8 4 ]/4 Vertex: [132 132 20 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 8 7 128 128 16 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 128 127 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 128 7 4 8 8 8 4 ]/4 Vertex: [132 20 20 16 16 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [132 20 20 16 16 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [132 20 20 16 15 128 128 8 4 8 8 8 4 ]/4 polylib-5.22.5.orig/Test/others/g3.in0000644000175000017500000000205611035141337020165 0ustar sylvestresylvestre# Gauss Anticipated memory: dependence 3 # # lambda = ( 1 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte # i0 j0 k0 N a0 a1 8 11 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 0 0 0 0 0 0 -1 0 # j = a_1 1 -1 0 0 0 0 1 0 0 0 1 # i <= k0 + 1 1 1 0 0 -1 -1 -1 0 1 1 -1 # i >= i0 + j0 + k0 - a0 - a1 + 1 1 1 0 0 0 0 0 0 0 0 -1 # i >= 1 1 -1 0 0 0 0 0 1 0 0 -1 # i <= N-1 1 -1 0 0 0 0 0 0 1 0 -1 # i<= a0-1 1 -1 0 0 0 0 0 0 0 1 -1 # i<= a1-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 -1 # N >= 1 0 1 0 -1 0 0 0 -1 # i0 = k0 + 1 1 0 1 -1 0 0 0 -2 # j0 >= k0 + 2 1 0 -1 0 1 0 0 1 # j0 <= N + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 1 0 0 -1 0 1 0 -1 # a0 >= k0 + 1 1 0 0 0 1 -1 0 0 # a0 <= N 0 0 -1 0 0 0 1 0 # a1 = j0 i0 j0 k0 N a0 a1 Memory - Gauss Pivot polylib-5.22.5.orig/Test/others/francois2.out30000644000175000017500000010347011035141337022030 0ustar sylvestresylvestre31 15 1 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 5 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 1 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 1 0 0 0 -4 4 -4 4 4 0 -1 -4 1 0 4 1 0 0 0 -4 4 -4 4 4 0 1 -4 -1 0 4 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 5 1 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 1 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 -1 0 5 1 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 1 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 1 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 1 0 0 0 4 -4 4 -4 -4 1 -1 4 0 0 0 1 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 -1 0 1 0 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 33 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 1 0 0 0 4 -4 4 -4 -4 -1 1 4 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 1 0 0 0 0 0 1 -1 0 0 0 0 0 0 -1 POLYHEDRON Dimension:13 Constraints:21 Equations:4 Rays:384 Lines:0 Constraints 21 15 Equality: [ 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 ] Equality: [ 0 0 0 0 0 1 -1 0 0 0 0 0 0 -1 ] Equality: [ 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 ] Equality: [ 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 ] Inequality: [ 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 -1 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 ] Inequality: [ 0 1 0 0 -1 0 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 ] Inequality: [ -1 0 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 ] Rays 384 15 Vertex: [ 33 5 5 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 4 ]/1 polylib-5.22.5.orig/Test/others/francois2.out20000644000175000017500000007677611035141337022051 0ustar sylvestresylvestrePOLYHEDRON Dimension:13 Constraints:21 Equations:4 Rays:384 Lines:0 Constraints 21 15 Equality: [ 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 ] Equality: [ 0 0 0 0 0 1 -1 0 0 0 0 0 0 -1 ] Equality: [ 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 ] Equality: [ 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 ] Inequality: [ 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 -1 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 ] Inequality: [ 0 1 0 0 -1 0 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 ] Inequality: [ -1 0 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 ] Rays 384 15 Vertex: [ 33 5 5 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 4 ]/1 polylib-5.22.5.orig/Test/others/t5.in0000644000175000017500000000006411035141337020201 0ustar sylvestresylvestre1 4 1 1 0 0 1 3 1 1 0 N simple test ------- x>=0 polylib-5.22.5.orig/Test/others/e_babacar.in0000644000175000017500000000110311035141337021523 0ustar sylvestresylvestre# carefull, *big* example... 8 9 1 -1 0 0 1 0 0 0 -1 1 0 0 0 0 1 0 0 0 1 0 -2 1 0 0 0 2 0 1 -4 4 -3 0 0 0 0 -4 1 2 -2 3 0 0 0 0 0 1 2 -1 0 0 0 0 0 -1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 6 6 1 -1 0 0 1 0 1 -1 1 0 0 0 1 2 -1 0 0 -1 1 -1 1 1 0 0 1 1 1 -1 0 0 1 0 0 0 0 1 polylib-5.22.5.orig/Test/others/francois20000644000175000017500000000361311035141337021135 0ustar sylvestresylvestre # exemple de Francois Irigoin qui fait boucler (?) chernikova 31 15 # A B C D E F G H I J K L M 1 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 # -L+M <= -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 # -M <= -1 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 5 # M <= 5 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 # -K+H <= 0 1 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 # -F+G <= 0 1 0 0 0 -4 4 -4 4 4 0 -1 -4 1 0 4 # 4D-4E+4F-4G+4K-4H+J-L <= 4 1 0 0 0 -4 4 -4 4 4 0 1 -4 -1 0 4 # 4D-4E+4F-4G+4K-4H-J+L <= 4 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 # L <= 5 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 5 # J <= 5 1 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 # -C+K <= -1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 # -B <= -5 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 # I <= 5 1 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 # F-A <= -1 1 0 0 0 0 0 0 0 0 -1 1 0 -1 0 5 # I-J+L <= 5 1 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 # -C <= -5 1 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 # -A <= -5 1 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # -D <= -2 1 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 # -F <= -2 1 0 1 0 -1 0 0 0 0 0 0 0 0 0 -1 # D-B <= -1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 # -L <= -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 # -J <= -1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 # -I <= -1 1 0 0 0 4 -4 4 -4 -4 1 -1 4 0 0 0 # -4D+4E-4F+4G-4K+4H-I+J <= 0 1 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 # -D+E <= 0 1 0 0 0 0 0 0 0 0 1 -1 0 1 0 -1 # -I+J-L <= -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 33 # A <= 33 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 # B <= 33 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 # C <= 33 1 0 0 0 4 -4 4 -4 -4 -1 1 4 0 0 0 # -4D+4E-4F+4G-4K+4H+I-J <= 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 # -K <= -2 1 0 0 0 0 0 1 -1 0 0 0 0 0 0 -1 # G-F <= -1 polylib-5.22.5.orig/Test/others/xavi0000644000175000017500000000031011035141337020205 0ustar sylvestresylvestre# An example from Xavier Vera Rivera # no parameters 7 4 1 8 -1 -24 1 8 -32 0 1 -8 32 31 1 0 1 0 1 0 -1 4 1 1 0 -1 1 -1 0 16 0 2 polylib-5.22.5.orig/Test/others/g14.in0000644000175000017500000000360311035141337020246 0ustar sylvestresylvestre# Gauss Anticipated memory: dependence 4 # # lambda = ( 0 1 1 ) # # sigma(X and Y) = ( 1 0 0 ) # ( 0 1 0 ) # P = i0, Q = j0, R = k0 # S = N # T = a0, U = a1 # i j k P Q R S T U cte # i0 j0 k0 N a0 a1 8 11 0 1 0 -1 0 0 0 0 0 0 -1 # i = k+1 0 0 1 -1 0 0 0 0 0 0 -1 # j = k+1 1 -1 0 0 0 0 1 0 0 0 1 # i <= k0 + 1 1 1 0 0 0 -1 -1 0 0 1 -1 # i >= j0 + k0 - a1 + 1 1 1 0 0 0 0 0 0 0 0 -1 # i>= 1 1 -1 0 0 0 0 0 1 0 0 -1 # i<= N-1 1 -1 0 0 0 0 0 0 1 0 -1 # i<= a0-1 1 -1 0 0 0 0 0 0 0 1 -1 # i<= a1-1 # 6 params # P Q R S T U cte # i0 j0 k0 N a0 a1 9 8 1 0 0 0 1 0 0 -1 # N >= 1 0 1 0 -1 0 0 0 -1 # i0 = k0 + 1 0 0 1 -1 0 0 0 -1 # j0 = k0 + 1 1 0 0 1 0 0 0 0 # k0 >= 0 1 0 0 -1 1 0 0 -2 # k0 <= N-2 1 0 0 -1 0 1 0 -1 # a0 >= k0 + 1 1 0 0 0 1 -1 0 0 # a0 <= N 1 0 0 -1 0 0 1 -1 # a1 >= k0 + 1 1 0 0 0 1 0 -1 1 # a1 <= N + 1 i0 j0 k0 N a0 a1 Memory - Gauss Pivot # Result : --------------------------------------- Domain : 3R - T - U + 2 >= 0 P - R -1 = 0 Q - R -1 = 0 - R + T -1 >= 0 - R + S -2 >= 0 S - T >= 0 - R + U -1 >= 0 S - U + 1 >= 0 1 >= 0 Vertices : [ 3R-T-U+4, 3R-T-U+4, 3R-T-U+3 ] [ R+2, R+2, R+1 ] Ehrhart Polynomial: ( -1 * P + ( -1 * Q + ( 1 * T + ( 1 * U + 1 ) ) ) ) ( -1 * P + ( -1 * Q + ( 1 * T + ( 1 * U + 1 ) ) ) ) # P Q R S T U cte # i0 j0 k0 N a0 a1 --------------------------------------- Domain : -3R + T + U -2 >= 0 R >= 0 P - R -1 = 0 Q - R -1 = 0 - R + U -1 >= 0 S - T >= 0 - R + S -2 >= 0 - R + T -1 >= 0 S - U + 1 >= 0 1 >= 0 Vertices : [ 2, 2, 1 ] Ehrhart Polynomial: ( 1 ) polylib-5.22.5.orig/Test/others/tpar.in0000644000175000017500000000011211035141337020611 0ustar sylvestresylvestre# two parameters: 2M=N test 2 5 1 1 0 0 0 1 -1 1 0 0 1 4 0 2 -1 0 M N polylib-5.22.5.orig/Test/others/32hedron0000644000175000017500000000125711035141337020675 0ustar sylvestresylvestre 32 8 1 1 1 -1 -1 -1 1 0 1 1 1 -1 -1 1 1 0 1 1 1 -1 1 -1 1 0 1 1 1 -1 1 1 1 0 1 1 1 1 -1 -1 1 0 1 1 1 1 -1 1 1 0 1 1 1 1 1 -1 1 0 1 1 1 1 1 1 1 0 1 1 -1 -1 -1 -1 1 0 1 1 -1 -1 -1 1 1 0 1 1 -1 -1 1 -1 1 0 1 1 -1 -1 1 1 1 0 1 1 -1 1 -1 -1 1 0 1 1 -1 1 -1 1 1 0 1 1 -1 1 1 -1 1 0 1 1 -1 1 1 1 1 0 1 -1 1 -1 -1 -1 1 0 1 -1 1 -1 -1 1 1 0 1 -1 1 -1 1 -1 1 0 1 -1 1 -1 1 1 1 0 1 -1 1 1 -1 -1 1 0 1 -1 1 1 -1 1 1 0 1 -1 1 1 1 -1 1 0 1 -1 1 1 1 1 1 0 1 -1 -1 -1 -1 -1 1 0 1 -1 -1 -1 -1 1 1 0 1 -1 -1 -1 1 -1 1 0 1 -1 -1 -1 1 1 1 0 1 -1 -1 1 -1 -1 1 0 1 -1 -1 1 -1 1 1 0 1 -1 -1 1 1 -1 1 0 1 -1 -1 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/others/4hedron0000644000175000017500000000007611035141337020612 0ustar sylvestresylvestre 4 5 1 -1 -1 1 0 1 -1 1 1 0 1 1 -1 1 0 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/others/francois.out20000644000175000017500000055033211035141337021750 0ustar sylvestresylvestrePOLYHEDRON Dimension:13 Constraints:28 Equations:0 Rays:2304 Lines:0 Constraints 28 15 Inequality: [ 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 ] Inequality: [ 0 0 0 -4 4 -4 4 4 0 -1 -4 1 0 4 ] Inequality: [ 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 ] Inequality: [ 0 0 0 -4 4 -4 4 4 0 1 -4 -1 0 4 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 1 0 -1 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 ] Inequality: [ 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 ] Inequality: [ -1 0 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 -1 0 0 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 ] Inequality: [ 0 0 0 0 0 0 0 0 1 -1 0 1 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 -3 0 0 3 -1 1 1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 3 0 -4 4 1 ] Inequality: [ 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 ] Inequality: [ 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 1 0 -1 0 0 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 12 -12 12 -12 -12 -3 3 12 -4 4 4 ] Inequality: [ 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 0 4 -4 4 -4 -4 1 -1 4 0 0 0 ] Rays 2304 15 Vertex: [ 33 33 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 4 1 1 4 2 1 ]/1 Vertex: [ 132 132 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 1 1 4 5 4 ]/1 Vertex: [ 132 20 20 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 4 5 5 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 15 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 127 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 15 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 132 20 20 16 15 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 132 20 20 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 132 20 20 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 127 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 132 132 20 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 132 20 20 8 8 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 132 20 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 132 132 20 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 132 20 20 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 132 132 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 128 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 127 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 15 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 127 16 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 127 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 127 16 16 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 127 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 132 132 20 8 7 128 128 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 128 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 128 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 20 132 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 132 16 15 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 20 20 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 1 1 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 4 1 1 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 15 16 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 5 5 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 4 1 1 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 1 1 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 4 5 5 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 15 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 20 20 20 16 15 16 16 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 16 16 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 16 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 15 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 1 5 4 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 32 1 1 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 132 20 132 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 1 1 32 5 4 ]/1 Vertex: [ 132 20 132 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 1 1 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 32 5 5 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 2 5 5 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 16 15 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 127 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 132 20 132 16 16 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 16 15 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 132 20 132 16 15 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 16 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 20 132 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 127 128 16 20 128 8 4 ]/4 Vertex: [ 132 20 132 8 7 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 132 20 132 16 16 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 132 20 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 3 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 132 20 132 8 8 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 132 20 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 132 132 132 8 7 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 132 20 132 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 132 132 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 1 5 2 5 4 ]/1 Vertex: [ 132 132 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 7 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 127 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 128 127 128 128 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 127 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 127 128 16 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 127 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 132 132 132 8 7 128 128 128 16 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 132 132 132 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 7 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 31 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 5 2 5 1 ]/1 Vertex: [ 20 20 132 16 15 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 31 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 2 2 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 32 1 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 7 8 8 8 16 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 4 3 4 4 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 7 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 1 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 16 16 16 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 128 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 8 16 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 8 16 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 127 16 20 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 7 16 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 32 1 1 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 1 1 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 1 1 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 32 5 5 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 1 1 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 2 5 5 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 32 1 1 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 132 132 20 128 125 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 125 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 132 132 20 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 125 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 5 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 125 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 132 20 20 8 5 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 132 20 20 8 8 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 132 132 20 8 8 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 7 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 16 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 20 20 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 15 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 132 20 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 20 128 125 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 20 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 128 128 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 132 20 20 16 16 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 16 16 16 16 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 13 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 4 3 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 132 132 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 16 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 1 32 32 4 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 132 20 20 16 13 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 5 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 132 132 20 8 5 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 3 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 3 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 20 16 15 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 132 20 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 1 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 132 132 20 128 128 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 125 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 20 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 20 132 20 8 8 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 5 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 3 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 1 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 132 132 20 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 8 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 132 20 20 8 5 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 5 2 1 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 8 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 1 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 16 15 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 5 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 20 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 20 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 132 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 132 20 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 20 20 8 8 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 5 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 125 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 125 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 13 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 128 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 132 132 20 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 125 16 16 4 16 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 125 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 132 20 132 16 16 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 125 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 125 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 128 128 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 132 132 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 132 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 132 132 132 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 20 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 125 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 132 20 20 8 8 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 132 20 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 13 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 5 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 125 16 16 4 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 128 128 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 125 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 132 132 132 128 125 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 128 128 128 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 125 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 132 132 132 128 128 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 128 125 20 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 13 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 132 128 128 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 125 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 128 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 125 20 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 125 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 132 20 132 16 16 128 125 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 5 16 16 4 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 125 16 16 4 16 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 125 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 125 128 128 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 20 128 125 128 128 16 16 4 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 13 16 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 5 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 2 2 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 3 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 132 20 132 16 16 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 132 20 132 16 13 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 5 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 132 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 20 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 132 16 16 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 20 16 13 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 132 20 132 16 15 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 132 132 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 132 132 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 132 132 20 128 128 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 132 20 132 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 2 2 3 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 20 132 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 13 20 8 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 8 128 128 13 20 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 127 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 132 8 8 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 31 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 132 8 5 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 32 1 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 8 13 16 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 7 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 128 128 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 125 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 132 132 20 128 128 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 132 20 132 16 16 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 13 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 20 132 16 15 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 125 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 127 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 8 5 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 3 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 16 16 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 5 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 20 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 132 20 132 8 7 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 1 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 132 20 132 16 16 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 132 132 20 128 128 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 127 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 16 16 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 20 128 128 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 1 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 132 20 20 16 13 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 20 16 13 8 8 16 16 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 125 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 16 16 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 8 8 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 128 128 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 132 132 132 8 7 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 15 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 5 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 132 20 20 16 15 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 16 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 132 20 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 32 32 31 5 2 32 2 1 ]/1 Vertex: [ 132 20 132 8 8 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 4 4 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 5 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 132 132 20 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 1 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 1 32 32 4 1 2 4 2 1 ]/1 Vertex: [ 132 132 20 128 127 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 33 33 5 32 31 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 31 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 132 20 20 16 13 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 125 16 4 4 16 8 4 ]/4 Vertex: [ 33 5 33 4 3 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 125 128 128 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 128 128 128 13 4 4 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 8 8 5 16 20 8 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 31 32 32 4 1 2 4 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 31 5 5 32 5 4 ]/1 Vertex: [ 132 132 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 132 20 132 16 13 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 132 132 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 132 132 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 5 5 32 5 4 ]/1 Vertex: [ 132 132 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 5 5 2 5 4 ]/1 Vertex: [ 132 132 20 128 125 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 13 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 7 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 128 127 20 20 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 5 4 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 128 128 8 4 4 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 125 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 132 20 132 16 16 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 127 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 32 1 1 2 2 2 1 ]/1 Vertex: [ 132 132 20 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 1 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 128 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 31 32 32 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 127 128 128 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 127 8 20 20 8 8 4 ]/4 Vertex: [ 132 20 132 16 13 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 5 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 132 132 20 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 32 32 31 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 33 5 5 4 3 32 32 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 1 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 132 132 132 128 127 128 128 128 20 20 128 8 4 ]/4 Vertex: [ 33 33 33 32 31 32 32 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 33 32 31 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 128 125 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 125 128 128 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 125 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 31 32 32 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 132 132 132 128 125 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 132 132 132 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 32 3 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 33 33 33 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 125 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 20 132 20 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 5 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 8 5 128 128 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 20 20 132 16 13 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 127 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 1 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 128 125 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 7 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 132 132 20 8 7 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 125 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 31 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 128 127 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 33 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 31 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 33 5 5 4 3 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 132 132 20 8 8 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 2 1 4 4 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 125 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 20 16 16 16 16 13 4 4 16 8 4 ]/4 Vertex: [ 5 33 33 32 31 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 16 16 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 3 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 132 20 20 16 16 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 128 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 5 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 20 128 128 8 8 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 5 32 31 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 3 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 3 32 32 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 5 2 5 4 ]/1 Vertex: [ 132 20 20 8 8 128 125 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 13 16 16 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 4 3 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 7 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 32 5 2 32 2 1 ]/1 Vertex: [ 20 132 20 128 127 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 127 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 3 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 20 132 20 128 128 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 15 128 128 16 20 20 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 15 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 13 16 4 4 16 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 20 132 132 128 125 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 15 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 128 20 20 128 8 4 ]/4 Vertex: [ 132 20 20 8 5 128 128 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 4 31 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 128 128 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 128 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 20 132 20 128 125 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 7 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 4 4 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 15 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 8 8 8 20 20 8 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 4 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 4 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 1 2 2 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 16 127 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 16 13 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 128 128 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 33 33 5 2 2 32 32 3 1 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 1 4 4 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 5 2 1 4 4 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 31 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 32 32 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 20 8 7 16 16 16 20 20 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 1 2 2 32 5 5 32 5 4 ]/1 Vertex: [ 20 20 132 16 16 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 2 1 2 2 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 3 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 1 4 4 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 7 16 16 128 20 20 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 5 5 33 4 4 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 33 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 4 4 2 2 31 1 2 32 2 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 2 2 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 4 3 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 132 132 8 5 16 16 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 33 2 1 4 4 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 13 8 8 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 1 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 5 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 8 16 15 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 7 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 1 4 4 2 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 16 7 20 20 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 4 1 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 15 128 20 20 128 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 20 20 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 8 5 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 20 132 8 8 8 8 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 33 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 20 128 127 8 8 16 20 20 16 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 33 33 5 2 1 32 32 4 5 5 4 5 4 ]/1 Vertex: [ 132 132 20 8 5 128 128 16 20 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 5 8 4 4 8 8 4 ]/4 Vertex: [ 5 33 5 32 31 4 4 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 2 3 5 2 4 2 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 16 20 20 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 20 20 132 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 1 5 2 2 2 1 ]/1 Vertex: [ 20 20 132 16 16 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 20 8 5 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 16 4 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 125 16 4 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 20 16 13 8 8 16 4 4 16 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 31 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 2 1 5 5 2 5 1 ]/1 Vertex: [ 20 132 132 8 5 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 2 2 31 5 5 32 5 1 ]/1 Vertex: [ 20 132 132 8 8 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 5 5 33 2 2 4 4 1 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 31 2 2 4 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 8 125 20 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 125 20 8 128 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 32 32 4 4 3 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 2 3 5 5 4 5 4 ]/1 Vertex: [ 20 20 132 8 8 8 5 128 20 8 128 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 2 1 1 2 2 2 1 ]/1 Vertex: [ 132 20 20 16 13 8 8 8 4 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 16 16 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 125 16 20 8 16 8 4 ]/4 Vertex: [ 5 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 20 20 132 16 13 8 8 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 5 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 5 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 8 16 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 5 16 4 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 5 4 4 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 5 8 16 4 8 8 4 ]/4 Vertex: [ 33 5 5 2 1 2 2 2 5 5 2 5 4 ]/1 Vertex: [ 20 132 132 128 125 16 16 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 13 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 16 16 128 20 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 5 8 20 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 125 8 8 8 20 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 5 8 8 128 16 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 125 16 4 128 8 4 ]/4 Vertex: [ 33 33 5 2 1 2 2 2 1 2 2 2 1 ]/1 Vertex: [ 20 20 132 8 8 8 5 128 16 4 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 13 128 16 4 128 8 4 ]/4 Vertex: [ 132 132 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 132 8 7 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 7 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 127 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 16 15 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 128 127 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 16 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 7 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 127 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 127 128 128 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 127 128 4 8 128 8 4 ]/4 Vertex: [ 20 132 20 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 127 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 132 8 7 128 128 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 127 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 15 128 128 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 132 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 127 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 128 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 128 127 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 128 128 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 127 128 128 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 127 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 128 127 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 7 128 128 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 127 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 127 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 20 132 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 127 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 127 4 8 128 8 4 ]/4 Vertex: [ 132 132 20 128 127 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 7 128 128 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 127 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 8 8 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 8 7 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 132 132 20 128 128 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 15 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 128 128 127 4 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 15 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 128 127 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 132 16 15 128 128 128 4 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 132 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 132 8 8 8 8 127 4 8 128 8 4 ]/4 Vertex: [ 132 20 20 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 16 15 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 132 132 20 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 7 128 128 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 127 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 16 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 8 7 128 128 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 8 8 128 128 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 15 16 16 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 16 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 16 16 15 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 15 16 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 7 16 16 16 4 8 16 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 16 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 7 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 7 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 132 16 16 8 7 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 16 16 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 132 16 15 8 8 128 4 8 128 8 4 ]/4 Vertex: [ 20 20 20 8 7 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 8 8 16 16 15 4 8 16 8 4 ]/4 Vertex: [ 20 20 20 8 8 8 8 15 4 8 16 8 4 ]/4 Vertex: [ 132 20 20 16 16 128 127 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 8 16 15 8 4 8 8 8 4 ]/4 Vertex: [ 20 132 20 8 7 16 16 8 4 8 8 8 4 ]/4 Vertex: [ 20 20 20 16 15 8 8 8 4 8 8 8 4 ]/4 Vertex: [ 132 20 20 16 15 128 128 8 4 8 8 8 4 ]/4 polylib-5.22.5.orig/Test/others/8hedron0000644000175000017500000000020611035141337020611 0ustar sylvestresylvestre 8 6 1 -1 -1 -1 1 0 1 -1 -1 1 1 0 1 -1 1 -1 1 0 1 -1 1 1 1 0 1 1 -1 -1 1 0 1 1 -1 1 1 0 1 1 1 -1 1 0 1 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/others/64hedron0000644000175000017500000000301711035141337020676 0ustar sylvestresylvestre 64 9 1 1 1 1 -1 -1 -1 1 0 1 1 1 1 -1 -1 1 1 0 1 1 1 1 -1 1 -1 1 0 1 1 1 1 -1 1 1 1 0 1 1 1 1 1 -1 -1 1 0 1 1 1 1 1 -1 1 1 0 1 1 1 1 1 1 -1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 -1 -1 -1 -1 1 0 1 1 1 -1 -1 -1 1 1 0 1 1 1 -1 -1 1 -1 1 0 1 1 1 -1 -1 1 1 1 0 1 1 1 -1 1 -1 -1 1 0 1 1 1 -1 1 -1 1 1 0 1 1 1 -1 1 1 -1 1 0 1 1 1 -1 1 1 1 1 0 1 1 -1 1 -1 -1 -1 1 0 1 1 -1 1 -1 -1 1 1 0 1 1 -1 1 -1 1 -1 1 0 1 1 -1 1 -1 1 1 1 0 1 1 -1 1 1 -1 -1 1 0 1 1 -1 1 1 -1 1 1 0 1 1 -1 1 1 1 -1 1 0 1 1 -1 1 1 1 1 1 0 1 1 -1 -1 -1 -1 -1 1 0 1 1 -1 -1 -1 -1 1 1 0 1 1 -1 -1 -1 1 -1 1 0 1 1 -1 -1 -1 1 1 1 0 1 1 -1 -1 1 -1 -1 1 0 1 1 -1 -1 1 -1 1 1 0 1 1 -1 -1 1 1 -1 1 0 1 1 -1 -1 1 1 1 1 0 1 -1 1 1 -1 -1 -1 1 0 1 -1 1 1 -1 -1 1 1 0 1 -1 1 1 -1 1 -1 1 0 1 -1 1 1 -1 1 1 1 0 1 -1 1 1 1 -1 -1 1 0 1 -1 1 1 1 -1 1 1 0 1 -1 1 1 1 1 -1 1 0 1 -1 1 1 1 1 1 1 0 1 -1 1 -1 -1 -1 -1 1 0 1 -1 1 -1 -1 -1 1 1 0 1 -1 1 -1 -1 1 -1 1 0 1 -1 1 -1 -1 1 1 1 0 1 -1 1 -1 1 -1 -1 1 0 1 -1 1 -1 1 -1 1 1 0 1 -1 1 -1 1 1 -1 1 0 1 -1 1 -1 1 1 1 1 0 1 -1 -1 1 -1 -1 -1 1 0 1 -1 -1 1 -1 -1 1 1 0 1 -1 -1 1 -1 1 -1 1 0 1 -1 -1 1 -1 1 1 1 0 1 -1 -1 1 1 -1 -1 1 0 1 -1 -1 1 1 -1 1 1 0 1 -1 -1 1 1 1 -1 1 0 1 -1 -1 1 1 1 1 1 0 1 -1 -1 -1 -1 -1 -1 1 0 1 -1 -1 -1 -1 -1 1 1 0 1 -1 -1 -1 -1 1 -1 1 0 1 -1 -1 -1 -1 1 1 1 0 1 -1 -1 -1 1 -1 -1 1 0 1 -1 -1 -1 1 -1 1 1 0 1 -1 -1 -1 1 1 -1 1 0 1 -1 -1 -1 1 1 1 1 0 0 3 N polylib-5.22.5.orig/Test/others/francois2.out0000644000175000017500000006453011035141337021750 0ustar sylvestresylvestrePOLYHEDRON Dimension:13 Constraints:21 Equations:4 Rays:384 Lines:0 Constraints 21 15 Equality: [ 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 ] Equality: [ 0 0 0 0 0 1 -1 0 0 0 0 0 0 -1 ] Equality: [ 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 ] Equality: [ 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 1 -1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 0 -1 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 -1 0 0 -1 ] Inequality: [ 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 -1 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 0 0 -1 0 0 0 0 5 ] Inequality: [ 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 ] Inequality: [ 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 ] Inequality: [ 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 ] Inequality: [ 0 1 0 0 -1 0 0 0 0 0 0 0 0 -1 ] Inequality: [ 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 ] Inequality: [ -1 0 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 -1 0 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 -1 0 0 0 0 0 0 0 0 0 0 33 ] Inequality: [ 0 0 0 0 0 0 0 0 0 0 1 0 0 -2 ] Rays 384 15 Vertex: [ 33 5 5 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 2 1 2 2 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 5 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 2 5 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 5 2 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 2 1 2 2 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 2 1 2 2 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 2 5 5 2 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 2 5 5 2 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 2 5 2 2 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 33 33 32 32 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 32 32 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 33 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 4 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 33 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 4 4 32 31 32 1 2 32 2 1 ]/1 Vertex: [ 33 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 5 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 4 ]/1 Vertex: [ 33 5 5 4 4 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 5 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 5 2 32 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 4 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 5 32 5 1 ]/1 Vertex: [ 5 5 33 4 4 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 4 4 4 3 32 1 2 32 2 1 ]/1 Vertex: [ 5 5 33 2 2 2 1 32 1 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 33 2 2 32 31 32 5 2 32 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 33 32 32 32 31 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 33 32 32 2 1 32 5 5 32 5 4 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 4 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 33 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 32 32 32 31 4 1 2 4 2 1 ]/1 Vertex: [ 33 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 5 5 4 4 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 1 2 4 2 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 4 3 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 1 ]/1 Vertex: [ 5 5 5 2 2 2 1 4 5 5 4 5 4 ]/1 Vertex: [ 5 33 5 2 2 2 1 4 1 5 4 5 4 ]/1 Vertex: [ 5 33 5 32 32 2 1 4 5 2 4 2 1 ]/1 Vertex: [ 5 5 5 2 2 4 3 4 5 5 4 5 4 ]/1 Vertex: [ 5 5 5 4 4 2 1 4 5 5 4 5 1 ]/1 Vertex: [ 5 33 5 2 2 4 3 4 1 5 4 5 4 ]/1 polylib-5.22.5.orig/Test/others/ben0000644000175000017500000000057511035141337020017 0ustar sylvestresylvestre # Benoit's problem, 32 bits overflow in testrank. # (polyparam.c) Solved calling GNU MP. # Another overflow in MatInverse. MatInverse_mp to be written. 9 8 0 1 1 0 0 0 -1 -1 0 1 0 1 0 -1 0 2 0 0 1 1 -1 0 0 0 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 150000 1 -1 1 0 0 0 0 0 1 2 -1 0 0 0 0 -1 1 -1 1 1 0 0 0 0 1 1 1 -1 0 0 0 0 0 5 polylib-5.22.5.orig/Test/others/t4.in0000644000175000017500000000020311035141337020173 0ustar sylvestresylvestre3 5 0 0 1 -1 5 1 1 -1 0 0 1 -1 0 1 0 2 4 1 1 0 0 1 0 1 0 M N depending parameters test -------------------- m = n-5 m <= x <= n polylib-5.22.5.orig/Test/pp/0000755000175000017500000000000011341243125016432 5ustar sylvestresylvestrepolylib-5.22.5.orig/Test/pp/c7.out0000644000175000017500000041210311035141340017471 0ustar sylvestresylvestre--------------------------------------- Domain : - Q -2R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 P + Q + 2R + S >= 0 - Q - R >= 0 -2R - S >= 0 P - Q -2R - S >= 0 1 >= 0 Vertices : [ Q+2R+S, Q+2R+S, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, Q+2R+S, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 - Q + R - U >= 0 P + Q + S + U >= 0 P - Q - S - U >= 0 - Q + S - U >= 0 - S - U >= 0 1 >= 0 Vertices : [ Q+S+U, Q+S+U, Q+U, Q+U, Q+U, U, 2R ] [ Q+S+U, Q+S+U, Q+U, Q+U, Q+U, U, U ] [ -P, Q+S+U, Q+U, Q+U, Q+U, U, 2R ] [ -P, Q+S+U, Q+U, Q+U, Q+U, U, U ] [ -P, -P, Q+U, Q+U, Q+U, U, 2R ] [ -P, -P, Q+U, Q+U, Q+U, U, U ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 R - T >= 0 P + S + T >= 0 P - S - T >= 0 S - T >= 0 Q - S - T >= 0 1 >= 0 Vertices : [ S+T, S+T, T, T, T, 2R, 2R ] [ S+T, S+T, T, T, T, -Q+T, 2R ] [ S+T, S+T, T, T, T, -Q+T, -Q+T ] [ -P, S+T, T, T, T, 2R, 2R ] [ -P, S+T, T, T, T, -Q+T, 2R ] [ -P, S+T, T, T, T, -Q+T, -Q+T ] [ -P, -P, T, T, T, 2R, 2R ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - S - T >= 0 R - T >= 0 P + S + T >= 0 P - S - T >= 0 S - T >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ S+T, S+T, T, T, T, U, 2R ] [ S+T, S+T, T, T, T, U, U ] [ S+T, S+T, T, T, T, -Q+T, 2R ] [ S+T, S+T, T, T, T, -Q+T, -Q+T ] [ -P, S+T, T, T, T, U, 2R ] [ -P, S+T, T, T, T, U, U ] [ -P, S+T, T, T, T, -Q+T, 2R ] [ -P, S+T, T, T, T, -Q+T, -Q+T ] [ -P, -P, T, T, T, U, 2R ] [ -P, -P, T, T, T, U, U ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P -2S >= 0 -2R + U >= 0 - Q -2R + T >= 0 P + 2S >= 0 R - S >= 0 Q -2S >= 0 Q + 2R - S >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, Q+2R, 2R, 2R ] [ 2S, 2S, S, S, S, 2R, 2R ] [ 2S, 2S, S, S, S, -Q+S, 2R ] [ 2S, 2S, S, S, S, -Q+S, -Q+S ] [ -P, 2S, S, S, Q+2R, 2R, 2R ] [ -P, 2S, S, S, S, 2R, 2R ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, Q+2R, 2R, 2R ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 R - S >= 0 P + 2S >= 0 Q - S + U >= 0 P -2S >= 0 Q -2S >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, Q+U, U, 2R ] [ 2S, 2S, S, S, Q+U, U, U ] [ 2S, 2S, S, S, S, U, 2R ] [ 2S, 2S, S, S, S, U, U ] [ 2S, 2S, S, S, S, -Q+S, 2R ] [ 2S, 2S, S, S, S, -Q+S, -Q+S ] [ -P, 2S, S, S, Q+U, U, 2R ] [ -P, 2S, S, S, Q+U, U, U ] [ -P, 2S, S, S, S, U, 2R ] [ -P, 2S, S, S, S, U, U ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, Q+U, U, 2R ] [ -P, -P, S, S, Q+U, U, U ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 R - S >= 0 P + 2S >= 0 - S + T >= 0 P -2S >= 0 Q -2S >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, T, 2R, 2R ] [ 2S, 2S, S, S, T, -Q+T, 2R ] [ 2S, 2S, S, S, T, -Q+T, -Q+T ] [ 2S, 2S, S, S, S, 2R, 2R ] [ 2S, 2S, S, S, S, -Q+S, 2R ] [ 2S, 2S, S, S, S, -Q+S, -Q+S ] [ -P, 2S, S, S, T, 2R, 2R ] [ -P, 2S, S, S, T, -Q+T, 2R ] [ -P, 2S, S, S, T, -Q+T, -Q+T ] [ -P, 2S, S, S, S, 2R, 2R ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, T, 2R, 2R ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q -2S >= 0 R - S >= 0 P + 2S >= 0 - S + T >= 0 P -2S >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, T, U, 2R ] [ 2S, 2S, S, S, T, U, U ] [ 2S, 2S, S, S, T, -Q+T, 2R ] [ 2S, 2S, S, S, T, -Q+T, -Q+T ] [ 2S, 2S, S, S, S, U, 2R ] [ 2S, 2S, S, S, S, U, U ] [ 2S, 2S, S, S, S, -Q+S, 2R ] [ 2S, 2S, S, S, S, -Q+S, -Q+S ] [ -P, 2S, S, S, T, U, 2R ] [ -P, 2S, S, S, T, U, U ] [ -P, 2S, S, S, T, -Q+T, 2R ] [ -P, 2S, S, S, T, -Q+T, -Q+T ] [ -P, 2S, S, S, S, U, 2R ] [ -P, 2S, S, S, S, U, U ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, T, U, 2R ] [ -P, -P, S, S, T, U, U ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 - Q -2R + S >= 0 Q + R >= 0 P - R - S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, Q+2R, Q+2R, 2R, 2R ] [ R+S, R+S, R, R, Q+2R, 2R, 2R ] [ R+S, R+S, R, R, R, 2R, 2R ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, Q+2R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 - Q + T - U >= 0 - Q + S - U >= 0 Q - R + U >= 0 P - R - S >= 0 Q - R - S >= 0 2R - U >= 0 1 >= 0 Vertices : [ R+S, R+S, R, Q+U, Q+U, U, 2R ] [ R+S, R+S, R, Q+U, Q+U, U, U ] [ R+S, R+S, R, R, Q+U, U, 2R ] [ R+S, R+S, R, R, Q+U, U, U ] [ R+S, R+S, R, R, R, U, 2R ] [ R+S, R+S, R, R, R, U, U ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, Q+U, Q+U, U, 2R ] [ -P, R+S, R, Q+U, Q+U, U, U ] [ -P, R+S, R, R, Q+U, U, 2R ] [ -P, R+S, R, R, Q+U, U, U ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, Q+U, Q+U, U, 2R ] [ -P, -P, R, Q+U, Q+U, U, U ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 -2R + U >= 0 S - T >= 0 - R + T >= 0 P - R - S >= 0 Q - R - S >= 0 Q + 2R - T >= 0 1 >= 0 Vertices : [ R+S, R+S, R, T, T, 2R, 2R ] [ R+S, R+S, R, T, T, -Q+T, 2R ] [ R+S, R+S, R, T, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, T, 2R, 2R ] [ R+S, R+S, R, R, T, -Q+T, 2R ] [ R+S, R+S, R, R, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, R, 2R, 2R ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, T, T, 2R, 2R ] [ -P, R+S, R, T, T, -Q+T, 2R ] [ -P, R+S, R, T, T, -Q+T, -Q+T ] [ -P, R+S, R, R, T, 2R, 2R ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, T, T, 2R, 2R ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 S - T >= 0 - R + T >= 0 P - R - S >= 0 Q - T + U >= 0 2R - U >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, T, T, U, 2R ] [ R+S, R+S, R, T, T, U, U ] [ R+S, R+S, R, T, T, -Q+T, 2R ] [ R+S, R+S, R, T, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, T, U, 2R ] [ R+S, R+S, R, R, T, U, U ] [ R+S, R+S, R, R, T, -Q+T, 2R ] [ R+S, R+S, R, R, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, R, U, 2R ] [ R+S, R+S, R, R, R, U, U ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, T, T, U, 2R ] [ -P, R+S, R, T, T, U, U ] [ -P, R+S, R, T, T, -Q+T, 2R ] [ -P, R+S, R, T, T, -Q+T, -Q+T ] [ -P, R+S, R, R, T, U, 2R ] [ -P, R+S, R, R, T, U, U ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, T, T, U, 2R ] [ -P, -P, R, T, T, U, U ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 P - R - S >= 0 - R + S >= 0 Q + 2R - S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, Q+2R, 2R, 2R ] [ R+S, R+S, R, S, S, 2R, 2R ] [ R+S, R+S, R, S, S, -Q+S, 2R ] [ R+S, R+S, R, S, S, -Q+S, -Q+S ] [ R+S, R+S, R, R, Q+2R, 2R, 2R ] [ R+S, R+S, R, R, R, 2R, 2R ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, S, Q+2R, 2R, 2R ] [ -P, R+S, R, S, S, 2R, 2R ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, Q+2R, 2R, 2R ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 - Q + T - U >= 0 P - R - S >= 0 - R + S >= 0 Q - S + U >= 0 Q - R - S >= 0 2R - U >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, Q+U, U, 2R ] [ R+S, R+S, R, S, Q+U, U, U ] [ R+S, R+S, R, S, S, U, 2R ] [ R+S, R+S, R, S, S, U, U ] [ R+S, R+S, R, S, S, -Q+S, 2R ] [ R+S, R+S, R, S, S, -Q+S, -Q+S ] [ R+S, R+S, R, R, Q+U, U, 2R ] [ R+S, R+S, R, R, Q+U, U, U ] [ R+S, R+S, R, R, R, U, 2R ] [ R+S, R+S, R, R, R, U, U ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, S, Q+U, U, 2R ] [ -P, R+S, R, S, Q+U, U, U ] [ -P, R+S, R, S, S, U, 2R ] [ -P, R+S, R, S, S, U, U ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, Q+U, U, 2R ] [ -P, R+S, R, R, Q+U, U, U ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, Q+U, U, 2R ] [ -P, -P, R, S, Q+U, U, U ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 -2R + U >= 0 P - R - S >= 0 - R + S >= 0 - S + T >= 0 Q - R - S >= 0 Q + 2R - T >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, T, 2R, 2R ] [ R+S, R+S, R, S, T, -Q+T, 2R ] [ R+S, R+S, R, S, T, -Q+T, -Q+T ] [ R+S, R+S, R, S, S, 2R, 2R ] [ R+S, R+S, R, S, S, -Q+S, 2R ] [ R+S, R+S, R, S, S, -Q+S, -Q+S ] [ R+S, R+S, R, R, T, 2R, 2R ] [ R+S, R+S, R, R, T, -Q+T, 2R ] [ R+S, R+S, R, R, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, R, 2R, 2R ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, S, T, 2R, 2R ] [ -P, R+S, R, S, T, -Q+T, 2R ] [ -P, R+S, R, S, T, -Q+T, -Q+T ] [ -P, R+S, R, S, S, 2R, 2R ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, T, 2R, 2R ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, T, 2R, 2R ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + R + S >= 0 P - R - S >= 0 - R + S >= 0 - S + T >= 0 Q - T + U >= 0 2R - U >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, T, U, 2R ] [ R+S, R+S, R, S, T, U, U ] [ R+S, R+S, R, S, T, -Q+T, 2R ] [ R+S, R+S, R, S, T, -Q+T, -Q+T ] [ R+S, R+S, R, S, S, U, 2R ] [ R+S, R+S, R, S, S, U, U ] [ R+S, R+S, R, S, S, -Q+S, 2R ] [ R+S, R+S, R, S, S, -Q+S, -Q+S ] [ R+S, R+S, R, R, T, U, 2R ] [ R+S, R+S, R, R, T, U, U ] [ R+S, R+S, R, R, T, -Q+T, 2R ] [ R+S, R+S, R, R, T, -Q+T, -Q+T ] [ R+S, R+S, R, R, R, U, 2R ] [ R+S, R+S, R, R, R, U, U ] [ R+S, R+S, R, R, R, -Q+R, 2R ] [ R+S, R+S, R, R, R, -Q+R, -Q+R ] [ -P, R+S, R, S, T, U, 2R ] [ -P, R+S, R, S, T, U, U ] [ -P, R+S, R, S, T, -Q+T, 2R ] [ -P, R+S, R, S, T, -Q+T, -Q+T ] [ -P, R+S, R, S, S, U, 2R ] [ -P, R+S, R, S, S, U, U ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, T, U, 2R ] [ -P, R+S, R, R, T, U, U ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, T, U, 2R ] [ -P, -P, R, S, T, U, U ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q -2R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 P + Q >= 0 - Q - R >= 0 2R + S >= 0 P - Q >= 0 1 >= 0 Vertices : [ Q, Q, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 - Q + R - U >= 0 P + Q >= 0 P - Q >= 0 - Q + S - U >= 0 S + U >= 0 1 >= 0 Vertices : [ Q, Q, Q+U, Q+U, Q+U, U, 2R ] [ Q, Q, Q+U, Q+U, Q+U, U, U ] [ Q, Q, Q-S, Q+U, Q+U, U, 2R ] [ Q, Q, Q-S, Q+U, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q+U, U, 2R ] [ Q, Q, Q-S, Q-S, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, Q+U, Q+U, Q+U, U, 2R ] [ -P, Q, Q+U, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q+U, Q+U, U, 2R ] [ -P, Q, Q-S, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, Q+U, Q+U, Q+U, U, 2R ] [ -P, -P, Q+U, Q+U, Q+U, U, U ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 R - T >= 0 P + Q >= 0 P - Q >= 0 S - T >= 0 - Q + S + T >= 0 1 >= 0 Vertices : [ Q, Q, T, T, T, 2R, 2R ] [ Q, Q, T, T, T, -Q+T, 2R ] [ Q, Q, T, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, T, T, 2R, 2R ] [ Q, Q, Q-S, T, T, -Q+T, 2R ] [ Q, Q, Q-S, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, T, 2R, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, T, T, T, 2R, 2R ] [ -P, Q, T, T, T, -Q+T, 2R ] [ -P, Q, T, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, T, T, 2R, 2R ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, T, T, T, 2R, 2R ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + S + T >= 0 R - T >= 0 P + Q >= 0 P - Q >= 0 S - T >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ Q, Q, T, T, T, U, 2R ] [ Q, Q, T, T, T, U, U ] [ Q, Q, T, T, T, -Q+T, 2R ] [ Q, Q, T, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, T, T, U, 2R ] [ Q, Q, Q-S, T, T, U, U ] [ Q, Q, Q-S, T, T, -Q+T, 2R ] [ Q, Q, Q-S, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, T, U, 2R ] [ Q, Q, Q-S, Q-S, T, U, U ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, T, T, T, U, 2R ] [ -P, Q, T, T, T, U, U ] [ -P, Q, T, T, T, -Q+T, 2R ] [ -P, Q, T, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, T, T, U, 2R ] [ -P, Q, Q-S, T, T, U, U ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, T, T, T, U, 2R ] [ -P, -P, T, T, T, U, U ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P - Q >= 0 -2R + U >= 0 - Q -2R + T >= 0 P + Q >= 0 R - S >= 0 - Q + 2S >= 0 Q + 2R - S >= 0 1 >= 0 Vertices : [ Q, Q, S, S, Q+2R, 2R, 2R ] [ Q, Q, S, S, S, 2R, 2R ] [ Q, Q, S, S, S, -Q+S, 2R ] [ Q, Q, S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, S, S, 2R, 2R ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, S, S, Q+2R, 2R, 2R ] [ -P, Q, S, S, S, 2R, 2R ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, Q+2R, 2R, 2R ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 R - S >= 0 P + Q >= 0 Q - S + U >= 0 P - Q >= 0 - Q + 2S >= 0 1 >= 0 Vertices : [ Q, Q, S, S, Q+U, U, 2R ] [ Q, Q, S, S, Q+U, U, U ] [ Q, Q, S, S, S, U, 2R ] [ Q, Q, S, S, S, U, U ] [ Q, Q, S, S, S, -Q+S, 2R ] [ Q, Q, S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, S, Q+U, U, 2R ] [ Q, Q, Q-S, S, Q+U, U, U ] [ Q, Q, Q-S, S, S, U, 2R ] [ Q, Q, Q-S, S, S, U, U ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, Q+U, U, 2R ] [ Q, Q, Q-S, Q-S, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, S, S, Q+U, U, 2R ] [ -P, Q, S, S, Q+U, U, U ] [ -P, Q, S, S, S, U, 2R ] [ -P, Q, S, S, S, U, U ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, Q+U, U, 2R ] [ -P, Q, Q-S, S, Q+U, U, U ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, Q+U, U, 2R ] [ -P, -P, S, S, Q+U, U, U ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 R - S >= 0 P + Q >= 0 - S + T >= 0 P - Q >= 0 - Q + 2S >= 0 1 >= 0 Vertices : [ Q, Q, S, S, T, 2R, 2R ] [ Q, Q, S, S, T, -Q+T, 2R ] [ Q, Q, S, S, T, -Q+T, -Q+T ] [ Q, Q, S, S, S, 2R, 2R ] [ Q, Q, S, S, S, -Q+S, 2R ] [ Q, Q, S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, S, T, 2R, 2R ] [ Q, Q, Q-S, S, T, -Q+T, 2R ] [ Q, Q, Q-S, S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, S, S, 2R, 2R ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, T, 2R, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, S, S, T, 2R, 2R ] [ -P, Q, S, S, T, -Q+T, 2R ] [ -P, Q, S, S, T, -Q+T, -Q+T ] [ -P, Q, S, S, S, 2R, 2R ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, T, 2R, 2R ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, T, 2R, 2R ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + 2S >= 0 R - S >= 0 P + Q >= 0 - S + T >= 0 P - Q >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ Q, Q, S, S, T, U, 2R ] [ Q, Q, S, S, T, U, U ] [ Q, Q, S, S, T, -Q+T, 2R ] [ Q, Q, S, S, T, -Q+T, -Q+T ] [ Q, Q, S, S, S, U, 2R ] [ Q, Q, S, S, S, U, U ] [ Q, Q, S, S, S, -Q+S, 2R ] [ Q, Q, S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, S, T, U, 2R ] [ Q, Q, Q-S, S, T, U, U ] [ Q, Q, Q-S, S, T, -Q+T, 2R ] [ Q, Q, Q-S, S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, S, S, U, 2R ] [ Q, Q, Q-S, S, S, U, U ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, T, U, 2R ] [ Q, Q, Q-S, Q-S, T, U, U ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, S, S, T, U, 2R ] [ -P, Q, S, S, T, U, U ] [ -P, Q, S, S, T, -Q+T, 2R ] [ -P, Q, S, S, T, -Q+T, -Q+T ] [ -P, Q, S, S, S, U, 2R ] [ -P, Q, S, S, S, U, U ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, T, U, 2R ] [ -P, Q, Q-S, S, T, U, U ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, T, U, 2R ] [ -P, -P, S, S, T, U, U ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 -2R + U >= 0 - Q -2R + T >= 0 - Q -2R + S >= 0 Q + R >= 0 P - Q >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ Q, Q, R, Q+2R, Q+2R, 2R, 2R ] [ Q, Q, R, R, Q+2R, 2R, 2R ] [ Q, Q, R, R, R, 2R, 2R ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, R, R, Q+2R, 2R, 2R ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 - Q + T - U >= 0 - Q + S - U >= 0 Q - R + U >= 0 P - Q >= 0 - Q + R + S >= 0 2R - U >= 0 1 >= 0 Vertices : [ Q, Q, R, Q+U, Q+U, U, 2R ] [ Q, Q, R, Q+U, Q+U, U, U ] [ Q, Q, R, R, Q+U, U, 2R ] [ Q, Q, R, R, Q+U, U, U ] [ Q, Q, R, R, R, U, 2R ] [ Q, Q, R, R, R, U, U ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, Q+U, Q+U, U, 2R ] [ Q, Q, Q-S, Q+U, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q+U, U, 2R ] [ Q, Q, Q-S, Q-S, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, Q+U, Q+U, U, 2R ] [ -P, Q, R, Q+U, Q+U, U, U ] [ -P, Q, R, R, Q+U, U, 2R ] [ -P, Q, R, R, Q+U, U, U ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, Q+U, Q+U, U, 2R ] [ -P, Q, Q-S, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, Q+U, Q+U, U, 2R ] [ -P, -P, R, Q+U, Q+U, U, U ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 -2R + U >= 0 S - T >= 0 - R + T >= 0 P - Q >= 0 - Q + R + S >= 0 Q + 2R - T >= 0 1 >= 0 Vertices : [ Q, Q, R, T, T, 2R, 2R ] [ Q, Q, R, T, T, -Q+T, 2R ] [ Q, Q, R, T, T, -Q+T, -Q+T ] [ Q, Q, R, R, T, 2R, 2R ] [ Q, Q, R, R, T, -Q+T, 2R ] [ Q, Q, R, R, T, -Q+T, -Q+T ] [ Q, Q, R, R, R, 2R, 2R ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, T, T, 2R, 2R ] [ Q, Q, Q-S, T, T, -Q+T, 2R ] [ Q, Q, Q-S, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, T, 2R, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, T, T, 2R, 2R ] [ -P, Q, R, T, T, -Q+T, 2R ] [ -P, Q, R, T, T, -Q+T, -Q+T ] [ -P, Q, R, R, T, 2R, 2R ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, T, T, 2R, 2R ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, T, T, 2R, 2R ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 S - T >= 0 - R + T >= 0 P - Q >= 0 Q - T + U >= 0 2R - U >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ Q, Q, R, T, T, U, 2R ] [ Q, Q, R, T, T, U, U ] [ Q, Q, R, T, T, -Q+T, 2R ] [ Q, Q, R, T, T, -Q+T, -Q+T ] [ Q, Q, R, R, T, U, 2R ] [ Q, Q, R, R, T, U, U ] [ Q, Q, R, R, T, -Q+T, 2R ] [ Q, Q, R, R, T, -Q+T, -Q+T ] [ Q, Q, R, R, R, U, 2R ] [ Q, Q, R, R, R, U, U ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, T, T, U, 2R ] [ Q, Q, Q-S, T, T, U, U ] [ Q, Q, Q-S, T, T, -Q+T, 2R ] [ Q, Q, Q-S, T, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, T, U, 2R ] [ Q, Q, Q-S, Q-S, T, U, U ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, T, T, U, 2R ] [ -P, Q, R, T, T, U, U ] [ -P, Q, R, T, T, -Q+T, 2R ] [ -P, Q, R, T, T, -Q+T, -Q+T ] [ -P, Q, R, R, T, U, 2R ] [ -P, Q, R, R, T, U, U ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, T, T, U, 2R ] [ -P, Q, Q-S, T, T, U, U ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, T, T, U, 2R ] [ -P, -P, R, T, T, U, U ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 -2R + U >= 0 - Q -2R + T >= 0 P - Q >= 0 - R + S >= 0 Q + 2R - S >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ Q, Q, R, S, Q+2R, 2R, 2R ] [ Q, Q, R, S, S, 2R, 2R ] [ Q, Q, R, S, S, -Q+S, 2R ] [ Q, Q, R, S, S, -Q+S, -Q+S ] [ Q, Q, R, R, Q+2R, 2R, 2R ] [ Q, Q, R, R, R, 2R, 2R ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, S, S, 2R, 2R ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, S, Q+2R, 2R, 2R ] [ -P, Q, R, S, S, 2R, 2R ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, Q+2R, 2R, 2R ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, Q+2R, 2R, 2R ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 - Q + T - U >= 0 P - Q >= 0 - R + S >= 0 Q - S + U >= 0 - Q + R + S >= 0 2R - U >= 0 1 >= 0 Vertices : [ Q, Q, R, S, Q+U, U, 2R ] [ Q, Q, R, S, Q+U, U, U ] [ Q, Q, R, S, S, U, 2R ] [ Q, Q, R, S, S, U, U ] [ Q, Q, R, S, S, -Q+S, 2R ] [ Q, Q, R, S, S, -Q+S, -Q+S ] [ Q, Q, R, R, Q+U, U, 2R ] [ Q, Q, R, R, Q+U, U, U ] [ Q, Q, R, R, R, U, 2R ] [ Q, Q, R, R, R, U, U ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, S, Q+U, U, 2R ] [ Q, Q, Q-S, S, Q+U, U, U ] [ Q, Q, Q-S, S, S, U, 2R ] [ Q, Q, Q-S, S, S, U, U ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, Q+U, U, 2R ] [ Q, Q, Q-S, Q-S, Q+U, U, U ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, S, Q+U, U, 2R ] [ -P, Q, R, S, Q+U, U, U ] [ -P, Q, R, S, S, U, 2R ] [ -P, Q, R, S, S, U, U ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, Q+U, U, 2R ] [ -P, Q, R, R, Q+U, U, U ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, Q+U, U, 2R ] [ -P, Q, Q-S, S, Q+U, U, U ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, Q+U, U, 2R ] [ -P, -P, R, S, Q+U, U, U ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 -2R + U >= 0 P - Q >= 0 - R + S >= 0 - S + T >= 0 - Q + R + S >= 0 Q + 2R - T >= 0 1 >= 0 Vertices : [ Q, Q, R, S, T, 2R, 2R ] [ Q, Q, R, S, T, -Q+T, 2R ] [ Q, Q, R, S, T, -Q+T, -Q+T ] [ Q, Q, R, S, S, 2R, 2R ] [ Q, Q, R, S, S, -Q+S, 2R ] [ Q, Q, R, S, S, -Q+S, -Q+S ] [ Q, Q, R, R, T, 2R, 2R ] [ Q, Q, R, R, T, -Q+T, 2R ] [ Q, Q, R, R, T, -Q+T, -Q+T ] [ Q, Q, R, R, R, 2R, 2R ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, S, T, 2R, 2R ] [ Q, Q, Q-S, S, T, -Q+T, 2R ] [ Q, Q, Q-S, S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, S, S, 2R, 2R ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, T, 2R, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, S, T, 2R, 2R ] [ -P, Q, R, S, T, -Q+T, 2R ] [ -P, Q, R, S, T, -Q+T, -Q+T ] [ -P, Q, R, S, S, 2R, 2R ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, T, 2R, 2R ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, T, 2R, 2R ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, T, 2R, 2R ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : P + Q >= 0 P - Q >= 0 - R + S >= 0 - S + T >= 0 Q - T + U >= 0 2R - U >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ Q, Q, R, S, T, U, 2R ] [ Q, Q, R, S, T, U, U ] [ Q, Q, R, S, T, -Q+T, 2R ] [ Q, Q, R, S, T, -Q+T, -Q+T ] [ Q, Q, R, S, S, U, 2R ] [ Q, Q, R, S, S, U, U ] [ Q, Q, R, S, S, -Q+S, 2R ] [ Q, Q, R, S, S, -Q+S, -Q+S ] [ Q, Q, R, R, T, U, 2R ] [ Q, Q, R, R, T, U, U ] [ Q, Q, R, R, T, -Q+T, 2R ] [ Q, Q, R, R, T, -Q+T, -Q+T ] [ Q, Q, R, R, R, U, 2R ] [ Q, Q, R, R, R, U, U ] [ Q, Q, R, R, R, -Q+R, 2R ] [ Q, Q, R, R, R, -Q+R, -Q+R ] [ Q, Q, Q-S, S, T, U, 2R ] [ Q, Q, Q-S, S, T, U, U ] [ Q, Q, Q-S, S, T, -Q+T, 2R ] [ Q, Q, Q-S, S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, S, S, U, 2R ] [ Q, Q, Q-S, S, S, U, U ] [ Q, Q, Q-S, S, S, -Q+S, 2R ] [ Q, Q, Q-S, S, S, -Q+S, -Q+S ] [ Q, Q, Q-S, Q-S, T, U, 2R ] [ Q, Q, Q-S, Q-S, T, U, U ] [ Q, Q, Q-S, Q-S, T, -Q+T, 2R ] [ Q, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, U, 2R ] [ Q, Q, Q-S, Q-S, Q-S, U, U ] [ Q, Q, Q-S, Q-S, Q-S, -S, 2R ] [ Q, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, Q, R, S, T, U, 2R ] [ -P, Q, R, S, T, U, U ] [ -P, Q, R, S, T, -Q+T, 2R ] [ -P, Q, R, S, T, -Q+T, -Q+T ] [ -P, Q, R, S, S, U, 2R ] [ -P, Q, R, S, S, U, U ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, T, U, 2R ] [ -P, Q, R, R, T, U, U ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, T, U, 2R ] [ -P, Q, Q-S, S, T, U, U ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, T, U, 2R ] [ -P, -P, R, S, T, U, U ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : -2R + U >= 0 -2R - S >= 0 - P + Q + 2R + S >= 0 P >= 0 - Q - R >= 0 - Q -2R + T >= 0 1 >= 0 Vertices : [ P, Q+2R+S, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ P, P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q+2R+S, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + S - U >= 0 - Q + T - U >= 0 P >= 0 - Q + R - U >= 0 - P + Q + S + U >= 0 2R - U >= 0 - S - U >= 0 1 >= 0 Vertices : [ P, Q+S+U, Q+U, Q+U, Q+U, U, 2R ] [ P, Q+S+U, Q+U, Q+U, Q+U, U, U ] [ P, P, Q+U, Q+U, Q+U, U, 2R ] [ P, P, Q+U, Q+U, Q+U, U, U ] [ P, P, P-S, Q+U, Q+U, U, 2R ] [ P, P, P-S, Q+U, Q+U, U, U ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q+S+U, Q+U, Q+U, Q+U, U, 2R ] [ -P, Q+S+U, Q+U, Q+U, Q+U, U, U ] [ -P, -P, Q+U, Q+U, Q+U, U, 2R ] [ -P, -P, Q+U, Q+U, Q+U, U, U ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : S - T >= 0 -2R + U >= 0 P >= 0 R - T >= 0 - P + S + T >= 0 Q + 2R - T >= 0 Q - S - T >= 0 1 >= 0 Vertices : [ P, S+T, T, T, T, 2R, 2R ] [ P, S+T, T, T, T, -Q+T, 2R ] [ P, S+T, T, T, T, -Q+T, -Q+T ] [ P, P, T, T, T, 2R, 2R ] [ P, P, T, T, T, -Q+T, 2R ] [ P, P, T, T, T, -Q+T, -Q+T ] [ P, P, P-S, T, T, 2R, 2R ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, S+T, T, T, T, 2R, 2R ] [ -P, S+T, T, T, T, -Q+T, 2R ] [ -P, S+T, T, T, T, -Q+T, -Q+T ] [ -P, -P, T, T, T, 2R, 2R ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - S - T >= 0 R - T >= 0 P >= 0 - P + S + T >= 0 Q - T + U >= 0 S - T >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, S+T, T, T, T, U, 2R ] [ P, S+T, T, T, T, U, U ] [ P, S+T, T, T, T, -Q+T, 2R ] [ P, S+T, T, T, T, -Q+T, -Q+T ] [ P, P, T, T, T, U, 2R ] [ P, P, T, T, T, U, U ] [ P, P, T, T, T, -Q+T, 2R ] [ P, P, T, T, T, -Q+T, -Q+T ] [ P, P, P-S, T, T, U, 2R ] [ P, P, P-S, T, T, U, U ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, S+T, T, T, T, U, 2R ] [ -P, S+T, T, T, T, U, U ] [ -P, S+T, T, T, T, -Q+T, 2R ] [ -P, S+T, T, T, T, -Q+T, -Q+T ] [ -P, -P, T, T, T, U, 2R ] [ -P, -P, T, T, T, U, U ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : -2R + U >= 0 Q -2S >= 0 - P + 2S >= 0 P >= 0 R - S >= 0 - Q -2R + T >= 0 1 >= 0 Vertices : [ P, 2S, S, S, Q+2R, 2R, 2R ] [ P, 2S, S, S, S, 2R, 2R ] [ P, 2S, S, S, S, -Q+S, 2R ] [ P, 2S, S, S, S, -Q+S, -Q+S ] [ P, P, S, S, Q+2R, 2R, 2R ] [ P, P, S, S, S, 2R, 2R ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, Q+2R, 2R, 2R ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, 2S, S, S, Q+2R, 2R, 2R ] [ -P, 2S, S, S, S, 2R, 2R ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, Q+2R, 2R, 2R ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - S + U >= 0 - Q + T - U >= 0 P >= 0 R - S >= 0 - P + 2S >= 0 2R - U >= 0 Q -2S >= 0 1 >= 0 Vertices : [ P, 2S, S, S, Q+U, U, 2R ] [ P, 2S, S, S, Q+U, U, U ] [ P, 2S, S, S, S, U, 2R ] [ P, 2S, S, S, S, U, U ] [ P, 2S, S, S, S, -Q+S, 2R ] [ P, 2S, S, S, S, -Q+S, -Q+S ] [ P, P, S, S, Q+U, U, 2R ] [ P, P, S, S, Q+U, U, U ] [ P, P, S, S, S, U, 2R ] [ P, P, S, S, S, U, U ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, Q+U, U, 2R ] [ P, P, P-S, S, Q+U, U, U ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, 2S, S, S, Q+U, U, 2R ] [ -P, 2S, S, S, Q+U, U, U ] [ -P, 2S, S, S, S, U, 2R ] [ -P, 2S, S, S, S, U, U ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, Q+U, U, 2R ] [ -P, -P, S, S, Q+U, U, U ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - S + T >= 0 -2R + U >= 0 P >= 0 R - S >= 0 - P + 2S >= 0 Q + 2R - T >= 0 Q -2S >= 0 1 >= 0 Vertices : [ P, 2S, S, S, T, 2R, 2R ] [ P, 2S, S, S, T, -Q+T, 2R ] [ P, 2S, S, S, T, -Q+T, -Q+T ] [ P, 2S, S, S, S, 2R, 2R ] [ P, 2S, S, S, S, -Q+S, 2R ] [ P, 2S, S, S, S, -Q+S, -Q+S ] [ P, P, S, S, T, 2R, 2R ] [ P, P, S, S, T, -Q+T, 2R ] [ P, P, S, S, T, -Q+T, -Q+T ] [ P, P, S, S, S, 2R, 2R ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, T, 2R, 2R ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, 2S, S, S, T, 2R, 2R ] [ -P, 2S, S, S, T, -Q+T, 2R ] [ -P, 2S, S, S, T, -Q+T, -Q+T ] [ -P, 2S, S, S, S, 2R, 2R ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, T, 2R, 2R ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q -2S >= 0 R - S >= 0 P >= 0 - P + 2S >= 0 Q - T + U >= 0 - S + T >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, 2S, S, S, T, U, 2R ] [ P, 2S, S, S, T, U, U ] [ P, 2S, S, S, T, -Q+T, 2R ] [ P, 2S, S, S, T, -Q+T, -Q+T ] [ P, 2S, S, S, S, U, 2R ] [ P, 2S, S, S, S, U, U ] [ P, 2S, S, S, S, -Q+S, 2R ] [ P, 2S, S, S, S, -Q+S, -Q+S ] [ P, P, S, S, T, U, 2R ] [ P, P, S, S, T, U, U ] [ P, P, S, S, T, -Q+T, 2R ] [ P, P, S, S, T, -Q+T, -Q+T ] [ P, P, S, S, S, U, 2R ] [ P, P, S, S, S, U, U ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, T, U, 2R ] [ P, P, P-S, S, T, U, U ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, 2S, S, S, T, U, 2R ] [ -P, 2S, S, S, T, U, U ] [ -P, 2S, S, S, T, -Q+T, 2R ] [ -P, 2S, S, S, T, -Q+T, -Q+T ] [ -P, 2S, S, S, S, U, 2R ] [ -P, 2S, S, S, S, U, U ] [ -P, 2S, S, S, S, -Q+S, 2R ] [ -P, 2S, S, S, S, -Q+S, -Q+S ] [ -P, -P, S, S, T, U, 2R ] [ -P, -P, S, S, T, U, U ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + R >= 0 -2R + U >= 0 - Q -2R + T >= 0 - P + R + S >= 0 P >= 0 - Q -2R + S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, Q+2R, Q+2R, 2R, 2R ] [ P, R+S, R, R, Q+2R, 2R, 2R ] [ P, R+S, R, R, R, 2R, 2R ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, Q+2R, Q+2R, 2R, 2R ] [ P, P, R, R, Q+2R, 2R, 2R ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, Q+2R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 P >= 0 - P + R + S >= 0 - Q + S - U >= 0 Q - R + U >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, Q+U, Q+U, U, 2R ] [ P, R+S, R, Q+U, Q+U, U, U ] [ P, R+S, R, R, Q+U, U, 2R ] [ P, R+S, R, R, Q+U, U, U ] [ P, R+S, R, R, R, U, 2R ] [ P, R+S, R, R, R, U, U ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, Q+U, Q+U, U, 2R ] [ P, P, R, Q+U, Q+U, U, U ] [ P, P, R, R, Q+U, U, 2R ] [ P, P, R, R, Q+U, U, U ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, Q+U, Q+U, U, 2R ] [ P, P, P-S, Q+U, Q+U, U, U ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, Q+U, Q+U, U, 2R ] [ -P, R+S, R, Q+U, Q+U, U, U ] [ -P, R+S, R, R, Q+U, U, 2R ] [ -P, R+S, R, R, Q+U, U, U ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, Q+U, Q+U, U, 2R ] [ -P, -P, R, Q+U, Q+U, U, U ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 P >= 0 - P + R + S >= 0 S - T >= 0 - R + T >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, T, T, 2R, 2R ] [ P, R+S, R, T, T, -Q+T, 2R ] [ P, R+S, R, T, T, -Q+T, -Q+T ] [ P, R+S, R, R, T, 2R, 2R ] [ P, R+S, R, R, T, -Q+T, 2R ] [ P, R+S, R, R, T, -Q+T, -Q+T ] [ P, R+S, R, R, R, 2R, 2R ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, T, T, 2R, 2R ] [ P, P, R, T, T, -Q+T, 2R ] [ P, P, R, T, T, -Q+T, -Q+T ] [ P, P, R, R, T, 2R, 2R ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, T, T, 2R, 2R ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, T, T, 2R, 2R ] [ -P, R+S, R, T, T, -Q+T, 2R ] [ -P, R+S, R, T, T, -Q+T, -Q+T ] [ -P, R+S, R, R, T, 2R, 2R ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, T, T, 2R, 2R ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - R - S >= 0 P >= 0 - P + R + S >= 0 S - T >= 0 - R + T >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, R+S, R, T, T, U, 2R ] [ P, R+S, R, T, T, U, U ] [ P, R+S, R, T, T, -Q+T, 2R ] [ P, R+S, R, T, T, -Q+T, -Q+T ] [ P, R+S, R, R, T, U, 2R ] [ P, R+S, R, R, T, U, U ] [ P, R+S, R, R, T, -Q+T, 2R ] [ P, R+S, R, R, T, -Q+T, -Q+T ] [ P, R+S, R, R, R, U, 2R ] [ P, R+S, R, R, R, U, U ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, T, T, U, 2R ] [ P, P, R, T, T, U, U ] [ P, P, R, T, T, -Q+T, 2R ] [ P, P, R, T, T, -Q+T, -Q+T ] [ P, P, R, R, T, U, 2R ] [ P, P, R, R, T, U, U ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, T, T, U, 2R ] [ P, P, P-S, T, T, U, U ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, T, T, U, 2R ] [ -P, R+S, R, T, T, U, U ] [ -P, R+S, R, T, T, -Q+T, 2R ] [ -P, R+S, R, T, T, -Q+T, -Q+T ] [ -P, R+S, R, R, T, U, 2R ] [ -P, R+S, R, R, T, U, U ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, T, T, U, 2R ] [ -P, -P, R, T, T, U, U ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 - P + R + S >= 0 P >= 0 Q + 2R - S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, S, Q+2R, 2R, 2R ] [ P, R+S, R, S, S, 2R, 2R ] [ P, R+S, R, S, S, -Q+S, 2R ] [ P, R+S, R, S, S, -Q+S, -Q+S ] [ P, R+S, R, R, Q+2R, 2R, 2R ] [ P, R+S, R, R, R, 2R, 2R ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, S, Q+2R, 2R, 2R ] [ P, P, R, S, S, 2R, 2R ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, Q+2R, 2R, 2R ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, Q+2R, 2R, 2R ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, S, Q+2R, 2R, 2R ] [ -P, R+S, R, S, S, 2R, 2R ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, Q+2R, 2R, 2R ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, Q+2R, 2R, 2R ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 P >= 0 - P + R + S >= 0 Q - S + U >= 0 - R + S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, S, Q+U, U, 2R ] [ P, R+S, R, S, Q+U, U, U ] [ P, R+S, R, S, S, U, 2R ] [ P, R+S, R, S, S, U, U ] [ P, R+S, R, S, S, -Q+S, 2R ] [ P, R+S, R, S, S, -Q+S, -Q+S ] [ P, R+S, R, R, Q+U, U, 2R ] [ P, R+S, R, R, Q+U, U, U ] [ P, R+S, R, R, R, U, 2R ] [ P, R+S, R, R, R, U, U ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, S, Q+U, U, 2R ] [ P, P, R, S, Q+U, U, U ] [ P, P, R, S, S, U, 2R ] [ P, P, R, S, S, U, U ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, Q+U, U, 2R ] [ P, P, R, R, Q+U, U, U ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, Q+U, U, 2R ] [ P, P, P-S, S, Q+U, U, U ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, S, Q+U, U, 2R ] [ -P, R+S, R, S, Q+U, U, U ] [ -P, R+S, R, S, S, U, 2R ] [ -P, R+S, R, S, S, U, U ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, Q+U, U, 2R ] [ -P, R+S, R, R, Q+U, U, U ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, Q+U, U, 2R ] [ -P, -P, R, S, Q+U, U, U ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 P >= 0 - P + R + S >= 0 - S + T >= 0 - R + S >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ P, R+S, R, S, T, 2R, 2R ] [ P, R+S, R, S, T, -Q+T, 2R ] [ P, R+S, R, S, T, -Q+T, -Q+T ] [ P, R+S, R, S, S, 2R, 2R ] [ P, R+S, R, S, S, -Q+S, 2R ] [ P, R+S, R, S, S, -Q+S, -Q+S ] [ P, R+S, R, R, T, 2R, 2R ] [ P, R+S, R, R, T, -Q+T, 2R ] [ P, R+S, R, R, T, -Q+T, -Q+T ] [ P, R+S, R, R, R, 2R, 2R ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, S, T, 2R, 2R ] [ P, P, R, S, T, -Q+T, 2R ] [ P, P, R, S, T, -Q+T, -Q+T ] [ P, P, R, S, S, 2R, 2R ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, T, 2R, 2R ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, T, 2R, 2R ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, S, T, 2R, 2R ] [ -P, R+S, R, S, T, -Q+T, 2R ] [ -P, R+S, R, S, T, -Q+T, -Q+T ] [ -P, R+S, R, S, S, 2R, 2R ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, T, 2R, 2R ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, 2R, 2R ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, T, 2R, 2R ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - R - S >= 0 P >= 0 - P + R + S >= 0 - S + T >= 0 - R + S >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, R+S, R, S, T, U, 2R ] [ P, R+S, R, S, T, U, U ] [ P, R+S, R, S, T, -Q+T, 2R ] [ P, R+S, R, S, T, -Q+T, -Q+T ] [ P, R+S, R, S, S, U, 2R ] [ P, R+S, R, S, S, U, U ] [ P, R+S, R, S, S, -Q+S, 2R ] [ P, R+S, R, S, S, -Q+S, -Q+S ] [ P, R+S, R, R, T, U, 2R ] [ P, R+S, R, R, T, U, U ] [ P, R+S, R, R, T, -Q+T, 2R ] [ P, R+S, R, R, T, -Q+T, -Q+T ] [ P, R+S, R, R, R, U, 2R ] [ P, R+S, R, R, R, U, U ] [ P, R+S, R, R, R, -Q+R, 2R ] [ P, R+S, R, R, R, -Q+R, -Q+R ] [ P, P, R, S, T, U, 2R ] [ P, P, R, S, T, U, U ] [ P, P, R, S, T, -Q+T, 2R ] [ P, P, R, S, T, -Q+T, -Q+T ] [ P, P, R, S, S, U, 2R ] [ P, P, R, S, S, U, U ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, T, U, 2R ] [ P, P, R, R, T, U, U ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, T, U, 2R ] [ P, P, P-S, S, T, U, U ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, R+S, R, S, T, U, 2R ] [ -P, R+S, R, S, T, U, U ] [ -P, R+S, R, S, T, -Q+T, 2R ] [ -P, R+S, R, S, T, -Q+T, -Q+T ] [ -P, R+S, R, S, S, U, 2R ] [ -P, R+S, R, S, S, U, U ] [ -P, R+S, R, S, S, -Q+S, 2R ] [ -P, R+S, R, S, S, -Q+S, -Q+S ] [ -P, R+S, R, R, T, U, 2R ] [ -P, R+S, R, R, T, U, U ] [ -P, R+S, R, R, T, -Q+T, 2R ] [ -P, R+S, R, R, T, -Q+T, -Q+T ] [ -P, R+S, R, R, R, U, 2R ] [ -P, R+S, R, R, R, U, U ] [ -P, R+S, R, R, R, -Q+R, 2R ] [ -P, R+S, R, R, R, -Q+R, -Q+R ] [ -P, -P, R, S, T, U, 2R ] [ -P, -P, R, S, T, U, U ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : -2R + U >= 0 2R + S >= 0 - P + Q >= 0 P >= 0 - Q - R >= 0 - Q -2R + T >= 0 1 >= 0 Vertices : [ P, Q, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, Q+2R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + S - U >= 0 - Q + T - U >= 0 P >= 0 - Q + R - U >= 0 - P + Q >= 0 2R - U >= 0 S + U >= 0 1 >= 0 Vertices : [ P, Q, Q+U, Q+U, Q+U, U, 2R ] [ P, Q, Q+U, Q+U, Q+U, U, U ] [ P, Q, Q-S, Q+U, Q+U, U, 2R ] [ P, Q, Q-S, Q+U, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q+U, U, 2R ] [ P, Q, Q-S, Q-S, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, Q+U, Q+U, Q+U, U, 2R ] [ P, P, Q+U, Q+U, Q+U, U, U ] [ P, P, P-S, Q+U, Q+U, U, 2R ] [ P, P, P-S, Q+U, Q+U, U, U ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, Q+U, Q+U, Q+U, U, 2R ] [ -P, Q, Q+U, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q+U, Q+U, U, 2R ] [ -P, Q, Q-S, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, Q+U, Q+U, Q+U, U, 2R ] [ -P, -P, Q+U, Q+U, Q+U, U, U ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : S - T >= 0 -2R + U >= 0 P >= 0 R - T >= 0 - P + Q >= 0 Q + 2R - T >= 0 - Q + S + T >= 0 1 >= 0 Vertices : [ P, Q, T, T, T, 2R, 2R ] [ P, Q, T, T, T, -Q+T, 2R ] [ P, Q, T, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, T, T, 2R, 2R ] [ P, Q, Q-S, T, T, -Q+T, 2R ] [ P, Q, Q-S, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, T, 2R, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, T, T, T, 2R, 2R ] [ P, P, T, T, T, -Q+T, 2R ] [ P, P, T, T, T, -Q+T, -Q+T ] [ P, P, P-S, T, T, 2R, 2R ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, T, T, T, 2R, 2R ] [ -P, Q, T, T, T, -Q+T, 2R ] [ -P, Q, T, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, T, T, 2R, 2R ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, T, T, T, 2R, 2R ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + S + T >= 0 R - T >= 0 P >= 0 - P + Q >= 0 Q - T + U >= 0 S - T >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, Q, T, T, T, U, 2R ] [ P, Q, T, T, T, U, U ] [ P, Q, T, T, T, -Q+T, 2R ] [ P, Q, T, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, T, T, U, 2R ] [ P, Q, Q-S, T, T, U, U ] [ P, Q, Q-S, T, T, -Q+T, 2R ] [ P, Q, Q-S, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, T, U, 2R ] [ P, Q, Q-S, Q-S, T, U, U ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, T, T, T, U, 2R ] [ P, P, T, T, T, U, U ] [ P, P, T, T, T, -Q+T, 2R ] [ P, P, T, T, T, -Q+T, -Q+T ] [ P, P, P-S, T, T, U, 2R ] [ P, P, P-S, T, T, U, U ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, T, T, T, U, 2R ] [ -P, Q, T, T, T, U, U ] [ -P, Q, T, T, T, -Q+T, 2R ] [ -P, Q, T, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, T, T, U, 2R ] [ -P, Q, Q-S, T, T, U, U ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, T, T, T, U, 2R ] [ -P, -P, T, T, T, U, U ] [ -P, -P, T, T, T, -Q+T, 2R ] [ -P, -P, T, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : -2R + U >= 0 - Q + 2S >= 0 - P + Q >= 0 P >= 0 R - S >= 0 - Q -2R + T >= 0 1 >= 0 Vertices : [ P, Q, S, S, Q+2R, 2R, 2R ] [ P, Q, S, S, S, 2R, 2R ] [ P, Q, S, S, S, -Q+S, 2R ] [ P, Q, S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, S, Q+2R, 2R, 2R ] [ P, Q, Q-S, S, S, 2R, 2R ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, S, S, Q+2R, 2R, 2R ] [ P, P, S, S, S, 2R, 2R ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, Q+2R, 2R, 2R ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, S, S, Q+2R, 2R, 2R ] [ -P, Q, S, S, S, 2R, 2R ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, Q+2R, 2R, 2R ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q - S + U >= 0 - Q + T - U >= 0 P >= 0 R - S >= 0 - P + Q >= 0 2R - U >= 0 - Q + 2S >= 0 1 >= 0 Vertices : [ P, Q, S, S, Q+U, U, 2R ] [ P, Q, S, S, Q+U, U, U ] [ P, Q, S, S, S, U, 2R ] [ P, Q, S, S, S, U, U ] [ P, Q, S, S, S, -Q+S, 2R ] [ P, Q, S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, S, Q+U, U, 2R ] [ P, Q, Q-S, S, Q+U, U, U ] [ P, Q, Q-S, S, S, U, 2R ] [ P, Q, Q-S, S, S, U, U ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, Q+U, U, 2R ] [ P, Q, Q-S, Q-S, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, S, S, Q+U, U, 2R ] [ P, P, S, S, Q+U, U, U ] [ P, P, S, S, S, U, 2R ] [ P, P, S, S, S, U, U ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, Q+U, U, 2R ] [ P, P, P-S, S, Q+U, U, U ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, S, S, Q+U, U, 2R ] [ -P, Q, S, S, Q+U, U, U ] [ -P, Q, S, S, S, U, 2R ] [ -P, Q, S, S, S, U, U ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, Q+U, U, 2R ] [ -P, Q, Q-S, S, Q+U, U, U ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, Q+U, U, 2R ] [ -P, -P, S, S, Q+U, U, U ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - S + T >= 0 -2R + U >= 0 P >= 0 R - S >= 0 - P + Q >= 0 Q + 2R - T >= 0 - Q + 2S >= 0 1 >= 0 Vertices : [ P, Q, S, S, T, 2R, 2R ] [ P, Q, S, S, T, -Q+T, 2R ] [ P, Q, S, S, T, -Q+T, -Q+T ] [ P, Q, S, S, S, 2R, 2R ] [ P, Q, S, S, S, -Q+S, 2R ] [ P, Q, S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, S, T, 2R, 2R ] [ P, Q, Q-S, S, T, -Q+T, 2R ] [ P, Q, Q-S, S, T, -Q+T, -Q+T ] [ P, Q, Q-S, S, S, 2R, 2R ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, T, 2R, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, S, S, T, 2R, 2R ] [ P, P, S, S, T, -Q+T, 2R ] [ P, P, S, S, T, -Q+T, -Q+T ] [ P, P, S, S, S, 2R, 2R ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, T, 2R, 2R ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, S, S, T, 2R, 2R ] [ -P, Q, S, S, T, -Q+T, 2R ] [ -P, Q, S, S, T, -Q+T, -Q+T ] [ -P, Q, S, S, S, 2R, 2R ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, T, 2R, 2R ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, T, 2R, 2R ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, 2R, 2R ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + 2S >= 0 R - S >= 0 P >= 0 - P + Q >= 0 Q - T + U >= 0 - S + T >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, Q, S, S, T, U, 2R ] [ P, Q, S, S, T, U, U ] [ P, Q, S, S, T, -Q+T, 2R ] [ P, Q, S, S, T, -Q+T, -Q+T ] [ P, Q, S, S, S, U, 2R ] [ P, Q, S, S, S, U, U ] [ P, Q, S, S, S, -Q+S, 2R ] [ P, Q, S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, S, T, U, 2R ] [ P, Q, Q-S, S, T, U, U ] [ P, Q, Q-S, S, T, -Q+T, 2R ] [ P, Q, Q-S, S, T, -Q+T, -Q+T ] [ P, Q, Q-S, S, S, U, 2R ] [ P, Q, Q-S, S, S, U, U ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, T, U, 2R ] [ P, Q, Q-S, Q-S, T, U, U ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, S, S, T, U, 2R ] [ P, P, S, S, T, U, U ] [ P, P, S, S, T, -Q+T, 2R ] [ P, P, S, S, T, -Q+T, -Q+T ] [ P, P, S, S, S, U, 2R ] [ P, P, S, S, S, U, U ] [ P, P, S, S, S, -Q+S, 2R ] [ P, P, S, S, S, -Q+S, -Q+S ] [ P, P, P-S, S, T, U, 2R ] [ P, P, P-S, S, T, U, U ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, S, S, T, U, 2R ] [ -P, Q, S, S, T, U, U ] [ -P, Q, S, S, T, -Q+T, 2R ] [ -P, Q, S, S, T, -Q+T, -Q+T ] [ -P, Q, S, S, S, U, 2R ] [ -P, Q, S, S, S, U, U ] [ -P, Q, S, S, S, -Q+S, 2R ] [ -P, Q, S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, S, T, U, 2R ] [ -P, Q, Q-S, S, T, U, U ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, S, S, T, U, 2R ] [ -P, -P, S, S, T, U, U ] [ -P, -P, S, S, T, -Q+T, 2R ] [ -P, -P, S, S, T, -Q+T, -Q+T ] [ -P, -P, S, S, S, U, 2R ] [ -P, -P, S, S, S, U, U ] [ -P, -P, S, S, S, -Q+S, 2R ] [ -P, -P, S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + R >= 0 -2R + U >= 0 - Q -2R + T >= 0 - P + Q >= 0 P >= 0 - Q -2R + S >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, Q+2R, Q+2R, 2R, 2R ] [ P, Q, R, R, Q+2R, 2R, 2R ] [ P, Q, R, R, R, 2R, 2R ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, Q+2R, Q+2R, 2R, 2R ] [ P, P, R, R, Q+2R, 2R, 2R ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, Q+2R, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, R, R, Q+2R, 2R, 2R ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, Q+2R, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+2R, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 P >= 0 - P + Q >= 0 - Q + S - U >= 0 Q - R + U >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, Q+U, Q+U, U, 2R ] [ P, Q, R, Q+U, Q+U, U, U ] [ P, Q, R, R, Q+U, U, 2R ] [ P, Q, R, R, Q+U, U, U ] [ P, Q, R, R, R, U, 2R ] [ P, Q, R, R, R, U, U ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, Q+U, Q+U, U, 2R ] [ P, Q, Q-S, Q+U, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q+U, U, 2R ] [ P, Q, Q-S, Q-S, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, Q+U, Q+U, U, 2R ] [ P, P, R, Q+U, Q+U, U, U ] [ P, P, R, R, Q+U, U, 2R ] [ P, P, R, R, Q+U, U, U ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, Q+U, Q+U, U, 2R ] [ P, P, P-S, Q+U, Q+U, U, U ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, Q+U, Q+U, U, 2R ] [ -P, Q, R, Q+U, Q+U, U, U ] [ -P, Q, R, R, Q+U, U, 2R ] [ -P, Q, R, R, Q+U, U, U ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, Q+U, Q+U, U, 2R ] [ -P, Q, Q-S, Q+U, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, Q+U, Q+U, U, 2R ] [ -P, -P, R, Q+U, Q+U, U, U ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, Q+U, Q+U, U, 2R ] [ -P, -P, -P-S, Q+U, Q+U, U, U ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 P >= 0 - P + Q >= 0 S - T >= 0 - R + T >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, T, T, 2R, 2R ] [ P, Q, R, T, T, -Q+T, 2R ] [ P, Q, R, T, T, -Q+T, -Q+T ] [ P, Q, R, R, T, 2R, 2R ] [ P, Q, R, R, T, -Q+T, 2R ] [ P, Q, R, R, T, -Q+T, -Q+T ] [ P, Q, R, R, R, 2R, 2R ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, T, T, 2R, 2R ] [ P, Q, Q-S, T, T, -Q+T, 2R ] [ P, Q, Q-S, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, T, 2R, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, T, T, 2R, 2R ] [ P, P, R, T, T, -Q+T, 2R ] [ P, P, R, T, T, -Q+T, -Q+T ] [ P, P, R, R, T, 2R, 2R ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, T, T, 2R, 2R ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, T, T, 2R, 2R ] [ -P, Q, R, T, T, -Q+T, 2R ] [ -P, Q, R, T, T, -Q+T, -Q+T ] [ -P, Q, R, R, T, 2R, 2R ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, T, T, 2R, 2R ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, T, T, 2R, 2R ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, 2R, 2R ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + R + S >= 0 P >= 0 - P + Q >= 0 S - T >= 0 - R + T >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, Q, R, T, T, U, 2R ] [ P, Q, R, T, T, U, U ] [ P, Q, R, T, T, -Q+T, 2R ] [ P, Q, R, T, T, -Q+T, -Q+T ] [ P, Q, R, R, T, U, 2R ] [ P, Q, R, R, T, U, U ] [ P, Q, R, R, T, -Q+T, 2R ] [ P, Q, R, R, T, -Q+T, -Q+T ] [ P, Q, R, R, R, U, 2R ] [ P, Q, R, R, R, U, U ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, T, T, U, 2R ] [ P, Q, Q-S, T, T, U, U ] [ P, Q, Q-S, T, T, -Q+T, 2R ] [ P, Q, Q-S, T, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, T, U, 2R ] [ P, Q, Q-S, Q-S, T, U, U ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, T, T, U, 2R ] [ P, P, R, T, T, U, U ] [ P, P, R, T, T, -Q+T, 2R ] [ P, P, R, T, T, -Q+T, -Q+T ] [ P, P, R, R, T, U, 2R ] [ P, P, R, R, T, U, U ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, T, T, U, 2R ] [ P, P, P-S, T, T, U, U ] [ P, P, P-S, T, T, -Q+T, 2R ] [ P, P, P-S, T, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, T, T, U, 2R ] [ -P, Q, R, T, T, U, U ] [ -P, Q, R, T, T, -Q+T, 2R ] [ -P, Q, R, T, T, -Q+T, -Q+T ] [ -P, Q, R, R, T, U, 2R ] [ -P, Q, R, R, T, U, U ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, T, T, U, 2R ] [ -P, Q, Q-S, T, T, U, U ] [ -P, Q, Q-S, T, T, -Q+T, 2R ] [ -P, Q, Q-S, T, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, T, T, U, 2R ] [ -P, -P, R, T, T, U, U ] [ -P, -P, R, T, T, -Q+T, 2R ] [ -P, -P, R, T, T, -Q+T, -Q+T ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, T, T, U, 2R ] [ -P, -P, -P-S, T, T, U, U ] [ -P, -P, -P-S, T, T, -Q+T, 2R ] [ -P, -P, -P-S, T, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - R + S >= 0 -2R + U >= 0 - Q -2R + T >= 0 - P + Q >= 0 P >= 0 Q + 2R - S >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, S, Q+2R, 2R, 2R ] [ P, Q, R, S, S, 2R, 2R ] [ P, Q, R, S, S, -Q+S, 2R ] [ P, Q, R, S, S, -Q+S, -Q+S ] [ P, Q, R, R, Q+2R, 2R, 2R ] [ P, Q, R, R, R, 2R, 2R ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, S, Q+2R, 2R, 2R ] [ P, Q, Q-S, S, S, 2R, 2R ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, S, Q+2R, 2R, 2R ] [ P, P, R, S, S, 2R, 2R ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, Q+2R, 2R, 2R ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, Q+2R, 2R, 2R ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+2R, 2R, 2R ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, S, Q+2R, 2R, 2R ] [ -P, Q, R, S, S, 2R, 2R ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, Q+2R, 2R, 2R ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+2R, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, Q+2R, 2R, 2R ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+2R, 2R, 2R ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+2R, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : 2R - U >= 0 - Q + T - U >= 0 P >= 0 - P + Q >= 0 Q - S + U >= 0 - R + S >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, S, Q+U, U, 2R ] [ P, Q, R, S, Q+U, U, U ] [ P, Q, R, S, S, U, 2R ] [ P, Q, R, S, S, U, U ] [ P, Q, R, S, S, -Q+S, 2R ] [ P, Q, R, S, S, -Q+S, -Q+S ] [ P, Q, R, R, Q+U, U, 2R ] [ P, Q, R, R, Q+U, U, U ] [ P, Q, R, R, R, U, 2R ] [ P, Q, R, R, R, U, U ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, S, Q+U, U, 2R ] [ P, Q, Q-S, S, Q+U, U, U ] [ P, Q, Q-S, S, S, U, 2R ] [ P, Q, Q-S, S, S, U, U ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, Q+U, U, 2R ] [ P, Q, Q-S, Q-S, Q+U, U, U ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, S, Q+U, U, 2R ] [ P, P, R, S, Q+U, U, U ] [ P, P, R, S, S, U, 2R ] [ P, P, R, S, S, U, U ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, Q+U, U, 2R ] [ P, P, R, R, Q+U, U, U ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, Q+U, U, 2R ] [ P, P, P-S, S, Q+U, U, U ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, Q+U, U, 2R ] [ P, P, P-S, P-S, Q+U, U, U ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, S, Q+U, U, 2R ] [ -P, Q, R, S, Q+U, U, U ] [ -P, Q, R, S, S, U, 2R ] [ -P, Q, R, S, S, U, U ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, Q+U, U, 2R ] [ -P, Q, R, R, Q+U, U, U ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, Q+U, U, 2R ] [ -P, Q, Q-S, S, Q+U, U, U ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, Q+U, U, 2R ] [ -P, Q, Q-S, Q-S, Q+U, U, U ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, Q+U, U, 2R ] [ -P, -P, R, S, Q+U, U, U ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, Q+U, U, 2R ] [ -P, -P, R, R, Q+U, U, U ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, Q+U, U, 2R ] [ -P, -P, -P-S, S, Q+U, U, U ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, Q+U, U, 2R ] [ -P, -P, -P-S, -P-S, Q+U, U, U ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : Q + 2R - T >= 0 -2R + U >= 0 P >= 0 - P + Q >= 0 - S + T >= 0 - R + S >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ P, Q, R, S, T, 2R, 2R ] [ P, Q, R, S, T, -Q+T, 2R ] [ P, Q, R, S, T, -Q+T, -Q+T ] [ P, Q, R, S, S, 2R, 2R ] [ P, Q, R, S, S, -Q+S, 2R ] [ P, Q, R, S, S, -Q+S, -Q+S ] [ P, Q, R, R, T, 2R, 2R ] [ P, Q, R, R, T, -Q+T, 2R ] [ P, Q, R, R, T, -Q+T, -Q+T ] [ P, Q, R, R, R, 2R, 2R ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, S, T, 2R, 2R ] [ P, Q, Q-S, S, T, -Q+T, 2R ] [ P, Q, Q-S, S, T, -Q+T, -Q+T ] [ P, Q, Q-S, S, S, 2R, 2R ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, T, 2R, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, S, T, 2R, 2R ] [ P, P, R, S, T, -Q+T, 2R ] [ P, P, R, S, T, -Q+T, -Q+T ] [ P, P, R, S, S, 2R, 2R ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, T, 2R, 2R ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, 2R, 2R ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, T, 2R, 2R ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, 2R, 2R ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, 2R, 2R ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, 2R, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, S, T, 2R, 2R ] [ -P, Q, R, S, T, -Q+T, 2R ] [ -P, Q, R, S, T, -Q+T, -Q+T ] [ -P, Q, R, S, S, 2R, 2R ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, T, 2R, 2R ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, 2R, 2R ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, T, 2R, 2R ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, 2R, 2R ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, 2R, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, 2R, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, T, 2R, 2R ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, 2R, 2R ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, 2R, 2R ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, 2R, 2R ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, 2R, 2R ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, 2R, 2R ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, 2R, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, 2R, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] --------------------------------------- Domain : - Q + R + S >= 0 P >= 0 - P + Q >= 0 - S + T >= 0 - R + S >= 0 Q - T + U >= 0 2R - U >= 0 1 >= 0 Vertices : [ P, Q, R, S, T, U, 2R ] [ P, Q, R, S, T, U, U ] [ P, Q, R, S, T, -Q+T, 2R ] [ P, Q, R, S, T, -Q+T, -Q+T ] [ P, Q, R, S, S, U, 2R ] [ P, Q, R, S, S, U, U ] [ P, Q, R, S, S, -Q+S, 2R ] [ P, Q, R, S, S, -Q+S, -Q+S ] [ P, Q, R, R, T, U, 2R ] [ P, Q, R, R, T, U, U ] [ P, Q, R, R, T, -Q+T, 2R ] [ P, Q, R, R, T, -Q+T, -Q+T ] [ P, Q, R, R, R, U, 2R ] [ P, Q, R, R, R, U, U ] [ P, Q, R, R, R, -Q+R, 2R ] [ P, Q, R, R, R, -Q+R, -Q+R ] [ P, Q, Q-S, S, T, U, 2R ] [ P, Q, Q-S, S, T, U, U ] [ P, Q, Q-S, S, T, -Q+T, 2R ] [ P, Q, Q-S, S, T, -Q+T, -Q+T ] [ P, Q, Q-S, S, S, U, 2R ] [ P, Q, Q-S, S, S, U, U ] [ P, Q, Q-S, S, S, -Q+S, 2R ] [ P, Q, Q-S, S, S, -Q+S, -Q+S ] [ P, Q, Q-S, Q-S, T, U, 2R ] [ P, Q, Q-S, Q-S, T, U, U ] [ P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, U, 2R ] [ P, Q, Q-S, Q-S, Q-S, U, U ] [ P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ P, Q, Q-S, Q-S, Q-S, -S, -S ] [ P, P, R, S, T, U, 2R ] [ P, P, R, S, T, U, U ] [ P, P, R, S, T, -Q+T, 2R ] [ P, P, R, S, T, -Q+T, -Q+T ] [ P, P, R, S, S, U, 2R ] [ P, P, R, S, S, U, U ] [ P, P, R, S, S, -Q+S, 2R ] [ P, P, R, S, S, -Q+S, -Q+S ] [ P, P, R, R, T, U, 2R ] [ P, P, R, R, T, U, U ] [ P, P, R, R, T, -Q+T, 2R ] [ P, P, R, R, T, -Q+T, -Q+T ] [ P, P, R, R, R, U, 2R ] [ P, P, R, R, R, U, U ] [ P, P, R, R, R, -Q+R, 2R ] [ P, P, R, R, R, -Q+R, -Q+R ] [ P, P, P-S, S, T, U, 2R ] [ P, P, P-S, S, T, U, U ] [ P, P, P-S, S, T, -Q+T, 2R ] [ P, P, P-S, S, T, -Q+T, -Q+T ] [ P, P, P-S, S, S, U, 2R ] [ P, P, P-S, S, S, U, U ] [ P, P, P-S, S, S, -Q+S, 2R ] [ P, P, P-S, S, S, -Q+S, -Q+S ] [ P, P, P-S, P-S, T, U, 2R ] [ P, P, P-S, P-S, T, U, U ] [ P, P, P-S, P-S, T, -Q+T, 2R ] [ P, P, P-S, P-S, T, -Q+T, -Q+T ] [ P, P, P-S, P-S, P-S, U, 2R ] [ P, P, P-S, P-S, P-S, U, U ] [ P, P, P-S, P-S, P-S, P-Q-S, 2R ] [ P, P, P-S, P-S, P-S, P-Q-S, P-Q-S ] [ -P, Q, R, S, T, U, 2R ] [ -P, Q, R, S, T, U, U ] [ -P, Q, R, S, T, -Q+T, 2R ] [ -P, Q, R, S, T, -Q+T, -Q+T ] [ -P, Q, R, S, S, U, 2R ] [ -P, Q, R, S, S, U, U ] [ -P, Q, R, S, S, -Q+S, 2R ] [ -P, Q, R, S, S, -Q+S, -Q+S ] [ -P, Q, R, R, T, U, 2R ] [ -P, Q, R, R, T, U, U ] [ -P, Q, R, R, T, -Q+T, 2R ] [ -P, Q, R, R, T, -Q+T, -Q+T ] [ -P, Q, R, R, R, U, 2R ] [ -P, Q, R, R, R, U, U ] [ -P, Q, R, R, R, -Q+R, 2R ] [ -P, Q, R, R, R, -Q+R, -Q+R ] [ -P, Q, Q-S, S, T, U, 2R ] [ -P, Q, Q-S, S, T, U, U ] [ -P, Q, Q-S, S, T, -Q+T, 2R ] [ -P, Q, Q-S, S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, S, S, U, 2R ] [ -P, Q, Q-S, S, S, U, U ] [ -P, Q, Q-S, S, S, -Q+S, 2R ] [ -P, Q, Q-S, S, S, -Q+S, -Q+S ] [ -P, Q, Q-S, Q-S, T, U, 2R ] [ -P, Q, Q-S, Q-S, T, U, U ] [ -P, Q, Q-S, Q-S, T, -Q+T, 2R ] [ -P, Q, Q-S, Q-S, T, -Q+T, -Q+T ] [ -P, Q, Q-S, Q-S, Q-S, U, 2R ] [ -P, Q, Q-S, Q-S, Q-S, U, U ] [ -P, Q, Q-S, Q-S, Q-S, -S, 2R ] [ -P, Q, Q-S, Q-S, Q-S, -S, -S ] [ -P, -P, R, S, T, U, 2R ] [ -P, -P, R, S, T, U, U ] [ -P, -P, R, S, T, -Q+T, 2R ] [ -P, -P, R, S, T, -Q+T, -Q+T ] [ -P, -P, R, S, S, U, 2R ] [ -P, -P, R, S, S, U, U ] [ -P, -P, R, S, S, -Q+S, 2R ] [ -P, -P, R, S, S, -Q+S, -Q+S ] [ -P, -P, R, R, T, U, 2R ] [ -P, -P, R, R, T, U, U ] [ -P, -P, R, R, T, -Q+T, 2R ] [ -P, -P, R, R, T, -Q+T, -Q+T ] [ -P, -P, R, R, R, U, 2R ] [ -P, -P, R, R, R, U, U ] [ -P, -P, R, R, R, -Q+R, 2R ] [ -P, -P, R, R, R, -Q+R, -Q+R ] [ -P, -P, -P-S, S, T, U, 2R ] [ -P, -P, -P-S, S, T, U, U ] [ -P, -P, -P-S, S, T, -Q+T, 2R ] [ -P, -P, -P-S, S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, S, S, U, 2R ] [ -P, -P, -P-S, S, S, U, U ] [ -P, -P, -P-S, S, S, -Q+S, 2R ] [ -P, -P, -P-S, S, S, -Q+S, -Q+S ] [ -P, -P, -P-S, -P-S, T, U, 2R ] [ -P, -P, -P-S, -P-S, T, U, U ] [ -P, -P, -P-S, -P-S, T, -Q+T, 2R ] [ -P, -P, -P-S, -P-S, T, -Q+T, -Q+T ] [ -P, -P, -P-S, -P-S, -P-S, U, 2R ] [ -P, -P, -P-S, -P-S, -P-S, U, U ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, 2R ] [ -P, -P, -P-S, -P-S, -P-S, -P-Q-S, -P-Q-S ] polylib-5.22.5.orig/Test/pp/salvatore.out0000644000175000017500000000024511035141340021160 0ustar sylvestresylvestre--------------------------------------- Overall rays : Line: [ 1 0 ] --------------------------------------- Domain : 1 >= 0 Vertices : [ 0, a ] polylib-5.22.5.orig/Test/pp/salvatore_new1.in0000644000175000017500000000015311035141340021707 0ustar sylvestresylvestre3 4 # x a cte 1 1 -1 0 # x >= a 1 -1 1 1 # x <= a+1 1 1 0 0 # x >= 0 0 3 a polylib-5.22.5.orig/Test/pp/Makefile.in0000644000175000017500000002476611341231332020513 0ustar sylvestresylvestre# Makefile.in generated by automake 1.11.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, # Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = Test/pp DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ ALL_BITS = @ALL_BITS@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DOXYGEN = @DOXYGEN@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ multi_bin_programs = @multi_bin_programs@ multi_noinst_programs = @multi_noinst_programs@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ polylib = @polylib@ polylib128_defs = @polylib128_defs@ polylib32_defs = @polylib32_defs@ polylib64_defs = @polylib64_defs@ polylibs = @polylibs@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ OBJ_DIR = $(top_builddir) PP = \ c6.in \ c7.in \ salvatore.in \ salvatore_new1.in \ salvatore_new2.in \ xavi.in \ ray1.in \ ray2.in \ ray3.in # c5.in \ # c4.in \ # c9.in # c10.in EXTRA_DIST = $(PP) \ $(PP:%.in=%.out) CLEANFILES = xyz all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Test/pp/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Test/pp/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am tests: @failedtest=0; \ for x in $(PP) ; do \ echo "Verify file $$x"; \ $(OBJ_DIR)/pp$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test pp works correctly"; \ fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: polylib-5.22.5.orig/Test/pp/salvatore_new2.in0000644000175000017500000000017311035141340021712 0ustar sylvestresylvestre3 5 # x y a cte 1 1 0 -1 0 # x >= a 1 -1 0 1 1 # x <= a+1 1 1 0 0 0 # x >= 0 0 3 a polylib-5.22.5.orig/Test/pp/c6.out0000644000175000017500000007573111035141340017504 0ustar sylvestresylvestre--------------------------------------- Domain : P - S - T >= 0 T >= 0 S - T >= 0 R - T >= 0 Q - S - T >= 0 1 >= 0 Vertices : [ S+T, S+T, T, T, T, 0 ] [ S+T, S+T, T, T, T, -Q+T ] [ 0, S+T, T, T, T, 0 ] [ 0, S+T, T, T, T, -Q+T ] [ 0, 0, T, T, T, 0 ] [ 0, 0, T, T, T, -Q+T ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P -2S >= 0 - Q + T >= 0 Q -2S >= 0 S >= 0 R - S >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, Q, 0 ] [ 2S, 2S, S, S, S, 0 ] [ 2S, 2S, S, S, S, -Q+S ] [ 0, 2S, S, S, Q, 0 ] [ 0, 2S, S, S, S, 0 ] [ 0, 2S, S, S, S, -Q+S ] [ 0, 0, S, S, Q, 0 ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - S + T >= 0 P -2S >= 0 R - S >= 0 S >= 0 Q - T >= 0 Q -2S >= 0 1 >= 0 Vertices : [ 2S, 2S, S, S, T, 0 ] [ 2S, 2S, S, S, T, -Q+T ] [ 2S, 2S, S, S, S, 0 ] [ 2S, 2S, S, S, S, -Q+S ] [ 0, 2S, S, S, T, 0 ] [ 0, 2S, S, S, T, -Q+T ] [ 0, 2S, S, S, S, 0 ] [ 0, 2S, S, S, S, -Q+S ] [ 0, 0, S, S, T, 0 ] [ 0, 0, S, S, T, -Q+T ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - R - S >= 0 R >= 0 - R + T >= 0 S - T >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, T, T, 0 ] [ R+S, R+S, R, T, T, -Q+T ] [ R+S, R+S, R, R, T, 0 ] [ R+S, R+S, R, R, T, -Q+T ] [ R+S, R+S, R, R, R, 0 ] [ R+S, R+S, R, R, R, -Q+R ] [ 0, R+S, R, T, T, 0 ] [ 0, R+S, R, T, T, -Q+T ] [ 0, R+S, R, R, T, 0 ] [ 0, R+S, R, R, T, -Q+T ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, T, T, 0 ] [ 0, 0, R, T, T, -Q+T ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - R - S >= 0 - R + S >= 0 - Q + T >= 0 Q - R - S >= 0 R >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, Q, 0 ] [ R+S, R+S, R, S, S, 0 ] [ R+S, R+S, R, S, S, -Q+S ] [ R+S, R+S, R, R, Q, 0 ] [ R+S, R+S, R, R, R, 0 ] [ R+S, R+S, R, R, R, -Q+R ] [ 0, R+S, R, S, Q, 0 ] [ 0, R+S, R, S, S, 0 ] [ 0, R+S, R, S, S, -Q+S ] [ 0, R+S, R, R, Q, 0 ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, S, Q, 0 ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - S + T >= 0 - R + S >= 0 P - R - S >= 0 R >= 0 Q - T >= 0 Q - R - S >= 0 1 >= 0 Vertices : [ R+S, R+S, R, S, T, 0 ] [ R+S, R+S, R, S, T, -Q+T ] [ R+S, R+S, R, S, S, 0 ] [ R+S, R+S, R, S, S, -Q+S ] [ R+S, R+S, R, R, T, 0 ] [ R+S, R+S, R, R, T, -Q+T ] [ R+S, R+S, R, R, R, 0 ] [ R+S, R+S, R, R, R, -Q+R ] [ 0, R+S, R, S, T, 0 ] [ 0, R+S, R, S, T, -Q+T ] [ 0, R+S, R, S, S, 0 ] [ 0, R+S, R, S, S, -Q+S ] [ 0, R+S, R, R, T, 0 ] [ 0, R+S, R, R, T, -Q+T ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, S, T, 0 ] [ 0, 0, R, S, T, -Q+T ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 - Q + T >= 0 Q >= 0 - Q + S >= 0 - Q + R >= 0 1 >= 0 Vertices : [ Q, Q, Q, Q, Q, 0 ] [ Q, Q, Q-S, Q, Q, 0 ] [ Q, Q, Q-S, Q-S, Q, 0 ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, Q, Q, Q, 0 ] [ 0, Q, Q-S, Q, Q, 0 ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, Q, Q, Q, 0 ] [ 0, 0, -S, Q, Q, 0 ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - Q + S + T >= 0 P - Q >= 0 R - T >= 0 T >= 0 Q - T >= 0 S - T >= 0 1 >= 0 Vertices : [ Q, Q, T, T, T, 0 ] [ Q, Q, T, T, T, -Q+T ] [ Q, Q, Q-S, T, T, 0 ] [ Q, Q, Q-S, T, T, -Q+T ] [ Q, Q, Q-S, Q-S, T, 0 ] [ Q, Q, Q-S, Q-S, T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, T, T, T, 0 ] [ 0, Q, T, T, T, -Q+T ] [ 0, Q, Q-S, T, T, 0 ] [ 0, Q, Q-S, T, T, -Q+T ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, T, T, T, 0 ] [ 0, 0, T, T, T, -Q+T ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 - Q + T >= 0 - Q + 2S >= 0 Q - S >= 0 R - S >= 0 1 >= 0 Vertices : [ Q, Q, S, S, Q, 0 ] [ Q, Q, S, S, S, 0 ] [ Q, Q, S, S, S, -Q+S ] [ Q, Q, Q-S, S, Q, 0 ] [ Q, Q, Q-S, S, S, 0 ] [ Q, Q, Q-S, S, S, -Q+S ] [ Q, Q, Q-S, Q-S, Q, 0 ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, S, S, Q, 0 ] [ 0, Q, S, S, S, 0 ] [ 0, Q, S, S, S, -Q+S ] [ 0, Q, Q-S, S, Q, 0 ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, S, S, Q, 0 ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 Q - T >= 0 - Q + 2S >= 0 - S + T >= 0 R - S >= 0 1 >= 0 Vertices : [ Q, Q, S, S, T, 0 ] [ Q, Q, S, S, T, -Q+T ] [ Q, Q, S, S, S, 0 ] [ Q, Q, S, S, S, -Q+S ] [ Q, Q, Q-S, S, T, 0 ] [ Q, Q, Q-S, S, T, -Q+T ] [ Q, Q, Q-S, S, S, 0 ] [ Q, Q, Q-S, S, S, -Q+S ] [ Q, Q, Q-S, Q-S, T, 0 ] [ Q, Q, Q-S, Q-S, T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, S, S, T, 0 ] [ 0, Q, S, S, T, -Q+T ] [ 0, Q, S, S, S, 0 ] [ 0, Q, S, S, S, -Q+S ] [ 0, Q, Q-S, S, T, 0 ] [ 0, Q, Q-S, S, T, -Q+T ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, S, S, T, 0 ] [ 0, 0, S, S, T, -Q+T ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 Q - R >= 0 - Q + T >= 0 R >= 0 - Q + S >= 0 1 >= 0 Vertices : [ Q, Q, R, Q, Q, 0 ] [ Q, Q, R, R, Q, 0 ] [ Q, Q, R, R, R, 0 ] [ Q, Q, R, R, R, -Q+R ] [ Q, Q, Q-S, Q, Q, 0 ] [ Q, Q, Q-S, Q-S, Q, 0 ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, R, Q, Q, 0 ] [ 0, Q, R, R, Q, 0 ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, Q, Q, 0 ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, Q, Q, 0 ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, Q, Q, 0 ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : S - T >= 0 - R + T >= 0 P - Q >= 0 Q - T >= 0 R >= 0 - Q + R + S >= 0 1 >= 0 Vertices : [ Q, Q, R, T, T, 0 ] [ Q, Q, R, T, T, -Q+T ] [ Q, Q, R, R, T, 0 ] [ Q, Q, R, R, T, -Q+T ] [ Q, Q, R, R, R, 0 ] [ Q, Q, R, R, R, -Q+R ] [ Q, Q, Q-S, T, T, 0 ] [ Q, Q, Q-S, T, T, -Q+T ] [ Q, Q, Q-S, Q-S, T, 0 ] [ Q, Q, Q-S, Q-S, T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, R, T, T, 0 ] [ 0, Q, R, T, T, -Q+T ] [ 0, Q, R, R, T, 0 ] [ 0, Q, R, R, T, -Q+T ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, T, T, 0 ] [ 0, Q, Q-S, T, T, -Q+T ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, T, T, 0 ] [ 0, 0, R, T, T, -Q+T ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 - R + S >= 0 - Q + T >= 0 - Q + R + S >= 0 Q - S >= 0 1 >= 0 Vertices : [ Q, Q, R, S, Q, 0 ] [ Q, Q, R, S, S, 0 ] [ Q, Q, R, S, S, -Q+S ] [ Q, Q, R, R, Q, 0 ] [ Q, Q, R, R, R, 0 ] [ Q, Q, R, R, R, -Q+R ] [ Q, Q, Q-S, S, Q, 0 ] [ Q, Q, Q-S, S, S, 0 ] [ Q, Q, Q-S, S, S, -Q+S ] [ Q, Q, Q-S, Q-S, Q, 0 ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, R, S, Q, 0 ] [ 0, Q, R, S, S, 0 ] [ 0, Q, R, S, S, -Q+S ] [ 0, Q, R, R, Q, 0 ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, S, Q, 0 ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, S, Q, 0 ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P - Q >= 0 Q - T >= 0 - R + S >= 0 - Q + R + S >= 0 - S + T >= 0 1 >= 0 Vertices : [ Q, Q, R, S, T, 0 ] [ Q, Q, R, S, T, -Q+T ] [ Q, Q, R, S, S, 0 ] [ Q, Q, R, S, S, -Q+S ] [ Q, Q, R, R, T, 0 ] [ Q, Q, R, R, T, -Q+T ] [ Q, Q, R, R, R, 0 ] [ Q, Q, R, R, R, -Q+R ] [ Q, Q, Q-S, S, T, 0 ] [ Q, Q, Q-S, S, T, -Q+T ] [ Q, Q, Q-S, S, S, 0 ] [ Q, Q, Q-S, S, S, -Q+S ] [ Q, Q, Q-S, Q-S, T, 0 ] [ Q, Q, Q-S, Q-S, T, -Q+T ] [ Q, Q, Q-S, Q-S, Q-S, 0 ] [ Q, Q, Q-S, Q-S, Q-S, -S ] [ 0, Q, R, S, T, 0 ] [ 0, Q, R, S, T, -Q+T ] [ 0, Q, R, S, S, 0 ] [ 0, Q, R, S, S, -Q+S ] [ 0, Q, R, R, T, 0 ] [ 0, Q, R, R, T, -Q+T ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, S, T, 0 ] [ 0, Q, Q-S, S, T, -Q+T ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, S, T, 0 ] [ 0, 0, R, S, T, -Q+T ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - P + S + T >= 0 Q - S - T >= 0 R - T >= 0 T >= 0 P >= 0 S - T >= 0 1 >= 0 Vertices : [ P, S+T, T, T, T, 0 ] [ P, S+T, T, T, T, -Q+T ] [ P, P, T, T, T, 0 ] [ P, P, T, T, T, -Q+T ] [ P, P, P-S, T, T, 0 ] [ P, P, P-S, T, T, -Q+T ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, S+T, T, T, T, 0 ] [ 0, S+T, T, T, T, -Q+T ] [ 0, 0, T, T, T, 0 ] [ 0, 0, T, T, T, -Q+T ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : R - S >= 0 - Q + T >= 0 - P + 2S >= 0 Q -2S >= 0 P >= 0 1 >= 0 Vertices : [ P, 2S, S, S, Q, 0 ] [ P, 2S, S, S, S, 0 ] [ P, 2S, S, S, S, -Q+S ] [ P, P, S, S, Q, 0 ] [ P, P, S, S, S, 0 ] [ P, P, S, S, S, -Q+S ] [ P, P, P-S, S, Q, 0 ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, 2S, S, S, Q, 0 ] [ 0, 2S, S, S, S, 0 ] [ 0, 2S, S, S, S, -Q+S ] [ 0, 0, S, S, Q, 0 ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - S + T >= 0 R - S >= 0 - P + 2S >= 0 Q -2S >= 0 Q - T >= 0 P >= 0 1 >= 0 Vertices : [ P, 2S, S, S, T, 0 ] [ P, 2S, S, S, T, -Q+T ] [ P, 2S, S, S, S, 0 ] [ P, 2S, S, S, S, -Q+S ] [ P, P, S, S, T, 0 ] [ P, P, S, S, T, -Q+T ] [ P, P, S, S, S, 0 ] [ P, P, S, S, S, -Q+S ] [ P, P, P-S, S, T, 0 ] [ P, P, P-S, S, T, -Q+T ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, 2S, S, S, T, 0 ] [ 0, 2S, S, S, T, -Q+T ] [ 0, 2S, S, S, S, 0 ] [ 0, 2S, S, S, S, -Q+S ] [ 0, 0, S, S, T, 0 ] [ 0, 0, S, S, T, -Q+T ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - P + R + S >= 0 Q - R - S >= 0 - R + T >= 0 S - T >= 0 P >= 0 R >= 0 1 >= 0 Vertices : [ P, R+S, R, T, T, 0 ] [ P, R+S, R, T, T, -Q+T ] [ P, R+S, R, R, T, 0 ] [ P, R+S, R, R, T, -Q+T ] [ P, R+S, R, R, R, 0 ] [ P, R+S, R, R, R, -Q+R ] [ P, P, R, T, T, 0 ] [ P, P, R, T, T, -Q+T ] [ P, P, R, R, T, 0 ] [ P, P, R, R, T, -Q+T ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, T, T, 0 ] [ P, P, P-S, T, T, -Q+T ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, R+S, R, T, T, 0 ] [ 0, R+S, R, T, T, -Q+T ] [ 0, R+S, R, R, T, 0 ] [ 0, R+S, R, R, T, -Q+T ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, T, T, 0 ] [ 0, 0, R, T, T, -Q+T ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : R >= 0 - Q + T >= 0 Q - R - S >= 0 - P + R + S >= 0 - R + S >= 0 P >= 0 1 >= 0 Vertices : [ P, R+S, R, S, Q, 0 ] [ P, R+S, R, S, S, 0 ] [ P, R+S, R, S, S, -Q+S ] [ P, R+S, R, R, Q, 0 ] [ P, R+S, R, R, R, 0 ] [ P, R+S, R, R, R, -Q+R ] [ P, P, R, S, Q, 0 ] [ P, P, R, S, S, 0 ] [ P, P, R, S, S, -Q+S ] [ P, P, R, R, Q, 0 ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, S, Q, 0 ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, R+S, R, S, Q, 0 ] [ 0, R+S, R, S, S, 0 ] [ 0, R+S, R, S, S, -Q+S ] [ 0, R+S, R, R, Q, 0 ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, S, Q, 0 ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P >= 0 Q - R - S >= 0 - R + S >= 0 - P + R + S >= 0 - S + T >= 0 R >= 0 Q - T >= 0 1 >= 0 Vertices : [ P, R+S, R, S, T, 0 ] [ P, R+S, R, S, T, -Q+T ] [ P, R+S, R, S, S, 0 ] [ P, R+S, R, S, S, -Q+S ] [ P, R+S, R, R, T, 0 ] [ P, R+S, R, R, T, -Q+T ] [ P, R+S, R, R, R, 0 ] [ P, R+S, R, R, R, -Q+R ] [ P, P, R, S, T, 0 ] [ P, P, R, S, T, -Q+T ] [ P, P, R, S, S, 0 ] [ P, P, R, S, S, -Q+S ] [ P, P, R, R, T, 0 ] [ P, P, R, R, T, -Q+T ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, S, T, 0 ] [ P, P, P-S, S, T, -Q+T ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, R+S, R, S, T, 0 ] [ 0, R+S, R, S, T, -Q+T ] [ 0, R+S, R, S, S, 0 ] [ 0, R+S, R, S, S, -Q+S ] [ 0, R+S, R, R, T, 0 ] [ 0, R+S, R, R, T, -Q+T ] [ 0, R+S, R, R, R, 0 ] [ 0, R+S, R, R, R, -Q+R ] [ 0, 0, R, S, T, 0 ] [ 0, 0, R, S, T, -Q+T ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - Q + R >= 0 - Q + T >= 0 P >= 0 - P + Q >= 0 - Q + S >= 0 1 >= 0 Vertices : [ P, Q, Q, Q, Q, 0 ] [ P, Q, Q-S, Q, Q, 0 ] [ P, Q, Q-S, Q-S, Q, 0 ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, Q, Q, Q, 0 ] [ P, P, P-S, Q, Q, 0 ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, Q, Q, Q, 0 ] [ 0, Q, Q-S, Q, Q, 0 ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, Q, Q, Q, 0 ] [ 0, 0, -S, Q, Q, 0 ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : T >= 0 R - T >= 0 - Q + S + T >= 0 - P + Q >= 0 S - T >= 0 P >= 0 Q - T >= 0 1 >= 0 Vertices : [ P, Q, T, T, T, 0 ] [ P, Q, T, T, T, -Q+T ] [ P, Q, Q-S, T, T, 0 ] [ P, Q, Q-S, T, T, -Q+T ] [ P, Q, Q-S, Q-S, T, 0 ] [ P, Q, Q-S, Q-S, T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, T, T, T, 0 ] [ P, P, T, T, T, -Q+T ] [ P, P, P-S, T, T, 0 ] [ P, P, P-S, T, T, -Q+T ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, T, T, T, 0 ] [ 0, Q, T, T, T, -Q+T ] [ 0, Q, Q-S, T, T, 0 ] [ 0, Q, Q-S, T, T, -Q+T ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, T, T, T, 0 ] [ 0, 0, T, T, T, -Q+T ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - P + Q >= 0 - Q + T >= 0 R - S >= 0 - Q + 2S >= 0 P >= 0 Q - S >= 0 1 >= 0 Vertices : [ P, Q, S, S, Q, 0 ] [ P, Q, S, S, S, 0 ] [ P, Q, S, S, S, -Q+S ] [ P, Q, Q-S, S, Q, 0 ] [ P, Q, Q-S, S, S, 0 ] [ P, Q, Q-S, S, S, -Q+S ] [ P, Q, Q-S, Q-S, Q, 0 ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, S, S, Q, 0 ] [ P, P, S, S, S, 0 ] [ P, P, S, S, S, -Q+S ] [ P, P, P-S, S, Q, 0 ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, S, S, Q, 0 ] [ 0, Q, S, S, S, 0 ] [ 0, Q, S, S, S, -Q+S ] [ 0, Q, Q-S, S, Q, 0 ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, S, S, Q, 0 ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - P + Q >= 0 R - S >= 0 - Q + 2S >= 0 - S + T >= 0 P >= 0 Q - T >= 0 1 >= 0 Vertices : [ P, Q, S, S, T, 0 ] [ P, Q, S, S, T, -Q+T ] [ P, Q, S, S, S, 0 ] [ P, Q, S, S, S, -Q+S ] [ P, Q, Q-S, S, T, 0 ] [ P, Q, Q-S, S, T, -Q+T ] [ P, Q, Q-S, S, S, 0 ] [ P, Q, Q-S, S, S, -Q+S ] [ P, Q, Q-S, Q-S, T, 0 ] [ P, Q, Q-S, Q-S, T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, S, S, T, 0 ] [ P, P, S, S, T, -Q+T ] [ P, P, S, S, S, 0 ] [ P, P, S, S, S, -Q+S ] [ P, P, P-S, S, T, 0 ] [ P, P, P-S, S, T, -Q+T ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, S, S, T, 0 ] [ 0, Q, S, S, T, -Q+T ] [ 0, Q, S, S, S, 0 ] [ 0, Q, S, S, S, -Q+S ] [ 0, Q, Q-S, S, T, 0 ] [ 0, Q, Q-S, S, T, -Q+T ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, S, S, T, 0 ] [ 0, 0, S, S, T, -Q+T ] [ 0, 0, S, S, S, 0 ] [ 0, 0, S, S, S, -Q+S ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P >= 0 - Q + T >= 0 - Q + S >= 0 Q - R >= 0 - P + Q >= 0 R >= 0 1 >= 0 Vertices : [ P, Q, R, Q, Q, 0 ] [ P, Q, R, R, Q, 0 ] [ P, Q, R, R, R, 0 ] [ P, Q, R, R, R, -Q+R ] [ P, Q, Q-S, Q, Q, 0 ] [ P, Q, Q-S, Q-S, Q, 0 ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, R, Q, Q, 0 ] [ P, P, R, R, Q, 0 ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, Q, Q, 0 ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, R, Q, Q, 0 ] [ 0, Q, R, R, Q, 0 ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, Q, Q, 0 ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, Q, Q, 0 ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, Q, Q, 0 ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : R >= 0 - Q + R + S >= 0 S - T >= 0 - P + Q >= 0 - R + T >= 0 P >= 0 Q - T >= 0 1 >= 0 Vertices : [ P, Q, R, T, T, 0 ] [ P, Q, R, T, T, -Q+T ] [ P, Q, R, R, T, 0 ] [ P, Q, R, R, T, -Q+T ] [ P, Q, R, R, R, 0 ] [ P, Q, R, R, R, -Q+R ] [ P, Q, Q-S, T, T, 0 ] [ P, Q, Q-S, T, T, -Q+T ] [ P, Q, Q-S, Q-S, T, 0 ] [ P, Q, Q-S, Q-S, T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, R, T, T, 0 ] [ P, P, R, T, T, -Q+T ] [ P, P, R, R, T, 0 ] [ P, P, R, R, T, -Q+T ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, T, T, 0 ] [ P, P, P-S, T, T, -Q+T ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, R, T, T, 0 ] [ 0, Q, R, T, T, -Q+T ] [ 0, Q, R, R, T, 0 ] [ 0, Q, R, R, T, -Q+T ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, T, T, 0 ] [ 0, Q, Q-S, T, T, -Q+T ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, T, T, 0 ] [ 0, 0, R, T, T, -Q+T ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, T, T, 0 ] [ 0, 0, -S, T, T, -Q+T ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : P >= 0 - Q + T >= 0 Q - S >= 0 - Q + R + S >= 0 - R + S >= 0 - P + Q >= 0 1 >= 0 Vertices : [ P, Q, R, S, Q, 0 ] [ P, Q, R, S, S, 0 ] [ P, Q, R, S, S, -Q+S ] [ P, Q, R, R, Q, 0 ] [ P, Q, R, R, R, 0 ] [ P, Q, R, R, R, -Q+R ] [ P, Q, Q-S, S, Q, 0 ] [ P, Q, Q-S, S, S, 0 ] [ P, Q, Q-S, S, S, -Q+S ] [ P, Q, Q-S, Q-S, Q, 0 ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, R, S, Q, 0 ] [ P, P, R, S, S, 0 ] [ P, P, R, S, S, -Q+S ] [ P, P, R, R, Q, 0 ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, S, Q, 0 ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, Q, 0 ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, R, S, Q, 0 ] [ 0, Q, R, S, S, 0 ] [ 0, Q, R, S, S, -Q+S ] [ 0, Q, R, R, Q, 0 ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, S, Q, 0 ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, Q, 0 ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, S, Q, 0 ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, Q, 0 ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, Q, 0 ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, Q, 0 ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] --------------------------------------- Domain : - P + Q >= 0 - S + T >= 0 - Q + R + S >= 0 - R + S >= 0 Q - T >= 0 P >= 0 1 >= 0 Vertices : [ P, Q, R, S, T, 0 ] [ P, Q, R, S, T, -Q+T ] [ P, Q, R, S, S, 0 ] [ P, Q, R, S, S, -Q+S ] [ P, Q, R, R, T, 0 ] [ P, Q, R, R, T, -Q+T ] [ P, Q, R, R, R, 0 ] [ P, Q, R, R, R, -Q+R ] [ P, Q, Q-S, S, T, 0 ] [ P, Q, Q-S, S, T, -Q+T ] [ P, Q, Q-S, S, S, 0 ] [ P, Q, Q-S, S, S, -Q+S ] [ P, Q, Q-S, Q-S, T, 0 ] [ P, Q, Q-S, Q-S, T, -Q+T ] [ P, Q, Q-S, Q-S, Q-S, 0 ] [ P, Q, Q-S, Q-S, Q-S, -S ] [ P, P, R, S, T, 0 ] [ P, P, R, S, T, -Q+T ] [ P, P, R, S, S, 0 ] [ P, P, R, S, S, -Q+S ] [ P, P, R, R, T, 0 ] [ P, P, R, R, T, -Q+T ] [ P, P, R, R, R, 0 ] [ P, P, R, R, R, -Q+R ] [ P, P, P-S, S, T, 0 ] [ P, P, P-S, S, T, -Q+T ] [ P, P, P-S, S, S, 0 ] [ P, P, P-S, S, S, -Q+S ] [ P, P, P-S, P-S, T, 0 ] [ P, P, P-S, P-S, T, -Q+T ] [ P, P, P-S, P-S, P-S, 0 ] [ P, P, P-S, P-S, P-S, P-Q-S ] [ 0, Q, R, S, T, 0 ] [ 0, Q, R, S, T, -Q+T ] [ 0, Q, R, S, S, 0 ] [ 0, Q, R, S, S, -Q+S ] [ 0, Q, R, R, T, 0 ] [ 0, Q, R, R, T, -Q+T ] [ 0, Q, R, R, R, 0 ] [ 0, Q, R, R, R, -Q+R ] [ 0, Q, Q-S, S, T, 0 ] [ 0, Q, Q-S, S, T, -Q+T ] [ 0, Q, Q-S, S, S, 0 ] [ 0, Q, Q-S, S, S, -Q+S ] [ 0, Q, Q-S, Q-S, T, 0 ] [ 0, Q, Q-S, Q-S, T, -Q+T ] [ 0, Q, Q-S, Q-S, Q-S, 0 ] [ 0, Q, Q-S, Q-S, Q-S, -S ] [ 0, 0, R, S, T, 0 ] [ 0, 0, R, S, T, -Q+T ] [ 0, 0, R, S, S, 0 ] [ 0, 0, R, S, S, -Q+S ] [ 0, 0, R, R, T, 0 ] [ 0, 0, R, R, T, -Q+T ] [ 0, 0, R, R, R, 0 ] [ 0, 0, R, R, R, -Q+R ] [ 0, 0, -S, S, T, 0 ] [ 0, 0, -S, S, T, -Q+T ] [ 0, 0, -S, S, S, 0 ] [ 0, 0, -S, S, S, -Q+S ] [ 0, 0, -S, -S, T, 0 ] [ 0, 0, -S, -S, T, -Q+T ] [ 0, 0, -S, -S, -S, 0 ] [ 0, 0, -S, -S, -S, -Q-S ] polylib-5.22.5.orig/Test/pp/xavi.out0000644000175000017500000000022511035141340020125 0ustar sylvestresylvestre--------------------------------------- Domain : 1 >= 0 Vertices : [ 16, 97/32 ] [ 31/8 , 0 ] [ 3, 0 ] [ 96/31 , 24/31 ] [ 16, 4 ] polylib-5.22.5.orig/Test/pp/ray3.out0000644000175000017500000000027511035141340020041 0ustar sylvestresylvestre--------------------------------------- Overall rays : Line: [ 1 -1 ] Ray: [ 0 1 ] --------------------------------------- Domain : 1 >= 0 Vertices : [ a+b, 0 ] polylib-5.22.5.orig/Test/pp/salvatore_new2.out0000644000175000017500000000047411035141340022117 0ustar sylvestresylvestre--------------------------------------- Overall rays : Line: [ 0 1 ] --------------------------------------- Domain : - a >= 0 a + 1 >= 0 Vertices : [ 0, 0 ] [ a+1, 0 ] --------------------------------------- Domain : a >= 0 1 >= 0 Vertices : [ a+1, 0 ] [ a, 0 ] polylib-5.22.5.orig/Test/pp/salvatore_new1.out0000644000175000017500000000033711035141340022114 0ustar sylvestresylvestre--------------------------------------- Domain : - a >= 0 a + 1 >= 0 Vertices : [ 0 ] [ a+1 ] --------------------------------------- Domain : a >= 0 1 >= 0 Vertices : [ a+1 ] [ a ] polylib-5.22.5.orig/Test/pp/ray2.out0000644000175000017500000000027311035141340020036 0ustar sylvestresylvestre--------------------------------------- Overall rays : Line: [ 1 -1 ] Ray: [ 0 1 ] --------------------------------------- Domain : 1 >= 0 Vertices : [ a, 0 ] polylib-5.22.5.orig/Test/pp/salvatore.in0000644000175000017500000000005111035141340020752 0ustar sylvestresylvestre1 5 0 0 1 -1 0 x = a 1 3 0 0 0 a polylib-5.22.5.orig/Test/pp/xavi.in0000644000175000017500000000031011035141340017717 0ustar sylvestresylvestre# An example from Xavier Vera Rivera # no parameters 7 4 1 8 -1 -24 1 8 -32 0 1 -8 32 31 1 0 1 0 1 0 -1 4 1 1 0 -1 1 -1 0 16 0 2 polylib-5.22.5.orig/Test/pp/ray1.out0000644000175000017500000000026211035141340020033 0ustar sylvestresylvestre--------------------------------------- Overall rays : Ray: [ 1 ] --------------------------------------- Domain : 2a -11 >= 0 1 >= 0 Vertices : [ a ] polylib-5.22.5.orig/Test/pp/ray3.in0000644000175000017500000000003211035141340017627 0ustar sylvestresylvestre1 6 1 1 1 -1 -1 0 0 4 a b polylib-5.22.5.orig/Test/pp/ray2.in0000644000175000017500000000002511035141340017630 0ustar sylvestresylvestre1 5 1 1 1 -1 0 0 3 a polylib-5.22.5.orig/Test/pp/Makefile.am0000644000175000017500000000147311341227526020502 0ustar sylvestresylvestre# # $Id: Makefile.am,v 1.2 2005/10/20 11:35:25 verdoolaege Exp $ # OBJ_DIR = $(top_builddir) PP = \ c6.in \ c7.in \ salvatore.in \ salvatore_new1.in \ salvatore_new2.in \ xavi.in \ ray1.in \ ray2.in \ ray3.in # c5.in \ # c4.in \ # c9.in # c10.in EXTRA_DIST = $(PP) \ $(PP:%.in=%.out) tests: @failedtest=0; \ for x in $(PP) ; do \ echo "Verify file $$x"; \ $(OBJ_DIR)/pp$(TEST_BITS) < $(srcdir)/$$x > xyz;\ diff -w xyz $(srcdir)/`basename $$x .in`.out ; \ result=$$?; \ if [ "$$result" -eq "1" ]; then \ echo "Error: $$x is not the same"; \ failedtest=`expr $$failedtest + 1`; \ else \ echo "$$x passed"; \ fi; \ done ; \ if [ $$failedtest != 0 ]; then \ echo "$$failedtest tests failed"; \ else \ echo "Test pp works correctly"; \ fi CLEANFILES=xyz polylib-5.22.5.orig/Test/pp/c7.in0000644000175000017500000000073311035141340017272 0ustar sylvestresylvestre 14 15 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 -1 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 2 0 0 0 0 0 8 polylib-5.22.5.orig/Test/pp/ray1.in0000644000175000017500000000004611035141340017632 0ustar sylvestresylvestre1 4 1 1 -1 0 # x >= a 1 3 1 2 -11 a polylib-5.22.5.orig/Test/pp/c6.in0000644000175000017500000000067411035141340017275 0ustar sylvestresylvestre# i j k l m n P Q R S T 12 13 1 1 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 0 0 0 0 1 0 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 0 1 0 -1 1 0 0 0 0 0 0 1 0 0 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 1 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 0 -1 1 0 1 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 5 7 1 1 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 polylib-5.22.5.orig/depcomp0000755000175000017500000004271311171075112016460 0ustar sylvestresylvestre#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2007-03-29.01 # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007 Free Software # Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> $depfile echo >> $depfile # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> $depfile else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${; s/^ *//; s/ \\*$//; s/$/:/; p;}' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # X makedepend shift cleared=no for arg in "$@"; do case $cleared in no) set ""; shift cleared=yes ;; esac case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix="`echo $object | sed 's/^.*\././'`" touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o, # because we must use -o when running libtool. "$@" || exit $? IFS=" " for arg do case "$arg" in "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: polylib-5.22.5.orig/configure.in0000644000175000017500000002101111341231223017374 0ustar sylvestresylvestrednl This file is an input file used by the GNU "autoconf" program to dnl generate the file "configure", which is run to configure the dnl Makefile in this directory. # This file is part of PolyLib. # # PolyLib is free software: you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation, either version 3 of the License, or # (at your option) any later version. # # PolyLib is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with PolyLib. If not, see . # Authors: Bart Kienhuis, Vincent Loechner, T. Risset # Copyright (c) 2000 The Regents of the University of California. # All rights reserved. # # Permission is hereby granted, without written agreement and without # license or royalty fees, to use, copy, modify, and distribute this # software and its documentation for any purpose, provided that the # above copyright notice and the following two paragraphs appear in all # copies of this software. # # IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY # FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES # ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF # THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF # SUCH DAMAGE. # # THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, # INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF # MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE # PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF # CALIFORNIA HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, # ENHANCEMENTS, OR MODIFICATIONS. # # PT_COPYRIGHT_VERSION_2 # COPYRIGHTENDKEY dnl Process this file with autoconf to produce a configure script. AC_INIT(polylib, 5.22.5) AM_INIT_AUTOMAKE([gnu]) AC_CONFIG_SRCDIR(include/polylib/polylib.h.in) AC_CONFIG_MACRO_DIR([m4]) AC_PREREQ(2.60) AC_SUBST(versioninfo) versioninfo=9:0:1 if test "x$prefix" != "xNONE"; then prefix_wd=`cd $prefix && pwd` srcdir_wd=`cd $srcdir && pwd` wd=`pwd` if test "x$prefix_wd" = "x$srcdir_wd"; then AC_MSG_ERROR(Installation in source directory not supported) fi if test "x$prefix_wd" = "x$wd"; then AC_MSG_ERROR(Installation in build directory not supported) fi fi dnl Checks for programs. AC_PROG_CC AC_PROG_LN_S AC_PROG_INSTALL AC_PROG_LIBTOOL AM_PROG_CC_C_O dnl Checks for typedefs, structures, and compiler characteristics. AC_C_CONST dnl Checks for header files. AC_HEADER_STDC AC_CHECK_HEADERS(limits.h unistd.h) AC_CHECK_HEADERS(getopt.h) dnl /*****************************************************************************/ dnl See if the only goal is to create an 'int', 'longint', or 'longlongint' library AC_CHECK_SIZEOF(int,1) AC_CHECK_SIZEOF(long int,1) AC_CHECK_SIZEOF(long long int,1) AC_SUBST(polylib32_defs) AC_SUBST(polylib64_defs) AC_SUBST(polylib128_defs) for type in long_long_int long_int int; do case "$type" in int) bits=`expr $ac_cv_sizeof_int \* 8` defs="#define LINEAR_VALUE_IS_INT" ;; long_int) bits=`expr $ac_cv_sizeof_long_int \* 8` defs="#define LINEAR_VALUE_IS_LONG #define LINEAR_VALUE_PROTECT_MULTIPLY" ;; long_long_int) bits=`expr $ac_cv_sizeof_long_long_int \* 8` defs="#define LINEAR_VALUE_IS_LONGLONG #define LINEAR_VALUE_PROTECT_MULTIPLY #define LINEAR_VALUE_ASSUME_SOFTWARE_IDIV" ;; esac case "$bits" in 32) polylib32_defs=$defs ;; 64) polylib64_defs=$defs ;; 128) polylib128_defs=$defs ;; esac done AC_SUBST(polylibs) AC_SUBST(ALL_BITS) AC_ARG_ENABLE(int-lib, [ --enable-int-lib Build an int library], [lib_type=int bits=`expr $ac_cv_sizeof_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" ]) AC_ARG_ENABLE(longint-lib, [ --enable-longint-lib Build a long int library], [lib_type=longint bits=`expr $ac_cv_sizeof_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" ]) AC_ARG_ENABLE(longlongint-lib, [ --enable-longlongint-lib Build a long long int library], [lib_type=longlongint bits=`expr $ac_cv_sizeof_long_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" ]) dnl Check for GMP library AC_MSG_CHECKING(whether to use GMP) AC_ARG_WITH(libgmp, [ --with-libgmp DIR Location of the GMP Distribution], gmp_package=$withval, gmp_package=no) if test "x$gmp_package" = "xno"; then AC_MSG_RESULT(no) else AC_MSG_RESULT(yes) if test "x$gmp_package" != "xyes"; then GMP_DIR=$gmp_package if test ! -d "$GMP_DIR"; then AC_ERROR(Directory given for GMP Distribution is not a directory) fi CPPFLAGS="-I$GMP_DIR/include $CPPFLAGS" LDFLAGS="-L$GMP_DIR/lib $LDFLAGS" fi AC_CHECK_HEADER(gmp.h, [AC_CHECK_LIB(gmp,main, [poly_cv_gmpfatal="no"], [poly_cv_gmpfatal="yes"])], [poly_cv_gmpfatal="yes"]) if test "$poly_cv_gmpfatal" = "yes"; then AC_MSG_ERROR([GMP not found]) else AC_CHECK_DECLS(mp_get_memory_functions,[],[ AC_LIBOBJ(mp_get_memory_functions) ],[#include ]) fi lib_type=gmp BITS=`expr gmp` LIBS="-lgmp $LIBS" polylibs="libpolylib$BITS.la $polylibs" ALL_BITS="$BITS $ALL_BITS" fi if test "X$lib_type" = "X"; then AC_MSG_CHECKING(what the LONG representation is) if test "$ac_cv_sizeof_long_long_int" -gt "$ac_cv_sizeof_int"; then AC_MSG_RESULT([long long int]) lib_type=longlongint bits=`expr $ac_cv_sizeof_long_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" elif test "$ac_cv_sizeof_long_int" -gt "$ac_cv_sizeof_int"; then AC_MSG_RESULT([long int]) lib_type=longint bits=`expr $ac_cv_sizeof_long_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" else AC_MSG_RESULT([NONE!]) lib_type=int bits=`expr $ac_cv_sizeof_int \* 8` polylibs="libpolylib$bits.la $polylibs" ALL_BITS="$bits $ALL_BITS" fi fi case "$lib_type" in int) BITS=`expr $ac_cv_sizeof_int \* 8` ;; longint) BITS=`expr $ac_cv_sizeof_long_int \* 8` ;; longlongint) BITS=`expr $ac_cv_sizeof_long_long_int \* 8` ;; esac AC_SUBST(polylib) polylib="libpolylib$BITS.la" dnl extra indirection to avoid automake getting confused AC_SUBST(multi_bin_programs) AC_SUBST(multi_noinst_programs) for pl_bit in $ALL_BITS ; do multi_bin_programs="$multi_bin_programs \$(multi_bin_programs_${pl_bit})" multi_noinst_programs="$multi_noinst_programs \$(no_inst_programs_${pl_bit})" done dnl /*****************************************************************************/ AC_ARG_ENABLE(extra-suffix, [ --enable-extra-suffix Add bits size suffix to executables], [ if test "$enableval" = yes; then program_transform_name="s/\$\$/$BITS/;$program_transform_name" fi ] ) dnl /********************************************************************/ dnl Check for DOXYGEN package AC_ARG_WITH(doxygen, [ --with-doxygen DIR Location of the Doxygen Distribution (http://www.doxygen.org)], doxygen_package=$withval) dnl AC_MSG_CHECKING(for Doxygen program) AC_CHECK_PROG(DOXYGEN,doxygen,doxygen,test,[$PATH:$doxygen_package/bin:/usr/local/bin]) dnl AC_MSG_RESULT($DOXYGEN) AC_SUBST(LIBS) dnl long/int bits and compilation flags AC_SUBST(BITS) dnl Used with doxygen AC_SUBST(DOXYGEN) dnl Currently, we only create one .pc file dnl Creating one for each configured version is a bit complicated PACKAGE_NAME=polylib$BITS AX_CREATE_PKGCONFIG_INFO AC_CONFIG_HEADERS(config.h) AC_OUTPUT(Makefile include/Makefile include/polylib/Makefile include/polylib/polylib.h Test/Makefile Test/Zpolytest/Makefile Test/ehrhart/Makefile Test/ehrhart_union/Makefile Test/ranking/Makefile Test/general/Makefile Test/pp/Makefile polylib.doxygen ) echo "Polylib will be built with " $ALL_BITS "integer size(s)" echo "---------------------------------------------------" echo "You can proceed with:" echo "make :to build the libs and the executables" echo "make tests :to test the library" echo "make install :to install them (to $prefix)" echo "---------------------------------------------------" polylib-5.22.5.orig/polylib.doxygen.in0000644000175000017500000012772011035141341020560 0ustar sylvestresylvestre# Doxyfile 1.3.5 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = @PACKAGE@ # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @PACKAGE_VERSION@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = ./doc/codeDoc # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Brazilian, Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, # Finnish, French, German, Greek, Hungarian, Italian, Japanese, Japanese-en # (Japanese with English messages), Korean, Norwegian, Polish, Portuguese, # Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish, and Ukrainian. OUTPUT_LANGUAGE = English # This tag can be used to specify the encoding used in the generated output. # The encoding is not always determined by the language that is chosen, # but also whether or not the output is meant for Windows or non-Windows users. # In case there is a difference, setting the USE_WINDOWS_ENCODING tag to YES # forces the Windows encoding (this is the default for the Windows binary), # whereas setting the tag to NO uses a Unix-style encoding (the default for # all platforms other than Windows). USE_WINDOWS_ENCODING = NO # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is used # as the annotated text. Otherwise, the brief description is used as-is. If left # blank, the following values are used ("$name" is automatically replaced with the # name of the entity): "The $name class" "The $name widget" "The $name file" # "is" "provides" "specifies" "contains" "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited # members of a class in the documentation of that class as if those members were # ordinary class members. Constructors, destructors and assignment operators of # the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. It is allowed to use relative paths in the argument list. STRIP_FROM_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like the Qt-style comments (thus requiring an # explicit @brief command for a brief description. JAVADOC_AUTOBRIEF = YES # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the DETAILS_AT_TOP tag is set to YES then Doxygen # will output the detailed description near the top, like JavaDoc. # If set to NO, the detailed description appears after the member # documentation. DETAILS_AT_TOP = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources # only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = NO # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources # only. Doxygen will then generate output that is more tailored for Java. # For instance, namespaces will be presented as packages, qualified scopes # will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = YES # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = YES # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = YES # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. WARN_FORMAT = # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = @srcdir@/source/kernel \ @srcdir@/source/arith \ @srcdir@/source/ehrhart \ @srcdir@/applications \ @srcdir@/include/polylib # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp # *.h++ *.idl *.odl *.cs *.php *.php3 *.inc FILE_PATTERNS = # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories # that are symbolic links (a Unix filesystem feature) are excluded from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. EXCLUDE_PATTERNS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. INPUT_FILTER = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = NO # If the REFERENCED_BY_RELATION tag is set to YES (the default) # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES (the default) # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compressed HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # If the GENERATE_TREEVIEW tag is set to YES, a side panel will be # generated containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+, # Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are # probably better off using the HTML help feature. GENERATE_TREEVIEW = YES # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. This is useful # if you want to understand what is going on. On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_PREDEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = @srcdir@/include \ @srcdir@/include/polylib # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse the # parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::addtions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base or # super classes. Setting the tag to NO turns the diagrams off. Note that this # option is superseded by the HAVE_DOT option below. This is only a fallback. It is # recommended to install and use dot, since it yields more powerful graphs. CLASS_DIAGRAMS = YES # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT tags are set to YES then doxygen will # generate a call dependency graph for every global function or class method. # Note that enabling this option will significantly increase the time of a run. # So in most cases it will be better to enable call graphs for selected # functions only using the \callgraph command. CALL_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found on the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_WIDTH = 1024 # The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_HEIGHT = 1024 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes that # lay further from the root node will be omitted. Note that setting this option to # 1 or 2 may greatly reduce the computation time needed for large code bases. Also # note that a graph may be further truncated if the graph's image dimensions are # not sufficient to fit the graph (see MAX_DOT_GRAPH_WIDTH and MAX_DOT_GRAPH_HEIGHT). # If 0 is used for the depth value (the default), the graph is not depth-constrained. MAX_DOT_GRAPH_DEPTH = 0 # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES #--------------------------------------------------------------------------- # Configuration::addtions related to the search engine #--------------------------------------------------------------------------- # The SEARCHENGINE tag specifies whether or not a search engine should be # used. If set to NO the values of all tags below this one will be ignored. SEARCHENGINE = NO polylib-5.22.5.orig/AUTHORS0000644000175000017500000000000011341224600016127 0ustar sylvestresylvestre