-
Notifications
You must be signed in to change notification settings - Fork 21
/
pass_copyelim.go
124 lines (109 loc) · 3.61 KB
/
pass_copyelim.go
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
/*
* Copyright 2022 ByteDance Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package ssa
// CopyElim removes unnessecery register copies.
type CopyElim struct{}
func (self CopyElim) Apply(cfg *CFG) {
regs := make(map[Reg]Reg)
consts := make(map[Reg]_ConstData)
/* constant zero registers */
consts[Rz] = constint(0)
consts[Pn] = constptr(nil)
/* register replacement func */
replacereg := func(rr *Reg) {
for {
if r, ok := regs[*rr]; ok {
*rr = r
} else {
break
}
}
}
/* Phase 1: Find all the constants */
cfg.ReversePostOrder(func(bb *BasicBlock) {
for _, v := range bb.Ins {
switch p := v.(type) {
case *IrConstInt: consts[p.R] = constint(p.V)
case *IrConstPtr: consts[p.R] = constptr(p.P)
}
}
})
/* Phase 2: Identify all the identity operations */
cfg.ReversePostOrder(func(bb *BasicBlock) {
for _, v := range bb.Ins {
switch p := v.(type) {
default: {
continue
}
/* pointer arithmetic */
case *IrLEA: {
if cc, ok := consts[p.Off]; ok && cc.i && cc.v == 0 {
regs[p.R] = p.Mem
}
}
/* integer arithmetic */
case *IrBinaryExpr: {
var c bool
var i int64
var x _ConstData
var y _ConstData
/* calculate mathematical identities */
switch p.Op {
case IrOpAdd : i = 0
case IrOpSub : i = 0
case IrOpMul : i = 1
case IrOpAnd : i = -1
case IrOpOr : i = 0
case IrOpXor : i = 0
case IrOpShr : i = 0
default : continue
}
/* check for identity operations */
if x, c = consts[p.X]; c && x.i && x.v == i {
regs[p.R] = p.Y
} else if y, c = consts[p.Y]; c && y.i && y.v == i {
regs[p.R] = p.X
}
}
}
}
})
/* Phase 3: Replace all the register references */
cfg.ReversePostOrder(func(bb *BasicBlock) {
var ok bool
var use IrUsages
/* replace in Phi nodes */
for _, v := range bb.Phi {
for _, u := range v.Usages() {
replacereg(u)
}
}
/* replace in instructions */
for _, v := range bb.Ins {
if use, ok = v.(IrUsages); ok {
for _, u := range use.Usages() {
replacereg(u)
}
}
}
/* replace in terminators */
if use, ok = bb.Term.(IrUsages); ok {
for _, u := range use.Usages() {
replacereg(u)
}
}
})
}