Snippets
Created by
Takehiko NOZAKI
last modified
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 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 | /*-
* Copyright (c) 2021 Takehiko NOZAKI
* All rights reserved.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*/
#define _GNU_SOURCE /* for asprintf(3) */
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#if defined(HAVE_MATH_H)
#include <math.h>
#endif
#if defined(__NetBSD__)
extern char *__dtoa(double, int, int, int *, int *, char **);
extern void __freedtoa(char *);
#define dtoa __dtoa
#define freedtoa __freedtoa
#include <sys/cdefs.h>
#define arraycount(array) __arraycount(array)
#else
#include "gdtoa.h"
#define arraycount(array) (sizeof(array)/sizeof(array[0]))
#endif
struct dtoatestcase {
double dvalue;
const char *svalue;
};
#define DTOATEST(value) { .dvalue = value, .svalue = #value }
#define debug printf
#define DEFAULTPREC 6
#define MAXEXPSIZ 4
#define NEGATIVE 0x1
#define SQUOTE 0x2
#define MINUS 0x4
#define PLUS 0x8
#define SPACE 0x10
#define SHARP 0x20
#define ZERO 0x40
#define HEX 0x80
#define PADSIZ 20
static const char zeros[PADSIZ] = "00000000000000000000";
static const char spaces[PADSIZ] = " ";
static inline int
pad(const char *filler, int len, FILE *fp)
{
while (len > PADSIZ) {
if (fwrite(filler, 1, PADSIZ, fp) != PADSIZ)
return 1;
len -= PADSIZ;
}
if (fwrite(filler, 1, len, fp) != len)
return 1;
return 0;
}
static inline int
lpad(int sign, int width, int siz, int flags, FILE *fp)
{
if (width > siz && (flags & (MINUS|ZERO)) == 0 &&
pad(spaces, width - siz, fp))
return 1;
if (sign && putc(sign, fp) == EOF)
return 1;
if ((flags & HEX) && fwrite("0x", 1, 2, fp) != 2)
return 1;
if (width > siz && (flags & (MINUS|ZERO)) == ZERO &&
pad(zeros, width - siz, fp))
return 1;
return 0;
}
static inline int
rpad(int width, int siz, int flags, FILE *fp)
{
if (width > siz && (flags & MINUS) &&
pad(spaces, width - siz, fp))
return 1;
return 0;
}
static inline int
cvt_sign(int flags)
{
if (flags & NEGATIVE)
return '-';
else if (flags & PLUS)
return '+';
else if (flags & SPACE)
return ' ';
return '\0';
}
static inline int
cvt_inf(int width, int flags, FILE *fp)
{
int sign, siz;
sign = cvt_sign(flags);
siz = (sign) ? 4 : 3;
if (lpad(sign, width, siz, flags & ~ZERO, fp))
return 1;
if (fwrite("inf", 1, 3, fp) != 3)
return 1;
if (rpad(width, siz, flags, fp))
return 1;
return 0;
}
static inline int
cvt_nan(int width, int flags, FILE *fp)
{
if (lpad('\0', width, 3, flags & ~ZERO, fp))
return 1;
if (fwrite("nan", 1, 3, fp) != 3)
return 1;
if (rpad(width, 3, flags, fp))
return 1;
return 0;
}
static inline int
to_char(int digit)
{
return '0' + digit;
}
static inline int
cvt_exp(int exp, FILE *fp)
{
char expstr[MAXEXPSIZ + 2];
int sign;
size_t len;
expstr[0] = 'e';
if (exp >= 0) {
expstr[1] = '+';
} else {
expstr[1] = '-';
exp = -exp;
}
/* assume DBL_MIN_EXP(-1021) DBL_MAX_EXP(1024) */
if (exp < 100) {
expstr[2] = to_char(exp / 10);
expstr[3] = to_char(exp % 10);
len = 4;
} else if (exp < 1000) {
expstr[2] = to_char(exp / 100);
expstr[3] = to_char((exp % 100) / 10);
expstr[4] = to_char(exp % 10);
len = 5;
} else {
expstr[2] = to_char(exp / 1000);
expstr[3] = to_char((exp % 1000) / 100);
expstr[4] = to_char((exp % 100) / 10);
expstr[5] = to_char(exp % 10);
len = 6;
}
if (fwrite(expstr, 1, len, fp) != len)
return 1;
return 0;
}
static inline int
cvt_esize(int sign, int len, int prec, int exp, int flags)
{
int s, i, f, d, e;
s = (sign) ? 1 : 0;
i = 1;
f = len - 1;
if (f < prec)
f = prec;
d = (f > 0 || flags & SHARP) ? 1 : 0;
if (exp < 0)
exp = -exp;
/* assume DBL_MIN_EXP(-1021) DBL_MAX_EXP(1024) */
if (exp < 100)
e = 4;
else if (exp < 1000)
e = 5;
else
e = 6;
return s + i + f + d + e;
}
static inline int
cvt_efmt(char *head, int len, int width, int prec, int exp, int flags, FILE *fp)
{
int sign, size;
sign = cvt_sign(flags);
size = cvt_esize(sign, len, prec, exp, flags);
if (lpad(sign, width, size, flags, fp))
return 1;
if (putc(*head, fp) == EOF)
return 1;
if (((flags & SHARP) || prec > 0) && putc('.', fp) == EOF)
return 1;
if (--len > 0 && fwrite(&head[1], 1, len, fp) != len)
return 1;
if (prec > len && pad(zeros, prec - len, fp))
return 1;
if (cvt_exp(exp, fp))
return 1;
if (rpad(width, size, flags, fp))
return 1;
return 0;
}
static inline int
cvt_fsize(int sign, int len, int prec, int exp, int flags)
{
int s, i, f, d;
s = (sign) ? 1 : 0;
i = (exp <= 0) ? 1 : exp;
f = (exp > len) ? 0 : len - exp;
if (f < prec)
f = prec;
d = (f > 0 || flags & SHARP) ? 1 : 0;
return s + i + f + d;
}
static inline int
cvt_ffmt(char *head, int len, int width, int prec, int exp, int flags, FILE *fp)
{
int sign, size;
sign = cvt_sign(flags);
size = cvt_fsize(sign, len, prec, exp, flags);
if (lpad(sign, width, size, flags, fp))
return 1;
if (len <= exp) {
if (fwrite(head, 1, len, fp) != len)
return 1;
if (pad(zeros, exp - len, fp))
return 1;
if (((flags & SHARP) || prec > 0) && putc('.', fp) == EOF)
return 1;
len = 0;
} else if (exp > 0) {
if (fwrite(head, 1, exp, fp) != exp)
return 1;
if (putc('.', fp) == EOF)
return 1;
len -= exp;
if (fwrite(&head[exp], 1, len, fp) != len)
return 1;
} else {
if (fwrite("0.", 1, 2, fp) != 2)
return 1;
exp = -exp;
if (exp > 0 && pad(zeros, exp, fp))
return 1;
if (fwrite(head, 1, len, fp) != len)
return 1;
len += exp;
}
if (prec > len && pad(zeros, prec - len, fp))
return 1;
if (rpad(width, size, flags, fp))
return 1;
return 0;
}
static inline int
cvt_gfmt(char *head, int len, int width, int prec, int exp, int flags, FILE *fp)
{
int gprec;
gprec = (flags & SHARP) ? prec : len;
if (exp <= -4 || exp > prec) {
if (cvt_efmt(head, len, width, gprec - 1, exp - 1, flags, fp))
return 1;
} else {
if (cvt_ffmt(head, len, width, gprec - exp, exp, flags, fp))
return 1;
}
return 0;
}
int
gcvt(double dvalue, int width, int prec, FILE *fp)
{
int flags, exp, neg, len, ret;
char *head, *tail;
flags = 0;
if (prec < 0)
prec = DEFAULTPREC;
else if (prec == 0)
prec = 1;
head = dtoa(dvalue, 2, prec, &exp, &neg, &tail);
if (head == NULL)
return 1;
len = tail - head;
if (neg)
flags |= NEGATIVE;
if (exp == 9999) {
switch (*head) {
case 'I':
ret = cvt_inf(width, flags, fp);
break;
case 'N':
ret = cvt_nan(width, flags, fp);
break;
default:
ret = 1;
}
} else {
ret = cvt_gfmt(head, len, width, prec, exp, flags, fp);
}
freedtoa(head);
return ret;
}
int
main(int argc, char *argv[])
{
static const struct dtoatestcase t[] = {
#if defined(HAVE_MATH_H) && !defined(__vax__)
DTOATEST(INF),
DTOATEST(NAN),
#else
DTOATEST(1.0/0.0),
DTOATEST(0.0/0.0),
#endif
DTOATEST(0.0),
DTOATEST(1.0),
DTOATEST(12.0),
DTOATEST(123.0),
DTOATEST(10.0),
DTOATEST(100.0),
DTOATEST(1000.0),
DTOATEST(0.1),
DTOATEST(0.01),
DTOATEST(0.001),
DTOATEST(0.123456789000),
DTOATEST(0.0123456789000),
DTOATEST(0.00123456789000),
DTOATEST(0.0001234567890000),
DTOATEST(1.1),
DTOATEST(1.123456789),
DTOATEST(11.23456789),
DTOATEST(112.3456789),
DTOATEST(1123.456789),
DTOATEST(11234.56789),
DTOATEST(112345.6789),
DTOATEST(1123456.789),
DTOATEST(11234567.89),
DTOATEST(112345678.9),
DTOATEST(1123456789.0),
DTOATEST(11234567890123.0),
};
size_t i, n;
int prec;
FILE *fp;
char *expect, *result;
for (i = 0; i < arraycount(t); ++i) {
for (prec = -1; prec <= 20; ++prec) {
expect = NULL;
if (asprintf(&expect, "%30.*g", prec, t[i].dvalue) < 0)
abort();
result = NULL;
fp = open_memstream(&result, &n);
if (fp == NULL)
abort();
if (gcvt(t[i].dvalue, 30, prec, fp))
abort();
fclose(fp);
printf("testcase:[%s], expect:[%s], result[%s]\n",
t[i].svalue, expect, result);
if (strcmp(result, expect))
abort();
free(expect);
free(result);
}
}
exit(EXIT_SUCCESS);
}
|
Comments (0)
You can clone a snippet to your computer for local editing. Learn more.