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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
|
(* hppaJumps.sml --- information to resolve jumps.
*
* COPYRIGHT (c) 1996 Bell Laboratories.
*
*)
functor HppaJumps
( structure Instr:HPPAINSTR
structure Shuffle:HPPASHUFFLE (* where I = Instr *)
where type I.Constant.const = Instr.Constant.const
and type I.Region.region = Instr.Region.region
and type I.T.Basis.cond = Instr.T.Basis.cond
and type I.T.Basis.div_rounding_mode = Instr.T.Basis.div_rounding_mode
and type I.T.Basis.ext = Instr.T.Basis.ext
and type I.T.Basis.fcond = Instr.T.Basis.fcond
and type I.T.Basis.rounding_mode = Instr.T.Basis.rounding_mode
and type ('s,'r,'f,'c) I.T.Extension.ccx = ('s,'r,'f,'c) Instr.T.Extension.ccx
and type ('s,'r,'f,'c) I.T.Extension.fx = ('s,'r,'f,'c) Instr.T.Extension.fx
and type ('s,'r,'f,'c) I.T.Extension.rx = ('s,'r,'f,'c) Instr.T.Extension.rx
and type ('s,'r,'f,'c) I.T.Extension.sx = ('s,'r,'f,'c) Instr.T.Extension.sx
and type I.T.I.div_rounding_mode = Instr.T.I.div_rounding_mode
and type I.T.ccexp = Instr.T.ccexp
and type I.T.fexp = Instr.T.fexp
(* and type I.T.labexp = Instr.T.labexp *)
and type I.T.mlrisc = Instr.T.mlrisc
and type I.T.oper = Instr.T.oper
and type I.T.rep = Instr.T.rep
and type I.T.rexp = Instr.T.rexp
and type I.T.stm = Instr.T.stm
and type I.addressing_mode = Instr.addressing_mode
and type I.arith = Instr.arith
and type I.arithi = Instr.arithi
and type I.bcond = Instr.bcond
and type I.bitcond = Instr.bitcond
and type I.cmp = Instr.cmp
and type I.cmpi = Instr.cmpi
and type I.ea = Instr.ea
and type I.farith = Instr.farith
and type I.fcnv = Instr.fcnv
and type I.fcond = Instr.fcond
and type I.field_selector = Instr.field_selector
and type I.fload = Instr.fload
and type I.floadx = Instr.floadx
and type I.fmt = Instr.fmt
and type I.fstore = Instr.fstore
and type I.fstorex = Instr.fstorex
and type I.funary = Instr.funary
and type I.instr = Instr.instr
and type I.instruction = Instr.instruction
and type I.load = Instr.load
and type I.loadi = Instr.loadi
and type I.operand = Instr.operand
and type I.scond = Instr.scond
and type I.shift = Instr.shift
and type I.shiftv = Instr.shiftv
and type I.store = Instr.store
structure MLTreeEval : MLTREE_EVAL (* where T = Instr.T *)
where type T.Basis.cond = Instr.T.Basis.cond
and type T.Basis.div_rounding_mode = Instr.T.Basis.div_rounding_mode
and type T.Basis.ext = Instr.T.Basis.ext
and type T.Basis.fcond = Instr.T.Basis.fcond
and type T.Basis.rounding_mode = Instr.T.Basis.rounding_mode
and type T.Constant.const = Instr.T.Constant.const
and type ('s,'r,'f,'c) T.Extension.ccx = ('s,'r,'f,'c) Instr.T.Extension.ccx
and type ('s,'r,'f,'c) T.Extension.fx = ('s,'r,'f,'c) Instr.T.Extension.fx
and type ('s,'r,'f,'c) T.Extension.rx = ('s,'r,'f,'c) Instr.T.Extension.rx
and type ('s,'r,'f,'c) T.Extension.sx = ('s,'r,'f,'c) Instr.T.Extension.sx
and type T.I.div_rounding_mode = Instr.T.I.div_rounding_mode
and type T.Region.region = Instr.T.Region.region
and type T.ccexp = Instr.T.ccexp
and type T.fexp = Instr.T.fexp
(* and type T.labexp = Instr.T.labexp *)
and type T.mlrisc = Instr.T.mlrisc
and type T.oper = Instr.T.oper
and type T.rep = Instr.T.rep
and type T.rexp = Instr.T.rexp
and type T.stm = Instr.T.stm
) : SDI_JUMPS =
struct
structure I = Instr
structure C = Instr.C
structure Const = I.Constant
structure CB = CellsBasis
fun error msg = MLRiscErrorMsg.error("HppaJumps",msg)
val branchDelayedArch = false
fun minSize(I.INSTR(I.FBRANCH _)) = 12 (* FCMP/FTEST/B *)
| minSize(I.INSTR(I.BLR{labs,...})) = 8 + 8 * length labs (* FCMP/FTEST/B *)
| minSize(I.ANNOTATION{i,...}) = minSize i
| minSize(I.LIVE _) = 0
| minSize(I.KILL _) = 0
| minSize(I.COPY _) = 0
| minSize(I.INSTR(I.COMCLR_LDO _)) = 8
| minSize(I.INSTR(I.COMICLR_LDO _)) = 8
| minSize _ = 4
fun maxSize (I.INSTR(I.BCOND _)) = 16 (* BCOND+LONGJUMP *)
| maxSize (I.INSTR(I.BCONDI _)) = 16 (* BCONDI+LONGJUMP *)
| maxSize (I.INSTR(I.BB _)) = 16 (* BB+LONGJUMP *)
| maxSize (I.INSTR(I.B _)) = 12 (* LONGJUMP *)
| maxSize (I.INSTR(I.FBRANCH _))= 20
| maxSize (I.ANNOTATION{i,...}) = maxSize i
| maxSize _ = 4
fun isSdi(I.ANNOTATION{i,...}) = isSdi i
| isSdi(I.LIVE _) = true
| isSdi(I.KILL _) = true
| isSdi(I.COPY _) = true
| isSdi(I.INSTR instr) = let
fun opnd (I.LabExp _) = true
| opnd _ = false
in
case instr
of I.BCOND _ => true
| I.BCONDI _ => true
| I.BB _ => true
| I.B _ => true
| I.FBRANCH _ => true
| I.BLR _ => true
| I.LDO{i, ...} => opnd i
| I.STORE{d, ...} => opnd d
| I.ARITHI{i, ...} => opnd i
| I.LOADI{i, ...} => opnd i
| I.COMICLR_LDO{i1, ...} => opnd i1
| _ => false
end
fun im11 n = ~1024 <= n andalso n < 1024
fun im12 n = ~2048 <= n andalso n < 2048
fun im14 n = ~8192 <= n andalso n < 8192
fun im17 n = ~65536 <= n andalso n < 65536
fun sdiSize(I.ANNOTATION{i, ...}, labMap, loc) = sdiSize(i, labMap, loc)
| sdiSize(I.LIVE _, _, _) = 0
| sdiSize(I.KILL _, _, _) = 0
| sdiSize(I.COPY{k=CB.GP, dst, src, tmp, ...}, _, _) =
4 * length(Shuffle.shuffle{tmp=tmp, dst=dst, src=src})
| sdiSize(I.COPY{k=CB.FP, dst, src, tmp, ...}, _, _) =
4 * length(Shuffle.shufflefp{tmp=tmp, dst=dst, src=src})
| sdiSize(I.INSTR(instr), labMap, loc) = let
fun branchOffset lab = ((labMap lab) - loc - 8) div 4
fun branch(lab,nop) = let
val offset = branchOffset lab
in
if im12 offset then
if nop then 8 else 4
else if im17 offset then 8 else 16
end
fun memDisp(c, short, long) = if im14(c) then short else long
in
case instr
of I.LDO{i=I.LabExp(lexp, _), ...} => memDisp(MLTreeEval.valueOf lexp, 4, 12)
| I.LOADI{i=I.LabExp(lexp, _), ...} => memDisp(MLTreeEval.valueOf lexp, 4, 12)
| I.STORE{d=I.LabExp(lexp, _), ...} => memDisp(MLTreeEval.valueOf lexp, 4, 12)
| I.COMICLR_LDO{i1=I.LabExp(lexp,_), ...} =>
if im11(MLTreeEval.valueOf lexp) then 8 else 16
| I.ARITHI{ai, i=I.LabExp(lexp,_), ...} => let
fun arithImmed() = if im11(MLTreeEval.valueOf lexp) then 4 else 12
in
case ai
of I.ADDI => arithImmed()
| I.ADDIO => arithImmed()
| I.SUBI => arithImmed()
| I.SUBIO => arithImmed()
| _ => error "sdiSize: ARITHI LabelExp"
(*esac*)
end
| I.BCOND{t, nop, ...} => branch(t,nop)
| I.BCONDI{t, nop, ...} => branch(t,nop)
| I.BB{t, nop, ...} => branch(t,nop)
| I.B{lab, ...} => if im17 (branchOffset lab) then 4 else 12
| I.FBRANCH{t, ...} => if im17 (branchOffset t) then 12 else 20
| I.BLR{labs,...} => let
val l = length labs * 8
fun badOffsets(t::ts,n) =
not(im17(branchOffset t + n)) orelse badOffsets(ts,n+2)
| badOffsets([],n) = false
in l + (if badOffsets(labs,2) then 20 else 8)
end
| _ => error "sdiSize"
end
| sdiSize _ = error "SdiSize"
(* Note: A better sequence would be to use ADDIL, however
* the expansion is done after register allocation and
* ADDIL defines %r1.
*)
(*
fun longJump{lab, n} = let
val baseDisp = LE.MINUS(LE.LABEL lab, LE.INT 8192)
val labOpnd = (baseDisp, I.T)
val baseptrR = 8
in
[I.LDIL{i=I.HILabExp labOpnd, t=C.asmTmpR},
I.LDO{i=I.LOLabExp labOpnd, b=C.asmTmpR, t=C.asmTmpR},
I.ARITH{a=I.ADD, r1=baseptrR, r2=C.asmTmpR, t=C.asmTmpR},
I.BV{x=0, labs=[lab], b=C.asmTmpR, n=n}]
end
*)
fun longJump{lab, n} =
(print "longJump used\n";
[I.longjump{lab=lab, tmpLab=Label.anon(), n=n, tmp=C.asmTmpR}]
)
fun split11 n = let
val w = Word.fromInt(n)
in (Word.toIntX(Word.~>>(w, 0w11)), Word.toIntX(Word.andb(w, 0wx7ff)))
end
fun split11X n = let
val w = Word.fromInt(n)
val hi' = Word.~>>(w, 0w11)
val lo' = Word.andb(w, 0wx7ff)
val (hi,lo) =
if Word.<=(lo', 0wx3ff) then (hi', lo') else (hi'+0w1, lo'-0wx800)
in (Word.toIntX hi, Word.toIntX lo)
end
fun loadIndexed I.LDW = I.LDWX
| loadIndexed I.LDH = I.LDHX
| loadIndexed I.LDB = I.LDBX
fun expand(I.ANNOTATION{i,...},size,pos) = expand(i,size,pos)
| expand(I.LIVE _, _, _) = []
| expand(I.KILL _, _, _) = []
| expand(I.COPY{k=CB.GP, dst, src, tmp, ...}, _, _) =
Shuffle.shuffle{tmp=tmp, dst=dst, src=src}
| expand(I.COPY{k=CB.FP, dst, src, tmp, ...}, _, _) =
Shuffle.shufflefp{tmp=tmp, dst=dst, src=src}
| expand(instr as I.INSTR(i), size, pos) =
(case i
of I.LDO{i=I.LabExp lexp, t, b} =>
(case size
of 4 => [instr]
| 12 => [I.ldil{i=I.HILabExp lexp, t=C.asmTmpR},
I.ldo{i=I.LOLabExp lexp, b=C.asmTmpR, t=C.asmTmpR},
I.arith{a=I.ADD, r1=C.asmTmpR, r2=b, t=t}]
| _ => error "LDO"
(*esac*))
| I.COMICLR_LDO{cc, i1=I.LabExp lexp, r2, t1, b, i2, t2} =>
(case size
of 8 => [instr]
| 16 =>
[I.ldil{i=I.HILabExp lexp, t=C.asmTmpR},
I.ldo{i=I.LOLabExp lexp, b=C.asmTmpR, t=C.asmTmpR},
I.comclr_ldo{cc=cc, r1=C.asmTmpR, r2=r2, t1=t1,
b=b, i=i2, t2=t2}
]
| _ => error "COMICLR_LDO"
(*esac*))
| I.STORE{st, d as I.LabExp lexp, b, r, mem} =>
(case size
of 4 => [instr]
| 12 =>
[I.ldil{i=I.HILabExp lexp, t=C.asmTmpR},
I.arith{a=I.ADD, r1=C.asmTmpR, r2=b, t=C.asmTmpR},
I.store{st=st, b=C.asmTmpR, d=I.LOLabExp lexp, r=r, mem=mem}]
| _ => error "STORE"
(*esac*))
| I.STORE _ => error "expand:STORE"
| I.ARITHI{ai, r, i=I.LabExp lexp, t} =>
(case size
of 4 => [instr]
| 12 =>
(* Note: A better sequence would be to use ADDIL, however
* the expansion is done after register allocation and
* ADDIL defines %r1.
*)
[I.ldil{i=I.HILabExp lexp, t=C.asmTmpR},
I.ldo{i=I.LOLabExp lexp, b=C.asmTmpR, t=C.asmTmpR},
I.arith{
a = case ai of I.ADDI => I.ADD | I.ADDIO => I.ADDO
| I.SUBI => I.SUB | I.SUBIO => I.SUBO
| _ => error "expand: I.ARITHI LabExp",
t=t,
r1=C.asmTmpR,
r2=r}]
| _ => error "ARITHI"
(*esac*))
| I.LOADI{li, r, i=I.LabExp lexp, t, mem} =>
(case size
of 4 => [instr]
| 12 => [I.ldil{i=I.HILabExp lexp, t=C.asmTmpR},
I.arith{a=I.ADD, r1=C.asmTmpR, r2=r, t=C.asmTmpR},
I.loadi{li=li, r=C.asmTmpR, i=I.LOLabExp lexp, t=t, mem=mem}]
| _ => error "LOADI"
(*esac*))
| I.BCOND{cmp,bc, t, f, r1, r2, n, nop} => let
fun rev I.COMBT=I.bcond{cmp=I.COMBF,bc=bc,t=f,f=f,r1=r1,r2=r2,n=true,nop=false}
| rev I.COMBF=I.bcond{cmp=I.COMBT,bc=bc,t=f,f=f,r1=r1,r2=r2,n=true,nop=false}
in
case (size,nop)
of (4,false) => [instr]
| (8,true) => [instr]
| (8,_) => [rev cmp, I.b{lab=t, n=n}]
| (16,_) => rev cmp :: longJump{lab=t, n=n}
| _ => error "BCOND"
(*esac*)
end
| I.BCONDI{cmpi, bc, t, f, i, r2, n, nop} => let
fun rev I.COMIBT=I.bcondi{cmpi=I.COMIBF,bc=bc,i=i,r2=r2,t=f,f=f,n=true,nop=false}
| rev I.COMIBF=I.bcondi{cmpi=I.COMIBT,bc=bc,i=i,r2=r2,t=f,f=f,n=true,nop=false}
in
case (size,nop)
of (4,false) => [instr]
| (8,true) => [instr]
| (8,_) => [rev cmpi, I.b{lab=t, n=n}]
| (16,_) => rev cmpi :: longJump{lab=t, n=n}
| _ => error "BCONDI"
(*esac*)
end
| I.BB{bc, r, p, t, f, n, nop} => let
fun rev I.BSET = I.bb{bc=I.BCLR,r=r,p=p,t=f,f=f,n=true,nop=false}
| rev I.BCLR = I.bb{bc=I.BSET,r=r,p=p,t=f,f=f,n=true,nop=false}
in case (size,nop) of
(4,false) => [instr]
| (8,true) => [instr]
| (8,_) => [rev bc, I.b{lab=t,n=n}]
| (16,_) => rev bc :: longJump{lab=t, n=n}
| _ => error "BB"
end
|I.B{lab=lab, n=n} =>
(case size
of 4 => [instr]
| 12 => longJump{lab=lab, n=n}
| _ => error "B"
(*esac*))
| I.FBRANCH{t, f, n, ...} =>
(case size
of 12 => [instr]
| 20 =>
(* lets hope this sequence never gets generated sequence:
FTEST
allways trapping instruction
B (f)
longJmp
*)
error "FBRANCH(20)"
| _ => error "FBRANCH"
(*esac*))
| I.BLR{labs,n,t,x,...} =>
(if size = 8 + 8 * length labs then
I.blr{labs=[],n=n,t=t,x=x}::
I.nop::
foldr (fn (l,is) => I.b{lab=l,n=true}::I.nop::is) [] labs
else error "BLR"
)
| _ => error "expand")
| expand _ = error "expand"
end
|
