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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/* Copyright © 2018, Keith Packard
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* 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.
* Neither the name of the copyright holders nor the names of
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. */
#include "dtoa_engine.h"
const FLOAT __dtoa_scale_up[] = {
#if DTOA_MAX_10_EXP >= 1
1e1,
#endif
#if DTOA_MAX_10_EXP >= 2
1e2,
#endif
#if DTOA_MAX_10_EXP >= 4
1e4,
#endif
#if DTOA_MAX_10_EXP >= 8
1e8,
#endif
#if DTOA_MAX_10_EXP >= 16
1e16,
#endif
#if DTOA_MAX_10_EXP >= 32
1e32,
#endif
#if DTOA_MAX_10_EXP >= 64
1e64,
#endif
#if DTOA_MAX_10_EXP >= 128
1e128,
#endif
#if DTOA_MAX_10_EXP >= 256
1e256,
#endif
#if DTOA_MAX_10_EXP >= 512
1e512,
#endif
#if DTOA_MAX_10_EXP >= 1024
#error DTOA_MAX_10_EXP too large
#endif
};
const FLOAT __dtoa_scale_down[] = {
#if DTOA_MIN_10_EXP <= -1
1e-1,
#endif
#if DTOA_MIN_10_EXP <= -2
1e-2,
#endif
#if DTOA_MIN_10_EXP <= -4
1e-4,
#endif
#if DTOA_MIN_10_EXP <= -8
1e-8,
#endif
#if DTOA_MIN_10_EXP <= -16
1e-16,
#endif
#if DTOA_MIN_10_EXP <= -32
1e-32,
#endif
#if DTOA_MIN_10_EXP <= -64
1e-64,
#endif
#if DTOA_MIN_10_EXP <= -128
1e-128,
#endif
#if DTOA_MIN_10_EXP <= -256
1e-256,
#endif
#if DTOA_MIN_10_EXP <= -512
1e-512,
#endif
#if DTOA_MIN_10_EXP >= 1024
#error DTOA_MIN_10_EXP too small
#endif
};
const FLOAT __dtoa_round[] = {
#if DTOA_DIG > 30
#error DTOA_DIG too large
#endif
#if DTOA_DIG >= 30
5e30,
#endif
#if DTOA_DIG >= 29
5e29,
#endif
#if DTOA_DIG >= 28
5e28,
#endif
#if DTOA_DIG >= 27
5e27,
#endif
#if DTOA_DIG >= 26
5e26,
#endif
#if DTOA_DIG >= 25
5e25,
#endif
#if DTOA_DIG >= 24
5e24,
#endif
#if DTOA_DIG >= 23
5e23,
#endif
#if DTOA_DIG >= 22
5e22,
#endif
#if DTOA_DIG >= 21
5e21,
#endif
#if DTOA_DIG >= 20
5e20,
#endif
#if DTOA_DIG >= 19
5e19,
#endif
#if DTOA_DIG >= 18
5e18,
#endif
#if DTOA_DIG >= 17
5e17,
#endif
#if DTOA_DIG >= 16
5e16,
#endif
#if DTOA_DIG >= 15
5e15,
#endif
#if DTOA_DIG >= 14
5e14,
#endif
#if DTOA_DIG >= 13
5e13,
#endif
#if DTOA_DIG >= 12
5e12,
#endif
#if DTOA_DIG >= 11
5e11,
#endif
#if DTOA_DIG >= 10
5e10,
#endif
#if DTOA_DIG >= 9
5e9,
#endif
#if DTOA_DIG >= 8
5e8,
#endif
#if DTOA_DIG >= 7
5e7,
#endif
#if DTOA_DIG >= 6
5e6,
#endif
#if DTOA_DIG >= 5
5e5,
#endif
#if DTOA_DIG >= 4
5e4,
#endif
#if DTOA_DIG >= 3
5e3,
#endif
#if DTOA_DIG >= 2
5e2,
#endif
#if DTOA_DIG >= 1
5e1,
#endif
#if DTOA_DIG >= 0
5e0,
#endif
};
/*
* Make sure the computed sizes of the arrays match the actual sizes
* by declaring an array which is legal if the sizes match and illegal
* if they do not
*/
#define count_of(n) (sizeof (n) / sizeof (n[0]))
#define match(array,size) (count_of(array) == size)
#define check_match(array,size) (match(array, size) ? 1 : -1)
typedef struct {
int check_up[check_match(__dtoa_scale_up, DTOA_SCALE_UP_NUM)];
int check_down[check_match(__dtoa_scale_down, DTOA_SCALE_DOWN_NUM)];
int check_round[check_match(__dtoa_round, DTOA_ROUND_NUM)];
} check_sizes;
|
