/*

 * Copyright (C) 2008, 2009 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"

#if ENABLE(JIT)

#if USE(JSVALUE32_64)

#include "JIT.h"

#include "CodeBlock.h"

#include "JITInlineMethods.h"

#include "JITStubCall.h"

#include "JSArray.h"

#include "JSFunction.h"

#include "JSPropertyNameIterator.h"

#include "Interpreter.h"

#include "LinkBuffer.h"

#include "RepatchBuffer.h"

#include "ResultType.h"

#include "SamplingTool.h"

#ifndef NDEBUG

#include <stdio.h>

#endif

using namespace std;

namespace JSC {

void JIT::emit_op_put_by_index(Instruction* currentInstruction)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned value = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_put_by_index);

    stubCall.addArgument(base);

    stubCall.addArgument(Imm32(property));

    stubCall.addArgument(value);

    stubCall.call();

}

void JIT::emit_op_put_getter(Instruction* currentInstruction)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned function = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_put_getter);

    stubCall.addArgument(base);

    stubCall.addArgument(ImmPtr(&m_codeBlock->identifier(property)));

    stubCall.addArgument(function);

    stubCall.call();

}

void JIT::emit_op_put_setter(Instruction* currentInstruction)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned function = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_put_setter);

    stubCall.addArgument(base);

    stubCall.addArgument(ImmPtr(&m_codeBlock->identifier(property)));

    stubCall.addArgument(function);

    stubCall.call();

}

void JIT::emit_op_del_by_id(Instruction* currentInstruction)

{

    unsigned dst = currentInstruction[1].u.operand;

    unsigned base = currentInstruction[2].u.operand;

    unsigned property = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_del_by_id);

    stubCall.addArgument(base);

    stubCall.addArgument(ImmPtr(&m_codeBlock->identifier(property)));

    stubCall.call(dst);

}

#if !ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS)

/* ------------------------------ BEGIN: !ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS) ------------------------------ */

// Treat these as nops - the call will be handed as a regular get_by_id/op_call pair.

void JIT::emit_op_method_check(Instruction*) {}

void JIT::emitSlow_op_method_check(Instruction*, Vector<SlowCaseEntry>::iterator&) { ASSERT_NOT_REACHED(); }

#if ENABLE(JIT_OPTIMIZE_METHOD_CALLS)

#error "JIT_OPTIMIZE_METHOD_CALLS requires JIT_OPTIMIZE_PROPERTY_ACCESS"

#endif

void JIT::emit_op_get_by_val(Instruction* currentInstruction)

{

    unsigned dst = currentInstruction[1].u.operand;

    unsigned base = currentInstruction[2].u.operand;

    unsigned property = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_get_by_val);

    stubCall.addArgument(base);

    stubCall.addArgument(property);

    stubCall.call(dst);

}

void JIT::emitSlow_op_get_by_val(Instruction*, Vector<SlowCaseEntry>::iterator&)

{

    ASSERT_NOT_REACHED();

}

void JIT::emit_op_put_by_val(Instruction* currentInstruction)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned value = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_put_by_val);

    stubCall.addArgument(base);

    stubCall.addArgument(property);

    stubCall.addArgument(value);

    stubCall.call();

}

void JIT::emitSlow_op_put_by_val(Instruction*, Vector<SlowCaseEntry>::iterator&)

{

    ASSERT_NOT_REACHED();

}

void JIT::emit_op_get_by_id(Instruction* currentInstruction)

{

    int dst = currentInstruction[1].u.operand;

    int base = currentInstruction[2].u.operand;

    int ident = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_get_by_id_generic);

    stubCall.addArgument(base);

    stubCall.addArgument(ImmPtr(&(m_codeBlock->identifier(ident))));

    stubCall.call(dst);

    m_propertyAccessInstructionIndex++;

}

void JIT::emitSlow_op_get_by_id(Instruction*, Vector<SlowCaseEntry>::iterator&)

{

    m_propertyAccessInstructionIndex++;

    ASSERT_NOT_REACHED();

}

void JIT::emit_op_put_by_id(Instruction* currentInstruction)

{

    int base = currentInstruction[1].u.operand;

    int ident = currentInstruction[2].u.operand;

    int value = currentInstruction[3].u.operand;

    JITStubCall stubCall(this, cti_op_put_by_id_generic);

    stubCall.addArgument(base);

    stubCall.addArgument(ImmPtr(&(m_codeBlock->identifier(ident))));

    stubCall.addArgument(value);

    stubCall.call();

    m_propertyAccessInstructionIndex++;

}

void JIT::emitSlow_op_put_by_id(Instruction*, Vector<SlowCaseEntry>::iterator&)

{

    m_propertyAccessInstructionIndex++;

    ASSERT_NOT_REACHED();

}

#else // !ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS)

/* ------------------------------ BEGIN: ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS) ------------------------------ */

#if ENABLE(JIT_OPTIMIZE_METHOD_CALLS)

void JIT::emit_op_method_check(Instruction* currentInstruction)

{

    // Assert that the following instruction is a get_by_id.

    ASSERT(m_interpreter->getOpcodeID((currentInstruction + OPCODE_LENGTH(op_method_check))->u.opcode) == op_get_by_id);

    currentInstruction += OPCODE_LENGTH(op_method_check);

    // Do the method check - check the object & its prototype's structure inline (this is the common case).

    m_methodCallCompilationInfo.append(MethodCallCompilationInfo(m_propertyAccessInstructionIndex));

    MethodCallCompilationInfo& info = m_methodCallCompilationInfo.last();

    int dst = currentInstruction[1].u.operand;

    int base = currentInstruction[2].u.operand;

    emitLoad(base, regT1, regT0);

    emitJumpSlowCaseIfNotJSCell(base, regT1);

    BEGIN_UNINTERRUPTED_SEQUENCE(sequenceMethodCheck);

    Jump structureCheck = branchPtrWithPatch(NotEqual, Address(regT0, OBJECT_OFFSETOF(JSCell, m_structure)), info.structureToCompare, ImmPtr(reinterpret_cast<void*>(patchGetByIdDefaultStructure)));

    DataLabelPtr protoStructureToCompare, protoObj = moveWithPatch(ImmPtr(0), regT2);

    Jump protoStructureCheck = branchPtrWithPatch(NotEqual, Address(regT2, OBJECT_OFFSETOF(JSCell, m_structure)), protoStructureToCompare, ImmPtr(reinterpret_cast<void*>(patchGetByIdDefaultStructure)));

    // This will be relinked to load the function without doing a load.

    DataLabelPtr putFunction = moveWithPatch(ImmPtr(0), regT0);

    END_UNINTERRUPTED_SEQUENCE(sequenceMethodCheck);

    move(Imm32(JSValue::CellTag), regT1);

    Jump match = jump();

    ASSERT(differenceBetween(info.structureToCompare, protoObj) == patchOffsetMethodCheckProtoObj);

    ASSERT(differenceBetween(info.structureToCompare, protoStructureToCompare) == patchOffsetMethodCheckProtoStruct);

    ASSERT(differenceBetween(info.structureToCompare, putFunction) == patchOffsetMethodCheckPutFunction);

    // Link the failure cases here.

    structureCheck.link(this);

    protoStructureCheck.link(this);

    // Do a regular(ish) get_by_id (the slow case will be link to

    // cti_op_get_by_id_method_check instead of cti_op_get_by_id.

    compileGetByIdHotPath();

    match.link(this);

    emitStore(dst, regT1, regT0);

    map(m_bytecodeOffset + OPCODE_LENGTH(op_method_check), dst, regT1, regT0);

    // We've already generated the following get_by_id, so make sure it's skipped over.

    m_bytecodeOffset += OPCODE_LENGTH(op_get_by_id);

}

void JIT::emitSlow_op_method_check(Instruction* currentInstruction, Vector<SlowCaseEntry>::iterator& iter)

{

    currentInstruction += OPCODE_LENGTH(op_method_check);

    int dst = currentInstruction[1].u.operand;

    int base = currentInstruction[2].u.operand;

    int ident = currentInstruction[3].u.operand;

    compileGetByIdSlowCase(dst, base, &(m_codeBlock->identifier(ident)), iter, true);

    // We've already generated the following get_by_id, so make sure it's skipped over.

    m_bytecodeOffset += OPCODE_LENGTH(op_get_by_id);

}

#else //!ENABLE(JIT_OPTIMIZE_METHOD_CALLS)

// Treat these as nops - the call will be handed as a regular get_by_id/op_call pair.

void JIT::emit_op_method_check(Instruction*) {}

void JIT::emitSlow_op_method_check(Instruction*, Vector<SlowCaseEntry>::iterator&) { ASSERT_NOT_REACHED(); }

#endif

JIT::CodePtr JIT::stringGetByValStubGenerator(JSGlobalData* globalData, ExecutablePool* pool)

{

    JSInterfaceJIT jit;

    JumpList failures;

    failures.append(jit.branchPtr(NotEqual, Address(regT0), ImmPtr(globalData->jsStringVPtr)));

    failures.append(jit.branchTest32(NonZero, Address(regT0, OBJECT_OFFSETOF(JSString, m_fiberCount))));

    // Load string length to regT1, and start the process of loading the data pointer into regT0

    jit.load32(Address(regT0, ThunkHelpers::jsStringLengthOffset()), regT1);

    jit.loadPtr(Address(regT0, ThunkHelpers::jsStringValueOffset()), regT0);

    jit.loadPtr(Address(regT0, ThunkHelpers::stringImplDataOffset()), regT0);

    // Do an unsigned compare to simultaneously filter negative indices as well as indices that are too large

    failures.append(jit.branch32(AboveOrEqual, regT2, regT1));

    // Load the character

    jit.load16(BaseIndex(regT0, regT2, TimesTwo, 0), regT0);

    failures.append(jit.branch32(AboveOrEqual, regT0, Imm32(0x100)));

    jit.move(ImmPtr(globalData->smallStrings.singleCharacterStrings()), regT1);

    jit.loadPtr(BaseIndex(regT1, regT0, ScalePtr, 0), regT0);

    jit.move(Imm32(JSValue::CellTag), regT1); // We null check regT0 on return so this is safe

    jit.ret();

    failures.link(&jit);

    jit.move(Imm32(0), regT0);

    jit.ret();

    LinkBuffer patchBuffer(&jit, pool);

    return patchBuffer.finalizeCode().m_code;

}

void JIT::emit_op_get_by_val(Instruction* currentInstruction)

{

    unsigned dst = currentInstruction[1].u.operand;

    unsigned base = currentInstruction[2].u.operand;

    unsigned property = currentInstruction[3].u.operand;

    emitLoad2(base, regT1, regT0, property, regT3, regT2);

    addSlowCase(branch32(NotEqual, regT3, Imm32(JSValue::Int32Tag)));

    emitJumpSlowCaseIfNotJSCell(base, regT1);

    addSlowCase(branchPtr(NotEqual, Address(regT0), ImmPtr(m_globalData->jsArrayVPtr)));

    loadPtr(Address(regT0, OBJECT_OFFSETOF(JSArray, m_storage)), regT3);

    addSlowCase(branch32(AboveOrEqual, regT2, Address(regT0, OBJECT_OFFSETOF(JSArray, m_vectorLength))));

    load32(BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag)), regT1); // tag

    load32(BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.payload)), regT0); // payload

    addSlowCase(branch32(Equal, regT1, Imm32(JSValue::EmptyValueTag)));

    emitStore(dst, regT1, regT0);

    map(m_bytecodeOffset + OPCODE_LENGTH(op_get_by_val), dst, regT1, regT0);

}

void JIT::emitSlow_op_get_by_val(Instruction* currentInstruction, Vector<SlowCaseEntry>::iterator& iter)

{

    unsigned dst = currentInstruction[1].u.operand;

    unsigned base = currentInstruction[2].u.operand;

    unsigned property = currentInstruction[3].u.operand;

    linkSlowCase(iter); // property int32 check

    linkSlowCaseIfNotJSCell(iter, base); // base cell check

    Jump nonCell = jump();

    linkSlowCase(iter); // base array check

    Jump notString = branchPtr(NotEqual, Address(regT0), ImmPtr(m_globalData->jsStringVPtr));

    emitNakedCall(m_globalData->getCTIStub(stringGetByValStubGenerator));

    Jump failed = branchTestPtr(Zero, regT0);

    emitStore(dst, regT1, regT0);

    emitJumpSlowToHot(jump(), OPCODE_LENGTH(op_get_by_val));

    failed.link(this);

    notString.link(this);

    nonCell.link(this);

    linkSlowCase(iter); // vector length check

    linkSlowCase(iter); // empty value

    JITStubCall stubCall(this, cti_op_get_by_val);

    stubCall.addArgument(base);

    stubCall.addArgument(property);

    stubCall.call(dst);

}

void JIT::emit_op_put_by_val(Instruction* currentInstruction)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned value = currentInstruction[3].u.operand;

    emitLoad2(base, regT1, regT0, property, regT3, regT2);

    addSlowCase(branch32(NotEqual, regT3, Imm32(JSValue::Int32Tag)));

    emitJumpSlowCaseIfNotJSCell(base, regT1);

    addSlowCase(branchPtr(NotEqual, Address(regT0), ImmPtr(m_globalData->jsArrayVPtr)));

    addSlowCase(branch32(AboveOrEqual, regT2, Address(regT0, OBJECT_OFFSETOF(JSArray, m_vectorLength))));

    loadPtr(Address(regT0, OBJECT_OFFSETOF(JSArray, m_storage)), regT3);

    Jump empty = branch32(Equal, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag)), Imm32(JSValue::EmptyValueTag));

    Label storeResult(this);

    emitLoad(value, regT1, regT0);

    store32(regT0, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.payload))); // payload

    store32(regT1, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag))); // tag

    Jump end = jump();

    empty.link(this);

    add32(Imm32(1), Address(regT3, OBJECT_OFFSETOF(ArrayStorage, m_numValuesInVector)));

    branch32(Below, regT2, Address(regT3, OBJECT_OFFSETOF(ArrayStorage, m_length))).linkTo(storeResult, this);

    add32(Imm32(1), regT2, regT0);

    store32(regT0, Address(regT3, OBJECT_OFFSETOF(ArrayStorage, m_length)));

    jump().linkTo(storeResult, this);

    end.link(this);

}

void JIT::emitSlow_op_put_by_val(Instruction* currentInstruction, Vector<SlowCaseEntry>::iterator& iter)

{

    unsigned base = currentInstruction[1].u.operand;

    unsigned property = currentInstruction[2].u.operand;

    unsigned value = currentInstruction[3].u.operand;

    linkSlowCase(iter); // property int32 check

    linkSlowCaseIfNotJSCell(iter, base); // base cell check

    linkSlowCase(iter); // base not array check

    linkSlowCase(iter); // in vector check

    JITStubCall stubPutByValCall(this, cti_op_put_by_val);

    stubPutByValCall.addArgument(base);

    stubPutByValCall.addArgument(property);

    stubPutByValCall.addArgument(value);

    stubPutByValCall.call();

}

void JIT::emit_op_get_by_id(Instruction* currentInstruction)

{

    int dst = currentInstruction[1].u.operand;

    int base = currentInstruction[2].u.operand;

    emitLoad(base, regT1, regT0);

    emitJumpSlowCaseIfNotJSCell(base, regT1);

    compileGetByIdHotPath();

    emitStore(dst, regT1, regT0);

    map(m_bytecodeOffset + OPCODE_LENGTH(op_get_by_id), dst, regT1, regT0);

}

void JIT::compileGetByIdHotPath()

{

    // As for put_by_id, get_by_id requires the offset of the Structure and the offset of the access to be patched.

    // Additionally, for get_by_id we need patch the offset of the branch to the slow case (we patch this to jump

    // to array-length / prototype access tranpolines, and finally we also the the property-map access offset as a label

    // to jump back to if one of these trampolies finds a match.

    BEGIN_UNINTERRUPTED_SEQUENCE(sequenceGetByIdHotPath);

    Label hotPathBegin(this);

    m_propertyAccessCompilationInfo[m_propertyAccessInstructionIndex].hotPathBegin = hotPathBegin;

    m_propertyAccessInstructionIndex++;

    DataLabelPtr structureToCompare;

    Jump structureCheck = branchPtrWithPatch(NotEqual, Address(regT0, OBJECT_OFFSETOF(JSCell, m_structure)), structureToCompare, ImmPtr(reinterpret_cast<void*>(patchGetByIdDefaultStructure)));

    addSlowCase(structureCheck);

    ASSERT(differenceBetween(hotPathBegin, structureToCompare) == patchOffsetGetByIdStructure);

    ASSERT(differenceBetween(hotPathBegin, structureCheck) == patchOffsetGetByIdBranchToSlowCase);

    Label externalLoad = loadPtrWithPatchToLEA(Address(regT0, OBJECT_OFFSETOF(JSObject, m_externalStorage)), regT2);

    Label externalLoadComplete(this);

    ASSERT(differenceBetween(hotPathBegin, externalLoad) == patchOffsetGetByIdExternalLoad);

    ASSERT(differenceBetween(externalLoad, externalLoadComplete) == patchLengthGetByIdExternalLoad);

    DataLabel32 displacementLabel1 = loadPtrWithAddressOffsetPatch(Address(regT2, patchGetByIdDefaultOffset), regT0); // payload

    ASSERT(differenceBetween(hotPathBegin, displacementLabel1) == patchOffsetGetByIdPropertyMapOffset1);

    DataLabel32 displacementLabel2 = loadPtrWithAddressOffsetPatch(Address(regT2, patchGetByIdDefaultOffset), regT1); // tag

    ASSERT(differenceBetween(hotPathBegin, displacementLabel2) == patchOffsetGetByIdPropertyMapOffset2);

    Label putResult(this);

    ASSERT(differenceBetween(hotPathBegin, putResult) == patchOffsetGetByIdPutResult);

    END_UNINTERRUPTED_SEQUENCE(sequenceGetByIdHotPath);

}

void JIT::emitSlow_op_get_by_id(Instruction* currentInstruction, Vector<SlowCaseEntry>::iterator& iter)

{

    int dst = currentInstruction[1].u.operand;

    int base = currentInstruction[2].u.operand;

    int ident = currentInstruction[3].u.operand;

    compileGetByIdSlowCase(dst, base, &(m_codeBlock->identifier(ident)), iter);

}

void JIT::compileGetByIdSlowCase(int dst, int base, Identifier* ident, Vector<SlowCaseEntry>::iterator& iter, bool isMethodCheck)

{

    // As for the hot path of get_by_id, above, we ensure that we can use an architecture specific offset

    // so that we only need track one pointer into the slow case code - we track a pointer to the location

    // of the call (which we can use to look up the patch information), but should a array-length or

    // prototype access trampoline fail we want to bail out back to here.  To do so we can subtract back

    // the distance from the call to the head of the slow case.

    linkSlowCaseIfNotJSCell(iter, base);

    linkSlowCase(iter);

    BEGIN_UNINTERRUPTED_SEQUENCE(sequenceGetByIdSlowCase);

#ifndef NDEBUG

    Label coldPathBegin(this);

#endif

    JITStubCall stubCall(this, isMethodCheck ? cti_op_get_by_id_method_check : cti_op_get_by_id);

    stubCall.addArgument(regT1, regT0);

    stubCall.addArgument(ImmPtr(ident));

    Call call = stubCall.call(dst);

    END_UNINTERRUPTED_SEQUENCE(sequenceGetByIdSlowCase);

    ASSERT(differenceBetween(coldPathBegin, call) == patchOffsetGetByIdSlowCaseCall);

    // Track the location of the call; this will be used to recover patch information.

    m_propertyAccessCompilationInfo[m_propertyAccessInstructionIndex].callReturnLocation = call;

    m_propertyAccessInstructionIndex++;

}

void JIT::emit_op_put_by_id(Instruction* currentInstruction)

{

    // In order to be able to patch both the Structure, and the object offset, we store one pointer,

    // to just after the arguments have been loaded into registers 'hotPathBegin', and we generate code

    // such that the Structure & offset are always at the same distance from this.

    int base = currentInstruction[1].u.operand;

    int value = currentInstruction[3].u.operand;

    emitLoad2(base, regT1, regT0, value, regT3, regT2);

    emitJumpSlowCaseIfNotJSCell(base, regT1);

    BEGIN_UNINTERRUPTED_SEQUENCE(sequencePutById);

    Label hotPathBegin(this);

    m_propertyAccessCompilationInfo[m_propertyAccessInstructionIndex].hotPathBegin = hotPathBegin;

    m_propertyAccessInstructionIndex++;

    // It is important that the following instruction plants a 32bit immediate, in order that it can be patched over.

    DataLabelPtr structureToCompare;

    addSlowCase(branchPtrWithPatch(NotEqual, Address(regT0, OBJECT_OFFSETOF(JSCell, m_structure)), structureToCompare, ImmPtr(reinterpret_cast<void*>(patchGetByIdDefaultStructure))));

    ASSERT(differenceBetween(hotPathBegin, structureToCompare) == patchOffsetPutByIdStructure);

    // Plant a load from a bogus ofset in the object's property map; we will patch this later, if it is to be used.

    Label externalLoad = loadPtrWithPatchToLEA(Address(regT0, OBJECT_OFFSETOF(JSObject, m_externalStorage)), regT0);

    Label externalLoadComplete(this);

    ASSERT(differenceBetween(hotPathBegin, externalLoad) == patchOffsetPutByIdExternalLoad);

    ASSERT(differenceBetween(externalLoad, externalLoadComplete) == patchLengthPutByIdExternalLoad);

    DataLabel32 displacementLabel1 = storePtrWithAddressOffsetPatch(regT2, Address(regT0, patchGetByIdDefaultOffset)); // payload

    DataLabel32 displacementLabel2 = storePtrWithAddressOffsetPatch(regT3, Address(regT0, patchGetByIdDefaultOffset)); // tag

    END_UNINTERRUPTED_SEQUENCE(sequencePutById);

    ASSERT(differenceBetween(hotPathBegin, displacementLabel1) == patchOffsetPutByIdPropertyMapOffset1);

    ASSERT(differenceBetween(hotPathBegin, displacementLabel2) == patchOffsetPutByIdPropertyMapOffset2);

}