luau/CodeGen/include/Luau/IrBuilder.h

121 lines
3.3 KiB
C
Raw Normal View History

2023-01-20 12:02:39 +00:00
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
#pragma once
#include "Luau/Bytecode.h"
2023-03-17 14:59:30 +00:00
#include "Luau/Common.h"
#include "Luau/DenseHash.h"
2023-02-03 12:34:12 +00:00
#include "Luau/IrData.h"
2023-01-20 12:02:39 +00:00
#include <vector>
struct Proto;
typedef uint32_t Instruction;
namespace Luau
{
namespace CodeGen
{
struct AssemblyOptions;
struct IrBuilder
{
2023-03-17 14:59:30 +00:00
IrBuilder();
2023-01-20 12:02:39 +00:00
void buildFunctionIr(Proto* proto);
void rebuildBytecodeBasicBlocks(Proto* proto);
void translateInst(LuauOpcode op, const Instruction* pc, int i);
2023-07-14 16:57:16 +01:00
void handleFastcallFallback(IrOp fallbackOrUndef, const Instruction* pc, int i);
2023-01-20 12:02:39 +00:00
bool isInternalBlock(IrOp block);
void beginBlock(IrOp block);
2023-03-03 13:45:38 +00:00
void loadAndCheckTag(IrOp loc, uint8_t tag, IrOp fallback);
// Clones all instructions into the current block
// Source block that is cloned cannot use values coming in from a predecessor
void clone(const IrBlock& source, bool removeCurrentTerminator);
2023-04-28 12:55:55 +01:00
IrOp undef();
2023-01-20 12:02:39 +00:00
IrOp constInt(int value);
IrOp constUint(unsigned value);
IrOp constDouble(double value);
IrOp constTag(uint8_t value);
2023-03-17 14:59:30 +00:00
IrOp constAny(IrConst constant, uint64_t asCommonKey);
2023-01-20 12:02:39 +00:00
IrOp cond(IrCondition cond);
IrOp inst(IrCmd cmd);
IrOp inst(IrCmd cmd, IrOp a);
IrOp inst(IrCmd cmd, IrOp a, IrOp b);
IrOp inst(IrCmd cmd, IrOp a, IrOp b, IrOp c);
IrOp inst(IrCmd cmd, IrOp a, IrOp b, IrOp c, IrOp d);
IrOp inst(IrCmd cmd, IrOp a, IrOp b, IrOp c, IrOp d, IrOp e);
2023-02-24 18:24:22 +00:00
IrOp inst(IrCmd cmd, IrOp a, IrOp b, IrOp c, IrOp d, IrOp e, IrOp f);
2023-01-20 12:02:39 +00:00
IrOp block(IrBlockKind kind); // Requested kind can be ignored if we are in an outlined sequence
IrOp blockAtInst(uint32_t index);
IrOp vmReg(uint8_t index);
IrOp vmConst(uint32_t index);
IrOp vmUpvalue(uint8_t index);
2023-07-14 16:57:16 +01:00
IrOp vmExit(uint32_t pcpos);
2023-02-10 18:50:54 +00:00
bool inTerminatedBlock = false;
2023-01-20 12:02:39 +00:00
bool activeFastcallFallback = false;
IrOp fastcallFallbackReturn;
2023-07-14 16:57:16 +01:00
int fastcallSkipTarget = -1;
2023-01-20 12:02:39 +00:00
IrFunction function;
2023-02-24 18:24:22 +00:00
uint32_t activeBlockIdx = ~0u;
2023-01-20 12:02:39 +00:00
std::vector<uint32_t> instIndexToBlock; // Block index at the bytecode instruction
2023-03-17 14:59:30 +00:00
// Similar to BytecodeBuilder, duplicate constants are removed used the same method
struct ConstantKey
{
IrConstKind kind;
// Note: this stores value* from IrConst; when kind is Double, this stores the same bits as double does but in uint64_t.
uint64_t value;
bool operator==(const ConstantKey& key) const
{
return kind == key.kind && value == key.value;
}
};
struct ConstantKeyHash
{
size_t operator()(const ConstantKey& key) const
{
// finalizer from MurmurHash64B
const uint32_t m = 0x5bd1e995;
uint32_t h1 = uint32_t(key.value);
uint32_t h2 = uint32_t(key.value >> 32) ^ (int(key.kind) * m);
h1 ^= h2 >> 18;
h1 *= m;
h2 ^= h1 >> 22;
h2 *= m;
h1 ^= h2 >> 17;
h1 *= m;
h2 ^= h1 >> 19;
h2 *= m;
// ... truncated to 32-bit output (normally hash is equal to (uint64_t(h1) << 32) | h2, but we only really need the lower 32-bit half)
return size_t(h2);
}
};
DenseHashMap<ConstantKey, uint32_t, ConstantKeyHash> constantMap;
2023-01-20 12:02:39 +00:00
};
} // namespace CodeGen
} // namespace Luau