2 * Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
3 * Copyright (C) 2002, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Library General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Library General Public License for more details.
15 * You should have received a copy of the GNU Library General Public License
16 * along with this library; see the file COPYING.LIB. If not, write to
17 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
18 * Boston, MA 02110-1301, USA.
25 #include "ExceptionHelpers.h"
26 #include "Interpreter.h"
28 #include "JSValueInlineMethods.h"
32 NEVER_INLINE JSValue jsAddSlowCase(CallFrame*, JSValue, JSValue);
33 JSValue jsTypeStringForValue(CallFrame*, JSValue);
34 bool jsIsObjectType(JSValue);
35 bool jsIsFunctionType(JSValue);
37 ALWAYS_INLINE JSValue jsString(ExecState* exec, JSString* s1, JSString* s2)
39 JSGlobalData& globalData = exec->globalData();
41 unsigned length1 = s1->length();
44 unsigned length2 = s2->length();
47 if ((length1 + length2) < length1)
48 return throwOutOfMemoryError(exec);
50 return fixupVPtr(&globalData, JSString::create(globalData, s1, s2));
53 ALWAYS_INLINE JSValue jsString(ExecState* exec, const UString& u1, const UString& u2, const UString& u3)
55 JSGlobalData* globalData = &exec->globalData();
57 unsigned length1 = u1.length();
58 unsigned length2 = u2.length();
59 unsigned length3 = u3.length();
61 return jsString(exec, jsString(globalData, u2), jsString(globalData, u3));
63 return jsString(exec, jsString(globalData, u1), jsString(globalData, u3));
65 return jsString(exec, jsString(globalData, u1), jsString(globalData, u2));
67 if ((length1 + length2) < length1)
68 return throwOutOfMemoryError(exec);
69 if ((length1 + length2 + length3) < length3)
70 return throwOutOfMemoryError(exec);
72 return fixupVPtr(globalData, JSString::create(exec->globalData(), jsString(globalData, u1), jsString(globalData, u2), jsString(globalData, u3)));
75 ALWAYS_INLINE JSValue jsString(ExecState* exec, Register* strings, unsigned count)
77 JSGlobalData* globalData = &exec->globalData();
78 JSString::RopeBuilder ropeBuilder(*globalData);
80 unsigned oldLength = 0;
82 for (unsigned i = 0; i < count; ++i) {
83 JSValue v = strings[i].jsValue();
85 ropeBuilder.append(asString(v));
87 ropeBuilder.append(jsString(globalData, v.toString(exec)));
89 if (ropeBuilder.length() < oldLength) // True for overflow
90 return throwOutOfMemoryError(exec);
93 return ropeBuilder.release();
96 ALWAYS_INLINE JSValue jsStringFromArguments(ExecState* exec, JSValue thisValue)
98 JSGlobalData* globalData = &exec->globalData();
99 JSString::RopeBuilder ropeBuilder(*globalData);
101 if (thisValue.isString())
102 ropeBuilder.append(asString(thisValue));
104 ropeBuilder.append(jsString(globalData, thisValue.toString(exec)));
106 unsigned oldLength = 0;
108 for (unsigned i = 0; i < exec->argumentCount(); ++i) {
109 JSValue v = exec->argument(i);
111 ropeBuilder.append(asString(v));
113 ropeBuilder.append(jsString(globalData, v.toString(exec)));
115 if (ropeBuilder.length() < oldLength) // True for overflow
116 return throwOutOfMemoryError(exec);
119 return ropeBuilder.release();
123 inline bool JSValue::equal(ExecState* exec, JSValue v1, JSValue v2)
125 if (v1.isInt32() && v2.isInt32())
128 return equalSlowCase(exec, v1, v2);
131 ALWAYS_INLINE bool JSValue::equalSlowCaseInline(ExecState* exec, JSValue v1, JSValue v2)
134 if (v1.isNumber() && v2.isNumber())
135 return v1.asNumber() == v2.asNumber();
137 bool s1 = v1.isString();
138 bool s2 = v2.isString();
140 return asString(v1)->value(exec) == asString(v2)->value(exec);
142 if (v1.isUndefinedOrNull()) {
143 if (v2.isUndefinedOrNull())
147 return v2.asCell()->structure()->typeInfo().masqueradesAsUndefined();
150 if (v2.isUndefinedOrNull()) {
153 return v1.asCell()->structure()->typeInfo().masqueradesAsUndefined();
159 JSValue p1 = v1.toPrimitive(exec);
160 if (exec->hadException())
163 if (v1.isInt32() && v2.isInt32())
169 JSValue p2 = v2.toPrimitive(exec);
170 if (exec->hadException())
173 if (v1.isInt32() && v2.isInt32())
179 double d1 = v1.toNumber(exec);
180 double d2 = v2.toNumber(exec);
184 if (v1.isBoolean()) {
186 return static_cast<double>(v1.asBoolean()) == v2.asNumber();
187 } else if (v2.isBoolean()) {
189 return v1.asNumber() == static_cast<double>(v2.asBoolean());
197 ALWAYS_INLINE bool JSValue::strictEqualSlowCaseInline(ExecState* exec, JSValue v1, JSValue v2)
199 ASSERT(v1.isCell() && v2.isCell());
201 if (v1.asCell()->isString() && v2.asCell()->isString())
202 return asString(v1)->value(exec) == asString(v2)->value(exec);
207 inline bool JSValue::strictEqual(ExecState* exec, JSValue v1, JSValue v2)
209 if (v1.isInt32() && v2.isInt32())
212 if (v1.isNumber() && v2.isNumber())
213 return v1.asNumber() == v2.asNumber();
215 if (!v1.isCell() || !v2.isCell())
218 return strictEqualSlowCaseInline(exec, v1, v2);
221 // See ES5 11.8.1/11.8.2/11.8.5 for definition of leftFirst, this value ensures correct
222 // evaluation ordering for argument conversions for '<' and '>'. For '<' pass the value
223 // true, for leftFirst, for '>' pass the value false (and reverse operand order).
224 template<bool leftFirst>
225 ALWAYS_INLINE bool jsLess(CallFrame* callFrame, JSValue v1, JSValue v2)
227 if (v1.isInt32() && v2.isInt32())
228 return v1.asInt32() < v2.asInt32();
230 if (v1.isNumber() && v2.isNumber())
231 return v1.asNumber() < v2.asNumber();
233 JSGlobalData* globalData = &callFrame->globalData();
234 if (isJSString(globalData, v1) && isJSString(globalData, v2))
235 return asString(v1)->value(callFrame) < asString(v2)->value(callFrame);
244 wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
245 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
247 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
248 wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
251 if (wasNotString1 | wasNotString2)
253 return asString(p1)->value(callFrame) < asString(p2)->value(callFrame);
256 // See ES5 11.8.3/11.8.4/11.8.5 for definition of leftFirst, this value ensures correct
257 // evaluation ordering for argument conversions for '<=' and '=>'. For '<=' pass the
258 // value true, for leftFirst, for '=>' pass the value false (and reverse operand order).
259 template<bool leftFirst>
260 ALWAYS_INLINE bool jsLessEq(CallFrame* callFrame, JSValue v1, JSValue v2)
262 if (v1.isInt32() && v2.isInt32())
263 return v1.asInt32() <= v2.asInt32();
265 if (v1.isNumber() && v2.isNumber())
266 return v1.asNumber() <= v2.asNumber();
268 JSGlobalData* globalData = &callFrame->globalData();
269 if (isJSString(globalData, v1) && isJSString(globalData, v2))
270 return !(asString(v2)->value(callFrame) < asString(v1)->value(callFrame));
279 wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
280 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
282 wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
283 wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
286 if (wasNotString1 | wasNotString2)
288 return !(asString(p2)->value(callFrame) < asString(p1)->value(callFrame));
291 // Fast-path choices here are based on frequency data from SunSpider:
292 // <times> Add case: <t1> <t2>
293 // ---------------------------
294 // 5626160 Add case: 3 3 (of these, 3637690 are for immediate values)
295 // 247412 Add case: 5 5
296 // 20900 Add case: 5 6
297 // 13962 Add case: 5 3
298 // 4000 Add case: 3 5
300 ALWAYS_INLINE JSValue jsAdd(CallFrame* callFrame, JSValue v1, JSValue v2)
302 if (v1.isNumber() && v2.isNumber())
303 return jsNumber(v1.asNumber() + v2.asNumber());
307 ? jsString(callFrame, asString(v1), asString(v2))
308 : jsString(callFrame, asString(v1), v2.toPrimitiveString(callFrame));
311 // All other cases are pretty uncommon
312 return jsAddSlowCase(callFrame, v1, v2);
315 inline size_t normalizePrototypeChain(CallFrame* callFrame, JSValue base, JSValue slotBase, const Identifier& propertyName, size_t& slotOffset)
317 JSCell* cell = base.asCell();
320 while (slotBase != cell) {
321 JSValue v = cell->structure()->prototypeForLookup(callFrame);
323 // If we didn't find slotBase in base's prototype chain, then base
324 // must be a proxy for another object.
331 // Since we're accessing a prototype in a loop, it's a good bet that it
332 // should not be treated as a dictionary.
333 if (cell->structure()->isDictionary()) {
334 asObject(cell)->flattenDictionaryObject(callFrame->globalData());
335 if (slotBase == cell)
336 slotOffset = cell->structure()->get(callFrame->globalData(), propertyName);
346 inline size_t normalizePrototypeChain(CallFrame* callFrame, JSCell* base)
350 JSValue v = base->structure()->prototypeForLookup(callFrame);
356 // Since we're accessing a prototype in a loop, it's a good bet that it
357 // should not be treated as a dictionary.
358 if (base->structure()->isDictionary())
359 asObject(base)->flattenDictionaryObject(callFrame->globalData());
365 ALWAYS_INLINE JSValue resolveBase(CallFrame* callFrame, Identifier& property, ScopeChainNode* scopeChain, bool isStrictPut)
367 ScopeChainIterator iter = scopeChain->begin();
368 ScopeChainIterator next = iter;
370 ScopeChainIterator end = scopeChain->end();
378 if (isStrictPut && !base->getPropertySlot(callFrame, property, slot))
382 if (base->getPropertySlot(callFrame, property, slot))
389 ASSERT_NOT_REACHED();
394 #endif // Operations_h