style: improve code formatting and consistency in typeChecker and assemblyIR
This commit is contained in:
Guy C
@@ -19,7 +19,7 @@ object asmGenerator {
|
||||
val RBP = Register(RegSize.R64, RegName.BP)
|
||||
val RSI = Register(RegSize.R64, RegName.SI)
|
||||
|
||||
val _8_BIT_MASK = 0xFF
|
||||
val _8_BIT_MASK = 0xff
|
||||
|
||||
object labelGenerator {
|
||||
var labelVal = -1
|
||||
@@ -27,8 +27,8 @@ object asmGenerator {
|
||||
labelVal += 1
|
||||
s".L$labelVal"
|
||||
}
|
||||
def getLabel(target: CallTarget): String = target match{
|
||||
case Ident(v,_) => s"wacc_$v"
|
||||
def getLabel(target: CallTarget): String = target match {
|
||||
case Ident(v, _) => s"wacc_$v"
|
||||
case Builtin(name) => s"_$name"
|
||||
}
|
||||
}
|
||||
@@ -61,33 +61,31 @@ object asmGenerator {
|
||||
strings: ListBuffer[String]
|
||||
): List[AsmLine] = {
|
||||
LabelDef(labelName) ::
|
||||
funcPrologue() ++
|
||||
funcPrologue() ++
|
||||
funcBody ++
|
||||
funcEpilogue()
|
||||
funcEpilogue()
|
||||
}
|
||||
|
||||
def generateBuiltInFuncs()(using
|
||||
stack: LinkedHashMap[Ident, Int],
|
||||
strings: ListBuffer[String]
|
||||
): List[AsmLine] = {
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Exit),
|
||||
wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Exit),
|
||||
alignStack() ++
|
||||
List(Pop(RDI),
|
||||
assemblyIR.Call(CLibFunc.Exit))
|
||||
List(Pop(RDI), assemblyIR.Call(CLibFunc.Exit))
|
||||
) ++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Printf),
|
||||
alignStack() ++
|
||||
List(assemblyIR.Call(CLibFunc.PrintF),
|
||||
Move(RDI, ImmediateVal(0)),
|
||||
assemblyIR.Call(CLibFunc.Fflush)
|
||||
)
|
||||
)++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Malloc),
|
||||
List()
|
||||
)++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Free),
|
||||
List()
|
||||
)
|
||||
wrapFunc(
|
||||
labelGenerator.getLabel(Builtin.Printf),
|
||||
alignStack() ++
|
||||
List(
|
||||
assemblyIR.Call(CLibFunc.PrintF),
|
||||
Move(RDI, ImmediateVal(0)),
|
||||
assemblyIR.Call(CLibFunc.Fflush)
|
||||
)
|
||||
) ++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Malloc), List()) ++
|
||||
wrapFunc(labelGenerator.getLabel(Builtin.Free), List())
|
||||
}
|
||||
|
||||
def generateStmt(
|
||||
@@ -95,7 +93,7 @@ object asmGenerator {
|
||||
)(using stack: LinkedHashMap[Ident, Int], strings: ListBuffer[String]): List[AsmLine] =
|
||||
stmt match {
|
||||
case microWacc.Call(Builtin.Exit, code :: _) =>
|
||||
List()
|
||||
List()
|
||||
case Assign(lhs, rhs) =>
|
||||
var dest: IndexAddress =
|
||||
IndexAddress(RSP, 0) // gets overrwitten
|
||||
@@ -188,97 +186,100 @@ object asmGenerator {
|
||||
// TODO other array types
|
||||
case _ => List()
|
||||
}
|
||||
case BoolLiter(v) => List(Push(ImmediateVal(if (v) 1 else 0)))
|
||||
case NullLiter() => List(Push(ImmediateVal(0)))
|
||||
case BoolLiter(v) => List(Push(ImmediateVal(if (v) 1 else 0)))
|
||||
case NullLiter() => List(Push(ImmediateVal(0)))
|
||||
case ArrayElem(value, indices) => List()
|
||||
case UnaryOp(x, op) => 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.Negate => List(
|
||||
Negate(MemLocation(RSP,SizeDir.Word))
|
||||
)
|
||||
case UnaryOperator.Not =>
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Xor(MemLocation(RSP, SizeDir.Word), ImmediateVal(1))
|
||||
)
|
||||
|
||||
}
|
||||
case BinaryOp(x, y, op) => op match {
|
||||
case BinaryOperator.Add =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Add(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Sub =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Subtract(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Mul =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Multiply(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Div =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Divide(MemLocation(RSP, SizeDir.Word)),
|
||||
Add(RSP, ImmediateVal(8)),
|
||||
Push(EAX)
|
||||
// TODO CHECK DIVISOR IS NOT 0
|
||||
)
|
||||
case BinaryOperator.Mod =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Divide(MemLocation(RSP, SizeDir.Word)),
|
||||
Add(RSP, ImmediateVal(8)),
|
||||
Push(EDX)
|
||||
// TODO CHECK DIVISOR IS NOT 0
|
||||
case UnaryOp(x, op) =>
|
||||
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.Negate =>
|
||||
List(
|
||||
Negate(MemLocation(RSP, SizeDir.Word))
|
||||
)
|
||||
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) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
And(MemLocation(RSP, SizeDir.Word), EAX),
|
||||
)
|
||||
case BinaryOperator.Or =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Or(MemLocation(RSP, SizeDir.Word), EAX),
|
||||
)
|
||||
}
|
||||
case UnaryOperator.Not =>
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Xor(MemLocation(RSP, SizeDir.Word), ImmediateVal(1))
|
||||
)
|
||||
|
||||
}
|
||||
case BinaryOp(x, y, op) =>
|
||||
op match {
|
||||
case BinaryOperator.Add =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Add(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Sub =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Subtract(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Mul =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Multiply(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
// TODO OVERFLOWING
|
||||
)
|
||||
case BinaryOperator.Div =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Divide(MemLocation(RSP, SizeDir.Word)),
|
||||
Add(RSP, ImmediateVal(8)),
|
||||
Push(EAX)
|
||||
// TODO CHECK DIVISOR IS NOT 0
|
||||
)
|
||||
case BinaryOperator.Mod =>
|
||||
evalExprOntoStack(y) ++
|
||||
evalExprOntoStack(x) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Divide(MemLocation(RSP, SizeDir.Word)),
|
||||
Add(RSP, ImmediateVal(8)),
|
||||
Push(EDX)
|
||||
// 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) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
And(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
)
|
||||
case BinaryOperator.Or =>
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Or(MemLocation(RSP, SizeDir.Word), EAX)
|
||||
)
|
||||
}
|
||||
case microWacc.Call(target, args) => List()
|
||||
}
|
||||
}
|
||||
@@ -308,19 +309,19 @@ object asmGenerator {
|
||||
|
||||
// }
|
||||
|
||||
def generateComparison(x : Expr, y: Expr, cond: Cond)(using
|
||||
def generateComparison(x: Expr, y: Expr, cond: Cond)(using
|
||||
stack: LinkedHashMap[Ident, Int],
|
||||
strings: ListBuffer[String]
|
||||
): List[AsmLine] = {
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Compare(MemLocation(RSP, SizeDir.Word), EAX),
|
||||
Set(Register(RegSize.Byte, RegName.AL), cond),
|
||||
And(EAX, ImmediateVal(_8_BIT_MASK)),
|
||||
Push(EAX)
|
||||
)
|
||||
evalExprOntoStack(x) ++
|
||||
evalExprOntoStack(y) ++
|
||||
List(
|
||||
Pop(EAX),
|
||||
Compare(MemLocation(RSP, SizeDir.Word), EAX),
|
||||
Set(Register(RegSize.Byte, RegName.AL), cond),
|
||||
And(EAX, ImmediateVal(_8_BIT_MASK)),
|
||||
Push(EAX)
|
||||
)
|
||||
}
|
||||
def accessVar(ident: Ident)(using stack: LinkedHashMap[Ident, Int]): IndexAddress =
|
||||
IndexAddress(RSP, (stack.size - stack(ident)) * 8)
|
||||
@@ -397,8 +398,8 @@ object asmGenerator {
|
||||
)
|
||||
|
||||
} else {
|
||||
evalExprOntoStack(expr) ++
|
||||
List(Pop(RSI))
|
||||
evalExprOntoStack(expr) ++
|
||||
List(Pop(RSI))
|
||||
})
|
||||
// print the value
|
||||
++
|
||||
|
||||
Reference in New Issue
Block a user