-
Notifications
You must be signed in to change notification settings - Fork 0
/
constFoldAsm.ml
161 lines (152 loc) · 5.46 KB
/
constFoldAsm.ml
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
open Asm
let fdata = ref []
let findi x env = (match M.find x env with | Li(i) -> i | _ -> raise Not_found)
let findf x env = (match M.find x env with
| FLi(l) ->
let (_,d) = List.find (fun (l',_) -> (l'=l)) !fdata in
d
| _ -> raise Not_found)
(* find label correspond to value f, if not exist, add new label *)
let findlabel f =
try
let (l,_) = List.find (fun (_,d) -> (d=f)) !fdata in
l
with
| Not_found ->
let la = Id.genid "l" in
let nl = Id.L(la) in
Printf.eprintf "Add label %s for %f\n" la f;
fdata := (nl, f) :: !fdata;
nl
let rec g' e env = (* for Asm.exp *)
match e with
| Li(i) -> Li(i)
| FLi(f) -> FLi(f)
| Add(x,C(y)) when M.mem x env ->
(*(Printf.eprintf "fold %d+%d\n" (findi x env) y);*)
Li((findi x env)+y)
| Sub(x,C(y)) when M.mem x env -> Li((findi x env)-y)
| Mul(x,C(y)) when M.mem x env -> Li((findi x env)*y)
| Div(x,C(y)) when M.mem x env -> Li((findi x env)/y)
| Slw(x,C(y)) when M.mem x env -> Li((findi x env) lsl y)
| Add(x,V(y)) when M.mem x env && M.mem y env -> Li((findi x env)+(findi y env))
| Sub(x,V(y)) when M.mem x env && M.mem y env -> Li((findi x env)-(findi y env))
| Mul(x,V(y)) when M.mem x env && M.mem y env -> Li((findi x env)*(findi y env))
| Div(x,V(y)) when M.mem x env && M.mem y env -> Li((findi x env)/(findi y env))
| Slw(x,V(y)) when M.mem x env && M.mem y env -> Li((findi x env) lsl (findi y env))
| Neg(x) when M.mem x env -> Li(-(findi x env))
| Mr(x) when M.mem x env -> Li(findi x env)
| FAdd(x,y) when M.mem x env && M.mem y env ->
let f = (findf x env) +. (findf y env) in
let l = findlabel f in
FLi(l)
| FSub(x,y) when M.mem x env && M.mem y env ->
let f = (findf x env) -. (findf y env) in
let l = findlabel f in
FLi(l)
| FMul(x,y) when M.mem x env && M.mem y env ->
let f = (findf x env) *. (findf y env) in
let l = findlabel f in
FLi(l)
| FDiv(x,y) when M.mem x env && M.mem y env ->
let f = (findf x env) /. (findf y env) in
let l = findlabel f in
FLi(l)
| Lwz(x,V(y)) when M.mem x env && M.mem y env ->
Lwz(reg_zero,C((findi x env)+(findi y env)))
| Lwz(x,C(y)) when M.mem x env ->
Lwz(reg_zero,C((findi x env)+y))
| Stw(x,y,V(z)) when M.mem y env && M.mem z env ->
Stw(x,reg_zero,C((findi y env)+(findi z env)))
| Stw(x,y,C(z)) when M.mem y env ->
Stw(x,reg_zero,C((findi y env)+z))
| Lfd(x,V(y)) when M.mem x env && M.mem y env ->
Lfd(reg_zero,C((findi x env)+(findi y env)))
| Lfd(x,C(y)) when M.mem x env ->
Lfd(reg_zero,C((findi x env)+y))
| Stfd(x,y,V(z)) when M.mem y env && M.mem z env ->
Stfd(x,reg_zero,C((findi y env)+(findi z env)))
| Stfd(x,y,C(z)) when M.mem y env ->
Stfd(x,reg_zero,C((findi y env)+z))
| IfEq(x,V(y),e1,e2) when M.mem x env && M.mem y env ->
let xi = findi x env in
let yi = findi y env in
if xi = yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfEq(x,C(yi),e1,e2) when M.mem x env ->
let xi = findi x env in
if xi = yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfLE(x,V(y),e1,e2) when M.mem x env && M.mem y env ->
let xi = findi x env in
let yi = findi y env in
if xi <= yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfLE(x,C(yi),e1,e2) when M.mem x env ->
let xi = findi x env in
if xi <= yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfGE(x,V(y),e1,e2) when M.mem x env && M.mem y env ->
let xi = findi x env in
let yi = findi y env in
if xi >= yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfGE(x,C(yi),e1,e2) when M.mem x env ->
let xi = findi x env in
if xi >= yi then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfFEq(x,y,e1,e2) when M.mem x env && M.mem y env ->
let xf = findf x env in
let yf = findf y env in
if xf = yf then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| IfFLE(x,y,e1,e2) when M.mem x env && M.mem y env ->
let xf = findf x env in
let yf = findf y env in
if xf <= yf then
IfEq(reg_zero,C(0),(g e1 env),Ans(Nop))
else
IfEq(reg_zero,C(0),(g e2 env),Ans(Nop))
| e -> e
and g e env = (* for Asm.t *)
match e with
| Ans(exp) -> Ans(g' exp env)
| Let((x,t),e1,e2) ->
(
let e1' = g' e1 env in
match e1' with
| Li(i) ->
let env' = M.add x (Li(i)) env in
let e2' = g e2 env' in
Let((x,t),e1',e2')
| FLi(f) ->
let env' = M.add x (FLi(f)) env in
let e2' = g e2 env' in
Let((x,t),e1',e2')
| _ ->
let e2' = g e2 env in
Let((x,t),e1',e2')
)
let h { name = Id.L(x); args = ys; fargs = zs; body = e; ret = t } =
let e' = g e M.empty in
{ name = Id.L(x); args = ys; fargs = zs; body = e'; ret = t }
let f (Prog(data, fundefs, e)) =
fdata := data;
Printf.fprintf stderr "[Const fold asm]\n";
let fds = List.map h fundefs in
let e' = g e M.empty in
Prog(!fdata,fds,e')