2 * Copyright (C) 2011, 2012, 2013, 2014 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
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.
26 #ifndef DFGExitProfile_h
27 #define DFGExitProfile_h
31 #include "ConcurrentJITLock.h"
33 #include "ExitingJITType.h"
34 #include <wtf/HashSet.h>
35 #include <wtf/Vector.h>
37 namespace JSC
{ namespace DFG
{
39 class FrequentExitSite
{
42 : m_bytecodeOffset(0) // 0 = empty value
43 , m_kind(ExitKindUnset
)
44 , m_jitType(ExitFromAnything
)
48 FrequentExitSite(WTF::HashTableDeletedValueType
)
49 : m_bytecodeOffset(1) // 1 = deleted value
50 , m_kind(ExitKindUnset
)
51 , m_jitType(ExitFromAnything
)
55 explicit FrequentExitSite(unsigned bytecodeOffset
, ExitKind kind
, ExitingJITType jitType
= ExitFromAnything
)
56 : m_bytecodeOffset(bytecodeOffset
)
60 if (m_kind
== ArgumentsEscaped
) {
61 // Count this one globally. It doesn't matter where in the code block the arguments excaped;
62 // the fact that they did is not associated with any particular instruction.
67 // Use this constructor if you wish for the exit site to be counted globally within its
69 explicit FrequentExitSite(ExitKind kind
, ExitingJITType jitType
= ExitFromAnything
)
76 bool operator!() const
78 return m_kind
== ExitKindUnset
;
81 bool operator==(const FrequentExitSite
& other
) const
83 return m_bytecodeOffset
== other
.m_bytecodeOffset
84 && m_kind
== other
.m_kind
85 && m_jitType
== other
.m_jitType
;
88 bool subsumes(const FrequentExitSite
& other
) const
90 if (m_bytecodeOffset
!= other
.m_bytecodeOffset
)
92 if (m_kind
!= other
.m_kind
)
94 if (m_jitType
== ExitFromAnything
)
96 return m_jitType
== other
.m_jitType
;
101 return WTF::intHash(m_bytecodeOffset
) + m_kind
+ m_jitType
* 7;
104 unsigned bytecodeOffset() const { return m_bytecodeOffset
; }
105 ExitKind
kind() const { return m_kind
; }
106 ExitingJITType
jitType() const { return m_jitType
; }
108 FrequentExitSite
withJITType(ExitingJITType jitType
) const
110 FrequentExitSite result
= *this;
111 result
.m_jitType
= jitType
;
115 bool isHashTableDeletedValue() const
117 return m_kind
== ExitKindUnset
&& m_bytecodeOffset
;
121 unsigned m_bytecodeOffset
;
123 ExitingJITType m_jitType
;
126 struct FrequentExitSiteHash
{
127 static unsigned hash(const FrequentExitSite
& key
) { return key
.hash(); }
128 static bool equal(const FrequentExitSite
& a
, const FrequentExitSite
& b
) { return a
== b
; }
129 static const bool safeToCompareToEmptyOrDeleted
= true;
132 } } // namespace JSC::DFG
137 template<typename T
> struct DefaultHash
;
138 template<> struct DefaultHash
<JSC::DFG::FrequentExitSite
> {
139 typedef JSC::DFG::FrequentExitSiteHash Hash
;
142 template<typename T
> struct HashTraits
;
143 template<> struct HashTraits
<JSC::DFG::FrequentExitSite
> : SimpleClassHashTraits
<JSC::DFG::FrequentExitSite
> { };
147 namespace JSC
{ namespace DFG
{
149 class QueryableExitProfile
;
156 // Add a new frequent exit site. Return true if this is a new one, or false
157 // if we already knew about it. This is an O(n) operation, because it errs
158 // on the side of keeping the data structure compact. Also, this will only
159 // be called a fixed number of times per recompilation. Recompilation is
160 // rare to begin with, and implies doing O(n) operations on the CodeBlock
162 bool add(const ConcurrentJITLocker
&, const FrequentExitSite
&);
164 // Get the frequent exit sites for a bytecode index. This is O(n), and is
165 // meant to only be used from debugging/profiling code.
166 Vector
<FrequentExitSite
> exitSitesFor(unsigned bytecodeIndex
);
168 // This is O(n) and should be called on less-frequently executed code paths
169 // in the compiler. It should be strictly cheaper than building a
170 // QueryableExitProfile, if you really expect this to be called infrequently
171 // and you believe that there are few exit sites.
172 bool hasExitSite(const ConcurrentJITLocker
&, const FrequentExitSite
&) const;
173 bool hasExitSite(const ConcurrentJITLocker
& locker
, ExitKind kind
) const
175 return hasExitSite(locker
, FrequentExitSite(kind
));
177 bool hasExitSite(const ConcurrentJITLocker
& locker
, unsigned bytecodeIndex
, ExitKind kind
) const
179 return hasExitSite(locker
, FrequentExitSite(bytecodeIndex
, kind
));
183 friend class QueryableExitProfile
;
185 std::unique_ptr
<Vector
<FrequentExitSite
>> m_frequentExitSites
;
188 class QueryableExitProfile
{
190 QueryableExitProfile();
191 ~QueryableExitProfile();
193 void initialize(const ConcurrentJITLocker
&, const ExitProfile
&);
195 bool hasExitSite(const FrequentExitSite
& site
) const
197 if (site
.jitType() == ExitFromAnything
) {
198 return hasExitSite(site
.withJITType(ExitFromDFG
))
199 || hasExitSite(site
.withJITType(ExitFromFTL
));
201 return m_frequentExitSites
.find(site
) != m_frequentExitSites
.end();
204 bool hasExitSite(ExitKind kind
) const
206 return hasExitSite(FrequentExitSite(kind
));
209 bool hasExitSite(unsigned bytecodeIndex
, ExitKind kind
) const
211 return hasExitSite(FrequentExitSite(bytecodeIndex
, kind
));
214 HashSet
<FrequentExitSite
> m_frequentExitSites
;
217 } } // namespace JSC::DFG
219 #endif // ENABLE(DFG_JIT)
221 #endif // DFGExitProfile_h