Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
120 lines (95 loc) · 4.15 KB

File metadata and controls

120 lines (95 loc) · 4.15 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
/*
* Copyright (C) 2011, 2016 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.
*/
#include "config.h"
#include "DFGExitProfile.h"
#if ENABLE(DFG_JIT)
#include "CodeBlock.h"
#include "VMInlines.h"
namespace JSC { namespace DFG {
void FrequentExitSite::dump(PrintStream& out) const
{
out.print(m_bytecodeIndex, ": ", m_kind, "/", m_jitType, "/", m_inlineKind);
}
ExitProfile::ExitProfile() = default;
ExitProfile::~ExitProfile() = default;
bool ExitProfile::add(CodeBlock* owner, const FrequentExitSite& site)
{
RELEASE_ASSERT(site.jitType() != ExitFromAnything);
RELEASE_ASSERT(site.inlineKind() != ExitFromAnyInlineKind);
ConcurrentJSLocker locker(owner->unlinkedCodeBlock()->m_lock);
CODEBLOCK_LOG_EVENT(owner, "frequentExit", (site));
dataLogLnIf(Options::verboseExitProfile(), pointerDump(owner), ": Adding exit site: ", site);
ExitProfile& profile = owner->unlinkedCodeBlock()->exitProfile();
// If we've never seen any frequent exits then create the list and put this site
// into it.
if (!profile.m_frequentExitSites) {
profile.m_frequentExitSites = makeUnique<Vector<FrequentExitSite>>();
profile.m_frequentExitSites->append(site);
return true;
}
// Don't add it if it's already there. This is O(n), but that's OK, because we
// know that the total number of places where code exits tends to not be large,
// and this code is only used when recompilation is triggered.
for (unsigned i = 0; i < profile.m_frequentExitSites->size(); ++i) {
if (profile.m_frequentExitSites->at(i) == site)
return false;
}
profile.m_frequentExitSites->append(site);
return true;
}
Vector<FrequentExitSite> ExitProfile::exitSitesFor(BytecodeIndex bytecodeIndex)
{
Vector<FrequentExitSite> result;
if (!m_frequentExitSites)
return result;
for (unsigned i = 0; i < m_frequentExitSites->size(); ++i) {
if (m_frequentExitSites->at(i).bytecodeIndex() == bytecodeIndex)
result.append(m_frequentExitSites->at(i));
}
return result;
}
bool ExitProfile::hasExitSite(const ConcurrentJSLocker&, const FrequentExitSite& site) const
{
if (!m_frequentExitSites)
return false;
for (unsigned i = m_frequentExitSites->size(); i--;) {
if (site.subsumes(m_frequentExitSites->at(i)))
return true;
}
return false;
}
QueryableExitProfile::QueryableExitProfile() = default;
QueryableExitProfile::~QueryableExitProfile() = default;
void QueryableExitProfile::initialize(UnlinkedCodeBlock* unlinkedCodeBlock)
{
ConcurrentJSLocker locker(unlinkedCodeBlock->m_lock);
const ExitProfile& profile = unlinkedCodeBlock->exitProfile();
if (!profile.m_frequentExitSites)
return;
for (unsigned i = 0; i < profile.m_frequentExitSites->size(); ++i)
m_frequentExitSites.add(profile.m_frequentExitSites->at(i));
}
} } // namespace JSC::DFG
#endif
Morty Proxy This is a proxified and sanitized view of the page, visit original site.