OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 26 matching lines...) Expand all Loading... |
37 #include "gay-precision.h" | 37 #include "gay-precision.h" |
38 #include "gay-shortest.h" | 38 #include "gay-shortest.h" |
39 #include "platform.h" | 39 #include "platform.h" |
40 | 40 |
41 | 41 |
42 using namespace v8::internal; | 42 using namespace v8::internal; |
43 | 43 |
44 | 44 |
45 // Removes trailing '0' digits. | 45 // Removes trailing '0' digits. |
46 static void TrimRepresentation(Vector<char> representation) { | 46 static void TrimRepresentation(Vector<char> representation) { |
47 int len = strlen(representation.start()); | 47 int len = StrLength(representation.start()); |
48 int i; | 48 int i; |
49 for (i = len - 1; i >= 0; --i) { | 49 for (i = len - 1; i >= 0; --i) { |
50 if (representation[i] != '0') break; | 50 if (representation[i] != '0') break; |
51 } | 51 } |
52 representation[i + 1] = '\0'; | 52 representation[i + 1] = '\0'; |
53 } | 53 } |
54 | 54 |
55 | 55 |
56 static const int kBufferSize = 100; | 56 static const int kBufferSize = 100; |
57 | 57 |
(...skipping 264 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
322 int number_digits = current_test.number_digits; | 322 int number_digits = current_test.number_digits; |
323 DoubleToAscii(v, DTOA_PRECISION, number_digits, | 323 DoubleToAscii(v, DTOA_PRECISION, number_digits, |
324 buffer, &sign, &length, &point); | 324 buffer, &sign, &length, &point); |
325 CHECK_EQ(0, sign); // All precomputed numbers are positive. | 325 CHECK_EQ(0, sign); // All precomputed numbers are positive. |
326 CHECK_EQ(current_test.decimal_point, point); | 326 CHECK_EQ(current_test.decimal_point, point); |
327 CHECK_GE(number_digits, length); | 327 CHECK_GE(number_digits, length); |
328 TrimRepresentation(buffer); | 328 TrimRepresentation(buffer); |
329 CHECK_EQ(current_test.representation, buffer.start()); | 329 CHECK_EQ(current_test.representation, buffer.start()); |
330 } | 330 } |
331 } | 331 } |
OLD | NEW |