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
|
/*
* Copyright (C) 1999-2001 Harri Porten (porten@kde.org)
* Copyright (C) 2003, 2007, 2008, 2009, 2016 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef ArgList_h
#define ArgList_h
#include "CallFrame.h"
#include "Register.h"
#include <wtf/HashSet.h>
#include <wtf/Vector.h>
namespace JSC {
class SlotVisitor;
class MarkedArgumentBuffer {
WTF_MAKE_NONCOPYABLE(MarkedArgumentBuffer);
friend class VM;
friend class ArgList;
private:
static const size_t inlineCapacity = 8;
typedef HashSet<MarkedArgumentBuffer*> ListSet;
public:
// Constructor for a read-write list, to which you may append values.
// FIXME: Remove all clients of this API, then remove this API.
MarkedArgumentBuffer()
: m_size(0)
, m_capacity(inlineCapacity)
, m_buffer(m_inlineBuffer)
, m_markSet(0)
{
}
~MarkedArgumentBuffer()
{
if (m_markSet)
m_markSet->remove(this);
if (EncodedJSValue* base = mallocBase())
fastFree(base);
}
size_t size() const { return m_size; }
bool isEmpty() const { return !m_size; }
JSValue at(int i) const
{
if (i >= m_size)
return jsUndefined();
return JSValue::decode(slotFor(i));
}
void clear()
{
m_size = 0;
}
void append(JSValue v)
{
if (m_size >= m_capacity || mallocBase())
return slowAppend(v);
slotFor(m_size) = JSValue::encode(v);
++m_size;
}
void removeLast()
{
ASSERT(m_size);
m_size--;
}
JSValue last()
{
ASSERT(m_size);
return JSValue::decode(slotFor(m_size - 1));
}
static void markLists(HeapRootVisitor&, ListSet&);
private:
void expandCapacity();
void addMarkSet(JSValue);
JS_EXPORT_PRIVATE void slowAppend(JSValue);
EncodedJSValue& slotFor(int item) const
{
return m_buffer[item];
}
EncodedJSValue* mallocBase()
{
if (m_buffer == m_inlineBuffer)
return 0;
return &slotFor(0);
}
int m_size;
int m_capacity;
EncodedJSValue m_inlineBuffer[inlineCapacity];
EncodedJSValue* m_buffer;
ListSet* m_markSet;
};
class ArgList {
friend class Interpreter;
friend class JIT;
public:
ArgList()
: m_args(0)
, m_argCount(0)
{
}
ArgList(ExecState* exec)
: m_args(reinterpret_cast<JSValue*>(&exec[CallFrame::argumentOffset(0)]))
, m_argCount(exec->argumentCount())
{
}
ArgList(const MarkedArgumentBuffer& args)
: m_args(reinterpret_cast<JSValue*>(args.m_buffer))
, m_argCount(args.size())
{
}
JSValue at(int i) const
{
if (i >= m_argCount)
return jsUndefined();
return m_args[i];
}
bool isEmpty() const { return !m_argCount; }
size_t size() const { return m_argCount; }
JS_EXPORT_PRIVATE void getSlice(int startIndex, ArgList& result) const;
private:
JSValue* data() const { return m_args; }
JSValue* m_args;
int m_argCount;
};
} // namespace JSC
#endif // ArgList_h
|
