1/*
2 * Copyright (C) 2013 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#pragma once
27
28#include "DFGCommon.h"
29#include <wtf/HashMap.h>
30#include <wtf/PrintStream.h>
31
32namespace JSC { namespace DFG {
33
34class Graph;
35class MinifiedNode;
36class ValueSource;
37struct Node;
38
39class MinifiedID {
40public:
41 MinifiedID() : m_id(invalidID()) { }
42 MinifiedID(WTF::HashTableDeletedValueType) : m_id(otherInvalidID()) { }
43 explicit MinifiedID(Node* node) : m_id(bitwise_cast<uintptr_t>(node)) { }
44
45 bool operator!() const { return m_id == invalidID(); }
46
47 // This takes Graph& to remind you, that you should only be calling this method
48 // when you're in the main compilation pass (i.e. you have a graph) and not later,
49 // like during OSR exit compilation.
50 Node* node(const Graph&) const { return bitwise_cast<Node*>(m_id); }
51
52 bool operator==(const MinifiedID& other) const { return m_id == other.m_id; }
53 bool operator!=(const MinifiedID& other) const { return m_id != other.m_id; }
54 bool operator<(const MinifiedID& other) const { return m_id < other.m_id; }
55 bool operator>(const MinifiedID& other) const { return m_id > other.m_id; }
56 bool operator<=(const MinifiedID& other) const { return m_id <= other.m_id; }
57 bool operator>=(const MinifiedID& other) const { return m_id >= other.m_id; }
58
59 unsigned hash() const { return WTF::IntHash<uintptr_t>::hash(m_id); }
60
61 void dump(PrintStream& out) const { out.print(RawPointer(reinterpret_cast<void*>(m_id))); }
62
63 bool isHashTableDeletedValue() const { return m_id == otherInvalidID(); }
64
65 static MinifiedID fromBits(uintptr_t value)
66 {
67 MinifiedID result;
68 result.m_id = value;
69 return result;
70 }
71
72 uintptr_t bits() const { return m_id; }
73
74private:
75 friend class MinifiedNode;
76
77 static uintptr_t invalidID() { return static_cast<uintptr_t>(static_cast<intptr_t>(-1)); }
78 static uintptr_t otherInvalidID() { return static_cast<uintptr_t>(static_cast<intptr_t>(-2)); }
79
80 uintptr_t m_id;
81};
82
83struct MinifiedIDHash {
84 static unsigned hash(const MinifiedID& key) { return key.hash(); }
85 static bool equal(const MinifiedID& a, const MinifiedID& b) { return a == b; }
86 static const bool safeToCompareToEmptyOrDeleted = true;
87};
88
89} } // namespace JSC::DFG
90
91namespace WTF {
92
93template<typename T> struct DefaultHash;
94template<> struct DefaultHash<JSC::DFG::MinifiedID> {
95 typedef JSC::DFG::MinifiedIDHash Hash;
96};
97
98template<typename T> struct HashTraits;
99template<> struct HashTraits<JSC::DFG::MinifiedID> : SimpleClassHashTraits<JSC::DFG::MinifiedID> {
100 static const bool emptyValueIsZero = false;
101};
102
103} // namespace WTF
104