1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
|
/*
* Copyright (C) 2013-2021 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#if !ENABLE(C_LOOP)
#include "GPRInfo.h"
#include "MacroAssembler.h"
#include "Reg.h"
#include <wtf/Bitmap.h>
namespace JSC {
typedef Bitmap<MacroAssembler::numGPRs + MacroAssembler::numFPRs> RegisterBitmap;
class RegisterAtOffsetList;
class RegisterSet {
public:
constexpr RegisterSet() { }
template<typename... Regs>
constexpr explicit RegisterSet(Regs... regs)
{
setMany(regs...);
}
JS_EXPORT_PRIVATE static RegisterSet stackRegisters();
JS_EXPORT_PRIVATE static RegisterSet reservedHardwareRegisters();
static RegisterSet runtimeTagRegisters();
static RegisterSet specialRegisters(); // The union of stack, reserved hardware, and runtime registers.
JS_EXPORT_PRIVATE static RegisterSet calleeSaveRegisters();
static RegisterSet vmCalleeSaveRegisters(); // Callee save registers that might be saved and used by any tier.
static RegisterAtOffsetList* vmCalleeSaveRegisterOffsets();
static RegisterSet llintBaselineCalleeSaveRegisters(); // Registers saved and used by the LLInt.
static RegisterSet dfgCalleeSaveRegisters(); // Registers saved and used by the DFG JIT.
static RegisterSet ftlCalleeSaveRegisters(); // Registers that might be saved and used by the FTL JIT.
#if ENABLE(WEBASSEMBLY)
static RegisterSet webAssemblyCalleeSaveRegisters(); // Registers saved and used by the WebAssembly JIT.
#endif
JS_EXPORT_PRIVATE static RegisterSet volatileRegistersForJSCall();
static RegisterSet stubUnavailableRegisters(); // The union of callee saves and special registers.
JS_EXPORT_PRIVATE static RegisterSet macroScratchRegisters();
JS_EXPORT_PRIVATE static RegisterSet allGPRs();
JS_EXPORT_PRIVATE static RegisterSet allFPRs();
static RegisterSet allRegisters();
JS_EXPORT_PRIVATE static RegisterSet argumentGPRS();
static RegisterSet registersToNotSaveForJSCall();
static RegisterSet registersToNotSaveForCCall();
void set(Reg reg, bool value = true)
{
ASSERT(!!reg);
m_bits.set(reg.index(), value);
}
void set(JSValueRegs regs, bool value = true)
{
if (regs.tagGPR() != InvalidGPRReg)
set(regs.tagGPR(), value);
set(regs.payloadGPR(), value);
}
void set(const RegisterSet& other, bool value = true) { value ? merge(other) : exclude(other); }
void clear(Reg reg)
{
ASSERT(!!reg);
set(reg, false);
}
bool get(Reg reg) const
{
ASSERT(!!reg);
return m_bits.get(reg.index());
}
template<typename Iterable>
void setAll(const Iterable& iterable)
{
for (Reg reg : iterable)
set(reg);
}
// Also allow add/remove/contains terminology, which means the same thing as set/clear/get.
bool add(Reg reg)
{
ASSERT(!!reg);
return !m_bits.testAndSet(reg.index());
}
bool remove(Reg reg)
{
ASSERT(!!reg);
return m_bits.testAndClear(reg.index());
}
bool contains(Reg reg) const { return get(reg); }
void merge(const RegisterSet& other) { m_bits.merge(other.m_bits); }
void filter(const RegisterSet& other) { m_bits.filter(other.m_bits); }
void exclude(const RegisterSet& other) { m_bits.exclude(other.m_bits); }
bool subsumes(const RegisterSet& other) const { return m_bits.subsumes(other.m_bits); }
size_t numberOfSetGPRs() const;
size_t numberOfSetFPRs() const;
size_t numberOfSetRegisters() const { return m_bits.count(); }
bool isEmpty() const { return m_bits.isEmpty(); }
JS_EXPORT_PRIVATE void dump(PrintStream&) const;
bool operator==(const RegisterSet& other) const { return m_bits == other.m_bits; }
bool operator!=(const RegisterSet& other) const { return m_bits != other.m_bits; }
unsigned hash() const { return m_bits.hash(); }
template<typename Func>
void forEach(const Func& func) const
{
m_bits.forEachSetBit(
[&] (size_t index) {
func(Reg::fromIndex(index));
});
}
class iterator {
public:
iterator()
{
}
iterator(const RegisterBitmap::iterator& iter)
: m_iter(iter)
{
}
Reg operator*() const { return Reg::fromIndex(*m_iter); }
iterator& operator++()
{
++m_iter;
return *this;
}
bool operator==(const iterator& other) const
{
return m_iter == other.m_iter;
}
bool operator!=(const iterator& other) const
{
return !(*this == other);
}
private:
RegisterBitmap::iterator m_iter;
};
iterator begin() const { return iterator(m_bits.begin()); }
iterator end() const { return iterator(m_bits.end()); }
private:
void setAny(Reg reg) { set(reg); }
void setAny(JSValueRegs regs) { set(regs); }
void setAny(const RegisterSet& set) { merge(set); }
void setMany() { }
template<typename RegType, typename... Regs>
void setMany(RegType reg, Regs... regs)
{
setAny(reg);
setMany(regs...);
}
// These offsets mirror the logic in Reg.h.
static constexpr unsigned gprOffset = 0;
static constexpr unsigned fprOffset = gprOffset + MacroAssembler::numGPRs;
RegisterBitmap m_bits;
};
struct RegisterSetHash {
static unsigned hash(const RegisterSet& set) { return set.hash(); }
static bool equal(const RegisterSet& a, const RegisterSet& b) { return a == b; }
static constexpr bool safeToCompareToEmptyOrDeleted = false;
};
} // namespace JSC
namespace WTF {
template<typename T> struct DefaultHash;
template<> struct DefaultHash<JSC::RegisterSet> : JSC::RegisterSetHash { };
} // namespace WTF
#endif // !ENABLE(C_LOOP)
|