PolymorphicPutByIdList.cpp 4.59 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
/*
 * 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 "PolymorphicPutByIdList.h"

29 30
#if ENABLE(JIT)

31 32 33 34 35 36 37 38 39 40 41 42 43 44
#include "StructureStubInfo.h"

namespace JSC {

PutByIdAccess PutByIdAccess::fromStructureStubInfo(
    StructureStubInfo& stubInfo,
    MacroAssemblerCodePtr initialSlowPath)
{
    PutByIdAccess result;
    
    switch (stubInfo.accessType) {
    case access_put_by_id_replace:
        result.m_type = Replace;
        result.m_oldStructure.copyFrom(stubInfo.u.putByIdReplace.baseObjectStructure);
45
        result.m_stubRoutine = JITStubRoutine::createSelfManagedRoutine(initialSlowPath);
46 47 48 49 50 51 52 53 54 55 56 57
        break;
        
    case access_put_by_id_transition_direct:
    case access_put_by_id_transition_normal:
        result.m_type = Transition;
        result.m_oldStructure.copyFrom(stubInfo.u.putByIdTransition.previousStructure);
        result.m_newStructure.copyFrom(stubInfo.u.putByIdTransition.structure);
        result.m_chain.copyFrom(stubInfo.u.putByIdTransition.chain);
        result.m_stubRoutine = stubInfo.stubRoutine;
        break;
        
    default:
58
        RELEASE_ASSERT_NOT_REACHED();
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
    }
    
    return result;
}

bool PutByIdAccess::visitWeak() const
{
    switch (m_type) {
    case Replace:
        if (!Heap::isMarked(m_oldStructure.get()))
            return false;
        break;
    case Transition:
        if (!Heap::isMarked(m_oldStructure.get()))
            return false;
        if (!Heap::isMarked(m_newStructure.get()))
            return false;
        if (!Heap::isMarked(m_chain.get()))
            return false;
        break;
    default:
80
        RELEASE_ASSERT_NOT_REACHED();
81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
        return false;
    }
    return true;
}

PolymorphicPutByIdList::PolymorphicPutByIdList(
    PutKind putKind,
    StructureStubInfo& stubInfo,
    MacroAssemblerCodePtr initialSlowPath)
    : m_kind(putKind)
{
    m_list.append(PutByIdAccess::fromStructureStubInfo(stubInfo, initialSlowPath));
}

PolymorphicPutByIdList* PolymorphicPutByIdList::from(
    PutKind putKind,
    StructureStubInfo& stubInfo,
    MacroAssemblerCodePtr initialSlowPath)
{
    if (stubInfo.accessType == access_put_by_id_list)
        return stubInfo.u.putByIdList.list;
    
    ASSERT(stubInfo.accessType == access_put_by_id_replace
           || stubInfo.accessType == access_put_by_id_transition_normal
           || stubInfo.accessType == access_put_by_id_transition_direct);
    
    PolymorphicPutByIdList* result =
        new PolymorphicPutByIdList(putKind, stubInfo, initialSlowPath);
    
    stubInfo.initPutByIdList(result);
    
    return result;
}

PolymorphicPutByIdList::~PolymorphicPutByIdList() { }

bool PolymorphicPutByIdList::isFull() const
{
    ASSERT(size() <= POLYMORPHIC_LIST_CACHE_SIZE);
    return size() == POLYMORPHIC_LIST_CACHE_SIZE;
}

bool PolymorphicPutByIdList::isAlmostFull() const
{
    ASSERT(size() <= POLYMORPHIC_LIST_CACHE_SIZE);
    return size() >= POLYMORPHIC_LIST_CACHE_SIZE - 1;
}

void PolymorphicPutByIdList::addAccess(const PutByIdAccess& putByIdAccess)
{
    ASSERT(!isFull());
    // Make sure that the resizing optimizes for space, not time.
    m_list.resize(m_list.size() + 1);
    m_list.last() = putByIdAccess;
}

bool PolymorphicPutByIdList::visitWeak() const
{
    for (unsigned i = 0; i < size(); ++i) {
        if (!at(i).visitWeak())
            return false;
    }
    return true;
}

} // namespace JSC

148
#endif // ENABLE(JIT)