1/*
2 * Copyright (C) 2014-2018 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#ifndef Allocator_h
27#define Allocator_h
28
29#include "BExport.h"
30#include "BumpAllocator.h"
31#include <array>
32
33namespace bmalloc {
34
35class Deallocator;
36class Heap;
37
38// Per-cache object allocator.
39
40class Allocator {
41public:
42 Allocator(Heap&, Deallocator&);
43 ~Allocator();
44
45 BEXPORT void* tryAllocate(size_t);
46 void* allocate(size_t);
47 void* tryAllocate(size_t alignment, size_t);
48 void* allocate(size_t alignment, size_t);
49 void* tryReallocate(void*, size_t);
50 void* reallocate(void*, size_t);
51
52 void scavenge();
53
54private:
55 void* allocateImpl(size_t alignment, size_t, bool crashOnFailure);
56 void* reallocateImpl(void*, size_t, bool crashOnFailure);
57
58 bool allocateFastCase(size_t, void*&);
59 BEXPORT void* allocateSlowCase(size_t);
60
61 void* allocateLogSizeClass(size_t);
62 void* allocateLarge(size_t);
63
64 void refillAllocator(BumpAllocator&, size_t sizeClass);
65 void refillAllocatorSlowCase(BumpAllocator&, size_t sizeClass);
66
67 std::array<BumpAllocator, sizeClassCount> m_bumpAllocators;
68 std::array<BumpRangeCache, sizeClassCount> m_bumpRangeCaches;
69
70 Heap& m_heap;
71 Deallocator& m_deallocator;
72};
73
74inline bool Allocator::allocateFastCase(size_t size, void*& object)
75{
76 if (size > maskSizeClassMax)
77 return false;
78
79 BumpAllocator& allocator = m_bumpAllocators[maskSizeClass(size)];
80 if (!allocator.canAllocate())
81 return false;
82
83 object = allocator.allocate();
84 return true;
85}
86
87inline void* Allocator::allocate(size_t size)
88{
89 void* object;
90 if (!allocateFastCase(size, object))
91 return allocateSlowCase(size);
92 return object;
93}
94
95} // namespace bmalloc
96
97#endif // Allocator_h
98