| /*- |
| * Copyright (c) 2004 Lev Walkin <vlm@lionet.info>. All rights reserved. |
| * Redistribution and modifications are permitted subject to BSD license. |
| */ |
| #include <asn_internal.h> |
| #include <REAL.h> |
| #include <stdlib.h> /* for strtod(3) */ |
| #include <math.h> |
| #include <errno.h> |
| #include <assert.h> |
| |
| #undef INT_MAX |
| #define INT_MAX ((int)(((unsigned int)-1) >> 1)) |
| |
| static volatile double real_zero = 0.0; |
| #ifndef NAN |
| #define NAN (real_zero/real_zero) |
| #endif |
| |
| /* |
| * REAL basic type description. |
| */ |
| static ber_tlv_tag_t asn_DEF_REAL_tags[] = { |
| (ASN_TAG_CLASS_UNIVERSAL | (9 << 2)) |
| }; |
| asn_TYPE_descriptor_t asn_DEF_REAL = { |
| "REAL", |
| "REAL", |
| ASN__PRIMITIVE_TYPE_free, |
| REAL_print, |
| asn_generic_no_constraint, |
| ber_decode_primitive, |
| der_encode_primitive, |
| REAL_decode_xer, |
| REAL_encode_xer, |
| 0, /* Use generic outmost tag fetcher */ |
| asn_DEF_REAL_tags, |
| sizeof(asn_DEF_REAL_tags) / sizeof(asn_DEF_REAL_tags[0]), |
| asn_DEF_REAL_tags, /* Same as above */ |
| sizeof(asn_DEF_REAL_tags) / sizeof(asn_DEF_REAL_tags[0]), |
| 0, 0, /* No members */ |
| 0 /* No specifics */ |
| }; |
| |
| typedef enum specialRealValue { |
| SRV__NOT_A_NUMBER, |
| SRV__MINUS_INFINITY, |
| SRV__PLUS_INFINITY |
| } specialRealValue_e; |
| static struct specialRealValue_s { |
| char *string; |
| size_t length; |
| double dv; |
| } specialRealValue[] = { |
| #define SRV_SET(foo, val) { foo, sizeof(foo) - 1, val } |
| SRV_SET("<NOT-A-NUMBER/>", 0.0), |
| SRV_SET("<MINUS-INFINITY/>", -1.0), |
| SRV_SET("<PLUS-INFINITY/>", 1.0), |
| #undef SRV_SET |
| }; |
| |
| ssize_t |
| REAL__dump(double d, int canonical, asn_app_consume_bytes_f *cb, void *app_key) { |
| char local_buf[64]; |
| char *buf = local_buf; |
| ssize_t buflen = sizeof(local_buf); |
| const char *fmt = canonical?"%.15E":"%.15f"; |
| ssize_t ret; |
| |
| /* |
| * Check whether it is a special value. |
| */ |
| /* fpclassify(3) is not portable yet */ |
| if(isnan(d)) { |
| buf = specialRealValue[SRV__NOT_A_NUMBER].string; |
| buflen = specialRealValue[SRV__NOT_A_NUMBER].length; |
| return (cb(buf, buflen, app_key) < 0) ? -1 : buflen; |
| } else if(!finite(d)) { |
| if(copysign(1.0, d) < 0.0) { |
| buf = specialRealValue[SRV__MINUS_INFINITY].string; |
| buflen = specialRealValue[SRV__MINUS_INFINITY].length; |
| } else { |
| buf = specialRealValue[SRV__PLUS_INFINITY].string; |
| buflen = specialRealValue[SRV__PLUS_INFINITY].length; |
| } |
| return (cb(buf, buflen, app_key) < 0) ? -1 : buflen; |
| } else if(ilogb(d) <= -INT_MAX) { |
| if(copysign(1.0, d) < 0.0) { |
| buf = "-0"; |
| buflen = 2; |
| } else { |
| buf = "0"; |
| buflen = 1; |
| } |
| return (cb(buf, buflen, app_key) < 0) ? -1 : buflen; |
| } |
| |
| /* |
| * Use the libc's double printing, hopefully they got it right. |
| */ |
| do { |
| ret = snprintf(buf, buflen, fmt, d); |
| if(ret < 0) { |
| buflen <<= 1; |
| } else if(ret >= buflen) { |
| buflen = ret + 1; |
| } else { |
| buflen = ret; |
| break; |
| } |
| if(buf != local_buf) free(buf); |
| buf = (char *)MALLOC(buflen); |
| if(!buf) return -1; |
| } while(1); |
| |
| if(canonical) { |
| /* |
| * Transform the "[-]d.dddE+-dd" output into "[-]d.dddE[-]d" |
| * Check that snprintf() constructed the output correctly. |
| */ |
| char *dot, *E; |
| char *end = buf + buflen; |
| char *last_zero; |
| |
| dot = (buf[0] == 0x2d /* '-' */) ? (buf + 2) : (buf + 1); |
| if(*dot >= 0x30) { |
| errno = EINVAL; |
| return -1; /* Not a dot, really */ |
| } |
| *dot = 0x2e; /* Replace possible comma */ |
| |
| for(last_zero = dot + 2, E = dot; dot < end; E++) { |
| if(*E == 0x45) { |
| char *expptr = ++E; |
| char *s = expptr; |
| int sign; |
| if(*expptr == 0x2b /* '+' */) { |
| /* Skip the "+" */ |
| buflen -= 1; |
| sign = 0; |
| } else { |
| sign = 1; |
| s++; |
| } |
| expptr++; |
| if(expptr > end) { |
| errno = EINVAL; |
| return -1; |
| } |
| if(*expptr == 0x30) { |
| buflen--; |
| expptr++; |
| } |
| if(*last_zero == 0x30) { |
| *last_zero = 0x45; /* E */ |
| buflen -= s - (last_zero + 1); |
| s = last_zero + 1; |
| if(sign) { |
| *s++ = 0x2d /* '-' */; |
| buflen++; |
| } |
| } |
| for(; expptr <= end; s++, expptr++) |
| *s = *expptr; |
| break; |
| } else if(*E == 0x30) { |
| if(*last_zero != 0x30) |
| last_zero = E; |
| } |
| } |
| if(E == end) { |
| errno = EINVAL; |
| return -1; /* No promised E */ |
| } |
| } else { |
| /* |
| * Remove trailing zeros. |
| */ |
| char *end = buf + buflen; |
| char *last_zero = end; |
| char *z; |
| for(z = end - 1; z > buf; z--) { |
| switch(*z) { |
| case 0x030: |
| last_zero = z; |
| case 0x31: case 0x32: case 0x33: case 0x34: |
| case 0x35: case 0x36: case 0x37: case 0x38: case 0x39: |
| continue; |
| default: /* Catch dot and other separators */ |
| *z = 0x2e; /* Replace possible comma */ |
| if(last_zero == z + 1) { /* leave x.0 */ |
| last_zero++; |
| } |
| buflen = last_zero - buf; |
| *last_zero = '\0'; |
| break; |
| } |
| break; |
| } |
| } |
| |
| ret = cb(buf, buflen, app_key); |
| if(buf != local_buf) free(buf); |
| return (ret < 0) ? -1 : buflen; |
| } |
| |
| int |
| REAL_print(asn_TYPE_descriptor_t *td, const void *sptr, int ilevel, |
| asn_app_consume_bytes_f *cb, void *app_key) { |
| const REAL_t *st = (const REAL_t *)sptr; |
| ssize_t ret; |
| double d; |
| |
| (void)td; /* Unused argument */ |
| (void)ilevel; /* Unused argument */ |
| |
| if(!st || !st->buf) |
| ret = cb("<absent>", 8, app_key); |
| else if(asn_REAL2double(st, &d)) |
| ret = cb("<error>", 7, app_key); |
| else |
| ret = REAL__dump(d, 0, cb, app_key); |
| |
| return (ret < 0) ? -1 : 0; |
| } |
| |
| asn_enc_rval_t |
| REAL_encode_xer(asn_TYPE_descriptor_t *td, void *sptr, |
| int ilevel, enum xer_encoder_flags_e flags, |
| asn_app_consume_bytes_f *cb, void *app_key) { |
| REAL_t *st = (REAL_t *)sptr; |
| asn_enc_rval_t er; |
| double d; |
| |
| (void)ilevel; |
| |
| if(!st || !st->buf || asn_REAL2double(st, &d)) |
| _ASN_ENCODE_FAILED; |
| |
| er.encoded = REAL__dump(d, flags & XER_F_CANONICAL, cb, app_key); |
| if(er.encoded < 0) _ASN_ENCODE_FAILED; |
| |
| return er; |
| } |
| |
| |
| /* |
| * Decode the chunk of XML text encoding REAL. |
| */ |
| static ssize_t |
| REAL__xer_body_decode(void *sptr, void *chunk_buf, size_t chunk_size) { |
| REAL_t *st = (REAL_t *)sptr; |
| double value; |
| char *xerdata = (char *)chunk_buf; |
| char *endptr = 0; |
| char *b; |
| |
| if(!chunk_size) return -1; |
| |
| /* |
| * Decode an XMLSpecialRealValue: <MINUS-INFINITY>, etc. |
| */ |
| if(xerdata[0] == 0x3c /* '<' */) { |
| size_t i; |
| for(i = 0; i < sizeof(specialRealValue) |
| / sizeof(specialRealValue[0]); i++) { |
| struct specialRealValue_s *srv = &specialRealValue[i]; |
| if(srv->length != chunk_size |
| || memcmp(srv->string, chunk_buf, chunk_size)) |
| continue; |
| |
| if(asn_double2REAL(st, srv->dv / real_zero)) |
| return -1; |
| |
| return chunk_size; |
| } |
| ASN_DEBUG("Unknown XMLSpecialRealValue"); |
| return -1; |
| } |
| |
| /* |
| * Copy chunk into the nul-terminated string, and run strtod. |
| */ |
| b = (char *)MALLOC(chunk_size + 1); |
| if(!b) return -1; |
| memcpy(b, chunk_buf, chunk_size); |
| b[chunk_size] = 0; /* nul-terminate */ |
| |
| value = strtod(b, &endptr); |
| free(b); |
| if(endptr == b) return -1; |
| |
| if(asn_double2REAL(st, value)) |
| return -1; |
| |
| return endptr - b; |
| } |
| |
| asn_dec_rval_t |
| REAL_decode_xer(asn_codec_ctx_t *opt_codec_ctx, |
| asn_TYPE_descriptor_t *td, void **sptr, const char *opt_mname, |
| void *buf_ptr, size_t size) { |
| |
| return xer_decode_primitive(opt_codec_ctx, td, |
| sptr, sizeof(REAL_t), opt_mname, |
| buf_ptr, size, REAL__xer_body_decode); |
| } |
| |
| |
| int |
| asn_REAL2double(const REAL_t *st, double *dbl_value) { |
| unsigned int octv; |
| |
| if(!st || !st->buf) { |
| errno = EINVAL; |
| return -1; |
| } |
| |
| if(st->size == 0) { |
| *dbl_value = 0; |
| return 0; |
| } |
| |
| octv = st->buf[0]; /* unsigned byte */ |
| |
| switch(octv & 0xC0) { |
| case 0x40: /* X.690: 8.5.8 */ |
| /* "SpecialRealValue" */ |
| |
| /* Be liberal in what you accept... |
| if(st->size != 1) ... |
| */ |
| |
| switch(st->buf[0]) { |
| case 0x40: /* 01000000: PLUS-INFINITY */ |
| *dbl_value = 1.0/real_zero; |
| return 0; |
| case 0x41: /* 01000001: MINUS-INFINITY */ |
| *dbl_value = -1.0/real_zero; |
| return 0; |
| /* |
| * The following cases are defined by |
| * X.690 Amendment 1 (10/03) |
| */ |
| case 0x42: /* 01000010: NOT-A-NUMBER */ |
| *dbl_value = NAN; |
| return 0; |
| case 0x43: /* 01000011: minus zero */ |
| *dbl_value = -0.0; |
| return 0; |
| } |
| |
| errno = EINVAL; |
| return -1; |
| case 0x00: { /* X.690: 8.5.6 */ |
| /* |
| * Decimal. NR{1,2,3} format. |
| */ |
| double d; |
| |
| assert(st->buf[st->size - 1] == 0); /* Security, vashu mat' */ |
| |
| d = strtod((char *)st->buf, 0); |
| if(finite(d)) { |
| *dbl_value = d; |
| return 0; |
| } else { |
| errno = ERANGE; |
| return 0; |
| } |
| } |
| } |
| |
| /* |
| * Binary representation. |
| */ |
| { |
| double m; |
| int expval; /* exponent value */ |
| unsigned int elen; /* exponent value length, in octets */ |
| unsigned int scaleF; |
| unsigned int baseF; |
| uint8_t *ptr; |
| uint8_t *end; |
| int sign; |
| |
| switch((octv & 0x30) >> 4) { |
| case 0x00: baseF = 1; break; /* base 2 */ |
| case 0x01: baseF = 3; break; /* base 8 */ |
| case 0x02: baseF = 4; break; /* base 16 */ |
| default: |
| /* Reserved field, can't parse now. */ |
| errno = EINVAL; |
| return -1; |
| } |
| |
| sign = (octv & 0x40); /* bit 7 */ |
| scaleF = (octv & 0x0C) >> 2; /* bits 4 to 3 */ |
| |
| if(st->size <= (int)(1 + (octv & 0x03))) { |
| errno = EINVAL; |
| return -1; |
| } |
| |
| if((octv & 0x03) == 0x11) { |
| /* 8.5.6.4, case d) */ |
| elen = st->buf[1]; /* unsigned binary number */ |
| if(elen == 0 || st->size <= (int)(2 + elen)) { |
| errno = EINVAL; |
| return -1; |
| } |
| ptr = &st->buf[2]; |
| } else { |
| elen = (octv & 0x03); |
| ptr = &st->buf[1]; |
| } |
| |
| /* Fetch the multibyte exponent */ |
| expval = (int)(*(int8_t *)ptr); |
| end = ptr + elen + 1; |
| for(ptr++; ptr < end; ptr++) |
| expval = (expval * 256) + *ptr; |
| |
| m = 0.0; /* Initial mantissa value */ |
| |
| /* Okay, the exponent is here. Now, what about mantissa? */ |
| end = st->buf + st->size; |
| if(ptr < end) { |
| for(; ptr < end; ptr++) |
| m = scalbn(m, 8) + *ptr; |
| } |
| |
| if(0) |
| ASN_DEBUG("m=%.10f, scF=%d, bF=%d, expval=%d, ldexp()=%f, scalbn()=%f", |
| m, scaleF, baseF, expval, |
| ldexp(m, expval * baseF + scaleF), |
| scalbn(m, scaleF) * pow(pow(2, baseF), expval) |
| ); |
| |
| /* |
| * (S * N * 2^F) * B^E |
| * Essentially: |
| m = scalbn(m, scaleF) * pow(pow(2, base), expval); |
| */ |
| m = ldexp(m, expval * baseF + scaleF); |
| if(finite(m)) { |
| *dbl_value = sign ? -m : m; |
| } else { |
| errno = ERANGE; |
| return -1; |
| } |
| |
| } /* if(binary_format) */ |
| |
| return 0; |
| } |
| |
| /* |
| * Assume IEEE 754 floating point: standard 64 bit double. |
| * [1 bit sign] [11 bits exponent] [52 bits mantissa] |
| */ |
| int |
| asn_double2REAL(REAL_t *st, double dbl_value) { |
| #ifdef WORDS_BIGENDIAN /* Known to be big-endian */ |
| int littleEndian = 0; |
| #else /* need to test: have no explicit information */ |
| unsigned int LE = 1; |
| int littleEndian = *(unsigned char *)&LE; |
| #endif |
| uint8_t buf[16]; /* More than enough for 8-byte dbl_value */ |
| uint8_t dscr[sizeof(dbl_value)]; /* double value scratch pad */ |
| /* Assertion guards: won't even compile, if unexpected double size */ |
| char assertion_buffer1[9 - sizeof(dbl_value)] __attribute__((unused)); |
| char assertion_buffer2[sizeof(dbl_value) - 7] __attribute__((unused)); |
| uint8_t *ptr = buf; |
| uint8_t *mstop; /* Last byte of mantissa */ |
| unsigned int mval; /* Value of the last byte of mantissa */ |
| unsigned int bmsign; /* binary mask with sign */ |
| unsigned int buflen; |
| unsigned int accum; |
| int expval; |
| |
| if(!st) { |
| errno = EINVAL; |
| return -1; |
| } |
| |
| /* |
| * ilogb(+-0) returns -INT_MAX or INT_MIN (platform-dependent) |
| * ilogb(+-inf) returns INT_MAX |
| * ilogb(NaN) returns INT_MIN or INT_MAX (platform-dependent) |
| */ |
| expval = ilogb(dbl_value); |
| if(expval <= -INT_MAX /* Also catches +-0 and maybe isnan() */ |
| || expval == INT_MAX /* catches isfin() and maybe isnan() */ |
| ) { |
| if(!st->buf || st->size < 2) { |
| ptr = (uint8_t *)MALLOC(2); |
| if(!ptr) return -1; |
| st->buf = ptr; |
| } |
| /* fpclassify(3) is not portable yet */ |
| if(isnan(dbl_value)) { |
| st->buf[0] = 0x42; /* NaN */ |
| st->buf[1] = 0; |
| st->size = 1; |
| } else if(!finite(dbl_value)) { |
| if(copysign(1.0, dbl_value) < 0.0) { |
| st->buf[0] = 0x41; /* MINUS-INFINITY */ |
| } else { |
| st->buf[0] = 0x40; /* PLUS-INFINITY */ |
| } |
| st->buf[1] = 0; |
| st->size = 1; |
| } else { |
| if(copysign(1.0, dbl_value) < 0.0) { |
| st->buf[0] = 0x80 | 0x40; |
| st->buf[1] = 0; |
| st->size = 2; |
| } else { |
| /* no content octets: positive zero */ |
| st->buf[0] = 0; /* JIC */ |
| st->size = 0; |
| } |
| } |
| return 0; |
| } |
| |
| if(littleEndian) { |
| uint8_t *s = ((uint8_t *)&dbl_value) + sizeof(dbl_value) - 2; |
| uint8_t *start = ((uint8_t *)&dbl_value); |
| uint8_t *d; |
| |
| bmsign = 0x80 | ((s[1] >> 1) & 0x40); /* binary mask & - */ |
| for(mstop = d = dscr; s >= start; d++, s--) { |
| *d = *s; |
| if(*d) mstop = d; |
| } |
| } else { |
| uint8_t *s = ((uint8_t *)&dbl_value) + 1; |
| uint8_t *end = ((uint8_t *)&dbl_value) + sizeof(double); |
| uint8_t *d; |
| |
| bmsign = 0x80 | ((s[-1] >> 1) & 0x40); /* binary mask & - */ |
| for(mstop = d = dscr; s < end; d++, s++) { |
| *d = *s; |
| if(*d) mstop = d; |
| } |
| } |
| |
| /* Remove parts of the exponent, leave mantissa and explicit 1. */ |
| dscr[0] = 0x10 | (dscr[0] & 0x0f); |
| |
| /* Adjust exponent in a very unobvious way */ |
| expval -= 8 * ((mstop - dscr) + 1) - 4; |
| |
| /* This loop ensures DER conformance by forcing mantissa odd: 11.3.1 */ |
| mval = *mstop; |
| if(mval && !(mval & 1)) { |
| unsigned int shift_count = 1; |
| unsigned int ishift; |
| uint8_t *mptr; |
| |
| /* |
| * Figure out what needs to be done to make mantissa odd. |
| */ |
| if(!(mval & 0x0f)) /* Speed-up a little */ |
| shift_count = 4; |
| while(((mval >> shift_count) & 1) == 0) |
| shift_count++; |
| |
| ishift = 8 - shift_count; |
| accum = 0; |
| |
| /* Go over the buffer, shifting it shift_count bits right. */ |
| for(mptr = dscr; mptr <= mstop; mptr++) { |
| mval = *mptr; |
| *mptr = accum | (mval >> shift_count); |
| accum = mval << ishift; |
| } |
| |
| /* Adjust mantissa appropriately. */ |
| expval += shift_count; |
| } |
| |
| if(expval < 0) { |
| if((expval >> 7) == -1) { |
| *ptr++ = bmsign | 0x00; |
| *ptr++ = expval; |
| } else if((expval >> 15) == -1) { |
| *ptr++ = bmsign | 0x01; |
| *ptr++ = expval >> 8; |
| *ptr++ = expval; |
| } else { |
| *ptr++ = bmsign | 0x02; |
| *ptr++ = expval >> 16; |
| *ptr++ = expval >> 8; |
| *ptr++ = expval; |
| } |
| } else if(expval <= 0x7f) { |
| *ptr++ = bmsign | 0x00; |
| *ptr++ = expval; |
| } else if(expval <= 0x7fff) { |
| *ptr++ = bmsign | 0x01; |
| *ptr++ = expval >> 8; |
| *ptr++ = expval; |
| } else { |
| assert(expval <= 0x7fffff); |
| *ptr++ = bmsign | 0x02; |
| *ptr++ = expval >> 16; |
| *ptr++ = expval >> 8; |
| *ptr++ = expval; |
| } |
| |
| buflen = (mstop - dscr) + 1; |
| memcpy(ptr, dscr, buflen); |
| ptr += buflen; |
| buflen = ptr - buf; |
| |
| (void *)ptr = MALLOC(buflen + 1); |
| if(!ptr) return -1; |
| |
| memcpy(ptr, buf, buflen); |
| buf[buflen] = 0; /* JIC */ |
| |
| if(st->buf) FREEMEM(st->buf); |
| st->buf = ptr; |
| st->size = buflen; |
| |
| return 0; |
| } |