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#include "config.h"
27#include "ProfilerOriginStack.h"
28
29#include "CodeOrigin.h"
30#include "JSGlobalObject.h"
31#include "JSCInlines.h"
32#include "ProfilerDatabase.h"
33
34namespace JSC { namespace Profiler {
35
36OriginStack::OriginStack(WTF::HashTableDeletedValueType)
37{
38    m_stack.append(Origin(WTF::HashTableDeletedValue));
39}
40
41OriginStack::OriginStack(const Origin& origin)
42{
43    m_stack.append(origin);
44}
45
46OriginStack::OriginStack(Database& database, CodeBlock* codeBlock, const CodeOrigin& codeOrigin)
47{
48    Vector<CodeOrigin> stack = codeOrigin.inlineStack();
49
50    append(Origin(database, codeBlock, stack[0].bytecodeIndex));
51
52    for (unsigned i = 1; i < stack.size(); ++i) {
53        append(Origin(
54            database.ensureBytecodesFor(stack[i].inlineCallFrame->baselineCodeBlock()),
55            stack[i].bytecodeIndex));
56    }
57}
58
59OriginStack::~OriginStack() { }
60
61void OriginStack::append(const Origin& origin)
62{
63    m_stack.append(origin);
64}
65
66bool OriginStack::operator==(const OriginStack& other) const
67{
68    if (m_stack.size() != other.m_stack.size())
69        return false;
70
71    for (unsigned i = m_stack.size(); i--;) {
72        if (m_stack[i] != other.m_stack[i])
73            return false;
74    }
75
76    return true;
77}
78
79unsigned OriginStack::hash() const
80{
81    unsigned result = m_stack.size();
82
83    for (unsigned i = m_stack.size(); i--;) {
84        result *= 3;
85        result += m_stack[i].hash();
86    }
87
88    return result;
89}
90
91void OriginStack::dump(PrintStream& out) const
92{
93    for (unsigned i = 0; i < m_stack.size(); ++i) {
94        if (i)
95            out.print(" --> ");
96        out.print(m_stack[i]);
97    }
98}
99
100JSValue OriginStack::toJS(ExecState* exec) const
101{
102    JSArray* result = constructEmptyArray(exec, 0);
103
104    for (unsigned i = 0; i < m_stack.size(); ++i)
105        result->putDirectIndex(exec, i, m_stack[i].toJS(exec));
106
107    return result;
108}
109
110} } // namespace JSC::Profiler
111
112