| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/v8.h" | 5 #include "src/v8.h" |
| 6 | 6 |
| 7 #include "src/dateparser.h" | 7 #include "src/dateparser.h" |
| 8 | 8 |
| 9 namespace v8 { | 9 namespace v8 { |
| 10 namespace internal { | 10 namespace internal { |
| (...skipping 159 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 170 number *= 100; | 170 number *= 100; |
| 171 } else if (length == 2) { | 171 } else if (length == 2) { |
| 172 number *= 10; | 172 number *= 10; |
| 173 } | 173 } |
| 174 } else if (length > 3) { | 174 } else if (length > 3) { |
| 175 if (length > kMaxSignificantDigits) length = kMaxSignificantDigits; | 175 if (length > kMaxSignificantDigits) length = kMaxSignificantDigits; |
| 176 // More than three digits. Divide by 10^(length - 3) to get three | 176 // More than three digits. Divide by 10^(length - 3) to get three |
| 177 // most significant digits. | 177 // most significant digits. |
| 178 int factor = 1; | 178 int factor = 1; |
| 179 do { | 179 do { |
| 180 ASSERT(factor <= 100000000); // factor won't overflow. | 180 DCHECK(factor <= 100000000); // factor won't overflow. |
| 181 factor *= 10; | 181 factor *= 10; |
| 182 length--; | 182 length--; |
| 183 } while (length > 3); | 183 } while (length > 3); |
| 184 number /= factor; | 184 number /= factor; |
| 185 } | 185 } |
| 186 return number; | 186 return number; |
| 187 } | 187 } |
| 188 | 188 |
| 189 | 189 |
| 190 } } // namespace v8::internal | 190 } } // namespace v8::internal |
| OLD | NEW |