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 2473 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2484 } | 2484 } |
2485 | 2485 |
2486 | 2486 |
2487 #ifdef DEBUG | 2487 #ifdef DEBUG |
2488 intptr_t FreeListCategory::SumFreeList() { | 2488 intptr_t FreeListCategory::SumFreeList() { |
2489 intptr_t sum = 0; | 2489 intptr_t sum = 0; |
2490 FreeListNode* cur = top(); | 2490 FreeListNode* cur = top(); |
2491 while (cur != NULL) { | 2491 while (cur != NULL) { |
2492 ASSERT(cur->map() == cur->GetHeap()->raw_unchecked_free_space_map()); | 2492 ASSERT(cur->map() == cur->GetHeap()->raw_unchecked_free_space_map()); |
2493 FreeSpace* cur_as_free_space = reinterpret_cast<FreeSpace*>(cur); | 2493 FreeSpace* cur_as_free_space = reinterpret_cast<FreeSpace*>(cur); |
2494 sum += cur_as_free_space->Size(); | 2494 sum += cur_as_free_space->nobarrier_size(); |
2495 cur = cur->next(); | 2495 cur = cur->next(); |
2496 } | 2496 } |
2497 return sum; | 2497 return sum; |
2498 } | 2498 } |
2499 | 2499 |
2500 | 2500 |
2501 static const int kVeryLongFreeList = 500; | 2501 static const int kVeryLongFreeList = 500; |
2502 | 2502 |
2503 | 2503 |
2504 int FreeListCategory::FreeListLength() { | 2504 int FreeListCategory::FreeListLength() { |
(...skipping 697 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3202 object->ShortPrint(); | 3202 object->ShortPrint(); |
3203 PrintF("\n"); | 3203 PrintF("\n"); |
3204 } | 3204 } |
3205 printf(" --------------------------------------\n"); | 3205 printf(" --------------------------------------\n"); |
3206 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); | 3206 printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes()); |
3207 } | 3207 } |
3208 | 3208 |
3209 #endif // DEBUG | 3209 #endif // DEBUG |
3210 | 3210 |
3211 } } // namespace v8::internal | 3211 } } // namespace v8::internal |
OLD | NEW |