1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/* -*-C-*-
$Id: bigprm.c,v 1.8 2003/02/14 18:28:15 cph Exp $
Copyright (c) 1989-1999 Massachusetts Institute of Technology
This file is part of MIT/GNU Scheme.
MIT/GNU Scheme is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at
your option) any later version.
MIT/GNU Scheme 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 MIT/GNU Scheme; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
USA.
*/
/* Bignum Primitives */
#include "scheme.h"
#include "prims.h"
#include "zones.h"
#define BIGNUM_TEST(predicate) \
{ \
PRIMITIVE_HEADER (1); \
Set_Time_Zone (Zone_Math); \
CHECK_ARG (1, BIGNUM_P); \
PRIMITIVE_RETURN (BOOLEAN_TO_OBJECT (predicate (ARG_REF (1)))); \
}
DEFINE_PRIMITIVE ("BIGNUM-ZERO?", Prim_bignum_zero_p, 1, 1, 0)
BIGNUM_TEST (BIGNUM_ZERO_P)
DEFINE_PRIMITIVE ("BIGNUM-NEGATIVE?", Prim_bignum_negative_p, 1, 1, 0)
BIGNUM_TEST (BIGNUM_NEGATIVE_P)
DEFINE_PRIMITIVE ("BIGNUM-POSITIVE?", Prim_bignum_positive_p, 1, 1, 0)
BIGNUM_TEST (BIGNUM_POSITIVE_P)
#define BIGNUM_COMPARISON(predicate) \
{ \
PRIMITIVE_HEADER (2); \
Set_Time_Zone (Zone_Math); \
CHECK_ARG (1, BIGNUM_P); \
CHECK_ARG (2, BIGNUM_P); \
PRIMITIVE_RETURN \
(BOOLEAN_TO_OBJECT (predicate ((ARG_REF (1)), (ARG_REF (2))))); \
}
DEFINE_PRIMITIVE ("BIGNUM-EQUAL?", Prim_bignum_equal_p, 2, 2, 0)
BIGNUM_COMPARISON (bignum_equal_p)
DEFINE_PRIMITIVE ("BIGNUM-LESS?", Prim_bignum_less_p, 2, 2, 0)
BIGNUM_COMPARISON (BIGNUM_LESS_P)
#define BIGNUM_BINARY(operator) \
{ \
PRIMITIVE_HEADER (2); \
Set_Time_Zone (Zone_Math); \
CHECK_ARG (1, BIGNUM_P); \
CHECK_ARG (2, BIGNUM_P); \
PRIMITIVE_RETURN (operator ((ARG_REF (1)), (ARG_REF (2)))); \
}
DEFINE_PRIMITIVE ("BIGNUM-ADD", Prim_bignum_add, 2, 2, 0)
BIGNUM_BINARY (bignum_add)
DEFINE_PRIMITIVE ("BIGNUM-SUBTRACT", Prim_bignum_subtract, 2, 2, 0)
BIGNUM_BINARY (bignum_subtract)
DEFINE_PRIMITIVE ("BIGNUM-MULTIPLY", Prim_bignum_multiply, 2, 2, 0)
BIGNUM_BINARY (bignum_multiply)
DEFINE_PRIMITIVE ("BIGNUM-DIVIDE", Prim_bignum_divide, 2, 2, 0)
{
SCHEME_OBJECT quotient;
SCHEME_OBJECT remainder;
PRIMITIVE_HEADER (2);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, BIGNUM_P);
CHECK_ARG (2, BIGNUM_P);
if (bignum_divide ((ARG_REF (1)), (ARG_REF (2)), ("ient), (&remainder)))
error_bad_range_arg (2);
PRIMITIVE_RETURN (cons (quotient, remainder));
}
#define BIGNUM_QR(operator) \
{ \
SCHEME_OBJECT result; \
PRIMITIVE_HEADER (2); \
Set_Time_Zone (Zone_Math); \
CHECK_ARG (1, BIGNUM_P); \
CHECK_ARG (2, BIGNUM_P); \
result = (operator ((ARG_REF (1)), (ARG_REF (2)))); \
if (result == SHARP_F) \
error_bad_range_arg (2); \
PRIMITIVE_RETURN (result); \
}
DEFINE_PRIMITIVE ("BIGNUM-QUOTIENT", Prim_bignum_quotient, 2, 2, 0)
BIGNUM_QR (bignum_quotient)
DEFINE_PRIMITIVE ("BIGNUM-REMAINDER", Prim_bignum_remainder, 2, 2, 0)
BIGNUM_QR (bignum_remainder)
static void
DEFUN (listify_bignum_consumer, (previous_cdr, digit),
PTR previous_cdr AND
long digit)
{
(* ((SCHEME_OBJECT *) previous_cdr)) =
(cons ((LONG_TO_UNSIGNED_FIXNUM (digit)),
(* ((SCHEME_OBJECT *) previous_cdr))));
}
DEFINE_PRIMITIVE ("LISTIFY-BIGNUM", Prim_listify_bignum, 2, 2,
"Returns a list of the digits of BIGNUM in RADIX.")
{
PRIMITIVE_HEADER (2);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, BIGNUM_P);
{
SCHEME_OBJECT bignum = (ARG_REF (1));
long radix =
(arg_integer_in_range (2, 2, (bignum_max_digit_stream_radix ())));
if (BIGNUM_ZERO_P (bignum))
PRIMITIVE_RETURN (cons ((LONG_TO_UNSIGNED_FIXNUM (0)), EMPTY_LIST));
{
SCHEME_OBJECT previous_cdr = EMPTY_LIST;
bignum_to_digit_stream
(bignum, radix, listify_bignum_consumer, (&previous_cdr));
PRIMITIVE_RETURN (previous_cdr);
}
}
}
DEFINE_PRIMITIVE ("FIXNUM->BIGNUM", Prim_fixnum_to_bignum, 1, 1, 0)
{
PRIMITIVE_HEADER (1);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, FIXNUM_P);
PRIMITIVE_RETURN (FIXNUM_TO_BIGNUM (ARG_REF (1)));
}
DEFINE_PRIMITIVE ("BIGNUM->FIXNUM", Prim_bignum_to_fixnum, 1, 1, 0)
{
PRIMITIVE_HEADER (1);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, BIGNUM_P);
PRIMITIVE_RETURN (bignum_to_fixnum (ARG_REF (1)));
}
DEFINE_PRIMITIVE ("FLONUM->BIGNUM", Prim_flonum_to_bignum, 1, 1, 0)
{
PRIMITIVE_HEADER (1);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, FLONUM_P);
PRIMITIVE_RETURN (FLONUM_TO_BIGNUM (ARG_REF (1)));
}
DEFINE_PRIMITIVE ("BIGNUM->FLONUM", Prim_bignum_to_flonum, 1, 1, 0)
{
PRIMITIVE_HEADER (1);
Set_Time_Zone (Zone_Math);
CHECK_ARG (1, BIGNUM_P);
PRIMITIVE_RETURN (bignum_to_flonum (ARG_REF (1)));
}
DEFINE_PRIMITIVE ("BIGNUM-LENGTH-IN-BITS", Prim_bignum_length_in_bits, 1, 1, 0)
{
PRIMITIVE_HEADER (1);
CHECK_ARG (1, BIGNUM_P);
PRIMITIVE_RETURN (bignum_length_in_bits (ARG_REF (1)));
}
|