This repository was archived by the owner on Jun 24, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathJITCodeMap.h
More file actions
98 lines (83 loc) · 3.65 KB
/
JITCodeMap.h
File metadata and controls
98 lines (83 loc) · 3.65 KB
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
* 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 <wtf/StdLibExtras.h>
#include <wtf/Vector.h>
namespace JSC {
class JITCodeMap {
public:
static_assert(std::is_trivially_destructible_v<BytecodeIndex>);
static_assert(std::is_trivially_destructible_v<CodeLocationLabel<JSEntryPtrTag>>);
static_assert(alignof(CodeLocationLabel<JSEntryPtrTag>) >= alignof(BytecodeIndex), "Putting CodeLocationLabel vector first since we can avoid alignment consideration of BytecodeIndex vector");
JITCodeMap() = default;
JITCodeMap(Vector<BytecodeIndex>&& indexes, Vector<CodeLocationLabel<JSEntryPtrTag>>&& codeLocations)
: m_size(indexes.size())
{
ASSERT(indexes.size() == codeLocations.size());
m_pointer = MallocPtr<uint8_t>::malloc(sizeof(CodeLocationLabel<JSEntryPtrTag>) * m_size + sizeof(BytecodeIndex) * m_size);
std::copy(codeLocations.begin(), codeLocations.end(), this->codeLocations());
std::copy(indexes.begin(), indexes.end(), this->indexes());
}
CodeLocationLabel<JSEntryPtrTag> find(BytecodeIndex bytecodeIndex) const
{
auto* index = binarySearch<BytecodeIndex, BytecodeIndex>(indexes(), m_size, bytecodeIndex, [] (BytecodeIndex* index) { return *index; });
if (!index)
return CodeLocationLabel<JSEntryPtrTag>();
return codeLocations()[index - indexes()];
}
explicit operator bool() const { return m_size; }
private:
CodeLocationLabel<JSEntryPtrTag>* codeLocations() const
{
return bitwise_cast<CodeLocationLabel<JSEntryPtrTag>*>(m_pointer.get());
}
BytecodeIndex* indexes() const
{
return bitwise_cast<BytecodeIndex*>(m_pointer.get() + sizeof(CodeLocationLabel<JSEntryPtrTag>) * m_size);
}
MallocPtr<uint8_t> m_pointer;
unsigned m_size { 0 };
};
class JITCodeMapBuilder {
WTF_MAKE_NONCOPYABLE(JITCodeMapBuilder);
public:
JITCodeMapBuilder() = default;
void append(BytecodeIndex bytecodeIndex, CodeLocationLabel<JSEntryPtrTag> codeLocation)
{
m_indexes.append(bytecodeIndex);
m_codeLocations.append(codeLocation);
}
JITCodeMap finalize()
{
return JITCodeMap(WTFMove(m_indexes), WTFMove(m_codeLocations));
}
private:
Vector<BytecodeIndex> m_indexes;
Vector<CodeLocationLabel<JSEntryPtrTag>> m_codeLocations;
};
} // namespace JSC
#endif // ENABLE(JIT)