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
|
/*
* Copyright (C) 2012 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 DFGMinifiedNode_h
#define DFGMinifiedNode_h
#include <wtf/Platform.h>
#if ENABLE(DFG_JIT)
#include "DFGCommon.h"
#include "DFGMinifiedID.h"
#include "DFGNodeType.h"
namespace JSC { namespace DFG {
struct Node;
inline bool belongsInMinifiedGraph(NodeType type)
{
switch (type) {
case JSConstant:
case WeakJSConstant:
case ValueToInt32:
case Int32ToDouble:
case ForwardInt32ToDouble:
case UInt32ToNumber:
case DoubleAsInt32:
case PhantomArguments:
return true;
default:
return false;
}
}
class MinifiedNode {
public:
MinifiedNode() { }
static MinifiedNode fromNode(Node*);
MinifiedID id() const { return m_id; }
NodeType op() const { return m_op; }
bool hasChild1() const { return hasChild(m_op); }
MinifiedID child1() const
{
ASSERT(hasChild(m_op));
return MinifiedID::fromBits(m_childOrInfo);
}
bool hasConstant() const { return hasConstantNumber() || hasWeakConstant(); }
bool hasConstantNumber() const { return hasConstantNumber(m_op); }
unsigned constantNumber() const
{
ASSERT(hasConstantNumber(m_op));
return m_childOrInfo;
}
bool hasWeakConstant() const { return hasWeakConstant(m_op); }
JSCell* weakConstant() const
{
ASSERT(hasWeakConstant(m_op));
return bitwise_cast<JSCell*>(m_childOrInfo);
}
static MinifiedID getID(MinifiedNode* node) { return node->id(); }
static bool compareByNodeIndex(const MinifiedNode& a, const MinifiedNode& b)
{
return a.m_id < b.m_id;
}
private:
static bool hasChild(NodeType type)
{
switch (type) {
case ValueToInt32:
case Int32ToDouble:
case ForwardInt32ToDouble:
case UInt32ToNumber:
case DoubleAsInt32:
return true;
default:
return false;
}
}
static bool hasConstantNumber(NodeType type)
{
return type == JSConstant;
}
static bool hasWeakConstant(NodeType type)
{
return type == WeakJSConstant;
}
MinifiedID m_id;
uintptr_t m_childOrInfo; // Nodes in the minified graph have only one child each.
NodeType m_op;
};
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
#endif // DFGMinifiedNode_h
|
