JavaScriptCore-7601.1.46.3.tar.gz

[apple/javascriptcore.git] / runtime / Operations.h

diff --git a/runtime/Operations.h b/runtime/Operations.h
index c6a7e7a303f6801f69ce9fa3590e5c12fcebf74c..ac47c8f9cd7b4b27099344f8dedc528354f66913 100644 (file)
--- a/runtime/Operations.h
+++ b/runtime/Operations.h
@@ -1,6 +1,6 @@
 /*
  *  Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
 /*
  *  Copyright (C) 1999-2000 Harri Porten (porten@kde.org)

- *  Copyright (C) 2002, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
+ *  Copyright (C) 2002, 2005, 2006, 2007, 2008, 2009, 2013, 2014 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
  *
  *  This library is free software; you can redistribute it and/or
  *  modify it under the terms of the GNU Library General Public


@@ -22,114 +22,259 @@
 #ifndef Operations_h
 #define Operations_h
 
 #ifndef Operations_h
 #define Operations_h
 

-#include "JSImmediate.h"
-#include "JSNumberCell.h"
-#include "JSString.h"
+#include "CallFrame.h"
+#include "ExceptionHelpers.h"
+#include "JSCJSValue.h"

 
 namespace JSC {
 
 
 namespace JSC {
 

-    // ECMA 11.9.3
-    inline bool JSValuePtr::equal(ExecState* exec, JSValuePtr v1, JSValuePtr v2)
-    {
-        if (JSImmediate::areBothImmediateIntegerNumbers(v1, v2))
-            return v1 == v2;
+NEVER_INLINE JSValue jsAddSlowCase(CallFrame*, JSValue, JSValue);
+JSValue jsTypeStringForValue(CallFrame*, JSValue);
+JSValue jsTypeStringForValue(VM&, JSGlobalObject*, JSValue);
+bool jsIsObjectTypeOrNull(CallFrame*, JSValue);
+bool jsIsFunctionType(JSValue);

 
 

-        return equalSlowCase(exec, v1, v2);
+ALWAYS_INLINE JSValue jsString(ExecState* exec, JSString* s1, JSString* s2)
+{
+    VM& vm = exec->vm();
+
+    int32_t length1 = s1->length();
+    if (!length1)
+        return s2;
+    int32_t length2 = s2->length();
+    if (!length2)
+        return s1;
+    if (sumOverflows<int32_t>(length1, length2))
+        return throwOutOfMemoryError(exec);
+
+    return JSRopeString::create(vm, s1, s2);
+}
+
+ALWAYS_INLINE JSValue jsString(ExecState* exec, const String& u1, const String& u2, const String& u3)
+{
+    VM* vm = &exec->vm();
+
+    int32_t length1 = u1.length();
+    int32_t length2 = u2.length();
+    int32_t length3 = u3.length();
+    
+    if (length1 < 0 || length2 < 0 || length3 < 0)
+        return throwOutOfMemoryError(exec);
+    
+    if (!length1)
+        return jsString(exec, jsString(vm, u2), jsString(vm, u3));
+    if (!length2)
+        return jsString(exec, jsString(vm, u1), jsString(vm, u3));
+    if (!length3)
+        return jsString(exec, jsString(vm, u1), jsString(vm, u2));
+
+    if (sumOverflows<int32_t>(length1, length2, length3))
+        return throwOutOfMemoryError(exec);
+
+    return JSRopeString::create(exec->vm(), jsString(vm, u1), jsString(vm, u2), jsString(vm, u3));
+}
+
+ALWAYS_INLINE JSValue jsStringFromRegisterArray(ExecState* exec, Register* strings, unsigned count)
+{
+    VM* vm = &exec->vm();
+    JSRopeString::RopeBuilder ropeBuilder(*vm);
+
+    for (unsigned i = 0; i < count; ++i) {
+        JSValue v = strings[-static_cast<int>(i)].jsValue();
+        if (!ropeBuilder.append(v.toString(exec)))
+            return throwOutOfMemoryError(exec);

     }
 
     }
 

-    ALWAYS_INLINE bool JSValuePtr::equalSlowCaseInline(ExecState* exec, JSValuePtr v1, JSValuePtr v2)
-    {
-        ASSERT(!JSImmediate::areBothImmediateIntegerNumbers(v1, v2));
-
-        do {
-            if (v1.isNumber() && v2.isNumber())
-                return v1.uncheckedGetNumber() == v2.uncheckedGetNumber();
-
-            bool s1 = v1.isString();
-            bool s2 = v2.isString();
-            if (s1 && s2)
-                return asString(v1)->value() == asString(v2)->value();
-
-            if (v1.isUndefinedOrNull()) {
-                if (v2.isUndefinedOrNull())
-                    return true;
-                if (JSImmediate::isImmediate(v2))
-                    return false;
-                return v2.asCell()->structure()->typeInfo().masqueradesAsUndefined();
-            }
-
-            if (v2.isUndefinedOrNull()) {
-                if (JSImmediate::isImmediate(v1))
-                    return false;
-                return v1.asCell()->structure()->typeInfo().masqueradesAsUndefined();
-            }
-
-            if (v1.isObject()) {
-                if (v2.isObject())
-                    return v1 == v2;
-                JSValuePtr p1 = v1.toPrimitive(exec);
-                if (exec->hadException())
-                    return false;
-                v1 = p1;
-                if (JSImmediate::areBothImmediateIntegerNumbers(v1, v2))
-                    return v1 == v2;
-                continue;
-            }
-
-            if (v2.isObject()) {
-                JSValuePtr p2 = v2.toPrimitive(exec);
-                if (exec->hadException())
-                    return false;
-                v2 = p2;
-                if (JSImmediate::areBothImmediateIntegerNumbers(v1, v2))
-                    return v1 == v2;
-                continue;
-            }
-
-            if (s1 || s2) {
-                double d1 = v1.toNumber(exec);
-                double d2 = v2.toNumber(exec);
-                return d1 == d2;
-            }
-
-            if (v1.isBoolean()) {
-                if (v2.isNumber())
-                    return static_cast<double>(v1.getBoolean()) == v2.uncheckedGetNumber();
-            } else if (v2.isBoolean()) {
-                if (v1.isNumber())
-                    return v1.uncheckedGetNumber() == static_cast<double>(v2.getBoolean());
-            }
-
-            return v1 == v2;
-        } while (true);
+    return ropeBuilder.release();
+}
+
+ALWAYS_INLINE JSValue jsStringFromArguments(ExecState* exec, JSValue thisValue)
+{
+    VM* vm = &exec->vm();
+    JSRopeString::RopeBuilder ropeBuilder(*vm);
+    ropeBuilder.append(thisValue.toString(exec));
+
+    for (unsigned i = 0; i < exec->argumentCount(); ++i) {
+        JSValue v = exec->argument(i);
+        if (!ropeBuilder.append(v.toString(exec)))
+            return throwOutOfMemoryError(exec);
+    }
+
+    return ropeBuilder.release();
+}
+
+// See ES5 11.8.1/11.8.2/11.8.5 for definition of leftFirst, this value ensures correct
+// evaluation ordering for argument conversions for '<' and '>'. For '<' pass the value
+// true, for leftFirst, for '>' pass the value false (and reverse operand order).
+template<bool leftFirst>
+ALWAYS_INLINE bool jsLess(CallFrame* callFrame, JSValue v1, JSValue v2)
+{
+    if (v1.isInt32() && v2.isInt32())
+        return v1.asInt32() < v2.asInt32();
+
+    if (v1.isNumber() && v2.isNumber())
+        return v1.asNumber() < v2.asNumber();
+
+    if (isJSString(v1) && isJSString(v2))
+        return codePointCompareLessThan(asString(v1)->value(callFrame), asString(v2)->value(callFrame));
+
+    double n1;
+    double n2;
+    JSValue p1;
+    JSValue p2;
+    bool wasNotString1;
+    bool wasNotString2;
+    if (leftFirst) {
+        wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
+        wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
+    } else {
+        wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
+        wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);

     }
 
     }
 

-    // ECMA 11.9.3
-    inline bool JSValuePtr::strictEqual(JSValuePtr v1, JSValuePtr v2)
-    {
-        if (JSImmediate::areBothImmediateIntegerNumbers(v1, v2))
-            return v1 == v2;
+    if (wasNotString1 | wasNotString2)
+        return n1 < n2;
+    return codePointCompareLessThan(asString(p1)->value(callFrame), asString(p2)->value(callFrame));
+}
+
+// See ES5 11.8.3/11.8.4/11.8.5 for definition of leftFirst, this value ensures correct
+// evaluation ordering for argument conversions for '<=' and '=>'. For '<=' pass the
+// value true, for leftFirst, for '=>' pass the value false (and reverse operand order).
+template<bool leftFirst>
+ALWAYS_INLINE bool jsLessEq(CallFrame* callFrame, JSValue v1, JSValue v2)
+{
+    if (v1.isInt32() && v2.isInt32())
+        return v1.asInt32() <= v2.asInt32();

 
 

-        if (v1.isNumber() && v2.isNumber())
-            return v1.uncheckedGetNumber() == v2.uncheckedGetNumber();
+    if (v1.isNumber() && v2.isNumber())
+        return v1.asNumber() <= v2.asNumber();

 
 

-        if (JSImmediate::isEitherImmediate(v1, v2))
-            return v1 == v2;
+    if (isJSString(v1) && isJSString(v2))
+        return !codePointCompareLessThan(asString(v2)->value(callFrame), asString(v1)->value(callFrame));

 
 

-        return strictEqualSlowCase(v1, v2);
+    double n1;
+    double n2;
+    JSValue p1;
+    JSValue p2;
+    bool wasNotString1;
+    bool wasNotString2;
+    if (leftFirst) {
+        wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);
+        wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
+    } else {
+        wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
+        wasNotString1 = v1.getPrimitiveNumber(callFrame, n1, p1);

     }
 
     }
 

-    ALWAYS_INLINE bool JSValuePtr::strictEqualSlowCaseInline(JSValuePtr v1, JSValuePtr v2)
-    {
-        ASSERT(!JSImmediate::isEitherImmediate(v1, v2));
+    if (wasNotString1 | wasNotString2)
+        return n1 <= n2;
+    return !codePointCompareLessThan(asString(p2)->value(callFrame), asString(p1)->value(callFrame));
+}
+
+// Fast-path choices here are based on frequency data from SunSpider:
+//    <times> Add case: <t1> <t2>
+//    ---------------------------
+//    5626160 Add case: 3 3 (of these, 3637690 are for immediate values)
+//    247412  Add case: 5 5
+//    20900   Add case: 5 6
+//    13962   Add case: 5 3
+//    4000    Add case: 3 5
+
+ALWAYS_INLINE JSValue jsAdd(CallFrame* callFrame, JSValue v1, JSValue v2)
+{
+    if (v1.isNumber() && v2.isNumber())
+        return jsNumber(v1.asNumber() + v2.asNumber());
+        
+    if (v1.isString() && !v2.isObject())
+        return jsString(callFrame, asString(v1), v2.toString(callFrame));
+
+    // All other cases are pretty uncommon
+    return jsAddSlowCase(callFrame, v1, v2);
+}
+
+#define InvalidPrototypeChain (std::numeric_limits<size_t>::max())
+
+inline size_t normalizePrototypeChainForChainAccess(CallFrame* callFrame, Structure* structure, JSValue slotBase, const Identifier& propertyName, PropertyOffset& slotOffset)
+{
+    VM& vm = callFrame->vm();
+    size_t count = 0;
+        
+    while (1) {
+        if (structure->isProxy())
+            return InvalidPrototypeChain;
+
+        const TypeInfo& typeInfo = structure->typeInfo();
+        if (typeInfo.hasImpureGetOwnPropertySlot() && !typeInfo.newImpurePropertyFiresWatchpoints())
+            return InvalidPrototypeChain;
+            
+        JSValue v = structure->prototypeForLookup(callFrame);

 
 

-        if (v1.asCell()->isString() && v2.asCell()->isString())
-            return asString(v1)->value() == asString(v2)->value();
+        // If we didn't find slotBase in the base's prototype chain, then the base
+        // must be a proxy for another object.

 
 

-        return v1 == v2;
+        if (v.isNull()) {
+            if (!slotBase)
+                break;
+            return InvalidPrototypeChain;
+        }
+
+        JSCell* cell = v.asCell();
+        structure = cell->structure(vm);
+        // Since we're accessing a prototype in a loop, it's a good bet that it
+        // should not be treated as a dictionary.
+        if (structure->isDictionary()) {
+            structure->flattenDictionaryStructure(vm, asObject(cell));
+            if (slotBase == cell)
+                slotOffset = structure->get(vm, propertyName); 
+        }
+        ++count;
+
+        if (slotBase == cell)
+            break;

     }
     }

+        
+    return count;
+}
+
+inline size_t normalizePrototypeChain(CallFrame* callFrame, Structure* structure)
+{
+    VM& vm = callFrame->vm();
+    size_t count = 0;
+    while (1) {
+        if (structure->isProxy())
+            return InvalidPrototypeChain;
+        JSValue v = structure->prototypeForLookup(callFrame);
+        if (v.isNull())
+            return count;
+
+        JSCell* base = v.asCell();
+        structure = base->structure(vm);
+        // Since we're accessing a prototype in a loop, it's a good bet that it
+        // should not be treated as a dictionary.
+        if (structure->isDictionary())
+            structure->flattenDictionaryStructure(vm, asObject(base));

 
 

-    JSValuePtr throwOutOfMemoryError(ExecState*);
+        ++count;
+    }
+}

 
 

+inline bool isPrototypeChainNormalized(JSGlobalObject* globalObject, Structure* structure)
+{
+    for (;;) {
+        if (structure->isProxy())
+            return false;
+            
+        JSValue v = structure->prototypeForLookup(globalObject);
+        if (v.isNull())
+            return true;
+            
+        structure = v.asCell()->structure();
+            
+        if (structure->isDictionary())
+            return false;
+    }

 }
 }

-#endif
+
+} // namespace JSC
+
+#endif // Operations_h