1/*
2 * Copyright (C) 2012-2019 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 "JSCJSValue.h"
29#include "ProfilerOrigin.h"
30#include <wtf/PrintStream.h>
31#include <wtf/Vector.h>
32
33namespace JSC {
34
35class CodeBlock;
36class CodeOrigin;
37
38namespace Profiler {
39
40class Database;
41
42class OriginStack {
43public:
44 OriginStack() { }
45
46 OriginStack(WTF::HashTableDeletedValueType);
47
48 explicit OriginStack(const Origin&);
49
50 explicit OriginStack(Database&, CodeBlock*, const CodeOrigin&);
51
52 ~OriginStack();
53
54 void append(const Origin&);
55
56 bool operator!() const { return m_stack.isEmpty(); }
57
58 unsigned size() const { return m_stack.size(); }
59 const Origin& fromBottom(unsigned i) const { return m_stack[i]; }
60 const Origin& fromTop(unsigned i) const { return m_stack[m_stack.size() - i - 1]; }
61
62 bool operator==(const OriginStack&) const;
63 unsigned hash() const;
64
65 bool isHashTableDeletedValue() const;
66
67 void dump(PrintStream&) const;
68 JSValue toJS(JSGlobalObject*) const;
69
70private:
71 Vector<Origin, 1> m_stack;
72};
73
74inline bool OriginStack::isHashTableDeletedValue() const
75{
76 return m_stack.size() == 1 && m_stack[0].isHashTableDeletedValue();
77}
78
79struct OriginStackHash {
80 static unsigned hash(const OriginStack& key) { return key.hash(); }
81 static bool equal(const OriginStack& a, const OriginStack& b) { return a == b; }
82 static constexpr bool safeToCompareToEmptyOrDeleted = true;
83};
84
85} } // namespace JSC::Profiler
86
87namespace WTF {
88
89template<typename T> struct DefaultHash;
90template<> struct DefaultHash<JSC::Profiler::OriginStack> {
91 typedef JSC::Profiler::OriginStackHash Hash;
92};
93
94template<typename T> struct HashTraits;
95template<> struct HashTraits<JSC::Profiler::OriginStack> : SimpleClassHashTraits<JSC::Profiler::OriginStack> { };
96
97} // namespace WTF
98