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
|
/*
* Copyright (C) 2013 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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.
*/
#include "config.h"
#include "StructureIDTable.h"
#include <limits.h>
#include <wtf/Atomics.h>
#include <wtf/DataLog.h>
#include <wtf/PassOwnPtr.h>
namespace JSC {
StructureIDTable::StructureIDTable()
: m_firstFreeOffset(0)
, m_table(adoptPtr(new StructureOrOffset[s_initialSize]))
, m_size(0)
, m_capacity(s_initialSize)
{
// We pre-allocate the first offset so that the null Structure
// can still be represented as the StructureID '0'.
allocateID(0);
}
void StructureIDTable::resize(size_t newCapacity)
{
// Create the new table.
OwnPtr<StructureOrOffset> newTable = adoptPtr(new StructureOrOffset[newCapacity]);
// Copy the contents of the old table to the new table.
memcpy(newTable.get(), table(), m_capacity * sizeof(StructureOrOffset));
// Store fence to make sure we've copied everything before doing the swap.
WTF::storeStoreFence();
// Swap the old and new tables.
swap(m_table, newTable);
// Put the old table (now labeled as new) into the list of old tables.
m_oldTables.append(newTable.release());
// Update the capacity.
m_capacity = newCapacity;
}
void StructureIDTable::flushOldTables()
{
m_oldTables.clear();
}
StructureID StructureIDTable::allocateID(Structure* structure)
{
#if USE(JSVALUE64)
if (!m_firstFreeOffset) {
RELEASE_ASSERT(m_capacity <= UINT_MAX);
if (m_size == m_capacity)
resize(m_capacity * 2);
ASSERT(m_size < m_capacity);
StructureOrOffset newEntry;
newEntry.structure = structure;
if (m_size == s_unusedID) {
m_size++;
return allocateID(structure);
}
StructureID result = m_size;
table()[result] = newEntry;
m_size++;
return result;
}
ASSERT(m_firstFreeOffset != s_unusedID);
StructureID result = m_firstFreeOffset;
m_firstFreeOffset = table()[m_firstFreeOffset].offset;
table()[result].structure = structure;
return result;
#else
return structure;
#endif
}
void StructureIDTable::deallocateID(Structure* structure, StructureID structureID)
{
#if USE(JSVALUE64)
ASSERT(structureID != s_unusedID);
RELEASE_ASSERT(table()[structureID].structure == structure);
table()[structureID].offset = m_firstFreeOffset;
m_firstFreeOffset = structureID;
#else
UNUSED_PARAM(structure);
UNUSED_PARAM(structureID);
#endif
}
} // namespace JSC
|
