OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 540 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
551 CHECK(!T.Constant(fac->NewNumber(-0x7fffffff-1))->Is(T.OtherSigned32)); | 551 CHECK(!T.Constant(fac->NewNumber(-0x7fffffff-1))->Is(T.OtherSigned32)); |
552 } | 552 } |
553 CHECK(T.Constant(fac->NewNumber(0x80000000u))->Is(T.OtherUnsigned32)); | 553 CHECK(T.Constant(fac->NewNumber(0x80000000u))->Is(T.OtherUnsigned32)); |
554 CHECK(T.Constant(fac->NewNumber(0xffffffffu))->Is(T.OtherUnsigned32)); | 554 CHECK(T.Constant(fac->NewNumber(0xffffffffu))->Is(T.OtherUnsigned32)); |
555 CHECK(T.Constant(fac->NewNumber(0xffffffffu+1.0))->Is(T.OtherNumber)); | 555 CHECK(T.Constant(fac->NewNumber(0xffffffffu+1.0))->Is(T.OtherNumber)); |
556 CHECK(T.Constant(fac->NewNumber(-0x7fffffff-2.0))->Is(T.OtherNumber)); | 556 CHECK(T.Constant(fac->NewNumber(-0x7fffffff-2.0))->Is(T.OtherNumber)); |
557 CHECK(T.Constant(fac->NewNumber(0.1))->Is(T.OtherNumber)); | 557 CHECK(T.Constant(fac->NewNumber(0.1))->Is(T.OtherNumber)); |
558 CHECK(T.Constant(fac->NewNumber(-10.1))->Is(T.OtherNumber)); | 558 CHECK(T.Constant(fac->NewNumber(-10.1))->Is(T.OtherNumber)); |
559 CHECK(T.Constant(fac->NewNumber(10e60))->Is(T.OtherNumber)); | 559 CHECK(T.Constant(fac->NewNumber(10e60))->Is(T.OtherNumber)); |
560 CHECK(T.Constant(fac->NewNumber(-1.0*0.0))->Is(T.MinusZero)); | 560 CHECK(T.Constant(fac->NewNumber(-1.0*0.0))->Is(T.MinusZero)); |
561 CHECK(T.Constant(fac->NewNumber(0.0/0.0))->Is(T.NaN)); | 561 CHECK(T.Constant(fac->NewNumber(OS::nan_value()))->Is(T.NaN)); |
562 CHECK(T.Constant(fac->NewNumber(1.0/0.0))->Is(T.OtherNumber)); | 562 CHECK(T.Constant(fac->NewNumber(1.0/0.0))->Is(T.OtherNumber)); |
563 CHECK(T.Constant(fac->NewNumber(-1.0/0.0))->Is(T.OtherNumber)); | 563 CHECK(T.Constant(fac->NewNumber(-1.0/0.0))->Is(T.OtherNumber)); |
564 } | 564 } |
565 | 565 |
566 void Array() { | 566 void Array() { |
567 // Constructor | 567 // Constructor |
568 for (int i = 0; i < 20; ++i) { | 568 for (int i = 0; i < 20; ++i) { |
569 TypeHandle type = T.Random(); | 569 TypeHandle type = T.Random(); |
570 TypeHandle array = T.Array1(type); | 570 TypeHandle array = T.Array1(type); |
571 CHECK(this->IsArray(array)); | 571 CHECK(this->IsArray(array)); |
(...skipping 1218 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1790 ZoneTests().Intersect2(); | 1790 ZoneTests().Intersect2(); |
1791 HeapTests().Intersect2(); | 1791 HeapTests().Intersect2(); |
1792 } | 1792 } |
1793 | 1793 |
1794 | 1794 |
1795 TEST(Convert) { | 1795 TEST(Convert) { |
1796 CcTest::InitializeVM(); | 1796 CcTest::InitializeVM(); |
1797 ZoneTests().Convert<HeapType, Handle<HeapType>, Isolate, HeapRep>(); | 1797 ZoneTests().Convert<HeapType, Handle<HeapType>, Isolate, HeapRep>(); |
1798 HeapTests().Convert<Type, Type*, Zone, ZoneRep>(); | 1798 HeapTests().Convert<Type, Type*, Zone, ZoneRep>(); |
1799 } | 1799 } |
OLD | NEW |