Files
wazero/internal/engine/wazevo/backend/isa/amd64/machine.go
2024-01-25 09:19:37 -08:00

913 lines
26 KiB
Go

package amd64
import (
"context"
"encoding/binary"
"fmt"
"strings"
"github.com/tetratelabs/wazero/internal/engine/wazevo/backend"
"github.com/tetratelabs/wazero/internal/engine/wazevo/backend/regalloc"
"github.com/tetratelabs/wazero/internal/engine/wazevo/ssa"
"github.com/tetratelabs/wazero/internal/engine/wazevo/wazevoapi"
"github.com/tetratelabs/wazero/internal/platform"
)
// NewBackend returns a new backend for arm64.
func NewBackend() backend.Machine {
ectx := backend.NewExecutableContextT[instruction](
resetInstruction,
setNext,
setPrev,
asNop,
)
return &machine{
ectx: ectx,
cpuFeatures: platform.CpuFeatures,
regAlloc: regalloc.NewAllocator(regInfo),
spillSlots: map[regalloc.VRegID]int64{},
}
}
type (
// machine implements backend.Machine for amd64.
machine struct {
c backend.Compiler
ectx *backend.ExecutableContextT[instruction]
stackBoundsCheckDisabled bool
cpuFeatures platform.CpuFeatureFlags
regAlloc regalloc.Allocator
regAllocFn *backend.RegAllocFunction[*instruction, *machine]
regAllocStarted bool
spillSlotSize int64
spillSlots map[regalloc.VRegID]int64
currentABI *backend.FunctionABI
clobberedRegs []regalloc.VReg
maxRequiredStackSizeForCalls int64
labelResolutionPends []labelResolutionPend
}
labelResolutionPend struct {
instr *instruction
// imm32Offset is the offset of the last 4 bytes of the instruction.
imm32Offset int64
}
)
// Reset implements backend.Machine.
func (m *machine) Reset() {
m.clobberedRegs = m.clobberedRegs[:0]
for key := range m.spillSlots {
m.clobberedRegs = append(m.clobberedRegs, regalloc.VReg(key))
}
for _, key := range m.clobberedRegs {
delete(m.spillSlots, regalloc.VRegID(key))
}
m.stackBoundsCheckDisabled = false
m.ectx.Reset()
m.regAllocFn.Reset()
m.regAlloc.Reset()
m.regAllocStarted = false
m.clobberedRegs = m.clobberedRegs[:0]
m.spillSlotSize = 0
m.maxRequiredStackSizeForCalls = 0
}
// ExecutableContext implements backend.Machine.
func (m *machine) ExecutableContext() backend.ExecutableContext { return m.ectx }
// DisableStackCheck implements backend.Machine.
func (m *machine) DisableStackCheck() { m.stackBoundsCheckDisabled = true }
// SetCompiler implements backend.Machine.
func (m *machine) SetCompiler(c backend.Compiler) {
m.c = c
m.regAllocFn = backend.NewRegAllocFunction[*instruction, *machine](m, c.SSABuilder(), c)
}
// SetCurrentABI implements backend.Machine.
func (m *machine) SetCurrentABI(abi *backend.FunctionABI) {
m.currentABI = abi
}
// RegAlloc implements backend.Machine.
func (m *machine) RegAlloc() {
rf := m.regAllocFn
for _, pos := range m.ectx.OrderedBlockLabels {
rf.AddBlock(pos.SB, pos.L, pos.Begin, pos.End)
}
m.regAllocStarted = true
m.regAlloc.DoAllocation(rf)
// Now that we know the final spill slot size, we must align spillSlotSize to 16 bytes.
m.spillSlotSize = (m.spillSlotSize + 15) &^ 15
}
// InsertReturn implements backend.Machine.
func (m *machine) InsertReturn() {
i := m.allocateInstr().asRet(m.currentABI)
m.insert(i)
}
// LowerSingleBranch implements backend.Machine.
func (m *machine) LowerSingleBranch(b *ssa.Instruction) {
ectx := m.ectx
switch b.Opcode() {
case ssa.OpcodeJump:
_, _, targetBlk := b.BranchData()
if b.IsFallthroughJump() {
return
}
jmp := m.allocateInstr()
target := ectx.GetOrAllocateSSABlockLabel(targetBlk)
if target == backend.LabelReturn {
jmp.asRet(m.currentABI)
} else {
jmp.asJmp(newOperandLabel(target))
}
m.insert(jmp)
case ssa.OpcodeBrTable:
panic("TODO: implement me")
default:
panic("BUG: unexpected branch opcode" + b.Opcode().String())
}
}
var condBranchMatches = [...]ssa.Opcode{ssa.OpcodeIcmp, ssa.OpcodeFcmp}
// LowerConditionalBranch implements backend.Machine.
func (m *machine) LowerConditionalBranch(b *ssa.Instruction) {
exctx := m.ectx
cval, args, targetBlk := b.BranchData()
if len(args) > 0 {
panic(fmt.Sprintf(
"conditional branch shouldn't have args; likely a bug in critical edge splitting: from %s to %s",
exctx.CurrentSSABlk,
targetBlk,
))
}
target := exctx.GetOrAllocateSSABlockLabel(targetBlk)
cvalDef := m.c.ValueDefinition(cval)
switch m.c.MatchInstrOneOf(cvalDef, condBranchMatches[:]) {
case ssa.OpcodeIcmp:
cvalInstr := cvalDef.Instr
x, y, c := cvalInstr.IcmpData()
cc := condFromSSAIntCmpCond(c)
if b.Opcode() == ssa.OpcodeBrz {
cc = cc.invert()
}
// First, perform the comparison and set the flag.
xd, yd := m.c.ValueDefinition(x), m.c.ValueDefinition(y)
m.lowerIcmpToFlag(xd, yd, x.Type() == ssa.TypeI64)
// Then perform the conditional branch.
m.insert(m.allocateInstr().asJmpIf(cc, newOperandLabel(target)))
cvalDef.Instr.MarkLowered()
case ssa.OpcodeFcmp:
panic("TODO")
default:
v := m.getOperand_Reg(cvalDef)
var cc cond
if b.Opcode() == ssa.OpcodeBrz {
cc = condZ
} else {
cc = condNZ
}
// Perform test %v, %v to set the flag.
cmp := m.allocateInstr().asCmpRmiR(false, v, v.r, false)
m.insert(cmp)
m.insert(m.allocateInstr().asJmpIf(cc, newOperandLabel(target)))
}
}
// LowerInstr implements backend.Machine.
func (m *machine) LowerInstr(instr *ssa.Instruction) {
switch op := instr.Opcode(); op {
case ssa.OpcodeBrz, ssa.OpcodeBrnz, ssa.OpcodeJump, ssa.OpcodeBrTable:
panic("BUG: branching instructions are handled by LowerBranches")
case ssa.OpcodeReturn:
panic("BUG: return must be handled by backend.Compiler")
case ssa.OpcodeIconst, ssa.OpcodeF32const, ssa.OpcodeF64const: // Constant instructions are inlined.
case ssa.OpcodeCall, ssa.OpcodeCallIndirect:
m.lowerCall(instr)
case ssa.OpcodeStore, ssa.OpcodeIstore8, ssa.OpcodeIstore16, ssa.OpcodeIstore32:
m.lowerStore(instr)
case ssa.OpcodeIadd:
m.lowerAluRmiROp(instr, aluRmiROpcodeAdd)
case ssa.OpcodeIsub:
m.lowerAluRmiROp(instr, aluRmiROpcodeSub)
case ssa.OpcodeImul:
m.lowerAluRmiROp(instr, aluRmiROpcodeMul)
case ssa.OpcodeBand:
m.lowerAluRmiROp(instr, aluRmiROpcodeAnd)
case ssa.OpcodeBor:
m.lowerAluRmiROp(instr, aluRmiROpcodeOr)
case ssa.OpcodeBxor:
m.lowerAluRmiROp(instr, aluRmiROpcodeXor)
case ssa.OpcodeIshl:
m.lowerShiftR(instr, shiftROpShiftLeft)
case ssa.OpcodeSshr:
m.lowerShiftR(instr, shiftROpShiftRightArithmetic)
case ssa.OpcodeUshr:
m.lowerShiftR(instr, shiftROpShiftRightLogical)
case ssa.OpcodeRotl:
m.lowerShiftR(instr, shiftROpRotateLeft)
case ssa.OpcodeRotr:
m.lowerShiftR(instr, shiftROpRotateRight)
case ssa.OpcodeClz:
m.lowerClz(instr)
case ssa.OpcodeCtz:
m.lowerCtz(instr)
case ssa.OpcodePopcnt:
m.lowerUnaryRmR(instr, unaryRmROpcodePopcnt)
case ssa.OpcodeUndefined:
m.insert(m.allocateInstr().asUD2())
case ssa.OpcodeExitWithCode:
execCtx, code := instr.ExitWithCodeData()
m.lowerExitWithCode(m.c.VRegOf(execCtx), code)
case ssa.OpcodeExitIfTrueWithCode:
execCtx, c, code := instr.ExitIfTrueWithCodeData()
m.lowerExitIfTrueWithCode(m.c.VRegOf(execCtx), c, code)
case ssa.OpcodeLoad:
ptr, offset, typ := instr.LoadData()
dst := m.c.VRegOf(instr.Return())
m.lowerLoad(ptr, offset, typ, dst)
case ssa.OpcodeUload8, ssa.OpcodeUload16, ssa.OpcodeUload32, ssa.OpcodeSload8, ssa.OpcodeSload16, ssa.OpcodeSload32:
ptr, offset, _ := instr.LoadData()
ret := m.c.VRegOf(instr.Return())
m.lowerExtLoad(op, ptr, offset, ret)
case ssa.OpcodeVconst:
result := instr.Return()
lo, hi := instr.VconstData()
m.lowerVconst(result, lo, hi)
case ssa.OpcodeSExtend, ssa.OpcodeUExtend:
from, to, signed := instr.ExtendData()
m.lowerExtend(instr.Arg(), instr.Return(), from, to, signed)
default:
panic("TODO: lowering " + op.String())
}
}
func (m *machine) lowerExtend(_arg, ret ssa.Value, from, to byte, signed bool) {
rd := m.c.VRegOf(ret)
arg := m.getOperand_Mem_Reg(m.c.ValueDefinition(_arg))
ext := m.allocateInstr()
switch {
case from == 8 && to == 16 && signed:
ext.asMovsxRmR(extModeBQ, arg, rd)
case from == 8 && to == 16 && !signed:
ext.asMovzxRmR(extModeBQ, arg, rd)
case from == 8 && to == 32 && signed:
ext.asMovsxRmR(extModeBQ, arg, rd)
case from == 8 && to == 32 && !signed:
ext.asMovzxRmR(extModeBQ, arg, rd)
case from == 8 && to == 64 && signed:
ext.asMovsxRmR(extModeBQ, arg, rd)
case from == 8 && to == 64 && !signed:
ext.asMovzxRmR(extModeBQ, arg, rd)
case from == 16 && to == 32 && signed:
ext.asMovsxRmR(extModeWQ, arg, rd)
case from == 16 && to == 32 && !signed:
ext.asMovzxRmR(extModeWQ, arg, rd)
case from == 16 && to == 64 && signed:
ext.asMovsxRmR(extModeWQ, arg, rd)
case from == 16 && to == 64 && !signed:
ext.asMovzxRmR(extModeWQ, arg, rd)
case from == 32 && to == 64 && signed:
ext.asMovsxRmR(extModeLQ, arg, rd)
case from == 32 && to == 64 && !signed:
ext.asMovzxRmR(extModeLQ, arg, rd)
default:
panic(fmt.Sprintf("BUG: unhandled extend: from=%d, to=%d, signed=%t", from, to, signed))
}
m.insert(ext)
}
func (m *machine) lowerVconst(res ssa.Value, lo, hi uint64) {
// TODO: use xor when lo == hi == 0.
dst := m.c.VRegOf(res)
islandAddr := m.c.AllocateVReg(ssa.TypeI64)
lea := m.allocateInstr()
load := m.allocateInstr().asXmmUnaryRmR(sseOpcodeMovdqu, newOperandMem(newAmodeImmReg(0, islandAddr)), dst)
jmp := m.allocateInstr()
constLabelNop, constLabel := m.allocateBrTarget()
constIsland := m.allocateInstr().asV128ConstIsland(lo, hi)
afterLoadNop, afterLoadLabel := m.allocateBrTarget()
// lea constLabel(%rip), %islandAddr
// movdqu (%islandAddr), %dst
// jmp afterConst
// constLabel:
// constIsland $lo, $hi
// afterConst:
m.insert(lea)
m.insert(load)
m.insert(jmp)
m.insert(constLabelNop)
m.insert(constIsland)
m.insert(afterLoadNop)
lea.asLEA(newAmodeRipRelative(constLabel), islandAddr)
jmp.asJmp(newOperandLabel(afterLoadLabel))
}
func (m *machine) lowerCtz(instr *ssa.Instruction) {
if m.cpuFeatures.HasExtra(platform.CpuExtraFeatureAmd64ABM) {
m.lowerUnaryRmR(instr, unaryRmROpcodeTzcnt)
} else {
// On processors that do not support TZCNT, the BSF instruction is
// executed instead. The key difference between TZCNT and BSF
// instruction is that if source operand is zero, the content of
// destination operand is undefined.
// https://www.felixcloutier.com/x86/tzcnt.html
x := instr.Arg()
if !x.Type().IsInt() {
panic("BUG?")
}
_64 := x.Type().Bits() == 64
xDef := m.c.ValueDefinition(x)
rm := m.getOperand_Reg(xDef)
rd := m.c.VRegOf(instr.Return())
// First, we have to check if the target is non-zero.
test := m.allocateInstr()
test.asCmpRmiR(false, rm, rm.r, _64)
m.insert(test)
jmpNz := m.allocateInstr() // Will backpatch the operands later.
m.insert(jmpNz)
// If the value is zero, we just push the const value.
m.lowerIconst(rd, uint64(x.Type().Bits()), _64)
// Now jump right after the non-zero case.
jmpAtEnd := m.allocateInstr() // Will backpatch later.
m.insert(jmpAtEnd)
// jmpNz target label is set here.
nop, nz := m.allocateBrTarget()
jmpNz.asJmpIf(condNZ, newOperandLabel(nz))
m.insert(nop)
// Emit the non-zero case.
bsr := m.allocateInstr()
bsr.asUnaryRmR(unaryRmROpcodeBsf, rm, rd, _64)
m.insert(bsr)
// jmpAtEnd target label is set here.
nopEnd, end := m.allocateBrTarget()
jmpAtEnd.asJmp(newOperandLabel(end))
m.insert(nopEnd)
}
}
func (m *machine) lowerClz(instr *ssa.Instruction) {
if m.cpuFeatures.HasExtra(platform.CpuExtraFeatureAmd64ABM) {
m.lowerUnaryRmR(instr, unaryRmROpcodeLzcnt)
} else {
// On processors that do not support LZCNT, we combine BSR (calculating
// most significant set bit) with XOR. This logic is described in
// "Replace Raw Assembly Code with Builtin Intrinsics" section in:
// https://developer.apple.com/documentation/apple-silicon/addressing-architectural-differences-in-your-macos-code.
x := instr.Arg()
if !x.Type().IsInt() {
panic("BUG?")
}
_64 := x.Type().Bits() == 64
xDef := m.c.ValueDefinition(x)
rm := m.getOperand_Reg(xDef)
rd := m.c.VRegOf(instr.Return())
// First, we have to check if the rm is non-zero as BSR is undefined
// on zero. See https://www.felixcloutier.com/x86/bsr.
test := m.allocateInstr()
test.asCmpRmiR(false, rm, rm.r, _64)
m.insert(test)
jmpNz := m.allocateInstr() // Will backpatch later.
m.insert(jmpNz)
// If the value is zero, we just push the const value.
m.lowerIconst(rd, uint64(x.Type().Bits()), _64)
// Now jump right after the non-zero case.
jmpAtEnd := m.allocateInstr() // Will backpatch later.
m.insert(jmpAtEnd)
// jmpNz target label is set here.
nop, nz := m.allocateBrTarget()
jmpNz.asJmpIf(condNZ, newOperandLabel(nz))
m.insert(nop)
// Emit the non-zero case.
tmp := m.c.VRegOf(instr.Return())
bsr := m.allocateInstr()
bsr.asUnaryRmR(unaryRmROpcodeBsr, rm, tmp, _64)
m.insert(bsr)
// Now we XOR the value with the bit length minus one.
xor := m.allocateInstr()
xor.asAluRmiR(aluRmiROpcodeXor, newOperandImm32(uint32(x.Type().Bits()-1)), tmp, _64)
m.insert(xor)
// jmpAtEnd target label is set here.
nopEnd, end := m.allocateBrTarget()
jmpAtEnd.asJmp(newOperandLabel(end))
m.insert(nopEnd)
}
}
func (m *machine) lowerUnaryRmR(si *ssa.Instruction, op unaryRmROpcode) {
x := si.Arg()
if !x.Type().IsInt() {
panic("BUG?")
}
_64 := x.Type().Bits() == 64
xDef := m.c.ValueDefinition(x)
rm := m.getOperand_Imm32_Reg(xDef)
rd := m.c.VRegOf(si.Return())
instr := m.allocateInstr()
instr.asUnaryRmR(op, rm, rd, _64)
m.insert(instr)
}
func (m *machine) lowerLoad(ptr ssa.Value, offset uint32, typ ssa.Type, dst regalloc.VReg) {
mem := newOperandMem(m.lowerToAddressMode(ptr, offset))
load := m.allocateInstr()
switch typ {
case ssa.TypeI32:
load.asMovzxRmR(extModeLQ, mem, dst)
case ssa.TypeI64:
load.asMov64MR(mem, dst)
case ssa.TypeF32:
load.asXmmUnaryRmR(sseOpcodeMovss, mem, dst)
case ssa.TypeF64:
load.asXmmUnaryRmR(sseOpcodeMovsd, mem, dst)
case ssa.TypeV128:
load.asXmmUnaryRmR(sseOpcodeMovdqu, mem, dst)
default:
panic("BUG")
}
m.insert(load)
}
func (m *machine) lowerExtLoad(op ssa.Opcode, ptr ssa.Value, offset uint32, dst regalloc.VReg) {
mem := newOperandMem(m.lowerToAddressMode(ptr, offset))
load := m.allocateInstr()
switch op {
case ssa.OpcodeUload8:
load.asMovzxRmR(extModeBQ, mem, dst)
case ssa.OpcodeUload16:
load.asMovzxRmR(extModeWQ, mem, dst)
case ssa.OpcodeUload32:
load.asMovzxRmR(extModeLQ, mem, dst)
case ssa.OpcodeSload8:
load.asMovsxRmR(extModeBQ, mem, dst)
case ssa.OpcodeSload16:
load.asMovsxRmR(extModeWQ, mem, dst)
case ssa.OpcodeSload32:
load.asMovsxRmR(extModeLQ, mem, dst)
default:
panic("BUG")
}
m.insert(load)
}
func (m *machine) lowerExitIfTrueWithCode(execCtx regalloc.VReg, cond ssa.Value, code wazevoapi.ExitCode) {
condDef := m.c.ValueDefinition(cond)
if !m.c.MatchInstr(condDef, ssa.OpcodeIcmp) {
panic("TODO: ExitIfTrue must come after Icmp at the moment: " + condDef.Instr.Opcode().String())
}
cvalInstr := condDef.Instr
cvalInstr.MarkLowered()
// We need to copy the execution context to a temp register, because if it's spilled,
// it might end up being reloaded inside the exiting branch.
execCtxTmp := m.copyToTmp(execCtx)
x, y, c := cvalInstr.IcmpData()
m.lowerIcmpToFlag(m.c.ValueDefinition(x), m.c.ValueDefinition(y), x.Type() == ssa.TypeI64)
jmpIf := m.allocateInstr()
m.insert(jmpIf)
l := m.lowerExitWithCode(execCtxTmp, code)
jmpIf.asJmpIf(condFromSSAIntCmpCond(c).invert(), newOperandLabel(l))
}
func (m *machine) lowerExitWithCode(execCtx regalloc.VReg, code wazevoapi.ExitCode) (afterLabel backend.Label) {
// First we set the exit code in the execution context.
exitCodeReg := m.c.AllocateVReg(ssa.TypeI32)
m.lowerIconst(exitCodeReg, uint64(code), false)
setExitCode := m.allocateInstr().asMovRM(
exitCodeReg,
newOperandMem(newAmodeImmReg(wazevoapi.ExecutionContextOffsetExitCodeOffset.U32(), execCtx)),
4,
)
m.insert(setExitCode)
// Next is to save RBP and RBP.
saveRsp := m.allocateInstr().asMovRM(
rspVReg,
newOperandMem(newAmodeImmReg(wazevoapi.ExecutionContextOffsetStackPointerBeforeGoCall.U32(), execCtx)),
8,
)
m.insert(saveRsp)
saveRbp := m.allocateInstr().asMovRM(
rbpVReg,
newOperandMem(newAmodeImmReg(wazevoapi.ExecutionContextOffsetFramePointerBeforeGoCall.U32(), execCtx)),
8,
)
m.insert(saveRbp)
// Next is to save the return address.
readRip := m.allocateInstr()
m.insert(readRip)
ripReg := m.c.AllocateVReg(ssa.TypeI64)
saveRip := m.allocateInstr().asMovRM(
ripReg,
newOperandMem(newAmodeImmReg(wazevoapi.ExecutionContextOffsetGoCallReturnAddress.U32(), execCtx)),
8,
)
m.insert(saveRip)
// Finally exit.
exitSq := m.allocateInstr().asExitSeq(execCtx)
m.insert(exitSq)
// Insert the label for the return address.
nop, l := m.allocateBrTarget()
readRip.asLEA(newAmodeRipRelative(l), ripReg)
m.insert(nop)
return l
}
func (m *machine) lowerAluRmiROp(si *ssa.Instruction, op aluRmiROpcode) {
x, y := si.Arg2()
if !x.Type().IsInt() {
panic("BUG?")
}
_64 := x.Type().Bits() == 64
xDef, yDef := m.c.ValueDefinition(x), m.c.ValueDefinition(y)
// TODO: commutative args can be swapped if one of them is an immediate.
rn := m.getOperand_Reg(xDef)
rm := m.getOperand_Mem_Imm32_Reg(yDef)
rd := m.c.VRegOf(si.Return())
// rn is being overwritten, so we first copy its value to a temp register,
// in case it is referenced again later.
tmp := m.copyToTmp(rn.r)
alu := m.allocateInstr()
alu.asAluRmiR(op, rm, tmp, _64)
m.insert(alu)
// tmp now contains the result, we copy it to the dest register.
m.copyTo(tmp, rd)
}
func (m *machine) lowerShiftR(si *ssa.Instruction, op shiftROp) {
x, amt := si.Arg2()
if !x.Type().IsInt() {
panic("BUG?")
}
_64 := x.Type().Bits() == 64
xDef, amtDef := m.c.ValueDefinition(x), m.c.ValueDefinition(amt)
opAmt := m.getOperand_Imm32_Reg(amtDef)
rx := m.getOperand_Reg(xDef)
rd := m.c.VRegOf(si.Return())
// rx is being overwritten, so we first copy its value to a temp register,
// in case it is referenced again later.
tmpDst := m.copyToTmp(rx.r)
if opAmt.r != regalloc.VRegInvalid {
// If opAmt is a register we must copy its value to rcx,
// because shiftR encoding mandates that the shift amount is in rcx.
m.copyTo(opAmt.r, rcxVReg)
alu := m.allocateInstr()
alu.asShiftR(op, newOperandReg(rcxVReg), tmpDst, _64)
m.insert(alu)
} else {
println("::::::SONO QUI")
alu := m.allocateInstr()
alu.asShiftR(op, opAmt, tmpDst, _64)
m.insert(alu)
}
// tmp now contains the result, we copy it to the dest register.
m.copyTo(tmpDst, rd)
}
func (m *machine) lowerStore(si *ssa.Instruction) {
value, ptr, offset, storeSizeInBits := si.StoreData()
rm := m.getOperand_Reg(m.c.ValueDefinition(value))
mem := newOperandMem(m.lowerToAddressMode(ptr, offset))
store := m.allocateInstr()
switch value.Type() {
case ssa.TypeI32:
store.asMovRM(rm.r, mem, storeSizeInBits/8)
case ssa.TypeI64:
store.asMovRM(rm.r, mem, storeSizeInBits/8)
case ssa.TypeF32:
store.asXmmMovRM(sseOpcodeMovss, rm.r, mem)
case ssa.TypeF64:
store.asXmmMovRM(sseOpcodeMovsd, rm.r, mem)
case ssa.TypeV128:
store.asXmmMovRM(sseOpcodeMovdqu, rm.r, mem)
default:
panic("BUG")
}
m.insert(store)
}
func (m *machine) lowerCall(si *ssa.Instruction) {
isDirectCall := si.Opcode() == ssa.OpcodeCall
var indirectCalleePtr ssa.Value
var directCallee ssa.FuncRef
var sigID ssa.SignatureID
var args []ssa.Value
if isDirectCall {
directCallee, sigID, args = si.CallData()
} else {
indirectCalleePtr, sigID, args = si.CallIndirectData()
}
calleeABI := m.c.GetFunctionABI(m.c.SSABuilder().ResolveSignature(sigID))
stackSlotSize := calleeABI.AlignedArgResultStackSlotSize()
if m.maxRequiredStackSizeForCalls < stackSlotSize+16 {
m.maxRequiredStackSizeForCalls = stackSlotSize + 16 // return address frame.
}
for i, arg := range args {
reg := m.c.VRegOf(arg)
def := m.c.ValueDefinition(arg)
m.callerGenVRegToFunctionArg(calleeABI, i, reg, def, stackSlotSize)
}
if isDirectCall {
call := m.allocateInstr().asCall(directCallee, calleeABI)
m.insert(call)
} else {
ptrOp := m.getOperand_Mem_Reg(m.c.ValueDefinition(indirectCalleePtr))
callInd := m.allocateInstr().asCallIndirect(ptrOp, calleeABI)
m.insert(callInd)
}
var index int
r1, rs := si.Returns()
if r1.Valid() {
m.callerGenFunctionReturnVReg(calleeABI, 0, m.c.VRegOf(r1), stackSlotSize)
index++
}
for _, r := range rs {
m.callerGenFunctionReturnVReg(calleeABI, index, m.c.VRegOf(r), stackSlotSize)
index++
}
}
// callerGenVRegToFunctionArg is the opposite of GenFunctionArgToVReg, which is used to generate the
// caller side of the function call.
func (m *machine) callerGenVRegToFunctionArg(a *backend.FunctionABI, argIndex int, reg regalloc.VReg, def *backend.SSAValueDefinition, slotBegin int64) {
arg := &a.Args[argIndex]
if def != nil && def.IsFromInstr() {
// Constant instructions are inlined.
if inst := def.Instr; inst.Constant() {
m.InsertLoadConstant(inst, reg)
}
}
if arg.Kind == backend.ABIArgKindReg {
m.InsertMove(arg.Reg, reg, arg.Type)
} else {
panic("TODO")
}
}
func (m *machine) callerGenFunctionReturnVReg(a *backend.FunctionABI, retIndex int, reg regalloc.VReg, slotBegin int64) {
r := &a.Rets[retIndex]
if r.Kind == backend.ABIArgKindReg {
m.InsertMove(reg, r.Reg, r.Type)
} else {
panic("TODO")
}
}
// InsertMove implements backend.Machine.
func (m *machine) InsertMove(dst, src regalloc.VReg, typ ssa.Type) {
switch typ {
case ssa.TypeI32, ssa.TypeI64:
i := m.allocateInstr().asMovRR(src, dst, typ.Bits() == 64)
m.insert(i)
case ssa.TypeF32, ssa.TypeF64, ssa.TypeV128:
var op sseOpcode
switch typ {
case ssa.TypeF32:
op = sseOpcodeMovss
case ssa.TypeF64:
op = sseOpcodeMovsd
case ssa.TypeV128:
op = sseOpcodeMovdqa
}
i := m.allocateInstr().asXmmUnaryRmR(op, newOperandReg(src), dst)
m.insert(i)
default:
panic("BUG")
}
}
// Format implements backend.Machine.
func (m *machine) Format() string {
ectx := m.ectx
begins := map[*instruction]backend.Label{}
for l, pos := range ectx.LabelPositions {
begins[pos.Begin] = l
}
irBlocks := map[backend.Label]ssa.BasicBlockID{}
for i, l := range ectx.SsaBlockIDToLabels {
irBlocks[l] = ssa.BasicBlockID(i)
}
var lines []string
for cur := ectx.RootInstr; cur != nil; cur = cur.next {
if l, ok := begins[cur]; ok {
var labelStr string
if blkID, ok := irBlocks[l]; ok {
labelStr = fmt.Sprintf("%s (SSA Block: %s):", l, blkID)
} else {
labelStr = fmt.Sprintf("%s:", l)
}
lines = append(lines, labelStr)
}
if cur.kind == nop0 {
continue
}
lines = append(lines, "\t"+cur.String())
}
return "\n" + strings.Join(lines, "\n") + "\n"
}
func (m *machine) encodeWithoutRelResolution(root *instruction) {
for cur := root; cur != nil; cur = cur.next {
cur.encode(m.c)
}
}
// Encode implements backend.Machine Encode.
func (m *machine) Encode(context.Context) {
ectx := m.ectx
bufPtr := m.c.BufPtr()
m.labelResolutionPends = m.labelResolutionPends[:0]
for _, pos := range ectx.OrderedBlockLabels {
offset := int64(len(*bufPtr))
pos.BinaryOffset = offset
for cur := pos.Begin; cur != pos.End.next; cur = cur.next {
offset := int64(len(*bufPtr))
if cur.kind == nop0 {
l := cur.nop0Label()
if pos, ok := ectx.LabelPositions[l]; ok {
pos.BinaryOffset = offset
}
}
needLabelResolution := cur.encode(m.c)
if needLabelResolution {
m.labelResolutionPends = append(m.labelResolutionPends,
labelResolutionPend{instr: cur, imm32Offset: int64(len(*bufPtr)) - 4},
)
}
}
}
for i := range m.labelResolutionPends {
p := &m.labelResolutionPends[i]
switch p.instr.kind {
case jmp, jmpIf, lea:
target := p.instr.jmpLabel()
targetOffset := ectx.LabelPositions[target].BinaryOffset
imm32Offset := p.imm32Offset
jmpOffset := int32(targetOffset - (p.imm32Offset + 4)) // +4 because RIP points to the next instruction.
binary.LittleEndian.PutUint32((*bufPtr)[imm32Offset:], uint32(jmpOffset))
default:
panic("BUG")
}
}
}
// ResolveRelocations implements backend.Machine.
func (m *machine) ResolveRelocations(refToBinaryOffset map[ssa.FuncRef]int, binary []byte, relocations []backend.RelocationInfo) {
for _, r := range relocations {
offset := r.Offset
calleeFnOffset := refToBinaryOffset[r.FuncRef]
// offset is the offset of the last 4 bytes of the call instruction.
callInstrOffsetBytes := binary[offset : offset+4]
diff := int64(calleeFnOffset) - (offset + 4) // +4 because we want the offset of the next instruction (In x64, RIP always points to the next instruction).
callInstrOffsetBytes[0] = byte(diff)
callInstrOffsetBytes[1] = byte(diff >> 8)
callInstrOffsetBytes[2] = byte(diff >> 16)
callInstrOffsetBytes[3] = byte(diff >> 24)
}
}
func (m *machine) lowerIcmpToFlag(xd, yd *backend.SSAValueDefinition, _64 bool) {
x := m.getOperand_Reg(xd)
y := m.getOperand_Mem_Imm32_Reg(yd)
cmp := m.allocateInstr().asCmpRmiR(true, y, x.r, _64)
m.insert(cmp)
}
// allocateInstr allocates an instruction.
func (m *machine) allocateInstr() *instruction {
instr := m.ectx.InstructionPool.Allocate()
if !m.regAllocStarted {
instr.addedBeforeRegAlloc = true
}
return instr
}
func (m *machine) allocateNop() *instruction {
instr := m.allocateInstr()
instr.kind = nop0
return instr
}
func (m *machine) insert(i *instruction) {
ectx := m.ectx
ectx.PendingInstructions = append(ectx.PendingInstructions, i)
}
func (m *machine) allocateBrTarget() (nop *instruction, l backend.Label) { //nolint
ectx := m.ectx
l = ectx.AllocateLabel()
nop = m.allocateInstr()
nop.asNop0WithLabel(l)
pos := ectx.AllocateLabelPosition(l)
pos.Begin, pos.End = nop, nop
ectx.LabelPositions[l] = pos
return
}
func (m *machine) getVRegSpillSlotOffsetFromSP(id regalloc.VRegID, size byte) int64 {
offset, ok := m.spillSlots[id]
if !ok {
offset = m.spillSlotSize
m.spillSlots[id] = offset
m.spillSlotSize += int64(size)
}
return offset
}
func (m *machine) copyTo(src regalloc.VReg, dst regalloc.VReg) {
typ := m.c.TypeOf(src)
mov := m.allocateInstr()
if typ.IsInt() {
mov.asMovRR(src, dst, true)
} else {
mov.asXmmUnaryRmR(sseOpcodeMovdqu, newOperandReg(src), dst)
}
m.insert(mov)
}
func (m *machine) copyToTmp(v regalloc.VReg) regalloc.VReg {
typ := m.c.TypeOf(v)
tmp := m.c.AllocateVReg(typ)
m.copyTo(v, tmp)
return tmp
}