| 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 12 matching lines...) Expand all Loading... |
| 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 // Check that we can traverse very deep stacks of ConsStrings using | 28 // Check that we can traverse very deep stacks of ConsStrings using |
| 29 // StringCharacterStram. Check that Get(int) works on very deep stacks | 29 // StringCharacterStram. Check that Get(int) works on very deep stacks |
| 30 // of ConsStrings. These operations may not be very fast, but they | 30 // of ConsStrings. These operations may not be very fast, but they |
| 31 // should be possible without getting errors due to too deep recursion. | 31 // should be possible without getting errors due to too deep recursion. |
| 32 | 32 |
| 33 #include "src/v8.h" | 33 #include "src/factory.h" |
| 34 | 34 #include "src/isolate.h" |
| 35 #include "src/objects.h" | 35 #include "src/objects.h" |
| 36 #include "src/ostreams.h" | 36 #include "src/ostreams.h" |
| 37 // FIXME(mstarzinger, marja): This is weird, but required because of the missing |
| 38 // (disallowed) include: src/factory.h -> src/objects-inl.h |
| 39 #include "src/objects-inl.h" |
| 40 // FIXME(mstarzinger, marja): This is weird, but required because of the missing |
| 41 // (disallowed) include: src/type-feedback-vector.h -> |
| 42 // src/type-feedback-vector-inl.h |
| 43 #include "src/type-feedback-vector-inl.h" |
| 44 #include "src/v8.h" |
| 37 #include "test/cctest/cctest.h" | 45 #include "test/cctest/cctest.h" |
| 38 | 46 |
| 39 using namespace v8::internal; | 47 using namespace v8::internal; |
| 40 | 48 |
| 41 | 49 |
| 42 TEST(Create) { | 50 TEST(Create) { |
| 43 CcTest::InitializeVM(); | 51 CcTest::InitializeVM(); |
| 44 Isolate* isolate = CcTest::i_isolate(); | 52 Isolate* isolate = CcTest::i_isolate(); |
| 45 HandleScope scope(isolate); | 53 HandleScope scope(isolate); |
| 46 | 54 |
| (...skipping 20 matching lines...) Expand all Loading... |
| 67 CcTest::heap()->CollectAllGarbage(); | 75 CcTest::heap()->CollectAllGarbage(); |
| 68 | 76 |
| 69 // All symbols should be distinct. | 77 // All symbols should be distinct. |
| 70 for (int i = 0; i < kNumSymbols; ++i) { | 78 for (int i = 0; i < kNumSymbols; ++i) { |
| 71 CHECK(symbols[i]->SameValue(*symbols[i])); | 79 CHECK(symbols[i]->SameValue(*symbols[i])); |
| 72 for (int j = i + 1; j < kNumSymbols; ++j) { | 80 for (int j = i + 1; j < kNumSymbols; ++j) { |
| 73 CHECK(!symbols[i]->SameValue(*symbols[j])); | 81 CHECK(!symbols[i]->SameValue(*symbols[j])); |
| 74 } | 82 } |
| 75 } | 83 } |
| 76 } | 84 } |
| OLD | NEW |