(* val _ = print ("s1 = " ^ Tm.sfx s1 ^ ", s2 = " ^ Tm.sfx s2 ^ ", ") *)
(* val _ = print ("rs = " ^ Tm.sfx rs ^ " from " ^ TU.Print.pp_exp e1 ^ " and " ^ TU.Print.pp_exp e2 ^ "\n") *)
in
- [X.COMMENT "binophit" ] @ i1 @ i2 @ [X.INSN (X.AL, oper (d, t)), X.COMMENT "binophit done"]
+ i1 @ i2 @ [X.INSN (X.AL, oper (d, t))]
end
(* cmphit : X.oper -> X.exp -> X.insn list
* generates instructions to achieve d <- e
* d must be TEMP(t) or REG(r)
*)
- and munch_exp d (T.CONST n) = [X.INSN (X.AL, X.MOVLIT(d, Word.fromLarge n))]
+ and munch_exp d (T.CONST n) = [X.INSN (X.AL, X.MOVLIT(d, Word.fromLarge (Word32.toLarge n)))]
+ | munch_exp d (T.STRING s) = [X.INSN (X.AL, X.MOVSTR(d, s))]
| munch_exp d (T.NULLPTR) = [X.INSN (X.AL, X.MOVLIT(d, 0w0))]
| munch_exp d (T.TEMP(t)) = [X.INSN (X.AL, X.MOV(d, X.TEMP t))]
| munch_exp d (T.ARG(0)) = [X.INSN (X.AL, X.MOV(d, X.REG X.R0))]
then 0
else nargs - 4
val stackb = nstack * 1
- fun argdest 1 = X.REG X.R0
- | argdest 2 = X.REG X.R1
- | argdest 3 = X.REG X.R2
- | argdest 4 = X.REG X.R3
- | argdest n = raise ErrorMsg.InternalError "more than 4 args not supported yet" (*X.REL ((X.REG X.RSP, Tm.Quad), (X.CONST (Word32.fromInt (~(stackb - 8 * (n - 7)))), Tm.Quad), 0w1)*)
+ fun argdest 1 = (X.REG X.R0, [])
+ | argdest 2 = (X.REG X.R1, [])
+ | argdest 3 = (X.REG X.R2, [])
+ | argdest 4 = (X.REG X.R3, [])
+ | argdest n =
+ let
+ val t = Temp.new "argdest"
+ val t2 = Temp.new "argptr"
+ in
+ (X.TEMP t, (* Dude, I *love* this shit. *)
+ [ X.INSN (X.AL, X.MOVLIT (X.TEMP t2, Word.fromInt (0x10000 - (n - 4 + 1)))),
+ X.INSN (X.AL, X.ADD (X.TEMP t2, X.REG X.SP)),
+ X.INSN (X.AL, X.STO (X.TEMP t2, X.TEMP t)) ] )
+ end
val dests = List.tabulate (nargs, fn x => argdest (x+1))
val hf = List.map hasfixed l
(fn (t,exp) => munch_exp (X.TEMP t) exp)
(ListPair.zip (temps, l_hf))
val argpushes = List.map
- (fn (dest, t) => [X.INSN (X.AL, X.MOV (dest, X.TEMP t))])
+ (fn ((dest, _), t) => [X.INSN (X.AL, X.MOV (dest, X.TEMP t))])
(ListPair.zip (d_hf, temps))
val argevals_nohf = List.map
- (fn (d,exp) => munch_exp d exp)
+ (fn ((d,_),exp) => munch_exp d exp)
(ListPair.zip (d_nohf, l_nohf))
+ val shittodo = List.concat (List.map (fn (_, shit) => shit) (d_hf @ d_nohf))
val t_stackb = Temp.new ("stackb")
val t_target = Temp.new ("target")
List.concat argevals_hf @
List.concat argpushes @
List.concat argevals_nohf @
- [ X.INSN (X.AL, X.MOVLIT (X.TEMP t_stackb, Word.fromInt stackb)),
- X.INSN (X.AL, X.MOVSYM (X.TEMP t_target, name)),
- X.INSN (X.AL, X.SUB (X.REG X.SP, X.TEMP t_stackb)),
- X.INSN (X.AL, X.CALL (X.REG X.SP, X.TEMP t_target, nargs)),
- X.INSN (X.AL, X.ADD (X.REG X.SP, X.TEMP t_stackb)),
- X.INSN (X.AL, X.MOV (d, X.REG X.R0))]
+ shittodo @
+ (if stackb > 0
+ then [ X.INSN (X.AL, X.MOVLIT (X.TEMP t_stackb, Word.fromInt stackb)),
+ X.INSN (X.AL, X.MOVSYM (X.TEMP t_target, name)),
+ X.INSN (X.AL, X.SUB (X.REG X.SP, X.TEMP t_stackb)),
+ X.INSN (X.AL, X.CALL (X.REG X.SP, X.TEMP t_target, nargs)),
+ X.INSN (X.AL, X.ADD (X.REG X.SP, X.TEMP t_stackb)),
+ X.INSN (X.AL, X.MOV (d, X.REG X.R0))]
+ else [ X.INSN (X.AL, X.MOVSYM (X.TEMP t_target, name)),
+ X.INSN (X.AL, X.CALL (X.REG X.SP, X.TEMP t_target, nargs)),
+ X.INSN (X.AL, X.MOV (d, X.REG X.R0))]
+ )
end
(*| munch_exp d (T.BINOP(T.ADD, e1, T.CONST n)) = binophit_c d X.ADD e1 n
| munch_exp d (T.BINOP(T.ADD, T.CONST n, e1)) = binophit_c d X.ADD e1 n
(* munch_stm : T.stm -> X.insn list *)
(* munch_stm stm generates code to execute stm *)
and munch_stm (T.MOVE (T.TEMP t1, T.TEMP t2)) = [X.INSN (X.AL, X.MOV(X.TEMP t1, X.TEMP t2))]
- | munch_stm (T.MOVE (T.TEMP t, T.CONST n)) = [X.INSN (X.AL, X.MOVLIT(X.TEMP t, Word.fromLarge n))]
+ | munch_stm (T.MOVE (T.TEMP t, T.CONST n)) = [X.INSN (X.AL, X.MOVLIT(X.TEMP t, Word.fromLarge (Word32.toLarge n)))]
| munch_stm (T.MOVE (T.TEMP t, a as T.ARG (an))) =
let
val i = munch_exp (X.TEMP t) a