1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
|
(* ppcProps.sml
*
* COPYRIGHT (c) 2002 Bell Labs, Lucent Technologies
*)
functor PPCProps
( structure PPCInstr : PPCINSTR
structure MLTreeEval : MLTREE_EVAL (* where T = PPCInstr.T *)
where type T.Basis.cond = PPCInstr.T.Basis.cond
and type T.Basis.div_rounding_mode = PPCInstr.T.Basis.div_rounding_mode
and type T.Basis.ext = PPCInstr.T.Basis.ext
and type T.Basis.fcond = PPCInstr.T.Basis.fcond
and type T.Basis.rounding_mode = PPCInstr.T.Basis.rounding_mode
and type T.Constant.const = PPCInstr.T.Constant.const
and type ('s,'r,'f,'c) T.Extension.ccx = ('s,'r,'f,'c) PPCInstr.T.Extension.ccx
and type ('s,'r,'f,'c) T.Extension.fx = ('s,'r,'f,'c) PPCInstr.T.Extension.fx
and type ('s,'r,'f,'c) T.Extension.rx = ('s,'r,'f,'c) PPCInstr.T.Extension.rx
and type ('s,'r,'f,'c) T.Extension.sx = ('s,'r,'f,'c) PPCInstr.T.Extension.sx
and type T.I.div_rounding_mode = PPCInstr.T.I.div_rounding_mode
and type T.Region.region = PPCInstr.T.Region.region
and type T.ccexp = PPCInstr.T.ccexp
and type T.fexp = PPCInstr.T.fexp
(* and type T.labexp = PPCInstr.T.labexp *)
and type T.mlrisc = PPCInstr.T.mlrisc
and type T.oper = PPCInstr.T.oper
and type T.rep = PPCInstr.T.rep
and type T.rexp = PPCInstr.T.rexp
and type T.stm = PPCInstr.T.stm
structure MLTreeHash : MLTREE_HASH (* where T = PPCInstr.T *)
where type T.Basis.cond = PPCInstr.T.Basis.cond
and type T.Basis.div_rounding_mode = PPCInstr.T.Basis.div_rounding_mode
and type T.Basis.ext = PPCInstr.T.Basis.ext
and type T.Basis.fcond = PPCInstr.T.Basis.fcond
and type T.Basis.rounding_mode = PPCInstr.T.Basis.rounding_mode
and type T.Constant.const = PPCInstr.T.Constant.const
and type ('s,'r,'f,'c) T.Extension.ccx = ('s,'r,'f,'c) PPCInstr.T.Extension.ccx
and type ('s,'r,'f,'c) T.Extension.fx = ('s,'r,'f,'c) PPCInstr.T.Extension.fx
and type ('s,'r,'f,'c) T.Extension.rx = ('s,'r,'f,'c) PPCInstr.T.Extension.rx
and type ('s,'r,'f,'c) T.Extension.sx = ('s,'r,'f,'c) PPCInstr.T.Extension.sx
and type T.I.div_rounding_mode = PPCInstr.T.I.div_rounding_mode
and type T.Region.region = PPCInstr.T.Region.region
and type T.ccexp = PPCInstr.T.ccexp
and type T.fexp = PPCInstr.T.fexp
(* and type T.labexp = PPCInstr.T.labexp *)
and type T.mlrisc = PPCInstr.T.mlrisc
and type T.oper = PPCInstr.T.oper
and type T.rep = PPCInstr.T.rep
and type T.rexp = PPCInstr.T.rexp
and type T.stm = PPCInstr.T.stm
) : INSN_PROPERTIES =
struct
structure I = PPCInstr
structure C = I.C
structure T = I.T
structure CB = CellsBasis
exception NegateConditional
fun error msg = MLRiscErrorMsg.error("PPCProps",msg)
datatype kind = IK_JUMP | IK_NOP | IK_INSTR | IK_COPY | IK_CALL
| IK_CALL_WITH_CUTS | IK_PHI | IK_SOURCE | IK_SINK
datatype target = LABELLED of Label.label | FALLTHROUGH | ESCAPES
(* This stupid architecture doesn't really have a dedicated zero register *)
fun zeroR() = C.Reg CB.GP 0
fun instrKind(I.ANNOTATION{i, ...}) = instrKind i
| instrKind(I.COPY _) = IK_COPY
| instrKind(I.INSTR instr) = let
fun eqTest to = Word.andb(Word.fromInt to, 0w4) <> 0w0
fun trapAlways{to, ra, si} =
(case si
of I.RegOp rb =>
if CellsBasis.sameColor(ra,rb) andalso eqTest(to) then IK_JUMP
else IK_INSTR
| I.ImmedOp 0 =>
if CellsBasis.registerId ra = 0 andalso eqTest(to) then IK_JUMP
else IK_INSTR
| _ => error "trapAlways: neither RegOp nor ImmedOp(0)"
(*esac*))
in
case instr
of (I.BC _) => IK_JUMP
| (I.BCLR _) => IK_JUMP
| (I.B _) => IK_JUMP
| (I.TW t) => trapAlways(t)
| (I.TD t) => trapAlways(t)
| (I.ARITHI{oper=I.ORI, rt, ra, im=I.ImmedOp 0}) =>
if CB.registerId rt = 0 andalso CB.registerId ra = 0 then IK_NOP
else IK_INSTR
| (I.CALL{cutsTo=_::_,...}) => IK_CALL_WITH_CUTS
| (I.CALL _) => IK_CALL
| (I.PHI _) => IK_PHI
| (I.SOURCE _) => IK_SOURCE
| (I.SINK _) => IK_SINK
| _ => IK_INSTR
(*esac*)
end
| instrKind _ = error "instrKind"
fun moveInstr(I.COPY _) = true
| moveInstr(I.ANNOTATION{i,...}) = moveInstr i
| moveInstr _ = false
fun nop () = I.arithi{oper=I.ORI, rt=zeroR(), ra=zeroR(), im=I.ImmedOp 0}
fun moveTmpR(I.COPY{tmp, ...}) =
(case tmp
of SOME(I.Direct r) => SOME r
| SOME(I.FDirect f) => SOME f
| _ => NONE
(*esac*))
| moveTmpR(I.ANNOTATION{i,...}) = moveTmpR i
| moveTmpR _ = NONE
fun moveDstSrc(I.COPY{dst,src,...}) = (dst,src)
| moveDstSrc(I.ANNOTATION{i,...}) = moveDstSrc i
| moveDstSrc _ = error "moveDstSrc"
fun branchTargets(I.INSTR(I.BC{bo=I.ALWAYS, addr, ...})) =
(case addr
of I.LabelOp(T.LABEL lab) => [LABELLED lab]
| _ => error "branchTargets:BC:ALWAYS"
(*esac*))
| branchTargets(I.INSTR(I.BC{addr, ...})) =
(case addr
of I.LabelOp(T.LABEL lab) => [LABELLED lab, FALLTHROUGH]
| _ => error "branchTargets:BC"
(*esac*))
| branchTargets(I.INSTR(I.BCLR{labels, bo=I.ALWAYS, ...})) =
(case labels of [] => [ESCAPES] | _ => map LABELLED labels)
| branchTargets(I.INSTR(I.BCLR{labels, ...})) =
(case labels of [] => [ESCAPES, FALLTHROUGH] | _ => map LABELLED labels)
| branchTargets(I.INSTR(I.B{addr=I.LabelOp(T.LABEL lab), LK})) = [LABELLED lab]
| branchTargets(I.INSTR(I.CALL{cutsTo, ...})) = FALLTHROUGH::map LABELLED cutsTo
| branchTargets(I.INSTR(I.TD _)) = [ESCAPES]
| branchTargets(I.INSTR(I.TW _)) = [ESCAPES]
| branchTargets(I.ANNOTATION{i,...}) = branchTargets i
| branchTargets _ = error "branchTargets"
fun labelOp l = I.LabelOp(T.LABEL l)
fun setJumpTarget(I.ANNOTATION{a,i}, l) = I.ANNOTATION{a=a, i=setJumpTarget(i,l)}
| setJumpTarget(I.INSTR(I.BC{bo as I.ALWAYS, bf, bit, addr, fall, LK}), lab) =
I.bc{bo=bo, bf=bf, bit=bit, fall=fall, LK=LK, addr=labelOp lab}
| setJumpTarget(I.INSTR(I.B{addr, LK}), lab) = I.b{addr=labelOp(lab), LK=LK}
| setJumpTarget _ = error "setJumpTarget"
fun setBranchTargets{i=I.ANNOTATION{a,i}, t, f} =
I.ANNOTATION{a=a, i=setBranchTargets{i=i, t=t, f=f}}
| setBranchTargets{i=I.INSTR(I.BC{bo=I.ALWAYS, bf, bit, addr, fall, LK}), ...} =
error "setBranchTargets"
| setBranchTargets{i=I.INSTR(I.BC{bo, bf, bit, addr, fall, LK}), t, f} =
I.bc{bo=bo, bf=bf, bit=bit, LK=LK, addr=labelOp t, fall=labelOp f}
| setBranchTargets _ = error "setBranchTargets"
fun jump lab = I.b{addr=I.LabelOp(T.LABEL lab), LK=false}
fun negateConditional(I.ANNOTATION{a,i}, l) =
I.ANNOTATION{a=a, i=negateConditional(i, l)}
| negateConditional(I.INSTR(I.BC{bo, bf, bit, addr, fall, LK}), lab) = let
val bo' = (case bo
of I.TRUE => I.FALSE
| I.FALSE => I.TRUE
| I.ALWAYS => error "negateCondtional: ALWAYS"
| I.COUNTER{eqZero, cond=NONE} => I.COUNTER{eqZero=not eqZero, cond=NONE}
| I.COUNTER{eqZero, cond=SOME b} => error "negateConditional: COUNTER"
(*esac*))
in
I.bc{bo=bo', bf=bf, bit=bit, addr=labelOp lab, fall=fall, LK=LK}
end
| negateConditional _ = error "negateConditional"
val immedRange = {lo= ~32768, hi=32767}
fun loadImmed{immed,t} =
I.arithi
{oper=I.ADDI, rt=t, ra=zeroR(),
im=if #lo immedRange <= immed andalso immed <= #hi immedRange
then I.ImmedOp immed else I.LabelOp(I.T.LI(IntInf.fromInt immed))}
fun loadOperand{opn,t} =
I.arithi{oper=I.ADDI, rt=t, ra=zeroR(), im=opn}
fun hashOpn(I.RegOp r) = CB.hashCell r
| hashOpn(I.ImmedOp i) = Word.fromInt i
| hashOpn(I.LabelOp l) = MLTreeHash.hash l
fun eqOpn(I.RegOp a,I.RegOp b) = CB.sameColor(a,b)
| eqOpn(I.ImmedOp a,I.ImmedOp b) = a = b
| eqOpn(I.LabelOp a,I.LabelOp b) = MLTreeEval.==(a,b)
| eqOpn _ = false
fun defUseR instr = let
fun ppcDU instr = let
fun operand(I.RegOp r,use) = r::use
| operand(_,use) = use
in
case instr
of I.L{rt, ra, d, ...} => ([rt], operand(d,[ra]))
| I.LF{ra, d, ...} => ([], operand(d,[ra]))
| I.ST{rs, ra, d, ...} => ([], operand(d,[rs,ra]))
| I.STF{ra, d, ...} => ([], operand(d,[ra]))
| I.UNARY{rt, ra, ...} => ([rt], [ra])
| I.ARITH{rt, ra, rb, ...} => ([rt], [ra,rb])
| I.ARITHI{rt, ra, im, ...} => ([rt], operand(im,[ra]))
| I.ROTATE{ra, rs, sh, ...} => ([ra], [rs,sh])
| I.ROTATEI{ra, rs, sh, ...} => ([ra], operand(sh,[rs]))
| I.COMPARE{ra, rb, ...} => ([], operand(rb,[ra]))
| I.MTSPR{rs, ...} => ([], [rs])
| I.MFSPR{rt, ...} => ([rt], [])
| I.TW{to, ra, si} => ([], operand(si,[ra]))
| I.TD{to, ra, si} => ([], operand(si,[ra]))
| I.CALL{def, use, ...} => (C.getReg def, C.getReg use)
| I.LWARX{rt, ra, rb, ...} => ([rt], [ra, rb])
| I.STWCX{rs, ra, rb, ...} => ([], [rs, ra, rb])
| _ => ([], [])
end
in
case instr
of I.ANNOTATION{i, ...} => defUseR i
| I.LIVE{regs, ...} => ([], C.getReg regs)
| I.KILL{regs, ...} => (C.getReg regs, [])
| I.INSTR(i) => ppcDU(i)
| I.COPY{k, dst, src, tmp, ...} => let
val (d,u) = case k of CB.GP => (dst, src) | _ => ([], [])
in
case tmp
of SOME(I.Direct r) => (r::d, u)
| SOME(I.Displace{base, ...}) => (d, base::u)
| _ => (d,u)
end
end
fun defUseF instr = let
fun ppcDU instr =
(case instr
of I.LF{ft, ...} => ([ft],[])
| I.STF{fs, ...} => ([], [fs])
| I.FCOMPARE{fa, fb, ...} => ([], [fa, fb])
| I.FUNARY{ft, fb, ...} => ([ft], [fb])
| I.FARITH{ft, fa, fb, ...} => ([ft], [fa, fb])
| I.FARITH3{ft, fa, fb, fc, ...} => ([ft], [fa, fb, fc])
| I.CALL{def, use, ...} => (C.getFreg def,C.getFreg use)
| _ => ([], [])
(*esac*))
in
case instr
of I.ANNOTATION{i, ...} => defUseF i
| I.LIVE{regs, ...} => ([], C.getFreg regs)
| I.KILL{regs, ...} => (C.getFreg regs, [])
| I.INSTR(i) => ppcDU(i)
| I.COPY{k, dst, src, tmp, ...} => let
val (d, u) = case k of CB.FP => (dst, src) | _ => ([],[])
in
case tmp
of SOME(I.FDirect f) => (f::d, u)
| _ => (d, u)
end
end
fun defUseCC instr = error "defUseCC: not implemented"
fun defUse CB.GP = defUseR
| defUse CB.FP = defUseF
| defUse CB.CC = defUseCC
| defUse _ = error "defUse"
(*========================================================================
* Annotations
*========================================================================*)
fun getAnnotations(I.ANNOTATION{i,a}) =
let val (i,an) = getAnnotations i in (i,a::an) end
| getAnnotations i = (i,[])
fun annotate(i,a) = I.ANNOTATION{i=i,a=a}
(*========================================================================
* Replicate an instruction
*========================================================================*)
fun replicate(I.ANNOTATION{i,a}) = I.ANNOTATION{i=replicate i,a=a}
| replicate(I.COPY{k, sz, tmp=SOME _, dst, src}) =
I.COPY{k=k, sz=sz, tmp=SOME(I.Direct(C.newReg())), dst=dst, src=src}
| replicate i = i
end
|
