test-fast-dtoa.cc 10 KB
Newer Older
1
// Copyright 2006-2008 the V8 project authors. All rights reserved.
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
// 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 Google Inc. nor the names of its
//       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.
27 28 29

#include <stdlib.h>

30
#include "src/v8.h"
31

32
#include "src/base/platform/platform.h"
33 34 35 36 37 38
#include "src/diy-fp.h"
#include "src/double.h"
#include "src/fast-dtoa.h"
#include "test/cctest/cctest.h"
#include "test/cctest/gay-precision.h"
#include "test/cctest/gay-shortest.h"
39

40 41
namespace v8 {
namespace internal {
42
namespace test_fast_dtoa {
43 44 45

static const int kBufferSize = 100;

46 47 48

// Removes trailing '0' digits.
static void TrimRepresentation(Vector<char> representation) {
49
  int len = StrLength(representation.start());
50 51 52 53 54 55 56 57 58
  int i;
  for (i = len - 1; i >= 0; --i) {
    if (representation[i] != '0') break;
  }
  representation[i + 1] = '\0';
}


TEST(FastDtoaShortestVariousDoubles) {
59 60
  char buffer_container[kBufferSize];
  Vector<char> buffer(buffer_container, kBufferSize);
61 62 63 64 65
  int length;
  int point;
  int status;

  double min_double = 5e-324;
66 67
  status = FastDtoa(min_double, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
68
  CHECK(status);
69
  CHECK_EQ(0, strcmp("5", buffer.start()));
70 71 72
  CHECK_EQ(-323, point);

  double max_double = 1.7976931348623157e308;
73 74
  status = FastDtoa(max_double, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
75
  CHECK(status);
76
  CHECK_EQ(0, strcmp("17976931348623157", buffer.start()));
77 78
  CHECK_EQ(309, point);

79 80
  status = FastDtoa(4294967272.0, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
81
  CHECK(status);
82
  CHECK_EQ(0, strcmp("4294967272", buffer.start()));
83 84
  CHECK_EQ(10, point);

85 86
  status = FastDtoa(4.1855804968213567e298, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
87
  CHECK(status);
88
  CHECK_EQ(0, strcmp("4185580496821357", buffer.start()));
89 90
  CHECK_EQ(299, point);

91 92
  status = FastDtoa(5.5626846462680035e-309, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
93
  CHECK(status);
94
  CHECK_EQ(0, strcmp("5562684646268003", buffer.start()));
95 96
  CHECK_EQ(-308, point);

97 98
  status = FastDtoa(2147483648.0, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
99
  CHECK(status);
100
  CHECK_EQ(0, strcmp("2147483648", buffer.start()));
101 102
  CHECK_EQ(10, point);

103 104
  status = FastDtoa(3.5844466002796428e+298, FAST_DTOA_SHORTEST, 0,
                    buffer, &length, &point);
105
  if (status) {  // Not all FastDtoa variants manage to compute this number.
106
    CHECK_EQ(0, strcmp("35844466002796428", buffer.start()));
107 108 109 110 111
    CHECK_EQ(299, point);
  }

  uint64_t smallest_normal64 = V8_2PART_UINT64_C(0x00100000, 00000000);
  double v = Double(smallest_normal64).value();
112
  status = FastDtoa(v, FAST_DTOA_SHORTEST, 0, buffer, &length, &point);
113
  if (status) {
114
    CHECK_EQ(0, strcmp("22250738585072014", buffer.start()));
115 116 117 118 119
    CHECK_EQ(-307, point);
  }

  uint64_t largest_denormal64 = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF);
  v = Double(largest_denormal64).value();
120
  status = FastDtoa(v, FAST_DTOA_SHORTEST, 0, buffer, &length, &point);
121
  if (status) {
122
    CHECK_EQ(0, strcmp("2225073858507201", buffer.start()));
123 124 125 126 127
    CHECK_EQ(-307, point);
  }
}


128 129 130 131 132 133 134 135 136 137 138
TEST(FastDtoaPrecisionVariousDoubles) {
  char buffer_container[kBufferSize];
  Vector<char> buffer(buffer_container, kBufferSize);
  int length;
  int point;
  int status;

  status = FastDtoa(1.0, FAST_DTOA_PRECISION, 3, buffer, &length, &point);
  CHECK(status);
  CHECK_GE(3, length);
  TrimRepresentation(buffer);
139
  CHECK_EQ(0, strcmp("1", buffer.start()));
140 141 142 143 144 145
  CHECK_EQ(1, point);

  status = FastDtoa(1.5, FAST_DTOA_PRECISION, 10, buffer, &length, &point);
  if (status) {
    CHECK_GE(10, length);
    TrimRepresentation(buffer);
146
    CHECK_EQ(0, strcmp("15", buffer.start()));
147 148 149 150 151 152 153
    CHECK_EQ(1, point);
  }

  double min_double = 5e-324;
  status = FastDtoa(min_double, FAST_DTOA_PRECISION, 5,
                    buffer, &length, &point);
  CHECK(status);
154
  CHECK_EQ(0, strcmp("49407", buffer.start()));
155 156 157 158 159 160
  CHECK_EQ(-323, point);

  double max_double = 1.7976931348623157e308;
  status = FastDtoa(max_double, FAST_DTOA_PRECISION, 7,
                    buffer, &length, &point);
  CHECK(status);
161
  CHECK_EQ(0, strcmp("1797693", buffer.start()));
162 163 164 165 166 167 168
  CHECK_EQ(309, point);

  status = FastDtoa(4294967272.0, FAST_DTOA_PRECISION, 14,
                    buffer, &length, &point);
  if (status) {
    CHECK_GE(14, length);
    TrimRepresentation(buffer);
169
    CHECK_EQ(0, strcmp("4294967272", buffer.start()));
170 171 172 173 174 175
    CHECK_EQ(10, point);
  }

  status = FastDtoa(4.1855804968213567e298, FAST_DTOA_PRECISION, 17,
                    buffer, &length, &point);
  CHECK(status);
176
  CHECK_EQ(0, strcmp("41855804968213567", buffer.start()));
177 178 179 180 181
  CHECK_EQ(299, point);

  status = FastDtoa(5.5626846462680035e-309, FAST_DTOA_PRECISION, 1,
                    buffer, &length, &point);
  CHECK(status);
182
  CHECK_EQ(0, strcmp("6", buffer.start()));
183 184 185 186 187
  CHECK_EQ(-308, point);

  status = FastDtoa(2147483648.0, FAST_DTOA_PRECISION, 5,
                    buffer, &length, &point);
  CHECK(status);
188
  CHECK_EQ(0, strcmp("21475", buffer.start()));
189 190 191 192 193 194 195
  CHECK_EQ(10, point);

  status = FastDtoa(3.5844466002796428e+298, FAST_DTOA_PRECISION, 10,
                    buffer, &length, &point);
  CHECK(status);
  CHECK_GE(10, length);
  TrimRepresentation(buffer);
196
  CHECK_EQ(0, strcmp("35844466", buffer.start()));
197 198 199 200 201 202
  CHECK_EQ(299, point);

  uint64_t smallest_normal64 = V8_2PART_UINT64_C(0x00100000, 00000000);
  double v = Double(smallest_normal64).value();
  status = FastDtoa(v, FAST_DTOA_PRECISION, 17, buffer, &length, &point);
  CHECK(status);
203
  CHECK_EQ(0, strcmp("22250738585072014", buffer.start()));
204 205 206 207 208 209 210 211
  CHECK_EQ(-307, point);

  uint64_t largest_denormal64 = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF);
  v = Double(largest_denormal64).value();
  status = FastDtoa(v, FAST_DTOA_PRECISION, 17, buffer, &length, &point);
  CHECK(status);
  CHECK_GE(20, length);
  TrimRepresentation(buffer);
212
  CHECK_EQ(0, strcmp("22250738585072009", buffer.start()));
213 214 215 216 217
  CHECK_EQ(-307, point);

  v = 3.3161339052167390562200598e-237;
  status = FastDtoa(v, FAST_DTOA_PRECISION, 18, buffer, &length, &point);
  CHECK(status);
218
  CHECK_EQ(0, strcmp("331613390521673906", buffer.start()));
219 220 221 222 223
  CHECK_EQ(-236, point);

  v = 7.9885183916008099497815232e+191;
  status = FastDtoa(v, FAST_DTOA_PRECISION, 4, buffer, &length, &point);
  CHECK(status);
224
  CHECK_EQ(0, strcmp("7989", buffer.start()));
225 226 227 228
  CHECK_EQ(192, point);
}


229
TEST(FastDtoaGayShortest) {
230 231
  char buffer_container[kBufferSize];
  Vector<char> buffer(buffer_container, kBufferSize);
232 233 234 235 236 237 238
  bool status;
  int length;
  int point;
  int succeeded = 0;
  int total = 0;
  bool needed_max_length = false;

239 240
  Vector<const PrecomputedShortest> precomputed =
      PrecomputedShortestRepresentations();
241
  for (int i = 0; i < precomputed.length(); ++i) {
242
    const PrecomputedShortest current_test = precomputed[i];
243 244
    total++;
    double v = current_test.v;
245
    status = FastDtoa(v, FAST_DTOA_SHORTEST, 0, buffer, &length, &point);
246
    CHECK_GE(kFastDtoaMaximalLength, length);
247
    if (!status) continue;
248
    if (length == kFastDtoaMaximalLength) needed_max_length = true;
249 250
    succeeded++;
    CHECK_EQ(current_test.decimal_point, point);
251
    CHECK_EQ(0, strcmp(current_test.representation, buffer.start()));
252 253 254 255
  }
  CHECK_GT(succeeded*1.0/total, 0.99);
  CHECK(needed_max_length);
}
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


TEST(FastDtoaGayPrecision) {
  char buffer_container[kBufferSize];
  Vector<char> buffer(buffer_container, kBufferSize);
  bool status;
  int length;
  int point;
  int succeeded = 0;
  int total = 0;
  // Count separately for entries with less than 15 requested digits.
  int succeeded_15 = 0;
  int total_15 = 0;

  Vector<const PrecomputedPrecision> precomputed =
      PrecomputedPrecisionRepresentations();
  for (int i = 0; i < precomputed.length(); ++i) {
    const PrecomputedPrecision current_test = precomputed[i];
    double v = current_test.v;
    int number_digits = current_test.number_digits;
    total++;
    if (number_digits <= 15) total_15++;
    status = FastDtoa(v, FAST_DTOA_PRECISION, number_digits,
                      buffer, &length, &point);
    CHECK_GE(number_digits, length);
    if (!status) continue;
    succeeded++;
    if (number_digits <= 15) succeeded_15++;
    TrimRepresentation(buffer);
    CHECK_EQ(current_test.decimal_point, point);
286
    CHECK_EQ(0, strcmp(current_test.representation, buffer.start()));
287 288 289 290 291 292 293 294 295
  }
  // The precomputed numbers contain many entries with many requested
  // digits. These have a high failure rate and we therefore expect a lower
  // success rate than for the shortest representation.
  CHECK_GT(succeeded*1.0/total, 0.85);
  // However with less than 15 digits almost the algorithm should almost always
  // succeed.
  CHECK_GT(succeeded_15*1.0/total_15, 0.9999);
}
296

297
}  // namespace test_fast_dtoa
298 299
}  // namespace internal
}  // namespace v8