From 7953790f4d540b4734108aabe4cbd35cc09acba5 Mon Sep 17 00:00:00 2001 From: Jonny Date: Tue, 25 Feb 2025 18:44:11 +0000 Subject: [PATCH] feat: used Chains instead of Lists --- src/main/wacc/backend/asmGenerator.scala | 190 ++++++++++++----------- 1 file changed, 98 insertions(+), 92 deletions(-) diff --git a/src/main/wacc/backend/asmGenerator.scala b/src/main/wacc/backend/asmGenerator.scala index 0d02653..a951051 100644 --- a/src/main/wacc/backend/asmGenerator.scala +++ b/src/main/wacc/backend/asmGenerator.scala @@ -2,6 +2,8 @@ package wacc import scala.collection.mutable.LinkedHashMap import scala.collection.mutable.ListBuffer +import cats.data.Chain +import cats.syntax.foldable._ object asmGenerator { import microWacc._ @@ -31,33 +33,38 @@ object asmGenerator { val Program(funcs, main) = microProg val progAsm = - LabelDef("main") :: + Chain.one(LabelDef("main")) ++ funcPrologue() ++ - List(stack.align()) ++ - main.flatMap(generateStmt) ++ - List(Move(RAX, ImmediateVal(0))) ++ + Chain(stack.align()) ++ + main.foldLeft(Chain.empty[AsmLine])(_ ++ generateStmt(_)) ++ + Chain.one(Move(RAX, ImmediateVal(0))) ++ funcEpilogue() ++ generateBuiltInFuncs() - val strDirs = strings.toList.zipWithIndex.flatMap { case (str, i) => - List( - Directive.Int(str.size), - LabelDef(s".L.str$i"), - Directive.Asciz(str.escaped) - ) + val strDirs = strings.toList.zipWithIndex.foldLeft(Chain.empty[AsmLine]) { + case (acc, (str, i)) => + acc ++ Chain( + Directive.Int(str.size), + LabelDef(s".L.str$i"), + Directive.Asciz(str.escaped) + ) } - List(Directive.IntelSyntax, Directive.Global("main"), Directive.RoData) ++ - strDirs ++ - List(Directive.Text) ++ - progAsm + val finalChain = Chain( + Directive.IntelSyntax, + Directive.Global("main"), + Directive.RoData + ) ++ strDirs ++ Chain.one(Directive.Text) ++ progAsm + + finalChain.toList + } - def wrapFunc(labelName: String, funcBody: List[AsmLine])(using + def wrapFunc(labelName: String, funcBody: Chain[AsmLine])(using stack: Stack, strings: ListBuffer[String] - ): List[AsmLine] = { - LabelDef(labelName) :: + ): Chain[AsmLine] = { + Chain.one(LabelDef(labelName)) ++ funcPrologue() ++ funcBody ++ funcEpilogue() @@ -65,16 +72,15 @@ object asmGenerator { def generateBuiltInFuncs()(using stack: Stack, - strings: ListBuffer[String], - labelGenerator: LabelGenerator - ): List[AsmLine] = { + strings: ListBuffer[String] + ): Chain[AsmLine] = { wrapFunc( labelGenerator.getLabel(Builtin.Exit), - List(stack.align(), assemblyIR.Call(CLibFunc.Exit)) + Chain(stack.align(), assemblyIR.Call(CLibFunc.Exit)) ) ++ wrapFunc( labelGenerator.getLabel(Builtin.Printf), - List( + Chain( stack.align(), assemblyIR.Call(CLibFunc.PrintF), Move(RDI, ImmediateVal(0)), @@ -83,14 +89,14 @@ object asmGenerator { ) ++ wrapFunc( labelGenerator.getLabel(Builtin.Malloc), - List( + Chain.one( stack.align() ) ) ++ - wrapFunc(labelGenerator.getLabel(Builtin.Free), List()) ++ + wrapFunc(labelGenerator.getLabel(Builtin.Free), Chain.empty) ++ wrapFunc( labelGenerator.getLabel(Builtin.Read), - List( + Chain( stack.align(), stack.reserve(), stack.push(RSI), @@ -104,11 +110,7 @@ object asmGenerator { def generateStmt( stmt: Stmt - )(using - stack: Stack, - strings: ListBuffer[String], - labelGenerator: LabelGenerator - ): List[AsmLine] = + )(using stack: Stack, strings: ListBuffer[String]): Chain[AsmLine] = stmt match { case Assign(lhs, rhs) => var dest: () => IndexAddress = @@ -117,15 +119,15 @@ object asmGenerator { case ident: Ident => dest = stack.accessVar(ident) if (!stack.contains(ident)) { - List(stack.reserve(ident)) - } else Nil + Chain.one(stack.reserve(ident)) + } else Chain.empty // TODO lhs = arrayElem case _ => // dest = ??? - List() + Chain.empty }) ++ evalExprOntoStack(rhs) ++ - List( + Chain( stack.pop(RAX), Move(dest(), RAX) ) @@ -133,47 +135,48 @@ object asmGenerator { val elseLabel = labelGenerator.getLabel() val endLabel = labelGenerator.getLabel() evalExprOntoStack(cond) ++ - List( - Compare(stack.head(SizeDir.Word), ImmediateVal(0)), - stack.drop(), - Jump(LabelArg(elseLabel), Cond.Equal) + Chain.fromSeq( + List( + Compare(stack.head(SizeDir.Word), ImmediateVal(0)), + stack.drop(), + Jump(LabelArg(elseLabel), Cond.Equal) + ) ) ++ - thenBranch.flatMap(generateStmt) ++ - List(Jump(LabelArg(endLabel)), LabelDef(elseLabel)) ++ - elseBranch.flatMap(generateStmt) ++ - List(LabelDef(endLabel)) + 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) => { val startLabel = labelGenerator.getLabel() val endLabel = labelGenerator.getLabel() - List(LabelDef(startLabel)) ++ + Chain.one(LabelDef(startLabel)) ++ evalExprOntoStack(cond) ++ - List( + Chain( Compare(stack.head(SizeDir.Word), ImmediateVal(0)), stack.drop(), Jump(LabelArg(endLabel), Cond.Equal) ) ++ - body.flatMap(generateStmt) ++ - List(Jump(LabelArg(startLabel)), LabelDef(endLabel)) + Chain.fromSeq(body).flatMap(generateStmt) ++ + Chain(Jump(LabelArg(startLabel)), LabelDef(endLabel)) } case microWacc.Return(expr) => evalExprOntoStack(expr) ++ - List(stack.pop(RAX), assemblyIR.Return()) + Chain(stack.pop(RAX), assemblyIR.Return()) case call: microWacc.Call => generateCall(call) } def evalExprOntoStack(expr: Expr)(using stack: Stack, - strings: ListBuffer[String], - labelGenerator: LabelGenerator - ): List[AsmLine] = { + strings: ListBuffer[String] + ): Chain[AsmLine] = { val out = expr match { case IntLiter(v) => - List(stack.push(ImmediateVal(v))) + Chain.one(stack.push(ImmediateVal(v))) case CharLiter(v) => - List(stack.push(ImmediateVal(v.toInt))) + Chain.one(stack.push(ImmediateVal(v.toInt))) case ident: Ident => - List(stack.push(stack.accessVar(ident)())) + Chain.one(stack.push(stack.accessVar(ident)())) case ArrayLiter(elems) => expr.ty match { case KnownType.String => @@ -181,7 +184,7 @@ object asmGenerator { case CharLiter(v) => v case _ => "" }.mkString - List( + Chain( Load( RAX, IndexAddress( @@ -192,26 +195,24 @@ object asmGenerator { stack.push(RAX) ) // TODO other array types - case _ => List() + case _ => Chain.empty } - case BoolLiter(v) => List(stack.push(ImmediateVal(if (v) 1 else 0))) - case NullLiter() => List(stack.push(ImmediateVal(0))) - case ArrayElem(value, indices) => List() + 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 => List() - case UnaryOperator.Ord => List() - case UnaryOperator.Len => List() + case UnaryOperator.Chr | UnaryOperator.Ord | UnaryOperator.Len => Chain.empty case UnaryOperator.Negate => - List( + Chain.one( Negate(stack.head(SizeDir.Word)) ) case UnaryOperator.Not => evalExprOntoStack(x) ++ - List( + Chain.one( Xor(stack.head(SizeDir.Word), ImmediateVal(1)) ) @@ -221,7 +222,7 @@ object asmGenerator { case BinaryOperator.Add => evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), Add(stack.head(SizeDir.Word), EAX) // TODO OVERFLOWING @@ -229,7 +230,7 @@ object asmGenerator { case BinaryOperator.Sub => evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), Subtract(stack.head(SizeDir.Word), EAX) // TODO OVERFLOWING @@ -237,7 +238,7 @@ object asmGenerator { case BinaryOperator.Mul => evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), Multiply(EAX, stack.head(SizeDir.Word)), stack.drop(), @@ -247,7 +248,7 @@ object asmGenerator { case BinaryOperator.Div => evalExprOntoStack(y) ++ evalExprOntoStack(x) ++ - List( + Chain( stack.pop(RAX), Divide(stack.head(SizeDir.Word)), stack.drop(), @@ -257,7 +258,7 @@ object asmGenerator { case BinaryOperator.Mod => evalExprOntoStack(y) ++ evalExprOntoStack(x) ++ - List( + Chain( stack.pop(RAX), Divide(stack.head(SizeDir.Word)), stack.drop(), @@ -279,51 +280,56 @@ object asmGenerator { case BinaryOperator.And => evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), And(stack.head(SizeDir.Word), EAX) ) case BinaryOperator.Or => evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), Or(stack.head(SizeDir.Word), EAX) ) } case call: microWacc.Call => generateCall(call) ++ - List(stack.push(RAX)) + Chain.one(stack.push(RAX)) } - if out.isEmpty then List(stack.push(ImmediateVal(0))) else out + if out.isEmpty then Chain.one(stack.push(ImmediateVal(0))) else out } def generateCall(call: microWacc.Call)(using stack: Stack, - strings: ListBuffer[String], - labelGenerator: LabelGenerator - ): List[AsmLine] = { + strings: ListBuffer[String] + ): Chain[AsmLine] = { val argRegs = List(RDI, RSI, RDX, RCX, R8, R9) val microWacc.Call(target, args) = call - argRegs.zip(args).flatMap { (reg, expr) => - evalExprOntoStack(expr) ++ - List(stack.pop(reg)) - } ++ - args.drop(argRegs.size).flatMap(evalExprOntoStack) ++ - List(assemblyIR.Call(LabelArg(labelGenerator.getLabel(target)))) ++ - (if (args.size > argRegs.size) { - List(stack.drop(args.size - argRegs.size)) - } else Nil) + + val regMoves = argRegs + .zip(args) + .map { (reg, expr) => + evalExprOntoStack(expr) ++ + Chain.one(stack.pop(reg)) + } + .combineAll + + val stackPushes = args.drop(argRegs.size).map(evalExprOntoStack).combineAll + + 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) } def generateComparison(x: Expr, y: Expr, cond: Cond)(using stack: Stack, - strings: ListBuffer[String], - labelGenerator: LabelGenerator - ): List[AsmLine] = { + strings: ListBuffer[String] + ): Chain[AsmLine] = { evalExprOntoStack(x) ++ evalExprOntoStack(y) ++ - List( + Chain( stack.pop(RAX), Compare(stack.head(SizeDir.Word), EAX), Set(Register(RegSize.Byte, RegName.AL), cond), @@ -334,15 +340,15 @@ object asmGenerator { } // Missing a sub instruction but dont think we need it - def funcPrologue()(using stack: Stack): List[AsmLine] = { - List( + def funcPrologue()(using stack: Stack): Chain[AsmLine] = { + Chain( stack.push(RBP), Move(RBP, Register(RegSize.R64, RegName.SP)) ) } - def funcEpilogue()(using stack: Stack): List[AsmLine] = { - List( + def funcEpilogue()(using stack: Stack): Chain[AsmLine] = { + Chain( Move(Register(RegSize.R64, RegName.SP), RBP), stack.pop(RBP), assemblyIR.Return()