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
|
/*
* Copyright (C) 2015 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 "B3StackmapValue.h"
#if ENABLE(B3_JIT)
namespace JSC { namespace B3 {
StackmapValue::~StackmapValue()
{
}
void StackmapValue::append(Value* value, const ValueRep& rep)
{
if (rep == ValueRep::ColdAny) {
children().append(value);
return;
}
while (m_reps.size() < numChildren())
m_reps.append(ValueRep::ColdAny);
children().append(value);
m_reps.append(rep);
}
void StackmapValue::appendSomeRegister(Value* value)
{
append(ConstrainedValue(value, ValueRep::SomeRegister));
}
void StackmapValue::setConstrainedChild(unsigned index, const ConstrainedValue& constrainedValue)
{
child(index) = constrainedValue.value();
setConstraint(index, constrainedValue.rep());
}
void StackmapValue::setConstraint(unsigned index, const ValueRep& rep)
{
if (rep == ValueRep(ValueRep::ColdAny))
return;
while (m_reps.size() <= index)
m_reps.append(ValueRep::ColdAny);
m_reps[index] = rep;
}
void StackmapValue::dumpChildren(CommaPrinter& comma, PrintStream& out) const
{
for (ConstrainedValue value : constrainedChildren())
out.print(comma, value);
}
void StackmapValue::dumpMeta(CommaPrinter& comma, PrintStream& out) const
{
out.print(
comma, "generator = ", RawPointer(m_generator.get()), ", earlyClobbered = ", m_earlyClobbered,
", lateClobbered = ", m_lateClobbered, ", usedRegisters = ", m_usedRegisters);
}
StackmapValue::StackmapValue(CheckedOpcodeTag, Opcode opcode, Type type, Origin origin)
: Value(CheckedOpcode, opcode, type, origin)
{
ASSERT(accepts(opcode));
}
} } // namespace JSC::B3
#endif // ENABLE(B3_JIT)
|
