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 21 matching lines...) Expand all Loading... |
32 | 32 |
33 namespace WTF { | 33 namespace WTF { |
34 | 34 |
35 namespace double_conversion { | 35 namespace double_conversion { |
36 | 36 |
37 class PowersOfTenCache { | 37 class PowersOfTenCache { |
38 public: | 38 public: |
39 | 39 |
40 // Not all powers of ten are cached. The decimal exponent of two neighbo
ring | 40 // Not all powers of ten are cached. The decimal exponent of two neighbo
ring |
41 // cached numbers will differ by kDecimalExponentDistance. | 41 // cached numbers will differ by kDecimalExponentDistance. |
42 static int kDecimalExponentDistance; | 42 static const int kDecimalExponentDistance; |
43 | 43 |
44 static int kMinDecimalExponent; | 44 static const int kMinDecimalExponent; |
45 static int kMaxDecimalExponent; | 45 static const int kMaxDecimalExponent; |
46 | 46 |
47 // Returns a cached power-of-ten with a binary exponent in the range | 47 // Returns a cached power-of-ten with a binary exponent in the range |
48 // [min_exponent; max_exponent] (boundaries included). | 48 // [min_exponent; max_exponent] (boundaries included). |
49 static void GetCachedPowerForBinaryExponentRange(int min_exponent, | 49 static void GetCachedPowerForBinaryExponentRange(int min_exponent, |
50 int max_exponent, | 50 int max_exponent, |
51 DiyFp* power, | 51 DiyFp* power, |
52 int* decimal_exponent); | 52 int* decimal_exponent); |
53 | 53 |
54 // Returns a cached power of ten x ~= 10^k such that | 54 // Returns a cached power of ten x ~= 10^k such that |
55 // k <= decimal_exponent < k + kCachedPowersDecimalDistance. | 55 // k <= decimal_exponent < k + kCachedPowersDecimalDistance. |
56 // The given decimal_exponent must satisfy | 56 // The given decimal_exponent must satisfy |
57 // kMinDecimalExponent <= requested_exponent, and | 57 // kMinDecimalExponent <= requested_exponent, and |
58 // requested_exponent < kMaxDecimalExponent + kDecimalExponentDistance
. | 58 // requested_exponent < kMaxDecimalExponent + kDecimalExponentDistance
. |
59 static void GetCachedPowerForDecimalExponent(int requested_exponent, | 59 static void GetCachedPowerForDecimalExponent(int requested_exponent, |
60 DiyFp* power, | 60 DiyFp* power, |
61 int* found_exponent); | 61 int* found_exponent); |
62 }; | 62 }; |
63 | |
64 // Initializes the table of cached powers used by the dtoa algorithm. | |
65 // This needs to be called when JSC is being initialized. | |
66 void initialize(); | |
67 | |
68 } // namespace double_conversion | 63 } // namespace double_conversion |
69 | 64 |
70 } // namespace WTF | 65 } // namespace WTF |
71 | 66 |
72 #endif // DOUBLE_CONVERSION_CACHED_POWERS_H_ | 67 #endif // DOUBLE_CONVERSION_CACHED_POWERS_H_ |
OLD | NEW |