dfg/DFGMinifiedID.h

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