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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/*
* Copyright (C) 2012-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.
*/
#ifndef CallLinkStatus_h
#define CallLinkStatus_h
#include "CallLinkInfo.h"
#include "CallVariant.h"
#include "CodeOrigin.h"
#include "CodeSpecializationKind.h"
#include "ConcurrentJITLock.h"
#include "ExitingJITType.h"
#include "Intrinsic.h"
#include "JSCJSValue.h"
namespace JSC {
class CodeBlock;
class ExecutableBase;
class InternalFunction;
class JSFunction;
class Structure;
class CallLinkInfo;
class CallLinkStatus {
WTF_MAKE_FAST_ALLOCATED;
public:
CallLinkStatus()
{
}
static CallLinkStatus takesSlowPath()
{
CallLinkStatus result;
result.m_couldTakeSlowPath = true;
return result;
}
explicit CallLinkStatus(JSValue);
CallLinkStatus(CallVariant variant)
: m_variants(1, variant)
{
}
static CallLinkStatus computeFor(
CodeBlock*, unsigned bytecodeIndex, const CallLinkInfoMap&);
struct ExitSiteData {
bool takesSlowPath { false };
bool badFunction { false };
};
static ExitSiteData computeExitSiteData(const ConcurrentJITLocker&, CodeBlock*, unsigned bytecodeIndex);
#if ENABLE(JIT)
// Computes the status assuming that we never took slow path and never previously
// exited.
static CallLinkStatus computeFor(const ConcurrentJITLocker&, CodeBlock*, CallLinkInfo&);
static CallLinkStatus computeFor(
const ConcurrentJITLocker&, CodeBlock*, CallLinkInfo&, ExitSiteData);
#endif
typedef HashMap<CodeOrigin, CallLinkStatus, CodeOriginApproximateHash> ContextMap;
// Computes all of the statuses of the DFG code block. Doesn't include statuses that had
// no information. Currently we use this when compiling FTL code, to enable polyvariant
// inlining.
static void computeDFGStatuses(CodeBlock* dfgCodeBlock, ContextMap&);
// Helper that first consults the ContextMap and then does computeFor().
static CallLinkStatus computeFor(
CodeBlock*, CodeOrigin, const CallLinkInfoMap&, const ContextMap&);
void setProvenConstantCallee(CallVariant);
bool isSet() const { return !m_variants.isEmpty() || m_couldTakeSlowPath; }
bool operator!() const { return !isSet(); }
bool couldTakeSlowPath() const { return m_couldTakeSlowPath; }
CallVariantList variants() const { return m_variants; }
unsigned size() const { return m_variants.size(); }
CallVariant at(unsigned i) const { return m_variants[i]; }
CallVariant operator[](unsigned i) const { return at(i); }
bool isProved() const { return m_isProved; }
bool isBasedOnStub() const { return m_isBasedOnStub; }
bool canOptimize() const { return !m_variants.isEmpty(); }
bool isClosureCall() const; // Returns true if any callee is a closure call.
unsigned maxNumArguments() const { return m_maxNumArguments; }
void dump(PrintStream&) const;
private:
void makeClosureCall();
static CallLinkStatus computeFromLLInt(const ConcurrentJITLocker&, CodeBlock*, unsigned bytecodeIndex);
#if ENABLE(JIT)
static CallLinkStatus computeFromCallLinkInfo(
const ConcurrentJITLocker&, CallLinkInfo&);
#endif
CallVariantList m_variants;
bool m_couldTakeSlowPath { false };
bool m_isProved { false };
bool m_isBasedOnStub { false };
unsigned m_maxNumArguments { 0 };
};
} // namespace JSC
#endif // CallLinkStatus_h
|
