summaryrefslogtreecommitdiff
path: root/Source/JavaScriptCore/bytecode/ByValInfo.h
diff options
context:
space:
mode:
authorLorry Tar Creator <lorry-tar-importer@lorry>2015-10-15 09:45:50 +0000
committerLorry Tar Creator <lorry-tar-importer@lorry>2015-10-15 09:45:50 +0000
commite15dd966d523731101f70ccf768bba12435a0208 (patch)
treeae9cb828a24ded2585a41af3f21411523b47897d /Source/JavaScriptCore/bytecode/ByValInfo.h
downloadWebKitGtk-tarball-e15dd966d523731101f70ccf768bba12435a0208.tar.gz
webkitgtk-2.10.2webkitgtk-2.10.2
Diffstat (limited to 'Source/JavaScriptCore/bytecode/ByValInfo.h')
-rw-r--r--Source/JavaScriptCore/bytecode/ByValInfo.h253
1 files changed, 253 insertions, 0 deletions
diff --git a/Source/JavaScriptCore/bytecode/ByValInfo.h b/Source/JavaScriptCore/bytecode/ByValInfo.h
new file mode 100644
index 000000000..b46a40d07
--- /dev/null
+++ b/Source/JavaScriptCore/bytecode/ByValInfo.h
@@ -0,0 +1,253 @@
+/*
+ * Copyright (C) 2012, 2015 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 ByValInfo_h
+#define ByValInfo_h
+
+#include "ClassInfo.h"
+#include "CodeLocation.h"
+#include "CodeOrigin.h"
+#include "IndexingType.h"
+#include "JITStubRoutine.h"
+#include "Structure.h"
+#include "StructureStubInfo.h"
+
+namespace JSC {
+
+#if ENABLE(JIT)
+
+enum JITArrayMode {
+ JITInt32,
+ JITDouble,
+ JITContiguous,
+ JITArrayStorage,
+ JITDirectArguments,
+ JITScopedArguments,
+ JITInt8Array,
+ JITInt16Array,
+ JITInt32Array,
+ JITUint8Array,
+ JITUint8ClampedArray,
+ JITUint16Array,
+ JITUint32Array,
+ JITFloat32Array,
+ JITFloat64Array
+};
+
+inline bool isOptimizableIndexingType(IndexingType indexingType)
+{
+ switch (indexingType) {
+ case ALL_INT32_INDEXING_TYPES:
+ case ALL_DOUBLE_INDEXING_TYPES:
+ case ALL_CONTIGUOUS_INDEXING_TYPES:
+ case ARRAY_WITH_ARRAY_STORAGE_INDEXING_TYPES:
+ return true;
+ default:
+ return false;
+ }
+}
+
+inline bool hasOptimizableIndexingForJSType(JSType type)
+{
+ switch (type) {
+ case DirectArgumentsType:
+ case ScopedArgumentsType:
+ return true;
+ default:
+ return false;
+ }
+}
+
+inline bool hasOptimizableIndexingForClassInfo(const ClassInfo* classInfo)
+{
+ return isTypedView(classInfo->typedArrayStorageType);
+}
+
+inline bool hasOptimizableIndexing(Structure* structure)
+{
+ return isOptimizableIndexingType(structure->indexingType())
+ || hasOptimizableIndexingForJSType(structure->typeInfo().type())
+ || hasOptimizableIndexingForClassInfo(structure->classInfo());
+}
+
+inline JITArrayMode jitArrayModeForIndexingType(IndexingType indexingType)
+{
+ switch (indexingType) {
+ case ALL_INT32_INDEXING_TYPES:
+ return JITInt32;
+ case ALL_DOUBLE_INDEXING_TYPES:
+ return JITDouble;
+ case ALL_CONTIGUOUS_INDEXING_TYPES:
+ return JITContiguous;
+ case ARRAY_WITH_ARRAY_STORAGE_INDEXING_TYPES:
+ return JITArrayStorage;
+ default:
+ CRASH();
+ return JITContiguous;
+ }
+}
+
+inline JITArrayMode jitArrayModeForJSType(JSType type)
+{
+ switch (type) {
+ case DirectArgumentsType:
+ return JITDirectArguments;
+ case ScopedArgumentsType:
+ return JITScopedArguments;
+ default:
+ RELEASE_ASSERT_NOT_REACHED();
+ return JITContiguous;
+ }
+}
+
+inline JITArrayMode jitArrayModeForClassInfo(const ClassInfo* classInfo)
+{
+ switch (classInfo->typedArrayStorageType) {
+ case TypeInt8:
+ return JITInt8Array;
+ case TypeInt16:
+ return JITInt16Array;
+ case TypeInt32:
+ return JITInt32Array;
+ case TypeUint8:
+ return JITUint8Array;
+ case TypeUint8Clamped:
+ return JITUint8ClampedArray;
+ case TypeUint16:
+ return JITUint16Array;
+ case TypeUint32:
+ return JITUint32Array;
+ case TypeFloat32:
+ return JITFloat32Array;
+ case TypeFloat64:
+ return JITFloat64Array;
+ default:
+ CRASH();
+ return JITContiguous;
+ }
+}
+
+inline bool jitArrayModePermitsPut(JITArrayMode mode)
+{
+ switch (mode) {
+ case JITDirectArguments:
+ case JITScopedArguments:
+ // We could support put_by_val on these at some point, but it's just not that profitable
+ // at the moment.
+ return false;
+ default:
+ return true;
+ }
+}
+
+inline TypedArrayType typedArrayTypeForJITArrayMode(JITArrayMode mode)
+{
+ switch (mode) {
+ case JITInt8Array:
+ return TypeInt8;
+ case JITInt16Array:
+ return TypeInt16;
+ case JITInt32Array:
+ return TypeInt32;
+ case JITUint8Array:
+ return TypeUint8;
+ case JITUint8ClampedArray:
+ return TypeUint8Clamped;
+ case JITUint16Array:
+ return TypeUint16;
+ case JITUint32Array:
+ return TypeUint32;
+ case JITFloat32Array:
+ return TypeFloat32;
+ case JITFloat64Array:
+ return TypeFloat64;
+ default:
+ CRASH();
+ return NotTypedArray;
+ }
+}
+
+inline JITArrayMode jitArrayModeForStructure(Structure* structure)
+{
+ if (isOptimizableIndexingType(structure->indexingType()))
+ return jitArrayModeForIndexingType(structure->indexingType());
+
+ if (hasOptimizableIndexingForJSType(structure->typeInfo().type()))
+ return jitArrayModeForJSType(structure->typeInfo().type());
+
+ ASSERT(hasOptimizableIndexingForClassInfo(structure->classInfo()));
+ return jitArrayModeForClassInfo(structure->classInfo());
+}
+
+struct ByValInfo {
+ ByValInfo() { }
+
+ ByValInfo(unsigned bytecodeIndex, CodeLocationJump notIndexJump, CodeLocationJump badTypeJump, JITArrayMode arrayMode, ArrayProfile* arrayProfile, int16_t badTypeJumpToDone, int16_t badTypeJumpToNextHotPath, int16_t returnAddressToSlowPath)
+ : bytecodeIndex(bytecodeIndex)
+ , notIndexJump(notIndexJump)
+ , badTypeJump(badTypeJump)
+ , arrayMode(arrayMode)
+ , arrayProfile(arrayProfile)
+ , badTypeJumpToDone(badTypeJumpToDone)
+ , badTypeJumpToNextHotPath(badTypeJumpToNextHotPath)
+ , returnAddressToSlowPath(returnAddressToSlowPath)
+ , slowPathCount(0)
+ , stubInfo(nullptr)
+ , tookSlowPath(false)
+ {
+ }
+
+ unsigned bytecodeIndex;
+ CodeLocationJump notIndexJump;
+ CodeLocationJump badTypeJump;
+ JITArrayMode arrayMode; // The array mode that was baked into the inline JIT code.
+ ArrayProfile* arrayProfile;
+ int16_t badTypeJumpToDone;
+ int16_t badTypeJumpToNextHotPath;
+ int16_t returnAddressToSlowPath;
+ unsigned slowPathCount;
+ RefPtr<JITStubRoutine> stubRoutine;
+ Identifier cachedId;
+ StructureStubInfo* stubInfo;
+ bool tookSlowPath;
+};
+
+inline unsigned getByValInfoBytecodeIndex(ByValInfo* info)
+{
+ return info->bytecodeIndex;
+}
+
+typedef HashMap<CodeOrigin, ByValInfo*, CodeOriginApproximateHash> ByValInfoMap;
+
+#else // ENABLE(JIT)
+
+typedef HashMap<int, void*> ByValInfoMap;
+
+#endif // ENABLE(JIT)
+
+} // namespace JSC
+
+#endif // ByValInfo_h
+