OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 | 2 |
3 // Check that we can traverse very deep stacks of ConsStrings using | 3 // Check that we can traverse very deep stacks of ConsStrings using |
4 // StringCharacterStram. Check that Get(int) works on very deep stacks | 4 // StringCharacterStram. Check that Get(int) works on very deep stacks |
5 // of ConsStrings. These operations may not be very fast, but they | 5 // of ConsStrings. These operations may not be very fast, but they |
6 // should be possible without getting errors due to too deep recursion. | 6 // should be possible without getting errors due to too deep recursion. |
7 | 7 |
| 8 // TODO(dcarney): remove |
| 9 #define V8_ALLOW_ACCESS_TO_PERSISTENT_IMPLICIT |
| 10 #define V8_ALLOW_ACCESS_TO_PERSISTENT_ARROW |
| 11 |
8 #include "v8.h" | 12 #include "v8.h" |
9 | 13 |
10 #include "cctest.h" | 14 #include "cctest.h" |
11 #include "objects.h" | 15 #include "objects.h" |
12 | 16 |
13 using namespace v8::internal; | 17 using namespace v8::internal; |
14 | 18 |
15 | 19 |
16 TEST(Create) { | 20 TEST(Create) { |
17 CcTest::InitializeVM(); | 21 CcTest::InitializeVM(); |
(...skipping 23 matching lines...) Expand all Loading... |
41 HEAP->CollectAllGarbage(Heap::kNoGCFlags); | 45 HEAP->CollectAllGarbage(Heap::kNoGCFlags); |
42 | 46 |
43 // All symbols should be distinct. | 47 // All symbols should be distinct. |
44 for (int i = 0; i < kNumSymbols; ++i) { | 48 for (int i = 0; i < kNumSymbols; ++i) { |
45 CHECK(symbols[i]->SameValue(*symbols[i])); | 49 CHECK(symbols[i]->SameValue(*symbols[i])); |
46 for (int j = i + 1; j < kNumSymbols; ++j) { | 50 for (int j = i + 1; j < kNumSymbols; ++j) { |
47 CHECK(!symbols[i]->SameValue(*symbols[j])); | 51 CHECK(!symbols[i]->SameValue(*symbols[j])); |
48 } | 52 } |
49 } | 53 } |
50 } | 54 } |
OLD | NEW |