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