This repository was archived by the owner on Jul 11, 2025. It is now read-only.
forked from phoboslab/JavaScriptCore-iOS
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStructureSet.h
More file actions
187 lines (152 loc) · 5.12 KB
/
StructureSet.h
File metadata and controls
187 lines (152 loc) · 5.12 KB
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
/*
* Copyright (C) 2011, 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. ``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
* 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 StructureSet_h
#define StructureSet_h
#include "ArrayProfile.h"
#include "SpeculatedType.h"
#include "Structure.h"
#include "DumpContext.h"
#include <wtf/CommaPrinter.h>
#include <wtf/Vector.h>
namespace JSC {
namespace DFG {
class StructureAbstractValue;
}
class StructureSet {
public:
StructureSet() { }
StructureSet(Structure* structure)
{
m_structures.append(structure);
}
void clear()
{
m_structures.clear();
}
void add(Structure* structure)
{
ASSERT(!contains(structure));
m_structures.append(structure);
}
bool addAll(const StructureSet& other)
{
bool changed = false;
for (size_t i = 0; i < other.size(); ++i) {
if (contains(other[i]))
continue;
add(other[i]);
changed = true;
}
return changed;
}
void remove(Structure* structure)
{
for (size_t i = 0; i < m_structures.size(); ++i) {
if (m_structures[i] != structure)
continue;
m_structures[i] = m_structures.last();
m_structures.removeLast();
return;
}
}
bool contains(Structure* structure) const
{
for (size_t i = 0; i < m_structures.size(); ++i) {
if (m_structures[i] == structure)
return true;
}
return false;
}
bool containsOnly(Structure* structure) const
{
if (size() != 1)
return false;
return singletonStructure() == structure;
}
bool isSubsetOf(const StructureSet& other) const
{
for (size_t i = 0; i < m_structures.size(); ++i) {
if (!other.contains(m_structures[i]))
return false;
}
return true;
}
bool isSupersetOf(const StructureSet& other) const
{
return other.isSubsetOf(*this);
}
size_t size() const { return m_structures.size(); }
// Call this if you know that the structure set must consist of exactly
// one structure.
Structure* singletonStructure() const
{
ASSERT(m_structures.size() == 1);
return m_structures[0];
}
Structure* at(size_t i) const { return m_structures.at(i); }
Structure* operator[](size_t i) const { return at(i); }
Structure* last() const { return m_structures.last(); }
SpeculatedType speculationFromStructures() const
{
SpeculatedType result = SpecNone;
for (size_t i = 0; i < m_structures.size(); ++i)
mergeSpeculation(result, speculationFromStructure(m_structures[i]));
return result;
}
ArrayModes arrayModesFromStructures() const
{
ArrayModes result = 0;
for (size_t i = 0; i < m_structures.size(); ++i)
mergeArrayModes(result, asArrayModes(m_structures[i]->indexingType()));
return result;
}
bool operator==(const StructureSet& other) const
{
if (m_structures.size() != other.m_structures.size())
return false;
for (size_t i = 0; i < m_structures.size(); ++i) {
if (!other.contains(m_structures[i]))
return false;
}
return true;
}
void dumpInContext(PrintStream& out, DumpContext* context) const
{
CommaPrinter comma;
out.print("[");
for (size_t i = 0; i < m_structures.size(); ++i)
out.print(comma, inContext(*m_structures[i], context));
out.print("]");
}
void dump(PrintStream& out) const
{
dumpInContext(out, 0);
}
private:
friend class DFG::StructureAbstractValue;
Vector<Structure*, 2> m_structures;
};
} // namespace JSC
#endif // StructureSet_h