1/*
2 * Copyright (C) 2015-2018 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
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.
12 *
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.
24 */
25
26#include "config.h"
27#include "B3StackmapValue.h"
28
29#if ENABLE(B3_JIT)
30
31namespace JSC { namespace B3 {
32
33StackmapValue::~StackmapValue()
34{
35}
36
37void StackmapValue::append(Value* value, const ValueRep& rep)
38{
39 if (rep == ValueRep::ColdAny) {
40 childrenVector().append(value);
41 return;
42 }
43
44 while (m_reps.size() < numChildren())
45 m_reps.append(ValueRep::ColdAny);
46
47 childrenVector().append(value);
48 m_reps.append(rep);
49}
50
51void StackmapValue::appendSomeRegister(Value* value)
52{
53 append(ConstrainedValue(value, ValueRep::SomeRegister));
54}
55
56void StackmapValue::appendSomeRegisterWithClobber(Value* value)
57{
58 append(ConstrainedValue(value, ValueRep::SomeRegisterWithClobber));
59}
60
61void StackmapValue::setConstrainedChild(unsigned index, const ConstrainedValue& constrainedValue)
62{
63 child(index) = constrainedValue.value();
64 setConstraint(index, constrainedValue.rep());
65}
66
67void StackmapValue::setConstraint(unsigned index, const ValueRep& rep)
68{
69 if (rep == ValueRep(ValueRep::ColdAny))
70 return;
71
72 while (m_reps.size() <= index)
73 m_reps.append(ValueRep::ColdAny);
74
75 m_reps[index] = rep;
76}
77
78void StackmapValue::dumpChildren(CommaPrinter& comma, PrintStream& out) const
79{
80 for (ConstrainedValue value : constrainedChildren())
81 out.print(comma, value);
82}
83
84void StackmapValue::dumpMeta(CommaPrinter& comma, PrintStream& out) const
85{
86 out.print(
87 comma, "generator = ", RawPointer(m_generator.get()), ", earlyClobbered = ", m_earlyClobbered,
88 ", lateClobbered = ", m_lateClobbered, ", usedRegisters = ", m_usedRegisters);
89}
90
91StackmapValue::StackmapValue(CheckedOpcodeTag, Kind kind, Type type, Origin origin)
92 : Value(CheckedOpcode, kind, type, VarArgs, origin)
93{
94 ASSERT(accepts(kind));
95}
96
97} } // namespace JSC::B3
98
99#endif // ENABLE(B3_JIT)
100
101