1/*
2 * Copyright (C) 2013, 2014 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 "DFGNode.h"
28
29#if ENABLE(DFG_JIT)
30
31#include "DFGGraph.h"
32#include "DFGNodeAllocator.h"
33#include "JSCInlines.h"
34
35namespace JSC { namespace DFG {
36
37bool MultiPutByOffsetData::writesStructures() const
38{
39    for (unsigned i = variants.size(); i--;) {
40        if (variants[i].kind() == PutByIdVariant::Transition)
41            return true;
42    }
43    return false;
44}
45
46bool MultiPutByOffsetData::reallocatesStorage() const
47{
48    for (unsigned i = variants.size(); i--;) {
49        if (variants[i].kind() != PutByIdVariant::Transition)
50            continue;
51
52        if (variants[i].oldStructure()->outOfLineCapacity() ==
53            variants[i].newStructure()->outOfLineCapacity())
54            continue;
55
56        return true;
57    }
58    return false;
59}
60
61void BranchTarget::dump(PrintStream& out) const
62{
63    if (!block)
64        return;
65
66    out.print(*block);
67
68    if (count == count) // If the count is not NaN, then print it.
69        out.print("/w:", count);
70}
71
72unsigned Node::index() const
73{
74    return NodeAllocator::allocatorOf(this)->indexOf(this);
75}
76
77bool Node::hasVariableAccessData(Graph& graph)
78{
79    switch (op()) {
80    case Phi:
81        return graph.m_form != SSA;
82    case GetLocal:
83    case GetArgument:
84    case SetLocal:
85    case SetArgument:
86    case Flush:
87    case PhantomLocal:
88        return true;
89    default:
90        return false;
91    }
92}
93
94void Node::convertToIdentity()
95{
96    RELEASE_ASSERT(child1());
97    RELEASE_ASSERT(!child2());
98    NodeFlags result = canonicalResultRepresentation(this->result());
99    setOpAndDefaultFlags(Identity);
100    setResult(result);
101}
102
103} } // namespace JSC::DFG
104
105namespace WTF {
106
107using namespace JSC;
108using namespace JSC::DFG;
109
110void printInternal(PrintStream& out, SwitchKind kind)
111{
112    switch (kind) {
113    case SwitchImm:
114        out.print("SwitchImm");
115        return;
116    case SwitchChar:
117        out.print("SwitchChar");
118        return;
119    case SwitchString:
120        out.print("SwitchString");
121        return;
122    }
123    RELEASE_ASSERT_NOT_REACHED();
124}
125
126void printInternal(PrintStream& out, Node* node)
127{
128    if (!node) {
129        out.print("-");
130        return;
131    }
132    out.print("@", node->index());
133    if (node->hasDoubleResult())
134        out.print("<Double>");
135    else if (node->hasInt52Result())
136        out.print("<Int52>");
137}
138
139} // namespace WTF
140
141#endif // ENABLE(DFG_JIT)
142
143