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
188
189
190
191
192
193
194
195
|
/*
* Copyright (c) 2010 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.
*/
#include "config.h"
#include "core/inspector/ScriptArguments.h"
#include "bindings/core/v8/ScriptValue.h"
#include "bindings/core/v8/V8Binding.h"
#include "wtf/text/StringBuilder.h"
#include <v8.h>
namespace blink {
namespace {
static const unsigned maxArrayItemsLimit = 10000;
static const unsigned maxStackDepthLimit = 32;
class V8ValueStringBuilder {
public:
static String toString(v8::Local<v8::Value> value, v8::Isolate* isolate)
{
V8ValueStringBuilder builder(isolate);
if (!builder.append(value))
return String();
return builder.toString();
}
private:
enum {
IgnoreNull = 1 << 0,
IgnoreUndefined = 1 << 1,
};
V8ValueStringBuilder(v8::Isolate* isolate)
: m_arrayLimit(maxArrayItemsLimit)
, m_isolate(isolate)
{
}
bool append(v8::Local<v8::Value> value, unsigned ignoreOptions = 0)
{
if (value.IsEmpty())
return true;
if ((ignoreOptions & IgnoreNull) && value->IsNull())
return true;
if ((ignoreOptions & IgnoreUndefined) && value->IsUndefined())
return true;
if (value->IsString())
return append(v8::Local<v8::String>::Cast(value));
if (value->IsStringObject())
return append(v8::Local<v8::StringObject>::Cast(value)->ValueOf());
if (value->IsSymbol())
return append(v8::Local<v8::Symbol>::Cast(value));
if (value->IsSymbolObject())
return append(v8::Local<v8::SymbolObject>::Cast(value)->ValueOf());
if (value->IsNumberObject()) {
m_builder.appendNumber(v8::Local<v8::NumberObject>::Cast(value)->ValueOf());
return true;
}
if (value->IsBooleanObject()) {
m_builder.append(v8::Local<v8::BooleanObject>::Cast(value)->ValueOf() ? "true" : "false");
return true;
}
if (value->IsArray())
return append(v8::Local<v8::Array>::Cast(value));
if (toDOMWindow(m_isolate, value)) {
m_builder.append("[object Window]");
return true;
}
if (value->IsObject()
&& !value->IsDate()
&& !value->IsFunction()
&& !value->IsNativeError()
&& !value->IsRegExp())
return append(v8::Local<v8::Object>::Cast(value)->ObjectProtoToString());
return append(value->ToString(m_isolate));
}
bool append(v8::Local<v8::Array> array)
{
if (m_visitedArrays.contains(array))
return true;
uint32_t length = array->Length();
if (length > m_arrayLimit)
return false;
if (m_visitedArrays.size() > maxStackDepthLimit)
return false;
bool result = true;
m_arrayLimit -= length;
m_visitedArrays.append(array);
for (uint32_t i = 0; i < length; ++i) {
if (i)
m_builder.append(',');
if (!append(array->Get(i), IgnoreNull | IgnoreUndefined)) {
result = false;
break;
}
}
m_visitedArrays.removeLast();
return result;
}
bool append(v8::Local<v8::Symbol> symbol)
{
m_builder.appendLiteral("Symbol(");
bool result = append(symbol->Name(), IgnoreUndefined);
m_builder.append(')');
return result;
}
bool append(v8::Local<v8::String> string)
{
if (m_tryCatch.HasCaught())
return false;
if (!string.IsEmpty())
m_builder.append(toCoreString(string));
return true;
}
String toString()
{
if (m_tryCatch.HasCaught())
return String();
return m_builder.toString();
}
uint32_t m_arrayLimit;
v8::Isolate* m_isolate;
StringBuilder m_builder;
Vector<v8::Local<v8::Array> > m_visitedArrays;
v8::TryCatch m_tryCatch;
};
} // namespace
DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(ScriptArguments)
PassRefPtrWillBeRawPtr<ScriptArguments> ScriptArguments::create(ScriptState* scriptState, Vector<ScriptValue>& arguments)
{
return adoptRefWillBeNoop(new ScriptArguments(scriptState, arguments));
}
ScriptArguments::ScriptArguments(ScriptState* scriptState, Vector<ScriptValue>& arguments)
: m_scriptState(scriptState)
{
m_arguments.swap(arguments);
}
const ScriptValue &ScriptArguments::argumentAt(size_t index) const
{
ASSERT(m_arguments.size() > index);
return m_arguments[index];
}
bool ScriptArguments::getFirstArgumentAsString(String& result) const
{
if (!argumentCount())
return false;
const ScriptValue& value = argumentAt(0);
ScriptState::Scope scope(m_scriptState.get());
result = V8ValueStringBuilder::toString(value.v8Value(), value.isolate());
return true;
}
} // namespace blink
|
