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
|
/* Copyright 2011
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* BSD License:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3. The name of the author may not be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wctype.h>
#include <assert.h>
#include <limits.h>
#include <stdarg.h>
#include <dirent.h>
#include <setjmp.h>
#include <wchar.h>
#include "config.h"
#include "lib.h"
#include "unwind.h"
#include "gc.h"
#include "arith.h"
#define TAG_PAIR(A, B) ((A) << TAG_SHIFT | (B))
static mp_int NUM_MAX_MP;
val make_bignum(void)
{
val n = make_obj();
n->bn.type = BGNUM;
mp_init(&n->bn.mp);
return n;
}
static val normalize(val bignum)
{
switch (mp_cmp_mag(mp(bignum), &NUM_MAX_MP)) {
case MP_EQ:
case MP_GT:
return bignum;
default:
{
cnum fixnum;
mp_get_intptr(mp(bignum), &fixnum);
return num(fixnum);
}
}
}
val plus(val anum, val bnum)
{
int tag_a = tag(anum);
int tag_b = tag(bnum);
switch (TAG_PAIR(tag_a, tag_b)) {
case TAG_PAIR(TAG_NUM, TAG_NUM):
{
cnum a = c_num(anum);
cnum b = c_num(bnum);
cnum sum = a + b;
if (sum < NUM_MIN || sum > NUM_MAX) {
val n = make_bignum();
mp_set_intptr(mp(n), sum);
return n;
}
return num(sum);
}
case TAG_PAIR(TAG_NUM, TAG_PTR):
{
val n;
type_check(bnum, BGNUM);
n = make_bignum();
if (sizeof (int_ptr_t) <= sizeof (mp_digit)) {
mp_add_d(mp(bnum), c_num(anum), mp(n));
} else {
mp_int tmp;
mp_init(&tmp);
mp_set_intptr(&tmp, c_num(anum));
mp_add(mp(bnum), &tmp, mp(n));
}
return normalize(n);
}
case TAG_PAIR(TAG_PTR, TAG_NUM):
{
val n;
type_check(anum, BGNUM);
n = make_bignum();
if (sizeof (int_ptr_t) <= sizeof (mp_digit)) {
mp_add_d(mp(anum), c_num(bnum), mp(n));
} else {
mp_int tmp;
mp_init(&tmp);
mp_set_intptr(&tmp, c_num(bnum));
mp_add(mp(anum), &tmp, mp(n));
}
return normalize(n);
}
case TAG_PAIR(TAG_PTR, TAG_PTR):
{
val n;
type_check(anum, BGNUM);
type_check(bnum, BGNUM);
n = make_bignum();
mp_add(mp(anum), mp(bnum), mp(n));
return normalize(n);
}
}
uw_throwf(error_s, lit("plus: invalid operands ~s ~s"), anum, bnum, nao);
abort();
}
void arith_init(void)
{
mp_init(&NUM_MAX_MP);
mp_set_intptr(&NUM_MAX_MP, NUM_MAX);
}
|
