Attachment #124229 for bug #75812

View Details Raw Unified Return to Bug 75812

| Differences between

and this patch



2012-01-26  Filip Pizlo  <fpizlo@apple.com>

        JSC should be a triple-tier VM
        https://bugs.webkit.org/show_bug.cgi?id=75812
        <rdar://problem/10079694>

        Reviewed by NOBODY (OOPS!).
        
        Implemented an interpreter that uses the JIT's calling convention. This
        interpreter is called LLInt, or the Low Level Interpreter. JSC will now
        will start by executing code in LLInt and will only tier up to the old
        JIT after the code is proven hot.
        
        LLInt is written in a modified form of our macro assembly. This new macro
        assembly is compiled by an offline assembler (see offlineasm), which
        implements many modern conveniences such as a Turing-complete CPS-based
        macro language and direct access to relevant C++ type information
        (basically offsets of fields and sizes of structs/classes).
        
        Code executing in LLInt appears to the rest of the JSC world "as if" it
        were executing in the old JIT. Hence, things like exception handling and
        cross-execution-engine calls just work and require pretty much no
        additional overhead.
        
        This interpreter is 2-2.5x faster than our old interpreter on SunSpider,
        V8, and Kraken. With triple-tiering turned on, we're neutral on SunSpider,
        V8, and Kraken, but appear to get a double-digit improvement on real-world
        websites due to a huge reduction in the amount of JIT'ing.
        
        As an additional change, this patch makes bytecode dumping and JSValue
        dumping work in release builds, since debugging some of the nastier
        aspects of this patch would have been impossible without that. And I
        don't believe that we care about the miniscule code bloat that this
        introduces.

        * CMakeLists.txt:
        * GNUmakefile.am:
        * GNUmakefile.list.am:
        * JavaScriptCore.pri:
        * JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCore.vcproj:
        * JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCoreCommon.vsprops:
        * JavaScriptCore.xcodeproj/project.pbxproj:
        * Target.pri:
        * assembler/LinkBuffer.h:
        * bytecode/BytecodeConventions.h: Added.
        * bytecode/CallLinkStatus.cpp:
        (JSC::CallLinkStatus::computeFromLLInt):
        (JSC):
        (JSC::CallLinkStatus::computeFor):
        * bytecode/CallLinkStatus.h:
        (JSC::CallLinkStatus::isSet):
        (JSC::CallLinkStatus::operator!):
        (CallLinkStatus):
        * bytecode/CodeBlock.cpp:
        (JSC):
        (JSC::escapeQuotes):
        (JSC::CodeBlock::dump):
        (JSC::CodeBlock::CodeBlock):
        (JSC::CodeBlock::~CodeBlock):
        (JSC::CodeBlock::finalizeUnconditionally):
        (JSC::CodeBlock::stronglyVisitStrongReferences):
        (JSC::CodeBlock::unlinkCalls):
        (JSC::CodeBlock::unlinkIncomingCalls):
        (JSC::CodeBlock::bytecodeOffset):
        (JSC::ProgramCodeBlock::jettison):
        (JSC::EvalCodeBlock::jettison):
        (JSC::FunctionCodeBlock::jettison):
        (JSC::ProgramCodeBlock::jitCompileImpl):
        (JSC::EvalCodeBlock::jitCompileImpl):
        (JSC::FunctionCodeBlock::jitCompileImpl):
        (JSC::CodeBlock::handleBytecodeDiscardingOpportunity):
        (JSC::CodeBlock::usesOpcode):
        * bytecode/CodeBlock.h:
        (JSC):
        (CodeBlock):
        ():
        (JSC::CodeBlock::baselineVersion):
        (JSC::CodeBlock::linkIncomingCall):
        (JSC::CodeBlock::bytecodeOffset):
        (JSC::CodeBlock::jitCompile):
        (JSC::CodeBlock::hasOptimizedReplacement):
        (JSC::CodeBlock::addPropertyAccessInstruction):
        (JSC::CodeBlock::addGlobalResolveInstruction):
        (JSC::CodeBlock::addLLIntCallLinkInfo):
        (JSC::CodeBlock::addGlobalResolveInfo):
        (JSC::CodeBlock::numberOfMethodCallLinkInfos):
        (JSC::CodeBlock::valueProfilePredictionForBytecodeOffset):
        (JSC::CodeBlock::likelyToTakeSlowCase):
        (JSC::CodeBlock::couldTakeSlowCase):
        (JSC::CodeBlock::likelyToTakeSpecialFastCase):
        (JSC::CodeBlock::likelyToTakeDeepestSlowCase):
        (JSC::CodeBlock::likelyToTakeAnySlowCase):
        (JSC::CodeBlock::addFrequentExitSite):
        (JSC::CodeBlock::dontJITAnytimeSoon):
        (JSC::CodeBlock::jitAfterWarmUp):
        (JSC::CodeBlock::jitSoon):
        (JSC::CodeBlock::llintExecuteCounter):
        (ProgramCodeBlock):
        (EvalCodeBlock):
        (FunctionCodeBlock):
        * bytecode/GetByIdStatus.cpp:
        (JSC::GetByIdStatus::computeFromLLInt):
        (JSC):
        (JSC::GetByIdStatus::computeFor):
        * bytecode/GetByIdStatus.h:
        (JSC::GetByIdStatus::GetByIdStatus):
        (JSC::GetByIdStatus::wasSeenInJIT):
        (GetByIdStatus):
        * bytecode/Instruction.h:
        (JSC):
        (JSC::Instruction::Instruction):
        (Instruction):
        ():
        * bytecode/LLIntCallLinkInfo.h: Added.
        (JSC):
        (JSC::LLIntCallLinkInfo::LLIntCallLinkInfo):
        (LLIntCallLinkInfo):
        (JSC::LLIntCallLinkInfo::~LLIntCallLinkInfo):
        (JSC::LLIntCallLinkInfo::isLinked):
        (JSC::LLIntCallLinkInfo::unlink):
        * bytecode/MethodCallLinkStatus.cpp:
        (JSC::MethodCallLinkStatus::computeFor):
        * bytecode/Opcode.h:
        (JSC):
        ():
        * bytecode/PutByIdStatus.cpp:
        (JSC::PutByIdStatus::computeFromLLInt):
        (JSC):
        (JSC::PutByIdStatus::computeFor):
        * bytecode/PutByIdStatus.h:
        (PutByIdStatus):
        * bytecompiler/BytecodeGenerator.cpp:
        (JSC):
        (JSC::BytecodeGenerator::setDumpsGeneratedCode):
        (JSC::BytecodeGenerator::dumpsGeneratedCode):
        (JSC::BytecodeGenerator::generate):
        (JSC::BytecodeGenerator::emitResolve):
        (JSC::BytecodeGenerator::emitResolveWithBase):
        (JSC::BytecodeGenerator::emitResolveWithThis):
        (JSC::BytecodeGenerator::emitGetById):
        (JSC::BytecodeGenerator::emitPutById):
        (JSC::BytecodeGenerator::emitDirectPutById):
        (JSC::BytecodeGenerator::emitCall):
        (JSC::BytecodeGenerator::emitConstruct):
        (JSC::BytecodeGenerator::emitCatch):
        * dfg/DFGByteCodeParser.cpp:
        (JSC::DFG::ByteCodeParser::getPredictionWithoutOSRExit):
        (JSC::DFG::ByteCodeParser::handleInlining):
        (JSC::DFG::ByteCodeParser::parseBlock):
        * dfg/DFGCapabilities.h:
        (JSC::DFG::canCompileOpcode):
        * dfg/DFGOSRExitCompiler.cpp:
        ():
        * dfg/DFGOperations.cpp:
        ():
        * heap/AllocationSpace.h:
        (JSC):
        (AllocationSpace):
        ():
        * heap/Heap.cpp:
        (JSC::Heap::collect):
        * heap/Heap.h:
        (JSC):
        ():
        (Heap):
        * heap/MarkStack.cpp:
        (JSC::visitChildren):
        * heap/MarkedSpace.h:
        (JSC):
        (MarkedSpace):
        * interpreter/CallFrame.h:
        (ExecState):
        (JSC::ExecState::currentVPC):
        * interpreter/Interpreter.cpp:
        (JSC::Interpreter::~Interpreter):
        (JSC):
        (JSC::Interpreter::initialize):
        (JSC::Interpreter::isOpcode):
        (JSC::Interpreter::unwindCallFrame):
        (JSC::Interpreter::retrieveLastCaller):
        * interpreter/Interpreter.h:
        (JSC):
        ():
        (Interpreter):
        (JSC::Interpreter::getOpcode):
        (JSC::Interpreter::getOpcodeID):
        (JSC::Interpreter::enabled):
        * interpreter/RegisterFile.h:
        (JSC):
        (RegisterFile):
        * jit/HostCallReturnValue.cpp: Added.
        (JSC):
        (JSC::getHostCallReturnValueWithExecState):
        * jit/HostCallReturnValue.h: Added.
        (JSC):
        * jit/JIT.cpp:
        (JSC::JIT::privateCompileMainPass):
        (JSC::JIT::privateCompileSlowCases):
        (JSC::JIT::privateCompile):
        * jit/JITCode.h:
        ():
        (JSC::JITCode::isOptimizingJIT):
        (JITCode):
        (JSC::JITCode::isBaselineCode):
        (JSC::JITCode::JITCode):
        * jit/JITDriver.h:
        (JSC::jitCompileIfAppropriate):
        (JSC::jitCompileFunctionIfAppropriate):
        * jit/JITExceptions.cpp:
        (JSC::jitThrow):
        * jit/JITStubs.cpp:
        (JSC::DEFINE_STUB_FUNCTION):
        (JSC):
        * jit/JSInterfaceJIT.h:
        * llint: Added.
        * llint/LLIntCommon.h: Added.
        * llint/LLIntData.cpp: Added.
        (LLInt):
        (JSC::LLInt::Data::Data):
        (JSC::LLInt::Data::~Data):
        * llint/LLIntData.h: Added.
        (JSC):
        (LLInt):
        (Data):
        (JSC::LLInt::Data::exceptionInstructions):
        (JSC::LLInt::Data::opcodeMap):
        * llint/LLIntEntrypoints.cpp: Added.
        (LLInt):
        (JSC::LLInt::getFunctionEntrypoint):
        (JSC::LLInt::getEvalEntrypoint):
        (JSC::LLInt::getProgramEntrypoint):
        * llint/LLIntEntrypoints.h: Added.
        (JSC):
        (LLInt):
        (JSC::LLInt::getEntrypoint):
        * llint/LLIntExceptions.cpp: Added.
        (LLInt):
        (JSC::LLInt::interpreterThrowInCaller):
        (JSC::LLInt::returnToThrowForThrownException):
        (JSC::LLInt::returnToThrow):
        (JSC::LLInt::callToThrow):
        * llint/LLIntExceptions.h: Added.
        (JSC):
        (LLInt):
        * llint/LLIntHelpers.cpp: Added.
        (LLInt):
        (JSC::LLInt::llint_trace_operand):
        (JSC::LLInt::llint_trace_value):
        (JSC::LLInt::LLINT_HELPER_DECL):
        (JSC::LLInt::traceFunctionPrologue):
        (JSC::LLInt::shouldJIT):
        ():
        (JSC::LLInt::entryOSR):
        (JSC::LLInt::resolveGlobal):
        (JSC::LLInt::getByVal):
        (JSC::LLInt::handleHostCall):
        (JSC::LLInt::setUpCall):
        (JSC::LLInt::genericCall):
        * llint/LLIntHelpers.h: Added.
        (JSC):
        (LLInt):
        * llint/LLIntOfflineAsmConfig.h: Added.
        * llint/LLIntOffsetsExtractor.cpp: Added.
        (JSC):
        (LLIntOffsetsExtractor):
        (JSC::LLIntOffsetsExtractor::dummy):
        (main):
        * llint/LLIntThunks.cpp: Added.
        (LLInt):
        (JSC::LLInt::generateThunkWithJumpTo):
        (JSC::LLInt::functionForCallEntryThunkGenerator):
        (JSC::LLInt::functionForConstructEntryThunkGenerator):
        (JSC::LLInt::functionForCallArityCheckThunkGenerator):
        (JSC::LLInt::functionForConstructArityCheckThunkGenerator):
        (JSC::LLInt::evalEntryThunkGenerator):
        (JSC::LLInt::programEntryThunkGenerator):
        * llint/LLIntThunks.h: Added.
        (JSC):
        (LLInt):
        * llint/LowLevelInterpreter.asm: Added.
        * llint/LowLevelInterpreter.cpp: Added.
        * llint/LowLevelInterpreter.h: Added.
        * offlineasm: Added.
        * offlineasm/armv7.rb: Added.
        * offlineasm/asm.rb: Added.
        * offlineasm/ast.rb: Added.
        * offlineasm/backends.rb: Added.
        * offlineasm/generate_offset_extractor.rb: Added.
        * offlineasm/instructions.rb: Added.
        * offlineasm/offset_extractor_constants.rb: Added.
        * offlineasm/offsets.rb: Added.
        * offlineasm/parser.rb: Added.
        * offlineasm/registers.rb: Added.
        * offlineasm/settings.rb: Added.
        * offlineasm/transform.rb: Added.
        * offlineasm/x86.rb: Added.
        * runtime/CodeSpecializationKind.h: Added.
        (JSC):
        ():
        * runtime/CommonSlowPaths.h:
        (JSC::CommonSlowPaths::arityCheckFor):
        (CommonSlowPaths):
        (JSC::CommonSlowPaths::opInstanceOfSlow):
        * runtime/Executable.cpp:
        (JSC::jettisonCodeBlock):
        (JSC::EvalExecutable::jitCompile):
        (JSC):
        (JSC::samplingDescription):
        (JSC::EvalExecutable::compileInternal):
        (JSC::ProgramExecutable::jitCompile):
        (JSC::ProgramExecutable::compileInternal):
        (JSC::FunctionExecutable::baselineCodeBlockFor):
        (JSC::FunctionExecutable::jitCompileForCall):
        (JSC::FunctionExecutable::jitCompileForConstruct):
        (JSC::FunctionExecutable::compileForCallInternal):
        (JSC::FunctionExecutable::compileForConstructInternal):
        * runtime/Executable.h:
        (JSC):
        ():
        (EvalExecutable):
        (ProgramExecutable):
        (FunctionExecutable):
        (JSC::FunctionExecutable::jitCompileFor):
        * runtime/ExecutionHarness.h: Added.
        (JSC):
        (JSC::prepareForExecution):
        (JSC::prepareFunctionForExecution):
        * runtime/JSActivation.h:
        (JSC::JSActivation::tearOff):
        * runtime/JSArray.h:
        (JSC):
        (JSArray):
        * runtime/JSCell.h:
        (JSC):
        ():
        (JSCell):
        * runtime/JSFunction.h:
        (JSC):
        (JSFunction):
        * runtime/JSGlobalData.cpp:
        (JSC::JSGlobalData::JSGlobalData):
        * runtime/JSGlobalData.h:
        (JSC):
        (JSGlobalData):
        (JSC::JSGlobalData::scratchBufferForSize):
        * runtime/JSGlobalObject.h:
        (JSC):
        (JSGlobalObject):
        * runtime/JSObject.h:
        (JSC):
        ():
        (JSObject):
        (JSFinalObject):
        * runtime/JSPropertyNameIterator.h:
        (JSC):
        (JSPropertyNameIterator):
        * runtime/JSString.h:
        (JSC):
        (JSString):
        * runtime/JSTypeInfo.h:
        (JSC):
        (TypeInfo):
        * runtime/JSValue.cpp:
        (JSC):
        (JSC::JSValue::description):
        * runtime/JSValue.h:
        (JSValue):
        ():
        * runtime/JSVariableObject.h:
        (JSC):
        (JSVariableObject):
        * runtime/Options.cpp:
        (Options):
        (JSC::Options::initializeOptions):
        * runtime/Options.h:
        (Options):
        * runtime/ScopeChain.h:
        (JSC):
        (ScopeChainNode):
        * runtime/Structure.h:
        (JSC):
        (Structure):
        * runtime/StructureChain.h:
        (JSC):
        (StructureChain):
        * wtf/Platform.h:
        * wtf/SentinelLinkedList.h:
        (SentinelLinkedList):
        (WTF::SentinelLinkedList::isEmpty):
        * wtf/text/StringImpl.h:
        (JSC):
        (StringImpl):
        ():

2012-01-26  Filip Pizlo  <fpizlo@apple.com>

        All DFG helpers that may call out to arbitrary JS code must know where they



    "${JAVASCRIPTCORE_DIR}/debugger"
    "${JAVASCRIPTCORE_DIR}/interpreter"
    "${JAVASCRIPTCORE_DIR}/jit"
    "${JAVASCRIPTCORE_DIR}/llint"
    "${JAVASCRIPTCORE_DIR}/parser"
    "${JAVASCRIPTCORE_DIR}/profiler"
    "${JAVASCRIPTCORE_DIR}/runtime"

    interpreter/RegisterFile.cpp

    jit/ExecutableAllocator.cpp
    jit/HostCallReturnValue.cpp
    jit/JITArithmetic32_64.cpp
    jit/JITArithmetic.cpp
    jit/JITCall32_64.cpp

Lines 57-62 javascriptcore_cppflags += \ Source/JavaScriptCore/GNUmakefile.am_sec1
- Source/JavaScriptCore/GNUmakefile.am +1 lines
57	-I$(srcdir)/Source/JavaScriptCore/interpreter \	57	-I$(srcdir)/Source/JavaScriptCore/interpreter \
58	-I$(srcdir)/Source/JavaScriptCore/jit \	58	-I$(srcdir)/Source/JavaScriptCore/jit \
59	-I$(srcdir)/Source/JavaScriptCore/jit \	59	-I$(srcdir)/Source/JavaScriptCore/jit \
		60	-I$(srcdir)/Source/JavaScriptCore/llint \
60	-I$(srcdir)/Source/JavaScriptCore/parser \	61	-I$(srcdir)/Source/JavaScriptCore/parser \
61	-I$(srcdir)/Source/JavaScriptCore/profiler \	62	-I$(srcdir)/Source/JavaScriptCore/profiler \
62	-I$(srcdir)/Source/JavaScriptCore/runtime \	63	-I$(srcdir)/Source/JavaScriptCore/runtime \

Lines 20-25 INCLUDEPATH += \ Source/JavaScriptCore/JavaScriptCore.pri_sec1
- Source/JavaScriptCore/JavaScriptCore.pri +1 lines
20	$$SOURCE_DIR/debugger \	20	$$SOURCE_DIR/debugger \
21	$$SOURCE_DIR/interpreter \	21	$$SOURCE_DIR/interpreter \
22	$$SOURCE_DIR/jit \	22	$$SOURCE_DIR/jit \
		23	$$SOURCE_DIR/llint \
23	$$SOURCE_DIR/parser \	24	$$SOURCE_DIR/parser \
24	$$SOURCE_DIR/profiler \	25	$$SOURCE_DIR/profiler \
25	$$SOURCE_DIR/runtime \	26	$$SOURCE_DIR/runtime \

Lines 107-112 SOURCES += \ Source/JavaScriptCore/Target.pri_sec1
- Source/JavaScriptCore/Target.pri +1 lines
107	interpreter/RegisterFile.cpp \	107	interpreter/RegisterFile.cpp \
108	jit/ExecutableAllocatorFixedVMPool.cpp \	108	jit/ExecutableAllocatorFixedVMPool.cpp \
109	jit/ExecutableAllocator.cpp \	109	jit/ExecutableAllocator.cpp \
		110	jit/HostCallReturnValue.cpp \
110	jit/JITArithmetic.cpp \	111	jit/JITArithmetic.cpp \
111	jit/JITArithmetic32_64.cpp \	112	jit/JITArithmetic32_64.cpp \
112	jit/JITCall.cpp \	113	jit/JITCall.cpp \

Lines 1730-1735 Source/JavaScriptCore/JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCore.vcproj_sec1
- Source/JavaScriptCore/JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCore.vcproj +12 lines
1730	>	1730	>
1731	</File>	1731	</File>
1732	<File	1732	<File
		1733	RelativePath="..\..\jit\HostCallReturnValue.cpp"
		1734	>
		1735	</File>
		1736	<File
1733	RelativePath="..\..\jit\JIT.cpp"	1737	RelativePath="..\..\jit\JIT.cpp"
1734	>	1738	>
1735	</File>	1739	</File>
Lines 1815-1820 Source/JavaScriptCore/JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCore.vcproj_sec2
1815	</File>	1819	</File>
1816	</Filter>	1820	</Filter>
1817	<Filter	1821	<Filter
		1822	Name="llint"
		1823	>
		1824	<File
		1825	RelativePath="..\..\llint\LLIntData.h"
		1826	>
		1827	</File>
		1828	</Filter>
		1829	<Filter
1818	Name="interpreter"	1830	Name="interpreter"
1819	>	1831	>
1820	<File	1832	<File

Lines 6-12 Source/JavaScriptCore/JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCoreCommon.vsprops_sec1
- Source/JavaScriptCore/JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCoreCommon.vsprops -1 / +1 lines
6	>	6	>
7	<Tool	7	<Tool
8	Name="VCCLCompilerTool"	8	Name="VCCLCompilerTool"
9	AdditionalIncludeDirectories=""$(ConfigurationBuildDir)\obj\JavaScriptCore\DerivedSources\";../../;../../API/;../../parser/;../../bytecompiler/;../../dfg/;../../jit/;../../runtime/;../../bytecode/;../../interpreter/;../../wtf/;../../profiler;../../assembler/;../../debugger/;../../heap/;"$(WebKitLibrariesDir)\include";"$(WebKitLibrariesDir)\include\private";"$(ConfigurationBuildDir)\include";"$(ConfigurationBuildDir)\include\JavaScriptCore";"$(ConfigurationBuildDir)\include\private";"$(WebKitLibrariesDir)\include\pthreads""	9	AdditionalIncludeDirectories=""$(ConfigurationBuildDir)\obj\JavaScriptCore\DerivedSources\";../../;../../API/;../../parser/;../../bytecompiler/;../../dfg/;../../jit/;../../llint/;../../runtime/;../../bytecode/;../../interpreter/;../../wtf/;../../profiler;../../assembler/;../../debugger/;../../heap/;"$(WebKitLibrariesDir)\include";"$(WebKitLibrariesDir)\include\private";"$(ConfigurationBuildDir)\include";"$(ConfigurationBuildDir)\include\JavaScriptCore";"$(ConfigurationBuildDir)\include\private";"$(WebKitLibrariesDir)\include\pthreads""
10	PreprocessorDefinitions="__STD_C"	10	PreprocessorDefinitions="__STD_C"
11	ForcedIncludeFiles="ICUVersion.h"	11	ForcedIncludeFiles="ICUVersion.h"
12	/>	12	/>

Lines 7-12 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec1
- Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj -2 / +355 lines
7	objects = {	7	objects = {
8		8
9	/* Begin PBXAggregateTarget section */	9	/* Begin PBXAggregateTarget section */
		10	0F4680A914BA7FD900BFE272 /* LLInt Offsets */ = {
		11	isa = PBXAggregateTarget;
		12	buildConfigurationList = 0F4680AC14BA7FD900BFE272 /* Build configuration list for PBXAggregateTarget "LLInt Offsets" */;
		13	buildPhases = (
		14	0F4680AA14BA7FD900BFE272 /* Generate Derived Sources */,
		15	);
		16	name = "LLInt Offsets";
		17	productName = "Derived Sources";
		18	};
10	65FB3F6609D11E9100F49DEB /* Derived Sources */ = {	19	65FB3F6609D11E9100F49DEB /* Derived Sources */ = {
11	isa = PBXAggregateTarget;	20	isa = PBXAggregateTarget;
12	buildConfigurationList = 65FB3F7709D11EBD00F49DEB /* Build configuration list for PBXAggregateTarget "Derived Sources" */;	21	buildConfigurationList = 65FB3F7709D11EBD00F49DEB /* Build configuration list for PBXAggregateTarget "Derived Sources" */;
Lines 14-19 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec2
14	65FB3F6509D11E9100F49DEB /* Generate Derived Sources */,	23	65FB3F6509D11E9100F49DEB /* Generate Derived Sources */,
15	5D35DEE10C7C140B008648B2 /* Generate DTrace header */,	24	5D35DEE10C7C140B008648B2 /* Generate DTrace header */,
16	);	25	);
		26	dependencies = (
		27	0F4680B414BA821400BFE272 /* PBXTargetDependency */,
		28	);
17	name = "Derived Sources";	29	name = "Derived Sources";
18	productName = "Derived Sources";	30	productName = "Derived Sources";
19	};	31	};
Lines 48-53 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec3
48	0BAC94A01338728400CF135B /* ThreadRestrictionVerifier.h in Headers / = {isa = PBXBuildFile; fileRef = 0BAC949E1338728400CF135B / ThreadRestrictionVerifier.h */; settings = {ATTRIBUTES = (Private, ); }; };	60	0BAC94A01338728400CF135B /* ThreadRestrictionVerifier.h in Headers / = {isa = PBXBuildFile; fileRef = 0BAC949E1338728400CF135B / ThreadRestrictionVerifier.h */; settings = {ATTRIBUTES = (Private, ); }; };
49	0BCD83571485845200EA2003 /* TemporaryChange.h in Headers / = {isa = PBXBuildFile; fileRef = 0BCD83541485841200EA2003 / TemporaryChange.h */; settings = {ATTRIBUTES = (Private, ); }; };	61	0BCD83571485845200EA2003 /* TemporaryChange.h in Headers / = {isa = PBXBuildFile; fileRef = 0BCD83541485841200EA2003 / TemporaryChange.h */; settings = {ATTRIBUTES = (Private, ); }; };
50	0BF28A2911A33DC300638F84 /* SizeLimits.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0BF28A2811A33DC300638F84 / SizeLimits.cpp */; };	62	0BF28A2911A33DC300638F84 /* SizeLimits.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0BF28A2811A33DC300638F84 / SizeLimits.cpp */; };
		63	0F0B839A14BCF45D00885B4F /* LLIntEntrypoints.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F0B839514BCF45A00885B4F / LLIntEntrypoints.cpp */; };
		64	0F0B839B14BCF46000885B4F /* LLIntEntrypoints.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B839614BCF45A00885B4F / LLIntEntrypoints.h */; settings = {ATTRIBUTES = (Private, ); }; };
		65	0F0B839C14BCF46300885B4F /* LLIntThunks.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F0B839714BCF45A00885B4F / LLIntThunks.cpp */; };
		66	0F0B839D14BCF46600885B4F /* LLIntThunks.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B839814BCF45A00885B4F / LLIntThunks.h */; settings = {ATTRIBUTES = (Private, ); }; };
51	0F0B83A714BCF50700885B4F /* CodeType.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83A514BCF50400885B4F / CodeType.h */; settings = {ATTRIBUTES = (Private, ); }; };	67	0F0B83A714BCF50700885B4F /* CodeType.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83A514BCF50400885B4F / CodeType.h */; settings = {ATTRIBUTES = (Private, ); }; };
52	0F0B83A914BCF56200885B4F /* HandlerInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83A814BCF55E00885B4F / HandlerInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };	68	0F0B83A914BCF56200885B4F /* HandlerInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83A814BCF55E00885B4F / HandlerInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };
53	0F0B83AB14BCF5BB00885B4F /* ExpressionRangeInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83AA14BCF5B900885B4F / ExpressionRangeInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };	69	0F0B83AB14BCF5BB00885B4F /* ExpressionRangeInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83AA14BCF5B900885B4F / ExpressionRangeInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };
Lines 58-66 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec4
58	0F0B83B514BCF86200885B4F /* MethodCallLinkInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B314BCF85E00885B4F / MethodCallLinkInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };	74	0F0B83B514BCF86200885B4F /* MethodCallLinkInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B314BCF85E00885B4F / MethodCallLinkInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };
59	0F0B83B714BCF8E100885B4F /* GlobalResolveInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B614BCF8DF00885B4F / GlobalResolveInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };	75	0F0B83B714BCF8E100885B4F /* GlobalResolveInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B614BCF8DF00885B4F / GlobalResolveInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };
60	0F0B83B914BCF95F00885B4F /* CallReturnOffsetToBytecodeOffset.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B814BCF95B00885B4F / CallReturnOffsetToBytecodeOffset.h */; settings = {ATTRIBUTES = (Private, ); }; };	76	0F0B83B914BCF95F00885B4F /* CallReturnOffsetToBytecodeOffset.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0B83B814BCF95B00885B4F / CallReturnOffsetToBytecodeOffset.h */; settings = {ATTRIBUTES = (Private, ); }; };
		77	0F0FC45A14BD15F500B81154 /* LLIntCallLinkInfo.h in Headers / = {isa = PBXBuildFile; fileRef = 0F0FC45814BD15F100B81154 / LLIntCallLinkInfo.h */; settings = {ATTRIBUTES = (Private, ); }; };
61	0F15F15F14B7A73E005DE37D /* CommonSlowPaths.h in Headers / = {isa = PBXBuildFile; fileRef = 0F15F15D14B7A73A005DE37D / CommonSlowPaths.h */; settings = {ATTRIBUTES = (Private, ); }; };	78	0F15F15F14B7A73E005DE37D /* CommonSlowPaths.h in Headers / = {isa = PBXBuildFile; fileRef = 0F15F15D14B7A73A005DE37D / CommonSlowPaths.h */; settings = {ATTRIBUTES = (Private, ); }; };
62	0F16D726142C39C000CF784A /* BitVector.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F16D724142C39A200CF784A / BitVector.cpp */; };	79	0F16D726142C39C000CF784A /* BitVector.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F16D724142C39A200CF784A / BitVector.cpp */; };
63	0F21C26814BE5F6800ADC64B /* JITDriver.h in Headers / = {isa = PBXBuildFile; fileRef = 0F21C26614BE5F5E00ADC64B / JITDriver.h */; settings = {ATTRIBUTES = (Private, ); }; };	80	0F21C26814BE5F6800ADC64B /* JITDriver.h in Headers / = {isa = PBXBuildFile; fileRef = 0F21C26614BE5F5E00ADC64B / JITDriver.h */; settings = {ATTRIBUTES = (Private, ); }; };
		81	0F21C27C14BE727600ADC64B /* ExecutionHarness.h in Headers / = {isa = PBXBuildFile; fileRef = 0F21C27A14BE727300ADC64B / ExecutionHarness.h */; settings = {ATTRIBUTES = (Private, ); }; };
		82	0F21C27D14BE727A00ADC64B /* CodeSpecializationKind.h in Headers / = {isa = PBXBuildFile; fileRef = 0F21C27914BE727300ADC64B / CodeSpecializationKind.h */; settings = {ATTRIBUTES = (Private, ); }; };
		83	0F21C27F14BEAA8200ADC64B /* BytecodeConventions.h in Headers / = {isa = PBXBuildFile; fileRef = 0F21C27E14BEAA8000ADC64B / BytecodeConventions.h */; settings = {ATTRIBUTES = (Private, ); }; };
64	0F242DA713F3B1E8007ADD4C /* WeakReferenceHarvester.h in Headers / = {isa = PBXBuildFile; fileRef = 0F242DA513F3B1BB007ADD4C / WeakReferenceHarvester.h */; settings = {ATTRIBUTES = (Private, ); }; };	84	0F242DA713F3B1E8007ADD4C /* WeakReferenceHarvester.h in Headers / = {isa = PBXBuildFile; fileRef = 0F242DA513F3B1BB007ADD4C / WeakReferenceHarvester.h */; settings = {ATTRIBUTES = (Private, ); }; };
65	0F2C556F14738F3100121E4F /* DFGCodeBlocks.h in Headers / = {isa = PBXBuildFile; fileRef = 0F2C556E14738F2E00121E4F / DFGCodeBlocks.h */; settings = {ATTRIBUTES = (Private, ); }; };	85	0F2C556F14738F3100121E4F /* DFGCodeBlocks.h in Headers / = {isa = PBXBuildFile; fileRef = 0F2C556E14738F2E00121E4F / DFGCodeBlocks.h */; settings = {ATTRIBUTES = (Private, ); }; };
66	0F2C557014738F3500121E4F /* DFGCodeBlocks.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F2C556D14738F2E00121E4F / DFGCodeBlocks.cpp */; };	86	0F2C557014738F3500121E4F /* DFGCodeBlocks.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F2C556D14738F2E00121E4F / DFGCodeBlocks.cpp */; };
Lines 71-76 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec5
71	0F431738146BAC69007E3890 /* ListableHandler.h in Headers / = {isa = PBXBuildFile; fileRef = 0F431736146BAC65007E3890 / ListableHandler.h */; settings = {ATTRIBUTES = (Private, ); }; };	91	0F431738146BAC69007E3890 /* ListableHandler.h in Headers / = {isa = PBXBuildFile; fileRef = 0F431736146BAC65007E3890 / ListableHandler.h */; settings = {ATTRIBUTES = (Private, ); }; };
72	0F46808214BA572D00BFE272 /* JITExceptions.h in Headers / = {isa = PBXBuildFile; fileRef = 0F46808014BA572700BFE272 / JITExceptions.h */; settings = {ATTRIBUTES = (Private, ); }; };	92	0F46808214BA572D00BFE272 /* JITExceptions.h in Headers / = {isa = PBXBuildFile; fileRef = 0F46808014BA572700BFE272 / JITExceptions.h */; settings = {ATTRIBUTES = (Private, ); }; };
73	0F46808314BA573100BFE272 /* JITExceptions.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F46807F14BA572700BFE272 / JITExceptions.cpp */; };	93	0F46808314BA573100BFE272 /* JITExceptions.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F46807F14BA572700BFE272 / JITExceptions.cpp */; };
		94	0F4680A314BA7F8D00BFE272 /* LLIntExceptions.h in Headers / = {isa = PBXBuildFile; fileRef = 0F46809E14BA7F8200BFE272 / LLIntExceptions.h */; settings = {ATTRIBUTES = (Private, ); }; };
		95	0F4680A414BA7F8D00BFE272 /* LLIntHelpers.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F46809F14BA7F8200BFE272 / LLIntHelpers.cpp */; settings = {COMPILER_FLAGS = "-Wno-unused-parameter"; }; };
		96	0F4680A514BA7F8D00BFE272 /* LLIntHelpers.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680A014BA7F8200BFE272 / LLIntHelpers.h */; settings = {ATTRIBUTES = (Private, ); }; };
		97	0F4680A714BA7FA100BFE272 /* LLIntOffsetsExtractor.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F4680A114BA7F8200BFE272 / LLIntOffsetsExtractor.cpp */; };
		98	0F4680A814BA7FAB00BFE272 /* LLIntExceptions.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F46809D14BA7F8200BFE272 / LLIntExceptions.cpp */; };
		99	0F4680CA14BBB16C00BFE272 /* LLIntCommon.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680C514BBB16900BFE272 / LLIntCommon.h */; settings = {ATTRIBUTES = (Private, ); }; };
		100	0F4680CB14BBB17200BFE272 /* LLIntOfflineAsmConfig.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680C614BBB16900BFE272 / LLIntOfflineAsmConfig.h */; settings = {ATTRIBUTES = (Private, ); }; };
		101	0F4680CC14BBB17A00BFE272 /* LowLevelInterpreter.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F4680C714BBB16900BFE272 / LowLevelInterpreter.cpp */; };
		102	0F4680CD14BBB17D00BFE272 /* LowLevelInterpreter.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680C814BBB16900BFE272 / LowLevelInterpreter.h */; settings = {ATTRIBUTES = (Private, ); }; };
		103	0F4680D214BBD16500BFE272 /* LLIntData.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F4680CE14BBB3D100BFE272 / LLIntData.cpp */; };
		104	0F4680D314BBD16700BFE272 /* LLIntData.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680CF14BBB3D100BFE272 / LLIntData.h */; settings = {ATTRIBUTES = (Private, ); }; };
		105	0F4680D414BBD24900BFE272 /* HostCallReturnValue.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F4680D014BBC5F800BFE272 / HostCallReturnValue.cpp */; };
		106	0F4680D514BBD24B00BFE272 /* HostCallReturnValue.h in Headers / = {isa = PBXBuildFile; fileRef = 0F4680D114BBC5F800BFE272 / HostCallReturnValue.h */; settings = {ATTRIBUTES = (Private, ); }; };
74	0F55F0F414D1063900AC7649 /* AbstractPC.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F55F0F114D1063600AC7649 / AbstractPC.cpp */; };	107	0F55F0F414D1063900AC7649 /* AbstractPC.cpp in Sources / = {isa = PBXBuildFile; fileRef = 0F55F0F114D1063600AC7649 / AbstractPC.cpp */; };
75	0F55F0F514D1063C00AC7649 /* AbstractPC.h in Headers / = {isa = PBXBuildFile; fileRef = 0F55F0F214D1063600AC7649 / AbstractPC.h */; settings = {ATTRIBUTES = (Private, ); }; };	108	0F55F0F514D1063C00AC7649 /* AbstractPC.h in Headers / = {isa = PBXBuildFile; fileRef = 0F55F0F214D1063600AC7649 / AbstractPC.h */; settings = {ATTRIBUTES = (Private, ); }; };
76	0F5F08CF146C7633000472A9 /* UnconditionalFinalizer.h in Headers / = {isa = PBXBuildFile; fileRef = 0F5F08CE146C762F000472A9 / UnconditionalFinalizer.h */; settings = {ATTRIBUTES = (Private, ); }; };	109	0F5F08CF146C7633000472A9 /* UnconditionalFinalizer.h in Headers / = {isa = PBXBuildFile; fileRef = 0F5F08CE146C762F000472A9 / UnconditionalFinalizer.h */; settings = {ATTRIBUTES = (Private, ); }; };
Lines 385-391 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec6
385	86B99AE3117E578100DF5A90 /* StringBuffer.h in Headers / = {isa = PBXBuildFile; fileRef = 86B99AE1117E578100DF5A90 / StringBuffer.h */; settings = {ATTRIBUTES = (Private, ); }; };	418	86B99AE3117E578100DF5A90 /* StringBuffer.h in Headers / = {isa = PBXBuildFile; fileRef = 86B99AE1117E578100DF5A90 / StringBuffer.h */; settings = {ATTRIBUTES = (Private, ); }; };
386	86BB09C0138E381B0056702F /* DFGRepatch.cpp in Sources / = {isa = PBXBuildFile; fileRef = 86BB09BE138E381B0056702F / DFGRepatch.cpp */; };	419	86BB09C0138E381B0056702F /* DFGRepatch.cpp in Sources / = {isa = PBXBuildFile; fileRef = 86BB09BE138E381B0056702F / DFGRepatch.cpp */; };
387	86BB09C1138E381B0056702F /* DFGRepatch.h in Headers / = {isa = PBXBuildFile; fileRef = 86BB09BF138E381B0056702F / DFGRepatch.h */; };	420	86BB09C1138E381B0056702F /* DFGRepatch.h in Headers / = {isa = PBXBuildFile; fileRef = 86BB09BF138E381B0056702F / DFGRepatch.h */; };
388	86C36EEA0EE1289D00B3DF59 /* MacroAssembler.h in Headers / = {isa = PBXBuildFile; fileRef = 86C36EE90EE1289D00B3DF59 / MacroAssembler.h */; };	421	86C36EEA0EE1289D00B3DF59 /* MacroAssembler.h in Headers / = {isa = PBXBuildFile; fileRef = 86C36EE90EE1289D00B3DF59 / MacroAssembler.h */; settings = {ATTRIBUTES = (Private, ); }; };
389	86C568E011A213EE0007F7F0 /* MacroAssemblerARM.cpp in Sources / = {isa = PBXBuildFile; fileRef = 86C568DD11A213EE0007F7F0 / MacroAssemblerARM.cpp */; };	422	86C568E011A213EE0007F7F0 /* MacroAssemblerARM.cpp in Sources / = {isa = PBXBuildFile; fileRef = 86C568DD11A213EE0007F7F0 / MacroAssemblerARM.cpp */; };
390	86C568E111A213EE0007F7F0 /* MacroAssemblerMIPS.h in Headers / = {isa = PBXBuildFile; fileRef = 86C568DE11A213EE0007F7F0 / MacroAssemblerMIPS.h */; };	423	86C568E111A213EE0007F7F0 /* MacroAssemblerMIPS.h in Headers / = {isa = PBXBuildFile; fileRef = 86C568DE11A213EE0007F7F0 / MacroAssemblerMIPS.h */; };
391	86C568E211A213EE0007F7F0 /* MIPSAssembler.h in Headers / = {isa = PBXBuildFile; fileRef = 86C568DF11A213EE0007F7F0 / MIPSAssembler.h */; };	424	86C568E211A213EE0007F7F0 /* MIPSAssembler.h in Headers / = {isa = PBXBuildFile; fileRef = 86C568DF11A213EE0007F7F0 / MIPSAssembler.h */; };
Lines 754-759 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec7
754	/* End PBXBuildFile section */	787	/* End PBXBuildFile section */
755		788
756	/* Begin PBXContainerItemProxy section */	789	/* Begin PBXContainerItemProxy section */
		790	0F4680B114BA811500BFE272 /* PBXContainerItemProxy */ = {
		791	isa = PBXContainerItemProxy;
		792	containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
		793	proxyType = 1;
		794	remoteGlobalIDString = 0F4680A914BA7FD900BFE272;
		795	remoteInfo = "LLInt Offsets";
		796	};
		797	0F4680B314BA821400BFE272 /* PBXContainerItemProxy */ = {
		798	isa = PBXContainerItemProxy;
		799	containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
		800	proxyType = 1;
		801	remoteGlobalIDString = 0F46808E14BA7E5E00BFE272;
		802	remoteInfo = JSCLLIntOffsetsExtractor;
		803	};
757	141214BE0A49190E00480255 /* PBXContainerItemProxy */ = {	804	141214BE0A49190E00480255 /* PBXContainerItemProxy */ = {
758	isa = PBXContainerItemProxy;	805	isa = PBXContainerItemProxy;
759	containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;	806	containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
Lines 799-804 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec8
799	/* End PBXContainerItemProxy section */	846	/* End PBXContainerItemProxy section */
800		847
801	/* Begin PBXCopyFilesBuildPhase section */	848	/* Begin PBXCopyFilesBuildPhase section */
		849	0F46808D14BA7E5E00BFE272 /* CopyFiles */ = {
		850	isa = PBXCopyFilesBuildPhase;
		851	buildActionMask = 2147483647;
		852	dstPath = /usr/share/man/man1/;
		853	dstSubfolderSpec = 0;
		854	files = (
		855	);
		856	runOnlyForDeploymentPostprocessing = 1;
		857	};
802	5DBB1511131D0B130056AD36 /* Copy Support Script */ = {	858	5DBB1511131D0B130056AD36 /* Copy Support Script */ = {
803	isa = PBXCopyFilesBuildPhase;	859	isa = PBXCopyFilesBuildPhase;
804	buildActionMask = 12;	860	buildActionMask = 12;
Lines 839-844 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec9
839	0BAC949E1338728400CF135B /* ThreadRestrictionVerifier.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ThreadRestrictionVerifier.h; sourceTree = "<group>"; };	895	0BAC949E1338728400CF135B /* ThreadRestrictionVerifier.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ThreadRestrictionVerifier.h; sourceTree = "<group>"; };
840	0BCD83541485841200EA2003 /* TemporaryChange.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = TemporaryChange.h; sourceTree = "<group>"; };	896	0BCD83541485841200EA2003 /* TemporaryChange.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = TemporaryChange.h; sourceTree = "<group>"; };
841	0BF28A2811A33DC300638F84 /* SizeLimits.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = SizeLimits.cpp; sourceTree = "<group>"; };	897	0BF28A2811A33DC300638F84 /* SizeLimits.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = SizeLimits.cpp; sourceTree = "<group>"; };
		898	0F0B839514BCF45A00885B4F /* LLIntEntrypoints.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntEntrypoints.cpp; path = llint/LLIntEntrypoints.cpp; sourceTree = "<group>"; };
		899	0F0B839614BCF45A00885B4F /* LLIntEntrypoints.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntEntrypoints.h; path = llint/LLIntEntrypoints.h; sourceTree = "<group>"; };
		900	0F0B839714BCF45A00885B4F /* LLIntThunks.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntThunks.cpp; path = llint/LLIntThunks.cpp; sourceTree = "<group>"; };
		901	0F0B839814BCF45A00885B4F /* LLIntThunks.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntThunks.h; path = llint/LLIntThunks.h; sourceTree = "<group>"; };
842	0F0B83A514BCF50400885B4F /* CodeType.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CodeType.h; sourceTree = "<group>"; };	902	0F0B83A514BCF50400885B4F /* CodeType.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CodeType.h; sourceTree = "<group>"; };
843	0F0B83A814BCF55E00885B4F /* HandlerInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = HandlerInfo.h; sourceTree = "<group>"; };	903	0F0B83A814BCF55E00885B4F /* HandlerInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = HandlerInfo.h; sourceTree = "<group>"; };
844	0F0B83AA14BCF5B900885B4F /* ExpressionRangeInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ExpressionRangeInfo.h; sourceTree = "<group>"; };	904	0F0B83AA14BCF5B900885B4F /* ExpressionRangeInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ExpressionRangeInfo.h; sourceTree = "<group>"; };
Lines 849-857 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec10
849	0F0B83B314BCF85E00885B4F /* MethodCallLinkInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = MethodCallLinkInfo.h; sourceTree = "<group>"; };	909	0F0B83B314BCF85E00885B4F /* MethodCallLinkInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = MethodCallLinkInfo.h; sourceTree = "<group>"; };
850	0F0B83B614BCF8DF00885B4F /* GlobalResolveInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = GlobalResolveInfo.h; sourceTree = "<group>"; };	910	0F0B83B614BCF8DF00885B4F /* GlobalResolveInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = GlobalResolveInfo.h; sourceTree = "<group>"; };
851	0F0B83B814BCF95B00885B4F /* CallReturnOffsetToBytecodeOffset.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CallReturnOffsetToBytecodeOffset.h; sourceTree = "<group>"; };	911	0F0B83B814BCF95B00885B4F /* CallReturnOffsetToBytecodeOffset.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CallReturnOffsetToBytecodeOffset.h; sourceTree = "<group>"; };
		912	0F0FC45814BD15F100B81154 /* LLIntCallLinkInfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = LLIntCallLinkInfo.h; sourceTree = "<group>"; };
852	0F15F15D14B7A73A005DE37D /* CommonSlowPaths.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CommonSlowPaths.h; sourceTree = "<group>"; };	913	0F15F15D14B7A73A005DE37D /* CommonSlowPaths.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CommonSlowPaths.h; sourceTree = "<group>"; };
853	0F16D724142C39A200CF784A /* BitVector.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = BitVector.cpp; sourceTree = "<group>"; };	914	0F16D724142C39A200CF784A /* BitVector.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = BitVector.cpp; sourceTree = "<group>"; };
854	0F21C26614BE5F5E00ADC64B /* JITDriver.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = JITDriver.h; sourceTree = "<group>"; };	915	0F21C26614BE5F5E00ADC64B /* JITDriver.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = JITDriver.h; sourceTree = "<group>"; };
		916	0F21C27914BE727300ADC64B /* CodeSpecializationKind.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CodeSpecializationKind.h; sourceTree = "<group>"; };
		917	0F21C27A14BE727300ADC64B /* ExecutionHarness.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ExecutionHarness.h; sourceTree = "<group>"; };
		918	0F21C27E14BEAA8000ADC64B /* BytecodeConventions.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = BytecodeConventions.h; sourceTree = "<group>"; };
855	0F242DA513F3B1BB007ADD4C /* WeakReferenceHarvester.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = WeakReferenceHarvester.h; sourceTree = "<group>"; };	919	0F242DA513F3B1BB007ADD4C /* WeakReferenceHarvester.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = WeakReferenceHarvester.h; sourceTree = "<group>"; };
856	0F2C556D14738F2E00121E4F /* DFGCodeBlocks.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = DFGCodeBlocks.cpp; sourceTree = "<group>"; };	920	0F2C556D14738F2E00121E4F /* DFGCodeBlocks.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = DFGCodeBlocks.cpp; sourceTree = "<group>"; };
857	0F2C556E14738F2E00121E4F /* DFGCodeBlocks.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = DFGCodeBlocks.h; sourceTree = "<group>"; };	921	0F2C556E14738F2E00121E4F /* DFGCodeBlocks.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = DFGCodeBlocks.h; sourceTree = "<group>"; };
Lines 862-867 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec11
862	0F431736146BAC65007E3890 /* ListableHandler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ListableHandler.h; sourceTree = "<group>"; };	926	0F431736146BAC65007E3890 /* ListableHandler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ListableHandler.h; sourceTree = "<group>"; };
863	0F46807F14BA572700BFE272 /* JITExceptions.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = JITExceptions.cpp; sourceTree = "<group>"; };	927	0F46807F14BA572700BFE272 /* JITExceptions.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = JITExceptions.cpp; sourceTree = "<group>"; };
864	0F46808014BA572700BFE272 /* JITExceptions.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = JITExceptions.h; sourceTree = "<group>"; };	928	0F46808014BA572700BFE272 /* JITExceptions.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = JITExceptions.h; sourceTree = "<group>"; };
		929	0F46808F14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = JSCLLIntOffsetsExtractor; sourceTree = BUILT_PRODUCTS_DIR; };
		930	0F46809D14BA7F8200BFE272 /* LLIntExceptions.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntExceptions.cpp; path = llint/LLIntExceptions.cpp; sourceTree = "<group>"; };
		931	0F46809E14BA7F8200BFE272 /* LLIntExceptions.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntExceptions.h; path = llint/LLIntExceptions.h; sourceTree = "<group>"; };
		932	0F46809F14BA7F8200BFE272 /* LLIntHelpers.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntHelpers.cpp; path = llint/LLIntHelpers.cpp; sourceTree = "<group>"; };
		933	0F4680A014BA7F8200BFE272 /* LLIntHelpers.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntHelpers.h; path = llint/LLIntHelpers.h; sourceTree = "<group>"; };
		934	0F4680A114BA7F8200BFE272 /* LLIntOffsetsExtractor.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntOffsetsExtractor.cpp; path = llint/LLIntOffsetsExtractor.cpp; sourceTree = "<group>"; };
		935	0F4680C514BBB16900BFE272 /* LLIntCommon.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntCommon.h; path = llint/LLIntCommon.h; sourceTree = "<group>"; };
		936	0F4680C614BBB16900BFE272 /* LLIntOfflineAsmConfig.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntOfflineAsmConfig.h; path = llint/LLIntOfflineAsmConfig.h; sourceTree = "<group>"; };
		937	0F4680C714BBB16900BFE272 /* LowLevelInterpreter.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LowLevelInterpreter.cpp; path = llint/LowLevelInterpreter.cpp; sourceTree = "<group>"; };
		938	0F4680C814BBB16900BFE272 /* LowLevelInterpreter.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LowLevelInterpreter.h; path = llint/LowLevelInterpreter.h; sourceTree = "<group>"; };
		939	0F4680CE14BBB3D100BFE272 /* LLIntData.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = LLIntData.cpp; path = llint/LLIntData.cpp; sourceTree = "<group>"; };
		940	0F4680CF14BBB3D100BFE272 /* LLIntData.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLIntData.h; path = llint/LLIntData.h; sourceTree = "<group>"; };
		941	0F4680D014BBC5F800BFE272 /* HostCallReturnValue.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = HostCallReturnValue.cpp; sourceTree = "<group>"; };
		942	0F4680D114BBC5F800BFE272 /* HostCallReturnValue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = HostCallReturnValue.h; sourceTree = "<group>"; };
865	0F55F0F114D1063600AC7649 /* AbstractPC.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = AbstractPC.cpp; sourceTree = "<group>"; };	943	0F55F0F114D1063600AC7649 /* AbstractPC.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = AbstractPC.cpp; sourceTree = "<group>"; };
866	0F55F0F214D1063600AC7649 /* AbstractPC.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = AbstractPC.h; sourceTree = "<group>"; };	944	0F55F0F214D1063600AC7649 /* AbstractPC.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = AbstractPC.h; sourceTree = "<group>"; };
867	0F5F08CC146BE602000472A9 /* DFGByteCodeCache.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = DFGByteCodeCache.h; path = dfg/DFGByteCodeCache.h; sourceTree = "<group>"; };	945	0F5F08CC146BE602000472A9 /* DFGByteCodeCache.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = DFGByteCodeCache.h; path = dfg/DFGByteCodeCache.h; sourceTree = "<group>"; };
Lines 1583-1588 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec12
1583	/* End PBXFileReference section */	1661	/* End PBXFileReference section */
1584		1662
1585	/* Begin PBXFrameworksBuildPhase section */	1663	/* Begin PBXFrameworksBuildPhase section */
		1664	0F46808C14BA7E5E00BFE272 /* Frameworks */ = {
		1665	isa = PBXFrameworksBuildPhase;
		1666	buildActionMask = 2147483647;
		1667	files = (
		1668	);
		1669	runOnlyForDeploymentPostprocessing = 0;
		1670	};
1586	1412111E0A48793C00480255 /* Frameworks */ = {	1671	1412111E0A48793C00480255 /* Frameworks */ = {
1587	isa = PBXFrameworksBuildPhase;	1672	isa = PBXFrameworksBuildPhase;
1588	buildActionMask = 2147483647;	1673	buildActionMask = 2147483647;
Lines 1641-1646 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec13
1641	141211200A48793C00480255 /* minidom */,	1726	141211200A48793C00480255 /* minidom */,
1642	14BD59BF0A3E8F9000BAF59C /* testapi */,	1727	14BD59BF0A3E8F9000BAF59C /* testapi */,
1643	6511230514046A4C002B101D /* testRegExp */,	1728	6511230514046A4C002B101D /* testRegExp */,
		1729	0F46808F14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */,
1644	);	1730	);
1645	name = Products;	1731	name = Products;
1646	sourceTree = "<group>";	1732	sourceTree = "<group>";
Lines 1671-1676 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec14
1671	F5C290E60284F98E018635CA /* JavaScriptCorePrefix.h */,	1757	F5C290E60284F98E018635CA /* JavaScriptCorePrefix.h */,
1672	45E12D8806A49B0F00E9DF84 /* jsc.cpp */,	1758	45E12D8806A49B0F00E9DF84 /* jsc.cpp */,
1673	F68EBB8C0255D4C601FF60F7 /* config.h */,	1759	F68EBB8C0255D4C601FF60F7 /* config.h */,
		1760	0F46809C14BA7F4D00BFE272 /* llint */,
1674	1432EBD70A34CAD400717B9F /* API */,	1761	1432EBD70A34CAD400717B9F /* API */,
1675	9688CB120ED12B4E001D649F /* assembler */,	1762	9688CB120ED12B4E001D649F /* assembler */,
1676	969A078F0ED1D3AE00F1F681 /* bytecode */,	1763	969A078F0ED1D3AE00F1F681 /* bytecode */,
Lines 1709-1714 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec15
1709	tabWidth = 4;	1796	tabWidth = 4;
1710	usesTabs = 0;	1797	usesTabs = 0;
1711	};	1798	};
		1799	0F46809C14BA7F4D00BFE272 /* llint */ = {
		1800	isa = PBXGroup;
		1801	children = (
		1802	0F0B839514BCF45A00885B4F /* LLIntEntrypoints.cpp */,
		1803	0F0B839614BCF45A00885B4F /* LLIntEntrypoints.h */,
		1804	0F0B839714BCF45A00885B4F /* LLIntThunks.cpp */,
		1805	0F0B839814BCF45A00885B4F /* LLIntThunks.h */,
		1806	0F4680CE14BBB3D100BFE272 /* LLIntData.cpp */,
		1807	0F4680CF14BBB3D100BFE272 /* LLIntData.h */,
		1808	0F4680C514BBB16900BFE272 /* LLIntCommon.h */,
		1809	0F4680C614BBB16900BFE272 /* LLIntOfflineAsmConfig.h */,
		1810	0F4680C714BBB16900BFE272 /* LowLevelInterpreter.cpp */,
		1811	0F4680C814BBB16900BFE272 /* LowLevelInterpreter.h */,
		1812	0F46809D14BA7F8200BFE272 /* LLIntExceptions.cpp */,
		1813	0F46809E14BA7F8200BFE272 /* LLIntExceptions.h */,
		1814	0F46809F14BA7F8200BFE272 /* LLIntHelpers.cpp */,
		1815	0F4680A014BA7F8200BFE272 /* LLIntHelpers.h */,
		1816	0F4680A114BA7F8200BFE272 /* LLIntOffsetsExtractor.cpp */,
		1817	);
		1818	name = llint;
		1819	sourceTree = "<group>";
		1820	};
1712	141211000A48772600480255 /* tests */ = {	1821	141211000A48772600480255 /* tests */ = {
1713	isa = PBXGroup;	1822	isa = PBXGroup;
1714	children = (	1823	children = (
Lines 1743-1748 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec16
1743	1429D92C0ED22D7000B89619 /* jit */ = {	1852	1429D92C0ED22D7000B89619 /* jit */ = {
1744	isa = PBXGroup;	1853	isa = PBXGroup;
1745	children = (	1854	children = (
		1855	0F4680D014BBC5F800BFE272 /* HostCallReturnValue.cpp */,
		1856	0F4680D114BBC5F800BFE272 /* HostCallReturnValue.h */,
1746	0F46807F14BA572700BFE272 /* JITExceptions.cpp */,	1857	0F46807F14BA572700BFE272 /* JITExceptions.cpp */,
1747	0F46808014BA572700BFE272 /* JITExceptions.h */,	1858	0F46808014BA572700BFE272 /* JITExceptions.h */,
1748	0FD82E37141AB14200179C94 /* CompactJITCodeMap.h */,	1859	0FD82E37141AB14200179C94 /* CompactJITCodeMap.h */,
Lines 2172-2177 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec17
2172	7EF6E0BB0EB7A1EC0079AFAF /* runtime */ = {	2283	7EF6E0BB0EB7A1EC0079AFAF /* runtime */ = {
2173	isa = PBXGroup;	2284	isa = PBXGroup;
2174	children = (	2285	children = (
		2286	0F21C27914BE727300ADC64B /* CodeSpecializationKind.h */,
		2287	0F21C27A14BE727300ADC64B /* ExecutionHarness.h */,
2175	0F15F15D14B7A73A005DE37D /* CommonSlowPaths.h */,	2288	0F15F15D14B7A73A005DE37D /* CommonSlowPaths.h */,
2176	BCF605110E203EF800B9A64D /* ArgList.cpp */,	2289	BCF605110E203EF800B9A64D /* ArgList.cpp */,
2177	BCF605120E203EF800B9A64D /* ArgList.h */,	2290	BCF605120E203EF800B9A64D /* ArgList.h */,
Lines 2531-2536 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec18
2531	969A078F0ED1D3AE00F1F681 /* bytecode */ = {	2644	969A078F0ED1D3AE00F1F681 /* bytecode */ = {
2532	isa = PBXGroup;	2645	isa = PBXGroup;
2533	children = (	2646	children = (
		2647	0F21C27E14BEAA8000ADC64B /* BytecodeConventions.h */,
		2648	0F0FC45814BD15F100B81154 /* LLIntCallLinkInfo.h */,
2534	0F93329314CA7DC10085F3C6 /* CallLinkStatus.cpp */,	2649	0F93329314CA7DC10085F3C6 /* CallLinkStatus.cpp */,
2535	0F93329414CA7DC10085F3C6 /* CallLinkStatus.h */,	2650	0F93329414CA7DC10085F3C6 /* CallLinkStatus.h */,
2536	0F93329514CA7DC10085F3C6 /* GetByIdStatus.cpp */,	2651	0F93329514CA7DC10085F3C6 /* GetByIdStatus.cpp */,
Lines 3082-3088 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec19
3082	86704B8A12DBA33700A9FE7B /* YarrPattern.h in Headers */,	3197	86704B8A12DBA33700A9FE7B /* YarrPattern.h in Headers */,
3083	86704B4312DB8A8100A9FE7B /* YarrSyntaxChecker.h in Headers */,	3198	86704B4312DB8A8100A9FE7B /* YarrSyntaxChecker.h in Headers */,
3084	0F15F15F14B7A73E005DE37D /* CommonSlowPaths.h in Headers */,	3199	0F15F15F14B7A73E005DE37D /* CommonSlowPaths.h in Headers */,
		3200	0F4680A314BA7F8D00BFE272 /* LLIntExceptions.h in Headers */,
		3201	0F4680A514BA7F8D00BFE272 /* LLIntHelpers.h in Headers */,
3085	0F46808214BA572D00BFE272 /* JITExceptions.h in Headers */,	3202	0F46808214BA572D00BFE272 /* JITExceptions.h in Headers */,
		3203	0F4680CA14BBB16C00BFE272 /* LLIntCommon.h in Headers */,
		3204	0F4680CB14BBB17200BFE272 /* LLIntOfflineAsmConfig.h in Headers */,
		3205	0F4680CD14BBB17D00BFE272 /* LowLevelInterpreter.h in Headers */,
		3206	0F4680D314BBD16700BFE272 /* LLIntData.h in Headers */,
		3207	0F4680D514BBD24B00BFE272 /* HostCallReturnValue.h in Headers */,
		3208	0F0B839B14BCF46000885B4F /* LLIntEntrypoints.h in Headers */,
		3209	0F0B839D14BCF46600885B4F /* LLIntThunks.h in Headers */,
3086	0F0B83A714BCF50700885B4F /* CodeType.h in Headers */,	3210	0F0B83A714BCF50700885B4F /* CodeType.h in Headers */,
3087	0F0B83A914BCF56200885B4F /* HandlerInfo.h in Headers */,	3211	0F0B83A914BCF56200885B4F /* HandlerInfo.h in Headers */,
3088	0F0B83AB14BCF5BB00885B4F /* ExpressionRangeInfo.h in Headers */,	3212	0F0B83AB14BCF5BB00885B4F /* ExpressionRangeInfo.h in Headers */,
Lines 3091-3097 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec20
3091	0F0B83B514BCF86200885B4F /* MethodCallLinkInfo.h in Headers */,	3215	0F0B83B514BCF86200885B4F /* MethodCallLinkInfo.h in Headers */,
3092	0F0B83B714BCF8E100885B4F /* GlobalResolveInfo.h in Headers */,	3216	0F0B83B714BCF8E100885B4F /* GlobalResolveInfo.h in Headers */,
3093	0F0B83B914BCF95F00885B4F /* CallReturnOffsetToBytecodeOffset.h in Headers */,	3217	0F0B83B914BCF95F00885B4F /* CallReturnOffsetToBytecodeOffset.h in Headers */,
		3218	0F0FC45A14BD15F500B81154 /* LLIntCallLinkInfo.h in Headers */,
3094	0F21C26814BE5F6800ADC64B /* JITDriver.h in Headers */,	3219	0F21C26814BE5F6800ADC64B /* JITDriver.h in Headers */,
		3220	0F21C27C14BE727600ADC64B /* ExecutionHarness.h in Headers */,
		3221	0F21C27D14BE727A00ADC64B /* CodeSpecializationKind.h in Headers */,
		3222	0F21C27F14BEAA8200ADC64B /* BytecodeConventions.h in Headers */,
3095	0F7B294A14C3CD29007C3DB1 /* DFGCCallHelpers.h in Headers */,	3223	0F7B294A14C3CD29007C3DB1 /* DFGCCallHelpers.h in Headers */,
3096	0F7B294B14C3CD2F007C3DB1 /* DFGCapabilities.h in Headers */,	3224	0F7B294B14C3CD2F007C3DB1 /* DFGCapabilities.h in Headers */,
3097	0F7B294C14C3CD43007C3DB1 /* DFGByteCodeCache.h in Headers */,	3225	0F7B294C14C3CD43007C3DB1 /* DFGByteCodeCache.h in Headers */,
Lines 3110-3115 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec21
3110	/* End PBXHeadersBuildPhase section */	3238	/* End PBXHeadersBuildPhase section */
3111		3239
3112	/* Begin PBXNativeTarget section */	3240	/* Begin PBXNativeTarget section */
		3241	0F46808E14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */ = {
		3242	isa = PBXNativeTarget;
		3243	buildConfigurationList = 0F46809A14BA7E5F00BFE272 /* Build configuration list for PBXNativeTarget "JSCLLIntOffsetsExtractor" */;
		3244	buildPhases = (
		3245	0F46808B14BA7E5E00BFE272 /* Sources */,
		3246	0F46808C14BA7E5E00BFE272 /* Frameworks */,
		3247	0F46808D14BA7E5E00BFE272 /* CopyFiles */,
		3248	);
		3249	buildRules = (
		3250	);
		3251	dependencies = (
		3252	0F4680B214BA811500BFE272 /* PBXTargetDependency */,
		3253	);
		3254	name = JSCLLIntOffsetsExtractor;
		3255	productName = JSCLLIntOffsetsExtractor;
		3256	productReference = 0F46808F14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */;
		3257	productType = "com.apple.product-type.tool";
		3258	};
3113	1412111F0A48793C00480255 /* minidom */ = {	3259	1412111F0A48793C00480255 /* minidom */ = {
3114	isa = PBXNativeTarget;	3260	isa = PBXNativeTarget;
3115	buildConfigurationList = 141211390A48798400480255 /* Build configuration list for PBXNativeTarget "minidom" */;	3261	buildConfigurationList = 141211390A48798400480255 /* Build configuration list for PBXNativeTarget "minidom" */;
Lines 3236-3246 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec22
3236	14BD59BE0A3E8F9000BAF59C /* testapi */,	3382	14BD59BE0A3E8F9000BAF59C /* testapi */,
3237	932F5BDA0822A1C700736975 /* jsc */,	3383	932F5BDA0822A1C700736975 /* jsc */,
3238	651122F714046A4C002B101D /* testRegExp */,	3384	651122F714046A4C002B101D /* testRegExp */,
		3385	0F46808E14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */,
		3386	0F4680A914BA7FD900BFE272 /* LLInt Offsets */,
3239	);	3387	);
3240	};	3388	};
3241	/* End PBXProject section */	3389	/* End PBXProject section */
3242		3390
3243	/* Begin PBXShellScriptBuildPhase section */	3391	/* Begin PBXShellScriptBuildPhase section */
		3392	0F4680AA14BA7FD900BFE272 /* Generate Derived Sources */ = {
		3393	isa = PBXShellScriptBuildPhase;
		3394	buildActionMask = 2147483647;
		3395	files = (
		3396	);
		3397	inputPaths = (
		3398	"$(SRCROOT)/llint/LowLevelAssembler.asm",
		3399	);
		3400	name = "Generate Derived Sources";
		3401	outputPaths = (
		3402	"$(BUILT_PRODUCTS_DIR)/LLIntOffsets/LLIntDesiredOffsets.h",
		3403	);
		3404	runOnlyForDeploymentPostprocessing = 0;
		3405	shellPath = /bin/sh;
		3406	shellScript = "mkdir -p \"${BUILT_PRODUCTS_DIR}/LLIntOffsets/\"\n\n/usr/bin/env ruby \"${SRCROOT}/offlineasm/generate_offset_extractor.rb\" \"${SRCROOT}/llint/LowLevelInterpreter.asm\" \"${BUILT_PRODUCTS_DIR}/LLIntOffsets/LLIntDesiredOffsets.h\"\n";
		3407	};
3244	3713F014142905240036387F /* Check For Inappropriate Objective-C Class Names */ = {	3408	3713F014142905240036387F /* Check For Inappropriate Objective-C Class Names */ = {
3245	isa = PBXShellScriptBuildPhase;	3409	isa = PBXShellScriptBuildPhase;
3246	buildActionMask = 2147483647;	3410	buildActionMask = 2147483647;
Lines 3346-3352 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec23
3346	);	3510	);
3347	runOnlyForDeploymentPostprocessing = 0;	3511	runOnlyForDeploymentPostprocessing = 0;
3348	shellPath = /bin/sh;	3512	shellPath = /bin/sh;
3349	shellScript = "mkdir -p \"${BUILT_PRODUCTS_DIR}/DerivedSources/JavaScriptCore/docs\"\ncd \"${BUILT_PRODUCTS_DIR}/DerivedSources/JavaScriptCore\"\n\n/bin/ln -sfh \"${SRCROOT}\" JavaScriptCore\nexport JavaScriptCore=\"JavaScriptCore\"\nexport BUILT_PRODUCTS_DIR=\"../..\"\n\nmake --no-builtin-rules -f \"JavaScriptCore/DerivedSources.make\" -j `/usr/sbin/sysctl -n hw.ncpu`\n";	3513	shellScript = "mkdir -p \"${BUILT_PRODUCTS_DIR}/DerivedSources/JavaScriptCore/docs\"\ncd \"${BUILT_PRODUCTS_DIR}/DerivedSources/JavaScriptCore\"\n\n/bin/ln -sfh \"${SRCROOT}\" JavaScriptCore\nexport JavaScriptCore=\"JavaScriptCore\"\nexport BUILT_PRODUCTS_DIR=\"../..\"\n\nmake --no-builtin-rules -f \"JavaScriptCore/DerivedSources.make\" -j `/usr/sbin/sysctl -n hw.ncpu`\n\n/usr/bin/env ruby JavaScriptCore/offlineasm/asm.rb JavaScriptCore/llint/LowLevelInterpreter.asm ${BUILT_PRODUCTS_DIR}/JSCLLIntOffsetsExtractor LLIntAssembly.h\n";
3350	};	3514	};
3351	9319586B09D9F91A00A56FD4 /* Check For Global Initializers */ = {	3515	9319586B09D9F91A00A56FD4 /* Check For Global Initializers */ = {
3352	isa = PBXShellScriptBuildPhase;	3516	isa = PBXShellScriptBuildPhase;
Lines 3381-3386 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec24
3381	/* End PBXShellScriptBuildPhase section */	3545	/* End PBXShellScriptBuildPhase section */
3382		3546
3383	/* Begin PBXSourcesBuildPhase section */	3547	/* Begin PBXSourcesBuildPhase section */
		3548	0F46808B14BA7E5E00BFE272 /* Sources */ = {
		3549	isa = PBXSourcesBuildPhase;
		3550	buildActionMask = 2147483647;
		3551	files = (
		3552	0F4680A714BA7FA100BFE272 /* LLIntOffsetsExtractor.cpp in Sources */,
		3553	);
		3554	runOnlyForDeploymentPostprocessing = 0;
		3555	};
3384	1412111D0A48793C00480255 /* Sources */ = {	3556	1412111D0A48793C00480255 /* Sources */ = {
3385	isa = PBXSourcesBuildPhase;	3557	isa = PBXSourcesBuildPhase;
3386	buildActionMask = 2147483647;	3558	buildActionMask = 2147483647;
Lines 3639-3645 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec25
3639	86704B8612DBA33700A9FE7B /* YarrJIT.cpp in Sources */,	3811	86704B8612DBA33700A9FE7B /* YarrJIT.cpp in Sources */,
3640	86704B8912DBA33700A9FE7B /* YarrPattern.cpp in Sources */,	3812	86704B8912DBA33700A9FE7B /* YarrPattern.cpp in Sources */,
3641	86704B4212DB8A8100A9FE7B /* YarrSyntaxChecker.cpp in Sources */,	3813	86704B4212DB8A8100A9FE7B /* YarrSyntaxChecker.cpp in Sources */,
		3814	0F4680A414BA7F8D00BFE272 /* LLIntHelpers.cpp in Sources */,
		3815	0F4680A814BA7FAB00BFE272 /* LLIntExceptions.cpp in Sources */,
3642	0F46808314BA573100BFE272 /* JITExceptions.cpp in Sources */,	3816	0F46808314BA573100BFE272 /* JITExceptions.cpp in Sources */,
		3817	0F4680CC14BBB17A00BFE272 /* LowLevelInterpreter.cpp in Sources */,
		3818	0F4680D214BBD16500BFE272 /* LLIntData.cpp in Sources */,
		3819	0F4680D414BBD24900BFE272 /* HostCallReturnValue.cpp in Sources */,
		3820	0F0B839A14BCF45D00885B4F /* LLIntEntrypoints.cpp in Sources */,
		3821	0F0B839C14BCF46300885B4F /* LLIntThunks.cpp in Sources */,
3643	0F0B83B014BCF71600885B4F /* CallLinkInfo.cpp in Sources */,	3822	0F0B83B014BCF71600885B4F /* CallLinkInfo.cpp in Sources */,
3644	0F0B83B414BCF86000885B4F /* MethodCallLinkInfo.cpp in Sources */,	3823	0F0B83B414BCF86000885B4F /* MethodCallLinkInfo.cpp in Sources */,
3645	F69E86C314C6E551002C2C62 /* NumberOfCores.cpp in Sources */,	3824	F69E86C314C6E551002C2C62 /* NumberOfCores.cpp in Sources */,
Lines 3662-3667 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec26
3662	/* End PBXSourcesBuildPhase section */	3841	/* End PBXSourcesBuildPhase section */
3663		3842
3664	/* Begin PBXTargetDependency section */	3843	/* Begin PBXTargetDependency section */
		3844	0F4680B214BA811500BFE272 /* PBXTargetDependency */ = {
		3845	isa = PBXTargetDependency;
		3846	target = 0F4680A914BA7FD900BFE272 /* LLInt Offsets */;
		3847	targetProxy = 0F4680B114BA811500BFE272 /* PBXContainerItemProxy */;
		3848	};
		3849	0F4680B414BA821400BFE272 /* PBXTargetDependency */ = {
		3850	isa = PBXTargetDependency;
		3851	target = 0F46808E14BA7E5E00BFE272 /* JSCLLIntOffsetsExtractor */;
		3852	targetProxy = 0F4680B314BA821400BFE272 /* PBXContainerItemProxy */;
		3853	};
3665	141214BF0A49190E00480255 /* PBXTargetDependency */ = {	3854	141214BF0A49190E00480255 /* PBXTargetDependency */ = {
3666	isa = PBXTargetDependency;	3855	isa = PBXTargetDependency;
3667	target = 1412111F0A48793C00480255 /* minidom */;	3856	target = 1412111F0A48793C00480255 /* minidom */;
Lines 3695-3700 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec27
3695	/* End PBXTargetDependency section */	3884	/* End PBXTargetDependency section */
3696		3885
3697	/* Begin XCBuildConfiguration section */	3886	/* Begin XCBuildConfiguration section */
		3887	0F46809614BA7E5E00BFE272 /* Debug */ = {
		3888	isa = XCBuildConfiguration;
		3889	buildSettings = {
		3890	ALWAYS_SEARCH_USER_PATHS = NO;
		3891	ARCHS = "$(ARCHS_STANDARD_64_BIT)";
		3892	COPY_PHASE_STRIP = NO;
		3893	GCC_C_LANGUAGE_STANDARD = gnu99;
		3894	GCC_DYNAMIC_NO_PIC = NO;
		3895	GCC_ENABLE_OBJC_EXCEPTIONS = YES;
		3896	GCC_OPTIMIZATION_LEVEL = 0;
		3897	GCC_PREPROCESSOR_DEFINITIONS = (
		3898	"DEBUG=1",
		3899	"$(inherited)",
		3900	);
		3901	GCC_SYMBOLS_PRIVATE_EXTERN = NO;
		3902	GCC_VERSION = com.apple.compilers.llvm.clang.1_0;
		3903	GCC_WARN_64_TO_32_BIT_CONVERSION = NO;
		3904	GCC_WARN_ABOUT_MISSING_PROTOTYPES = YES;
		3905	GCC_WARN_ABOUT_RETURN_TYPE = YES;
		3906	GCC_WARN_UNUSED_VARIABLE = YES;
		3907	"HEADER_SEARCH_PATHS[arch=*]" = (
		3908	.,
		3909	icu,
		3910	"$(BUILT_PRODUCTS_DIR)/LLIntOffsets",
		3911	"$(HEADER_SEARCH_PATHS)",
		3912	);
		3913	MACOSX_DEPLOYMENT_TARGET = 10.7;
		3914	ONLY_ACTIVE_ARCH = YES;
		3915	PRODUCT_NAME = "$(TARGET_NAME)";
		3916	SDKROOT = macosx;
		3917	USER_HEADER_SEARCH_PATHS = ". icu $(BUILT_PRODUCTS_DIR)/LLIntOffsets $(HEADER_SEARCH_PATHS)";
		3918	};
		3919	name = Debug;
		3920	};
		3921	0F46809714BA7E5E00BFE272 /* Release */ = {
		3922	isa = XCBuildConfiguration;
		3923	buildSettings = {
		3924	ALWAYS_SEARCH_USER_PATHS = NO;
		3925	ARCHS = "$(ARCHS_STANDARD_64_BIT)";
		3926	COPY_PHASE_STRIP = YES;
		3927	DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
		3928	GCC_C_LANGUAGE_STANDARD = gnu99;
		3929	GCC_ENABLE_OBJC_EXCEPTIONS = YES;
		3930	GCC_VERSION = com.apple.compilers.llvm.clang.1_0;
		3931	GCC_WARN_64_TO_32_BIT_CONVERSION = NO;
		3932	GCC_WARN_ABOUT_MISSING_PROTOTYPES = YES;
		3933	GCC_WARN_ABOUT_RETURN_TYPE = YES;
		3934	GCC_WARN_UNUSED_VARIABLE = YES;
		3935	"HEADER_SEARCH_PATHS[arch=*]" = (
		3936	.,
		3937	icu,
		3938	"$(BUILT_PRODUCTS_DIR)/LLIntOffsets$(HEADER_SEARCH_PATHS)",
		3939	);
		3940	MACOSX_DEPLOYMENT_TARGET = 10.7;
		3941	PRODUCT_NAME = "$(TARGET_NAME)";
		3942	SDKROOT = macosx;
		3943	USER_HEADER_SEARCH_PATHS = ". icu $(BUILT_PRODUCTS_DIR)/LLIntOffsets $(HEADER_SEARCH_PATHS)";
		3944	};
		3945	name = Release;
		3946	};
		3947	0F46809814BA7E5E00BFE272 /* Profiling */ = {
		3948	isa = XCBuildConfiguration;
		3949	buildSettings = {
		3950	ALWAYS_SEARCH_USER_PATHS = NO;
3951	ARCHS = "$(ARCHS_STANDARD_64_BIT)";
3952	COPY_PHASE_STRIP = YES;
3953	DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
3954	GCC_C_LANGUAGE_STANDARD = gnu99;
3955	GCC_ENABLE_OBJC_EXCEPTIONS = YES;
3956	GCC_VERSION = com.apple.compilers.llvm.clang.1_0;
3957	GCC_WARN_64_TO_32_BIT_CONVERSION = NO;
3958	GCC_WARN_ABOUT_MISSING_PROTOTYPES = YES;
3959	GCC_WARN_ABOUT_RETURN_TYPE = YES;
3960	GCC_WARN_UNUSED_VARIABLE = YES;
3961	"HEADER_SEARCH_PATHS[arch=*]" = (
3962	.,
3963	icu,
3964	"$(BUILT_PRODUCTS_DIR)/LLIntOffsets",
3965	"$(HEADER_SEARCH_PATHS)",
3966	);
3967	MACOSX_DEPLOYMENT_TARGET = 10.7;
3968	PRODUCT_NAME = "$(TARGET_NAME)";
3969	SDKROOT = macosx;
3970	USER_HEADER_SEARCH_PATHS = ". icu $(BUILT_PRODUCTS_DIR)/LLIntOffsets $(HEADER_SEARCH_PATHS)";
3971	};
3972	name = Profiling;
3973	};
3974	0F46809914BA7E5E00BFE272 /* Production */ = {
3975	isa = XCBuildConfiguration;
3976	buildSettings = {
3977	ALWAYS_SEARCH_USER_PATHS = NO;
3978	ARCHS = "$(ARCHS_STANDARD_64_BIT)";
3979	COPY_PHASE_STRIP = YES;
3980	DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
3981	GCC_C_LANGUAGE_STANDARD = gnu99;
3982	GCC_ENABLE_OBJC_EXCEPTIONS = YES;
3983	GCC_VERSION = com.apple.compilers.llvm.clang.1_0;
3984	GCC_WARN_64_TO_32_BIT_CONVERSION = NO;
3985	GCC_WARN_ABOUT_MISSING_PROTOTYPES = YES;
3986	GCC_WARN_ABOUT_RETURN_TYPE = YES;
3987	GCC_WARN_UNUSED_VARIABLE = YES;
3988	"HEADER_SEARCH_PATHS[arch=*]" = (
3989	.,
3990	icu,
3991	"$(BUILT_PRODUCTS_DIR)/LLIntOffsets",
3992	"$(HEADER_SEARCH_PATHS)",
3993	);
3994	MACOSX_DEPLOYMENT_TARGET = 10.7;
3995	PRODUCT_NAME = "$(TARGET_NAME)";
3996	SDKROOT = macosx;
3997	USER_HEADER_SEARCH_PATHS = ". icu $(BUILT_PRODUCTS_DIR)/LLIntOffsets $(HEADER_SEARCH_PATHS)";
3998	};
3999	name = Production;
4000	};
4001	0F4680AD14BA7FD900BFE272 /* Debug */ = {
4002	isa = XCBuildConfiguration;
4003	buildSettings = {
4004	PRODUCT_NAME = "Derived Sources copy";
4005	};
4006	name = Debug;
4007	};
4008	0F4680AE14BA7FD900BFE272 /* Release */ = {
4009	isa = XCBuildConfiguration;
4010	buildSettings = {
4011	PRODUCT_NAME = "Derived Sources copy";
4012	};
4013	name = Release;
4014	};
4015	0F4680AF14BA7FD900BFE272 /* Profiling */ = {
4016	isa = XCBuildConfiguration;
4017	buildSettings = {
4018	PRODUCT_NAME = "Derived Sources copy";
4019	};
4020	name = Profiling;
4021	};
4022	0F4680B014BA7FD900BFE272 /* Production */ = {
4023	isa = XCBuildConfiguration;
4024	buildSettings = {
4025	PRODUCT_NAME = "Derived Sources copy";
4026	};
4027	name = Production;
4028	};
3698	1412113A0A48798400480255 /* Debug */ = {	4029	1412113A0A48798400480255 /* Debug */ = {
3699	isa = XCBuildConfiguration;	4030	isa = XCBuildConfiguration;
3700	buildSettings = {	4031	buildSettings = {
Lines 3936-3941 Source/JavaScriptCore/JavaScriptCore.xcodeproj/project.pbxproj_sec28
3936	/* End XCBuildConfiguration section */	4267	/* End XCBuildConfiguration section */
3937		4268
3938	/* Begin XCConfigurationList section */	4269	/* Begin XCConfigurationList section */
		4270	0F46809A14BA7E5F00BFE272 /* Build configuration list for PBXNativeTarget "JSCLLIntOffsetsExtractor" */ = {
		4271	isa = XCConfigurationList;
		4272	buildConfigurations = (
		4273	0F46809614BA7E5E00BFE272 /* Debug */,
		4274	0F46809714BA7E5E00BFE272 /* Release */,
		4275	0F46809814BA7E5E00BFE272 /* Profiling */,
		4276	0F46809914BA7E5E00BFE272 /* Production */,
		4277	);
		4278	defaultConfigurationIsVisible = 0;
		4279	defaultConfigurationName = Production;
		4280	};
		4281	0F4680AC14BA7FD900BFE272 /* Build configuration list for PBXAggregateTarget "LLInt Offsets" */ = {
		4282	isa = XCConfigurationList;
		4283	buildConfigurations = (
		4284	0F4680AD14BA7FD900BFE272 /* Debug */,
		4285	0F4680AE14BA7FD900BFE272 /* Release */,
		4286	0F4680AF14BA7FD900BFE272 /* Profiling */,
		4287	0F4680B014BA7FD900BFE272 /* Production */,
		4288	);
		4289	defaultConfigurationIsVisible = 0;
		4290	defaultConfigurationName = Production;
		4291	};
3939	141211390A48798400480255 /* Build configuration list for PBXNativeTarget "minidom" */ = {	4292	141211390A48798400480255 /* Build configuration list for PBXNativeTarget "minidom" */ = {
3940	isa = XCConfigurationList;	4293	isa = XCConfigurationList;
3941	buildConfigurations = (	4294	buildConfigurations = (

Lines 34-40 Source/JavaScriptCore/assembler/LinkBuffer.h_sec1
- Source/JavaScriptCore/assembler/LinkBuffer.h -1 / +1 lines
34	#define GLOBAL_THUNK_ID reinterpret_cast<void*>(static_cast<intptr_t>(-1))	34	#define GLOBAL_THUNK_ID reinterpret_cast<void*>(static_cast<intptr_t>(-1))
35	#define REGEXP_CODE_ID reinterpret_cast<void*>(static_cast<intptr_t>(-2))	35	#define REGEXP_CODE_ID reinterpret_cast<void*>(static_cast<intptr_t>(-2))
36		36
37	#include <MacroAssembler.h>	37	#include "MacroAssembler.h"
38	#include <wtf/Noncopyable.h>	38	#include <wtf/Noncopyable.h>
39		39
40	namespace JSC {	40	namespace JSC {



/*
 * Copyright (C) 2012 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 BytecodeConventions_h
#define BytecodeConventions_h

// Register numbers used in bytecode operations have different meaning according to their ranges:
//      0x80000000-0xFFFFFFFF  Negative indices from the CallFrame pointer are entries in the call frame, see RegisterFile.h.
//      0x00000000-0x3FFFFFFF  Forwards indices from the CallFrame pointer are local vars and temporaries with the function's callframe.
//      0x40000000-0x7FFFFFFF  Positive indices from 0x40000000 specify entries in the constant pool on the CodeBlock.
static const int FirstConstantRegisterIndex = 0x40000000;

#endif // BytecodeConventions_h




#include "CallLinkStatus.h"

#include "CodeBlock.h"
#include "LLIntCallLinkInfo.h"

namespace JSC {

CallLinkStatus CallLinkStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
#if ENABLE(LLINT)
    Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;
    LLIntCallLinkInfo* callLinkInfo = instruction[4].u.callLinkInfo;
    
    return CallLinkStatus(callLinkInfo->lastSeenCallee.get(), false);
#else
    return CallLinkStatus(0, false);
#endif
}

CallLinkStatus CallLinkStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
    if (!profiledBlock->numberOfCallLinkInfos())
        return computeFromLLInt(profiledBlock, bytecodeIndex);
    
    if (profiledBlock->couldTakeSlowCase(bytecodeIndex))
        return CallLinkStatus(0, true);
    
    JSFunction* target = profiledBlock->getCallLinkInfo(bytecodeIndex).lastSeenCallee.get();
    if (!target)
        return computeFromLLInt(profiledBlock, bytecodeIndex);
    
    return CallLinkStatus(target, false);
#else
    return CallLinkStatus(0, false);
#endif



    
    static CallLinkStatus computeFor(CodeBlock*, unsigned bytecodeIndex);
    
    bool isSet() const { return !!m_callTarget || m_couldTakeSlowPath; }
    
    bool operator!() const { return !isSet(); }
    
    bool couldTakeSlowPath() const { return m_couldTakeSlowPath; }
    
    JSFunction* callTarget() const { return m_callTarget; }
    
private:
    static CallLinkStatus computeFromLLInt(CodeBlock*, unsigned bytecodeIndex);
    
    JSFunction* m_callTarget;
    bool m_couldTakeSlowPath;
};



#include "JSFunction.h"
#include "JSStaticScopeObject.h"
#include "JSValue.h"
#include "LowLevelInterpreter.h"
#include "RepatchBuffer.h"
#include "UStringConcatenate.h"
#include <stdio.h>

using namespace DFG;
#endif

#if !defined(NDEBUG) || ENABLE(OPCODE_SAMPLING)

static UString escapeQuotes(const UString& str)
{
    UString result = str;

    for (size_t i = 0; i < instructions().size(); i += opcodeLengths[exec->interpreter()->getOpcodeID(instructions()[i].u.opcode)])
        ++instructionCount;

    printf("%lu m_instructions; %lu bytes at %p; %d parameter(s); %d callee register(s); %d variable(s)\n\n",
        static_cast<unsigned long>(instructionCount),
        static_cast<unsigned long>(instructions().size() * sizeof(Instruction)),
        this, m_numParameters, m_numCalleeRegisters, m_numVars);

    Vector<Instruction>::const_iterator begin = instructions().begin();
    Vector<Instruction>::const_iterator end = instructions().end();

            printPutByIdOp(exec, location, it, "put_by_id_transition");
            break;
        }
        case op_put_by_id_transition_direct: {
            printPutByIdOp(exec, location, it, "put_by_id_transition_direct");
            break;
        }
        case op_put_by_id_transition_normal: {
            printPutByIdOp(exec, location, it, "put_by_id_transition_normal");
            break;
        }
        case op_put_by_id_generic: {
            printPutByIdOp(exec, location, it, "put_by_id_generic");
            break;

    }
}

#endif // !defined(NDEBUG) || ENABLE(OPCODE_SAMPLING)

#if DUMP_CODE_BLOCK_STATISTICS
static HashSet<CodeBlock*> liveCodeBlockSet;
#endif

{
    setNumParameters(other.numParameters());
    optimizeAfterWarmUp();
    jitAfterWarmUp();
    
    if (other.m_rareData) {
        createRareDataIfNecessary();

    ASSERT(m_source);
    
    optimizeAfterWarmUp();
    jitAfterWarmUp();

#if DUMP_CODE_BLOCK_STATISTICS
    liveCodeBlockSet.add(this);

#if ENABLE(VERBOSE_VALUE_PROFILE)
    dumpValueProfiles();
#endif

#if ENABLE(LLINT)    
    while (m_incomingLLIntCalls.begin() != m_incomingLLIntCalls.end())
        m_incomingLLIntCalls.begin()->remove();
#endif // ENABLE(LLINT)
#if ENABLE(JIT)
    // We may be destroyed before any CodeBlocks that refer to us are destroyed.
    // Consider that two CodeBlocks become unreachable at the same time. There

#else
    static const bool verboseUnlinking = false;
#endif
#endif // ENABLE(JIT)
    
#if ENABLE(LLINT)
    Interpreter* interpreter = m_globalData->interpreter;
    // interpreter->enabled() returns true if the old C++ interpreter is enabled. If that's enabled
    // then we're not using LLInt.
    if (!interpreter->enabled()) {
        for (size_t size = m_propertyAccessInstructions.size(), i = 0; i < size; ++i) {
            Instruction* curInstruction = &instructions()[m_propertyAccessInstructions[i]];
            switch (interpreter->getOpcodeID(curInstruction[0].u.opcode)) {
            case op_get_by_id:
            case op_put_by_id:
                if (!curInstruction[4].u.structure || Heap::isMarked(curInstruction[4].u.structure.get()))
                    break;
                curInstruction[4].u.structure.clear();
                curInstruction[5].u.operand = 0;
                break;
            case op_put_by_id_transition_direct:
            case op_put_by_id_transition_normal:
                if (Heap::isMarked(curInstruction[4].u.structure.get())
                    && Heap::isMarked(curInstruction[6].u.structure.get())
                    && Heap::isMarked(curInstruction[7].u.structureChain.get()))
                    break;
                curInstruction[4].u.structure.clear();
                curInstruction[6].u.structure.clear();
                curInstruction[7].u.structureChain.clear();
                curInstruction[0].u.opcode = interpreter->getOpcode(op_put_by_id);
                break;
            default:
                ASSERT_NOT_REACHED();
            }
        }
        for (size_t size = m_globalResolveInstructions.size(), i = 0; i < size; ++i) {
            Instruction* curInstruction = &instructions()[m_globalResolveInstructions[i]];
            ASSERT(interpreter->getOpcodeID(curInstruction[0].u.opcode) == op_resolve_global
                   || interpreter->getOpcodeID(curInstruction[0].u.opcode) == op_resolve_global_dynamic);
            if (!curInstruction[3].u.structure || Heap::isMarked(curInstruction[3].u.structure.get()))
                continue;
            curInstruction[3].u.structure.clear();
            curInstruction[4].u.operand = 0;
        }
        for (unsigned i = 0; i < m_llintCallLinkInfos.size(); ++i) {
            if (m_llintCallLinkInfos[i].isLinked() && !Heap::isMarked(m_llintCallLinkInfos[i].callee.get())) {
                if (verboseUnlinking)
                    printf("Clearing LLInt call from %p.\n", this);
                m_llintCallLinkInfos[i].unlink();
            }
            if (!!m_llintCallLinkInfos[i].lastSeenCallee && !Heap::isMarked(m_llintCallLinkInfos[i].lastSeenCallee.get()))
                m_llintCallLinkInfos[i].lastSeenCallee.clear();
        }
    }
#endif // ENABLE(LLINT)

#if ENABLE(DFG_JIT)
    // Check if we're not live. If we are, then jettison.
    if (!(shouldImmediatelyAssumeLivenessDuringScan() || m_dfgData->livenessHasBeenProved)) {

    for (size_t i = 0; i < m_functionDecls.size(); ++i)
        visitor.append(&m_functionDecls[i]);
#if ENABLE(INTERPRETER)
    if (m_globalData->interpreter->enabled()) {
        for (size_t size = m_propertyAccessInstructions.size(), i = 0; i < size; ++i)
            visitStructures(visitor, &instructions()[m_propertyAccessInstructions[i]]);
        for (size_t size = m_globalResolveInstructions.size(), i = 0; i < size; ++i)
            visitStructures(visitor, &instructions()[m_globalResolveInstructions[i]]);
    }
#endif

#if ENABLE(DFG_JIT)

{
    if (!!m_alternative)
        m_alternative->unlinkCalls();
#if ENABLE(LLINT)
    for (size_t i = 0; i < m_llintCallLinkInfos.size(); ++i) {
        if (m_llintCallLinkInfos[i].isLinked())
            m_llintCallLinkInfos[i].unlink();
    }
#endif
    if (!(m_callLinkInfos.size() || m_methodCallLinkInfos.size()))
        return;
    if (!m_globalData->canUseJIT())


void CodeBlock::unlinkIncomingCalls()
{
#if ENABLE(LLINT)
    while (m_incomingLLIntCalls.begin() != m_incomingLLIntCalls.end())
        m_incomingLLIntCalls.begin()->unlink();
#endif
    if (m_incomingCalls.isEmpty())
        return;
    RepatchBuffer repatchBuffer(this);
    while (m_incomingCalls.begin() != m_incomingCalls.end())
        m_incomingCalls.begin()->unlink(*m_globalData, repatchBuffer);
}

unsigned CodeBlock::bytecodeOffset(ExecState* exec, ReturnAddressPtr returnAddress)
{
#if ENABLE(LLINT)
    if (returnAddress.value() >= bitwise_cast<void*>(&llint_begin)
        && returnAddress.value() <= bitwise_cast<void*>(&llint_end)) {
        ASSERT(exec->codeBlock());
        ASSERT(exec->codeBlock() == this);
        ASSERT(JITCode::isBaselineCode(getJITType()));
        Instruction* instruction = exec->currentVPC();
        ASSERT(instruction);
        return bytecodeOffset(instruction);
    }
#else
    UNUSED_PARAM(exec);
#endif
    if (!m_rareData)
        return 1;
    Vector<CallReturnOffsetToBytecodeOffset>& callIndices = m_rareData->m_callReturnIndexVector;
    if (!callIndices.size())
        return 1;
    return binarySearch<CallReturnOffsetToBytecodeOffset, unsigned, getCallReturnOffset>(callIndices.begin(), callIndices.size(), getJITCode().offsetOf(returnAddress.value()))->bytecodeOffset;
}
#endif

void CodeBlock::clearEvalCache()


void ProgramCodeBlock::jettison()
{
    ASSERT(JITCode::isOptimizingJIT(getJITType()));
    ASSERT(this == replacement());
    static_cast<ProgramExecutable*>(ownerExecutable())->jettisonOptimizedCode(*globalData());
}

void EvalCodeBlock::jettison()
{
    ASSERT(JITCode::isOptimizingJIT(getJITType()));
    ASSERT(this == replacement());
    static_cast<EvalExecutable*>(ownerExecutable())->jettisonOptimizedCode(*globalData());
}

void FunctionCodeBlock::jettison()
{
    ASSERT(JITCode::isOptimizingJIT(getJITType()));
    ASSERT(this == replacement());
    static_cast<FunctionExecutable*>(ownerExecutable())->jettisonOptimizedCodeFor(*globalData(), m_isConstructor ? CodeForConstruct : CodeForCall);
}

void ProgramCodeBlock::jitCompileImpl(JSGlobalData& globalData)
{
    ASSERT(getJITType() == JITCode::InterpreterThunk);
    ASSERT(this == replacement());
    return static_cast<ProgramExecutable*>(ownerExecutable())->jitCompile(globalData);
}

void EvalCodeBlock::jitCompileImpl(JSGlobalData& globalData)
{
    ASSERT(getJITType() == JITCode::InterpreterThunk);
    ASSERT(this == replacement());
    return static_cast<EvalExecutable*>(ownerExecutable())->jitCompile(globalData);
}

void FunctionCodeBlock::jitCompileImpl(JSGlobalData& globalData)
{
    ASSERT(getJITType() == JITCode::InterpreterThunk);
    ASSERT(this == replacement());
    return static_cast<FunctionExecutable*>(ownerExecutable())->jitCompileFor(globalData, m_isConstructor ? CodeForConstruct : CodeForCall);
}
#endif

#if ENABLE(VALUE_PROFILER)

}
#endif

void CodeBlock::handleBytecodeDiscardingOpportunity()
{
#if !ENABLE(OPCODE_SAMPLING) && !ENABLE(LLINT)
    if (BytecodeGenerator::dumpsGeneratedCode())
        return;
    if (!!alternative())
        discardBytecode();
    else
        discardBytecodeLater();
#endif
}

#ifndef NDEBUG
bool CodeBlock::usesOpcode(OpcodeID opcodeID)
{



#ifndef CodeBlock_h
#define CodeBlock_h

#include "BytecodeConventions.h"
#include "CallLinkInfo.h"
#include "CallReturnOffsetToBytecodeOffset.h"
#include "CodeOrigin.h"

#include "JITWriteBarrier.h"
#include "JSGlobalObject.h"
#include "JumpTable.h"
#include "LLIntCallLinkInfo.h"
#include "LineInfo.h"
#include "Nodes.h"
#include "PredictionTracker.h"

#include <wtf/Vector.h>
#include "StructureStubInfo.h"

// Register numbers used in bytecode operations have different meaning according to their ranges:
//      0x80000000-0xFFFFFFFF  Negative indices from the CallFrame pointer are entries in the call frame, see RegisterFile.h.
//      0x00000000-0x3FFFFFFF  Forwards indices from the CallFrame pointer are local vars and temporaries with the function's callframe.
//      0x40000000-0x7FFFFFFF  Positive indices from 0x40000000 specify entries in the constant pool on the CodeBlock.
static const int FirstConstantRegisterIndex = 0x40000000;

namespace JSC {

    class ExecState;
    class DFGCodeBlocks;
    class ExecState;
    class LLIntOffsetsExtractor;

    inline int unmodifiedArgumentsRegister(int argumentsRegister) { return argumentsRegister - 1; }


    class CodeBlock : public UnconditionalFinalizer, public WeakReferenceHarvester {
        WTF_MAKE_FAST_ALLOCATED;
        friend class JIT;
        friend class LLIntOffsetsExtractor;
    public:
        enum CopyParsedBlockTag { CopyParsedBlock };
    protected:

            while (result->alternative())
                result = result->alternative();
            ASSERT(result);
            ASSERT(JITCode::isBaselineCode(result->getJITType()));
            return result;
        }
#endif


        static void dumpStatistics();

#if !defined(NDEBUG) || ENABLE_OPCODE_SAMPLING
        void dump(ExecState*) const;
        void printStructures(const Instruction*) const;
        void printStructure(const char* name, const Instruction*, int operand) const;
#endif

        bool isStrictMode() const { return m_isStrictMode; }


            return *(binarySearch<MethodCallLinkInfo, unsigned, getMethodCallLinkInfoBytecodeIndex>(m_methodCallLinkInfos.begin(), m_methodCallLinkInfos.size(), bytecodeIndex));
        }

        unsigned bytecodeOffset(ExecState*, ReturnAddressPtr);
        {
            if (!m_rareData)
                return 1;
            Vector<CallReturnOffsetToBytecodeOffset>& callIndices = m_rareData->m_callReturnIndexVector;
            if (!callIndices.size())
                return 1;
            return binarySearch<CallReturnOffsetToBytecodeOffset, unsigned, getCallReturnOffset>(callIndices.begin(), callIndices.size(), getJITCode().offsetOf(returnAddress.value()))->bytecodeOffset;
        }

        unsigned bytecodeOffsetForCallAtIndex(unsigned index)
        {

        {
            m_incomingCalls.push(incoming);
        }
#if ENABLE(LLINT)
        void linkIncomingCall(LLIntCallLinkInfo* incoming)
        {
            m_incomingLLIntCalls.push(incoming);
        }
#endif // ENABLE(LLINT)
        
        void unlinkIncomingCalls();
#endif // ENABLE(JIT)

#if ENABLE(DFG_JIT) || ENABLE(LLINT)
        void setJITCodeMap(PassOwnPtr<CompactJITCodeMap> jitCodeMap)
        {
            m_jitCodeMap = jitCodeMap;

        {
            return m_jitCodeMap.get();
        }
#endif
        
#if ENABLE(DFG_JIT)
        void createDFGDataIfNecessary()
        {
            if (!!m_dfgData)

        }
#endif

#if ENABLE(INTERPRETER)
        unsigned bytecodeOffset(Instruction* returnAddress)
        {
            ASSERT(returnAddress >= instructions().begin() && returnAddress < instructions().end());
            return static_cast<Instruction*>(returnAddress) - instructions().begin();
        }
#endif

        void setIsNumericCompareFunction(bool isNumericCompareFunction) { m_isNumericCompareFunction = isNumericCompareFunction; }
        bool isNumericCompareFunction() { return m_isNumericCompareFunction; }

        {
            m_shouldDiscardBytecode = true;
        }
        void handleBytecodeDiscardingOpportunity();
        {
            if (!!alternative())
                discardBytecode();
            else
                discardBytecodeLater();
        }
        
#ifndef NDEBUG
        bool usesOpcode(OpcodeID);
#endif

        unsigned instructionCount() { return m_instructionCount; }
        void setInstructionCount(unsigned instructionCount) { m_instructionCount = instructionCount; }

        ExecutableMemoryHandle* executableMemory() { return getJITCode().getExecutableMemory(); }
        virtual JSObject* compileOptimized(ExecState*, ScopeChainNode*) = 0;
        virtual void jettison() = 0;
        bool jitCompile(JSGlobalData& globalData)
        {
            if (getJITType() != JITCode::InterpreterThunk) {
                ASSERT(getJITType() == JITCode::BaselineJIT);
                return false;
            }
            jitCompileImpl(globalData);
            return true;
        }
        virtual CodeBlock* replacement() = 0;
        virtual bool canCompileWithDFG() = 0;
        bool hasOptimizedReplacement()
        {
            ASSERT(JITCode::isBaselineCode(getJITType()));
            bool result = replacement()->getJITType() > getJITType();
#if !ASSERT_DISABLED
            if (result)
                ASSERT(replacement()->getJITType() == JITCode::DFGJIT);
            else {
                ASSERT(JITCode::isBaselineCode(replacement()->getJITType()));
                ASSERT(replacement() == this);
            }
#endif


        void clearEvalCache();

#if ENABLE(INTERPRETER)
        void addPropertyAccessInstruction(unsigned propertyAccessInstruction)
        {
            m_propertyAccessInstructions.append(propertyAccessInstruction);
                m_propertyAccessInstructions.append(propertyAccessInstruction);
        }
        void addGlobalResolveInstruction(unsigned globalResolveInstruction)
        {
            m_globalResolveInstructions.append(globalResolveInstruction);
                m_globalResolveInstructions.append(globalResolveInstruction);
        }
        bool hasGlobalResolveInstructionAtBytecodeOffset(unsigned bytecodeOffset);
#if ENABLE(LLINT)
        LLIntCallLinkInfo* addLLIntCallLinkInfo()
        {
            m_llintCallLinkInfos.append(LLIntCallLinkInfo());
            return &m_llintCallLinkInfos.last();
        }
#endif
#if ENABLE(JIT)
        void setNumberOfStructureStubInfos(size_t size) { m_structureStubInfos.grow(size); }


        void addGlobalResolveInfo(unsigned globalResolveInstruction)
        {
            m_globalResolveInfos.append(GlobalResolveInfo(globalResolveInstruction));
                m_globalResolveInfos.append(GlobalResolveInfo(globalResolveInstruction));
        }
        GlobalResolveInfo& globalResolveInfo(int index) { return m_globalResolveInfos[index]; }
        bool hasGlobalResolveInfoAtBytecodeOffset(unsigned bytecodeOffset);


        void addMethodCallLinkInfos(unsigned n) { ASSERT(m_globalData->canUseJIT()); m_methodCallLinkInfos.grow(n); }
        MethodCallLinkInfo& methodCallLinkInfo(int index) { return m_methodCallLinkInfos[index]; }
        size_t numberOfMethodCallLinkInfos() { return m_methodCallLinkInfos.size(); }
#endif
        
#if ENABLE(VALUE_PROFILER)

                                   bytecodeOffset].u.opcode)) - 1].u.profile == result);
            return result;
        }
        PredictedType valueProfilePredictionForBytecodeOffset(int bytecodeOffset)
        {
            return valueProfileForBytecodeOffset(bytecodeOffset)->computeUpdatedPrediction();
        }
        
        unsigned totalNumberOfValueProfiles()
        {

        
        bool likelyToTakeSlowCase(int bytecodeOffset)
        {
            if (!numberOfRareCaseProfiles())
                return false;
            unsigned value = rareCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            return value >= Options::likelyToTakeSlowCaseMinimumCount && static_cast<double>(value) / m_executionEntryCount >= Options::likelyToTakeSlowCaseThreshold;
        }
        
        bool couldTakeSlowCase(int bytecodeOffset)
        {
            if (!numberOfRareCaseProfiles())
                return false;
            unsigned value = rareCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            return value >= Options::couldTakeSlowCaseMinimumCount && static_cast<double>(value) / m_executionEntryCount >= Options::couldTakeSlowCaseThreshold;
        }

        
        bool likelyToTakeSpecialFastCase(int bytecodeOffset)
        {
            if (!numberOfRareCaseProfiles())
                return false;
            unsigned specialFastCaseCount = specialFastCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            return specialFastCaseCount >= Options::likelyToTakeSlowCaseMinimumCount && static_cast<double>(specialFastCaseCount) / m_executionEntryCount >= Options::likelyToTakeSlowCaseThreshold;
        }
        
        bool likelyToTakeDeepestSlowCase(int bytecodeOffset)
        {
            if (!numberOfRareCaseProfiles())
                return false;
            unsigned slowCaseCount = rareCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            unsigned specialFastCaseCount = specialFastCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            unsigned value = slowCaseCount - specialFastCaseCount;

        
        bool likelyToTakeAnySlowCase(int bytecodeOffset)
        {
            if (!numberOfRareCaseProfiles())
                return false;
            unsigned slowCaseCount = rareCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            unsigned specialFastCaseCount = specialFastCaseProfileForBytecodeOffset(bytecodeOffset)->m_counter;
            unsigned value = slowCaseCount + specialFastCaseCount;

        
        bool addFrequentExitSite(const DFG::FrequentExitSite& site)
        {
            ASSERT(JITCode::isBaselineCode(getJITType()));
            return m_exitProfile.add(site);
        }


        void copyPostParseDataFrom(CodeBlock* alternative);
        void copyPostParseDataFromAlternative();
        
        // Functions for controlling when JITting kicks in, in a mixed mode
        // execution world.
        
        void dontJITAnytimeSoon()
        {
            m_llintExecuteCounter = Options::executionCounterValueForDontJITAnytimeSoon;
        }
        
        void jitAfterWarmUp()
        {
            m_llintExecuteCounter = Options::executionCounterValueForJITAfterWarmUp;
        }
        
        void jitSoon()
        {
            m_llintExecuteCounter = Options::executionCounterValueForJITSoon;
        }
        
        int32_t llintExecuteCounter() const
        {
            return m_llintExecuteCounter;
        }
        
        // Functions for controlling when tiered compilation kicks in. This
        // controls both when the optimizing compiler is invoked and when OSR
        // entry happens. Two triggers exist: the loop trigger and the return

        bool m_shouldDiscardBytecode;

    protected:
        virtual void jitCompileImpl(JSGlobalData&) = 0;
        virtual void visitWeakReferences(SlotVisitor&);
        virtual void finalizeUnconditionally();
        

        void tallyFrequentExitSites() { }
#endif
        
#if !defined(NDEBUG) || ENABLE(OPCODE_SAMPLING)
        void dump(ExecState*, const Vector<Instruction>::const_iterator& begin, Vector<Instruction>::const_iterator&) const;

        CString registerName(ExecState*, int r) const;

        void printGetByIdOp(ExecState*, int location, Vector<Instruction>::const_iterator&, const char* op) const;
        void printCallOp(ExecState*, int location, Vector<Instruction>::const_iterator&, const char* op) const;
        void printPutByIdOp(ExecState*, int location, Vector<Instruction>::const_iterator&, const char* op) const;
#endif
        void visitStructures(SlotVisitor&, Instruction* vPC) const;
        
#if ENABLE(DFG_JIT)

        RefPtr<SourceProvider> m_source;
        unsigned m_sourceOffset;

#if ENABLE(INTERPRETER)
        Vector<unsigned> m_propertyAccessInstructions;
        Vector<unsigned> m_globalResolveInstructions;
#if ENABLE(LLINT)
        SegmentedVector<LLIntCallLinkInfo, 8> m_llintCallLinkInfos;
        SentinelLinkedList<LLIntCallLinkInfo, BasicRawSentinelNode<LLIntCallLinkInfo> > m_incomingLLIntCalls;
#endif
#if ENABLE(JIT)
        Vector<StructureStubInfo> m_structureStubInfos;

        MacroAssemblerCodePtr m_jitCodeWithArityCheck;
        SentinelLinkedList<CallLinkInfo, BasicRawSentinelNode<CallLinkInfo> > m_incomingCalls;
#endif
#if ENABLE(DFG_JIT) || ENABLE(LLINT)
        OwnPtr<CompactJITCodeMap> m_jitCodeMap;
#endif
#if ENABLE(DFG_JIT)
        struct WeakReferenceTransition {
            WeakReferenceTransition() { }
            


        OwnPtr<CodeBlock> m_alternative;
        
        int32_t m_llintExecuteCounter;
        
        int32_t m_jitExecuteCounter;
        uint32_t m_speculativeSuccessCounter;
        uint32_t m_speculativeFailCounter;
        uint8_t m_optimizationDelayCounter;
        uint8_t m_reoptimizationRetryCounter;
        
        struct RareData {
           WTF_MAKE_FAST_ALLOCATED;
        public:

    protected:
        virtual JSObject* compileOptimized(ExecState*, ScopeChainNode*);
        virtual void jettison();
        virtual void jitCompileImpl(JSGlobalData&);
        virtual CodeBlock* replacement();
        virtual bool canCompileWithDFG();
#endif

    protected:
        virtual JSObject* compileOptimized(ExecState*, ScopeChainNode*);
        virtual void jettison();
        virtual void jitCompileImpl(JSGlobalData&);
        virtual CodeBlock* replacement();
        virtual bool canCompileWithDFG();
#endif

    protected:
        virtual JSObject* compileOptimized(ExecState*, ScopeChainNode*);
        virtual void jettison();
        virtual void jitCompileImpl(JSGlobalData&);
        virtual CodeBlock* replacement();
        virtual bool canCompileWithDFG();
#endif



#include "GetByIdStatus.h"

#include "CodeBlock.h"
#include "LowLevelInterpreter.h"

namespace JSC {

GetByIdStatus GetByIdStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
    UNUSED_PARAM(ident);
#if ENABLE(LLINT)
    Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;
    
    if (instruction[0].u.opcode == llint_op_method_check)
        instruction++;

    Structure* structure = instruction[4].u.structure.get();
    if (!structure)
        return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
    
    size_t offset = structure->get(*profiledBlock->globalData(), ident);
    if (offset == notFound)
        return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
    
    return GetByIdStatus(SimpleDirect, StructureSet(structure), offset, false);
#else
    return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
#endif
}

GetByIdStatus GetByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
    UNUSED_PARAM(ident);
#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
    if (!profiledBlock->numberOfStructureStubInfos())
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
    
    // First check if it makes either calls, in which case we want to be super careful, or
    // if it's not set at all, in which case we punt.
    StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);
    if (!stubInfo.seen)
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
    
    PolymorphicAccessStructureList* list;
    int listSize;

    }
    for (int i = 0; i < listSize; ++i) {
        if (!list->list[i].isDirect)
            return GetByIdStatus(MakesCalls, StructureSet(), notFound, true);
    }
    
    // Next check if it takes slow case, in which case we want to be kind of careful.
    if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))
        return GetByIdStatus(TakesSlowPath, StructureSet(), notFound, true);
    
    // Finally figure out if we can derive an access strategy.
    GetByIdStatus result;
    result.m_wasSeenInJIT = true;
    switch (stubInfo.accessType) {
    case access_unset:
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
        
    case access_get_by_id_self: {
        Structure* structure = stubInfo.u.getByIdSelf.baseObjectStructure.get();

    
    return result;
#else // ENABLE(JIT)
    return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
#endif // ENABLE(JIT)
}


Lines 49-58 public: Source/JavaScriptCore/bytecode/GetByIdStatus.h_sec1
- Source/JavaScriptCore/bytecode/GetByIdStatus.h -1 / +7 lines
49	{	49	{
50	}	50	}
51		51
52	GetByIdStatus(State state, const StructureSet& structureSet, size_t offset)	52	GetByIdStatus(State state, const StructureSet& structureSet, size_t offset, bool wasSeenInJIT)
53	: m_state(state)	53	: m_state(state)
54	, m_structureSet(structureSet)	54	, m_structureSet(structureSet)
55	, m_offset(offset)	55	, m_offset(offset)
		56	, m_wasSeenInJIT(wasSeenInJIT)
56	{	57	{
57	ASSERT((state == SimpleDirect) == (offset != notFound));	58	ASSERT((state == SimpleDirect) == (offset != notFound));
58	}	59	}
Lines 70-79 public: Source/JavaScriptCore/bytecode/GetByIdStatus.h_sec2
70	const StructureSet& structureSet() const { return m_structureSet; }	71	const StructureSet& structureSet() const { return m_structureSet; }
71	size_t offset() const { return m_offset; }	72	size_t offset() const { return m_offset; }
72		73
		74	bool wasSeenInJIT() const { return m_wasSeenInJIT; }
		75
73	private:	76	private:
		77	static GetByIdStatus computeFromLLInt(CodeBlock*, unsigned bytecodeIndex, Identifier&);
		78
74	State m_state;	79	State m_state;
75	StructureSet m_structureSet;	80	StructureSet m_structureSet;
76	size_t m_offset;	81	size_t m_offset;
		82	bool m_wasSeenInJIT;
77	};	83	};
78		84
79	} // namespace JSC	85	} // namespace JSC

Lines 48-53 namespace JSC { Source/JavaScriptCore/bytecode/Instruction.h_sec1
- Source/JavaScriptCore/bytecode/Instruction.h +10 lines
48	class JSCell;	48	class JSCell;
49	class Structure;	49	class Structure;
50	class StructureChain;	50	class StructureChain;
		51	struct LLIntCallLinkInfo;
51	struct ValueProfile;	52	struct ValueProfile;
52		53
53	#if ENABLE(JIT)	54	#if ENABLE(JIT)
Lines 146-151 namespace JSC { Source/JavaScriptCore/bytecode/Instruction.h_sec2
146	#endif	147	#endif
147		148
148	struct Instruction {	149	struct Instruction {
		150	Instruction()
		151	{
		152	u.jsCell.clear();
		153	}
		154
149	Instruction(Opcode opcode)	155	Instruction(Opcode opcode)
150	{	156	{
151	#if !ENABLE(COMPUTED_GOTO_INTERPRETER)	157	#if !ENABLE(COMPUTED_GOTO_INTERPRETER)
Lines 182-187 namespace JSC { Source/JavaScriptCore/bytecode/Instruction.h_sec3
182		188
183	Instruction(PropertySlot::GetValueFunc getterFunc) { u.getterFunc = getterFunc; }	189	Instruction(PropertySlot::GetValueFunc getterFunc) { u.getterFunc = getterFunc; }
184		190
		191	Instruction(LLIntCallLinkInfo* callLinkInfo) { u.callLinkInfo = callLinkInfo; }
		192
185	Instruction(ValueProfile* profile) { u.profile = profile; }	193	Instruction(ValueProfile* profile) { u.profile = profile; }
186		194
187	union {	195	union {
Lines 191-197 namespace JSC { Source/JavaScriptCore/bytecode/Instruction.h_sec4
191	WriteBarrierBase<StructureChain> structureChain;	199	WriteBarrierBase<StructureChain> structureChain;
192	WriteBarrierBase<JSCell> jsCell;	200	WriteBarrierBase<JSCell> jsCell;
193	PropertySlot::GetValueFunc getterFunc;	201	PropertySlot::GetValueFunc getterFunc;
		202	LLIntCallLinkInfo* callLinkInfo;
194	ValueProfile* profile;	203	ValueProfile* profile;
		204	void* pointer;
195	} u;	205	} u;
196		206
197	private:	207	private:



/*
 * Copyright (C) 2012 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 LLIntCallLinkInfo_h
#define LLIntCallLinkInfo_h

#include "JSFunction.h"
#include "MacroAssemblerCodeRef.h"
#include <wtf/SentinelLinkedList.h>

namespace JSC {

struct Instruction;

struct LLIntCallLinkInfo : public BasicRawSentinelNode<LLIntCallLinkInfo> {
    LLIntCallLinkInfo()
    {
    }
    
    ~LLIntCallLinkInfo()
    {
        if (isOnList())
            remove();
    }
    
    bool isLinked() { return callee; }
    
    void unlink()
    {
        callee.clear();
        machineCodeTarget = MacroAssemblerCodePtr();
        if (isOnList())
            remove();
    }
    
    WriteBarrier<JSFunction> callee;
    WriteBarrier<JSFunction> lastSeenCallee;
    MacroAssemblerCodePtr machineCodeTarget;
};

} // namespace JSC

#endif // LLIntCallLinkInfo_h


Lines 35-40 MethodCallLinkStatus MethodCallLinkStatu Source/JavaScriptCore/bytecode/MethodCallLinkStatus.cpp_sec1
- Source/JavaScriptCore/bytecode/MethodCallLinkStatus.cpp +5 lines
35	UNUSED_PARAM(profiledBlock);	35	UNUSED_PARAM(profiledBlock);
36	UNUSED_PARAM(bytecodeIndex);	36	UNUSED_PARAM(bytecodeIndex);
37	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)	37	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
		38	// NOTE: This does not have an LLInt fall-back because LLInt does not do any method
		39	// call link caching.
		40	if (!profiledBlock->numberOfMethodCallLinkInfos())
		41	return MethodCallLinkStatus();
		42
38	MethodCallLinkInfo& methodCall = profiledBlock->getMethodCallLinkInfo(bytecodeIndex);	43	MethodCallLinkInfo& methodCall = profiledBlock->getMethodCallLinkInfo(bytecodeIndex);
39		44
40	if (!methodCall.seen \|\| !methodCall.cachedStructure)	45	if (!methodCall.seen \|\| !methodCall.cachedStructure)

Lines 123-128 namespace JSC { Source/JavaScriptCore/bytecode/Opcode.h_sec1
- Source/JavaScriptCore/bytecode/Opcode.h -1 / +4 lines
123	macro(op_get_arguments_length, 4) \	123	macro(op_get_arguments_length, 4) \
124	macro(op_put_by_id, 9) \	124	macro(op_put_by_id, 9) \
125	macro(op_put_by_id_transition, 9) \	125	macro(op_put_by_id_transition, 9) \
		126	macro(op_put_by_id_transition_direct, 9) \
		127	macro(op_put_by_id_transition_normal, 9) \
126	macro(op_put_by_id_replace, 9) \	128	macro(op_put_by_id_replace, 9) \
127	macro(op_put_by_id_generic, 9) \	129	macro(op_put_by_id_generic, 9) \
128	macro(op_del_by_id, 4) \	130	macro(op_del_by_id, 4) \
Lines 202-207 namespace JSC { Source/JavaScriptCore/bytecode/Opcode.h_sec2
202	typedef enum { FOR_EACH_OPCODE_ID(OPCODE_ID_ENUM) } OpcodeID;	204	typedef enum { FOR_EACH_OPCODE_ID(OPCODE_ID_ENUM) } OpcodeID;
203	#undef OPCODE_ID_ENUM	205	#undef OPCODE_ID_ENUM
204		206
		207	const int maxOpcodeLength = 9;
205	const int numOpcodeIDs = op_end + 1;	208	const int numOpcodeIDs = op_end + 1;
206		209
207	#define OPCODE_ID_LENGTHS(id, length) const int id##_length = length;	210	#define OPCODE_ID_LENGTHS(id, length) const int id##_length = length;
Lines 218-224 namespace JSC { Source/JavaScriptCore/bytecode/Opcode.h_sec3
218	FOR_EACH_OPCODE_ID(VERIFY_OPCODE_ID);	221	FOR_EACH_OPCODE_ID(VERIFY_OPCODE_ID);
219	#undef VERIFY_OPCODE_ID	222	#undef VERIFY_OPCODE_ID
220		223
221	#if ENABLE(COMPUTED_GOTO_INTERPRETER)	224	#if ENABLE(COMPUTED_GOTO_INTERPRETER) \|\| ENABLE(LLINT)
222	#if COMPILER(RVCT) \|\| COMPILER(INTEL)	225	#if COMPILER(RVCT) \|\| COMPILER(INTEL)
223	typedef void* Opcode;	226	typedef void* Opcode;
224	#else	227	#else



#include "PutByIdStatus.h"

#include "CodeBlock.h"
#include "LowLevelInterpreter.h"
#include "Structure.h"
#include "StructureChain.h"

namespace JSC {

PutByIdStatus PutByIdStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
    UNUSED_PARAM(ident);
#if ENABLE(LLINT)
    Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;

    Structure* structure = instruction[4].u.structure.get();
    if (!structure)
        return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
    
    if (instruction[0].u.opcode == llint_op_put_by_id) {
        size_t offset = structure->get(*profiledBlock->globalData(), ident);
        if (offset == notFound)
            return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
        
        return PutByIdStatus(SimpleReplace, structure, 0, 0, offset);
    }
    
    ASSERT(instruction[0].u.opcode == llint_op_put_by_id_transition_direct
           || instruction[0].u.opcode == llint_op_put_by_id_transition_normal);
    
    Structure* newStructure = instruction[6].u.structure.get();
    StructureChain* chain = instruction[7].u.structureChain.get();
    ASSERT(newStructure);
    ASSERT(chain);
    
    size_t offset = newStructure->get(*profiledBlock->globalData(), ident);
    if (offset == notFound)
        return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
    
    return PutByIdStatus(SimpleTransition, structure, newStructure, chain, offset);
#else
    return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
#endif
}

PutByIdStatus PutByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
{
    UNUSED_PARAM(profiledBlock);
    UNUSED_PARAM(bytecodeIndex);
    UNUSED_PARAM(ident);
#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
    if (!profiledBlock->numberOfStructureStubInfos())
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
    
    if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))
        return PutByIdStatus(TakesSlowPath, 0, 0, 0, notFound);
    
    StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);
    if (!stubInfo.seen)
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
    
    switch (stubInfo.accessType) {
    case access_unset:
        return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
        
    case access_put_by_id_replace: {
        size_t offset = stubInfo.u.putByIdReplace.baseObjectStructure->get(

Lines 93-98 public: Source/JavaScriptCore/bytecode/PutByIdStatus.h_sec1
- Source/JavaScriptCore/bytecode/PutByIdStatus.h +2 lines
93	size_t offset() const { return m_offset; }	93	size_t offset() const { return m_offset; }
94		94
95	private:	95	private:
		96	static PutByIdStatus computeFromLLInt(CodeBlock*, unsigned bytecodeIndex, Identifier&);
		97
96	State m_state;	98	State m_state;
97	Structure* m_oldStructure;	99	Structure* m_oldStructure;
98	Structure* m_newStructure;	100	Structure* m_newStructure;



#include "BatchedTransitionOptimizer.h"
#include "JSFunction.h"
#include "Interpreter.h"
#include "LowLevelInterpreter.h"
#include "ScopeChain.h"
#include "StrongInlines.h"
#include "UString.h"

    expected by the callee.
*/

#ifndef NDEBUG
static bool s_dumpsGeneratedCode = false;
#endif

void BytecodeGenerator::setDumpsGeneratedCode(bool dumpsGeneratedCode)
{
#ifndef NDEBUG
    s_dumpsGeneratedCode = dumpsGeneratedCode;
#else
    UNUSED_PARAM(dumpsGeneratedCode);
#endif
}

bool BytecodeGenerator::dumpsGeneratedCode()
{
#ifndef NDEBUG
    return s_dumpsGeneratedCode;
#else
    return false;
#endif
}

JSObject* BytecodeGenerator::generate()


    m_codeBlock->setInstructionCount(m_codeBlock->instructions().size());

#ifndef NDEBUG
    if (s_dumpsGeneratedCode)
        m_codeBlock->dump(m_scopeChain->globalObject->globalExec());
#endif

    if ((m_codeType == FunctionCode && !m_codeBlock->needsFullScopeChain() && !m_codeBlock->usesArguments()) || m_codeType == EvalCode)
        symbolTable().clear();

#if ENABLE(JIT)
        m_codeBlock->addGlobalResolveInfo(instructions().size());
#endif
#if ENABLE(INTERPRETER)
        m_codeBlock->addGlobalResolveInstruction(instructions().size());
#endif
        ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
        instructions().append(dst->index());
        instructions().append(addConstant(property));

#if ENABLE(JIT)
    m_codeBlock->addGlobalResolveInfo(instructions().size());
#endif
#if ENABLE(INTERPRETER)
    m_codeBlock->addGlobalResolveInstruction(instructions().size());
#endif
    ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
    instructions().append(propDst->index());
    instructions().append(addConstant(property));

#if ENABLE(JIT)
    m_codeBlock->addGlobalResolveInfo(instructions().size());
#endif
#if ENABLE(INTERPRETER)
    m_codeBlock->addGlobalResolveInstruction(instructions().size());
#endif
    ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
    instructions().append(propDst->index());
    instructions().append(addConstant(property));


RegisterID* BytecodeGenerator::emitGetById(RegisterID* dst, RegisterID* base, const Identifier& property)
{
#if ENABLE(INTERPRETER)
    m_codeBlock->addPropertyAccessInstruction(instructions().size());
#endif

    ValueProfile* profile = emitProfiledOpcode(op_get_by_id);
    instructions().append(dst->index());


RegisterID* BytecodeGenerator::emitPutById(RegisterID* base, const Identifier& property, RegisterID* value)
{
#if ENABLE(INTERPRETER)
    m_codeBlock->addPropertyAccessInstruction(instructions().size());
#endif

    emitOpcode(op_put_by_id);
    instructions().append(base->index());


RegisterID* BytecodeGenerator::emitDirectPutById(RegisterID* base, const Identifier& property, RegisterID* value)
{
#if ENABLE(INTERPRETER)
    m_codeBlock->addPropertyAccessInstruction(instructions().size());
#endif
    
    emitOpcode(op_put_by_id);
    instructions().append(base->index());

    instructions().append(func->index()); // func
    instructions().append(callArguments.argumentCountIncludingThis()); // argCount
    instructions().append(callArguments.registerOffset()); // registerOffset
#if ENABLE(LLINT)
    instructions().append(m_codeBlock->addLLIntCallLinkInfo());
#else
    instructions().append(0);
#endif
    instructions().append(0);
    if (dst != ignoredResult()) {
        ValueProfile* profile = emitProfiledOpcode(op_call_put_result);

    instructions().append(func->index()); // func
    instructions().append(callArguments.argumentCountIncludingThis()); // argCount
    instructions().append(callArguments.registerOffset()); // registerOffset
#if ENABLE(LLINT)
    instructions().append(m_codeBlock->addLLIntCallLinkInfo());
#else
    instructions().append(0);
#endif
    instructions().append(0);
    if (dst != ignoredResult()) {
        ValueProfile* profile = emitProfiledOpcode(op_call_put_result);

{
    m_usesExceptions = true;
#if ENABLE(JIT)
#if ENABLE(LLINT)
    HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth, CodeLocationLabel(bitwise_cast<void*>(&llint_op_catch)) };
#else
    HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth, CodeLocationLabel() };
#endif
#else
    HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth };
#endif

Lines 604-612 private: Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp_sec1
- Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp -5 / +8 lines
604	{	604	{
605	UNUSED_PARAM(nodeIndex);	605	UNUSED_PARAM(nodeIndex);
606		606
607	ValueProfile* profile = m_inlineStackTop->m_profiledBlock->valueProfileForBytecodeOffset(bytecodeIndex);	607	PredictedType prediction = m_inlineStackTop->m_profiledBlock->valueProfilePredictionForBytecodeOffset(bytecodeIndex);
608	ASSERT(profile);
609	PredictedType prediction = profile->computeUpdatedPrediction();
610	#if DFG_ENABLE(DEBUG_VERBOSE)	608	#if DFG_ENABLE(DEBUG_VERBOSE)
611	printf("Dynamic [@%u, bc#%u] prediction: %s\n", nodeIndex, bytecodeIndex, predictionToString(prediction));	609	printf("Dynamic [@%u, bc#%u] prediction: %s\n", nodeIndex, bytecodeIndex, predictionToString(prediction));
612	#endif	610	#endif
Lines 1041-1046 bool ByteCodeParser::handleInlining(bool Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp_sec2
1041		1039
1042	// If we get here then it looks like we should definitely inline this code. Proceed	1040	// If we get here then it looks like we should definitely inline this code. Proceed
1043	// with parsing the code to get bytecode, so that we can then parse the bytecode.	1041	// with parsing the code to get bytecode, so that we can then parse the bytecode.
		1042	// Note that if LLInt is enabled, the bytecode will always be available. Also note
		1043	// that if LLInt is enabled, we may inline a code block that has never been JITted
		1044	// before!
1044	CodeBlock* codeBlock = m_codeBlockCache.get(CodeBlockKey(executable, kind), expectedFunction->scope());	1045	CodeBlock* codeBlock = m_codeBlockCache.get(CodeBlockKey(executable, kind), expectedFunction->scope());
1045	if (!codeBlock)	1046	if (!codeBlock)
1046	return false;	1047	return false;
Lines 1741-1747 bool ByteCodeParser::parseBlock(unsigned Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp_sec3
1741	m_inlineStackTop->m_profiledBlock, m_currentIndex);	1742	m_inlineStackTop->m_profiledBlock, m_currentIndex);
1742		1743
1743	if (methodCallStatus.isSet()	1744	if (methodCallStatus.isSet()
1744	&& !getByIdStatus.isSet()	1745	&& !getByIdStatus.wasSeenInJIT()
1745	&& !m_inlineStackTop->m_exitProfile.hasExitSite(m_currentIndex, BadCache)) {	1746	&& !m_inlineStackTop->m_exitProfile.hasExitSite(m_currentIndex, BadCache)) {
1746	// It's monomorphic as far as we can tell, since the method_check was linked	1747	// It's monomorphic as far as we can tell, since the method_check was linked
1747	// but the slow path (i.e. the normal get_by_id) never fired.	1748	// but the slow path (i.e. the normal get_by_id) never fired.
Lines 1810-1816 bool ByteCodeParser::parseBlock(unsigned Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp_sec4
1810		1811
1811	NEXT_OPCODE(op_get_by_id);	1812	NEXT_OPCODE(op_get_by_id);
1812	}	1813	}
1813	case op_put_by_id: {	1814	case op_put_by_id:
		1815	case op_put_by_id_transition_direct:
		1816	case op_put_by_id_transition_normal: {
1814	NodeIndex value = get(currentInstruction[3].u.operand);	1817	NodeIndex value = get(currentInstruction[3].u.operand);
1815	NodeIndex base = get(currentInstruction[1].u.operand);	1818	NodeIndex base = get(currentInstruction[1].u.operand);
1816	unsigned identifierNumber = m_inlineStackTop->m_identifierRemap[currentInstruction[2].u.operand];	1819	unsigned identifierNumber = m_inlineStackTop->m_identifierRemap[currentInstruction[2].u.operand];

Lines 111-116 inline bool canCompileOpcode(OpcodeID op Source/JavaScriptCore/dfg/DFGCapabilities.h_sec1
- Source/JavaScriptCore/dfg/DFGCapabilities.h +2 lines
111	case op_put_scoped_var:	111	case op_put_scoped_var:
112	case op_get_by_id:	112	case op_get_by_id:
113	case op_put_by_id:	113	case op_put_by_id:
		114	case op_put_by_id_transition_direct:
		115	case op_put_by_id_transition_normal:
114	case op_get_global_var:	116	case op_get_global_var:
115	case op_put_global_var:	117	case op_put_global_var:
116	case op_jmp:	118	case op_jmp:



    uint32_t exitIndex = globalData->osrExitIndex;
    OSRExit& exit = codeBlock->osrExit(exitIndex);
    
    // Make sure all code on our inline stack is JIT compiled. This is necessary since
    // we may opt to inline a code block even before it had ever been compiled by the
    // JIT, but our OSR exit infrastructure currently only works if the target of the
    // OSR exit is JIT code. This could be changed since there is nothing particularly
    // hard about doing an OSR exit into the interpreter, but for now this seems to make
    // sense in that if we're OSR exiting from inlined code of a DFG code block, then
    // probably it's a good sign that the thing we're exiting into is hot. Even more
    // interestingly, since the code was inlined, it may never otherwise get JIT
    // compiled since the act of inlining it may ensure that it otherwise never runs.
    for (CodeOrigin codeOrigin = exit.m_codeOrigin; codeOrigin.inlineCallFrame; codeOrigin = codeOrigin.inlineCallFrame->caller) {
        static_cast<FunctionExecutable*>(codeOrigin.inlineCallFrame->executable.get())
            ->baselineCodeBlockFor(codeOrigin.inlineCallFrame->isCall ? CodeForCall : CodeForConstruct)
            ->jitCompile(*globalData);
    }
    
    SpeculationRecovery* recovery = 0;
    if (exit.m_recoveryIndex)
        recovery = &codeBlock->speculationRecovery(exit.m_recoveryIndex - 1);



#include "CodeBlock.h"
#include "DFGOSRExit.h"
#include "DFGRepatch.h"
#include "HostCallReturnValue.h"
#include "GetterSetter.h"
#include "InlineASM.h"
#include "Interpreter.h"

    return JSValue::strictEqual(exec, JSValue::decode(encodedOp1), JSValue::decode(encodedOp2));
}

EncodedJSValue DFG_OPERATION getHostCallReturnValue();
EncodedJSValue DFG_OPERATION getHostCallReturnValueWithExecState(ExecState*);

#if CPU(X86_64)
asm (
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "mov -40(%r13), %r13\n"
    "mov %r13, %rdi\n"
    "jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#elif CPU(X86)
asm (
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "mov -40(%edi), %edi\n"
    "mov %edi, 4(%esp)\n"
    "jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#elif CPU(ARM_THUMB2)
asm (
".text" "\n"
".align 2" "\n"
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
HIDE_SYMBOL(getHostCallReturnValue) "\n"
".thumb" "\n"
".thumb_func " THUMB_FUNC_PARAM(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "ldr r5, [r5, #-40]" "\n"
    "cpy r0, r5" "\n"
    "b " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#endif

EncodedJSValue DFG_OPERATION getHostCallReturnValueWithExecState(ExecState* exec)
{
    JSGlobalData* globalData = &exec->globalData();
    NativeCallFrameTracer tracer(globalData, exec);
    
    return JSValue::encode(exec->globalData().hostCallReturnValue);
}

static void* handleHostCall(ExecState* execCallee, JSValue callee, CodeSpecializationKind kind)
{
    ExecState* exec = execCallee->callerFrame();

Lines 34-39 Source/JavaScriptCore/heap/AllocationSpace.h_sec1
- Source/JavaScriptCore/heap/AllocationSpace.h +3 lines
34	namespace JSC {	34	namespace JSC {
35		35
36	class Heap;	36	class Heap;
		37	class LLIntOffsetsExtractor;
37	class MarkedBlock;	38	class MarkedBlock;
38		39
39	class AllocationSpace {	40	class AllocationSpace {
Lines 67-72 public: Source/JavaScriptCore/heap/AllocationSpace.h_sec2
67	void shrink();	68	void shrink();
68		69
69	private:	70	private:
		71	friend class LLIntOffsetsExtractor;
		72
70	enum AllocationEffort { AllocationCanFail, AllocationMustSucceed };	73	enum AllocationEffort { AllocationCanFail, AllocationMustSucceed };
71		74
72	void* allocate(MarkedSpace::SizeClass&);	75	void* allocate(MarkedSpace::SizeClass&);

Lines 837-843 void Heap::collect(SweepToggle sweepTogg Source/JavaScriptCore/heap/Heap.cpp_sec1
- Source/JavaScriptCore/heap/Heap.cpp -1 / +1 lines
837	setHighWaterMark(max(proportionalBytes, m_minBytesPerCycle));	837	setHighWaterMark(max(proportionalBytes, m_minBytesPerCycle));
838	}	838	}
839	JAVASCRIPTCORE_GC_END();	839	JAVASCRIPTCORE_GC_END();
840		840
841	(*m_activityCallback)();	841	(*m_activityCallback)();
842	}	842	}
843		843

Lines 50-55 namespace JSC { Source/JavaScriptCore/heap/Heap.h_sec1
- Source/JavaScriptCore/heap/Heap.h -2 / +4 lines
50	class JSGlobalData;	50	class JSGlobalData;
51	class JSValue;	51	class JSValue;
52	class LiveObjectIterator;	52	class LiveObjectIterator;
		53	class LLIntOffsetsExtractor;
53	class MarkedArgumentBuffer;	54	class MarkedArgumentBuffer;
54	class RegisterFile;	55	class RegisterFile;
55	class UString;	56	class UString;
Lines 136-146 namespace JSC { Source/JavaScriptCore/heap/Heap.h_sec2
136	void getConservativeRegisterRoots(HashSet<JSCell*>& roots);	137	void getConservativeRegisterRoots(HashSet<JSCell*>& roots);
137		138
138	private:	139	private:
139	friend class MarkedBlock;
140	friend class AllocationSpace;	140	friend class AllocationSpace;
		141	friend class CodeBlock;
		142	friend class LLIntOffsetsExtractor;
		143	friend class MarkedBlock;
141	friend class BumpSpace;	144	friend class BumpSpace;
142	friend class SlotVisitor;	145	friend class SlotVisitor;
143	friend class CodeBlock;
144		146
145	size_t waterMark();	147	size_t waterMark();
146	size_t highWaterMark();	148	size_t highWaterMark();

Lines 304-310 ALWAYS_INLINE static void visitChildren( Source/JavaScriptCore/heap/MarkStack.cpp_sec1
- Source/JavaScriptCore/heap/MarkStack.cpp -1 / +1 lines
304	#endif	304	#endif
305		305
306	ASSERT(Heap::isMarked(cell));	306	ASSERT(Heap::isMarked(cell));
307		307
308	if (isJSString(cell)) {	308	if (isJSString(cell)) {
309	JSString::visitChildren(const_cast<JSCell*>(cell), visitor);	309	JSString::visitChildren(const_cast<JSCell*>(cell), visitor);
310	return;	310	return;

Lines 39-44 namespace JSC { Source/JavaScriptCore/heap/MarkedSpace.h_sec1
- Source/JavaScriptCore/heap/MarkedSpace.h +3 lines
39	class Heap;	39	class Heap;
40	class JSCell;	40	class JSCell;
41	class LiveObjectIterator;	41	class LiveObjectIterator;
		42	class LLIntOffsetsExtractor;
42	class WeakGCHandle;	43	class WeakGCHandle;
43	class SlotVisitor;	44	class SlotVisitor;
44		45
Lines 77-82 public: Source/JavaScriptCore/heap/MarkedSpace.h_sec2
77	template<typename Functor> typename Functor::ReturnType forEachBlock();	78	template<typename Functor> typename Functor::ReturnType forEachBlock();
78		79
79	private:	80	private:
		81	friend class LLIntOffsetsExtractor;
		82
80	// [ 32... 256 ]	83	// [ 32... 256 ]
81	static const size_t preciseStep = MarkedBlock::atomSize;	84	static const size_t preciseStep = MarkedBlock::atomSize;
82	static const size_t preciseCutoff = 256;	85	static const size_t preciseCutoff = 256;

Lines 122-127 namespace JSC { Source/JavaScriptCore/interpreter/CallFrame.h_sec1
- Source/JavaScriptCore/interpreter/CallFrame.h +3 lines
122	#if ENABLE(INTERPRETER)	122	#if ENABLE(INTERPRETER)
123	Instruction* returnVPC() const { return this[RegisterFile::ReturnPC].vPC(); }	123	Instruction* returnVPC() const { return this[RegisterFile::ReturnPC].vPC(); }
124	#endif	124	#endif
		125	#if ENABLE(LLINT)
		126	Instruction* currentVPC() const { return bitwise_cast<Instruction*>(this[RegisterFile::ArgumentCount].tag()); }
		127	#endif
125		128
126	void setCallerFrame(CallFrame* callerFrame) { static_cast<Register*>(this)[RegisterFile::CallerFrame] = callerFrame; }	129	void setCallerFrame(CallFrame* callerFrame) { static_cast<Register*>(this)[RegisterFile::CallerFrame] = callerFrame; }
127	void setScopeChain(ScopeChainNode* scopeChain) { static_cast<Register*>(this)[RegisterFile::ScopeChain] = scopeChain; }	130	void setScopeChain(ScopeChainNode* scopeChain) { static_cast<Register*>(this)[RegisterFile::ScopeChain] = scopeChain; }



#include "JIT.h"
#endif

#define WTF_USE_GCC_COMPUTED_GOTO_WORKAROUND ((ENABLE(COMPUTED_GOTO_INTERPRETER) || ENABLE(LLINT)) && !defined(__llvm__))

using namespace std;


{
}

Interpreter::~Interpreter()
{
#if ENABLE(LLINT)
    if (m_enabled)
        delete[] m_opcodeTable;
#endif
}

void Interpreter::initialize(LLInt::Data* llintData, bool canUseJIT)
{
    UNUSED_PARAM(llintData);
    UNUSED_PARAM(canUseJIT);
#if ENABLE(COMPUTED_GOTO_INTERPRETER) || ENABLE(LLINT)
#if !ENABLE(COMPUTED_GOTO_INTERPRETER)
    // Having LLInt enabled, but not being able to use the JIT, and not having
    // a computed goto interpreter, is not supported. Not because we cannot
    // support it, but because I decided to draw the line at the number of
    // permutations of execution engines that I wanted this code to grok.
    ASSERT(canUseJIT);
#endif
    if (canUseJIT) {
#if ENABLE(LLINT)
        m_opcodeTable = llintData->opcodeMap();
        for (int i = 0; i < numOpcodeIDs; ++i)
            m_opcodeIDTable.add(m_opcodeTable[i], static_cast<OpcodeID>(i));
#else
        // If the JIT is present, don't use jump destinations for opcodes.
        
        for (int i = 0; i < numOpcodeIDs; ++i) {
            Opcode opcode = bitwise_cast<void*>(static_cast<uintptr_t>(i));
            m_opcodeTable[i] = opcode;
        }
#endif
    } else {
#if ENABLE(LLINT)
        m_opcodeTable = new Opcode[numOpcodeIDs];
#endif
        privateExecute(InitializeAndReturn, 0, 0);
        
        for (int i = 0; i < numOpcodeIDs; ++i)

        m_enabled = true;
    }
#else
    UNUSED_PARAM(canUseJIT);
#if ENABLE(INTERPRETER)
    m_enabled = true;
#else


bool Interpreter::isOpcode(Opcode opcode)
{
#if ENABLE(COMPUTED_GOTO_INTERPRETER) || ENABLE(LLINT)
#if !ENABLE(LLINT)
    if (!m_enabled)
        return opcode >= 0 && static_cast<OpcodeID>(bitwise_cast<uintptr_t>(opcode)) <= op_end;
#endif
    return opcode != HashTraits<Opcode>::emptyValue()
        && !HashTraits<Opcode>::isDeletedValue(opcode)
        && m_opcodeIDTable.contains(opcode);

    // have to subtract 1.
#if ENABLE(JIT) && ENABLE(INTERPRETER)
    if (callerFrame->globalData().canUseJIT())
        bytecodeOffset = codeBlock->bytecodeOffset(callerFrame, callFrame->returnPC());
    else
        bytecodeOffset = codeBlock->bytecodeOffset(callFrame->returnVPC()) - 1;
#elif ENABLE(JIT)
    bytecodeOffset = codeBlock->bytecodeOffset(callerFrame, callFrame->returnPC());
#else
    bytecodeOffset = codeBlock->bytecodeOffset(callFrame->returnVPC()) - 1;
#endif

        bytecodeOffset = callerCodeBlock->bytecodeOffset(callFrame->returnVPC());
#if ENABLE(JIT)
    else
        bytecodeOffset = callerCodeBlock->bytecodeOffset(callerFrame, callFrame->returnPC());
#endif
#else
    bytecodeOffset = callerCodeBlock->bytecodeOffset(callerFrame, callFrame->returnPC());
#endif
    lineNumber = callerCodeBlock->lineNumberForBytecodeOffset(bytecodeOffset - 1);
    sourceID = callerCodeBlock->ownerExecutable()->sourceID();

Lines 33-38 Source/JavaScriptCore/interpreter/Interpreter.h_sec1
- Source/JavaScriptCore/interpreter/Interpreter.h -5 / +20 lines
33	#include "JSCell.h"	33	#include "JSCell.h"
34	#include "JSValue.h"	34	#include "JSValue.h"
35	#include "JSObject.h"	35	#include "JSObject.h"
		36	#include "LLIntData.h"
36	#include "Opcode.h"	37	#include "Opcode.h"
37	#include "RegisterFile.h"	38	#include "RegisterFile.h"
38		39
Lines 45-50 namespace JSC { Source/JavaScriptCore/interpreter/Interpreter.h_sec2
45	class FunctionExecutable;	46	class FunctionExecutable;
46	class JSFunction;	47	class JSFunction;
47	class JSGlobalObject;	48	class JSGlobalObject;
		49	class LLIntOffsetsExtractor;
48	class ProgramExecutable;	50	class ProgramExecutable;
49	class Register;	51	class Register;
50	class ScopeChainNode;	52	class ScopeChainNode;
Lines 100-118 namespace JSC { Source/JavaScriptCore/interpreter/Interpreter.h_sec3
100		102
101	class Interpreter {	103	class Interpreter {
102	WTF_MAKE_FAST_ALLOCATED;	104	WTF_MAKE_FAST_ALLOCATED;
103	friend class JIT;
104	friend class CachedCall;	105	friend class CachedCall;
		106	friend class LLIntOffsetsExtractor;
		107	friend class JIT;
105	public:	108	public:
106	Interpreter();	109	Interpreter();
		110	~Interpreter();
107		111
108	void initialize(bool canUseJIT);	112	void initialize(LLInt::Data*, bool canUseJIT);
109		113
110	RegisterFile& registerFile() { return m_registerFile; }	114	RegisterFile& registerFile() { return m_registerFile; }
111		115
112	Opcode getOpcode(OpcodeID id)	116	Opcode getOpcode(OpcodeID id)
113	{	117	{
114	ASSERT(m_initialized);	118	ASSERT(m_initialized);
115	#if ENABLE(COMPUTED_GOTO_INTERPRETER)	119	#if ENABLE(COMPUTED_GOTO_INTERPRETER) \|\| ENABLE(LLINT)
116	return m_opcodeTable[id];	120	return m_opcodeTable[id];
117	#else	121	#else
118	return id;	122	return id;
Lines 122-128 namespace JSC { Source/JavaScriptCore/interpreter/Interpreter.h_sec4
122	OpcodeID getOpcodeID(Opcode opcode)	126	OpcodeID getOpcodeID(Opcode opcode)
123	{	127	{
124	ASSERT(m_initialized);	128	ASSERT(m_initialized);
125	#if ENABLE(COMPUTED_GOTO_INTERPRETER)	129	#if ENABLE(LLINT)
		130	ASSERT(isOpcode(opcode));
		131	return m_opcodeIDTable.get(opcode);
		132	#elif ENABLE(COMPUTED_GOTO_INTERPRETER)
126	ASSERT(isOpcode(opcode));	133	ASSERT(isOpcode(opcode));
127	if (!m_enabled)	134	if (!m_enabled)
128	return static_cast<OpcodeID>(bitwise_cast<uintptr_t>(opcode));	135	return static_cast<OpcodeID>(bitwise_cast<uintptr_t>(opcode));
Lines 132-137 namespace JSC { Source/JavaScriptCore/interpreter/Interpreter.h_sec5
132	return opcode;	139	return opcode;
133	#endif	140	#endif
134	}	141	}
		142
		143	bool enabled()
		144	{
		145	return m_enabled;
		146	}
135		147
136	bool isOpcode(Opcode);	148	bool isOpcode(Opcode);
137		149
Lines 199-205 namespace JSC { Source/JavaScriptCore/interpreter/Interpreter.h_sec6
199		211
200	RegisterFile m_registerFile;	212	RegisterFile m_registerFile;
201		213
202	#if ENABLE(COMPUTED_GOTO_INTERPRETER)	214	#if ENABLE(LLINT)
		215	Opcode* m_opcodeTable; // Maps OpcodeID => Opcode for compiling
		216	HashMap<Opcode, OpcodeID> m_opcodeIDTable; // Maps Opcode => OpcodeID for decompiling
		217	#elif ENABLE(COMPUTED_GOTO_INTERPRETER)
203	Opcode m_opcodeTable[numOpcodeIDs]; // Maps OpcodeID => Opcode for compiling	218	Opcode m_opcodeTable[numOpcodeIDs]; // Maps OpcodeID => Opcode for compiling
204	HashMap<Opcode, OpcodeID> m_opcodeIDTable; // Maps Opcode => OpcodeID for decompiling	219	HashMap<Opcode, OpcodeID> m_opcodeIDTable; // Maps Opcode => OpcodeID for decompiling
205	#endif	220	#endif

Lines 39-44 namespace JSC { Source/JavaScriptCore/interpreter/RegisterFile.h_sec1
- Source/JavaScriptCore/interpreter/RegisterFile.h +3 lines
39		39
40	class ConservativeRoots;	40	class ConservativeRoots;
41	class DFGCodeBlocks;	41	class DFGCodeBlocks;
		42	class LLIntOffsetsExtractor;
42		43
43	class RegisterFile {	44	class RegisterFile {
44	WTF_MAKE_NONCOPYABLE(RegisterFile);	45	WTF_MAKE_NONCOPYABLE(RegisterFile);
Lines 81-86 namespace JSC { Source/JavaScriptCore/interpreter/RegisterFile.h_sec2
81	}	82	}
82		83
83	private:	84	private:
		85	friend class LLIntOffsetsExtractor;
		86
84	bool growSlowCase(Register*);	87	bool growSlowCase(Register*);
85	void releaseExcessCapacity();	88	void releaseExcessCapacity();
86	void addToCommittedByteCount(long);	89	void addToCommittedByteCount(long);



/*
 * Copyright (C) 2012 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. 
 */

#include "config.h"
#include "HostCallReturnValue.h"

#include "CallFrame.h"
#include "InlineASM.h"
#include "JSObject.h"
#include "JSValueInlineMethods.h"
#include "ScopeChain.h"

namespace JSC {

extern "C" EncodedJSValue HOST_CALL_RETURN_VALUE_OPTION getHostCallReturnValueWithExecState(ExecState*);

#if CPU(X86_64)
asm (
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "mov -40(%r13), %r13\n"
    "mov %r13, %rdi\n"
    "jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#elif CPU(X86)
asm (
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "mov -40(%edi), %edi\n"
    "mov %edi, 4(%esp)\n"
    "jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#elif CPU(ARM_THUMB2)
asm (
".text" "\n"
".align 2" "\n"
".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
HIDE_SYMBOL(getHostCallReturnValue) "\n"
".thumb" "\n"
".thumb_func " THUMB_FUNC_PARAM(getHostCallReturnValue) "\n"
SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
    "ldr r5, [r5, #-40]" "\n"
    "cpy r0, r5" "\n"
    "b " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
);
#endif

extern "C" EncodedJSValue HOST_CALL_RETURN_VALUE_OPTION getHostCallReturnValueWithExecState(ExecState* exec)
{
    return JSValue::encode(exec->globalData().hostCallReturnValue);
}

} // namespace JSC



/*
 * Copyright (C) 2012 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 HostCallReturnValue_h
#define HostCallReturnValue_h

#include "JSValue.h"
#include "MacroAssemblerCodeRef.h"
#include <wtf/Platform.h>

#if CALLING_CONVENTION_IS_STDCALL
#define HOST_CALL_RETURN_VALUE_OPTION CDECL
#else
#define HOST_CALL_RETURN_VALUE_OPTION
#endif

namespace JSC {
extern "C" EncodedJSValue HOST_CALL_RETURN_VALUE_OPTION getHostCallReturnValue();
}

#endif // HostCallReturnValue_h


Lines 325-330 void JIT::privateCompileMainPass() Source/JavaScriptCore/jit/JIT.cpp_sec1
- Source/JavaScriptCore/jit/JIT.cpp -2 / +14 lines
325	DEFINE_OP(op_profile_will_call)	325	DEFINE_OP(op_profile_will_call)
326	DEFINE_OP(op_push_new_scope)	326	DEFINE_OP(op_push_new_scope)
327	DEFINE_OP(op_push_scope)	327	DEFINE_OP(op_push_scope)
		328	case op_put_by_id_transition_direct:
		329	case op_put_by_id_transition_normal:
328	DEFINE_OP(op_put_by_id)	330	DEFINE_OP(op_put_by_id)
329	DEFINE_OP(op_put_by_index)	331	DEFINE_OP(op_put_by_index)
330	DEFINE_OP(op_put_by_val)	332	DEFINE_OP(op_put_by_val)
Lines 487-492 void JIT::privateCompileSlowCases() Source/JavaScriptCore/jit/JIT.cpp_sec2
487	DEFINE_SLOWCASE_OP(op_post_inc)	489	DEFINE_SLOWCASE_OP(op_post_inc)
488	DEFINE_SLOWCASE_OP(op_pre_dec)	490	DEFINE_SLOWCASE_OP(op_pre_dec)
489	DEFINE_SLOWCASE_OP(op_pre_inc)	491	DEFINE_SLOWCASE_OP(op_pre_inc)
		492	case op_put_by_id_transition_direct:
		493	case op_put_by_id_transition_normal:
490	DEFINE_SLOWCASE_OP(op_put_by_id)	494	DEFINE_SLOWCASE_OP(op_put_by_id)
491	DEFINE_SLOWCASE_OP(op_put_by_val)	495	DEFINE_SLOWCASE_OP(op_put_by_val)
492	DEFINE_SLOWCASE_OP(op_resolve_global)	496	DEFINE_SLOWCASE_OP(op_resolve_global)
Lines 526-531 void JIT::privateCompileSlowCases() Source/JavaScriptCore/jit/JIT.cpp_sec3
526		530
527	JITCode JIT::privateCompile(CodePtr* functionEntryArityCheck)	531	JITCode JIT::privateCompile(CodePtr* functionEntryArityCheck)
528	{	532	{
		533	#if ENABLE(JIT_VERBOSE_OSR)
		534	printf("Compiling JIT code!\n");
		535	#endif
		536
529	#if ENABLE(VALUE_PROFILER)	537	#if ENABLE(VALUE_PROFILER)
530	m_canBeOptimized = m_codeBlock->canCompileWithDFG();	538	m_canBeOptimized = m_codeBlock->canCompileWithDFG();
531	#endif	539	#endif
Lines 690-697 JITCode JIT::privateCompile(CodePtr* fun Source/JavaScriptCore/jit/JIT.cpp_sec4
690	info.callReturnLocation = m_codeBlock->structureStubInfo(m_methodCallCompilationInfo[i].propertyAccessIndex).callReturnLocation;	698	info.callReturnLocation = m_codeBlock->structureStubInfo(m_methodCallCompilationInfo[i].propertyAccessIndex).callReturnLocation;
691	}	699	}
692		700
693	#if ENABLE(DFG_JIT)	701	#if ENABLE(DFG_JIT) \|\| ENABLE(LLINT)
694	if (m_canBeOptimized) {	702	if (m_canBeOptimized
		703	#if ENABLE(LLINT)
		704	\|\| true
		705	#endif
		706	) {
695	CompactJITCodeMap::Encoder jitCodeMapEncoder;	707	CompactJITCodeMap::Encoder jitCodeMapEncoder;
696	for (unsigned bytecodeOffset = 0; bytecodeOffset < m_labels.size(); ++bytecodeOffset) {	708	for (unsigned bytecodeOffset = 0; bytecodeOffset < m_labels.size(); ++bytecodeOffset) {
697	if (m_labels[bytecodeOffset].isSet())	709	if (m_labels[bytecodeOffset].isSet())



        JITCode() { }
#endif
    public:
        enum JITType { None, HostCallThunk, InterpreterThunk, BaselineJIT, DFGJIT };
        
        static JITType bottomTierJIT()
        {

            return DFGJIT;
        }
        
        static bool isOptimizingJIT(JITType jitType)
        {
            return jitType == DFGJIT;
        }
        
        static bool isBaselineCode(JITType jitType)
        {
            return jitType == InterpreterThunk || jitType == BaselineJIT;
        }
        
#if ENABLE(JIT)
        JITCode()
            : m_jitType(None)
        {
        }


            : m_ref(ref)
            , m_jitType(jitType)
        {
            ASSERT(jitType != None);
        }
        
        bool operator !() const

Lines 33-47 Source/JavaScriptCore/jit/JITDriver.h_sec1
- Source/JavaScriptCore/jit/JITDriver.h -9 / +13 lines
33	#include "BytecodeGenerator.h"	33	#include "BytecodeGenerator.h"
34	#include "DFGDriver.h"	34	#include "DFGDriver.h"
35	#include "JIT.h"	35	#include "JIT.h"
		36	#include "LLIntEntrypoints.h"
36		37
37	namespace JSC {	38	namespace JSC {
38		39
39	template<typename CodeBlockType>	40	template<typename CodeBlockType>
40	inline bool jitCompileIfAppropriate(JSGlobalData& globalData, OwnPtr<CodeBlockType>& codeBlock, JITCode& jitCode, JITCode::JITType jitType)	41	inline bool jitCompileIfAppropriate(JSGlobalData& globalData, OwnPtr<CodeBlockType>& codeBlock, JITCode& jitCode, JITCode::JITType jitType)
41	{	42	{
		43	if (jitType == codeBlock->getJITType())
		44	return true;
		45
42	if (!globalData.canUseJIT())	46	if (!globalData.canUseJIT())
43	return true;	47	return true;
44		48
		49	codeBlock->unlinkIncomingCalls();
		50
45	bool dfgCompiled = false;	51	bool dfgCompiled = false;
46	if (jitType == JITCode::DFGJIT)	52	if (jitType == JITCode::DFGJIT)
47	dfgCompiled = DFG::tryCompile(globalData, codeBlock.get(), jitCode);	53	dfgCompiled = DFG::tryCompile(globalData, codeBlock.get(), jitCode);
Lines 55-64 inline bool jitCompileIfAppropriate(JSGl Source/JavaScriptCore/jit/JITDriver.h_sec2
55	}	61	}
56	jitCode = JIT::compile(&globalData, codeBlock.get());	62	jitCode = JIT::compile(&globalData, codeBlock.get());
57	}	63	}
58	#if !ENABLE(OPCODE_SAMPLING)	64	codeBlock->handleBytecodeDiscardingOpportunity();
59	if (!BytecodeGenerator::dumpsGeneratedCode())
60	codeBlock->handleBytecodeDiscardingOpportunity();
61	#endif
62	codeBlock->setJITCode(jitCode, MacroAssemblerCodePtr());	65	codeBlock->setJITCode(jitCode, MacroAssemblerCodePtr());
63		66
64	return true;	67	return true;
Lines 66-74 inline bool jitCompileIfAppropriate(JSGl Source/JavaScriptCore/jit/JITDriver.h_sec3
66		69
67	inline bool jitCompileFunctionIfAppropriate(JSGlobalData& globalData, OwnPtr<FunctionCodeBlock>& codeBlock, JITCode& jitCode, MacroAssemblerCodePtr& jitCodeWithArityCheck, SharedSymbolTable*& symbolTable, JITCode::JITType jitType)	70	inline bool jitCompileFunctionIfAppropriate(JSGlobalData& globalData, OwnPtr<FunctionCodeBlock>& codeBlock, JITCode& jitCode, MacroAssemblerCodePtr& jitCodeWithArityCheck, SharedSymbolTable*& symbolTable, JITCode::JITType jitType)
68	{	71	{
		72	if (jitType == codeBlock->getJITType())
		73	return true;
		74
69	if (!globalData.canUseJIT())	75	if (!globalData.canUseJIT())
70	return true;	76	return true;
71		77
		78	codeBlock->unlinkIncomingCalls();
		79
72	bool dfgCompiled = false;	80	bool dfgCompiled = false;
73	if (jitType == JITCode::DFGJIT)	81	if (jitType == JITCode::DFGJIT)
74	dfgCompiled = DFG::tryCompileFunction(globalData, codeBlock.get(), jitCode, jitCodeWithArityCheck);	82	dfgCompiled = DFG::tryCompileFunction(globalData, codeBlock.get(), jitCode, jitCodeWithArityCheck);
Lines 83-93 inline bool jitCompileFunctionIfAppropri Source/JavaScriptCore/jit/JITDriver.h_sec4
83	}	91	}
84	jitCode = JIT::compile(&globalData, codeBlock.get(), &jitCodeWithArityCheck);	92	jitCode = JIT::compile(&globalData, codeBlock.get(), &jitCodeWithArityCheck);
85	}	93	}
86	#if !ENABLE(OPCODE_SAMPLING)	94	codeBlock->handleBytecodeDiscardingOpportunity();
87	if (!BytecodeGenerator::dumpsGeneratedCode())
88	codeBlock->handleBytecodeDiscardingOpportunity();
89	#endif
90
91	codeBlock->setJITCode(jitCode, jitCodeWithArityCheck);	95	codeBlock->setJITCode(jitCode, jitCodeWithArityCheck);
92		96
93	return true;	97	return true;

Lines 64-70 ExceptionHandler genericThrow(JSGlobalDa Source/JavaScriptCore/jit/JITExceptions.cpp_sec1
- Source/JavaScriptCore/jit/JITExceptions.cpp -1 / +1 lines
64		64
65	ExceptionHandler jitThrow(JSGlobalData* globalData, ExecState* callFrame, JSValue exceptionValue, ReturnAddressPtr faultLocation)	65	ExceptionHandler jitThrow(JSGlobalData* globalData, ExecState* callFrame, JSValue exceptionValue, ReturnAddressPtr faultLocation)
66	{	66	{
67	return genericThrow(globalData, callFrame, exceptionValue, callFrame->codeBlock()->bytecodeOffset(faultLocation));	67	return genericThrow(globalData, callFrame, exceptionValue, callFrame->codeBlock()->bytecodeOffset(callFrame, faultLocation));
68	}	68	}
69		69
70	}	70	}



    unsigned bytecodeIndex = stackFrame.args[0].int32();

#if ENABLE(JIT_VERBOSE_OSR)
    printf("%p: Entered optimize_from_loop with executeCounter = %d, reoptimizationRetryCounter = %u, optimizationDelayCounter = %u\n", codeBlock, codeBlock->jitExecuteCounter(), codeBlock->reoptimizationRetryCounter(), codeBlock->optimizationDelayCounter());
#endif

    if (codeBlock->hasOptimizedReplacement()) {

    return result;
}

inline CallFrame* arityCheckFor(CallFrame* callFrame, RegisterFile* registerFile, CodeSpecializationKind kind)
{
    JSFunction* callee = asFunction(callFrame->callee());
    ASSERT(!callee->isHostFunction());
    CodeBlock* newCodeBlock = &callee->jsExecutable()->generatedBytecodeFor(kind);
    int argumentCountIncludingThis = callFrame->argumentCountIncludingThis();

    // This ensures enough space for the worst case scenario of zero arguments passed by the caller.
    if (!registerFile->grow(callFrame->registers() + newCodeBlock->numParameters() + newCodeBlock->m_numCalleeRegisters))
        return 0;

    ASSERT(argumentCountIncludingThis < newCodeBlock->numParameters());

    // Too few arguments -- copy call frame and arguments, then fill in missing arguments with undefined.
    size_t delta = newCodeBlock->numParameters() - argumentCountIncludingThis;
    Register* src = callFrame->registers();
    Register* dst = callFrame->registers() + delta;

    int i;
    int end = -CallFrame::offsetFor(argumentCountIncludingThis);
    for (i = -1; i >= end; --i)
        dst[i] = src[i];

    end -= delta;
    for ( ; i >= end; --i)
        dst[i] = jsUndefined();

    CallFrame* newCallFrame = CallFrame::create(dst);
    ASSERT((void*)newCallFrame <= registerFile->end());
    return newCallFrame;
}

DEFINE_STUB_FUNCTION(void*, op_call_arityCheck)
{
    STUB_INIT_STACK_FRAME(stackFrame);

    CallFrame* callFrame = stackFrame.callFrame;

    CallFrame* newCallFrame = CommonSlowPaths::arityCheckFor(callFrame, stackFrame.registerFile, CodeForCall);
    if (!newCallFrame)
        return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));



    CallFrame* callFrame = stackFrame.callFrame;

    CallFrame* newCallFrame = CommonSlowPaths::arityCheckFor(callFrame, stackFrame.registerFile, CodeForConstruct);
    if (!newCallFrame)
        return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));




#ifndef JSInterfaceJIT_h
#define JSInterfaceJIT_h

#include "BytecodeConventions.h"
#include "JITCode.h"
#include "JITStubs.h"
#include "JSString.h"
#include "JSValue.h"
#include "MacroAssembler.h"
#include "RegisterFile.h"



/*
 * Copyright (C) 2012 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 LLIntCommon_h
#define LLIntCommon_h

#define LLINT_EXECUTION_TRACING 0
#define LLINT_HELPER_TRACING 0

#endif // LLIntCommon_h




/*
 * Copyright (C) 2011 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. 
 */

#include "config.h"
#include "LLIntData.h"

#if ENABLE(LLINT)

#include "Instruction.h"
#include "LowLevelInterpreter.h"
#include "Opcode.h"

namespace JSC { namespace LLInt {

Data::Data()
    : m_exceptionInstructions(new Instruction[maxOpcodeLength + 1])
    , m_opcodeMap(new Opcode[numOpcodeIDs])
{
    for (int i = 0; i < maxOpcodeLength + 1; ++i)
        m_exceptionInstructions[i].u.pointer = bitwise_cast<void*>(&llint_throw_from_helper_trampoline);
#define OPCODE_ENTRY(opcode, length) m_opcodeMap[opcode] = bitwise_cast<void*>(&llint_##opcode);
    FOR_EACH_OPCODE_ID(OPCODE_ENTRY);
#undef OPCODE_ENTRY
}

Data::~Data()
{
    delete[] m_exceptionInstructions;
    delete[] m_opcodeMap;
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2011 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 LLIntData_h
#define LLIntData_h

#include "Opcode.h"
#include <wtf/Platform.h>

namespace JSC {

struct Instruction;

namespace LLInt {

#if ENABLE(LLINT)
class Data {
public:
    Data();
    ~Data();
    
    Instruction* exceptionInstructions()
    {
        return m_exceptionInstructions;
    }
    
    Opcode* opcodeMap()
    {
        return m_opcodeMap;
    }
private:
    Instruction* m_exceptionInstructions;
    Opcode* m_opcodeMap;
};
#else // ENABLE(LLINT)

#if COMPILER(CLANG)
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wmissing-noreturn"
#endif

class Data {
public:
    Instruction* exceptionInstructions()
    {
        ASSERT_NOT_REACHED();
        return 0;
    }
    
    Opcode* opcodeMap()
    {
        ASSERT_NOT_REACHED();
        return 0;
    }
};

#if COMPILER(CLANG)
#pragma clang diagnostic pop
#endif

#endif // ENABLE(LLINT)

} } // namespace JSC::LLInt

#endif // LLIntData_h




/*
 * Copyright (C) 2012 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. 
 */

#include "config.h"
#include "LLIntEntrypoints.h"

#if ENABLE(LLINT)

#include "JITCode.h"
#include "JSGlobalData.h"
#include "LLIntThunks.h"
#include "LowLevelInterpreter.h"

namespace JSC { namespace LLInt {

void getFunctionEntrypoint(JSGlobalData& globalData, CodeSpecializationKind kind, JITCode& jitCode, MacroAssemblerCodePtr& arityCheck)
{
    if (!globalData.canUseJIT()) {
        if (kind == CodeForCall) {
            jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_call_prologue))));
            arityCheck = MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_call_arity_check));
            return;
        }

        ASSERT(kind == CodeForConstruct);
        jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_construct_prologue))));
        arityCheck = MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_construct_arity_check));
        return;
    }
    
    if (kind == CodeForCall) {
        jitCode = JITCode(globalData.getCTIStub(functionForCallEntryThunkGenerator), JITCode::InterpreterThunk);
        arityCheck = globalData.getCTIStub(functionForCallArityCheckThunkGenerator).code();
        return;
    }

    ASSERT(kind == CodeForConstruct);
    jitCode = JITCode(globalData.getCTIStub(functionForConstructEntryThunkGenerator), JITCode::InterpreterThunk);
    arityCheck = globalData.getCTIStub(functionForConstructArityCheckThunkGenerator).code();
}

void getEvalEntrypoint(JSGlobalData& globalData, JITCode& jitCode)
{
    if (!globalData.canUseJIT()) {
        jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_eval_prologue))));
        return;
    }
    
    jitCode = JITCode(globalData.getCTIStub(evalEntryThunkGenerator), JITCode::InterpreterThunk);
}

void getProgramEntrypoint(JSGlobalData& globalData, JITCode& jitCode)
{
    if (!globalData.canUseJIT()) {
        jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_program_prologue))));
        return;
    }
    
    jitCode = JITCode(globalData.getCTIStub(programEntryThunkGenerator), JITCode::InterpreterThunk);
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2012 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 LLIntEntrypoints_h
#define LLIntEntrypoints_h

#include <wtf/Platform.h>

#if ENABLE(LLINT)

#include "CodeSpecializationKind.h"

namespace JSC {

class EvalCodeBlock;
class JITCode;
class JSGlobalData;
class MacroAssemblerCodePtr;
class MacroAssemblerCodeRef;
class ProgramCodeBlock;

namespace LLInt {

void getFunctionEntrypoint(JSGlobalData&, CodeSpecializationKind, JITCode&, MacroAssemblerCodePtr& arityCheck);
void getEvalEntrypoint(JSGlobalData&, JITCode&);
void getProgramEntrypoint(JSGlobalData&, JITCode&);

inline void getEntrypoint(JSGlobalData& globalData, EvalCodeBlock*, JITCode& jitCode)
{
    getEvalEntrypoint(globalData, jitCode);
}

inline void getEntrypoint(JSGlobalData& globalData, ProgramCodeBlock*, JITCode& jitCode)
{
    getProgramEntrypoint(globalData, jitCode);
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)

#endif // LLIntEntrypoints_h



/*
 * Copyright (C) 2011 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. 
 */

#include "config.h"
#include "LLIntExceptions.h"

#if ENABLE(LLINT)

#include "CallFrame.h"
#include "CodeBlock.h"
#include "Instruction.h"
#include "JITExceptions.h"
#include "LLIntCommon.h"
#include "LowLevelInterpreter.h"

namespace JSC { namespace LLInt {

void interpreterThrowInCaller(ExecState* exec)
{
    JSGlobalData* globalData = &exec->globalData();
#if LLINT_HELPER_TRACING
    printf("Throwing exception %s.\n", globalData->exception.description());
#endif
    genericThrow(
        globalData, exec->callerFrame(), globalData->exception,
        exec->callerFrame()->codeBlock()->bytecodeOffset(exec->callerFrame(), exec->returnPC()));
}

Instruction* returnToThrowForThrownException(ExecState* exec)
{
    return exec->globalData().llintData.exceptionInstructions();
}

Instruction* returnToThrow(ExecState* exec, Instruction* pc)
{
    JSGlobalData* globalData = &exec->globalData();
#if LLINT_HELPER_TRACING
    printf("Throwing exception %s (returnToThrow).\n", globalData->exception.description());
#endif
    genericThrow(globalData, exec, globalData->exception, pc - exec->codeBlock()->instructions().begin());
    
    return globalData->llintData.exceptionInstructions();
}

void* callToThrow(ExecState* exec, Instruction* pc)
{
    JSGlobalData* globalData = &exec->globalData();
#if LLINT_HELPER_TRACING
    printf("Throwing exception %s (callToThrow).\n", globalData->exception.description());
#endif
    genericThrow(globalData, exec, globalData->exception, pc - exec->codeBlock()->instructions().begin());
    
    return bitwise_cast<void*>(&llint_throw_during_call_trampoline);
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2011 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 LLIntExceptions_h
#define LLIntExceptions_h

#include <wtf/Platform.h>
#include <wtf/StdLibExtras.h>

#if ENABLE(LLINT)

namespace JSC {

class ExecState;
struct Instruction;

namespace LLInt {

// Throw the currently active exception in the context of the caller's call frame.
void interpreterThrowInCaller(ExecState*);

// Tells you where to jump to if you want to return-to-throw, after you've already
// set up all information needed to throw the exception.
Instruction* returnToThrowForThrownException(ExecState*);

// Saves the current PC in the global data for safe-keeping, and gives you a PC
// that you can tell the interpreter to go to, which when advanced between 1
// and 9 slots will give you an "instruction" that threads to the interpreter's
// exception handler. Note that if you give it the PC for exception handling,
// it's smart enough to just return that PC without doing anything else; this
// lets you thread exception handling through common helper functions used by
// other helpers.
Instruction* returnToThrow(ExecState*, Instruction*);

// Use this when you're throwing to a call thunk.
void* callToThrow(ExecState*, Instruction*);

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)

#endif // LLIntExceptions_h



/*
 * Copyright (C) 2011, 2012 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. 
 */

#include "config.h"
#include "LLIntHelpers.h"

#if ENABLE(LLINT)

#include "Arguments.h"
#include "CallFrame.h"
#include "CommonSlowPaths.h"
#include "HostCallReturnValue.h"
#include "Interpreter.h"
#include "JIT.h"
#include "JITDriver.h"
#include "JSActivation.h"
#include "JSByteArray.h"
#include "JSGlobalObjectFunctions.h"
#include "JSPropertyNameIterator.h"
#include "JSStaticScopeObject.h"
#include "JSString.h"
#include "JSValue.h"
#include "LLIntCommon.h"
#include "LLIntExceptions.h"
#include "LowLevelInterpreter.h"
#include "Operations.h"

namespace JSC { namespace LLInt {

#define LLINT_OP(index) (exec->uncheckedR(pc[index].u.operand))
#define LLINT_OP_C(index) (exec->r(pc[index].u.operand))

#define LLINT_RETURN_TWO(first, second) do {       \
        union {                                    \
            struct {                               \
                void* a;                           \
                void* b;                           \
            } pair;                                \
            int64_t i;                             \
        } __rt_u;                                  \
        __rt_u.pair.a = first;                     \
        __rt_u.pair.b = second;                    \
        return __rt_u.i;                           \
    } while (false)

#define LLINT_END_IMPL() LLINT_RETURN_TWO(pc, exec)

#define LLINT_THROW(exceptionToThrow) do {                        \
        JSGlobalData& __t_globalData = exec->globalData();        \
        __t_globalData.exception = (exceptionToThrow);            \
        pc = returnToThrow(exec, pc);                             \
        LLINT_END_IMPL();                                         \
    } while (false)

#define LLINT_CHECK_EXCEPTION() do {                    \
        if (UNLIKELY(exec->globalData().exception)) {   \
            pc = returnToThrow(exec, pc);               \
            LLINT_END_IMPL();                           \
        }                                               \
    } while (false)

#define LLINT_END() do {                        \
        LLINT_CHECK_EXCEPTION();                \
        LLINT_END_IMPL();                       \
    } while (false)

#define LLINT_BRANCH(opcode, condition) do {                      \
        bool __b_condition = (condition);                         \
        LLINT_CHECK_EXCEPTION();                                  \
        if (__b_condition)                                        \
            pc += pc[OPCODE_LENGTH(opcode) - 1].u.operand;        \
        else                                                      \
            pc += OPCODE_LENGTH(opcode);                          \
        LLINT_END_IMPL();                                         \
    } while (false)

#define LLINT_RETURN(value) do {                \
        JSValue __r_returnValue = (value);      \
        LLINT_CHECK_EXCEPTION();                \
        LLINT_OP(1) = __r_returnValue;          \
        LLINT_END_IMPL();                       \
    } while (false)

#define LLINT_RETURN_PROFILED(opcode, value) do {               \
        JSValue __rp_returnValue = (value);                     \
        LLINT_CHECK_EXCEPTION();                                \
        LLINT_OP(1) = __rp_returnValue;                         \
        pc[OPCODE_LENGTH(opcode) - 1].u.profile->m_buckets[0] = \
            JSValue::encode(__rp_returnValue);                  \
        LLINT_END_IMPL();                                       \
    } while (false)

#define LLINT_CALL_END_IMPL(exec, callTarget) LLINT_RETURN_TWO((callTarget), (exec))

#define LLINT_CALL_THROW(exec, pc, exceptionToThrow) do {               \
        ExecState* __ct_exec = (exec);                                  \
        Instruction* __ct_pc = (pc);                                    \
        JSGlobalData& __ct_globalData = (__ct_exec)->globalData();      \
        __ct_globalData.exception = (exceptionToThrow);                 \
        LLINT_CALL_END_IMPL(__ct_exec, callToThrow(__ct_exec, __ct_pc)); \
    } while (false)

#define LLINT_CALL_CHECK_EXCEPTION(exec, pc) do {                       \
        ExecState* __cce_exec = (exec);                                 \
        Instruction* __cce_pc = (pc);                                   \
        if (UNLIKELY(__cce_exec->globalData().exception))               \
            LLINT_CALL_END_IMPL(__cce_exec, callToThrow(__cce_exec, __cce_pc)); \
    } while (false)

#define LLINT_CALL_RETURN(exec, pc, callTarget) do {                    \
        ExecState* __cr_exec = (exec);                                  \
        Instruction* __cr_pc = (pc);                                    \
        void* __cr_callTarget = (callTarget);                           \
        LLINT_CALL_CHECK_EXCEPTION(__cr_exec->callerFrame(), __cr_pc);  \
        LLINT_CALL_END_IMPL(__cr_exec, __cr_callTarget);                \
    } while (false)

extern "C" HelperReturnType llint_trace_operand(ExecState* exec, Instruction* pc, int fromWhere, int operand)
{
    printf("%p / %p: executing bc#%zu, op#%u: Trace(%d): %d: %d\n",
           exec->codeBlock(),
           exec,
           static_cast<intptr_t>(pc - exec->codeBlock()->instructions().begin()),
           exec->globalData().interpreter->getOpcodeID(pc[0].u.opcode),
           fromWhere,
           operand,
           pc[operand].u.operand);
    LLINT_END();
}

extern "C" HelperReturnType llint_trace_value(ExecState* exec, Instruction* pc, int fromWhere, int operand)
{
    JSValue value = LLINT_OP_C(operand).jsValue();
    union {
        struct {
            uint32_t tag;
            uint32_t payload;
        } bits;
        EncodedJSValue asValue;
    } u;
    u.asValue = JSValue::encode(value);
    printf("%p / %p: executing bc#%zu, op#%u: Trace(%d): %d: %d: %08x:%08x",
           exec->codeBlock(),
           exec,
           static_cast<intptr_t>(pc - exec->codeBlock()->instructions().begin()),
           exec->globalData().interpreter->getOpcodeID(pc[0].u.opcode),
           fromWhere,
           operand,
           pc[operand].u.operand,
           u.bits.tag,
           u.bits.payload);
#ifndef NDEBUG
    printf(": %s", value.description());
#endif
    printf("\n");
    LLINT_END();
}

LLINT_HELPER_DECL(trace_prologue)
{
    printf("%p / %p: in prologue.\n", exec->codeBlock(), exec);
    LLINT_END();
}

static void traceFunctionPrologue(ExecState* exec, const char* comment, CodeSpecializationKind kind)
{
    JSFunction* callee = asFunction(exec->callee());
    FunctionExecutable* executable = callee->jsExecutable();
    CodeBlock* codeBlock = &executable->generatedBytecodeFor(kind);
    printf("%p / %p: in %s of function %p, executable %p; numVars = %u, numParameters = %u, numCalleeRegisters = %u.\n",
           codeBlock, exec, comment, callee, executable,
           codeBlock->m_numVars, codeBlock->numParameters(), codeBlock->m_numCalleeRegisters);
}

LLINT_HELPER_DECL(trace_prologue_function_for_call)
{
    traceFunctionPrologue(exec, "call prologue", CodeForCall);
    LLINT_END();
}

LLINT_HELPER_DECL(trace_prologue_function_for_construct)
{
    traceFunctionPrologue(exec, "construct prologue", CodeForConstruct);
    LLINT_END();
}

LLINT_HELPER_DECL(trace_arityCheck_for_call)
{
    traceFunctionPrologue(exec, "call arity check", CodeForCall);
    LLINT_END();
}

LLINT_HELPER_DECL(trace_arityCheck_for_construct)
{
    traceFunctionPrologue(exec, "construct arity check", CodeForConstruct);
    LLINT_END();
}

LLINT_HELPER_DECL(trace)
{
    printf("%p / %p: executing bc#%zu, ",
           exec->codeBlock(),
           exec,
           static_cast<intptr_t>(pc - exec->codeBlock()->instructions().begin()));
#ifndef NDEBUG
    printf("%s, ", opcodeNames[exec->globalData().interpreter->getOpcodeID(pc[0].u.opcode)]);
#else
    printf("op#%u, ", exec->globalData().interpreter->getOpcodeID(pc[0].u.opcode));
#endif
    printf("scope %p\n", exec->scopeChain());
    LLINT_END();
}

LLINT_HELPER_DECL(special_trace)
{
    printf("%p / %p: executing special case bc#%zu, op#%u, return PC is %p\n",
           exec->codeBlock(),
           exec,
           static_cast<intptr_t>(pc - exec->codeBlock()->instructions().begin()),
           exec->globalData().interpreter->getOpcodeID(pc[0].u.opcode),
           exec->returnPC().value());
    LLINT_END();
}

inline bool shouldJIT(ExecState* exec)
{
    // You can modify this to turn off JITting without rebuilding the world.
    return exec->globalData().canUseJIT();
}

enum EntryKind { Prologue, ArityCheck };
static HelperReturnType entryOSR(ExecState* exec, Instruction* pc, CodeBlock* codeBlock, const char *name, EntryKind kind)
{
#if ENABLE(JIT_VERBOSE_OSR)
    printf("%p: Entered %s with executeCounter = %d\n", codeBlock, name, codeBlock->llintExecuteCounter());
#endif
    
    if (!shouldJIT(exec)) {
        codeBlock->dontJITAnytimeSoon();
        LLINT_RETURN_TWO(0, exec);
    }
    if (!codeBlock->jitCompile(exec->globalData())) {
#if ENABLE(JIT_VERBOSE_OSR)
        printf("    Code was already compiled.\n");
#endif
    }
    codeBlock->jitSoon();
    if (kind == Prologue)
        LLINT_RETURN_TWO(codeBlock->getJITCode().executableAddressAtOffset(0), exec);
    ASSERT(kind == ArityCheck);
    LLINT_RETURN_TWO(codeBlock->getJITCodeWithArityCheck().executableAddress(), exec);
}

LLINT_HELPER_DECL(entry_osr)
{
    return entryOSR(exec, pc, exec->codeBlock(), "entry_osr", Prologue);
}

LLINT_HELPER_DECL(entry_osr_function_for_call)
{
    return entryOSR(exec, pc, &asFunction(exec->callee())->jsExecutable()->generatedBytecodeFor(CodeForCall), "entry_osr_function_for_call", Prologue);
}

LLINT_HELPER_DECL(entry_osr_function_for_construct)
{
    return entryOSR(exec, pc, &asFunction(exec->callee())->jsExecutable()->generatedBytecodeFor(CodeForConstruct), "entry_osr_function_for_construct", Prologue);
}

LLINT_HELPER_DECL(entry_osr_function_for_call_arityCheck)
{
    return entryOSR(exec, pc, &asFunction(exec->callee())->jsExecutable()->generatedBytecodeFor(CodeForCall), "entry_osr_function_for_call_arityCheck", ArityCheck);
}

LLINT_HELPER_DECL(entry_osr_function_for_construct_arityCheck)
{
    return entryOSR(exec, pc, &asFunction(exec->callee())->jsExecutable()->generatedBytecodeFor(CodeForConstruct), "entry_osr_function_for_construct_arityCheck", ArityCheck);
}

LLINT_HELPER_DECL(loop_osr)
{
    CodeBlock* codeBlock = exec->codeBlock();
    
#if ENABLE(JIT_VERBOSE_OSR)
    printf("%p: Entered loop_osr with executeCounter = %d\n", codeBlock, codeBlock->llintExecuteCounter());
#endif
    
    if (!shouldJIT(exec)) {
        codeBlock->dontJITAnytimeSoon();
        LLINT_RETURN_TWO(0, exec);
    }
    
    if (!codeBlock->jitCompile(exec->globalData())) {
#if ENABLE(JIT_VERBOSE_OSR)
        printf("    Code was already compiled.\n");
#endif
    }
    codeBlock->jitSoon();
    
    ASSERT(codeBlock->getJITType() == JITCode::BaselineJIT);
    
    Vector<BytecodeAndMachineOffset> map;
    codeBlock->jitCodeMap()->decode(map);
    BytecodeAndMachineOffset* mapping = binarySearch<BytecodeAndMachineOffset, unsigned, BytecodeAndMachineOffset::getBytecodeIndex>(map.begin(), map.size(), pc - codeBlock->instructions().begin());
    ASSERT(mapping);
    ASSERT(mapping->m_bytecodeIndex == static_cast<unsigned>(pc - codeBlock->instructions().begin()));
    
    void* jumpTarget = codeBlock->getJITCode().executableAddressAtOffset(mapping->m_machineCodeOffset);
    ASSERT(jumpTarget);
    
    LLINT_RETURN_TWO(jumpTarget, exec);
}

LLINT_HELPER_DECL(replace)
{
    CodeBlock* codeBlock = exec->codeBlock();
    
#if ENABLE(JIT_VERBOSE_OSR)
    printf("%p: Entered replace with executeCounter = %d\n", codeBlock, codeBlock->llintExecuteCounter());
#endif
    
    if (shouldJIT(exec)) {
        if (!codeBlock->jitCompile(exec->globalData())) {
#if ENABLE(JIT_VERBOSE_OSR)
            printf("    Code was already compiled.\n");
#endif
        }
        codeBlock->jitSoon();
    } else
        codeBlock->dontJITAnytimeSoon();
    LLINT_END();
}

LLINT_HELPER_DECL(register_file_check)
{
#if LLINT_HELPER_TRACING
    printf("Checking stack height with exec = %p.\n", exec);
    printf("CodeBlock = %p.\n", exec->codeBlock());
    printf("Num callee registers = %u.\n", exec->codeBlock()->m_numCalleeRegisters);
    printf("Num vars = %u.\n", exec->codeBlock()->m_numVars);
    printf("Current end is at %p.\n", exec->globalData().interpreter->registerFile().end());
#endif
    ASSERT(&exec->registers()[exec->codeBlock()->m_numCalleeRegisters] > exec->globalData().interpreter->registerFile().end());
    if (UNLIKELY(!exec->globalData().interpreter->registerFile().grow(&exec->registers()[exec->codeBlock()->m_numCalleeRegisters]))) {
        exec = exec->callerFrame();
        exec->globalData().exception = createStackOverflowError(exec);
        interpreterThrowInCaller(exec);
        pc = returnToThrowForThrownException(exec);
    }
    LLINT_END_IMPL();
}

LLINT_HELPER_DECL(helper_call_arityCheck)
{
    ExecState* newExec = CommonSlowPaths::arityCheckFor(exec, &exec->globalData().interpreter->registerFile(), CodeForCall);
    if (!newExec) {
        exec = exec->callerFrame();
        exec->globalData().exception = createStackOverflowError(exec);
        interpreterThrowInCaller(exec);
        LLINT_RETURN_TWO(bitwise_cast<void*>(static_cast<uintptr_t>(1)), exec);
    }
    LLINT_RETURN_TWO(0, newExec);
}

LLINT_HELPER_DECL(helper_construct_arityCheck)
{
    ExecState* newExec = CommonSlowPaths::arityCheckFor(exec, &exec->globalData().interpreter->registerFile(), CodeForConstruct);
    if (!newExec) {
        exec = exec->callerFrame();
        exec->globalData().exception = createStackOverflowError(exec);
        interpreterThrowInCaller(exec);
        LLINT_RETURN_TWO(bitwise_cast<void*>(static_cast<uintptr_t>(1)), exec);
    }
    LLINT_RETURN_TWO(0, newExec);
}

LLINT_HELPER_DECL(helper_create_activation)
{
#if LLINT_HELPER_TRACING
    printf("Creating an activation, exec = %p!\n", exec);
#endif
    JSActivation* activation = JSActivation::create(exec->globalData(), exec, static_cast<FunctionExecutable*>(exec->codeBlock()->ownerExecutable()));
    exec->setScopeChain(exec->scopeChain()->push(activation));
    LLINT_RETURN(JSValue(activation));
}

LLINT_HELPER_DECL(helper_create_arguments)
{
    JSValue arguments = JSValue(Arguments::create(exec->globalData(), exec));
    LLINT_CHECK_EXCEPTION();
    exec->uncheckedR(pc[1].u.operand) = arguments;
    exec->uncheckedR(unmodifiedArgumentsRegister(pc[1].u.operand)) = arguments;
    LLINT_END();
}

LLINT_HELPER_DECL(helper_create_this)
{
    JSFunction* constructor = asFunction(exec->callee());
    
#if !ASSERT_DISABLED
    ConstructData constructData;
    ASSERT(constructor->methodTable()->getConstructData(constructor, constructData) == ConstructTypeJS);
#endif
    
    Structure* structure;
    JSValue proto = LLINT_OP(2).jsValue();
    if (proto.isObject())
        structure = asObject(proto)->inheritorID(exec->globalData());
    else
        structure = constructor->scope()->globalObject->emptyObjectStructure();
    
    LLINT_RETURN(constructEmptyObject(exec, structure));
}

LLINT_HELPER_DECL(helper_convert_this)
{
    JSValue v1 = LLINT_OP(1).jsValue();
    ASSERT(v1.isPrimitive());
    LLINT_RETURN(v1.toThisObject(exec));
}

LLINT_HELPER_DECL(helper_new_object)
{
    LLINT_RETURN(constructEmptyObject(exec));
}

LLINT_HELPER_DECL(helper_new_array)
{
    LLINT_RETURN(constructArray(exec, bitwise_cast<JSValue*>(&LLINT_OP(2)), pc[3].u.operand));
}

LLINT_HELPER_DECL(helper_new_array_buffer)
{
    LLINT_RETURN(constructArray(exec, exec->codeBlock()->constantBuffer(pc[2].u.operand), pc[3].u.operand));
}

LLINT_HELPER_DECL(helper_new_regexp)
{
    RegExp* regExp = exec->codeBlock()->regexp(pc[2].u.operand);
    if (!regExp->isValid())
        LLINT_THROW(createSyntaxError(exec, "Invalid flag supplied to RegExp constructor."));
    LLINT_RETURN(RegExpObject::create(exec->globalData(), exec->lexicalGlobalObject(), exec->lexicalGlobalObject()->regExpStructure(), regExp));
}

LLINT_HELPER_DECL(helper_not)
{
    LLINT_RETURN(jsBoolean(!LLINT_OP_C(2).jsValue().toBoolean(exec)));
}

LLINT_HELPER_DECL(helper_eq)
{
    LLINT_RETURN(jsBoolean(JSValue::equal(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_neq)
{
    LLINT_RETURN(jsBoolean(!JSValue::equal(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_stricteq)
{
    LLINT_RETURN(jsBoolean(JSValue::strictEqual(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_nstricteq)
{
    LLINT_RETURN(jsBoolean(!JSValue::strictEqual(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_less)
{
    LLINT_RETURN(jsBoolean(jsLess<true>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_lesseq)
{
    LLINT_RETURN(jsBoolean(jsLessEq<true>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_greater)
{
    LLINT_RETURN(jsBoolean(jsLess<false>(exec, LLINT_OP_C(3).jsValue(), LLINT_OP_C(2).jsValue())));
}

LLINT_HELPER_DECL(helper_greatereq)
{
    LLINT_RETURN(jsBoolean(jsLessEq<false>(exec, LLINT_OP_C(3).jsValue(), LLINT_OP_C(2).jsValue())));
}

LLINT_HELPER_DECL(helper_pre_inc)
{
    LLINT_RETURN(jsNumber(LLINT_OP(1).jsValue().toNumber(exec) + 1));
}

LLINT_HELPER_DECL(helper_pre_dec)
{
    LLINT_RETURN(jsNumber(LLINT_OP(1).jsValue().toNumber(exec) - 1));
}

LLINT_HELPER_DECL(helper_post_inc)
{
    double result = LLINT_OP(2).jsValue().toNumber(exec);
    LLINT_OP(2) = jsNumber(result + 1);
    LLINT_RETURN(jsNumber(result));
}

LLINT_HELPER_DECL(helper_post_dec)
{
    double result = LLINT_OP(2).jsValue().toNumber(exec);
    LLINT_OP(2) = jsNumber(result - 1);
    LLINT_RETURN(jsNumber(result));
}

LLINT_HELPER_DECL(helper_to_jsnumber)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toNumber(exec)));
}

LLINT_HELPER_DECL(helper_negate)
{
    LLINT_RETURN(jsNumber(-LLINT_OP_C(2).jsValue().toNumber(exec)));
}

LLINT_HELPER_DECL(helper_add)
{
    JSValue v1 = LLINT_OP_C(2).jsValue();
    JSValue v2 = LLINT_OP_C(3).jsValue();
    
#if LLINT_HELPER_TRACING
    printf("Trying to add %s", v1.description());
    printf(" to %s.\n", v2.description());
#endif
    
    if (v1.isString() && !v2.isObject())
        LLINT_RETURN(jsString(exec, asString(v1), v2.toString(exec)));
    
    if (v1.isNumber() && v2.isNumber())
        LLINT_RETURN(jsNumber(v1.asNumber() + v2.asNumber()));
    
    LLINT_RETURN(jsAddSlowCase(exec, v1, v2));
}

LLINT_HELPER_DECL(helper_mul)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toNumber(exec) * LLINT_OP_C(3).jsValue().toNumber(exec)));
}

LLINT_HELPER_DECL(helper_sub)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toNumber(exec) - LLINT_OP_C(3).jsValue().toNumber(exec)));
}

LLINT_HELPER_DECL(helper_div)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toNumber(exec) / LLINT_OP_C(3).jsValue().toNumber(exec)));
}

LLINT_HELPER_DECL(helper_mod)
{
    LLINT_RETURN(jsNumber(fmod(LLINT_OP_C(2).jsValue().toNumber(exec), LLINT_OP_C(3).jsValue().toNumber(exec))));
}

LLINT_HELPER_DECL(helper_lshift)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toInt32(exec) << LLINT_OP_C(3).jsValue().toUInt32(exec)));
}

LLINT_HELPER_DECL(helper_rshift)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toInt32(exec) >> LLINT_OP_C(3).jsValue().toUInt32(exec)));
}

LLINT_HELPER_DECL(helper_urshift)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toUInt32(exec) >> LLINT_OP_C(3).jsValue().toUInt32(exec)));
}

LLINT_HELPER_DECL(helper_bitand)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toInt32(exec) & LLINT_OP_C(3).jsValue().toInt32(exec)));
}

LLINT_HELPER_DECL(helper_bitor)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toInt32(exec) | LLINT_OP_C(3).jsValue().toInt32(exec)));
}

LLINT_HELPER_DECL(helper_bitxor)
{
    LLINT_RETURN(jsNumber(LLINT_OP_C(2).jsValue().toInt32(exec) ^ LLINT_OP_C(3).jsValue().toInt32(exec)));
}

LLINT_HELPER_DECL(helper_bitnot)
{
    LLINT_RETURN(jsNumber(~LLINT_OP_C(2).jsValue().toInt32(exec)));
}

LLINT_HELPER_DECL(helper_check_has_instance)
{
    JSValue baseVal = LLINT_OP_C(1).jsValue();
#ifndef NDEBUG
    TypeInfo typeInfo(UnspecifiedType);
    ASSERT(!baseVal.isObject()
           || !(typeInfo = asObject(baseVal)->structure()->typeInfo()).implementsHasInstance());
#endif
    LLINT_THROW(createInvalidParamError(exec, "instanceof", baseVal));
}

LLINT_HELPER_DECL(helper_instanceof)
{
    LLINT_RETURN(jsBoolean(CommonSlowPaths::opInstanceOfSlow(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue(), LLINT_OP_C(4).jsValue())));
}

LLINT_HELPER_DECL(helper_typeof)
{
    LLINT_RETURN(jsTypeStringForValue(exec, LLINT_OP_C(2).jsValue()));
}

LLINT_HELPER_DECL(helper_is_undefined)
{
    JSValue v = LLINT_OP_C(2).jsValue();
    LLINT_RETURN(jsBoolean(v.isCell() ? v.asCell()->structure()->typeInfo().masqueradesAsUndefined() : v.isUndefined()));
}

LLINT_HELPER_DECL(helper_is_boolean)
{
    LLINT_RETURN(jsBoolean(LLINT_OP_C(2).jsValue().isBoolean()));
}

LLINT_HELPER_DECL(helper_is_number)
{
    LLINT_RETURN(jsBoolean(LLINT_OP_C(2).jsValue().isNumber()));
}

LLINT_HELPER_DECL(helper_is_string)
{
    LLINT_RETURN(jsBoolean(isJSString(LLINT_OP_C(2).jsValue())));
}

LLINT_HELPER_DECL(helper_is_object)
{
    LLINT_RETURN(jsBoolean(jsIsObjectType(LLINT_OP_C(2).jsValue())));
}

LLINT_HELPER_DECL(helper_is_function)
{
    LLINT_RETURN(jsBoolean(jsIsFunctionType(LLINT_OP_C(2).jsValue())));
}

LLINT_HELPER_DECL(helper_in)
{
    LLINT_RETURN(jsBoolean(CommonSlowPaths::opIn(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue())));
}

LLINT_HELPER_DECL(helper_resolve)
{
    LLINT_RETURN_PROFILED(op_resolve, CommonSlowPaths::opResolve(exec, exec->codeBlock()->identifier(pc[2].u.operand)));
}

LLINT_HELPER_DECL(helper_resolve_skip)
{
    LLINT_RETURN_PROFILED(
        op_resolve_skip,
        CommonSlowPaths::opResolveSkip(
            exec,
            exec->codeBlock()->identifier(pc[2].u.operand),
            pc[3].u.operand));
}

static JSValue resolveGlobal(ExecState* exec, Instruction* pc)
{
    CodeBlock* codeBlock = exec->codeBlock();
    JSGlobalObject* globalObject = codeBlock->globalObject();
    ASSERT(globalObject->isGlobalObject());
    int property = pc[2].u.operand;
    Structure* structure = pc[3].u.structure.get();
    
    ASSERT_UNUSED(structure, structure != globalObject->structure());
    
    Identifier& ident = codeBlock->identifier(property);
    PropertySlot slot(globalObject);
    
    if (globalObject->getPropertySlot(exec, ident, slot)) {
        JSValue result = slot.getValue(exec, ident);
        if (slot.isCacheableValue() && !globalObject->structure()->isUncacheableDictionary()
            && slot.slotBase() == globalObject) {
            pc[3].u.structure.set(
                exec->globalData(), codeBlock->ownerExecutable(), globalObject->structure());
            pc[4] = slot.cachedOffset();
        }
        
        return result;
    }
    
    exec->globalData().exception = createUndefinedVariableError(exec, ident);
    return JSValue();
}

LLINT_HELPER_DECL(helper_resolve_global)
{
    LLINT_RETURN_PROFILED(op_resolve_global, resolveGlobal(exec, pc));
}

LLINT_HELPER_DECL(helper_resolve_global_dynamic)
{
    LLINT_RETURN_PROFILED(op_resolve_global_dynamic, resolveGlobal(exec, pc));
}

LLINT_HELPER_DECL(helper_resolve_for_resolve_global_dynamic)
{
    LLINT_RETURN_PROFILED(op_resolve_global_dynamic, CommonSlowPaths::opResolve(exec, exec->codeBlock()->identifier(pc[2].u.operand)));
}

LLINT_HELPER_DECL(helper_resolve_base)
{
    Identifier& ident = exec->codeBlock()->identifier(pc[2].u.operand);
    if (pc[3].u.operand) {
        JSValue base = JSC::resolveBase(exec, ident, exec->scopeChain(), true);
        if (!base)
            LLINT_THROW(createErrorForInvalidGlobalAssignment(exec, ident.ustring()));
        LLINT_RETURN(base);
    }
    
    LLINT_RETURN_PROFILED(op_resolve_base, JSC::resolveBase(exec, ident, exec->scopeChain(), false));
}

LLINT_HELPER_DECL(helper_ensure_property_exists)
{
    JSObject* object = asObject(LLINT_OP(1).jsValue());
    PropertySlot slot(object);
    Identifier& ident = exec->codeBlock()->identifier(pc[2].u.operand);
    if (!object->getPropertySlot(exec, ident, slot))
        LLINT_THROW(createErrorForInvalidGlobalAssignment(exec, ident.ustring()));
    LLINT_END();
}

LLINT_HELPER_DECL(helper_resolve_with_base)
{
    JSValue result = CommonSlowPaths::opResolveWithBase(exec, exec->codeBlock()->identifier(pc[3].u.operand), LLINT_OP(1));
    LLINT_CHECK_EXCEPTION();
    LLINT_OP(2) = result;
    // FIXME: technically should have profiling, but we don't do it because the DFG won't use it.
    LLINT_END();
}

LLINT_HELPER_DECL(helper_resolve_with_this)
{
    JSValue result = CommonSlowPaths::opResolveWithThis(exec, exec->codeBlock()->identifier(pc[3].u.operand), LLINT_OP(1));
    LLINT_CHECK_EXCEPTION();
    LLINT_OP(2) = result;
    // FIXME: technically should have profiling, but we don't do it because the DFG won't use it.
    LLINT_END();
}

LLINT_HELPER_DECL(helper_get_by_id)
{
    CodeBlock* codeBlock = exec->codeBlock();
    Identifier& ident = codeBlock->identifier(pc[3].u.operand);
    JSValue baseValue = LLINT_OP_C(2).jsValue();
    PropertySlot slot(baseValue);

    JSValue result = baseValue.get(exec, ident, slot);
    LLINT_CHECK_EXCEPTION();
    LLINT_OP(1) = result;

    if (baseValue.isCell()
        && slot.isCacheable()
        && slot.slotBase() == baseValue
        && slot.cachedPropertyType() == PropertySlot::Value) {
        
        JSCell* baseCell = baseValue.asCell();
        Structure* structure = baseCell->structure();
        
        if (!structure->isUncacheableDictionary()
            && !structure->typeInfo().prohibitsPropertyCaching()) {
            pc[4].u.structure.set(
                exec->globalData(), codeBlock->ownerExecutable(), structure);
            pc[5].u.operand = slot.cachedOffset() * sizeof(JSValue);
        }
    }
    
    pc[OPCODE_LENGTH(op_get_by_id) - 1].u.profile->m_buckets[0] = JSValue::encode(result);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_get_arguments_length)
{
    CodeBlock* codeBlock = exec->codeBlock();
    Identifier& ident = codeBlock->identifier(pc[3].u.operand);
    JSValue baseValue = LLINT_OP(2).jsValue();
    PropertySlot slot(baseValue);
    LLINT_RETURN(baseValue.get(exec, ident, slot));
}

LLINT_HELPER_DECL(helper_put_by_id)
{
    CodeBlock* codeBlock = exec->codeBlock();
    Identifier& ident = codeBlock->identifier(pc[2].u.operand);
    JSValue baseValue = LLINT_OP_C(1).jsValue();
    PutPropertySlot slot(codeBlock->isStrictMode());
    if (pc[8].u.operand)
        asObject(baseValue)->putDirect(exec->globalData(), ident, LLINT_OP_C(3).jsValue(), slot);
    else
        baseValue.put(exec, ident, LLINT_OP_C(3).jsValue(), slot);
    LLINT_CHECK_EXCEPTION();
    
    if (baseValue.isCell()
        && slot.isCacheable()) {
        
        JSCell* baseCell = baseValue.asCell();
        Structure* structure = baseCell->structure();
        
        if (!structure->isUncacheableDictionary()
            && !structure->typeInfo().prohibitsPropertyCaching()
            && baseCell == slot.base()) {
            
            if (slot.type() == PutPropertySlot::NewProperty) {
                if (!structure->isDictionary() && structure->previousID()->propertyStorageCapacity() == structure->propertyStorageCapacity()) {
                    // This is needed because some of the methods we call
                    // below may GC.
                    pc[0].u.opcode = bitwise_cast<void*>(&llint_op_put_by_id);

                    normalizePrototypeChain(exec, baseCell);
                    
                    ASSERT(structure->previousID()->isObject());
                    pc[4].u.structure.set(
                        exec->globalData(), codeBlock->ownerExecutable(), structure->previousID());
                    pc[5].u.operand = slot.cachedOffset() * sizeof(JSValue);
                    pc[6].u.structure.set(
                        exec->globalData(), codeBlock->ownerExecutable(), structure);
                    StructureChain* chain = structure->prototypeChain(exec);
                    ASSERT(chain);
                    pc[7].u.structureChain.set(
                        exec->globalData(), codeBlock->ownerExecutable(), chain);
                    
                    if (pc[8].u.operand)
                        pc[0].u.opcode = bitwise_cast<void*>(&llint_op_put_by_id_transition_direct);
                    else
                        pc[0].u.opcode = bitwise_cast<void*>(&llint_op_put_by_id_transition_normal);
                }
            } else {
                pc[0].u.opcode = bitwise_cast<void*>(&llint_op_put_by_id);
                pc[4].u.structure.set(
                    exec->globalData(), codeBlock->ownerExecutable(), structure);
                pc[5].u.operand = slot.cachedOffset() * sizeof(JSValue);
            }
        }
    }
    
    LLINT_END();
}

LLINT_HELPER_DECL(helper_del_by_id)
{
    CodeBlock* codeBlock = exec->codeBlock();
    JSObject* baseObject = LLINT_OP_C(2).jsValue().toObject(exec);
    bool couldDelete = baseObject->methodTable()->deleteProperty(baseObject, exec, codeBlock->identifier(pc[3].u.operand));
    LLINT_CHECK_EXCEPTION();
    if (!couldDelete && codeBlock->isStrictMode())
        LLINT_THROW(createTypeError(exec, "Unable to delete property."));
    LLINT_RETURN(jsBoolean(couldDelete));
}

inline JSValue getByVal(ExecState* exec, JSValue baseValue, JSValue subscript)
{
    if (LIKELY(baseValue.isCell() && subscript.isString())) {
        if (JSValue result = baseValue.asCell()->fastGetOwnProperty(exec, asString(subscript)->value(exec)))
            return result;
    }
    
    if (subscript.isUInt32()) {
        uint32_t i = subscript.asUInt32();
        if (isJSString(baseValue) && asString(baseValue)->canGetIndex(i))
            return asString(baseValue)->getIndex(exec, i);
        
        if (isJSByteArray(baseValue) && asByteArray(baseValue)->canAccessIndex(i))
            return asByteArray(baseValue)->getIndex(exec, i);
        
        return baseValue.get(exec, i);
    }
    
    Identifier property(exec, subscript.toString(exec)->value(exec));
    return baseValue.get(exec, property);
}

LLINT_HELPER_DECL(helper_get_by_val)
{
    LLINT_RETURN_PROFILED(op_get_by_val, getByVal(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue()));
}

LLINT_HELPER_DECL(helper_get_argument_by_val)
{
    JSValue arguments = LLINT_OP(2).jsValue();
    if (!arguments) {
        arguments = Arguments::create(exec->globalData(), exec);
        LLINT_CHECK_EXCEPTION();
        LLINT_OP(2) = arguments;
        exec->uncheckedR(unmodifiedArgumentsRegister(pc[2].u.operand)) = arguments;
    }
    
    LLINT_RETURN(getByVal(exec, arguments, LLINT_OP_C(3).jsValue()));
}

LLINT_HELPER_DECL(helper_get_by_pname)
{
    LLINT_RETURN(getByVal(exec, LLINT_OP(2).jsValue(), LLINT_OP(3).jsValue()));
}

LLINT_HELPER_DECL(helper_put_by_val)
{
    JSGlobalData& globalData = exec->globalData();
    
    JSValue baseValue = LLINT_OP_C(1).jsValue();
    JSValue subscript = LLINT_OP_C(2).jsValue();
    JSValue value = LLINT_OP_C(3).jsValue();
    
    if (LIKELY(subscript.isUInt32())) {
        uint32_t i = subscript.asUInt32();
        if (isJSArray(baseValue)) {
            JSArray* jsArray = asArray(baseValue);
            if (jsArray->canSetIndex(i))
                jsArray->setIndex(globalData, i, value);
            else
                JSArray::putByIndex(jsArray, exec, i, value);
            LLINT_END();
        }
        if (isJSByteArray(baseValue)
            && asByteArray(baseValue)->canAccessIndex(i)) {
            JSByteArray* jsByteArray = asByteArray(baseValue);
            if (value.isInt32()) {
                jsByteArray->setIndex(i, value.asInt32());
                LLINT_END();
            }
            if (value.isNumber()) {
                jsByteArray->setIndex(i, value.asNumber());
                LLINT_END();
            }
        }
        baseValue.put(exec, i, value);
        LLINT_END();
    }
    
    Identifier property(exec, subscript.toString(exec)->value(exec));
    LLINT_CHECK_EXCEPTION();
    PutPropertySlot slot(exec->codeBlock()->isStrictMode());
    baseValue.put(exec, property, value, slot);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_del_by_val)
{
    JSValue baseValue = LLINT_OP_C(2).jsValue();
    JSObject* baseObject = baseValue.toObject(exec);
    
    JSValue subscript = LLINT_OP_C(3).jsValue();
    
    bool couldDelete;
    
    uint32_t i;
    if (subscript.getUInt32(i))
        couldDelete = baseObject->methodTable()->deletePropertyByIndex(baseObject, exec, i);
    else {
        LLINT_CHECK_EXCEPTION();
        Identifier property(exec, subscript.toString(exec)->value(exec));
        LLINT_CHECK_EXCEPTION();
        couldDelete = baseObject->methodTable()->deleteProperty(baseObject, exec, property);
    }
    
    if (!couldDelete && exec->codeBlock()->isStrictMode())
        LLINT_THROW(createTypeError(exec, "Unable to delete property."));
    
    LLINT_RETURN(jsBoolean(couldDelete));
}

LLINT_HELPER_DECL(helper_put_by_index)
{
    LLINT_OP_C(1).jsValue().put(exec, pc[2].u.operand, LLINT_OP_C(3).jsValue());
    LLINT_END();
}

LLINT_HELPER_DECL(helper_put_getter)
{
    ASSERT(LLINT_OP(1).jsValue().isObject());
    JSObject* baseObj = asObject(LLINT_OP(1).jsValue());
    Identifier& ident = exec->codeBlock()->identifier(pc[2].u.operand);
    ASSERT(LLINT_OP(3).jsValue().isObject());
    baseObj->methodTable()->defineGetter(baseObj, exec, ident, asObject(LLINT_OP(3).jsValue()), 0);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_put_setter)
{
    ASSERT(LLINT_OP(1).jsValue().isObject());
    JSObject* baseObj = asObject(LLINT_OP(1).jsValue());
    Identifier& ident = exec->codeBlock()->identifier(pc[2].u.operand);
    ASSERT(LLINT_OP(3).jsValue().isObject());
    baseObj->methodTable()->defineSetter(baseObj, exec, ident, asObject(LLINT_OP(3).jsValue()), 0);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_jmp_scopes)
{
    unsigned count = pc[1].u.operand;
    ScopeChainNode* tmp = exec->scopeChain();
    while (count--)
        tmp = tmp->pop();
    exec->setScopeChain(tmp);
    pc += pc[2].u.operand;
    LLINT_END();
}

LLINT_HELPER_DECL(helper_jtrue)
{
    LLINT_BRANCH(op_jtrue, LLINT_OP_C(1).jsValue().toBoolean(exec));
}

LLINT_HELPER_DECL(helper_jfalse)
{
    LLINT_BRANCH(op_jfalse, !LLINT_OP_C(1).jsValue().toBoolean(exec));
}

LLINT_HELPER_DECL(helper_jless)
{
    LLINT_BRANCH(op_jless, jsLess<true>(exec, LLINT_OP_C(1).jsValue(), LLINT_OP_C(2).jsValue()));
}

LLINT_HELPER_DECL(helper_jnless)
{
    LLINT_BRANCH(op_jnless, !jsLess<true>(exec, LLINT_OP_C(1).jsValue(), LLINT_OP_C(2).jsValue()));
}

LLINT_HELPER_DECL(helper_jgreater)
{
    LLINT_BRANCH(op_jgreater, jsLess<false>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(1).jsValue()));
}

LLINT_HELPER_DECL(helper_jngreater)
{
    LLINT_BRANCH(op_jngreater, !jsLess<false>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(1).jsValue()));
}

LLINT_HELPER_DECL(helper_jlesseq)
{
    LLINT_BRANCH(op_jlesseq, jsLessEq<true>(exec, LLINT_OP_C(1).jsValue(), LLINT_OP_C(2).jsValue()));
}

LLINT_HELPER_DECL(helper_jnlesseq)
{
    LLINT_BRANCH(op_jnlesseq, !jsLessEq<true>(exec, LLINT_OP_C(1).jsValue(), LLINT_OP_C(2).jsValue()));
}

LLINT_HELPER_DECL(helper_jgreatereq)
{
    LLINT_BRANCH(op_jgreatereq, jsLessEq<false>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(1).jsValue()));
}

LLINT_HELPER_DECL(helper_jngreatereq)
{
    LLINT_BRANCH(op_jngreatereq, !jsLessEq<false>(exec, LLINT_OP_C(2).jsValue(), LLINT_OP_C(1).jsValue()));
}

LLINT_HELPER_DECL(helper_switch_imm)
{
    JSValue scrutinee = LLINT_OP_C(3).jsValue();
    ASSERT(scrutinee.isDouble());
    double value = scrutinee.asDouble();
    int32_t intValue = static_cast<int32_t>(value);
    int defaultOffset = pc[2].u.operand;
    if (value == intValue) {
        CodeBlock* codeBlock = exec->codeBlock();
        pc += codeBlock->immediateSwitchJumpTable(pc[1].u.operand).offsetForValue(intValue, defaultOffset);
    } else
        pc += defaultOffset;
    LLINT_END();
}

LLINT_HELPER_DECL(helper_switch_string)
{
    JSValue scrutinee = LLINT_OP_C(3).jsValue();
    int defaultOffset = pc[2].u.operand;
    if (!scrutinee.isString())
        pc += defaultOffset;
    else {
        CodeBlock* codeBlock = exec->codeBlock();
        pc += codeBlock->stringSwitchJumpTable(pc[1].u.operand).offsetForValue(asString(scrutinee)->value(exec).impl(), defaultOffset);
    }
    LLINT_END();
}

LLINT_HELPER_DECL(helper_new_func)
{
    CodeBlock* codeBlock = exec->codeBlock();
    ASSERT(codeBlock->codeType() != FunctionCode
           || !codeBlock->needsFullScopeChain()
           || exec->uncheckedR(codeBlock->activationRegister()).jsValue());
#if LLINT_HELPER_TRACING
    printf("Creating function!\n");
#endif
    LLINT_RETURN(codeBlock->functionDecl(pc[2].u.operand)->make(exec, exec->scopeChain()));
}

LLINT_HELPER_DECL(helper_new_func_exp)
{
    CodeBlock* codeBlock = exec->codeBlock();
    FunctionExecutable* function = codeBlock->functionExpr(pc[2].u.operand);
    JSFunction* func = function->make(exec, exec->scopeChain());
    
    if (!function->name().isNull()) {
        JSStaticScopeObject* functionScopeObject = JSStaticScopeObject::create(exec, function->name(), func, ReadOnly | DontDelete);
        func->setScope(exec->globalData(), func->scope()->push(functionScopeObject));
    }
    
    LLINT_RETURN(func);
}

static HelperReturnType handleHostCall(ExecState* execCallee, Instruction* pc, JSValue callee, CodeSpecializationKind kind)
{
    ExecState* exec = execCallee->callerFrame();
    JSGlobalData* globalData = &exec->globalData();

    execCallee->setScopeChain(exec->scopeChain());
    execCallee->setCodeBlock(0);

    if (kind == CodeForCall) {
        CallData callData;
        CallType callType = getCallData(callee, callData);
    
        ASSERT(callType != CallTypeJS);
    
        if (callType == CallTypeHost) {
            globalData->hostCallReturnValue = JSValue::decode(callData.native.function(execCallee));
            
            LLINT_CALL_RETURN(execCallee, pc, reinterpret_cast<void*>(getHostCallReturnValue));
        }
        
#if LLINT_HELPER_TRACING
        printf("Call callee is not a function: %s\n", callee.description());
#endif

        ASSERT(callType == CallTypeNone);
        LLINT_CALL_THROW(exec, pc, createNotAFunctionError(exec, callee));
    }

    ASSERT(kind == CodeForConstruct);
    
    ConstructData constructData;
    ConstructType constructType = getConstructData(callee, constructData);
    
    ASSERT(constructType != ConstructTypeJS);
    
    if (constructType == ConstructTypeHost) {
        globalData->hostCallReturnValue = JSValue::decode(constructData.native.function(execCallee));
        LLINT_CALL_RETURN(execCallee, pc, reinterpret_cast<void*>(getHostCallReturnValue));
    }
    
#if LLINT_HELPER_TRACING
        printf("Constructor callee is not a function: %s\n", callee.description());
#endif

    ASSERT(constructType == ConstructTypeNone);
    LLINT_CALL_THROW(exec, pc, createNotAConstructorError(exec, callee));
}

inline HelperReturnType setUpCall(ExecState* execCallee, Instruction* pc, CodeSpecializationKind kind, JSValue calleeAsValue, LLIntCallLinkInfo* callLinkInfo = 0)
{
    JSCell* calleeAsFunctionCell = getJSFunction(calleeAsValue);
    if (!calleeAsFunctionCell)
        return handleHostCall(execCallee, pc, calleeAsValue, kind);
    
    JSFunction* callee = asFunction(calleeAsFunctionCell);
    execCallee->setScopeChain(callee->scopeUnchecked());
    ExecutableBase* executable = callee->executable();
    
    MacroAssemblerCodePtr codePtr;
    CodeBlock* codeBlock = 0;
    if (executable->isHostFunction())
        codePtr = executable->generatedJITCodeFor(kind).addressForCall();
    else {
        FunctionExecutable* functionExecutable = static_cast<FunctionExecutable*>(executable);
        JSObject* error = functionExecutable->compileFor(execCallee, callee->scope(), kind);
        if (error)
            LLINT_CALL_THROW(execCallee->callerFrame(), pc, error);
        codeBlock = &functionExecutable->generatedBytecodeFor(kind);
        ASSERT(codeBlock);
        if (execCallee->argumentCountIncludingThis() < static_cast<size_t>(codeBlock->numParameters()))
            codePtr = functionExecutable->generatedJITCodeWithArityCheckFor(kind);
        else
            codePtr = functionExecutable->generatedJITCodeFor(kind).addressForCall();
    }
    
    if (callLinkInfo) {
        if (callLinkInfo->isOnList())
            callLinkInfo->remove();
        ExecState* execCaller = execCallee->callerFrame();
        callLinkInfo->callee.set(execCaller->globalData(), execCaller->codeBlock()->ownerExecutable(), callee);
        callLinkInfo->lastSeenCallee.set(execCaller->globalData(), execCaller->codeBlock()->ownerExecutable(), callee);
        callLinkInfo->machineCodeTarget = codePtr;
        if (codeBlock)
            codeBlock->linkIncomingCall(callLinkInfo);
    }
    
    LLINT_CALL_RETURN(execCallee, pc, codePtr.executableAddress());
}

inline HelperReturnType genericCall(ExecState* exec, Instruction* pc, CodeSpecializationKind kind)
{
    // This needs to:
    // - Set up a call frame.
    // - Figure out what to call and compile it if necessary.
    // - If possible, link the call's inline cache.
    // - Return a tuple of machine code address to call and the new call frame.
    
    JSValue calleeAsValue = LLINT_OP_C(1).jsValue();
    
    ExecState* execCallee = exec + pc[3].u.operand;
    
    execCallee->setArgumentCountIncludingThis(pc[2].u.operand);
    execCallee->uncheckedR(RegisterFile::Callee) = calleeAsValue;
    execCallee->setCallerFrame(exec);
    
    ASSERT(pc[4].u.callLinkInfo);
    return setUpCall(execCallee, pc, kind, calleeAsValue, pc[4].u.callLinkInfo);
}

LLINT_HELPER_DECL(helper_call)
{
    return genericCall(exec, pc, CodeForCall);
}

LLINT_HELPER_DECL(helper_construct)
{
    return genericCall(exec, pc, CodeForConstruct);
}

LLINT_HELPER_DECL(helper_call_varargs)
{
    // This needs to:
    // - Set up a call frame while respecting the variable arguments.
    // - Figure out what to call and compile it if necessary.
    // - Return a tuple of machine code address to call and the new call frame.
    
    JSValue calleeAsValue = LLINT_OP_C(1).jsValue();
    
    ExecState* execCallee = loadVarargs(
        exec, &exec->globalData().interpreter->registerFile(),
        LLINT_OP_C(2).jsValue(), LLINT_OP_C(3).jsValue(), pc[4].u.operand);
    LLINT_CALL_CHECK_EXCEPTION(exec, pc);
    
    execCallee->uncheckedR(RegisterFile::Callee) = calleeAsValue;
    execCallee->setCallerFrame(exec);
    exec->uncheckedR(RegisterFile::ArgumentCount).tag() = bitwise_cast<int32_t>(pc + OPCODE_LENGTH(op_call_varargs));
    
    return setUpCall(execCallee, pc, CodeForCall, calleeAsValue);
}

LLINT_HELPER_DECL(helper_call_eval)
{
    JSValue calleeAsValue = LLINT_OP(1).jsValue();
    
    ExecState* execCallee = exec + pc[3].u.operand;
    JSGlobalData& globalData = exec->globalData();
    
    execCallee->setArgumentCountIncludingThis(pc[2].u.operand);
    execCallee->setCallerFrame(exec);
    execCallee->uncheckedR(RegisterFile::Callee) = calleeAsValue;
    execCallee->setScopeChain(exec->scopeChain());
    execCallee->setReturnPC(bitwise_cast<Instruction*>(&llint_generic_return_point));
    execCallee->setCodeBlock(0);
    exec->uncheckedR(RegisterFile::ArgumentCount).tag() = bitwise_cast<int32_t>(pc + OPCODE_LENGTH(op_call_eval));
    
    if (!isHostFunction(calleeAsValue, globalFuncEval))
        return setUpCall(execCallee, pc, CodeForCall, calleeAsValue);
    
    globalData.hostCallReturnValue = eval(execCallee);
    LLINT_CALL_RETURN(execCallee, pc, reinterpret_cast<void*>(getHostCallReturnValue));
}

LLINT_HELPER_DECL(helper_tear_off_activation)
{
    ASSERT(exec->codeBlock()->needsFullScopeChain());
    JSValue activationValue = LLINT_OP(1).jsValue();
    if (!activationValue) {
        if (JSValue v = exec->uncheckedR(unmodifiedArgumentsRegister(pc[2].u.operand)).jsValue()) {
            if (!exec->codeBlock()->isStrictMode())
                asArguments(v)->tearOff(exec);
        }
        LLINT_END();
    }
    JSActivation* activation = asActivation(activationValue);
    activation->tearOff(exec->globalData());
    if (JSValue v = exec->uncheckedR(unmodifiedArgumentsRegister(pc[2].u.operand)).jsValue())
        asArguments(v)->didTearOffActivation(exec->globalData(), activation);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_tear_off_arguments)
{
    ASSERT(exec->codeBlock()->usesArguments() && !exec->codeBlock()->needsFullScopeChain());
    asArguments(exec->uncheckedR(unmodifiedArgumentsRegister(pc[1].u.operand)).jsValue())->tearOff(exec);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_strcat)
{
    LLINT_RETURN(jsString(exec, &LLINT_OP(2), pc[3].u.operand));
}

LLINT_HELPER_DECL(helper_to_primitive)
{
    LLINT_RETURN(LLINT_OP_C(2).jsValue().toPrimitive(exec));
}

LLINT_HELPER_DECL(helper_get_pnames)
{
    JSValue v = LLINT_OP(2).jsValue();
    if (v.isUndefinedOrNull()) {
        pc += pc[5].u.operand;
        LLINT_END();
    }
    
    JSObject* o = v.toObject(exec);
    Structure* structure = o->structure();
    JSPropertyNameIterator* jsPropertyNameIterator = structure->enumerationCache();
    if (!jsPropertyNameIterator || jsPropertyNameIterator->cachedPrototypeChain() != structure->prototypeChain(exec))
        jsPropertyNameIterator = JSPropertyNameIterator::create(exec, o);
    
    LLINT_OP(1) = JSValue(jsPropertyNameIterator);
    LLINT_OP(2) = JSValue(o);
    LLINT_OP(3) = Register::withInt(0);
    LLINT_OP(4) = Register::withInt(jsPropertyNameIterator->size());
    
    pc += OPCODE_LENGTH(op_get_pnames);
    LLINT_END();
}

LLINT_HELPER_DECL(helper_next_pname)
{
    JSObject* base = asObject(LLINT_OP(2).jsValue());
    JSString* property = asString(LLINT_OP(1).jsValue());
    if (base->hasProperty(exec, Identifier(exec, property->value(exec)))) {
        // Go to target.
        pc += pc[6].u.operand;
    } // Else, don't change the PC, so the interpreter will reloop.
    LLINT_END();
}

LLINT_HELPER_DECL(helper_push_scope)
{
    JSValue v = LLINT_OP(1).jsValue();
    JSObject* o = v.toObject(exec);
    LLINT_CHECK_EXCEPTION();
    
    LLINT_OP(1) = o;
    exec->setScopeChain(exec->scopeChain()->push(o));
    
    LLINT_END();
}

LLINT_HELPER_DECL(helper_pop_scope)
{
    exec->setScopeChain(exec->scopeChain()->pop());
    LLINT_END();
}

LLINT_HELPER_DECL(helper_push_new_scope)
{
    CodeBlock* codeBlock = exec->codeBlock();
    JSObject* scope = JSStaticScopeObject::create(exec, codeBlock->identifier(pc[2].u.operand), LLINT_OP(3).jsValue(), DontDelete);
    exec->setScopeChain(exec->scopeChain()->push(scope));
    LLINT_RETURN(scope);
}

LLINT_HELPER_DECL(helper_throw)
{
    LLINT_THROW(LLINT_OP_C(1).jsValue());
}

LLINT_HELPER_DECL(helper_throw_reference_error)
{
    LLINT_THROW(createReferenceError(exec, LLINT_OP_C(1).jsValue().toString(exec)->value(exec)));
}

LLINT_HELPER_DECL(helper_debug)
{
    int debugHookID = pc[1].u.operand;
    int firstLine = pc[2].u.operand;
    int lastLine = pc[3].u.operand;
    
    exec->globalData().interpreter->debug(exec, static_cast<DebugHookID>(debugHookID), firstLine, lastLine);
    
    LLINT_END();
}

LLINT_HELPER_DECL(helper_profile_will_call)
{
    (*Profiler::enabledProfilerReference())->willExecute(exec, LLINT_OP(1).jsValue());
    LLINT_END();
}

LLINT_HELPER_DECL(helper_profile_did_call)
{
    (*Profiler::enabledProfilerReference())->didExecute(exec, LLINT_OP(1).jsValue());
    LLINT_END();
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2011 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 LLIntHelpers_h
#define LLIntHelpers_h

#include <wtf/Platform.h>
#include <wtf/StdLibExtras.h>

#if ENABLE(LLINT)

namespace JSC {

class ExecState;
struct Instruction;

namespace LLInt {

typedef int64_t HelperReturnType;

extern "C" HelperReturnType llint_trace_operand(ExecState*, Instruction*, int fromWhere, int operand);
extern "C" HelperReturnType llint_trace_value(ExecState*, Instruction*, int fromWhere, int operand);

#define LLINT_HELPER_DECL(name) \
    extern "C" HelperReturnType llint_##name(ExecState* exec, Instruction* pc)

LLINT_HELPER_DECL(trace_prologue);
LLINT_HELPER_DECL(trace_prologue_function_for_call);
LLINT_HELPER_DECL(trace_prologue_function_for_construct);
LLINT_HELPER_DECL(trace_arityCheck_for_call);
LLINT_HELPER_DECL(trace_arityCheck_for_construct);
LLINT_HELPER_DECL(trace);
LLINT_HELPER_DECL(special_trace);
LLINT_HELPER_DECL(entry_osr);
LLINT_HELPER_DECL(entry_osr_function_for_call);
LLINT_HELPER_DECL(entry_osr_function_for_construct);
LLINT_HELPER_DECL(entry_osr_function_for_call_arityCheck);
LLINT_HELPER_DECL(entry_osr_function_for_construct_arityCheck);
LLINT_HELPER_DECL(loop_osr);
LLINT_HELPER_DECL(replace);
LLINT_HELPER_DECL(register_file_check);
LLINT_HELPER_DECL(helper_call_arityCheck);
LLINT_HELPER_DECL(helper_construct_arityCheck);
LLINT_HELPER_DECL(helper_create_activation);
LLINT_HELPER_DECL(helper_create_arguments);
LLINT_HELPER_DECL(helper_create_this);
LLINT_HELPER_DECL(helper_convert_this);
LLINT_HELPER_DECL(helper_new_object);
LLINT_HELPER_DECL(helper_new_array);
LLINT_HELPER_DECL(helper_new_array_buffer);
LLINT_HELPER_DECL(helper_new_regexp);
LLINT_HELPER_DECL(helper_not);
LLINT_HELPER_DECL(helper_eq);
LLINT_HELPER_DECL(helper_neq);
LLINT_HELPER_DECL(helper_stricteq);
LLINT_HELPER_DECL(helper_nstricteq);
LLINT_HELPER_DECL(helper_less);
LLINT_HELPER_DECL(helper_lesseq);
LLINT_HELPER_DECL(helper_greater);
LLINT_HELPER_DECL(helper_greatereq);
LLINT_HELPER_DECL(helper_pre_inc);
LLINT_HELPER_DECL(helper_pre_dec);
LLINT_HELPER_DECL(helper_post_inc);
LLINT_HELPER_DECL(helper_post_dec);
LLINT_HELPER_DECL(helper_to_jsnumber);
LLINT_HELPER_DECL(helper_negate);
LLINT_HELPER_DECL(helper_add);
LLINT_HELPER_DECL(helper_mul);
LLINT_HELPER_DECL(helper_sub);
LLINT_HELPER_DECL(helper_div);
LLINT_HELPER_DECL(helper_mod);
LLINT_HELPER_DECL(helper_lshift);
LLINT_HELPER_DECL(helper_rshift);
LLINT_HELPER_DECL(helper_urshift);
LLINT_HELPER_DECL(helper_bitand);
LLINT_HELPER_DECL(helper_bitor);
LLINT_HELPER_DECL(helper_bitxor);
LLINT_HELPER_DECL(helper_bitnot);
LLINT_HELPER_DECL(helper_check_has_instance);
LLINT_HELPER_DECL(helper_instanceof);
LLINT_HELPER_DECL(helper_typeof);
LLINT_HELPER_DECL(helper_is_undefined);
LLINT_HELPER_DECL(helper_is_boolean);
LLINT_HELPER_DECL(helper_is_number);
LLINT_HELPER_DECL(helper_is_string);
LLINT_HELPER_DECL(helper_is_object);
LLINT_HELPER_DECL(helper_is_function);
LLINT_HELPER_DECL(helper_in);
LLINT_HELPER_DECL(helper_resolve);
LLINT_HELPER_DECL(helper_resolve_skip);
LLINT_HELPER_DECL(helper_resolve_global);
LLINT_HELPER_DECL(helper_resolve_global_dynamic);
LLINT_HELPER_DECL(helper_resolve_for_resolve_global_dynamic);
LLINT_HELPER_DECL(helper_resolve_base);
LLINT_HELPER_DECL(helper_ensure_property_exists);
LLINT_HELPER_DECL(helper_resolve_with_base);
LLINT_HELPER_DECL(helper_resolve_with_this);
LLINT_HELPER_DECL(helper_get_by_id);
LLINT_HELPER_DECL(helper_get_arguments_length);
LLINT_HELPER_DECL(helper_put_by_id);
LLINT_HELPER_DECL(helper_del_by_id);
LLINT_HELPER_DECL(helper_get_by_val);
LLINT_HELPER_DECL(helper_get_argument_by_val);
LLINT_HELPER_DECL(helper_get_by_pname);
LLINT_HELPER_DECL(helper_put_by_val);
LLINT_HELPER_DECL(helper_del_by_val);
LLINT_HELPER_DECL(helper_put_by_index);
LLINT_HELPER_DECL(helper_put_getter);
LLINT_HELPER_DECL(helper_put_setter);
LLINT_HELPER_DECL(helper_jmp_scopes);
LLINT_HELPER_DECL(helper_jtrue);
LLINT_HELPER_DECL(helper_jfalse);
LLINT_HELPER_DECL(helper_jless);
LLINT_HELPER_DECL(helper_jnless);
LLINT_HELPER_DECL(helper_jgreater);
LLINT_HELPER_DECL(helper_jngreater);
LLINT_HELPER_DECL(helper_jlesseq);
LLINT_HELPER_DECL(helper_jnlesseq);
LLINT_HELPER_DECL(helper_jgreatereq);
LLINT_HELPER_DECL(helper_jngreatereq);
LLINT_HELPER_DECL(helper_switch_imm);
LLINT_HELPER_DECL(helper_switch_char);
LLINT_HELPER_DECL(helper_switch_string);
LLINT_HELPER_DECL(helper_new_func);
LLINT_HELPER_DECL(helper_new_func_exp);
LLINT_HELPER_DECL(helper_call);
LLINT_HELPER_DECL(helper_construct);
LLINT_HELPER_DECL(helper_call_varargs);
LLINT_HELPER_DECL(helper_call_eval);
LLINT_HELPER_DECL(helper_tear_off_activation);
LLINT_HELPER_DECL(helper_tear_off_arguments);
LLINT_HELPER_DECL(helper_strcat);
LLINT_HELPER_DECL(helper_to_primitive);
LLINT_HELPER_DECL(helper_get_pnames);
LLINT_HELPER_DECL(helper_next_pname);
LLINT_HELPER_DECL(helper_push_scope);
LLINT_HELPER_DECL(helper_pop_scope);
LLINT_HELPER_DECL(helper_push_new_scope);
LLINT_HELPER_DECL(helper_throw);
LLINT_HELPER_DECL(helper_throw_reference_error);
LLINT_HELPER_DECL(helper_debug);
LLINT_HELPER_DECL(helper_profile_will_call);
LLINT_HELPER_DECL(helper_profile_did_call);

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)

#endif // LLIntHelpers_h




/*
 * Copyright (C) 2012 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 LLIntOfflineAsmConfig_h
#define LLIntOfflineAsmConfig_h

#include "LLIntCommon.h"
#include <wtf/Assertions.h>
#include <wtf/Platform.h>

#if CPU(X86)
#define OFFLINE_ASM_X86 1
#else
#define OFFLINE_ASM_X86 0
#endif

#if CPU(ARMv7)
#define OFFLINE_ASM_ARMv7 1
#else
#define OFFLINE_ASM_ARMv7 0
#endif

#if !ASSERT_DISABLED
#define OFFLINE_ASM_ASSERT_ENABLED 1
#else
#define OFFLINE_ASM_ASSERT_ENABLED 0
#endif

#if CPU(BIG_ENDIAN)
#define OFFLINE_ASM_BIG_ENDIAN 1
#else
#define OFFLINE_ASM_BIG_ENDIAN 0
#endif

#if ENABLE(LLINT_OSR_TO_JIT)
#define OFFLINE_ASM_JIT_ENABLED 1
#else
#define OFFLINE_ASM_JIT_ENABLED 0
#endif

#if LLINT_EXECUTION_TRACING
#define OFFLINE_ASM_EXECUTION_TRACING 1
#else
#define OFFLINE_ASM_EXECUTION_TRACING 0
#endif

#endif // LLIntOfflineAsmConfig_h



/*
 * Copyright (C) 2012 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. 
 */

#include "config.h"

#include "AllocationSpace.h"
#include "CodeBlock.h"
#include "Executable.h"
#include "Heap.h"
#include "Interpreter.h"
#include "JITStubs.h"
#include "JSArray.h"
#include "JSCell.h"
#include "JSFunction.h"
#include "JSGlobalData.h"
#include "JSGlobalObject.h"
#include "JSObject.h"
#include "JSPropertyNameIterator.h"
#include "JSString.h"
#include "JSTypeInfo.h"
#include "JSVariableObject.h"
#include "JumpTable.h"
#include "LLIntOfflineAsmConfig.h"
#include "MarkedSpace.h"
#include "RegisterFile.h"
#include "ScopeChain.h"
#include "Structure.h"
#include "StructureChain.h"
#include "ValueProfile.h"
#include <wtf/text/StringImpl.h>

namespace JSC {

#define OFFLINE_ASM_OFFSETOF(clazz, field) OBJECT_OFFSETOF(clazz, field)

class LLIntOffsetsExtractor {
public:
    static const unsigned* dummy();
};

const unsigned* LLIntOffsetsExtractor::dummy()
{
#include "LLIntDesiredOffsets.h"
    return extractorTable;
}

} // namespace JSC

int main(int, char**)
{
    // Out of an abundance of caution, make sure that LLIntOffsetsExtractor::dummy() is live,
    // and the extractorTable is live, too.
    printf("%p\n", JSC::LLIntOffsetsExtractor::dummy());
    return 0;
}



/*
 * Copyright (C) 2012 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. 
 */

#include "config.h"
#include "LLIntThunks.h"

#if ENABLE(LLINT)

#include "JSInterfaceJIT.h"
#include "LinkBuffer.h"
#include "LowLevelInterpreter.h"

namespace JSC { namespace LLInt {

static MacroAssemblerCodeRef generateThunkWithJumpTo(JSGlobalData* globalData, void (*target)())
{
    JSInterfaceJIT jit;
    
    // FIXME: there's probably a better way to do it on X86, but I'm not sure I care.
    jit.move(JSInterfaceJIT::TrustedImmPtr(bitwise_cast<void*>(target)), JSInterfaceJIT::regT0);
    jit.jump(JSInterfaceJIT::regT0);
    
    LinkBuffer patchBuffer(*globalData, &jit, GLOBAL_THUNK_ID);
    return patchBuffer.finalizeCode();
}

MacroAssemblerCodeRef functionForCallEntryThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_function_for_call_prologue);
}

MacroAssemblerCodeRef functionForConstructEntryThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_function_for_construct_prologue);
}

MacroAssemblerCodeRef functionForCallArityCheckThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_function_for_call_arity_check);
}

MacroAssemblerCodeRef functionForConstructArityCheckThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_function_for_construct_arity_check);
}

MacroAssemblerCodeRef evalEntryThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_eval_prologue);
}

MacroAssemblerCodeRef programEntryThunkGenerator(JSGlobalData* globalData)
{
    return generateThunkWithJumpTo(globalData, llint_program_prologue);
}

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2012 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 LLIntThunks_h
#define LLIntThunks_h

#include <wtf/Platform.h>

#if ENABLE(LLINT)

#include "MacroAssemblerCodeRef.h"

namespace JSC {

class JSGlobalData;

namespace LLInt {

MacroAssemblerCodeRef functionForCallEntryThunkGenerator(JSGlobalData*);
MacroAssemblerCodeRef functionForConstructEntryThunkGenerator(JSGlobalData*);
MacroAssemblerCodeRef functionForCallArityCheckThunkGenerator(JSGlobalData*);
MacroAssemblerCodeRef functionForConstructArityCheckThunkGenerator(JSGlobalData*);
MacroAssemblerCodeRef evalEntryThunkGenerator(JSGlobalData*);
MacroAssemblerCodeRef programEntryThunkGenerator(JSGlobalData*);

} } // namespace JSC::LLInt

#endif // ENABLE(LLINT)

#endif // LLIntThunks_h



# Copyright (C) 2011, 2012 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. AND ITS 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 APPLE INC. OR ITS 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.


# Crash course on the language that this is written in (which I just call
# "assembly" even though it's more than that):
#
# - Mostly gas-style operand ordering. The last operand tends to be the
#   destination. So "a := b" is written as "mov b, a". But unlike gas,
#   comparisons are in-order, so "if (a < b)" is written as
#   "bilt a, b, ...".
#
# - "b" = byte, "h" = 16-bit word, "i" = 32-bit word, "p" = pointer.
#   Currently this is just 32-bit so "i" and "p" are interchangeable
#   except when an op supports one but not the other.
#
# - In general, valid operands for macro invocations and instructions are
#   registers (eg "t0"), addresses (eg "4[t0]"), base-index addresses
#   (eg "7[t0, t1, 2]"), absolute addresses (eg "0xa0000000[]"), or labels
#   (eg "_foo" or ".foo"). Macro invocations can also take anonymous
#   macros as operands. Instructions cannot take anonymous macros.
#
# - Labels must have names that begin with either "_" or ".".  A "." label
#   is local and gets renamed before code gen to minimize namespace
#   pollution. A "_" label is an extern symbol (i.e. ".globl"). The "_"
#   may or may not be removed during code gen depending on whether the asm
#   conventions for C name mangling on the target platform mandate a "_"
#   prefix.
#
# - A "macro" is a lambda expression, which may be either anonymous or
#   named. But this has caveats. "macro" can take zero or more arguments,
#   which may be macros or any valid operands, but it can only return
#   code. But you can do Turing-complete things via continuation passing
#   style: "macro foo (a, b) b(a) end foo(foo, foo)". Actually, don't do
#   that, since you'll just crash the assembler.
#
# - An "if" is a conditional on settings. Any identifier supplied in the
#   predicate of an "if" is assumed to be a #define that is available
#   during code gen. So you can't use "if" for computation in a macro, but
#   you can use it to select different pieces of code for different
#   platforms.
#
# - Arguments to macros follow lexical scoping rather than dynamic scoping.
#   Const's also follow lexical scoping and may override (hide) arguments
#   or other consts. All variables (arguments and constants) can be bound
#   to operands. Additionally, arguments (but not constants) can be bound
#   to macros.


# These declarations must match interpreter/RegisterFile.h.
const CallFrameHeaderSize = 48
const ArgumentCount = -48
const CallerFrame = -40
const Callee = -32
const ScopeChain = -24
const ReturnPC = -16
const CodeBlock = -8

const ThisArgumentOffset = -CallFrameHeaderSize - 8

# Declare some aliases for the registers we will use.
const PC = t4

# Offsets needed for reasoning about value representation.
if BIG_ENDIAN
    const TagOffset = 0
    const PayloadOffset = 4
else
    const TagOffset = 4
    const PayloadOffset = 0
end

# Value representation constants.
const Int32Tag = -1
const BooleanTag = -2
const NullTag = -3
const UndefinedTag = -4
const CellTag = -5
const EmptyValueTag = -6
const DeletedValueTag = -7
const LowestTag = DeletedValueTag

# Type constants.
const StringType = 5
const ObjectType = 10

# Type flags constants.
const MasqueradesAsUndefined = 1
const ImplementsHasInstance = 2
const ImplementsDefaultHasInstance = 8

# Heap allocation constants.
const JSFinalObjectSizeClassIndex = 3

# Bytecode operand constants.
const FirstConstantRegisterIndex = 0x40000000

# Code type constants.
const GlobalCode = 0
const EvalCode = 1
const FunctionCode = 2

# The interpreter steals the tag word of the argument count.
const LLIntReturnPC = ArgumentCount + TagOffset

# This must match wtf/Vector.h.
const VectorSizeOffset = 0
const VectorBufferOffset = 4

# String flags.
const HashFlags8BitBuffer = 64

# Utilities
macro crash()
    storei 0, 0xbbadbeef[]
    move 0, t0
    call t0
end

macro assert(assertion)
    if ASSERT_ENABLED
        assertion(.ok)
        crash()
    .ok:
    end
end

macro preserveReturnAddressAfterCall(destinationRegister)
    if ARMv7
        move lr, destinationRegister
    elsif X86
        pop destinationRegister
    else
        error
    end
end

macro restoreReturnAddressBeforeReturn(sourceRegister)
    if ARMv7
        move sourceRegister, lr
    elsif X86
        push sourceRegister
    else
        error
    end
end

macro dispatch(advance)
    addp advance * 4, PC
    jmp [PC]
end

macro dispatchBranchWithOffset(pcOffset)
    lshifti 2, pcOffset
    addp pcOffset, PC
    jmp [PC]
end

macro dispatchBranch(pcOffset)
    loadi pcOffset, t0
    dispatchBranchWithOffset(t0)
end

macro dispatchAfterCall()
    loadi ArgumentCount + TagOffset[cfr], PC
    jmp [PC]
end

macro cCall2(function, arg1, arg2)
    if ARMv7
        move arg1, t0
        move arg2, t1
    elsif X86
        poke arg1, 0
        poke arg2, 1
    else
        error
    end
    call function
end

# This barely works. arg3 and arg4 should probably be immediates.
macro cCall4(function, arg1, arg2, arg3, arg4)
    if ARMv7
        move arg1, t0
        move arg2, t1
        move arg3, t2
        move arg4, t3
    elsif X86
        poke arg1, 0
        poke arg2, 1
        poke arg3, 2
        poke arg4, 3
    else
        error
    end
    call function
end

macro callHelper(helper)
    cCall2(helper, cfr, PC)
    move t0, PC
    move t1, cfr
end

# Debugging operation if you'd like to print an operand in the instruction stream. fromWhere
# should be an immediate integer - any integer you like; use it to identify the place you're
# debugging from. operand should likewise be an immediate, and should identify the operand
# in the instruction stream you'd like to print out.
macro traceOperand(fromWhere, operand)
    cCall4(_llint_trace_operand, cfr, PC, fromWhere, operand)
    move t0, PC
    move t1, cfr
end

# Debugging operation if you'd like to print the value of an operand in the instruction
# stream. Same as traceOperand(), but assumes that the operand is a register, and prints its
# value.
macro traceValue(fromWhere, operand)
    cCall4(_llint_trace_value, cfr, PC, fromWhere, operand)
    move t0, PC
    move t1, cfr
end

macro traceExecution()
    if EXECUTION_TRACING
        callHelper(_llint_trace)
    end
end

# Call a helper for call opcodes.
macro callCallHelper(advance, helper, action)
    addp advance * 4, PC, t0
    storep t0, ArgumentCount + TagOffset[cfr]
    cCall2(helper, cfr, PC)
    move t1, cfr
    action(t0)
end

macro slowPathForCall(advance, helper)
    callCallHelper(
        advance,
        helper,
        macro (callee)
            call callee
            dispatchAfterCall()
        end)
end

macro checkSwitchToJIT(increment, action)
    if JIT_ENABLED
        loadp CodeBlock[cfr], t0
        baddis increment, CodeBlock::m_llintExecuteCounter[t0], .continue
        action()
    .continue:
    end
end

macro checkSwitchToJITForLoop()
    checkSwitchToJIT(
        1,
        macro ()
            storei PC, ArgumentCount + TagOffset[cfr]
            cCall2(_llint_loop_osr, cfr, PC)
            move t1, cfr
            btpz t0, .recover
            jmp t0
        .recover:
            loadi ArgumentCount + TagOffset[cfr], PC
        end)
end

macro checkSwitchToJITForEpilogue()
    checkSwitchToJIT(
        10,
        macro ()
            callHelper(_llint_replace)
        end)
end

macro assertNotConstant(index)
    assert(macro (ok) bilt index, FirstConstantRegisterIndex, ok end)
end

# Index, tag, and payload must be different registers. Index is not
# changed.
macro loadConstantOrVariable(index, tag, payload)
    bigteq index, FirstConstantRegisterIndex, .constant
    loadi TagOffset[cfr, index, 8], tag
    loadi PayloadOffset[cfr, index, 8], payload
    jmp .done
.constant:
    loadp CodeBlock[cfr], payload
    loadp CodeBlock::m_constantRegisters + VectorBufferOffset[payload], payload
    # There is a bit of evil here: if the index contains a value >= FirstConstantRegisterIndex,
    # then value << 3 will be equal to (value - FirstConstantRegisterIndex) << 3.
    loadp TagOffset[payload, index, 8], tag
    loadp PayloadOffset[payload, index, 8], payload
.done:
end

# Index and payload may be the same register. Index may be clobbered.
macro loadConstantOrVariable2Reg(index, tag, payload)
    bigteq index, FirstConstantRegisterIndex, .constant
    loadi TagOffset[cfr, index, 8], tag
    loadi PayloadOffset[cfr, index, 8], payload
    jmp .done
.constant:
    loadp CodeBlock[cfr], tag
    loadp CodeBlock::m_constantRegisters + VectorBufferOffset[tag], tag
    # There is a bit of evil here: if the index contains a value >= FirstConstantRegisterIndex,
    # then value << 3 will be equal to (value - FirstConstantRegisterIndex) << 3.
    lshifti 3, index
    addp index, tag
    loadp PayloadOffset[tag], payload
    loadp TagOffset[tag], tag
.done:
end

macro loadConstantOrVariablePayloadTagCustom(index, tagCheck, payload)
    bigteq index, FirstConstantRegisterIndex, .constant
    tagCheck(TagOffset[cfr, index, 8])
    loadi PayloadOffset[cfr, index, 8], payload
    jmp .done
.constant:
    loadp CodeBlock[cfr], payload
    loadp CodeBlock::m_constantRegisters + VectorBufferOffset[payload], payload
    # There is a bit of evil here: if the index contains a value >= FirstConstantRegisterIndex,
    # then value << 3 will be equal to (value - FirstConstantRegisterIndex) << 3.
    tagCheck(TagOffset[payload, index, 8])
    loadp PayloadOffset[payload, index, 8], payload
.done:
end

# Index and payload must be different registers. Index is not mutated. Use
# this if you know what the tag of the variable should be. Doing the tag
# test as part of loading the variable reduces register use, but may not
# be faster than doing loadConstantOrVariable followed by a branch on the
# tag.
macro loadConstantOrVariablePayload(index, expectedTag, payload, slow)
    loadConstantOrVariablePayloadTagCustom(
        index,
        macro (actualTag) bineq actualTag, expectedTag, slow end,
        payload)
end

macro loadConstantOrVariablePayloadUnchecked(index, payload)
    loadConstantOrVariablePayloadTagCustom(
        index,
        macro (actualTag) end,
        payload)
end

macro writeBarrier(tag, payload)
    # Nothing to do, since we don't have a generational or incremental collector.
end

macro valueProfile(tag, payload, profile)
    storei tag, ValueProfile::m_buckets + TagOffset[profile]
    storei payload, ValueProfile::m_buckets + PayloadOffset[profile]
end


# Indicate the beginning of LLInt.
_llint_begin:
    crash()


# Entrypoints into the interpreter

macro functionForCallCodeBlockGetter(targetRegister)
    loadp Callee[cfr], targetRegister
    loadp JSFunction::m_executable[targetRegister], targetRegister
    loadp FunctionExecutable::m_codeBlockForCall[targetRegister], targetRegister
end

macro functionForConstructCodeBlockGetter(targetRegister)
    loadp Callee[cfr], targetRegister
    loadp JSFunction::m_executable[targetRegister], targetRegister
    loadp FunctionExecutable::m_codeBlockForConstruct[targetRegister], targetRegister
end

macro notFunctionCodeBlockGetter(targetRegister)
    loadp CodeBlock[cfr], targetRegister
end

macro functionCodeBlockSetter(sourceRegister)
    storep sourceRegister, CodeBlock[cfr]
end

macro notFunctionCodeBlockSetter(sourceRegister)
    # Nothing to do!
end

# Do the bare minimum required to execute code. Sets up the PC, leave the CodeBlock*
# in t1. May also trigger prologue entry OSR.
macro prologue(codeBlockGetter, codeBlockSetter, osrHelper, traceHelper)
    preserveReturnAddressAfterCall(t2)
    
    # Set up the call frame and check if we should OSR.
    storep t2, ReturnPC[cfr]
    if EXECUTION_TRACING
        callHelper(traceHelper)
    end
    codeBlockGetter(t1)
    if JIT_ENABLED
        baddis 5, CodeBlock::m_llintExecuteCounter[t1], .continue
        cCall2(osrHelper, cfr, PC)
        move t1, cfr
        btpz t0, .recover
        loadp ReturnPC[cfr], t2
        restoreReturnAddressBeforeReturn(t2)
        jmp t0
    .recover:
        codeBlockGetter(t1)
    .continue:
    end
    codeBlockSetter(t1)
    
    # Set up the PC.
    loadp CodeBlock::m_instructions[t1], t0
    loadp CodeBlock::Instructions::m_instructions + VectorBufferOffset[t0], PC
end

# Expects that CodeBlock is in t1, which is what prologue() leaves behind.
# Must call dispatch(0) after calling this.
macro functionInitialization(profileArgSkip)
    # Profile the arguments. Unfortunately, we have no choice but to do this. This
    # code is pretty horrendous because of the difference in ordering between
    # arguments and value profiles, the desire to have a simple loop-down-to-zero
    # loop, and the desire to use only three registers so as to preserve the PC and
    # the code block. It is likely that this code should be rewritten in a more
    # optimal way for architectures that have more than five registers available
    # for arbitrary use in the interpreter.
    loadi CodeBlock::m_numParameters[t1], t0
    addi -profileArgSkip, t0 # Use addi because that's what has the peephole
    assert(macro (ok) bigteq t0, 0, ok end)
    btiz t0, .argumentProfileDone
    loadp CodeBlock::m_argumentValueProfiles + VectorBufferOffset[t1], t3
    muli sizeof ValueProfile, t0, t2 # Aaaaahhhh! Need strength reduction!
    negi t0
    lshifti 3, t0
    addp t2, t3
.argumentProfileLoop:
    loadi ThisArgumentOffset + TagOffset + 8 - profileArgSkip * 8[cfr, t0], t2
    subp sizeof ValueProfile, t3
    storei t2, profileArgSkip * sizeof ValueProfile + ValueProfile::m_buckets + TagOffset[t3]
    loadi ThisArgumentOffset + PayloadOffset + 8 - profileArgSkip * 8[cfr, t0], t2
    storei t2, profileArgSkip * sizeof ValueProfile + ValueProfile::m_buckets + PayloadOffset[t3]
    baddinz 8, t0, .argumentProfileLoop
.argumentProfileDone:
    
    # Check stack height.
    loadi CodeBlock::m_numCalleeRegisters[t1], t0
    loadp CodeBlock::m_globalData[t1], t2
    loadp JSGlobalData::interpreter[t2], t2   # FIXME: Can get to the RegisterFile from the JITStackFrame
    lshifti 3, t0
    addp t0, cfr, t0
    bpaeq Interpreter::m_registerFile + RegisterFile::m_end[t2], t0, .stackHeightOK

    # Stack height check failed - need to call a helper.
    callHelper(_llint_register_file_check)
.stackHeightOK:
end

# Expects that CodeBlock is in t1, which is what prologue() leaves behind.
macro functionArityCheck(doneLabel, helper)
    loadi PayloadOffset + ArgumentCount[cfr], t0
    biaeq t0, CodeBlock::m_numParameters[t1], doneLabel
    cCall2(helper, cfr, PC)   # This helper has a simple protocol: t0 = 0 => no error, t0 != 0 => error
    move t1, cfr
    btiz t0, .continue
    loadp JITStackFrame::globalData[sp], t1
    loadp JSGlobalData::callFrameForThrow[t1], t0
    jmp JSGlobalData::targetMachinePCForThrow[t1]
.continue:
    # Reload CodeBlock and PC, since the helper clobbered it.
    loadp CodeBlock[cfr], t1
    loadp CodeBlock::m_instructions[t1], t0
    loadp CodeBlock::Instructions::m_instructions + VectorBufferOffset[t0], PC
    jmp doneLabel
end

_llint_program_prologue:
    prologue(notFunctionCodeBlockGetter, notFunctionCodeBlockSetter, _llint_entry_osr, _llint_trace_prologue)
    dispatch(0)


_llint_eval_prologue:
    prologue(notFunctionCodeBlockGetter, notFunctionCodeBlockSetter, _llint_entry_osr, _llint_trace_prologue)
    dispatch(0)


_llint_function_for_call_prologue:
    prologue(functionForCallCodeBlockGetter, functionCodeBlockSetter, _llint_entry_osr_function_for_call, _llint_trace_prologue_function_for_call)
.functionForCallBegin:
    functionInitialization(0)
    dispatch(0)
    

_llint_function_for_construct_prologue:
    prologue(functionForConstructCodeBlockGetter, functionCodeBlockSetter, _llint_entry_osr_function_for_construct, _llint_trace_prologue_function_for_construct)
.functionForConstructBegin:
    functionInitialization(1)
    dispatch(0)
    

_llint_function_for_call_arity_check:
    prologue(functionForCallCodeBlockGetter, functionCodeBlockSetter, _llint_entry_osr_function_for_call_arityCheck, _llint_trace_arityCheck_for_call)
    functionArityCheck(.functionForCallBegin, _llint_helper_call_arityCheck)


_llint_function_for_construct_arity_check:
    prologue(functionForConstructCodeBlockGetter, functionCodeBlockSetter, _llint_entry_osr_function_for_construct_arityCheck, _llint_trace_arityCheck_for_construct)
    functionArityCheck(.functionForConstructBegin, _llint_helper_construct_arityCheck)

# Instruction implementations

_llint_op_enter:
    traceExecution()
    loadp CodeBlock[cfr], t2
    loadi CodeBlock::m_numVars[t2], t2
    btiz t2, .opEnterDone
    move UndefinedTag, t0
    move 0, t1
.opEnterLoop:
    subi 1, t2
    storei t0, TagOffset[cfr, t2, 8]
    storei t1, PayloadOffset[cfr, t2, 8]
    btinz t2, .opEnterLoop
.opEnterDone:
    dispatch(1)


_llint_op_create_activation:
    traceExecution()
    loadi 4[PC], t0
    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opCreateActivationDone
    callHelper(_llint_helper_create_activation)
.opCreateActivationDone:
    dispatch(2)


_llint_op_init_lazy_reg:
    traceExecution()
    loadi 4[PC], t0
    storei EmptyValueTag, TagOffset[cfr, t0, 8]
    storei 0, PayloadOffset[cfr, t0, 8]
    dispatch(2)


_llint_op_create_arguments:
    traceExecution()
    loadi 4[PC], t0
    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opCreateArgumentsDone
    callHelper(_llint_helper_create_arguments)
.opCreateArgumentsDone:
    dispatch(2)


macro allocateBasicJSObject(sizeClassIndex, classInfoOffset, structure, result, scratch1, scratch2, slowCase)
    const offsetOfMySizeClass = JSGlobalData::heap + Heap::m_objectSpace + AllocationSpace::m_markedSpace + MarkedSpace::m_preciseSizeClasses + sizeClassIndex * sizeof MarkedSpace::SizeClass
    
    # FIXME: we can get the global data in one load from the stack.
    loadp CodeBlock[cfr], scratch1
    loadp CodeBlock::m_globalData[scratch1], scratch1
    
    # Get the object from the free list.    
    loadp offsetOfMySizeClass + MarkedSpace::SizeClass::firstFreeCell[scratch1], result
    btpz result, slowCase
    
    # Remove the object from the free list.
    loadp [result], scratch2
    storep scratch2, offsetOfMySizeClass + MarkedSpace::SizeClass::firstFreeCell[scratch1]

    # Initialize the object.
    loadp classInfoOffset[scratch1], scratch2
    storep scratch2, [result]
    storep structure, JSCell::m_structure[result]
    storep 0, JSObject::m_inheritorID[result]
    addp sizeof JSObject, result, scratch1
    storep scratch1, JSObject::m_propertyStorage[result]
end

_llint_op_create_this:
    traceExecution()
    loadi 8[PC], t0
    assertNotConstant(t0)
    bineq TagOffset[cfr, t0, 8], CellTag, .opCreateThisSlow
    loadi PayloadOffset[cfr, t0, 8], t0
    loadp JSCell::m_structure[t0], t1
    bbb Structure::m_typeInfo + TypeInfo::m_type[t1], ObjectType, .opCreateThisSlow
    loadp JSObject::m_inheritorID[t0], t2
    btpz t2, .opCreateThisSlow
    allocateBasicJSObject(JSFinalObjectSizeClassIndex, JSGlobalData::jsFinalObjectClassInfo, t2, t0, t1, t3, .opCreateThisSlow)
    loadi 4[PC], t1
    storei CellTag, TagOffset[cfr, t1, 8]
    storei t0, PayloadOffset[cfr, t1, 8]
    dispatch(3)

.opCreateThisSlow:
    callHelper(_llint_helper_create_this)
    dispatch(3)


_llint_op_get_callee:
    traceExecution()
    loadi 4[PC], t0
    loadp PayloadOffset + Callee[cfr], t1
    storei CellTag, TagOffset[cfr, t0, 8]
    storei t1, PayloadOffset[cfr, t0, 8]
    dispatch(2)


_llint_op_convert_this:
    traceExecution()
    loadi 4[PC], t0
    bineq TagOffset[cfr, t0, 8], CellTag, .opConvertThisSlow
    loadi PayloadOffset[cfr, t0, 8], t0
    loadp JSCell::m_structure[t0], t0
    bbb Structure::m_typeInfo + TypeInfo::m_type[t0], ObjectType, .opConvertThisSlow
    dispatch(2)

.opConvertThisSlow:
    callHelper(_llint_helper_convert_this)
    dispatch(2)


_llint_op_new_object:
    traceExecution()
    loadp CodeBlock[cfr], t0
    loadp CodeBlock::m_globalObject[t0], t0
    loadp JSGlobalObject::m_emptyObjectStructure[t0], t1
    allocateBasicJSObject(JSFinalObjectSizeClassIndex, JSGlobalData::jsFinalObjectClassInfo, t1, t0, t2, t3, .opNewObjectSlow)
    loadi 4[PC], t1
    storei CellTag, TagOffset[cfr, t1, 8]
    storei t0, PayloadOffset[cfr, t1, 8]
    dispatch(2)

.opNewObjectSlow:
    callHelper(_llint_helper_new_object)
    dispatch(2)


_llint_op_new_array:
    traceExecution()
    callHelper(_llint_helper_new_array)
    dispatch(4)


_llint_op_new_array_buffer:
    traceExecution()
    callHelper(_llint_helper_new_array_buffer)
    dispatch(4)


_llint_op_new_regexp:
    traceExecution()
    callHelper(_llint_helper_new_regexp)
    dispatch(3)


_llint_op_mov:
    traceExecution()
    loadi 8[PC], t1
    loadi 4[PC], t0
    loadConstantOrVariable(t1, t2, t3)
    storei t2, TagOffset[cfr, t0, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
    dispatch(3)


_llint_op_not:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t1
    loadConstantOrVariable(t0, t2, t3)
    bineq t2, BooleanTag, .opNotSlow
    xori 1, t3
    storei t2, TagOffset[cfr, t1, 8]
    storei t3, PayloadOffset[cfr, t1, 8]
    dispatch(3)

.opNotSlow:
    callHelper(_llint_helper_not)
    dispatch(3)


_llint_op_eq:
    traceExecution()
    loadi 12[PC], t2
    loadi 8[PC], t0
    loadConstantOrVariable(t2, t3, t1)
    loadConstantOrVariable2Reg(t0, t2, t0)
    bineq t2, t3, .opEqSlow
    bieq t2, CellTag, .opEqSlow
    bib t2, LowestTag, .opEqSlow
    loadi 4[PC], t2
    cieq t0, t1, t0
    storei BooleanTag, TagOffset[cfr, t2, 8]
    storei t0, PayloadOffset[cfr, t2, 8]
    dispatch(4)

.opEqSlow:
    callHelper(_llint_helper_eq)
    dispatch(4)


_llint_op_eq_null:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t3
    assertNotConstant(t0)
    loadi TagOffset[cfr, t0, 8], t1
    loadi PayloadOffset[cfr, t0, 8], t0
    bineq t1, CellTag, .opEqNullImmediate
    loadp JSCell::m_structure[t0], t1
    tbnz Structure::m_typeInfo + TypeInfo::m_flags[t1], MasqueradesAsUndefined, t1
    jmp .opEqNullNotImmediate
.opEqNullImmediate:
    cieq t1, NullTag, t2
    cieq t1, UndefinedTag, t1
    ori t2, t1
.opEqNullNotImmediate:
    storei BooleanTag, TagOffset[cfr, t3, 8]
    storei t1, PayloadOffset[cfr, t3, 8]
    dispatch(3)


_llint_op_neq:
    traceExecution()
    loadi 12[PC], t2
    loadi 8[PC], t0
    loadConstantOrVariable(t2, t3, t1)
    loadConstantOrVariable2Reg(t0, t2, t0)
    bineq t2, t3, .opNeqSlow
    bieq t2, CellTag, .opNeqSlow
    bib t2, LowestTag, .opNeqSlow
    loadi 4[PC], t2
    cineq t0, t1, t0
    storei BooleanTag, TagOffset[cfr, t2, 8]
    storei t0, PayloadOffset[cfr, t2, 8]
    dispatch(4)

.opNeqSlow:
    callHelper(_llint_helper_neq)
    dispatch(4)
    

_llint_op_neq_null:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t3
    assertNotConstant(t0)
    loadi TagOffset[cfr, t0, 8], t1
    loadi PayloadOffset[cfr, t0, 8], t0
    bineq t1, CellTag, .opNeqNullImmediate
    loadp JSCell::m_structure[t0], t1
    tbz Structure::m_typeInfo + TypeInfo::m_flags[t1], MasqueradesAsUndefined, t1
    jmp .opNeqNullNotImmediate
.opNeqNullImmediate:
    cineq t1, NullTag, t2
    cineq t1, UndefinedTag, t1
    andi t2, t1
.opNeqNullNotImmediate:
    storei BooleanTag, TagOffset[cfr, t3, 8]
    storei t1, PayloadOffset[cfr, t3, 8]
    dispatch(3)


macro strictEq(equalityOperation, helper)
    loadi 12[PC], t2
    loadi 8[PC], t0
    loadConstantOrVariable(t2, t3, t1)
    loadConstantOrVariable2Reg(t0, t2, t0)
    bineq t2, t3, .slow
    bib t2, LowestTag, .slow
    bineq t2, CellTag, .notString
    loadp JSCell::m_structure[t0], t2
    loadp JSCell::m_structure[t1], t3
    bbneq Structure::m_typeInfo + TypeInfo::m_type[t2], StringType, .notString
    bbeq Structure::m_typeInfo + TypeInfo::m_type[t3], StringType, .slow
.notString:
    loadi 4[PC], t2
    equalityOperation(t0, t1, t0)
    storei BooleanTag, TagOffset[cfr, t2, 8]
    storei t0, PayloadOffset[cfr, t2, 8]
    dispatch(4)

.slow:
    callHelper(helper)
    dispatch(4)
end

_llint_op_stricteq:
    traceExecution()
    strictEq(macro (left, right, result) cieq left, right, result end, _llint_helper_stricteq)


_llint_op_nstricteq:
    traceExecution()
    strictEq(macro (left, right, result) cineq left, right, result end, _llint_helper_nstricteq)


_llint_op_less:
    traceExecution()
    callHelper(_llint_helper_less)
    dispatch(4)


_llint_op_lesseq:
    traceExecution()
    callHelper(_llint_helper_lesseq)
    dispatch(4)


_llint_op_greater:
    traceExecution()
    callHelper(_llint_helper_greater)
    dispatch(4)


_llint_op_greatereq:
    traceExecution()
    callHelper(_llint_helper_greatereq)
    dispatch(4)


_llint_op_pre_inc:
    traceExecution()
    loadi 4[PC], t0
    bineq TagOffset[cfr, t0, 8], Int32Tag, .opPreIncSlow
    loadi PayloadOffset[cfr, t0, 8], t1
    baddio 1, t1, .opPreIncSlow
    storei t1, PayloadOffset[cfr, t0, 8]
    dispatch(2)

.opPreIncSlow:
    callHelper(_llint_helper_pre_inc)
    dispatch(2)


_llint_op_pre_dec:
    traceExecution()
    loadi 4[PC], t0
    bineq TagOffset[cfr, t0, 8], Int32Tag, .opPreDecSlow
    loadi PayloadOffset[cfr, t0, 8], t1
    bsubio 1, t1, .opPreDecSlow
    storei t1, PayloadOffset[cfr, t0, 8]
    dispatch(2)

.opPreDecSlow:
    callHelper(_llint_helper_pre_dec)
    dispatch(2)


_llint_op_post_inc:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t1
    bineq TagOffset[cfr, t0, 8], Int32Tag, .opPostIncSlow
    bieq t0, t1, .opPostIncDone
    loadi PayloadOffset[cfr, t0, 8], t2
    move t2, t3
    baddio 1, t3, .opPostIncSlow
    storei Int32Tag, TagOffset[cfr, t1, 8]
    storei t2, PayloadOffset[cfr, t1, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
.opPostIncDone:
    dispatch(3)

.opPostIncSlow:
    callHelper(_llint_helper_post_inc)
    dispatch(3)


_llint_op_post_dec:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t1
    bineq TagOffset[cfr, t0, 8], Int32Tag, .opPostDecSlow
    bieq t0, t1, .opPostDecDone
    loadi PayloadOffset[cfr, t0, 8], t2
    move t2, t3
    bsubio 1, t3, .opPostDecSlow
    storei Int32Tag, TagOffset[cfr, t1, 8]
    storei t2, PayloadOffset[cfr, t1, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
.opPostDecDone:
    dispatch(3)

.opPostDecSlow:
    callHelper(_llint_helper_post_dec)
    dispatch(3)


_llint_op_to_jsnumber:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t1
    loadConstantOrVariable(t0, t2, t3)
    bieq t2, Int32Tag, .opToJsnumberIsInt
    biaeq t2, EmptyValueTag, .opToJsnumberSlow
.opToJsnumberIsInt:
    storei t2, TagOffset[cfr, t1, 8]
    storei t3, PayloadOffset[cfr, t1, 8]
    dispatch(3)

.opToJsnumberSlow:
    callHelper(_llint_helper_to_jsnumber)
    dispatch(3)


_llint_op_negate:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t3
    loadConstantOrVariable(t0, t1, t2)
    bineq t1, Int32Tag, .opNegateSrcNotInt
    btiz t2, 0x7fffffff, .opNegateSlow
    negi t2
    storei Int32Tag, TagOffset[cfr, t3, 8]
    storei t2, PayloadOffset[cfr, t3, 8]
    dispatch(3)
.opNegateSrcNotInt:
    bia t1, LowestTag, .opNegateSlow
    xori 0x80000000, t1
    storei t1, TagOffset[cfr, t3, 8]
    storei t2, PayloadOffset[cfr, t3, 8]
    dispatch(3)

.opNegateSlow:
    callHelper(_llint_helper_negate)
    dispatch(3)


macro binaryOpCustomStore(integerOperationAndStore, doubleOperation, helper)
    loadi 12[PC], t2
    loadi 8[PC], t0
    loadConstantOrVariable(t2, t3, t1)
    loadConstantOrVariable2Reg(t0, t2, t0)
    bineq t2, Int32Tag, .op1NotInt
    bineq t3, Int32Tag, .op2NotInt
    loadi 4[PC], t2
    integerOperationAndStore(t3, t1, t0, .slow, t2)
    dispatch(5)

.op1NotInt:
    # First operand is definitely not an int, the second operand could be anything.
    bia t2, LowestTag, .slow
    bib t3, LowestTag, .op1NotIntOp2Double
    bineq t3, Int32Tag, .slow
    ci2d t1, ft1
    jmp .op1NotIntReady
.op1NotIntOp2Double:
    fii2d t1, t3, ft1
.op1NotIntReady:
    loadi 4[PC], t1
    fii2d t0, t2, ft0
    doubleOperation(ft1, ft0)
    stored ft0, [cfr, t1, 8]
    dispatch(5)

.op2NotInt:
    # First operand is definitely an int, the second operand is definitely not.
    loadi 4[PC], t2
    bia t3, LowestTag, .slow
    ci2d t0, ft0
    fii2d t1, t3, ft1
    doubleOperation(ft1, ft0)
    stored ft0, [cfr, t2, 8]
    dispatch(5)

.slow:
    callHelper(helper)
    dispatch(5)
end

macro binaryOp(integerOperation, doubleOperation, helper)
    binaryOpCustomStore(
        macro (int32Tag, left, right, slow, index)
            integerOperation(left, right, slow)
            storei int32Tag, TagOffset[cfr, index, 8]
            storei right, PayloadOffset[cfr, index, 8]
        end,
        doubleOperation, helper)
end

_llint_op_add:
    traceExecution()
    binaryOp(
        macro (left, right, slow) baddio left, right, slow end,
        macro (left, right) addd left, right end,
        _llint_helper_add)


_llint_op_mul:
    traceExecution()
    binaryOpCustomStore(
        macro (int32Tag, left, right, slow, index)
            const scratch = int32Tag   # We know that we can reuse the int32Tag register since it has a constant.
            move right, scratch
            bmulio left, scratch, slow
            btinz scratch, .done
            bilt left, 0, .slow
            bilt right, 0, .slow
        .done:
            storei Int32Tag, TagOffset[cfr, index, 8]
            storei scratch, PayloadOffset[cfr, index, 8]
        end,
        macro (left, right) muld left, right end,
        _llint_helper_mul)


_llint_op_sub:
    traceExecution()
    binaryOp(
        macro (left, right, slow) bsubio left, right, slow end,
        macro (left, right) subd left, right end,
        _llint_helper_sub)


_llint_op_div:
    traceExecution()
    binaryOpCustomStore(
        macro (int32Tag, left, right, slow, index)
            ci2d left, ft0
            ci2d right, ft1
            divd ft0, ft1
            bcd2i ft1, right, .notInt
            storei int32Tag, TagOffset[cfr, index, 8]
            storei right, PayloadOffset[cfr, index, 8]
            jmp .done
        .notInt:
            stored ft1, [cfr, index, 8]
        .done:
        end,
        macro (left, right) divd left, right end,
        _llint_helper_div)


_llint_op_mod:
    traceExecution()
    callHelper(_llint_helper_mod)
    dispatch(4)


macro bitOp(operation, helper, advance)
    loadi 12[PC], t2
    loadi 8[PC], t0
    loadConstantOrVariable(t2, t3, t1)
    loadConstantOrVariable2Reg(t0, t2, t0)
    bineq t3, Int32Tag, .slow
    bineq t2, Int32Tag, .slow
    loadi 4[PC], t2
    operation(t1, t0, .slow)
    storei t3, TagOffset[cfr, t2, 8]
    storei t0, PayloadOffset[cfr, t2, 8]
    dispatch(advance)

.slow:
    callHelper(helper)
    dispatch(advance)
end

_llint_op_lshift:
    traceExecution()
    bitOp(
        macro (left, right, slow) lshifti left, right end,
        _llint_helper_lshift,
        4)


_llint_op_rshift:
    traceExecution()
    bitOp(
        macro (left, right, slow) rshifti left, right end,
        _llint_helper_rshift,
        4)


_llint_op_urshift:
    traceExecution()
    bitOp(
        macro (left, right, slow)
            urshifti left, right
            bilt right, 0, slow
        end,
        _llint_helper_urshift,
        4)


_llint_op_bitand:
    traceExecution()
    bitOp(
        macro (left, right, slow) andi left, right end,
        _llint_helper_bitand,
        5)


_llint_op_bitxor:
    traceExecution()
    bitOp(
        macro (left, right, slow) xori left, right end,
        _llint_helper_bitxor,
        5)


_llint_op_bitor:
    traceExecution()
    bitOp(
        macro (left, right, slow) ori left, right end,
        _llint_helper_bitor,
        5)


_llint_op_bitnot:
    traceExecution()
    loadi 8[PC], t1
    loadi 4[PC], t0
    loadConstantOrVariable(t1, t2, t3)
    bineq t2, Int32Tag, .opBitnotSlow
    noti t3
    storei t2, TagOffset[cfr, t0, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
    dispatch(3)

.opBitnotSlow:
    callHelper(_llint_helper_bitnot)
    dispatch(3)


_llint_op_check_has_instance:
    traceExecution()
    loadi 4[PC], t1
    loadConstantOrVariablePayload(t1, CellTag, t0, .opCheckHasInstanceSlow)
    loadp JSCell::m_structure[t0], t0
    btbz Structure::m_typeInfo + TypeInfo::m_flags[t0], ImplementsHasInstance, .opCheckHasInstanceSlow
    dispatch(2)

.opCheckHasInstanceSlow:
    callHelper(_llint_helper_check_has_instance)
    dispatch(2)


_llint_op_instanceof:
    traceExecution()
    # Check that baseVal implements the default HasInstance behavior.
    # FIXME: This should be deprecated.
    loadi 12[PC], t1
    loadConstantOrVariablePayloadUnchecked(t1, t0)
    loadp JSCell::m_structure[t0], t0
    btbz Structure::m_typeInfo + TypeInfo::m_flags[t0], ImplementsDefaultHasInstance, .opInstanceofSlow
    
    # Actually do the work.
    loadi 16[PC], t0
    loadi 4[PC], t3
    loadConstantOrVariablePayload(t0, CellTag, t1, .opInstanceofSlow)
    loadp JSCell::m_structure[t1], t2
    bbb Structure::m_typeInfo + TypeInfo::m_type[t2], ObjectType, .opInstanceofSlow
    loadi 8[PC], t0
    loadConstantOrVariablePayload(t0, CellTag, t2, .opInstanceofSlow)
    
    # Register state: t1 = prototype, t2 = value
    move 1, t0
.opInstanceofLoop:
    loadp JSCell::m_structure[t2], t2
    loadi Structure::m_prototype + PayloadOffset[t2], t2
    bpeq t2, t1, .opInstanceofDone
    btinz t2, .opInstanceofLoop

    move 0, t0
.opInstanceofDone:
    storei BooleanTag, TagOffset[cfr, t3, 8]
    storei t0, PayloadOffset[cfr, t3, 8]
    dispatch(5)

.opInstanceofSlow:
    callHelper(_llint_helper_instanceof)
    dispatch(5)


_llint_op_typeof:
    traceExecution()
    callHelper(_llint_helper_typeof)
    dispatch(3)


_llint_op_is_undefined:
    traceExecution()
    callHelper(_llint_helper_is_undefined)
    dispatch(3)


_llint_op_is_boolean:
    traceExecution()
    callHelper(_llint_helper_is_boolean)
    dispatch(3)


_llint_op_is_number:
    traceExecution()
    callHelper(_llint_helper_is_number)
    dispatch(3)


_llint_op_is_string:
    traceExecution()
    callHelper(_llint_helper_is_string)
    dispatch(3)


_llint_op_is_object:
    traceExecution()
    callHelper(_llint_helper_is_object)
    dispatch(3)


_llint_op_is_function:
    traceExecution()
    callHelper(_llint_helper_is_function)
    dispatch(3)


_llint_op_in:
    traceExecution()
    callHelper(_llint_helper_in)
    dispatch(4)


_llint_op_resolve:
    traceExecution()
    callHelper(_llint_helper_resolve)
    dispatch(4)


_llint_op_resolve_skip:
    traceExecution()
    callHelper(_llint_helper_resolve_skip)
    dispatch(5)


macro resolveGlobal(size, slow)
    # Operands are as follows:
    # 4[PC]   Destination for the load.
    # 8[PC]   Property identifier index in the code block.
    # 12[PC]  Structure pointer, initialized to 0 by bytecode generator.
    # 16[PC]  Offset in global object, initialized to 0 by bytecode generator.
    loadp CodeBlock[cfr], t0
    loadp CodeBlock::m_globalObject[t0], t0
    loadp JSCell::m_structure[t0], t1
    bpneq t1, 12[PC], slow
    loadi 16[PC], t1
    loadp JSObject::m_propertyStorage[t0], t0
    loadi TagOffset[t0, t1, 8], t2
    loadi PayloadOffset[t0, t1, 8], t3
    loadi 4[PC], t0
    storei t2, TagOffset[cfr, t0, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
    loadi (size - 1) * 4[PC], t0
    valueProfile(t2, t3, t0)
end

_llint_op_resolve_global:
    traceExecution()
    resolveGlobal(6, .opResolveGlobalSlow)
    dispatch(6)

.opResolveGlobalSlow:
    callHelper(_llint_helper_resolve_global)
    dispatch(6)


# Gives you the scope in t0, while allowing you to optionally perform additional checks on the
# scopes as they are traversed. scopeCheck() is called with two arguments: the register
# holding the scope, and a register that can be used for scratch. Note that this does not
# use t3, so you can hold stuff in t3 if need be.
macro getScope(deBruijinIndexOperand, scopeCheck)
    loadp ScopeChain + PayloadOffset[cfr], t0
    loadi deBruijinIndexOperand, t2
    
    btiz t2, .done
    
    loadp CodeBlock[cfr], t1
    bineq CodeBlock::m_codeType[t1], FunctionCode, .loop
    btbz CodeBlock::m_needsFullScopeChain[t1], .loop
    
    loadi CodeBlock::m_activationRegister[t1], t1

    # Need to conditionally skip over one scope.
    bieq TagOffset[cfr, t1, 8], EmptyValueTag, .noActivation
    scopeCheck(t0, t1)
    loadp ScopeChainNode::next[t0], t0
.noActivation:
    subi 1, t2
    
    btiz t2, .done
.loop:
    scopeCheck(t0, t1)
    loadp ScopeChainNode::next[t0], t0
    subi 1, t2
    btinz t2, .loop

.done:
end

_llint_op_resolve_global_dynamic:
    traceExecution()
    loadp JITStackFrame::globalData[sp], t3
    loadp JSGlobalData::activationStructure[t3], t3
    getScope(
        20[PC],
        macro (scope, scratch)
            loadp ScopeChainNode::object[scope], scratch
            bpneq JSCell::m_structure[scratch], t3, .opResolveGlobalDynamicSuperSlow
        end)
    resolveGlobal(7, .opResolveGlobalDynamicSlow)
    dispatch(7)

.opResolveGlobalDynamicSuperSlow:
    callHelper(_llint_helper_resolve_for_resolve_global_dynamic)
    dispatch(7)

.opResolveGlobalDynamicSlow:
    callHelper(_llint_helper_resolve_global_dynamic)
    dispatch(7)


_llint_op_get_scoped_var:
    traceExecution()
    # Operands are as follows:
    # 4[PC]   Destination for the load.
    # 8[PC]   Index of register in the scope.
    # 12[PC]  De Bruijin index.
    getScope(12[PC], macro (scope, scratch) end)
    loadi 4[PC], t1
    loadi 8[PC], t2
    loadp ScopeChainNode::object[t0], t0
    loadp JSVariableObject::m_registers[t0], t0
    loadi TagOffset[t0, t2, 8], t3
    loadi PayloadOffset[t0, t2, 8], t0
    storei t3, TagOffset[cfr, t1, 8]
    storei t0, PayloadOffset[cfr, t1, 8]
    loadi 16[PC], t1
    valueProfile(t3, t0, t1)
    dispatch(5)


_llint_op_put_scoped_var:
    traceExecution()
    getScope(8[PC], macro (scope, scratch) end)
    loadi 12[PC], t1
    loadConstantOrVariable(t1, t3, t2)
    loadi 4[PC], t1
    writeBarrier(t3, t2)
    loadp ScopeChainNode::object[t0], t0
    loadp JSVariableObject::m_registers[t0], t0
    storei t3, TagOffset[t0, t1, 8]
    storei t2, PayloadOffset[t0, t1, 8]
    dispatch(4)


_llint_op_get_global_var:
    traceExecution()
    loadi 8[PC], t1
    loadi 4[PC], t3
    loadp CodeBlock[cfr], t0
    loadp CodeBlock::m_globalObject[t0], t0
    loadp JSGlobalObject::m_registers[t0], t0
    loadi TagOffset[t0, t1, 8], t2
    loadi PayloadOffset[t0, t1, 8], t1
    storei t2, TagOffset[cfr, t3, 8]
    storei t1, PayloadOffset[cfr, t3, 8]
    loadi 12[PC], t3
    valueProfile(t2, t1, t3)
    dispatch(4)


_llint_op_put_global_var:
    traceExecution()
    loadi 8[PC], t1
    loadp CodeBlock[cfr], t0
    loadp CodeBlock::m_globalObject[t0], t0
    loadp JSGlobalObject::m_registers[t0], t0
    loadConstantOrVariable(t1, t2, t3)
    loadi 4[PC], t1
    writeBarrier(t2, t3)
    storei t2, TagOffset[t0, t1, 8]
    storei t3, PayloadOffset[t0, t1, 8]
    dispatch(3)


_llint_op_resolve_base:
    traceExecution()
    callHelper(_llint_helper_resolve_base)
    dispatch(5)


_llint_op_ensure_property_exists:
    traceExecution()
    callHelper(_llint_helper_ensure_property_exists)
    dispatch(3)


_llint_op_resolve_with_base:
    traceExecution()
    callHelper(_llint_helper_resolve_with_base)
    dispatch(5)


_llint_op_resolve_with_this:
    traceExecution()
    callHelper(_llint_helper_resolve_with_this)
    dispatch(5)


_llint_op_get_by_id:
    traceExecution()
    # We only do monomorphic get_by_id caching for now, and we do not modify the
    # opcode. We do, however, allow for the cache to change anytime if fails, since
    # ping-ponging is free. At best we get lucky and the get_by_id will continue
    # to take fast path on the new cache. At worst we take slow path, which is what
    # we would have been doing anyway.
    loadi 8[PC], t0
    loadi 16[PC], t1
    loadConstantOrVariablePayload(t0, CellTag, t3, .opGetByIdSlow)
    loadi 20[PC], t2
    loadp JSObject::m_propertyStorage[t3], t0
    bpneq JSCell::m_structure[t3], t1, .opGetByIdSlow
    loadi 4[PC], t1
    loadi TagOffset[t0, t2], t3
    loadi PayloadOffset[t0, t2], t2
    storei t3, TagOffset[cfr, t1, 8]
    storei t2, PayloadOffset[cfr, t1, 8]
    loadi 32[PC], t1
    valueProfile(t3, t2, t1)
    dispatch(9)

.opGetByIdSlow:
    callHelper(_llint_helper_get_by_id)
    dispatch(9)


_llint_op_get_arguments_length:
    traceExecution()
    loadi 8[PC], t0
    loadi 4[PC], t1
    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opGetArgumentsLengthSlow
    loadi ArgumentCount + PayloadOffset[cfr], t2
    subi 1, t2
    storei Int32Tag, TagOffset[cfr, t1, 8]
    storei t2, PayloadOffset[cfr, t1, 8]
    dispatch(4)

.opGetArgumentsLengthSlow:
    callHelper(_llint_helper_get_arguments_length)
    dispatch(4)


_llint_op_put_by_id:
    traceExecution()
    loadi 4[PC], t3
    loadi 16[PC], t1
    loadConstantOrVariablePayload(t3, CellTag, t0, .opPutByIdSlow)
    loadi 12[PC], t2
    loadp JSObject::m_propertyStorage[t0], t3
    bpneq JSCell::m_structure[t0], t1, .opPutByIdSlow
    loadi 20[PC], t1
    loadConstantOrVariable2Reg(t2, t0, t2)
    writeBarrier(t0, t2)
    storei t0, TagOffset[t3, t1]
    storei t2, PayloadOffset[t3, t1]
    dispatch(9)

.opPutByIdSlow:
    callHelper(_llint_helper_put_by_id)
    dispatch(9)


macro putByIdTransition(additionalChecks)
    traceExecution()
    loadi 4[PC], t3
    loadi 16[PC], t1
    loadConstantOrVariablePayload(t3, CellTag, t0, .opPutByIdSlow)
    loadi 12[PC], t2
    bpneq JSCell::m_structure[t0], t1, .opPutByIdSlow
    additionalChecks(t1, t3, .opPutByIdSlow)
    loadi 20[PC], t1
    loadp JSObject::m_propertyStorage[t0], t3
    addp t1, t3
    loadConstantOrVariable2Reg(t2, t1, t2)
    writeBarrier(t1, t2)
    storei t1, TagOffset[t3]
    loadi 24[PC], t1
    storei t2, PayloadOffset[t3]
    storep t1, JSCell::m_structure[t0]
    dispatch(9)
end

_llint_op_put_by_id_transition_direct:
    putByIdTransition(macro (oldStructure, scratch, slow) end)


_llint_op_put_by_id_transition_normal:
    putByIdTransition(
        macro (oldStructure, scratch, slow)
            const protoCell = oldStructure   # Reusing the oldStructure register for the proto
        
            loadp 28[PC], scratch
            assert(macro (ok) btpnz scratch, ok end)
            loadp StructureChain::m_vector[scratch], scratch
            assert(macro (ok) btpnz scratch, ok end)
            bieq Structure::m_prototype + TagOffset[oldStructure], NullTag, .done
        .loop:
            loadi Structure::m_prototype + PayloadOffset[oldStructure], protoCell
            loadp JSCell::m_structure[protoCell], oldStructure
            bpneq oldStructure, [scratch], slow
            addp 4, scratch
            bineq Structure::m_prototype + TagOffset[oldStructure], NullTag, .loop
        .done:
        end)


_llint_op_del_by_id:
    traceExecution()
    callHelper(_llint_helper_del_by_id)
    dispatch(4)


_llint_op_get_by_val:
    traceExecution()
    loadp CodeBlock[cfr], t1
    loadi 8[PC], t2
    loadi 12[PC], t3
    loadp CodeBlock::m_globalData[t1], t1
    loadConstantOrVariablePayload(t2, CellTag, t0, .opGetByValSlow)
    loadp JSGlobalData::jsArrayClassInfo[t1], t2
    loadConstantOrVariablePayload(t3, Int32Tag, t1, .opGetByValSlow)
    bpneq [t0], t2, .opGetByValSlow
    loadp JSArray::m_storage[t0], t3
    biaeq t1, JSArray::m_vectorLength[t0], .opGetByValSlow
    loadi 4[PC], t0
    loadi ArrayStorage::m_vector + TagOffset[t3, t1, 8], t2
    loadi ArrayStorage::m_vector + PayloadOffset[t3, t1, 8], t1
    bieq t2, EmptyValueTag, .opGetByValSlow
    storei t2, TagOffset[cfr, t0, 8]
    storei t1, PayloadOffset[cfr, t0, 8]
    loadi 16[PC], t0
    valueProfile(t2, t1, t0)
    dispatch(5)

.opGetByValSlow:
    callHelper(_llint_helper_get_by_val)
    dispatch(5)


_llint_op_get_argument_by_val:
    traceExecution()
    loadi 8[PC], t0
    loadi 12[PC], t1
    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opGetArgumentByValSlow
    loadConstantOrVariablePayload(t1, Int32Tag, t2, .opGetArgumentByValSlow)
    addi 1, t2
    loadi ArgumentCount + PayloadOffset[cfr], t1
    biaeq t2, t1, .opGetArgumentByValSlow
    negi t2
    loadi 4[PC], t3
    loadi ThisArgumentOffset + TagOffset[cfr, t2, 8], t0
    loadi ThisArgumentOffset + PayloadOffset[cfr, t2, 8], t1
    storei t0, TagOffset[cfr, t3, 8]
    storei t1, PayloadOffset[cfr, t3, 8]
    dispatch(4)

.opGetArgumentByValSlow:
    callHelper(_llint_helper_get_argument_by_val)
    dispatch(4)


_llint_op_get_by_pname:
    traceExecution()
    loadi 12[PC], t0
    loadConstantOrVariablePayload(t0, CellTag, t1, .opGetByPnameSlow)
    loadi 16[PC], t0
    bpneq t1, PayloadOffset[cfr, t0, 8], .opGetByPnameSlow
    loadi 8[PC], t0
    loadConstantOrVariablePayload(t0, CellTag, t2, .opGetByPnameSlow)
    loadi 20[PC], t0
    loadi PayloadOffset[cfr, t0, 8], t3
    loadp JSCell::m_structure[t2], t0
    bpneq t0, JSPropertyNameIterator::m_cachedStructure[t3], .opGetByPnameSlow
    loadi 24[PC], t0
    loadi [cfr, t0, 8], t0
    subi 1, t0
    biaeq t0, JSPropertyNameIterator::m_numCacheableSlots[t3], .opGetByPnameSlow
    loadp JSObject::m_propertyStorage[t2], t2
    loadi TagOffset[t2, t0, 8], t1
    loadi PayloadOffset[t2, t0, 8], t3
    loadi 4[PC], t0
    storei t1, TagOffset[cfr, t0, 8]
    storei t3, PayloadOffset[cfr, t0, 8]
    dispatch(7)

.opGetByPnameSlow:
    callHelper(_llint_helper_get_by_pname)
    dispatch(7)


_llint_op_put_by_val:
    traceExecution()
    loadi 4[PC], t0
    loadConstantOrVariablePayload(t0, CellTag, t1, .opPutByValSlow)
    loadi 8[PC], t0
    loadConstantOrVariablePayload(t0, Int32Tag, t2, .opPutByValSlow)
    loadp CodeBlock[cfr], t0
    loadp CodeBlock::m_globalData[t0], t0
    loadp JSGlobalData::jsArrayClassInfo[t0], t0
    bpneq [t1], t0, .opPutByValSlow
    biaeq t2, JSArray::m_vectorLength[t1], .opPutByValSlow
    loadp JSArray::m_storage[t1], t0
    bieq ArrayStorage::m_vector + TagOffset[t0, t2, 8], EmptyValueTag, .opPutByValEmpty
.opPutByValStoreResult:
    loadi 12[PC], t3
    loadConstantOrVariable2Reg(t3, t1, t3)
    writeBarrier(t1, t3)
    storei t1, ArrayStorage::m_vector + TagOffset[t0, t2, 8]
    storei t3, ArrayStorage::m_vector + PayloadOffset[t0, t2, 8]
    dispatch(4)

.opPutByValEmpty:
    addi 1, ArrayStorage::m_numValuesInVector[t0]
    bib t2, ArrayStorage::m_length[t0], .opPutByValStoreResult
    addi 1, t2, t1
    storei t1, ArrayStorage::m_length[t0]
    jmp .opPutByValStoreResult

.opPutByValSlow:
    callHelper(_llint_helper_put_by_val)
    dispatch(4)


_llint_op_del_by_val:
    traceExecution()
    callHelper(_llint_helper_del_by_val)
    dispatch(4)


_llint_op_put_by_index:
    traceExecution()
    callHelper(_llint_helper_put_by_index)
    dispatch(4)


_llint_op_put_getter:
    traceExecution()
    callHelper(_llint_helper_put_getter)
    dispatch(4)


_llint_op_put_setter:
    traceExecution()
    callHelper(_llint_helper_put_setter)
    dispatch(4)


_llint_op_loop:
    nop
_llint_op_jmp:
    traceExecution()
    dispatchBranch(4[PC])


_llint_op_jmp_scopes:
    traceExecution()
    callHelper(_llint_helper_jmp_scopes)
    dispatch(0)


macro jumpTrueOrFalse(conditionOp, slow)
    loadi 4[PC], t1
    loadConstantOrVariablePayload(t1, BooleanTag, t0, .slow)
    conditionOp(t0, .target)
    dispatch(3)

.target:
    dispatchBranch(8[PC])

.slow:
    callHelper(slow)
    dispatch(0)
end

_llint_op_loop_if_true:
    nop
_llint_op_jtrue:
    traceExecution()
    jumpTrueOrFalse(
        macro (value, target) btinz value, target end,
        _llint_helper_jtrue)


_llint_op_loop_if_false:
    nop
_llint_op_jfalse:
    traceExecution()
    jumpTrueOrFalse(
        macro (value, target) btiz value, target end,
        _llint_helper_jfalse)


macro equalNull(cellHandler, immediateHandler)
    loadi 4[PC], t0
    loadi TagOffset[cfr, t0, 8], t1
    loadi PayloadOffset[cfr, t0, 8], t0
    bineq t1, CellTag, .immediate
    loadp JSCell::m_structure[t0], t2
    cellHandler(Structure::m_typeInfo + TypeInfo::m_flags[t2], .target)
    dispatch(3)

.target:
    dispatchBranch(8[PC])

.immediate:
    ori 1, t1
    immediateHandler(t1, .target)
    dispatch(3)
end

_llint_op_jeq_null:
    traceExecution()
    equalNull(
        macro (value, target) btbnz value, MasqueradesAsUndefined, target end,
        macro (value, target) bieq value, NullTag, target end)
    

_llint_op_jneq_null:
    traceExecution()
    equalNull(
        macro (value, target) btbz value, MasqueradesAsUndefined, target end,
        macro (value, target) bineq value, NullTag, target end)


_llint_op_jneq_ptr:
    traceExecution()
    loadi 4[PC], t0
    loadi 8[PC], t1
    bineq TagOffset[cfr, t0, 8], CellTag, .opJneqPtrBranch
    bpeq PayloadOffset[cfr, t0, 8], t1, .opJneqPtrFallThrough
.opJneqPtrBranch:
    dispatchBranch(12[PC])
.opJneqPtrFallThrough:
    dispatch(4)


macro compare(integerCompare, doubleCompare, helper)
    loadi 4[PC], t2
    loadi 8[PC], t3
    loadConstantOrVariable(t2, t0, t1)
    loadConstantOrVariable2Reg(t3, t2, t3)
    bineq t0, Int32Tag, .op1NotInt
    bineq t2, Int32Tag, .op2NotInt
    integerCompare(t1, t3, .jumpTarget)
    dispatch(4)

.op1NotInt:
    bia t0, LowestTag, .slow
    bib t2, LowestTag, .op1NotIntOp2Double
    bineq t2, Int32Tag, .slow
    ci2d t3, ft1
    jmp .op1NotIntReady
.op1NotIntOp2Double:
    fii2d t3, t2, ft1
.op1NotIntReady:
    fii2d t1, t0, ft0
    doubleCompare(ft0, ft1, .jumpTarget)
    dispatch(4)

.op2NotInt:
    ci2d t1, ft0
    bia t2, LowestTag, .slow
    fii2d t3, t2, ft1
    doubleCompare(ft0, ft1, .jumpTarget)
    dispatch(4)

.jumpTarget:
    dispatchBranch(12[PC])

.slow:
    callHelper(helper)
    dispatch(0)
end

_llint_op_loop_if_less:
    nop
_llint_op_jless:
    traceExecution()
    compare(
        macro (left, right, target) bilt left, right, target end,
        macro (left, right, target) bdlt left, right, target end,
        _llint_helper_jless)


_llint_op_jnless:
    traceExecution()
    compare(
        macro (left, right, target) bigteq left, right, target end,
        macro (left, right, target) bdgtequn left, right, target end,
        _llint_helper_jnless)


_llint_op_loop_if_greater:
    nop
_llint_op_jgreater:
    traceExecution()
    compare(
        macro (left, right, target) bigt left, right, target end,
        macro (left, right, target) bdgt left, right, target end,
        _llint_helper_jgreater)


_llint_op_jngreater:
    traceExecution()
    compare(
        macro (left, right, target) bilteq left, right, target end,
        macro (left, right, target) bdltequn left, right, target end,
        _llint_helper_jngreater)


_llint_op_loop_if_lesseq:
    nop
_llint_op_jlesseq:
    traceExecution()
    compare(
        macro (left, right, target) bilteq left, right, target end,
        macro (left, right, target) bdlteq left, right, target end,
        _llint_helper_jlesseq)


_llint_op_jnlesseq:
    traceExecution()
    compare(
        macro (left, right, target) bigt left, right, target end,
        macro (left, right, target) bdgtun left, right, target end,
        _llint_helper_jnlesseq)


_llint_op_loop_if_greatereq:
    nop
_llint_op_jgreatereq:
    traceExecution()
    compare(
        macro (left, right, target) bigteq left, right, target end,
        macro (left, right, target) bdgteq left, right, target end,
        _llint_helper_jgreatereq)


_llint_op_jngreatereq:
    traceExecution()
    compare(
        macro (left, right, target) bilt left, right, target end,
        macro (left, right, target) bdltun left, right, target end,
        _llint_helper_jngreatereq)


_llint_op_loop_hint:
    traceExecution()
    checkSwitchToJITForLoop()
    dispatch(1)


_llint_op_switch_imm:
    traceExecution()
    loadi 12[PC], t2
    loadi 4[PC], t3
    loadConstantOrVariable(t2, t1, t0)
    loadp CodeBlock[cfr], t2
    loadp CodeBlock::m_rareData[t2], t2
    muli sizeof SimpleJumpTable, t3   # FIXME: would be nice to peephole this!
    loadp CodeBlock::RareData::m_immediateSwitchJumpTables + VectorBufferOffset[t2], t2
    addp t3, t2
    bineq t1, Int32Tag, .opSwitchImmNotInt
    subi SimpleJumpTable::min[t2], t0
    biaeq t0, SimpleJumpTable::branchOffsets + VectorSizeOffset[t2], .opSwitchImmFallThrough
    loadp SimpleJumpTable::branchOffsets + VectorBufferOffset[t2], t3
    loadi [t3, t0, 4], t1
    btiz t1, .opSwitchImmFallThrough
    dispatchBranchWithOffset(t1)

.opSwitchImmNotInt:
    bib t1, LowestTag, .opSwitchImmSlow  # Go to slow path if it's a double.
.opSwitchImmFallThrough:
    dispatchBranch(8[PC])

.opSwitchImmSlow:
    callHelper(_llint_helper_switch_imm)
    dispatch(0)


_llint_op_switch_char:
    traceExecution()
    loadi 12[PC], t2
    loadi 4[PC], t3
    loadConstantOrVariable(t2, t1, t0)
    loadp CodeBlock[cfr], t2
    loadp CodeBlock::m_rareData[t2], t2
    muli sizeof SimpleJumpTable, t3
    loadp CodeBlock::RareData::m_characterSwitchJumpTables + VectorBufferOffset[t2], t2
    addp t3, t2
    bineq t1, CellTag, .opSwitchCharFallThrough
    loadp JSCell::m_structure[t0], t1
    bbneq Structure::m_typeInfo + TypeInfo::m_type[t1], StringType, .opSwitchCharFallThrough
    loadp JSString::m_value[t0], t0
    bineq StringImpl::m_length[t0], 1, .opSwitchCharFallThrough
    loadp StringImpl::m_data8[t0], t1
    btinz StringImpl::m_hashAndFlags[t0], HashFlags8BitBuffer, .opSwitchChar8Bit
    loadh [t1], t0
    jmp .opSwitchCharReady
.opSwitchChar8Bit:
    loadb [t1], t0
.opSwitchCharReady:
    subi SimpleJumpTable::min[t2], t0
    biaeq t0, SimpleJumpTable::branchOffsets + VectorSizeOffset[t2], .opSwitchCharFallThrough
    loadp SimpleJumpTable::branchOffsets + VectorBufferOffset[t2], t2
    loadi [t2, t0, 4], t1
    btiz t1, .opSwitchImmFallThrough
    dispatchBranchWithOffset(t1)

.opSwitchCharFallThrough:
    dispatchBranch(8[PC])


_llint_op_switch_string:
    traceExecution()
    callHelper(_llint_helper_switch_string)
    dispatch(0)


_llint_op_new_func:
    traceExecution()
    btiz 12[PC], .opNewFuncUnchecked
    loadi 4[PC], t1
    bineq TagOffset[cfr, t1, 8], EmptyValueTag, .opNewFuncDone
.opNewFuncUnchecked:
    callHelper(_llint_helper_new_func)
.opNewFuncDone:
    dispatch(4)


_llint_op_new_func_exp:
    traceExecution()
    callHelper(_llint_helper_new_func_exp)
    dispatch(3)


macro doCall(helper)
    loadi 4[PC], t0
    loadi 16[PC], t1
    loadp LLIntCallLinkInfo::callee[t1], t2
    loadConstantOrVariablePayload(t0, CellTag, t3, .opCallSlow)
    bineq t3, t2, .opCallSlow
    loadi 12[PC], t3
    addp 24, PC
    lshifti 3, t3
    addp cfr, t3  # t3 contains the new value of cfr
    loadp JSFunction::m_scopeChain[t2], t0
    storei t2, Callee + PayloadOffset[t3]
    storei t0, ScopeChain + PayloadOffset[t3]
    loadi 8 - 24[PC], t2
    storei PC, ArgumentCount + TagOffset[cfr]
    storep cfr, CallerFrame[t3]
    storei t2, ArgumentCount + PayloadOffset[t3]
    storei CellTag, Callee + TagOffset[t3]
    storei CellTag, ScopeChain + TagOffset[t3]
    move t3, cfr
    call LLIntCallLinkInfo::machineCodeTarget[t1]
    dispatchAfterCall()

.opCallSlow:
    slowPathForCall(6, helper)
end

_llint_op_call:
    traceExecution()
    doCall(_llint_helper_call)


_llint_op_construct:
    traceExecution()
    doCall(_llint_helper_construct)


_llint_op_call_varargs:
    traceExecution()
    slowPathForCall(6, _llint_helper_call_varargs)


_llint_op_call_eval:
    traceExecution()
    
    # Eval is executed in one of two modes:
    #
    # 1) We find that we're really invoking eval() in which case the
    #    execution is perfomed entirely inside the helper, and it
    #    returns the PC of a function that just returns the return value
    #    that the eval returned.
    #
    # 2) We find that we're invoking something called eval() that is not
    #    the real eval. Then the helper returns the PC of the thing to
    #    call, and we call it.
    #
    # This allows us to handle two cases, which would require a total of
    # up to four pieces of state that cannot be easily packed into two
    # registers (C functions can return up to two registers, easily):
    #
    # - The call frame register. This may or may not have been modified
    #   by the helper, but the convention is that it returns it. It's not
    #   totally clear if that's necessary, since the cfr is callee save.
    #   But that's our style in this here interpreter so we stick with it.
    #
    # - A bit to say if the helper successfully executed the eval and has
    #   the return value, or did not execute the eval but has a PC for us
    #   to call.
    #
    # - Either:
    #   - The JS return value (two registers), or
    #
    #   - The PC to call.
    #
    # It turns out to be easier to just always have this return the cfr
    # and a PC to call, and that PC may be a dummy thunk that just
    # returns the JS value that the eval returned.
    
    slowPathForCall(4, _llint_helper_call_eval)


_llint_generic_return_point:
    dispatchAfterCall()


_llint_op_tear_off_activation:
    traceExecution()
    loadi 4[PC], t0
    loadi 8[PC], t1
    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opTearOffActivationCreated
    bieq TagOffset[cfr, t1, 8], EmptyValueTag, .opTearOffActivationNotCreated
.opTearOffActivationCreated:
    callHelper(_llint_helper_tear_off_activation)
.opTearOffActivationNotCreated:
    dispatch(3)


_llint_op_tear_off_arguments:
    traceExecution()
    loadi 4[PC], t0
    subi 1, t0   # Get the unmodifiedArgumentsRegister
    bieq TagOffset[cfr, t0, 8], EmptyValueTag, .opTearOffArgumentsNotCreated
    callHelper(_llint_helper_tear_off_arguments)
.opTearOffArgumentsNotCreated:
    dispatch(2)


macro doReturn()
    loadp ReturnPC[cfr], t2
    loadp CallerFrame[cfr], cfr
    restoreReturnAddressBeforeReturn(t2)
    ret
end

_llint_op_ret:
    traceExecution()
    checkSwitchToJITForEpilogue()
    loadi 4[PC], t2
    loadConstantOrVariable(t2, t1, t0)
    doReturn()


_llint_op_call_put_result:
    loadi 4[PC], t2
    loadi 8[PC], t3
    storei t1, TagOffset[cfr, t2, 8]
    storei t0, PayloadOffset[cfr, t2, 8]
    valueProfile(t1, t0, t3)
    traceExecution() # Needs to be here because it would clobber t1, t0
    dispatch(3)


_llint_op_ret_object_or_this:
    traceExecution()
    checkSwitchToJITForEpilogue()
    loadi 4[PC], t2
    loadConstantOrVariable(t2, t1, t0)
    bineq t1, CellTag, .opRetObjectOrThisNotObject
    loadp JSCell::m_structure[t0], t2
    bbb Structure::m_typeInfo + TypeInfo::m_type[t2], ObjectType, .opRetObjectOrThisNotObject
    doReturn()

.opRetObjectOrThisNotObject:
    loadi 8[PC], t2
    loadConstantOrVariable(t2, t1, t0)
    doReturn()


_llint_op_method_check:
    traceExecution()
    # We ignore method checks and use normal get_by_id optimizations.
    dispatch(1)


_llint_op_strcat:
    traceExecution()
    callHelper(_llint_helper_strcat)
    dispatch(4)


_llint_op_to_primitive:
    traceExecution()
    loadi 8[PC], t2
    loadi 4[PC], t3
    loadConstantOrVariable(t2, t1, t0)
    bineq t1, CellTag, .opToPrimitiveIsImm
    loadp JSCell::m_structure[t0], t2
    bbneq Structure::m_typeInfo + TypeInfo::m_type[t2], StringType, .opToPrimitiveSlowCase
.opToPrimitiveIsImm:
    storei t1, TagOffset[cfr, t3, 8]
    storei t0, PayloadOffset[cfr, t3, 8]
    dispatch(3)

.opToPrimitiveSlowCase:
    callHelper(_llint_helper_to_primitive)
    dispatch(3)


_llint_op_get_pnames:
    traceExecution()
    callHelper(_llint_helper_get_pnames)
    dispatch(0) # The helper either advances the PC or jumps us to somewhere else.


_llint_op_next_pname:
    traceExecution()
    loadi 12[PC], t1
    loadi 16[PC], t2
    loadi PayloadOffset[cfr, t1, 8], t0
    bieq t0, PayloadOffset[cfr, t2, 8], .opNextPnameEnd
    loadi 20[PC], t2
    loadi PayloadOffset[cfr, t2, 8], t2
    loadp JSPropertyNameIterator::m_jsStrings[t2], t3
    loadi [t3, t0, 8], t3
    addi 1, t0
    storei t0, PayloadOffset[cfr, t1, 8]
    loadi 4[PC], t1
    storei CellTag, TagOffset[cfr, t1, 8]
    storei t3, PayloadOffset[cfr, t1, 8]
    loadi 8[PC], t3
    loadi PayloadOffset[cfr, t3, 8], t3
    loadp JSCell::m_structure[t3], t1
    bpneq t1, JSPropertyNameIterator::m_cachedStructure[t2], .opNextPnameSlow
    loadp JSPropertyNameIterator::m_cachedPrototypeChain[t2], t0
    loadp StructureChain::m_vector[t0], t0
    btpz [t0], .opNextPnameTarget
.opNextPnameCheckPrototypeLoop:
    bieq Structure::m_prototype + TagOffset[t1], NullTag, .opNextPnameSlow
    loadp Structure::m_prototype + PayloadOffset[t1], t2
    loadp JSCell::m_structure[t2], t1
    bpneq t1, [t0], .opNextPnameSlow
    addp 4, t0
    btpnz [t0], .opNextPnameCheckPrototypeLoop
.opNextPnameTarget:
    dispatchBranch(24[PC])

.opNextPnameEnd:
    dispatch(7)

.opNextPnameSlow:
    callHelper(_llint_helper_next_pname) # This either keeps the PC where it was (causing us to loop) or sets it to target.
    dispatch(0)


_llint_op_push_scope:
    traceExecution()
    callHelper(_llint_helper_push_scope)
    dispatch(2)


_llint_op_pop_scope:
    traceExecution()
    callHelper(_llint_helper_pop_scope)
    dispatch(1)


_llint_op_push_new_scope:
    traceExecution()
    callHelper(_llint_helper_push_new_scope)
    dispatch(4)


_llint_op_catch:
    # This is where we end up from the JIT's throw trampoline (because the
    # machine code return address will be set to _llint_op_catch), and from
    # the interpreter's throw trampoline (see _llint_throw_trampoline).
    # The JIT throwing protocol calls for the cfr to be in t0. The throwing
    # code must have known that we were throwing to the interpreter, and have
    # set JSGlobalData::targetInterpreterPCForThrow.
    move t0, cfr
    loadp JITStackFrame::globalData[sp], t3
    loadi JSGlobalData::targetInterpreterPCForThrow[t3], PC
    loadi JSGlobalData::exception + PayloadOffset[t3], t0
    loadi JSGlobalData::exception + TagOffset[t3], t1
    storei 0, JSGlobalData::exception + PayloadOffset[t3]
    storei EmptyValueTag, JSGlobalData::exception + TagOffset[t3]       
    loadi 4[PC], t2
    storei t0, PayloadOffset[cfr, t2, 8]
    storei t1, TagOffset[cfr, t2, 8]
    traceExecution()  # This needs to be here because we don't want to clobber t0, t1, t2, t3 above.
    dispatch(2)


_llint_op_throw:
    traceExecution()
    callHelper(_llint_helper_throw)
    dispatch(2)


_llint_op_throw_reference_error:
    traceExecution()
    callHelper(_llint_helper_throw_reference_error)
    dispatch(2)


_llint_op_jsr:
    traceExecution()
    loadi 4[PC], t0
    addi 3 * 4, PC, t1
    storei t1, [cfr, t0, 8]
    dispatchBranch(8[PC])


_llint_op_sret:
    traceExecution()
    loadi 4[PC], t0
    loadp [cfr, t0, 8], PC
    dispatch(0)


_llint_op_debug:
    traceExecution()
    callHelper(_llint_helper_debug)
    dispatch(4)


_llint_op_profile_will_call:
    traceExecution()
    loadp JITStackFrame::enabledProfilerReference[sp], t0
    btpz [t0], .opProfileWillCallDone
    callHelper(_llint_helper_profile_will_call)
.opProfileWillCallDone:
    dispatch(2)


_llint_op_profile_did_call:
    traceExecution()
    loadp JITStackFrame::enabledProfilerReference[sp], t0
    btpz [t0], .opProfileWillCallDone
    callHelper(_llint_helper_profile_did_call)
.opProfileDidCallDone:
    dispatch(2)


_llint_op_end:
    traceExecution()
    checkSwitchToJITForEpilogue()
    loadi 4[PC], t0
    loadi TagOffset[cfr, t0, 8], t1
    loadi PayloadOffset[cfr, t0, 8], t0
    doReturn()


_llint_throw_from_helper_trampoline:
    # When throwing from the interpreter (i.e. throwing from LLIntHelpers), so
    # the throw target is not necessarily interpreted code, we come to here.
    # This essentially emulates the JIT's throwing protocol.
    loadp JITStackFrame::globalData[sp], t1
    loadp JSGlobalData::callFrameForThrow[t1], t0
    jmp JSGlobalData::targetMachinePCForThrow[t1]


_llint_throw_during_call_trampoline:
    preserveReturnAddressAfterCall(t2)
    loadp JITStackFrame::globalData[sp], t1
    loadp JSGlobalData::callFrameForThrow[t1], t0
    jmp JSGlobalData::targetMachinePCForThrow[t1]


# Lastly, make sure that we can link even though we don't support all opcodes.
# These opcodes should never arise when using LLInt or either JIT. We assert
# as much.

macro notSupported()
    if ASSERT_ENABLED
        crash()
    else
        # We should use whatever the smallest possible instruction is, just to
        # ensure that there is a gap between instruction labels. If multiple
        # smallest instructions exist, we should pick the one that is most
        # likely result in execution being halted. Currently that is the break
        # instruction on all architectures we're interested in. (Break is int3
        # on Intel, which is 1 byte, and bkpt on ARMv7, which is 2 bytes.)
        break
    end
end

_llint_op_get_array_length:
    notSupported()

_llint_op_get_by_id_chain:
    notSupported()

_llint_op_get_by_id_custom_chain:
    notSupported()

_llint_op_get_by_id_custom_proto:
    notSupported()

_llint_op_get_by_id_custom_self:
    notSupported()

_llint_op_get_by_id_generic:
    notSupported()

_llint_op_get_by_id_getter_chain:
    notSupported()

_llint_op_get_by_id_getter_proto:
    notSupported()

_llint_op_get_by_id_getter_self:
    notSupported()

_llint_op_get_by_id_proto:
    notSupported()

_llint_op_get_by_id_self:
    notSupported()

_llint_op_get_string_length:
    notSupported()

_llint_op_put_by_id_generic:
    notSupported()

_llint_op_put_by_id_replace:
    notSupported()

_llint_op_put_by_id_transition:
    notSupported()


# Indicate the end of LLInt.
_llint_end:
    crash()




/*
 * Copyright (C) 2012 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. 
 */

#include "config.h"
#include "LowLevelInterpreter.h"

#if ENABLE(LLINT)

#include "LLIntOfflineAsmConfig.h"

#include "LLIntAssembly.h"

#endif // ENABLE(LLINT)



/*
 * Copyright (C) 2012 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 LowLevelInterpreter_h
#define LowLevelInterpreter_h

#include <wtf/Platform.h>

#if ENABLE(LLINT)

#include "Opcode.h"

#define LLINT_INSTRUCTION_DECL(opcode, length) extern "C" void llint_##opcode();
    FOR_EACH_OPCODE_ID(LLINT_INSTRUCTION_DECL);
#undef LLINT_INSTRUCTION_DECL

extern "C" void llint_begin();
extern "C" void llint_end();
extern "C" void llint_program_prologue();
extern "C" void llint_eval_prologue();
extern "C" void llint_function_for_call_prologue();
extern "C" void llint_function_for_construct_prologue();
extern "C" void llint_function_for_call_arity_check();
extern "C" void llint_function_for_construct_arity_check();
extern "C" void llint_generic_return_point();
extern "C" void llint_throw_from_helper_trampoline();
extern "C" void llint_throw_during_call_trampoline();

#endif // ENABLE(LLINT)

#endif // LowLevelInterpreter_h



# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

class SpecialRegister
  def initialize(name)
    @name = name
  end
  
  def armV7Operand
    @name
  end
end

ARMv7_DATA_REG = SpecialRegister.new("ip")
ARMv7_ADDR_REG = SpecialRegister.new("r3")

def moveImmediate(value, register)
  # Currently we only handle the simple cases, and fall back to mov/movt for the complex ones.
  if value >= 0 && value < 256
    $asm.puts "movw \##{value}, #{register.armV7Operand}"
  elsif (~value) >= 0 && (~value) < 256
    $asm.puts "mvnw \##{~value}, #{register.armV7Operand}"
  else
    $asm.puts "movw \##{value & 0xffff}, #{register.armV7Operand}"
    if (value & 0xffff0000) != 0
      $asm.puts "movt \##{value >> 16}, #{register.armV7Operand}"
    end
  end
end

class RegisterID
  def armV7Operand
    case name
    when "t0", "a0", "r0"
      "r0"
    when "t1", "a1", "r1"
      "r1"
    when "t2", "a2"
      "r2"
    when "a3"
      "r3"
    when "t3"
      "r4"
    when "t4"
      "r7"
    when "cfr"
      "r5"
    else
      raise
    end
  end
  
  def armV7PreparePossibleMemoryOperand
  end
  
  def armV7PossibleMemoryOperand
    armV7Operand
  end
  
  def armV7LoadStoreWrap
    yield
  end
end

class FPRegisterID
  def armV7Operand
    case name
    when "ft0", "fr"
      "d0"
    when "fr1",
      "d1"
    when "fr2"
      "d2"
    when "fr3"
      "d3"
    when "fr4"
      "d4"
    when "fr5"
      "d5"
    else
      raise
    end
  end
  
  def armV7PreparePossibleMemoryOperand
  end
  
  def armV7PossibleMemoryOperand
    armV7Operand
  end
  
  def armV7LoadStoreWrap
    yield self
  end
end

class Immediate
  def armV7Operand
    raise "Invalid immediate #{value}" if value < 0 or value > 255
    "#${value}"
  end
  
  def armV7PreparePossibleMemoryOperand
  end
  
  def armV7PossibleMemoryOperand
    armV7Operand
  end
  
  def armV7LoadStoreWrap
    yield self
  end
end

module ARMv7AddressUtilities
  def armV7LoadStoreWrap
    self.armV7PreparePossibleMemoryOperand
    $asm.puts "\tldr #{self.armV7PossiblyMemoryOperand}, #{ARMv7_DATA_REG.armV7Operand}"
    yield ARMv7_DATA_REG
    $asm.puts "\tstr #{ARMv7_DATA_REG.armV7Operand}, #{self.armV7PossiblyMemoryOperand}"
  end
end

class Address
  include ARMv7AddressUtilities

  def armV7PreparePossibleMemoryOperand
    if offset.value < -0xff || offset.value > 0xfff
      moveImmediate(offset.value, ARMv7_ADDR_REG)
    end
  end
  
  def armV7PossibleMemoryOperand
    if offset.value < -0xff || offset.value > 0xfff
      "[#{base.armV7Operand}, #{ARMv7_ADDR_REG.armV7Operand}]"
    else
      "[#{base.armV7Operand}, #{offset.armV7Operand}]"
    end
  end
end

class BaseIndex
  include ARMv7AddressUtilities

  def armV7PreparePossibleMemoryOperand
    if offset.value != 0
      moveImmediate(offset.value, ARMv7_ADDR_REG)
      $asm.puts "addw #{ARMv7_ADDR_REG.armV7Operand}, #{base.armV7Operand}"
    end
  end
  
  def armV7PossibleMemoryOperand
    if offset.value != 0
      "[#{ARMv7_ADDR_REG.armV7Operand}, #{index.armV7Operand}, lsl \##{scale}]"
    else
      "[#{base.armV7Operand}, #{index.armV7Operand}, lsl \##{scale}]"
    end
  end
end

class AbsoluteAddress
  include ARMv7AddressUtilities
  
  def armV7PreparePossibleMemoryOperand
    moveImmediate(address.value, ARMv7_ADDR_REG)
  end
  
  def armV7PossibleMemoryOperand
    "[#{ARMv7_ADDR_REG.armV7Operand}]"
  end
end





#!/usr/bin/env ruby

# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

$: << File.dirname(__FILE__)

require "backends"
require "digest/sha1"
require "offsets"
require "parser"
require "settings"
require "transform"

class Assembler
  def initialize(outp)
    @outp = outp
    @state = :cpp
  end
  
  def enterAsm
    @outp.puts "asm ("
    @state = :asm
  end
  
  def leaveAsm
    @outp.puts ");"
    @state = :cpp
  end
  
  def inAsm
    enterAsm
    yield
    leaveAsm
  end
  
  def puts(line)
    raise unless @state == :asm
    @outp.puts((line + "\n").inspect)
  end
  
  def comment(text)
    @outp.puts "// #{text}"
  end
end

asmFile = ARGV.shift
offsetsFile = ARGV.shift
outputFlnm = ARGV.shift

offsetsList, configIndex = offsetsAndConfigurationIndex(offsetsFile)
inputData = IO::read(asmFile)

inputHash =
  "// offlineasm input hash: " + Digest::SHA1.hexdigest(inputData) +
  " " + Digest::SHA1.hexdigest((offsetsList + [configIndex]).join(' '))

if FileTest.exist? outputFlnm
  File.open(outputFlnm, "r") {
    | inp |
    firstLine = inp.gets
    if firstLine and firstLine.chomp == inputHash
      $stderr.puts "Nothing changed."
      exit 0
    end
  }
end

File.open(outputFlnm, "w") {
  | outp |
  $output = outp
  $output.puts inputHash
  
  $asm = Assembler.new($output)
  
  ast = parse(lex(inputData))
  
  forSettings(computeSettingsCombinations(ast)[configIndex], ast) {
    | concreteSettings, lowLevelAST, backend |
    assertConfiguration(concreteSettings)
    lowLevelAST = lowLevelAST.resolve(*buildOffsetsMap(lowLevelAST, offsetsList))
    emitCodeInConfiguration(concreteSettings, lowLevelAST, backend) {
      $asm.inAsm {
        lowLevelAST.lower(backend)
      }
    }
  }
}



# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

#
# Base utility types for the AST.
#

# Valid methods for Node:
#
# node.children -> Returns an array of immediate children.
#
# node.descendents -> Returns an array of all strict descendants (children
#     and children of children, transitively).
#
# node.flatten -> Returns an array containing the strict descendants and
#     the node itself.
#
# node.filter(type) -> Returns an array containing those elements in
#     node.flatten that are of the given type (is_a? type returns true).
#
# node.mapChildren{|v| ...} -> Returns a new node with all children
#     replaced according to the given block.
#
# Examples:
#
# node.filter(Setting).uniq -> Returns all of the settings that the AST's
#     IfThenElse blocks depend on.
#
# node.filter(StructOffset).uniq -> Returns all of the structure offsets
#     that the AST depends on.

class Node
  attr_reader :codeOrigin
  
  def initialize(codeOrigin)
    @codeOrigin = codeOrigin
  end
  
  def codeOriginString
    "line number #{@codeOrigin}"
  end
  
  def descendants
    children.collect{|v| v.flatten}.flatten
  end
  
  def flatten
    [self] + descendants
  end
  
  def filter(type)
    flatten.select{|v| v.is_a? type}
  end
end

class NoChildren < Node
  def initialize(codeOrigin)
    super(codeOrigin)
  end
  
  def children
    []
  end
  
  def mapChildren
    self
  end
end

class StructOffsetKey
  attr_reader :struct, :field
  
  def initialize(struct, field)
    @struct = struct
    @field = field
  end
  
  def hash
    @struct.hash + @field.hash * 3
  end
  
  def eql?(other)
    @struct == other.struct and @field == other.field
  end
end
    
#
# AST nodes.
#

class StructOffset < NoChildren
  attr_reader :struct, :field
  
  def initialize(codeOrigin, struct, field)
    super(codeOrigin)
    @struct = struct
    @field = field
  end
  
  @@mapping = {}
  
  def self.forField(codeOrigin, struct, field)
    key = StructOffsetKey.new(struct, field)
    
    unless @@mapping[key]
      @@mapping[key] = StructOffset.new(codeOrigin, struct, field)
    end
    @@mapping[key]
  end
  
  def dump
    "#{struct}::#{field}"
  end
  
  def <=>(other)
    if @struct != other.struct
      return @struct <=> other.struct
    end
    @field <=> other.field
  end
end

class Sizeof < NoChildren
  attr_reader :struct
  
  def initialize(codeOrigin, struct)
    super(codeOrigin)
    @struct = struct
  end
  
  @@mapping = {}
  
  def self.forName(codeOrigin, struct)
    unless @@mapping[struct]
      @@mapping[struct] = Sizeof.new(codeOrigin, struct)
    end
    @@mapping[struct]
  end
  
  def dump
    "sizeof #{@struct}"
  end
  
  def <=>(other)
    @struct <=> other.struct
  end
end

class Immediate < NoChildren
  attr_reader :value
  
  def initialize(codeOrigin, value)
    super(codeOrigin)
    @value = value
  end
  
  def dump
    "#{value}"
  end
  
  def ==(other)
    other.is_a? Immediate and other.value == @value
  end
end

class AddImmediates < Node
  attr_reader :left, :right
  
  def initialize(codeOrigin, left, right)
    super(codeOrigin)
    @left = left
    @right = right
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    AddImmediates.new(codeOrigin, (yield @left), (yield @right))
  end
  
  def dump
    "(#{left.dump} + #{right.dump})"
  end
end

class SubImmediates < Node
  attr_reader :left, :right
  
  def initialize(codeOrigin, left, right)
    super(codeOrigin)
    @left = left
    @right = right
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    SubImmediates.new(codeOrigin, (yield @left), (yield @right))
  end
  
  def dump
    "(#{left.dump} - #{right.dump})"
  end
end

class MulImmediates < Node
  attr_reader :left, :right
  
  def initialize(codeOrigin, left, right)
    super(codeOrigin)
    @left = left
    @right = right
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    MulImmediates.new(codeOrigin, (yield @left), (yield @right))
  end
  
  def dump
    "(#{left.dump} * #{right.dump})"
  end
end

class NegImmediate < Node
  attr_reader :child
  
  def initialize(codeOrigin, child)
    super(codeOrigin)
    @child = child
  end
  
  def children
    [@child]
  end
  
  def mapChildren
    NegImmediate.new(codeOrigin, (yield @child))
  end
  
  def dump
    "(-#{@child.dump})"
  end
end

class RegisterID < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end
  
  @@mapping = {}
  
  def self.forName(codeOrigin, name)
    unless @@mapping[name]
      @@mapping[name] = RegisterID.new(codeOrigin, name)
    end
    @@mapping[name]
  end
  
  def dump
    name
  end
end

class FPRegisterID < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end
  
  @@mapping = {}
  
  def self.forName(codeOrigin, name)
    unless @@mapping[name]
      @@mapping[name] = FPRegisterID.new(codeOrigin, name)
    end
    @@mapping[name]
  end
  
  def dump
    name
  end
end

class Variable < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end
  
  @@mapping = {}
  
  def self.forName(codeOrigin, name)
    unless @@mapping[name]
      @@mapping[name] = Variable.new(codeOrigin, name)
    end
    @@mapping[name]
  end
  
  def dump
    name
  end
end

class Address < Node
  attr_reader :base, :offset
  
  def initialize(codeOrigin, base, offset)
    super(codeOrigin)
    @base = base
    @offset = offset
  end
  
  def children
    [@base, @offset]
  end
  
  def mapChildren
    Address.new(codeOrigin, (yield @base), (yield @offset))
  end
  
  def dump
    "#{offset.dump}[#{base.dump}]"
  end
end

class BaseIndex < Node
  attr_reader :base, :index, :scale, :offset
  
  def initialize(codeOrigin, base, index, scale, offset)
    super(codeOrigin)
    @base = base
    @index = index
    @scale = scale
    raise unless [1, 2, 4, 8].member? @scale
    @offset = offset
  end
  
  def children
    [@base, @index, @offset]
  end
  
  def mapChildren
    BaseIndex.new(codeOrigin, (yield @base), (yield @index), @scale, (yield @offset))
  end
  
  def dump
    "#{offset.dump}[#{base.dump}, #{index.dump}, #{scale}]"
  end
end

class AbsoluteAddress < NoChildren
  attr_reader :address
  
  def initialize(codeOrigin, address)
    super(codeOrigin)
    @address = address
  end
  
  def dump
    "#{address.dump}[]"
  end
end

class Instruction < Node
  attr_reader :opcode, :operands
  
  def initialize(codeOrigin, opcode, operands)
    super(codeOrigin)
    @opcode = opcode
    @operands = operands
  end
  
  def children
    operands
  end
  
  def mapChildren(&proc)
    Instruction.new(codeOrigin, @opcode, @operands.map(&proc))
  end
  
  def dump
    "\t" + opcode.to_s + " " + operands.collect{|v| v.dump}.join(", ")
  end
end

class Error < NoChildren
  def initialize(codeOrigin)
    super(codeOrigin)
  end
  
  def dump
    "\terror"
  end
end

class ConstDecl < Node
  attr_reader :variable, :value
  
  def initialize(codeOrigin, variable, value)
    super(codeOrigin)
    @variable = variable
    @value = value
  end
  
  def children
    [@variable, @value]
  end
  
  def mapChildren
    ConstDecl.new(codeOrigin, (yield @variable), (yield @value))
  end
  
  def dump
    "const #{@variable.dump} = #{@value.dump}"
  end
end

$labelMapping = {}

class Label < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end
  
  def self.forName(codeOrigin, name)
    if $labelMapping[name]
      raise "Label name collision: #{name}" unless $labelMapping[name].is_a? Label
    else
      $labelMapping[name] = Label.new(codeOrigin, name)
    end
    $labelMapping[name]
  end
  
  def dump
    "#{name}:"
  end
end

class LocalLabel < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end

  @@uniqueNameCounter = 0
  
  def self.forName(codeOrigin, name)
    if $labelMapping[name]
      raise "Label name collision: #{name}" unless $labelMapping[name].is_a? LocalLabel
    else
      $labelMapping[name] = LocalLabel.new(codeOrigin, name)
    end
    $labelMapping[name]
  end
  
  def self.unique(comment)
    newName = "_#{comment}"
    if $labelMapping[newName]
      while $labelMapping[newName = "_#{@@uniqueNameCounter}_#{comment}"]
        @@uniqueNameCounter += 1
      end
    end
    forName(nil, newName)
  end
  
  def cleanName
    if name =~ /^\./
      "_" + name[1..-1]
    else
      name
    end
  end
  
  def dump
    "#{name}:"
  end
end

class LabelReference < Node
  attr_reader :label
  
  def initialize(codeOrigin, label)
    super(codeOrigin)
    @label = label
  end
  
  def children
    [@label]
  end
  
  def mapChildren
    LabelReference.new(codeOrigin, (yield @label))
  end
  
  def name
    label.name
  end
  
  def dump
    label.name
  end
end

class LocalLabelReference < NoChildren
  attr_reader :label
  
  def initialize(codeOrigin, label)
    super(codeOrigin)
    @label = label
  end
  
  def children
    [@label]
  end
  
  def mapChildren
    LocalLabelReference.new(codeOrigin, (yield @label))
  end
  
  def name
    label.name
  end
  
  def dump
    label.name
  end
end

class Sequence < Node
  attr_reader :list
  
  def initialize(codeOrigin, list)
    super(codeOrigin)
    @list = list
  end
  
  def children
    list
  end
  
  def mapChildren(&proc)
    Sequence.new(codeOrigin, @list.map(&proc))
  end
  
  def dump
    list.collect{|v| v.dump}.join("\n")
  end
end

class True < NoChildren
  def initialize
    super(nil)
  end
  
  @@instance = True.new
  
  def self.instance
    @@instance
  end
  
  def value
    true
  end
  
  def dump
    "true"
  end
end

class False < NoChildren
  def initialize
    super(nil)
  end
  
  @@instance = False.new
  
  def self.instance
    @@instance
  end
  
  def value
    false
  end
  
  def dump
    "false"
  end
end

class TrueClass
  def asNode
    True.instance
  end
end

class FalseClass
  def asNode
    False.instance
  end
end

class Setting < NoChildren
  attr_reader :name
  
  def initialize(codeOrigin, name)
    super(codeOrigin)
    @name = name
  end
  
  @@mapping = {}
  
  def self.forName(codeOrigin, name)
    unless @@mapping[name]
      @@mapping[name] = Setting.new(codeOrigin, name)
    end
    @@mapping[name]
  end
  
  def dump
    name
  end
end

class And < Node
  attr_reader :left, :right
  
  def initialize(codeOrigin, left, right)
    super(codeOrigin)
    @left = left
    @right = right
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    And.new(codeOrigin, (yield @left), (yield @right))
  end
  
  def dump
    "(#{left.dump} and #{right.dump})"
  end
end

class Or < Node
  attr_reader :left, :right
  
  def initialize(codeOrigin, left, right)
    super(codeOrigin)
    @left = left
    @right = right
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    Or.new(codeOrigin, (yield @left), (yield @right))
  end
  
  def dump
    "(#{left.dump} or #{right.dump})"
  end
end

class Not < Node
  attr_reader :child
  
  def initialize(codeOrigin, child)
    super(codeOrigin)
    @child = child
  end
  
  def children
    [@left, @right]
  end
  
  def mapChildren
    Not.new(codeOrigin, (yield @child))
  end
  
  def dump
    "(not #{child.dump})"
  end
end

class Skip < NoChildren
  def initialize(codeOrigin)
    super(codeOrigin)
  end
  
  def dump
    "\tskip"
  end
end

class IfThenElse < Node
  attr_reader :predicate, :thenCase
  attr_accessor :elseCase
  
  def initialize(codeOrigin, predicate, thenCase)
    super(codeOrigin)
    @predicate = predicate
    @thenCase = thenCase
    @elseCase = Skip.new(codeOrigin)
  end
  
  def children
    if @elseCase
      [@predicate, @thenCase, @elseCase]
    else
      [@predicate, @thenCase]
    end
  end
  
  def mapChildren
    IfThenElse.new(codeOrigin, (yield @predicate), (yield @thenCase), (yield @elseCase))
  end
  
  def dump
    "if #{predicate.dump}\n" + thenCase.dump + "\nelse\n" + elseCase.dump + "\nend"
  end
end

class Macro < Node
  attr_reader :name, :variables, :body
  
  def initialize(codeOrigin, name, variables, body)
    super(codeOrigin)
    @name = name
    @variables = variables
    @body = body
  end
  
  def children
    @variables + [@body]
  end
  
  def mapChildren
    Macro.new(codeOrigin, @name, @variables.map{|v| yield v}, (yield @body))
  end
  
  def dump
    "macro #{name}(" + variables.collect{|v| v.dump}.join(", ") + ")\n" + body.dump + "\nend"
  end
end

class MacroCall < Node
  attr_reader :name, :operands
  
  def initialize(codeOrigin, name, operands)
    super(codeOrigin)
    @name = name
    @operands = operands
    raise unless @operands
    @operands.each{|v| raise unless v}
  end
  
  def children
    @operands
  end
  
  def mapChildren(&proc)
    MacroCall.new(codeOrigin, @name, @operands.map(&proc))
  end
  
  def dump
    "\t#{name}(" + operands.collect{|v| v.dump}.join(", ") + ")"
  end
end




# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

require "ast"
require "x86"

BACKENDS =
  [
   "X86",
   "ARMv7"
  ]

WORKING_BACKENDS =
  [
   "X86"
  ]

BACKEND_PATTERN = Regexp.new('\\A(' + BACKENDS.join(')|(') + ')\\Z')

class Node
  def lower(name)
    send("lower" + name)
  end
end

# Overrides for lower() for those nodes that are backend-agnostic

def sanitizeLabelName(name)
  # Some platforms don't want the leading "_". If we ever want to do something
  # about that, it would be here.
  name
end

class Label
  def lower(name)
    $asm.puts ".globl #{sanitizeLabelName(self.name)}"
    $asm.puts "#{sanitizeLabelName(self.name)}:"
  end
end

class LocalLabel
  def lower(name)
    $asm.puts "L_offlineasm_#{self.name[1..-1]}:"
  end
end

class Skip
  def lower(name)
  end
end

class Sequence
  def lower(name)
    @list.each {
      | node |
      node.lower(name)
    }
  end
end




#!/usr/bin/env ruby

# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

$: << File.dirname(__FILE__)

require "backends"
require "digest/sha1"
require "offsets"
require "parser"
require "settings"
require "transform"

inputFlnm = ARGV.shift
outputFlnm = ARGV.shift

def emitMagicNumber
  OFFSET_MAGIC_NUMBERS.each {
    | number |
    $output.puts "#{number},"
  }
end

inputData = IO::read(inputFlnm)
inputHash = Digest::SHA1.hexdigest(inputData)

if FileTest.exist? outputFlnm
  File.open(outputFlnm, "r") {
    | inp |
    firstLine = inp.gets
    if firstLine and firstLine.chomp == "// offlineasm input hash: #{inputHash}"
      $stderr.puts "Nothing changed."
      exit 0
    end
  }
end

originalAST = parse(lex(inputData))

File.open(outputFlnm, "w") {
  | outp |
  $output = outp
  outp.puts "// offlineasm input hash: #{inputHash}"
  emitCodeInAllConfigurations(originalAST) {
    | settings, ast, backend, index |
    offsetsList = ast.filter(StructOffset).uniq.sort
    sizesList = ast.filter(Sizeof).uniq.sort
    
    length = (OFFSET_MAGIC_NUMBERS.size + 1) * (1 + offsetsList.size + sizesList.size)
    
    outp.puts "static const unsigned extractorTable[#{length}] = {"
    emitMagicNumber
    outp.puts "#{index},"
    offsetsList.each {
      | offset |
      emitMagicNumber
      outp.puts "OFFLINE_ASM_OFFSETOF(#{offset.struct}, #{offset.field}),"
    }
    sizesList.each {
      | offset |
      emitMagicNumber
      outp.puts "sizeof(#{offset.struct}),"
    }
    outp.puts "};"
  }
}



# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

MACRO_INSTRUCTIONS =
  [
   "addi",
   "andi",
   "lshifti",
   "muli",
   "negi",
   "noti",
   "ori",
   "rshifti",
   "urshifti",
   "subi",
   "xori",
   "loadi",
   "loadb",
   "loadh",
   "storei",
   "storeb",
   "loadd",
   "moved",
   "stored",
   "addd",
   "divd",
   "subd",
   "muld",
   "sqrtd",
   "ci2d",
   "fii2d", # usage: fii2d <gpr with least significant bits>, <gpr with most significant bits>, <fpr>
   "fd2ii", # usage: fd2ii <fpr>, <gpr with least significant bits>, <gpr with most significant bits>
   "bdeq",
   "bdneq",
   "bdgt",
   "bdgteq",
   "bdlt",
   "bdlteq",
   "bdequn",
   "bdnequn",
   "bdgtun",
   "bdgtequn",
   "bdltun",
   "bdltequn",
   "btd2i",
   "td2i",
   "bcd2i",
   "movdz",
   "pop",
   "push",
   "move",
   "sxi2p",
   "zxi2p",
   "nop",
   "bieq",
   "bineq",
   "bia",
   "biaeq",
   "bib",
   "bibeq",
   "bigt",
   "bigteq",
   "bilt",
   "bilteq",
   "bbeq",
   "bbneq",
   "bba",
   "bbaeq",
   "bbb",
   "bbbeq",
   "bbgt",
   "bbgteq",
   "bblt",
   "bblteq",
   "btio",
   "btis",
   "btiz",
   "btinz",
   "btbo",
   "btbs",
   "btbz",
   "btbnz",
   "jmp",
   "baddio",
   "baddis",
   "baddiz",
   "baddinz",
   "bsubio",
   "bsubis",
   "bsubiz",
   "bsubinz",
   "bmulio",
   "bmulis",
   "bmuliz",
   "bmulinz",
   "borio",
   "boris",
   "boriz",
   "borinz",
   "break",
   "call",
   "ret",
   "cieq",
   "cineq",
   "cia",
   "ciaeq",
   "cib",
   "cibeq",
   "cigt",
   "cigteq",
   "cilt",
   "cilteq",
   "tio",
   "tis",
   "tiz",
   "tinz",
   "tbo",
   "tbs",
   "tbz",
   "tbnz",
   "peek",
   "poke",
   "bpeq",
   "bpneq",
   "bpa",
   "bpaeq",
   "bpb",
   "bpbeq",
   "bpgt",
   "bpgteq",
   "bplt",
   "bplteq",
   "addp",
   "andp",
   "orp",
   "subp",
   "xorp",
   "loadp",
   "cpeq",
   "cpneq",
   "cpa",
   "cpaeq",
   "cpb",
   "cpbeq",
   "cpgt",
   "cpgteq",
   "cplt",
   "cplteq",
   "storep",
   "btpo",
   "btps",
   "btpz",
   "btpnz",
   "baddpo",
   "baddps",
   "baddpz",
   "baddpnz"
  ]

X86_INSTRUCTIONS =
  [
   "cdqi",
   "idivi"
  ]

INSTRUCTIONS = MACRO_INSTRUCTIONS + X86_INSTRUCTIONS

INSTRUCTION_PATTERN = Regexp.new('\\A((' + INSTRUCTIONS.join(')|(') + '))\\Z')



# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

MAGIC_NUMBERS = [ 0xec577ac7, 0x0ff5e755 ]





# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

require "ast"
require "offset_extractor_constants"

OFFSET_MAGIC_NUMBERS = [ 0xec577ac7, 0x0ff5e755 ]

#
# offsetsList(ast)
# sizesList(ast)
#
# Returns a list of offsets and sizes used by the AST.
#

def offsetsList(ast)
  ast.filter(StructOffset).uniq.sort
end

def sizesList(ast)
  ast.filter(Sizeof).uniq.sort
end

#
# offsetsAndConfigurationIndex(ast, file) ->
#     [offsets, index]
#
# Parses the offsets from a file and returns a list of offsets and the
# index of the configuration that is valid in this build target.
#

def offsetsAndConfigurationIndex(file)
  index = nil
  offsets = []
  endiannessMarkerBytes = nil
  
  def readInt(endianness, inp)
    bytes = []
    4.times {
      bytes << inp.getbyte
    }
    
    if endianness == :little
      # Little endian
      (bytes[0] << 0 |
       bytes[1] << 8 |
       bytes[2] << 16 |
       bytes[3] << 24)
    else
      # Big endian
      (bytes[0] << 24 |
       bytes[1] << 16 |
       bytes[2] << 8 |
       bytes[3] << 0)
    end
  end
  
  [:little, :big].each {
    | endianness |
    magicBytes = []
    MAGIC_NUMBERS.each {
      | number |
      currentBytes = []
      4.times {
        currentBytes << (number & 0xff)
        number >>= 8
      }
      if endianness == :big
        currentBytes.reverse!
      end
      magicBytes += currentBytes
    }
    
    File.open(file, "r") {
      | inp |
      whereInMarker = 0
      loop {
        byte = inp.getbyte
        break unless byte
        if byte == magicBytes[whereInMarker]
          whereInMarker += 1
          if whereInMarker == magicBytes.size
            # We have a match! If we have not yet read the endianness marker and index,
            # then read those now; otherwise read an offset.
            
            if not index
              index = readInt(endianness, inp)
            else
              offsets << readInt(endianness, inp)
            end
            
            whereInMarker = 0
          end
        else
          whereInMarker = 0
        end
      }
    }
    
    break if index
  }
  
  raise unless index
  
  [offsets, index]
end

#
# buildOffsetsMap(ast, offsetsList) -> [offsets, sizes]
#
# Builds a mapping between StructOffset nodes and their values.
#

def buildOffsetsMap(ast, offsetsList)
  offsetsMap = {}
  sizesMap = {}
  astOffsetsList = offsetsList(ast)
  astSizesList = sizesList(ast)
  raise unless astOffsetsList.size + astSizesList.size == offsetsList.size
  offsetsList(ast).each_with_index {
    | structOffset, index |
    offsetsMap[structOffset] = offsetsList.shift
  }
  sizesList(ast).each_with_index {
    | sizeof, index |
    sizesMap[sizeof] = offsetsList.shift
  }
  [offsetsMap, sizesMap]
end




# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

require "ast"
require "instructions"
require "registers"

class Token
  attr_reader :codeOrigin, :string
  
  def initialize(codeOrigin, string)
    @codeOrigin = codeOrigin
    @string = string
  end
  
  def ==(other)
    if other.is_a? Token
      @string == other.string
    else
      @string == other
    end
  end
  
  def =~(other)
    @string =~ other
  end
  
  def to_s
    "#{@string.inspect} at line #{codeOrigin}"
  end
  
  def parseError(*comment)
    if comment.empty?
      raise "Parse error: #{to_s}"
    else
      raise "Parse error: #{to_s}: #{comment[0]}"
    end
  end
end

#
# The lexer. Takes a string and returns an array of tokens.
#

def lex(str)
  result = []
  lineNumber = 1
  while not str.empty?
    case str
    when /\A\#([^\n]*)/
      # comment, ignore
    when /\A\n/
      result << Token.new(lineNumber, $&)
      lineNumber += 1
    when /\A[a-zA-Z]([a-zA-Z0-9_]*)/
      result << Token.new(lineNumber, $&)
    when /\A\.([a-zA-Z0-9_]*)/
      result << Token.new(lineNumber, $&)
    when /\A_([a-zA-Z0-9_]*)/
      result << Token.new(lineNumber, $&)
    when /\A([ \t]+)/
      # whitespace, ignore
    when /\A0x([0-9a-fA-F]+)/
      result << Token.new(lineNumber, $&.hex.to_s)
    when /\A0([0-7]+)/
      result << Token.new(lineNumber, $&.oct.to_s)
    when /\A([0-9]+)/
      result << Token.new(lineNumber, $&)
    when /\A::/
      result << Token.new(lineNumber, $&)
    when /\A[:,\(\)\[\]=\+\-*]/
      result << Token.new(lineNumber, $&)
    else
      raise "Lexer error at line number #{lineNumber}, unexpected sequence #{str[0..20].inspect}"
    end
    str = $~.post_match
  end
  result
end

#
# Token identification.
#

def isRegister(token)
  token =~ REGISTER_PATTERN
end

def isInstruction(token)
  token =~ INSTRUCTION_PATTERN
end

def isKeyword(token)
  token =~ /\A((true)|(false)|(if)|(then)|(else)|(elsif)|(end)|(and)|(or)|(not)|(macro)|(const)|(sizeof)|(error))\Z/ or
    token =~ REGISTER_PATTERN or
    token =~ INSTRUCTION_PATTERN
end

def isIdentifier(token)
  token =~ /\A[a-zA-Z]([a-zA-Z0-9_]*)\Z/ and not isKeyword(token)
end

def isLabel(token)
  token =~ /\A_([a-zA-Z0-9_]*)\Z/
end

def isLocalLabel(token)
  token =~ /\A\.([a-zA-Z0-9_]*)\Z/
end

def isVariable(token)
  isIdentifier(token) or isRegister(token)
end

def isInteger(token)
  token =~ /\A[0-9]/
end

#
# The parser. Takes an array of tokens and returns an AST. Methods
# other than parse(tokens) are not for public consumption.
#

class Parser
  def initialize(tokens)
    @tokens = tokens
    @idx = 0
  end
  
  def parseError(*comment)
    if @tokens[@idx]
      @tokens[@idx].parseError(*comment)
    else
      if comment.empty?
        raise "Parse error at end of file"
      else
        raise "Parse error at end of file: #{comment[0]}"
      end
    end
  end
  
  def consume(regexp)
    if regexp
      parseError unless @tokens[@idx] =~ regexp
    else
      parseError unless @idx == @tokens.length
    end
    @idx += 1
  end
  
  def skipNewLine
    while @tokens[@idx] == "\n"
      @idx += 1
    end
  end
  
  def parsePredicateAtom
    if @tokens[@idx] == "not"
      @idx += 1
      parsePredicateAtom
    elsif @tokens[@idx] == "("
      @idx += 1
      skipNewLine
      result = parsePredicate
      parseError unless @tokens[@idx] == ")"
      @idx += 1
      result
    elsif @tokens[@idx] == "true"
      result = True.instance
      @idx += 1
      result
    elsif @tokens[@idx] == "false"
      result = False.instance
      @idx += 1
      result
    elsif isIdentifier @tokens[@idx]
      result = Setting.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
      @idx += 1
      result
    else
      parseError
    end
  end
  
  def parsePredicateAnd
    result = parsePredicateAtom
    while @tokens[@idx] == "and"
      codeOrigin = @tokens[@idx].codeOrigin
      @idx += 1
      skipNewLine
      right = parsePredicateAtom
      result = And.new(codeOrigin, result, right)
    end
    result
  end
  
  def parsePredicate
    # some examples of precedence:
    # not a and b -> (not a) and b
    # a and b or c -> (a and b) or c
    # a or b and c -> a or (b and c)
    
    result = parsePredicateAnd
    while @tokens[@idx] == "or"
      codeOrigin = @tokens[@idx].codeOrigin
      @idx += 1
      skipNewLine
      right = parsePredicateAnd
      result = Or.new(codeOrigin, result, right)
    end
    result
  end
  
  def parseVariable
    if isRegister(@tokens[@idx])
      if @tokens[@idx] =~ FPR_PATTERN
        result = FPRegisterID.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
      else
        result = RegisterID.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
      end
    elsif isIdentifier(@tokens[@idx])
      result = Variable.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
    else
      parseError
    end
    @idx += 1
    result
  end
  
  def parseAddress(offset)
    parseError unless @tokens[@idx] == "["
    codeOrigin = @tokens[@idx].codeOrigin
    
    # Three possibilities:
    # []       -> AbsoluteAddress
    # [a]      -> Address
    # [a,b]    -> BaseIndex with scale = 1
    # [a,b,c]  -> BaseIndex
    
    @idx += 1
    if @tokens[@idx] == "]"
      @idx += 1
      return AbsoluteAddress.new(codeOrigin, offset)
    end
    a = parseVariable
    if @tokens[@idx] == "]"
      result = Address.new(codeOrigin, a, offset)
    else
      parseError unless @tokens[@idx] == ","
      @idx += 1
      b = parseVariable
      if @tokens[@idx] == "]"
        result = BaseIndex.new(codeOrigin, a, b, 1, offset)
      else
        parseError unless @tokens[@idx] == ","
        @idx += 1
        parseError unless ["1", "2", "4", "8"].member? @tokens[@idx].string
        c = @tokens[@idx].string.to_i
        @idx += 1
        parseError unless @tokens[@idx] == "]"
        result = BaseIndex.new(codeOrigin, a, b, c, offset)
      end
    end
    @idx += 1
    result
  end
  
  def parseColonColon
    skipNewLine
    codeOrigin = @tokens[@idx].codeOrigin
    parseError unless isIdentifier @tokens[@idx]
    names = [@tokens[@idx].string]
    @idx += 1
    while @tokens[@idx] == "::"
      @idx += 1
      parseError unless isIdentifier @tokens[@idx]
      names << @tokens[@idx].string
      @idx += 1
    end
    raise if names.empty?
    [codeOrigin, names]
  end
  
  def parseExpressionAtom
    skipNewLine
    if @tokens[@idx] == "-"
      @idx += 1
      NegImmediate.new(@tokens[@idx - 1].codeOrigin, parseExpressionAtom)
    elsif @tokens[@idx] == "("
      @idx += 1
      result = parseExpression
      parseError unless @tokens[@idx] == ")"
      @idx += 1
      result
    elsif isInteger @tokens[@idx]
      result = Immediate.new(@tokens[@idx].codeOrigin, @tokens[@idx].string.to_i)
      @idx += 1
      result
    elsif isIdentifier @tokens[@idx]
      codeOrigin, names = parseColonColon
      if names.size > 1
        StructOffset.forField(codeOrigin, names[0..-2].join('::'), names[-1])
      else
        Variable.forName(codeOrigin, names[0])
      end
    elsif isRegister @tokens[@idx]
      parseVariable
    elsif @tokens[@idx] == "sizeof"
      @idx += 1
      codeOrigin, names = parseColonColon
      Sizeof.forName(codeOrigin, names.join('::'))
    else
      parseError
    end
  end
  
  def parseExpressionMul
    skipNewLine
    result = parseExpressionAtom
    while @tokens[@idx] == "*"
      if @tokens[@idx] == "*"
        @idx += 1
        result = MulImmediates.new(@tokens[@idx - 1].codeOrigin, result, parseExpressionAtom)
      else
        raise
      end
    end
    result
  end
  
  def couldBeExpression
    @tokens[@idx] == "-" or @tokens[@idx] == "sizeof" or isInteger(@tokens[@idx]) or isVariable(@tokens[@idx]) or @tokens[@idx] == "("
  end
  
  def parseExpression
    skipNewLine
    result = parseExpressionMul
    while @tokens[@idx] == "+" or @tokens[@idx] == "-"
      if @tokens[@idx] == "+"
        @idx += 1
        result = AddImmediates.new(@tokens[@idx - 1].codeOrigin, result, parseExpressionMul)
      elsif @tokens[@idx] == "-"
        @idx += 1
        result = SubImmediates.new(@tokens[@idx - 1].codeOrigin, result, parseExpressionMul)
      else
        raise
      end
    end
    result
  end
  
  def parseOperand(comment)
    if couldBeExpression
      expr = parseExpression
      if @tokens[@idx] == "["
        parseAddress(expr)
      else
        expr
      end
    elsif @tokens[@idx] == "["
      parseAddress(Immediate.new(@tokens[@idx].codeOrigin, 0))
    elsif isLabel @tokens[@idx]
      result = LabelReference.new(@tokens[@idx].codeOrigin, Label.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string))
      @idx += 1
      result
    elsif isLocalLabel @tokens[@idx]
      result = LocalLabelReference.new(@tokens[@idx].codeOrigin, LocalLabel.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string))
      @idx += 1
      result
    else
      parseError(comment)
    end
  end
  
  def parseMacroVariables
    skipNewLine
    consume(/\A\(\Z/)
    variables = []
    loop {
      skipNewLine
      if @tokens[@idx] == ")"
        @idx += 1
        break
      elsif isIdentifier(@tokens[@idx])
        variables << Variable.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
        @idx += 1
        skipNewLine
        if @tokens[@idx] == ")"
          @idx += 1
          break
        elsif @tokens[@idx] == ","
          @idx += 1
        else
          parseError
        end
      else
        parseError
      end
    }
    variables
  end
  
  def parseSequence(final, comment)
    firstCodeOrigin = @tokens[@idx].codeOrigin
    list = []
    loop {
      if (@idx == @tokens.length and not final) or (final and @tokens[@idx] =~ final)
        break
      elsif @tokens[@idx] == "\n"
        # ignore
        @idx += 1
      elsif @tokens[@idx] == "const"
        @idx += 1
        parseError unless isVariable @tokens[@idx]
        variable = Variable.forName(@tokens[@idx].codeOrigin, @tokens[@idx].string)
        @idx += 1
        parseError unless @tokens[@idx] == "="
        @idx += 1
        value = parseOperand("while inside of const #{variable.name}")
        list << ConstDecl.new(@tokens[@idx].codeOrigin, variable, value)
      elsif @tokens[@idx] == "error"
        list << Error.new(@tokens[@idx].codeOrigin)
        @idx += 1
      elsif @tokens[@idx] == "if"
        codeOrigin = @tokens[@idx].codeOrigin
        @idx += 1
        skipNewLine
        predicate = parsePredicate
        consume(/\A((then)|(\n))\Z/)
        skipNewLine
        ifThenElse = IfThenElse.new(codeOrigin, predicate, parseSequence(/\A((else)|(end)|(elsif))\Z/, "while inside of \"if #{predicate.dump}\""))
        list << ifThenElse
        while @tokens[@idx] == "elsif"
          codeOrigin = @tokens[@idx].codeOrigin
          @idx += 1
          skipNewLine
          predicate = parsePredicate
          consume(/\A((then)|(\n))\Z/)
          skipNewLine
          elseCase = IfThenElse.new(codeOrigin, predicate, parseSequence(/\A((else)|(end)|(elsif))\Z/, "while inside of \"if #{predicate.dump}\""))
          ifThenElse.elseCase = elseCase
          ifThenElse = elseCase
        end
        if @tokens[@idx] == "else"
          @idx += 1
          ifThenElse.elseCase = parseSequence(/\Aend\Z/, "while inside of else case for \"if #{predicate.dump}\"")
          @idx += 1
        else
          parseError unless @tokens[@idx] == "end"
          @idx += 1
        end
      elsif @tokens[@idx] == "macro"
        codeOrigin = @tokens[@idx].codeOrigin
        @idx += 1
        skipNewLine
        parseError unless isIdentifier(@tokens[@idx])
        name = @tokens[@idx].string
        @idx += 1
        variables = parseMacroVariables
        body = parseSequence(/\Aend\Z/, "while inside of macro #{name}")
        @idx += 1
        list << Macro.new(codeOrigin, name, variables, body)
      elsif isInstruction @tokens[@idx]
        codeOrigin = @tokens[@idx].codeOrigin
        name = @tokens[@idx].string
        @idx += 1
        if (not final and @idx == @tokens.size) or (final and @tokens[@idx] =~ final)
          # Zero operand instruction, and it's the last one.
          list << Instruction.new(codeOrigin, name, [])
          break
        elsif @tokens[@idx] == "\n"
          # Zero operand instruction.
          list << Instruction.new(codeOrigin, name, [])
          @idx += 1
        else
          # It's definitely an instruction, and it has at least one operand.
          operands = []
          endOfSequence = false
          loop {
            operands << parseOperand("while inside of instruction #{name}")
            if (not final and @idx == @tokens.size) or (final and @tokens[@idx] =~ final)
              # The end of the instruction and of the sequence.
              endOfSequence = true
              break
            elsif @tokens[@idx] == ","
              # Has another operand.
              @idx += 1
            elsif @tokens[@idx] == "\n"
              # The end of the instruction.
              @idx += 1
              break
            else
              parseError("Expected a comma, newline, or #{final} after #{operands.last.dump}")
            end
          }
          list << Instruction.new(codeOrigin, name, operands)
          if endOfSequence
            break
          end
        end
      elsif isIdentifier @tokens[@idx]
        codeOrigin = @tokens[@idx].codeOrigin
        name = @tokens[@idx].string
        @idx += 1
        if @tokens[@idx] == "("
          # Macro invocation.
          @idx += 1
          operands = []
          skipNewLine
          if @tokens[@idx] == ")"
            @idx += 1
          else
            loop {
              skipNewLine
              if @tokens[@idx] == "macro"
                # It's a macro lambda!
                codeOriginInner = @tokens[@idx].codeOrigin
                @idx += 1
                variables = parseMacroVariables
                body = parseSequence(/\Aend\Z/, "while inside of anonymous macro passed as argument to #{name}")
                @idx += 1
                operands << Macro.new(codeOriginInner, nil, variables, body)
              else
                operands << parseOperand("while inside of macro call to #{name}")
              end
              skipNewLine
              if @tokens[@idx] == ")"
                @idx += 1
                break
              elsif @tokens[@idx] == ","
                @idx += 1
              else
                parseError "Unexpected #{@tokens[@idx].string.inspect} while parsing invocation of macro #{name}"
              end
            }
          end
          list << MacroCall.new(codeOrigin, name, operands)
        else
          parseError "Expected \"(\" after #{name}"
        end
      elsif isLabel @tokens[@idx] or isLocalLabel @tokens[@idx]
        codeOrigin = @tokens[@idx].codeOrigin
        name = @tokens[@idx].string
        @idx += 1
        parseError unless @tokens[@idx] == ":"
        # It's a label.
        if isLabel name
          list << Label.forName(codeOrigin, name)
        else
          list << LocalLabel.forName(codeOrigin, name)
        end
        @idx += 1
      else
        parseError "Expecting terminal #{final} #{comment}"
      end
    }
    Sequence.new(firstCodeOrigin, list)
  end
end

def parse(tokens)
  parser = Parser.new(tokens)
  parser.parseSequence(nil, "")
end




# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

GPRS =
  [
   "t0",
   "t1",
   "t2",
   "t3",
   "t4",
   "cfr",
   "a0",
   "a1",
   "r0",
   "r1",
   "sp"
  ]

FPRS =
  [
   "ft0",
   "ft1",
   "ft2",
   "ft3",
   "ft4",
   "ft5",
   "fa0",
   "fa1",
   "fa2",
   "fa3",
   "fr"
  ]

REGISTERS = GPRS + FPRS

GPR_PATTERN = Regexp.new('\\A((' + GPRS.join(')|(') + '))\\Z')
FPR_PATTERN = Regexp.new('\\A((' + FPRS.join(')|(') + '))\\Z')

REGISTER_PATTERN = Regexp.new('\\A((' + REGISTERS.join(')|(') + '))\\Z')



# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

require "ast"
require "backends"
require "parser"
require "transform"

#
# computeSettingsCombinations(ast) -> settingsCombiations
#
# Computes an array of settings maps, where a settings map constitutes
# a configuration for the assembly code being generated. The map
# contains key value pairs where keys are settings names (strings) and
# the values are booleans (true for enabled, false for disabled).
#

def computeSettingsCombinations(ast)
  settingsCombinations = []
  
  def settingsCombinator(settingsCombinations, mapSoFar, remaining)
    if remaining.empty?
      settingsCombinations << mapSoFar
      return
    end
    
    newMap = mapSoFar.dup
    newMap[remaining[0]] = true
    settingsCombinator(settingsCombinations, newMap, remaining[1..-1])
    
    newMap = mapSoFar.dup
    newMap[remaining[0]] = false
    settingsCombinator(settingsCombinations, newMap, remaining[1..-1])
  end
  
  settingsCombinator(settingsCombinations, {}, (ast.filter(Setting).uniq.collect{|v| v.name} + ["X86", "ARMv7"]).uniq)
  
  settingsCombinations
end

#
# forSettings(concreteSettings, ast) {
#     | concreteSettings, lowLevelAST, backend | ... }
#
# Determines if the settings combination is valid, and if so, calls
# the block with the information you need to generate code.
#

def forSettings(concreteSettings, ast)
  # Check which architectures this combinator claims to support.
  numClaimedBackends = 0
  selectedBackend = nil
  BACKENDS.each {
    | backend |
    isSupported = concreteSettings[backend]
    raise unless isSupported != nil
    numClaimedBackends += if isSupported then 1 else 0 end
    if isSupported
      selectedBackend = backend
    end
  }
  
  return if numClaimedBackends > 1
  
  # Resolve the AST down to a low-level form (no macros or conditionals).
  lowLevelAST = ast.resolveSettings(concreteSettings)
  
  yield concreteSettings, lowLevelAST, selectedBackend
end

#
# forEachValidSettingsCombination(ast) {
#     | concreteSettings, ast, backend, index | ... }
#
# forEachValidSettingsCombination(ast, settingsCombinations) {
#     | concreteSettings, ast, backend, index | ... }
#
# Executes the given block for each valid settings combination in the
# settings map. The ast passed into the block is resolved
# (ast.resolve) against the settings.
#
# The first form will call computeSettingsCombinations(ast) for you.
#

def forEachValidSettingsCombination(ast, *optionalSettingsCombinations)
  raise if optionalSettingsCombinations.size > 1
  
  if optionalSettingsCombinations.empty?
    settingsCombinations = computeSettingsCombinations(ast)
  else
    settingsCombinations = optionalSettingsCombiations[0]
  end
  
  settingsCombinations.each_with_index {
    | concreteSettings, index |
    forSettings(concreteSettings, ast) {
      | concreteSettings_, lowLevelAST, backend |
      yield concreteSettings, lowLevelAST, backend, index
    }
  }
end

#
# cppSettingsTest(concreteSettings)
#
# Returns the C++ code used to test if we are in a configuration that
# corresponds to the given concrete settings.
#

def cppSettingsTest(concreteSettings)
  "#if " + concreteSettings.to_a.collect{
    | pair |
    (if pair[1]
       ""
     else
       "!"
     end) + "OFFLINE_ASM_" + pair[0]
  }.join(" && ")
end

#
# isASTErroneous(ast)
#
# Tests to see if the AST claims that there is an error - i.e. if the
# user's code, after settings resolution, has Error nodes.
#

def isASTErroneous(ast)
  not ast.filter(Error).empty?
end

#
# assertConfiguration(concreteSettings)
#
# Emits a check that asserts that we're using the given configuration.
#

def assertConfiguration(concreteSettings)
  $output.puts cppSettingsTest(concreteSettings)
  $output.puts "#else"
  $output.puts "#error \"Configuration mismatch.\""
  $output.puts "#endif"
end

#
# emitCodeInConfiguration(concreteSettings, ast, backend) {
#     | concreteSettings, ast, backend | ... }
#
# Emits all relevant guards to see if the configuration holds and
# calls the block if the configuration is not erroneous.
#

def emitCodeInConfiguration(concreteSettings, ast, backend)
  $output.puts cppSettingsTest(concreteSettings)
  
  if isASTErroneous(ast)
    $output.puts "#error \"Invalid configuration.\""
  elsif not WORKING_BACKENDS.include? backend
    $output.puts "#error \"This backend is not supported yet.\""
  else
    yield concreteSettings, ast, backend
  end
  
  $output.puts "#endif"
end

#
# emitCodeInAllConfigurations(ast) {
#     | concreteSettings, ast, backend, index | ... }
#
# Emits guard codes for all valid configurations, and calls the block
# for those configurations that are valid and not erroneous.
#

def emitCodeInAllConfigurations(ast)
  forEachValidSettingsCombination(ast) {
    | concreteSettings, lowLevelAST, backend, index |
    $output.puts cppSettingsTest(concreteSettings)
    yield concreteSettings, lowLevelAST, backend, index
    $output.puts "#endif"
  }
end






# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

require "ast"

#
# node.resolveSettings(settings)
#
# Construct a new AST that does not have any IfThenElse nodes by
# substituting concrete boolean values for each Setting.
#

class Node
  def resolveSettings(settings)
    mapChildren {
      | child |
      child.resolveSettings(settings)
    }
  end
end

class True
  def resolveSettings(settings)
    self
  end
end

class False
  def resolveSettings(settings)
    self
  end
end

class Setting
  def resolveSettings(settings)
    settings[@name].asNode
  end
end

class And
  def resolveSettings(settings)
    (@left.resolveSettings(settings).value and @right.resolveSettings(settings).value).asNode
  end
end

class Or
  def resolveSettings(settings)
    (@left.resolveSettings(settings).value or @right.resolveSettings(settings).value).asNode
  end
end

class Not
  def resolveSettings(settings)
    (not @child.resolveSettings(settings).value).asNode
  end
end

class IfThenElse
  def resolveSettings(settings)
    if @predicate.resolveSettings(settings).value
      @thenCase.resolveSettings(settings)
    else
      @elseCase.resolveSettings(settings)
    end
  end
end

class Sequence
  def resolveSettings(settings)
    newList = []
    @list.each {
      | item |
      item = item.resolveSettings(settings)
      if item.is_a? Sequence
        newList += item.list
      else
        newList << item
      end
    }
    Sequence.new(codeOrigin, newList)
  end
end

#
# node.demacroify(macros)
# node.substitute(mapping)
#
# demacroify() constructs a new AST that does not have any Macro
# nodes, while substitute() replaces Variable nodes with the given
# nodes in the mapping.
#

class Node
  def demacroify(macros)
    mapChildren {
      | child |
      child.demacroify(macros)
    }
  end
  
  def substitute(mapping)
    mapChildren {
      | child |
      child.substitute(mapping)
    }
  end
  
  def substituteLabels(mapping)
    mapChildren {
      | child |
      child.substituteLabels(mapping)
    }
  end
end

class Macro
  def substitute(mapping)
    myMapping = {}
    mapping.each_pair {
      | key, value |
      unless @variables.include? key
        myMapping[key] = value
      end
    }
    mapChildren {
      | child |
      child.substitute(myMapping)
    }
  end
end

class Variable
  def substitute(mapping)
    if mapping[self]
      mapping[self]
    else
      self
    end
  end
end

class LocalLabel
  def substituteLabels(mapping)
    if mapping[self]
      mapping[self]
    else
      self
    end
  end
end

class Sequence
  def substitute(constants)
    newList = []
    myConstants = constants.dup
    @list.each {
      | item |
      if item.is_a? ConstDecl
        myConstants[item.variable] = item.value.substitute(myConstants)
      else
        newList << item.substitute(myConstants)
      end
    }
    Sequence.new(codeOrigin, newList)
  end
  
  def renameLabels(comment)
    mapping = {}
    
    @list.each {
      | item |
      if item.is_a? LocalLabel
        mapping[item] = LocalLabel.unique(if comment then comment + "_" else "" end + item.cleanName)
      end
    }
    
    substituteLabels(mapping)
  end
  
  def demacroify(macros)
    myMacros = macros.dup
    @list.each {
      | item |
      if item.is_a? Macro
        myMacros[item.name] = item
      end
    }
    newList = []
    @list.each {
      | item |
      if item.is_a? Macro
        # Ignore.
      elsif item.is_a? MacroCall
        mapping = {}
        myMyMacros = myMacros.dup
        raise "Could not find macro #{item.name} at #{item.codeOriginString}" unless myMacros[item.name]
        raise "Argument count mismatch for call to #{item.name} at #{item.codeOriginString}" unless item.operands.size == myMacros[item.name].variables.size
        item.operands.size.times {
          | idx |
          if item.operands[idx].is_a? Variable and myMacros[item.operands[idx].name]
            myMyMacros[myMacros[item.name].variables[idx].name] = myMacros[item.operands[idx].name]
            mapping[myMacros[item.name].variables[idx].name] = nil
          elsif item.operands[idx].is_a? Macro
            myMyMacros[myMacros[item.name].variables[idx].name] = item.operands[idx]
            mapping[myMacros[item.name].variables[idx].name] = nil
          else
            myMyMacros[myMacros[item.name].variables[idx]] = nil
            mapping[myMacros[item.name].variables[idx]] = item.operands[idx]
          end
        }
        newList += myMacros[item.name].body.substitute(mapping).demacroify(myMyMacros).renameLabels(item.name).list
      else
        newList << item.demacroify(myMacros)
      end
    }
    Sequence.new(codeOrigin, newList).substitute({})
  end
end

#
# node.resolveOffsets(offsets, sizes)
#
# Construct a new AST that has offset values instead of symbolic
# offsets.
#

class Node
  def resolveOffsets(offsets, sizes)
    mapChildren {
      | child |
      child.resolveOffsets(offsets, sizes)
    }
  end
end

class StructOffset
  def resolveOffsets(offsets, sizes)
    if offsets[self]
      Immediate.new(codeOrigin, offsets[self])
    else
      self
    end
  end
end

class Sizeof
  def resolveOffsets(offsets, sizes)
    if sizes[self]
      Immediate.new(codeOrigin, sizes[self])
    else
      puts "Could not find #{self.inspect} in #{sizes.keys.inspect}"
      puts "sizes = #{sizes.inspect}"
      self
    end
  end
end

#
# node.fold
#
# Resolve constant references and compute arithmetic expressions.
#

class Node
  def fold
    mapChildren {
      | child |
      child.fold
    }
  end
end

class AddImmediates
  def fold
    @left = @left.fold
    @right = @right.fold
    return self unless @left.is_a? Immediate
    return self unless @right.is_a? Immediate
    Immediate.new(codeOrigin, @left.value + @right.value)
  end
end

class SubImmediates
  def fold
    @left = @left.fold
    @right = @right.fold
    return self unless @left.is_a? Immediate
    return self unless @right.is_a? Immediate
    Immediate.new(codeOrigin, @left.value - @right.value)
  end
end

class MulImmediates
  def fold
    @left = @left.fold
    @right = @right.fold
    return self unless @left.is_a? Immediate
    return self unless @right.is_a? Immediate
    Immediate.new(codeOrigin, @left.value * @right.value)
  end
end

class NegImmediate
  def fold
    @child = @child.fold
    return self unless @child.is_a? Immediate
    Immediate.new(codeOrigin, -@child.value)
  end
end

#
# node.resolveAfterSettings(offsets, sizes)
#
# Compile assembly against a set of offsets.
#

class Node
  def resolve(offsets, sizes)
    demacroify({}).resolveOffsets(offsets, sizes).fold
  end
end




# Copyright (C) 2011 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. AND ITS 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 APPLE INC. OR ITS 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.

class RegisterID
  def supports8BitOnX86
    case name
    when "t0", "a0", "r0", "t1", "a1", "r1", "t2", "t3"
      true
    when "t4", "cfr"
      false
    else
      raise
    end
  end
  
  def x86Operand(kind)
    case name
    when "t0", "a0", "r0"
      case kind
      when :byte
        "%al"
      when :half
        "%ax"
      when :int
        "%eax"
      else
        raise
      end
    when "t1", "a1", "r1"
      case kind
      when :byte
        "%dl"
      when :half
        "%dx"
      when :int
        "%edx"
      else
        raise
      end
    when "t2"
      case kind
      when :byte
        "%cl"
      when :half
        "%cx"
      when :int
        "%ecx"
      else
        raise
      end
    when "t3"
      case kind
      when :byte
        "%bl"
      when :half
        "%bx"
      when :int
        "%ebx"
      else
        raise
      end
    when "t4"
      case kind
      when :byte
        "%sil"
      when :half
        "%si"
      when :int
        "%esi"
      else
        raise
      end
    when "cfr"
      case kind
      when :byte
        "%dil"
      when :half
        "%di"
      when :int
        "%edi"
      else
        raise
      end
    when "sp"
      case kind
      when :byte
        "%spl"
      when :half
        "%sp"
      when :int
        "%esp"
      else
        raise
      end
    else
      raise
    end
  end
  def x86CallOperand(kind)
    "*#{x86Operand(kind)}"
  end
end

class FPRegisterID
  def x86Operand(kind)
    raise unless kind == :double
    case name
    when "ft0", "fa0", "fr"
      "%xmm0"
    when "ft1", "fa1"
      "%xmm1"
    when "ft2", "fa2"
      "%xmm2"
    when "ft3", "fa3"
      "%xmm3"
    when "ft4"
      "%xmm4"
    when "ft5"
      "%xmm5"
    else
      raise
    end
  end
  def x86CallOperand(kind)
    "*#{x86Operand(kind)}"
  end
end

class Immediate
  def x86Operand(kind)
    "$#{value}"
  end
  def x86CallOperand(kind)
    "#{value}"
  end
end

class Address
  def supports8BitOnX86
    true
  end
    
  def x86Operand(kind)
    "#{offset.value}(#{base.x86Operand(:int)})"
  end
  def x86CallOperand(kind)
    "*#{x86Operand(kind)}"
  end
end

class BaseIndex
  def supports8BitOnX86
    true
  end
    
  def x86Operand(kind)
    "#{offset.value}(#{base.x86Operand(:int)}, #{index.x86Operand(:int)}, #{scale})"
  end

  def x86CallOperand(kind)
    "*#{x86operand(kind)}"
  end
end

class AbsoluteAddress
  def supports8BitOnX86
    true
  end
    
  def x86Operand(kind)
    "#{address.value}"
  end

  def x86CallOperand(kind)
    "*#{address.value}"
  end
end

class LabelReference
  def x86Label
    sanitizeLabelName(name)
  end
  def x86CallOperand(kind)
    x86Label
  end
end

class LocalLabelReference
  def x86Label
    "L_offlineasm_"+name[1..-1]
  end
  def x86CallOperand(kind)
    x86Label
  end
end

class Instruction
  def x86Operands(*kinds)
    raise unless kinds.size == operands.size
    result = []
    kinds.size.times {
      | idx |
      result << operands[idx].x86Operand(kinds[idx])
    }
    result.join(", ")
  end

  def x86Suffix(kind)
    case kind
    when :byte
      "b"
    when :half
      "w"
    when :int
      "l"
    when :double
      "sd"
    else
      raise
    end
  end
  
  def handleX86OpWithNumOperands(opcode, kind, numOperands)
    if numOperands == 3
      if operands[0] == operands[2]
        $asm.puts "\t#{opcode} #{operands[1].x86Operand(kind)}, #{operands[2].x86Operand(kind)}"
      elsif operands[1] == operands[2]
        $asm.puts "\t#{opcode} #{operands[0].x86Operand(kind)}, #{operands[2].x86Operand(kind)}"
      else
        $asm.puts "\tmov#{x86Suffix(kind)} #{operands[0].x86Operand(kind)}, #{operands[2].x86Operand(kind)}"
        $asm.puts "\t#{opcode} #{operands[1].x86Operand(kind)}, #{operands[2].x86Operand(kind)}"
      end
    else
      $asm.puts "\t#{opcode} #{operands[0].x86Operand(kind)}, #{operands[1].x86Operand(kind)}"
    end
  end
  
  def handleX86Op(opcode, kind)
    handleX86OpWithNumOperands(opcode, kind, operands.size)
  end
  
  def handleX86Shift(opcode, kind)
    if operands[0].is_a? Immediate or operands[0] == RegisterID.forName(nil, "t2")
      $asm.puts "\t#{opcode} #{operands[0].x86Operand(:byte)}, #{operands[1].x86Operand(kind)}"
    else
      $asm.puts "\txchgl #{operands[0].x86Operand(:int)}, %ecx"
      $asm.puts "\t#{opcode} %cl, #{operands[1].x86Operand(kind)}"
      $asm.puts "\txchgl #{operands[0].x86Operand(:int)}, %ecx"
    end
  end
  
  def handleX86DoubleBranch(branchOpcode, mode)
    case mode
    when :normal
      $asm.puts "\tucomisd #{operands[1].x86Operand(:double)}, #{operands[0].x86Operand(:double)}"
    when :reverse
      $asm.puts "\tucomisd #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:double)}"
    else
      raise mode.inspect
    end
    $asm.puts "\t#{branchOpcode} #{operands[2].x86Label}"
  end
  
  def handleX86IntCompare(opcodeSuffix, kind)
    if operands[0].is_a? Immediate and operands[0].value == 0 and operands[1].is_a? RegisterID and (opcodeSuffix == "e" or opcodeSuffix == "ne")
      $asm.puts "\ttest#{x86Suffix(kind)} #{operands[1].x86Operand(kind)}"
    elsif operands[1].is_a? Immediate and operands[1].value == 0 and operands[0].is_a? RegisterID and (opcodeSuffix == "e" or opcodeSuffix == "ne")
      $asm.puts "\ttest#{x86Suffix(kind)} #{operands[0].x86Operand(kind)}"
    else
      $asm.puts "\tcmp#{x86Suffix(kind)} #{operands[1].x86Operand(kind)}, #{operands[0].x86Operand(kind)}"
    end
  end
  
  def handleX86IntBranch(branchOpcode, kind)
    handleX86IntCompare(branchOpcode[1..-1], kind)
    $asm.puts "\t#{branchOpcode} #{operands[2].x86Label}"
  end
  
  def handleX86Set(setOpcode, operand)
    if operand.supports8BitOnX86
      $asm.puts "\t#{setOpcode} #{operand.x86Operand(:byte)}"
      $asm.puts "\tmovzbl #{operand.x86Operand(:byte)}, #{operand.x86Operand(:int)}"
    else
      $asm.puts "\txchgl #{operand.x86Operand(:int)}, %eax"
      $asm.puts "\t#{setOpcode} %al"
      $asm.puts "\tmovzbl %al, %eax"
      $asm.puts "\txchgl #{operand.x86Operand(:int)}, %eax"
    end
  end
  
  def handleX86IntCompareSet(setOpcode, kind)
    handleX86IntCompare(setOpcode[3..-1], kind)
    handleX86Set(setOpcode, operands[2])
  end
  
  def handleX86Test(kind)
    value = operands[0]
    case operands.size
    when 2
      mask = Immediate.new(codeOrigin, -1)
    when 3
      mask = operands[1]
    else
      raise "Expected 2 or 3 operands, but got #{operands.size} at #{codeOriginString}"
    end
    
    if mask.is_a? Immediate and mask.value == -1
      if value.is_a? RegisterID
        $asm.puts "\ttest#{x86Suffix(kind)} #{value.x86Operand(kind)}, #{value.x86Operand(kind)}"
      else
        $asm.puts "\tcmp#{x86Suffix(kind)} $0, #{value.x86Operand(kind)}"
      end
    else
      $asm.puts "\ttest#{x86Suffix(kind)} #{mask.x86Operand(kind)}, #{value.x86Operand(kind)}"
    end
  end
  
  def handleX86BranchTest(branchOpcode, kind)
    handleX86Test(kind)
    $asm.puts "\t#{branchOpcode} #{operands.last.x86Label}"
  end
  
  def handleX86SetTest(setOpcode, kind)
    handleX86Test(kind)
    handleX86Set(setOpcode, operands.last)
  end
  
  def handleX86OpBranch(opcode, branchOpcode, kind)
    handleX86OpWithNumOperands(opcode, kind, operands.size - 1)
    case operands.size
    when 4
      jumpTarget = operands[3]
    when 3
      jumpTarget = operands[2]
    else
      raise self.inspect
    end
    $asm.puts "\t#{branchOpcode} #{jumpTarget.x86Label}"
  end
  
  def handleX86SubBranch(branchOpcode, kind)
    if operands.size == 4 and operands[1] == operands[2]
      $asm.puts "\tnegl #{operands[2].x86Operand(:int)}"
      $asm.puts "\taddl #{operands[0].x86Operand(:int)}, #{operands[2].x86Operand(:int)}"
    else
      handleX86OpWithNumOperands("sub#{x86Suffix(kind)}", kind, operands.size - 1)
    end
    case operands.size
    when 4
      jumpTarget = operands[3]
    when 3
      jumpTarget = operands[2]
    else
      raise self.inspect
    end
    $asm.puts "\t#{branchOpcode} #{jumpTarget.x86Label}"
  end
  
  def lowerX86
    $asm.comment codeOriginString
    case opcode
    when "addi", "addp"
      if operands.size == 3 and operands[0].is_a? Immediate
        raise unless operands[1].is_a? RegisterID
        raise unless operands[2].is_a? RegisterID
        if operands[0].value == 0
          unless operands[1] == operands[2]
            $asm.puts "\tmovl #{operands[1].x86Operand(:int)}, #{operands[2].x86Operand(:int)}"
          end
        else
          $asm.puts "\tleal #{operands[0].value}(#{operands[1].x86Operand(:int)}), #{operands[2].x86Operand(:int)}"
        end
      elsif operands.size == 3 and operands[0].is_a? RegisterID
        raise unless operands[1].is_a? RegisterID
        raise unless operands[2].is_a? RegisterID
        $asm.puts "\tleal (#{operands[0].x86Operand(:int)}, #{operands[1].x86Operand(:int)}), #{operands[2].x86Operand(:int)}"
      else
        unless Immediate.new(nil, 0) == operands[0]
          $asm.puts "\taddl #{x86Operands(:int, :int)}"
        end
      end
    when "andi", "andp"
      handleX86Op("andl", :int)
    when "lshifti"
      handleX86Shift("sall", :int)
    when "muli"
      if operands.size == 3 and operands[0].is_a? Immediate
        $asm.puts "\timull #{x86Operands(:int, :int, :int)}"
      else
        # FIXME: could do some peephole in case the left operand is immediate and it's
        # a power of two.
        handleX86Op("imull", :int)
      end
    when "negi"
      $asm.puts "\tnegl #{x86Operands(:int)}"
    when "noti"
      $asm.puts "\tnotl #{x86Operands(:int)}"
    when "ori", "orp"
      handleX86Op("orl", :int)
    when "rshifti"
      handleX86Shift("sarl", :int)
    when "urshifti"
      handleX86Shift("shrl", :int)
    when "subi", "subp"
      if operands.size == 3 and operands[1] == operands[2]
        $asm.puts "\tnegl #{operands[2].x86Operand(:int)}"
        $asm.puts "\taddl #{operands[0].x86Operand(:int)}, #{operands[2].x86Operand(:int)}"
      else
        handleX86Op("subl", :int)
      end
    when "xori", "xorp"
      handleX86Op("xorl", :int)
    when "loadi", "storei", "loadp", "storep"
      $asm.puts "\tmovl #{x86Operands(:int, :int)}"
    when "loadb"
      $asm.puts "\tmovzbl #{operands[0].x86Operand(:byte)}, #{operands[1].x86Operand(:int)}"
    when "loadh"
      $asm.puts "\tmovzwl #{operands[0].x86Operand(:half)}, #{operands[1].x86Operand(:int)}"
    when "storeb"
      $asm.puts "\tmovb #{x86Operands(:byte, :byte)}"
    when "loadd", "moved", "stored"
      $asm.puts "\tmovsd #{x86Operands(:double, :double)}"
    when "addd"
      $asm.puts "\taddsd #{x86Operands(:double, :double)}"
    when "divd"
      $asm.puts "\tdivsd #{x86Operands(:double, :double)}"
    when "subd"
      $asm.puts "\tsubsd #{x86Operands(:double, :double)}"
    when "muld"
      $asm.puts "\tmulsd #{x86Operands(:double, :double)}"
    when "sqrtd"
      $asm.puts "\tsqrtsd #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:double)}"
    when "ci2d"
      $asm.puts "\tcvtsi2sd #{operands[0].x86Operand(:int)}, #{operands[1].x86Operand(:double)}"
    when "bdeq"
      isUnordered = LocalLabel.unique("bdeq")
      $asm.puts "\tucomisd #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:double)}"
      $asm.puts "\tjp #{LabelReference.new(codeOrigin, isUnordered).x86Label}"
      $asm.puts "\tje #{LabelReference.new(codeOrigin, operands[2]).x86Label}"
      isUnordered.lower("X86")
    when "bdneq"
      handleX86DoubleBranch("jne", :normal)
    when "bdgt"
      handleX86DoubleBranch("ja", :normal)
    when "bdgteq"
      handleX86DoubleBranch("jae", :normal)
    when "bdlt"
      handleX86DoubleBranch("ja", :reverse)
    when "bdlteq"
      handleX86DoubleBranch("jae", :reverse)
    when "bdequn"
      handleX86DoubleBranch("je", :normal)
    when "bdnequn"
      isUnordered = LocalLabel.unique("bdnequn")
      isEqual = LocalLabel.unique("bdnequn")
      $asm.puts "\tucomisd #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:double)}"
      $asm.puts "\tjp #{LabelReference.new(codeOrigin, isUnordered).x86Label}"
      $asm.puts "\tje #{LabelReference.new(codeOrigin, isEqual).x86Label}"
      isUnordered.lower("X86")
      $asm.puts "\tjmp #{operands[2].x86Label}"
      isEqual.lower("X86")
    when "bdgtun"
      handleX86DoubleBranch("jb", :reverse)
    when "bdgtequn"
      handleX86DoubleBranch("jbe", :reverse)
    when "bdltun"
      handleX86DoubleBranch("jb", :normal)
    when "bdltequn"
      handleX86DoubleBranch("jbe", :normal)
    when "btd2i"
      $asm.puts "\tcvttsd2si #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:int)}"
      $asm.puts "\tcmpl $0x80000000 #{operands[1].x86Operand(:int)}"
      $asm.puts "\tje #{operands[2].x86Label}"
    when "td2i"
      $asm.puts "\tcvttsd2si #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:int)}"
    when "bcd2i"
      $asm.puts "\tcvttsd2si #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:int)}"
      $asm.puts "\ttestl #{operands[1].x86Operand(:int)}, #{operands[1].x86Operand(:int)}"
      $asm.puts "\tje #{operands[2].x86Label}"
      $asm.puts "\tcvtsi2sd #{operands[1].x86Operand(:int)}, %xmm7"
      $asm.puts "\tucomisd #{operands[0].x86Operand(:double)}, %xmm7"
      $asm.puts "\tjp #{operands[2].x86Label}"
      $asm.puts "\tjne #{operands[2].x86Label}"
    when "movdz"
      $asm.puts "\txorpd #{operands[0].x86Operand(:double)}, #{operands[0].x86Operand(:double)}"
    when "pop"
      $asm.puts "\tpop #{operands[0].x86Operand(:int)}"
    when "push"
      $asm.puts "\tpush #{operands[0].x86Operand(:int)}"
    when "move", "sxi2p", "zxi2p"
      if Immediate.new(nil, 0) == operands[0] and operands[1].is_a? RegisterID
        $asm.puts "\txorl #{operands[1].x86Operand(:int)}, #{operands[1].x86Operand(:int)}"
      elsif operands[0] != operands[1]
        $asm.puts "\tmovl #{x86Operands(:int, :int)}"
      end
    when "nop"
      $asm.puts "\tnop"
    when "bieq", "bpeq"
      handleX86IntBranch("je", :int)
    when "bineq", "bpneq"
      handleX86IntBranch("jne", :int)
    when "bia", "bpa"
      handleX86IntBranch("ja", :int)
    when "biaeq", "bpaeq"
      handleX86IntBranch("jae", :int)
    when "bib", "bpb"
      handleX86IntBranch("jb", :int)
    when "bibeq", "bpbeq"
      handleX86IntBranch("jbe", :int)
    when "bigt", "bpgt"
      handleX86IntBranch("jg", :int)
    when "bigteq", "bpgteq"
      handleX86IntBranch("jge", :int)
    when "bilt", "bplt"
      handleX86IntBranch("jl", :int)
    when "bilteq", "bplteq"
      handleX86IntBranch("jle", :int)
    when "bbeq"
      handleX86IntBranch("je", :byte)
    when "bbneq"
      handleX86IntBranch("jne", :byte)
    when "bba"
      handleX86IntBranch("ja", :byte)
    when "bbaeq"
      handleX86IntBranch("jae", :byte)
    when "bbb"
      handleX86IntBranch("jb", :byte)
    when "bbbeq"
      handleX86IntBranch("jbe", :byte)
    when "bbgt"
      handleX86IntBranch("jg", :byte)
    when "bbgteq"
      handleX86IntBranch("jge", :byte)
    when "bblt"
      handleX86IntBranch("jl", :byte)
    when "bblteq"
      handleX86IntBranch("jlteq", :byte)
    when "btio", "btpo"
      handleX86BranchTest("jo", :int)
    when "btis", "btps"
      handleX86BranchTest("js", :int)
    when "btiz", "btpz"
      handleX86BranchTest("jz", :int)
    when "btinz", "btpnz"
      handleX86BranchTest("jnz", :int)
    when "btbo"
      handleX86BranchTest("jo", :byte)
    when "btbs"
      handleX86BranchTest("js", :byte)
    when "btbz"
      handleX86BranchTest("jz", :byte)
    when "btbnz"
      handleX86BranchTest("jnz", :byte)
    when "jmp"
      $asm.puts "\tjmp #{operands[0].x86CallOperand(:int)}"
    when "baddio", "baddpo"
      handleX86OpBranch("addl", "jo", :int)
    when "baddis", "baddps"
      handleX86OpBranch("addl", "js", :int)
    when "baddiz", "baddpz"
      handleX86OpBranch("addl", "jz", :int)
    when "baddinz", "baddpnz"
      handleX86OpBranch("addl", "jnz", :int)
    when "bsubio"
      handleX86SubBranch("jo", :int)
    when "bsubis"
      handleX86SubBranch("js", :int)
    when "bsubiz"
      handleX86SubBranch("jz", :int)
    when "bsubinz"
      handleX86SubBranch("jnz", :int)
    when "bmulio"
      handleX86OpBranch("imull", "jo", :int)
    when "bmulis"
      handleX86OpBranch("imull", "js", :int)
    when "bmuliz"
      handleX86OpBranch("imull", "jz", :int)
    when "bmulinz"
      handleX86OpBranch("imull", "jnz", :int)
    when "borio"
      handleX86OpBranch("orl", "jo", :int)
    when "boris"
      handleX86OpBranch("orl", "js", :int)
    when "boriz"
      handleX86OpBranch("orl", "jz", :int)
    when "borinz"
      handleX86OpBranch("orl", "jnz", :int)
    when "break"
      $asm.puts "\tint $3"
    when "call"
      $asm.puts "\tcall #{operands[0].x86CallOperand(:int)}"
    when "ret"
      $asm.puts "\tret"
    when "cieq", "cpeq"
      handleX86IntCompareSet("sete", :int)
    when "cineq", "cpneq"
      handleX86IntCompareSet("setne", :int)
    when "cia", "cpa"
      handleX86IntCompareSet("seta", :int)
    when "ciaeq", "cpaeq"
      handleX86IntCompareSet("setae", :int)
    when "cib", "cpb"
      handleX86IntCompareSet("setb", :int)
    when "cibeq", "cpbeq"
      handleX86IntCompareSet("setbe", :int)
    when "cigt", "cpgt"
      handleX86IntCompareSet("setg", :int)
    when "cigteq", "cpgteq"
      handleX86IntCompareSet("setge", :int)
    when "cilt", "cplt"
      handleX86IntCompareSet("setl", :int)
    when "cilteq", "cplteq"
      handleX86IntCompareSet("setle", :int)
    when "tio"
      handleX86SetTest("seto", :int)
    when "tis"
      handleX86SetTest("sets", :int)
    when "tiz"
      handleX86SetTest("setz", :int)
    when "tinz"
      handleX86SetTest("setnz", :int)
    when "tbo"
      handleX86SetTest("seto", :byte)
    when "tbs"
      handleX86SetTest("sets", :byte)
    when "tbz"
      handleX86SetTest("setz", :byte)
    when "tbnz"
      handleX86SetTest("setnz", :byte)
    when "peek"
      $asm.puts "\tmovl #{operands[0].value * 4}(%esp), #{operands[1].x86Operand(:int)}"
    when "poke"
      $asm.puts "\tmovl #{operands[0].x86Operand(:int)}, #{operands[1].value * 4}(%esp)"
    when "cdqi"
      $asm.puts "\tcdq"
    when "idivi"
      $asm.puts "\tidivl #{operands[0].x86Operand(:int)}"
    when "fii2d"
      $asm.puts "\tmovd #{operands[0].x86Operand(:int)}, #{operands[2].x86Operand(:double)}"
      $asm.puts "\tmovd #{operands[1].x86Operand(:int)}, %xmm7"
      $asm.puts "\tpsllq $32, %xmm7"
      $asm.puts "\tpor %xmm7, #{operands[2].x86Operand(:double)}"
    when "fd2ii"
      $asm.puts "\tmovd #{operands[0].x86Operand(:double)}, #{operands[1].x86Operand(:int)}"
      $asm.puts "\tmovsd #{operands[0].x86Operand(:double)}, %xmm7"
      $asm.puts "\tpsrlq $32, %xmm7"
      $asm.puts "\tmovsd %xmm7, #{operands[2].x86Operand(:int)}"
    else
      raise "Bad opcode: #{opcode}"
    end
  end
end




/*
 * Copyright (C) 2012 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 CodeSpecializationKind_h
#define CodeSpecializationKind_h

namespace JSC {

enum CodeSpecializationKind { CodeForCall, CodeForConstruct };

} // namespace JSC

#endif // CodeSpecializationKind_h




#define CommonSlowPaths_h

#include "CodeBlock.h"
#include "CodeSpecializationKind.h"
#include "ExceptionHelpers.h"
#include "JSArray.h"



namespace CommonSlowPaths {

ALWAYS_INLINE ExecState* arityCheckFor(ExecState* exec, RegisterFile* registerFile, CodeSpecializationKind kind)
{
    JSFunction* callee = asFunction(exec->callee());
    ASSERT(!callee->isHostFunction());
    CodeBlock* newCodeBlock = &callee->jsExecutable()->generatedBytecodeFor(kind);
    int argumentCountIncludingThis = exec->argumentCountIncludingThis();

    // This ensures enough space for the worst case scenario of zero arguments passed by the caller.
    if (!registerFile->grow(exec->registers() + newCodeBlock->numParameters() + newCodeBlock->m_numCalleeRegisters))
        return 0;

    ASSERT(argumentCountIncludingThis < newCodeBlock->numParameters());

    // Too few arguments -- copy call frame and arguments, then fill in missing arguments with undefined.
    size_t delta = newCodeBlock->numParameters() - argumentCountIncludingThis;
    Register* src = exec->registers();
    Register* dst = exec->registers() + delta;

    int i;
    int end = -ExecState::offsetFor(argumentCountIncludingThis);
    for (i = -1; i >= end; --i)
        dst[i] = src[i];

    end -= delta;
    for ( ; i >= end; --i)
        dst[i] = jsUndefined();

    ExecState* newExec = ExecState::create(dst);
    ASSERT((void*)newExec <= registerFile->end());
    return newExec;
}

ALWAYS_INLINE bool opInstanceOfSlow(ExecState* exec, JSValue value, JSValue baseVal, JSValue proto)
{
    ASSERT(!value.isCell() || !baseVal.isCell() || !proto.isCell()



#include "BytecodeGenerator.h"
#include "CodeBlock.h"
#include "DFGDriver.h"
#include "ExecutionHarness.h"
#include "JIT.h"
#include "JITDriver.h"
#include "Parser.h"

template<typename T>
static void jettisonCodeBlock(JSGlobalData& globalData, OwnPtr<T>& codeBlock)
{
    ASSERT(JITCode::isOptimizingJIT(codeBlock->getJITType()));
    ASSERT(codeBlock->alternative());
    OwnPtr<T> codeBlockToJettison = codeBlock.release();
    codeBlock = static_pointer_cast<T>(codeBlockToJettison->releaseAlternative());

    return error;
}

void EvalExecutable::jitCompile(JSGlobalData& globalData)
{
    bool result = jitCompileIfAppropriate(globalData, m_evalCodeBlock, m_jitCodeForCall, JITCode::bottomTierJIT());
    ASSERT_UNUSED(result, result);
}

inline const char* samplingDescription(JITCode::JITType jitType)
{
    switch (jitType) {
    case JITCode::InterpreterThunk:
        return "Interpreter Compilation (TOTAL)";
    case JITCode::BaselineJIT:
        return "Baseline Compilation (TOTAL)";
    case JITCode::DFGJIT:
        return "DFG Compilation (TOTAL)";
    default:
        ASSERT_NOT_REACHED();
        return 0;
    }
}

JSObject* EvalExecutable::compileInternal(ExecState* exec, ScopeChainNode* scopeChainNode, JITCode::JITType jitType)
{
    SamplingRegion samplingRegion(samplingDescription(jitType));
    
#if !ENABLE(JIT)
    UNUSED_PARAM(jitType);

    }

#if ENABLE(JIT)
    if (!prepareForExecution(*globalData, m_evalCodeBlock, m_jitCodeForCall, jitType))
        return 0;
#endif


    return error;
}

void ProgramExecutable::jitCompile(JSGlobalData& globalData)
{
    bool result = jitCompileIfAppropriate(globalData, m_programCodeBlock, m_jitCodeForCall, JITCode::bottomTierJIT());
    ASSERT_UNUSED(result, result);
}

JSObject* ProgramExecutable::compileInternal(ExecState* exec, ScopeChainNode* scopeChainNode, JITCode::JITType jitType)
{
    SamplingRegion samplingRegion(samplingDescription(jitType));
    
#if !ENABLE(JIT)
    UNUSED_PARAM(jitType);

    }

#if ENABLE(JIT)
    if (!prepareForExecution(*globalData, m_programCodeBlock, m_jitCodeForCall, jitType))
        return 0;
#endif


    while (result->alternative())
        result = static_cast<FunctionCodeBlock*>(result->alternative());
    ASSERT(result);
    ASSERT(JITCode::isBaselineCode(result->getJITType()));
    return result;
}


    return error;
}

void FunctionExecutable::jitCompileForCall(JSGlobalData& globalData)
{
    bool result = jitCompileFunctionIfAppropriate(globalData, m_codeBlockForCall, m_jitCodeForCall, m_jitCodeForCallWithArityCheck, m_symbolTable, JITCode::bottomTierJIT());
    ASSERT_UNUSED(result, result);
}

void FunctionExecutable::jitCompileForConstruct(JSGlobalData& globalData)
{
    bool result = jitCompileFunctionIfAppropriate(globalData, m_codeBlockForConstruct, m_jitCodeForConstruct, m_jitCodeForConstructWithArityCheck, m_symbolTable, JITCode::bottomTierJIT());
    ASSERT_UNUSED(result, result);
}

FunctionCodeBlock* FunctionExecutable::codeBlockWithBytecodeFor(CodeSpecializationKind kind)
{
    FunctionCodeBlock* codeBlock = baselineCodeBlockFor(kind);


JSObject* FunctionExecutable::compileForCallInternal(ExecState* exec, ScopeChainNode* scopeChainNode, JITCode::JITType jitType)
{
    SamplingRegion samplingRegion(samplingDescription(jitType));
    
#if !ENABLE(JIT)
    UNUSED_PARAM(exec);

    m_symbolTable = m_codeBlockForCall->sharedSymbolTable();

#if ENABLE(JIT)
    if (!prepareFunctionForExecution(exec->globalData(), m_codeBlockForCall, m_jitCodeForCall, m_jitCodeForCallWithArityCheck, m_symbolTable, jitType, CodeForCall))
        return 0;
#endif



JSObject* FunctionExecutable::compileForConstructInternal(ExecState* exec, ScopeChainNode* scopeChainNode, JITCode::JITType jitType)
{
    SamplingRegion samplingRegion(samplingDescription(jitType));
    
#if !ENABLE(JIT)
    UNUSED_PARAM(jitType);

    m_symbolTable = m_codeBlockForConstruct->sharedSymbolTable();

#if ENABLE(JIT)
    if (!prepareFunctionForExecution(exec->globalData(), m_codeBlockForConstruct, m_jitCodeForConstruct, m_jitCodeForConstructWithArityCheck, m_symbolTable, jitType, CodeForConstruct))
        return 0;
#endif




#define Executable_h

#include "CallData.h"
#include "CodeSpecializationKind.h"
#include "JSFunction.h"
#include "Interpreter.h"
#include "Nodes.h"

    class Debugger;
    class EvalCodeBlock;
    class FunctionCodeBlock;
    class LLIntOffsetsExtractor;
    class ProgramCodeBlock;
    class ScopeChainNode;

    struct ExceptionInfo;
    
    enum CodeSpecializationKind { CodeForCall, CodeForConstruct };
    enum CompilationKind { FirstCompilation, OptimizingCompilation };

    inline bool isCall(CodeSpecializationKind kind)

    };

    class EvalExecutable : public ScriptExecutable {
        friend class LLIntOffsetsExtractor;
    public:
        typedef ScriptExecutable Base;


        
#if ENABLE(JIT)
        void jettisonOptimizedCode(JSGlobalData&);
        void jitCompile(JSGlobalData&);
#endif

        EvalCodeBlock& generatedBytecode()

    };

    class ProgramExecutable : public ScriptExecutable {
        friend class LLIntOffsetsExtractor;
    public:
        typedef ScriptExecutable Base;


        
#if ENABLE(JIT)
        void jettisonOptimizedCode(JSGlobalData&);
        void jitCompile(JSGlobalData&);
#endif

        ProgramCodeBlock& generatedBytecode()


    class FunctionExecutable : public ScriptExecutable {
        friend class JIT;
        friend class LLIntOffsetsExtractor;
    public:
        typedef ScriptExecutable Base;


        
#if ENABLE(JIT)
        void jettisonOptimizedCodeForCall(JSGlobalData&);
        void jitCompileForCall(JSGlobalData&);
#endif

        bool isGeneratedForCall() const

        
#if ENABLE(JIT)
        void jettisonOptimizedCodeForConstruct(JSGlobalData&);
        void jitCompileForConstruct(JSGlobalData&);
#endif

        bool isGeneratedForConstruct() const

                jettisonOptimizedCodeForConstruct(globalData);
            }
        }
        
        void jitCompileFor(JSGlobalData& globalData, CodeSpecializationKind kind)
        {
            if (kind == CodeForCall) {
                jitCompileForCall(globalData);
                return;
            }
            ASSERT(kind == CodeForConstruct);
            jitCompileForConstruct(globalData);
        }
#endif
        
        bool isGeneratedFor(CodeSpecializationKind kind)



/*
 * Copyright (C) 2012 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 ExecutionHarness_h
#define ExecutionHarness_h

#include <wtf/Platform.h>

#if ENABLE(JIT)

#include "JITDriver.h"
#include "LLIntEntrypoints.h"

namespace JSC {

template<typename CodeBlockType>
inline bool prepareForExecution(JSGlobalData& globalData, OwnPtr<CodeBlockType>& codeBlock, JITCode& jitCode, JITCode::JITType jitType)
{
#if ENABLE(LLINT)
    if (JITCode::isBaselineCode(jitType)) {
        // Start off in the low level interpreter.
        LLInt::getEntrypoint(globalData, codeBlock.get(), jitCode);
        codeBlock->setJITCode(jitCode, MacroAssemblerCodePtr());
        return true;
    }
#endif // ENABLE(LLINT)
    return jitCompileIfAppropriate(globalData, codeBlock, jitCode, jitType);
}

inline bool prepareFunctionForExecution(JSGlobalData& globalData, OwnPtr<FunctionCodeBlock>& codeBlock, JITCode& jitCode, MacroAssemblerCodePtr& jitCodeWithArityCheck, SharedSymbolTable*& symbolTable, JITCode::JITType jitType, CodeSpecializationKind kind)
{
#if ENABLE(LLINT)
    if (JITCode::isBaselineCode(jitType)) {
        // Start off in the low level interpreter.
        LLInt::getFunctionEntrypoint(globalData, kind, jitCode, jitCodeWithArityCheck);
        codeBlock->setJITCode(jitCode, jitCodeWithArityCheck);
        return true;
    }
#else
    UNUSED_PARAM(kind);
#endif // ENABLE(LLINT)
    return jitCompileFunctionIfAppropriate(globalData, codeBlock, jitCode, jitCodeWithArityCheck, symbolTable, jitType);
}

} // namespace JSC

#endif // ENABLE(JIT)

#endif // ExecutionHarness_h


Lines 124-130 namespace JSC { Source/JavaScriptCore/runtime/JSActivation.h_sec1
- Source/JavaScriptCore/runtime/JSActivation.h -1 / +1 lines
124		124
125	OwnArrayPtr<WriteBarrier<Unknown> > registerArray = adoptArrayPtr(new WriteBarrier<Unknown>[registerArraySize]);	125	OwnArrayPtr<WriteBarrier<Unknown> > registerArray = adoptArrayPtr(new WriteBarrier<Unknown>[registerArraySize]);
126	WriteBarrier<Unknown>* registers = registerArray.get() + registerOffset;	126	WriteBarrier<Unknown>* registers = registerArray.get() + registerOffset;
127		127
128	// Copy all arguments that can be captured by name or by the arguments object.	128	// Copy all arguments that can be captured by name or by the arguments object.
129	for (int i = 0; i < m_numCapturedArgs; ++i) {	129	for (int i = 0; i < m_numCapturedArgs; ++i) {
130	int index = CallFrame::argumentOffset(i);	130	int index = CallFrame::argumentOffset(i);



namespace JSC {

    class JSArray;
    class LLIntOffsetsExtractor;

    struct SparseArrayEntry : public WriteBarrier<Unknown> {
        typedef WriteBarrier<Unknown> Base;

    };

    class JSArray : public JSNonFinalObject {
        friend class LLIntOffsetsExtractor;
        friend class Walker;

    protected:

Lines 36-44 Source/JavaScriptCore/runtime/JSCell.h_sec1
- Source/JavaScriptCore/runtime/JSCell.h -1 / +4 lines
36	namespace JSC {	36	namespace JSC {
37		37
38	class JSGlobalObject;	38	class JSGlobalObject;
39	class Structure;	39	class LLIntOffsetsExtractor;
40	class PropertyDescriptor;	40	class PropertyDescriptor;
41	class PropertyNameArray;	41	class PropertyNameArray;
		42	class Structure;
42		43
43	enum EnumerationMode {	44	enum EnumerationMode {
44	ExcludeDontEnumProperties,	45	ExcludeDontEnumProperties,
Lines 164-169 namespace JSC { Source/JavaScriptCore/runtime/JSCell.h_sec2
164	static bool getOwnPropertyDescriptor(JSObject, ExecState, const Identifier&, PropertyDescriptor&);	165	static bool getOwnPropertyDescriptor(JSObject, ExecState, const Identifier&, PropertyDescriptor&);
165		166
166	private:	167	private:
		168	friend class LLIntOffsetsExtractor;
		169
167	const ClassInfo* m_classInfo;	170	const ClassInfo* m_classInfo;
168	WriteBarrier<Structure> m_structure;	171	WriteBarrier<Structure> m_structure;
169	};	172	};

Lines 33-38 namespace JSC { Source/JavaScriptCore/runtime/JSFunction.h_sec1
- Source/JavaScriptCore/runtime/JSFunction.h +3 lines
33	class FunctionPrototype;	33	class FunctionPrototype;
34	class JSActivation;	34	class JSActivation;
35	class JSGlobalObject;	35	class JSGlobalObject;
		36	class LLIntOffsetsExtractor;
36	class NativeExecutable;	37	class NativeExecutable;
37	class SourceCode;	38	class SourceCode;
38	namespace DFG {	39	namespace DFG {
Lines 140-145 namespace JSC { Source/JavaScriptCore/runtime/JSFunction.h_sec2
140	static void visitChildren(JSCell*, SlotVisitor&);	141	static void visitChildren(JSCell*, SlotVisitor&);
141		142
142	private:	143	private:
		144	friend class LLIntOffsetsExtractor;
		145
143	JS_EXPORT_PRIVATE bool isHostFunctionNonInline() const;	146	JS_EXPORT_PRIVATE bool isHostFunctionNonInline() const;
144		147
145	static JSValue argumentsGetter(ExecState*, JSValue, const Identifier&);	148	static JSValue argumentsGetter(ExecState*, JSValue, const Identifier&);

Lines 141-146 JSGlobalData::JSGlobalData(GlobalDataTyp Source/JavaScriptCore/runtime/JSGlobalData.cpp_sec1
- Source/JavaScriptCore/runtime/JSGlobalData.cpp -1 / +3 lines
141	, keywords(adoptPtr(new Keywords(this)))	141	, keywords(adoptPtr(new Keywords(this)))
142	, interpreter(0)	142	, interpreter(0)
143	, heap(this, heapSize)	143	, heap(this, heapSize)
		144	, jsArrayClassInfo(&JSArray::s_info)
		145	, jsFinalObjectClassInfo(&JSFinalObject::s_info)
144	#if ENABLE(DFG_JIT)	146	#if ENABLE(DFG_JIT)
145	, sizeOfLastScratchBuffer(0)	147	, sizeOfLastScratchBuffer(0)
146	#endif	148	#endif
Lines 216-222 JSGlobalData::JSGlobalData(GlobalDataTyp Source/JavaScriptCore/runtime/JSGlobalData.cpp_sec2
216	jitStubs = adoptPtr(new JITThunks(this));	218	jitStubs = adoptPtr(new JITThunks(this));
217	#endif	219	#endif
218		220
219	interpreter->initialize(this->canUseJIT());	221	interpreter->initialize(&llintData, this->canUseJIT());
220		222
221	heap.notifyIsSafeToCollect();	223	heap.notifyIsSafeToCollect();
222	}	224	}



#define JSGlobalData_h

#include "CachedTranscendentalFunction.h"
#include "Intrinsic.h"
#include "DateInstanceCache.h"
#include "ExecutableAllocator.h"
#include "Heap.h"
#include "Intrinsic.h"
#include "JITStubs.h"
#include "JSValue.h"
#include "LLIntData.h"
#include "NumericStrings.h"
#include "SmallStrings.h"
#include "Strong.h"
#include "Terminator.h"
#include "TimeoutChecker.h"
#include "WeakRandom.h"

    class JSGlobalObject;
    class JSObject;
    class Keywords;
    class LLIntOffsetsExtractor;
    class NativeExecutable;
    class ParserArena;
    class RegExpCache;

        Heap heap;

        JSValue exception;

        const ClassInfo* const jsArrayClassInfo;
        const ClassInfo* const jsFinalObjectClassInfo;

        LLInt::Data llintData;

#if ENABLE(JIT)
        ReturnAddressPtr exceptionLocation;
        JSValue hostCallReturnValue;

#undef registerTypedArrayFunction

    private:
        friend class LLIntOffsetsExtractor;
        
        JSGlobalData(GlobalDataType, ThreadStackType, HeapSize);
        static JSGlobalData*& sharedInstanceInternal();
        void createNativeThunk();

Lines 44-49 namespace JSC { Source/JavaScriptCore/runtime/JSGlobalObject.h_sec1
- Source/JavaScriptCore/runtime/JSGlobalObject.h +3 lines
44	class FunctionPrototype;	44	class FunctionPrototype;
45	class GetterSetter;	45	class GetterSetter;
46	class GlobalCodeBlock;	46	class GlobalCodeBlock;
		47	class LLIntOffsetsExtractor;
47	class NativeErrorConstructor;	48	class NativeErrorConstructor;
48	class ProgramCodeBlock;	49	class ProgramCodeBlock;
49	class RegExpConstructor;	50	class RegExpConstructor;
Lines 335-340 namespace JSC { Source/JavaScriptCore/runtime/JSGlobalObject.h_sec2
335	JS_EXPORT_PRIVATE void addStaticGlobals(GlobalPropertyInfo*, int count);	336	JS_EXPORT_PRIVATE void addStaticGlobals(GlobalPropertyInfo*, int count);
336		337
337	private:	338	private:
		339	friend class LLIntOffsetsExtractor;
		340
338	// FIXME: Fold reset into init.	341	// FIXME: Fold reset into init.
339	JS_EXPORT_PRIVATE void init(JSObject* thisValue);	342	JS_EXPORT_PRIVATE void init(JSObject* thisValue);
340	void reset(JSValue prototype);	343	void reset(JSValue prototype);

Lines 49-54 namespace JSC { Source/JavaScriptCore/runtime/JSObject.h_sec1
- Source/JavaScriptCore/runtime/JSObject.h +5 lines
49	class GetterSetter;	49	class GetterSetter;
50	class HashEntry;	50	class HashEntry;
51	class InternalFunction;	51	class InternalFunction;
		52	class LLIntOffsetsExtractor;
52	class MarkedBlock;	53	class MarkedBlock;
53	class PropertyDescriptor;	54	class PropertyDescriptor;
54	class PropertyNameArray;	55	class PropertyNameArray;
Lines 269-274 namespace JSC { Source/JavaScriptCore/runtime/JSObject.h_sec2
269	JSObject(JSGlobalData&, Structure*, PropertyStorage inlineStorage);	270	JSObject(JSGlobalData&, Structure*, PropertyStorage inlineStorage);
270		271
271	private:	272	private:
		273	friend class LLIntOffsetsExtractor;
		274
272	// Nobody should ever ask any of these questions on something already known to be a JSObject.	275	// Nobody should ever ask any of these questions on something already known to be a JSObject.
273	using JSCell::isAPIValueWrapper;	276	using JSCell::isAPIValueWrapper;
274	using JSCell::isGetterSetter;	277	using JSCell::isGetterSetter;
Lines 381-386 COMPILE_ASSERT((JSFinalObject_inlineStor Source/JavaScriptCore/runtime/JSObject.h_sec3
381	static void destroy(JSCell*);	384	static void destroy(JSCell*);
382		385
383	private:	386	private:
		387	friend class LLIntOffsetsExtractor;
		388
384	explicit JSFinalObject(JSGlobalData& globalData, Structure* structure)	389	explicit JSFinalObject(JSGlobalData& globalData, Structure* structure)
385	: JSObject(globalData, structure, m_inlineStorage)	390	: JSObject(globalData, structure, m_inlineStorage)
386	{	391	{

Lines 38-43 namespace JSC { Source/JavaScriptCore/runtime/JSPropertyNameIterator.h_sec1
- Source/JavaScriptCore/runtime/JSPropertyNameIterator.h +3 lines
38		38
39	class Identifier;	39	class Identifier;
40	class JSObject;	40	class JSObject;
		41	class LLIntOffsetsExtractor;
41		42
42	class JSPropertyNameIterator : public JSCell {	43	class JSPropertyNameIterator : public JSCell {
43	friend class JIT;	44	friend class JIT;
Lines 96-101 namespace JSC { Source/JavaScriptCore/runtime/JSPropertyNameIterator.h_sec2
96	}	97	}
97		98
98	private:	99	private:
		100	friend class LLIntOffsetsExtractor;
		101
99	JSPropertyNameIterator(ExecState, PropertyNameArrayData propertyNameArrayData, size_t numCacheableSlot);	102	JSPropertyNameIterator(ExecState, PropertyNameArrayData propertyNameArrayData, size_t numCacheableSlot);
100		103
101	WriteBarrier<Structure> m_cachedStructure;	104	WriteBarrier<Structure> m_cachedStructure;

Lines 32-37 Source/JavaScriptCore/runtime/JSString.h_sec1
- Source/JavaScriptCore/runtime/JSString.h +3 lines
32	namespace JSC {	32	namespace JSC {
33		33
34	class JSString;	34	class JSString;
		35	class LLIntOffsetsExtractor;
35		36
36	JSString* jsEmptyString(JSGlobalData*);	37	JSString* jsEmptyString(JSGlobalData*);
37	JSString* jsEmptyString(ExecState*);	38	JSString* jsEmptyString(ExecState*);
Lines 240-245 namespace JSC { Source/JavaScriptCore/runtime/JSString.h_sec2
240	static void visitChildren(JSCell*, SlotVisitor&);	241	static void visitChildren(JSCell*, SlotVisitor&);
241		242
242	private:	243	private:
		244	friend class LLIntOffsetsExtractor;
		245
243	JS_EXPORT_PRIVATE void resolveRope(ExecState*) const;	246	JS_EXPORT_PRIVATE void resolveRope(ExecState*) const;
244	void resolveRopeSlowCase8(LChar*) const;	247	void resolveRopeSlowCase8(LChar*) const;
245	void resolveRopeSlowCase(UChar*) const;	248	void resolveRopeSlowCase(UChar*) const;

Lines 34-39 Source/JavaScriptCore/runtime/JSTypeInfo.h_sec1
- Source/JavaScriptCore/runtime/JSTypeInfo.h +4 lines
34		34
35	namespace JSC {	35	namespace JSC {
36		36
		37	class LLIntOffsetsExtractor;
		38
37	static const unsigned MasqueradesAsUndefined = 1; // WebCore uses MasqueradesAsUndefined to make document.all undetectable.	39	static const unsigned MasqueradesAsUndefined = 1; // WebCore uses MasqueradesAsUndefined to make document.all undetectable.
38	static const unsigned ImplementsHasInstance = 1 << 1;	40	static const unsigned ImplementsHasInstance = 1 << 1;
39	static const unsigned OverridesHasInstance = 1 << 2;	41	static const unsigned OverridesHasInstance = 1 << 2;
Lines 87-92 namespace JSC { Source/JavaScriptCore/runtime/JSTypeInfo.h_sec2
87	}	89	}
88		90
89	private:	91	private:
		92	friend class LLIntOffsetsExtractor;
		93
90	bool isSetOnFlags1(unsigned flag) const { ASSERT(flag <= (1 << 7)); return m_flags & flag; }	94	bool isSetOnFlags1(unsigned flag) const { ASSERT(flag <= (1 << 7)); return m_flags & flag; }
91	bool isSetOnFlags2(unsigned flag) const { ASSERT(flag >= (1 << 8)); return m_flags2 & (flag >> 8); }	95	bool isSetOnFlags2(unsigned flag) const { ASSERT(flag >= (1 << 8)); return m_flags2 & (flag >> 8); }
92		96



    return JSNotAnObject::create(exec);
}

#ifndef NDEBUG
char* JSValue::description()
{
    static const size_t size = 128;
    static char description[size];

    if (!*this)

        snprintf(description, size, "Int32: %d", asInt32());
    else if (isDouble()) {
#if USE(JSVALUE64)
        snprintf(description, size, "Double: %lx, %lf", reinterpretDoubleToIntptr(asDouble()), asDouble());
#else
        union {
            double asDouble;
            uint32_t asTwoInt32s[2];
        } u;
        u.asDouble = asDouble();
        snprintf(description, size, "Double: %08x:%08x, %lf", u.asTwoInt32s[1], u.asTwoInt32s[0], asDouble());
#endif
    } else if (isCell())
        snprintf(description, size, "Cell: %p", asCell());


    return description;
}
#endif

// This in the ToInt32 operation is defined in section 9.5 of the ECMA-262 spec.
// Note that this operation is identical to ToUInt32 other than to interpretation



        JSCell* asCell() const;
        JS_EXPORT_PRIVATE bool isValidCallee();

#ifndef NDEBUG
        char* description();
#endif

    private:
        template <class T> JSValue(WriteBarrierBase<T>);




namespace JSC {

    class LLIntOffsetsExtractor;
    class Register;

    class JSVariableObject : public JSNonFinalObject {
        friend class JIT;
        friend class LLIntOffsetsExtractor;

    public:
        typedef JSNonFinalObject Base;

Lines 52-57 unsigned maximumFunctionForConstructInli Source/JavaScriptCore/runtime/Options.cpp_sec1
- Source/JavaScriptCore/runtime/Options.cpp +10 lines
52		52
53	unsigned maximumInliningDepth;	53	unsigned maximumInliningDepth;
54		54
		55	int32_t executionCounterValueForJITAfterWarmUp;
		56	int32_t executionCounterValueForDontJITAnytimeSoon;
		57	int32_t executionCounterValueForJITSoon;
		58
55	int32_t executionCounterValueForOptimizeAfterWarmUp;	59	int32_t executionCounterValueForOptimizeAfterWarmUp;
56	int32_t executionCounterValueForOptimizeAfterLongWarmUp;	60	int32_t executionCounterValueForOptimizeAfterLongWarmUp;
57	int32_t executionCounterValueForDontOptimizeAnytimeSoon;	61	int32_t executionCounterValueForDontOptimizeAnytimeSoon;
Lines 137-142 void initializeOptions() Source/JavaScriptCore/runtime/Options.cpp_sec2
137		141
138	SET(maximumInliningDepth, 5);	142	SET(maximumInliningDepth, 5);
139		143
		144	SET(executionCounterValueForJITAfterWarmUp, -100);
		145	SET(executionCounterValueForDontJITAnytimeSoon, std::numeric_limits<int32_t>::min());
		146	SET(executionCounterValueForJITSoon, -100);
		147
140	SET(executionCounterValueForOptimizeAfterWarmUp, -1000);	148	SET(executionCounterValueForOptimizeAfterWarmUp, -1000);
141	SET(executionCounterValueForOptimizeAfterLongWarmUp, -5000);	149	SET(executionCounterValueForOptimizeAfterLongWarmUp, -5000);
142	SET(executionCounterValueForDontOptimizeAnytimeSoon, std::numeric_limits<int32_t>::min());	150	SET(executionCounterValueForDontOptimizeAnytimeSoon, std::numeric_limits<int32_t>::min());
Lines 185-190 void initializeOptions() Source/JavaScriptCore/runtime/Options.cpp_sec3
185	if (cpusToUse < 1)	193	if (cpusToUse < 1)
186	cpusToUse = 1;	194	cpusToUse = 1;
187		195
		196	cpusToUse = 1;
		197
188	SET(numberOfGCMarkers, cpusToUse);	198	SET(numberOfGCMarkers, cpusToUse);
189		199
190	ASSERT(executionCounterValueForDontOptimizeAnytimeSoon <= executionCounterValueForOptimizeAfterLongWarmUp);	200	ASSERT(executionCounterValueForDontOptimizeAnytimeSoon <= executionCounterValueForOptimizeAfterLongWarmUp);

Lines 37-42 extern unsigned maximumFunctionForConstr Source/JavaScriptCore/runtime/Options.h_sec1
- Source/JavaScriptCore/runtime/Options.h +4 lines
37		37
38	extern unsigned maximumInliningDepth; // Depth of inline stack, so 1 = no inlining, 2 = one level, etc.	38	extern unsigned maximumInliningDepth; // Depth of inline stack, so 1 = no inlining, 2 = one level, etc.
39		39
		40	extern int32_t executionCounterValueForJITAfterWarmUp;
		41	extern int32_t executionCounterValueForDontJITAnytimeSoon;
		42	extern int32_t executionCounterValueForJITSoon;
		43
40	extern int32_t executionCounterValueForOptimizeAfterWarmUp;	44	extern int32_t executionCounterValueForOptimizeAfterWarmUp;
41	extern int32_t executionCounterValueForOptimizeAfterLongWarmUp;	45	extern int32_t executionCounterValueForOptimizeAfterLongWarmUp;
42	extern int32_t executionCounterValueForDontOptimizeAnytimeSoon;	46	extern int32_t executionCounterValueForDontOptimizeAnytimeSoon;

Lines 30-35 namespace JSC { Source/JavaScriptCore/runtime/ScopeChain.h_sec1
- Source/JavaScriptCore/runtime/ScopeChain.h +3 lines
30	class JSGlobalData;	30	class JSGlobalData;
31	class JSGlobalObject;	31	class JSGlobalObject;
32	class JSObject;	32	class JSObject;
		33	class LLIntOffsetsExtractor;
33	class ScopeChainIterator;	34	class ScopeChainIterator;
34	class SlotVisitor;	35	class SlotVisitor;
35		36
Lines 91-96 namespace JSC { Source/JavaScriptCore/runtime/ScopeChain.h_sec2
91	static JS_EXPORTDATA const ClassInfo s_info;	92	static JS_EXPORTDATA const ClassInfo s_info;
92		93
93	private:	94	private:
		95	friend class LLIntOffsetsExtractor;
		96
94	static const unsigned StructureFlags = OverridesVisitChildren;	97	static const unsigned StructureFlags = OverridesVisitChildren;
95	};	98	};
96		99

Lines 45-50 Source/JavaScriptCore/runtime/Structure.h_sec1
- Source/JavaScriptCore/runtime/Structure.h +3 lines
45		45
46	namespace JSC {	46	namespace JSC {
47		47
		48	class LLIntOffsetsExtractor;
48	class PropertyNameArray;	49	class PropertyNameArray;
49	class PropertyNameArrayData;	50	class PropertyNameArrayData;
50	class StructureChain;	51	class StructureChain;
Lines 196-201 namespace JSC { Source/JavaScriptCore/runtime/Structure.h_sec2
196	static JS_EXPORTDATA const ClassInfo s_info;	197	static JS_EXPORTDATA const ClassInfo s_info;
197		198
198	private:	199	private:
		200	friend class LLIntOffsetsExtractor;
		201
199	JS_EXPORT_PRIVATE Structure(JSGlobalData&, JSGlobalObject, JSValue prototype, const TypeInfo&, const ClassInfo);	202	JS_EXPORT_PRIVATE Structure(JSGlobalData&, JSGlobalObject, JSValue prototype, const TypeInfo&, const ClassInfo);
200	Structure(JSGlobalData&);	203	Structure(JSGlobalData&);
201	Structure(JSGlobalData&, const Structure*);	204	Structure(JSGlobalData&, const Structure*);

Lines 37-42 Source/JavaScriptCore/runtime/StructureChain.h_sec1
- Source/JavaScriptCore/runtime/StructureChain.h +3 lines
37		37
38	namespace JSC {	38	namespace JSC {
39		39
		40	class LLIntOffsetsExtractor;
40	class Structure;	41	class Structure;
41		42
42	class StructureChain : public JSCell {	43	class StructureChain : public JSCell {
Lines 74-79 namespace JSC { Source/JavaScriptCore/runtime/StructureChain.h_sec2
74	}	75	}
75		76
76	private:	77	private:
		78	friend class LLIntOffsetsExtractor;
		79
77	StructureChain(JSGlobalData&, Structure*);	80	StructureChain(JSGlobalData&, Structure*);
78	static void destroy(JSCell*);	81	static void destroy(JSCell*);
79	OwnArrayPtr<WriteBarrier<Structure> > m_vector;	82	OwnArrayPtr<WriteBarrier<Structure> > m_vector;



#define ENABLE_JIT 1
#endif

/* On some of the platforms where we have a JIT, we want to also have the 
   low-level interpreter. */
#if !defined(ENABLE_LLINT) && ENABLE(JIT) && PLATFORM(MAC) && USE(JSVALUE32_64)
#define ENABLE_LLINT 1
#endif

/* If we have LLInt enabled and the JIT enabled, we also enable OSRing from
   LLInt to the JIT. */
#if !defined(ENABLE_LLINT_OSR_TO_JIT) && ENABLE(JIT) && ENABLE(LLINT)
#define ENABLE_LLINT_OSR_TO_JIT 1
#endif

#if !defined(ENABLE_DFG_JIT) && ENABLE(JIT)
/* Enable the DFG JIT on X86 and X86_64.  Only tested on Mac and GNU/Linux. */
#if (CPU(X86) || CPU(X86_64)) && (PLATFORM(MAC) || OS(LINUX))

Lines 86-91 public: Source/JavaScriptCore/wtf/SentinelLinkedList.h_sec1
- Source/JavaScriptCore/wtf/SentinelLinkedList.h +2 lines
86		86
87	iterator begin();	87	iterator begin();
88	iterator end();	88	iterator end();
		89
		90	bool isEmpty() { return begin() == end(); }
89		91
90	private:	92	private:
91	RawNode m_headSentinel;	93	RawNode m_headSentinel;



// Landing the file moves in one patch, will follow on with patches to change the namespaces.
namespace JSC {
struct IdentifierCStringTranslator;
class LLIntOffsetsExtractor;
template <typename T> struct IdentifierCharBufferTranslator;
struct IdentifierLCharFromUCharTranslator;
}

    friend struct WTF::SubstringTranslator;
    friend struct WTF::UCharBufferTranslator;
    friend class AtomicStringImpl;
    friend class JSC::LLIntOffsetsExtractor;
    
private:
    enum BufferOwnership {
        BufferInternal,



2012-01-26  Filip Pizlo  <fpizlo@apple.com>

        JSC should be a triple-tier VM
        https://bugs.webkit.org/show_bug.cgi?id=75812
        <rdar://problem/10079694>

        Reviewed by NOBODY (OOPS!).

        Changed EFL's build system to include a new directory in JavaScriptCore.
        
        No new tests because no behavior changed.

        * CMakeLists.txt:

2012-01-26  Cris Neckar  <cdn@chromium.org>

        The registration of schemes is currently racey as they are not registered from the main thread. 

Lines 74-79 SET(WebCore_INCLUDE_DIRECTORIES Source/WebCore/CMakeLists.txt_sec1
- Source/WebCore/CMakeLists.txt +1 lines
74	"${JAVASCRIPTCORE_DIR}/debugger"	74	"${JAVASCRIPTCORE_DIR}/debugger"
75	"${JAVASCRIPTCORE_DIR}/interpreter"	75	"${JAVASCRIPTCORE_DIR}/interpreter"
76	"${JAVASCRIPTCORE_DIR}/jit"	76	"${JAVASCRIPTCORE_DIR}/jit"
		77	"${JAVASCRIPTCORE_DIR}/llint"
77	"${JAVASCRIPTCORE_DIR}/parser"	78	"${JAVASCRIPTCORE_DIR}/parser"
78	"${JAVASCRIPTCORE_DIR}/profiler"	79	"${JAVASCRIPTCORE_DIR}/profiler"
79	"${JAVASCRIPTCORE_DIR}/runtime"	80	"${JAVASCRIPTCORE_DIR}/runtime"



2012-01-26  Filip Pizlo  <fpizlo@apple.com>

        JSC should be a triple-tier VM
        https://bugs.webkit.org/show_bug.cgi?id=75812
        <rdar://problem/10079694>

        Reviewed by NOBODY (OOPS!).

        Changed EFL's build system to include a new directory in JavaScriptCore.
        
        * CMakeLists.txt:

2012-01-11  Jacky Jiang  <zhajiang@rim.com>

        [BlackBerry] ASSERT failure in BackingStorePrivate::blitVisibleContents()

Lines 44-49 SET(WebKit_INCLUDE_DIRECTORIES Source/WebKit/CMakeLists.txt_sec1
- Source/WebKit/CMakeLists.txt +1 lines
44	"${JAVASCRIPTCORE_DIR}/debugger"	44	"${JAVASCRIPTCORE_DIR}/debugger"
45	"${JAVASCRIPTCORE_DIR}/interpreter"	45	"${JAVASCRIPTCORE_DIR}/interpreter"
46	"${JAVASCRIPTCORE_DIR}/jit"	46	"${JAVASCRIPTCORE_DIR}/jit"
		47	"${JAVASCRIPTCORE_DIR}/llint"
47	"${JAVASCRIPTCORE_DIR}/parser"	48	"${JAVASCRIPTCORE_DIR}/parser"
48	"${JAVASCRIPTCORE_DIR}/profiler"	49	"${JAVASCRIPTCORE_DIR}/profiler"
49	"${JAVASCRIPTCORE_DIR}/runtime"	50	"${JAVASCRIPTCORE_DIR}/runtime"

Return to Bug 75812

Lines 1928-1934 DEFINE_STUB_FUNCTION(void, optimize_from Source/JavaScriptCore/jit/JITStubs.cpp_sec1
- Source/JavaScriptCore/jit/JITStubs.cpp -35 / +3 lines
1928	unsigned bytecodeIndex = stackFrame.args[0].int32();	1928	unsigned bytecodeIndex = stackFrame.args[0].int32();
1929		1929
1930	#if ENABLE(JIT_VERBOSE_OSR)	1930	#if ENABLE(JIT_VERBOSE_OSR)
1931	printf("Entered optimize_from_loop with executeCounter = %d, reoptimizationRetryCounter = %u, optimizationDelayCounter = %u\n", codeBlock->jitExecuteCounter(), codeBlock->reoptimizationRetryCounter(), codeBlock->optimizationDelayCounter());	1931	printf("%p: Entered optimize_from_loop with executeCounter = %d, reoptimizationRetryCounter = %u, optimizationDelayCounter = %u\n", codeBlock, codeBlock->jitExecuteCounter(), codeBlock->reoptimizationRetryCounter(), codeBlock->optimizationDelayCounter());
1932	#endif	1932	#endif
1933		1933
1934	if (codeBlock->hasOptimizedReplacement()) {	1934	if (codeBlock->hasOptimizedReplacement()) {
Lines 2183-2227 DEFINE_STUB_FUNCTION(void*, op_construct Source/JavaScriptCore/jit/JITStubs.cpp_sec2
2183	return result;	2183	return result;
2184	}	2184	}
2185		2185
2186	inline CallFrame* arityCheckFor(CallFrame* callFrame, RegisterFile* registerFile, CodeSpecializationKind kind)
2187	{
2188	JSFunction* callee = asFunction(callFrame->callee());
2189	ASSERT(!callee->isHostFunction());
2190	CodeBlock* newCodeBlock = &callee->jsExecutable()->generatedBytecodeFor(kind);
2191	int argumentCountIncludingThis = callFrame->argumentCountIncludingThis();
2192
2193	// This ensures enough space for the worst case scenario of zero arguments passed by the caller.
2194	if (!registerFile->grow(callFrame->registers() + newCodeBlock->numParameters() + newCodeBlock->m_numCalleeRegisters))
2195	return 0;
2196
2197	ASSERT(argumentCountIncludingThis < newCodeBlock->numParameters());
2198
2199	// Too few arguments -- copy call frame and arguments, then fill in missing arguments with undefined.
2200	size_t delta = newCodeBlock->numParameters() - argumentCountIncludingThis;
2201	Register* src = callFrame->registers();
2202	Register* dst = callFrame->registers() + delta;
2203
2204	int i;
2205	int end = -CallFrame::offsetFor(argumentCountIncludingThis);
2206	for (i = -1; i >= end; --i)
2207	dst[i] = src[i];
2208
2209	end -= delta;
2210	for ( ; i >= end; --i)
2211	dst[i] = jsUndefined();
2212
2213	CallFrame* newCallFrame = CallFrame::create(dst);
2214	ASSERT((void*)newCallFrame <= registerFile->end());
2215	return newCallFrame;
2216	}
2217
2218	DEFINE_STUB_FUNCTION(void*, op_call_arityCheck)	2186	DEFINE_STUB_FUNCTION(void*, op_call_arityCheck)
2219	{	2187	{
2220	STUB_INIT_STACK_FRAME(stackFrame);	2188	STUB_INIT_STACK_FRAME(stackFrame);
2221		2189
2222	CallFrame* callFrame = stackFrame.callFrame;	2190	CallFrame* callFrame = stackFrame.callFrame;
2223		2191
2224	CallFrame* newCallFrame = arityCheckFor(callFrame, stackFrame.registerFile, CodeForCall);	2192	CallFrame* newCallFrame = CommonSlowPaths::arityCheckFor(callFrame, stackFrame.registerFile, CodeForCall);
2225	if (!newCallFrame)	2193	if (!newCallFrame)
2226	return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));	2194	return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));
2227		2195
Lines 2234-2240 DEFINE_STUB_FUNCTION(void*, op_construct Source/JavaScriptCore/jit/JITStubs.cpp_sec3
2234		2202
2235	CallFrame* callFrame = stackFrame.callFrame;	2203	CallFrame* callFrame = stackFrame.callFrame;
2236		2204
2237	CallFrame* newCallFrame = arityCheckFor(callFrame, stackFrame.registerFile, CodeForConstruct);	2205	CallFrame* newCallFrame = CommonSlowPaths::arityCheckFor(callFrame, stackFrame.registerFile, CodeForConstruct);
2238	if (!newCallFrame)	2206	if (!newCallFrame)
2239	return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));	2207	return throwExceptionFromOpCall<void*>(stackFrame, callFrame, STUB_RETURN_ADDRESS, createStackOverflowError(callFrame->callerFrame()));
2240		2208

Lines 1-3 Source/JavaScriptCore/ChangeLog_sec1
- Source/JavaScriptCore/ChangeLog +394 lines
		1	2012-01-26 Filip Pizlo <fpizlo@apple.com>
		2
		3	JSC should be a triple-tier VM
		4	https://bugs.webkit.org/show_bug.cgi?id=75812
		5	<rdar://problem/10079694>
		6
		7	Reviewed by NOBODY (OOPS!).
		8
		9	Implemented an interpreter that uses the JIT's calling convention. This
		10	interpreter is called LLInt, or the Low Level Interpreter. JSC will now
		11	will start by executing code in LLInt and will only tier up to the old
		12	JIT after the code is proven hot.
		13
		14	LLInt is written in a modified form of our macro assembly. This new macro
		15	assembly is compiled by an offline assembler (see offlineasm), which
		16	implements many modern conveniences such as a Turing-complete CPS-based
		17	macro language and direct access to relevant C++ type information
		18	(basically offsets of fields and sizes of structs/classes).
		19
		20	Code executing in LLInt appears to the rest of the JSC world "as if" it
		21	were executing in the old JIT. Hence, things like exception handling and
		22	cross-execution-engine calls just work and require pretty much no
		23	additional overhead.
		24
		25	This interpreter is 2-2.5x faster than our old interpreter on SunSpider,
		26	V8, and Kraken. With triple-tiering turned on, we're neutral on SunSpider,
		27	V8, and Kraken, but appear to get a double-digit improvement on real-world
		28	websites due to a huge reduction in the amount of JIT'ing.
		29
		30	As an additional change, this patch makes bytecode dumping and JSValue
		31	dumping work in release builds, since debugging some of the nastier
		32	aspects of this patch would have been impossible without that. And I
		33	don't believe that we care about the miniscule code bloat that this
		34	introduces.
		35
		36	* CMakeLists.txt:
		37	* GNUmakefile.am:
		38	* GNUmakefile.list.am:
		39	* JavaScriptCore.pri:
		40	* JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCore.vcproj:
		41	* JavaScriptCore.vcproj/JavaScriptCore/JavaScriptCoreCommon.vsprops:
		42	* JavaScriptCore.xcodeproj/project.pbxproj:
		43	* Target.pri:
		44	* assembler/LinkBuffer.h:
		45	* bytecode/BytecodeConventions.h: Added.
		46	* bytecode/CallLinkStatus.cpp:
		47	(JSC::CallLinkStatus::computeFromLLInt):
		48	(JSC):
		49	(JSC::CallLinkStatus::computeFor):
		50	* bytecode/CallLinkStatus.h:
		51	(JSC::CallLinkStatus::isSet):
		52	(JSC::CallLinkStatus::operator!):
		53	(CallLinkStatus):
		54	* bytecode/CodeBlock.cpp:
		55	(JSC):
		56	(JSC::escapeQuotes):
		57	(JSC::CodeBlock::dump):
		58	(JSC::CodeBlock::CodeBlock):
		59	(JSC::CodeBlock::~CodeBlock):
		60	(JSC::CodeBlock::finalizeUnconditionally):
		61	(JSC::CodeBlock::stronglyVisitStrongReferences):
		62	(JSC::CodeBlock::unlinkCalls):
		63	(JSC::CodeBlock::unlinkIncomingCalls):
		64	(JSC::CodeBlock::bytecodeOffset):
65	(JSC::ProgramCodeBlock::jettison):
66	(JSC::EvalCodeBlock::jettison):
67	(JSC::FunctionCodeBlock::jettison):
68	(JSC::ProgramCodeBlock::jitCompileImpl):
69	(JSC::EvalCodeBlock::jitCompileImpl):
70	(JSC::FunctionCodeBlock::jitCompileImpl):
71	(JSC::CodeBlock::handleBytecodeDiscardingOpportunity):
72	(JSC::CodeBlock::usesOpcode):
73	* bytecode/CodeBlock.h:
74	(JSC):
75	(CodeBlock):
76	():
77	(JSC::CodeBlock::baselineVersion):
78	(JSC::CodeBlock::linkIncomingCall):
79	(JSC::CodeBlock::bytecodeOffset):
80	(JSC::CodeBlock::jitCompile):
81	(JSC::CodeBlock::hasOptimizedReplacement):
82	(JSC::CodeBlock::addPropertyAccessInstruction):
83	(JSC::CodeBlock::addGlobalResolveInstruction):
84	(JSC::CodeBlock::addLLIntCallLinkInfo):
85	(JSC::CodeBlock::addGlobalResolveInfo):
86	(JSC::CodeBlock::numberOfMethodCallLinkInfos):
87	(JSC::CodeBlock::valueProfilePredictionForBytecodeOffset):
88	(JSC::CodeBlock::likelyToTakeSlowCase):
89	(JSC::CodeBlock::couldTakeSlowCase):
90	(JSC::CodeBlock::likelyToTakeSpecialFastCase):
91	(JSC::CodeBlock::likelyToTakeDeepestSlowCase):
92	(JSC::CodeBlock::likelyToTakeAnySlowCase):
93	(JSC::CodeBlock::addFrequentExitSite):
94	(JSC::CodeBlock::dontJITAnytimeSoon):
95	(JSC::CodeBlock::jitAfterWarmUp):
96	(JSC::CodeBlock::jitSoon):
97	(JSC::CodeBlock::llintExecuteCounter):
98	(ProgramCodeBlock):
99	(EvalCodeBlock):
100	(FunctionCodeBlock):
101	* bytecode/GetByIdStatus.cpp:
102	(JSC::GetByIdStatus::computeFromLLInt):
103	(JSC):
104	(JSC::GetByIdStatus::computeFor):
105	* bytecode/GetByIdStatus.h:
106	(JSC::GetByIdStatus::GetByIdStatus):
107	(JSC::GetByIdStatus::wasSeenInJIT):
108	(GetByIdStatus):
109	* bytecode/Instruction.h:
110	(JSC):
111	(JSC::Instruction::Instruction):
112	(Instruction):
113	():
114	* bytecode/LLIntCallLinkInfo.h: Added.
115	(JSC):
116	(JSC::LLIntCallLinkInfo::LLIntCallLinkInfo):
117	(LLIntCallLinkInfo):
118	(JSC::LLIntCallLinkInfo::~LLIntCallLinkInfo):
119	(JSC::LLIntCallLinkInfo::isLinked):
120	(JSC::LLIntCallLinkInfo::unlink):
121	* bytecode/MethodCallLinkStatus.cpp:
122	(JSC::MethodCallLinkStatus::computeFor):
123	* bytecode/Opcode.h:
124	(JSC):
125	():
126	* bytecode/PutByIdStatus.cpp:
127	(JSC::PutByIdStatus::computeFromLLInt):
128	(JSC):
129	(JSC::PutByIdStatus::computeFor):
130	* bytecode/PutByIdStatus.h:
131	(PutByIdStatus):
132	* bytecompiler/BytecodeGenerator.cpp:
133	(JSC):
134	(JSC::BytecodeGenerator::setDumpsGeneratedCode):
135	(JSC::BytecodeGenerator::dumpsGeneratedCode):
136	(JSC::BytecodeGenerator::generate):
137	(JSC::BytecodeGenerator::emitResolve):
138	(JSC::BytecodeGenerator::emitResolveWithBase):
139	(JSC::BytecodeGenerator::emitResolveWithThis):
140	(JSC::BytecodeGenerator::emitGetById):
141	(JSC::BytecodeGenerator::emitPutById):
142	(JSC::BytecodeGenerator::emitDirectPutById):
143	(JSC::BytecodeGenerator::emitCall):
144	(JSC::BytecodeGenerator::emitConstruct):
145	(JSC::BytecodeGenerator::emitCatch):
146	* dfg/DFGByteCodeParser.cpp:
147	(JSC::DFG::ByteCodeParser::getPredictionWithoutOSRExit):
148	(JSC::DFG::ByteCodeParser::handleInlining):
149	(JSC::DFG::ByteCodeParser::parseBlock):
150	* dfg/DFGCapabilities.h:
151	(JSC::DFG::canCompileOpcode):
152	* dfg/DFGOSRExitCompiler.cpp:
153	():
154	* dfg/DFGOperations.cpp:
155	():
156	* heap/AllocationSpace.h:
157	(JSC):
158	(AllocationSpace):
159	():
160	* heap/Heap.cpp:
161	(JSC::Heap::collect):
162	* heap/Heap.h:
163	(JSC):
164	():
165	(Heap):
166	* heap/MarkStack.cpp:
167	(JSC::visitChildren):
168	* heap/MarkedSpace.h:
169	(JSC):
170	(MarkedSpace):
171	* interpreter/CallFrame.h:
172	(ExecState):
173	(JSC::ExecState::currentVPC):
174	* interpreter/Interpreter.cpp:
175	(JSC::Interpreter::~Interpreter):
176	(JSC):
177	(JSC::Interpreter::initialize):
178	(JSC::Interpreter::isOpcode):
179	(JSC::Interpreter::unwindCallFrame):
180	(JSC::Interpreter::retrieveLastCaller):
181	* interpreter/Interpreter.h:
182	(JSC):
183	():
184	(Interpreter):
185	(JSC::Interpreter::getOpcode):
186	(JSC::Interpreter::getOpcodeID):
187	(JSC::Interpreter::enabled):
188	* interpreter/RegisterFile.h:
189	(JSC):
190	(RegisterFile):
191	* jit/HostCallReturnValue.cpp: Added.
192	(JSC):
193	(JSC::getHostCallReturnValueWithExecState):
194	* jit/HostCallReturnValue.h: Added.
195	(JSC):
196	* jit/JIT.cpp:
197	(JSC::JIT::privateCompileMainPass):
198	(JSC::JIT::privateCompileSlowCases):
199	(JSC::JIT::privateCompile):
200	* jit/JITCode.h:
201	():
202	(JSC::JITCode::isOptimizingJIT):
203	(JITCode):
204	(JSC::JITCode::isBaselineCode):
205	(JSC::JITCode::JITCode):
206	* jit/JITDriver.h:
207	(JSC::jitCompileIfAppropriate):
208	(JSC::jitCompileFunctionIfAppropriate):
209	* jit/JITExceptions.cpp:
210	(JSC::jitThrow):
211	* jit/JITStubs.cpp:
212	(JSC::DEFINE_STUB_FUNCTION):
213	(JSC):
214	* jit/JSInterfaceJIT.h:
215	* llint: Added.
216	* llint/LLIntCommon.h: Added.
217	* llint/LLIntData.cpp: Added.
218	(LLInt):
219	(JSC::LLInt::Data::Data):
220	(JSC::LLInt::Data::~Data):
221	* llint/LLIntData.h: Added.
222	(JSC):
223	(LLInt):
224	(Data):
225	(JSC::LLInt::Data::exceptionInstructions):
226	(JSC::LLInt::Data::opcodeMap):
227	* llint/LLIntEntrypoints.cpp: Added.
228	(LLInt):
229	(JSC::LLInt::getFunctionEntrypoint):
230	(JSC::LLInt::getEvalEntrypoint):
231	(JSC::LLInt::getProgramEntrypoint):
232	* llint/LLIntEntrypoints.h: Added.
233	(JSC):
234	(LLInt):
235	(JSC::LLInt::getEntrypoint):
236	* llint/LLIntExceptions.cpp: Added.
237	(LLInt):
238	(JSC::LLInt::interpreterThrowInCaller):
239	(JSC::LLInt::returnToThrowForThrownException):
240	(JSC::LLInt::returnToThrow):
241	(JSC::LLInt::callToThrow):
242	* llint/LLIntExceptions.h: Added.
243	(JSC):
244	(LLInt):
245	* llint/LLIntHelpers.cpp: Added.
246	(LLInt):
247	(JSC::LLInt::llint_trace_operand):
248	(JSC::LLInt::llint_trace_value):
249	(JSC::LLInt::LLINT_HELPER_DECL):
250	(JSC::LLInt::traceFunctionPrologue):
251	(JSC::LLInt::shouldJIT):
252	():
253	(JSC::LLInt::entryOSR):
254	(JSC::LLInt::resolveGlobal):
255	(JSC::LLInt::getByVal):
256	(JSC::LLInt::handleHostCall):
257	(JSC::LLInt::setUpCall):
258	(JSC::LLInt::genericCall):
259	* llint/LLIntHelpers.h: Added.
260	(JSC):
261	(LLInt):
262	* llint/LLIntOfflineAsmConfig.h: Added.
263	* llint/LLIntOffsetsExtractor.cpp: Added.
264	(JSC):
265	(LLIntOffsetsExtractor):
266	(JSC::LLIntOffsetsExtractor::dummy):
267	(main):
268	* llint/LLIntThunks.cpp: Added.
269	(LLInt):
270	(JSC::LLInt::generateThunkWithJumpTo):
271	(JSC::LLInt::functionForCallEntryThunkGenerator):
272	(JSC::LLInt::functionForConstructEntryThunkGenerator):
273	(JSC::LLInt::functionForCallArityCheckThunkGenerator):
274	(JSC::LLInt::functionForConstructArityCheckThunkGenerator):
275	(JSC::LLInt::evalEntryThunkGenerator):
276	(JSC::LLInt::programEntryThunkGenerator):
277	* llint/LLIntThunks.h: Added.
278	(JSC):
279	(LLInt):
280	* llint/LowLevelInterpreter.asm: Added.
281	* llint/LowLevelInterpreter.cpp: Added.
282	* llint/LowLevelInterpreter.h: Added.
283	* offlineasm: Added.
284	* offlineasm/armv7.rb: Added.
285	* offlineasm/asm.rb: Added.
286	* offlineasm/ast.rb: Added.
287	* offlineasm/backends.rb: Added.
288	* offlineasm/generate_offset_extractor.rb: Added.
289	* offlineasm/instructions.rb: Added.
290	* offlineasm/offset_extractor_constants.rb: Added.
291	* offlineasm/offsets.rb: Added.
292	* offlineasm/parser.rb: Added.
293	* offlineasm/registers.rb: Added.
294	* offlineasm/settings.rb: Added.
295	* offlineasm/transform.rb: Added.
296	* offlineasm/x86.rb: Added.
297	* runtime/CodeSpecializationKind.h: Added.
298	(JSC):
299	():
300	* runtime/CommonSlowPaths.h:
301	(JSC::CommonSlowPaths::arityCheckFor):
302	(CommonSlowPaths):
303	(JSC::CommonSlowPaths::opInstanceOfSlow):
304	* runtime/Executable.cpp:
305	(JSC::jettisonCodeBlock):
306	(JSC::EvalExecutable::jitCompile):
307	(JSC):
308	(JSC::samplingDescription):
309	(JSC::EvalExecutable::compileInternal):
310	(JSC::ProgramExecutable::jitCompile):
311	(JSC::ProgramExecutable::compileInternal):
312	(JSC::FunctionExecutable::baselineCodeBlockFor):
313	(JSC::FunctionExecutable::jitCompileForCall):
314	(JSC::FunctionExecutable::jitCompileForConstruct):
315	(JSC::FunctionExecutable::compileForCallInternal):
316	(JSC::FunctionExecutable::compileForConstructInternal):
317	* runtime/Executable.h:
318	(JSC):
319	():
320	(EvalExecutable):
321	(ProgramExecutable):
322	(FunctionExecutable):
323	(JSC::FunctionExecutable::jitCompileFor):
324	* runtime/ExecutionHarness.h: Added.
325	(JSC):
326	(JSC::prepareForExecution):
327	(JSC::prepareFunctionForExecution):
328	* runtime/JSActivation.h:
329	(JSC::JSActivation::tearOff):
330	* runtime/JSArray.h:
331	(JSC):
332	(JSArray):
333	* runtime/JSCell.h:
334	(JSC):
335	():
336	(JSCell):
337	* runtime/JSFunction.h:
338	(JSC):
339	(JSFunction):
340	* runtime/JSGlobalData.cpp:
341	(JSC::JSGlobalData::JSGlobalData):
342	* runtime/JSGlobalData.h:
343	(JSC):
344	(JSGlobalData):
345	(JSC::JSGlobalData::scratchBufferForSize):
346	* runtime/JSGlobalObject.h:
347	(JSC):
348	(JSGlobalObject):
349	* runtime/JSObject.h:
350	(JSC):
351	():
352	(JSObject):
353	(JSFinalObject):
354	* runtime/JSPropertyNameIterator.h:
355	(JSC):
356	(JSPropertyNameIterator):
357	* runtime/JSString.h:
358	(JSC):
359	(JSString):
360	* runtime/JSTypeInfo.h:
361	(JSC):
362	(TypeInfo):
363	* runtime/JSValue.cpp:
364	(JSC):
365	(JSC::JSValue::description):
366	* runtime/JSValue.h:
367	(JSValue):
368	():
369	* runtime/JSVariableObject.h:
370	(JSC):
371	(JSVariableObject):
372	* runtime/Options.cpp:
373	(Options):
374	(JSC::Options::initializeOptions):
375	* runtime/Options.h:
376	(Options):
377	* runtime/ScopeChain.h:
378	(JSC):
379	(ScopeChainNode):
380	* runtime/Structure.h:
381	(JSC):
382	(Structure):
383	* runtime/StructureChain.h:
384	(JSC):
385	(StructureChain):
386	* wtf/Platform.h:
387	* wtf/SentinelLinkedList.h:
388	(SentinelLinkedList):
389	(WTF::SentinelLinkedList::isEmpty):
390	* wtf/text/StringImpl.h:
391	(JSC):
392	(StringImpl):
393	():
394
1	2012-01-26 Filip Pizlo <fpizlo@apple.com>	395	2012-01-26 Filip Pizlo <fpizlo@apple.com>
2		396
3	All DFG helpers that may call out to arbitrary JS code must know where they	397	All DFG helpers that may call out to arbitrary JS code must know where they

Lines 11-16 SET(JavaScriptCore_INCLUDE_DIRECTORIES Source/JavaScriptCore/CMakeLists.txt_sec1
- Source/JavaScriptCore/CMakeLists.txt +2 lines
11	"${JAVASCRIPTCORE_DIR}/debugger"	11	"${JAVASCRIPTCORE_DIR}/debugger"
12	"${JAVASCRIPTCORE_DIR}/interpreter"	12	"${JAVASCRIPTCORE_DIR}/interpreter"
13	"${JAVASCRIPTCORE_DIR}/jit"	13	"${JAVASCRIPTCORE_DIR}/jit"
		14	"${JAVASCRIPTCORE_DIR}/llint"
14	"${JAVASCRIPTCORE_DIR}/parser"	15	"${JAVASCRIPTCORE_DIR}/parser"
15	"${JAVASCRIPTCORE_DIR}/profiler"	16	"${JAVASCRIPTCORE_DIR}/profiler"
16	"${JAVASCRIPTCORE_DIR}/runtime"	17	"${JAVASCRIPTCORE_DIR}/runtime"
Lines 95-100 SET(JavaScriptCore_SOURCES Source/JavaScriptCore/CMakeLists.txt_sec2
95	interpreter/RegisterFile.cpp	96	interpreter/RegisterFile.cpp
96		97
97	jit/ExecutableAllocator.cpp	98	jit/ExecutableAllocator.cpp
		99	jit/HostCallReturnValue.cpp
98	jit/JITArithmetic32_64.cpp	100	jit/JITArithmetic32_64.cpp
99	jit/JITArithmetic.cpp	101	jit/JITArithmetic.cpp
100	jit/JITCall32_64.cpp	102	jit/JITCall32_64.cpp

Lines 81-86 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec1
- Source/JavaScriptCore/GNUmakefile.list.am +7 lines
81	Source/JavaScriptCore/assembler/RepatchBuffer.h \	81	Source/JavaScriptCore/assembler/RepatchBuffer.h \
82	Source/JavaScriptCore/assembler/SH4Assembler.h \	82	Source/JavaScriptCore/assembler/SH4Assembler.h \
83	Source/JavaScriptCore/assembler/X86Assembler.h \	83	Source/JavaScriptCore/assembler/X86Assembler.h \
		84	Source/JavaScriptCore/bytecode/BytecodeConventions.h \
84	Source/JavaScriptCore/bytecode/CallLinkInfo.cpp \	85	Source/JavaScriptCore/bytecode/CallLinkInfo.cpp \
85	Source/JavaScriptCore/bytecode/CallLinkInfo.h \	86	Source/JavaScriptCore/bytecode/CallLinkInfo.h \
86	Source/JavaScriptCore/bytecode/CallLinkStatus.cpp \	87	Source/JavaScriptCore/bytecode/CallLinkStatus.cpp \
Lines 102-107 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec2
102	Source/JavaScriptCore/bytecode/Instruction.h \	103	Source/JavaScriptCore/bytecode/Instruction.h \
103	Source/JavaScriptCore/bytecode/JumpTable.cpp \	104	Source/JavaScriptCore/bytecode/JumpTable.cpp \
104	Source/JavaScriptCore/bytecode/JumpTable.h \	105	Source/JavaScriptCore/bytecode/JumpTable.h \
		106	Source/JavaScriptCore/bytecode/LLIntCallLinkInfo.h \
105	Source/JavaScriptCore/bytecode/LineInfo.h \	107	Source/JavaScriptCore/bytecode/LineInfo.h \
106	Source/JavaScriptCore/bytecode/MethodCallLinkInfo.cpp \	108	Source/JavaScriptCore/bytecode/MethodCallLinkInfo.cpp \
107	Source/JavaScriptCore/bytecode/MethodCallLinkInfo.h \	109	Source/JavaScriptCore/bytecode/MethodCallLinkInfo.h \
Lines 279-284 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec3
279	Source/JavaScriptCore/jit/CompactJITCodeMap.h \	281	Source/JavaScriptCore/jit/CompactJITCodeMap.h \
280	Source/JavaScriptCore/jit/ExecutableAllocator.cpp \	282	Source/JavaScriptCore/jit/ExecutableAllocator.cpp \
281	Source/JavaScriptCore/jit/ExecutableAllocator.h \	283	Source/JavaScriptCore/jit/ExecutableAllocator.h \
		284	Source/JavaScriptCore/jit/HostCallReturnValue.cpp \
		285	Source/JavaScriptCore/jit/HostCallReturnValue.h \
282	Source/JavaScriptCore/jit/JITArithmetic32_64.cpp \	286	Source/JavaScriptCore/jit/JITArithmetic32_64.cpp \
283	Source/JavaScriptCore/jit/JITArithmetic.cpp \	287	Source/JavaScriptCore/jit/JITArithmetic.cpp \
284	Source/JavaScriptCore/jit/JITCall32_64.cpp \	288	Source/JavaScriptCore/jit/JITCall32_64.cpp \
Lines 302-307 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec4
302	Source/JavaScriptCore/jit/SpecializedThunkJIT.h \	306	Source/JavaScriptCore/jit/SpecializedThunkJIT.h \
303	Source/JavaScriptCore/jit/ThunkGenerators.cpp \	307	Source/JavaScriptCore/jit/ThunkGenerators.cpp \
304	Source/JavaScriptCore/jit/ThunkGenerators.h \	308	Source/JavaScriptCore/jit/ThunkGenerators.h \
		309	Source/JavaScriptCore/llint/LLIntData.h \
305	Source/JavaScriptCore/os-win32/stdbool.h \	310	Source/JavaScriptCore/os-win32/stdbool.h \
306	Source/JavaScriptCore/os-win32/stdint.h \	311	Source/JavaScriptCore/os-win32/stdint.h \
307	Source/JavaScriptCore/parser/ASTBuilder.h \	312	Source/JavaScriptCore/parser/ASTBuilder.h \
Lines 352-357 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec5
352	Source/JavaScriptCore/runtime/CallData.cpp \	357	Source/JavaScriptCore/runtime/CallData.cpp \
353	Source/JavaScriptCore/runtime/CallData.h \	358	Source/JavaScriptCore/runtime/CallData.h \
354	Source/JavaScriptCore/runtime/ClassInfo.h \	359	Source/JavaScriptCore/runtime/ClassInfo.h \
		360	Source/JavaScriptCore/runtime/CodeSpecializationKind.h \
355	Source/JavaScriptCore/runtime/CommonIdentifiers.cpp \	361	Source/JavaScriptCore/runtime/CommonIdentifiers.cpp \
356	Source/JavaScriptCore/runtime/CommonIdentifiers.h \	362	Source/JavaScriptCore/runtime/CommonIdentifiers.h \
357	Source/JavaScriptCore/runtime/CommonSlowPaths.h \	363	Source/JavaScriptCore/runtime/CommonSlowPaths.h \
Lines 380-385 javascriptcore_sources += \ Source/JavaScriptCore/GNUmakefile.list.am_sec6
380	Source/JavaScriptCore/runtime/ExceptionHelpers.h \	386	Source/JavaScriptCore/runtime/ExceptionHelpers.h \
381	Source/JavaScriptCore/runtime/Executable.cpp \	387	Source/JavaScriptCore/runtime/Executable.cpp \
382	Source/JavaScriptCore/runtime/Executable.h \	388	Source/JavaScriptCore/runtime/Executable.h \
		389	Source/JavaScriptCore/runtime/ExecutionHarness.h \
383	Source/JavaScriptCore/runtime/FunctionConstructor.cpp \	390	Source/JavaScriptCore/runtime/FunctionConstructor.cpp \
384	Source/JavaScriptCore/runtime/FunctionConstructor.h \	391	Source/JavaScriptCore/runtime/FunctionConstructor.h \
385	Source/JavaScriptCore/runtime/FunctionPrototype.cpp \	392	Source/JavaScriptCore/runtime/FunctionPrototype.cpp \

Line 0 Source/JavaScriptCore/bytecode/BytecodeConventions.h_sec1
- Source/JavaScriptCore/bytecode/BytecodeConventions.h +36 lines
	1	/*
	2	* Copyright (C) 2012 Apple Inc. All rights reserved.
	3	*
	4	* Redistribution and use in source and binary forms, with or without
	5	* modification, are permitted provided that the following conditions
	6	* are met:
	7	* 1. Redistributions of source code must retain the above copyright
	8	* notice, this list of conditions and the following disclaimer.
	9	* 2. Redistributions in binary form must reproduce the above copyright
	10	* notice, this list of conditions and the following disclaimer in the
	11	* documentation and/or other materials provided with the distribution.
	12	*
	13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
	14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
	17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
	21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
	23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	24	*/
	25
	26	#ifndef BytecodeConventions_h
	27	#define BytecodeConventions_h
	28
	29	// Register numbers used in bytecode operations have different meaning according to their ranges:
	30	// 0x80000000-0xFFFFFFFF Negative indices from the CallFrame pointer are entries in the call frame, see RegisterFile.h.
	31	// 0x00000000-0x3FFFFFFF Forwards indices from the CallFrame pointer are local vars and temporaries with the function's callframe.
	32	// 0x40000000-0x7FFFFFFF Positive indices from 0x40000000 specify entries in the constant pool on the CodeBlock.
	33	static const int FirstConstantRegisterIndex = 0x40000000;
	34
	35	#endif // BytecodeConventions_h
	36

Lines 27-43 Source/JavaScriptCore/bytecode/CallLinkStatus.cpp_sec1
- Source/JavaScriptCore/bytecode/CallLinkStatus.cpp -3 / +26 lines
27	#include "CallLinkStatus.h"	27	#include "CallLinkStatus.h"
28		28
29	#include "CodeBlock.h"	29	#include "CodeBlock.h"
		30	#include "LLIntCallLinkInfo.h"
30		31
31	namespace JSC {	32	namespace JSC {
32		33
		34	CallLinkStatus CallLinkStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex)
		35	{
		36	UNUSED_PARAM(profiledBlock);
		37	UNUSED_PARAM(bytecodeIndex);
		38	#if ENABLE(LLINT)
		39	Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;
		40	LLIntCallLinkInfo* callLinkInfo = instruction[4].u.callLinkInfo;
		41
		42	return CallLinkStatus(callLinkInfo->lastSeenCallee.get(), false);
		43	#else
		44	return CallLinkStatus(0, false);
		45	#endif
		46	}
		47
33	CallLinkStatus CallLinkStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex)	48	CallLinkStatus CallLinkStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex)
34	{	49	{
35	UNUSED_PARAM(profiledBlock);	50	UNUSED_PARAM(profiledBlock);
36	UNUSED_PARAM(bytecodeIndex);	51	UNUSED_PARAM(bytecodeIndex);
37	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)	52	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
38	return CallLinkStatus(	53	if (!profiledBlock->numberOfCallLinkInfos())
39	profiledBlock->getCallLinkInfo(bytecodeIndex).lastSeenCallee.get(),	54	return computeFromLLInt(profiledBlock, bytecodeIndex);
40	profiledBlock->couldTakeSlowCase(bytecodeIndex));	55
		56	if (profiledBlock->couldTakeSlowCase(bytecodeIndex))
		57	return CallLinkStatus(0, true);
		58
		59	JSFunction* target = profiledBlock->getCallLinkInfo(bytecodeIndex).lastSeenCallee.get();
		60	if (!target)
		61	return computeFromLLInt(profiledBlock, bytecodeIndex);
		62
		63	return CallLinkStatus(target, false);
41	#else	64	#else
42	return CallLinkStatus(0, false);	65	return CallLinkStatus(0, false);
43	#endif	66	#endif

Lines 47-61 public: Source/JavaScriptCore/bytecode/CallLinkStatus.h_sec1
- Source/JavaScriptCore/bytecode/CallLinkStatus.h -2 / +4 lines
47		47
48	static CallLinkStatus computeFor(CodeBlock*, unsigned bytecodeIndex);	48	static CallLinkStatus computeFor(CodeBlock*, unsigned bytecodeIndex);
49		49
50	bool isSet() const { return !!m_callTarget; }	50	bool isSet() const { return !!m_callTarget \|\| m_couldTakeSlowPath; }
51		51
52	bool operator!() const { return !m_callTarget; }	52	bool operator!() const { return !isSet(); }
53		53
54	bool couldTakeSlowPath() const { return m_couldTakeSlowPath; }	54	bool couldTakeSlowPath() const { return m_couldTakeSlowPath; }
55		55
56	JSFunction* callTarget() const { return m_callTarget; }	56	JSFunction* callTarget() const { return m_callTarget; }
57		57
58	private:	58	private:
		59	static CallLinkStatus computeFromLLInt(CodeBlock*, unsigned bytecodeIndex);
		60
59	JSFunction* m_callTarget;	61	JSFunction* m_callTarget;
60	bool m_couldTakeSlowPath;	62	bool m_couldTakeSlowPath;
61	};	63	};

Lines 42-47 Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec1
- Source/JavaScriptCore/bytecode/CodeBlock.cpp -15 / +147 lines
42	#include "JSFunction.h"	42	#include "JSFunction.h"
43	#include "JSStaticScopeObject.h"	43	#include "JSStaticScopeObject.h"
44	#include "JSValue.h"	44	#include "JSValue.h"
		45	#include "LowLevelInterpreter.h"
45	#include "RepatchBuffer.h"	46	#include "RepatchBuffer.h"
46	#include "UStringConcatenate.h"	47	#include "UStringConcatenate.h"
47	#include <stdio.h>	48	#include <stdio.h>
Lines 59-66 namespace JSC { Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec2
59	using namespace DFG;	60	using namespace DFG;
60	#endif	61	#endif
61		62
62	#if !defined(NDEBUG) \|\| ENABLE(OPCODE_SAMPLING)
63
64	static UString escapeQuotes(const UString& str)	63	static UString escapeQuotes(const UString& str)
65	{	64	{
66	UString result = str;	65	UString result = str;
Lines 358-367 void CodeBlock::dump(ExecState* exec) co Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec3
358	for (size_t i = 0; i < instructions().size(); i += opcodeLengths[exec->interpreter()->getOpcodeID(instructions()[i].u.opcode)])	357	for (size_t i = 0; i < instructions().size(); i += opcodeLengths[exec->interpreter()->getOpcodeID(instructions()[i].u.opcode)])
359	++instructionCount;	358	++instructionCount;
360		359
361	printf("%lu m_instructions; %lu bytes at %p; %d parameter(s); %d callee register(s)\n\n",	360	printf("%lu m_instructions; %lu bytes at %p; %d parameter(s); %d callee register(s); %d variable(s)\n\n",
362	static_cast<unsigned long>(instructionCount),	361	static_cast<unsigned long>(instructionCount),
363	static_cast<unsigned long>(instructions().size() * sizeof(Instruction)),	362	static_cast<unsigned long>(instructions().size() * sizeof(Instruction)),
364	this, m_numParameters, m_numCalleeRegisters);	363	this, m_numParameters, m_numCalleeRegisters, m_numVars);
365		364
366	Vector<Instruction>::const_iterator begin = instructions().begin();	365	Vector<Instruction>::const_iterator begin = instructions().begin();
367	Vector<Instruction>::const_iterator end = instructions().end();	366	Vector<Instruction>::const_iterator end = instructions().end();
Lines 898-903 void CodeBlock::dump(ExecState* exec, co Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec4
898	printPutByIdOp(exec, location, it, "put_by_id_transition");	897	printPutByIdOp(exec, location, it, "put_by_id_transition");
899	break;	898	break;
900	}	899	}
		900	case op_put_by_id_transition_direct: {
		901	printPutByIdOp(exec, location, it, "put_by_id_transition_direct");
		902	break;
		903	}
		904	case op_put_by_id_transition_normal: {
		905	printPutByIdOp(exec, location, it, "put_by_id_transition_normal");
		906	break;
		907	}
901	case op_put_by_id_generic: {	908	case op_put_by_id_generic: {
902	printPutByIdOp(exec, location, it, "put_by_id_generic");	909	printPutByIdOp(exec, location, it, "put_by_id_generic");
903	break;	910	break;
Lines 1291-1298 void CodeBlock::dump(ExecState* exec, co Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec5
1291	}	1298	}
1292	}	1299	}
1293		1300
1294	#endif // !defined(NDEBUG) \|\| ENABLE(OPCODE_SAMPLING)
1295
1296	#if DUMP_CODE_BLOCK_STATISTICS	1301	#if DUMP_CODE_BLOCK_STATISTICS
1297	static HashSet<CodeBlock*> liveCodeBlockSet;	1302	static HashSet<CodeBlock*> liveCodeBlockSet;
1298	#endif	1303	#endif
Lines 1459-1464 CodeBlock::CodeBlock(CopyParsedBlockTag, Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec6
1459	{	1464	{
1460	setNumParameters(other.numParameters());	1465	setNumParameters(other.numParameters());
1461	optimizeAfterWarmUp();	1466	optimizeAfterWarmUp();
		1467	jitAfterWarmUp();
1462		1468
1463	if (other.m_rareData) {	1469	if (other.m_rareData) {
1464	createRareDataIfNecessary();	1470	createRareDataIfNecessary();
Lines 1507-1512 CodeBlock::CodeBlock(ScriptExecutable* o Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec7
1507	ASSERT(m_source);	1513	ASSERT(m_source);
1508		1514
1509	optimizeAfterWarmUp();	1515	optimizeAfterWarmUp();
		1516	jitAfterWarmUp();
1510		1517
1511	#if DUMP_CODE_BLOCK_STATISTICS	1518	#if DUMP_CODE_BLOCK_STATISTICS
1512	liveCodeBlockSet.add(this);	1519	liveCodeBlockSet.add(this);
Lines 1524-1530 CodeBlock::~CodeBlock() Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec8
1524	#if ENABLE(VERBOSE_VALUE_PROFILE)	1531	#if ENABLE(VERBOSE_VALUE_PROFILE)
1525	dumpValueProfiles();	1532	dumpValueProfiles();
1526	#endif	1533	#endif
1527		1534
		1535	#if ENABLE(LLINT)
		1536	while (m_incomingLLIntCalls.begin() != m_incomingLLIntCalls.end())
		1537	m_incomingLLIntCalls.begin()->remove();
		1538	#endif // ENABLE(LLINT)
1528	#if ENABLE(JIT)	1539	#if ENABLE(JIT)
1529	// We may be destroyed before any CodeBlocks that refer to us are destroyed.	1540	// We may be destroyed before any CodeBlocks that refer to us are destroyed.
1530	// Consider that two CodeBlocks become unreachable at the same time. There	1541	// Consider that two CodeBlocks become unreachable at the same time. There
Lines 1736-1743 void CodeBlock::finalizeUnconditionally( Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec9
1736	#else	1747	#else
1737	static const bool verboseUnlinking = false;	1748	static const bool verboseUnlinking = false;
1738	#endif	1749	#endif
1739	#endif	1750	#endif // ENABLE(JIT)
1740		1751
		1752	#if ENABLE(LLINT)
		1753	Interpreter* interpreter = m_globalData->interpreter;
		1754	// interpreter->enabled() returns true if the old C++ interpreter is enabled. If that's enabled
		1755	// then we're not using LLInt.
		1756	if (!interpreter->enabled()) {
		1757	for (size_t size = m_propertyAccessInstructions.size(), i = 0; i < size; ++i) {
		1758	Instruction* curInstruction = &instructions()[m_propertyAccessInstructions[i]];
		1759	switch (interpreter->getOpcodeID(curInstruction[0].u.opcode)) {
		1760	case op_get_by_id:
		1761	case op_put_by_id:
		1762	if (!curInstruction[4].u.structure \|\| Heap::isMarked(curInstruction[4].u.structure.get()))
		1763	break;
		1764	curInstruction[4].u.structure.clear();
		1765	curInstruction[5].u.operand = 0;
		1766	break;
		1767	case op_put_by_id_transition_direct:
		1768	case op_put_by_id_transition_normal:
		1769	if (Heap::isMarked(curInstruction[4].u.structure.get())
		1770	&& Heap::isMarked(curInstruction[6].u.structure.get())
		1771	&& Heap::isMarked(curInstruction[7].u.structureChain.get()))
		1772	break;
		1773	curInstruction[4].u.structure.clear();
		1774	curInstruction[6].u.structure.clear();
		1775	curInstruction[7].u.structureChain.clear();
		1776	curInstruction[0].u.opcode = interpreter->getOpcode(op_put_by_id);
		1777	break;
		1778	default:
		1779	ASSERT_NOT_REACHED();
		1780	}
		1781	}
		1782	for (size_t size = m_globalResolveInstructions.size(), i = 0; i < size; ++i) {
		1783	Instruction* curInstruction = &instructions()[m_globalResolveInstructions[i]];
		1784	ASSERT(interpreter->getOpcodeID(curInstruction[0].u.opcode) == op_resolve_global
		1785	\|\| interpreter->getOpcodeID(curInstruction[0].u.opcode) == op_resolve_global_dynamic);
		1786	if (!curInstruction[3].u.structure \|\| Heap::isMarked(curInstruction[3].u.structure.get()))
		1787	continue;
		1788	curInstruction[3].u.structure.clear();
		1789	curInstruction[4].u.operand = 0;
		1790	}
		1791	for (unsigned i = 0; i < m_llintCallLinkInfos.size(); ++i) {
		1792	if (m_llintCallLinkInfos[i].isLinked() && !Heap::isMarked(m_llintCallLinkInfos[i].callee.get())) {
		1793	if (verboseUnlinking)
		1794	printf("Clearing LLInt call from %p.\n", this);
		1795	m_llintCallLinkInfos[i].unlink();
		1796	}
		1797	if (!!m_llintCallLinkInfos[i].lastSeenCallee && !Heap::isMarked(m_llintCallLinkInfos[i].lastSeenCallee.get()))
		1798	m_llintCallLinkInfos[i].lastSeenCallee.clear();
		1799	}
		1800	}
		1801	#endif // ENABLE(LLINT)
		1802
1741	#if ENABLE(DFG_JIT)	1803	#if ENABLE(DFG_JIT)
1742	// Check if we're not live. If we are, then jettison.	1804	// Check if we're not live. If we are, then jettison.
1743	if (!(shouldImmediatelyAssumeLivenessDuringScan() \|\| m_dfgData->livenessHasBeenProved)) {	1805	if (!(shouldImmediatelyAssumeLivenessDuringScan() \|\| m_dfgData->livenessHasBeenProved)) {
Lines 1858-1867 void CodeBlock::stronglyVisitStrongRefer Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec10
1858	for (size_t i = 0; i < m_functionDecls.size(); ++i)	1920	for (size_t i = 0; i < m_functionDecls.size(); ++i)
1859	visitor.append(&m_functionDecls[i]);	1921	visitor.append(&m_functionDecls[i]);
1860	#if ENABLE(INTERPRETER)	1922	#if ENABLE(INTERPRETER)
1861	for (size_t size = m_propertyAccessInstructions.size(), i = 0; i < size; ++i)	1923	if (m_globalData->interpreter->enabled()) {
1862	visitStructures(visitor, &instructions()[m_propertyAccessInstructions[i]]);	1924	for (size_t size = m_propertyAccessInstructions.size(), i = 0; i < size; ++i)
1863	for (size_t size = m_globalResolveInstructions.size(), i = 0; i < size; ++i)	1925	visitStructures(visitor, &instructions()[m_propertyAccessInstructions[i]]);
1864	visitStructures(visitor, &instructions()[m_globalResolveInstructions[i]]);	1926	for (size_t size = m_globalResolveInstructions.size(), i = 0; i < size; ++i)
		1927	visitStructures(visitor, &instructions()[m_globalResolveInstructions[i]]);
		1928	}
1865	#endif	1929	#endif
1866		1930
1867	#if ENABLE(DFG_JIT)	1931	#if ENABLE(DFG_JIT)
Lines 2070-2075 void CodeBlock::unlinkCalls() Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec11
2070	{	2134	{
2071	if (!!m_alternative)	2135	if (!!m_alternative)
2072	m_alternative->unlinkCalls();	2136	m_alternative->unlinkCalls();
		2137	#if ENABLE(LLINT)
		2138	for (size_t i = 0; i < m_llintCallLinkInfos.size(); ++i) {
		2139	if (m_llintCallLinkInfos[i].isLinked())
		2140	m_llintCallLinkInfos[i].unlink();
		2141	}
		2142	#endif
2073	if (!(m_callLinkInfos.size() \|\| m_methodCallLinkInfos.size()))	2143	if (!(m_callLinkInfos.size() \|\| m_methodCallLinkInfos.size()))
2074	return;	2144	return;
2075	if (!m_globalData->canUseJIT())	2145	if (!m_globalData->canUseJIT())
Lines 2084-2093 void CodeBlock::unlinkCalls() Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec12
2084		2154
2085	void CodeBlock::unlinkIncomingCalls()	2155	void CodeBlock::unlinkIncomingCalls()
2086	{	2156	{
		2157	#if ENABLE(LLINT)
		2158	while (m_incomingLLIntCalls.begin() != m_incomingLLIntCalls.end())
		2159	m_incomingLLIntCalls.begin()->unlink();
		2160	#endif
		2161	if (m_incomingCalls.isEmpty())
		2162	return;
2087	RepatchBuffer repatchBuffer(this);	2163	RepatchBuffer repatchBuffer(this);
2088	while (m_incomingCalls.begin() != m_incomingCalls.end())	2164	while (m_incomingCalls.begin() != m_incomingCalls.end())
2089	m_incomingCalls.begin()->unlink(*m_globalData, repatchBuffer);	2165	m_incomingCalls.begin()->unlink(*m_globalData, repatchBuffer);
2090	}	2166	}
		2167
		2168	unsigned CodeBlock::bytecodeOffset(ExecState* exec, ReturnAddressPtr returnAddress)
		2169	{
		2170	#if ENABLE(LLINT)
		2171	if (returnAddress.value() >= bitwise_cast<void*>(&llint_begin)
		2172	&& returnAddress.value() <= bitwise_cast<void*>(&llint_end)) {
		2173	ASSERT(exec->codeBlock());
		2174	ASSERT(exec->codeBlock() == this);
		2175	ASSERT(JITCode::isBaselineCode(getJITType()));
		2176	Instruction* instruction = exec->currentVPC();
		2177	ASSERT(instruction);
		2178	return bytecodeOffset(instruction);
		2179	}
		2180	#else
		2181	UNUSED_PARAM(exec);
		2182	#endif
		2183	if (!m_rareData)
		2184	return 1;
		2185	Vector<CallReturnOffsetToBytecodeOffset>& callIndices = m_rareData->m_callReturnIndexVector;
		2186	if (!callIndices.size())
		2187	return 1;
		2188	return binarySearch<CallReturnOffsetToBytecodeOffset, unsigned, getCallReturnOffset>(callIndices.begin(), callIndices.size(), getJITCode().offsetOf(returnAddress.value()))->bytecodeOffset;
		2189	}
2091	#endif	2190	#endif
2092		2191
2093	void CodeBlock::clearEvalCache()	2192	void CodeBlock::clearEvalCache()
Lines 2183-2206 bool FunctionCodeBlock::canCompileWithDF Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec13
2183		2282
2184	void ProgramCodeBlock::jettison()	2283	void ProgramCodeBlock::jettison()
2185	{	2284	{
2186	ASSERT(getJITType() != JITCode::BaselineJIT);	2285	ASSERT(JITCode::isOptimizingJIT(getJITType()));
2187	ASSERT(this == replacement());	2286	ASSERT(this == replacement());
2188	static_cast<ProgramExecutable>(ownerExecutable())->jettisonOptimizedCode(globalData());	2287	static_cast<ProgramExecutable>(ownerExecutable())->jettisonOptimizedCode(globalData());
2189	}	2288	}
2190		2289
2191	void EvalCodeBlock::jettison()	2290	void EvalCodeBlock::jettison()
2192	{	2291	{
2193	ASSERT(getJITType() != JITCode::BaselineJIT);	2292	ASSERT(JITCode::isOptimizingJIT(getJITType()));
2194	ASSERT(this == replacement());	2293	ASSERT(this == replacement());
2195	static_cast<EvalExecutable>(ownerExecutable())->jettisonOptimizedCode(globalData());	2294	static_cast<EvalExecutable>(ownerExecutable())->jettisonOptimizedCode(globalData());
2196	}	2295	}
2197		2296
2198	void FunctionCodeBlock::jettison()	2297	void FunctionCodeBlock::jettison()
2199	{	2298	{
2200	ASSERT(getJITType() != JITCode::BaselineJIT);	2299	ASSERT(JITCode::isOptimizingJIT(getJITType()));
2201	ASSERT(this == replacement());	2300	ASSERT(this == replacement());
2202	static_cast<FunctionExecutable>(ownerExecutable())->jettisonOptimizedCodeFor(globalData(), m_isConstructor ? CodeForConstruct : CodeForCall);	2301	static_cast<FunctionExecutable>(ownerExecutable())->jettisonOptimizedCodeFor(globalData(), m_isConstructor ? CodeForConstruct : CodeForCall);
2203	}	2302	}
		2303
		2304	void ProgramCodeBlock::jitCompileImpl(JSGlobalData& globalData)
		2305	{
		2306	ASSERT(getJITType() == JITCode::InterpreterThunk);
		2307	ASSERT(this == replacement());
		2308	return static_cast<ProgramExecutable*>(ownerExecutable())->jitCompile(globalData);
		2309	}
		2310
		2311	void EvalCodeBlock::jitCompileImpl(JSGlobalData& globalData)
		2312	{
		2313	ASSERT(getJITType() == JITCode::InterpreterThunk);
		2314	ASSERT(this == replacement());
		2315	return static_cast<EvalExecutable*>(ownerExecutable())->jitCompile(globalData);
		2316	}
		2317
		2318	void FunctionCodeBlock::jitCompileImpl(JSGlobalData& globalData)
		2319	{
		2320	ASSERT(getJITType() == JITCode::InterpreterThunk);
		2321	ASSERT(this == replacement());
		2322	return static_cast<FunctionExecutable*>(ownerExecutable())->jitCompileFor(globalData, m_isConstructor ? CodeForConstruct : CodeForCall);
		2323	}
2204	#endif	2324	#endif
2205		2325
2206	#if ENABLE(VALUE_PROFILER)	2326	#if ENABLE(VALUE_PROFILER)
Lines 2303-2308 void CodeBlock::dumpValueProfiles() Source/JavaScriptCore/bytecode/CodeBlock.cpp_sec14
2303	}	2423	}
2304	#endif	2424	#endif
2305		2425
		2426	void CodeBlock::handleBytecodeDiscardingOpportunity()
		2427	{
		2428	#if !ENABLE(OPCODE_SAMPLING) && !ENABLE(LLINT)
		2429	if (BytecodeGenerator::dumpsGeneratedCode())
		2430	return;
		2431	if (!!alternative())
		2432	discardBytecode();
		2433	else
		2434	discardBytecodeLater();
		2435	#endif
		2436	}
		2437
2306	#ifndef NDEBUG	2438	#ifndef NDEBUG
2307	bool CodeBlock::usesOpcode(OpcodeID opcodeID)	2439	bool CodeBlock::usesOpcode(OpcodeID opcodeID)
2308	{	2440	{

Lines 27-46 Source/JavaScriptCore/bytecode/GetByIdStatus.cpp_sec1
- Source/JavaScriptCore/bytecode/GetByIdStatus.cpp -5 / +35 lines
27	#include "GetByIdStatus.h"	27	#include "GetByIdStatus.h"
28		28
29	#include "CodeBlock.h"	29	#include "CodeBlock.h"
		30	#include "LowLevelInterpreter.h"
30		31
31	namespace JSC {	32	namespace JSC {
32		33
		34	GetByIdStatus GetByIdStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
		35	{
		36	UNUSED_PARAM(profiledBlock);
		37	UNUSED_PARAM(bytecodeIndex);
		38	UNUSED_PARAM(ident);
		39	#if ENABLE(LLINT)
		40	Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;
		41
		42	if (instruction[0].u.opcode == llint_op_method_check)
		43	instruction++;
		44
		45	Structure* structure = instruction[4].u.structure.get();
		46	if (!structure)
		47	return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
		48
		49	size_t offset = structure->get(*profiledBlock->globalData(), ident);
		50	if (offset == notFound)
		51	return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
		52
		53	return GetByIdStatus(SimpleDirect, StructureSet(structure), offset, false);
		54	#else
		55	return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
		56	#endif
		57	}
		58
33	GetByIdStatus GetByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)	59	GetByIdStatus GetByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
34	{	60	{
35	UNUSED_PARAM(profiledBlock);	61	UNUSED_PARAM(profiledBlock);
36	UNUSED_PARAM(bytecodeIndex);	62	UNUSED_PARAM(bytecodeIndex);
37	UNUSED_PARAM(ident);	63	UNUSED_PARAM(ident);
38	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)	64	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
		65	if (!profiledBlock->numberOfStructureStubInfos())
		66	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
		67
39	// First check if it makes either calls, in which case we want to be super careful, or	68	// First check if it makes either calls, in which case we want to be super careful, or
40	// if it's not set at all, in which case we punt.	69	// if it's not set at all, in which case we punt.
41	StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);	70	StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);
42	if (!stubInfo.seen)	71	if (!stubInfo.seen)
43	return GetByIdStatus(NoInformation, StructureSet(), notFound);	72	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
44		73
45	PolymorphicAccessStructureList* list;	74	PolymorphicAccessStructureList* list;
46	int listSize;	75	int listSize;
Lines 60-77 GetByIdStatus GetByIdStatus::computeFor( Source/JavaScriptCore/bytecode/GetByIdStatus.cpp_sec2
60	}	89	}
61	for (int i = 0; i < listSize; ++i) {	90	for (int i = 0; i < listSize; ++i) {
62	if (!list->list[i].isDirect)	91	if (!list->list[i].isDirect)
63	return GetByIdStatus(MakesCalls, StructureSet(), notFound);	92	return GetByIdStatus(MakesCalls, StructureSet(), notFound, true);
64	}	93	}
65		94
66	// Next check if it takes slow case, in which case we want to be kind of careful.	95	// Next check if it takes slow case, in which case we want to be kind of careful.
67	if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))	96	if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))
68	return GetByIdStatus(TakesSlowPath, StructureSet(), notFound);	97	return GetByIdStatus(TakesSlowPath, StructureSet(), notFound, true);
69		98
70	// Finally figure out if we can derive an access strategy.	99	// Finally figure out if we can derive an access strategy.
71	GetByIdStatus result;	100	GetByIdStatus result;
		101	result.m_wasSeenInJIT = true;
72	switch (stubInfo.accessType) {	102	switch (stubInfo.accessType) {
73	case access_unset:	103	case access_unset:
74	return GetByIdStatus(NoInformation, StructureSet(), notFound);	104	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
75		105
76	case access_get_by_id_self: {	106	case access_get_by_id_self: {
77	Structure* structure = stubInfo.u.getByIdSelf.baseObjectStructure.get();	107	Structure* structure = stubInfo.u.getByIdSelf.baseObjectStructure.get();
Lines 130-136 GetByIdStatus GetByIdStatus::computeFor( Source/JavaScriptCore/bytecode/GetByIdStatus.cpp_sec3
130		160
131	return result;	161	return result;
132	#else // ENABLE(JIT)	162	#else // ENABLE(JIT)
133	return GetByIdStatus(NoInformation, StructureSet(), notFound);	163	return GetByIdStatus(NoInformation, StructureSet(), notFound, false);
134	#endif // ENABLE(JIT)	164	#endif // ENABLE(JIT)
135	}	165	}
136		166

Line 0 Source/JavaScriptCore/bytecode/LLIntCallLinkInfo.h_sec1
- Source/JavaScriptCore/bytecode/LLIntCallLinkInfo.h +66 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#ifndef LLIntCallLinkInfo_h
		27	#define LLIntCallLinkInfo_h
		28
		29	#include "JSFunction.h"
		30	#include "MacroAssemblerCodeRef.h"
		31	#include <wtf/SentinelLinkedList.h>
		32
		33	namespace JSC {
		34
		35	struct Instruction;
		36
		37	struct LLIntCallLinkInfo : public BasicRawSentinelNode<LLIntCallLinkInfo> {
		38	LLIntCallLinkInfo()
		39	{
		40	}
		41
		42	~LLIntCallLinkInfo()
		43	{
		44	if (isOnList())
		45	remove();
		46	}
		47
		48	bool isLinked() { return callee; }
		49
		50	void unlink()
		51	{
		52	callee.clear();
		53	machineCodeTarget = MacroAssemblerCodePtr();
		54	if (isOnList())
		55	remove();
		56	}
		57
		58	WriteBarrier<JSFunction> callee;
		59	WriteBarrier<JSFunction> lastSeenCallee;
		60	MacroAssemblerCodePtr machineCodeTarget;
		61	};
		62
		63	} // namespace JSC
		64
65	#endif // LLIntCallLinkInfo_h
66

Lines 27-53 Source/JavaScriptCore/bytecode/PutByIdStatus.cpp_sec1
- Source/JavaScriptCore/bytecode/PutByIdStatus.cpp -2 / +44 lines
27	#include "PutByIdStatus.h"	27	#include "PutByIdStatus.h"
28		28
29	#include "CodeBlock.h"	29	#include "CodeBlock.h"
		30	#include "LowLevelInterpreter.h"
30	#include "Structure.h"	31	#include "Structure.h"
31	#include "StructureChain.h"	32	#include "StructureChain.h"
32		33
33	namespace JSC {	34	namespace JSC {
34		35
		36	PutByIdStatus PutByIdStatus::computeFromLLInt(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
		37	{
		38	UNUSED_PARAM(profiledBlock);
		39	UNUSED_PARAM(bytecodeIndex);
		40	UNUSED_PARAM(ident);
		41	#if ENABLE(LLINT)
		42	Instruction* instruction = profiledBlock->instructions().begin() + bytecodeIndex;
		43
		44	Structure* structure = instruction[4].u.structure.get();
		45	if (!structure)
		46	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
		47
		48	if (instruction[0].u.opcode == llint_op_put_by_id) {
		49	size_t offset = structure->get(*profiledBlock->globalData(), ident);
		50	if (offset == notFound)
		51	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
		52
		53	return PutByIdStatus(SimpleReplace, structure, 0, 0, offset);
		54	}
		55
		56	ASSERT(instruction[0].u.opcode == llint_op_put_by_id_transition_direct
		57	\|\| instruction[0].u.opcode == llint_op_put_by_id_transition_normal);
		58
		59	Structure* newStructure = instruction[6].u.structure.get();
		60	StructureChain* chain = instruction[7].u.structureChain.get();
		61	ASSERT(newStructure);
		62	ASSERT(chain);
		63
		64	size_t offset = newStructure->get(*profiledBlock->globalData(), ident);
		65	if (offset == notFound)
		66	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
		67
		68	return PutByIdStatus(SimpleTransition, structure, newStructure, chain, offset);
		69	#else
		70	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);
		71	#endif
		72	}
		73
35	PutByIdStatus PutByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)	74	PutByIdStatus PutByIdStatus::computeFor(CodeBlock* profiledBlock, unsigned bytecodeIndex, Identifier& ident)
36	{	75	{
37	UNUSED_PARAM(profiledBlock);	76	UNUSED_PARAM(profiledBlock);
38	UNUSED_PARAM(bytecodeIndex);	77	UNUSED_PARAM(bytecodeIndex);
39	UNUSED_PARAM(ident);	78	UNUSED_PARAM(ident);
40	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)	79	#if ENABLE(JIT) && ENABLE(VALUE_PROFILER)
		80	if (!profiledBlock->numberOfStructureStubInfos())
		81	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
		82
41	if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))	83	if (profiledBlock->likelyToTakeSlowCase(bytecodeIndex))
42	return PutByIdStatus(TakesSlowPath, 0, 0, 0, notFound);	84	return PutByIdStatus(TakesSlowPath, 0, 0, 0, notFound);
43		85
44	StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);	86	StructureStubInfo& stubInfo = profiledBlock->getStubInfo(bytecodeIndex);
45	if (!stubInfo.seen)	87	if (!stubInfo.seen)
46	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);	88	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
47		89
48	switch (stubInfo.accessType) {	90	switch (stubInfo.accessType) {
49	case access_unset:	91	case access_unset:
50	return PutByIdStatus(NoInformation, 0, 0, 0, notFound);	92	return computeFromLLInt(profiledBlock, bytecodeIndex, ident);
51		93
52	case access_put_by_id_replace: {	94	case access_put_by_id_replace: {
53	size_t offset = stubInfo.u.putByIdReplace.baseObjectStructure->get(	95	size_t offset = stubInfo.u.putByIdReplace.baseObjectStructure->get(

Lines 33-38 Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec1
- Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp -24 / +13 lines
33	#include "BatchedTransitionOptimizer.h"	33	#include "BatchedTransitionOptimizer.h"
34	#include "JSFunction.h"	34	#include "JSFunction.h"
35	#include "Interpreter.h"	35	#include "Interpreter.h"
		36	#include "LowLevelInterpreter.h"
36	#include "ScopeChain.h"	37	#include "ScopeChain.h"
37	#include "StrongInlines.h"	38	#include "StrongInlines.h"
38	#include "UString.h"	39	#include "UString.h"
Lines 116-141 namespace JSC { Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec2
116	expected by the callee.	117	expected by the callee.
117	*/	118	*/
118		119
119	#ifndef NDEBUG
120	static bool s_dumpsGeneratedCode = false;	120	static bool s_dumpsGeneratedCode = false;
121	#endif
122		121
123	void BytecodeGenerator::setDumpsGeneratedCode(bool dumpsGeneratedCode)	122	void BytecodeGenerator::setDumpsGeneratedCode(bool dumpsGeneratedCode)
124	{	123	{
125	#ifndef NDEBUG
126	s_dumpsGeneratedCode = dumpsGeneratedCode;	124	s_dumpsGeneratedCode = dumpsGeneratedCode;
127	#else
128	UNUSED_PARAM(dumpsGeneratedCode);
129	#endif
130	}	125	}
131		126
132	bool BytecodeGenerator::dumpsGeneratedCode()	127	bool BytecodeGenerator::dumpsGeneratedCode()
133	{	128	{
134	#ifndef NDEBUG
135	return s_dumpsGeneratedCode;	129	return s_dumpsGeneratedCode;
136	#else
137	return false;
138	#endif
139	}	130	}
140		131
141	JSObject* BytecodeGenerator::generate()	132	JSObject* BytecodeGenerator::generate()
Lines 148-157 JSObject* BytecodeGenerator::generate() Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec3
148		139
149	m_codeBlock->setInstructionCount(m_codeBlock->instructions().size());	140	m_codeBlock->setInstructionCount(m_codeBlock->instructions().size());
150		141
151	#ifndef NDEBUG
152	if (s_dumpsGeneratedCode)	142	if (s_dumpsGeneratedCode)
153	m_codeBlock->dump(m_scopeChain->globalObject->globalExec());	143	m_codeBlock->dump(m_scopeChain->globalObject->globalExec());
154	#endif
155		144
156	if ((m_codeType == FunctionCode && !m_codeBlock->needsFullScopeChain() && !m_codeBlock->usesArguments()) \|\| m_codeType == EvalCode)	145	if ((m_codeType == FunctionCode && !m_codeBlock->needsFullScopeChain() && !m_codeBlock->usesArguments()) \|\| m_codeType == EvalCode)
157	symbolTable().clear();	146	symbolTable().clear();
Lines 1276-1284 RegisterID* BytecodeGenerator::emitResol Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec4
1276	#if ENABLE(JIT)	1265	#if ENABLE(JIT)
1277	m_codeBlock->addGlobalResolveInfo(instructions().size());	1266	m_codeBlock->addGlobalResolveInfo(instructions().size());
1278	#endif	1267	#endif
1279	#if ENABLE(INTERPRETER)
1280	m_codeBlock->addGlobalResolveInstruction(instructions().size());	1268	m_codeBlock->addGlobalResolveInstruction(instructions().size());
1281	#endif
1282	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);	1269	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
1283	instructions().append(dst->index());	1270	instructions().append(dst->index());
1284	instructions().append(addConstant(property));	1271	instructions().append(addConstant(property));
Lines 1440-1448 RegisterID* BytecodeGenerator::emitResol Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec5
1440	#if ENABLE(JIT)	1427	#if ENABLE(JIT)
1441	m_codeBlock->addGlobalResolveInfo(instructions().size());	1428	m_codeBlock->addGlobalResolveInfo(instructions().size());
1442	#endif	1429	#endif
1443	#if ENABLE(INTERPRETER)
1444	m_codeBlock->addGlobalResolveInstruction(instructions().size());	1430	m_codeBlock->addGlobalResolveInstruction(instructions().size());
1445	#endif
1446	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);	1431	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
1447	instructions().append(propDst->index());	1432	instructions().append(propDst->index());
1448	instructions().append(addConstant(property));	1433	instructions().append(addConstant(property));
Lines 1490-1498 RegisterID* BytecodeGenerator::emitResol Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec6
1490	#if ENABLE(JIT)	1475	#if ENABLE(JIT)
1491	m_codeBlock->addGlobalResolveInfo(instructions().size());	1476	m_codeBlock->addGlobalResolveInfo(instructions().size());
1492	#endif	1477	#endif
1493	#if ENABLE(INTERPRETER)
1494	m_codeBlock->addGlobalResolveInstruction(instructions().size());	1478	m_codeBlock->addGlobalResolveInstruction(instructions().size());
1495	#endif
1496	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);	1479	ValueProfile* profile = emitProfiledOpcode(requiresDynamicChecks ? op_resolve_global_dynamic : op_resolve_global);
1497	instructions().append(propDst->index());	1480	instructions().append(propDst->index());
1498	instructions().append(addConstant(property));	1481	instructions().append(addConstant(property));
Lines 1511-1519 void BytecodeGenerator::emitMethodCheck( Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec7
1511		1494
1512	RegisterID* BytecodeGenerator::emitGetById(RegisterID* dst, RegisterID* base, const Identifier& property)	1495	RegisterID* BytecodeGenerator::emitGetById(RegisterID* dst, RegisterID* base, const Identifier& property)
1513	{	1496	{
1514	#if ENABLE(INTERPRETER)
1515	m_codeBlock->addPropertyAccessInstruction(instructions().size());	1497	m_codeBlock->addPropertyAccessInstruction(instructions().size());
1516	#endif
1517		1498
1518	ValueProfile* profile = emitProfiledOpcode(op_get_by_id);	1499	ValueProfile* profile = emitProfiledOpcode(op_get_by_id);
1519	instructions().append(dst->index());	1500	instructions().append(dst->index());
Lines 1539-1547 RegisterID* BytecodeGenerator::emitGetAr Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec8
1539		1520
1540	RegisterID* BytecodeGenerator::emitPutById(RegisterID* base, const Identifier& property, RegisterID* value)	1521	RegisterID* BytecodeGenerator::emitPutById(RegisterID* base, const Identifier& property, RegisterID* value)
1541	{	1522	{
1542	#if ENABLE(INTERPRETER)
1543	m_codeBlock->addPropertyAccessInstruction(instructions().size());	1523	m_codeBlock->addPropertyAccessInstruction(instructions().size());
1544	#endif
1545		1524
1546	emitOpcode(op_put_by_id);	1525	emitOpcode(op_put_by_id);
1547	instructions().append(base->index());	1526	instructions().append(base->index());
Lines 1557-1565 RegisterID* BytecodeGenerator::emitPutBy Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec9
1557		1536
1558	RegisterID* BytecodeGenerator::emitDirectPutById(RegisterID* base, const Identifier& property, RegisterID* value)	1537	RegisterID* BytecodeGenerator::emitDirectPutById(RegisterID* base, const Identifier& property, RegisterID* value)
1559	{	1538	{
1560	#if ENABLE(INTERPRETER)
1561	m_codeBlock->addPropertyAccessInstruction(instructions().size());	1539	m_codeBlock->addPropertyAccessInstruction(instructions().size());
1562	#endif
1563		1540
1564	emitOpcode(op_put_by_id);	1541	emitOpcode(op_put_by_id);
1565	instructions().append(base->index());	1542	instructions().append(base->index());
Lines 1848-1854 RegisterID* BytecodeGenerator::emitCall( Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec10
1848	instructions().append(func->index()); // func	1825	instructions().append(func->index()); // func
1849	instructions().append(callArguments.argumentCountIncludingThis()); // argCount	1826	instructions().append(callArguments.argumentCountIncludingThis()); // argCount
1850	instructions().append(callArguments.registerOffset()); // registerOffset	1827	instructions().append(callArguments.registerOffset()); // registerOffset
		1828	#if ENABLE(LLINT)
		1829	instructions().append(m_codeBlock->addLLIntCallLinkInfo());
		1830	#else
1851	instructions().append(0);	1831	instructions().append(0);
		1832	#endif
1852	instructions().append(0);	1833	instructions().append(0);
1853	if (dst != ignoredResult()) {	1834	if (dst != ignoredResult()) {
1854	ValueProfile* profile = emitProfiledOpcode(op_call_put_result);	1835	ValueProfile* profile = emitProfiledOpcode(op_call_put_result);
Lines 1952-1958 RegisterID* BytecodeGenerator::emitConst Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec11
1952	instructions().append(func->index()); // func	1933	instructions().append(func->index()); // func
1953	instructions().append(callArguments.argumentCountIncludingThis()); // argCount	1934	instructions().append(callArguments.argumentCountIncludingThis()); // argCount
1954	instructions().append(callArguments.registerOffset()); // registerOffset	1935	instructions().append(callArguments.registerOffset()); // registerOffset
		1936	#if ENABLE(LLINT)
		1937	instructions().append(m_codeBlock->addLLIntCallLinkInfo());
		1938	#else
1955	instructions().append(0);	1939	instructions().append(0);
		1940	#endif
1956	instructions().append(0);	1941	instructions().append(0);
1957	if (dst != ignoredResult()) {	1942	if (dst != ignoredResult()) {
1958	ValueProfile* profile = emitProfiledOpcode(op_call_put_result);	1943	ValueProfile* profile = emitProfiledOpcode(op_call_put_result);
Lines 2213-2219 RegisterID* BytecodeGenerator::emitCatch Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp_sec12
2213	{	2198	{
2214	m_usesExceptions = true;	2199	m_usesExceptions = true;
2215	#if ENABLE(JIT)	2200	#if ENABLE(JIT)
		2201	#if ENABLE(LLINT)
		2202	HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth, CodeLocationLabel(bitwise_cast<void*>(&llint_op_catch)) };
		2203	#else
2216	HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth, CodeLocationLabel() };	2204	HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth, CodeLocationLabel() };
		2205	#endif
2217	#else	2206	#else
2218	HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth };	2207	HandlerInfo info = { start->bind(0, 0), end->bind(0, 0), instructions().size(), m_dynamicScopeDepth + m_baseScopeDepth };
2219	#endif	2208	#endif

Lines 48-53 void compileOSRExit(ExecState* exec) Source/JavaScriptCore/dfg/DFGOSRExitCompiler.cpp_sec1
- Source/JavaScriptCore/dfg/DFGOSRExitCompiler.cpp +15 lines
48	uint32_t exitIndex = globalData->osrExitIndex;	48	uint32_t exitIndex = globalData->osrExitIndex;
49	OSRExit& exit = codeBlock->osrExit(exitIndex);	49	OSRExit& exit = codeBlock->osrExit(exitIndex);
50		50
		51	// Make sure all code on our inline stack is JIT compiled. This is necessary since
		52	// we may opt to inline a code block even before it had ever been compiled by the
		53	// JIT, but our OSR exit infrastructure currently only works if the target of the
		54	// OSR exit is JIT code. This could be changed since there is nothing particularly
		55	// hard about doing an OSR exit into the interpreter, but for now this seems to make
		56	// sense in that if we're OSR exiting from inlined code of a DFG code block, then
		57	// probably it's a good sign that the thing we're exiting into is hot. Even more
		58	// interestingly, since the code was inlined, it may never otherwise get JIT
		59	// compiled since the act of inlining it may ensure that it otherwise never runs.
		60	for (CodeOrigin codeOrigin = exit.m_codeOrigin; codeOrigin.inlineCallFrame; codeOrigin = codeOrigin.inlineCallFrame->caller) {
		61	static_cast<FunctionExecutable*>(codeOrigin.inlineCallFrame->executable.get())
		62	->baselineCodeBlockFor(codeOrigin.inlineCallFrame->isCall ? CodeForCall : CodeForConstruct)
		63	->jitCompile(*globalData);
		64	}
		65
51	SpeculationRecovery* recovery = 0;	66	SpeculationRecovery* recovery = 0;
52	if (exit.m_recoveryIndex)	67	if (exit.m_recoveryIndex)
53	recovery = &codeBlock->speculationRecovery(exit.m_recoveryIndex - 1);	68	recovery = &codeBlock->speculationRecovery(exit.m_recoveryIndex - 1);

Lines 31-36 Source/JavaScriptCore/dfg/DFGOperations.cpp_sec1
- Source/JavaScriptCore/dfg/DFGOperations.cpp -42 / +1 lines
31	#include "CodeBlock.h"	31	#include "CodeBlock.h"
32	#include "DFGOSRExit.h"	32	#include "DFGOSRExit.h"
33	#include "DFGRepatch.h"	33	#include "DFGRepatch.h"
		34	#include "HostCallReturnValue.h"
34	#include "GetterSetter.h"	35	#include "GetterSetter.h"
35	#include "InlineASM.h"	36	#include "InlineASM.h"
36	#include "Interpreter.h"	37	#include "Interpreter.h"
Lines 671-718 size_t DFG_OPERATION operationCompareStr Source/JavaScriptCore/dfg/DFGOperations.cpp_sec2
671	return JSValue::strictEqual(exec, JSValue::decode(encodedOp1), JSValue::decode(encodedOp2));	672	return JSValue::strictEqual(exec, JSValue::decode(encodedOp1), JSValue::decode(encodedOp2));
672	}	673	}
673		674
674	EncodedJSValue DFG_OPERATION getHostCallReturnValue();
675	EncodedJSValue DFG_OPERATION getHostCallReturnValueWithExecState(ExecState*);
676
677	#if CPU(X86_64)
678	asm (
679	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
680	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
681	"mov -40(%r13), %r13\n"
682	"mov %r13, %rdi\n"
683	"jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
684	);
685	#elif CPU(X86)
686	asm (
687	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
688	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
689	"mov -40(%edi), %edi\n"
690	"mov %edi, 4(%esp)\n"
691	"jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
692	);
693	#elif CPU(ARM_THUMB2)
694	asm (
695	".text" "\n"
696	".align 2" "\n"
697	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
698	HIDE_SYMBOL(getHostCallReturnValue) "\n"
699	".thumb" "\n"
700	".thumb_func " THUMB_FUNC_PARAM(getHostCallReturnValue) "\n"
701	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
702	"ldr r5, [r5, #-40]" "\n"
703	"cpy r0, r5" "\n"
704	"b " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
705	);
706	#endif
707
708	EncodedJSValue DFG_OPERATION getHostCallReturnValueWithExecState(ExecState* exec)
709	{
710	JSGlobalData* globalData = &exec->globalData();
711	NativeCallFrameTracer tracer(globalData, exec);
712
713	return JSValue::encode(exec->globalData().hostCallReturnValue);
714	}
715
716	static void* handleHostCall(ExecState* execCallee, JSValue callee, CodeSpecializationKind kind)	675	static void* handleHostCall(ExecState* execCallee, JSValue callee, CodeSpecializationKind kind)
717	{	676	{
718	ExecState* exec = execCallee->callerFrame();	677	ExecState* exec = execCallee->callerFrame();

Line 0 Source/JavaScriptCore/jit/HostCallReturnValue.cpp_sec1
- Source/JavaScriptCore/jit/HostCallReturnValue.cpp +75 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#include "config.h"
		27	#include "HostCallReturnValue.h"
		28
		29	#include "CallFrame.h"
		30	#include "InlineASM.h"
		31	#include "JSObject.h"
		32	#include "JSValueInlineMethods.h"
		33	#include "ScopeChain.h"
		34
		35	namespace JSC {
		36
		37	extern "C" EncodedJSValue HOST_CALL_RETURN_VALUE_OPTION getHostCallReturnValueWithExecState(ExecState*);
		38
		39	#if CPU(X86_64)
		40	asm (
		41	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
		42	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
		43	"mov -40(%r13), %r13\n"
		44	"mov %r13, %rdi\n"
		45	"jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
		46	);
		47	#elif CPU(X86)
		48	asm (
		49	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
		50	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
		51	"mov -40(%edi), %edi\n"
		52	"mov %edi, 4(%esp)\n"
		53	"jmp " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
		54	);
		55	#elif CPU(ARM_THUMB2)
		56	asm (
		57	".text" "\n"
		58	".align 2" "\n"
		59	".globl " SYMBOL_STRING(getHostCallReturnValue) "\n"
		60	HIDE_SYMBOL(getHostCallReturnValue) "\n"
		61	".thumb" "\n"
		62	".thumb_func " THUMB_FUNC_PARAM(getHostCallReturnValue) "\n"
		63	SYMBOL_STRING(getHostCallReturnValue) ":" "\n"
		64	"ldr r5, [r5, #-40]" "\n"
65	"cpy r0, r5" "\n"
66	"b " SYMBOL_STRING_RELOCATION(getHostCallReturnValueWithExecState) "\n"
67	);
68	#endif
69
70	extern "C" EncodedJSValue HOST_CALL_RETURN_VALUE_OPTION getHostCallReturnValueWithExecState(ExecState* exec)
71	{
72	return JSValue::encode(exec->globalData().hostCallReturnValue);
73	}
74
75	} // namespace JSC

Lines 48-54 namespace JSC { Source/JavaScriptCore/jit/JITCode.h_sec1
- Source/JavaScriptCore/jit/JITCode.h -1 / +13 lines
48	JITCode() { }	48	JITCode() { }
49	#endif	49	#endif
50	public:	50	public:
51	enum JITType { HostCallThunk, BaselineJIT, DFGJIT };	51	enum JITType { None, HostCallThunk, InterpreterThunk, BaselineJIT, DFGJIT };
52		52
53	static JITType bottomTierJIT()	53	static JITType bottomTierJIT()
54	{	54	{
Lines 66-73 namespace JSC { Source/JavaScriptCore/jit/JITCode.h_sec2
66	return DFGJIT;	66	return DFGJIT;
67	}	67	}
68		68
		69	static bool isOptimizingJIT(JITType jitType)
		70	{
		71	return jitType == DFGJIT;
		72	}
		73
		74	static bool isBaselineCode(JITType jitType)
		75	{
		76	return jitType == InterpreterThunk \|\| jitType == BaselineJIT;
		77	}
		78
69	#if ENABLE(JIT)	79	#if ENABLE(JIT)
70	JITCode()	80	JITCode()
		81	: m_jitType(None)
71	{	82	{
72	}	83	}
73		84
Lines 75-80 namespace JSC { Source/JavaScriptCore/jit/JITCode.h_sec3
75	: m_ref(ref)	86	: m_ref(ref)
76	, m_jitType(jitType)	87	, m_jitType(jitType)
77	{	88	{
		89	ASSERT(jitType != None);
78	}	90	}
79		91
80	bool operator !() const	92	bool operator !() const

Lines 26-33 Source/JavaScriptCore/jit/JSInterfaceJIT.h_sec1
- Source/JavaScriptCore/jit/JSInterfaceJIT.h +2 lines
26	#ifndef JSInterfaceJIT_h	26	#ifndef JSInterfaceJIT_h
27	#define JSInterfaceJIT_h	27	#define JSInterfaceJIT_h
28		28
		29	#include "BytecodeConventions.h"
29	#include "JITCode.h"	30	#include "JITCode.h"
30	#include "JITStubs.h"	31	#include "JITStubs.h"
		32	#include "JSString.h"
31	#include "JSValue.h"	33	#include "JSValue.h"
32	#include "MacroAssembler.h"	34	#include "MacroAssembler.h"
33	#include "RegisterFile.h"	35	#include "RegisterFile.h"

Line 0 Source/JavaScriptCore/llint/LLIntCommon.h_sec1
- Source/JavaScriptCore/llint/LLIntCommon.h +33 lines
	1	/*
	2	* Copyright (C) 2012 Apple Inc. All rights reserved.
	3	*
	4	* Redistribution and use in source and binary forms, with or without
	5	* modification, are permitted provided that the following conditions
	6	* are met:
	7	* 1. Redistributions of source code must retain the above copyright
	8	* notice, this list of conditions and the following disclaimer.
	9	* 2. Redistributions in binary form must reproduce the above copyright
	10	* notice, this list of conditions and the following disclaimer in the
	11	* documentation and/or other materials provided with the distribution.
	12	*
	13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
	14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
	17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
	21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
	23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	24	*/
	25
	26	#ifndef LLIntCommon_h
	27	#define LLIntCommon_h
	28
	29	#define LLINT_EXECUTION_TRACING 0
	30	#define LLINT_HELPER_TRACING 0
	31
	32	#endif // LLIntCommon_h
	33

Line 0 Source/JavaScriptCore/llint/LLIntData.cpp_sec1
- Source/JavaScriptCore/llint/LLIntData.cpp +56 lines
	1	/*
	2	* Copyright (C) 2011 Apple Inc. All rights reserved.
	3	*
	4	* Redistribution and use in source and binary forms, with or without
	5	* modification, are permitted provided that the following conditions
	6	* are met:
	7	* 1. Redistributions of source code must retain the above copyright
	8	* notice, this list of conditions and the following disclaimer.
	9	* 2. Redistributions in binary form must reproduce the above copyright
	10	* notice, this list of conditions and the following disclaimer in the
	11	* documentation and/or other materials provided with the distribution.
	12	*
	13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
	14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
	17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
	21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
	23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	24	*/
	25
	26	#include "config.h"
	27	#include "LLIntData.h"
	28
	29	#if ENABLE(LLINT)
	30
	31	#include "Instruction.h"
	32	#include "LowLevelInterpreter.h"
	33	#include "Opcode.h"
	34
	35	namespace JSC { namespace LLInt {
	36
	37	Data::Data()
	38	: m_exceptionInstructions(new Instruction[maxOpcodeLength + 1])
	39	, m_opcodeMap(new Opcode[numOpcodeIDs])
	40	{
	41	for (int i = 0; i < maxOpcodeLength + 1; ++i)
	42	m_exceptionInstructions[i].u.pointer = bitwise_cast<void*>(&llint_throw_from_helper_trampoline);
	43	#define OPCODE_ENTRY(opcode, length) m_opcodeMap[opcode] = bitwise_cast<void*>(&llint_##opcode);
	44	FOR_EACH_OPCODE_ID(OPCODE_ENTRY);
	45	#undef OPCODE_ENTRY
	46	}
	47
	48	Data::~Data()
	49	{
	50	delete[] m_exceptionInstructions;
	51	delete[] m_opcodeMap;
	52	}
	53
	54	} } // namespace JSC::LLInt
	55
	56	#endif // ENABLE(LLINT)

Line 0 Source/JavaScriptCore/llint/LLIntEntrypoints.cpp_sec1
- Source/JavaScriptCore/llint/LLIntEntrypoints.cpp +86 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#include "config.h"
		27	#include "LLIntEntrypoints.h"
		28
		29	#if ENABLE(LLINT)
		30
		31	#include "JITCode.h"
		32	#include "JSGlobalData.h"
		33	#include "LLIntThunks.h"
		34	#include "LowLevelInterpreter.h"
		35
		36	namespace JSC { namespace LLInt {
		37
		38	void getFunctionEntrypoint(JSGlobalData& globalData, CodeSpecializationKind kind, JITCode& jitCode, MacroAssemblerCodePtr& arityCheck)
		39	{
		40	if (!globalData.canUseJIT()) {
		41	if (kind == CodeForCall) {
		42	jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_call_prologue))));
		43	arityCheck = MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_call_arity_check));
		44	return;
		45	}
		46
		47	ASSERT(kind == CodeForConstruct);
		48	jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_construct_prologue))));
		49	arityCheck = MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_function_for_construct_arity_check));
		50	return;
		51	}
		52
		53	if (kind == CodeForCall) {
		54	jitCode = JITCode(globalData.getCTIStub(functionForCallEntryThunkGenerator), JITCode::InterpreterThunk);
		55	arityCheck = globalData.getCTIStub(functionForCallArityCheckThunkGenerator).code();
		56	return;
		57	}
		58
		59	ASSERT(kind == CodeForConstruct);
		60	jitCode = JITCode(globalData.getCTIStub(functionForConstructEntryThunkGenerator), JITCode::InterpreterThunk);
		61	arityCheck = globalData.getCTIStub(functionForConstructArityCheckThunkGenerator).code();
		62	}
		63
		64	void getEvalEntrypoint(JSGlobalData& globalData, JITCode& jitCode)
65	{
66	if (!globalData.canUseJIT()) {
67	jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_eval_prologue))));
68	return;
69	}
70
71	jitCode = JITCode(globalData.getCTIStub(evalEntryThunkGenerator), JITCode::InterpreterThunk);
72	}
73
74	void getProgramEntrypoint(JSGlobalData& globalData, JITCode& jitCode)
75	{
76	if (!globalData.canUseJIT()) {
77	jitCode = JITCode::HostFunction(MacroAssemblerCodeRef::createSelfManagedCodeRef(MacroAssemblerCodePtr(bitwise_cast<void*>(&llint_program_prologue))));
78	return;
79	}
80
81	jitCode = JITCode(globalData.getCTIStub(programEntryThunkGenerator), JITCode::InterpreterThunk);
82	}
83
84	} } // namespace JSC::LLInt
85
86	#endif // ENABLE(LLINT)

Line 0 Source/JavaScriptCore/llint/LLIntExceptions.cpp_sec1
- Source/JavaScriptCore/llint/LLIntExceptions.cpp +80 lines
		1	/*
		2	* Copyright (C) 2011 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#include "config.h"
		27	#include "LLIntExceptions.h"
		28
		29	#if ENABLE(LLINT)
		30
		31	#include "CallFrame.h"
		32	#include "CodeBlock.h"
		33	#include "Instruction.h"
		34	#include "JITExceptions.h"
		35	#include "LLIntCommon.h"
		36	#include "LowLevelInterpreter.h"
		37
		38	namespace JSC { namespace LLInt {
		39
		40	void interpreterThrowInCaller(ExecState* exec)
		41	{
		42	JSGlobalData* globalData = &exec->globalData();
		43	#if LLINT_HELPER_TRACING
		44	printf("Throwing exception %s.\n", globalData->exception.description());
		45	#endif
		46	genericThrow(
		47	globalData, exec->callerFrame(), globalData->exception,
		48	exec->callerFrame()->codeBlock()->bytecodeOffset(exec->callerFrame(), exec->returnPC()));
		49	}
		50
		51	Instruction* returnToThrowForThrownException(ExecState* exec)
		52	{
		53	return exec->globalData().llintData.exceptionInstructions();
		54	}
		55
		56	Instruction* returnToThrow(ExecState* exec, Instruction* pc)
		57	{
		58	JSGlobalData* globalData = &exec->globalData();
		59	#if LLINT_HELPER_TRACING
		60	printf("Throwing exception %s (returnToThrow).\n", globalData->exception.description());
		61	#endif
		62	genericThrow(globalData, exec, globalData->exception, pc - exec->codeBlock()->instructions().begin());
		63
		64	return globalData->llintData.exceptionInstructions();
65	}
66
67	void* callToThrow(ExecState* exec, Instruction* pc)
68	{
69	JSGlobalData* globalData = &exec->globalData();
70	#if LLINT_HELPER_TRACING
71	printf("Throwing exception %s (callToThrow).\n", globalData->exception.description());
72	#endif
73	genericThrow(globalData, exec, globalData->exception, pc - exec->codeBlock()->instructions().begin());
74
75	return bitwise_cast<void*>(&llint_throw_during_call_trampoline);
76	}
77
78	} } // namespace JSC::LLInt
79
80	#endif // ENABLE(LLINT)

Line 0 Source/JavaScriptCore/llint/LLIntHelpers.h_sec1
- Source/JavaScriptCore/llint/LLIntHelpers.h +172 lines
		1	/*
		2	* Copyright (C) 2011 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#ifndef LLIntHelpers_h
		27	#define LLIntHelpers_h
		28
		29	#include <wtf/Platform.h>
		30	#include <wtf/StdLibExtras.h>
		31
		32	#if ENABLE(LLINT)
		33
		34	namespace JSC {
		35
		36	class ExecState;
		37	struct Instruction;
		38
		39	namespace LLInt {
		40
		41	typedef int64_t HelperReturnType;
		42
		43	extern "C" HelperReturnType llint_trace_operand(ExecState, Instruction, int fromWhere, int operand);
		44	extern "C" HelperReturnType llint_trace_value(ExecState, Instruction, int fromWhere, int operand);
		45
		46	#define LLINT_HELPER_DECL(name) \
		47	extern "C" HelperReturnType llint_##name(ExecState* exec, Instruction* pc)
		48
		49	LLINT_HELPER_DECL(trace_prologue);
		50	LLINT_HELPER_DECL(trace_prologue_function_for_call);
		51	LLINT_HELPER_DECL(trace_prologue_function_for_construct);
		52	LLINT_HELPER_DECL(trace_arityCheck_for_call);
		53	LLINT_HELPER_DECL(trace_arityCheck_for_construct);
		54	LLINT_HELPER_DECL(trace);
		55	LLINT_HELPER_DECL(special_trace);
		56	LLINT_HELPER_DECL(entry_osr);
		57	LLINT_HELPER_DECL(entry_osr_function_for_call);
		58	LLINT_HELPER_DECL(entry_osr_function_for_construct);
		59	LLINT_HELPER_DECL(entry_osr_function_for_call_arityCheck);
		60	LLINT_HELPER_DECL(entry_osr_function_for_construct_arityCheck);
		61	LLINT_HELPER_DECL(loop_osr);
		62	LLINT_HELPER_DECL(replace);
		63	LLINT_HELPER_DECL(register_file_check);
		64	LLINT_HELPER_DECL(helper_call_arityCheck);
65	LLINT_HELPER_DECL(helper_construct_arityCheck);
66	LLINT_HELPER_DECL(helper_create_activation);
67	LLINT_HELPER_DECL(helper_create_arguments);
68	LLINT_HELPER_DECL(helper_create_this);
69	LLINT_HELPER_DECL(helper_convert_this);
70	LLINT_HELPER_DECL(helper_new_object);
71	LLINT_HELPER_DECL(helper_new_array);
72	LLINT_HELPER_DECL(helper_new_array_buffer);
73	LLINT_HELPER_DECL(helper_new_regexp);
74	LLINT_HELPER_DECL(helper_not);
75	LLINT_HELPER_DECL(helper_eq);
76	LLINT_HELPER_DECL(helper_neq);
77	LLINT_HELPER_DECL(helper_stricteq);
78	LLINT_HELPER_DECL(helper_nstricteq);
79	LLINT_HELPER_DECL(helper_less);
80	LLINT_HELPER_DECL(helper_lesseq);
81	LLINT_HELPER_DECL(helper_greater);
82	LLINT_HELPER_DECL(helper_greatereq);
83	LLINT_HELPER_DECL(helper_pre_inc);
84	LLINT_HELPER_DECL(helper_pre_dec);
85	LLINT_HELPER_DECL(helper_post_inc);
86	LLINT_HELPER_DECL(helper_post_dec);
87	LLINT_HELPER_DECL(helper_to_jsnumber);
88	LLINT_HELPER_DECL(helper_negate);
89	LLINT_HELPER_DECL(helper_add);
90	LLINT_HELPER_DECL(helper_mul);
91	LLINT_HELPER_DECL(helper_sub);
92	LLINT_HELPER_DECL(helper_div);
93	LLINT_HELPER_DECL(helper_mod);
94	LLINT_HELPER_DECL(helper_lshift);
95	LLINT_HELPER_DECL(helper_rshift);
96	LLINT_HELPER_DECL(helper_urshift);
97	LLINT_HELPER_DECL(helper_bitand);
98	LLINT_HELPER_DECL(helper_bitor);
99	LLINT_HELPER_DECL(helper_bitxor);
100	LLINT_HELPER_DECL(helper_bitnot);
101	LLINT_HELPER_DECL(helper_check_has_instance);
102	LLINT_HELPER_DECL(helper_instanceof);
103	LLINT_HELPER_DECL(helper_typeof);
104	LLINT_HELPER_DECL(helper_is_undefined);
105	LLINT_HELPER_DECL(helper_is_boolean);
106	LLINT_HELPER_DECL(helper_is_number);
107	LLINT_HELPER_DECL(helper_is_string);
108	LLINT_HELPER_DECL(helper_is_object);
109	LLINT_HELPER_DECL(helper_is_function);
110	LLINT_HELPER_DECL(helper_in);
111	LLINT_HELPER_DECL(helper_resolve);
112	LLINT_HELPER_DECL(helper_resolve_skip);
113	LLINT_HELPER_DECL(helper_resolve_global);
114	LLINT_HELPER_DECL(helper_resolve_global_dynamic);
115	LLINT_HELPER_DECL(helper_resolve_for_resolve_global_dynamic);
116	LLINT_HELPER_DECL(helper_resolve_base);
117	LLINT_HELPER_DECL(helper_ensure_property_exists);
118	LLINT_HELPER_DECL(helper_resolve_with_base);
119	LLINT_HELPER_DECL(helper_resolve_with_this);
120	LLINT_HELPER_DECL(helper_get_by_id);
121	LLINT_HELPER_DECL(helper_get_arguments_length);
122	LLINT_HELPER_DECL(helper_put_by_id);
123	LLINT_HELPER_DECL(helper_del_by_id);
124	LLINT_HELPER_DECL(helper_get_by_val);
125	LLINT_HELPER_DECL(helper_get_argument_by_val);
126	LLINT_HELPER_DECL(helper_get_by_pname);
127	LLINT_HELPER_DECL(helper_put_by_val);
128	LLINT_HELPER_DECL(helper_del_by_val);
129	LLINT_HELPER_DECL(helper_put_by_index);
130	LLINT_HELPER_DECL(helper_put_getter);
131	LLINT_HELPER_DECL(helper_put_setter);
132	LLINT_HELPER_DECL(helper_jmp_scopes);
133	LLINT_HELPER_DECL(helper_jtrue);
134	LLINT_HELPER_DECL(helper_jfalse);
135	LLINT_HELPER_DECL(helper_jless);
136	LLINT_HELPER_DECL(helper_jnless);
137	LLINT_HELPER_DECL(helper_jgreater);
138	LLINT_HELPER_DECL(helper_jngreater);
139	LLINT_HELPER_DECL(helper_jlesseq);
140	LLINT_HELPER_DECL(helper_jnlesseq);
141	LLINT_HELPER_DECL(helper_jgreatereq);
142	LLINT_HELPER_DECL(helper_jngreatereq);
143	LLINT_HELPER_DECL(helper_switch_imm);
144	LLINT_HELPER_DECL(helper_switch_char);
145	LLINT_HELPER_DECL(helper_switch_string);
146	LLINT_HELPER_DECL(helper_new_func);
147	LLINT_HELPER_DECL(helper_new_func_exp);
148	LLINT_HELPER_DECL(helper_call);
149	LLINT_HELPER_DECL(helper_construct);
150	LLINT_HELPER_DECL(helper_call_varargs);
151	LLINT_HELPER_DECL(helper_call_eval);
152	LLINT_HELPER_DECL(helper_tear_off_activation);
153	LLINT_HELPER_DECL(helper_tear_off_arguments);
154	LLINT_HELPER_DECL(helper_strcat);
155	LLINT_HELPER_DECL(helper_to_primitive);
156	LLINT_HELPER_DECL(helper_get_pnames);
157	LLINT_HELPER_DECL(helper_next_pname);
158	LLINT_HELPER_DECL(helper_push_scope);
159	LLINT_HELPER_DECL(helper_pop_scope);
160	LLINT_HELPER_DECL(helper_push_new_scope);
161	LLINT_HELPER_DECL(helper_throw);
162	LLINT_HELPER_DECL(helper_throw_reference_error);
163	LLINT_HELPER_DECL(helper_debug);
164	LLINT_HELPER_DECL(helper_profile_will_call);
165	LLINT_HELPER_DECL(helper_profile_did_call);
166
167	} } // namespace JSC::LLInt
168
169	#endif // ENABLE(LLINT)
170
171	#endif // LLIntHelpers_h
172

Line 0 Source/JavaScriptCore/llint/LLIntOfflineAsmConfig.h_sec1
- Source/JavaScriptCore/llint/LLIntOfflineAsmConfig.h +69 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#ifndef LLIntOfflineAsmConfig_h
		27	#define LLIntOfflineAsmConfig_h
		28
		29	#include "LLIntCommon.h"
		30	#include <wtf/Assertions.h>
		31	#include <wtf/Platform.h>
		32
		33	#if CPU(X86)
		34	#define OFFLINE_ASM_X86 1
		35	#else
		36	#define OFFLINE_ASM_X86 0
		37	#endif
		38
		39	#if CPU(ARMv7)
		40	#define OFFLINE_ASM_ARMv7 1
		41	#else
		42	#define OFFLINE_ASM_ARMv7 0
		43	#endif
		44
		45	#if !ASSERT_DISABLED
		46	#define OFFLINE_ASM_ASSERT_ENABLED 1
		47	#else
		48	#define OFFLINE_ASM_ASSERT_ENABLED 0
		49	#endif
		50
		51	#if CPU(BIG_ENDIAN)
		52	#define OFFLINE_ASM_BIG_ENDIAN 1
		53	#else
		54	#define OFFLINE_ASM_BIG_ENDIAN 0
		55	#endif
		56
		57	#if ENABLE(LLINT_OSR_TO_JIT)
		58	#define OFFLINE_ASM_JIT_ENABLED 1
		59	#else
		60	#define OFFLINE_ASM_JIT_ENABLED 0
		61	#endif
		62
		63	#if LLINT_EXECUTION_TRACING
		64	#define OFFLINE_ASM_EXECUTION_TRACING 1
65	#else
66	#define OFFLINE_ASM_EXECUTION_TRACING 0
67	#endif
68
69	#endif // LLIntOfflineAsmConfig_h

Line 0 Source/JavaScriptCore/llint/LLIntOffsetsExtractor.cpp_sec1
- Source/JavaScriptCore/llint/LLIntOffsetsExtractor.cpp +77 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#include "config.h"
		27
		28	#include "AllocationSpace.h"
		29	#include "CodeBlock.h"
		30	#include "Executable.h"
		31	#include "Heap.h"
		32	#include "Interpreter.h"
		33	#include "JITStubs.h"
		34	#include "JSArray.h"
		35	#include "JSCell.h"
		36	#include "JSFunction.h"
		37	#include "JSGlobalData.h"
		38	#include "JSGlobalObject.h"
		39	#include "JSObject.h"
		40	#include "JSPropertyNameIterator.h"
		41	#include "JSString.h"
		42	#include "JSTypeInfo.h"
		43	#include "JSVariableObject.h"
		44	#include "JumpTable.h"
		45	#include "LLIntOfflineAsmConfig.h"
		46	#include "MarkedSpace.h"
		47	#include "RegisterFile.h"
		48	#include "ScopeChain.h"
		49	#include "Structure.h"
		50	#include "StructureChain.h"
		51	#include "ValueProfile.h"
		52	#include <wtf/text/StringImpl.h>
		53
		54	namespace JSC {
		55
		56	#define OFFLINE_ASM_OFFSETOF(clazz, field) OBJECT_OFFSETOF(clazz, field)
		57
		58	class LLIntOffsetsExtractor {
		59	public:
		60	static const unsigned* dummy();
		61	};
		62
		63	const unsigned* LLIntOffsetsExtractor::dummy()
		64	{
65	#include "LLIntDesiredOffsets.h"
66	return extractorTable;
67	}
68
69	} // namespace JSC
70
71	int main(int, char**)
72	{
73	// Out of an abundance of caution, make sure that LLIntOffsetsExtractor::dummy() is live,
74	// and the extractorTable is live, too.
75	printf("%p\n", JSC::LLIntOffsetsExtractor::dummy());
76	return 0;
77	}

Line 0 Source/JavaScriptCore/llint/LLIntThunks.cpp_sec1
- Source/JavaScriptCore/llint/LLIntThunks.cpp +81 lines
		1	/*
		2	* Copyright (C) 2012 Apple Inc. All rights reserved.
		3	*
		4	* Redistribution and use in source and binary forms, with or without
		5	* modification, are permitted provided that the following conditions
		6	* are met:
		7	* 1. Redistributions of source code must retain the above copyright
		8	* notice, this list of conditions and the following disclaimer.
		9	* 2. Redistributions in binary form must reproduce the above copyright
		10	* notice, this list of conditions and the following disclaimer in the
		11	* documentation and/or other materials provided with the distribution.
		12	*
		13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
		14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
		15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
		17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
		18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
		20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
		21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
		23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		24	*/
		25
		26	#include "config.h"
		27	#include "LLIntThunks.h"
		28
		29	#if ENABLE(LLINT)
		30
		31	#include "JSInterfaceJIT.h"
		32	#include "LinkBuffer.h"
		33	#include "LowLevelInterpreter.h"
		34
		35	namespace JSC { namespace LLInt {
		36
		37	static MacroAssemblerCodeRef generateThunkWithJumpTo(JSGlobalData* globalData, void (*target)())
		38	{
		39	JSInterfaceJIT jit;
		40
		41	// FIXME: there's probably a better way to do it on X86, but I'm not sure I care.
		42	jit.move(JSInterfaceJIT::TrustedImmPtr(bitwise_cast<void*>(target)), JSInterfaceJIT::regT0);
		43	jit.jump(JSInterfaceJIT::regT0);
		44
		45	LinkBuffer patchBuffer(*globalData, &jit, GLOBAL_THUNK_ID);
		46	return patchBuffer.finalizeCode();
		47	}
		48
		49	MacroAssemblerCodeRef functionForCallEntryThunkGenerator(JSGlobalData* globalData)
		50	{
		51	return generateThunkWithJumpTo(globalData, llint_function_for_call_prologue);
		52	}
		53
		54	MacroAssemblerCodeRef functionForConstructEntryThunkGenerator(JSGlobalData* globalData)
		55	{
		56	return generateThunkWithJumpTo(globalData, llint_function_for_construct_prologue);
		57	}
		58
		59	MacroAssemblerCodeRef functionForCallArityCheckThunkGenerator(JSGlobalData* globalData)
		60	{
		61	return generateThunkWithJumpTo(globalData, llint_function_for_call_arity_check);
		62	}
		63
		64	MacroAssemblerCodeRef functionForConstructArityCheckThunkGenerator(JSGlobalData* globalData)
65	{
66	return generateThunkWithJumpTo(globalData, llint_function_for_construct_arity_check);
67	}
68
69	MacroAssemblerCodeRef evalEntryThunkGenerator(JSGlobalData* globalData)
70	{
71	return generateThunkWithJumpTo(globalData, llint_eval_prologue);
72	}
73
74	MacroAssemblerCodeRef programEntryThunkGenerator(JSGlobalData* globalData)
75	{
76	return generateThunkWithJumpTo(globalData, llint_program_prologue);
77	}
78
79	} } // namespace JSC::LLInt
80
81	#endif // ENABLE(LLINT)

Line 0 Source/JavaScriptCore/llint/LowLevelInterpreter.cpp_sec1
- Source/JavaScriptCore/llint/LowLevelInterpreter.cpp +35 lines
	1	/*
	2	* Copyright (C) 2012 Apple Inc. All rights reserved.
	3	*
	4	* Redistribution and use in source and binary forms, with or without
	5	* modification, are permitted provided that the following conditions
	6	* are met:
	7	* 1. Redistributions of source code must retain the above copyright
	8	* notice, this list of conditions and the following disclaimer.
	9	* 2. Redistributions in binary form must reproduce the above copyright
	10	* notice, this list of conditions and the following disclaimer in the
	11	* documentation and/or other materials provided with the distribution.
	12	*
	13	* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
	14	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	15	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	16	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
	17	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	18	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	19	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	20	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
	21	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	22	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
	23	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	24	*/
	25
	26	#include "config.h"
	27	#include "LowLevelInterpreter.h"
	28
	29	#if ENABLE(LLINT)
	30
	31	#include "LLIntOfflineAsmConfig.h"
	32
	33	#include "LLIntAssembly.h"
	34
	35	#endif // ENABLE(LLINT)

Line 0 Source/JavaScriptCore/offlineasm/armv7.rb_sec1
- Source/JavaScriptCore/offlineasm/armv7.rb +193 lines
		1	# Copyright (C) 2011 Apple Inc. All rights reserved.
		2	#
		3	# Redistribution and use in source and binary forms, with or without
		4	# modification, are permitted provided that the following conditions
		5	# are met:
		6	# 1. Redistributions of source code must retain the above copyright
		7	# notice, this list of conditions and the following disclaimer.
		8	# 2. Redistributions in binary form must reproduce the above copyright
		9	# notice, this list of conditions and the following disclaimer in the
		10	# documentation and/or other materials provided with the distribution.
		11	#
		12	# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
		13	# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
		14	# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		15	# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
		16	# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
		17	# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
		18	# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
		19	# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
		20	# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
		21	# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
		22	# THE POSSIBILITY OF SUCH DAMAGE.
		23
		24	class SpecialRegister
		25	def initialize(name)
		26	@name = name
		27	end
		28
		29	def armV7Operand
		30	@name
		31	end
		32	end
		33
		34	ARMv7_DATA_REG = SpecialRegister.new("ip")
		35	ARMv7_ADDR_REG = SpecialRegister.new("r3")
		36
		37	def moveImmediate(value, register)
		38	# Currently we only handle the simple cases, and fall back to mov/movt for the complex ones.
		39	if value >= 0 && value < 256
		40	$asm.puts "movw \##{value}, #{register.armV7Operand}"
		41	elsif (~value) >= 0 && (~value) < 256
		42	$asm.puts "mvnw \##{~value}, #{register.armV7Operand}"
		43	else
		44	$asm.puts "movw \##{value & 0xffff}, #{register.armV7Operand}"
		45	if (value & 0xffff0000) != 0
		46	$asm.puts "movt \##{value >> 16}, #{register.armV7Operand}"
		47	end
		48	end
		49	end
		50
		51	class RegisterID
		52	def armV7Operand
		53	case name
		54	when "t0", "a0", "r0"
		55	"r0"
		56	when "t1", "a1", "r1"
		57	"r1"
		58	when "t2", "a2"
		59	"r2"
		60	when "a3"
		61	"r3"
		62	when "t3"
		63	"r4"
		64	when "t4"
65	"r7"
66	when "cfr"
67	"r5"
68	else
69	raise
70	end
71	end
72
73	def armV7PreparePossibleMemoryOperand
74	end
75
76	def armV7PossibleMemoryOperand
77	armV7Operand
78	end
79
80	def armV7LoadStoreWrap
81	yield
82	end
83	end
84
85	class FPRegisterID
86	def armV7Operand
87	case name
88	when "ft0", "fr"
89	"d0"
90	when "fr1",
91	"d1"
92	when "fr2"
93	"d2"
94	when "fr3"
95	"d3"
96	when "fr4"
97	"d4"
98	when "fr5"
99	"d5"
100	else
101	raise
102	end
103	end
104
105	def armV7PreparePossibleMemoryOperand
106	end
107
108	def armV7PossibleMemoryOperand
109	armV7Operand
110	end
111
112	def armV7LoadStoreWrap
113	yield self
114	end
115	end
116
117	class Immediate
118	def armV7Operand
119	raise "Invalid immediate #{value}" if value < 0 or value > 255
120	"#${value}"
121	end
122
123	def armV7PreparePossibleMemoryOperand
124	end
125
126	def armV7PossibleMemoryOperand
127	armV7Operand
128	end
129
130	def armV7LoadStoreWrap
131	yield self
132	end
133	end
134
135	module ARMv7AddressUtilities
136	def armV7LoadStoreWrap
137	self.armV7PreparePossibleMemoryOperand
138	$asm.puts "\tldr #{self.armV7PossiblyMemoryOperand}, #{ARMv7_DATA_REG.armV7Operand}"
139	yield ARMv7_DATA_REG
140	$asm.puts "\tstr #{ARMv7_DATA_REG.armV7Operand}, #{self.armV7PossiblyMemoryOperand}"
141	end
142	end
143
144	class Address
145	include ARMv7AddressUtilities
146
147	def armV7PreparePossibleMemoryOperand
148	if offset.value < -0xff \|\| offset.value > 0xfff
149	moveImmediate(offset.value, ARMv7_ADDR_REG)
150	end
151	end
152
153	def armV7PossibleMemoryOperand
154	if offset.value < -0xff \|\| offset.value > 0xfff
155	"[#{base.armV7Operand}, #{ARMv7_ADDR_REG.armV7Operand}]"
156	else
157	"[#{base.armV7Operand}, #{offset.armV7Operand}]"
158	end
159	end
160	end
161
162	class BaseIndex
163	include ARMv7AddressUtilities
164
165	def armV7PreparePossibleMemoryOperand
166	if offset.value != 0
167	moveImmediate(offset.value, ARMv7_ADDR_REG)
168	$asm.puts "addw #{ARMv7_ADDR_REG.armV7Operand}, #{base.armV7Operand}"
169	end
170	end
171
172	def armV7PossibleMemoryOperand
173	if offset.value != 0
174	"[#{ARMv7_ADDR_REG.armV7Operand}, #{index.armV7Operand}, lsl \##{scale}]"
175	else
176	"[#{base.armV7Operand}, #{index.armV7Operand}, lsl \##{scale}]"
177	end
178	end
179	end
180
181	class AbsoluteAddress
182	include ARMv7AddressUtilities
183
184	def armV7PreparePossibleMemoryOperand
185	moveImmediate(address.value, ARMv7_ADDR_REG)
186	end
187
188	def armV7PossibleMemoryOperand
189	"[#{ARMv7_ADDR_REG.armV7Operand}]"
190	end
191	end
192
193

Line 0 Source/JavaScriptCore/offlineasm/asm.rb_sec1
- Source/JavaScriptCore/offlineasm/asm.rb +108 lines
		1	#!/usr/bin/env ruby
		2
		3	# Copyright (C) 2011 Apple Inc. All rights reserved.
		4	#
		5	# Redistribution and use in source and binary forms, with or without
		6	# modification, are permitted provided that the following conditions
		7	# are met:
		8	# 1. Redistributions of source code must retain the above copyright
		9	# notice, this list of conditions and the following disclaimer.
		10	# 2. Redistributions in binary form must reproduce the above copyright
		11	# notice, this list of conditions and the following disclaimer in the
		12	# documentation and/or other materials provided with the distribution.
		13	#
		14	# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
		15	# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
		16	# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		17	# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
		18	# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
		19	# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
		20	# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
		21	# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
		22	# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
		23	# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
		24	# THE POSSIBILITY OF SUCH DAMAGE.
		25
		26	$: << File.dirname(__FILE__)
		27
		28	require "backends"
		29	require "digest/sha1"
		30	require "offsets"
		31	require "parser"
		32	require "settings"
		33	require "transform"
		34
		35	class Assembler
		36	def initialize(outp)
		37	@outp = outp
		38	@state = :cpp
		39	end
		40
		41	def enterAsm
		42	@outp.puts "asm ("
		43	@state = :asm
		44	end
		45
		46	def leaveAsm
		47	@outp.puts ");"
		48	@state = :cpp
		49	end
		50
		51	def inAsm
		52	enterAsm
		53	yield
		54	leaveAsm
		55	end
		56
		57	def puts(line)
		58	raise unless @state == :asm
		59	@outp.puts((line + "\n").inspect)
		60	end
		61
		62	def comment(text)
		63	@outp.puts "// #{text}"
		64	end
65	end
66
67	asmFile = ARGV.shift
68	offsetsFile = ARGV.shift
69	outputFlnm = ARGV.shift
70
71	offsetsList, configIndex = offsetsAndConfigurationIndex(offsetsFile)
72	inputData = IO::read(asmFile)
73
74	inputHash =
75	"// offlineasm input hash: " + Digest::SHA1.hexdigest(inputData) +
76	" " + Digest::SHA1.hexdigest((offsetsList + [configIndex]).join(' '))
77
78	if FileTest.exist? outputFlnm
79	File.open(outputFlnm, "r") {
80	\| inp \|
81	firstLine = inp.gets
82	if firstLine and firstLine.chomp == inputHash
83	$stderr.puts "Nothing changed."
84	exit 0
85	end
86	}
87	end
88
89	File.open(outputFlnm, "w") {
90	\| outp \|
91	$output = outp
92	$output.puts inputHash
93
94	$asm = Assembler.new($output)
95
96	ast = parse(lex(inputData))
97
98	forSettings(computeSettingsCombinations(ast)[configIndex], ast) {
99	\| concreteSettings, lowLevelAST, backend \|
100	assertConfiguration(concreteSettings)
101	lowLevelAST = lowLevelAST.resolve(*buildOffsetsMap(lowLevelAST, offsetsList))
102	emitCodeInConfiguration(concreteSettings, lowLevelAST, backend) {
103	$asm.inAsm {
104	lowLevelAST.lower(backend)
105	}
106	}
107	}
108	}

Line 0 Source/JavaScriptCore/offlineasm/ast.rb_sec1
- Source/JavaScriptCore/offlineasm/ast.rb +813 lines
		1	# Copyright (C) 2011 Apple Inc. All rights reserved.
		2	#
		3	# Redistribution and use in source and binary forms, with or without
		4	# modification, are permitted provided that the following conditions
		5	# are met:
		6	# 1. Redistributions of source code must retain the above copyright
		7	# notice, this list of conditions and the following disclaimer.
		8	# 2. Redistributions in binary form must reproduce the above copyright
		9	# notice, this list of conditions and the following disclaimer in the
		10	# documentation and/or other materials provided with the distribution.
		11	#
		12	# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
		13	# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
		14	# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		15	# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
		16	# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
		17	# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
		18	# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
		19	# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
		20	# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
		21	# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
		22	# THE POSSIBILITY OF SUCH DAMAGE.
		23
		24	#
		25	# Base utility types for the AST.
		26	#
		27
		28	# Valid methods for Node:
		29	#
		30	# node.children -> Returns an array of immediate children.
		31	#
		32	# node.descendents -> Returns an array of all strict descendants (children
		33	# and children of children, transitively).
		34	#
		35	# node.flatten -> Returns an array containing the strict descendants and
		36	# the node itself.
		37	#
		38	# node.filter(type) -> Returns an array containing those elements in
		39	# node.flatten that are of the given type (is_a? type returns true).
		40	#
		41	# node.mapChildren{\|v\| ...} -> Returns a new node with all children
		42	# replaced according to the given block.
		43	#
		44	# Examples:
		45	#
		46	# node.filter(Setting).uniq -> Returns all of the settings that the AST's
		47	# IfThenElse blocks depend on.
		48	#
		49	# node.filter(StructOffset).uniq -> Returns all of the structure offsets
		50	# that the AST depends on.
		51
		52	class Node
		53	attr_reader :codeOrigin
		54
		55	def initialize(codeOrigin)
		56	@codeOrigin = codeOrigin
		57	end
		58
		59	def codeOriginString
		60	"line number #{@codeOrigin}"
		61	end
		62
		63	def descendants
		64	children.collect{\|v\| v.flatten}.flatten
65	end
66
67	def flatten
68	[self] + descendants
69	end
70
71	def filter(type)
72	flatten.select{\|v\| v.is_a? type}
73	end
74	end
75
76	class NoChildren < Node
77	def initialize(codeOrigin)
78	super(codeOrigin)
79	end
80
81	def children
82	[]
83	end
84
85	def mapChildren
86	self
87	end
88	end
89
90	class StructOffsetKey
91	attr_reader :struct, :field
92
93	def initialize(struct, field)
94	@struct = struct
95	@field = field
96	end
97
98	def hash
99	@struct.hash + @field.hash * 3
100	end
101
102	def eql?(other)
103	@struct == other.struct and @field == other.field
104	end
105	end
106
107	#
108	# AST nodes.
109	#
110
111	class StructOffset < NoChildren
112	attr_reader :struct, :field
113
114	def initialize(codeOrigin, struct, field)
115	super(codeOrigin)
116	@struct = struct
117	@field = field
118	end
119
120	@@mapping = {}
121
122	def self.forField(codeOrigin, struct, field)
123	key = StructOffsetKey.new(struct, field)
124
125	unless @@mapping[key]
126	@@mapping[key] = StructOffset.new(codeOrigin, struct, field)
127	end
128	@@mapping[key]
129	end
130
131	def dump
132	"#{struct}::#{field}"
133	end
134
135	def <=>(other)
136	if @struct != other.struct
137	return @struct <=> other.struct
138	end
139	@field <=> other.field
140	end
141	end
142
143	class Sizeof < NoChildren
144	attr_reader :struct
145
146	def initialize(codeOrigin, struct)
147	super(codeOrigin)
148	@struct = struct
149	end
150
151	@@mapping = {}
152
153	def self.forName(codeOrigin, struct)
154	unless @@mapping[struct]
155	@@mapping[struct] = Sizeof.new(codeOrigin, struct)
156	end
157	@@mapping[struct]
158	end
159
160	def dump
161	"sizeof #{@struct}"
162	end
163
164	def <=>(other)
165	@struct <=> other.struct
166	end
167	end
168
169	class Immediate < NoChildren
170	attr_reader :value
171
172	def initialize(codeOrigin, value)
173	super(codeOrigin)
174	@value = value
175	end
176
177	def dump
178	"#{value}"
179	end
180
181	def ==(other)
182	other.is_a? Immediate and other.value == @value
183	end
184	end
185
186	class AddImmediates < Node
187	attr_reader :left, :right
188
189	def initialize(codeOrigin, left, right)
190	super(codeOrigin)
191	@left = left
192	@right = right
193	end
194
195	def children
196	[@left, @right]
197	end
198
199	def mapChildren
200	AddImmediates.new(codeOrigin, (yield @left), (yield @right))
201	end
202
203	def dump
204	"(#{left.dump} + #{right.dump})"
205	end
206	end
207
208	class SubImmediates < Node
209	attr_reader :left, :right
210
211	def initialize(codeOrigin, left, right)
212	super(codeOrigin)
213	@left = left
214	@right = right
215	end
216
217	def children
218	[@left, @right]
219	end
220
221	def mapChildren
222	SubImmediates.new(codeOrigin, (yield @left), (yield @right))
223	end
224
225	def dump
226	"(#{left.dump} - #{right.dump})"
227	end
228	end
229
230	class MulImmediates < Node
231	attr_reader :left, :right
232
233	def initialize(codeOrigin, left, right)
234	super(codeOrigin)
235	@left = left
236	@right = right
237	end
238
239	def children
240	[@left, @right]
241	end
242
243	def mapChildren
244	MulImmediates.new(codeOrigin, (yield @left), (yield @right))
245	end
246
247	def dump
248	"(#{left.dump} * #{right.dump})"
249	end
250	end
251
252	class NegImmediate < Node
253	attr_reader :child
254
255	def initialize(codeOrigin, child)
256	super(codeOrigin)
257	@child = child
258	end
259
260	def children
261	[@child]
262	end
263
264	def mapChildren
265	NegImmediate.new(codeOrigin, (yield @child))
266	end
267
268	def dump
269	"(-#{@child.dump})"
270	end
271	end
272
273	class RegisterID < NoChildren
274	attr_reader :name
275
276	def initialize(codeOrigin, name)
277	super(codeOrigin)
278	@name = name
279	end
280
281	@@mapping = {}
282
283	def self.forName(codeOrigin, name)
284	unless @@mapping[name]
285	@@mapping[name] = RegisterID.new(codeOrigin, name)
286	end
287	@@mapping[name]
288	end
289
290	def dump
291	name
292	end
293	end
294
295	class FPRegisterID < NoChildren
296	attr_reader :name
297
298	def initialize(codeOrigin, name)
299	super(codeOrigin)
300	@name = name
301	end
302
303	@@mapping = {}
304
305	def self.forName(codeOrigin, name)
306	unless @@mapping[name]
307	@@mapping[name] = FPRegisterID.new(codeOrigin, name)
308	end
309	@@mapping[name]
310	end
311
312	def dump
313	name
314	end
315	end
316
317	class Variable < NoChildren
318	attr_reader :name
319
320	def initialize(codeOrigin, name)
321	super(codeOrigin)
322	@name = name
323	end
324
325	@@mapping = {}
326
327	def self.forName(codeOrigin, name)
328	unless @@mapping[name]
329	@@mapping[name] = Variable.new(codeOrigin, name)
330	end
331	@@mapping[name]
332	end
333
334	def dump
335	name
336	end
337	end
338
339	class Address < Node
340	attr_reader :base, :offset
341
342	def initialize(codeOrigin, base, offset)
343	super(codeOrigin)
344	@base = base
345	@offset = offset
346	end
347
348	def children
349	[@base, @offset]
350	end
351
352	def mapChildren
353	Address.new(codeOrigin, (yield @base), (yield @offset))
354	end
355
356	def dump
357	"#{offset.dump}[#{base.dump}]"
358	end
359	end
360
361	class BaseIndex < Node
362	attr_reader :base, :index, :scale, :offset
363
364	def initialize(codeOrigin, base, index, scale, offset)
365	super(codeOrigin)
366	@base = base
367	@index = index
368	@scale = scale
369	raise unless [1, 2, 4, 8].member? @scale
370	@offset = offset
371	end
372
373	def children
374	[@base, @index, @offset]
375	end
376
377	def mapChildren
378	BaseIndex.new(codeOrigin, (yield @base), (yield @index), @scale, (yield @offset))
379	end
380
381	def dump
382	"#{offset.dump}[#{base.dump}, #{index.dump}, #{scale}]"
383	end
384	end
385
386	class AbsoluteAddress < NoChildren
387	attr_reader :address
388
389	def initialize(codeOrigin, address)
390	super(codeOrigin)
391	@address = address
392	end
393
394	def dump
395	"#{address.dump}[]"
396	end
397	end
398
399	class Instruction < Node
400	attr_reader :opcode, :operands
401
402	def initialize(codeOrigin, opcode, operands)
403	super(codeOrigin)
404	@opcode = opcode
405	@operands = operands
406	end
407
408	def children
409	operands
410	end
411
412	def mapChildren(&proc)
413	Instruction.new(codeOrigin, @opcode, @operands.map(&proc))
414	end
415
416	def dump
417	"\t" + opcode.to_s + " " + operands.collect{\|v\| v.dump}.join(", ")
418	end
419	end
420
421	class Error < NoChildren
422	def initialize(codeOrigin)
423	super(codeOrigin)
424	end
425
426	def dump
427	"\terror"
428	end
429	end
430
431	class ConstDecl < Node
432	attr_reader :variable, :value
433
434	def initialize(codeOrigin, variable, value)
435	super(codeOrigin)
436	@variable = variable
437	@value = value
438	end
439
440	def children
441	[@variable, @value]
442	end
443
444	def mapChildren
445	ConstDecl.new(codeOrigin, (yield @variable), (yield @value))
446	end
447
448	def dump
449	"const #{@variable.dump} = #{@value.dump}"
450	end
451	end
452
453	$labelMapping = {}
454
455	class Label < NoChildren
456	attr_reader :name
457
458	def initialize(codeOrigin, name)
459	super(codeOrigin)
460	@name = name
461	end
462
463	def self.forName(codeOrigin, name)
464	if $labelMapping[name]
465	raise "Label name collision: #{name}" unless $labelMapping[name].is_a? Label
466	else
467	$labelMapping[name] = Label.new(codeOrigin, name)
468	end
469	$labelMapping[name]
470	end
471
472	def dump
473	"#{name}:"
474	end
475	end
476
477	class LocalLabel < NoChildren
478	attr_reader :name
479
480	def initialize(codeOrigin, name)
481	super(codeOrigin)
482	@name = name
483	end
484
485	@@uniqueNameCounter = 0
486
487	def self.forName(codeOrigin, name)
488	if $labelMapping[name]
489	raise "Label name collision: #{name}" unless $labelMapping[name].is_a? LocalLabel
490	else
491	$labelMapping[name] = LocalLabel.new(codeOrigin, name)
492	end
493	$labelMapping[name]
494	end
495
496	def self.unique(comment)
497	newName = "_#{comment}"
498	if $labelMapping[newName]
499	while $labelMapping[newName = "_#{@@uniqueNameCounter}_#{comment}"]
500	@@uniqueNameCounter += 1
501	end
502	end
503	forName(nil, newName)
504	end
505
506	def cleanName
507	if name =~ /^\./
508	"_" + name[1..-1]
509	else
510	name
511	end
512	end
513
514	def dump
515	"#{name}:"
516	end
517	end
518
519	class LabelReference < Node
520	attr_reader :label
521
522	def initialize(codeOrigin, label)
523	super(codeOrigin)
524	@label = label
525	end
526
527	def children
528	[@label]
529	end
530
531	def mapChildren
532	LabelReference.new(codeOrigin, (yield @label))
533	end
534
535	def name
536	label.name
537	end
538
539	def dump
540	label.name
541	end
542	end
543
544	class LocalLabelReference < NoChildren
545	attr_reader :label
546
547	def initialize(codeOrigin, label)
548	super(codeOrigin)
549	@label = label
550	end
551
552	def children
553	[@label]
554	end
555
556	def mapChildren
557	LocalLabelReference.new(codeOrigin, (yield @label))
558	end
559
560	def name
561	label.name
562	end
563
564	def dump
565	label.name
566	end
567	end
568
569	class Sequence < Node
570	attr_reader :list
571
572	def initialize(codeOrigin, list)
573	super(codeOrigin)
574	@list = list
575	end
576
577	def children
578	list
579	end
580
581	def mapChildren(&proc)
582	Sequence.new(codeOrigin, @list.map(&proc))
583	end
584
585	def dump
586	list.collect{\|v\| v.dump}.join("\n")
587	end
588	end
589
590	class True < NoChildren
591	def initialize
592	super(nil)
593	end
594
595	@@instance = True.new
596
597	def self.instance
598	@@instance
599	end
600
601	def value
602	true
603	end
604
605	def dump
606	"true"
607	end
608	end
609
610	class False < NoChildren
611	def initialize
612	super(nil)
613	end
614
615	@@instance = False.new
616
617	def self.instance
618	@@instance
619	end
620
621	def value
622	false
623	end
624
625	def dump
626	"false"
627	end
628	end
629
630	class TrueClass
631	def asNode
632	True.instance
633	end
634	end
635
636	class FalseClass
637	def asNode
638	False.instance
639	end
640	end
641
642	class Setting < NoChildren
643	attr_reader :name
644
645	def initialize(codeOrigin, name)
646	super(codeOrigin)
647	@name = name
648	end
649
650	@@mapping = {}
651
652	def self.forName(codeOrigin, name)
653	unless @@mapping[name]
654	@@mapping[name] = Setting.new(codeOrigin, name)
655	end
656	@@mapping[name]
657	end
658
659	def dump
660	name
661	end
662	end
663
664	class And < Node
665	attr_reader :left, :right
666
667	def initialize(codeOrigin, left, right)
668	super(codeOrigin)
669	@left = left
670	@right = right
671	end
672
673	def children
674	[@left, @right]
675	end
676
677	def mapChildren
678	And.new(codeOrigin, (yield @left), (yield @right))
679	end
680
681	def dump
682	"(#{left.dump} and #{right.dump})"
683	end
684	end
685
686	class Or < Node
687	attr_reader :left, :right
688
689	def initialize(codeOrigin, left, right)
690	super(codeOrigin)
691	@left = left
692	@right = right
693	end
694
695	def children
696	[@left, @right]
697	end
698
699	def mapChildren
700	Or.new(codeOrigin, (yield @left), (yield @right))
701	end
702
703	def dump
704	"(#{left.dump} or #{right.dump})"
705	end
706	end
707
708	class Not < Node
709	attr_reader :child
710
711	def initialize(codeOrigin, child)
712	super(codeOrigin)
713	@child = child
714	end
715
716	def children
717	[@left, @right]
718	end
719
720	def mapChildren
721	Not.new(codeOrigin, (yield @child))
722	end
723
724	def dump
725	"(not #{child.dump})"
726	end
727	end
728
729	class Skip < NoChildren
730	def initialize(codeOrigin)
731	super(codeOrigin)
732	end
733
734	def dump
735	"\tskip"
736	end
737	end
738
739	class IfThenElse < Node
740	attr_reader :predicate, :thenCase
741	attr_accessor :elseCase
742
743	def initialize(codeOrigin, predicate, thenCase)
744	super(codeOrigin)
745	@predicate = predicate
746	@thenCase = thenCase
747	@elseCase = Skip.new(codeOrigin)
748	end
749
750	def children
751	if @elseCase
752	[@predicate, @thenCase, @elseCase]
753	else
754	[@predicate, @thenCase]
755	end
756	end
757
758	def mapChildren
759	IfThenElse.new(codeOrigin, (yield @predicate), (yield @thenCase), (yield @elseCase))
760	end
761
762	def dump
763	"if #{predicate.dump}\n" + thenCase.dump + "\nelse\n" + elseCase.dump + "\nend"
764	end
765	end
766
767	class Macro < Node
768	attr_reader :name, :variables, :body
769
770	def initialize(codeOrigin, name, variables, body)
771	super(codeOrigin)
772	@name = name
773	@variables = variables
774	@body = body
775	end
776
777	def children
778	@variables + [@body]
779	end
780
781	def mapChildren
782	Macro.new(codeOrigin, @name, @variables.map{\|v\| yield v}, (yield @body))
783	end
784
785	def dump
786	"macro #{name}(" + variables.collect{\|v\| v.dump}.join(", ") + ")\n" + body.dump + "\nend"
787	end
788	end
789
790	class MacroCall < Node
791	attr_reader :name, :operands
792
793	def initialize(codeOrigin, name, operands)
794	super(codeOrigin)
795	@name = name
796	@operands = operands
797	raise unless @operands
798	@operands.each{\|v\| raise unless v}
799	end
800
801	def children
802	@operands
803	end
804
805	def mapChildren(&proc)
806	MacroCall.new(codeOrigin, @name, @operands.map(&proc))
807	end
808
809	def dump
810	"\t#{name}(" + operands.collect{\|v\| v.dump}.join(", ") + ")"
811	end
812	end
813

Line 0 Source/JavaScriptCore/offlineasm/backends.rb_sec1
- Source/JavaScriptCore/offlineasm/backends.rb +80 lines
		1	# Copyright (C) 2011 Apple Inc. All rights reserved.
		2	#
		3	# Redistribution and use in source and binary forms, with or without
		4	# modification, are permitted provided that the following conditions
		5	# are met:
		6	# 1. Redistributions of source code must retain the above copyright
		7	# notice, this list of conditions and the following disclaimer.
		8	# 2. Redistributions in binary form must reproduce the above copyright
		9	# notice, this list of conditions and the following disclaimer in the
		10	# documentation and/or other materials provided with the distribution.
		11	#
		12	# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
		13	# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
		14	# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		15	# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
		16	# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
		17	# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
		18	# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
		19	# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
		20	# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
		21	# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
		22	# THE POSSIBILITY OF SUCH DAMAGE.
		23
		24	require "ast"
		25	require "x86"
		26
		27	BACKENDS =
		28	[
		29	"X86",
		30	"ARMv7"
		31	]
		32
		33	WORKING_BACKENDS =
		34	[
		35	"X86"
		36	]
		37
		38	BACKEND_PATTERN = Regexp.new('\\A(' + BACKENDS.join(')\|(') + ')\\Z')
		39
		40	class Node
		41	def lower(name)
		42	send("lower" + name)
		43	end
		44	end
		45
		46	# Overrides for lower() for those nodes that are backend-agnostic
		47
		48	def sanitizeLabelName(name)
		49	# Some platforms don't want the leading "_". If we ever want to do something
		50	# about that, it would be here.
		51	name
		52	end
		53
		54	class Label
		55	def lower(name)
		56	$asm.puts ".globl #{sanitizeLabelName(self.name)}"
		57	$asm.puts "#{sanitizeLabelName(self.name)}:"
		58	end
		59	end
		60
		61	class LocalLabel
		62	def lower(name)
		63	$asm.puts "L_offlineasm_#{self.name[1..-1]}:"
		64	end
65	end
66
67	class Skip
68	def lower(name)
69	end
70	end
71
72	class Sequence
73	def lower(name)
74	@list.each {
75	\| node \|
76	node.lower(name)
77	}
78	end
79	end
80

Line 0 Source/JavaScriptCore/offlineasm/generate_offset_extractor.rb_sec1
- Source/JavaScriptCore/offlineasm/generate_offset_extractor.rb +87 lines
		1	#!/usr/bin/env ruby
		2
		3	# Copyright (C) 2011 Apple Inc. All rights reserved.
		4	#
		5	# Redistribution and use in source and binary forms, with or without
		6	# modification, are permitted provided that the following conditions
		7	# are met:
		8	# 1. Redistributions of source code must retain the above copyright
		9	# notice, this list of conditions and the following disclaimer.
		10	# 2. Redistributions in binary form must reproduce the above copyright
		11	# notice, this list of conditions and the following disclaimer in the
		12	# documentation and/or other materials provided with the distribution.
		13	#
		14	# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
		15	# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
		16	# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
		17	# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
		18	# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
		19	# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
		20	# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
		21	# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
		22	# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
		23	# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
		24	# THE POSSIBILITY OF SUCH DAMAGE.
		25
		26	$: << File.dirname(__FILE__)
		27
		28	require "backends"
		29	require "digest/sha1"
		30	require "offsets"
		31	require "parser"
		32	require "settings"
		33	require "transform"
		34
		35	inputFlnm = ARGV.shift
		36	outputFlnm = ARGV.shift
		37
		38	def emitMagicNumber
		39	OFFSET_MAGIC_NUMBERS.each {
		40	\| number \|
		41	$output.puts "#{number},"
		42	}
		43	end
		44
		45	inputData = IO::read(inputFlnm)
		46	inputHash = Digest::SHA1.hexdigest(inputData)
		47
		48	if FileTest.exist? outputFlnm
		49	File.open(outputFlnm, "r") {
		50	\| inp \|
		51	firstLine = inp.gets
		52	if firstLine and firstLine.chomp == "// offlineasm input hash: #{inputHash}"
		53	$stderr.puts "Nothing changed."
		54	exit 0
		55	end
		56	}
		57	end
		58
		59	originalAST = parse(lex(inputData))
		60
		61	File.open(outputFlnm, "w") {
		62	\| outp \|
		63	$output = outp
		64	outp.puts "// offlineasm input hash: #{inputHash}"
65	emitCodeInAllConfigurations(originalAST) {
66	\| settings, ast, backend, index \|
67	offsetsList = ast.filter(StructOffset).uniq.sort
68	sizesList = ast.filter(Sizeof).uniq.sort
69
70	length = (OFFSET_MAGIC_NUMBERS.size + 1) * (1 + offsetsList.size + sizesList.size)
71
72	outp.puts "static const unsigned extractorTable[#{length}] = {"
73	emitMagicNumber
74	outp.puts "#{index},"
75	offsetsList.each {
76	\| offset \|
77	emitMagicNumber
78	outp.puts "OFFLINE_ASM_OFFSETOF(#{offset.struct}, #{offset.field}),"
79	}
80	sizesList.each {
81	\| offset \|
82	emitMagicNumber
83	outp.puts "sizeof(#{offset.struct}),"
84	}
85	outp.puts "};"
86	}
87	}