1/* 2 * Copyright (C) 2012 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#ifndef DFGMinifiedNode_h 27#define DFGMinifiedNode_h 28 29#include <wtf/Platform.h> 30 31#if ENABLE(DFG_JIT) 32 33#include "DFGCommon.h" 34#include "DFGMinifiedID.h" 35#include "DFGNodeType.h" 36 37namespace JSC { namespace DFG { 38 39struct Node; 40 41inline bool belongsInMinifiedGraph(NodeType type) 42{ 43 switch (type) { 44 case JSConstant: 45 case WeakJSConstant: 46 case ValueToInt32: 47 case Int32ToDouble: 48 case ForwardInt32ToDouble: 49 case UInt32ToNumber: 50 case DoubleAsInt32: 51 case PhantomArguments: 52 return true; 53 default: 54 return false; 55 } 56} 57 58class MinifiedNode { 59public: 60 MinifiedNode() { } 61 62 static MinifiedNode fromNode(Node*); 63 64 MinifiedID id() const { return m_id; } 65 NodeType op() const { return m_op; } 66 67 bool hasChild1() const { return hasChild(m_op); } 68 69 MinifiedID child1() const 70 { 71 ASSERT(hasChild(m_op)); 72 return MinifiedID::fromBits(m_childOrInfo); 73 } 74 75 bool hasConstant() const { return hasConstantNumber() || hasWeakConstant(); } 76 77 bool hasConstantNumber() const { return hasConstantNumber(m_op); } 78 79 unsigned constantNumber() const 80 { 81 ASSERT(hasConstantNumber(m_op)); 82 return m_childOrInfo; 83 } 84 85 bool hasWeakConstant() const { return hasWeakConstant(m_op); } 86 87 JSCell* weakConstant() const 88 { 89 ASSERT(hasWeakConstant(m_op)); 90 return bitwise_cast<JSCell*>(m_childOrInfo); 91 } 92 93 static MinifiedID getID(MinifiedNode* node) { return node->id(); } 94 static bool compareByNodeIndex(const MinifiedNode& a, const MinifiedNode& b) 95 { 96 return a.m_id < b.m_id; 97 } 98 99private: 100 static bool hasChild(NodeType type) 101 { 102 switch (type) { 103 case ValueToInt32: 104 case Int32ToDouble: 105 case ForwardInt32ToDouble: 106 case UInt32ToNumber: 107 case DoubleAsInt32: 108 return true; 109 default: 110 return false; 111 } 112 } 113 static bool hasConstantNumber(NodeType type) 114 { 115 return type == JSConstant; 116 } 117 static bool hasWeakConstant(NodeType type) 118 { 119 return type == WeakJSConstant; 120 } 121 122 MinifiedID m_id; 123 uintptr_t m_childOrInfo; // Nodes in the minified graph have only one child each. 124 NodeType m_op; 125}; 126 127} } // namespace JSC::DFG 128 129#endif // ENABLE(DFG_JIT) 130 131#endif // DFGMinifiedNode_h 132 133