| 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 1406 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1417 // for pages in spaces with only fixed-size objects. Always zero | 1417 // for pages in spaces with only fixed-size objects. Always zero |
| 1418 // for pages in spaces with variable sized objects (those pages are | 1418 // for pages in spaces with variable sized objects (those pages are |
| 1419 // padded with free-list nodes). | 1419 // padded with free-list nodes). |
| 1420 int page_extra_; | 1420 int page_extra_; |
| 1421 | 1421 |
| 1422 bool was_swept_conservatively_; | 1422 bool was_swept_conservatively_; |
| 1423 | 1423 |
| 1424 Page* first_unswept_page_; | 1424 Page* first_unswept_page_; |
| 1425 Page* last_unswept_page_; | 1425 Page* last_unswept_page_; |
| 1426 | 1426 |
| 1427 // Sets allocation pointer. If the allocation pointer already pointed to a | |
| 1428 // non-zero-length area then that area may be returned to the free list. | |
| 1429 void SetAllocationInfo(Address start, Address end); | |
| 1430 | |
| 1431 // Expands the space by allocating a fixed number of pages. Returns false if | 1427 // Expands the space by allocating a fixed number of pages. Returns false if |
| 1432 // it cannot allocate requested number of pages from OS. | 1428 // it cannot allocate requested number of pages from OS. |
| 1433 bool Expand(); | 1429 bool Expand(); |
| 1434 | 1430 |
| 1435 // Generic fast case allocation function that tries linear allocation at the | 1431 // Generic fast case allocation function that tries linear allocation at the |
| 1436 // address denoted by top in allocation_info_. | 1432 // address denoted by top in allocation_info_. |
| 1437 inline HeapObject* AllocateLinearly(AllocationInfo* alloc_info, | 1433 inline HeapObject* AllocateLinearly(AllocationInfo* alloc_info, |
| 1438 int size_in_bytes); | 1434 int size_in_bytes); |
| 1439 | 1435 |
| 1440 // Slow path of AllocateRaw. This function is space-dependent. | 1436 // Slow path of AllocateRaw. This function is space-dependent. |
| (...skipping 1023 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2464 } | 2460 } |
| 2465 // Must be small, since an iteration is used for lookup. | 2461 // Must be small, since an iteration is used for lookup. |
| 2466 static const int kMaxComments = 64; | 2462 static const int kMaxComments = 64; |
| 2467 }; | 2463 }; |
| 2468 #endif | 2464 #endif |
| 2469 | 2465 |
| 2470 | 2466 |
| 2471 } } // namespace v8::internal | 2467 } } // namespace v8::internal |
| 2472 | 2468 |
| 2473 #endif // V8_SPACES_H_ | 2469 #endif // V8_SPACES_H_ |
| OLD | NEW |