1/*
2 * Copyright (C) 2014, 2015 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#if ENABLE(DFG_JIT)
29
30#include "DFGAvailability.h"
31#include "DFGPromotedHeapLocation.h"
32
33namespace JSC { namespace DFG {
34
35struct AvailabilityMap {
36 void pruneHeap();
37 void pruneByLiveness(Graph&, CodeOrigin);
38 void clear();
39
40 void dump(PrintStream& out) const;
41
42 bool operator==(const AvailabilityMap& other) const;
43
44 void merge(const AvailabilityMap& other);
45
46 template<typename Functor>
47 void forEachAvailability(const Functor& functor)
48 {
49 for (unsigned i = m_locals.size(); i--;)
50 functor(m_locals[i]);
51 for (auto pair : m_heap)
52 functor(pair.value);
53 }
54
55 template<typename HasFunctor, typename AddFunctor>
56 void closeOverNodes(const HasFunctor& has, const AddFunctor& add)
57 {
58 bool changed;
59 do {
60 changed = false;
61 for (auto pair : m_heap) {
62 if (pair.value.hasNode() && has(pair.key.base()))
63 changed |= add(pair.value.node());
64 }
65 } while (changed);
66 }
67
68 template<typename HasFunctor, typename AddFunctor>
69 void closeStartingWithLocal(VirtualRegister reg, const HasFunctor& has, const AddFunctor& add)
70 {
71 Availability availability = m_locals.operand(reg);
72 if (!availability.hasNode())
73 return;
74
75 if (!add(availability.node()))
76 return;
77
78 closeOverNodes(has, add);
79 }
80
81 Operands<Availability> m_locals;
82 HashMap<PromotedHeapLocation, Availability> m_heap;
83};
84
85} } // namespace JSC::DFG
86
87#endif // ENABLE(DFG_JIT)
88