| Index: src/heap/spaces.h
|
| diff --git a/src/heap/spaces.h b/src/heap/spaces.h
|
| index 494d05c9c792e144fcce1849533fca4a27138826..f165663af6cbd442427bb1f6e3b2948118b7386a 100644
|
| --- a/src/heap/spaces.h
|
| +++ b/src/heap/spaces.h
|
| @@ -1768,8 +1768,8 @@ class PagedSpace : public Space {
|
|
|
| // Allocate the requested number of bytes in the space double aligned if
|
| // possible, return a failure object if not.
|
| - MUST_USE_RESULT inline AllocationResult AllocateRawDoubleAligned(
|
| - int size_in_bytes);
|
| + MUST_USE_RESULT inline AllocationResult AllocateRawAligned(
|
| + int size_in_bytes, AllocationAlignment alignment);
|
|
|
| // Give a block of memory to the space's free list. It might be added to
|
| // the free list or accounted as waste.
|
| @@ -1933,7 +1933,8 @@ class PagedSpace : public Space {
|
|
|
| // Generic fast case allocation function that tries double aligned linear
|
| // allocation at the address denoted by top in allocation_info_.
|
| - inline HeapObject* AllocateLinearlyDoubleAlign(int size_in_bytes);
|
| + inline HeapObject* AllocateLinearlyAligned(int size_in_bytes,
|
| + AllocationAlignment alignment);
|
|
|
| // If sweeping is still in progress try to sweep unswept pages. If that is
|
| // not successful, wait for the sweeper threads and re-try free-list
|
| @@ -2500,8 +2501,8 @@ class NewSpace : public Space {
|
| return allocation_info_.limit_address();
|
| }
|
|
|
| - MUST_USE_RESULT INLINE(
|
| - AllocationResult AllocateRawDoubleAligned(int size_in_bytes));
|
| + MUST_USE_RESULT INLINE(AllocationResult AllocateRawAligned(
|
| + int size_in_bytes, AllocationAlignment alignment));
|
|
|
| MUST_USE_RESULT INLINE(AllocationResult AllocateRaw(int size_in_bytes));
|
|
|
| @@ -2621,7 +2622,7 @@ class NewSpace : public Space {
|
| HistogramInfo* promoted_histogram_;
|
|
|
| MUST_USE_RESULT AllocationResult
|
| - SlowAllocateRaw(int size_in_bytes, bool double_aligned);
|
| + SlowAllocateRaw(int size_in_bytes, AllocationAlignment alignment);
|
|
|
| friend class SemiSpaceIterator;
|
|
|
|
|