OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 626 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
637 void Map::MapVerify() { | 637 void Map::MapVerify() { |
638 ASSERT(!Heap::InNewSpace(this)); | 638 ASSERT(!Heap::InNewSpace(this)); |
639 ASSERT(FIRST_TYPE <= instance_type() && instance_type() <= LAST_TYPE); | 639 ASSERT(FIRST_TYPE <= instance_type() && instance_type() <= LAST_TYPE); |
640 ASSERT(kPointerSize <= instance_size() | 640 ASSERT(kPointerSize <= instance_size() |
641 && instance_size() < Heap::Capacity()); | 641 && instance_size() < Heap::Capacity()); |
642 VerifyHeapPointer(prototype()); | 642 VerifyHeapPointer(prototype()); |
643 VerifyHeapPointer(instance_descriptors()); | 643 VerifyHeapPointer(instance_descriptors()); |
644 } | 644 } |
645 | 645 |
646 | 646 |
647 void CodeCache::CodeCachePrint() { | |
648 HeapObject::PrintHeader("CodeCache"); | |
649 PrintF("\n - default_cache: "); | |
650 default_cache()->ShortPrint(); | |
651 PrintF("\n - normal_type_cache: "); | |
652 normal_type_cache()->ShortPrint(); | |
653 } | |
654 | |
655 | |
656 void CodeCache::CodeCacheVerify() { | |
657 VerifyHeapPointer(default_cache()); | |
658 VerifyHeapPointer(normal_type_cache()); | |
659 ASSERT(default_cache()->IsFixedArray()); | |
660 ASSERT(normal_type_cache()->IsUndefined() | |
661 || normal_type_cache()->IsCodeCacheHashTable()); | |
662 } | |
663 | |
664 | |
665 void FixedArray::FixedArrayPrint() { | 647 void FixedArray::FixedArrayPrint() { |
666 HeapObject::PrintHeader("FixedArray"); | 648 HeapObject::PrintHeader("FixedArray"); |
667 PrintF(" - length: %d", length()); | 649 PrintF(" - length: %d", length()); |
668 for (int i = 0; i < length(); i++) { | 650 for (int i = 0; i < length(); i++) { |
669 PrintF("\n [%d]: ", i); | 651 PrintF("\n [%d]: ", i); |
670 get(i)->ShortPrint(); | 652 get(i)->ShortPrint(); |
671 } | 653 } |
672 PrintF("\n"); | 654 PrintF("\n"); |
673 } | 655 } |
674 | 656 |
(...skipping 653 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1328 } | 1310 } |
1329 current = hash; | 1311 current = hash; |
1330 } | 1312 } |
1331 return true; | 1313 return true; |
1332 } | 1314 } |
1333 | 1315 |
1334 | 1316 |
1335 #endif // DEBUG | 1317 #endif // DEBUG |
1336 | 1318 |
1337 } } // namespace v8::internal | 1319 } } // namespace v8::internal |
OLD | NEW |