Repository navigation
Expand file tree
/
Copy pathCallLinkStatus.h
More file actions
136 lines (105 loc) · 4.54 KB
/
Copy pathCallLinkStatus.h
File metadata and controls
136 lines (105 loc) · 4.54 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
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
/*
* Copyright (C) 2012-2023 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
#include "CallLinkInfo.h"
#include "CallVariant.h"
#include "CodeOrigin.h"
#include "ConcurrentJSLock.h"
#include "ExitFlag.h"
#include "ICStatusMap.h"
#include "JSCJSValue.h"
#include <wtf/TZoneMalloc.h>
namespace JSC {
class CodeBlock;
class InternalFunction;
class JSFunction;
class Structure;
class CallLinkInfo;
class CallLinkStatus final {
WTF_MAKE_TZONE_ALLOCATED(CallLinkStatus);
public:
CallLinkStatus()
{
}
static CallLinkStatus takesSlowPath()
{
CallLinkStatus result;
result.m_couldTakeSlowPath = true;
return result;
}
explicit CallLinkStatus(JSValue);
CallLinkStatus(CallVariant variant)
: m_variants(FillWith { }, 1, variant)
{
}
struct ExitSiteData {
ExitFlag takesSlowPath;
ExitFlag badFunction;
};
static ExitSiteData computeExitSiteData(CodeBlock*, BytecodeIndex);
static CallLinkStatus computeFor(CodeBlock*, BytecodeIndex, const ICStatusMap&, ExitSiteData);
static CallLinkStatus computeFor(CodeBlock*, BytecodeIndex, const ICStatusMap&);
#if ENABLE(JIT)
// Computes the status assuming that we never took slow path and never previously
// exited.
static CallLinkStatus computeFor(const ConcurrentJSLocker&, CodeBlock*, CallLinkInfo&);
// Computes the status accounting for exits.
static CallLinkStatus computeFor(
const ConcurrentJSLocker&, CodeBlock*, CallLinkInfo&, ExitSiteData, ExitingInlineKind = ExitFromAnyInlineKind);
#endif
static CallLinkStatus computeFor(
CodeBlock*, CodeOrigin, const ICStatusMap&, const ICStatusContextStack&);
void setProvenConstantCallee(CallVariant);
bool isSet() const { return !m_variants.isEmpty() || m_couldTakeSlowPath; }
explicit operator bool() const { return isSet(); }
bool couldTakeSlowPath() const { return m_couldTakeSlowPath; }
void setCouldTakeSlowPath(bool value) { m_couldTakeSlowPath = value; }
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 LEGACY_NODELETE isClosureCall() const; // Returns true if any callee is a closure call.
void makeClosureCall();
unsigned maxArgumentCountIncludingThisForVarargs() const { return m_maxArgumentCountIncludingThisForVarargs; }
bool isStillLive(VM&);
void merge(const CallLinkStatus&);
void filter(JSValue);
void dump(PrintStream&) const;
private:
#if ENABLE(JIT)
static CallLinkStatus computeFromCallLinkInfo(
const ConcurrentJSLocker&, CallLinkInfo&);
#endif
void accountForExits(ExitSiteData, ExitingInlineKind);
CallVariantList m_variants;
bool m_couldTakeSlowPath { false };
bool m_isProved { false };
bool m_isBasedOnStub { false };
uint8_t m_maxArgumentCountIncludingThisForVarargs { 0 }; // More than UINT8_MAX will be recorded as UINT8_MAX.
};
} // namespace JSC