| 1 | /* |
| 2 | * Copyright (C) 2013-2019 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 "DFGDesiredIdentifiers.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 | DesiredIdentifiers::DesiredIdentifiers() |
| 38 | : m_codeBlock(nullptr) |
| 39 | , m_didProcessIdentifiers(false) |
| 40 | { |
| 41 | } |
| 42 | |
| 43 | DesiredIdentifiers::DesiredIdentifiers(CodeBlock* codeBlock) |
| 44 | : m_codeBlock(codeBlock) |
| 45 | , m_didProcessIdentifiers(false) |
| 46 | { |
| 47 | } |
| 48 | |
| 49 | DesiredIdentifiers::~DesiredIdentifiers() |
| 50 | { |
| 51 | } |
| 52 | |
| 53 | unsigned DesiredIdentifiers::numberOfIdentifiers() |
| 54 | { |
| 55 | return m_codeBlock->numberOfIdentifiers() + m_addedIdentifiers.size(); |
| 56 | } |
| 57 | |
| 58 | void DesiredIdentifiers::processCodeBlockIdentifiersIfNeeded() |
| 59 | { |
| 60 | if (!m_didProcessIdentifiers) { |
| 61 | // Do this now instead of the constructor so that we don't pay the price on the main |
| 62 | // thread. Also, not all compilations need to call ensure(). |
| 63 | for (unsigned index = m_codeBlock->numberOfIdentifiers(); index--;) |
| 64 | m_identifierNumberForName.add(m_codeBlock->identifier(index).impl(), index); |
| 65 | m_didProcessIdentifiers = true; |
| 66 | } |
| 67 | } |
| 68 | |
| 69 | unsigned DesiredIdentifiers::ensure(UniquedStringImpl* rep) |
| 70 | { |
| 71 | processCodeBlockIdentifiersIfNeeded(); |
| 72 | |
| 73 | auto addResult = m_identifierNumberForName.add(rep, numberOfIdentifiers()); |
| 74 | unsigned result = addResult.iterator->value; |
| 75 | if (addResult.isNewEntry) { |
| 76 | m_addedIdentifiers.append(rep); |
| 77 | ASSERT(at(result) == rep); |
| 78 | } |
| 79 | return result; |
| 80 | } |
| 81 | |
| 82 | unsigned DesiredIdentifiers::ensure(Box<Identifier> rep) |
| 83 | { |
| 84 | processCodeBlockIdentifiersIfNeeded(); |
| 85 | |
| 86 | UniquedStringImpl* impl = rep->impl(); |
| 87 | auto addResult = m_identifierNumberForName.add(impl, numberOfIdentifiers()); |
| 88 | unsigned result = addResult.iterator->value; |
| 89 | if (addResult.isNewEntry) { |
| 90 | m_addedIdentifiers.append(WTFMove(rep)); |
| 91 | ASSERT(at(result) == impl); |
| 92 | } |
| 93 | return result; |
| 94 | } |
| 95 | |
| 96 | UniquedStringImpl* DesiredIdentifiers::at(unsigned index) const |
| 97 | { |
| 98 | UniquedStringImpl* result; |
| 99 | if (index < m_codeBlock->numberOfIdentifiers()) |
| 100 | result = m_codeBlock->identifier(index).impl(); |
| 101 | else { |
| 102 | const auto& variant = m_addedIdentifiers[index - m_codeBlock->numberOfIdentifiers()]; |
| 103 | if (WTF::holds_alternative<UniquedStringImpl*>(variant)) |
| 104 | result = WTF::get<UniquedStringImpl*>(variant); |
| 105 | else |
| 106 | result = WTF::get<Box<Identifier>>(variant)->impl(); |
| 107 | } |
| 108 | ASSERT(result->hasAtLeastOneRef()); |
| 109 | return result; |
| 110 | } |
| 111 | |
| 112 | void DesiredIdentifiers::reallyAdd(VM& vm, CommonData* commonData) |
| 113 | { |
| 114 | for (const auto& variant : m_addedIdentifiers) { |
| 115 | UniquedStringImpl* rep; |
| 116 | if (WTF::holds_alternative<UniquedStringImpl*>(variant)) |
| 117 | rep = WTF::get<UniquedStringImpl*>(variant); |
| 118 | else |
| 119 | rep = WTF::get<Box<Identifier>>(variant)->impl(); |
| 120 | |
| 121 | ASSERT(rep->hasAtLeastOneRef()); |
| 122 | Identifier uid = Identifier::fromUid(vm, rep); |
| 123 | { |
| 124 | ConcurrentJSLocker locker(m_codeBlock->m_lock); |
| 125 | commonData->dfgIdentifiers.append(WTFMove(uid)); |
| 126 | } |
| 127 | } |
| 128 | } |
| 129 | |
| 130 | } } // namespace JSC::DFG |
| 131 | |
| 132 | #endif // ENABLE(DFG_JIT) |
| 133 | |
| 134 | |