From 4d3c6f8113a46b45636367fbbd44748d3dece8a9 Mon Sep 17 00:00:00 2001 From: Richard Kreckel Date: Fri, 25 May 2001 17:30:21 +0000 Subject: [PATCH] * Removed LiDIA interface since that is now outdated (namespace cln) and maintained elsewhere. --- lidia-interface/LiDIA-patch1 | 321 ------- lidia-interface/LiDIA-patch2 | 27 - lidia-interface/README | 57 -- lidia-interface/TAR-FILE-LIST | 236 ------ lidia-interface/bigint.o.i386-linux | Bin 27412 -> 0 bytes lidia-interface/bigint.o.needs | 104 --- lidia-interface/bigint.o.undef | 62 -- .../src/interfaces/integers/cln/bigint.c | 784 ------------------ .../src/interfaces/integers/cln/bigint_def.h | 40 - .../src/interfaces/integers/cln/makefile | 69 -- .../src/kernel/integers/cln/README | 17 - .../src/kernel/integers/cln/cln/README.LiDIA | 6 - .../src/kernel/integers/cln/makefile | 178 ---- 13 files changed, 1901 deletions(-) delete mode 100644 lidia-interface/LiDIA-patch1 delete mode 100644 lidia-interface/LiDIA-patch2 delete mode 100644 lidia-interface/README delete mode 100644 lidia-interface/TAR-FILE-LIST delete mode 100644 lidia-interface/bigint.o.i386-linux delete mode 100644 lidia-interface/bigint.o.needs delete mode 100644 lidia-interface/bigint.o.undef delete mode 100644 lidia-interface/src/interfaces/integers/cln/bigint.c delete mode 100644 lidia-interface/src/interfaces/integers/cln/bigint_def.h delete mode 100644 lidia-interface/src/interfaces/integers/cln/makefile delete mode 100644 lidia-interface/src/kernel/integers/cln/README delete mode 100644 lidia-interface/src/kernel/integers/cln/cln/README.LiDIA delete mode 100755 lidia-interface/src/kernel/integers/cln/makefile diff --git a/lidia-interface/LiDIA-patch1 b/lidia-interface/LiDIA-patch1 deleted file mode 100644 index 5665cab..0000000 --- a/lidia-interface/LiDIA-patch1 +++ /dev/null @@ -1,321 +0,0 @@ -diff -r -c3 LiDIA-1.3.orig/Readme LiDIA-1.3/Readme -*** LiDIA-1.3.orig/Readme Wed Feb 5 21:51:10 1997 ---- LiDIA-1.3/Readme Sun Jan 25 00:44:29 1998 -*************** -*** 157,164 **** - o mpqs: large prime variant for quadratic sieve in the class - rational_factorization. - -! o You can now choose gmp as the integer arithmetic of the kernel. -! This LiDIA - release contains gmp version 2.0.2. - - - ---- 157,164 ---- - o mpqs: large prime variant for quadratic sieve in the class - rational_factorization. - -! o You can now choose gmp or cln as the integer arithmetic of the kernel. -! This LiDIA release contains gmp version 2.0.2 and cln version 1997-09-06. - - - -diff -r -c3 LiDIA-1.3.orig/config/CONFIG.in LiDIA-1.3/config/CONFIG.in -*** LiDIA-1.3.orig/config/CONFIG.in Wed Feb 5 12:02:16 1997 ---- LiDIA-1.3/config/CONFIG.in Sat Jan 24 18:42:57 1998 -*************** -*** 42,48 **** - # - # The Kernel And The Interface To Be compiled - # -! # Possible Integer Interfaces Are: libI, lip, gmp - # - # Possible Memory Managers Are: malloc, dentzer, boehm, - # default (no manager) ---- 42,48 ---- - # - # The Kernel And The Interface To Be compiled - # -! # Possible Integer Interfaces Are: libI, lip, gmp, cln - # - # Possible Memory Managers Are: malloc, dentzer, boehm, - # default (no manager) -*************** -*** 149,155 **** - LIDIA_INSTALL_DAT = ${LIDIA_INSTALL_DIR}/lib - - # -! # OS/2 Compatability Section - # - - CXX-off = ---- 149,155 ---- - LIDIA_INSTALL_DAT = ${LIDIA_INSTALL_DIR}/lib - - # -! # OS/2 Compatibility Section - # - - CXX-off = -*************** -*** 166,171 **** ---- 166,172 ---- - # Make Command Macros - # - # AR -- the archiver command -+ # ARX -- the archiver extract command - # RM -- command used to remove files - # RMR -- command used to remove directories - # CP -- command used to copy files -*************** -*** 178,183 **** ---- 179,185 ---- - # - - AR = @AR@ -+ ARX = ar x - RM = @RM@ - RMR = @RMR@ - CP = @CP@ -diff -r -c3 LiDIA-1.3.orig/config/CONFIG.os2 LiDIA-1.3/config/CONFIG.os2 -*** LiDIA-1.3.orig/config/CONFIG.os2 Tue Jan 21 14:55:44 1997 ---- LiDIA-1.3/config/CONFIG.os2 Sat Jan 24 18:43:28 1998 -*************** -*** 137,142 **** ---- 137,143 ---- - # Make Command Macros - # - # AR -- the archiver command -+ # ARX -- the archiver extract command - # RM -- command used to remove files - # RMR -- command used to remove directories - # CP -- command used to copy files -*************** -*** 147,152 **** ---- 148,154 ---- - # TOUCH -- command used to create an empry file - # - AR = ar ru -+ ARX = ar x - RM = del /N - RMR = del /N - CP = xcopy -diff -r -c3 LiDIA-1.3.orig/config/bin/integer-sh LiDIA-1.3/config/bin/integer-sh -*** LiDIA-1.3.orig/config/bin/integer-sh Tue Oct 22 22:25:57 1996 ---- LiDIA-1.3/config/bin/integer-sh Sun Jan 25 00:47:13 1998 -*************** -*** 7,15 **** - - echo " " - echo "You will now be asked for the integer arithmetic that " -! echo "will be used in the kernel of LiDIA (gmp, libI, lip)." - echo " " - echo "gmp - written by Torbjorn Granlund" - echo "libI - written by Ralf Dentzer" - echo "lip - written by Arjen Lenstra" - echo " " ---- 7,16 ---- - - echo " " - echo "You will now be asked for the integer arithmetic that " -! echo "will be used in the kernel of LiDIA (gmp, cln, libI, lip)." - echo " " - echo "gmp - written by Torbjorn Granlund" -+ echo "cln - written by Bruno Haible (based on gmp)" - echo "libI - written by Ralf Dentzer" - echo "lip - written by Arjen Lenstra" - echo " " -*************** -*** 23,35 **** - do - echo -n "integer arithmetic ? [$INTEGERS] : " - read ANSWER -! if test "$ANSWER" = "gmp" -o "$ANSWER" = "lip" -o "$ANSWER" = "libI" ; then - INTEGERS=$ANSWER - SUCCESS=y - elif test "$ANSWER" = "" ; then - SUCCESS=y - else -! echo "Please choose gmp, libI, or lip." - INTEGERS="libI" - fi - done ---- 24,36 ---- - do - echo -n "integer arithmetic ? [$INTEGERS] : " - read ANSWER -! if test "$ANSWER" = "gmp" -o "$ANSWER" = "cln" -o "$ANSWER" = "lip" -o "$ANSWER" = "libI" ; then - INTEGERS=$ANSWER - SUCCESS=y - elif test "$ANSWER" = "" ; then - SUCCESS=y - else -! echo "Please choose gmp, cln, libI, or lip." - INTEGERS="libI" - fi - done -diff -r -c3 LiDIA-1.3.orig/doc/manual/FIG/lidia_model.fig LiDIA-1.3/doc/manual/FIG/lidia_model.fig -*** LiDIA-1.3.orig/doc/manual/FIG/lidia_model.fig Tue Feb 27 11:57:01 1996 ---- LiDIA-1.3/doc/manual/FIG/lidia_model.fig Sun Jan 25 00:48:58 1998 -*************** -*** 55,61 **** - 4 0 -1 0 0 2 16 0.0000000 4 225 2085 1200 2850 parameterized classes\001 - 4 0 -1 0 0 2 16 0.0000000 4 225 1365 1200 4035 simple classes\001 - 4 0 -1 0 0 2 16 0.0000000 4 165 930 1200 5220 interfaces\001 -! 4 2 -1 0 0 12 12 0.0000000 4 180 2100 9000 6375 (libI, lip, gmp, mm)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 1365 9000 5175 (bigint, gmm)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 2940 9000 3975 (bigrational, bigfloat, ...)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 3675 9000 2775 (vector, matrix, power series, ...)\001 ---- 55,61 ---- - 4 0 -1 0 0 2 16 0.0000000 4 225 2085 1200 2850 parameterized classes\001 - 4 0 -1 0 0 2 16 0.0000000 4 225 1365 1200 4035 simple classes\001 - 4 0 -1 0 0 2 16 0.0000000 4 165 930 1200 5220 interfaces\001 -! 4 2 -1 0 0 12 12 0.0000000 4 180 2100 9000 6375 (libI, lip, gmp, cln, mm)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 1365 9000 5175 (bigint, gmm)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 2940 9000 3975 (bigrational, bigfloat, ...)\001 - 4 2 -1 0 0 12 12 0.0000000 4 180 3675 9000 2775 (vector, matrix, power series, ...)\001 -diff -r -c3 LiDIA-1.3.orig/doc/manual/bibliography.tex LiDIA-1.3/doc/manual/bibliography.tex -*** LiDIA-1.3.orig/doc/manual/bibliography.tex Fri Jan 24 13:22:31 1997 ---- LiDIA-1.3/doc/manual/bibliography.tex Sun Jan 25 00:55:48 1998 -*************** -*** 151,156 **** ---- 151,159 ---- - \IT{A rigorous subexponential algorithm for computation of class groups}, - Tech. report, IBM Research Report, San Jose, CA, 1989. - -+ \bibitem{haible} B. Haible: -+ \IT{CLN, a Class Library for Numbers}, 1997. -+ - \bibitem{HLConF} G.H. Hardy and J.E. Littlewood: - \IT{\em Partitio numerorum {III}: On the expression of a number as a sum of - primes}, Acta Math. {\bf 44} (1923), 1--70. -diff -r -c3 LiDIA-1.3.orig/doc/manual/installing.tex LiDIA-1.3/doc/manual/installing.tex -*** LiDIA-1.3.orig/doc/manual/installing.tex Wed Feb 5 17:33:40 1997 ---- LiDIA-1.3/doc/manual/installing.tex Sun Jan 25 00:58:30 1998 -*************** -*** 309,316 **** - of the kernel. - \item BIGINT\\ - This is used to decide which integer arithmetic is to be compiled with -! {\LiDIA}. At the moment we support three possibilities: \TT{gmp}, \TT{libI}, -! and \TT{lip}. We suggest that you use the \TT{gmp} with the GNU g++ - compiler and \TT{libI} otherwise. Use \TT{lip}, if you have chosen - \TT{libI} during the configuration process and TARGET has been set - to c by configure. In this case, no \TT{libI} assembler code is ---- 309,316 ---- - of the kernel. - \item BIGINT\\ - This is used to decide which integer arithmetic is to be compiled with -! {\LiDIA}. At the moment we support four possibilities: \TT{gmp}, \TT{cln}, -! TT{libI}, and \TT{lip}. We suggest that you use the \TT{gmp} with the GNU g++ - compiler and \TT{libI} otherwise. Use \TT{lip}, if you have chosen - \TT{libI} during the configuration process and TARGET has been set - to c by configure. In this case, no \TT{libI} assembler code is -diff -r -c3 LiDIA-1.3.orig/doc/manual/overview.tex LiDIA-1.3/doc/manual/overview.tex -*** LiDIA-1.3.orig/doc/manual/overview.tex Wed Jan 29 19:32:32 1997 ---- LiDIA-1.3/doc/manual/overview.tex Sun Jan 25 00:57:36 1998 -*************** -*** 19,24 **** ---- 19,25 ---- - \newcommand{\libi}{{\bf libI}} - \newcommand{\gmp}{{\bf GNU gmp}} - \newcommand{\lip}{{\bf lip}} -+ \newcommand{\cln}{{\bf cln}} - \newcommand{\bigint}{{\bf bigint}} - - -*************** -*** 70,76 **** - It is a serious problem to decide which multiprecision integer package - and which memory manager should be used in \LiDIA. There are - competing multiprecision integer packages, for example the -! \gmp\ package \cite{gnump}, the \libi\ package \cite{dentzer} and - the \lip\ package \cite{lenstra}. Some of those packages are more - efficient on one architecture and some on others. Also, new - architectures lead very fast to new multiprecision packages. We decided ---- 71,78 ---- - It is a serious problem to decide which multiprecision integer package - and which memory manager should be used in \LiDIA. There are - competing multiprecision integer packages, for example the -! \gmp\ package \cite{gnump}, the \cln\ package \cite{haible}, -! the \libi\ package \cite{dentzer} and - the \lip\ package \cite{lenstra}. Some of those packages are more - efficient on one architecture and some on others. Also, new - architectures lead very fast to new multiprecision packages. We decided -*************** -*** 112,120 **** - whole functionality of the interface can be used in the kernel. - Currently, we support the multiprecision integer packages - \libi\ \cite{dentzer}, Arjen Lenstra's \Index{lip} package \cite{lenstra} -! (available by anonymous ftp via \TT{flash.bellcore.com:/pub/lenstra}) and GNU's - \IndexSUBTT{GNU}{gmp} arithmetic \cite{gnump} (available by anonymous -! ftp via \TT{prep.ai.mit.edu}). - - The second \LiDIA\ level is the \BF{interface} through which {\CPP} - applications on higher levels have access to the kernel. By that ---- 114,123 ---- - whole functionality of the interface can be used in the kernel. - Currently, we support the multiprecision integer packages - \libi\ \cite{dentzer}, Arjen Lenstra's \Index{lip} package \cite{lenstra} -! (available by anonymous ftp via \TT{flash.bellcore.com:/pub/lenstra}), GNU's - \IndexSUBTT{GNU}{gmp} arithmetic \cite{gnump} (available by anonymous -! ftp via \TT{prep.ai.mit.edu}), and CLN (available by anonymous ftp from -! \TT{ma2s2.mathematik.uni-karlsruhe.de:/pub/gnu}). - - The second \LiDIA\ level is the \BF{interface} through which {\CPP} - applications on higher levels have access to the kernel. By that -diff -r -c3 LiDIA-1.3.orig/include/LiDIA/bigint.h LiDIA-1.3/include/LiDIA/bigint.h -*** LiDIA-1.3.orig/include/LiDIA/bigint.h Tue Oct 29 17:47:17 1996 ---- LiDIA-1.3/include/LiDIA/bigint.h Sat Jan 24 20:29:16 1998 -*************** -*** 51,56 **** ---- 51,57 ---- - bigint(long l); - bigint(unsigned long ul); - bigint(const bigint & a); -+ bigint(const integer_type_name & II) : I (II) {} // cln needs this - ~bigint(); - - /** -Only in LiDIA-1.3/src/interfaces/integers: cln -diff -r -c3 LiDIA-1.3.orig/src/interfaces/integers/gmp/bigint.c LiDIA-1.3/src/interfaces/integers/gmp/bigint.c -*** LiDIA-1.3.orig/src/interfaces/integers/gmp/bigint.c Fri Jan 10 18:19:00 1997 ---- LiDIA-1.3/src/interfaces/integers/gmp/bigint.c Sat Jan 24 17:41:29 1998 -*************** -*** 610,616 **** - - void invert(bigint & a, const bigint & b) - { -! if ((a.I._mp_size == 1 || a.I._mp_size == -1) && a.I._mp_d[0] == 1) - mpz_set(&a.I, &b.I); - else - lidia_error_handler("bigint", "invert::inverting of a non-unit."); ---- 610,616 ---- - - void invert(bigint & a, const bigint & b) - { -! if ((b.I._mp_size == 1 || b.I._mp_size == -1) && b.I._mp_d[0] == 1) - mpz_set(&a.I, &b.I); - else - lidia_error_handler("bigint", "invert::inverting of a non-unit."); -Only in LiDIA-1.3/src/kernel/integers: cln -diff -r -c3 LiDIA-1.3.orig/src/simple_classes/factorization/mpqs.c LiDIA-1.3/src/simple_classes/factorization/mpqs.c -*** LiDIA-1.3.orig/src/simple_classes/factorization/mpqs.c Tue Jan 28 14:00:36 1997 ---- LiDIA-1.3/src/simple_classes/factorization/mpqs.c Sat Jan 24 17:45:17 1998 -*************** -*** 17,23 **** - //extern "C" int system(char*); - #endif - -! #if !defined(__GNUG__) - #include - #else - #define SIGHUP 1 /* hangup */ ---- 17,23 ---- - //extern "C" int system(char*); - #endif - -! #if defined(__linux__) || !defined(__GNUG__) - #include - #else - #define SIGHUP 1 /* hangup */ diff --git a/lidia-interface/LiDIA-patch2 b/lidia-interface/LiDIA-patch2 deleted file mode 100644 index 31ea28c..0000000 --- a/lidia-interface/LiDIA-patch2 +++ /dev/null @@ -1,27 +0,0 @@ -diff -r -c3 LiDIA-1.3/config/CONFIG LiDIA/config/CONFIG -*** LiDIA-1.3/config/CONFIG Mon Apr 15 15:00:47 1996 ---- LiDIA/config/CONFIG Sun Nov 17 18:43:41 1996 -*************** -*** 49,57 **** - # default (no manager) - # - -! BIGINT = libI -! GMM = default - - - # - # The Compiler/Assembler/Linker Settings ---- 49,60 ---- - # default (no manager) - # - -! BIGINT = cln -! GMM = default - -+ CLN_DIR = /home/bruno/cln -+ CLN_TARGETDIR = /home/bruno/cln/linuxelf -+ CLN_INCLUDES = -I$(CLN_TARGETDIR)/include -I$(CLN_DIR)/include -I$(CLN_DIR)/src/base -I$(CLN_DIR)/src/float -I$(CLN_DIR)/src/float/dfloat -I$(CLN_DIR)/src/io - - # - # The Compiler/Assembler/Linker Settings diff --git a/lidia-interface/README b/lidia-interface/README deleted file mode 100644 index 702053d..0000000 --- a/lidia-interface/README +++ /dev/null @@ -1,57 +0,0 @@ -This directory contains an interface to the LiDIA library, version 1.3.1. -It is already contained in LiDIA-1.3.1 and LiDIA-1.4a1, and is reproduced -here only as a sample for the use of CLN. - -LiDIA is available from - ftp://ftp.informatik.th-darmstadt.de/pub/TI/systems/LiDIA -(The LiDIA group has also a nice Web page.) - -LiDIA has an abstract interface to the underlying long integer implementation. -Using CLN instead of the default libI, lip or gmp has the following -advantages: - - - Maximum speed on all CPUs, since CLN is based on the highly - optimized gmp-2.0.2. - - - Very large integers profit from CLN's Schönhage-Strassen FFT multiplication - (asymptotic bit complexity: O(N log N log log N)). - - - Copying integers is fast: no copying is actually involved, only a - reference count is manipulated. - - - Small integers (absolute value < 2^29) are represented immediately, - thus no memory allocation/deallocation is involved when dealing with - small integers. - -CLN does all this automatically. - -INSTALLATION ------------- - -1. Build CLN. - -2. Apply the first patch to LiDIA: - $ cd .../LiDIA - $ patch -p1 < .../cln/lidia-interface/LiDIA-patch1 - -3. Configure LiDIA as described in its manual. - -4. Apply the second patch to LiDIA: - $ cd .../LiDIA - $ patch -p1 < .../cln/lidia-interface/LiDIA-patch2 - You may have to do this by hand, if the patch fails. - -5. Make two symbolic links - $ ln -s .../cln/lidia-interface/interfaces/integers/cln \ - .../LiDIA/src/interfaces/integers/cln - $ ln -s .../cln/BUILDDIR/src .../LiDIA/src/kernel/integers/cln - where .../cln/BUILDDIR is the directory in which you have built - cln (i.e. there is a file .../cln/BUILDDIR/src/libcln.a). - -6. Modify the definitions of the variables CLN_DIR and CLN_TARGETDIR in - the file .../LiDIA/config/CONFIG : - CLN_DIR must point to .../cln, - CLN_TARGETDIR must point to .../cln/BUILDDIR. - -7. Build LiDIA as described in its manual. - diff --git a/lidia-interface/TAR-FILE-LIST b/lidia-interface/TAR-FILE-LIST deleted file mode 100644 index 9411232..0000000 --- a/lidia-interface/TAR-FILE-LIST +++ /dev/null @@ -1,236 +0,0 @@ -cln/COPYING -cln/INSTALL -cln/INSTALL.generic -cln/Makefile.in -cln/README -cln/configure -cln/autoconf/config.guess -cln/autoconf/config.sub -cln/autoconf/floatparam.c -cln/autoconf/intparam.c -cln/autoconf/ltconfig -cln/autoconf/ltmain.sh -cln/benchmarks/Makefile.in -cln/doc/Makefile.in -cln/examples/Makefile.in -cln/gmp/ -cln/include/cl_abort.h -cln/include/cl_complex_class.h -cln/include/cl_config.h.in -cln/include/cl_dfloat.h -cln/include/cl_dfloat_class.h -cln/include/cl_ffloat.h -cln/include/cl_ffloat_class.h -cln/include/cl_float.h -cln/include/cl_floatformat.h -cln/include/cl_float_class.h -cln/include/cl_input.h -cln/include/cl_integer.h -cln/include/cl_integer_class.h -cln/include/cl_integer_io.h -cln/include/cl_io.h -cln/include/cl_lfloat.h -cln/include/cl_lfloat_class.h -cln/include/cl_malloc.h -cln/include/cl_modules.h -cln/include/cl_number.h -cln/include/cl_number_io.h -cln/include/cl_object.h -cln/include/cl_output.h -cln/include/cl_random.h -cln/include/cl_rational_class.h -cln/include/cl_real_class.h -cln/include/cl_sfloat_class.h -cln/include/cl_string.h -cln/include/cl_types.h -cln/src/Makefile.in -cln/src/Makeflags -cln/src/base/Makeflags -cln/src/base/cl_N.h -cln/src/base/cl_N_err_d0.cc -cln/src/base/cl_alloca.cc -cln/src/base/cl_alloca.h -cln/src/base/cl_base_config.h.in -cln/src/base/cl_free.cc -cln/src/base/cl_gmpconfig.h.in -cln/src/base/cl_low.h -cln/src/base/cl_macros.h -cln/src/base/cl_malloc.cc -cln/src/base/cl_notreached.cc -cln/src/base/cl_offsetof.h -cln/src/base/cl_sysdep.h -cln/src/base/cl_xmacros.h -cln/src/base/digit/Makeflags -cln/src/base/digit/cl_D.h -cln/src/base/digitseq/Makeflags -cln/src/base/digitseq/cl_DS.h -cln/src/base/digitseq/cl_DS_div.cc -cln/src/base/digitseq/cl_DS_endian.h -cln/src/base/digitseq/cl_DS_mul.cc -cln/src/base/digitseq/cl_DS_mul_fftm.h -cln/src/base/digitseq/cl_DS_mul_kara.h -cln/src/base/digitseq/cl_DS_mul_kara_sqr.h -cln/src/base/digitseq/cl_DS_random.cc -cln/src/base/digitseq/cl_DS_recip.cc -cln/src/base/digitseq/cl_DS_recipsqrt.cc -cln/src/base/digitseq/cl_DS_sqrt.cc -cln/src/base/digitseq/cl_asm.h -cln/src/base/digitseq/cl_asm_.cc -cln/src/base/digitseq/cl_asm_arm.h -cln/src/base/digitseq/cl_asm_arm_.cc -cln/src/base/digitseq/cl_asm_hppa.h -cln/src/base/digitseq/cl_asm_hppa_.cc -cln/src/base/digitseq/cl_asm_i386.h -cln/src/base/digitseq/cl_asm_i386_.cc -cln/src/base/digitseq/cl_asm_m68k.h -cln/src/base/digitseq/cl_asm_m68k_.cc -cln/src/base/digitseq/cl_asm_mips.h -cln/src/base/digitseq/cl_asm_mips_.cc -cln/src/base/digitseq/cl_asm_sparc.h -cln/src/base/digitseq/cl_asm_sparc_.cc -cln/src/base/digitseq/cl_asm_sparc64.h -cln/src/base/digitseq/cl_asm_sparc64_.cc -cln/src/base/input/Makeflags -cln/src/base/input/cl_read_err_bad.cc -cln/src/base/input/cl_read_err_junk.cc -cln/src/base/low/Makeflags -cln/src/base/low/cl_low_div.cc -cln/src/base/low/cl_low_mul.cc -cln/src/base/output/Makeflags -cln/src/base/output/cl_output_dec.cc -cln/src/base/output/cl_prin_globals.cc -cln/src/base/random/Makeflags -cln/src/base/random/cl_UL_random.cc -cln/src/base/random/cl_random_def.cc -cln/src/base/random/cl_random_from.cc -cln/src/base/random/cl_random_impl.h -cln/src/base/string/Makeflags -cln/src/base/string/cl_spushstring.h -cln/src/base/string/cl_spushstring_push.cc -cln/src/base/string/cl_sstring.cc -cln/src/base/string/cl_sstring.h -cln/src/base/string/cl_st_c2.cc -cln/src/base/string/cl_st_make1.cc -cln/src/base/string/cl_st_make2.cc -cln/src/base/string/cl_st_null.cc -cln/src/base/string/misc/Makeflags -cln/src/base/string/misc/cl_st_class.cc -cln/src/integer/Makeflags -cln/src/integer/cl_I.h -cln/src/integer/algebraic/Makeflags -cln/src/integer/algebraic/cl_I_sqrt.cc -cln/src/integer/bitwise/Makeflags -cln/src/integer/bitwise/cl_I_ash.cc -cln/src/integer/bitwise/cl_I_ash.h -cln/src/integer/bitwise/cl_I_ash_I.cc -cln/src/integer/bitwise/cl_I_asherr.cc -cln/src/integer/bitwise/cl_I_byte.h -cln/src/integer/bitwise/cl_I_fullbyte.cc -cln/src/integer/bitwise/cl_I_ilength.cc -cln/src/integer/bitwise/cl_I_ldb.cc -cln/src/integer/bitwise/cl_I_ldbx.cc -cln/src/integer/bitwise/cl_I_log.h -cln/src/integer/bitwise/cl_I_log_aux.cc -cln/src/integer/bitwise/cl_I_logand.cc -cln/src/integer/bitwise/cl_I_logbitp.cc -cln/src/integer/bitwise/cl_I_logior.cc -cln/src/integer/bitwise/cl_I_lognot.cc -cln/src/integer/bitwise/cl_I_logxor.cc -cln/src/integer/conv/Makeflags -cln/src/integer/conv/cl_I_digits_need.cc -cln/src/integer/conv/cl_I_from_DS.cc -cln/src/integer/conv/cl_I_from_L.cc -cln/src/integer/conv/cl_I_from_L2.cc -cln/src/integer/conv/cl_I_from_NDS.cc -cln/src/integer/conv/cl_I_from_NUDS.cc -cln/src/integer/conv/cl_I_from_Q.cc -cln/src/integer/conv/cl_I_from_UDS.cc -cln/src/integer/conv/cl_I_from_UL.cc -cln/src/integer/conv/cl_I_from_UQ.cc -cln/src/integer/conv/cl_I_from_digits.cc -cln/src/integer/conv/cl_I_to_L.cc -cln/src/integer/conv/cl_I_to_Q.cc -cln/src/integer/conv/cl_I_to_UL.cc -cln/src/integer/conv/cl_I_to_UQ.cc -cln/src/integer/conv/cl_I_to_digits.cc -cln/src/integer/division/Makeflags -cln/src/integer/division/cl_I_floor2.cc -cln/src/integer/division/cl_I_rem.cc -cln/src/integer/division/cl_I_trunc1.cc -cln/src/integer/division/cl_I_trunc2.cc -cln/src/integer/elem/Makeflags -cln/src/integer/elem/cl_I_compare.cc -cln/src/integer/elem/cl_I_div.cc -cln/src/integer/elem/cl_I_equal.cc -cln/src/integer/elem/cl_I_minus.cc -cln/src/integer/elem/cl_I_minus1.cc -cln/src/integer/elem/cl_I_minusp.cc -cln/src/integer/elem/cl_I_mul.cc -cln/src/integer/elem/cl_I_plus.cc -cln/src/integer/elem/cl_I_plus1.cc -cln/src/integer/elem/cl_I_square.cc -cln/src/integer/elem/cl_I_uminus.cc -cln/src/integer/elem/cl_I_zerop.cc -cln/src/integer/gcd/Makeflags -cln/src/integer/gcd/cl_I_gcd.cc -cln/src/integer/gcd/cl_I_gcd_aux.cc -cln/src/integer/gcd/cl_I_gcd_aux2.cc -cln/src/integer/gcd/cl_I_xgcd.cc -cln/src/integer/gcd/cl_low_gcd.cc -cln/src/integer/input/Makeflags -cln/src/integer/input/cl_I_from_string.cc -cln/src/integer/input/cl_I_read.cc -cln/src/integer/input/cl_I_readparsed.cc -cln/src/integer/misc/Makeflags -cln/src/integer/misc/cl_BN_class.cc -cln/src/integer/misc/cl_I_abs.cc -cln/src/integer/misc/cl_I_exptpos_I.cc -cln/src/integer/misc/cl_I_oddp.cc -cln/src/integer/output/Makeflags -cln/src/integer/output/cl_I_aprint.cc -cln/src/integer/output/cl_I_bprint.cc -cln/src/integer/output/cl_I_cprint.cc -cln/src/integer/output/cl_I_decstring.cc -cln/src/integer/output/cl_I_dprint.cc -cln/src/integer/output/cl_I_print.cc -cln/src/integer/output/cl_I_print_string.cc -cln/src/integer/random/Makeflags -cln/src/integer/random/cl_I_random.cc -cln/src/float/Makeflags -cln/src/float/cl_F.h -cln/src/float/cl_float_config.h.in -cln/src/float/base/Makeflags -cln/src/float/base/cl_F_err_nan.cc -cln/src/float/base/cl_F_err_ov.cc -cln/src/float/base/cl_F_err_un.cc -cln/src/float/base/cl_F_globals.cc -cln/src/float/base/cl_ieee.cc -cln/src/float/base/cl_ieee.h -cln/src/float/ffloat/Makeflags -cln/src/float/ffloat/cl_FF.h -cln/src/float/ffloat/elem/Makeflags -cln/src/float/ffloat/elem/cl_FF_globals.cc -cln/src/float/ffloat/misc/Makeflags -cln/src/float/ffloat/misc/cl_FF_class.cc -cln/src/float/dfloat/Makeflags -cln/src/float/dfloat/cl_DF.h -cln/src/float/dfloat/conv/Makeflags -cln/src/float/dfloat/conv/cl_DF_from_double.cc -cln/src/float/dfloat/conv/cl_I_to_double.cc -cln/src/float/dfloat/elem/Makeflags -cln/src/float/dfloat/elem/cl_DF_fround.cc -cln/src/float/dfloat/elem/cl_DF_globals.cc -cln/src/float/dfloat/elem/cl_DF_to_I.cc -cln/src/float/dfloat/misc/Makeflags -cln/src/float/dfloat/misc/cl_DF_class.cc -cln/src/float/lfloat/Makeflags -cln/src/float/lfloat/cl_LF.h -cln/src/float/lfloat/cl_LF_impl.h -cln/src/float/lfloat/elem/Makeflags -cln/src/float/lfloat/elem/cl_LF_globals.cc -cln/src/float/lfloat/misc/Makeflags -cln/src/float/lfloat/misc/cl_LF_class.cc -cln/src/timing/Makeflags -cln/src/timing/cl_t_config.h.in -cln/tests/.gdbinit -cln/tests/Makefile.in diff --git a/lidia-interface/bigint.o.i386-linux b/lidia-interface/bigint.o.i386-linux deleted file mode 100644 index ddd204b821b8c32375cb5a18c68d20cc748d0e6c..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 27412 zcmeHPeSB2anLhatqDF~`3W^XcA`}S;1qG{a_?W0av5tf!ZZ!^*WReU{G9fbqSj);f zu**1&rCqnH?zW|^{ng#t%C6ety6Z+{!M19%bXBUNsoFYi(i&^j)Y4|3=ic|sJ#%OB zfnvLVcz?gibD#6R=RN1V=lh%sw|G`p<>lom{p6_vecvDA)hldjdi9^ZyBZ>a{$NNs&X+D1fedHxsQJ2r6-n@eAQMYs5}>w8jO`rn8jJ2@Sv zaCe>&!Ln!7XOZp8?cJ09zB}80Xs>Dc9b?GHil0mVLGt^4@-s?$72SRLyYs}M+CQk@ zF3*wb1D+$t!NXqkjWyCri|DcJHn{_RcgXVNM!UZ_{>xSVvHUwqem`)1=E{$h7vyNBg8^mC1mm(-$5Ia5RZk#`>FY*Ub&kX2)e z8Cj!pdbrf{M^=4&DE5y@mPeS+IbRynn!Omv7}?Y9kNqo|rO&Zx4E?P6Sf656_3j|mtaM;EZrab%GM8~ ziiUIm@;;=?p4-1!zU&uY!XN4REj~1HW1&6#b9m76YsP$mmCYo((&Ix#n=%(H9A+}@ zO*$%jC1cu~c~tgF|1|dOwQ+rMjjO$%oZR*Qo+Q|0jX!fo; z#`gX&Fjg6lE`Q%S#`fypmpz#;lChHQ?`)Zj)tgeSGx0}nV=xPIGbu~a^!%II0P0e` zZ)oR?IhFP&hU}ijR$))4#(uomn!if64`*_jz+W@N|j8MGDygJ?y1^=f5HF9>R_ z?O4^QIdkWhONfl=JB2CA$*$dzobh0^_V?6pv`aD!4my3}=-SJcV{C81`?iM>%v!rO!UCwm#eyU8)sWSKP zS@ZW*N3PK;pZC%1WTS7MzuD~#KCsujAKA}&Kl0)EN3U;dN|K%_UJU+nwrWjNqjyH< z;OMI2WM1~%a8+?)8v7(~<+p*fEh29BiD8 zb@m@<2PZ3!I16q|7%fD+yzMVUr;L1RojGP~-SV!AmL_MI2Q$VZG%>SpGP2paD`Wn& zj*sm-vh;q@I#0JVZ|@I!Gom1S6oDs#eCO>8F2*%g4X0OD#%UII%VrW8f;Z zuR3P1%QI*k6%LxVGutfB^0RhduVwjbN~XWw_(1-8<0$?0hKkOA_W-+R^n%e{^~>9! zgheX+u>@0Q-(SHW+lOPgFs>yH^Slz5Fy?L+H$gbs9k@NZ%agxWBi~6+XoEhj|>V`tz7=HJw)Cag5C4Olv^jwP3tA)+e|nnI(;|IO~IN<4**aWY9w`2GH zZy>~pn$gveM2H#P?0lUAx&|Az(SycR}KvT015E;Log627o+dR=xY zEZ@BJ46S6X;77kd$v!Wds=r@&iSt~d+SDum3lbX~j^X{;!^6Y1_7@Gmhr6m% z4?z~+S9-WU#j5!SWaF@B;6+agB}HTogmHv*1ztq3-lIG1gCAlHvAtqFucw6cuFLiS zzjXB+$ywRX5y3cbJ>+KC8BdJ<_93h2huC+;ttrut5{{JVVF zo1gvB{=yk5@lvv8FnRj6gVE{R-ie;^?p`YgCnE=ZMHXJQv+z<(zNcMo#YgYdqq%*% zaghBKCkCnCzHE;JAODHf^z5c#3`B{6u7KXUVjr6ok>!(;HL32Q1JcF1S zSum_f`p&^I^@?}nLwOsg#@{QAo?4ymWPMjk{Ym@U3-$PW!?B*eMe+BR-7+iwUip?2 z;_uCm9v6RaL2UA*NB4ToLxsL#!&HgO#-kY5ycm_VzcD6ky;Maj(dh^Dn1=co(8m(F zzhL5KI&+576=p3A2fb2#PNnPqT?^mSJznu#Vt;MxHhk4)XH#22mCL;4zF%(rTPU~Q zg+F$K;Rlswd$K}D|C2Evj;@+cLn-z|KB#q7UQt$F0StEpI{ndb=fxLabWyOqDX_UT z7%6QJwD_aJje#=N5NrvyM;U2^N5{YP(wy-P`--T3MLYe{+Asn)Po`)MYDI zUQ{~wvQO2_D-EqqNdfB-X` z_BcuDhiUP-7(c#al(n8-=zUoegp}IBY8B8dN2pb)tuI3FW${^Z25$fcZe(* zu?|1eUjKT#T(rmXX?qQLH|_oP2=;<5dxM6(6AXJCqiIjq+fLY90j?jW&*u*O%={gJ zy{QPJycj>7zdd-TJ^dVny(O9ewd@qU>pG)&;$p1!_#%(iBO2~kcV4K}u9KBw{8RB` zy37OfX4+d?rPP&11#5dy%XrN2LiOgbDa`yAd$ez+Kwg-h8|`?eHOeQbGsGYzdC;%4 z(DnnlADrdW@>}uFR5ZUA?<}L{Pvf1R@M}JZch;TecuhYAuG|$U*1Yo+ST$#IT6UfS zb+S5>hVjtHlab17aK6tH&ZVG!7=9&qB~Z(2!8;7z;L_g;z6EkM<9J5>JMq2~zte<&7w@|b-i>$tFn>P=?=j@PcpotMZ}DD&2BYmy z#Cs)v+WvIBuQPZB-nZhX^{eo{8^24C7V}q!cl|K^5cmLo+TJaAFF}LU{O`ca!L_|_ zgRe8>kArVD_;cX9z;$}R0`CQ1h_smgAHem)^iP4T1kF;*&jqgpuZN8KtHAX`{WUHg z1m6XH4h7WT2Hp*x5dKY<{(rjoL2xfRSV;5-86RAizW}!M!}N~_?}eOWBGa1%J^+4$ z@MYj$OhlSjf$s*tM&z~NB^dB$3%?P((%`p%cYvQS@}1zj4E{Cn9)mvs&cX2>(cecd z5A*vQ7gxxuekea3d^h52|1SjZ1+RvT<*Rb(*ML`InAt7z^)C5mzy~1bdV%q82QN9% zDbF_;A6(1#fUh&;PlN9?Zv!tyLOT5~yX4;i z?|?jxys$j~<&yuz#a|`IWd3#0=dsUjaBaT`ZB0Kc-&y379eJ5cz8u_Z$k)2$E#SK# z=X#6zyM=NrBsBjA@O1{iAH3V(2f#})m}vc%!MB3nCHCH+9D~E7!iT|o!L|MwX#16? zJA5JdE`whN&c>koR}J_&gEvwx5B(7Z?}mI6-dUbFcqJBQntzdUaOzV2HSivA-JW)X z>xVjzftR2$uf;p{Uj**}*Yn{!jBoJM(AUb(bmWV{cN+W}@BxEw0QaJEZxs7q0M`%G z|CaC-cs~an_xs>I(0>@5`8f!_bGlM@3;!*6`PoW6BK%bJ)dBGNn4_t`5L`dBzY4q* z|E9qsavyj{sgwVkzvgUhpds%<@dcSfd}tF9qKPc{AQAuLLidt5lP4KloN~-M%(}cZ1(1@>{|6 zLwk3Fd*>4z>fc2ECinn2<5E8lW0igwHl2Jv4j%!OF97cVzgc*d zOaFTC0myZIZgRKZt$}ty*`)zpo{+=d?)lv zCH{1b%{>bpdzXOghf%9syvD`bTzspG-{a!7T2;BUE?DfcwJMj^61P^Tzr88k=4%Qx8#({PV&(H)Ag9Xd zw;&U^0&Z%@nOcmeU%uu}#9i(4RfU`g#%oPzgeWzP18Lg!nw5)b+zd#kUzW}aRGK^C z1!}5RCXb!jT}) z@eM76>eKzq(7?ukX)WB;@+A8o#Tk5i{!0Vjl!qHblIKwZQ)4N$5s+-4mSGRqc}Hi zF`KOlH8nU1tXav{-f$BdH}DD{@^5vfbOCS@KDxP1e^YRCy5qrmU~>mM3K}9BwIr@< z2!#uWV$pzaqdycw@r`hYSoLBGBUYogt0f)74z%jU6{f8QmETs<0q}ih0EP@#2(KV~ zP2pGrnk9UJL9Zjs4vGO9?ysn5Y7T|{(e-}xdxg;|){gE0!4kw;RmHf7fp}M#p{^v1 zs)}K7=?L8f|N9m><@ZN0Jm|^}DV+NUn*uJKj!-O8;b^fpG`9NfTxxe9ES4)U(uzA5 zE3T=TGZaP7Qp^z+LNm|O%L?@Q{Ak*eW)P#RK{<9C)EdhT-jpeJTGE|tVBt(I&p3{Y+@PTH=BGQ?}=`FtJr$YdIqAl+YmzRXBg2F$6#4#>9CmO1G8 zd`%l&`N7=T-sq18jMiWqvsPhLLw`xsRru3>t$D(L+#!4scYOvV%5DP+BRS zGqgG_)XO!mZCeEVEXDA!6S2aMIAUW$d)JFYNmfMyfsFE4tCv8tA6?ETTd_zKlY_EJ z@H5V`DxI##>@`aTS2AWyy%01EIMbnOYRH(fjK!0`qoXs7b)jCzsLgKO$Od~AB4u&% z6Vwvhf428j1Umq(n6rluF+x)l=kF! zAy(6tzHVWrhq;rF`kF)jmWZ<7xm4s{4rx0vD_H%8u68Lbl>Btvej3wSiag3rOk%p&5zdJ(Zysb$1jO06bBuTJJfgx*8K4-=vH8zS`h z@0_SNG2hmkOaz}tgx(4w?j(Z3Hwx#s5|r;D;=uQi;E>3t71;7QM8v;bc&lJS@Jk{; zKwO0LbRzOQM1fvM@K)+BEnDeiSX0KMA*4ruv74F z1iJF5$$rdU`X(Df)5hWPM##f{t&SZe#TuE`Q^m0QtO1@N!);YCgCY! zL?ME$zmyn5d4+ES=Alg{1aD_JF0j8sgg+i4ZdU3kBGUVr;3>HKVZ74?&jK>ud?Mmq zN<_X_6A{0Ki1;@PeqQhiA}$Dfg-@Lfz6JM8MCi8?Z$bYO{tyx6KPWsUcpC0@=!Zo_ z`b98C+@RDKh2Jaq3^AhAZ-p1(E{O4#5aFLS!dnIJ0J6My34Vp)DDQWPDDPe(%K0)8 zcHR~|9y0O@Amd*k_(_H%{*^@hZXm*6AtLO2j)-{Q6nt3lDZ#gi@Y`fu&QWi!U=0!e z>lD62@F61ncu;ss@RTzUUWae|h_JIta0Bskm~VvNBlse*PO0AspET8ucRdmMHwpi| z;1k3-O1(z>f>K8$d^WygV0o7lk#3#f4kGIJo5CLvOc7DP$Kmpq`ezAVPDK3%gx@T9 zFA??o-@;!IEIJF}F{REW!pa1Zfrv=ibYr6wT`aUl`Em4X4m4M5iO zM!}mIz6sxe3IAuo?@IWiMAYRo#LY;Dh+om!Hcl5@4y4^G!7CXKyVnsBznutwewGM3 z|3rkHhXj8hcv$eX8IYqKO9X3(&<_g!qu}$zuVS7ReiFuV>UoHW9}wIw;dcq{7yKO& z`71%*XlDTt@mC7g3GN`?jCvRTh+vAi1@%75j(3*e<-}W%zVMp`?;)a{Jtq7)!Mt-2 zj&?hPi1Zf=`iW?_eaj{_23@-aL99Kq{|&g-<=tmX{NepAEzZ zFwY2oLU^z6LBR{>+Im+L5wB734&o*7hwxX4%drk5uE2U1n70S-^YBBw8AQlu6Cs}m zr2G<*-#|p$3=`4DHjDhP$^RYWo`gS2guR1;uK;PMj~se4K5ok|CBoj-MA*9)NIgF} z^x7pnL4>_83*HN)-oKJV@5d58MEpQVL#6f;5%1T;CzX1K_!P!zVBXX4e;N4y;F~t$LG(}J zGl&Pwdlvmd!t)o}dJBoqVO%9bze>XEiHFb*h)DN#BGSD_@H;@J_lV%j4F9Q8uahIc zzb1bk`zMi4DYwI?3C;j=JX}mXjC~aGCG-cumBg2^E+F!qBm{Mws;H|`8V!q5nKJsB#koz`rui#q2YXz?tTqoEh*eVzj -#include -#include -#include -#include -#include -#include - -/* - * The bit operations assume a sign/magnitude representation. (The doc - * seems to indicate this, and this is supported by the fact that libI, - * lip, gmp all work on sign/magnitude representation. Thomas Papanikolaou - * says the contrary, but I think he's not right about this detail.) HB - */ -#define BITOPS_ASSUME_ABS - -/** -** constructors and destructor; we could leave out some of these -**/ - -bigint::bigint() -: I () {} - -bigint::bigint(int i) -: I ((long)i) {} - -bigint::bigint(long l) -: I (l) {} - -bigint::bigint(unsigned long ul) -: I (ul) {} - -bigint::bigint(const cl_I & a) -: I (a) {} - -bigint::bigint(const bigint & a) -: I (a.I) {} - -bigint::~bigint() -{} - -/** -** inline member functions -**/ - -int bigint::bit(unsigned int i) const -{ -#ifdef BITOPS_ASSUME_ABS - if (minusp(I)) - return (int)logbitp(i,-I); - else -#endif - return (int)logbitp(i,I); -} - -lidia_size_t bigint::length() const -{ -#ifdef BITOPS_ASSUME_ABS - if (minusp(I)) - return (integer_length(-I)+intDsize-1)/intDsize; - else -#endif - return (integer_length(I)+intDsize-1)/intDsize; -} - -lidia_size_t bigint::bit_length() const -{ -#ifdef BITOPS_ASSUME_ABS - if (minusp(I)) - return integer_length(-I); - else -#endif - return integer_length(I); -} - -int bigint::sign() const -{ - if (minusp(I)) - return -1; - else if (zerop(I)) - return 0; - else - return 1; -} - -bool bigint::is_positive() const -{ if (!minusp(I)) - if (!zerop(I)) - return (bool)1; - return (bool)0; -} - -bool bigint::is_negative() const -{ return (bool)minusp(I); } - -bool bigint::is_even() const -{ return (bool)evenp(I); } - -bool bigint::is_odd() const -{ return (bool)oddp(I); } - -bool bigint::is_zero() const -{ return (bool)zerop(I); } - -bool bigint::is_gt_zero() const -{ if (!minusp(I)) - if (!zerop(I)) - return (bool)1; - return (bool)0; -} - -bool bigint::is_ge_zero() const -{ return (bool)!minusp(I); } - -bool bigint::is_lt_zero() const -{ return (bool)minusp(I); } - -bool bigint::is_le_zero() const -{ if (!minusp(I)) - if (!zerop(I)) - return (bool)0; - return (bool)1; -} - -bool bigint::is_one() const -{ return (bool)(I == 1); } - - -bool is_odd (const bigint & a) -{ return (bool)oddp(a.I); } - -bool is_even (const bigint & a) -{ return (bool)evenp(a.I); } - -bool is_positive (const bigint & a) -{ - if (!minusp(a.I)) - if (!zerop(a.I)) - return (bool)1; - return (bool)0; -} - -bool is_negative (const bigint & a) -{ return (bool)minusp(a.I); } - -bool is_zero (const bigint & a) -{ return (bool)zerop(a.I); } - -bool is_one (const bigint & a) -{ return (bool)(a.I == 1); } - - - -bool bigint::intify(int & i) const -{ - if (integer_length(I) >= int_bitsize) - return (bool)1; - i = cl_I_to_L(I); - return (bool)0; -} - -bool bigint::longify(long & i) const -{ - if (integer_length(I) >= long_bitsize) - return (bool)1; - i = cl_I_to_long(I); - return (bool)0; -} - -int bigint::abs_compare(const bigint & a) const -{ - return (int)cl_compare(::abs(I),::abs(a.I)); -} - -int bigint::compare(const bigint & a) const -{ - return (int)cl_compare(I,a.I); -} - -unsigned long bigint::most_significant_digit() const -{ - if (zerop(I)) return 0; - cl_I aI = ::abs(I); - return cl_I_to_UL(ldb(aI,cl_byte(intDsize,((integer_length(aI)-1)/intDsize)*intDsize))); -} - -unsigned long bigint::least_significant_digit() const -{ - cl_I aI = ::abs(I); - return cl_I_to_UL(ldb(aI,cl_byte(intDsize,0))); -} - -const double bigint::radix() -{ return ldexp(1.0,intDsize); } - -const int bigint::bits_per_digit() -{ return intDsize; } - -void bigint::absolute_value() -{ if (minusp(I)) { I = -I; } } - -void bigint::abs() -{ if (minusp(I)) { I = -I; } } - -void bigint::negate() -{ I = -I; } - -void bigint::assign_zero() -{ I = 0; } - -void bigint::assign_one() -{ I = 1; } - -void bigint::assign(int i) -{ I = (long)i; } - -void bigint::assign(long i) -{ I = i; } - -void bigint::assign(unsigned long ui) -{ I = ui; } - -void bigint::assign(double d) -{ I = round1((cl_DF)d); } - -void bigint::assign(const bigint & a) -{ I = a.I; } - -void bigint::multiply_by_2() -{ I = ash(I,1); } - -void bigint::divide_by_2() -{ if (minusp(I)) { I = ash(plus1(I),-1); } else { I = ash(I,-1); } } - -/** -** Type checking -**/ - -bool is_char(const bigint & a) -{ if (integer_length(a.I) < char_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_uchar(const bigint & a) -{ if (!minusp(a.I)) - if (integer_length(a.I) <= char_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_short(const bigint & a) -{ if (integer_length(a.I) < short_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_ushort(const bigint & a) -{ if (!minusp(a.I)) - if (integer_length(a.I) <= short_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_int(const bigint & a) -{ if (integer_length(a.I) < int_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_uint(const bigint & a) -{ if (!minusp(a.I)) - if (integer_length(a.I) <= int_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_long(const bigint & a) -{ if (integer_length(a.I) < long_bitsize) - return (bool)1; - return (bool)0; -} - -bool is_ulong(const bigint & a) -{ if (!minusp(a.I)) - if (integer_length(a.I) <= long_bitsize) - return (bool)1; - return (bool)0; -} - -/** -** assignments -**/ - - -int bigint::operator = (int i) -{ I = (long)i; return i; } - -long bigint::operator = (long l) -{ I = l; return l; } - -unsigned long bigint::operator = (unsigned long ul) -{ I = ul; return ul; } - -double bigint::operator = (double d) -{ I = round1((cl_DF)d); return d; } - -bigint & bigint::operator = (const bigint & a) -{ I = a.I; return *this; } - -/** -** comparisons -**/ - -bool operator == (const bigint & a, const bigint & b) -{ return (bool)(a.I == b.I); } - -bool operator != (const bigint & a, const bigint & b) -{ return (bool)(a.I != b.I); } - -bool operator > (const bigint & a, const bigint & b) -{ return (bool)(a.I > b.I); } - -bool operator >= (const bigint & a, const bigint & b) -{ return (bool)(a.I >= b.I); } - -bool operator < (const bigint & a, const bigint & b) -{ return (bool)(a.I < b.I); } - -bool operator <= (const bigint & a, const bigint & b) -{ return (bool)(a.I <= b.I); } - -/** -** operator overloading -**/ - -bigint operator - (const bigint & a) -{ return bigint(-a.I); } - -bigint operator + (const bigint & a, const bigint & b) -{ return bigint(a.I + b.I); } - -bigint operator - (const bigint & a, const bigint & b) -{ return bigint(a.I - b.I); } - -bigint operator * (const bigint & a, const bigint & b) -{ return bigint(a.I * b.I); } - -bigint operator / (const bigint & a, const bigint & b) -{ return bigint(truncate1(a.I,b.I)); } - -bigint operator % (const bigint & a, const bigint & b) -{ return bigint(rem(a.I,b.I)); } - -bigint operator << (const bigint & a, long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "operator<<::index is negative."); - return bigint(ash(a.I,(cl_I)ui)); -} - -bigint operator >> (const bigint & a, long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "operator>>::index is negative."); - return bigint(ash(a.I,-(cl_I)ui)); -} - -bigint operator & (const bigint & a, const bigint & b) -{ return bigint(logand(a.I,b.I)); } - -bigint operator | (const bigint & a, const bigint & b) -{ return bigint(logior(a.I,b.I)); } - -bigint operator ^ (const bigint & a, const bigint & b) -{ return bigint(logxor(a.I,b.I)); } - -bigint & bigint::operator += (const bigint & a) -{ I = I + a.I; return *this; } - -bigint & bigint::operator -= (const bigint & a) -{ I = I - a.I; return *this; } - -bigint & bigint::operator *= (const bigint & a) -{ I = I * a.I; return *this; } - -bigint & bigint::operator /= (const bigint & a) -{ I = truncate1(I,a.I); return *this; } - -bigint & bigint::operator %= (const bigint & a) -{ I = rem(I,a.I); return *this; } - -bigint & bigint::operator <<= (long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "operator<<=::index is negative."); - I = ash(I,(cl_I)ui); - return *this; -} - -bigint & bigint::operator >>= (long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "operator>>=::index is negative."); - I = ash(I,-(cl_I)ui); - return *this; -} - -bigint & bigint::operator &= (const bigint & a) -{ I = logand(I,a.I); return *this; } - -bigint & bigint::operator |= (const bigint & a) -{ I = logior(I,a.I); return *this; } - -bigint & bigint::operator ^= (const bigint & a) -{ I = logxor(I,a.I); return *this; } - -bigint & bigint::operator++ () -{ I = plus1(I); return *this; } - -bigint & bigint::operator-- () -{ I = minus1(I); return *this; } - -bigint bigint::operator++ (int) -{ bigint a = *this; I = plus1(I); return a; } - -bigint bigint::operator-- (int) -{ bigint a = *this; I = minus1(I); return a; } - -int bigint::operator ! () const -{ return (int)zerop(I); } - -bigint bigint::operator ~ () const -{ return bigint(lognot(I)); } - -/** -** Procedural versions -**/ - -void negate(bigint & a, const bigint & b) -{ a.I = -b.I; } - -void add(bigint & c, const bigint & a, const bigint & b) -{ c.I = a.I + b.I; } - -void subtract(bigint & c, const bigint & a, const bigint & b) -{ c.I = a.I - b.I; } - -void multiply(bigint & c, const bigint & a, const bigint & b) -{ c.I = a.I * b.I; } - -void divide(bigint & c, const bigint & a, const bigint & b) -{ c.I = truncate1(a.I,b.I); } - -void remainder(bigint & c, const bigint & a, const bigint & b) -{ c.I = rem(a.I,b.I); } - -void div_rem(bigint & q, bigint & r, const bigint & a, const bigint & b) -{ - cl_I_div_t q_r = truncate2(a.I,b.I); - q.I = q_r.quotient; - r.I = q_r.remainder; -} - -void invert(bigint & a, const bigint & b) -{ - if ((b.I == 1) || (b.I == -1)) - a.I = b.I; - else - lidia_error_handler("bigint", "invert::inverting of a non-unit."); -} - -void shift_left(bigint & c, const bigint & a, long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "shift_left()::index is negative."); - c.I = ash(a.I,(cl_I)ui); -} - -void shift_right(bigint & c, const bigint & a, long ui) -{ - if (ui < 0) - lidia_error_handler("bigint", "shift_right()::index is negative."); - c.I = ash(a.I,-(cl_I)ui); -} - -void power(bigint & c, const bigint & a, const bigint & b) -{ - if ((a.I == 1) || (a.I == -1)) - { - if (b.is_odd()) - c.I = a.I; - else - c.assign_one(); - } - else if (b.is_negative()) - c.assign_zero(); - else if (b.is_zero()) - c.assign_one(); - else - c.I = expt_pos(a.I,b.I); -} - -void power(bigint & c, const bigint & a, long i) -{ - if ((a.I == 1) || (a.I == -1)) - { - if (i&1) - c.I = a.I; - else - c.assign_one(); - } - else if (i < 0) - c.assign_zero(); - else if (i == 0) - c.assign_one(); - else - c.I = expt_pos(a.I,(cl_I)i); -} - -void and(bigint & c, const bigint & a, const bigint & b) -{ c.I = logand(a.I,b.I); } - -void or(bigint & c, const bigint & a, const bigint & b) -{ c.I = logior(a.I,b.I); } - -void xor(bigint & c, const bigint & a, const bigint & b) -{ c.I = logxor(a.I,b.I); } - -void not(bigint & b, const bigint & a) -{ b.I = lognot(a.I); } - -void inc(bigint & c) -{ c.I = plus1(c.I); } - -void dec(bigint & c) -{ c.I = minus1(c.I); } - -void add(bigint & c, const bigint & a, long i) -{ c.I = a.I + i; } - -void subtract(bigint & c, const bigint & a, long i) -{ c.I = a.I - i; } - -void multiply(bigint & c, const bigint & a, long i) -{ c.I = a.I * i; } - -void divide(bigint & c, const bigint & a, long i) -{ c.I = truncate1(a.I,i); } - -void remainder(long &r, const bigint & a, long i) -{ - r = cl_I_to_long(rem(a.I,i)); -} - -long remainder(const bigint & a, long i) -{ - return cl_I_to_long(rem(a.I,i)); -} - -void div_rem(bigint & q, long &r, const bigint & a, long i) -{ - cl_I_div_t q_r = truncate2(a.I,i); - q.I = q_r.quotient; - r = cl_I_to_long(q_r.remainder); -} - -/** -** gcd's -**/ - -bigint gcd(const bigint & a, const bigint & b) -{ return bigint(gcd(a.I,b.I)); } - -bigint bgcd(const bigint & a, const bigint & b) -{ return bigint(gcd(a.I,b.I)); } - -bigint dgcd(const bigint & a, const bigint & b) -{ return bigint(gcd(a.I,b.I)); } - -bigint xgcd(bigint & u, bigint & v, const bigint & a, const bigint & b) -{ -#if 0 - // In the case abs(a) == abs(b), LiDIA wants to have u=0, abs(v)=1. - // But CLN returns abs(u)=1, v=0. Therefore we swap the arguments. - return bigint(xgcd(b.I,a.I,&v.I,&u.I)); -#else - // I think the above special case is unimportant, and it's more important - // to be consistent with xgcd_left and xgcd_right below. - return bigint(xgcd(a.I,b.I,&u.I,&v.I)); -#endif -} - -bigint xgcd_left(bigint & u, const bigint & a, const bigint & b) -{ cl_I v; return bigint(xgcd(a.I,b.I,&u.I,&v)); } - -bigint xgcd_right(bigint & v, const bigint & a, const bigint & b) -{ cl_I u; return bigint(xgcd(a.I,b.I,&u,&v.I)); } - -/** -** functions -**/ - -bigint abs(const bigint & a) -{ return bigint(abs(a.I)); } - -void seed(const bigint & a) -{ - cl_default_random_state.seed.lo = cl_I_to_UL(ldb(a.I,cl_byte(32,0))); - cl_default_random_state.seed.hi = cl_I_to_UL(ldb(a.I,cl_byte(32,32))); -} - -void bigint::randomize(const bigint & a) -{ - if (minusp(a.I)) - *this = bigint(-random_I(-a.I)); - else - *this = bigint(random_I(a.I)); -} - -bigint randomize(const bigint & a) -{ - if (minusp(a.I)) - return bigint(-random_I(-a.I)); - else - return bigint(random_I(a.I)); -} - -double dbl(const bigint & a) -{ return cl_double_approx(a.I); } - -xdouble xdbl(const bigint & a) -{ - double d1 = dbl(a); - bigint a1; a1.assign(d1); - double d2 = dbl(a - a1); - return (xdouble)d1 + (xdouble)d2; -} - -void sqrt(bigint & a, const bigint & b) -{ a.I = isqrt(b.I); } - -void square(bigint & a, const bigint & b) -{ a.I = square(b.I); } - -void swap(bigint & a, bigint & b) -{ - void* tmp = a.I.pointer; - a.I.pointer = b.I.pointer; - b.I.pointer = tmp; -} - -/** -** input / output -**/ - -istream & operator >> (istream & in, bigint & a) -{ - a.scan (in); - return (in); -} - -ostream & operator << (ostream & out, const bigint & a) -{ out << a.I; return out; } - -int string_to_bigint(const char *s, bigint & a) -{ - int n = strlen(s); - char c[n+1]; - for (int i = 0; i < n; i++) - switch (s[i]) - { - case '+': case '-': case '.': - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': - case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G': - case 'H': case 'I': case 'J': case 'K': case 'L': case 'M': case 'N': - case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U': - case 'V': case 'W': case 'X': case 'Y': case 'Z': - case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g': - case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n': - case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u': - case 'v': case 'w': case 'x': case 'y': case 'z': - c[i] = s[i]; break; - default: - c[i] = '\0'; goto eos; - } - c[n] = '\0'; -eos: - n = strlen(c); - if (n == 0) return -1; - a = (bigint)(cl_I)c; return n; -} - -int bigint_to_string(const bigint & a, char *s) -{ - char* r = print_integer_to_string(10,a.I); - strcpy(s,r); - cl_free_hook(r); - return strlen(s); -} - -/** -** using fread/fwrite -**/ - -void bigint::read_from_file(FILE * fp) -{ - scan_from_file(fp); - int c = getc(fp); if (c != EOF && c != '\n') { ungetc(c,fp); } -} - -void bigint::write_to_file(FILE * fp) -{ - print_to_file(fp); - putc('\n',fp); -} - -/** -** using fscanf/fprintf -**/ - -void bigint::scan_from_file(FILE * fp) -{ - cl_spushstring buffer; - int c; - while ((c = getc(fp)) != EOF) - if (!(c=='\n' || c=='\t' || c==' ')) - { ungetc(c,fp); break; } - while ((c = getc(fp)) != EOF) { - switch (c) - { case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': - case '+': case '-': - buffer.push((char)c); break; - default: - ungetc(c,fp); goto end; - } - } -end: - char* s = buffer.contents(); - if (s[0] != '\0') - I = (cl_I)s; - cl_free_hook(s); -} - -void bigint::print_to_file(FILE * fp) -{ - char* s = print_integer_to_string(10,I); - fprintf(fp,"%s",s); - cl_free_hook(s); -} - -/** -** Error handler -**/ - -void cl_abort (void) -{ - lidia_error_handler("cln", "cl_abort() called"); -} - diff --git a/lidia-interface/src/interfaces/integers/cln/bigint_def.h b/lidia-interface/src/interfaces/integers/cln/bigint_def.h deleted file mode 100644 index a799e63..0000000 --- a/lidia-interface/src/interfaces/integers/cln/bigint_def.h +++ /dev/null @@ -1,40 +0,0 @@ -// -// LiDIA - a library for computational number theory -// Copyright (c) 1996 by the LiDIA Group -// -// File : bigint_def.h -// Author : Bruno Haible (HB) -// Last change : HB, 1996-11-17, initial version -// HB, 1998-01-24, change #include to #include "cl_*" -// because the files are in $(LIDIA_HOME)/include/LiDIA, -// and the only -I option is -I$(LIDIA_HOME)/include . -// - -#ifndef LIDIA_BIGINT_DEF_H -#define LIDIA_BIGINT_DEF_H - -/** -** The next include MUST remain in this file in THIS position. -**/ - -#include - -/** -** include here the include file of the C multiple precision integers -** and define integer_type_name to be the integer type we have. Define -** base_digit to -** -** For example write something like -** -** #include "integer_include_file.h" -** #define integer_type_name your_integer_type_name -** -**/ - -#include -#include - -#define integer_type_name cl_I -#define base_digit uintD - -#endif diff --git a/lidia-interface/src/interfaces/integers/cln/makefile b/lidia-interface/src/interfaces/integers/cln/makefile deleted file mode 100644 index 20c250c..0000000 --- a/lidia-interface/src/interfaces/integers/cln/makefile +++ /dev/null @@ -1,69 +0,0 @@ -###################################################################### -# -# Name ................... LiDIA/src/interfaces/integers/cln/makefile -# -# Architecture : unix -# Compiler : gcc, g++ -# Flags : -g -O2 -# Program Flags: -# Author : Thomas Papanikolaou & Bruno Haible -# Release : 1.0 -# Last Change : 1998-01-24 -# Copyright : by the University of Saarland and Bruno Haible, 1996 -# - -# -# include the configuration file -# - -include ../../../../config/CONFIG - -# -# Object -# - -OBJ=bigint.o - -# -# Rules -# - -all: copyh $(libp)LiDIA.a - -appl: bigint_appl$(EXE) - -# -# Dependencies -# - -copyh: - $(CP) bigint_def.h $(LIDIA_HOME)$(DIRSEP)include$(DIRSEP)LiDIA - -bigint.o: bigint.c $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)bigint.h - $(CXX) -c $(CXXFLAGS) -I$(LIDIA_INC) -I$(LIDIA_HOME)$(DIRSEP)src$(DIRSEP)kernel$(DIRSEP)integers$(DIRSEP)cln$(DIRSEP)cln$(DIRSEP)include -I$(LIDIA_HOME)$(DIRSEP)src$(DIRSEP)kernel$(DIRSEP)integers$(DIRSEP)cln $*.c -o $(objp)$*.o - $(NOOMV) $*.o $(objp)$*.o - $(TOUCH) $*.o - -$(libp)LiDIA.a: $(OBJ) - -$(AR) $(LIDIA_LIB)$(DIRSEP)$(libp)LiDIA.a $(objp)*.o - -ranlib: - $(RANLIB) $(LIDIA_LIB)$(DIRSEP)$(libp)LiDIA.a - -bigint_appl$(EXE): bigint_appl.c - $(CXX) $(CXXFLAGS) bigint_appl.c $(CXX-off) -I$(LIDIA_INC) -L$(LIDIA_LIB) -o bigint_appl$(EXE) $(LIB) - -$(MV) bigint_appl$(EXE) $(LIDIA_BIN) - -# -# Clean -# - -clean: - -$(RM) *.o - -veryclean: clean - -$(RM) bigint_appl$(EXE) - -# -# End Of Makefile -# diff --git a/lidia-interface/src/kernel/integers/cln/README b/lidia-interface/src/kernel/integers/cln/README deleted file mode 100644 index 3c6799f..0000000 --- a/lidia-interface/src/kernel/integers/cln/README +++ /dev/null @@ -1,17 +0,0 @@ -LiDIA has an abstract interface to the underlying long integer implementation. -Using CLN instead of the default libI, lip or gmp has the following -advantages: - - - Maximum speed on all CPUs, since CLN is based on the highly - optimized gmp-2.0.2. - - - Very large integers profit from CLN's Schönhage-Strassen FFT multiplication - (asymptotic bit complexity: O(N log N log log N)). - - - Copying integers is fast: no copying is actually involved, only a - reference count is manipulated. - - - Small integers (absolute value < 2^29) are represented immediately, - thus no memory allocation/deallocation is involved when dealing with - small integers. - diff --git a/lidia-interface/src/kernel/integers/cln/cln/README.LiDIA b/lidia-interface/src/kernel/integers/cln/cln/README.LiDIA deleted file mode 100644 index 3b1756e..0000000 --- a/lidia-interface/src/kernel/integers/cln/cln/README.LiDIA +++ /dev/null @@ -1,6 +0,0 @@ -This directory contains a special version of CLN, trimmed down for LiDIA. -It was prepared from CLN version 1.0, found on ftp://ftp.santafe.edu/pub/gnu/, -by - 1. removing many unnecessary files (including many source files, the test - suite and the documentation), - 2. adding the file README.LiDIA diff --git a/lidia-interface/src/kernel/integers/cln/makefile b/lidia-interface/src/kernel/integers/cln/makefile deleted file mode 100755 index 4d4462e..0000000 --- a/lidia-interface/src/kernel/integers/cln/makefile +++ /dev/null @@ -1,178 +0,0 @@ -###################################################################### -# -# Name ............................... LiDIA/src/kernel/cln/makefile -# -# Architecture : unix -# Compiler : gcc, g++ -# Flags : -g -O2 -fno-exceptions -# Program Flags: -# Author : Markus Maurer, Bruno Haible -# Release : 1.0 -# Last Change : 1998-12-13 -# Copyright : by the University of Saarland and Bruno Haible, 1998 -# - -# -# include the configuration file -# - -include ../../../../config/CONFIG - -# -# Dependencies -# - - -default: library - -c: library - -sparc: library - -sparc7: library - -sparc8: library - -mips: library - -i386: library - -i486: library - -i586: library - -i686: library - -hppa1.1: library - - - - -# -# library and application files -# - -library: cln$(DIRSEP)include$(DIRSEP)cl_config.h cln$(DIRSEP)include$(DIRSEP)cl_intparam.h - cd cln$(DIRSEP)gmp $(SEP) $(MAKE) mpn/libmpn.la mp_clz_tab.lo - cd cln$(DIRSEP)src $(SEP) $(MAKE) - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_abort.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_complex_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_config.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_dfloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_dfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_ffloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_ffloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_float.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_float_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_floatformat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_floatparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_input.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_intparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_lfloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_lfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_malloc.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_modules.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_number.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_number_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_object.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_output.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_random.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_rational_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_real_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_sfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_string.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_types.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)src$(DIRSEP)base$(DIRSEP)cl_spushstring.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)src$(DIRSEP)base$(DIRSEP)cl_sstring.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)gmp.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)gmp-impl.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)longlong.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)mpn$(DIRSEP)gmp-mparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - $(SHELL) cln$(DIRSEP)libtool --mode=install cp cln$(DIRSEP)src$(DIRSEP)libcln.la `pwd`$(DIRSEP)libcln.la - $(ARX) libcln.a - $(AR) $(LIDIA_LIB)$(DIRSEP)$(libp)LiDIA.a *.o - $(RM) *.o - $(RM) libcln.a - $(TOUCH) library - - -ranlib: - $(RANLIB) $(LIDIA_LIB)$(DIRSEP)$(libp)LiDIA.a - -appl: -# cd cln $(SEP) $(MAKE) check - - - -# -# Configuration command -# - - -configure: - cd cln $(SEP) CC="$(CC)" CFLAGS="$(CFLAGS) -fno-exceptions" CXX="$(CXX)" CXXFLAGS="$(CXXFLAGS) -fno-exceptions" .$(DIRSEP)configure --target=$(LIDIA_ARCH) - - - -# -# Installation commands -# - -install: installh - -installh: - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_abort.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_complex_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_config.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_dfloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_dfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_ffloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_ffloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_float.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_float_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_floatformat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_floatparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_input.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_integer_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_intparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_lfloat.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_lfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_malloc.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_modules.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_number.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_number_io.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_object.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_output.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_random.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_rational_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_real_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_sfloat_class.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_string.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)include$(DIRSEP)cl_types.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)src$(DIRSEP)base$(DIRSEP)cl_spushstring.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)src$(DIRSEP)base$(DIRSEP)cl_sstring.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)gmp.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)gmp-impl.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)longlong.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - -$(CP) cln$(DIRSEP)gmp$(DIRSEP)mpn$(DIRSEP)gmp-mparam.h $(LIDIA_INC)$(DIRSEP)LiDIA$(DIRSEP)kernel - - -# -# Clean -# - -clean: - -cd cln $(SEP) make clean - -$(RM) library - - -veryclean: clean - -