-/* Copyright (C) 1995,1996,1997,1998, 1999 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 software; see the file COPYING. If not, write to
- * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
- * Boston, MA 02111-1307 USA
- *
- * As a special exception, the Free Software Foundation gives permission
- * for additional uses of the text contained in its release of GUILE.
- *
- * The exception is that, if you link the GUILE library with other files
- * to produce an executable, this does not by itself cause the
- * resulting executable to be covered by the GNU General Public License.
- * Your use of that executable is in no way restricted on account of
- * linking the GUILE library code into it.
- *
- * This exception does not however invalidate any other reasons why
- * the executable file might be covered by the GNU General Public License.
- *
- * This exception applies only to the code released by the
- * Free Software Foundation under the name GUILE. If you copy
- * code from other Free Software Foundation releases into a copy of
- * GUILE, as the General Public License permits, the exception does
- * not apply to the code that you add in this way. To avoid misleading
- * anyone as to the status of such modified files, you must delete
- * this exception notice from them.
- *
- * If you write modifications of your own for GUILE, it is your choice
- * whether to permit this exception to apply to your modifications.
- * If you do not wish that, delete this exception notice. */
-
-/* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
- gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
-
-\f
-
-#include <stdio.h>
-#include <math.h>
-#include "_scm.h"
-#include "genio.h"
-#include "unif.h"
-#include "feature.h"
-#include "smob.h"
-
-#include "scm_validate.h"
-#include "numbers.h"
-\f
-#define DIGITS '0':case '1':case '2':case '3':case '4':\
- case '5':case '6':case '7':case '8':case '9'
-
-
-/* IS_INF tests its floating point number for infiniteness
- */
-#ifndef IS_INF
-#define IS_INF(x) ((x) == (x) / 2)
-#endif
-
-/* Return true if X is not infinite and is not a NaN
- */
-#ifndef isfinite
-#define isfinite(x) (!IS_INF (x) && (x) == (x))
-#endif
-
-/* MAXEXP is the maximum double precision expontent
- * FLTMAX is less than or scm_equal the largest single precision float
- */
-
-#ifdef SCM_FLOATS
-#ifdef STDC_HEADERS
-#ifndef GO32
-#include <float.h>
-#endif /* ndef GO32 */
-#endif /* def STDC_HEADERS */
-#ifdef DBL_MAX_10_EXP
-#define MAXEXP DBL_MAX_10_EXP
-#else
-#define MAXEXP 308 /* IEEE doubles */
-#endif /* def DBL_MAX_10_EXP */
-#ifdef FLT_MAX
-#define FLTMAX FLT_MAX
-#else
-#define FLTMAX 1e+23
-#endif /* def FLT_MAX */
-#endif /* def SCM_FLOATS */
-\f
-
-
-GUILE_PROC (scm_exact_p, "exact?", 1, 0, 0,
- (SCM x),
-"")
-#define FUNC_NAME s_scm_exact_p
-{
- if (SCM_INUMP (x))
- return SCM_BOOL_T;
-#ifdef SCM_BIGDIG
- if (SCM_NIMP (x) && SCM_BIGP (x))
- return SCM_BOOL_T;
-#endif
- return SCM_BOOL_F;
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_odd_p, "odd?", 1, 0, 0,
- (SCM n),
-"")
-#define FUNC_NAME s_scm_odd_p
-{
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (n))
- {
- SCM_VALIDATE_BIGINT(1,n);
- return SCM_BOOL(1 & SCM_BDIGITS (n)[0]);
- }
-#else
- SCM_VALIDATE_INT(1,n);
-#endif
- return SCM_BOOL(4 & (int) n);
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_even_p, "even?", 1, 0, 0,
- (SCM n),
-"")
-#define FUNC_NAME s_scm_even_p
-{
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (n))
- {
- SCM_VALIDATE_BIGINT(1,n);
- return SCM_NEGATE_BOOL(1 & SCM_BDIGITS (n)[0]);
- }
-#else
- SCM_VALIDATE_INT(1,n);
-#endif
- return SCM_NEGATE_BOOL(4 & (int) n);
-}
-#undef FUNC_NAME
-
-SCM_GPROC (s_abs, "abs", 1, 0, 0, scm_abs, g_abs);
-
-SCM
-scm_abs (SCM x)
-{
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT1 (SCM_NIMP (x) && SCM_BIGP (x), g_abs, x, SCM_ARG1, s_abs);
- if (SCM_TYP16 (x) == scm_tc16_bigpos)
- return x;
- return scm_copybig (x, 0);
- }
-#else
- SCM_GASSERT1 (SCM_INUMP (x), g_abs, x, SCM_ARG1, s_abs);
-#endif
- if (SCM_INUM (x) >= 0)
- return x;
- x = - SCM_INUM (x);
- if (!SCM_POSFIXABLE (x))
-#ifdef SCM_BIGDIG
- return scm_long2big (x);
-#else
- scm_num_overflow (s_abs);
-#endif
- return SCM_MAKINUM (x);
-}
-
-SCM_GPROC (s_quotient, "quotient", 2, 0, 0, scm_quotient, g_quotient);
-
-SCM
-scm_quotient (SCM x, SCM y)
-{
- register long z;
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- long w;
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_quotient, x, y, SCM_ARG1, s_quotient);
- if (SCM_NINUMP (y))
- {
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y), 2);
- }
- z = SCM_INUM (y);
- SCM_ASRTGO (z, ov);
- if (1 == z)
- return x;
- if (z < 0)
- z = -z;
- if (z < SCM_BIGRAD)
- {
- w = scm_copybig (x, SCM_BIGSIGN (x) ? (y > 0) : (y < 0));
- scm_divbigdig (SCM_BDIGITS (w), SCM_NUMDIGS (w), (SCM_BIGDIG) z);
- return scm_normbig (w);
- }
-#ifndef SCM_DIGSTOOBIG
- w = scm_pseudolong (z);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- (SCM_BIGDIG *) & w, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 2);
-#else
- {
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (z, zdigs);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- zdigs, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 2);
- }
-#endif
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_quotient, x, y, SCM_ARG2, s_quotient);
- }
- return SCM_INUM0;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_quotient, x, y, SCM_ARG1, s_quotient);
- SCM_GASSERT2 (SCM_INUMP (y), g_quotient, x, y, SCM_ARG2, s_quotient);
-#endif
- if ((z = SCM_INUM (y)) == 0)
- {
- ov:
- scm_num_overflow (s_quotient);
- }
- z = SCM_INUM (x) / z;
-#ifdef BADIVSGNS
- {
-#if (__TURBOC__ == 1)
- long t = ((y < 0) ? -SCM_INUM (x) : SCM_INUM (x)) % SCM_INUM (y);
-#else
- long t = SCM_INUM (x) % SCM_INUM (y);
-#endif
- if (t == 0);
- else if (t < 0)
- if (x < 0);
- else
- z--;
- else if (x < 0)
- z++;
- }
-#endif
- if (!SCM_FIXABLE (z))
-#ifdef SCM_BIGDIG
- return scm_long2big (z);
-#else
- scm_num_overflow (s_quotient);
-#endif
- return SCM_MAKINUM (z);
-}
-
-SCM_GPROC (s_remainder, "remainder", 2, 0, 0, scm_remainder, g_remainder);
-
-SCM
-scm_remainder (SCM x, SCM y)
-{
- register long z;
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_remainder, x, y, SCM_ARG1, s_remainder);
- if (SCM_NINUMP (y))
- {
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x), 0);
- }
- if (!(z = SCM_INUM (y)))
- goto ov;
- return scm_divbigint (x, z, SCM_BIGSIGN (x), 0);
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_remainder, x, y, SCM_ARG2, s_remainder);
- }
- return x;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_remainder, x, y, SCM_ARG1, s_remainder);
- SCM_GASSERT2 (SCM_INUMP (y), g_remainder, x, y, SCM_ARG2, s_remainder);
-#endif
- if (!(z = SCM_INUM (y)))
- {
- ov:
- scm_num_overflow (s_remainder);
- }
-#if (__TURBOC__ == 1)
- if (z < 0)
- z = -z;
-#endif
- z = SCM_INUM (x) % z;
-#ifdef BADIVSGNS
- if (!z);
- else if (z < 0)
- if (x < 0);
- else
- z += SCM_INUM (y);
- else if (x < 0)
- z -= SCM_INUM (y);
-#endif
- return SCM_MAKINUM (z);
-}
-
-SCM_GPROC (s_modulo, "modulo", 2, 0, 0, scm_modulo, g_modulo);
-
-SCM
-scm_modulo (SCM x, SCM y)
-{
- register long yy, z;
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_modulo, x, y, SCM_ARG1, s_modulo);
- if (SCM_NINUMP (y))
- {
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y),
- (SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y)) ? 1 : 0);
- }
- if (!(z = SCM_INUM (y)))
- goto ov;
- return scm_divbigint (x, z, y < 0,
- (SCM_BIGSIGN (x) ? (y > 0) : (y < 0)) ? 1 : 0);
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_modulo, x, y, SCM_ARG2, s_modulo);
- }
- return (SCM_BIGSIGN (y) ? (x > 0) : (x < 0)) ? scm_sum (x, y) : x;
- }
-#else
- SCM_GASSERT1 (SCM_INUMP (x), g_modulo, x, y, SCM_ARG1, s_modulo);
- SCM_GASSERT2 (SCM_INUMP (y), g_modulo, x, y, SCM_ARG2, s_modulo);
-#endif
- if (!(yy = SCM_INUM (y)))
- {
- ov:
- scm_num_overflow (s_modulo);
- }
-#if (__TURBOC__==1)
- z = SCM_INUM (x);
- z = ((yy < 0) ? -z : z) % yy;
-#else
- z = SCM_INUM (x) % yy;
-#endif
- return SCM_MAKINUM (((yy < 0) ? (z > 0) : (z < 0)) ? z + yy : z);
-}
-
-SCM_GPROC1 (s_gcd, "gcd", scm_tc7_asubr, scm_gcd, g_gcd);
-
-SCM
-scm_gcd (SCM x, SCM y)
-{
- register long u, v, k, t;
- if (SCM_UNBNDP (y))
- return SCM_UNBNDP (x) ? SCM_INUM0 : x;
- tailrec:
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- big_gcd:
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_gcd, x, y, SCM_ARG1, s_gcd);
- if (SCM_BIGSIGN (x))
- x = scm_copybig (x, 0);
- newy:
- if (SCM_NINUMP (y))
- {
- SCM_GASSERT2 (SCM_NIMP (y) && SCM_BIGP (y),
- g_gcd, x, y, SCM_ARGn, s_gcd);
- if (SCM_BIGSIGN (y))
- y = scm_copybig (y, 0);
- switch (scm_bigcomp (x, y))
- {
- case -1:
- swaprec:
- t = scm_remainder (x, y);
- x = y;
- y = t;
- goto tailrec;
- case 0:
- return x;
- case 1:
- y = scm_remainder (y, x);
- goto newy;
- }
- /* instead of the switch, we could just
- return scm_gcd (y, scm_modulo (x, y)); */
- }
- if (SCM_INUM0 == y)
- return x;
- goto swaprec;
- }
- if (SCM_NINUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto big_gcd;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_gcd, x, y, SCM_ARG1, s_gcd);
- SCM_GASSERT2 (SCM_INUMP (y), g_gcd, x, y, SCM_ARGn, s_gcd);
-#endif
- u = SCM_INUM (x);
- if (u < 0)
- u = -u;
- v = SCM_INUM (y);
- if (v < 0)
- v = -v;
- else if (0 == v)
- goto getout;
- if (0 == u)
- {
- u = v;
- goto getout;
- }
- for (k = 1; !(1 & ((int) u | (int) v)); k <<= 1, u >>= 1, v >>= 1);
- if (1 & (int) u)
- t = -v;
- else
- {
- t = u;
- b3:
- t = SCM_SRS (t, 1);
- }
- if (!(1 & (int) t))
- goto b3;
- if (t > 0)
- u = t;
- else
- v = -t;
- if ((t = u - v))
- goto b3;
- u = u * k;
- getout:
- if (!SCM_POSFIXABLE (u))
-#ifdef SCM_BIGDIG
- return scm_long2big (u);
-#else
- scm_num_overflow (s_gcd);
-#endif
- return SCM_MAKINUM (u);
-}
-
-SCM_GPROC1 (s_lcm, "lcm", scm_tc7_asubr, scm_lcm, g_lcm);
-
-SCM
-scm_lcm (SCM n1, SCM n2)
-{
- SCM d;
-#ifndef SCM_BIGDIG
- SCM_GASSERT2 (SCM_INUMP (n1) || SCM_UNBNDP (n1),
- g_lcm, n1, n2, SCM_ARG1, s_lcm);
- SCM_GASSERT2 (SCM_INUMP (n2) || SCM_UNBNDP (n2),
- g_lcm, n1, n2, SCM_ARGn, s_lcm);
-#else
- SCM_GASSERT2 (SCM_INUMP (n1)
- || SCM_UNBNDP (n1)
- || (SCM_NIMP (n1) && SCM_BIGP (n1)),
- g_lcm, n1, n2, SCM_ARG1, s_lcm);
- SCM_GASSERT2 (SCM_INUMP (n2)
- || SCM_UNBNDP (n2)
- || (SCM_NIMP (n2) && SCM_BIGP (n2)),
- g_lcm, n1, n2, SCM_ARGn, s_lcm);
-#endif
- if (SCM_UNBNDP (n2))
- {
- n2 = SCM_MAKINUM (1L);
- if (SCM_UNBNDP (n1))
- return n2;
- }
-
- d = scm_gcd (n1, n2);
- if (SCM_INUM0 == d)
- return d;
- return scm_abs (scm_product (n1, scm_quotient (n2, d)));
-}
-
-#ifndef SCM_BIGDIG
-#ifndef SCM_FLOATS
-#define scm_long2num SCM_MAKINUM
-#endif
-#endif
-
-#ifndef scm_long2num
-GUILE_PROC1 (scm_logand, "logand", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logand
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_MAKINUM (-1);
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return scm_ulong2num (i1 & i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC1 (scm_logior, "logior", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logior
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_INUM0;
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return scm_ulong2num (i1 | i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC1 (scm_logxor, "logxor", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logxor
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_INUM0;
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return scm_ulong2num (i1 ^ i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_logtest, "logtest", 2, 0, 0,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logtest
-{
- int i1, i2;
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_BOOL(i1 & i2);
-}
-#undef FUNC_NAME
-
-
-GUILE_PROC (scm_logbit_p, "logbit?", 2, 0, 0,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logbit_p
-{
- int i1, i2;
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_BOOL((1 << i1) & i2);
-}
-#undef FUNC_NAME
-
-#else
-
-GUILE_PROC1 (scm_logand, "logand", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logand
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_MAKINUM (-1);
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_MAKINUM (i1 & i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC1 (scm_logior, "logior", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logior
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_INUM0;
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_MAKINUM (i1 | i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC1 (scm_logxor, "logxor", scm_tc7_asubr,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logxor
-{
- int i1, i2;
- if (SCM_UNBNDP (n2))
- {
- if (SCM_UNBNDP (n1))
- return SCM_INUM0;
- return n1;
- }
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_MAKINUM (i1 ^ i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_logtest, "logtest", 2, 0, 0,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logtest
-{
- int i1, i2;
- SCM_VALIDATE_INT_COPY(1,n1,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_BOOL(i1 & i2);
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_logbit_p, "logbit?", 2, 0, 0,
- (SCM n1, SCM n2),
-"")
-#define FUNC_NAME s_scm_logbit_p
-{
- int i1, i2;
- SCM_VALIDATE_INT_MIN_COPY(1,n1,0,i1);
- SCM_VALIDATE_INT_COPY(2,n2,i2);
- return SCM_BOOL((1 << i1) & i2);
-}
-#undef FUNC_NAME
-#endif
-
-GUILE_PROC (scm_lognot, "lognot", 1, 0, 0,
- (SCM n),
-"")
-#define FUNC_NAME s_scm_lognot
-{
- SCM_VALIDATE_INT(1,n);
- return scm_difference (SCM_MAKINUM (-1L), n);
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_integer_expt, "integer-expt", 2, 0, 0,
- (SCM z1, SCM z2),
-"")
-#define FUNC_NAME s_scm_integer_expt
-{
- SCM acc = SCM_MAKINUM (1L);
- int i2;
-#ifdef SCM_BIGDIG
- if (SCM_INUM0 == z1 || acc == z1)
- return z1;
- else if (SCM_MAKINUM (-1L) == z1)
- return SCM_BOOL_F == scm_even_p (z2) ? z1 : acc;
-#endif
- SCM_VALIDATE_INT_COPY(2,z2,i2);
- if (i2 < 0)
- {
- i2 = -i2;
- z1 = scm_divide (z1, SCM_UNDEFINED);
- }
- while (1)
- {
- if (0 == i2)
- return acc;
- if (1 == i2)
- return scm_product (acc, z1);
- if (i2 & 1)
- acc = scm_product (acc, z1);
- z1 = scm_product (z1, z1);
- i2 >>= 1;
- }
-}
-#undef FUNC_NAME
-
-GUILE_PROC (scm_ash, "ash", 2, 0, 0,
- (SCM n, SCM cnt),
-"")
-#define FUNC_NAME s_scm_ash
-{
- /* GJB:FIXME:: what is going on here? */
- SCM res = SCM_INUM (n);
- SCM_VALIDATE_INT(2,cnt);
-#ifdef SCM_BIGDIG
- if (cnt < 0)
- {
- res = scm_integer_expt (SCM_MAKINUM (2), SCM_MAKINUM (-SCM_INUM (cnt)));
- if (SCM_NFALSEP (scm_negative_p (n)))
- return scm_sum (SCM_MAKINUM (-1L),
- scm_quotient (scm_sum (SCM_MAKINUM (1L), n), res));
- else
- return scm_quotient (n, res);
- }
- else
- return scm_product (n, scm_integer_expt (SCM_MAKINUM (2), cnt));
-#else
- SCM_VALIDATE_INT(1,n)
- cnt = SCM_INUM (cnt);
- if (cnt < 0)
- return SCM_MAKINUM (SCM_SRS (res, -cnt));
- res = SCM_MAKINUM (res << cnt);
- if (SCM_INUM (res) >> cnt != SCM_INUM (n))
- scm_num_overflow (FUNC_NAME);
- return res;
-#endif
-}
-#undef FUNC_NAME
-
-/* GJB:FIXME: do not use SCMs as integers! */
-GUILE_PROC (scm_bit_extract, "bit-extract", 3, 0, 0,
- (SCM n, SCM start, SCM end),
-"")
-#define FUNC_NAME s_scm_bit_extract
-{
- SCM_VALIDATE_INT(1,n);
- SCM_VALIDATE_INT_MIN(2,start,0);
- SCM_VALIDATE_INT_MIN(3,end,0);
- start = SCM_INUM (start);
- end = SCM_INUM (end);
- SCM_ASSERT (end >= start, SCM_MAKINUM (end), SCM_OUTOFRANGE, FUNC_NAME);
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (n))
- return
- scm_logand (scm_difference (scm_integer_expt (SCM_MAKINUM (2),
- SCM_MAKINUM (end - start)),
- SCM_MAKINUM (1L)),
- scm_ash (n, SCM_MAKINUM (-start)));
-#else
- SCM_VALIDATE_INT(1,n);
-#endif
- return SCM_MAKINUM ((SCM_INUM (n) >> start) & ((1L << (end - start)) - 1));
-}
-#undef FUNC_NAME
-
-static const char scm_logtab[] = {
- 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
-};
-
-GUILE_PROC (scm_logcount, "logcount", 1, 0, 0,
- (SCM n),
-"")
-#define FUNC_NAME s_scm_logcount
-{
- register unsigned long c = 0;
- register long nn;
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (n))
- {
- scm_sizet i;
- SCM_BIGDIG *ds, d;
- SCM_VALIDATE_BIGINT(1,n);
- if (SCM_BIGSIGN (n))
- return scm_logcount (scm_difference (SCM_MAKINUM (-1L), n));
- ds = SCM_BDIGITS (n);
- for (i = SCM_NUMDIGS (n); i--;)
- for (d = ds[i]; d; d >>= 4)
- c += scm_logtab[15 & d];
- return SCM_MAKINUM (c);
- }
-#else
- SCM_VALIDATE_INT(1,n);
-#endif
- if ((nn = SCM_INUM (n)) < 0)
- nn = -1 - nn;
- for (; nn; nn >>= 4)
- c += scm_logtab[15 & nn];
- return SCM_MAKINUM (c);
-}
-#undef FUNC_NAME
-
-
-static const char scm_ilentab[] = {
- 0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4
-};
-
-GUILE_PROC (scm_integer_length, "integer-length", 1, 0, 0,
- (SCM n),
-"")
-#define FUNC_NAME s_scm_integer_length
-{
- register unsigned long c = 0;
- register long nn;
- unsigned int l = 4;
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (n))
- {
- SCM_BIGDIG *ds, d;
- SCM_VALIDATE_BIGINT(1,n);
- if (SCM_BIGSIGN (n))
- return scm_integer_length (scm_difference (SCM_MAKINUM (-1L), n));
- ds = SCM_BDIGITS (n);
- d = ds[c = SCM_NUMDIGS (n) - 1];
- for (c *= SCM_BITSPERDIG; d; d >>= 4)
- {
- c += 4;
- l = scm_ilentab[15 & d];
- }
- return SCM_MAKINUM (c - 4 + l);
- }
-#else
- SCM_VALIDATE_INT(1,n);
-#endif
- if ((nn = SCM_INUM (n)) < 0)
- nn = -1 - nn;
- for (; nn; nn >>= 4)
- {
- c += 4;
- l = scm_ilentab[15 & nn];
- }
- return SCM_MAKINUM (c - 4 + l);
-}
-#undef FUNC_NAME
-
-
-#ifdef SCM_BIGDIG
-static const char s_bignum[] = "bignum";
-
-SCM
-scm_mkbig (scm_sizet nlen, int sign)
-{
- SCM v = nlen;
- /* Cast to SCM to avoid signed/unsigned comparison warnings. */
- if (((v << 16) >> 16) != (SCM) nlen)
- scm_wta (SCM_MAKINUM (nlen), (char *) SCM_NALLOC, s_bignum);
- SCM_NEWCELL (v);
- SCM_DEFER_INTS;
- SCM_SETCHARS (v, scm_must_malloc ((long) (nlen * sizeof (SCM_BIGDIG)),
- s_bignum));
- SCM_SETNUMDIGS (v, nlen, sign ? scm_tc16_bigneg : scm_tc16_bigpos);
- SCM_ALLOW_INTS;
- return v;
-}
-
-
-SCM
-scm_big2inum (SCM b, scm_sizet l)
-{
- unsigned long num = 0;
- SCM_BIGDIG *tmp = SCM_BDIGITS (b);
- while (l--)
- num = SCM_BIGUP (num) + tmp[l];
- if (SCM_TYP16 (b) == scm_tc16_bigpos)
- {
- if (SCM_POSFIXABLE (num))
- return SCM_MAKINUM (num);
- }
- else if (SCM_UNEGFIXABLE (num))
- return SCM_MAKINUM (-num);
- return b;
-}
-
-
-static const char s_adjbig[] = "scm_adjbig";
-
-SCM
-scm_adjbig (SCM b, scm_sizet nlen)
-{
- scm_sizet nsiz = nlen;
- if (((nsiz << 16) >> 16) != nlen)
- scm_wta (scm_ulong2num (nsiz), (char *) SCM_NALLOC, s_adjbig);
-
- SCM_DEFER_INTS;
- {
- SCM_BIGDIG *digits
- = ((SCM_BIGDIG *)
- scm_must_realloc ((char *) SCM_CHARS (b),
- (long) (SCM_NUMDIGS (b) * sizeof (SCM_BIGDIG)),
- (long) (nsiz * sizeof (SCM_BIGDIG)), s_adjbig));
-
- SCM_SETCHARS (b, digits);
- SCM_SETNUMDIGS (b, nsiz, SCM_TYP16 (b));
- }
- SCM_ALLOW_INTS;
- return b;
-}
-
-
-
-SCM
-scm_normbig (SCM b)
-{
-#ifndef _UNICOS
- scm_sizet nlen = SCM_NUMDIGS (b);
-#else
- int nlen = SCM_NUMDIGS (b); /* unsigned nlen breaks on Cray when nlen => 0 */
-#endif
- SCM_BIGDIG *zds = SCM_BDIGITS (b);
- while (nlen-- && !zds[nlen]);
- nlen++;
- if (nlen * SCM_BITSPERDIG / SCM_CHAR_BIT <= sizeof (SCM))
- if (SCM_INUMP (b = scm_big2inum (b, (scm_sizet) nlen)))
- return b;
- if (SCM_NUMDIGS (b) == nlen)
- return b;
- return scm_adjbig (b, (scm_sizet) nlen);
-}
-
-
-
-SCM
-scm_copybig (SCM b, int sign)
-{
- scm_sizet i = SCM_NUMDIGS (b);
- SCM ans = scm_mkbig (i, sign);
- SCM_BIGDIG *src = SCM_BDIGITS (b), *dst = SCM_BDIGITS (ans);
- while (i--)
- dst[i] = src[i];
- return ans;
-}
-
-
-
-SCM
-scm_long2big (long n)
-{
- scm_sizet i = 0;
- SCM_BIGDIG *digits;
- SCM ans = scm_mkbig (SCM_DIGSPERLONG, n < 0);
- digits = SCM_BDIGITS (ans);
- if (n < 0)
- n = -n;
- while (i < SCM_DIGSPERLONG)
- {
- digits[i++] = SCM_BIGLO (n);
- n = SCM_BIGDN ((unsigned long) n);
- }
- return ans;
-}
-
-#ifdef HAVE_LONG_LONGS
-
-SCM
-scm_long_long2big (long_long n)
-{
- scm_sizet i;
- SCM_BIGDIG *digits;
- SCM ans;
- int n_digits;
-
- {
- long tn;
- tn = (long) n;
- if ((long long) tn == n)
- return scm_long2big (tn);
- }
-
- {
- long_long tn;
-
- for (tn = n, n_digits = 0;
- tn;
- ++n_digits, tn = SCM_BIGDN ((ulong_long) tn))
- ;
- }
-
- i = 0;
- ans = scm_mkbig (n_digits, n < 0);
- digits = SCM_BDIGITS (ans);
- if (n < 0)
- n = -n;
- while (i < n_digits)
- {
- digits[i++] = SCM_BIGLO (n);
- n = SCM_BIGDN ((ulong_long) n);
- }
- return ans;
-}
-#endif
-
-
-SCM
-scm_2ulong2big (unsigned long *np)
-{
- unsigned long n;
- scm_sizet i;
- SCM_BIGDIG *digits;
- SCM ans;
-
- ans = scm_mkbig (2 * SCM_DIGSPERLONG, 0);
- digits = SCM_BDIGITS (ans);
-
- n = np[0];
- for (i = 0; i < SCM_DIGSPERLONG; ++i)
- {
- digits[i] = SCM_BIGLO (n);
- n = SCM_BIGDN ((unsigned long) n);
- }
- n = np[1];
- for (i = 0; i < SCM_DIGSPERLONG; ++i)
- {
- digits[i + SCM_DIGSPERLONG] = SCM_BIGLO (n);
- n = SCM_BIGDN ((unsigned long) n);
- }
- return ans;
-}
-
-
-
-SCM
-scm_ulong2big (unsigned long n)
-{
- scm_sizet i = 0;
- SCM_BIGDIG *digits;
- SCM ans = scm_mkbig (SCM_DIGSPERLONG, 0);
- digits = SCM_BDIGITS (ans);
- while (i < SCM_DIGSPERLONG)
- {
- digits[i++] = SCM_BIGLO (n);
- n = SCM_BIGDN (n);
- }
- return ans;
-}
-
-
-
-int
-scm_bigcomp (SCM x, SCM y)
-{
- int xsign = SCM_BIGSIGN (x);
- int ysign = SCM_BIGSIGN (y);
- scm_sizet xlen, ylen;
-
- /* Look at the signs, first. */
- if (ysign < xsign)
- return 1;
- if (ysign > xsign)
- return -1;
-
- /* They're the same sign, so see which one has more digits. Note
- that, if they are negative, the longer number is the lesser. */
- ylen = SCM_NUMDIGS (y);
- xlen = SCM_NUMDIGS (x);
- if (ylen > xlen)
- return (xsign) ? -1 : 1;
- if (ylen < xlen)
- return (xsign) ? 1 : -1;
-
- /* They have the same number of digits, so find the most significant
- digit where they differ. */
- while (xlen)
- {
- --xlen;
- if (SCM_BDIGITS (y)[xlen] != SCM_BDIGITS (x)[xlen])
- /* Make the discrimination based on the digit that differs. */
- return ((SCM_BDIGITS (y)[xlen] > SCM_BDIGITS (x)[xlen])
- ? (xsign ? -1 : 1)
- : (xsign ? 1 : -1));
- }
-
- /* The numbers are identical. */
- return 0;
-}
-
-#ifndef SCM_DIGSTOOBIG
-
-
-long
-scm_pseudolong (long x)
-{
- union
- {
- long l;
- SCM_BIGDIG bd[SCM_DIGSPERLONG];
- }
- p;
- scm_sizet i = 0;
- if (x < 0)
- x = -x;
- while (i < SCM_DIGSPERLONG)
- {
- p.bd[i++] = SCM_BIGLO (x);
- x = SCM_BIGDN (x);
- }
- /* p.bd[0] = SCM_BIGLO(x); p.bd[1] = SCM_BIGDN(x); */
- return p.l;
-}
-
-#else
-
-
-void
-scm_longdigs (long x, SCM_BIGDIG digs[])
-{
- scm_sizet i = 0;
- if (x < 0)
- x = -x;
- while (i < SCM_DIGSPERLONG)
- {
- digs[i++] = SCM_BIGLO (x);
- x = SCM_BIGDN (x);
- }
-}
-#endif
-
-
-
-SCM
-scm_addbig (SCM_BIGDIG *x, scm_sizet nx, int xsgn, SCM bigy, int sgny)
-{
- /* Assumes nx <= SCM_NUMDIGS(bigy) */
- /* Assumes xsgn and sgny scm_equal either 0 or 0x0100 */
- long num = 0;
- scm_sizet i = 0, ny = SCM_NUMDIGS (bigy);
- SCM z = scm_copybig (bigy, SCM_BIGSIGN (bigy) ^ sgny);
- SCM_BIGDIG *zds = SCM_BDIGITS (z);
- if (xsgn ^ SCM_BIGSIGN (z))
- {
- do
- {
- num += (long) zds[i] - x[i];
- if (num < 0)
- {
- zds[i] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[i] = SCM_BIGLO (num);
- num = 0;
- }
- }
- while (++i < nx);
- if (num && nx == ny)
- {
- num = 1;
- i = 0;
- SCM_SETCAR (z, SCM_CAR (z) ^ 0x0100);
- do
- {
- num += (SCM_BIGRAD - 1) - zds[i];
- zds[i++] = SCM_BIGLO (num);
- num = SCM_BIGDN (num);
- }
- while (i < ny);
- }
- else
- while (i < ny)
- {
- num += zds[i];
- if (num < 0)
- {
- zds[i++] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[i++] = SCM_BIGLO (num);
- num = 0;
- }
- }
- }
- else
- {
- do
- {
- num += (long) zds[i] + x[i];
- zds[i++] = SCM_BIGLO (num);
- num = SCM_BIGDN (num);
- }
- while (i < nx);
- if (!num)
- return z;
- while (i < ny)
- {
- num += zds[i];
- zds[i++] = SCM_BIGLO (num);
- num = SCM_BIGDN (num);
- if (!num)
- return z;
- }
- if (num)
- {
- z = scm_adjbig (z, ny + 1);
- SCM_BDIGITS (z)[ny] = num;
- return z;
- }
- }
- return scm_normbig (z);
-}
-
-
-SCM
-scm_mulbig (SCM_BIGDIG *x, scm_sizet nx, SCM_BIGDIG *y, scm_sizet ny, int sgn)
-{
- scm_sizet i = 0, j = nx + ny;
- unsigned long n = 0;
- SCM z = scm_mkbig (j, sgn);
- SCM_BIGDIG *zds = SCM_BDIGITS (z);
- while (j--)
- zds[j] = 0;
- do
- {
- j = 0;
- if (x[i])
- {
- do
- {
- n += zds[i + j] + ((unsigned long) x[i] * y[j]);
- zds[i + j++] = SCM_BIGLO (n);
- n = SCM_BIGDN (n);
- }
- while (j < ny);
- if (n)
- {
- zds[i + j] = n;
- n = 0;
- }
- }
- }
- while (++i < nx);
- return scm_normbig (z);
-}
-
-
-/* Sun's compiler complains about the fact that this function has an
- ANSI prototype in numbers.h, but a K&R declaration here, and the
- two specify different promotions for the third argument. I'm going
- to turn this into an ANSI declaration, and see if anyone complains
- about it not being K&R. */
-
-unsigned int
-scm_divbigdig (SCM_BIGDIG * ds,
- scm_sizet h,
- SCM_BIGDIG div)
-{
- register unsigned long t2 = 0;
- while (h--)
- {
- t2 = SCM_BIGUP (t2) + ds[h];
- ds[h] = t2 / div;
- t2 %= div;
- }
- return t2;
-}
-
-
-
-SCM
-scm_divbigint (SCM x, long z, int sgn, int mode)
-{
- if (z < 0)
- z = -z;
- if (z < SCM_BIGRAD)
- {
- register unsigned long t2 = 0;
- register SCM_BIGDIG *ds = SCM_BDIGITS (x);
- scm_sizet nd = SCM_NUMDIGS (x);
- while (nd--)
- t2 = (SCM_BIGUP (t2) + ds[nd]) % z;
- if (mode && t2)
- t2 = z - t2;
- return SCM_MAKINUM (sgn ? -t2 : t2);
- }
- {
-#ifndef SCM_DIGSTOOBIG
- unsigned long t2 = scm_pseudolong (z);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- (SCM_BIGDIG *) & t2, SCM_DIGSPERLONG,
- sgn, mode);
-#else
- SCM_BIGDIG t2[SCM_DIGSPERLONG];
- scm_longdigs (z, t2);
- return scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- t2, SCM_DIGSPERLONG,
- sgn, mode);
-#endif
- }
-}
-
-
-SCM
-scm_divbigbig (SCM_BIGDIG *x, scm_sizet nx, SCM_BIGDIG *y, scm_sizet ny, int sgn, int modes)
-{
- /* modes description
- 0 remainder
- 1 scm_modulo
- 2 quotient
- 3 quotient but returns 0 if division is not exact. */
- scm_sizet i = 0, j = 0;
- long num = 0;
- unsigned long t2 = 0;
- SCM z, newy;
- SCM_BIGDIG d = 0, qhat, *zds, *yds;
- /* algorithm requires nx >= ny */
- if (nx < ny)
- switch (modes)
- {
- case 0: /* remainder -- just return x */
- z = scm_mkbig (nx, sgn);
- zds = SCM_BDIGITS (z);
- do
- {
- zds[i] = x[i];
- }
- while (++i < nx);
- return z;
- case 1: /* scm_modulo -- return y-x */
- z = scm_mkbig (ny, sgn);
- zds = SCM_BDIGITS (z);
- do
- {
- num += (long) y[i] - x[i];
- if (num < 0)
- {
- zds[i] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[i] = num;
- num = 0;
- }
- }
- while (++i < nx);
- while (i < ny)
- {
- num += y[i];
- if (num < 0)
- {
- zds[i++] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[i++] = num;
- num = 0;
- }
- }
- goto doadj;
- case 2:
- return SCM_INUM0; /* quotient is zero */
- case 3:
- return 0; /* the division is not exact */
- }
-
- z = scm_mkbig (nx == ny ? nx + 2 : nx + 1, sgn);
- zds = SCM_BDIGITS (z);
- if (nx == ny)
- zds[nx + 1] = 0;
- while (!y[ny - 1])
- ny--; /* in case y came in as a psuedolong */
- if (y[ny - 1] < (SCM_BIGRAD >> 1))
- { /* normalize operands */
- d = SCM_BIGRAD / (y[ny - 1] + 1);
- newy = scm_mkbig (ny, 0);
- yds = SCM_BDIGITS (newy);
- while (j < ny)
- {
- t2 += (unsigned long) y[j] * d;
- yds[j++] = SCM_BIGLO (t2);
- t2 = SCM_BIGDN (t2);
- }
- y = yds;
- j = 0;
- t2 = 0;
- while (j < nx)
- {
- t2 += (unsigned long) x[j] * d;
- zds[j++] = SCM_BIGLO (t2);
- t2 = SCM_BIGDN (t2);
- }
- zds[j] = t2;
- }
- else
- {
- zds[j = nx] = 0;
- while (j--)
- zds[j] = x[j];
- }
- j = nx == ny ? nx + 1 : nx; /* dividend needs more digits than divisor */
- do
- { /* loop over digits of quotient */
- if (zds[j] == y[ny - 1])
- qhat = SCM_BIGRAD - 1;
- else
- qhat = (SCM_BIGUP (zds[j]) + zds[j - 1]) / y[ny - 1];
- if (!qhat)
- continue;
- i = 0;
- num = 0;
- t2 = 0;
- do
- { /* multiply and subtract */
- t2 += (unsigned long) y[i] * qhat;
- num += zds[j - ny + i] - SCM_BIGLO (t2);
- if (num < 0)
- {
- zds[j - ny + i] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[j - ny + i] = num;
- num = 0;
- }
- t2 = SCM_BIGDN (t2);
- }
- while (++i < ny);
- num += zds[j - ny + i] - t2; /* borrow from high digit; don't update */
- while (num)
- { /* "add back" required */
- i = 0;
- num = 0;
- qhat--;
- do
- {
- num += (long) zds[j - ny + i] + y[i];
- zds[j - ny + i] = SCM_BIGLO (num);
- num = SCM_BIGDN (num);
- }
- while (++i < ny);
- num--;
- }
- if (modes & 2)
- zds[j] = qhat;
- }
- while (--j >= ny);
- switch (modes)
- {
- case 3: /* check that remainder==0 */
- for (j = ny; j && !zds[j - 1]; --j);
- if (j)
- return 0;
- case 2: /* move quotient down in z */
- j = (nx == ny ? nx + 2 : nx + 1) - ny;
- for (i = 0; i < j; i++)
- zds[i] = zds[i + ny];
- ny = i;
- break;
- case 1: /* subtract for scm_modulo */
- i = 0;
- num = 0;
- j = 0;
- do
- {
- num += y[i] - zds[i];
- j = j | zds[i];
- if (num < 0)
- {
- zds[i] = num + SCM_BIGRAD;
- num = -1;
- }
- else
- {
- zds[i] = num;
- num = 0;
- }
- }
- while (++i < ny);
- if (!j)
- return SCM_INUM0;
- case 0: /* just normalize remainder */
- if (d)
- scm_divbigdig (zds, ny, d);
- }
- doadj:
- for (j = ny; j && !zds[j - 1]; --j);
- if (j * SCM_BITSPERDIG <= sizeof (SCM) * SCM_CHAR_BIT)
- if (SCM_INUMP (z = scm_big2inum (z, j)))
- return z;
- return scm_adjbig (z, j);
-}
-#endif
-\f
-
-
-
-
-/*** NUMBERS -> STRINGS ***/
-#ifdef SCM_FLOATS
-int scm_dblprec;
-static const double fx[] =
-{ 0.0, 5e-1, 5e-2, 5e-3, 5e-4, 5e-5,
- 5e-6, 5e-7, 5e-8, 5e-9, 5e-10,
- 5e-11, 5e-12, 5e-13, 5e-14, 5e-15,
- 5e-16, 5e-17, 5e-18, 5e-19, 5e-20};
-
-
-
-
-static scm_sizet
-idbl2str (double f, char *a)
-{
- int efmt, dpt, d, i, wp = scm_dblprec;
- scm_sizet ch = 0;
- int exp = 0;
-
- if (f == 0.0)
- goto zero; /*{a[0]='0'; a[1]='.'; a[2]='0'; return 3;} */
- if (f < 0.0)
- {
- f = -f;
- a[ch++] = '-';
- }
- else if (f > 0.0);
- else
- goto funny;
- if (IS_INF (f))
- {
- if (ch == 0)
- a[ch++] = '+';
- funny:
- a[ch++] = '#';
- a[ch++] = '.';
- a[ch++] = '#';
- return ch;
- }
-#ifdef DBL_MIN_10_EXP /* Prevent unnormalized values, as from
- make-uniform-vector, from causing infinite loops. */
- while (f < 1.0)
- {
- f *= 10.0;
- if (exp-- < DBL_MIN_10_EXP)
- goto funny;
- }
- while (f > 10.0)
- {
- f *= 0.10;
- if (exp++ > DBL_MAX_10_EXP)
- goto funny;
- }
-#else
- while (f < 1.0)
- {
- f *= 10.0;
- exp--;
- }
- while (f > 10.0)
- {
- f /= 10.0;
- exp++;
- }
-#endif
- if (f + fx[wp] >= 10.0)
- {
- f = 1.0;
- exp++;
- }
- zero:
-#ifdef ENGNOT
- dpt = (exp + 9999) % 3;
- exp -= dpt++;
- efmt = 1;
-#else
- efmt = (exp < -3) || (exp > wp + 2);
- if (!efmt)
- {
- if (exp < 0)
- {
- a[ch++] = '0';
- a[ch++] = '.';
- dpt = exp;
- while (++dpt)
- a[ch++] = '0';
- }
- else
- dpt = exp + 1;
- }
- else
- dpt = 1;
-#endif
-
- do
- {
- d = f;
- f -= d;
- a[ch++] = d + '0';
- if (f < fx[wp])
- break;
- if (f + fx[wp] >= 1.0)
- {
- a[ch - 1]++;
- break;
- }
- f *= 10.0;
- if (!(--dpt))
- a[ch++] = '.';
- }
- while (wp--);
-
- if (dpt > 0)
- {
-#ifndef ENGNOT
- if ((dpt > 4) && (exp > 6))
- {
- d = (a[0] == '-' ? 2 : 1);
- for (i = ch++; i > d; i--)
- a[i] = a[i - 1];
- a[d] = '.';
- efmt = 1;
- }
- else
-#endif
- {
- while (--dpt)
- a[ch++] = '0';
- a[ch++] = '.';
- }
- }
- if (a[ch - 1] == '.')
- a[ch++] = '0'; /* trailing zero */
- if (efmt && exp)
- {
- a[ch++] = 'e';
- if (exp < 0)
- {
- exp = -exp;
- a[ch++] = '-';
- }
- for (i = 10; i <= exp; i *= 10);
- for (i /= 10; i; i /= 10)
- {
- a[ch++] = exp / i + '0';
- exp %= i;
- }
- }
- return ch;
-}
-
-
-static scm_sizet
-iflo2str (SCM flt, char *str)
-{
- scm_sizet i;
-#ifdef SCM_SINGLES
- if (SCM_SINGP (flt))
- i = idbl2str (SCM_FLO (flt), str);
- else
-#endif
- i = idbl2str (SCM_REAL (flt), str);
- if (SCM_CPLXP (flt))
- {
- if (0 <= SCM_IMAG (flt)) /* jeh */
- str[i++] = '+'; /* jeh */
- i += idbl2str (SCM_IMAG (flt), &str[i]);
- str[i++] = 'i';
- }
- return i;
-}
-#endif /* SCM_FLOATS */
-
-/* convert a long to a string (unterminated). returns the number of
- characters in the result.
- rad is output base
- p is destination: worst case (base 2) is SCM_INTBUFLEN */
-scm_sizet
-scm_iint2str (long num, int rad, char *p)
-{
- scm_sizet j = 1;
- scm_sizet i;
- unsigned long n = (num < 0) ? -num : num;
-
- for (n /= rad; n > 0; n /= rad)
- j++;
-
- i = j;
- if (num < 0)
- {
- *p++ = '-';
- j++;
- n = -num;
- }
- else
- n = num;
- while (i--)
- {
- int d = n % rad;
-
- n /= rad;
- p[i] = d + ((d < 10) ? '0' : 'a' - 10);
- }
- return j;
-}
-
-
-#ifdef SCM_BIGDIG
-
-static SCM
-big2str (SCM b, unsigned int radix)
-{
- SCM t = scm_copybig (b, 0); /* sign of temp doesn't matter */
- register SCM_BIGDIG *ds = SCM_BDIGITS (t);
- scm_sizet i = SCM_NUMDIGS (t);
- scm_sizet j = radix == 16 ? (SCM_BITSPERDIG * i) / 4 + 2
- : radix >= 10 ? (SCM_BITSPERDIG * i * 241L) / 800 + 2
- : (SCM_BITSPERDIG * i) + 2;
- scm_sizet k = 0;
- scm_sizet radct = 0;
- scm_sizet ch; /* jeh */
- SCM_BIGDIG radpow = 1, radmod = 0;
- SCM ss = scm_makstr ((long) j, 0);
- char *s = SCM_CHARS (ss), c;
- while ((long) radpow * radix < SCM_BIGRAD)
- {
- radpow *= radix;
- radct++;
- }
- s[0] = scm_tc16_bigneg == SCM_TYP16 (b) ? '-' : '+';
- while ((i || radmod) && j)
- {
- if (k == 0)
- {
- radmod = (SCM_BIGDIG) scm_divbigdig (ds, i, radpow);
- k = radct;
- if (!ds[i - 1])
- i--;
- }
- c = radmod % radix;
- radmod /= radix;
- k--;
- s[--j] = c < 10 ? c + '0' : c + 'a' - 10;
- }
- ch = s[0] == '-' ? 1 : 0; /* jeh */
- if (ch < j)
- { /* jeh */
- for (i = j; j < SCM_LENGTH (ss); j++)
- s[ch + j - i] = s[j]; /* jeh */
- scm_vector_set_length_x (ss, /* jeh */
- (SCM) SCM_MAKINUM (ch + SCM_LENGTH (ss) - i));
- }
-
- return scm_return_first (ss, t);
-}
-#endif
-
-
-GUILE_PROC (scm_number_to_string, "number->string", 1, 1, 0,
- (SCM x, SCM radix),
-"")
-#define FUNC_NAME s_scm_number_to_string
-{
- int base;
- SCM_VALIDATE_INT_MIN_DEF_COPY(2,radix,2,10,base);
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
- char num_buf[SCM_FLOBUFLEN];
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (x), badx);
- if (SCM_BIGP (x))
- return big2str (x, (unsigned int) base);
-#ifndef SCM_RECKLESS
- if (!(SCM_INEXP (x)))
- {
- badx:
- scm_wta (x, (char *) SCM_ARG1, FUNC_NAME);
- }
-#endif
-#else
- SCM_ASSERT (SCM_NIMP (x) && SCM_INEXP (x),
- x, SCM_ARG1, s_number_to_string);
-#endif
- return scm_makfromstr (num_buf, iflo2str (x, num_buf), 0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_ASSERT (SCM_NIMP (x) && SCM_BIGP (x),
- x, SCM_ARG1, s_number_to_string);
- return big2str (x, (unsigned int) base);
- }
-#else
- SCM_ASSERT (SCM_INUMP (x), x, SCM_ARG1, s_number_to_string);
-#endif
-#endif
- {
- char num_buf[SCM_INTBUFLEN];
- return scm_makfromstr (num_buf,
- scm_iint2str (SCM_INUM (x),
- base,
- num_buf),
- 0);
- }
-}
-#undef FUNC_NAME
-
-
-/* These print routines are stubbed here so that scm_repl.c doesn't need
- SCM_FLOATS or SCM_BIGDIGs conditionals */
-
-int
-scm_floprint (SCM sexp, SCM port, scm_print_state *pstate)
-{
-#ifdef SCM_FLOATS
- char num_buf[SCM_FLOBUFLEN];
- scm_lfwrite (num_buf, iflo2str (sexp, num_buf), port);
-#else
- scm_ipruk ("float", sexp, port);
-#endif
- return !0;
-}
-
-
-
-int
-scm_bigprint (SCM exp, SCM port, scm_print_state *pstate)
-{
-#ifdef SCM_BIGDIG
- exp = big2str (exp, (unsigned int) 10);
- scm_lfwrite (SCM_CHARS (exp), (scm_sizet) SCM_LENGTH (exp), port);
-#else
- scm_ipruk ("bignum", exp, port);
-#endif
- return !0;
-}
-/*** END nums->strs ***/
-
-/*** STRINGS -> NUMBERS ***/
-
-static SCM
-scm_small_istr2int (char *str, long len, long radix)
-{
- register long n = 0, ln;
- register int c;
- register int i = 0;
- int lead_neg = 0;
- if (0 >= len)
- return SCM_BOOL_F; /* zero scm_length */
- switch (*str)
- { /* leading sign */
- case '-':
- lead_neg = 1;
- case '+':
- if (++i == len)
- return SCM_BOOL_F; /* bad if lone `+' or `-' */
- }
-
- do
- {
- switch (c = str[i++])
- {
- case DIGITS:
- c = c - '0';
- goto accumulate;
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- c = c - 'A' + 10;
- goto accumulate;
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- c = c - 'a' + 10;
- accumulate:
- if (c >= radix)
- return SCM_BOOL_F; /* bad digit for radix */
- ln = n;
- n = n * radix - c;
- /* Negation is a workaround for HP700 cc bug */
- if (n > ln || (-n > -SCM_MOST_NEGATIVE_FIXNUM))
- goto ovfl;
- break;
- default:
- return SCM_BOOL_F; /* not a digit */
- }
- }
- while (i < len);
- if (!lead_neg)
- if ((n = -n) > SCM_MOST_POSITIVE_FIXNUM)
- goto ovfl;
- return SCM_MAKINUM (n);
- ovfl: /* overflow scheme integer */
- return SCM_BOOL_F;
-}
-
-
-
-SCM
-scm_istr2int (char *str, long len, long radix)
-{
- scm_sizet j;
- register scm_sizet k, blen = 1;
- scm_sizet i = 0;
- int c;
- SCM res;
- register SCM_BIGDIG *ds;
- register unsigned long t2;
-
- if (0 >= len)
- return SCM_BOOL_F; /* zero scm_length */
-
- /* Short numbers we parse directly into an int, to avoid the overhead
- of creating a bignum. */
- if (len < 6)
- return scm_small_istr2int (str, len, radix);
-
- if (16 == radix)
- j = 1 + (4 * len * sizeof (char)) / (SCM_BITSPERDIG);
- else if (10 <= radix)
- j = 1 + (84 * len * sizeof (char)) / (SCM_BITSPERDIG * 25);
- else
- j = 1 + (len * sizeof (char)) / (SCM_BITSPERDIG);
- switch (str[0])
- { /* leading sign */
- case '-':
- case '+':
- if (++i == (unsigned) len)
- return SCM_BOOL_F; /* bad if lone `+' or `-' */
- }
- res = scm_mkbig (j, '-' == str[0]);
- ds = SCM_BDIGITS (res);
- for (k = j; k--;)
- ds[k] = 0;
- do
- {
- switch (c = str[i++])
- {
- case DIGITS:
- c = c - '0';
- goto accumulate;
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- c = c - 'A' + 10;
- goto accumulate;
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- c = c - 'a' + 10;
- accumulate:
- if (c >= radix)
- return SCM_BOOL_F; /* bad digit for radix */
- k = 0;
- t2 = c;
- moretodo:
- while (k < blen)
- {
-/* printf ("k = %d, blen = %d, t2 = %ld, ds[k] = %d\n", k, blen, t2, ds[k]); */
- t2 += ds[k] * radix;
- ds[k++] = SCM_BIGLO (t2);
- t2 = SCM_BIGDN (t2);
- }
- if (blen > j)
- scm_num_overflow ("bignum");
- if (t2)
- {
- blen++;
- goto moretodo;
- }
- break;
- default:
- return SCM_BOOL_F; /* not a digit */
- }
- }
- while (i < (unsigned) len);
- if (blen * SCM_BITSPERDIG / SCM_CHAR_BIT <= sizeof (SCM))
- if (SCM_INUMP (res = scm_big2inum (res, blen)))
- return res;
- if (j == blen)
- return res;
- return scm_adjbig (res, blen);
-}
-
-#ifdef SCM_FLOATS
-
-SCM
-scm_istr2flo (char *str, long len, long radix)
-{
- register int c, i = 0;
- double lead_sgn;
- double res = 0.0, tmp = 0.0;
- int flg = 0;
- int point = 0;
- SCM second;
-
- if (i >= len)
- return SCM_BOOL_F; /* zero scm_length */
-
- switch (*str)
- { /* leading sign */
- case '-':
- lead_sgn = -1.0;
- i++;
- break;
- case '+':
- lead_sgn = 1.0;
- i++;
- break;
- default:
- lead_sgn = 0.0;
- }
- if (i == len)
- return SCM_BOOL_F; /* bad if lone `+' or `-' */
-
- if (str[i] == 'i' || str[i] == 'I')
- { /* handle `+i' and `-i' */
- if (lead_sgn == 0.0)
- return SCM_BOOL_F; /* must have leading sign */
- if (++i < len)
- return SCM_BOOL_F; /* `i' not last character */
- return scm_makdbl (0.0, lead_sgn);
- }
- do
- { /* check initial digits */
- switch (c = str[i])
- {
- case DIGITS:
- c = c - '0';
- goto accum1;
- case 'D':
- case 'E':
- case 'F':
- if (radix == 10)
- goto out1; /* must be exponent */
- case 'A':
- case 'B':
- case 'C':
- c = c - 'A' + 10;
- goto accum1;
- case 'd':
- case 'e':
- case 'f':
- if (radix == 10)
- goto out1;
- case 'a':
- case 'b':
- case 'c':
- c = c - 'a' + 10;
- accum1:
- if (c >= radix)
- return SCM_BOOL_F; /* bad digit for radix */
- res = res * radix + c;
- flg = 1; /* res is valid */
- break;
- default:
- goto out1;
- }
- }
- while (++i < len);
- out1:
-
- /* if true, then we did see a digit above, and res is valid */
- if (i == len)
- goto done;
-
- /* By here, must have seen a digit,
- or must have next char be a `.' with radix==10 */
- if (!flg)
- if (!(str[i] == '.' && radix == 10))
- return SCM_BOOL_F;
-
- while (str[i] == '#')
- { /* optional sharps */
- res *= radix;
- if (++i == len)
- goto done;
- }
-
- if (str[i] == '/')
- {
- while (++i < len)
- {
- switch (c = str[i])
- {
- case DIGITS:
- c = c - '0';
- goto accum2;
- case 'A':
- case 'B':
- case 'C':
- case 'D':
- case 'E':
- case 'F':
- c = c - 'A' + 10;
- goto accum2;
- case 'a':
- case 'b':
- case 'c':
- case 'd':
- case 'e':
- case 'f':
- c = c - 'a' + 10;
- accum2:
- if (c >= radix)
- return SCM_BOOL_F;
- tmp = tmp * radix + c;
- break;
- default:
- goto out2;
- }
- }
- out2:
- if (tmp == 0.0)
- return SCM_BOOL_F; /* `slash zero' not allowed */
- if (i < len)
- while (str[i] == '#')
- { /* optional sharps */
- tmp *= radix;
- if (++i == len)
- break;
- }
- res /= tmp;
- goto done;
- }
-
- if (str[i] == '.')
- { /* decimal point notation */
- if (radix != 10)
- return SCM_BOOL_F; /* must be radix 10 */
- while (++i < len)
- {
- switch (c = str[i])
- {
- case DIGITS:
- point--;
- res = res * 10.0 + c - '0';
- flg = 1;
- break;
- default:
- goto out3;
- }
- }
- out3:
- if (!flg)
- return SCM_BOOL_F; /* no digits before or after decimal point */
- if (i == len)
- goto adjust;
- while (str[i] == '#')
- { /* ignore remaining sharps */
- if (++i == len)
- goto adjust;
- }
- }
-
- switch (str[i])
- { /* exponent */
- case 'd':
- case 'D':
- case 'e':
- case 'E':
- case 'f':
- case 'F':
- case 'l':
- case 'L':
- case 's':
- case 'S':
- {
- int expsgn = 1, expon = 0;
- if (radix != 10)
- return SCM_BOOL_F; /* only in radix 10 */
- if (++i == len)
- return SCM_BOOL_F; /* bad exponent */
- switch (str[i])
- {
- case '-':
- expsgn = (-1);
- case '+':
- if (++i == len)
- return SCM_BOOL_F; /* bad exponent */
- }
- if (str[i] < '0' || str[i] > '9')
- return SCM_BOOL_F; /* bad exponent */
- do
- {
- switch (c = str[i])
- {
- case DIGITS:
- expon = expon * 10 + c - '0';
- if (expon > MAXEXP)
- return SCM_BOOL_F; /* exponent too large */
- break;
- default:
- goto out4;
- }
- }
- while (++i < len);
- out4:
- point += expsgn * expon;
- }
- }
-
- adjust:
- if (point >= 0)
- while (point--)
- res *= 10.0;
- else
-#ifdef _UNICOS
- while (point++)
- res *= 0.1;
-#else
- while (point++)
- res /= 10.0;
-#endif
-
- done:
- /* at this point, we have a legitimate floating point result */
- if (lead_sgn == -1.0)
- res = -res;
- if (i == len)
- return scm_makdbl (res, 0.0);
-
- if (str[i] == 'i' || str[i] == 'I')
- { /* pure imaginary number */
- if (lead_sgn == 0.0)
- return SCM_BOOL_F; /* must have leading sign */
- if (++i < len)
- return SCM_BOOL_F; /* `i' not last character */
- return scm_makdbl (0.0, res);
- }
-
- switch (str[i++])
- {
- case '-':
- lead_sgn = -1.0;
- break;
- case '+':
- lead_sgn = 1.0;
- break;
- case '@':
- { /* polar input for complex number */
- /* get a `real' for scm_angle */
- second = scm_istr2flo (&str[i], (long) (len - i), radix);
- if (!(SCM_NIMP (second) && SCM_INEXP (second)))
- return SCM_BOOL_F; /* not `real' */
- if (SCM_CPLXP (second))
- return SCM_BOOL_F; /* not `real' */
- tmp = SCM_REALPART (second);
- return scm_makdbl (res * cos (tmp), res * sin (tmp));
- }
- default:
- return SCM_BOOL_F;
- }
-
- /* at this point, last char must be `i' */
- if (str[len - 1] != 'i' && str[len - 1] != 'I')
- return SCM_BOOL_F;
- /* handles `x+i' and `x-i' */
- if (i == (len - 1))
- return scm_makdbl (res, lead_sgn);
- /* get a `ureal' for complex part */
- second = scm_istr2flo (&str[i], (long) ((len - i) - 1), radix);
- if (! (SCM_NIMP (second) && SCM_INEXP (second)))
- return SCM_BOOL_F; /* not `ureal' */
- if (SCM_CPLXP (second))
- return SCM_BOOL_F; /* not `ureal' */
- tmp = SCM_REALPART (second);
- if (tmp < 0.0)
- return SCM_BOOL_F; /* not `ureal' */
- return scm_makdbl (res, (lead_sgn * tmp));
-}
-#endif /* SCM_FLOATS */
-
-
-
-SCM
-scm_istring2number (char *str, long len, long radix)
-{
- int i = 0;
- char ex = 0;
- char ex_p = 0, rx_p = 0; /* Only allow 1 exactness and 1 radix prefix */
- SCM res;
- if (len == 1)
- if (*str == '+' || *str == '-') /* Catches lone `+' and `-' for speed */
- return SCM_BOOL_F;
-
- while ((len - i) >= 2 && str[i] == '#' && ++i)
- switch (str[i++])
- {
- case 'b':
- case 'B':
- if (rx_p++)
- return SCM_BOOL_F;
- radix = 2;
- break;
- case 'o':
- case 'O':
- if (rx_p++)
- return SCM_BOOL_F;
- radix = 8;
- break;
- case 'd':
- case 'D':
- if (rx_p++)
- return SCM_BOOL_F;
- radix = 10;
- break;
- case 'x':
- case 'X':
- if (rx_p++)
- return SCM_BOOL_F;
- radix = 16;
- break;
- case 'i':
- case 'I':
- if (ex_p++)
- return SCM_BOOL_F;
- ex = 2;
- break;
- case 'e':
- case 'E':
- if (ex_p++)
- return SCM_BOOL_F;
- ex = 1;
- break;
- default:
- return SCM_BOOL_F;
- }
-
- switch (ex)
- {
- case 1:
- return scm_istr2int (&str[i], len - i, radix);
- case 0:
- res = scm_istr2int (&str[i], len - i, radix);
- if (SCM_NFALSEP (res))
- return res;
-#ifdef SCM_FLOATS
- case 2:
- return scm_istr2flo (&str[i], len - i, radix);
-#endif
- }
- return SCM_BOOL_F;
-}
-
-
-GUILE_PROC (scm_string_to_number, "string->number", 1, 1, 0,
- (SCM str, SCM radix),
-"")
-#define FUNC_NAME s_scm_string_to_number
-{
- SCM answer;
- int base;
- SCM_VALIDATE_ROSTRING(1,str);
- SCM_VALIDATE_INT_MIN_DEF_COPY(2,radix,2,10,base);
- answer = scm_istring2number (SCM_ROCHARS (str),
- SCM_ROLENGTH (str),
- base);
- return scm_return_first (answer, str);
-}
-#undef FUNC_NAME
-/*** END strs->nums ***/
-
-#ifdef SCM_FLOATS
-
-SCM
-scm_makdbl (double x, double y)
-{
- SCM z;
- if ((y == 0.0) && (x == 0.0))
- return scm_flo0;
- SCM_DEFER_INTS;
- if (y == 0.0)
- {
-#ifdef SCM_SINGLES
- float fx = x;
-#ifndef SCM_SINGLESONLY
- if ((-FLTMAX < x) && (x < FLTMAX) && (fx == x))
-#endif
- {
- SCM_NEWSMOB(z,scm_tc_flo,NULL);
- SCM_FLO (z) = x;
- SCM_ALLOW_INTS;
- return z;
- }
-#endif /* def SCM_SINGLES */
- SCM_NEWSMOB(z,scm_tc_dblr,scm_must_malloc (1L * sizeof (double), "real"));
- }
- else
- {
- SCM_NEWSMOB(z,scm_tc_dblc,scm_must_malloc (2L * sizeof (double), "comkplex"));
- SCM_IMAG (z) = y;
- }
- SCM_REAL (z) = x;
- SCM_ALLOW_INTS;
- return z;
-}
-#endif
-
-
-
-SCM
-scm_bigequal (SCM x, SCM y)
-{
-#ifdef SCM_BIGDIG
- if (0 == scm_bigcomp (x, y))
- return SCM_BOOL_T;
-#endif
- return SCM_BOOL_F;
-}
-
-
-
-SCM
-scm_floequal (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- if (SCM_REALPART (x) != SCM_REALPART (y))
- return SCM_BOOL_F;
- if (!(SCM_CPLXP (x) && (SCM_IMAG (x) != SCM_IMAG (y))))
- return SCM_BOOL_T;
-#endif
- return SCM_BOOL_F;
-}
-
-
-
-
-SCM_REGISTER_PROC (s_number_p, "number?", 1, 0, 0, scm_number_p);
-
-GUILE_PROC (scm_number_p, "complex?", 1, 0, 0,
- (SCM x),
-"")
-#define FUNC_NAME s_scm_number_p
-{
- if (SCM_INUMP (x))
- return SCM_BOOL_T;
-#ifdef SCM_FLOATS
- if (SCM_NIMP (x) && SCM_NUMP (x))
- return SCM_BOOL_T;
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NIMP (x) && SCM_NUMP (x))
- return SCM_BOOL_T;
-#endif
-#endif
- return SCM_BOOL_F;
-}
-#undef FUNC_NAME
-
-
-
-#ifdef SCM_FLOATS
-SCM_REGISTER_PROC (s_real_p, "real?", 1, 0, 0, scm_real_p);
-
-
-GUILE_PROC (scm_real_p, "rational?", 1, 0, 0,
- (SCM x),
-"")
-#define FUNC_NAME s_scm_real_p
-{
- if (SCM_INUMP (x))
- return SCM_BOOL_T;
- if (SCM_IMP (x))
- return SCM_BOOL_F;
- if (SCM_REALP (x))
- return SCM_BOOL_T;
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (x))
- return SCM_BOOL_T;
-#endif
- return SCM_BOOL_F;
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC (scm_integer_p, "integer?", 1, 0, 0,
- (SCM x),
-"")
-#define FUNC_NAME s_scm_integer_p
-{
- double r;
- if (SCM_INUMP (x))
- return SCM_BOOL_T;
- if (SCM_IMP (x))
- return SCM_BOOL_F;
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (x))
- return SCM_BOOL_T;
-#endif
- if (!SCM_INEXP (x))
- return SCM_BOOL_F;
- if (SCM_CPLXP (x))
- return SCM_BOOL_F;
- r = SCM_REALPART (x);
- if (r == floor (r))
- return SCM_BOOL_T;
- return SCM_BOOL_F;
-}
-#undef FUNC_NAME
-
-
-
-#endif /* SCM_FLOATS */
-
-GUILE_PROC (scm_inexact_p, "inexact?", 1, 0, 0,
- (SCM x),
-"")
-#define FUNC_NAME s_scm_inexact_p
-{
-#ifdef SCM_FLOATS
- if (SCM_NIMP (x) && SCM_INEXP (x))
- return SCM_BOOL_T;
-#endif
- return SCM_BOOL_F;
-}
-#undef FUNC_NAME
-
-
-
-
-SCM_GPROC1 (s_eq_p, "=", scm_tc7_rpsubr, scm_num_eq_p, g_eq_p);
-
-SCM
-scm_num_eq_p (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- SCM t;
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- if (!(SCM_NIMP (x)))
- {
- badx:
- SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARG1, s_eq_p);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- return SCM_BOOL_F;
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BOOL(0 == scm_bigcomp (x, y));
- SCM_ASRTGO (SCM_INEXP (y), bady);
- bigreal:
- return ((SCM_REALP (y) && (scm_big2dbl (x) == SCM_REALPART (y)))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
- }
- SCM_ASRTGO (SCM_INEXP (x), badx);
-#else
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_INEXP (x),
- g_eq_p, x, y, SCM_ARG1, s_eq_p);
-#endif
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto realint;
- }
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- t = x;
- x = y;
- y = t;
- goto bigreal;
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_INEXP (y), bady);
-#endif
- if (SCM_REALPART (x) != SCM_REALPART (y))
- return SCM_BOOL_F;
- if (SCM_CPLXP (x))
- return ((SCM_CPLXP (y) && (SCM_IMAG (x) == SCM_IMAG (y)))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
- return SCM_NEGATE_BOOL(SCM_CPLXP (y));
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BOOL_F;
- if (!(SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
- }
-#endif
- realint:
- return ((SCM_REALP (y) && (((double) SCM_INUM (x)) == SCM_REALPART (y)))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_eq_p, x, y, SCM_ARG1, s_eq_p);
- if (SCM_INUMP (y))
- return SCM_BOOL_F;
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return SCM_BOOL(0 == scm_bigcomp (x, y));
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
- }
- return SCM_BOOL_F;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_eq_p, x, y, SCM_ARG1, s_eq_p);
- SCM_GASSERT2 (SCM_INUMP (y), g_eq_p, x, y, SCM_ARGn, s_eq_p);
-#endif
-#endif
- return SCM_BOOL((long) x == (long) y);
-}
-
-
-
-SCM_GPROC1 (s_less_p, "<", scm_tc7_rpsubr, scm_less_p, g_less_p);
-
-SCM
-scm_less_p (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- if (!(SCM_NIMP (x)))
- {
- badx:
- SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARG1, s_less_p);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- return SCM_BOOL(SCM_BIGSIGN (x));
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BOOL(1 == scm_bigcomp (x, y));
- SCM_ASRTGO (SCM_REALP (y), bady);
- return ((scm_big2dbl (x) < SCM_REALPART (y))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
- }
- SCM_ASRTGO (SCM_REALP (x), badx);
-#else
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_REALP (x),
- g_less_p, x, y, SCM_ARG1, s_less_p);
-#endif
- if (SCM_INUMP (y))
- return ((SCM_REALPART (x) < ((double) SCM_INUM (y)))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BOOL(SCM_REALPART (x) < scm_big2dbl (y));
- SCM_ASRTGO (SCM_REALP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_REALP (y), bady);
-#endif
- return SCM_BOOL(SCM_REALPART (x) < SCM_REALPART (y));
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_NEGATE_BOOL(SCM_BIGSIGN (y));
- if (!(SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
- }
-#endif
- return ((((double) SCM_INUM (x)) < SCM_REALPART (y))
- ? SCM_BOOL_T
- : SCM_BOOL_F);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_less_p, x, y, SCM_ARG1, s_less_p);
- if (SCM_INUMP (y))
- return SCM_BOOL(SCM_BIGSIGN (x));
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return SCM_BOOL(1 == scm_bigcomp (x, y));
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
- }
- return SCM_NEGATE_BOOL(SCM_BIGSIGN (y));
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_less_p, x, y, SCM_ARG1, s_less_p);
- SCM_GASSERT2 (SCM_INUMP (y), g_less_p, x, y, SCM_ARGn, s_less_p);
-#endif
-#endif
- return SCM_BOOL((long) x < (long) y);
-}
-
-
-GUILE_PROC1 (scm_gr_p, ">", scm_tc7_rpsubr,
- (SCM x, SCM y),
-"")
-#define FUNC_NAME s_scm_gr_p
-{
- return scm_less_p (y, x);
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC1 (scm_leq_p, "<=", scm_tc7_rpsubr,
- (SCM x, SCM y),
-"")
-#define FUNC_NAME s_scm_leq_p
-{
- return SCM_BOOL_NOT (scm_less_p (y, x));
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC1 (scm_geq_p, ">=", scm_tc7_rpsubr,
- (SCM x, SCM y),
-"")
-#define FUNC_NAME s_scm_geq_p
-{
- return SCM_BOOL_NOT (scm_less_p (x, y));
-}
-#undef FUNC_NAME
-
-
-
-SCM_GPROC (s_zero_p, "zero?", 1, 0, 0, scm_zero_p, g_zero_p);
-
-SCM
-scm_zero_p (SCM z)
-{
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (z))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- return SCM_BOOL_F;
- if (!(SCM_INEXP (z)))
- {
- badz:
- SCM_WTA_DISPATCH_1 (g_zero_p, z, SCM_ARG1, s_zero_p);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_INEXP (z),
- g_zero_p, z, SCM_ARG1, s_zero_p);
-#endif
- return SCM_BOOL(z == scm_flo0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (z))
- {
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_BIGP (z),
- g_zero_p, z, SCM_ARG1, s_zero_p);
- return SCM_BOOL_F;
- }
-#else
- SCM_GASSERT1 (SCM_INUMP (z), g_zero_p, z, SCM_ARG1, s_zero_p);
-#endif
-#endif
- return SCM_BOOL(z == SCM_INUM0);
-}
-
-
-
-SCM_GPROC (s_positive_p, "positive?", 1, 0, 0, scm_positive_p, g_positive_p);
-
-SCM
-scm_positive_p (SCM x)
-{
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (x), badx);
- if (SCM_BIGP (x))
- return SCM_BOOL(SCM_TYP16 (x) == scm_tc16_bigpos);
- if (!(SCM_REALP (x)))
- {
- badx:
- SCM_WTA_DISPATCH_1 (g_positive_p, x, SCM_ARG1, s_positive_p);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (x) && SCM_REALP (x),
- g_positive_p, x, SCM_ARG1, s_positive_p);
-#endif
- return SCM_BOOL(SCM_REALPART (x) > 0.0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT1 (SCM_NIMP (x) && SCM_BIGP (x),
- g_positive_p, x, SCM_ARG1, s_positive_p);
- return SCM_BOOL(SCM_TYP16 (x) == scm_tc16_bigpos);
- }
-#else
- SCM_GASSERT1 (SCM_INUMP (x), g_positive_p, x, SCM_ARG1, s_positive_p);
-#endif
-#endif
- return SCM_BOOL(x > SCM_INUM0);
-}
-
-
-
-SCM_GPROC (s_negative_p, "negative?", 1, 0, 0, scm_negative_p, g_negative_p);
-
-SCM
-scm_negative_p (SCM x)
-{
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (x), badx);
- if (SCM_BIGP (x))
- return SCM_NEGATE_BOOL(SCM_TYP16 (x) == scm_tc16_bigpos);
- if (!(SCM_REALP (x)))
- {
- badx:
- SCM_WTA_DISPATCH_1 (g_negative_p, x, SCM_ARG1, s_negative_p);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (x) && SCM_REALP (x),
- g_negative_p, x, SCM_ARG1, s_negative_p);
-#endif
- return SCM_BOOL(SCM_REALPART (x) < 0.0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT1 (SCM_NIMP (x) && SCM_BIGP (x),
- g_negative_p, x, SCM_ARG1, s_negative_p);
- return SCM_BOOL(SCM_TYP16 (x) == scm_tc16_bigneg);
- }
-#else
- SCM_GASSERT1 (SCM_INUMP (x), g_negative_p, x, SCM_ARG1, s_negative_p);
-#endif
-#endif
- return SCM_BOOL(x < SCM_INUM0);
-}
-
-
-SCM_GPROC1 (s_max, "max", scm_tc7_asubr, scm_max, g_max);
-
-SCM
-scm_max (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- double z;
-#endif
- if (SCM_UNBNDP (y))
- {
- SCM_GASSERT0 (!SCM_UNBNDP (x),
- g_max, scm_makfrom0str (s_max), SCM_WNA, 0);
- SCM_GASSERT1 (SCM_NUMBERP (x), g_max, x, SCM_ARG1, s_max);
- return x;
- }
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- if (!SCM_NIMP (x))
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARG1, s_max);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- return SCM_BIGSIGN (x) ? y : x;
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return (1 == scm_bigcomp (x, y)) ? y : x;
- SCM_ASRTGO (SCM_REALP (y), bady);
- z = scm_big2dbl (x);
- return (z < SCM_REALPART (y)) ? y : scm_makdbl (z, 0.0);
- }
- SCM_ASRTGO (SCM_REALP (x), badx2);
-#else
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_REALP (x),
- g_max, x, y, SCM_ARG1, s_max);
-#endif
- if (SCM_INUMP (y))
- return ((SCM_REALPART (x) < (z = SCM_INUM (y)))
- ? scm_makdbl (z, 0.0)
- : x);
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return ((SCM_REALPART (x) < (z = scm_big2dbl (y)))
- ? scm_makdbl (z, 0.0)
- : x);
- SCM_ASRTGO (SCM_REALP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_REALP (y), bady);
-#endif
- return (SCM_REALPART (x) < SCM_REALPART (y)) ? y : x;
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BIGSIGN (y) ? x : y;
- if (!(SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
- }
-#endif
- return (((z = SCM_INUM (x)) < SCM_REALPART (y))
- ? y
- : scm_makdbl (z, 0.0));
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_max, x, y, SCM_ARG1, s_max);
- if (SCM_INUMP (y))
- return SCM_BIGSIGN (x) ? y : x;
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return (1 == scm_bigcomp (x, y)) ? y : x;
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
- }
- return SCM_BIGSIGN (y) ? x : y;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_max, x, y, SCM_ARG1, s_max);
- SCM_GASSERT2 (SCM_INUMP (y), g_max, x, y, SCM_ARGn, s_max);
-#endif
-#endif
- return ((long) x < (long) y) ? y : x;
-}
-
-
-
-
-SCM_GPROC1 (s_min, "min", scm_tc7_asubr, scm_min, g_min);
-
-SCM
-scm_min (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- double z;
-#endif
- if (SCM_UNBNDP (y))
- {
- SCM_GASSERT0 (!SCM_UNBNDP (x),
- g_min, scm_makfrom0str (s_min), SCM_WNA, 0);
- SCM_GASSERT1 (SCM_NUMBERP (x), g_min, x, SCM_ARG1, s_min);
- return x;
- }
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
-#ifdef SCM_BIGDIG
- if (!(SCM_NIMP (x)))
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARG1, s_min);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- return SCM_BIGSIGN (x) ? x : y;
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return (-1 == scm_bigcomp (x, y)) ? y : x;
- SCM_ASRTGO (SCM_REALP (y), bady);
- z = scm_big2dbl (x);
- return (z > SCM_REALPART (y)) ? y : scm_makdbl (z, 0.0);
- }
- SCM_ASRTGO (SCM_REALP (x), badx2);
-#else
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_REALP (x),
- g_min, x, y, SCM_ARG1, s_min);
-#endif
- if (SCM_INUMP (y))
- return ((SCM_REALPART (x) > (z = SCM_INUM (y)))
- ? scm_makdbl (z, 0.0)
- : x);
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return ((SCM_REALPART (x) > (z = scm_big2dbl (y)))
- ? scm_makdbl (z, 0.0)
- : x);
- SCM_ASRTGO (SCM_REALP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_REALP (y), bady);
-#endif
- return (SCM_REALPART (x) > SCM_REALPART (y)) ? y : x;
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return SCM_BIGSIGN (y) ? y : x;
- if (!(SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_REALP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
- }
-#endif
- return (((z = SCM_INUM (x)) > SCM_REALPART (y))
- ? y
- : scm_makdbl (z, 0.0));
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_min, x, y, SCM_ARG1, s_min);
- if (SCM_INUMP (y))
- return SCM_BIGSIGN (x) ? x : y;
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return (-1 == scm_bigcomp (x, y)) ? y : x;
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
- }
- return SCM_BIGSIGN (y) ? y : x;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_min, x, y, SCM_ARG1, s_min);
- SCM_GASSERT2 (SCM_INUMP (y), g_min, x, y, SCM_ARGn, s_min);
-#endif
-#endif
- return ((long) x > (long) y) ? y : x;
-}
-
-
-
-
-SCM_GPROC1 (s_sum, "+", scm_tc7_asubr, scm_sum, g_sum);
-
-SCM
-scm_sum (SCM x, SCM y)
-{
- if (SCM_UNBNDP (y))
- {
- if (SCM_UNBNDP (x))
- return SCM_INUM0;
- SCM_GASSERT1 (SCM_NUMBERP (x), g_sum, x, SCM_ARG1, s_sum);
- return x;
- }
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
- SCM t;
-#ifdef SCM_BIGDIG
- if (!SCM_NIMP (x))
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARG1, s_sum);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto intbig;
- }
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- if (SCM_NUMDIGS (x) > SCM_NUMDIGS (y))
- {
- t = x;
- x = y;
- y = t;
- }
- return scm_addbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BIGSIGN (x),
- y, 0);
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
- bigreal:
- return scm_makdbl (scm_big2dbl (x) + SCM_REALPART (y),
- SCM_CPLXP (y) ? SCM_IMAG (y) : 0.0);
- }
- SCM_ASRTGO (SCM_INEXP (x), badx2);
-#else
- SCM_ASRTGO (SCM_NIMP (x) && SCM_INEXP (x), badx2);
-#endif
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto intreal;
- }
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- t = x;
- x = y;
- y = t;
- goto bigreal;
- }
- else if (!(SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
- }
-#endif
- {
- double i = 0.0;
- if (SCM_CPLXP (x))
- i = SCM_IMAG (x);
- if (SCM_CPLXP (y))
- i += SCM_IMAG (y);
- return scm_makdbl (SCM_REALPART (x) + SCM_REALPART (y), i);
- }
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- intbig:
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_addbig ((SCM_BIGDIG *) & z,
- SCM_DIGSPERLONG,
- (x < 0) ? 0x0100 : 0,
- y, 0);
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_addbig (zdigs, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0,
- y, 0);
-#endif
- }
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_INEXP (y), bady);
-#endif
- intreal:
- return scm_makdbl (SCM_INUM (x) + SCM_REALPART (y),
- SCM_CPLXP (y) ? SCM_IMAG (y) : 0.0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM t;
- SCM_ASRTGO (SCM_NIMP (x) && SCM_BIGP (x), badx2);
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto intbig;
- }
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- if (SCM_NUMDIGS (x) > SCM_NUMDIGS (y))
- {
- t = x;
- x = y;
- y = t;
- }
- return scm_addbig (SCM_BDIGITS (x), SCM_NUMDIGS (x), SCM_BIGSIGN (x),
- y, 0);
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
- }
- intbig:
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_addbig (&z, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0, y, 0);
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_addbig (zdigs, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0, y, 0);
-#endif
- }
- }
-#else
- SCM_ASRTGO (SCM_INUMP (x), badx2);
- SCM_GASSERT2 (SCM_INUMP (y), g_sum, x, y, SCM_ARGn, s_sum);
-#endif
-#endif
- x = SCM_INUM (x) + SCM_INUM (y);
- if (SCM_FIXABLE (x))
- return SCM_MAKINUM (x);
-#ifdef SCM_BIGDIG
- return scm_long2big (x);
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl ((double) x, 0.0);
-#else
- scm_num_overflow (s_sum);
- return SCM_UNSPECIFIED;
-#endif
-#endif
-}
-
-
-
-
-SCM_GPROC1 (s_difference, "-", scm_tc7_asubr, scm_difference, g_difference);
-
-SCM
-scm_difference (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
- if (!(SCM_NIMP (x)))
- {
- if (SCM_UNBNDP (y))
- {
- SCM_GASSERT0 (!SCM_UNBNDP (x), g_difference,
- scm_makfrom0str (s_difference), SCM_WNA, 0);
- badx:
- SCM_WTA_DISPATCH_1 (g_difference, x, SCM_ARG1, s_difference);
- }
- else
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARG1, s_difference);
- }
- }
- if (SCM_UNBNDP (y))
- {
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (x))
- {
- x = scm_copybig (x, !SCM_BIGSIGN (x));
- return (SCM_NUMDIGS (x) * SCM_BITSPERDIG / SCM_CHAR_BIT
- <= sizeof (SCM)
- ? scm_big2inum (x, SCM_NUMDIGS (x))
- : x);
- }
-#endif
- SCM_ASRTGO (SCM_INEXP (x), badx);
- return scm_makdbl (- SCM_REALPART (x),
- SCM_CPLXP (x) ? -SCM_IMAG (x) : 0.0);
- }
- if (SCM_INUMP (y))
- return scm_sum (x, SCM_MAKINUM (- SCM_INUM (y)));
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (x))
- {
- if (SCM_BIGP (y))
- return ((SCM_NUMDIGS (x) < SCM_NUMDIGS (y))
- ? scm_addbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BIGSIGN (x),
- y, 0x0100)
- : scm_addbig (SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y) ^ 0x0100,
- x, 0));
- SCM_ASRTGO (SCM_INEXP (y), bady);
- return scm_makdbl (scm_big2dbl (x) - SCM_REALPART (y),
- SCM_CPLXP (y) ? -SCM_IMAG (y) : 0.0);
- }
- SCM_ASRTGO (SCM_INEXP (x), badx2);
- if (SCM_BIGP (y))
- return scm_makdbl (SCM_REALPART (x) - scm_big2dbl (y),
- SCM_CPLXP (x) ? SCM_IMAG (x) : 0.0);
- SCM_ASRTGO (SCM_INEXP (y), bady);
-#else
- SCM_ASRTGO (SCM_INEXP (x), badx2);
- SCM_ASRTGO (SCM_NIMP (y) && SCM_INEXP (y), bady);
-#endif
- if (SCM_CPLXP (x))
- {
- if (SCM_CPLXP (y))
- return scm_makdbl (SCM_REAL (x) - SCM_REAL (y),
- SCM_IMAG (x) - SCM_IMAG (y));
- else
- return scm_makdbl (SCM_REAL (x) - SCM_REALPART (y), SCM_IMAG (x));
- }
- return scm_makdbl (SCM_REALPART (x) - SCM_REALPART (y),
- SCM_CPLXP (y) ? - SCM_IMAG (y) : 0.0);
- }
- if (SCM_UNBNDP (y))
- {
- x = -SCM_INUM (x);
- goto checkx;
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_addbig ((SCM_BIGDIG *) & z, SCM_DIGSPERLONG,
- (x < 0) ? 0x0100 : 0,
- y, 0x0100);
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_addbig (zdigs, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0,
- y, 0x0100);
-#endif
- }
- if (!(SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
- }
-#endif
- return scm_makdbl (SCM_INUM (x) - SCM_REALPART (y),
- SCM_CPLXP (y) ? -SCM_IMAG (y) : 0.0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_difference, x, y, SCM_ARG1, s_difference);
- if (SCM_UNBNDP (y))
- {
- x = scm_copybig (x, !SCM_BIGSIGN (x));
- return (SCM_NUMDIGS (x) * SCM_BITSPERDIG / SCM_CHAR_BIT
- <= sizeof (SCM)
- ? scm_big2inum (x, SCM_NUMDIGS (x))
- : x);
- }
- if (SCM_INUMP (y))
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (y));
- return scm_addbig (&z, SCM_DIGSPERLONG, (y < 0) ? 0 : 0x0100, x, 0);
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_addbig (zdigs, SCM_DIGSPERLONG, (y < 0) ? 0 : 0x0100,
- x, 0);
-#endif
- }
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return (SCM_NUMDIGS (x) < SCM_NUMDIGS (y)) ?
- scm_addbig (SCM_BDIGITS (x), SCM_NUMDIGS (x), SCM_BIGSIGN (x),
- y, 0x0100) :
- scm_addbig (SCM_BDIGITS (y), SCM_NUMDIGS (y), SCM_BIGSIGN (y) ^ 0x0100,
- x, 0);
- }
- if (SCM_UNBNDP (y))
- {
- x = -SCM_INUM (x);
- goto checkx;
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
- }
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_addbig (&z, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0,
- y, 0x0100);
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_addbig (zdigs, SCM_DIGSPERLONG, (x < 0) ? 0x0100 : 0,
- y, 0x0100);
-#endif
- }
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_difference, x, y, SCM_ARG1, s_difference);
- if (SCM_UNBNDP (y))
- {
- x = -SCM_INUM (x);
- goto checkx;
- }
- SCM_GASSERT2 (SCM_INUMP (y), g_difference, x, y, SCM_ARGn, s_difference);
-#endif
-#endif
- x = SCM_INUM (x) - SCM_INUM (y);
- checkx:
- if (SCM_FIXABLE (x))
- return SCM_MAKINUM (x);
-#ifdef SCM_BIGDIG
- return scm_long2big (x);
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl ((double) x, 0.0);
-#else
- scm_num_overflow (s_difference);
- return SCM_UNSPECIFIED;
-#endif
-#endif
-}
-
-
-
-
-SCM_GPROC1 (s_product, "*", scm_tc7_asubr, scm_product, g_product);
-
-SCM
-scm_product (SCM x, SCM y)
-{
- if (SCM_UNBNDP (y))
- {
- if (SCM_UNBNDP (x))
- return SCM_MAKINUM (1L);
- SCM_GASSERT1 (SCM_NUMBERP (x), g_product, x, SCM_ARG1, s_product);
- return x;
- }
-#ifdef SCM_FLOATS
- if (SCM_NINUMP (x))
- {
- SCM t;
-#ifdef SCM_BIGDIG
- if (!SCM_NIMP (x))
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARG1, s_product);
- }
- if (SCM_BIGP (x))
- {
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto intbig;
- }
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return scm_mulbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y));
- SCM_ASRTGO (SCM_INEXP (y), bady);
- bigreal:
- {
- double bg = scm_big2dbl (x);
- return scm_makdbl (bg * SCM_REALPART (y),
- SCM_CPLXP (y) ? bg * SCM_IMAG (y) : 0.0);
- }
- }
- SCM_ASRTGO (SCM_INEXP (x), badx2);
-#else
- SCM_ASRTGO (SCM_NIMP (x) && SCM_INEXP (x), badx2);
-#endif
- if (SCM_INUMP (y))
- {
- t = x;
- x = y;
- y = t;
- goto intreal;
- }
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- t = x;
- x = y;
- y = t;
- goto bigreal;
- }
- else if (!(SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
- }
-#endif
- if (SCM_CPLXP (x))
- {
- if (SCM_CPLXP (y))
- return scm_makdbl (SCM_REAL (x) * SCM_REAL (y)
- - SCM_IMAG (x) * SCM_IMAG (y),
- SCM_REAL (x) * SCM_IMAG (y)
- + SCM_IMAG (x) * SCM_REAL (y));
- else
- return scm_makdbl (SCM_REAL (x) * SCM_REALPART (y),
- SCM_IMAG (x) * SCM_REALPART (y));
- }
- return scm_makdbl (SCM_REALPART (x) * SCM_REALPART (y),
- SCM_CPLXP (y)
- ? SCM_REALPART (x) * SCM_IMAG (y)
- : 0.0);
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- intbig:
- if (SCM_INUM0 == x)
- return x;
- if (SCM_MAKINUM (1L) == x)
- return y;
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_mulbig ((SCM_BIGDIG *) & z, SCM_DIGSPERLONG,
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y) ? (x > 0) : (x < 0));
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_mulbig (zdigs, SCM_DIGSPERLONG,
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y) ? (x > 0) : (x < 0));
-#endif
- }
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_INEXP (y), bady);
-#endif
- intreal:
- return scm_makdbl (SCM_INUM (x) * SCM_REALPART (y),
- SCM_CPLXP (y) ? SCM_INUM (x) * SCM_IMAG (y) : 0.0);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM_ASRTGO (SCM_NIMP (x) && SCM_BIGP (x), badx2);
- if (SCM_INUMP (y))
- {
- SCM t = x;
- x = y;
- y = t;
- goto intbig;
- }
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- return scm_mulbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y));
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
- }
- intbig:
- if (SCM_INUM0 == x)
- return x;
- if (SCM_MAKINUM (1L) == x)
- return y;
- {
-#ifndef SCM_DIGSTOOBIG
- long z = scm_pseudolong (SCM_INUM (x));
- return scm_mulbig (&z, SCM_DIGSPERLONG,
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y) ? (x > 0) : (x < 0));
-#else
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (SCM_INUM (x), zdigs);
- return scm_mulbig (zdigs, SCM_DIGSPERLONG,
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (y) ? (x > 0) : (x < 0));
-#endif
- }
- }
-#else
- SCM_ASRTGO (SCM_INUMP (x), badx2);
- SCM_GASSERT (SCM_INUMP (y), g_product, x, y, SCM_ARGn, s_product);
-#endif
-#endif
- {
- long i, j, k;
- i = SCM_INUM (x);
- if (0 == i)
- return x;
- j = SCM_INUM (y);
- k = i * j;
- y = SCM_MAKINUM (k);
- if (k != SCM_INUM (y) || k / i != j)
-#ifdef SCM_BIGDIG
- {
- int sgn = (i < 0) ^ (j < 0);
-#ifndef SCM_DIGSTOOBIG
- i = scm_pseudolong (i);
- j = scm_pseudolong (j);
- return scm_mulbig ((SCM_BIGDIG *) & i, SCM_DIGSPERLONG,
- (SCM_BIGDIG *) & j, SCM_DIGSPERLONG, sgn);
-#else /* SCM_DIGSTOOBIG */
- SCM_BIGDIG idigs[SCM_DIGSPERLONG];
- SCM_BIGDIG jdigs[SCM_DIGSPERLONG];
- scm_longdigs (i, idigs);
- scm_longdigs (j, jdigs);
- return scm_mulbig (idigs, SCM_DIGSPERLONG,
- jdigs, SCM_DIGSPERLONG,
- sgn);
-#endif
- }
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl (((double) i) * ((double) j), 0.0);
-#else
- scm_num_overflow (s_product);
-#endif
-#endif
- return y;
- }
-}
-
-
-
-double
-scm_num2dbl (SCM a, const char *why)
-{
- if (SCM_INUMP (a))
- return (double) SCM_INUM (a);
-#ifdef SCM_FLOATS
- SCM_ASSERT (SCM_NIMP (a), a, "wrong type argument", why);
- if (SCM_REALP (a))
- return (SCM_REALPART (a));
-#endif
-#ifdef SCM_BIGDIG
- return scm_big2dbl (a);
-#endif
- SCM_ASSERT (0, a, "wrong type argument", why);
- return SCM_UNSPECIFIED;
-}
-
-
-SCM_GPROC1 (s_divide, "/", scm_tc7_asubr, scm_divide, g_divide);
-
-SCM
-scm_divide (SCM x, SCM y)
-{
-#ifdef SCM_FLOATS
- double d, r, i, a;
- if (SCM_NINUMP (x))
- {
- if (!(SCM_NIMP (x)))
- {
- if (SCM_UNBNDP (y))
- {
- SCM_GASSERT0 (!SCM_UNBNDP (x),
- g_divide, scm_makfrom0str (s_divide), SCM_WNA, 0);
- badx:
- SCM_WTA_DISPATCH_1 (g_divide, x, SCM_ARG1, s_divide);
- }
- else
- {
- badx2:
- SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARG1, s_divide);
- }
- }
- if (SCM_UNBNDP (y))
- {
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (x))
- return scm_makdbl (1.0 / scm_big2dbl (x), 0.0);
-#endif
- SCM_ASRTGO (SCM_INEXP (x), badx);
- if (SCM_REALP (x))
- return scm_makdbl (1.0 / SCM_REALPART (x), 0.0);
- r = SCM_REAL (x);
- i = SCM_IMAG (x);
- d = r * r + i * i;
- return scm_makdbl (r / d, -i / d);
- }
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (x))
- {
- SCM z;
- if (SCM_INUMP (y))
- {
- z = SCM_INUM (y);
-#ifndef SCM_RECKLESS
- if (!z)
- scm_num_overflow (s_divide);
-#endif
- if (1 == z)
- return x;
- if (z < 0)
- z = -z;
- if (z < SCM_BIGRAD)
- {
- SCM w = scm_copybig (x, SCM_BIGSIGN (x) ? (y > 0) : (y < 0));
- return (scm_divbigdig (SCM_BDIGITS (w), SCM_NUMDIGS (w),
- (SCM_BIGDIG) z)
- ? scm_makdbl (scm_big2dbl (x) / SCM_INUM (y), 0.0)
- : scm_normbig (w));
- }
-#ifndef SCM_DIGSTOOBIG
- z = scm_pseudolong (z);
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- (SCM_BIGDIG *) & z, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 3);
-#else
- {
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (z, zdigs);
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- zdigs, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 3);
- }
-#endif
- return z ? z : scm_makdbl (scm_big2dbl (x) / SCM_INUM (y), 0.0);
- }
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y), 3);
- return z ? z : scm_makdbl (scm_big2dbl (x) / scm_big2dbl (y),
- 0.0);
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
- if (SCM_REALP (y))
- return scm_makdbl (scm_big2dbl (x) / SCM_REALPART (y), 0.0);
- a = scm_big2dbl (x);
- goto complex_div;
- }
-#endif
- SCM_ASRTGO (SCM_INEXP (x), badx2);
- if (SCM_INUMP (y))
- {
- d = SCM_INUM (y);
- goto basic_div;
- }
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- {
- d = scm_big2dbl (y);
- goto basic_div;
- }
- SCM_ASRTGO (SCM_INEXP (y), bady);
-#else
- SCM_ASRTGO (SCM_NIMP (y) && SCM_INEXP (y), bady);
-#endif
- if (SCM_REALP (y))
- {
- d = SCM_REALPART (y);
- basic_div:
- return scm_makdbl (SCM_REALPART (x) / d,
- SCM_CPLXP (x) ? SCM_IMAG (x) / d : 0.0);
- }
- a = SCM_REALPART (x);
- if (SCM_REALP (x))
- goto complex_div;
- r = SCM_REAL (y);
- i = SCM_IMAG (y);
- d = r * r + i * i;
- return scm_makdbl ((a * r + SCM_IMAG (x) * i) / d,
- (SCM_IMAG (x) * r - a * i) / d);
- }
- if (SCM_UNBNDP (y))
- {
- if ((SCM_MAKINUM (1L) == x) || (SCM_MAKINUM (-1L) == x))
- return x;
- return scm_makdbl (1.0 / ((double) SCM_INUM (x)), 0.0);
- }
- if (SCM_NINUMP (y))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (y), bady);
- if (SCM_BIGP (y))
- return scm_makdbl (SCM_INUM (x) / scm_big2dbl (y), 0.0);
- if (!(SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
- }
-#else
- if (!(SCM_NIMP (y) && SCM_INEXP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
- }
-#endif
- if (SCM_REALP (y))
- return scm_makdbl (SCM_INUM (x) / SCM_REALPART (y), 0.0);
- a = SCM_INUM (x);
- complex_div:
- r = SCM_REAL (y);
- i = SCM_IMAG (y);
- d = r * r + i * i;
- return scm_makdbl ((a * r) / d, (-a * i) / d);
- }
-#else
-#ifdef SCM_BIGDIG
- if (SCM_NINUMP (x))
- {
- SCM z;
- SCM_GASSERT2 (SCM_NIMP (x) && SCM_BIGP (x),
- g_divide, x, y, SCM_ARG1, s_divide);
- if (SCM_UNBNDP (y))
- goto ov;
- if (SCM_INUMP (y))
- {
- z = SCM_INUM (y);
- if (!z)
- goto ov;
- if (1 == z)
- return x;
- if (z < 0)
- z = -z;
- if (z < SCM_BIGRAD)
- {
- SCM w = scm_copybig (x, SCM_BIGSIGN (x) ? (y > 0) : (y < 0));
- if (scm_divbigdig (SCM_BDIGITS (w), SCM_NUMDIGS (w),
- (SCM_BIGDIG) z))
- goto ov;
- return w;
- }
-#ifndef SCM_DIGSTOOBIG
- z = scm_pseudolong (z);
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- &z, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 3);
-#else
- {
- SCM_BIGDIG zdigs[SCM_DIGSPERLONG];
- scm_longdigs (z, zdigs);
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- zdigs, SCM_DIGSPERLONG,
- SCM_BIGSIGN (x) ? (y > 0) : (y < 0), 3);
- }
-#endif
- }
- else
- {
- SCM_ASRTGO (SCM_NIMP (y) && SCM_BIGP (y), bady);
- z = scm_divbigbig (SCM_BDIGITS (x), SCM_NUMDIGS (x),
- SCM_BDIGITS (y), SCM_NUMDIGS (y),
- SCM_BIGSIGN (x) ^ SCM_BIGSIGN (y), 3);
- }
- if (!z)
- goto ov;
- return z;
- }
- if (SCM_UNBNDP (y))
- {
- if ((SCM_MAKINUM (1L) == x) || (SCM_MAKINUM (-1L) == x))
- return x;
- goto ov;
- }
- if (SCM_NINUMP (y))
- {
- if (!(SCM_NIMP (y) && SCM_BIGP (y)))
- {
- bady:
- SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
- }
- goto ov;
- }
-#else
- SCM_GASSERT2 (SCM_INUMP (x), g_divide, x, y, SCM_ARG1, s_divide);
- if (SCM_UNBNDP (y))
- {
- if ((SCM_MAKINUM (1L) == x) || (SCM_MAKINUM (-1L) == x))
- return x;
- goto ov;
- }
- SCM_GASSERT2 (SCM_INUMP (y), g_divide, x, y, SCM_ARGn, s_divide);
-#endif
-#endif
- {
- long z = SCM_INUM (y);
- if ((0 == z) || SCM_INUM (x) % z)
- goto ov;
- z = SCM_INUM (x) / z;
- if (SCM_FIXABLE (z))
- return SCM_MAKINUM (z);
-#ifdef SCM_BIGDIG
- return scm_long2big (z);
-#endif
-#ifdef SCM_FLOATS
- ov:
- return scm_makdbl (((double) SCM_INUM (x)) / ((double) SCM_INUM (y)), 0.0);
-#else
- ov:
- scm_num_overflow (s_divide);
- return SCM_UNSPECIFIED;
-#endif
- }
-}
-
-
-
-
-#ifdef SCM_FLOATS
-SCM_GPROC1 (s_asinh, "$asinh", scm_tc7_cxr, (SCM (*)()) scm_asinh, g_asinh);
-
-double
-scm_asinh (double x)
-{
- return log (x + sqrt (x * x + 1));
-}
-
-
-
-
-SCM_GPROC1 (s_acosh, "$acosh", scm_tc7_cxr, (SCM (*)()) scm_acosh, g_acosh);
-
-double
-scm_acosh (double x)
-{
- return log (x + sqrt (x * x - 1));
-}
-
-
-
-
-SCM_GPROC1 (s_atanh, "$atanh", scm_tc7_cxr, (SCM (*)()) scm_atanh, g_atanh);
-
-double
-scm_atanh (double x)
-{
- return 0.5 * log ((1 + x) / (1 - x));
-}
-
-
-
-
-SCM_GPROC1 (s_truncate, "truncate", scm_tc7_cxr, (SCM (*)()) scm_truncate, g_truncate);
-
-double
-scm_truncate (double x)
-{
- if (x < 0.0)
- return -floor (-x);
- return floor (x);
-}
-
-
-
-SCM_GPROC1 (s_round, "round", scm_tc7_cxr, (SCM (*)()) scm_round, g_round);
-
-double
-scm_round (double x)
-{
- double plus_half = x + 0.5;
- double result = floor (plus_half);
- /* Adjust so that the scm_round is towards even. */
- return (plus_half == result && plus_half / 2 != floor (plus_half / 2))
- ? result - 1 : result;
-}
-
-
-
-SCM_GPROC1 (s_exact_to_inexact, "exact->inexact", scm_tc7_cxr, (SCM (*)()) scm_exact_to_inexact, g_exact_to_inexact);
-
-double
-scm_exact_to_inexact (double z)
-{
- return z;
-}
-
-
-SCM_GPROC1 (s_i_floor, "floor", scm_tc7_cxr, (SCM (*)()) floor, g_i_floor);
-SCM_GPROC1 (s_i_ceil, "ceiling", scm_tc7_cxr, (SCM (*)()) ceil, g_i_ceil);
-SCM_GPROC1 (s_i_sqrt, "$sqrt", scm_tc7_cxr, (SCM (*)()) sqrt, g_i_sqrt);
-SCM_GPROC1 (s_i_abs, "$abs", scm_tc7_cxr, (SCM (*)()) fabs, g_i_abs);
-SCM_GPROC1 (s_i_exp, "$exp", scm_tc7_cxr, (SCM (*)()) exp, g_i_exp);
-SCM_GPROC1 (s_i_log, "$log", scm_tc7_cxr, (SCM (*)()) log, g_i_log);
-SCM_GPROC1 (s_i_sin, "$sin", scm_tc7_cxr, (SCM (*)()) sin, g_i_sin);
-SCM_GPROC1 (s_i_cos, "$cos", scm_tc7_cxr, (SCM (*)()) cos, g_i_cos);
-SCM_GPROC1 (s_i_tan, "$tan", scm_tc7_cxr, (SCM (*)()) tan, g_i_tan);
-SCM_GPROC1 (s_i_asin, "$asin", scm_tc7_cxr, (SCM (*)()) asin, g_i_asin);
-SCM_GPROC1 (s_i_acos, "$acos", scm_tc7_cxr, (SCM (*)()) acos, g_i_acos);
-SCM_GPROC1 (s_i_atan, "$atan", scm_tc7_cxr, (SCM (*)()) atan, g_i_atan);
-SCM_GPROC1 (s_i_sinh, "$sinh", scm_tc7_cxr, (SCM (*)()) sinh, g_i_sinh);
-SCM_GPROC1 (s_i_cosh, "$cosh", scm_tc7_cxr, (SCM (*)()) cosh, g_i_cosh);
-SCM_GPROC1 (s_i_tanh, "$tanh", scm_tc7_cxr, (SCM (*)()) tanh, g_i_tanh);
-
-struct dpair
-{
- double x, y;
-};
-
-static void scm_two_doubles (SCM z1,
- SCM z2,
- const char *sstring,
- struct dpair * xy);
-
-static void
-scm_two_doubles (SCM z1, SCM z2, const char *sstring, struct dpair *xy)
-{
- if (SCM_INUMP (z1))
- xy->x = SCM_INUM (z1);
- else
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z1), badz1);
- if (SCM_BIGP (z1))
- xy->x = scm_big2dbl (z1);
- else
- {
-#ifndef SCM_RECKLESS
- if (!(SCM_REALP (z1)))
- badz1:scm_wta (z1, (char *) SCM_ARG1, sstring);
-#endif
- xy->x = SCM_REALPART (z1);
- }
-#else
- {
- SCM_ASSERT (SCM_NIMP (z1) && SCM_REALP (z1), z1, SCM_ARG1, sstring);
- xy->x = SCM_REALPART (z1);
- }
-#endif
- }
- if (SCM_INUMP (z2))
- xy->y = SCM_INUM (z2);
- else
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z2), badz2);
- if (SCM_BIGP (z2))
- xy->y = scm_big2dbl (z2);
- else
- {
-#ifndef SCM_RECKLESS
- if (!(SCM_REALP (z2)))
- badz2:scm_wta (z2, (char *) SCM_ARG2, sstring);
-#endif
- xy->y = SCM_REALPART (z2);
- }
-#else
- {
- SCM_ASSERT (SCM_NIMP (z2) && SCM_REALP (z2), z2, SCM_ARG2, sstring);
- xy->y = SCM_REALPART (z2);
- }
-#endif
- }
-}
-
-
-
-
-GUILE_PROC (scm_sys_expt, "$expt", 2, 0, 0,
- (SCM z1, SCM z2),
-"")
-#define FUNC_NAME s_scm_sys_expt
-{
- struct dpair xy;
- scm_two_doubles (z1, z2, FUNC_NAME, &xy);
- return scm_makdbl (pow (xy.x, xy.y), 0.0);
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC (scm_sys_atan2, "$atan2", 2, 0, 0,
- (SCM z1, SCM z2),
-"")
-#define FUNC_NAME s_scm_sys_atan2
-{
- struct dpair xy;
- scm_two_doubles (z1, z2, FUNC_NAME, &xy);
- return scm_makdbl (atan2 (xy.x, xy.y), 0.0);
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC (scm_make_rectangular, "make-rectangular", 2, 0, 0,
- (SCM z1, SCM z2),
-"")
-#define FUNC_NAME s_scm_make_rectangular
-{
- struct dpair xy;
- scm_two_doubles (z1, z2, FUNC_NAME, &xy);
- return scm_makdbl (xy.x, xy.y);
-}
-#undef FUNC_NAME
-
-
-
-GUILE_PROC (scm_make_polar, "make-polar", 2, 0, 0,
- (SCM z1, SCM z2),
-"")
-#define FUNC_NAME s_scm_make_polar
-{
- struct dpair xy;
- scm_two_doubles (z1, z2, FUNC_NAME, &xy);
- return scm_makdbl (xy.x * cos (xy.y), xy.x * sin (xy.y));
-}
-#undef FUNC_NAME
-
-
-
-
-SCM_GPROC (s_real_part, "real-part", 1, 0, 0, scm_real_part, g_real_part);
-
-SCM
-scm_real_part (SCM z)
-{
- if (SCM_NINUMP (z))
- {
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- return z;
- if (!(SCM_INEXP (z)))
- {
- badz:
- SCM_WTA_DISPATCH_1 (g_real_part, z, SCM_ARG1, s_real_part);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_INEXP (z),
- g_real_part, z, SCM_ARG1, s_real_part);
-#endif
- if (SCM_CPLXP (z))
- return scm_makdbl (SCM_REAL (z), 0.0);
- }
- return z;
-}
-
-
-
-SCM_GPROC (s_imag_part, "imag-part", 1, 0, 0, scm_imag_part, g_imag_part);
-
-SCM
-scm_imag_part (SCM z)
-{
- if (SCM_INUMP (z))
- return SCM_INUM0;
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- return SCM_INUM0;
- if (!(SCM_INEXP (z)))
- {
- badz:
- SCM_WTA_DISPATCH_1 (g_imag_part, z, SCM_ARG1, s_imag_part);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_INEXP (z),
- g_imag_part, z, SCM_ARG1, s_imag_part);
-#endif
- if (SCM_CPLXP (z))
- return scm_makdbl (SCM_IMAG (z), 0.0);
- return scm_flo0;
-}
-
-
-
-SCM_GPROC (s_magnitude, "magnitude", 1, 0, 0, scm_magnitude, g_magnitude);
-
-SCM
-scm_magnitude (SCM z)
-{
- if (SCM_INUMP (z))
- return scm_abs (z);
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- return scm_abs (z);
- if (!(SCM_INEXP (z)))
- {
- badz:
- SCM_WTA_DISPATCH_1 (g_magnitude, z, SCM_ARG1, s_magnitude);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_INEXP (z),
- g_magnitude, z, SCM_ARG1, s_magnitude);
-#endif
- if (SCM_CPLXP (z))
- {
- double i = SCM_IMAG (z), r = SCM_REAL (z);
- return scm_makdbl (sqrt (i * i + r * r), 0.0);
- }
- return scm_makdbl (fabs (SCM_REALPART (z)), 0.0);
-}
-
-
-
-
-SCM_GPROC (s_angle, "angle", 1, 0, 0, scm_angle, g_angle);
-
-SCM
-scm_angle (SCM z)
-{
- double x, y = 0.0;
- if (SCM_INUMP (z))
- {
- x = (z >= SCM_INUM0) ? 1.0 : -1.0;
- goto do_angle;
- }
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- {
- x = (SCM_TYP16 (z) == scm_tc16_bigpos) ? 1.0 : -1.0;
- goto do_angle;
- }
- if (!(SCM_INEXP (z)))
- {
- badz:
- SCM_WTA_DISPATCH_1 (g_angle, z, SCM_ARG1, s_angle);
- }
-#else
- SCM_GASSERT1 (SCM_NIMP (z) && SCM_INEXP (z), g_angle, z, SCM_ARG1, s_angle);
-#endif
- if (SCM_REALP (z))
- {
- x = SCM_REALPART (z);
- goto do_angle;
- }
- x = SCM_REAL (z);
- y = SCM_IMAG (z);
- do_angle:
- return scm_makdbl (atan2 (y, x), 0.0);
-}
-
-
-GUILE_PROC (scm_inexact_to_exact, "inexact->exact", 1, 0, 0,
- (SCM z),
-"")
-#define FUNC_NAME s_scm_inexact_to_exact
-{
- if (SCM_INUMP (z))
- return z;
-#ifdef SCM_BIGDIG
- SCM_ASRTGO (SCM_NIMP (z), badz);
- if (SCM_BIGP (z))
- return z;
-#ifndef SCM_RECKLESS
- if (!(SCM_REALP (z)))
- {
- badz:
- scm_wta (z, (char *) SCM_ARG1, FUNC_NAME);
- }
-#endif
-#else
- SCM_VALIDATE_REAL(1,z);
-#endif
-#ifdef SCM_BIGDIG
- {
- double u = floor (SCM_REALPART (z) + 0.5);
- if ((u <= SCM_MOST_POSITIVE_FIXNUM) && (-u <= -SCM_MOST_NEGATIVE_FIXNUM))
- {
- /* Negation is a workaround for HP700 cc bug */
- SCM ans = SCM_MAKINUM ((long) u);
- if (SCM_INUM (ans) == (long) u)
- return ans;
- }
- SCM_ASRTGO (isfinite (u), badz); /* problem? */
- return scm_dbl2big (u);
- }
-#else
- return SCM_MAKINUM ((long) floor (SCM_REALPART (z) + 0.5));
-#endif
-}
-#undef FUNC_NAME
-
-
-
-#else /* ~SCM_FLOATS */
-SCM_GPROC (s_trunc, "truncate", 1, 0, 0, scm_trunc, g_trunc);
-
-SCM
-scm_trunc (SCM x)
-{
- SCM_GASSERT2 (SCM_INUMP (x), g_trunc, x, y, SCM_ARG1, s_truncate);
- return x;
-}
-
-
-
-#endif /* SCM_FLOATS */
-
-#ifdef SCM_BIGDIG
-#ifdef SCM_FLOATS
-/* d must be integer */
-
-SCM
-scm_dbl2big (double d)
-{
- scm_sizet i = 0;
- long c;
- SCM_BIGDIG *digits;
- SCM ans;
- double u = (d < 0) ? -d : d;
- while (0 != floor (u))
- {
- u /= SCM_BIGRAD;
- i++;
- }
- ans = scm_mkbig (i, d < 0);
- digits = SCM_BDIGITS (ans);
- while (i--)
- {
- u *= SCM_BIGRAD;
- c = floor (u);
- u -= c;
- digits[i] = c;
- }
-#ifndef SCM_RECKLESS
- if (u != 0)
- scm_num_overflow ("dbl2big");
-#endif
- return ans;
-}
-
-
-
-double
-scm_big2dbl (SCM b)
-{
- double ans = 0.0;
- scm_sizet i = SCM_NUMDIGS (b);
- SCM_BIGDIG *digits = SCM_BDIGITS (b);
- while (i--)
- ans = digits[i] + SCM_BIGRAD * ans;
- if (scm_tc16_bigneg == SCM_TYP16 (b))
- return -ans;
- return ans;
-}
-#endif
-#endif
-
-
-SCM
-scm_long2num (long sl)
-{
- if (!SCM_FIXABLE (sl))
- {
-#ifdef SCM_BIGDIG
- return scm_long2big (sl);
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl ((double) sl, 0.0);
-#else
- return SCM_BOOL_F;
-#endif
-#endif
- }
- return SCM_MAKINUM (sl);
-}
-
-
-#ifdef HAVE_LONG_LONGS
-
-SCM
-scm_long_long2num (long_long sl)
-{
- if (!SCM_FIXABLE (sl))
- {
-#ifdef SCM_BIGDIG
- return scm_long_long2big (sl);
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl ((double) sl, 0.0);
-#else
- return SCM_BOOL_F;
-#endif
-#endif
- }
- return SCM_MAKINUM (sl);
-}
-#endif
-
-
-
-SCM
-scm_ulong2num (unsigned long sl)
-{
- if (!SCM_POSFIXABLE (sl))
- {
-#ifdef SCM_BIGDIG
- return scm_ulong2big (sl);
-#else
-#ifdef SCM_FLOATS
- return scm_makdbl ((double) sl, 0.0);
-#else
- return SCM_BOOL_F;
-#endif
-#endif
- }
- return SCM_MAKINUM (sl);
-}
-
-
-long
-scm_num2long (SCM num, char *pos, const char *s_caller)
-{
- long res;
-
- if (SCM_INUMP (num))
- {
- res = SCM_INUM (num);
- return res;
- }
- SCM_ASRTGO (SCM_NIMP (num), wrong_type_arg);
-#ifdef SCM_FLOATS
- if (SCM_REALP (num))
- {
- volatile double u = SCM_REALPART (num);
-
- res = u;
- if (res != u)
- goto out_of_range;
- return res;
- }
-#endif
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (num))
- {
- unsigned long oldres = 0;
- scm_sizet l;
- /* can't use res directly in case num is -2^31. */
- unsigned long pos_res = 0;
-
- for (l = SCM_NUMDIGS (num); l--;)
- {
- pos_res = SCM_BIGUP (pos_res) + SCM_BDIGITS (num)[l];
- /* check for overflow. */
- if (pos_res < oldres)
- goto out_of_range;
- oldres = pos_res;
- }
- if (SCM_TYP16 (num) == scm_tc16_bigpos)
- {
- res = pos_res;
- if (res < 0)
- goto out_of_range;
- }
- else
- {
- res = -pos_res;
- if (res > 0)
- goto out_of_range;
- }
- return res;
- }
-#endif
- wrong_type_arg:
- scm_wrong_type_arg (s_caller, (int) pos, num);
- out_of_range:
- scm_out_of_range (s_caller, num);
-}
-
-
-
-#ifdef HAVE_LONG_LONGS
-
-long_long
-scm_num2long_long (SCM num, char *pos, const char *s_caller)
-{
- long_long res;
-
- if (SCM_INUMP (num))
- {
- res = SCM_INUM (num);
- return res;
- }
- SCM_ASRTGO (SCM_NIMP (num), wrong_type_arg);
-#ifdef SCM_FLOATS
- if (SCM_REALP (num))
- {
- double u = SCM_REALPART (num);
-
- res = u;
- if ((res < 0 && u > 0) || (res > 0 && u < 0)) /* check for overflow. */
- goto out_of_range;
-
- return res;
- }
-#endif
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (num))
- {
- unsigned long long oldres = 0;
- scm_sizet l;
- /* can't use res directly in case num is -2^63. */
- unsigned long long pos_res = 0;
-
- for (l = SCM_NUMDIGS (num); l--;)
- {
- pos_res = SCM_LONGLONGBIGUP (pos_res) + SCM_BDIGITS (num)[l];
- /* check for overflow. */
- if (pos_res < oldres)
- goto out_of_range;
- oldres = pos_res;
- }
- if (SCM_TYP16 (num) == scm_tc16_bigpos)
- {
- res = pos_res;
- if (res < 0)
- goto out_of_range;
- }
- else
- {
- res = -pos_res;
- if (res > 0)
- goto out_of_range;
- }
- return res;
- }
-#endif
- wrong_type_arg:
- scm_wrong_type_arg (s_caller, (int) pos, num);
- out_of_range:
- scm_out_of_range (s_caller, num);
-}
-#endif
-
-
-
-unsigned long
-scm_num2ulong (SCM num, char *pos, const char *s_caller)
-{
- unsigned long res;
-
- if (SCM_INUMP (num))
- {
- if (SCM_INUM (num) < 0)
- goto out_of_range;
- res = SCM_INUM (num);
- return res;
- }
- SCM_ASRTGO (SCM_NIMP (num), wrong_type_arg);
-#ifdef SCM_FLOATS
- if (SCM_REALP (num))
- {
- double u = SCM_REALPART (num);
-
- res = u;
- if (res != u)
- goto out_of_range;
- return res;
- }
-#endif
-#ifdef SCM_BIGDIG
- if (SCM_BIGP (num))
- {
- unsigned long oldres = 0;
- scm_sizet l;
-
- res = 0;
- for (l = SCM_NUMDIGS (num); l--;)
- {
- res = SCM_BIGUP (res) + SCM_BDIGITS (num)[l];
- if (res < oldres)
- goto out_of_range;
- oldres = res;
- }
- return res;
- }
-#endif
- wrong_type_arg:
- scm_wrong_type_arg (s_caller, (int) pos, num);
- out_of_range:
- scm_out_of_range (s_caller, num);
-}
-
-
-#ifdef SCM_FLOATS
-#ifndef DBL_DIG
-static void
-add1 (double f, double *fsum)
-{
- *fsum = f + 1.0;
-}
-#endif
-#endif
-
-
-
-void
-scm_init_numbers ()
-{
- scm_add_feature("complex");
-#ifdef SCM_FLOATS
- scm_add_feature("inexact");
-#ifdef SCM_SINGLES
- SCM_NEWSMOB(scm_flo0,scm_tc_flo,NULL);
-#else
- SCM_NEWSMOB(scm_flo0,scm_tc_dblr,scm_must_malloc (1L * sizeof (double), "real"));
- SCM_REAL (scm_flo0) = 0.0;
-#endif
-#ifdef DBL_DIG
- scm_dblprec = (DBL_DIG > 20) ? 20 : DBL_DIG;
-#else
- { /* determine floating point precision */
- double f = 0.1;
- double fsum = 1.0 + f;
- while (fsum != 1.0)
- {
- f /= 10.0;
- if (++scm_dblprec > 20)
- break;
- add1 (f, &fsum);
- }
- scm_dblprec = scm_dblprec - 1;
- }
-#endif /* DBL_DIG */
-#endif
-#include "numbers.x"
-}
+/* Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004 Free Software Foundation, Inc.
+ *
+ * Portions Copyright 1990, 1991, 1992, 1993 by AT&T Bell Laboratories
+ * and Bellcore. See scm_divide.
+ *
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
+
+\f
+/* General assumptions:
+ * All objects satisfying SCM_COMPLEXP() have a non-zero complex component.
+ * All objects satisfying SCM_BIGP() are too large to fit in a fixnum.
+ * If an object satisfies integer?, it's either an inum, a bignum, or a real.
+ * If floor (r) == r, r is an int, and mpz_set_d will DTRT.
+ * All objects satisfying SCM_FRACTIONP are never an integer.
+ */
+
+/* TODO:
+
+ - see if special casing bignums and reals in integer-exponent when
+ possible (to use mpz_pow and mpf_pow_ui) is faster.
+
+ - look in to better short-circuiting of common cases in
+ integer-expt and elsewhere.
+
+ - see if direct mpz operations can help in ash and elsewhere.
+
+ */
+
+/* tell glibc (2.3) to give prototype for C99 trunc() */
+#define _GNU_SOURCE
+
+#if HAVE_CONFIG_H
+# include <config.h>
+#endif
+
+#include <math.h>
+#include <ctype.h>
+#include <string.h>
+#include <gmp.h>
+
+#include "libguile/_scm.h"
+#include "libguile/feature.h"
+#include "libguile/ports.h"
+#include "libguile/root.h"
+#include "libguile/smob.h"
+#include "libguile/strings.h"
+
+#include "libguile/validate.h"
+#include "libguile/numbers.h"
+#include "libguile/deprecation.h"
+
+#include "libguile/eq.h"
+
+\f
+
+/*
+ Wonder if this might be faster for some of our code? A switch on
+ the numtag would jump directly to the right case, and the
+ SCM_I_NUMTAG code might be faster than repeated SCM_FOOP tests...
+
+ #define SCM_I_NUMTAG_NOTNUM 0
+ #define SCM_I_NUMTAG_INUM 1
+ #define SCM_I_NUMTAG_BIG scm_tc16_big
+ #define SCM_I_NUMTAG_REAL scm_tc16_real
+ #define SCM_I_NUMTAG_COMPLEX scm_tc16_complex
+ #define SCM_I_NUMTAG(x) \
+ (SCM_INUMP(x) ? SCM_I_NUMTAG_INUM \
+ : (SCM_IMP(x) ? SCM_I_NUMTAG_NOTNUM \
+ : (((0xfcff & SCM_CELL_TYPE (x)) == scm_tc7_number) ? SCM_TYP16(x) \
+ : SCM_I_NUMTAG_NOTNUM)))
+*/
+/* the macro above will not work as is with fractions */
+
+
+#define SCM_SWAP(x, y) do { SCM __t = x; x = y; y = __t; } while (0)
+
+/* FLOBUFLEN is the maximum number of characters neccessary for the
+ * printed or scm_string representation of an inexact number.
+ */
+#define FLOBUFLEN (10+2*(sizeof(double)/sizeof(char)*SCM_CHAR_BIT*3+9)/10)
+
+#if defined (SCO)
+#if ! defined (HAVE_ISNAN)
+#define HAVE_ISNAN
+static int
+isnan (double x)
+{
+ return (IsNANorINF (x) && NaN (x) && ! IsINF (x)) ? 1 : 0;
+}
+#endif
+#if ! defined (HAVE_ISINF)
+#define HAVE_ISINF
+static int
+isinf (double x)
+{
+ return (IsNANorINF (x) && IsINF (x)) ? 1 : 0;
+}
+
+#endif
+#endif
+
+
+/* mpz_cmp_d only recognises infinities in gmp 4.2 and up.
+ For prior versions use an explicit check here. */
+#if __GNU_MP_VERSION < 4 \
+ || (__GNU_MP_VERSION == 4 && __GNU_MP_VERSION_MINOR < 2)
+#define xmpz_cmp_d(z, d) \
+ (xisinf (d) ? (d < 0.0 ? 1 : -1) : mpz_cmp_d (z, d))
+#else
+#define xmpz_cmp_d(z, d) mpz_cmp_d (z, d)
+#endif
+
+static int
+xisinf (double x)
+{
+#if defined (HAVE_ISINF)
+ return isinf (x);
+#elif defined (HAVE_FINITE) && defined (HAVE_ISNAN)
+ return (! (finite (x) || isnan (x)));
+#else
+ return 0;
+#endif
+}
+
+static int
+xisnan (double x)
+{
+#if defined (HAVE_ISNAN)
+ return isnan (x);
+#else
+ return 0;
+#endif
+}
+
+\f
+
+static mpz_t z_negative_one;
+
+\f
+
+SCM_C_INLINE_KEYWORD SCM
+scm_i_mkbig ()
+{
+ /* Return a newly created bignum. */
+ SCM z = scm_double_cell (scm_tc16_big, 0, 0, 0);
+ mpz_init (SCM_I_BIG_MPZ (z));
+ return z;
+}
+
+SCM_C_INLINE_KEYWORD static SCM
+scm_i_clonebig (SCM src_big, int same_sign_p)
+{
+ /* Copy src_big's value, negate it if same_sign_p is false, and return. */
+ SCM z = scm_double_cell (scm_tc16_big, 0, 0, 0);
+ mpz_init_set (SCM_I_BIG_MPZ (z), SCM_I_BIG_MPZ (src_big));
+ if (!same_sign_p)
+ mpz_neg (SCM_I_BIG_MPZ (z), SCM_I_BIG_MPZ (z));
+ return z;
+}
+
+SCM_C_INLINE_KEYWORD int
+scm_i_bigcmp (SCM x, SCM y)
+{
+ /* Return neg if x < y, pos if x > y, and 0 if x == y */
+ /* presume we already know x and y are bignums */
+ int result = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return result;
+}
+
+SCM_C_INLINE_KEYWORD SCM
+scm_i_dbl2big (double d)
+{
+ /* results are only defined if d is an integer */
+ SCM z = scm_double_cell (scm_tc16_big, 0, 0, 0);
+ mpz_init_set_d (SCM_I_BIG_MPZ (z), d);
+ return z;
+}
+
+/* Convert a integer in double representation to a SCM number. */
+
+SCM_C_INLINE_KEYWORD SCM
+scm_i_dbl2num (double u)
+{
+ /* SCM_MOST_POSITIVE_FIXNUM+1 and SCM_MOST_NEGATIVE_FIXNUM are both
+ powers of 2, so there's no rounding when making "double" values
+ from them. If plain SCM_MOST_POSITIVE_FIXNUM was used it could
+ get rounded on a 64-bit machine, hence the "+1".
+
+ The use of floor() to force to an integer value ensures we get a
+ "numerically closest" value without depending on how a
+ double->long cast or how mpz_set_d will round. For reference,
+ double->long probably follows the hardware rounding mode,
+ mpz_set_d truncates towards zero. */
+
+ /* XXX - what happens when SCM_MOST_POSITIVE_FIXNUM etc is not
+ representable as a double? */
+
+ if (u < (double) (SCM_MOST_POSITIVE_FIXNUM+1)
+ && u >= (double) SCM_MOST_NEGATIVE_FIXNUM)
+ return SCM_MAKINUM ((long) u);
+ else
+ return scm_i_dbl2big (u);
+}
+
+/* scm_i_big2dbl() rounds to the closest representable double, in accordance
+ with R5RS exact->inexact.
+
+ The approach is to use mpz_get_d to pick out the high DBL_MANT_DIG bits
+ (ie. it truncates towards zero), then adjust to get the closest double by
+ examining the next lower bit and adding 1 if necessary.
+
+ Note that bignums exactly half way between representable doubles are
+ rounded to the next higher absolute value (ie. away from zero). This
+ seems like an adequate interpretation of R5RS "numerically closest", and
+ it's easier and faster than a full "nearest-even" style.
+
+ The bit test is done on the absolute value of the mpz_t, which means we
+ must use mpz_getlimbn. mpz_tstbit is not right, it treats negatives as
+ twos complement.
+
+ Prior to GMP 4.2, the rounding done by mpz_get_d was unspecified. It
+ happened to follow the hardware rounding mode, but on the absolute value
+ of its operand. This is not what we want, so we put the high
+ DBL_MANT_DIG bits into a temporary. This extra init/clear is a slowdown,
+ but doesn't matter too much since it's only for older GMP. */
+
+double
+scm_i_big2dbl (SCM b)
+{
+ double result;
+ size_t bits;
+
+ bits = mpz_sizeinbase (SCM_I_BIG_MPZ (b), 2);
+
+#if __GNU_MP_VERSION < 4 \
+ || (__GNU_MP_VERSION == 4 && __GNU_MP_VERSION_MINOR < 2)
+ {
+ /* GMP prior to 4.2, force truncate towards zero */
+ mpz_t tmp;
+ if (bits > DBL_MANT_DIG)
+ {
+ size_t shift = bits - DBL_MANT_DIG;
+ mpz_init2 (tmp, DBL_MANT_DIG);
+ mpz_tdiv_q_2exp (tmp, SCM_I_BIG_MPZ (b), shift);
+ result = ldexp (mpz_get_d (tmp), shift);
+ mpz_clear (tmp);
+ }
+ else
+ {
+ result = mpz_get_d (SCM_I_BIG_MPZ (b));
+ }
+ }
+#else
+ /* GMP 4.2 and up */
+ result = mpz_get_d (SCM_I_BIG_MPZ (b));
+#endif
+
+ if (bits > DBL_MANT_DIG)
+ {
+ unsigned long pos = bits - DBL_MANT_DIG - 1;
+ /* test bit number "pos" in absolute value */
+ if (mpz_getlimbn (SCM_I_BIG_MPZ (b), pos / GMP_NUMB_BITS)
+ & ((mp_limb_t) 1 << (pos % GMP_NUMB_BITS)))
+ {
+ result += ldexp ((double) mpz_sgn (SCM_I_BIG_MPZ (b)), pos + 1);
+ }
+ }
+
+ scm_remember_upto_here_1 (b);
+ return result;
+}
+
+SCM_C_INLINE_KEYWORD SCM
+scm_i_normbig (SCM b)
+{
+ /* convert a big back to a fixnum if it'll fit */
+ /* presume b is a bignum */
+ if (mpz_fits_slong_p (SCM_I_BIG_MPZ (b)))
+ {
+ long val = mpz_get_si (SCM_I_BIG_MPZ (b));
+ if (SCM_FIXABLE (val))
+ b = SCM_MAKINUM (val);
+ }
+ return b;
+}
+
+static SCM_C_INLINE_KEYWORD SCM
+scm_i_mpz2num (mpz_t b)
+{
+ /* convert a mpz number to a SCM number. */
+ if (mpz_fits_slong_p (b))
+ {
+ long val = mpz_get_si (b);
+ if (SCM_FIXABLE (val))
+ return SCM_MAKINUM (val);
+ }
+
+ {
+ SCM z = scm_double_cell (scm_tc16_big, 0, 0, 0);
+ mpz_init_set (SCM_I_BIG_MPZ (z), b);
+ return z;
+ }
+}
+
+/* this is needed when we want scm_divide to make a float, not a ratio, even if passed two ints */
+static SCM scm_divide2real (SCM x, SCM y);
+
+SCM
+scm_make_ratio (SCM numerator, SCM denominator)
+#define FUNC_NAME "make-ratio"
+{
+ /* First make sure the arguments are proper.
+ */
+ if (SCM_INUMP (denominator))
+ {
+ if (SCM_EQ_P (denominator, SCM_INUM0))
+ scm_num_overflow ("make-ratio");
+ if (SCM_EQ_P (denominator, SCM_MAKINUM(1)))
+ return numerator;
+ }
+ else
+ {
+ if (!(SCM_BIGP(denominator)))
+ SCM_WRONG_TYPE_ARG (2, denominator);
+ }
+ if (!SCM_INUMP (numerator) && !SCM_BIGP (numerator))
+ SCM_WRONG_TYPE_ARG (1, numerator);
+
+ /* Then flip signs so that the denominator is positive.
+ */
+ if (SCM_NFALSEP (scm_negative_p (denominator)))
+ {
+ numerator = scm_difference (numerator, SCM_UNDEFINED);
+ denominator = scm_difference (denominator, SCM_UNDEFINED);
+ }
+
+ /* Now consider for each of the four fixnum/bignum combinations
+ whether the rational number is really an integer.
+ */
+ if (SCM_INUMP (numerator))
+ {
+ long x = SCM_INUM (numerator);
+ if (SCM_EQ_P (numerator, SCM_INUM0))
+ return SCM_INUM0;
+ if (SCM_INUMP (denominator))
+ {
+ long y;
+ y = SCM_INUM (denominator);
+ if (x == y)
+ return SCM_MAKINUM(1);
+ if ((x % y) == 0)
+ return SCM_MAKINUM (x / y);
+ }
+ else
+ {
+ /* When x == SCM_MOST_NEGATIVE_FIXNUM we could have the negative
+ of that value for the denominator, as a bignum. Apart from
+ that case, abs(bignum) > abs(inum) so inum/bignum is not an
+ integer. */
+ if (x == SCM_MOST_NEGATIVE_FIXNUM
+ && mpz_cmp_ui (SCM_I_BIG_MPZ (denominator),
+ - SCM_MOST_NEGATIVE_FIXNUM) == 0)
+ return SCM_MAKINUM(-1);
+ }
+ }
+ else if (SCM_BIGP (numerator))
+ {
+ if (SCM_INUMP (denominator))
+ {
+ long yy = SCM_INUM (denominator);
+ if (mpz_divisible_ui_p (SCM_I_BIG_MPZ (numerator), yy))
+ return scm_divide (numerator, denominator);
+ }
+ else
+ {
+ if (SCM_EQ_P (numerator, denominator))
+ return SCM_MAKINUM(1);
+ if (mpz_divisible_p (SCM_I_BIG_MPZ (numerator),
+ SCM_I_BIG_MPZ (denominator)))
+ return scm_divide(numerator, denominator);
+ }
+ }
+
+ /* No, it's a proper fraction.
+ */
+ return scm_double_cell (scm_tc16_fraction,
+ SCM_UNPACK (numerator),
+ SCM_UNPACK (denominator), 0);
+}
+#undef FUNC_NAME
+
+static void scm_i_fraction_reduce (SCM z)
+{
+ if (!(SCM_FRACTION_REDUCED (z)))
+ {
+ SCM divisor;
+ divisor = scm_gcd (SCM_FRACTION_NUMERATOR (z), SCM_FRACTION_DENOMINATOR (z));
+ if (!(SCM_EQ_P (divisor, SCM_MAKINUM(1))))
+ {
+ /* is this safe? */
+ SCM_FRACTION_SET_NUMERATOR (z, scm_divide (SCM_FRACTION_NUMERATOR (z), divisor));
+ SCM_FRACTION_SET_DENOMINATOR (z, scm_divide (SCM_FRACTION_DENOMINATOR (z), divisor));
+ }
+ SCM_FRACTION_REDUCED_SET (z);
+ }
+}
+
+double
+scm_i_fraction2double (SCM z)
+{
+ return scm_num2dbl (scm_divide2real (SCM_FRACTION_NUMERATOR (z),
+ SCM_FRACTION_DENOMINATOR (z)),
+ "fraction2real");
+}
+
+SCM_DEFINE (scm_exact_p, "exact?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is an exact number, @code{#f}\n"
+ "otherwise.")
+#define FUNC_NAME s_scm_exact_p
+{
+ if (SCM_INUMP (x))
+ return SCM_BOOL_T;
+ if (SCM_BIGP (x))
+ return SCM_BOOL_T;
+ if (SCM_FRACTIONP (x))
+ return SCM_BOOL_T;
+ if (SCM_NUMBERP (x))
+ return SCM_BOOL_F;
+ SCM_WRONG_TYPE_ARG (1, x);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_odd_p, "odd?", 1, 0, 0,
+ (SCM n),
+ "Return @code{#t} if @var{n} is an odd number, @code{#f}\n"
+ "otherwise.")
+#define FUNC_NAME s_scm_odd_p
+{
+ if (SCM_INUMP (n))
+ {
+ long val = SCM_INUM (n);
+ return SCM_BOOL ((val & 1L) != 0);
+ }
+ else if (SCM_BIGP (n))
+ {
+ int odd_p = mpz_odd_p (SCM_I_BIG_MPZ (n));
+ scm_remember_upto_here_1 (n);
+ return SCM_BOOL (odd_p);
+ }
+ else if (!SCM_FALSEP (scm_inf_p (n)))
+ return SCM_BOOL_T;
+ else if (SCM_REALP (n))
+ {
+ double rem = fabs (fmod (SCM_REAL_VALUE(n), 2.0));
+ if (rem == 1.0)
+ return SCM_BOOL_T;
+ else if (rem == 0.0)
+ return SCM_BOOL_F;
+ else
+ SCM_WRONG_TYPE_ARG (1, n);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (1, n);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_even_p, "even?", 1, 0, 0,
+ (SCM n),
+ "Return @code{#t} if @var{n} is an even number, @code{#f}\n"
+ "otherwise.")
+#define FUNC_NAME s_scm_even_p
+{
+ if (SCM_INUMP (n))
+ {
+ long val = SCM_INUM (n);
+ return SCM_BOOL ((val & 1L) == 0);
+ }
+ else if (SCM_BIGP (n))
+ {
+ int even_p = mpz_even_p (SCM_I_BIG_MPZ (n));
+ scm_remember_upto_here_1 (n);
+ return SCM_BOOL (even_p);
+ }
+ else if (!SCM_FALSEP (scm_inf_p (n)))
+ return SCM_BOOL_T;
+ else if (SCM_REALP (n))
+ {
+ double rem = fabs (fmod (SCM_REAL_VALUE(n), 2.0));
+ if (rem == 1.0)
+ return SCM_BOOL_F;
+ else if (rem == 0.0)
+ return SCM_BOOL_T;
+ else
+ SCM_WRONG_TYPE_ARG (1, n);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (1, n);
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_inf_p, "inf?", 1, 0, 0,
+ (SCM n),
+ "Return @code{#t} if @var{n} is infinite, @code{#f}\n"
+ "otherwise.")
+#define FUNC_NAME s_scm_inf_p
+{
+ if (SCM_REALP (n))
+ return SCM_BOOL (xisinf (SCM_REAL_VALUE (n)));
+ else if (SCM_COMPLEXP (n))
+ return SCM_BOOL (xisinf (SCM_COMPLEX_REAL (n))
+ || xisinf (SCM_COMPLEX_IMAG (n)));
+ else
+ return SCM_BOOL_F;
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_nan_p, "nan?", 1, 0, 0,
+ (SCM n),
+ "Return @code{#t} if @var{n} is a NaN, @code{#f}\n"
+ "otherwise.")
+#define FUNC_NAME s_scm_nan_p
+{
+ if (SCM_REALP (n))
+ return SCM_BOOL (xisnan (SCM_REAL_VALUE (n)));
+ else if (SCM_COMPLEXP (n))
+ return SCM_BOOL (xisnan (SCM_COMPLEX_REAL (n))
+ || xisnan (SCM_COMPLEX_IMAG (n)));
+ else
+ return SCM_BOOL_F;
+}
+#undef FUNC_NAME
+
+/* Guile's idea of infinity. */
+static double guile_Inf;
+
+/* Guile's idea of not a number. */
+static double guile_NaN;
+
+static void
+guile_ieee_init (void)
+{
+#if defined (HAVE_ISINF) || defined (HAVE_FINITE)
+
+/* Some version of gcc on some old version of Linux used to crash when
+ trying to make Inf and NaN. */
+
+#ifdef INFINITY
+ /* C99 INFINITY, when available.
+ FIXME: The standard allows for INFINITY to be something that overflows
+ at compile time. We ought to have a configure test to check for that
+ before trying to use it. (But in practice we believe this is not a
+ problem on any system guile is likely to target.) */
+ guile_Inf = INFINITY;
+#elif HAVE_DINFINITY
+ /* OSF */
+ extern unsigned int DINFINITY[2];
+ guile_Inf = (*(X_CAST(double *, DINFINITY)));
+#else
+ double tmp = 1e+10;
+ guile_Inf = tmp;
+ for (;;)
+ {
+ guile_Inf *= 1e+10;
+ if (guile_Inf == tmp)
+ break;
+ tmp = guile_Inf;
+ }
+#endif
+
+#endif
+
+#if defined (HAVE_ISNAN)
+
+#ifdef NAN
+ /* C99 NAN, when available */
+ guile_NaN = NAN;
+#elif HAVE_DQNAN
+ /* OSF */
+ extern unsigned int DQNAN[2];
+ guile_NaN = (*(X_CAST(double *, DQNAN)));
+#else
+ guile_NaN = guile_Inf / guile_Inf;
+#endif
+
+#endif
+}
+
+SCM_DEFINE (scm_inf, "inf", 0, 0, 0,
+ (void),
+ "Return Inf.")
+#define FUNC_NAME s_scm_inf
+{
+ static int initialized = 0;
+ if (! initialized)
+ {
+ guile_ieee_init ();
+ initialized = 1;
+ }
+ return scm_make_real (guile_Inf);
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_nan, "nan", 0, 0, 0,
+ (void),
+ "Return NaN.")
+#define FUNC_NAME s_scm_nan
+{
+ static int initialized = 0;
+ if (!initialized)
+ {
+ guile_ieee_init ();
+ initialized = 1;
+ }
+ return scm_make_real (guile_NaN);
+}
+#undef FUNC_NAME
+
+
+SCM_PRIMITIVE_GENERIC (scm_abs, "abs", 1, 0, 0,
+ (SCM x),
+ "Return the absolute value of @var{x}.")
+#define FUNC_NAME
+{
+ if (SCM_INUMP (x))
+ {
+ long int xx = SCM_INUM (x);
+ if (xx >= 0)
+ return x;
+ else if (SCM_POSFIXABLE (-xx))
+ return SCM_MAKINUM (-xx);
+ else
+ return scm_i_long2big (-xx);
+ }
+ else if (SCM_BIGP (x))
+ {
+ const int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ if (sgn < 0)
+ return scm_i_clonebig (x, 0);
+ else
+ return x;
+ }
+ else if (SCM_REALP (x))
+ {
+ /* note that if x is a NaN then xx<0 is false so we return x unchanged */
+ double xx = SCM_REAL_VALUE (x);
+ if (xx < 0.0)
+ return scm_make_real (-xx);
+ else
+ return x;
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_FALSEP (scm_negative_p (SCM_FRACTION_NUMERATOR (x))))
+ return x;
+ return scm_make_ratio (scm_difference (SCM_FRACTION_NUMERATOR (x), SCM_UNDEFINED),
+ SCM_FRACTION_DENOMINATOR (x));
+ }
+ else
+ SCM_WTA_DISPATCH_1 (g_scm_abs, x, 1, s_scm_abs);
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC (s_quotient, "quotient", 2, 0, 0, scm_quotient, g_quotient);
+/* "Return the quotient of the numbers @var{x} and @var{y}."
+ */
+SCM
+scm_quotient (SCM x, SCM y)
+{
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_quotient);
+ else
+ {
+ long z = xx / yy;
+ if (SCM_FIXABLE (z))
+ return SCM_MAKINUM (z);
+ else
+ return scm_i_long2big (z);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ if ((SCM_INUM (x) == SCM_MOST_NEGATIVE_FIXNUM)
+ && (mpz_cmp_ui (SCM_I_BIG_MPZ (y),
+ - SCM_MOST_NEGATIVE_FIXNUM) == 0))
+ {
+ /* Special case: x == fixnum-min && y == abs (fixnum-min) */
+ scm_remember_upto_here_1 (y);
+ return SCM_MAKINUM (-1);
+ }
+ else
+ return SCM_MAKINUM (0);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_quotient, x, y, SCM_ARG2, s_quotient);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_quotient);
+ else if (yy == 1)
+ return x;
+ else
+ {
+ SCM result = scm_i_mkbig ();
+ if (yy < 0)
+ {
+ mpz_tdiv_q_ui (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ - yy);
+ mpz_neg (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result));
+ }
+ else
+ mpz_tdiv_q_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), yy);
+ scm_remember_upto_here_1 (x);
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_tdiv_q (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return scm_i_normbig (result);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_quotient, x, y, SCM_ARG2, s_quotient);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_quotient, x, y, SCM_ARG1, s_quotient);
+}
+
+SCM_GPROC (s_remainder, "remainder", 2, 0, 0, scm_remainder, g_remainder);
+/* "Return the remainder of the numbers @var{x} and @var{y}.\n"
+ * "@lisp\n"
+ * "(remainder 13 4) @result{} 1\n"
+ * "(remainder -13 4) @result{} -1\n"
+ * "@end lisp"
+ */
+SCM
+scm_remainder (SCM x, SCM y)
+{
+ if (SCM_INUMP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_remainder);
+ else
+ {
+ long z = SCM_INUM (x) % yy;
+ return SCM_MAKINUM (z);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ if ((SCM_INUM (x) == SCM_MOST_NEGATIVE_FIXNUM)
+ && (mpz_cmp_ui (SCM_I_BIG_MPZ (y),
+ - SCM_MOST_NEGATIVE_FIXNUM) == 0))
+ {
+ /* Special case: x == fixnum-min && y == abs (fixnum-min) */
+ scm_remember_upto_here_1 (y);
+ return SCM_MAKINUM (0);
+ }
+ else
+ return x;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_remainder, x, y, SCM_ARG2, s_remainder);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_remainder);
+ else
+ {
+ SCM result = scm_i_mkbig ();
+ if (yy < 0)
+ yy = - yy;
+ mpz_tdiv_r_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ(x), yy);
+ scm_remember_upto_here_1 (x);
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_tdiv_r (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return scm_i_normbig (result);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_remainder, x, y, SCM_ARG2, s_remainder);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_remainder, x, y, SCM_ARG1, s_remainder);
+}
+
+
+SCM_GPROC (s_modulo, "modulo", 2, 0, 0, scm_modulo, g_modulo);
+/* "Return the modulo of the numbers @var{x} and @var{y}.\n"
+ * "@lisp\n"
+ * "(modulo 13 4) @result{} 1\n"
+ * "(modulo -13 4) @result{} 3\n"
+ * "@end lisp"
+ */
+SCM
+scm_modulo (SCM x, SCM y)
+{
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_modulo);
+ else
+ {
+ /* FIXME: I think this may be a bug on some arches -- results
+ of % with negative second arg are undefined... */
+ long z = xx % yy;
+ long result;
+
+ if (yy < 0)
+ {
+ if (z > 0)
+ result = z + yy;
+ else
+ result = z;
+ }
+ else
+ {
+ if (z < 0)
+ result = z + yy;
+ else
+ result = z;
+ }
+ return SCM_MAKINUM (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ int sgn_y = mpz_sgn (SCM_I_BIG_MPZ (y));
+ {
+ mpz_t z_x;
+ SCM result;
+
+ if (sgn_y < 0)
+ {
+ SCM pos_y = scm_i_clonebig (y, 0);
+ /* do this after the last scm_op */
+ mpz_init_set_si (z_x, xx);
+ result = pos_y; /* re-use this bignum */
+ mpz_mod (SCM_I_BIG_MPZ (result),
+ z_x,
+ SCM_I_BIG_MPZ (pos_y));
+ scm_remember_upto_here_1 (pos_y);
+ }
+ else
+ {
+ result = scm_i_mkbig ();
+ /* do this after the last scm_op */
+ mpz_init_set_si (z_x, xx);
+ mpz_mod (SCM_I_BIG_MPZ (result),
+ z_x,
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ }
+
+ if ((sgn_y < 0) && mpz_sgn (SCM_I_BIG_MPZ (result)) != 0)
+ mpz_add (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (y),
+ SCM_I_BIG_MPZ (result));
+ scm_remember_upto_here_1 (y);
+ /* and do this before the next one */
+ mpz_clear (z_x);
+ return scm_i_normbig (result);
+ }
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_modulo, x, y, SCM_ARG2, s_modulo);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ scm_num_overflow (s_modulo);
+ else
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_mod_ui (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ (yy < 0) ? - yy : yy);
+ scm_remember_upto_here_1 (x);
+ if ((yy < 0) && (mpz_sgn (SCM_I_BIG_MPZ (result)) != 0))
+ mpz_sub_ui (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (result),
+ - yy);
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ {
+ SCM result = scm_i_mkbig ();
+ int y_sgn = mpz_sgn (SCM_I_BIG_MPZ (y));
+ SCM pos_y = scm_i_clonebig (y, y_sgn >= 0);
+ mpz_mod (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (pos_y));
+
+ scm_remember_upto_here_1 (x);
+ if ((y_sgn < 0) && (mpz_sgn (SCM_I_BIG_MPZ (result)) != 0))
+ mpz_add (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (y),
+ SCM_I_BIG_MPZ (result));
+ scm_remember_upto_here_2 (y, pos_y);
+ return scm_i_normbig (result);
+ }
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_modulo, x, y, SCM_ARG2, s_modulo);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_modulo, x, y, SCM_ARG1, s_modulo);
+}
+
+SCM_GPROC1 (s_gcd, "gcd", scm_tc7_asubr, scm_gcd, g_gcd);
+/* "Return the greatest common divisor of all arguments.\n"
+ * "If called without arguments, 0 is returned."
+ */
+SCM
+scm_gcd (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ return SCM_UNBNDP (x) ? SCM_INUM0 : x;
+
+ if (SCM_INUMP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long xx = SCM_INUM (x);
+ long yy = SCM_INUM (y);
+ long u = xx < 0 ? -xx : xx;
+ long v = yy < 0 ? -yy : yy;
+ long result;
+ if (xx == 0)
+ result = v;
+ else if (yy == 0)
+ result = u;
+ else
+ {
+ long k = 1;
+ long t;
+ /* Determine a common factor 2^k */
+ while (!(1 & (u | v)))
+ {
+ k <<= 1;
+ u >>= 1;
+ v >>= 1;
+ }
+ /* Now, any factor 2^n can be eliminated */
+ if (u & 1)
+ t = -v;
+ else
+ {
+ t = u;
+ b3:
+ t = SCM_SRS (t, 1);
+ }
+ if (!(1 & t))
+ goto b3;
+ if (t > 0)
+ u = t;
+ else
+ v = -t;
+ t = u - v;
+ if (t != 0)
+ goto b3;
+ result = u * k;
+ }
+ return (SCM_POSFIXABLE (result)
+ ? SCM_MAKINUM (result)
+ : scm_i_long2big (result));
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ SCM mx = scm_i_mkbig ();
+ mpz_set_si (SCM_I_BIG_MPZ (mx), SCM_INUM (x));
+ scm_remember_upto_here_1 (x);
+ mpz_gcd (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (mx),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (mx, y);
+ return scm_i_normbig (result);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_gcd, x, y, SCM_ARG2, s_gcd);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ unsigned long result;
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ return scm_abs (x);
+ if (yy < 0)
+ yy = -yy;
+ result = mpz_gcd_ui (NULL, SCM_I_BIG_MPZ (x), yy);
+ scm_remember_upto_here_1 (x);
+ return (SCM_POSFIXABLE (result)
+ ? SCM_MAKINUM (result)
+ : scm_ulong2num (result));
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_gcd (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return scm_i_normbig (result);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_gcd, x, y, SCM_ARG2, s_gcd);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_gcd, x, y, SCM_ARG1, s_gcd);
+}
+
+SCM_GPROC1 (s_lcm, "lcm", scm_tc7_asubr, scm_lcm, g_lcm);
+/* "Return the least common multiple of the arguments.\n"
+ * "If called without arguments, 1 is returned."
+ */
+SCM
+scm_lcm (SCM n1, SCM n2)
+{
+ if (SCM_UNBNDP (n2))
+ {
+ if (SCM_UNBNDP (n1))
+ return SCM_MAKINUM (1L);
+ n2 = SCM_MAKINUM (1L);
+ }
+
+ SCM_GASSERT2 (SCM_INUMP (n1) || SCM_BIGP (n1),
+ g_lcm, n1, n2, SCM_ARG1, s_lcm);
+ SCM_GASSERT2 (SCM_INUMP (n2) || SCM_BIGP (n2),
+ g_lcm, n1, n2, SCM_ARGn, s_lcm);
+
+ if (SCM_INUMP (n1))
+ {
+ if (SCM_INUMP (n2))
+ {
+ SCM d = scm_gcd (n1, n2);
+ if (SCM_EQ_P (d, SCM_INUM0))
+ return d;
+ else
+ return scm_abs (scm_product (n1, scm_quotient (n2, d)));
+ }
+ else
+ {
+ /* inum n1, big n2 */
+ inumbig:
+ {
+ SCM result = scm_i_mkbig ();
+ long nn1 = SCM_INUM (n1);
+ if (nn1 == 0) return SCM_INUM0;
+ if (nn1 < 0) nn1 = - nn1;
+ mpz_lcm_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (n2), nn1);
+ scm_remember_upto_here_1 (n2);
+ return result;
+ }
+ }
+ }
+ else
+ {
+ /* big n1 */
+ if (SCM_INUMP (n2))
+ {
+ SCM_SWAP (n1, n2);
+ goto inumbig;
+ }
+ else
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_lcm(SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (n1),
+ SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_2(n1, n2);
+ /* shouldn't need to normalize b/c lcm of 2 bigs should be big */
+ return result;
+ }
+ }
+}
+
+#ifndef scm_long2num
+#define SCM_LOGOP_RETURN(x) scm_ulong2num(x)
+#else
+#define SCM_LOGOP_RETURN(x) SCM_MAKINUM(x)
+#endif
+
+/* Emulating 2's complement bignums with sign magnitude arithmetic:
+
+ Logand:
+ X Y Result Method:
+ (len)
+ + + + x (map digit:logand X Y)
+ + - + x (map digit:logand X (lognot (+ -1 Y)))
+ - + + y (map digit:logand (lognot (+ -1 X)) Y)
+ - - - (+ 1 (map digit:logior (+ -1 X) (+ -1 Y)))
+
+ Logior:
+ X Y Result Method:
+
+ + + + (map digit:logior X Y)
+ + - - y (+ 1 (map digit:logand (lognot X) (+ -1 Y)))
+ - + - x (+ 1 (map digit:logand (+ -1 X) (lognot Y)))
+ - - - x (+ 1 (map digit:logand (+ -1 X) (+ -1 Y)))
+
+ Logxor:
+ X Y Result Method:
+
+ + + + (map digit:logxor X Y)
+ + - - (+ 1 (map digit:logxor X (+ -1 Y)))
+ - + - (+ 1 (map digit:logxor (+ -1 X) Y))
+ - - + (map digit:logxor (+ -1 X) (+ -1 Y))
+
+ Logtest:
+ X Y Result
+
+ + + (any digit:logand X Y)
+ + - (any digit:logand X (lognot (+ -1 Y)))
+ - + (any digit:logand (lognot (+ -1 X)) Y)
+ - - #t
+
+*/
+
+SCM_DEFINE1 (scm_logand, "logand", scm_tc7_asubr,
+ (SCM n1, SCM n2),
+ "Return the bitwise AND of the integer arguments.\n\n"
+ "@lisp\n"
+ "(logand) @result{} -1\n"
+ "(logand 7) @result{} 7\n"
+ "(logand #b111 #b011 #b001) @result{} 1\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logand
+{
+ long int nn1;
+
+ if (SCM_UNBNDP (n2))
+ {
+ if (SCM_UNBNDP (n1))
+ return SCM_MAKINUM (-1);
+ else if (!SCM_NUMBERP (n1))
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+ else if (SCM_NUMBERP (n1))
+ return n1;
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+ }
+
+ if (SCM_INUMP (n1))
+ {
+ nn1 = SCM_INUM (n1);
+ if (SCM_INUMP (n2))
+ {
+ long nn2 = SCM_INUM (n2);
+ return SCM_MAKINUM (nn1 & nn2);
+ }
+ else if SCM_BIGP (n2)
+ {
+ intbig:
+ if (n1 == 0)
+ return SCM_INUM0;
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_t nn1_z;
+ mpz_init_set_si (nn1_z, nn1);
+ mpz_and (SCM_I_BIG_MPZ (result_z), nn1_z, SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_1 (n2);
+ mpz_clear (nn1_z);
+ return scm_i_normbig (result_z);
+ }
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else if (SCM_BIGP (n1))
+ {
+ if (SCM_INUMP (n2))
+ {
+ SCM_SWAP (n1, n2);
+ nn1 = SCM_INUM (n1);
+ goto intbig;
+ }
+ else if (SCM_BIGP (n2))
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_and (SCM_I_BIG_MPZ (result_z),
+ SCM_I_BIG_MPZ (n1),
+ SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_2 (n1, n2);
+ return scm_i_normbig (result_z);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE1 (scm_logior, "logior", scm_tc7_asubr,
+ (SCM n1, SCM n2),
+ "Return the bitwise OR of the integer arguments.\n\n"
+ "@lisp\n"
+ "(logior) @result{} 0\n"
+ "(logior 7) @result{} 7\n"
+ "(logior #b000 #b001 #b011) @result{} 3\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logior
+{
+ long int nn1;
+
+ if (SCM_UNBNDP (n2))
+ {
+ if (SCM_UNBNDP (n1))
+ return SCM_INUM0;
+ else if (SCM_NUMBERP (n1))
+ return n1;
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+ }
+
+ if (SCM_INUMP (n1))
+ {
+ nn1 = SCM_INUM (n1);
+ if (SCM_INUMP (n2))
+ {
+ long nn2 = SCM_INUM (n2);
+ return SCM_MAKINUM (nn1 | nn2);
+ }
+ else if (SCM_BIGP (n2))
+ {
+ intbig:
+ if (nn1 == 0)
+ return n2;
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_t nn1_z;
+ mpz_init_set_si (nn1_z, nn1);
+ mpz_ior (SCM_I_BIG_MPZ (result_z), nn1_z, SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_1 (n2);
+ mpz_clear (nn1_z);
+ return result_z;
+ }
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else if (SCM_BIGP (n1))
+ {
+ if (SCM_INUMP (n2))
+ {
+ SCM_SWAP (n1, n2);
+ nn1 = SCM_INUM (n1);
+ goto intbig;
+ }
+ else if (SCM_BIGP (n2))
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_ior (SCM_I_BIG_MPZ (result_z),
+ SCM_I_BIG_MPZ (n1),
+ SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_2 (n1, n2);
+ return result_z;
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE1 (scm_logxor, "logxor", scm_tc7_asubr,
+ (SCM n1, SCM n2),
+ "Return the bitwise XOR of the integer arguments. A bit is\n"
+ "set in the result if it is set in an odd number of arguments.\n"
+ "@lisp\n"
+ "(logxor) @result{} 0\n"
+ "(logxor 7) @result{} 7\n"
+ "(logxor #b000 #b001 #b011) @result{} 2\n"
+ "(logxor #b000 #b001 #b011 #b011) @result{} 1\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logxor
+{
+ long int nn1;
+
+ if (SCM_UNBNDP (n2))
+ {
+ if (SCM_UNBNDP (n1))
+ return SCM_INUM0;
+ else if (SCM_NUMBERP (n1))
+ return n1;
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+ }
+
+ if (SCM_INUMP (n1))
+ {
+ nn1 = SCM_INUM (n1);
+ if (SCM_INUMP (n2))
+ {
+ long nn2 = SCM_INUM (n2);
+ return SCM_MAKINUM (nn1 ^ nn2);
+ }
+ else if (SCM_BIGP (n2))
+ {
+ intbig:
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_t nn1_z;
+ mpz_init_set_si (nn1_z, nn1);
+ mpz_xor (SCM_I_BIG_MPZ (result_z), nn1_z, SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_1 (n2);
+ mpz_clear (nn1_z);
+ return scm_i_normbig (result_z);
+ }
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else if (SCM_BIGP (n1))
+ {
+ if (SCM_INUMP (n2))
+ {
+ SCM_SWAP (n1, n2);
+ nn1 = SCM_INUM (n1);
+ goto intbig;
+ }
+ else if (SCM_BIGP (n2))
+ {
+ SCM result_z = scm_i_mkbig ();
+ mpz_xor (SCM_I_BIG_MPZ (result_z),
+ SCM_I_BIG_MPZ (n1),
+ SCM_I_BIG_MPZ (n2));
+ scm_remember_upto_here_2 (n1, n2);
+ return scm_i_normbig (result_z);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, n2);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n1);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_logtest, "logtest", 2, 0, 0,
+ (SCM j, SCM k),
+ "@lisp\n"
+ "(logtest j k) @equiv{} (not (zero? (logand j k)))\n\n"
+ "(logtest #b0100 #b1011) @result{} #f\n"
+ "(logtest #b0100 #b0111) @result{} #t\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logtest
+{
+ long int nj;
+
+ if (SCM_INUMP (j))
+ {
+ nj = SCM_INUM (j);
+ if (SCM_INUMP (k))
+ {
+ long nk = SCM_INUM (k);
+ return SCM_BOOL (nj & nk);
+ }
+ else if (SCM_BIGP (k))
+ {
+ intbig:
+ if (nj == 0)
+ return SCM_BOOL_F;
+ {
+ SCM result;
+ mpz_t nj_z;
+ mpz_init_set_si (nj_z, nj);
+ mpz_and (nj_z, nj_z, SCM_I_BIG_MPZ (k));
+ scm_remember_upto_here_1 (k);
+ result = SCM_BOOL (mpz_sgn (nj_z) != 0);
+ mpz_clear (nj_z);
+ return result;
+ }
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, k);
+ }
+ else if (SCM_BIGP (j))
+ {
+ if (SCM_INUMP (k))
+ {
+ SCM_SWAP (j, k);
+ nj = SCM_INUM (j);
+ goto intbig;
+ }
+ else if (SCM_BIGP (k))
+ {
+ SCM result;
+ mpz_t result_z;
+ mpz_init (result_z);
+ mpz_and (result_z,
+ SCM_I_BIG_MPZ (j),
+ SCM_I_BIG_MPZ (k));
+ scm_remember_upto_here_2 (j, k);
+ result = SCM_BOOL (mpz_sgn (result_z) != 0);
+ mpz_clear (result_z);
+ return result;
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, k);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, j);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_logbit_p, "logbit?", 2, 0, 0,
+ (SCM index, SCM j),
+ "@lisp\n"
+ "(logbit? index j) @equiv{} (logtest (integer-expt 2 index) j)\n\n"
+ "(logbit? 0 #b1101) @result{} #t\n"
+ "(logbit? 1 #b1101) @result{} #f\n"
+ "(logbit? 2 #b1101) @result{} #t\n"
+ "(logbit? 3 #b1101) @result{} #t\n"
+ "(logbit? 4 #b1101) @result{} #f\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logbit_p
+{
+ unsigned long int iindex;
+
+ SCM_VALIDATE_INUM_MIN (SCM_ARG1, index, 0);
+ iindex = (unsigned long int) SCM_INUM (index);
+
+ if (SCM_INUMP (j))
+ return SCM_BOOL ((1L << iindex) & SCM_INUM (j));
+ else if (SCM_BIGP (j))
+ {
+ int val = mpz_tstbit (SCM_I_BIG_MPZ (j), iindex);
+ scm_remember_upto_here_1 (j);
+ return SCM_BOOL (val);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG2, j);
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_lognot, "lognot", 1, 0, 0,
+ (SCM n),
+ "Return the integer which is the ones-complement of the integer\n"
+ "argument.\n"
+ "\n"
+ "@lisp\n"
+ "(number->string (lognot #b10000000) 2)\n"
+ " @result{} \"-10000001\"\n"
+ "(number->string (lognot #b0) 2)\n"
+ " @result{} \"-1\"\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_lognot
+{
+ if (SCM_INUMP (n)) {
+ /* No overflow here, just need to toggle all the bits making up the inum.
+ Enhancement: No need to strip the tag and add it back, could just xor
+ a block of 1 bits, if that worked with the various debug versions of
+ the SCM typedef. */
+ return SCM_MAKINUM (~ SCM_INUM (n));
+
+ } else if (SCM_BIGP (n)) {
+ SCM result = scm_i_mkbig ();
+ mpz_com (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (n));
+ scm_remember_upto_here_1 (n);
+ return result;
+
+ } else {
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n);
+ }
+}
+#undef FUNC_NAME
+
+/* returns 0 if IN is not an integer. OUT must already be
+ initialized. */
+static int
+coerce_to_big (SCM in, mpz_t out)
+{
+ if (SCM_BIGP (in))
+ mpz_set (out, SCM_I_BIG_MPZ (in));
+ else if (SCM_INUMP (in))
+ mpz_set_si (out, SCM_INUM (in));
+ else
+ return 0;
+
+ return 1;
+}
+
+SCM_DEFINE (scm_modulo_expt, "modulo-expt", 3, 0, 0,
+ (SCM n, SCM k, SCM m),
+ "Return @var{n} raised to the integer exponent\n"
+ "@var{k}, modulo @var{m}.\n"
+ "\n"
+ "@lisp\n"
+ "(modulo-expt 2 3 5)\n"
+ " @result{} 3\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_modulo_expt
+{
+ mpz_t n_tmp;
+ mpz_t k_tmp;
+ mpz_t m_tmp;
+
+ /* There are two classes of error we might encounter --
+ 1) Math errors, which we'll report by calling scm_num_overflow,
+ and
+ 2) wrong-type errors, which of course we'll report by calling
+ SCM_WRONG_TYPE_ARG.
+ We don't report those errors immediately, however; instead we do
+ some cleanup first. These variables tell us which error (if
+ any) we should report after cleaning up.
+ */
+ int report_overflow = 0;
+
+ int position_of_wrong_type = 0;
+ SCM value_of_wrong_type = SCM_INUM0;
+
+ SCM result = SCM_UNDEFINED;
+
+ mpz_init (n_tmp);
+ mpz_init (k_tmp);
+ mpz_init (m_tmp);
+
+ if (SCM_EQ_P (m, SCM_INUM0))
+ {
+ report_overflow = 1;
+ goto cleanup;
+ }
+
+ if (!coerce_to_big (n, n_tmp))
+ {
+ value_of_wrong_type = n;
+ position_of_wrong_type = 1;
+ goto cleanup;
+ }
+
+ if (!coerce_to_big (k, k_tmp))
+ {
+ value_of_wrong_type = k;
+ position_of_wrong_type = 2;
+ goto cleanup;
+ }
+
+ if (!coerce_to_big (m, m_tmp))
+ {
+ value_of_wrong_type = m;
+ position_of_wrong_type = 3;
+ goto cleanup;
+ }
+
+ /* if the exponent K is negative, and we simply call mpz_powm, we
+ will get a divide-by-zero exception when an inverse 1/n mod m
+ doesn't exist (or is not unique). Since exceptions are hard to
+ handle, we'll attempt the inversion "by hand" -- that way, we get
+ a simple failure code, which is easy to handle. */
+
+ if (-1 == mpz_sgn (k_tmp))
+ {
+ if (!mpz_invert (n_tmp, n_tmp, m_tmp))
+ {
+ report_overflow = 1;
+ goto cleanup;
+ }
+ mpz_neg (k_tmp, k_tmp);
+ }
+
+ result = scm_i_mkbig ();
+ mpz_powm (SCM_I_BIG_MPZ (result),
+ n_tmp,
+ k_tmp,
+ m_tmp);
+
+ if (mpz_sgn (m_tmp) < 0 && mpz_sgn (SCM_I_BIG_MPZ (result)) != 0)
+ mpz_add (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result), m_tmp);
+
+ cleanup:
+ mpz_clear (m_tmp);
+ mpz_clear (k_tmp);
+ mpz_clear (n_tmp);
+
+ if (report_overflow)
+ scm_num_overflow (FUNC_NAME);
+
+ if (position_of_wrong_type)
+ SCM_WRONG_TYPE_ARG (position_of_wrong_type,
+ value_of_wrong_type);
+
+ return scm_i_normbig (result);
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_integer_expt, "integer-expt", 2, 0, 0,
+ (SCM n, SCM k),
+ "Return @var{n} raised to the non-negative integer exponent\n"
+ "@var{k}.\n"
+ "\n"
+ "@lisp\n"
+ "(integer-expt 2 5)\n"
+ " @result{} 32\n"
+ "(integer-expt -3 3)\n"
+ " @result{} -27\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_integer_expt
+{
+ long i2 = 0;
+ SCM z_i2 = SCM_BOOL_F;
+ int i2_is_big = 0;
+ SCM acc = SCM_MAKINUM (1L);
+
+ /* 0^0 == 1 according to R5RS */
+ if (SCM_EQ_P (n, SCM_INUM0) || SCM_EQ_P (n, acc))
+ return SCM_FALSEP (scm_zero_p(k)) ? n : acc;
+ else if (SCM_EQ_P (n, SCM_MAKINUM (-1L)))
+ return SCM_FALSEP (scm_even_p (k)) ? n : acc;
+
+ if (SCM_INUMP (k))
+ i2 = SCM_INUM (k);
+ else if (SCM_BIGP (k))
+ {
+ z_i2 = scm_i_clonebig (k, 1);
+ scm_remember_upto_here_1 (k);
+ i2_is_big = 1;
+ }
+ else if (SCM_REALP (k))
+ {
+ double r = SCM_REAL_VALUE (k);
+ if (floor (r) != r)
+ SCM_WRONG_TYPE_ARG (2, k);
+ if ((r > SCM_MOST_POSITIVE_FIXNUM) || (r < SCM_MOST_NEGATIVE_FIXNUM))
+ {
+ z_i2 = scm_i_mkbig ();
+ mpz_set_d (SCM_I_BIG_MPZ (z_i2), r);
+ i2_is_big = 1;
+ }
+ else
+ {
+ i2 = r;
+ }
+ }
+ else
+ SCM_WRONG_TYPE_ARG (2, k);
+
+ if (i2_is_big)
+ {
+ if (mpz_sgn(SCM_I_BIG_MPZ (z_i2)) == -1)
+ {
+ mpz_neg (SCM_I_BIG_MPZ (z_i2), SCM_I_BIG_MPZ (z_i2));
+ n = scm_divide (n, SCM_UNDEFINED);
+ }
+ while (1)
+ {
+ if (mpz_sgn(SCM_I_BIG_MPZ (z_i2)) == 0)
+ {
+ return acc;
+ }
+ if (mpz_cmp_ui(SCM_I_BIG_MPZ (z_i2), 1) == 0)
+ {
+ return scm_product (acc, n);
+ }
+ if (mpz_tstbit(SCM_I_BIG_MPZ (z_i2), 0))
+ acc = scm_product (acc, n);
+ n = scm_product (n, n);
+ mpz_fdiv_q_2exp (SCM_I_BIG_MPZ (z_i2), SCM_I_BIG_MPZ (z_i2), 1);
+ }
+ }
+ else
+ {
+ if (i2 < 0)
+ {
+ i2 = -i2;
+ n = scm_divide (n, SCM_UNDEFINED);
+ }
+ while (1)
+ {
+ if (0 == i2)
+ return acc;
+ if (1 == i2)
+ return scm_product (acc, n);
+ if (i2 & 1)
+ acc = scm_product (acc, n);
+ n = scm_product (n, n);
+ i2 >>= 1;
+ }
+ }
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_ash, "ash", 2, 0, 0,
+ (SCM n, SCM cnt),
+ "Return @var{n} shifted left by @var{cnt} bits, or shifted right\n"
+ "if @var{cnt} is negative. This is an ``arithmetic'' shift.\n"
+ "\n"
+ "This is effectively a multiplication by 2^@var{cnt}}, and when\n"
+ "@var{cnt} is negative it's a division, rounded towards negative\n"
+ "infinity. (Note that this is not the same rounding as\n"
+ "@code{quotient} does.)\n"
+ "\n"
+ "With @var{n} viewed as an infinite precision twos complement,\n"
+ "@code{ash} means a left shift introducing zero bits, or a right\n"
+ "shift dropping bits.\n"
+ "\n"
+ "@lisp\n"
+ "(number->string (ash #b1 3) 2) @result{} \"1000\"\n"
+ "(number->string (ash #b1010 -1) 2) @result{} \"101\"\n"
+ "\n"
+ ";; -23 is bits ...11101001, -6 is bits ...111010\n"
+ "(ash -23 -2) @result{} -6\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_ash
+{
+ long bits_to_shift;
+
+ SCM_VALIDATE_INUM (2, cnt);
+
+ bits_to_shift = SCM_INUM (cnt);
+
+ if (bits_to_shift < 0)
+ {
+ /* Shift right by abs(cnt) bits. This is realized as a division
+ by div:=2^abs(cnt). However, to guarantee the floor
+ rounding, negative values require some special treatment.
+ */
+ SCM div = scm_integer_expt (SCM_MAKINUM (2),
+ SCM_MAKINUM (-bits_to_shift));
+
+ /* scm_quotient assumes its arguments are integers, but it's legal to (ash 1/2 -1) */
+ if (SCM_FALSEP (scm_negative_p (n)))
+ return scm_quotient (n, div);
+ else
+ return scm_sum (SCM_MAKINUM (-1L),
+ scm_quotient (scm_sum (SCM_MAKINUM (1L), n), div));
+ }
+ else
+ /* Shift left is done by multiplication with 2^CNT */
+ return scm_product (n, scm_integer_expt (SCM_MAKINUM (2), cnt));
+}
+#undef FUNC_NAME
+
+
+#define MIN(x,y) ((x) < (y) ? (x) : (y))
+
+SCM_DEFINE (scm_bit_extract, "bit-extract", 3, 0, 0,
+ (SCM n, SCM start, SCM end),
+ "Return the integer composed of the @var{start} (inclusive)\n"
+ "through @var{end} (exclusive) bits of @var{n}. The\n"
+ "@var{start}th bit becomes the 0-th bit in the result.\n"
+ "\n"
+ "@lisp\n"
+ "(number->string (bit-extract #b1101101010 0 4) 2)\n"
+ " @result{} \"1010\"\n"
+ "(number->string (bit-extract #b1101101010 4 9) 2)\n"
+ " @result{} \"10110\"\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_bit_extract
+{
+ unsigned long int istart, iend, bits;
+ SCM_VALIDATE_INUM_MIN_COPY (2, start,0, istart);
+ SCM_VALIDATE_INUM_MIN_COPY (3, end, 0, iend);
+ SCM_ASSERT_RANGE (3, end, (iend >= istart));
+
+ /* how many bits to keep */
+ bits = iend - istart;
+
+ if (SCM_INUMP (n))
+ {
+ long int in = SCM_INUM (n);
+
+ /* When istart>=SCM_I_FIXNUM_BIT we can just limit the shift to
+ SCM_I_FIXNUM_BIT-1 to get either 0 or -1 per the sign of "in".
+ FIXME: This shift relies on signed right shifts being arithmetic,
+ which is not guaranteed by C99. */
+ in >>= MIN (istart, SCM_I_FIXNUM_BIT-1);
+
+ if (in < 0 && bits >= SCM_I_FIXNUM_BIT)
+ {
+ /* Since we emulate two's complement encoded numbers, this
+ * special case requires us to produce a result that has
+ * more bits than can be stored in a fixnum.
+ */
+ SCM result = scm_i_long2big (in);
+ mpz_fdiv_r_2exp (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result),
+ bits);
+ return result;
+ }
+
+ /* mask down to requisite bits */
+ bits = MIN (bits, SCM_I_FIXNUM_BIT);
+ return SCM_MAKINUM (in & ((1L << bits) - 1));
+ }
+ else if (SCM_BIGP (n))
+ {
+ SCM result;
+ if (bits == 1)
+ {
+ result = SCM_MAKINUM (mpz_tstbit (SCM_I_BIG_MPZ (n), istart));
+ }
+ else
+ {
+ /* ENHANCE-ME: It'd be nice not to allocate a new bignum when
+ bits<SCM_I_FIXNUM_BIT. Would want some help from GMP to get
+ such bits into a ulong. */
+ result = scm_i_mkbig ();
+ mpz_fdiv_q_2exp (SCM_I_BIG_MPZ(result), SCM_I_BIG_MPZ(n), istart);
+ mpz_fdiv_r_2exp (SCM_I_BIG_MPZ(result), SCM_I_BIG_MPZ(result), bits);
+ result = scm_i_normbig (result);
+ }
+ scm_remember_upto_here_1 (n);
+ return result;
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n);
+}
+#undef FUNC_NAME
+
+
+static const char scm_logtab[] = {
+ 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
+};
+
+SCM_DEFINE (scm_logcount, "logcount", 1, 0, 0,
+ (SCM n),
+ "Return the number of bits in integer @var{n}. If integer is\n"
+ "positive, the 1-bits in its binary representation are counted.\n"
+ "If negative, the 0-bits in its two's-complement binary\n"
+ "representation are counted. If 0, 0 is returned.\n"
+ "\n"
+ "@lisp\n"
+ "(logcount #b10101010)\n"
+ " @result{} 4\n"
+ "(logcount 0)\n"
+ " @result{} 0\n"
+ "(logcount -2)\n"
+ " @result{} 1\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_logcount
+{
+ if (SCM_INUMP (n))
+ {
+ unsigned long int c = 0;
+ long int nn = SCM_INUM (n);
+ if (nn < 0)
+ nn = -1 - nn;
+ while (nn)
+ {
+ c += scm_logtab[15 & nn];
+ nn >>= 4;
+ }
+ return SCM_MAKINUM (c);
+ }
+ else if (SCM_BIGP (n))
+ {
+ unsigned long count;
+ if (mpz_sgn (SCM_I_BIG_MPZ (n)) >= 0)
+ count = mpz_popcount (SCM_I_BIG_MPZ (n));
+ else
+ count = mpz_hamdist (SCM_I_BIG_MPZ (n), z_negative_one);
+ scm_remember_upto_here_1 (n);
+ return SCM_MAKINUM (count);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n);
+}
+#undef FUNC_NAME
+
+
+static const char scm_ilentab[] = {
+ 0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4
+};
+
+
+SCM_DEFINE (scm_integer_length, "integer-length", 1, 0, 0,
+ (SCM n),
+ "Return the number of bits necessary to represent @var{n}.\n"
+ "\n"
+ "@lisp\n"
+ "(integer-length #b10101010)\n"
+ " @result{} 8\n"
+ "(integer-length 0)\n"
+ " @result{} 0\n"
+ "(integer-length #b1111)\n"
+ " @result{} 4\n"
+ "@end lisp")
+#define FUNC_NAME s_scm_integer_length
+{
+ if (SCM_INUMP (n))
+ {
+ unsigned long int c = 0;
+ unsigned int l = 4;
+ long int nn = SCM_INUM (n);
+ if (nn < 0)
+ nn = -1 - nn;
+ while (nn)
+ {
+ c += 4;
+ l = scm_ilentab [15 & nn];
+ nn >>= 4;
+ }
+ return SCM_MAKINUM (c - 4 + l);
+ }
+ else if (SCM_BIGP (n))
+ {
+ /* mpz_sizeinbase looks at the absolute value of negatives, whereas we
+ want a ones-complement. If n is ...111100..00 then mpz_sizeinbase is
+ 1 too big, so check for that and adjust. */
+ size_t size = mpz_sizeinbase (SCM_I_BIG_MPZ (n), 2);
+ if (mpz_sgn (SCM_I_BIG_MPZ (n)) < 0
+ && mpz_scan0 (SCM_I_BIG_MPZ (n), /* no 0 bits above the lowest 1 */
+ mpz_scan1 (SCM_I_BIG_MPZ (n), 0)) == ULONG_MAX)
+ size--;
+ scm_remember_upto_here_1 (n);
+ return SCM_MAKINUM (size);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARG1, n);
+}
+#undef FUNC_NAME
+
+/*** NUMBERS -> STRINGS ***/
+int scm_dblprec;
+static const double fx[] =
+{ 0.0, 5e-1, 5e-2, 5e-3, 5e-4, 5e-5,
+ 5e-6, 5e-7, 5e-8, 5e-9, 5e-10,
+ 5e-11, 5e-12, 5e-13, 5e-14, 5e-15,
+ 5e-16, 5e-17, 5e-18, 5e-19, 5e-20};
+
+static size_t
+idbl2str (double f, char *a)
+{
+ int efmt, dpt, d, i, wp = scm_dblprec;
+ size_t ch = 0;
+ int exp = 0;
+
+ if (f == 0.0)
+ {
+#ifdef HAVE_COPYSIGN
+ double sgn = copysign (1.0, f);
+
+ if (sgn < 0.0)
+ a[ch++] = '-';
+#endif
+
+ goto zero; /*{a[0]='0'; a[1]='.'; a[2]='0'; return 3;} */
+ }
+
+ if (xisinf (f))
+ {
+ if (f < 0)
+ strcpy (a, "-inf.0");
+ else
+ strcpy (a, "+inf.0");
+ return ch+6;
+ }
+ else if (xisnan (f))
+ {
+ strcpy (a, "+nan.0");
+ return ch+6;
+ }
+
+ if (f < 0.0)
+ {
+ f = -f;
+ a[ch++] = '-';
+ }
+
+#ifdef DBL_MIN_10_EXP /* Prevent unnormalized values, as from
+ make-uniform-vector, from causing infinite loops. */
+ while (f < 1.0)
+ {
+ f *= 10.0;
+ if (exp-- < DBL_MIN_10_EXP)
+ {
+ a[ch++] = '#';
+ a[ch++] = '.';
+ a[ch++] = '#';
+ return ch;
+ }
+ }
+ while (f > 10.0)
+ {
+ f *= 0.10;
+ if (exp++ > DBL_MAX_10_EXP)
+ {
+ a[ch++] = '#';
+ a[ch++] = '.';
+ a[ch++] = '#';
+ return ch;
+ }
+ }
+#else
+ while (f < 1.0)
+ {
+ f *= 10.0;
+ exp--;
+ }
+ while (f > 10.0)
+ {
+ f /= 10.0;
+ exp++;
+ }
+#endif
+ if (f + fx[wp] >= 10.0)
+ {
+ f = 1.0;
+ exp++;
+ }
+ zero:
+#ifdef ENGNOT
+ dpt = (exp + 9999) % 3;
+ exp -= dpt++;
+ efmt = 1;
+#else
+ efmt = (exp < -3) || (exp > wp + 2);
+ if (!efmt)
+ {
+ if (exp < 0)
+ {
+ a[ch++] = '0';
+ a[ch++] = '.';
+ dpt = exp;
+ while (++dpt)
+ a[ch++] = '0';
+ }
+ else
+ dpt = exp + 1;
+ }
+ else
+ dpt = 1;
+#endif
+
+ do
+ {
+ d = f;
+ f -= d;
+ a[ch++] = d + '0';
+ if (f < fx[wp])
+ break;
+ if (f + fx[wp] >= 1.0)
+ {
+ a[ch - 1]++;
+ break;
+ }
+ f *= 10.0;
+ if (!(--dpt))
+ a[ch++] = '.';
+ }
+ while (wp--);
+
+ if (dpt > 0)
+ {
+#ifndef ENGNOT
+ if ((dpt > 4) && (exp > 6))
+ {
+ d = (a[0] == '-' ? 2 : 1);
+ for (i = ch++; i > d; i--)
+ a[i] = a[i - 1];
+ a[d] = '.';
+ efmt = 1;
+ }
+ else
+#endif
+ {
+ while (--dpt)
+ a[ch++] = '0';
+ a[ch++] = '.';
+ }
+ }
+ if (a[ch - 1] == '.')
+ a[ch++] = '0'; /* trailing zero */
+ if (efmt && exp)
+ {
+ a[ch++] = 'e';
+ if (exp < 0)
+ {
+ exp = -exp;
+ a[ch++] = '-';
+ }
+ for (i = 10; i <= exp; i *= 10);
+ for (i /= 10; i; i /= 10)
+ {
+ a[ch++] = exp / i + '0';
+ exp %= i;
+ }
+ }
+ return ch;
+}
+
+
+static size_t
+iflo2str (SCM flt, char *str)
+{
+ size_t i;
+ if (SCM_REALP (flt))
+ i = idbl2str (SCM_REAL_VALUE (flt), str);
+ else
+ {
+ i = idbl2str (SCM_COMPLEX_REAL (flt), str);
+ if (SCM_COMPLEX_IMAG (flt) != 0.0)
+ {
+ double imag = SCM_COMPLEX_IMAG (flt);
+ /* Don't output a '+' for negative numbers or for Inf and
+ NaN. They will provide their own sign. */
+ if (0 <= imag && !xisinf (imag) && !xisnan (imag))
+ str[i++] = '+';
+ i += idbl2str (imag, &str[i]);
+ str[i++] = 'i';
+ }
+ }
+ return i;
+}
+
+/* convert a long to a string (unterminated). returns the number of
+ characters in the result.
+ rad is output base
+ p is destination: worst case (base 2) is SCM_INTBUFLEN */
+size_t
+scm_iint2str (long num, int rad, char *p)
+{
+ size_t j = 1;
+ size_t i;
+ unsigned long n = (num < 0) ? -num : num;
+
+ for (n /= rad; n > 0; n /= rad)
+ j++;
+
+ i = j;
+ if (num < 0)
+ {
+ *p++ = '-';
+ j++;
+ n = -num;
+ }
+ else
+ n = num;
+ while (i--)
+ {
+ int d = n % rad;
+
+ n /= rad;
+ p[i] = d + ((d < 10) ? '0' : 'a' - 10);
+ }
+ return j;
+}
+
+SCM_DEFINE (scm_number_to_string, "number->string", 1, 1, 0,
+ (SCM n, SCM radix),
+ "Return a string holding the external representation of the\n"
+ "number @var{n} in the given @var{radix}. If @var{n} is\n"
+ "inexact, a radix of 10 will be used.")
+#define FUNC_NAME s_scm_number_to_string
+{
+ int base;
+
+ if (SCM_UNBNDP (radix))
+ base = 10;
+ else
+ {
+ SCM_VALIDATE_INUM (2, radix);
+ base = SCM_INUM (radix);
+ /* FIXME: ask if range limit was OK, and if so, document */
+ SCM_ASSERT_RANGE (2, radix, (base >= 2) && (base <= 36));
+ }
+
+ if (SCM_INUMP (n))
+ {
+ char num_buf [SCM_INTBUFLEN];
+ size_t length = scm_iint2str (SCM_INUM (n), base, num_buf);
+ return scm_mem2string (num_buf, length);
+ }
+ else if (SCM_BIGP (n))
+ {
+ char *str = mpz_get_str (NULL, base, SCM_I_BIG_MPZ (n));
+ scm_remember_upto_here_1 (n);
+ return scm_take0str (str);
+ }
+ else if (SCM_FRACTIONP (n))
+ {
+ scm_i_fraction_reduce (n);
+ return scm_string_append (scm_list_3 (scm_number_to_string (SCM_FRACTION_NUMERATOR (n), radix),
+ scm_mem2string ("/", 1),
+ scm_number_to_string (SCM_FRACTION_DENOMINATOR (n), radix)));
+ }
+ else if (SCM_INEXACTP (n))
+ {
+ char num_buf [FLOBUFLEN];
+ return scm_mem2string (num_buf, iflo2str (n, num_buf));
+ }
+ else
+ SCM_WRONG_TYPE_ARG (1, n);
+}
+#undef FUNC_NAME
+
+
+/* These print routines used to be stubbed here so that scm_repl.c
+ wouldn't need SCM_BIGDIG conditionals (pre GMP) */
+
+int
+scm_print_real (SCM sexp, SCM port, scm_print_state *pstate SCM_UNUSED)
+{
+ char num_buf[FLOBUFLEN];
+ scm_lfwrite (num_buf, iflo2str (sexp, num_buf), port);
+ return !0;
+}
+
+int
+scm_print_complex (SCM sexp, SCM port, scm_print_state *pstate SCM_UNUSED)
+
+{
+ char num_buf[FLOBUFLEN];
+ scm_lfwrite (num_buf, iflo2str (sexp, num_buf), port);
+ return !0;
+}
+
+int
+scm_i_print_fraction (SCM sexp, SCM port, scm_print_state *pstate SCM_UNUSED)
+{
+ SCM str;
+ scm_i_fraction_reduce (sexp);
+ str = scm_number_to_string (sexp, SCM_UNDEFINED);
+ scm_lfwrite (SCM_STRING_CHARS (str), SCM_STRING_LENGTH (str), port);
+ scm_remember_upto_here_1 (str);
+ return !0;
+}
+
+int
+scm_bigprint (SCM exp, SCM port, scm_print_state *pstate SCM_UNUSED)
+{
+ char *str = mpz_get_str (NULL, 10, SCM_I_BIG_MPZ (exp));
+ scm_remember_upto_here_1 (exp);
+ scm_lfwrite (str, (size_t) strlen (str), port);
+ free (str);
+ return !0;
+}
+/*** END nums->strs ***/
+
+
+/*** STRINGS -> NUMBERS ***/
+
+/* The following functions implement the conversion from strings to numbers.
+ * The implementation somehow follows the grammar for numbers as it is given
+ * in R5RS. Thus, the functions resemble syntactic units (<ureal R>,
+ * <uinteger R>, ...) that are used to build up numbers in the grammar. Some
+ * points should be noted about the implementation:
+ * * Each function keeps a local index variable 'idx' that points at the
+ * current position within the parsed string. The global index is only
+ * updated if the function could parse the corresponding syntactic unit
+ * successfully.
+ * * Similarly, the functions keep track of indicators of inexactness ('#',
+ * '.' or exponents) using local variables ('hash_seen', 'x'). Again, the
+ * global exactness information is only updated after each part has been
+ * successfully parsed.
+ * * Sequences of digits are parsed into temporary variables holding fixnums.
+ * Only if these fixnums would overflow, the result variables are updated
+ * using the standard functions scm_add, scm_product, scm_divide etc. Then,
+ * the temporary variables holding the fixnums are cleared, and the process
+ * starts over again. If for example fixnums were able to store five decimal
+ * digits, a number 1234567890 would be parsed in two parts 12345 and 67890,
+ * and the result was computed as 12345 * 100000 + 67890. In other words,
+ * only every five digits two bignum operations were performed.
+ */
+
+enum t_exactness {NO_EXACTNESS, INEXACT, EXACT};
+
+/* R5RS, section 7.1.1, lexical structure of numbers: <uinteger R>. */
+
+/* In non ASCII-style encodings the following macro might not work. */
+#define XDIGIT2UINT(d) (isdigit (d) ? (d) - '0' : tolower (d) - 'a' + 10)
+
+static SCM
+mem2uinteger (const char* mem, size_t len, unsigned int *p_idx,
+ unsigned int radix, enum t_exactness *p_exactness)
+{
+ unsigned int idx = *p_idx;
+ unsigned int hash_seen = 0;
+ scm_t_bits shift = 1;
+ scm_t_bits add = 0;
+ unsigned int digit_value;
+ SCM result;
+ char c;
+
+ if (idx == len)
+ return SCM_BOOL_F;
+
+ c = mem[idx];
+ if (!isxdigit (c))
+ return SCM_BOOL_F;
+ digit_value = XDIGIT2UINT (c);
+ if (digit_value >= radix)
+ return SCM_BOOL_F;
+
+ idx++;
+ result = SCM_MAKINUM (digit_value);
+ while (idx != len)
+ {
+ char c = mem[idx];
+ if (isxdigit (c))
+ {
+ if (hash_seen)
+ break;
+ digit_value = XDIGIT2UINT (c);
+ if (digit_value >= radix)
+ break;
+ }
+ else if (c == '#')
+ {
+ hash_seen = 1;
+ digit_value = 0;
+ }
+ else
+ break;
+
+ idx++;
+ if (SCM_MOST_POSITIVE_FIXNUM / radix < shift)
+ {
+ result = scm_product (result, SCM_MAKINUM (shift));
+ if (add > 0)
+ result = scm_sum (result, SCM_MAKINUM (add));
+
+ shift = radix;
+ add = digit_value;
+ }
+ else
+ {
+ shift = shift * radix;
+ add = add * radix + digit_value;
+ }
+ };
+
+ if (shift > 1)
+ result = scm_product (result, SCM_MAKINUM (shift));
+ if (add > 0)
+ result = scm_sum (result, SCM_MAKINUM (add));
+
+ *p_idx = idx;
+ if (hash_seen)
+ *p_exactness = INEXACT;
+
+ return result;
+}
+
+
+/* R5RS, section 7.1.1, lexical structure of numbers: <decimal 10>. Only
+ * covers the parts of the rules that start at a potential point. The value
+ * of the digits up to the point have been parsed by the caller and are given
+ * in variable result. The content of *p_exactness indicates, whether a hash
+ * has already been seen in the digits before the point.
+ */
+
+/* In non ASCII-style encodings the following macro might not work. */
+#define DIGIT2UINT(d) ((d) - '0')
+
+static SCM
+mem2decimal_from_point (SCM result, const char* mem, size_t len,
+ unsigned int *p_idx, enum t_exactness *p_exactness)
+{
+ unsigned int idx = *p_idx;
+ enum t_exactness x = *p_exactness;
+
+ if (idx == len)
+ return result;
+
+ if (mem[idx] == '.')
+ {
+ scm_t_bits shift = 1;
+ scm_t_bits add = 0;
+ unsigned int digit_value;
+ SCM big_shift = SCM_MAKINUM (1);
+
+ idx++;
+ while (idx != len)
+ {
+ char c = mem[idx];
+ if (isdigit (c))
+ {
+ if (x == INEXACT)
+ return SCM_BOOL_F;
+ else
+ digit_value = DIGIT2UINT (c);
+ }
+ else if (c == '#')
+ {
+ x = INEXACT;
+ digit_value = 0;
+ }
+ else
+ break;
+
+ idx++;
+ if (SCM_MOST_POSITIVE_FIXNUM / 10 < shift)
+ {
+ big_shift = scm_product (big_shift, SCM_MAKINUM (shift));
+ result = scm_product (result, SCM_MAKINUM (shift));
+ if (add > 0)
+ result = scm_sum (result, SCM_MAKINUM (add));
+
+ shift = 10;
+ add = digit_value;
+ }
+ else
+ {
+ shift = shift * 10;
+ add = add * 10 + digit_value;
+ }
+ };
+
+ if (add > 0)
+ {
+ big_shift = scm_product (big_shift, SCM_MAKINUM (shift));
+ result = scm_product (result, SCM_MAKINUM (shift));
+ result = scm_sum (result, SCM_MAKINUM (add));
+ }
+
+ result = scm_divide (result, big_shift);
+
+ /* We've seen a decimal point, thus the value is implicitly inexact. */
+ x = INEXACT;
+ }
+
+ if (idx != len)
+ {
+ int sign = 1;
+ unsigned int start;
+ char c;
+ int exponent;
+ SCM e;
+
+ /* R5RS, section 7.1.1, lexical structure of numbers: <suffix> */
+
+ switch (mem[idx])
+ {
+ case 'd': case 'D':
+ case 'e': case 'E':
+ case 'f': case 'F':
+ case 'l': case 'L':
+ case 's': case 'S':
+ idx++;
+ start = idx;
+ c = mem[idx];
+ if (c == '-')
+ {
+ idx++;
+ sign = -1;
+ c = mem[idx];
+ }
+ else if (c == '+')
+ {
+ idx++;
+ sign = 1;
+ c = mem[idx];
+ }
+ else
+ sign = 1;
+
+ if (!isdigit (c))
+ return SCM_BOOL_F;
+
+ idx++;
+ exponent = DIGIT2UINT (c);
+ while (idx != len)
+ {
+ char c = mem[idx];
+ if (isdigit (c))
+ {
+ idx++;
+ if (exponent <= SCM_MAXEXP)
+ exponent = exponent * 10 + DIGIT2UINT (c);
+ }
+ else
+ break;
+ }
+
+ if (exponent > SCM_MAXEXP)
+ {
+ size_t exp_len = idx - start;
+ SCM exp_string = scm_mem2string (&mem[start], exp_len);
+ SCM exp_num = scm_string_to_number (exp_string, SCM_UNDEFINED);
+ scm_out_of_range ("string->number", exp_num);
+ }
+
+ e = scm_integer_expt (SCM_MAKINUM (10), SCM_MAKINUM (exponent));
+ if (sign == 1)
+ result = scm_product (result, e);
+ else
+ result = scm_divide2real (result, e);
+
+ /* We've seen an exponent, thus the value is implicitly inexact. */
+ x = INEXACT;
+
+ break;
+
+ default:
+ break;
+ }
+ }
+
+ *p_idx = idx;
+ if (x == INEXACT)
+ *p_exactness = x;
+
+ return result;
+}
+
+
+/* R5RS, section 7.1.1, lexical structure of numbers: <ureal R> */
+
+static SCM
+mem2ureal (const char* mem, size_t len, unsigned int *p_idx,
+ unsigned int radix, enum t_exactness *p_exactness)
+{
+ unsigned int idx = *p_idx;
+ SCM result;
+
+ if (idx == len)
+ return SCM_BOOL_F;
+
+ if (idx+5 <= len && !strncmp (mem+idx, "inf.0", 5))
+ {
+ *p_idx = idx+5;
+ return scm_inf ();
+ }
+
+ if (idx+4 < len && !strncmp (mem+idx, "nan.", 4))
+ {
+ enum t_exactness x = EXACT;
+
+ /* Cobble up the fractional part. We might want to set the
+ NaN's mantissa from it. */
+ idx += 4;
+ mem2uinteger (mem, len, &idx, 10, &x);
+ *p_idx = idx;
+ return scm_nan ();
+ }
+
+ if (mem[idx] == '.')
+ {
+ if (radix != 10)
+ return SCM_BOOL_F;
+ else if (idx + 1 == len)
+ return SCM_BOOL_F;
+ else if (!isdigit (mem[idx + 1]))
+ return SCM_BOOL_F;
+ else
+ result = mem2decimal_from_point (SCM_MAKINUM (0), mem, len,
+ p_idx, p_exactness);
+ }
+ else
+ {
+ enum t_exactness x = EXACT;
+ SCM uinteger;
+
+ uinteger = mem2uinteger (mem, len, &idx, radix, &x);
+ if (SCM_FALSEP (uinteger))
+ return SCM_BOOL_F;
+
+ if (idx == len)
+ result = uinteger;
+ else if (mem[idx] == '/')
+ {
+ SCM divisor;
+
+ idx++;
+
+ divisor = mem2uinteger (mem, len, &idx, radix, &x);
+ if (SCM_FALSEP (divisor))
+ return SCM_BOOL_F;
+
+ /* both are int/big here, I assume */
+ result = scm_make_ratio (uinteger, divisor);
+ }
+ else if (radix == 10)
+ {
+ result = mem2decimal_from_point (uinteger, mem, len, &idx, &x);
+ if (SCM_FALSEP (result))
+ return SCM_BOOL_F;
+ }
+ else
+ result = uinteger;
+
+ *p_idx = idx;
+ if (x == INEXACT)
+ *p_exactness = x;
+ }
+
+ /* When returning an inexact zero, make sure it is represented as a
+ floating point value so that we can change its sign.
+ */
+ if (SCM_EQ_P (result, SCM_MAKINUM(0)) && *p_exactness == INEXACT)
+ result = scm_make_real (0.0);
+
+ return result;
+}
+
+
+/* R5RS, section 7.1.1, lexical structure of numbers: <complex R> */
+
+static SCM
+mem2complex (const char* mem, size_t len, unsigned int idx,
+ unsigned int radix, enum t_exactness *p_exactness)
+{
+ char c;
+ int sign = 0;
+ SCM ureal;
+
+ if (idx == len)
+ return SCM_BOOL_F;
+
+ c = mem[idx];
+ if (c == '+')
+ {
+ idx++;
+ sign = 1;
+ }
+ else if (c == '-')
+ {
+ idx++;
+ sign = -1;
+ }
+
+ if (idx == len)
+ return SCM_BOOL_F;
+
+ ureal = mem2ureal (mem, len, &idx, radix, p_exactness);
+ if (SCM_FALSEP (ureal))
+ {
+ /* input must be either +i or -i */
+
+ if (sign == 0)
+ return SCM_BOOL_F;
+
+ if (mem[idx] == 'i' || mem[idx] == 'I')
+ {
+ idx++;
+ if (idx != len)
+ return SCM_BOOL_F;
+
+ return scm_make_rectangular (SCM_MAKINUM (0), SCM_MAKINUM (sign));
+ }
+ else
+ return SCM_BOOL_F;
+ }
+ else
+ {
+ if (sign == -1 && SCM_FALSEP (scm_nan_p (ureal)))
+ ureal = scm_difference (ureal, SCM_UNDEFINED);
+
+ if (idx == len)
+ return ureal;
+
+ c = mem[idx];
+ switch (c)
+ {
+ case 'i': case 'I':
+ /* either +<ureal>i or -<ureal>i */
+
+ idx++;
+ if (sign == 0)
+ return SCM_BOOL_F;
+ if (idx != len)
+ return SCM_BOOL_F;
+ return scm_make_rectangular (SCM_MAKINUM (0), ureal);
+
+ case '@':
+ /* polar input: <real>@<real>. */
+
+ idx++;
+ if (idx == len)
+ return SCM_BOOL_F;
+ else
+ {
+ int sign;
+ SCM angle;
+ SCM result;
+
+ c = mem[idx];
+ if (c == '+')
+ {
+ idx++;
+ sign = 1;
+ }
+ else if (c == '-')
+ {
+ idx++;
+ sign = -1;
+ }
+ else
+ sign = 1;
+
+ angle = mem2ureal (mem, len, &idx, radix, p_exactness);
+ if (SCM_FALSEP (angle))
+ return SCM_BOOL_F;
+ if (idx != len)
+ return SCM_BOOL_F;
+
+ if (sign == -1 && SCM_FALSEP (scm_nan_p (ureal)))
+ angle = scm_difference (angle, SCM_UNDEFINED);
+
+ result = scm_make_polar (ureal, angle);
+ return result;
+ }
+ case '+':
+ case '-':
+ /* expecting input matching <real>[+-]<ureal>?i */
+
+ idx++;
+ if (idx == len)
+ return SCM_BOOL_F;
+ else
+ {
+ int sign = (c == '+') ? 1 : -1;
+ SCM imag = mem2ureal (mem, len, &idx, radix, p_exactness);
+
+ if (SCM_FALSEP (imag))
+ imag = SCM_MAKINUM (sign);
+ else if (sign == -1 && SCM_FALSEP (scm_nan_p (ureal)))
+ imag = scm_difference (imag, SCM_UNDEFINED);
+
+ if (idx == len)
+ return SCM_BOOL_F;
+ if (mem[idx] != 'i' && mem[idx] != 'I')
+ return SCM_BOOL_F;
+
+ idx++;
+ if (idx != len)
+ return SCM_BOOL_F;
+
+ return scm_make_rectangular (ureal, imag);
+ }
+ default:
+ return SCM_BOOL_F;
+ }
+ }
+}
+
+
+/* R5RS, section 7.1.1, lexical structure of numbers: <number> */
+
+enum t_radix {NO_RADIX=0, DUAL=2, OCT=8, DEC=10, HEX=16};
+
+SCM
+scm_i_mem2number (const char* mem, size_t len, unsigned int default_radix)
+{
+ unsigned int idx = 0;
+ unsigned int radix = NO_RADIX;
+ enum t_exactness forced_x = NO_EXACTNESS;
+ enum t_exactness implicit_x = EXACT;
+ SCM result;
+
+ /* R5RS, section 7.1.1, lexical structure of numbers: <prefix R> */
+ while (idx + 2 < len && mem[idx] == '#')
+ {
+ switch (mem[idx + 1])
+ {
+ case 'b': case 'B':
+ if (radix != NO_RADIX)
+ return SCM_BOOL_F;
+ radix = DUAL;
+ break;
+ case 'd': case 'D':
+ if (radix != NO_RADIX)
+ return SCM_BOOL_F;
+ radix = DEC;
+ break;
+ case 'i': case 'I':
+ if (forced_x != NO_EXACTNESS)
+ return SCM_BOOL_F;
+ forced_x = INEXACT;
+ break;
+ case 'e': case 'E':
+ if (forced_x != NO_EXACTNESS)
+ return SCM_BOOL_F;
+ forced_x = EXACT;
+ break;
+ case 'o': case 'O':
+ if (radix != NO_RADIX)
+ return SCM_BOOL_F;
+ radix = OCT;
+ break;
+ case 'x': case 'X':
+ if (radix != NO_RADIX)
+ return SCM_BOOL_F;
+ radix = HEX;
+ break;
+ default:
+ return SCM_BOOL_F;
+ }
+ idx += 2;
+ }
+
+ /* R5RS, section 7.1.1, lexical structure of numbers: <complex R> */
+ if (radix == NO_RADIX)
+ result = mem2complex (mem, len, idx, default_radix, &implicit_x);
+ else
+ result = mem2complex (mem, len, idx, (unsigned int) radix, &implicit_x);
+
+ if (SCM_FALSEP (result))
+ return SCM_BOOL_F;
+
+ switch (forced_x)
+ {
+ case EXACT:
+ if (SCM_INEXACTP (result))
+ return scm_inexact_to_exact (result);
+ else
+ return result;
+ case INEXACT:
+ if (SCM_INEXACTP (result))
+ return result;
+ else
+ return scm_exact_to_inexact (result);
+ case NO_EXACTNESS:
+ default:
+ if (implicit_x == INEXACT)
+ {
+ if (SCM_INEXACTP (result))
+ return result;
+ else
+ return scm_exact_to_inexact (result);
+ }
+ else
+ return result;
+ }
+}
+
+
+SCM_DEFINE (scm_string_to_number, "string->number", 1, 1, 0,
+ (SCM string, SCM radix),
+ "Return a number of the maximally precise representation\n"
+ "expressed by the given @var{string}. @var{radix} must be an\n"
+ "exact integer, either 2, 8, 10, or 16. If supplied, @var{radix}\n"
+ "is a default radix that may be overridden by an explicit radix\n"
+ "prefix in @var{string} (e.g. \"#o177\"). If @var{radix} is not\n"
+ "supplied, then the default radix is 10. If string is not a\n"
+ "syntactically valid notation for a number, then\n"
+ "@code{string->number} returns @code{#f}.")
+#define FUNC_NAME s_scm_string_to_number
+{
+ SCM answer;
+ int base;
+ SCM_VALIDATE_STRING (1, string);
+ SCM_VALIDATE_INUM_MIN_DEF_COPY (2, radix,2,10, base);
+ answer = scm_i_mem2number (SCM_STRING_CHARS (string),
+ SCM_STRING_LENGTH (string),
+ base);
+ return scm_return_first (answer, string);
+}
+#undef FUNC_NAME
+
+
+/*** END strs->nums ***/
+
+
+SCM
+scm_make_real (double x)
+{
+ SCM z = scm_double_cell (scm_tc16_real, 0, 0, 0);
+
+ SCM_REAL_VALUE (z) = x;
+ return z;
+}
+
+
+SCM
+scm_make_complex (double x, double y)
+{
+ if (y == 0.0)
+ return scm_make_real (x);
+ else
+ {
+ SCM z;
+ SCM_NEWSMOB (z, scm_tc16_complex, scm_gc_malloc (sizeof (scm_t_complex),
+ "complex"));
+ SCM_COMPLEX_REAL (z) = x;
+ SCM_COMPLEX_IMAG (z) = y;
+ return z;
+ }
+}
+
+
+SCM
+scm_bigequal (SCM x, SCM y)
+{
+ int result = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return SCM_BOOL (0 == result);
+}
+
+SCM
+scm_real_equalp (SCM x, SCM y)
+{
+ return SCM_BOOL (SCM_REAL_VALUE (x) == SCM_REAL_VALUE (y));
+}
+
+SCM
+scm_complex_equalp (SCM x, SCM y)
+{
+ return SCM_BOOL (SCM_COMPLEX_REAL (x) == SCM_COMPLEX_REAL (y)
+ && SCM_COMPLEX_IMAG (x) == SCM_COMPLEX_IMAG (y));
+}
+
+SCM
+scm_i_fraction_equalp (SCM x, SCM y)
+{
+ scm_i_fraction_reduce (x);
+ scm_i_fraction_reduce (y);
+ if (SCM_FALSEP (scm_equal_p (SCM_FRACTION_NUMERATOR (x),
+ SCM_FRACTION_NUMERATOR (y)))
+ || SCM_FALSEP (scm_equal_p (SCM_FRACTION_DENOMINATOR (x),
+ SCM_FRACTION_DENOMINATOR (y))))
+ return SCM_BOOL_F;
+ else
+ return SCM_BOOL_T;
+}
+
+
+SCM_REGISTER_PROC (s_number_p, "number?", 1, 0, 0, scm_number_p);
+/* "Return @code{#t} if @var{x} is a number, @code{#f}\n"
+ * "else. Note that the sets of complex, real, rational and\n"
+ * "integer values form subsets of the set of numbers, i. e. the\n"
+ * "predicate will be fulfilled for any number."
+ */
+SCM_DEFINE (scm_number_p, "complex?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is a complex number, @code{#f}\n"
+ "otherwise. Note that the sets of real, rational and integer\n"
+ "values form subsets of the set of complex numbers, i. e. the\n"
+ "predicate will also be fulfilled if @var{x} is a real,\n"
+ "rational or integer number.")
+#define FUNC_NAME s_scm_number_p
+{
+ return SCM_BOOL (SCM_NUMBERP (x));
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_real_p, "real?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is a real number, @code{#f}\n"
+ "otherwise. Note that the set of integer values forms a subset of\n"
+ "the set of real numbers, i. e. the predicate will also be\n"
+ "fulfilled if @var{x} is an integer number.")
+#define FUNC_NAME s_scm_real_p
+{
+ /* we can't represent irrational numbers. */
+ return scm_rational_p (x);
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_rational_p, "rational?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is a rational number, @code{#f}\n"
+ "otherwise. Note that the set of integer values forms a subset of\n"
+ "the set of rational numbers, i. e. the predicate will also be\n"
+ "fulfilled if @var{x} is an integer number.")
+#define FUNC_NAME s_scm_rational_p
+{
+ if (SCM_INUMP (x))
+ return SCM_BOOL_T;
+ else if (SCM_IMP (x))
+ return SCM_BOOL_F;
+ else if (SCM_BIGP (x))
+ return SCM_BOOL_T;
+ else if (SCM_FRACTIONP (x))
+ return SCM_BOOL_T;
+ else if (SCM_REALP (x))
+ /* due to their limited precision, all floating point numbers are
+ rational as well. */
+ return SCM_BOOL_T;
+ else
+ return SCM_BOOL_F;
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_integer_p, "integer?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is an integer number, @code{#f}\n"
+ "else.")
+#define FUNC_NAME s_scm_integer_p
+{
+ double r;
+ if (SCM_INUMP (x))
+ return SCM_BOOL_T;
+ if (SCM_IMP (x))
+ return SCM_BOOL_F;
+ if (SCM_BIGP (x))
+ return SCM_BOOL_T;
+ if (!SCM_INEXACTP (x))
+ return SCM_BOOL_F;
+ if (SCM_COMPLEXP (x))
+ return SCM_BOOL_F;
+ r = SCM_REAL_VALUE (x);
+ if (r == floor (r))
+ return SCM_BOOL_T;
+ return SCM_BOOL_F;
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_inexact_p, "inexact?", 1, 0, 0,
+ (SCM x),
+ "Return @code{#t} if @var{x} is an inexact number, @code{#f}\n"
+ "else.")
+#define FUNC_NAME s_scm_inexact_p
+{
+ if (SCM_INEXACTP (x))
+ return SCM_BOOL_T;
+ if (SCM_NUMBERP (x))
+ return SCM_BOOL_F;
+ SCM_WRONG_TYPE_ARG (1, x);
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC1 (s_eq_p, "=", scm_tc7_rpsubr, scm_num_eq_p, g_eq_p);
+/* "Return @code{#t} if all parameters are numerically equal." */
+SCM
+scm_num_eq_p (SCM x, SCM y)
+{
+ again:
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ return SCM_BOOL (xx == yy);
+ }
+ else if (SCM_BIGP (y))
+ return SCM_BOOL_F;
+ else if (SCM_REALP (y))
+ return SCM_BOOL ((double) xx == SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return SCM_BOOL (((double) xx == SCM_COMPLEX_REAL (y))
+ && (0.0 == SCM_COMPLEX_IMAG (y)));
+ else if (SCM_FRACTIONP (y))
+ return SCM_BOOL_F;
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ return SCM_BOOL_F;
+ else if (SCM_BIGP (y))
+ {
+ int cmp = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return SCM_BOOL (0 == cmp);
+ }
+ else if (SCM_REALP (y))
+ {
+ int cmp;
+ if (xisnan (SCM_REAL_VALUE (y)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (x), SCM_REAL_VALUE (y));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (0 == cmp);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ int cmp;
+ if (0.0 != SCM_COMPLEX_IMAG (y))
+ return SCM_BOOL_F;
+ if (xisnan (SCM_COMPLEX_REAL (y)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (x), SCM_COMPLEX_REAL (y));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (0 == cmp);
+ }
+ else if (SCM_FRACTIONP (y))
+ return SCM_BOOL_F;
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ return SCM_BOOL (SCM_REAL_VALUE (x) == (double) SCM_INUM (y));
+ else if (SCM_BIGP (y))
+ {
+ int cmp;
+ if (xisnan (SCM_REAL_VALUE (x)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (y), SCM_REAL_VALUE (x));
+ scm_remember_upto_here_1 (y);
+ return SCM_BOOL (0 == cmp);
+ }
+ else if (SCM_REALP (y))
+ return SCM_BOOL (SCM_REAL_VALUE (x) == SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return SCM_BOOL ((SCM_REAL_VALUE (x) == SCM_COMPLEX_REAL (y))
+ && (0.0 == SCM_COMPLEX_IMAG (y)));
+ else if (SCM_FRACTIONP (y))
+ {
+ double xx = SCM_REAL_VALUE (x);
+ if (xisnan (xx))
+ return SCM_BOOL_F;
+ if (xisinf (xx))
+ return SCM_BOOL (xx < 0.0);
+ x = scm_inexact_to_exact (x); /* with x as frac or int */
+ goto again;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ if (SCM_INUMP (y))
+ return SCM_BOOL ((SCM_COMPLEX_REAL (x) == (double) SCM_INUM (y))
+ && (SCM_COMPLEX_IMAG (x) == 0.0));
+ else if (SCM_BIGP (y))
+ {
+ int cmp;
+ if (0.0 != SCM_COMPLEX_IMAG (x))
+ return SCM_BOOL_F;
+ if (xisnan (SCM_COMPLEX_REAL (x)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (y), SCM_COMPLEX_REAL (x));
+ scm_remember_upto_here_1 (y);
+ return SCM_BOOL (0 == cmp);
+ }
+ else if (SCM_REALP (y))
+ return SCM_BOOL ((SCM_COMPLEX_REAL (x) == SCM_REAL_VALUE (y))
+ && (SCM_COMPLEX_IMAG (x) == 0.0));
+ else if (SCM_COMPLEXP (y))
+ return SCM_BOOL ((SCM_COMPLEX_REAL (x) == SCM_COMPLEX_REAL (y))
+ && (SCM_COMPLEX_IMAG (x) == SCM_COMPLEX_IMAG (y)));
+ else if (SCM_FRACTIONP (y))
+ {
+ double xx;
+ if (SCM_COMPLEX_IMAG (x) != 0.0)
+ return SCM_BOOL_F;
+ xx = SCM_COMPLEX_REAL (x);
+ if (xisnan (xx))
+ return SCM_BOOL_F;
+ if (xisinf (xx))
+ return SCM_BOOL (xx < 0.0);
+ x = scm_inexact_to_exact (x); /* with x as frac or int */
+ goto again;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ return SCM_BOOL_F;
+ else if (SCM_BIGP (y))
+ return SCM_BOOL_F;
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+ if (xisnan (yy))
+ return SCM_BOOL_F;
+ if (xisinf (yy))
+ return SCM_BOOL (0.0 < yy);
+ y = scm_inexact_to_exact (y); /* with y as frac or int */
+ goto again;
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ double yy;
+ if (SCM_COMPLEX_IMAG (y) != 0.0)
+ return SCM_BOOL_F;
+ yy = SCM_COMPLEX_REAL (y);
+ if (xisnan (yy))
+ return SCM_BOOL_F;
+ if (xisinf (yy))
+ return SCM_BOOL (0.0 < yy);
+ y = scm_inexact_to_exact (y); /* with y as frac or int */
+ goto again;
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_i_fraction_equalp (x, y);
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARGn, s_eq_p);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_eq_p, x, y, SCM_ARG1, s_eq_p);
+}
+
+
+/* OPTIMIZE-ME: For int/frac and frac/frac compares, the multiplications
+ done are good for inums, but for bignums an answer can almost always be
+ had by just examining a few high bits of the operands, as done by GMP in
+ mpq_cmp. flonum/frac compares likewise, but with the slight complication
+ of the float exponent to take into account. */
+
+SCM_GPROC1 (s_less_p, "<", scm_tc7_rpsubr, scm_less_p, g_less_p);
+/* "Return @code{#t} if the list of parameters is monotonically\n"
+ * "increasing."
+ */
+SCM
+scm_less_p (SCM x, SCM y)
+{
+ again:
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ return SCM_BOOL (xx < yy);
+ }
+ else if (SCM_BIGP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return SCM_BOOL (sgn > 0);
+ }
+ else if (SCM_REALP (y))
+ return SCM_BOOL ((double) xx < SCM_REAL_VALUE (y));
+ else if (SCM_FRACTIONP (y))
+ {
+ /* "x < a/b" becomes "x*b < a" */
+ int_frac:
+ x = scm_product (x, SCM_FRACTION_DENOMINATOR (y));
+ y = SCM_FRACTION_NUMERATOR (y);
+ goto again;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (sgn < 0);
+ }
+ else if (SCM_BIGP (y))
+ {
+ int cmp = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return SCM_BOOL (cmp < 0);
+ }
+ else if (SCM_REALP (y))
+ {
+ int cmp;
+ if (xisnan (SCM_REAL_VALUE (y)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (x), SCM_REAL_VALUE (y));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (cmp < 0);
+ }
+ else if (SCM_FRACTIONP (y))
+ goto int_frac;
+ else
+ SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ return SCM_BOOL (SCM_REAL_VALUE (x) < (double) SCM_INUM (y));
+ else if (SCM_BIGP (y))
+ {
+ int cmp;
+ if (xisnan (SCM_REAL_VALUE (x)))
+ return SCM_BOOL_F;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (y), SCM_REAL_VALUE (x));
+ scm_remember_upto_here_1 (y);
+ return SCM_BOOL (cmp > 0);
+ }
+ else if (SCM_REALP (y))
+ return SCM_BOOL (SCM_REAL_VALUE (x) < SCM_REAL_VALUE (y));
+ else if (SCM_FRACTIONP (y))
+ {
+ double xx = SCM_REAL_VALUE (x);
+ if (xisnan (xx))
+ return SCM_BOOL_F;
+ if (xisinf (xx))
+ return SCM_BOOL (xx < 0.0);
+ x = scm_inexact_to_exact (x); /* with x as frac or int */
+ goto again;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y) || SCM_BIGP (y))
+ {
+ /* "a/b < y" becomes "a < y*b" */
+ y = scm_product (y, SCM_FRACTION_DENOMINATOR (x));
+ x = SCM_FRACTION_NUMERATOR (x);
+ goto again;
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+ if (xisnan (yy))
+ return SCM_BOOL_F;
+ if (xisinf (yy))
+ return SCM_BOOL (0.0 < yy);
+ y = scm_inexact_to_exact (y); /* with y as frac or int */
+ goto again;
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ /* "a/b < c/d" becomes "a*d < c*b" */
+ SCM new_x = scm_product (SCM_FRACTION_NUMERATOR (x),
+ SCM_FRACTION_DENOMINATOR (y));
+ SCM new_y = scm_product (SCM_FRACTION_NUMERATOR (y),
+ SCM_FRACTION_DENOMINATOR (x));
+ x = new_x;
+ y = new_y;
+ goto again;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARGn, s_less_p);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_less_p, x, y, SCM_ARG1, s_less_p);
+}
+
+
+SCM_GPROC1 (s_scm_gr_p, ">", scm_tc7_rpsubr, scm_gr_p, g_gr_p);
+/* "Return @code{#t} if the list of parameters is monotonically\n"
+ * "decreasing."
+ */
+#define FUNC_NAME s_scm_gr_p
+SCM
+scm_gr_p (SCM x, SCM y)
+{
+ if (!SCM_NUMBERP (x))
+ SCM_WTA_DISPATCH_2 (g_gr_p, x, y, SCM_ARG1, FUNC_NAME);
+ else if (!SCM_NUMBERP (y))
+ SCM_WTA_DISPATCH_2 (g_gr_p, x, y, SCM_ARG2, FUNC_NAME);
+ else
+ return scm_less_p (y, x);
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC1 (s_scm_leq_p, "<=", scm_tc7_rpsubr, scm_leq_p, g_leq_p);
+/* "Return @code{#t} if the list of parameters is monotonically\n"
+ * "non-decreasing."
+ */
+#define FUNC_NAME s_scm_leq_p
+SCM
+scm_leq_p (SCM x, SCM y)
+{
+ if (!SCM_NUMBERP (x))
+ SCM_WTA_DISPATCH_2 (g_leq_p, x, y, SCM_ARG1, FUNC_NAME);
+ else if (!SCM_NUMBERP (y))
+ SCM_WTA_DISPATCH_2 (g_leq_p, x, y, SCM_ARG2, FUNC_NAME);
+ else if (SCM_NFALSEP (scm_nan_p (x)) || SCM_NFALSEP (scm_nan_p (y)))
+ return SCM_BOOL_F;
+ else
+ return SCM_BOOL_NOT (scm_less_p (y, x));
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC1 (s_scm_geq_p, ">=", scm_tc7_rpsubr, scm_geq_p, g_geq_p);
+/* "Return @code{#t} if the list of parameters is monotonically\n"
+ * "non-increasing."
+ */
+#define FUNC_NAME s_scm_geq_p
+SCM
+scm_geq_p (SCM x, SCM y)
+{
+ if (!SCM_NUMBERP (x))
+ SCM_WTA_DISPATCH_2 (g_geq_p, x, y, SCM_ARG1, FUNC_NAME);
+ else if (!SCM_NUMBERP (y))
+ SCM_WTA_DISPATCH_2 (g_geq_p, x, y, SCM_ARG2, FUNC_NAME);
+ else if (SCM_NFALSEP (scm_nan_p (x)) || SCM_NFALSEP (scm_nan_p (y)))
+ return SCM_BOOL_F;
+ else
+ return SCM_BOOL_NOT (scm_less_p (x, y));
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC (s_zero_p, "zero?", 1, 0, 0, scm_zero_p, g_zero_p);
+/* "Return @code{#t} if @var{z} is an exact or inexact number equal to\n"
+ * "zero."
+ */
+SCM
+scm_zero_p (SCM z)
+{
+ if (SCM_INUMP (z))
+ return SCM_BOOL (SCM_EQ_P (z, SCM_INUM0));
+ else if (SCM_BIGP (z))
+ return SCM_BOOL_F;
+ else if (SCM_REALP (z))
+ return SCM_BOOL (SCM_REAL_VALUE (z) == 0.0);
+ else if (SCM_COMPLEXP (z))
+ return SCM_BOOL (SCM_COMPLEX_REAL (z) == 0.0
+ && SCM_COMPLEX_IMAG (z) == 0.0);
+ else if (SCM_FRACTIONP (z))
+ return SCM_BOOL_F;
+ else
+ SCM_WTA_DISPATCH_1 (g_zero_p, z, SCM_ARG1, s_zero_p);
+}
+
+
+SCM_GPROC (s_positive_p, "positive?", 1, 0, 0, scm_positive_p, g_positive_p);
+/* "Return @code{#t} if @var{x} is an exact or inexact number greater than\n"
+ * "zero."
+ */
+SCM
+scm_positive_p (SCM x)
+{
+ if (SCM_INUMP (x))
+ return SCM_BOOL (SCM_INUM (x) > 0);
+ else if (SCM_BIGP (x))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (sgn > 0);
+ }
+ else if (SCM_REALP (x))
+ return SCM_BOOL(SCM_REAL_VALUE (x) > 0.0);
+ else if (SCM_FRACTIONP (x))
+ return scm_positive_p (SCM_FRACTION_NUMERATOR (x));
+ else
+ SCM_WTA_DISPATCH_1 (g_positive_p, x, SCM_ARG1, s_positive_p);
+}
+
+
+SCM_GPROC (s_negative_p, "negative?", 1, 0, 0, scm_negative_p, g_negative_p);
+/* "Return @code{#t} if @var{x} is an exact or inexact number less than\n"
+ * "zero."
+ */
+SCM
+scm_negative_p (SCM x)
+{
+ if (SCM_INUMP (x))
+ return SCM_BOOL (SCM_INUM (x) < 0);
+ else if (SCM_BIGP (x))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return SCM_BOOL (sgn < 0);
+ }
+ else if (SCM_REALP (x))
+ return SCM_BOOL(SCM_REAL_VALUE (x) < 0.0);
+ else if (SCM_FRACTIONP (x))
+ return scm_negative_p (SCM_FRACTION_NUMERATOR (x));
+ else
+ SCM_WTA_DISPATCH_1 (g_negative_p, x, SCM_ARG1, s_negative_p);
+}
+
+
+/* scm_min and scm_max return an inexact when either argument is inexact, as
+ required by r5rs. On that basis, for exact/inexact combinations the
+ exact is converted to inexact to compare and possibly return. This is
+ unlike scm_less_p above which takes some trouble to preserve all bits in
+ its test, such trouble is not required for min and max. */
+
+SCM_GPROC1 (s_max, "max", scm_tc7_asubr, scm_max, g_max);
+/* "Return the maximum of all parameter values."
+ */
+SCM
+scm_max (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_UNBNDP (x))
+ SCM_WTA_DISPATCH_0 (g_max, s_max);
+ else if (SCM_INUMP(x) || SCM_BIGP(x) || SCM_REALP(x) || SCM_FRACTIONP(x))
+ return x;
+ else
+ SCM_WTA_DISPATCH_1 (g_max, x, SCM_ARG1, s_max);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ return (xx < yy) ? y : x;
+ }
+ else if (SCM_BIGP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return (sgn < 0) ? x : y;
+ }
+ else if (SCM_REALP (y))
+ {
+ double z = xx;
+ /* if y==NaN then ">" is false and we return NaN */
+ return (z > SCM_REAL_VALUE (y)) ? scm_make_real (z) : y;
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double z = xx;
+ return (z > scm_i_fraction2double (y)) ? x : y;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return (sgn < 0) ? y : x;
+ }
+ else if (SCM_BIGP (y))
+ {
+ int cmp = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return (cmp > 0) ? x : y;
+ }
+ else if (SCM_REALP (y))
+ {
+ /* if y==NaN then xx>yy is false, so we return the NaN y */
+ double xx, yy;
+ big_real:
+ xx = scm_i_big2dbl (x);
+ yy = SCM_REAL_VALUE (y);
+ return (xx > yy ? scm_make_real (xx) : y);
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ int cmp;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (x), yy);
+ scm_remember_upto_here_1 (x);
+ return (cmp > 0) ? x : y;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ double z = SCM_INUM (y);
+ /* if x==NaN then "<" is false and we return NaN */
+ return (SCM_REAL_VALUE (x) < z) ? scm_make_real (z) : x;
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM t = x; x = y; y = t;
+ goto big_real;
+ }
+ else if (SCM_REALP (y))
+ {
+ /* if x==NaN then our explicit check means we return NaN
+ if y==NaN then ">" is false and we return NaN
+ calling isnan is unavoidable, since it's the only way to know
+ which of x or y causes any compares to be false */
+ double xx = SCM_REAL_VALUE (x);
+ return (xisnan (xx) || xx > SCM_REAL_VALUE (y)) ? x : y;
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ double xx = SCM_REAL_VALUE (x);
+ return (xx < yy) ? scm_make_real (yy) : x;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ double z = SCM_INUM (y);
+ return (scm_i_fraction2double (x) < z) ? y : x;
+ }
+ else if (SCM_BIGP (y))
+ {
+ double xx = scm_i_fraction2double (x);
+ int cmp;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (y), xx);
+ scm_remember_upto_here_1 (y);
+ return (cmp < 0) ? x : y;
+ }
+ else if (SCM_REALP (y))
+ {
+ double xx = scm_i_fraction2double (x);
+ return (xx < SCM_REAL_VALUE (y)) ? y : scm_make_real (xx);
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ double xx = scm_i_fraction2double (x);
+ return (xx < yy) ? y : x;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARG1, s_max);
+}
+
+
+SCM_GPROC1 (s_min, "min", scm_tc7_asubr, scm_min, g_min);
+/* "Return the minium of all parameter values."
+ */
+SCM
+scm_min (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_UNBNDP (x))
+ SCM_WTA_DISPATCH_0 (g_min, s_min);
+ else if (SCM_INUMP(x) || SCM_BIGP(x) || SCM_REALP(x) || SCM_FRACTIONP(x))
+ return x;
+ else
+ SCM_WTA_DISPATCH_1 (g_min, x, SCM_ARG1, s_min);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ return (xx < yy) ? x : y;
+ }
+ else if (SCM_BIGP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return (sgn < 0) ? y : x;
+ }
+ else if (SCM_REALP (y))
+ {
+ double z = xx;
+ /* if y==NaN then "<" is false and we return NaN */
+ return (z < SCM_REAL_VALUE (y)) ? scm_make_real (z) : y;
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double z = xx;
+ return (z < scm_i_fraction2double (y)) ? x : y;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return (sgn < 0) ? x : y;
+ }
+ else if (SCM_BIGP (y))
+ {
+ int cmp = mpz_cmp (SCM_I_BIG_MPZ (x), SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return (cmp > 0) ? y : x;
+ }
+ else if (SCM_REALP (y))
+ {
+ /* if y==NaN then xx<yy is false, so we return the NaN y */
+ double xx, yy;
+ big_real:
+ xx = scm_i_big2dbl (x);
+ yy = SCM_REAL_VALUE (y);
+ return (xx < yy ? scm_make_real (xx) : y);
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ int cmp;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (x), yy);
+ scm_remember_upto_here_1 (x);
+ return (cmp > 0) ? y : x;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ double z = SCM_INUM (y);
+ /* if x==NaN then "<" is false and we return NaN */
+ return (z < SCM_REAL_VALUE (x)) ? scm_make_real (z) : x;
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM t = x; x = y; y = t;
+ goto big_real;
+ }
+ else if (SCM_REALP (y))
+ {
+ /* if x==NaN then our explicit check means we return NaN
+ if y==NaN then "<" is false and we return NaN
+ calling isnan is unavoidable, since it's the only way to know
+ which of x or y causes any compares to be false */
+ double xx = SCM_REAL_VALUE (x);
+ return (xisnan (xx) || xx < SCM_REAL_VALUE (y)) ? x : y;
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ double xx = SCM_REAL_VALUE (x);
+ return (yy < xx) ? scm_make_real (yy) : x;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARGn, s_min);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ double z = SCM_INUM (y);
+ return (scm_i_fraction2double (x) < z) ? x : y;
+ }
+ else if (SCM_BIGP (y))
+ {
+ double xx = scm_i_fraction2double (x);
+ int cmp;
+ cmp = xmpz_cmp_d (SCM_I_BIG_MPZ (y), xx);
+ scm_remember_upto_here_1 (y);
+ return (cmp < 0) ? y : x;
+ }
+ else if (SCM_REALP (y))
+ {
+ double xx = scm_i_fraction2double (x);
+ return (SCM_REAL_VALUE (y) < xx) ? y : scm_make_real (xx);
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ double xx = scm_i_fraction2double (x);
+ return (xx < yy) ? x : y;
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_max, x, y, SCM_ARGn, s_max);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_min, x, y, SCM_ARG1, s_min);
+}
+
+
+SCM_GPROC1 (s_sum, "+", scm_tc7_asubr, scm_sum, g_sum);
+/* "Return the sum of all parameter values. Return 0 if called without\n"
+ * "any parameters."
+ */
+SCM
+scm_sum (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_NUMBERP (x)) return x;
+ if (SCM_UNBNDP (x)) return SCM_INUM0;
+ SCM_WTA_DISPATCH_1 (g_sum, x, SCM_ARG1, s_sum);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long xx = SCM_INUM (x);
+ long yy = SCM_INUM (y);
+ long int z = xx + yy;
+ return SCM_FIXABLE (z) ? SCM_MAKINUM (z) : scm_i_long2big (z);
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM_SWAP (x, y);
+ goto add_big_inum;
+ }
+ else if (SCM_REALP (y))
+ {
+ long int xx = SCM_INUM (x);
+ return scm_make_real (xx + SCM_REAL_VALUE (y));
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ long int xx = SCM_INUM (x);
+ return scm_make_complex (xx + SCM_COMPLEX_REAL (y),
+ SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_sum (SCM_FRACTION_NUMERATOR (y),
+ scm_product (x, SCM_FRACTION_DENOMINATOR (y))),
+ SCM_FRACTION_DENOMINATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
+ } else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long int inum;
+ int bigsgn;
+ add_big_inum:
+ inum = SCM_INUM (y);
+ if (inum == 0)
+ return x;
+ bigsgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ if (inum < 0)
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_sub_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), - inum);
+ scm_remember_upto_here_1 (x);
+ /* we know the result will have to be a bignum */
+ if (bigsgn == -1)
+ return result;
+ return scm_i_normbig (result);
+ }
+ else
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_add_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), inum);
+ scm_remember_upto_here_1 (x);
+ /* we know the result will have to be a bignum */
+ if (bigsgn == 1)
+ return result;
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ int sgn_x = mpz_sgn (SCM_I_BIG_MPZ (x));
+ int sgn_y = mpz_sgn (SCM_I_BIG_MPZ (y));
+ mpz_add (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ /* we know the result will have to be a bignum */
+ if (sgn_x == sgn_y)
+ return result;
+ return scm_i_normbig (result);
+ }
+ else if (SCM_REALP (y))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (x)) + SCM_REAL_VALUE (y);
+ scm_remember_upto_here_1 (x);
+ return scm_make_real (result);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ double real_part = (mpz_get_d (SCM_I_BIG_MPZ (x))
+ + SCM_COMPLEX_REAL (y));
+ scm_remember_upto_here_1 (x);
+ return scm_make_complex (real_part, SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_sum (SCM_FRACTION_NUMERATOR (y),
+ scm_product (x, SCM_FRACTION_DENOMINATOR (y))),
+ SCM_FRACTION_DENOMINATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) + SCM_INUM (y));
+ else if (SCM_BIGP (y))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (y)) + SCM_REAL_VALUE (x);
+ scm_remember_upto_here_1 (y);
+ return scm_make_real (result);
+ }
+ else if (SCM_REALP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) + SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_REAL_VALUE (x) + SCM_COMPLEX_REAL (y),
+ SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) + scm_i_fraction2double (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) + SCM_INUM (y),
+ SCM_COMPLEX_IMAG (x));
+ else if (SCM_BIGP (y))
+ {
+ double real_part = (mpz_get_d (SCM_I_BIG_MPZ (y))
+ + SCM_COMPLEX_REAL (x));
+ scm_remember_upto_here_1 (y);
+ return scm_make_complex (real_part, SCM_COMPLEX_IMAG (x));
+ }
+ else if (SCM_REALP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) + SCM_REAL_VALUE (y),
+ SCM_COMPLEX_IMAG (x));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) + SCM_COMPLEX_REAL (y),
+ SCM_COMPLEX_IMAG (x) + SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) + scm_i_fraction2double (y),
+ SCM_COMPLEX_IMAG (x));
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_ratio (scm_sum (SCM_FRACTION_NUMERATOR (x),
+ scm_product (y, SCM_FRACTION_DENOMINATOR (x))),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_BIGP (y))
+ return scm_make_ratio (scm_sum (SCM_FRACTION_NUMERATOR (x),
+ scm_product (y, SCM_FRACTION_DENOMINATOR (x))),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_REALP (y))
+ return scm_make_real (SCM_REAL_VALUE (y) + scm_i_fraction2double (x));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (y) + scm_i_fraction2double (x),
+ SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ /* a/b + c/d = (ad + bc) / bd */
+ return scm_make_ratio (scm_sum (scm_product (SCM_FRACTION_NUMERATOR (x), SCM_FRACTION_DENOMINATOR (y)),
+ scm_product (SCM_FRACTION_NUMERATOR (y), SCM_FRACTION_DENOMINATOR (x))),
+ scm_product (SCM_FRACTION_DENOMINATOR (x), SCM_FRACTION_DENOMINATOR (y)));
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARGn, s_sum);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_sum, x, y, SCM_ARG1, s_sum);
+}
+
+
+SCM_GPROC1 (s_difference, "-", scm_tc7_asubr, scm_difference, g_difference);
+/* If called with one argument @var{z1}, -@var{z1} returned. Otherwise
+ * the sum of all but the first argument are subtracted from the first
+ * argument. */
+#define FUNC_NAME s_difference
+SCM
+scm_difference (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_UNBNDP (x))
+ SCM_WTA_DISPATCH_0 (g_difference, s_difference);
+ else
+ if (SCM_INUMP (x))
+ {
+ long xx = -SCM_INUM (x);
+ if (SCM_FIXABLE (xx))
+ return SCM_MAKINUM (xx);
+ else
+ return scm_i_long2big (xx);
+ }
+ else if (SCM_BIGP (x))
+ /* FIXME: do we really need to normalize here? */
+ return scm_i_normbig (scm_i_clonebig (x, 0));
+ else if (SCM_REALP (x))
+ return scm_make_real (-SCM_REAL_VALUE (x));
+ else if (SCM_COMPLEXP (x))
+ return scm_make_complex (-SCM_COMPLEX_REAL (x),
+ -SCM_COMPLEX_IMAG (x));
+ else if (SCM_FRACTIONP (x))
+ return scm_make_ratio (scm_difference (SCM_FRACTION_NUMERATOR (x), SCM_UNDEFINED),
+ SCM_FRACTION_DENOMINATOR (x));
+ else
+ SCM_WTA_DISPATCH_1 (g_difference, x, SCM_ARG1, s_difference);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long int xx = SCM_INUM (x);
+ long int yy = SCM_INUM (y);
+ long int z = xx - yy;
+ if (SCM_FIXABLE (z))
+ return SCM_MAKINUM (z);
+ else
+ return scm_i_long2big (z);
+ }
+ else if (SCM_BIGP (y))
+ {
+ /* inum-x - big-y */
+ long xx = SCM_INUM (x);
+
+ if (xx == 0)
+ return scm_i_clonebig (y, 0);
+ else
+ {
+ int sgn_y = mpz_sgn (SCM_I_BIG_MPZ (y));
+ SCM result = scm_i_mkbig ();
+
+ if (xx >= 0)
+ mpz_ui_sub (SCM_I_BIG_MPZ (result), xx, SCM_I_BIG_MPZ (y));
+ else
+ {
+ /* x - y == -(y + -x) */
+ mpz_add_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (y), -xx);
+ mpz_neg (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result));
+ }
+ scm_remember_upto_here_1 (y);
+
+ if ((xx < 0 && (sgn_y > 0)) || ((xx > 0) && sgn_y < 0))
+ /* we know the result will have to be a bignum */
+ return result;
+ else
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_REALP (y))
+ {
+ long int xx = SCM_INUM (x);
+ return scm_make_real (xx - SCM_REAL_VALUE (y));
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ long int xx = SCM_INUM (x);
+ return scm_make_complex (xx - SCM_COMPLEX_REAL (y),
+ - SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ /* a - b/c = (ac - b) / c */
+ return scm_make_ratio (scm_difference (scm_product (x, SCM_FRACTION_DENOMINATOR (y)),
+ SCM_FRACTION_NUMERATOR (y)),
+ SCM_FRACTION_DENOMINATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ /* big-x - inum-y */
+ long yy = SCM_INUM (y);
+ int sgn_x = mpz_sgn (SCM_I_BIG_MPZ (x));
+
+ scm_remember_upto_here_1 (x);
+ if (sgn_x == 0)
+ return SCM_FIXABLE (-yy) ? SCM_MAKINUM (-yy) : scm_long2num (-yy);
+ else
+ {
+ SCM result = scm_i_mkbig ();
+
+ if (yy >= 0)
+ mpz_sub_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), yy);
+ else
+ mpz_add_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), -yy);
+ scm_remember_upto_here_1 (x);
+
+ if ((sgn_x < 0 && (yy > 0)) || ((sgn_x > 0) && yy < 0))
+ /* we know the result will have to be a bignum */
+ return result;
+ else
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ int sgn_x = mpz_sgn (SCM_I_BIG_MPZ (x));
+ int sgn_y = mpz_sgn (SCM_I_BIG_MPZ (y));
+ SCM result = scm_i_mkbig ();
+ mpz_sub (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ /* we know the result will have to be a bignum */
+ if ((sgn_x == 1) && (sgn_y == -1))
+ return result;
+ if ((sgn_x == -1) && (sgn_y == 1))
+ return result;
+ return scm_i_normbig (result);
+ }
+ else if (SCM_REALP (y))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (x)) - SCM_REAL_VALUE (y);
+ scm_remember_upto_here_1 (x);
+ return scm_make_real (result);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ double real_part = (mpz_get_d (SCM_I_BIG_MPZ (x))
+ - SCM_COMPLEX_REAL (y));
+ scm_remember_upto_here_1 (x);
+ return scm_make_complex (real_part, - SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_difference (scm_product (x, SCM_FRACTION_DENOMINATOR (y)),
+ SCM_FRACTION_NUMERATOR (y)),
+ SCM_FRACTION_DENOMINATOR (y));
+ else SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) - SCM_INUM (y));
+ else if (SCM_BIGP (y))
+ {
+ double result = SCM_REAL_VALUE (x) - mpz_get_d (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (x);
+ return scm_make_real (result);
+ }
+ else if (SCM_REALP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) - SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_REAL_VALUE (x) - SCM_COMPLEX_REAL (y),
+ -SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) - scm_i_fraction2double (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) - SCM_INUM (y),
+ SCM_COMPLEX_IMAG (x));
+ else if (SCM_BIGP (y))
+ {
+ double real_part = (SCM_COMPLEX_REAL (x)
+ - mpz_get_d (SCM_I_BIG_MPZ (y)));
+ scm_remember_upto_here_1 (x);
+ return scm_make_complex (real_part, SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_REALP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) - SCM_REAL_VALUE (y),
+ SCM_COMPLEX_IMAG (x));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) - SCM_COMPLEX_REAL (y),
+ SCM_COMPLEX_IMAG (x) - SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_complex (SCM_COMPLEX_REAL (x) - scm_i_fraction2double (y),
+ SCM_COMPLEX_IMAG (x));
+ else
+ SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ /* a/b - c = (a - cb) / b */
+ return scm_make_ratio (scm_difference (SCM_FRACTION_NUMERATOR (x),
+ scm_product(y, SCM_FRACTION_DENOMINATOR (x))),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_BIGP (y))
+ return scm_make_ratio (scm_difference (SCM_FRACTION_NUMERATOR (x),
+ scm_product(y, SCM_FRACTION_DENOMINATOR (x))),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_REALP (y))
+ return scm_make_real (scm_i_fraction2double (x) - SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (scm_i_fraction2double (x) - SCM_COMPLEX_REAL (y),
+ -SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ /* a/b - c/d = (ad - bc) / bd */
+ return scm_make_ratio (scm_difference (scm_product (SCM_FRACTION_NUMERATOR (x), SCM_FRACTION_DENOMINATOR (y)),
+ scm_product (SCM_FRACTION_NUMERATOR (y), SCM_FRACTION_DENOMINATOR (x))),
+ scm_product (SCM_FRACTION_DENOMINATOR (x), SCM_FRACTION_DENOMINATOR (y)));
+ else
+ SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARGn, s_difference);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_difference, x, y, SCM_ARG1, s_difference);
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC1 (s_product, "*", scm_tc7_asubr, scm_product, g_product);
+/* "Return the product of all arguments. If called without arguments,\n"
+ * "1 is returned."
+ */
+SCM
+scm_product (SCM x, SCM y)
+{
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_UNBNDP (x))
+ return SCM_MAKINUM (1L);
+ else if (SCM_NUMBERP (x))
+ return x;
+ else
+ SCM_WTA_DISPATCH_1 (g_product, x, SCM_ARG1, s_product);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ long xx;
+
+ intbig:
+ xx = SCM_INUM (x);
+
+ switch (xx)
+ {
+ case 0: return x; break;
+ case 1: return y; break;
+ }
+
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ long kk = xx * yy;
+ SCM k = SCM_MAKINUM (kk);
+ if ((kk == SCM_INUM (k)) && (kk / xx == yy))
+ return k;
+ else
+ {
+ SCM result = scm_i_long2big (xx);
+ mpz_mul_si (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result), yy);
+ return scm_i_normbig (result);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_mul_si (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (y), xx);
+ scm_remember_upto_here_1 (y);
+ return result;
+ }
+ else if (SCM_REALP (y))
+ return scm_make_real (xx * SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (xx * SCM_COMPLEX_REAL (y),
+ xx * SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_product (x, SCM_FRACTION_NUMERATOR (y)),
+ SCM_FRACTION_DENOMINATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ SCM_SWAP (x, y);
+ goto intbig;
+ }
+ else if (SCM_BIGP (y))
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_mul (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return result;
+ }
+ else if (SCM_REALP (y))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (x)) * SCM_REAL_VALUE (y);
+ scm_remember_upto_here_1 (x);
+ return scm_make_real (result);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ double z = mpz_get_d (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return scm_make_complex (z * SCM_COMPLEX_REAL (y),
+ z * SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_product (x, SCM_FRACTION_NUMERATOR (y)),
+ SCM_FRACTION_DENOMINATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
+ }
+ else if (SCM_REALP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_real (SCM_INUM (y) * SCM_REAL_VALUE (x));
+ else if (SCM_BIGP (y))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (y)) * SCM_REAL_VALUE (x);
+ scm_remember_upto_here_1 (y);
+ return scm_make_real (result);
+ }
+ else if (SCM_REALP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) * SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ return scm_make_complex (SCM_REAL_VALUE (x) * SCM_COMPLEX_REAL (y),
+ SCM_REAL_VALUE (x) * SCM_COMPLEX_IMAG (y));
+ else if (SCM_FRACTIONP (y))
+ return scm_make_real (SCM_REAL_VALUE (x) * scm_i_fraction2double (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_complex (SCM_INUM (y) * SCM_COMPLEX_REAL (x),
+ SCM_INUM (y) * SCM_COMPLEX_IMAG (x));
+ else if (SCM_BIGP (y))
+ {
+ double z = mpz_get_d (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return scm_make_complex (z * SCM_COMPLEX_REAL (x),
+ z * SCM_COMPLEX_IMAG (x));
+ }
+ else if (SCM_REALP (y))
+ return scm_make_complex (SCM_REAL_VALUE (y) * SCM_COMPLEX_REAL (x),
+ SCM_REAL_VALUE (y) * SCM_COMPLEX_IMAG (x));
+ else if (SCM_COMPLEXP (y))
+ {
+ return scm_make_complex (SCM_COMPLEX_REAL (x) * SCM_COMPLEX_REAL (y)
+ - SCM_COMPLEX_IMAG (x) * SCM_COMPLEX_IMAG (y),
+ SCM_COMPLEX_REAL (x) * SCM_COMPLEX_IMAG (y)
+ + SCM_COMPLEX_IMAG (x) * SCM_COMPLEX_REAL (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ return scm_make_complex (yy * SCM_COMPLEX_REAL (x),
+ yy * SCM_COMPLEX_IMAG (x));
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ return scm_make_ratio (scm_product (y, SCM_FRACTION_NUMERATOR (x)),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_BIGP (y))
+ return scm_make_ratio (scm_product (y, SCM_FRACTION_NUMERATOR (x)),
+ SCM_FRACTION_DENOMINATOR (x));
+ else if (SCM_REALP (y))
+ return scm_make_real (scm_i_fraction2double (x) * SCM_REAL_VALUE (y));
+ else if (SCM_COMPLEXP (y))
+ {
+ double xx = scm_i_fraction2double (x);
+ return scm_make_complex (xx * SCM_COMPLEX_REAL (y),
+ xx * SCM_COMPLEX_IMAG (y));
+ }
+ else if (SCM_FRACTIONP (y))
+ /* a/b * c/d = ac / bd */
+ return scm_make_ratio (scm_product (SCM_FRACTION_NUMERATOR (x),
+ SCM_FRACTION_NUMERATOR (y)),
+ scm_product (SCM_FRACTION_DENOMINATOR (x),
+ SCM_FRACTION_DENOMINATOR (y)));
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARGn, s_product);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_product, x, y, SCM_ARG1, s_product);
+}
+
+double
+scm_num2dbl (SCM a, const char *why)
+#define FUNC_NAME why
+{
+ if (SCM_INUMP (a))
+ return (double) SCM_INUM (a);
+ else if (SCM_BIGP (a))
+ {
+ double result = mpz_get_d (SCM_I_BIG_MPZ (a));
+ scm_remember_upto_here_1 (a);
+ return result;
+ }
+ else if (SCM_REALP (a))
+ return (SCM_REAL_VALUE (a));
+ else if (SCM_FRACTIONP (a))
+ return scm_i_fraction2double (a);
+ else
+ SCM_WRONG_TYPE_ARG (SCM_ARGn, a);
+}
+#undef FUNC_NAME
+
+#if ((defined (HAVE_ISINF) && defined (HAVE_ISNAN)) \
+ || (defined (HAVE_FINITE) && defined (HAVE_ISNAN)))
+#define ALLOW_DIVIDE_BY_ZERO
+/* #define ALLOW_DIVIDE_BY_EXACT_ZERO */
+#endif
+
+/* The code below for complex division is adapted from the GNU
+ libstdc++, which adapted it from f2c's libF77, and is subject to
+ this copyright: */
+
+/****************************************************************
+Copyright 1990, 1991, 1992, 1993 by AT&T Bell Laboratories and Bellcore.
+
+Permission to use, copy, modify, and distribute this software
+and its documentation for any purpose and without fee is hereby
+granted, provided that the above copyright notice appear in all
+copies and that both that the copyright notice and this
+permission notice and warranty disclaimer appear in supporting
+documentation, and that the names of AT&T Bell Laboratories or
+Bellcore or any of their entities not be used in advertising or
+publicity pertaining to distribution of the software without
+specific, written prior permission.
+
+AT&T and Bellcore disclaim all warranties with regard to this
+software, including all implied warranties of merchantability
+and fitness. In no event shall AT&T or Bellcore be liable for
+any special, indirect or consequential damages or any damages
+whatsoever resulting from loss of use, data or profits, whether
+in an action of contract, negligence or other tortious action,
+arising out of or in connection with the use or performance of
+this software.
+****************************************************************/
+
+SCM_GPROC1 (s_divide, "/", scm_tc7_asubr, scm_divide, g_divide);
+/* Divide the first argument by the product of the remaining
+ arguments. If called with one argument @var{z1}, 1/@var{z1} is
+ returned. */
+#define FUNC_NAME s_divide
+static SCM
+scm_i_divide (SCM x, SCM y, int inexact)
+{
+ double a;
+
+ if (SCM_UNBNDP (y))
+ {
+ if (SCM_UNBNDP (x))
+ SCM_WTA_DISPATCH_0 (g_divide, s_divide);
+ else if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (xx == 1 || xx == -1)
+ return x;
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ else if (xx == 0)
+ scm_num_overflow (s_divide);
+#endif
+ else
+ {
+ if (inexact)
+ return scm_make_real (1.0 / (double) xx);
+ else return scm_make_ratio (SCM_MAKINUM(1), x);
+ }
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (inexact)
+ return scm_make_real (1.0 / scm_i_big2dbl (x));
+ else return scm_make_ratio (SCM_MAKINUM(1), x);
+ }
+ else if (SCM_REALP (x))
+ {
+ double xx = SCM_REAL_VALUE (x);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (xx == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real (1.0 / xx);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ double r = SCM_COMPLEX_REAL (x);
+ double i = SCM_COMPLEX_IMAG (x);
+ if (r <= i)
+ {
+ double t = r / i;
+ double d = i * (1.0 + t * t);
+ return scm_make_complex (t / d, -1.0 / d);
+ }
+ else
+ {
+ double t = i / r;
+ double d = r * (1.0 + t * t);
+ return scm_make_complex (1.0 / d, -t / d);
+ }
+ }
+ else if (SCM_FRACTIONP (x))
+ return scm_make_ratio (SCM_FRACTION_DENOMINATOR (x),
+ SCM_FRACTION_NUMERATOR (x));
+ else
+ SCM_WTA_DISPATCH_1 (g_divide, x, SCM_ARG1, s_divide);
+ }
+
+ if (SCM_INUMP (x))
+ {
+ long xx = SCM_INUM (x);
+ if (SCM_INUMP (y))
+ {
+ long yy = SCM_INUM (y);
+ if (yy == 0)
+ {
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ scm_num_overflow (s_divide);
+#else
+ return scm_make_real ((double) xx / (double) yy);
+#endif
+ }
+ else if (xx % yy != 0)
+ {
+ if (inexact)
+ return scm_make_real ((double) xx / (double) yy);
+ else return scm_make_ratio (x, y);
+ }
+ else
+ {
+ long z = xx / yy;
+ if (SCM_FIXABLE (z))
+ return SCM_MAKINUM (z);
+ else
+ return scm_i_long2big (z);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ if (inexact)
+ return scm_make_real ((double) xx / scm_i_big2dbl (y));
+ else return scm_make_ratio (x, y);
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (yy == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real ((double) xx / yy);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ a = xx;
+ complex_div: /* y _must_ be a complex number */
+ {
+ double r = SCM_COMPLEX_REAL (y);
+ double i = SCM_COMPLEX_IMAG (y);
+ if (r <= i)
+ {
+ double t = r / i;
+ double d = i * (1.0 + t * t);
+ return scm_make_complex ((a * t) / d, -a / d);
+ }
+ else
+ {
+ double t = i / r;
+ double d = r * (1.0 + t * t);
+ return scm_make_complex (a / d, -(a * t) / d);
+ }
+ }
+ }
+ else if (SCM_FRACTIONP (y))
+ /* a / b/c = ac / b */
+ return scm_make_ratio (scm_product (x, SCM_FRACTION_DENOMINATOR (y)),
+ SCM_FRACTION_NUMERATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
+ }
+ else if (SCM_BIGP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long int yy = SCM_INUM (y);
+ if (yy == 0)
+ {
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ scm_num_overflow (s_divide);
+#else
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return (sgn == 0) ? scm_nan () : scm_inf ();
+#endif
+ }
+ else if (yy == 1)
+ return x;
+ else
+ {
+ /* FIXME: HMM, what are the relative performance issues here?
+ We need to test. Is it faster on average to test
+ divisible_p, then perform whichever operation, or is it
+ faster to perform the integer div opportunistically and
+ switch to real if there's a remainder? For now we take the
+ middle ground: test, then if divisible, use the faster div
+ func. */
+
+ long abs_yy = yy < 0 ? -yy : yy;
+ int divisible_p = mpz_divisible_ui_p (SCM_I_BIG_MPZ (x), abs_yy);
+
+ if (divisible_p)
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_divexact_ui (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (x), abs_yy);
+ scm_remember_upto_here_1 (x);
+ if (yy < 0)
+ mpz_neg (SCM_I_BIG_MPZ (result), SCM_I_BIG_MPZ (result));
+ return scm_i_normbig (result);
+ }
+ else
+ {
+ if (inexact)
+ return scm_make_real (scm_i_big2dbl (x) / (double) yy);
+ else return scm_make_ratio (x, y);
+ }
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ int y_is_zero = (mpz_sgn (SCM_I_BIG_MPZ (y)) == 0);
+ if (y_is_zero)
+ {
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ scm_num_overflow (s_divide);
+#else
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (x));
+ scm_remember_upto_here_1 (x);
+ return (sgn == 0) ? scm_nan () : scm_inf ();
+#endif
+ }
+ else
+ {
+ /* big_x / big_y */
+ int divisible_p = mpz_divisible_p (SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ if (divisible_p)
+ {
+ SCM result = scm_i_mkbig ();
+ mpz_divexact (SCM_I_BIG_MPZ (result),
+ SCM_I_BIG_MPZ (x),
+ SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return scm_i_normbig (result);
+ }
+ else
+ {
+ if (inexact)
+ {
+ double dbx = mpz_get_d (SCM_I_BIG_MPZ (x));
+ double dby = mpz_get_d (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_2 (x, y);
+ return scm_make_real (dbx / dby);
+ }
+ else return scm_make_ratio (x, y);
+ }
+ }
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (yy == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real (scm_i_big2dbl (x) / yy);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ a = scm_i_big2dbl (x);
+ goto complex_div;
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_product (x, SCM_FRACTION_DENOMINATOR (y)),
+ SCM_FRACTION_NUMERATOR (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
+ }
+ else if (SCM_REALP (x))
+ {
+ double rx = SCM_REAL_VALUE (x);
+ if (SCM_INUMP (y))
+ {
+ long int yy = SCM_INUM (y);
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ if (yy == 0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real (rx / (double) yy);
+ }
+ else if (SCM_BIGP (y))
+ {
+ double dby = mpz_get_d (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return scm_make_real (rx / dby);
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (yy == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real (rx / yy);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ a = rx;
+ goto complex_div;
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_real (rx / scm_i_fraction2double (y));
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
+ }
+ else if (SCM_COMPLEXP (x))
+ {
+ double rx = SCM_COMPLEX_REAL (x);
+ double ix = SCM_COMPLEX_IMAG (x);
+ if (SCM_INUMP (y))
+ {
+ long int yy = SCM_INUM (y);
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ if (yy == 0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ {
+ double d = yy;
+ return scm_make_complex (rx / d, ix / d);
+ }
+ }
+ else if (SCM_BIGP (y))
+ {
+ double dby = mpz_get_d (SCM_I_BIG_MPZ (y));
+ scm_remember_upto_here_1 (y);
+ return scm_make_complex (rx / dby, ix / dby);
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (yy == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_complex (rx / yy, ix / yy);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ double ry = SCM_COMPLEX_REAL (y);
+ double iy = SCM_COMPLEX_IMAG (y);
+ if (ry <= iy)
+ {
+ double t = ry / iy;
+ double d = iy * (1.0 + t * t);
+ return scm_make_complex ((rx * t + ix) / d, (ix * t - rx) / d);
+ }
+ else
+ {
+ double t = iy / ry;
+ double d = ry * (1.0 + t * t);
+ return scm_make_complex ((rx + ix * t) / d, (ix - rx * t) / d);
+ }
+ }
+ else if (SCM_FRACTIONP (y))
+ {
+ double yy = scm_i_fraction2double (y);
+ return scm_make_complex (rx / yy, ix / yy);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
+ }
+ else if (SCM_FRACTIONP (x))
+ {
+ if (SCM_INUMP (y))
+ {
+ long int yy = SCM_INUM (y);
+#ifndef ALLOW_DIVIDE_BY_EXACT_ZERO
+ if (yy == 0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_ratio (SCM_FRACTION_NUMERATOR (x),
+ scm_product (SCM_FRACTION_DENOMINATOR (x), y));
+ }
+ else if (SCM_BIGP (y))
+ {
+ return scm_make_ratio (SCM_FRACTION_NUMERATOR (x),
+ scm_product (SCM_FRACTION_DENOMINATOR (x), y));
+ }
+ else if (SCM_REALP (y))
+ {
+ double yy = SCM_REAL_VALUE (y);
+#ifndef ALLOW_DIVIDE_BY_ZERO
+ if (yy == 0.0)
+ scm_num_overflow (s_divide);
+ else
+#endif
+ return scm_make_real (scm_i_fraction2double (x) / yy);
+ }
+ else if (SCM_COMPLEXP (y))
+ {
+ a = scm_i_fraction2double (x);
+ goto complex_div;
+ }
+ else if (SCM_FRACTIONP (y))
+ return scm_make_ratio (scm_product (SCM_FRACTION_NUMERATOR (x), SCM_FRACTION_DENOMINATOR (y)),
+ scm_product (SCM_FRACTION_NUMERATOR (y), SCM_FRACTION_DENOMINATOR (x)));
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARGn, s_divide);
+ }
+ else
+ SCM_WTA_DISPATCH_2 (g_divide, x, y, SCM_ARG1, s_divide);
+}
+
+SCM
+scm_divide (SCM x, SCM y)
+{
+ return scm_i_divide (x, y, 0);
+}
+
+static SCM scm_divide2real (SCM x, SCM y)
+{
+ return scm_i_divide (x, y, 1);
+}
+#undef FUNC_NAME
+
+
+double
+scm_asinh (double x)
+{
+#if HAVE_ASINH
+ return asinh (x);
+#else
+#define asinh scm_asinh
+ return log (x + sqrt (x * x + 1));
+#endif
+}
+SCM_GPROC1 (s_asinh, "$asinh", scm_tc7_dsubr, (SCM (*)()) asinh, g_asinh);
+/* "Return the inverse hyperbolic sine of @var{x}."
+ */
+
+
+double
+scm_acosh (double x)
+{
+#if HAVE_ACOSH
+ return acosh (x);
+#else
+#define acosh scm_acosh
+ return log (x + sqrt (x * x - 1));
+#endif
+}
+SCM_GPROC1 (s_acosh, "$acosh", scm_tc7_dsubr, (SCM (*)()) acosh, g_acosh);
+/* "Return the inverse hyperbolic cosine of @var{x}."
+ */
+
+
+double
+scm_atanh (double x)
+{
+#if HAVE_ATANH
+ return atanh (x);
+#else
+#define atanh scm_atanh
+ return 0.5 * log ((1 + x) / (1 - x));
+#endif
+}
+SCM_GPROC1 (s_atanh, "$atanh", scm_tc7_dsubr, (SCM (*)()) atanh, g_atanh);
+/* "Return the inverse hyperbolic tangent of @var{x}."
+ */
+
+
+/* XXX - eventually, we should remove this definition of scm_round and
+ rename scm_round_number to scm_round. Likewise for scm_truncate
+ and scm_truncate_number.
+ */
+
+double
+scm_truncate (double x)
+{
+#if HAVE_TRUNC
+ return trunc (x);
+#else
+#define trunc scm_truncate
+ if (x < 0.0)
+ return -floor (-x);
+ return floor (x);
+#endif
+}
+
+double
+scm_round (double x)
+{
+ double plus_half = x + 0.5;
+ double result = floor (plus_half);
+ /* Adjust so that the scm_round is towards even. */
+ return ((plus_half == result && plus_half / 2 != floor (plus_half / 2))
+ ? result - 1
+ : result);
+}
+
+SCM_DEFINE (scm_truncate_number, "truncate", 1, 0, 0,
+ (SCM x),
+ "Round the number @var{x} towards zero.")
+#define FUNC_NAME s_scm_truncate_number
+{
+ if (SCM_FALSEP (scm_negative_p (x)))
+ return scm_floor (x);
+ else
+ return scm_ceiling (x);
+}
+#undef FUNC_NAME
+
+static SCM exactly_one_half;
+
+SCM_DEFINE (scm_round_number, "round", 1, 0, 0,
+ (SCM x),
+ "Round the number @var{x} towards the nearest integer. "
+ "When it is exactly halfway between two integers, "
+ "round towards the even one.")
+#define FUNC_NAME s_scm_round_number
+{
+ SCM plus_half = scm_sum (x, exactly_one_half);
+ SCM result = scm_floor (plus_half);
+ /* Adjust so that the scm_round is towards even. */
+ if (!SCM_FALSEP (scm_num_eq_p (plus_half, result))
+ && !SCM_FALSEP (scm_odd_p (result)))
+ return scm_difference (result, SCM_MAKINUM (1));
+ else
+ return result;
+}
+#undef FUNC_NAME
+
+SCM_PRIMITIVE_GENERIC (scm_floor, "floor", 1, 0, 0,
+ (SCM x),
+ "Round the number @var{x} towards minus infinity.")
+#define FUNC_NAME s_scm_floor
+{
+ if (SCM_INUMP (x) || SCM_BIGP (x))
+ return x;
+ else if (SCM_REALP (x))
+ return scm_make_real (floor (SCM_REAL_VALUE (x)));
+ else if (SCM_FRACTIONP (x))
+ {
+ SCM q = scm_quotient (SCM_FRACTION_NUMERATOR (x),
+ SCM_FRACTION_DENOMINATOR (x));
+ if (SCM_FALSEP (scm_negative_p (x)))
+ {
+ /* For positive x, rounding towards zero is correct. */
+ return q;
+ }
+ else
+ {
+ /* For negative x, we need to return q-1 unless x is an
+ integer. But fractions are never integer, per our
+ assumptions. */
+ return scm_difference (q, SCM_MAKINUM (1));
+ }
+ }
+ else
+ SCM_WTA_DISPATCH_1 (g_scm_floor, x, 1, s_scm_floor);
+}
+#undef FUNC_NAME
+
+SCM_PRIMITIVE_GENERIC (scm_ceiling, "ceiling", 1, 0, 0,
+ (SCM x),
+ "Round the number @var{x} towards infinity.")
+#define FUNC_NAME s_scm_ceiling
+{
+ if (SCM_INUMP (x) || SCM_BIGP (x))
+ return x;
+ else if (SCM_REALP (x))
+ return scm_make_real (ceil (SCM_REAL_VALUE (x)));
+ else if (SCM_FRACTIONP (x))
+ {
+ SCM q = scm_quotient (SCM_FRACTION_NUMERATOR (x),
+ SCM_FRACTION_DENOMINATOR (x));
+ if (SCM_FALSEP (scm_positive_p (x)))
+ {
+ /* For negative x, rounding towards zero is correct. */
+ return q;
+ }
+ else
+ {
+ /* For positive x, we need to return q+1 unless x is an
+ integer. But fractions are never integer, per our
+ assumptions. */
+ return scm_sum (q, SCM_MAKINUM (1));
+ }
+ }
+ else
+ SCM_WTA_DISPATCH_1 (g_scm_ceiling, x, 1, s_scm_ceiling);
+}
+#undef FUNC_NAME
+
+SCM_GPROC1 (s_i_sqrt, "$sqrt", scm_tc7_dsubr, (SCM (*)()) sqrt, g_i_sqrt);
+/* "Return the square root of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_abs, "$abs", scm_tc7_dsubr, (SCM (*)()) fabs, g_i_abs);
+/* "Return the absolute value of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_exp, "$exp", scm_tc7_dsubr, (SCM (*)()) exp, g_i_exp);
+/* "Return the @var{x}th power of e."
+ */
+SCM_GPROC1 (s_i_log, "$log", scm_tc7_dsubr, (SCM (*)()) log, g_i_log);
+/* "Return the natural logarithm of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_sin, "$sin", scm_tc7_dsubr, (SCM (*)()) sin, g_i_sin);
+/* "Return the sine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_cos, "$cos", scm_tc7_dsubr, (SCM (*)()) cos, g_i_cos);
+/* "Return the cosine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_tan, "$tan", scm_tc7_dsubr, (SCM (*)()) tan, g_i_tan);
+/* "Return the tangent of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_asin, "$asin", scm_tc7_dsubr, (SCM (*)()) asin, g_i_asin);
+/* "Return the arc sine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_acos, "$acos", scm_tc7_dsubr, (SCM (*)()) acos, g_i_acos);
+/* "Return the arc cosine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_atan, "$atan", scm_tc7_dsubr, (SCM (*)()) atan, g_i_atan);
+/* "Return the arc tangent of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_sinh, "$sinh", scm_tc7_dsubr, (SCM (*)()) sinh, g_i_sinh);
+/* "Return the hyperbolic sine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_cosh, "$cosh", scm_tc7_dsubr, (SCM (*)()) cosh, g_i_cosh);
+/* "Return the hyperbolic cosine of the real number @var{x}."
+ */
+SCM_GPROC1 (s_i_tanh, "$tanh", scm_tc7_dsubr, (SCM (*)()) tanh, g_i_tanh);
+/* "Return the hyperbolic tangent of the real number @var{x}."
+ */
+
+struct dpair
+{
+ double x, y;
+};
+
+static void scm_two_doubles (SCM x,
+ SCM y,
+ const char *sstring,
+ struct dpair * xy);
+
+static void
+scm_two_doubles (SCM x, SCM y, const char *sstring, struct dpair *xy)
+{
+ if (SCM_INUMP (x))
+ xy->x = SCM_INUM (x);
+ else if (SCM_BIGP (x))
+ xy->x = scm_i_big2dbl (x);
+ else if (SCM_REALP (x))
+ xy->x = SCM_REAL_VALUE (x);
+ else if (SCM_FRACTIONP (x))
+ xy->x = scm_i_fraction2double (x);
+ else
+ scm_wrong_type_arg (sstring, SCM_ARG1, x);
+
+ if (SCM_INUMP (y))
+ xy->y = SCM_INUM (y);
+ else if (SCM_BIGP (y))
+ xy->y = scm_i_big2dbl (y);
+ else if (SCM_REALP (y))
+ xy->y = SCM_REAL_VALUE (y);
+ else if (SCM_FRACTIONP (y))
+ xy->y = scm_i_fraction2double (y);
+ else
+ scm_wrong_type_arg (sstring, SCM_ARG2, y);
+}
+
+
+SCM_DEFINE (scm_sys_expt, "$expt", 2, 0, 0,
+ (SCM x, SCM y),
+ "Return @var{x} raised to the power of @var{y}. This\n"
+ "procedure does not accept complex arguments.")
+#define FUNC_NAME s_scm_sys_expt
+{
+ struct dpair xy;
+ scm_two_doubles (x, y, FUNC_NAME, &xy);
+ return scm_make_real (pow (xy.x, xy.y));
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_sys_atan2, "$atan2", 2, 0, 0,
+ (SCM x, SCM y),
+ "Return the arc tangent of the two arguments @var{x} and\n"
+ "@var{y}. This is similar to calculating the arc tangent of\n"
+ "@var{x} / @var{y}, except that the signs of both arguments\n"
+ "are used to determine the quadrant of the result. This\n"
+ "procedure does not accept complex arguments.")
+#define FUNC_NAME s_scm_sys_atan2
+{
+ struct dpair xy;
+ scm_two_doubles (x, y, FUNC_NAME, &xy);
+ return scm_make_real (atan2 (xy.x, xy.y));
+}
+#undef FUNC_NAME
+
+
+SCM_DEFINE (scm_make_rectangular, "make-rectangular", 2, 0, 0,
+ (SCM real, SCM imaginary),
+ "Return a complex number constructed of the given @var{real} and\n"
+ "@var{imaginary} parts.")
+#define FUNC_NAME s_scm_make_rectangular
+{
+ struct dpair xy;
+ scm_two_doubles (real, imaginary, FUNC_NAME, &xy);
+ return scm_make_complex (xy.x, xy.y);
+}
+#undef FUNC_NAME
+
+
+
+SCM_DEFINE (scm_make_polar, "make-polar", 2, 0, 0,
+ (SCM x, SCM y),
+ "Return the complex number @var{x} * e^(i * @var{y}).")
+#define FUNC_NAME s_scm_make_polar
+{
+ struct dpair xy;
+ double s, c;
+ scm_two_doubles (x, y, FUNC_NAME, &xy);
+#if HAVE_SINCOS
+ sincos (xy.y, &s, &c);
+#else
+ s = sin (xy.y);
+ c = cos (xy.y);
+#endif
+ return scm_make_complex (xy.x * c, xy.x * s);
+}
+#undef FUNC_NAME
+
+
+SCM_GPROC (s_real_part, "real-part", 1, 0, 0, scm_real_part, g_real_part);
+/* "Return the real part of the number @var{z}."
+ */
+SCM
+scm_real_part (SCM z)
+{
+ if (SCM_INUMP (z))
+ return z;
+ else if (SCM_BIGP (z))
+ return z;
+ else if (SCM_REALP (z))
+ return z;
+ else if (SCM_COMPLEXP (z))
+ return scm_make_real (SCM_COMPLEX_REAL (z));
+ else if (SCM_FRACTIONP (z))
+ return z;
+ else
+ SCM_WTA_DISPATCH_1 (g_real_part, z, SCM_ARG1, s_real_part);
+}
+
+
+SCM_GPROC (s_imag_part, "imag-part", 1, 0, 0, scm_imag_part, g_imag_part);
+/* "Return the imaginary part of the number @var{z}."
+ */
+SCM
+scm_imag_part (SCM z)
+{
+ if (SCM_INUMP (z))
+ return SCM_INUM0;
+ else if (SCM_BIGP (z))
+ return SCM_INUM0;
+ else if (SCM_REALP (z))
+ return scm_flo0;
+ else if (SCM_COMPLEXP (z))
+ return scm_make_real (SCM_COMPLEX_IMAG (z));
+ else if (SCM_FRACTIONP (z))
+ return SCM_INUM0;
+ else
+ SCM_WTA_DISPATCH_1 (g_imag_part, z, SCM_ARG1, s_imag_part);
+}
+
+SCM_GPROC (s_numerator, "numerator", 1, 0, 0, scm_numerator, g_numerator);
+/* "Return the numerator of the number @var{z}."
+ */
+SCM
+scm_numerator (SCM z)
+{
+ if (SCM_INUMP (z))
+ return z;
+ else if (SCM_BIGP (z))
+ return z;
+ else if (SCM_FRACTIONP (z))
+ {
+ scm_i_fraction_reduce (z);
+ return SCM_FRACTION_NUMERATOR (z);
+ }
+ else if (SCM_REALP (z))
+ return scm_exact_to_inexact (scm_numerator (scm_inexact_to_exact (z)));
+ else
+ SCM_WTA_DISPATCH_1 (g_numerator, z, SCM_ARG1, s_numerator);
+}
+
+
+SCM_GPROC (s_denominator, "denominator", 1, 0, 0, scm_denominator, g_denominator);
+/* "Return the denominator of the number @var{z}."
+ */
+SCM
+scm_denominator (SCM z)
+{
+ if (SCM_INUMP (z))
+ return SCM_MAKINUM (1);
+ else if (SCM_BIGP (z))
+ return SCM_MAKINUM (1);
+ else if (SCM_FRACTIONP (z))
+ {
+ scm_i_fraction_reduce (z);
+ return SCM_FRACTION_DENOMINATOR (z);
+ }
+ else if (SCM_REALP (z))
+ return scm_exact_to_inexact (scm_denominator (scm_inexact_to_exact (z)));
+ else
+ SCM_WTA_DISPATCH_1 (g_denominator, z, SCM_ARG1, s_denominator);
+}
+
+SCM_GPROC (s_magnitude, "magnitude", 1, 0, 0, scm_magnitude, g_magnitude);
+/* "Return the magnitude of the number @var{z}. This is the same as\n"
+ * "@code{abs} for real arguments, but also allows complex numbers."
+ */
+SCM
+scm_magnitude (SCM z)
+{
+ if (SCM_INUMP (z))
+ {
+ long int zz = SCM_INUM (z);
+ if (zz >= 0)
+ return z;
+ else if (SCM_POSFIXABLE (-zz))
+ return SCM_MAKINUM (-zz);
+ else
+ return scm_i_long2big (-zz);
+ }
+ else if (SCM_BIGP (z))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (z));
+ scm_remember_upto_here_1 (z);
+ if (sgn < 0)
+ return scm_i_clonebig (z, 0);
+ else
+ return z;
+ }
+ else if (SCM_REALP (z))
+ return scm_make_real (fabs (SCM_REAL_VALUE (z)));
+ else if (SCM_COMPLEXP (z))
+ return scm_make_real (hypot (SCM_COMPLEX_REAL (z), SCM_COMPLEX_IMAG (z)));
+ else if (SCM_FRACTIONP (z))
+ {
+ if (SCM_FALSEP (scm_negative_p (SCM_FRACTION_NUMERATOR (z))))
+ return z;
+ return scm_make_ratio (scm_difference (SCM_FRACTION_NUMERATOR (z), SCM_UNDEFINED),
+ SCM_FRACTION_DENOMINATOR (z));
+ }
+ else
+ SCM_WTA_DISPATCH_1 (g_magnitude, z, SCM_ARG1, s_magnitude);
+}
+
+
+SCM_GPROC (s_angle, "angle", 1, 0, 0, scm_angle, g_angle);
+/* "Return the angle of the complex number @var{z}."
+ */
+SCM
+scm_angle (SCM z)
+{
+ /* atan(0,-1) is pi and it'd be possible to have that as a constant like
+ scm_flo0 to save allocating a new flonum with scm_make_real each time.
+ But if atan2 follows the floating point rounding mode, then the value
+ is not a constant. Maybe it'd be close enough though. */
+ if (SCM_INUMP (z))
+ {
+ if (SCM_INUM (z) >= 0)
+ return scm_flo0;
+ else
+ return scm_make_real (atan2 (0.0, -1.0));
+ }
+ else if (SCM_BIGP (z))
+ {
+ int sgn = mpz_sgn (SCM_I_BIG_MPZ (z));
+ scm_remember_upto_here_1 (z);
+ if (sgn < 0)
+ return scm_make_real (atan2 (0.0, -1.0));
+ else
+ return scm_flo0;
+ }
+ else if (SCM_REALP (z))
+ {
+ if (SCM_REAL_VALUE (z) >= 0)
+ return scm_flo0;
+ else
+ return scm_make_real (atan2 (0.0, -1.0));
+ }
+ else if (SCM_COMPLEXP (z))
+ return scm_make_real (atan2 (SCM_COMPLEX_IMAG (z), SCM_COMPLEX_REAL (z)));
+ else if (SCM_FRACTIONP (z))
+ {
+ if (SCM_FALSEP (scm_negative_p (SCM_FRACTION_NUMERATOR (z))))
+ return scm_flo0;
+ else return scm_make_real (atan2 (0.0, -1.0));
+ }
+ else
+ SCM_WTA_DISPATCH_1 (g_angle, z, SCM_ARG1, s_angle);
+}
+
+
+SCM_GPROC (s_exact_to_inexact, "exact->inexact", 1, 0, 0, scm_exact_to_inexact, g_exact_to_inexact);
+/* Convert the number @var{x} to its inexact representation.\n"
+ */
+SCM
+scm_exact_to_inexact (SCM z)
+{
+ if (SCM_INUMP (z))
+ return scm_make_real ((double) SCM_INUM (z));
+ else if (SCM_BIGP (z))
+ return scm_make_real (scm_i_big2dbl (z));
+ else if (SCM_FRACTIONP (z))
+ return scm_make_real (scm_i_fraction2double (z));
+ else if (SCM_INEXACTP (z))
+ return z;
+ else
+ SCM_WTA_DISPATCH_1 (g_exact_to_inexact, z, 1, s_exact_to_inexact);
+}
+
+
+SCM_DEFINE (scm_inexact_to_exact, "inexact->exact", 1, 0, 0,
+ (SCM z),
+ "Return an exact number that is numerically closest to @var{z}.")
+#define FUNC_NAME s_scm_inexact_to_exact
+{
+ if (SCM_INUMP (z))
+ return z;
+ else if (SCM_BIGP (z))
+ return z;
+ else if (SCM_REALP (z))
+ {
+ if (xisinf (SCM_REAL_VALUE (z)) || xisnan (SCM_REAL_VALUE (z)))
+ SCM_OUT_OF_RANGE (1, z);
+ else
+ {
+ mpq_t frac;
+ SCM q;
+
+ mpq_init (frac);
+ mpq_set_d (frac, SCM_REAL_VALUE (z));
+ q = scm_make_ratio (scm_i_mpz2num (mpq_numref (frac)),
+ scm_i_mpz2num (mpq_denref (frac)));
+
+ /* When scm_make_ratio throws, we leak the memory allocated
+ for frac...
+ */
+ mpq_clear (frac);
+ return q;
+ }
+ }
+ else if (SCM_FRACTIONP (z))
+ return z;
+ else
+ SCM_WRONG_TYPE_ARG (1, z);
+}
+#undef FUNC_NAME
+
+SCM_DEFINE (scm_rationalize, "rationalize", 2, 0, 0,
+ (SCM x, SCM err),
+ "Return an exact number that is within @var{err} of @var{x}.")
+#define FUNC_NAME s_scm_rationalize
+{
+ if (SCM_INUMP (x))
+ return x;
+ else if (SCM_BIGP (x))
+ return x;
+ else if ((SCM_REALP (x)) || SCM_FRACTIONP (x))
+ {
+ /* Use continued fractions to find closest ratio. All
+ arithmetic is done with exact numbers.
+ */
+
+ SCM ex = scm_inexact_to_exact (x);
+ SCM int_part = scm_floor (ex);
+ SCM tt = SCM_MAKINUM (1);
+ SCM a1 = SCM_MAKINUM (0), a2 = SCM_MAKINUM (1), a = SCM_MAKINUM (0);
+ SCM b1 = SCM_MAKINUM (1), b2 = SCM_MAKINUM (0), b = SCM_MAKINUM (0);
+ SCM rx;
+ int i = 0;
+
+ if (!SCM_FALSEP (scm_num_eq_p (ex, int_part)))
+ return ex;
+
+ ex = scm_difference (ex, int_part); /* x = x-int_part */
+ rx = scm_divide (ex, SCM_UNDEFINED); /* rx = 1/x */
+
+ /* We stop after a million iterations just to be absolutely sure
+ that we don't go into an infinite loop. The process normally
+ converges after less than a dozen iterations.
+ */
+
+ err = scm_abs (err);
+ while (++i < 1000000)
+ {
+ a = scm_sum (scm_product (a1, tt), a2); /* a = a1*tt + a2 */
+ b = scm_sum (scm_product (b1, tt), b2); /* b = b1*tt + b2 */
+ if (SCM_FALSEP (scm_zero_p (b)) && /* b != 0 */
+ SCM_FALSEP
+ (scm_gr_p (scm_abs (scm_difference (ex, scm_divide (a, b))),
+ err))) /* abs(x-a/b) <= err */
+ {
+ SCM res = scm_sum (int_part, scm_divide (a, b));
+ if (SCM_FALSEP (scm_exact_p (x))
+ || SCM_FALSEP (scm_exact_p (err)))
+ return scm_exact_to_inexact (res);
+ else
+ return res;
+ }
+ rx = scm_divide (scm_difference (rx, tt), /* rx = 1/(rx - tt) */
+ SCM_UNDEFINED);
+ tt = scm_floor (rx); /* tt = floor (rx) */
+ a2 = a1;
+ b2 = b1;
+ a1 = a;
+ b1 = b;
+ }
+ scm_num_overflow (s_scm_rationalize);
+ }
+ else
+ SCM_WRONG_TYPE_ARG (1, x);
+}
+#undef FUNC_NAME
+
+/* if you need to change this, change test-num2integral.c as well */
+#if SCM_SIZEOF_LONG_LONG != 0
+# ifndef LLONG_MAX
+# define ULLONG_MAX ((unsigned long long) (-1))
+# define LLONG_MAX ((long long) (ULLONG_MAX >> 1))
+# define LLONG_MIN (~LLONG_MAX)
+# endif
+#endif
+
+/* Parameters for creating integer conversion routines.
+
+ Define the following preprocessor macros before including
+ "libguile/num2integral.i.c":
+
+ NUM2INTEGRAL - the name of the function for converting from a
+ Scheme object to the integral type. This function will be
+ defined when including "num2integral.i.c".
+
+ INTEGRAL2NUM - the name of the function for converting from the
+ integral type to a Scheme object. This function will be defined.
+
+ INTEGRAL2BIG - the name of an internal function that createas a
+ bignum from the integral type. This function will be defined.
+ The name should start with "scm_i_".
+
+ ITYPE - the name of the integral type.
+
+ UNSIGNED - Define this to 1 when ITYPE is an unsigned type. Define
+ it to 0 otherwise.
+
+ UNSIGNED_ITYPE - the name of the the unsigned variant of the
+ integral type. If you don't define this, it defaults to
+ "unsigned ITYPE" for signed types and simply "ITYPE" for unsigned
+ ones.
+
+ SIZEOF_ITYPE - an expression giving the size of the integral type
+ in bytes. This expression must be computable by the
+ preprocessor. (SIZEOF_FOO values are calculated by configure.in
+ for common types).
+
+*/
+
+#define NUM2INTEGRAL scm_num2short
+#define INTEGRAL2NUM scm_short2num
+#define INTEGRAL2BIG scm_i_short2big
+#define UNSIGNED 0
+#define ITYPE short
+#define SIZEOF_ITYPE SIZEOF_SHORT
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2ushort
+#define INTEGRAL2NUM scm_ushort2num
+#define INTEGRAL2BIG scm_i_ushort2big
+#define UNSIGNED 1
+#define ITYPE unsigned short
+#define SIZEOF_ITYPE SIZEOF_UNSIGNED_SHORT
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2int
+#define INTEGRAL2NUM scm_int2num
+#define INTEGRAL2BIG scm_i_int2big
+#define UNSIGNED 0
+#define ITYPE int
+#define SIZEOF_ITYPE SIZEOF_INT
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2uint
+#define INTEGRAL2NUM scm_uint2num
+#define INTEGRAL2BIG scm_i_uint2big
+#define UNSIGNED 1
+#define ITYPE unsigned int
+#define SIZEOF_ITYPE SIZEOF_UNSIGNED_INT
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2long
+#define INTEGRAL2NUM scm_long2num
+#define INTEGRAL2BIG scm_i_long2big
+#define UNSIGNED 0
+#define ITYPE long
+#define SIZEOF_ITYPE SIZEOF_LONG
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2ulong
+#define INTEGRAL2NUM scm_ulong2num
+#define INTEGRAL2BIG scm_i_ulong2big
+#define UNSIGNED 1
+#define ITYPE unsigned long
+#define SIZEOF_ITYPE SIZEOF_UNSIGNED_LONG
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2ptrdiff
+#define INTEGRAL2NUM scm_ptrdiff2num
+#define INTEGRAL2BIG scm_i_ptrdiff2big
+#define UNSIGNED 0
+#define ITYPE scm_t_ptrdiff
+#define UNSIGNED_ITYPE size_t
+#define SIZEOF_ITYPE SCM_SIZEOF_SCM_T_PTRDIFF
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2size
+#define INTEGRAL2NUM scm_size2num
+#define INTEGRAL2BIG scm_i_size2big
+#define UNSIGNED 1
+#define ITYPE size_t
+#define SIZEOF_ITYPE SIZEOF_SIZE_T
+#include "libguile/num2integral.i.c"
+
+#if SCM_SIZEOF_LONG_LONG != 0
+
+#ifndef ULONG_LONG_MAX
+#define ULONG_LONG_MAX (~0ULL)
+#endif
+
+#define NUM2INTEGRAL scm_num2long_long
+#define INTEGRAL2NUM scm_long_long2num
+#define INTEGRAL2BIG scm_i_long_long2big
+#define UNSIGNED 0
+#define ITYPE long long
+#define SIZEOF_ITYPE SIZEOF_LONG_LONG
+#include "libguile/num2integral.i.c"
+
+#define NUM2INTEGRAL scm_num2ulong_long
+#define INTEGRAL2NUM scm_ulong_long2num
+#define INTEGRAL2BIG scm_i_ulong_long2big
+#define UNSIGNED 1
+#define ITYPE unsigned long long
+#define SIZEOF_ITYPE SIZEOF_UNSIGNED_LONG_LONG
+#include "libguile/num2integral.i.c"
+
+#endif /* SCM_SIZEOF_LONG_LONG != 0 */
+
+#define NUM2FLOAT scm_num2float
+#define FLOAT2NUM scm_float2num
+#define FTYPE float
+#include "libguile/num2float.i.c"
+
+#define NUM2FLOAT scm_num2double
+#define FLOAT2NUM scm_double2num
+#define FTYPE double
+#include "libguile/num2float.i.c"
+
+#ifdef GUILE_DEBUG
+
+#ifndef SIZE_MAX
+#define SIZE_MAX ((size_t) (-1))
+#endif
+#ifndef PTRDIFF_MIN
+#define PTRDIFF_MIN \
+ ((scm_t_ptrdiff) ((scm_t_ptrdiff) 1 \
+ << ((sizeof (scm_t_ptrdiff) * SCM_CHAR_BIT) - 1)))
+#endif
+#ifndef PTRDIFF_MAX
+#define PTRDIFF_MAX (~ PTRDIFF_MIN)
+#endif
+
+#define CHECK(type, v) \
+ do \
+ { \
+ if ((v) != scm_num2##type (scm_##type##2num (v), 1, "check_sanity")) \
+ abort (); \
+ } \
+ while (0)
+
+static void
+check_sanity ()
+{
+ CHECK (short, 0);
+ CHECK (ushort, 0U);
+ CHECK (int, 0);
+ CHECK (uint, 0U);
+ CHECK (long, 0L);
+ CHECK (ulong, 0UL);
+ CHECK (size, 0);
+ CHECK (ptrdiff, 0);
+
+ CHECK (short, -1);
+ CHECK (int, -1);
+ CHECK (long, -1L);
+ CHECK (ptrdiff, -1);
+
+ CHECK (short, SHRT_MAX);
+ CHECK (short, SHRT_MIN);
+ CHECK (ushort, USHRT_MAX);
+ CHECK (int, INT_MAX);
+ CHECK (int, INT_MIN);
+ CHECK (uint, UINT_MAX);
+ CHECK (long, LONG_MAX);
+ CHECK (long, LONG_MIN);
+ CHECK (ulong, ULONG_MAX);
+ CHECK (size, SIZE_MAX);
+ CHECK (ptrdiff, PTRDIFF_MAX);
+ CHECK (ptrdiff, PTRDIFF_MIN);
+
+#if SCM_SIZEOF_LONG_LONG != 0
+ CHECK (long_long, 0LL);
+ CHECK (ulong_long, 0ULL);
+ CHECK (long_long, -1LL);
+ CHECK (long_long, LLONG_MAX);
+ CHECK (long_long, LLONG_MIN);
+ CHECK (ulong_long, ULLONG_MAX);
+#endif
+}
+
+#undef CHECK
+
+#define CHECK \
+ scm_internal_catch (SCM_BOOL_T, check_body, &data, check_handler, &data); \
+ if (!SCM_FALSEP (data)) abort();
+
+static SCM
+check_body (void *data)
+{
+ SCM num = *(SCM *) data;
+ scm_num2ulong (num, 1, NULL);
+
+ return SCM_UNSPECIFIED;
+}
+
+static SCM
+check_handler (void *data, SCM tag, SCM throw_args)
+{
+ SCM *num = (SCM *) data;
+ *num = SCM_BOOL_F;
+
+ return SCM_UNSPECIFIED;
+}
+
+SCM_DEFINE (scm_sys_check_number_conversions, "%check-number-conversions", 0, 0, 0,
+ (void),
+ "Number conversion sanity checking.")
+#define FUNC_NAME s_scm_sys_check_number_conversions
+{
+ SCM data = SCM_MAKINUM (-1);
+ CHECK;
+ data = scm_int2num (INT_MIN);
+ CHECK;
+ data = scm_ulong2num (ULONG_MAX);
+ data = scm_difference (SCM_INUM0, data);
+ CHECK;
+ data = scm_ulong2num (ULONG_MAX);
+ data = scm_sum (SCM_MAKINUM (1), data); data = scm_difference (SCM_INUM0, data);
+ CHECK;
+ data = scm_int2num (-10000); data = scm_product (data, data); data = scm_product (data, data);
+ CHECK;
+
+ return SCM_UNSPECIFIED;
+}
+#undef FUNC_NAME
+
+#endif
+
+void
+scm_init_numbers ()
+{
+ mpz_init_set_si (z_negative_one, -1);
+
+ /* It may be possible to tune the performance of some algorithms by using
+ * the following constants to avoid the creation of bignums. Please, before
+ * using these values, remember the two rules of program optimization:
+ * 1st Rule: Don't do it. 2nd Rule (experts only): Don't do it yet. */
+ scm_c_define ("most-positive-fixnum",
+ SCM_MAKINUM (SCM_MOST_POSITIVE_FIXNUM));
+ scm_c_define ("most-negative-fixnum",
+ SCM_MAKINUM (SCM_MOST_NEGATIVE_FIXNUM));
+
+ scm_add_feature ("complex");
+ scm_add_feature ("inexact");
+ scm_flo0 = scm_make_real (0.0);
+#ifdef DBL_DIG
+ scm_dblprec = (DBL_DIG > 20) ? 20 : DBL_DIG;
+#else
+ { /* determine floating point precision */
+ double f = 0.1;
+ double fsum = 1.0 + f;
+ while (fsum != 1.0)
+ {
+ if (++scm_dblprec > 20)
+ fsum = 1.0;
+ else
+ {
+ f /= 10.0;
+ fsum = f + 1.0;
+ }
+ }
+ scm_dblprec = scm_dblprec - 1;
+ }
+#endif /* DBL_DIG */
+
+#ifdef GUILE_DEBUG
+ check_sanity ();
+#endif
+
+ exactly_one_half = scm_permanent_object (scm_divide (SCM_MAKINUM (1),
+ SCM_MAKINUM (2)));
+#include "libguile/numbers.x"
+}
+
+/*
+ Local Variables:
+ c-file-style: "gnu"
+ End:
+*/