/*
* Copyright (C) 2018 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.
*/
#pragma once
#if ENABLE(JIT)
#include "CodeLocation.h"
#include
#include
namespace JSC {
class JITCodeMap {
public:
static_assert(std::is_trivially_destructible_v);
static_assert(std::is_trivially_destructible_v>);
static_assert(alignof(CodeLocationLabel) >= alignof(BytecodeIndex), "Putting CodeLocationLabel vector first since we can avoid alignment consideration of BytecodeIndex vector");
JITCodeMap() = default;
JITCodeMap(Vector&& indexes, Vector>&& codeLocations)
: m_size(indexes.size())
{
ASSERT(indexes.size() == codeLocations.size());
m_pointer = MallocPtr::malloc(sizeof(CodeLocationLabel) * m_size + sizeof(BytecodeIndex) * m_size);
std::copy(codeLocations.begin(), codeLocations.end(), this->codeLocations());
std::copy(indexes.begin(), indexes.end(), this->indexes());
}
CodeLocationLabel find(BytecodeIndex bytecodeIndex) const
{
auto* index = binarySearch(indexes(), m_size, bytecodeIndex, [] (BytecodeIndex* index) { return *index; });
if (!index)
return CodeLocationLabel();
return codeLocations()[index - indexes()];
}
explicit operator bool() const { return m_size; }
private:
CodeLocationLabel* codeLocations() const
{
return bitwise_cast*>(m_pointer.get());
}
BytecodeIndex* indexes() const
{
return bitwise_cast(m_pointer.get() + sizeof(CodeLocationLabel) * m_size);
}
MallocPtr m_pointer;
unsigned m_size { 0 };
};
class JITCodeMapBuilder {
WTF_MAKE_NONCOPYABLE(JITCodeMapBuilder);
public:
JITCodeMapBuilder() = default;
void append(BytecodeIndex bytecodeIndex, CodeLocationLabel codeLocation)
{
m_indexes.append(bytecodeIndex);
m_codeLocations.append(codeLocation);
}
JITCodeMap finalize()
{
return JITCodeMap(WTFMove(m_indexes), WTFMove(m_codeLocations));
}
private:
Vector m_indexes;
Vector> m_codeLocations;
};
} // namespace JSC
#endif // ENABLE(JIT)