| 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 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "fast-dtoa.h" | 30 #include "fast-dtoa.h" |
| 31 | 31 |
| 32 #include "cached_powers.h" | 32 #include "cached-powers.h" |
| 33 #include "diy_fp.h" | 33 #include "diy-fp.h" |
| 34 #include "double.h" | 34 #include "double.h" |
| 35 | 35 |
| 36 namespace v8 { | 36 namespace v8 { |
| 37 namespace internal { | 37 namespace internal { |
| 38 | 38 |
| 39 // The minimal and maximal target exponent define the range of w's binary | 39 // The minimal and maximal target exponent define the range of w's binary |
| 40 // exponent, where 'w' is the result of multiplying the input by a cached power | 40 // exponent, where 'w' is the result of multiplying the input by a cached power |
| 41 // of ten. | 41 // of ten. |
| 42 // | 42 // |
| 43 // A different range might be chosen on a different platform, to optimize digit | 43 // A different range might be chosen on a different platform, to optimize digit |
| (...skipping 455 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 499 *sign = 0; | 499 *sign = 0; |
| 500 } | 500 } |
| 501 int decimal_exponent; | 501 int decimal_exponent; |
| 502 bool result = grisu3(v, buffer, length, &decimal_exponent); | 502 bool result = grisu3(v, buffer, length, &decimal_exponent); |
| 503 *point = *length + decimal_exponent; | 503 *point = *length + decimal_exponent; |
| 504 buffer[*length] = '\0'; | 504 buffer[*length] = '\0'; |
| 505 return result; | 505 return result; |
| 506 } | 506 } |
| 507 | 507 |
| 508 } } // namespace v8::internal | 508 } } // namespace v8::internal |
| OLD | NEW |