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 #include "v8.h" | 8 #include "v8.h" |
9 | 9 |
10 #include "cctest.h" | 10 #include "cctest.h" |
(...skipping 19 matching lines...) Expand all Loading... |
30 symbols[i]->ShortPrint(); | 30 symbols[i]->ShortPrint(); |
31 PrintF("\n"); | 31 PrintF("\n"); |
32 #if OBJECT_PRINT | 32 #if OBJECT_PRINT |
33 symbols[i]->Print(); | 33 symbols[i]->Print(); |
34 #endif | 34 #endif |
35 #if VERIFY_HEAP | 35 #if VERIFY_HEAP |
36 symbols[i]->Verify(); | 36 symbols[i]->Verify(); |
37 #endif | 37 #endif |
38 } | 38 } |
39 | 39 |
40 HEAP->PerformScavenge(); | 40 CcTest::heap()->PerformScavenge(); |
41 HEAP->CollectAllGarbage(Heap::kNoGCFlags); | 41 CcTest::heap()->CollectAllGarbage(Heap::kNoGCFlags); |
42 | 42 |
43 // All symbols should be distinct. | 43 // All symbols should be distinct. |
44 for (int i = 0; i < kNumSymbols; ++i) { | 44 for (int i = 0; i < kNumSymbols; ++i) { |
45 CHECK(symbols[i]->SameValue(*symbols[i])); | 45 CHECK(symbols[i]->SameValue(*symbols[i])); |
46 for (int j = i + 1; j < kNumSymbols; ++j) { | 46 for (int j = i + 1; j < kNumSymbols; ++j) { |
47 CHECK(!symbols[i]->SameValue(*symbols[j])); | 47 CHECK(!symbols[i]->SameValue(*symbols[j])); |
48 } | 48 } |
49 } | 49 } |
50 } | 50 } |
OLD | NEW |