[snipe.git] / codegen / solidify.sml

(* L3 Compiler
 * Takes a list of mappings of temporaries to colors and a pseudoasm listing,
 * then produces x86 code.
 * Author: Chris Lu <czl@andrew.cmu.edu>
 * Author: Joshua Wise <jwise@andrew.cmu.edu>
 *)

signature SOLIDIFY =
sig
  type colorings = (Temp.temp * int) list
  type asm = Blarg.insn list
  
  val solidify : colorings -> asm -> asm
end

structure Solidify :> SOLIDIFY =
struct
  structure X = Blarg
  structure T = Temp
  
  type colorings = (Temp.temp * int) list
  type asm = Blarg.insn list
  
  exception Spilled

  structure TempMap = SplayMapFn(struct
                                   type ord_key = Temp.temp
                                   val compare = Temp.compare
                                 end)
  structure Tm = Temp

  fun solidify (regmap : colorings) (instrs : asm) : asm =
    let
      (* r11 and r12 is reserved for spilling *)
      val maxreg = X.regtonum X.R10
      fun numtoreg n =
          if (n > maxreg)
          then raise Spilled
          else X.numtoreg n

      val tempnums = List.foldr (fn ((t,n),b) => TempMap.insert(b,t,n)) (TempMap.empty) regmap
      fun temptonum (t: T.temp) : int = valOf (TempMap.find (tempnums, t))

      fun temptoreg (t: T.temp) : Blarg.reg =
        numtoreg (temptonum t)          
        handle Option => raise ErrorMsg.InternalError ("Uncolored temp "^(Temp.name t)^", agh!")

      val spillreg1 = X.R12
      val spillreg2 = X.R11

      (* Determine which need to be saved. *)
      val opsused = (map (fn (_, n) => X.REG (numtoreg n handle Spilled => X.R12)) regmap) @ [X.REG X.R11]
      val saveregs = X.OperSet.intersection (
        X.OperSet.addList (X.OperSet.empty, opsused),
        X.OperSet.addList (
          X.OperSet.empty,
          [X.REG X.R6,
           X.REG X.R7,
           X.REG X.R8,
           X.REG X.R9,
           X.REG X.R10,
           X.REG X.R11,
           X.REG X.R12]))
      val savelist = X.OperSet.listItems saveregs
      val nsave = length savelist

      val numreg = foldr (Int.max) 0 (map (fn (_, n) => n) regmap)    (* Number of registers used. *)
      val nspilled = Int.max (numreg - maxreg, 0)    (* Number of spilled registers. *)
      fun isspilled (X.TEMP temp) = (temptonum temp) > maxreg    (* Whether a register is spilled *)
        | isspilled (X.STACKARG _) = true
        | isspilled _ = false

      val stacksz = (nspilled + nsave) * 1
      fun stackpos (reg: int) = stacksz - (reg - maxreg + nsave) * 1    (* Stack position of some register number *)

      val prologue =
        [X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt stacksz)),
         X.INSN (X.AL, X.SUB (X.REG X.SP, X.REG X.R4))] @
        (List.concat
          (ListPair.map
            (fn (num, reg) =>
              [X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt (stacksz - 1*(num+1)))),
               X.INSN (X.AL, X.ADD (X.REG X.R4, X.REG X.SP)),
               X.INSN (X.AL, X.STO (X.REG X.R4, reg))])
            (List.tabulate (nsave, fn x => x), savelist)
          )
        )
      val epilogue =
        (List.concat
          (ListPair.map
            (fn (num, reg) =>
              [X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt (stacksz - 1*(num+1)))),
               X.INSN (X.AL, X.ADD (X.REG X.R4, X.REG X.SP)),
               X.INSN (X.AL, X.LDR (reg, X.REG X.R4))])
            (List.tabulate (nsave, fn x => x), savelist)
          )
        ) @
        [X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt stacksz)),
         X.INSN (X.AL, X.ADD (X.REG X.SP, X.REG X.R4))]
      val endlbl = Label.new()

      fun spill (X.TEMP temp, xreg: Blarg.reg) =    (* Spill a register if need be. *)
            let
              val base = X.REG X.SP
              val offs = Word.fromInt (stackpos (temptonum temp))
            in
              if (isspilled (X.TEMP temp))
                then raise ErrorMsg.InternalError "unspill not supported" (*[X.MOV ((X.REL (base, offs, 0w1), Tm.Quad), (X.REG xreg, Tm.Quad))]*)
                else nil
            end
        | spill (X.STACKARG _, _) = raise ErrorMsg.InternalError "Cannot spill to a stack arg"
        | spill _ = nil        (* Nothing else can be spilled. *)
      fun unspill (X.TEMP temp, xreg: Blarg.reg) =    (* Unspill a register if need be. *)
            let
              val base = X.REG X.SP
              val offs = Word.fromInt (stackpos (temptonum temp))
            in
              if (isspilled (X.TEMP temp))
                then raise ErrorMsg.InternalError "unspill not supported" (*[X.MOV ((X.REG xreg, Tm.Quad), (X.REL (base, offs, 0w1), Tm.Quad))]*)
                else nil
            end
        | unspill (X.STACKARG arg, xreg) =
            let
              val base = X.REG X.SP
              val offs = Word.fromInt (stacksz + 8 + (arg * 8))
            in
              (*[X.MOV ((X.REG xreg, s), (X.REL (base, offs, 0w1), s))]*)
              raise ErrorMsg.InternalError "unspill from stack not supported"
            end
        | unspill _ = nil

      fun unspill_ops (op1, op2) =
        case (isspilled op1, isspilled op2)
        of (false, false) => []
         | (true, false) => unspill (op1, spillreg1)
         | (false, true) => unspill (op2, spillreg2)
         | (true, true)  => unspill (op1, spillreg1) @ unspill (op2, spillreg2)
      
      fun respill_ops (op1, op2) =
        case (isspilled op1, isspilled op2) (* no instruction writes back to op2 *)
        of (false, _) => []
         | (true, _) => spill (op1, spillreg1)
      
      fun real_op1 op1 =
        case op1
        of (X.TEMP temp) => if isspilled op1
                            then (X.REG spillreg1)
                            else X.REG (temptoreg temp)
         | (X.STACKARG arg) => X.REG spillreg1
         | r => r
      
      fun real_ops (op1, op2) =
        (case op1
         of (X.TEMP temp) => if isspilled op1
                             then (X.REG spillreg1)
                             else X.REG (temptoreg temp)
          | (X.STACKARG arg) => X.REG spillreg1
          | r => r,
        case op2
         of (X.TEMP temp) => if isspilled op2
                             then (X.REG spillreg2)
                             else X.REG (temptoreg temp)
          | (X.STACKARG arg) => X.REG spillreg2
          | r => r)

      fun whack_insn (pred, insn, op1, op2) =
        (map (fn i => X.INSN (pred, i)) (unspill_ops (op1, op2))) @
        [ X.INSN (pred, insn (real_ops (op1, op2))) ] @
        (map (fn i => X.INSN (pred, i)) (respill_ops (op1, op2)))

      fun transform (X.DIRECTIVE s) = [X.DIRECTIVE s]
        | transform (X.COMMENT s) = [X.COMMENT s]
        | transform (X.LABEL l) = [X.LABEL l]
        | transform (X.LIVEIGN a) = transform a
        
        (* god the special cases are going to suck *)
        | transform (X.INSN (pred, X.MOVLIT (op1, w))) =
            [ X.INSN (pred, X.MOVLIT (real_op1 op1, w)) ] @
            (if isspilled op1
             then spill (op1, spillreg1)
             else [])
        | transform (X.INSN (pred, X.MOVSYM (op1, w))) =
            [ X.INSN (pred, X.MOVSYM (real_op1 op1, w)) ] @
            (if isspilled op1
             then spill (op1, spillreg1)
             else [])
        | transform (X.INSN (pred, X.MOVSTR (op1, w))) =
            [ X.INSN (pred, X.MOVSTR (real_op1 op1, w)) ] @
            (if isspilled op1
             then spill (op1, spillreg1)
             else [])
        | transform (X.INSN (pred, X.MOVLBL (op1, w))) =
            [ X.INSN (pred, X.MOVLBL (real_op1 op1, w)) ] @
            (if isspilled op1
             then spill (op1, spillreg1)
             else [])
        
        (* and here comes the boilerplate *)
        | transform (X.INSN (pred, X.LDR (op1, op2))) =  whack_insn (pred, X.LDR, op1, op2)
        | transform (X.INSN (pred, X.STO (op1, op2))) =  whack_insn (pred, X.STO, op1, op2)
        | transform (X.INSN (pred, X.MOV (op1, op2))) =  whack_insn (pred, X.MOV, op1, op2)
        | transform (X.INSN (pred, X.MOVS (op1, op2))) = whack_insn (pred, X.MOVS, op1, op2)
        | transform (X.INSN (pred, X.ADD (op1, op2))) =  whack_insn (pred, X.ADD, op1, op2)
        | transform (X.INSN (pred, X.ADDS (op1, op2))) = whack_insn (pred, X.ADDS, op1, op2)
        | transform (X.INSN (pred, X.SUB (op1, op2))) =  whack_insn (pred, X.SUB, op1, op2)
        | transform (X.INSN (pred, X.SUBS (op1, op2))) = whack_insn (pred, X.SUBS, op1, op2)
        | transform (X.INSN (pred, X.AND (op1, op2))) =  whack_insn (pred, X.AND, op1, op2)
        | transform (X.INSN (pred, X.ANDS (op1, op2))) = whack_insn (pred, X.ANDS, op1, op2)
        | transform (X.INSN (pred, X.NOT (op1, op2))) =  whack_insn (pred, X.NOT, op1, op2)
        | transform (X.INSN (pred, X.NOTS (op1, op2))) = whack_insn (pred, X.NOTS, op1, op2)
        | transform (X.INSN (pred, X.PUSH (op1, op2))) = if isspilled op2
                                                         then raise ErrorMsg.InternalError "PUSH on spilled op2 is not possible"
                                                         else [ X.INSN (pred, X.PUSH (real_ops (op1, op2))) ]
        | transform (X.INSN (pred, X.POP (X.REG X.SP, X.REG X.PC))) = [ X.INSN (pred, X.MOVLBL (X.REG X.PC, endlbl)) ] (* optimize epilogue? *)
        | transform (X.INSN (pred, X.POP (op1, op2))) =  if isspilled op2
                                                         then raise ErrorMsg.InternalError "POP on spilled op2 is not possible"
                                                         else [ X.INSN (pred, X.POP (real_ops (op1, op2))) ]
        | transform (X.INSN (pred, X.CALL (op1, op2, i))) =  if isspilled op2
                                                             then raise ErrorMsg.InternalError "CALL on spilled op2 is not possible"
                                                             else [ X.INSN (pred, X.CALL ((fn (x, y) => (x, y, i)) (real_ops (op1, op2)))) ]
        | transform (X.INSN (pred, X.SHR (op1, op2))) =  whack_insn (pred, X.SHR, op1, op2)
        | transform (X.INSN (pred, X.SHL (op1, op2))) =  whack_insn (pred, X.SHL, op1, op2)
        (*| transform _ = raise ErrorMsg.InternalError "unimplemented"*)
    in
      (*if (nsave < 2) then
        List.concat (prologue :: (map transform instrs))
      else
      *)
      List.concat (prologue ::
                   ((map transform instrs) @
                    [[X.LABEL endlbl],
                     epilogue,
                     [X.INSN (X.AL, X.POP (X.REG X.SP, X.REG X.PC))]
                    ]
                   )
                  )
    end
end
Commit	Line	Data
6ade8b0a	1	(* L3 Compiler
12aa4087 JW	2	* Takes a list of mappings of temporaries to colors and a pseudoasm listing,
12aa4087 JW	3	* then produces x86 code.
0a24e44d	4	* Author: Chris Lu <czl@andrew.cmu.edu>
12aa4087 JW	5	* Author: Joshua Wise <jwise@andrew.cmu.edu>
	6	*)
	7
	8	signature SOLIDIFY =
	9	sig
	10	type colorings = (Temp.temp * int) list
c2b45b36	11	type asm = Blarg.insn list
12aa4087 JW	12
	13	val solidify : colorings -> asm -> asm
	14	end
	15
	16	structure Solidify :> SOLIDIFY =
	17	struct
c2b45b36	18	structure X = Blarg
12aa4087 JW	19	structure T = Temp
	20
	21	type colorings = (Temp.temp * int) list
c2b45b36	22	type asm = Blarg.insn list
12aa4087 JW	23
12aa4087 JW	24	exception Spilled
5c79bb68 JW	25
	26	structure TempMap = SplayMapFn(struct
	27	type ord_key = Temp.temp
	28	val compare = Temp.compare
	29	end)
	30	structure Tm = Temp
	31
12aa4087 JW	32	fun solidify (regmap : colorings) (instrs : asm) : asm =
12aa4087 JW	33	let
c2b45b36 JW	34	(* r11 and r12 is reserved for spilling *)
c2b45b36 JW	35	val maxreg = X.regtonum X.R10
12aa4087 JW	36	fun numtoreg n =
	37	if (n > maxreg)
	38	then raise Spilled
	39	else X.numtoreg n
1144856b	40
5c79bb68 JW	41	val tempnums = List.foldr (fn ((t,n),b) => TempMap.insert(b,t,n)) (TempMap.empty) regmap
	42	fun temptonum (t: T.temp) : int = valOf (TempMap.find (tempnums, t))
	43
c2b45b36	44	fun temptoreg (t: T.temp) : Blarg.reg =
12aa4087	45	numtoreg (temptonum t)
c2b45b36	46	handle Option => raise ErrorMsg.InternalError ("Uncolored temp "^(Temp.name t)^", agh!")
6ade8b0a	47
c2b45b36 JW	48	val spillreg1 = X.R12
c2b45b36 JW	49	val spillreg2 = X.R11
6ade8b0a JW	50
6ade8b0a JW	51	(* Determine which need to be saved. *)
c2b45b36	52	val opsused = (map (fn (_, n) => X.REG (numtoreg n handle Spilled => X.R12)) regmap) @ [X.REG X.R11]
6ade8b0a JW	53	val saveregs = X.OperSet.intersection (
	54	X.OperSet.addList (X.OperSet.empty, opsused),
	55	X.OperSet.addList (
	56	X.OperSet.empty,
fe2f6717 JW	57	[X.REG X.R6,
fe2f6717 JW	58	X.REG X.R7,
c2b45b36 JW	59	X.REG X.R8,
	60	X.REG X.R9,
	61	X.REG X.R10,
	62	X.REG X.R11,
	63	X.REG X.R12]))
6ade8b0a JW	64	val savelist = X.OperSet.listItems saveregs
	65	val nsave = length savelist
	66
1144856b JW	67	val numreg = foldr (Int.max) 0 (map (fn (_, n) => n) regmap) (* Number of registers used. *)
1144856b JW	68	val nspilled = Int.max (numreg - maxreg, 0) (* Number of spilled registers. *)
c2b45b36 JW	69	fun isspilled (X.TEMP temp) = (temptonum temp) > maxreg (* Whether a register is spilled *)
c2b45b36 JW	70	\| isspilled (X.STACKARG _) = true
12aa4087	71	\| isspilled _ = false
5c79bb68	72
c2b45b36 JW	73	val stacksz = (nspilled + nsave) * 1
c2b45b36 JW	74	fun stackpos (reg: int) = stacksz - (reg - maxreg + nsave) * 1 (* Stack position of some register number *)
6ade8b0a JW	75
6ade8b0a JW	76	val prologue =
c2b45b36 JW	77	[X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt stacksz)),
	78	X.INSN (X.AL, X.SUB (X.REG X.SP, X.REG X.R4))] @
	79	(List.concat
	80	(ListPair.map
	81	(fn (num, reg) =>
	82	[X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt (stacksz - 1*(num+1)))),
	83	X.INSN (X.AL, X.ADD (X.REG X.R4, X.REG X.SP)),
	84	X.INSN (X.AL, X.STO (X.REG X.R4, reg))])
	85	(List.tabulate (nsave, fn x => x), savelist)
	86	)
	87	)
6ade8b0a	88	val epilogue =
c2b45b36 JW	89	(List.concat
	90	(ListPair.map
	91	(fn (num, reg) =>
	92	[X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt (stacksz - 1*(num+1)))),
	93	X.INSN (X.AL, X.ADD (X.REG X.R4, X.REG X.SP)),
	94	X.INSN (X.AL, X.LDR (reg, X.REG X.R4))])
	95	(List.tabulate (nsave, fn x => x), savelist)
	96	)
	97	) @
	98	[X.INSN (X.AL, X.MOVLIT (X.REG X.R4, Word.fromInt stacksz)),
	99	X.INSN (X.AL, X.ADD (X.REG X.SP, X.REG X.R4))]
6ade8b0a JW	100	val endlbl = Label.new()
6ade8b0a JW	101
c2b45b36	102	fun spill (X.TEMP temp, xreg: Blarg.reg) = (* Spill a register if need be. *)
5c79bb68	103	let
c2b45b36 JW	104	val base = X.REG X.SP
c2b45b36 JW	105	val offs = Word.fromInt (stackpos (temptonum temp))
5c79bb68	106	in
c2b45b36 JW	107	if (isspilled (X.TEMP temp))
c2b45b36 JW	108	then raise ErrorMsg.InternalError "unspill not supported" ([X.MOV ((X.REL (base, offs, 0w1), Tm.Quad), (X.REG xreg, Tm.Quad))])
5c79bb68 JW	109	else nil
5c79bb68 JW	110	end
c2b45b36	111	\| spill (X.STACKARG _, _) = raise ErrorMsg.InternalError "Cannot spill to a stack arg"
5c79bb68	112	\| spill _ = nil (* Nothing else can be spilled. *)
c2b45b36	113	fun unspill (X.TEMP temp, xreg: Blarg.reg) = (* Unspill a register if need be. *)
5c79bb68	114	let
c2b45b36 JW	115	val base = X.REG X.SP
c2b45b36 JW	116	val offs = Word.fromInt (stackpos (temptonum temp))
5c79bb68	117	in
c2b45b36 JW	118	if (isspilled (X.TEMP temp))
c2b45b36 JW	119	then raise ErrorMsg.InternalError "unspill not supported" ([X.MOV ((X.REG xreg, Tm.Quad), (X.REL (base, offs, 0w1), Tm.Quad))])
5c79bb68 JW	120	else nil
5c79bb68 JW	121	end
c2b45b36	122	\| unspill (X.STACKARG arg, xreg) =
5c79bb68	123	let
c2b45b36 JW	124	val base = X.REG X.SP
c2b45b36 JW	125	val offs = Word.fromInt (stacksz + 8 + (arg * 8))
5c79bb68	126	in
c2b45b36 JW	127	([X.MOV ((X.REG xreg, s), (X.REL (base, offs, 0w1), s))])
c2b45b36 JW	128	raise ErrorMsg.InternalError "unspill from stack not supported"
5c79bb68	129	end
5c79bb68 JW	130	\| unspill _ = nil
5c79bb68 JW	131
c2b45b36 JW	132	fun unspill_ops (op1, op2) =
	133	case (isspilled op1, isspilled op2)
	134	of (false, false) => []
	135	\| (true, false) => unspill (op1, spillreg1)
	136	\| (false, true) => unspill (op2, spillreg2)
	137	\| (true, true) => unspill (op1, spillreg1) @ unspill (op2, spillreg2)
	138
	139	fun respill_ops (op1, op2) =
	140	case (isspilled op1, isspilled op2) (* no instruction writes back to op2 *)
	141	of (false, _) => []
	142	\| (true, _) => spill (op1, spillreg1)
	143
	144	fun real_op1 op1 =
	145	case op1
	146	of (X.TEMP temp) => if isspilled op1
	147	then (X.REG spillreg1)
	148	else X.REG (temptoreg temp)
	149	\| (X.STACKARG arg) => X.REG spillreg1
	150	\| r => r
	151
	152	fun real_ops (op1, op2) =
	153	(case op1
	154	of (X.TEMP temp) => if isspilled op1
	155	then (X.REG spillreg1)
	156	else X.REG (temptoreg temp)
	157	\| (X.STACKARG arg) => X.REG spillreg1
	158	\| r => r,
	159	case op2
	160	of (X.TEMP temp) => if isspilled op2
	161	then (X.REG spillreg2)
	162	else X.REG (temptoreg temp)
	163	\| (X.STACKARG arg) => X.REG spillreg2
	164	\| r => r)
	165
	166	fun whack_insn (pred, insn, op1, op2) =
	167	(map (fn i => X.INSN (pred, i)) (unspill_ops (op1, op2))) @
	168	[ X.INSN (pred, insn (real_ops (op1, op2))) ] @
	169	(map (fn i => X.INSN (pred, i)) (respill_ops (op1, op2)))
1144856b	170
12aa4087 JW	171	fun transform (X.DIRECTIVE s) = [X.DIRECTIVE s]
12aa4087 JW	172	\| transform (X.COMMENT s) = [X.COMMENT s]
c2b45b36	173	\| transform (X.LABEL l) = [X.LABEL l]
6ade8b0a	174	\| transform (X.LIVEIGN a) = transform a
c2b45b36 JW	175
	176	(* god the special cases are going to suck *)
	177	\| transform (X.INSN (pred, X.MOVLIT (op1, w))) =
	178	[ X.INSN (pred, X.MOVLIT (real_op1 op1, w)) ] @
	179	(if isspilled op1
	180	then spill (op1, spillreg1)
	181	else [])
	182	\| transform (X.INSN (pred, X.MOVSYM (op1, w))) =
	183	[ X.INSN (pred, X.MOVSYM (real_op1 op1, w)) ] @
	184	(if isspilled op1
	185	then spill (op1, spillreg1)
	186	else [])
5c90fbb8 JW	187	\| transform (X.INSN (pred, X.MOVSTR (op1, w))) =
	188	[ X.INSN (pred, X.MOVSTR (real_op1 op1, w)) ] @
	189	(if isspilled op1
	190	then spill (op1, spillreg1)
	191	else [])
c2b45b36 JW	192	\| transform (X.INSN (pred, X.MOVLBL (op1, w))) =
	193	[ X.INSN (pred, X.MOVLBL (real_op1 op1, w)) ] @
	194	(if isspilled op1
	195	then spill (op1, spillreg1)
	196	else [])
	197
	198	(* and here comes the boilerplate *)
	199	\| transform (X.INSN (pred, X.LDR (op1, op2))) = whack_insn (pred, X.LDR, op1, op2)
	200	\| transform (X.INSN (pred, X.STO (op1, op2))) = whack_insn (pred, X.STO, op1, op2)
	201	\| transform (X.INSN (pred, X.MOV (op1, op2))) = whack_insn (pred, X.MOV, op1, op2)
	202	\| transform (X.INSN (pred, X.MOVS (op1, op2))) = whack_insn (pred, X.MOVS, op1, op2)
	203	\| transform (X.INSN (pred, X.ADD (op1, op2))) = whack_insn (pred, X.ADD, op1, op2)
	204	\| transform (X.INSN (pred, X.ADDS (op1, op2))) = whack_insn (pred, X.ADDS, op1, op2)
	205	\| transform (X.INSN (pred, X.SUB (op1, op2))) = whack_insn (pred, X.SUB, op1, op2)
	206	\| transform (X.INSN (pred, X.SUBS (op1, op2))) = whack_insn (pred, X.SUBS, op1, op2)
	207	\| transform (X.INSN (pred, X.AND (op1, op2))) = whack_insn (pred, X.AND, op1, op2)
	208	\| transform (X.INSN (pred, X.ANDS (op1, op2))) = whack_insn (pred, X.ANDS, op1, op2)
	209	\| transform (X.INSN (pred, X.NOT (op1, op2))) = whack_insn (pred, X.NOT, op1, op2)
	210	\| transform (X.INSN (pred, X.NOTS (op1, op2))) = whack_insn (pred, X.NOTS, op1, op2)
	211	\| transform (X.INSN (pred, X.PUSH (op1, op2))) = if isspilled op2
	212	then raise ErrorMsg.InternalError "PUSH on spilled op2 is not possible"
	213	else [ X.INSN (pred, X.PUSH (real_ops (op1, op2))) ]
	214	\| transform (X.INSN (pred, X.POP (X.REG X.SP, X.REG X.PC))) = [ X.INSN (pred, X.MOVLBL (X.REG X.PC, endlbl)) ] (* optimize epilogue? *)
	215	\| transform (X.INSN (pred, X.POP (op1, op2))) = if isspilled op2
	216	then raise ErrorMsg.InternalError "POP on spilled op2 is not possible"
	217	else [ X.INSN (pred, X.POP (real_ops (op1, op2))) ]
	218	\| transform (X.INSN (pred, X.CALL (op1, op2, i))) = if isspilled op2
	219	then raise ErrorMsg.InternalError "CALL on spilled op2 is not possible"
	220	else [ X.INSN (pred, X.CALL ((fn (x, y) => (x, y, i)) (real_ops (op1, op2)))) ]
	221	\| transform (X.INSN (pred, X.SHR (op1, op2))) = whack_insn (pred, X.SHR, op1, op2)
	222	\| transform (X.INSN (pred, X.SHL (op1, op2))) = whack_insn (pred, X.SHL, op1, op2)
	223	(\| transform _ = raise ErrorMsg.InternalError "unimplemented")
12aa4087	224	in
c2b45b36	225	(*if (nsave < 2) then
6ade8b0a JW	226	List.concat (prologue :: (map transform instrs))
6ade8b0a JW	227	else
c2b45b36 JW	228	*)
	229	List.concat (prologue ::
	230	((map transform instrs) @
	231	[[X.LABEL endlbl],
	232	epilogue,
	233	[X.INSN (X.AL, X.POP (X.REG X.SP, X.REG X.PC))]
	234	]
	235	)
	236	)
12aa4087 JW	237	end
12aa4087 JW	238	end