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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 os << Brief(*symbols[i]) << "\n"; | 57 os << Brief(*symbols[i]) << "\n"; |
58 #if OBJECT_PRINT | 58 #if OBJECT_PRINT |
59 symbols[i]->Print(os); | 59 symbols[i]->Print(os); |
60 #endif | 60 #endif |
61 #if VERIFY_HEAP | 61 #if VERIFY_HEAP |
62 symbols[i]->ObjectVerify(); | 62 symbols[i]->ObjectVerify(); |
63 #endif | 63 #endif |
64 } | 64 } |
65 | 65 |
66 CcTest::heap()->CollectGarbage(i::NEW_SPACE); | 66 CcTest::heap()->CollectGarbage(i::NEW_SPACE); |
67 CcTest::heap()->CollectAllGarbage(Heap::kNoGCFlags); | 67 CcTest::heap()->CollectAllGarbage(); |
68 | 68 |
69 // All symbols should be distinct. | 69 // All symbols should be distinct. |
70 for (int i = 0; i < kNumSymbols; ++i) { | 70 for (int i = 0; i < kNumSymbols; ++i) { |
71 CHECK(symbols[i]->SameValue(*symbols[i])); | 71 CHECK(symbols[i]->SameValue(*symbols[i])); |
72 for (int j = i + 1; j < kNumSymbols; ++j) { | 72 for (int j = i + 1; j < kNumSymbols; ++j) { |
73 CHECK(!symbols[i]->SameValue(*symbols[j])); | 73 CHECK(!symbols[i]->SameValue(*symbols[j])); |
74 } | 74 } |
75 } | 75 } |
76 } | 76 } |
OLD | NEW |