| 1 | /* |
| 2 | * Copyright (C) 2017 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(B3_JIT) |
| 29 | |
| 30 | #include "AirCode.h" |
| 31 | #include "AirTmp.h" |
| 32 | #include <wtf/IndexMap.h> |
| 33 | |
| 34 | namespace JSC { namespace B3 { namespace Air { |
| 35 | |
| 36 | // As an alternative to this, you could use IndexMap<Tmp::LinearlyIndexed, ...>, but this would fail |
| 37 | // as soon as you added a new GP tmp. |
| 38 | |
| 39 | template<typename Value> |
| 40 | class TmpMap { |
| 41 | public: |
| 42 | TmpMap() = default; |
| 43 | TmpMap(TmpMap&&) = default; |
| 44 | TmpMap& operator=(TmpMap&&) = default; |
| 45 | |
| 46 | template<typename... Args> |
| 47 | TmpMap(Code& code, const Args&... args) |
| 48 | : m_gp(Tmp::absoluteIndexEnd(code, GP), args...) |
| 49 | , m_fp(Tmp::absoluteIndexEnd(code, FP), args...) |
| 50 | { |
| 51 | } |
| 52 | |
| 53 | template<typename... Args> |
| 54 | void resize(Code& code, const Args&... args) |
| 55 | { |
| 56 | m_gp.resize(Tmp::absoluteIndexEnd(code, GP), args...); |
| 57 | m_fp.resize(Tmp::absoluteIndexEnd(code, FP), args...); |
| 58 | } |
| 59 | |
| 60 | template<typename... Args> |
| 61 | void clear(const Args&... args) |
| 62 | { |
| 63 | m_gp.clear(args...); |
| 64 | m_fp.clear(args...); |
| 65 | } |
| 66 | |
| 67 | const Value& operator[](Tmp tmp) const |
| 68 | { |
| 69 | if (tmp.isGP()) |
| 70 | return m_gp[tmp]; |
| 71 | return m_fp[tmp]; |
| 72 | } |
| 73 | |
| 74 | Value& operator[](Tmp tmp) |
| 75 | { |
| 76 | if (tmp.isGP()) |
| 77 | return m_gp[tmp]; |
| 78 | return m_fp[tmp]; |
| 79 | } |
| 80 | |
| 81 | template<typename PassedValue> |
| 82 | void append(Tmp tmp, PassedValue&& value) |
| 83 | { |
| 84 | if (tmp.isGP()) |
| 85 | m_gp.append(tmp, std::forward<PassedValue>(value)); |
| 86 | else |
| 87 | m_fp.append(tmp, std::forward<PassedValue>(value)); |
| 88 | } |
| 89 | |
| 90 | private: |
| 91 | IndexMap<Tmp::AbsolutelyIndexed<GP>, Value> m_gp; |
| 92 | IndexMap<Tmp::AbsolutelyIndexed<FP>, Value> m_fp; |
| 93 | }; |
| 94 | |
| 95 | } } } // namespace JSC::B3::Air |
| 96 | |
| 97 | #endif // ENABLE(B3_JIT) |
| 98 | |
| 99 | |