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