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#pragma once
27
28#include "CodeBlockHash.h"
29#include "JSCJSValue.h"
30#include <wtf/PrintStream.h>
31
32namespace JSC {
33
34class CodeBlock;
35
36namespace Profiler {
37
38class Bytecodes;
39class Database;
40
41class Origin {
42public:
43 Origin()
44 : m_bytecodeIndex(std::numeric_limits<unsigned>::max())
45 {
46 }
47
48 Origin(WTF::HashTableDeletedValueType)
49 : m_bytecodeIndex(std::numeric_limits<unsigned>::max() - 1)
50 {
51 }
52
53 Origin(Bytecodes* bytecodes, unsigned bytecodeIndex)
54 : m_bytecodes(bytecodes)
55 , m_bytecodeIndex(bytecodeIndex)
56 {
57 ASSERT(m_bytecodeIndex < std::numeric_limits<unsigned>::max() - 1);
58 }
59
60 Origin(Database&, CodeBlock*, unsigned bytecodeIndex);
61
62 bool operator!() const { return m_bytecodeIndex == std::numeric_limits<unsigned>::max(); }
63
64 Bytecodes* bytecodes() const { return m_bytecodes; }
65 unsigned bytecodeIndex() const { return m_bytecodeIndex; }
66
67 bool operator==(const Origin&) const;
68 bool operator!=(const Origin& other) const { return !(*this == other); }
69 unsigned hash() const;
70
71 bool isHashTableDeletedValue() const;
72
73 void dump(PrintStream&) const;
74 JSValue toJS(ExecState*) const;
75
76private:
77 Bytecodes* m_bytecodes;
78 unsigned m_bytecodeIndex;
79};
80
81inline bool Origin::operator==(const Origin& other) const
82{
83 return m_bytecodes == other.m_bytecodes
84 && m_bytecodeIndex == other.m_bytecodeIndex;
85}
86
87inline unsigned Origin::hash() const
88{
89 return WTF::PtrHash<Bytecodes*>::hash(m_bytecodes) + m_bytecodeIndex;
90}
91
92inline bool Origin::isHashTableDeletedValue() const
93{
94 return m_bytecodeIndex == std::numeric_limits<unsigned>::max();
95}
96
97struct OriginHash {
98 static unsigned hash(const Origin& key) { return key.hash(); }
99 static bool equal(const Origin& a, const Origin& b) { return a == b; }
100 static const bool safeToCompareToEmptyOrDeleted = true;
101};
102
103} } // namespace JSC::Profiler
104
105namespace WTF {
106
107template<typename T> struct DefaultHash;
108template<> struct DefaultHash<JSC::Profiler::Origin> {
109 typedef JSC::Profiler::OriginHash Hash;
110};
111
112template<typename T> struct HashTraits;
113template<> struct HashTraits<JSC::Profiler::Origin> : SimpleClassHashTraits<JSC::Profiler::Origin> { };
114
115} // namespace WTF
116