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
fast-dtoa.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_FAST_DTOA_H_
29 #define V8_FAST_DTOA_H_
30 
31 namespace v8 {
32 namespace internal {
33 
35  // Computes the shortest representation of the given input. The returned
36  // result will be the most accurate number of this length. Longer
37  // representations might be more accurate.
39  // Computes a representation where the precision (number of digits) is
40  // given as input. The precision is independent of the decimal point.
42 };
43 
44 // FastDtoa will produce at most kFastDtoaMaximalLength digits. This does not
45 // include the terminating '\0' character.
46 const int kFastDtoaMaximalLength = 17;
47 
48 // Provides a decimal representation of v.
49 // The result should be interpreted as buffer * 10^(point - length).
50 //
51 // Precondition:
52 // * v must be a strictly positive finite double.
53 //
54 // Returns true if it succeeds, otherwise the result can not be trusted.
55 // There will be *length digits inside the buffer followed by a null terminator.
56 // If the function returns true and mode equals
57 // - FAST_DTOA_SHORTEST, then
58 // the parameter requested_digits is ignored.
59 // The result satisfies
60 // v == (double) (buffer * 10^(point - length)).
61 // The digits in the buffer are the shortest representation possible. E.g.
62 // if 0.099999999999 and 0.1 represent the same double then "1" is returned
63 // with point = 0.
64 // The last digit will be closest to the actual v. That is, even if several
65 // digits might correctly yield 'v' when read again, the buffer will contain
66 // the one closest to v.
67 // - FAST_DTOA_PRECISION, then
68 // the buffer contains requested_digits digits.
69 // the difference v - (buffer * 10^(point-length)) is closest to zero for
70 // all possible representations of requested_digits digits.
71 // If there are two values that are equally close, then FastDtoa returns
72 // false.
73 // For both modes the buffer must be large enough to hold the result.
74 bool FastDtoa(double d,
76  int requested_digits,
77  Vector<char> buffer,
78  int* length,
79  int* decimal_point);
80 
81 } } // namespace v8::internal
82 
83 #endif // V8_FAST_DTOA_H_
const int kFastDtoaMaximalLength
Definition: fast-dtoa.h:46
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 mode(MIPS only)") DEFINE_string(expose_natives_as
bool FastDtoa(double v, FastDtoaMode mode, int requested_digits, Vector< char > buffer, int *length, int *decimal_point)
Definition: fast-dtoa.cc:709