| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 <stdlib.h> | 28 #include <stdlib.h> |
| 29 | 29 |
| 30 #include "src/v8.h" | 30 #include "src/v8.h" |
| 31 | 31 |
| 32 #include "src/base/platform/platform.h" |
| 32 #include "src/diy-fp.h" | 33 #include "src/diy-fp.h" |
| 33 #include "src/platform.h" | |
| 34 #include "test/cctest/cctest.h" | 34 #include "test/cctest/cctest.h" |
| 35 | 35 |
| 36 | 36 |
| 37 using namespace v8::internal; | 37 using namespace v8::internal; |
| 38 | 38 |
| 39 | 39 |
| 40 TEST(Subtract) { | 40 TEST(Subtract) { |
| 41 DiyFp diy_fp1 = DiyFp(3, 0); | 41 DiyFp diy_fp1 = DiyFp(3, 0); |
| 42 DiyFp diy_fp2 = DiyFp(1, 0); | 42 DiyFp diy_fp2 = DiyFp(1, 0); |
| 43 DiyFp diff = DiyFp::Minus(diy_fp1, diy_fp2); | 43 DiyFp diff = DiyFp::Minus(diy_fp1, diy_fp2); |
| (...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 83 // Halfway cases are allowed to round either way. So don't check for it. | 83 // Halfway cases are allowed to round either way. So don't check for it. |
| 84 | 84 |
| 85 // Big numbers. | 85 // Big numbers. |
| 86 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 11); | 86 diy_fp1 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 11); |
| 87 diy_fp2 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 13); | 87 diy_fp2 = DiyFp(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF), 13); |
| 88 // 128bit result: 0xfffffffffffffffe0000000000000001 | 88 // 128bit result: 0xfffffffffffffffe0000000000000001 |
| 89 product = DiyFp::Times(diy_fp1, diy_fp2); | 89 product = DiyFp::Times(diy_fp1, diy_fp2); |
| 90 CHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFe) == product.f()); | 90 CHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFe) == product.f()); |
| 91 CHECK_EQ(11 + 13 + 64, product.e()); | 91 CHECK_EQ(11 + 13 + 64, product.e()); |
| 92 } | 92 } |
| OLD | NEW |