blob: 010097b937012e2e2f04acb8dd8fa4e3c5b92e0d [file] [log] [blame]
vlm785435b2004-09-14 12:46:35 +00001/*-
2 * Copyright (c) 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
3 * Redistribution and modifications are permitted subject to BSD license.
4 */
vlm39ba4c42004-09-22 16:06:28 +00005#include <asn_internal.h>
vlm785435b2004-09-14 12:46:35 +00006#include <REAL.h>
vlm785435b2004-09-14 12:46:35 +00007#include <stdlib.h> /* for strtod(3) */
8#include <math.h>
9#include <errno.h>
10#include <assert.h>
11
12#undef INT_MAX
13#define INT_MAX ((int)(((unsigned int)-1) >> 1))
14
vlm1d3ed282004-09-14 13:40:42 +000015#ifndef INFINITY
16#define INFINITY HUGE_VAL
17#endif
18
19#ifndef NAN
20static const double nan0;
21#define NAN (nan0/nan0)
22#endif
23
vlm785435b2004-09-14 12:46:35 +000024/*
25 * REAL basic type description.
26 */
27static ber_tlv_tag_t asn1_DEF_REAL_tags[] = {
28 (ASN_TAG_CLASS_UNIVERSAL | (9 << 2))
29};
30asn1_TYPE_descriptor_t asn1_DEF_REAL = {
31 "REAL",
vlm6678cb12004-09-26 13:10:40 +000032 ASN__PRIMITIVE_TYPE_free,
vlm39ba4c42004-09-22 16:06:28 +000033 REAL_print,
vlm785435b2004-09-14 12:46:35 +000034 asn_generic_no_constraint,
vlm6678cb12004-09-26 13:10:40 +000035 ber_decode_primitive,
36 der_encode_primitive,
vlm39ba4c42004-09-22 16:06:28 +000037 0, /* Not implemented yet */
38 REAL_encode_xer,
vlm785435b2004-09-14 12:46:35 +000039 0, /* Use generic outmost tag fetcher */
40 asn1_DEF_REAL_tags,
41 sizeof(asn1_DEF_REAL_tags) / sizeof(asn1_DEF_REAL_tags[0]),
42 asn1_DEF_REAL_tags, /* Same as above */
43 sizeof(asn1_DEF_REAL_tags) / sizeof(asn1_DEF_REAL_tags[0]),
vlm785435b2004-09-14 12:46:35 +000044 0, 0, /* No members */
45 0 /* No specifics */
46};
47
vlm39ba4c42004-09-22 16:06:28 +000048ssize_t
49REAL__dump(double d, int canonical, asn_app_consume_bytes_f *cb, void *app_key) {
50 char local_buf[32];
51 char *buf = local_buf;
52 ssize_t buflen = sizeof(local_buf);
53 const char *fmt = canonical?"%15E":"f";
54 ssize_t ret;
55
vlm6678cb12004-09-26 13:10:40 +000056 /*
57 * Check whether it is a special value.
58 */
59 if(finite(d) == 0) {
60 if(isinf(d)) {
61 if(copysign(1.0, d) < 0.0) {
62 buf = "<MINUS-INFINITY/>";
63 buflen = 17;
64 } else {
65 buf = "<PLUS-INFINITY/>";
66 buflen = 16;
67 }
68 } else {
69 buf = "<NOT-A-NUMBER/>";
70 buflen = 15;
71 }
72 return (cb(buf, buflen, app_key) < 0) ? -1 : buflen;
73 }
74
75 /*
76 * Use the libc's double printing, hopefully they got it right.
77 */
vlm39ba4c42004-09-22 16:06:28 +000078 do {
79 ret = snprintf(buf, buflen, fmt, d);
80 if(ret < 0) {
81 buflen <<= 1;
82 } else if(ret >= buflen) {
83 buflen = ret + 1;
84 } else {
85 buflen = ret;
86 break;
87 }
88 if(buf != local_buf) free(buf);
vlm6678cb12004-09-26 13:10:40 +000089 buf = (char *)MALLOC(buflen);
vlm39ba4c42004-09-22 16:06:28 +000090 if(!buf) return -1;
91 } while(1);
92
93 /*
94 * Transform the "[-]d.dddE+-dd" output into "[-]d.dddE[-]d"
95 */
96 if(canonical) {
97 char *dot, *E;
98 char *end = buf + buflen;
99
100 dot = (buf[0] == '-') ? (buf + 2) : (buf + 1);
101 if(*dot >= 0x30) {
102 errno = EINVAL;
103 return -1; /* Not a dot, really */
104 }
105 *dot = '.'; /* Replace possible comma */
106
107 for(E = dot; dot < end; E++) {
108 if(*E == 'E') {
109 char *s = ++E;
110 if(*E == '+') {
111 /* Skip the "+" too */
112 buflen -= 2;
113 } else {
114 buflen -= 1;
115 s++;
116 }
117 E += 2;
118 if(E[-1] != '0' || E > end) {
119 errno = EINVAL;
120 return -1;
121 }
122 for(; E <= end; s++, E++)
123 *s = *E;
124 }
125 }
126 if(E == end) {
127 errno = EINVAL;
128 return -1; /* No promised E */
129 }
130 }
131
132 ret = cb(buf, buflen, app_key);
133 if(buf != local_buf) free(buf);
134 return (ret < 0) ? -1 : buflen;
135}
136
vlm785435b2004-09-14 12:46:35 +0000137int
138REAL_print(asn1_TYPE_descriptor_t *td, const void *sptr, int ilevel,
139 asn_app_consume_bytes_f *cb, void *app_key) {
140 const REAL_t *st = (const REAL_t *)sptr;
vlm6678cb12004-09-26 13:10:40 +0000141 ssize_t ret;
vlm785435b2004-09-14 12:46:35 +0000142 double d;
vlm785435b2004-09-14 12:46:35 +0000143
144 (void)td; /* Unused argument */
145 (void)ilevel; /* Unused argument */
146
vlm39ba4c42004-09-22 16:06:28 +0000147 if(!st || !st->buf)
vlm6678cb12004-09-26 13:10:40 +0000148 ret = cb("<absent>", 8, app_key);
149 else if(asn1_REAL2double(st, &d))
150 ret = cb("<error>", 7, app_key);
151 else
152 ret = REAL__dump(d, 0, cb, app_key);
vlm785435b2004-09-14 12:46:35 +0000153
vlm6678cb12004-09-26 13:10:40 +0000154 return (ret < 0) ? -1 : 0;
vlm39ba4c42004-09-22 16:06:28 +0000155}
vlm785435b2004-09-14 12:46:35 +0000156
vlm39ba4c42004-09-22 16:06:28 +0000157asn_enc_rval_t
158REAL_encode_xer(asn1_TYPE_descriptor_t *td, void *sptr,
159 int ilevel, enum xer_encoder_flags_e flags,
160 asn_app_consume_bytes_f *cb, void *app_key) {
161 REAL_t *st = (REAL_t *)sptr;
162 asn_enc_rval_t er;
163 double d;
164
165 (void)ilevel;
166
167 if(!st || !st->buf || asn1_REAL2double(st, &d))
168 _ASN_ENCODE_FAILED;
169
170 er.encoded = REAL__dump(d, flags & XER_F_CANONICAL, cb, app_key);
171 if(er.encoded < 0) _ASN_ENCODE_FAILED;
172
173 return er;
vlm785435b2004-09-14 12:46:35 +0000174}
175
176int
177asn1_REAL2double(const REAL_t *st, double *dbl_value) {
vlm39ba4c42004-09-22 16:06:28 +0000178 unsigned int octv;
vlm785435b2004-09-14 12:46:35 +0000179
180 if(!st || !st->buf) {
181 errno = EINVAL;
182 return -1;
183 }
184
185 if(st->size == 0) {
186 *dbl_value = 0;
187 return 0;
188 }
189
190 octv = st->buf[0]; /* unsigned byte */
191
192 switch(octv & 0xC0) {
193 case 0x40: /* X.690: 8.5.8 */
194 /* "SpecialRealValue" */
195
196 /* Be liberal in what you accept...
197 if(st->size != 1) ...
198 */
199
200 switch(st->buf[0]) {
201 case 0x40: /* 01000000: PLUS-INFINITY */
202 *dbl_value = INFINITY;
203 return 0;
204 case 0x41: /* 01000001: MINUS-INFINITY */
205 *dbl_value = -INFINITY;
206 return 0;
207 /*
208 * The following cases are defined by
209 * X.690 Amendment 1 (10/03)
210 */
211 case 0x42: /* 01000010: NOT-A-NUMBER */
212 *dbl_value = NAN;
213 return 0;
214 case 0x43: /* 01000011: minus zero */
215 *dbl_value = NAN;
216 return 0;
217 }
218
219 errno = EINVAL;
220 return -1;
221 case 0x00: { /* X.690: 8.5.6 */
222 /*
223 * Decimal. NR{1,2,3} format.
224 */
225 double d;
226
227 assert(st->buf[st->size - 1] == 0); /* Security, vashu mat' */
228
229 d = strtod((char *)st->buf, 0);
230 if(finite(d)) {
231 *dbl_value = d;
232 return 0;
233 } else {
234 errno = ERANGE;
235 return 0;
236 }
237 }
238 }
239
240 /*
241 * Binary representation.
242 */
243 {
244 double m;
245 int expval; /* exponent value */
246 unsigned int elen; /* exponent value length, in octets */
247 unsigned int scaleF;
248 unsigned int baseF;
249 uint8_t *ptr;
250 uint8_t *end;
251 int sign;
252
253 switch((octv & 0x30) >> 4) {
254 case 0x00: baseF = 1; break; /* base 2 */
255 case 0x01: baseF = 3; break; /* base 8 */
256 case 0x02: baseF = 4; break; /* base 16 */
257 default:
258 /* Reserved field, can't parse now. */
259 errno = EINVAL;
260 return -1;
261 }
262
263 sign = (octv & 0x40); /* bit 7 */
264 scaleF = (octv & 0x0C) >> 2; /* bits 4 to 3 */
265
vlm39ba4c42004-09-22 16:06:28 +0000266 if(st->size <= (int)(1 + (octv & 0x03))) {
vlm785435b2004-09-14 12:46:35 +0000267 errno = EINVAL;
268 return -1;
269 }
270
271 if((octv & 0x03) == 0x11) {
272 /* 8.5.6.4, case d) */
273 elen = st->buf[1]; /* unsigned binary number */
vlm39ba4c42004-09-22 16:06:28 +0000274 if(elen == 0 || st->size <= (int)(2 + elen)) {
vlm785435b2004-09-14 12:46:35 +0000275 errno = EINVAL;
276 return -1;
277 }
278 ptr = &st->buf[2];
279 } else {
280 elen = (octv & 0x03);
281 ptr = &st->buf[1];
282 }
283
284 /* Fetch the multibyte exponent */
285 expval = (int)(*(int8_t *)ptr);
286 end = ptr + elen + 1;
287 for(ptr++; ptr < end; ptr++)
288 expval = (expval * 256) + *ptr;
289
290 m = 0.0; /* Initial mantissa value */
291
292 /* Okay, the exponent is here. Now, what about mantissa? */
293 end = st->buf + st->size;
294 if(ptr < end) {
295 for(; ptr < end; ptr++)
296 m = scalbn(m, 8) + *ptr;
297 }
298
299 ASN_DEBUG("m=%.10f, scF=%d, bF=%d, expval=%d, ldexp()=%f, scalbn()=%f",
300 m, scaleF, baseF, expval,
301 ldexp(m, expval * baseF + scaleF),
302 scalbn(m, scaleF) * pow(pow(2, baseF), expval)
303 );
304
305 /*
306 * (S * N * 2^F) * B^E
307 * Essentially:
308 m = scalbn(m, scaleF) * pow(pow(2, base), expval);
309 */
310 m = ldexp(m, expval * baseF + scaleF);
311 if(finite(m)) {
312 *dbl_value = sign ? -m : m;
313 } else {
314 errno = ERANGE;
315 return -1;
316 }
317
318 } /* if(binary_format) */
319
320 return 0;
321}
322
323/*
324 * Assume IEEE 754 floating point: standard 64 bit double.
325 * [1 bit sign] [11 bits exponent] [52 bits mantissa]
326 */
327int
328asn1_double2REAL(REAL_t *st, double dbl_value) {
329#ifdef WORDS_BIGENDIAN /* Known to be big-endian */
330 int littleEndian = 0;
331#else /* need to test: have no explicit information */
332 unsigned int LE = 1;
333 int littleEndian = *(unsigned char *)&LE;
334#endif
335 uint8_t buf[16]; /* More than enough for 8-byte dbl_value */
336 uint8_t dscr[sizeof(dbl_value)]; /* double value scratch pad */
337 /* Assertion guards: won't even compile, if unexpected double size */
338 char assertion_buffer1[9 - sizeof(dbl_value)] __attribute__((unused));
339 char assertion_buffer2[sizeof(dbl_value) - 7] __attribute__((unused));
340 uint8_t *ptr = buf;
341 uint8_t *mstop; /* Last byte of mantissa */
342 unsigned int mval; /* Value of the last byte of mantissa */
343 unsigned int bmsign; /* binary mask with sign */
344 unsigned int buflen;
345 unsigned int accum;
346 int expval;
347
348 if(!st) {
349 errno = EINVAL;
350 return -1;
351 }
352
vlm46361982004-09-14 13:58:10 +0000353 /*
354 * ilogb(+-0) returns -INT_MAX or INT_MIN (platform-dependent)
355 * ilogb(+-inf) returns INT_MAX
356 */
vlm785435b2004-09-14 12:46:35 +0000357 expval = ilogb(dbl_value);
358
vlm46361982004-09-14 13:58:10 +0000359 if(expval <= -INT_MAX /* Also catches (dbl_value == 0) */
vlm785435b2004-09-14 12:46:35 +0000360 || expval == INT_MAX /* catches finite() which catches isnan() */
361 ) {
362 if(!st->buf || st->size < 2) {
vlm6678cb12004-09-26 13:10:40 +0000363 ptr = (uint8_t *)MALLOC(2);
vlm785435b2004-09-14 12:46:35 +0000364 if(!ptr) return -1;
365 st->buf = ptr;
366 }
367 /* fpclassify(3) is not portable yet */
vlm46361982004-09-14 13:58:10 +0000368 if(expval <= -INT_MAX) {
vlmb02ccb22004-09-14 13:50:21 +0000369 if(copysign(1.0, dbl_value) < 0.0) {
vlm785435b2004-09-14 12:46:35 +0000370 st->buf[0] = 0x80 | 0x40;
371 st->buf[1] = 0;
372 st->size = 2;
373 } else {
374 st->buf[0] = 0; /* JIC */
375 st->size = 0;
376 }
377 } else if(isinf(dbl_value)) {
vlmb02ccb22004-09-14 13:50:21 +0000378 if(copysign(1.0, dbl_value) < 0.0) {
vlm785435b2004-09-14 12:46:35 +0000379 st->buf[0] = 0x41; /* MINUS-INFINITY */
380 } else {
381 st->buf[0] = 0x40; /* PLUS-INFINITY */
382 }
383 st->buf[1] = 0;
384 st->size = 1;
385 } else {
386 st->buf[0] = 0x42; /* NaN */
387 st->buf[1] = 0;
388 st->size = 1;
389 }
390 return 0;
391 }
392
393 if(littleEndian) {
394 uint8_t *s = ((uint8_t *)&dbl_value) + sizeof(dbl_value) - 2;
vlm46361982004-09-14 13:58:10 +0000395 uint8_t *start = ((uint8_t *)&dbl_value);
vlm785435b2004-09-14 12:46:35 +0000396 uint8_t *d;
397
398 bmsign = 0x80 | ((s[1] >> 1) & 0x40); /* binary mask & - */
vlm46361982004-09-14 13:58:10 +0000399 for(mstop = d = dscr; s >= start; d++, s--) {
vlm785435b2004-09-14 12:46:35 +0000400 *d = *s;
401 if(*d) mstop = d;
402 }
403 } else {
404 uint8_t *s = ((uint8_t *)&dbl_value) + 1;
405 uint8_t *end = ((uint8_t *)&dbl_value) + sizeof(double);
406 uint8_t *d;
407
408 bmsign = 0x80 | ((s[-1] >> 1) & 0x40); /* binary mask & - */
409 for(mstop = d = dscr; s < end; d++, s++) {
410 *d = *s;
411 if(*d) mstop = d;
412 }
413 }
414
415 /* Remove parts of the exponent, leave mantissa and explicit 1. */
416 dscr[0] = 0x10 | (dscr[0] & 0x0f);
417
418 /* Adjust exponent in a very unobvious way */
419 expval -= 8 * ((mstop - dscr) + 1) - 4;
420
421 /* This loop ensures DER conformance by forcing mantissa odd: 11.3.1 */
422 mval = *mstop;
423 if(mval && !(mval & 1)) {
424 unsigned int shift_count = 1;
425 unsigned int ishift;
426 uint8_t *mptr;
427
428 /*
429 * Figure out what needs to be done to make mantissa odd.
430 */
431 if(!(mval & 0x0f)) /* Speed-up a little */
432 shift_count = 4;
433 while(((mval >> shift_count) & 1) == 0)
434 shift_count++;
435
436 ishift = 8 - shift_count;
437 accum = 0;
438
439 /* Go over the buffer, shifting it shift_count bits right. */
440 for(mptr = dscr; mptr <= mstop; mptr++) {
441 mval = *mptr;
442 *mptr = accum | (mval >> shift_count);
443 accum = mval << ishift;
444 }
445
446 /* Adjust mantissa appropriately. */
447 expval += shift_count;
448 }
449
450 if(expval < 0) {
451 if((expval >> 7) == -1) {
452 *ptr++ = bmsign | 0x00;
453 *ptr++ = expval;
454 } else if((expval >> 15) == -1) {
455 *ptr++ = bmsign | 0x01;
456 *ptr++ = expval >> 8;
457 *ptr++ = expval;
458 } else {
vlm785435b2004-09-14 12:46:35 +0000459 *ptr++ = bmsign | 0x02;
460 *ptr++ = expval >> 16;
461 *ptr++ = expval >> 8;
462 *ptr++ = expval;
463 }
464 } else if(expval <= 0x7f) {
465 *ptr++ = bmsign | 0x00;
466 *ptr++ = expval;
467 } else if(expval <= 0x7fff) {
468 *ptr++ = bmsign | 0x01;
469 *ptr++ = expval >> 8;
470 *ptr++ = expval;
471 } else {
472 assert(expval <= 0x7fffff);
473 *ptr++ = bmsign | 0x02;
474 *ptr++ = expval >> 16;
475 *ptr++ = expval >> 8;
476 *ptr++ = expval;
477 }
478
479 buflen = (mstop - dscr) + 1;
480 memcpy(ptr, dscr, buflen);
481 ptr += buflen;
482 buflen = ptr - buf;
483
484 (void *)ptr = MALLOC(buflen + 1);
485 if(!ptr) return -1;
486
487 memcpy(ptr, buf, buflen);
488 buf[buflen] = 0; /* JIC */
489
490 if(st->buf) FREEMEM(st->buf);
491 st->buf = ptr;
492 st->size = buflen;
493
494 return 0;
495}