| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 2661 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2672 for (uintptr_t key = base; key <= limit; key++) { | 2672 for (uintptr_t key = base; key <= limit; key++) { |
| 2673 HashMap::Entry* entry = chunk_map_.Lookup(reinterpret_cast<void*>(key), | 2673 HashMap::Entry* entry = chunk_map_.Lookup(reinterpret_cast<void*>(key), |
| 2674 static_cast<uint32_t>(key), | 2674 static_cast<uint32_t>(key), |
| 2675 true); | 2675 true); |
| 2676 ASSERT(entry != NULL); | 2676 ASSERT(entry != NULL); |
| 2677 entry->value = page; | 2677 entry->value = page; |
| 2678 } | 2678 } |
| 2679 | 2679 |
| 2680 HeapObject* object = page->GetObject(); | 2680 HeapObject* object = page->GetObject(); |
| 2681 | 2681 |
| 2682 // Make the object consistent so the large object space can be traversed. | 2682 #ifdef DEBUG |
| 2683 // Make the object consistent so the heap can be vefified in OldSpaceStep. |
| 2683 reinterpret_cast<Object**>(object->address())[0] = | 2684 reinterpret_cast<Object**>(object->address())[0] = |
| 2684 heap()->fixed_array_map(); | 2685 heap()->fixed_array_map(); |
| 2685 reinterpret_cast<Object**>(object->address())[1] = Smi::FromInt(0); | 2686 reinterpret_cast<Object**>(object->address())[1] = Smi::FromInt(0); |
| 2687 #endif |
| 2686 | 2688 |
| 2687 heap()->incremental_marking()->OldSpaceStep(object_size); | 2689 heap()->incremental_marking()->OldSpaceStep(object_size); |
| 2688 return object; | 2690 return object; |
| 2689 } | 2691 } |
| 2690 | 2692 |
| 2691 | 2693 |
| 2692 // GC support | 2694 // GC support |
| 2693 MaybeObject* LargeObjectSpace::FindObject(Address a) { | 2695 MaybeObject* LargeObjectSpace::FindObject(Address a) { |
| 2694 LargePage* page = FindPage(a); | 2696 LargePage* page = FindPage(a); |
| 2695 if (page != NULL) { | 2697 if (page != NULL) { |
| (...skipping 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2886 object->ShortPrint(); | 2888 object->ShortPrint(); |
| 2887 PrintF("\n"); | 2889 PrintF("\n"); |
| 2888 } | 2890 } |
| 2889 printf(" --------------------------------------\n"); | 2891 printf(" --------------------------------------\n"); |
| 2890 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); | 2892 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); |
| 2891 } | 2893 } |
| 2892 | 2894 |
| 2893 #endif // DEBUG | 2895 #endif // DEBUG |
| 2894 | 2896 |
| 2895 } } // namespace v8::internal | 2897 } } // namespace v8::internal |
| OLD | NEW |