| 1 | /* |
| 2 | * Copyright (C) 2018 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 | #pragma once |
| 27 | |
| 28 | #include "MetadataTable.h" |
| 29 | #include "UnlinkedMetadataTable.h" |
| 30 | #include <wtf/FastMalloc.h> |
| 31 | |
| 32 | namespace JSC { |
| 33 | |
| 34 | ALWAYS_INLINE UnlinkedMetadataTable::UnlinkedMetadataTable() |
| 35 | : m_hasMetadata(false) |
| 36 | , m_isFinalized(false) |
| 37 | , m_isLinked(false) |
| 38 | , m_rawBuffer(fastZeroedMalloc(sizeof(LinkingData) + s_offsetTableSize)) |
| 39 | { |
| 40 | } |
| 41 | |
| 42 | ALWAYS_INLINE UnlinkedMetadataTable::~UnlinkedMetadataTable() |
| 43 | { |
| 44 | ASSERT(!m_isLinked); |
| 45 | if (m_hasMetadata || !m_isFinalized) |
| 46 | fastFree(m_rawBuffer); |
| 47 | } |
| 48 | |
| 49 | ALWAYS_INLINE unsigned UnlinkedMetadataTable::addEntry(OpcodeID opcodeID) |
| 50 | { |
| 51 | ASSERT(!m_isFinalized && opcodeID < s_offsetTableEntries - 1); |
| 52 | m_hasMetadata = true; |
| 53 | return buffer()[opcodeID]++; |
| 54 | } |
| 55 | |
| 56 | ALWAYS_INLINE size_t UnlinkedMetadataTable::sizeInBytes() |
| 57 | { |
| 58 | if (m_isFinalized && !m_hasMetadata) |
| 59 | return 0; |
| 60 | |
| 61 | return s_offsetTableSize; |
| 62 | } |
| 63 | |
| 64 | ALWAYS_INLINE size_t UnlinkedMetadataTable::sizeInBytes(MetadataTable& metadataTable) |
| 65 | { |
| 66 | ASSERT(m_isFinalized); |
| 67 | |
| 68 | // In this case, we return the size of the table minus the offset table, |
| 69 | // which was already accounted for in the UnlinkedCodeBlock. |
| 70 | if (metadataTable.buffer() == buffer()) { |
| 71 | ASSERT(m_isLinked); |
| 72 | return buffer()[s_offsetTableEntries - 1] - s_offsetTableSize; |
| 73 | } |
| 74 | |
| 75 | return metadataTable.buffer()[s_offsetTableEntries - 1]; |
| 76 | } |
| 77 | |
| 78 | ALWAYS_INLINE void UnlinkedMetadataTable::finalize() |
| 79 | { |
| 80 | ASSERT(!m_isFinalized); |
| 81 | m_isFinalized = true; |
| 82 | if (!m_hasMetadata) { |
| 83 | fastFree(m_rawBuffer); |
| 84 | m_rawBuffer = nullptr; |
| 85 | return; |
| 86 | } |
| 87 | |
| 88 | unsigned offset = s_offsetTableSize; |
| 89 | for (unsigned i = 0; i < s_offsetTableEntries - 1; i++) { |
| 90 | unsigned numberOfEntries = buffer()[i]; |
| 91 | |
| 92 | if (numberOfEntries > 0) { |
| 93 | offset = roundUpToMultipleOf(metadataAlignment(static_cast<OpcodeID>(i)), offset); |
| 94 | buffer()[i] = offset; |
| 95 | offset += numberOfEntries * metadataSize(static_cast<OpcodeID>(i)); |
| 96 | } else |
| 97 | buffer()[i] = offset; |
| 98 | } |
| 99 | buffer()[s_offsetTableEntries - 1] = offset; |
| 100 | } |
| 101 | |
| 102 | ALWAYS_INLINE RefPtr<MetadataTable> UnlinkedMetadataTable::link() |
| 103 | { |
| 104 | ASSERT(m_isFinalized); |
| 105 | |
| 106 | if (!m_hasMetadata) |
| 107 | return nullptr; |
| 108 | |
| 109 | unsigned totalSize = buffer()[s_offsetTableEntries - 1]; |
| 110 | uint8_t* buffer; |
| 111 | if (!m_isLinked) { |
| 112 | m_isLinked = true; |
| 113 | m_rawBuffer = buffer = reinterpret_cast<uint8_t*>(fastRealloc(m_rawBuffer, sizeof(LinkingData) + totalSize)); |
| 114 | } else { |
| 115 | buffer = reinterpret_cast<uint8_t*>(fastMalloc(sizeof(LinkingData) + totalSize)); |
| 116 | memcpy(buffer, m_rawBuffer, sizeof(LinkingData) + s_offsetTableSize); |
| 117 | } |
| 118 | memset(buffer + sizeof(LinkingData) + s_offsetTableSize, 0, totalSize - s_offsetTableSize); |
| 119 | return adoptRef(*new (buffer + sizeof(LinkingData)) MetadataTable(*this)); |
| 120 | } |
| 121 | |
| 122 | ALWAYS_INLINE void UnlinkedMetadataTable::unlink(MetadataTable& metadataTable) |
| 123 | { |
| 124 | ASSERT(m_isFinalized); |
| 125 | if (!m_hasMetadata) |
| 126 | return; |
| 127 | |
| 128 | if (metadataTable.buffer() == buffer()) { |
| 129 | ASSERT(m_isLinked); |
| 130 | m_isLinked = false; |
| 131 | m_rawBuffer = fastRealloc(m_rawBuffer, sizeof(LinkingData) + s_offsetTableSize); |
| 132 | return; |
| 133 | } |
| 134 | fastFree(&metadataTable.linkingData()); |
| 135 | } |
| 136 | |
| 137 | } // namespace JSC |
| 138 | |