feat: used local mutable Chains. Also implemented new LabelGenerator
This commit is contained in:
Jonny
parent
7953790f4d
commit
edbc03ee25
GPG Key ID:
15E168A8B332382C
@ -4,6 +4,7 @@ import scala.collection.mutable.LinkedHashMap
|
||||
import scala.collection.mutable.ListBuffer
|
||||
import cats.data.Chain
|
||||
import cats.syntax.foldable._
|
||||
import parsley.token.errors.Label
|
||||
|
||||
object asmGenerator {
|
||||
import microWacc._
|
||||
@ -26,10 +27,27 @@ object asmGenerator {
|
||||
|
||||
val _8_BIT_MASK = 0xff
|
||||
|
||||
extension (chain: Chain[AsmLine])
|
||||
def +=(line: AsmLine): Chain[AsmLine] = chain.append(line)
|
||||
|
||||
class LabelGenerator {
|
||||
var labelVal = -1
|
||||
def getLabel(): String = {
|
||||
labelVal += 1
|
||||
s".L$labelVal"
|
||||
}
|
||||
def getLabel(target: CallTarget): String = target match {
|
||||
case Ident(v, _) => s"wacc_$v"
|
||||
case Builtin(name) => s"_$name"
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
def generateAsm(microProg: Program): List[AsmLine] = {
|
||||
given stack: Stack = Stack()
|
||||
given strings: ListBuffer[String] = ListBuffer[String]()
|
||||
given labelGenerator: LabelGenerator = LabelGenerator()
|
||||
|
||||
val Program(funcs, main) = microProg
|
||||
|
||||
val progAsm =
|
||||
@ -64,295 +82,260 @@ object asmGenerator {
|
||||
stack: Stack,
|
||||
strings: ListBuffer[String]
|
||||
): Chain[AsmLine] = {
|
||||
Chain.one(LabelDef(labelName)) ++
|
||||
funcPrologue() ++
|
||||
funcBody ++
|
||||
funcEpilogue()
|
||||
var chain = Chain.empty[AsmLine]
|
||||
|
||||
chain += LabelDef(labelName)
|
||||
chain ++= funcPrologue()
|
||||
chain ++= funcBody
|
||||
chain ++= funcEpilogue()
|
||||
|
||||
chain
|
||||
}
|
||||
|
||||
def generateBuiltInFuncs()(using
|
||||
stack: Stack,
|
||||
strings: ListBuffer[String]
|
||||
strings: ListBuffer[String],
|
||||
labelGenerator: LabelGenerator
|
||||
): Chain[AsmLine] = {
|
||||
wrapFunc(
|
||||
var chain = Chain.empty[AsmLine]
|
||||
|
||||
chain ++= wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Exit),
|
||||
Chain(stack.align(), assemblyIR.Call(CLibFunc.Exit))
|
||||
) ++
|
||||
wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Printf),
|
||||
Chain(
|
||||
stack.align(),
|
||||
assemblyIR.Call(CLibFunc.PrintF),
|
||||
Move(RDI, ImmediateVal(0)),
|
||||
assemblyIR.Call(CLibFunc.Fflush)
|
||||
)
|
||||
) ++
|
||||
wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Malloc),
|
||||
Chain.one(
|
||||
stack.align()
|
||||
)
|
||||
) ++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Free), Chain.empty) ++
|
||||
wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Read),
|
||||
Chain(
|
||||
stack.align(),
|
||||
stack.reserve(),
|
||||
stack.push(RSI),
|
||||
Load(RSI, stack.head),
|
||||
assemblyIR.Call(CLibFunc.Scanf),
|
||||
stack.pop(RAX),
|
||||
stack.drop()
|
||||
)
|
||||
)
|
||||
|
||||
chain ++= wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Printf),
|
||||
Chain(
|
||||
stack.align(),
|
||||
assemblyIR.Call(CLibFunc.PrintF),
|
||||
Move(RDI, ImmediateVal(0)),
|
||||
assemblyIR.Call(CLibFunc.Fflush)
|
||||
)
|
||||
)
|
||||
|
||||
chain ++= wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Malloc),
|
||||
Chain.one(stack.align())
|
||||
)
|
||||
|
||||
chain ++= wrapFunc(labelGenerator.getLabel(Builtin.Free), Chain.empty)
|
||||
|
||||
chain ++= wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Read),
|
||||
Chain(
|
||||
stack.align(),
|
||||
stack.reserve(),
|
||||
stack.push(RSI),
|
||||
Load(RSI, stack.head),
|
||||
assemblyIR.Call(CLibFunc.Scanf),
|
||||
stack.pop(RAX),
|
||||
stack.drop()
|
||||
)
|
||||
)
|
||||
|
||||
chain
|
||||
}
|
||||
|
||||
def generateStmt(
|
||||
stmt: Stmt
|
||||
)(using stack: Stack, strings: ListBuffer[String]): Chain[AsmLine] =
|
||||
def generateStmt(stmt: Stmt)(using stack: Stack, strings: ListBuffer[String], labelGenerator: LabelGenerator): Chain[AsmLine] = {
|
||||
var chain = Chain.empty[AsmLine]
|
||||
|
||||
stmt match {
|
||||
case Assign(lhs, rhs) =>
|
||||
var dest: () => IndexAddress =
|
||||
() => IndexAddress(RAX, 0) // gets overrwitten
|
||||
(lhs match {
|
||||
var dest: () => IndexAddress = () => IndexAddress(RAX, 0) // overwritten below
|
||||
|
||||
lhs match {
|
||||
case ident: Ident =>
|
||||
dest = stack.accessVar(ident)
|
||||
if (!stack.contains(ident)) {
|
||||
Chain.one(stack.reserve(ident))
|
||||
} else Chain.empty
|
||||
if (!stack.contains(ident)) chain += stack.reserve(ident)
|
||||
// TODO lhs = arrayElem
|
||||
case _ =>
|
||||
// dest = ???
|
||||
Chain.empty
|
||||
}) ++
|
||||
evalExprOntoStack(rhs) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Move(dest(), RAX)
|
||||
)
|
||||
case If(cond, thenBranch, elseBranch) => {
|
||||
}
|
||||
|
||||
chain ++= evalExprOntoStack(rhs)
|
||||
chain += stack.pop(RAX)
|
||||
chain += Move(dest(), RAX)
|
||||
|
||||
case If(cond, thenBranch, elseBranch) =>
|
||||
val elseLabel = labelGenerator.getLabel()
|
||||
val endLabel = labelGenerator.getLabel()
|
||||
evalExprOntoStack(cond) ++
|
||||
Chain.fromSeq(
|
||||
List(
|
||||
Compare(stack.head(SizeDir.Word), ImmediateVal(0)),
|
||||
stack.drop(),
|
||||
Jump(LabelArg(elseLabel), Cond.Equal)
|
||||
)
|
||||
) ++
|
||||
Chain.fromSeq(thenBranch).flatMap(generateStmt) ++
|
||||
Chain.fromSeq(List(Jump(LabelArg(endLabel)), LabelDef(elseLabel))) ++
|
||||
Chain.fromSeq(elseBranch).flatMap(generateStmt) ++
|
||||
Chain.one(LabelDef(endLabel))
|
||||
}
|
||||
case While(cond, body) => {
|
||||
|
||||
chain ++= evalExprOntoStack(cond)
|
||||
chain += Compare(stack.head(SizeDir.Word), ImmediateVal(0))
|
||||
chain += stack.drop()
|
||||
chain += Jump(LabelArg(elseLabel), Cond.Equal)
|
||||
|
||||
chain ++= Chain.fromSeq(thenBranch).flatMap(generateStmt)
|
||||
chain += Jump(LabelArg(endLabel))
|
||||
chain += LabelDef(elseLabel)
|
||||
|
||||
chain ++= Chain.fromSeq(elseBranch).flatMap(generateStmt)
|
||||
chain += LabelDef(endLabel)
|
||||
|
||||
case While(cond, body) =>
|
||||
val startLabel = labelGenerator.getLabel()
|
||||
val endLabel = labelGenerator.getLabel()
|
||||
Chain.one(LabelDef(startLabel)) ++
|
||||
evalExprOntoStack(cond) ++
|
||||
Chain(
|
||||
Compare(stack.head(SizeDir.Word), ImmediateVal(0)),
|
||||
stack.drop(),
|
||||
Jump(LabelArg(endLabel), Cond.Equal)
|
||||
) ++
|
||||
Chain.fromSeq(body).flatMap(generateStmt) ++
|
||||
Chain(Jump(LabelArg(startLabel)), LabelDef(endLabel))
|
||||
}
|
||||
|
||||
chain += LabelDef(startLabel)
|
||||
chain ++= evalExprOntoStack(cond)
|
||||
chain += Compare(stack.head(SizeDir.Word), ImmediateVal(0))
|
||||
chain += stack.drop()
|
||||
chain += Jump(LabelArg(endLabel), Cond.Equal)
|
||||
|
||||
chain ++= Chain.fromSeq(body).flatMap(generateStmt)
|
||||
chain += Jump(LabelArg(startLabel))
|
||||
chain += LabelDef(endLabel)
|
||||
|
||||
case microWacc.Return(expr) =>
|
||||
evalExprOntoStack(expr) ++
|
||||
Chain(stack.pop(RAX), assemblyIR.Return())
|
||||
case call: microWacc.Call => generateCall(call)
|
||||
chain ++= evalExprOntoStack(expr)
|
||||
chain += stack.pop(RAX)
|
||||
chain += assemblyIR.Return()
|
||||
|
||||
case call: microWacc.Call =>
|
||||
chain ++= generateCall(call)
|
||||
}
|
||||
|
||||
chain
|
||||
}
|
||||
|
||||
def evalExprOntoStack(expr: Expr)(using
|
||||
stack: Stack,
|
||||
strings: ListBuffer[String]
|
||||
strings: ListBuffer[String],
|
||||
labelGenerator: LabelGenerator
|
||||
): Chain[AsmLine] = {
|
||||
val out = expr match {
|
||||
case IntLiter(v) =>
|
||||
Chain.one(stack.push(ImmediateVal(v)))
|
||||
case CharLiter(v) =>
|
||||
Chain.one(stack.push(ImmediateVal(v.toInt)))
|
||||
case ident: Ident =>
|
||||
Chain.one(stack.push(stack.accessVar(ident)()))
|
||||
var chain = Chain.empty[AsmLine]
|
||||
|
||||
expr match {
|
||||
case IntLiter(v) => chain += stack.push(ImmediateVal(v))
|
||||
case CharLiter(v) => chain += stack.push(ImmediateVal(v.toInt))
|
||||
case ident: Ident => chain += stack.push(stack.accessVar(ident)())
|
||||
|
||||
case ArrayLiter(elems) =>
|
||||
expr.ty match {
|
||||
case KnownType.String =>
|
||||
strings += elems.map {
|
||||
case CharLiter(v) => v
|
||||
case _ => ""
|
||||
}.mkString
|
||||
Chain(
|
||||
Load(
|
||||
RAX,
|
||||
IndexAddress(
|
||||
RIP,
|
||||
LabelArg(s".L.str${strings.size - 1}")
|
||||
)
|
||||
),
|
||||
stack.push(RAX)
|
||||
)
|
||||
// TODO other array types
|
||||
case _ => Chain.empty
|
||||
strings += elems.collect { case CharLiter(v) => v }.mkString
|
||||
chain += Load(RAX, IndexAddress(RIP, LabelArg(s".L.str${strings.size - 1}")))
|
||||
chain += stack.push(RAX)
|
||||
case _ => // Other array types TODO
|
||||
}
|
||||
case BoolLiter(v) => Chain.one(stack.push(ImmediateVal(if (v) 1 else 0)))
|
||||
case NullLiter() => Chain.one(stack.push(ImmediateVal(0)))
|
||||
case ArrayElem(value, indices) => Chain.empty
|
||||
case UnaryOp(x, op) =>
|
||||
evalExprOntoStack(x) ++
|
||||
(op match {
|
||||
// TODO: chr and ord are TYPE CASTS. They do not change the internal value,
|
||||
// but will need bound checking e.t.c.
|
||||
case UnaryOperator.Chr | UnaryOperator.Ord | UnaryOperator.Len => Chain.empty
|
||||
case UnaryOperator.Negate =>
|
||||
Chain.one(
|
||||
Negate(stack.head(SizeDir.Word))
|
||||
)
|
||||
case UnaryOperator.Not =>
|
||||
evalExprOntoStack(x) ++
|
||||
Chain.one(
|
||||
Xor(stack.head(SizeDir.Word), ImmediateVal(1))
|
||||
)
|
||||
|
||||
})
|
||||
case BinaryOp(x, y, op) =>
|
||||
case BoolLiter(v) => chain += stack.push(ImmediateVal(if (v) 1 else 0))
|
||||
case NullLiter() => chain += stack.push(ImmediateVal(0))
|
||||
case ArrayElem(_, _) => // TODO: Implement handling
|
||||
|
||||
case UnaryOp(x, op) =>
|
||||
chain ++= evalExprOntoStack(x)
|
||||
op match {
|
||||
case BinaryOperator.Add =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Add(stack.head(SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Sub =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Subtract(stack.head(SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Mul =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Multiply(EAX, stack.head(SizeDir.Word)),
|
||||
stack.drop(),
|
||||
stack.push(RAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Div =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Divide(stack.head(SizeDir.Word)),
|
||||
stack.drop(),
|
||||
stack.push(RAX)
|
||||
// TODO CHECK DIVISOR IS NOT 0
|
||||
)
|
||||
case BinaryOperator.Mod =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Divide(stack.head(SizeDir.Word)),
|
||||
stack.drop(),
|
||||
stack.push(RDX)
|
||||
// TODO CHECK DIVISOR IS NOT 0
|
||||
)
|
||||
case BinaryOperator.Eq =>
|
||||
generateComparison(x, y, Cond.Equal)
|
||||
case BinaryOperator.Neq =>
|
||||
generateComparison(x, y, Cond.NotEqual)
|
||||
case BinaryOperator.Greater =>
|
||||
generateComparison(x, y, Cond.Greater)
|
||||
case BinaryOperator.GreaterEq =>
|
||||
generateComparison(x, y, Cond.GreaterEqual)
|
||||
case BinaryOperator.Less =>
|
||||
generateComparison(x, y, Cond.Less)
|
||||
case BinaryOperator.LessEq =>
|
||||
generateComparison(x, y, Cond.LessEqual)
|
||||
case BinaryOperator.And =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
And(stack.head(SizeDir.Word), EAX)
|
||||
)
|
||||
case BinaryOperator.Or =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Or(stack.head(SizeDir.Word), EAX)
|
||||
)
|
||||
case UnaryOperator.Chr | UnaryOperator.Ord | UnaryOperator.Len => // No op needed
|
||||
case UnaryOperator.Negate => chain += Negate(stack.head(SizeDir.Word))
|
||||
case UnaryOperator.Not =>
|
||||
chain += Xor(stack.head(SizeDir.Word), ImmediateVal(1))
|
||||
}
|
||||
|
||||
case BinaryOp(x, y, op) =>
|
||||
chain ++= evalExprOntoStack(x)
|
||||
chain ++= evalExprOntoStack(y)
|
||||
|
||||
chain += stack.pop(RAX)
|
||||
|
||||
op match {
|
||||
case BinaryOperator.Add => chain += Add(stack.head(SizeDir.Word), EAX)
|
||||
case BinaryOperator.Sub => chain += Subtract(stack.head(SizeDir.Word), EAX)
|
||||
case BinaryOperator.Mul =>
|
||||
chain += Multiply(EAX, stack.head(SizeDir.Word))
|
||||
chain += stack.drop()
|
||||
chain += stack.push(RAX)
|
||||
|
||||
case BinaryOperator.Div =>
|
||||
chain += Divide(stack.head(SizeDir.Word))
|
||||
chain += stack.drop()
|
||||
chain += stack.push(RAX)
|
||||
|
||||
case BinaryOperator.Mod =>
|
||||
chain += Divide(stack.head(SizeDir.Word))
|
||||
chain += stack.drop()
|
||||
chain += stack.push(RDX)
|
||||
|
||||
case BinaryOperator.Eq => chain ++= generateComparison(x, y, Cond.Equal)
|
||||
case BinaryOperator.Neq => chain ++= generateComparison(x, y, Cond.NotEqual)
|
||||
case BinaryOperator.Greater => chain ++= generateComparison(x, y, Cond.Greater)
|
||||
case BinaryOperator.GreaterEq => chain ++= generateComparison(x, y, Cond.GreaterEqual)
|
||||
case BinaryOperator.Less => chain ++= generateComparison(x, y, Cond.Less)
|
||||
case BinaryOperator.LessEq => chain ++= generateComparison(x, y, Cond.LessEqual)
|
||||
case BinaryOperator.And => chain += And(stack.head(SizeDir.Word), EAX)
|
||||
case BinaryOperator.Or => chain += Or(stack.head(SizeDir.Word), EAX)
|
||||
}
|
||||
|
||||
case call: microWacc.Call =>
|
||||
generateCall(call) ++
|
||||
Chain.one(stack.push(RAX))
|
||||
chain ++= generateCall(call)
|
||||
chain += stack.push(RAX)
|
||||
}
|
||||
if out.isEmpty then Chain.one(stack.push(ImmediateVal(0))) else out
|
||||
|
||||
if chain.isEmpty then chain += stack.push(ImmediateVal(0))
|
||||
chain
|
||||
}
|
||||
|
||||
def generateCall(call: microWacc.Call)(using
|
||||
stack: Stack,
|
||||
strings: ListBuffer[String]
|
||||
strings: ListBuffer[String],
|
||||
labelGenerator: LabelGenerator
|
||||
): Chain[AsmLine] = {
|
||||
var chain = Chain.empty[AsmLine]
|
||||
val argRegs = List(RDI, RSI, RDX, RCX, R8, R9)
|
||||
val microWacc.Call(target, args) = call
|
||||
|
||||
val regMoves = argRegs
|
||||
.zip(args)
|
||||
.map { (reg, expr) =>
|
||||
evalExprOntoStack(expr) ++
|
||||
Chain.one(stack.pop(reg))
|
||||
}
|
||||
.combineAll
|
||||
argRegs.zip(args).foreach { (reg, expr) =>
|
||||
chain ++= evalExprOntoStack(expr)
|
||||
chain += stack.pop(reg)
|
||||
}
|
||||
|
||||
val stackPushes = args.drop(argRegs.size).map(evalExprOntoStack).combineAll
|
||||
args.drop(argRegs.size).foreach { expr =>
|
||||
chain ++= evalExprOntoStack(expr)
|
||||
}
|
||||
|
||||
regMoves ++
|
||||
stackPushes ++
|
||||
Chain.one(assemblyIR.Call(LabelArg(labelGenerator.getLabel(target)))) ++
|
||||
(if (args.size > argRegs.size) Chain.one(stack.drop(args.size - argRegs.size))
|
||||
else Chain.empty)
|
||||
chain += assemblyIR.Call(LabelArg(labelGenerator.getLabel(target)))
|
||||
|
||||
if (args.size > argRegs.size) {
|
||||
chain += stack.drop(args.size - argRegs.size)
|
||||
}
|
||||
|
||||
chain
|
||||
}
|
||||
|
||||
def generateComparison(x: Expr, y: Expr, cond: Cond)(using
|
||||
stack: Stack,
|
||||
strings: ListBuffer[String]
|
||||
strings: ListBuffer[String],
|
||||
labelGenerator: LabelGenerator
|
||||
): Chain[AsmLine] = {
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
Chain(
|
||||
stack.pop(RAX),
|
||||
Compare(stack.head(SizeDir.Word), EAX),
|
||||
Set(Register(RegSize.Byte, RegName.AL), cond),
|
||||
And(RAX, ImmediateVal(_8_BIT_MASK)),
|
||||
stack.drop(),
|
||||
stack.push(RAX)
|
||||
)
|
||||
|
||||
var chain = Chain.empty[AsmLine]
|
||||
|
||||
chain ++= evalExprOntoStack(x)
|
||||
chain ++= evalExprOntoStack(y)
|
||||
chain += stack.pop(RAX)
|
||||
chain += Compare(stack.head(SizeDir.Word), EAX)
|
||||
chain += Set(Register(RegSize.Byte, RegName.AL), cond)
|
||||
chain += And(RAX, ImmediateVal(_8_BIT_MASK))
|
||||
chain += stack.drop()
|
||||
chain += stack.push(RAX)
|
||||
|
||||
chain
|
||||
}
|
||||
|
||||
// Missing a sub instruction but dont think we need it
|
||||
def funcPrologue()(using stack: Stack): Chain[AsmLine] = {
|
||||
Chain(
|
||||
stack.push(RBP),
|
||||
Move(RBP, Register(RegSize.R64, RegName.SP))
|
||||
)
|
||||
val chain = Chain.empty[AsmLine]
|
||||
chain += stack.push(RBP)
|
||||
chain += Move(RBP, Register(RegSize.R64, RegName.SP))
|
||||
chain
|
||||
}
|
||||
|
||||
def funcEpilogue()(using stack: Stack): Chain[AsmLine] = {
|
||||
Chain(
|
||||
Move(Register(RegSize.R64, RegName.SP), RBP),
|
||||
stack.pop(RBP),
|
||||
assemblyIR.Return()
|
||||
)
|
||||
val chain = Chain.empty[AsmLine]
|
||||
chain += Move(Register(RegSize.R64, RegName.SP), RBP)
|
||||
chain += stack.pop(RBP)
|
||||
chain += assemblyIR.Return()
|
||||
chain
|
||||
}
|
||||
|
||||
class LabelGenerator {
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user