| 1 | /* |
| 2 | * Copyright (C) 2013-2016 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. AND ITS CONTRIBUTORS ``AS IS'' |
| 14 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
| 15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
| 17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 19 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 20 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 21 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 22 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 23 | * THE POSSIBILITY OF SUCH DAMAGE. |
| 24 | */ |
| 25 | |
| 26 | #include "config.h" |
| 27 | #include "DFGDesiredTransitions.h" |
| 28 | |
| 29 | #if ENABLE(DFG_JIT) |
| 30 | |
| 31 | #include "CodeBlock.h" |
| 32 | #include "DFGCommonData.h" |
| 33 | #include "JSCInlines.h" |
| 34 | |
| 35 | namespace JSC { namespace DFG { |
| 36 | |
| 37 | DesiredTransition::DesiredTransition(CodeBlock* codeBlock, CodeBlock* codeOriginOwner, Structure* oldStructure, Structure* newStructure) |
| 38 | : m_codeBlock(codeBlock) |
| 39 | , m_codeOriginOwner(codeOriginOwner) |
| 40 | , m_oldStructure(oldStructure) |
| 41 | , m_newStructure(newStructure) |
| 42 | { |
| 43 | } |
| 44 | |
| 45 | void DesiredTransition::reallyAdd(VM& vm, CommonData* common) |
| 46 | { |
| 47 | common->transitions.append( |
| 48 | WeakReferenceTransition( |
| 49 | vm, m_codeBlock, |
| 50 | m_codeOriginOwner, |
| 51 | m_oldStructure, m_newStructure)); |
| 52 | } |
| 53 | |
| 54 | void DesiredTransition::visitChildren(SlotVisitor& visitor) |
| 55 | { |
| 56 | visitor.appendUnbarriered(m_codeOriginOwner); |
| 57 | visitor.appendUnbarriered(m_oldStructure); |
| 58 | visitor.appendUnbarriered(m_newStructure); |
| 59 | } |
| 60 | |
| 61 | DesiredTransitions::DesiredTransitions() |
| 62 | { |
| 63 | } |
| 64 | |
| 65 | DesiredTransitions::~DesiredTransitions() |
| 66 | { |
| 67 | } |
| 68 | |
| 69 | void DesiredTransitions::addLazily(CodeBlock* codeBlock, CodeBlock* codeOriginOwner, Structure* oldStructure, Structure* newStructure) |
| 70 | { |
| 71 | m_transitions.append(DesiredTransition(codeBlock, codeOriginOwner, oldStructure, newStructure)); |
| 72 | } |
| 73 | |
| 74 | void DesiredTransitions::reallyAdd(VM& vm, CommonData* common) |
| 75 | { |
| 76 | for (unsigned i = 0; i < m_transitions.size(); i++) |
| 77 | m_transitions[i].reallyAdd(vm, common); |
| 78 | } |
| 79 | |
| 80 | void DesiredTransitions::visitChildren(SlotVisitor& visitor) |
| 81 | { |
| 82 | for (unsigned i = 0; i < m_transitions.size(); i++) |
| 83 | m_transitions[i].visitChildren(visitor); |
| 84 | } |
| 85 | |
| 86 | } } // namespace JSC::DFG |
| 87 | |
| 88 | #endif // ENABLE(DFG_JIT) |
| 89 | |