1 | /* |
2 | * Copyright (C) 2014 Apple Inc. All rights reserved. |
3 | * Copyright (c) 2008, Google Inc. All rights reserved. |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions are |
7 | * met: |
8 | * |
9 | * * Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * * Redistributions in binary form must reproduce the above |
12 | * copyright notice, this list of conditions and the following disclaimer |
13 | * in the documentation and/or other materials provided with the |
14 | * distribution. |
15 | * * Neither the name of Google Inc. nor the names of its |
16 | * contributors may be used to endorse or promote products derived from |
17 | * this software without specific prior written permission. |
18 | * |
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
21 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
22 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
23 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
24 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
25 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
27 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 | */ |
31 | |
32 | #include "config.h" |
33 | #include "ScriptCallStack.h" |
34 | |
35 | #include <wtf/DataLog.h> |
36 | |
37 | namespace Inspector { |
38 | |
39 | Ref<ScriptCallStack> ScriptCallStack::create() |
40 | { |
41 | return adoptRef(*new ScriptCallStack); |
42 | } |
43 | |
44 | Ref<ScriptCallStack> ScriptCallStack::create(Vector<ScriptCallFrame>& frames) |
45 | { |
46 | return adoptRef(*new ScriptCallStack(frames)); |
47 | } |
48 | |
49 | ScriptCallStack::ScriptCallStack() |
50 | { |
51 | } |
52 | |
53 | ScriptCallStack::ScriptCallStack(Vector<ScriptCallFrame>& frames) |
54 | { |
55 | m_frames.swap(frames); |
56 | } |
57 | |
58 | ScriptCallStack::~ScriptCallStack() |
59 | { |
60 | } |
61 | |
62 | const ScriptCallFrame& ScriptCallStack::at(size_t index) const |
63 | { |
64 | ASSERT(m_frames.size() > index); |
65 | return m_frames[index]; |
66 | } |
67 | |
68 | size_t ScriptCallStack::size() const |
69 | { |
70 | return m_frames.size(); |
71 | } |
72 | |
73 | const ScriptCallFrame* ScriptCallStack::firstNonNativeCallFrame() const |
74 | { |
75 | if (!m_frames.size()) |
76 | return nullptr; |
77 | |
78 | for (const auto& frame : m_frames) { |
79 | if (!frame.isNative()) |
80 | return &frame; |
81 | } |
82 | |
83 | return nullptr; |
84 | } |
85 | |
86 | void ScriptCallStack::append(const ScriptCallFrame& frame) |
87 | { |
88 | m_frames.append(frame); |
89 | } |
90 | |
91 | bool ScriptCallStack::isEqual(ScriptCallStack* o) const |
92 | { |
93 | if (!o) |
94 | return false; |
95 | |
96 | size_t frameCount = o->m_frames.size(); |
97 | if (frameCount != m_frames.size()) |
98 | return false; |
99 | |
100 | for (size_t i = 0; i < frameCount; ++i) { |
101 | if (!m_frames[i].isEqual(o->m_frames[i])) |
102 | return false; |
103 | } |
104 | |
105 | return true; |
106 | } |
107 | |
108 | Ref<JSON::ArrayOf<Protocol::Console::CallFrame>> ScriptCallStack::buildInspectorArray() const |
109 | { |
110 | auto frames = JSON::ArrayOf<Protocol::Console::CallFrame>::create(); |
111 | for (size_t i = 0; i < m_frames.size(); i++) |
112 | frames->addItem(m_frames.at(i).buildInspectorObject()); |
113 | return frames; |
114 | } |
115 | |
116 | } // namespace Inspector |
117 | |