omnomnum 0.0.2

data/ext/omnomnum/omnomnum/grisu2/diy_fp.h

@@ -0,0 +1,61 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+#include <stdint.h>
+#include <assert.h>
+
+typedef struct diy_fp_t {
+    uint64_t f;
+    int e;
+} diy_fp_t;
+
+static diy_fp_t minus(diy_fp_t x, diy_fp_t y) {
+  assert(x.e == y.e);
+  assert(x.f >= y.f);
+  diy_fp_t r = {.f = x.f - y.f, .e = x.e};
+  return r;
+}
+
+/*
+static diy_fp_t minus(diy_fp_t x, diy_fp_t y) {
+  assert(x.e == y.e);
+  assert(x.f >= y.f);
+  diy_fp_t r = {.f = x.f - y.f, .e = x.e};
+  return r;
+}
+*/
+
+static diy_fp_t multiply(diy_fp_t x, diy_fp_t y) {
+    uint64_t a,b,c,d,ac,bc,ad,bd,tmp,h;
+  diy_fp_t r; uint64_t M32 = 0xFFFFFFFF;
+  a = x.f >> 32; b = x.f & M32;
+  c = y.f >> 32; d = y.f & M32;
+  ac = a*c; bc = b*c; ad = a*d; bd = b*d;
+  tmp = (bd>>32) + (ad&M32) + (bc&M32);
+  tmp += 1U << 31; /// mult_round
+  r.f = ac+(ad>>32)+(bc>>32)+(tmp >>32);
+  r.e = x.e + y.e + 64;
+  return r;
+}

data/ext/omnomnum/omnomnum/grisu2/double.h

@@ -0,0 +1,121 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+
+#include "diy_fp.h"
+#include "powers.h"
+#include <stdlib.h>
+#include <stdbool.h>
+
+typedef union {
+    double d;
+    uint64_t n;
+} converter_t;
+
+static uint64_t double_to_uint64(double d) { converter_t tmp; tmp.d = d; return tmp.n; }
+static double uint64_to_double(uint64_t d64) { converter_t tmp; tmp.n = d64; return tmp.d; }
+
+#define DP_SIGNIFICAND_SIZE 52
+#define DP_EXPONENT_BIAS (0x3FF + DP_SIGNIFICAND_SIZE)
+#define DP_MIN_EXPONENT (-DP_EXPONENT_BIAS)
+#define DP_EXPONENT_MASK 0x7FF0000000000000
+#define DP_SIGNIFICAND_MASK 0x000FFFFFFFFFFFFF
+#define DP_HIDDEN_BIT    0x0010000000000000
+
+static diy_fp_t normalize_diy_fp(diy_fp_t in) {
+    diy_fp_t res = in;
+    /* Normalize now */
+    /* the original number could have been a denormal. */
+    while (! (res.f & DP_HIDDEN_BIT))
+    {
+	res.f <<= 1;
+	res.e--;
+    }
+    /* do the final shifts in one go. Don't forget the hidden bit (the '-1') */
+    res.f <<= (DIY_SIGNIFICAND_SIZE - DP_SIGNIFICAND_SIZE - 1);
+    res.e = res.e - (DIY_SIGNIFICAND_SIZE - DP_SIGNIFICAND_SIZE - 1);
+    return res;
+}
+
+static diy_fp_t double2diy_fp(double d) {
+    uint64_t d64 = double_to_uint64(d);
+    int biased_e = (d64 & DP_EXPONENT_MASK) >> DP_SIGNIFICAND_SIZE;
+    uint64_t significand = (d64 & DP_SIGNIFICAND_MASK);
+    diy_fp_t res;
+    if (biased_e != 0)
+    {
+	res.f = significand + DP_HIDDEN_BIT;
+	res.e = biased_e - DP_EXPONENT_BIAS;
+    } else {
+	res.f = significand;
+	res.e = DP_MIN_EXPONENT + 1;
+    }
+    return res;
+}
+
+static diy_fp_t normalize_boundary(diy_fp_t in) {
+    diy_fp_t res = in;
+    /* Normalize now */
+    /* the original number could have been a denormal. */
+    while (! (res.f & (DP_HIDDEN_BIT << 1)))
+    {
+	res.f <<= 1;
+	res.e--;
+    }
+    /* do the final shifts in one go. Don't forget the hidden bit (the '-1') */
+    res.f <<= (DIY_SIGNIFICAND_SIZE - DP_SIGNIFICAND_SIZE - 2);
+    res.e = res.e - (DIY_SIGNIFICAND_SIZE - DP_SIGNIFICAND_SIZE - 2);
+    return res;
+}
+
+static void normalized_boundaries(double d, diy_fp_t* out_m_minus, diy_fp_t* out_m_plus) {
+    diy_fp_t v = double2diy_fp(d);
+    diy_fp_t pl, mi;
+    bool significand_is_zero = v.f == DP_HIDDEN_BIT;
+    pl.f  = (v.f << 1) + 1; pl.e  = v.e - 1;
+    pl = normalize_boundary(pl);
+    if (significand_is_zero)
+    {
+	mi.f = (v.f << 2) - 1;
+	mi.e = v.e - 2;
+    } else {
+	mi.f = (v.f << 1) - 1;
+	mi.e = v.e - 1;
+    }
+    mi.f <<= mi.e - pl.e;
+    mi.e = pl.e;
+    *out_m_plus = pl;
+    *out_m_minus = mi;
+}
+
+static double random_double() {
+    uint64_t tmp = 0;
+    int i;
+    for (i = 0; i < 8; i++) {
+	tmp <<= 8;
+	tmp += rand() % 256;
+    }
+    return uint64_to_double(tmp);
+}

data/ext/omnomnum/omnomnum/grisu2/fast_exponent.h

@@ -0,0 +1,44 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+
+static void fill_exponent(int K, char* buffer) {
+    int i = 0;
+    if (K < 0) {
+	buffer[i++] = '-';
+	K = -K;
+    }
+    if (K >= 100) {
+	buffer[i++] = '0' + K / 100; K %= 100;
+	buffer[i++] = '0' + K / 10; K %= 10;
+	buffer[i++] = '0' + K;
+    } else if (K >= 10) {
+	buffer[i++] = '0' + K / 10; K %= 10;
+	buffer[i++] = '0' + K;
+    } else {
+	buffer[i++] = '0' + K;
+    }
+    buffer[i] = '\0';
+}

data/ext/omnomnum/omnomnum/grisu2/grisu2.c

@@ -0,0 +1,120 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#include "diy_fp.h"
+#include "k_comp.h"
+#include "double.h"
+#include "powers.h"
+#include <stdbool.h>
+#include <stdio.h>
+#include "grisu2.h"
+#include <inttypes.h>
+
+#define HUMAN_READABLE
+
+bool fill_double(double v, char* buffer) {
+    if (v == 0) {
+        strcpy(buffer, "0.0");
+        return 1;
+    } else {
+        if (v < 0) {
+            *buffer++ = '-';
+            v = -v;
+        }
+
+        int length, K;
+        grisu2(v, buffer, &length, &K);
+#ifndef HUMAN_READABLE
+        buffer[length] = 'e';
+        fill_exponent(K, &buffer[length+1]);
+#else
+        prettify_string(buffer, 0, length, K);
+#endif
+        return 1;
+    }
+}
+
+#define TEN9 1000000000
+
+void grisu_round(char* buffer, int len,
+		 uint64_t delta, uint64_t rest,
+		 uint64_t ten_kappa, uint64_t wp_w) {
+  while (rest < wp_w &&
+	 delta - rest >= ten_kappa &&
+	 (rest + ten_kappa < wp_w || /// closer
+	 wp_w - rest > rest+ten_kappa - wp_w))
+  {
+    buffer[len-1]--; rest += ten_kappa;
+  }
+}
+
+void digit_gen(diy_fp_t W, diy_fp_t Mp, diy_fp_t delta,
+	       char* buffer, int* len, int* K) {
+  uint32_t div; int d,kappa; diy_fp_t one, wp_w;
+  wp_w = minus(Mp, W);
+  one.f = ((uint64_t) 1) << -Mp.e; one.e = Mp.e;
+  uint32_t p1 = Mp.f >> -one.e; /// Mp_cut
+  uint64_t p2 = Mp.f & (one.f - 1);
+  *len = 0; kappa = 10; div = TEN9;
+  while (kappa > 0) {
+    d = p1 / div;
+    if (d || *len) buffer[(*len)++] = '0' + d; /// Mp_inv1
+    p1 %= div; kappa--;
+    uint64_t tmp = (((uint64_t)p1)<<-one.e)+p2;
+    if (tmp <= delta.f) { /// Mp_delta
+      *K += kappa;
+      grisu_round(buffer, *len, delta.f, tmp, ((uint64_t)div) << -one.e, wp_w.f);
+      return;
+    }
+    div /= 10;
+  }
+  uint64_t unit = 1;
+  while (1) {
+    p2 *= 10; delta.f *= 10; unit *= 10;
+    d = p2 >> -one.e;
+    if (d || *len) buffer[(*len)++] = '0' + d;
+    p2 &= one.f - 1; kappa--;
+    if (p2 < delta.f) {
+      *K += kappa;
+      grisu_round(buffer, *len, delta.f, p2, one.f, wp_w.f*unit);
+      return;
+    }
+  }
+}
+
+void grisu2(double v, char* buffer, int* length, int* K) {
+  diy_fp_t w_m, w_p;
+  int q = 64, alpha = -59, gamma = -56; int pos;
+  normalized_boundaries(v, &w_m, &w_p);
+  diy_fp_t w = normalize_diy_fp(double2diy_fp(v));
+  int mk = k_comp(w_p.e + q, alpha, gamma);
+  diy_fp_t c_mk = cached_power(mk);
+  diy_fp_t W  = multiply(w,   c_mk);
+  diy_fp_t Wp = multiply(w_p, c_mk);
+  diy_fp_t Wm = multiply(w_m, c_mk);
+  Wm.f++; Wp.f--;
+  diy_fp_t delta = minus(Wp, Wm);
+  *K = -mk;
+  digit_gen(W, Wp, delta, buffer, length, K);
+}

data/ext/omnomnum/omnomnum/grisu2/grisu2.h

@@ -0,0 +1,36 @@
+#ifndef GRISU2_H
+#define GRISU2_H
+
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+#include "prettify.h"
+#include "fast_exponent.h"
+#include <stdbool.h>
+
+void grisu2(double v, char* buffer, int* length, int* K);
+bool fill_double(double v, char* buffer);
+
+#endif // GRISU2_H

data/ext/omnomnum/omnomnum/grisu2/k_comp.h

@@ -0,0 +1,32 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+#include <math.h>
+
+#define D_1_LOG2_10 0.30102999566398114 //  1 / lg(10)
+
+static int k_comp(int e, int alpha, int gamma) {
+  return ceil((alpha-e+63) * D_1_LOG2_10);
+}

data/ext/omnomnum/omnomnum/grisu2/powers.h

@@ -0,0 +1,27 @@
+/*
+  Copyright (c) 2009 Florian Loitsch
+
+  Permission is hereby granted, free of charge, to any person
+  obtaining a copy of this software and associated documentation
+  files (the "Software"), to deal in the Software without
+  restriction, including without limitation the rights to use,
+  copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the
+  Software is furnished to do so, subject to the following
+  conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+  OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+  HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+  WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+  FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+  OTHER DEALINGS IN THE SOFTWARE.
+  */
+#pragma once
+#include "diy_fp.h"
+#include "powers_ten_round64.h"