1 | /* |
2 | * Copyright (C) 2016 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 "DOMJITAbstractHeap.h" |
28 | |
29 | #if ENABLE(JIT) |
30 | |
31 | namespace JSC { namespace DOMJIT { |
32 | |
33 | void AbstractHeap::compute(unsigned begin) |
34 | { |
35 | unsigned current = begin; |
36 | // Increment the end of the range. |
37 | if (m_children.isEmpty()) { |
38 | m_range = HeapRange(begin, current + 1); |
39 | return; |
40 | } |
41 | for (auto& child : m_children) { |
42 | child->compute(current); |
43 | current = child->range().end(); |
44 | } |
45 | ASSERT(begin < UINT16_MAX); |
46 | ASSERT(current <= UINT16_MAX); |
47 | m_range = HeapRange(begin, current); |
48 | } |
49 | |
50 | void AbstractHeap::dump(PrintStream& out) const |
51 | { |
52 | shallowDump(out); |
53 | if (m_parent) |
54 | out.print("->" , *m_parent); |
55 | } |
56 | |
57 | void AbstractHeap::shallowDump(PrintStream& out) const |
58 | { |
59 | out.print(m_name, "<" , m_range, ">" ); |
60 | } |
61 | |
62 | void AbstractHeap::deepDump(PrintStream& out, unsigned indent) const |
63 | { |
64 | auto printIndent = [&] () { |
65 | for (unsigned i = indent; i--;) |
66 | out.print(" " ); |
67 | }; |
68 | |
69 | printIndent(); |
70 | shallowDump(out); |
71 | |
72 | if (m_children.isEmpty()) { |
73 | out.print("\n" ); |
74 | return; |
75 | } |
76 | |
77 | out.print(":\n" ); |
78 | for (auto* child : m_children) |
79 | child->deepDump(out, indent + 1); |
80 | } |
81 | |
82 | } } |
83 | |
84 | #endif |
85 | |