v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
conversions.h
Go to the documentation of this file.
1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
28 #ifndef V8_CONVERSIONS_H_
29 #define V8_CONVERSIONS_H_
30 
31 #include "utils.h"
32 
33 namespace v8 {
34 namespace internal {
35 
36 class UnicodeCache;
37 
38 // Maximum number of significant digits in decimal representation.
39 // The longest possible double in decimal representation is
40 // (2^53 - 1) * 2 ^ -1074 that is (2 ^ 53 - 1) * 5 ^ 1074 / 10 ^ 1074
41 // (768 digits). If we parse a number whose first digits are equal to a
42 // mean of 2 adjacent doubles (that could have up to 769 digits) the result
43 // must be rounded to the bigger one unless the tail consists of zeros, so
44 // we don't need to preserve all the digits.
45 const int kMaxSignificantDigits = 772;
46 
47 
48 inline bool isDigit(int x, int radix) {
49  return (x >= '0' && x <= '9' && x < '0' + radix)
50  || (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
51  || (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
52 }
53 
54 
55 inline bool isBinaryDigit(int x) {
56  return x == '0' || x == '1';
57 }
58 
59 
60 // The fast double-to-(unsigned-)int conversion routine does not guarantee
61 // rounding towards zero.
62 // For NaN and values outside the int range, return INT_MIN or INT_MAX.
63 inline int FastD2IChecked(double x) {
64  if (!(x >= INT_MIN)) return INT_MIN; // Negation to catch NaNs.
65  if (x > INT_MAX) return INT_MAX;
66  return static_cast<int>(x);
67 }
68 
69 
70 // The fast double-to-(unsigned-)int conversion routine does not guarantee
71 // rounding towards zero.
72 // The result is unspecified if x is infinite or NaN, or if the rounded
73 // integer value is outside the range of type int.
74 inline int FastD2I(double x) {
75  return static_cast<int32_t>(x);
76 }
77 
78 inline unsigned int FastD2UI(double x);
79 
80 
81 inline double FastI2D(int x) {
82  // There is no rounding involved in converting an integer to a
83  // double, so this code should compile to a few instructions without
84  // any FPU pipeline stalls.
85  return static_cast<double>(x);
86 }
87 
88 
89 inline double FastUI2D(unsigned x) {
90  // There is no rounding involved in converting an unsigned integer to a
91  // double, so this code should compile to a few instructions without
92  // any FPU pipeline stalls.
93  return static_cast<double>(x);
94 }
95 
96 
97 // This function should match the exact semantics of ECMA-262 9.4.
98 inline double DoubleToInteger(double x);
99 
100 
101 // This function should match the exact semantics of ECMA-262 9.5.
102 inline int32_t DoubleToInt32(double x);
103 
104 
105 // This function should match the exact semantics of ECMA-262 9.6.
106 inline uint32_t DoubleToUint32(double x) {
107  return static_cast<uint32_t>(DoubleToInt32(x));
108 }
109 
110 
111 // Enumeration for allowing octals and ignoring junk when converting
112 // strings to numbers.
114  NO_FLAGS = 0,
120 };
121 
122 
123 // Converts a string into a double value according to ECMA-262 9.3.1
124 double StringToDouble(UnicodeCache* unicode_cache,
125  Vector<const char> str,
126  int flags,
127  double empty_string_val = 0);
128 double StringToDouble(UnicodeCache* unicode_cache,
129  Vector<const uc16> str,
130  int flags,
131  double empty_string_val = 0);
132 // This version expects a zero-terminated character array.
133 double StringToDouble(UnicodeCache* unicode_cache,
134  const char* str,
135  int flags,
136  double empty_string_val = 0);
137 
139 
140 // Converts a double to a string value according to ECMA-262 9.8.1.
141 // The buffer should be large enough for any floating point number.
142 // 100 characters is enough.
143 const char* DoubleToCString(double value, Vector<char> buffer);
144 
145 // Convert an int to a null-terminated string. The returned string is
146 // located inside the buffer, but not necessarily at the start.
147 const char* IntToCString(int n, Vector<char> buffer);
148 
149 // Additional number to string conversions for the number type.
150 // The caller is responsible for calling free on the returned pointer.
151 char* DoubleToFixedCString(double value, int f);
152 char* DoubleToExponentialCString(double value, int f);
153 char* DoubleToPrecisionCString(double value, int f);
154 char* DoubleToRadixCString(double value, int radix);
155 
156 } } // namespace v8::internal
157 
158 #endif // V8_CONVERSIONS_H_
double DoubleToInteger(double x)
int int32_t
Definition: unicode.cc:47
bool isBinaryDigit(int x)
Definition: conversions.h:55
bool isDigit(int x, int radix)
Definition: conversions.h:48
double StringToDouble(UnicodeCache *unicode_cache, const char *str, int flags, double empty_string_val)
Definition: conversions.cc:47
const int kDoubleToCStringMinBufferSize
Definition: conversions.h:138
const char * IntToCString(int n, Vector< char > buffer)
Definition: conversions.cc:136
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in only print modified registers Don t break for ASM_UNIMPLEMENTED_BREAK macros print stack trace when an illegal exception is thrown randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot testing_bool_flag testing_int_flag string flag tmp file in which to serialize heap Print the time it takes to lazily compile hydrogen code stubs concurrent_recompilation concurrent_sweeping Print usage including flags
Definition: flags.cc:665
int FastD2IChecked(double x)
Definition: conversions.h:63
const char * DoubleToCString(double v, Vector< char > buffer)
Definition: conversions.cc:81
unsigned int FastD2UI(double x)
double FastUI2D(unsigned x)
Definition: conversions.h:89
const int kMaxSignificantDigits
Definition: conversions.h:45
uint32_t DoubleToUint32(double x)
Definition: conversions.h:106
char * DoubleToPrecisionCString(double value, int p)
Definition: conversions.cc:305
int32_t DoubleToInt32(double x)
double FastI2D(int x)
Definition: conversions.h:81
char * DoubleToExponentialCString(double value, int f)
Definition: conversions.cc:260
char * DoubleToRadixCString(double value, int radix)
Definition: conversions.cc:375
int FastD2I(double x)
Definition: conversions.h:74
char * DoubleToFixedCString(double value, int f)
Definition: conversions.cc:156