1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef Partitions_h
#define Partitions_h
#include "wtf/PartitionAlloc.h"
#include "wtf/WTF.h"
#include "wtf/WTFExport.h"
#include <string.h>
namespace WTF {
class WTF_EXPORT Partitions {
public:
typedef void (*ReportPartitionAllocSizeFunction)(size_t);
// Name of allocator used by tracing for marking sub-allocations while take
// memory snapshots.
static const char* const kAllocatedObjectPoolName;
static void initialize(ReportPartitionAllocSizeFunction);
static void shutdown();
ALWAYS_INLINE static PartitionRootGeneric* bufferPartition()
{
ASSERT(s_initialized);
return m_bufferAllocator.root();
}
ALWAYS_INLINE static PartitionRootGeneric* fastMallocPartition()
{
ASSERT(s_initialized);
return m_fastMallocAllocator.root();
}
ALWAYS_INLINE static PartitionRoot* nodePartition()
{
#if ENABLE(OILPAN)
ASSERT_NOT_REACHED();
return nullptr;
#else
ASSERT(s_initialized);
return m_nodeAllocator.root();
#endif
}
ALWAYS_INLINE static PartitionRoot* layoutPartition()
{
ASSERT(s_initialized);
return m_layoutAllocator.root();
}
static size_t currentDOMMemoryUsage()
{
ASSERT(s_initialized);
#if ENABLE(OILPAN)
ASSERT_NOT_REACHED();
return 0;
#else
return m_nodeAllocator.root()->totalSizeOfCommittedPages;
#endif
}
static size_t totalSizeOfCommittedPages()
{
size_t totalSize = 0;
totalSize += m_fastMallocAllocator.root()->totalSizeOfCommittedPages;
totalSize += m_bufferAllocator.root()->totalSizeOfCommittedPages;
#if !ENABLE(OILPAN)
totalSize += m_nodeAllocator.root()->totalSizeOfCommittedPages;
#endif
totalSize += m_layoutAllocator.root()->totalSizeOfCommittedPages;
return totalSize;
}
static void decommitFreeableMemory();
static void reportMemoryUsageHistogram();
static void dumpMemoryStats(bool isLightDump, PartitionStatsDumper*);
ALWAYS_INLINE static void* bufferMalloc(size_t n, const char* typeName)
{
return partitionAllocGeneric(bufferPartition(), n, typeName);
}
ALWAYS_INLINE static void bufferFree(void* p)
{
partitionFreeGeneric(bufferPartition(), p);
}
ALWAYS_INLINE static size_t bufferActualSize(size_t n)
{
return partitionAllocActualSize(bufferPartition(), n);
}
static void* fastMalloc(size_t n, const char* typeName)
{
return partitionAllocGeneric(Partitions::fastMallocPartition(), n, typeName);
}
static void* fastZeroedMalloc(size_t n, const char* typeName)
{
void* result = fastMalloc(n, typeName);
memset(result, 0, n);
return result;
}
static void* fastRealloc(void* p, size_t n, const char* typeName)
{
return partitionReallocGeneric(Partitions::fastMallocPartition(), p, n, typeName);
}
static void fastFree(void* p)
{
partitionFreeGeneric(Partitions::fastMallocPartition(), p);
}
static void handleOutOfMemory();
private:
static SpinLock s_initializationLock;
static bool s_initialized;
// We have the following four partitions.
// - Node partition: A partition to allocate Nodes. We prepare a
// dedicated partition for Nodes because Nodes are likely to be
// a source of use-after-frees. Another reason is for performance:
// Since Nodes are guaranteed to be used only by the main
// thread, we can bypass acquiring a lock. Also we can improve memory
// locality by putting Nodes together.
// - Layout object partition: A partition to allocate LayoutObjects.
// we prepare a dedicated partition for the same reason as Nodes.
// - Buffer partition: A partition to allocate objects that have a strong
// risk where the length and/or the contents are exploited from user
// scripts. Vectors, HashTables, ArrayBufferContents and Strings are
// allocated in the buffer partition.
// - Fast malloc partition: A partition to allocate all other objects.
static PartitionAllocatorGeneric m_fastMallocAllocator;
static PartitionAllocatorGeneric m_bufferAllocator;
#if !ENABLE(OILPAN)
static SizeSpecificPartitionAllocator<3328> m_nodeAllocator;
#endif
static SizeSpecificPartitionAllocator<1024> m_layoutAllocator;
static ReportPartitionAllocSizeFunction m_reportSizeFunction;
};
} // namespace WTF
#endif // Partitions_h
|
