-
Notifications
You must be signed in to change notification settings - Fork 1
/
reg.go
126 lines (102 loc) · 1.94 KB
/
reg.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
125
126
package reg
import (
"math/bits"
"strings"
)
type Arch interface {
RegNames() []string
SavedRegs() []Reg
TempRegs() []Reg
ArgRegs() []Reg
SpecialRegs() map[string]Reg
}
func SetArch(arch Arch) {
names = arch.RegNames()
SavedRegs = arch.SavedRegs()
ArgRegs = arch.ArgRegs()
TempRegs = arch.TempRegs()
RevSavedRegs = make([]Reg, len(SavedRegs))
savedRegMask = 0
for i, reg := range SavedRegs {
RevSavedRegs[len(SavedRegs)-i-1] = reg
savedRegMask |= reg
}
argRegMask = 0
for _, reg := range ArgRegs {
argRegMask |= reg
}
spec := arch.SpecialRegs()
RA = spec["RA"]
GP = spec["GP"]
SP = spec["SP"]
FP = spec["FP"]
}
var names []string
type Reg uint
const (
None Reg = 0
)
var SavedRegs []Reg
var RevSavedRegs []Reg
var TempRegs []Reg
var ArgRegs []Reg
var savedRegMask Reg
var argRegMask Reg
var SP Reg
var FP Reg
var GP Reg
var RA Reg
func FromRegNum(num int) Reg {
return 1 << num
}
func (reg Reg) String() string {
if reg == None {
return "none"
}
if reg.IsMany() {
regs := reg.RegNumbers()
strs := make([]string, len(regs))
for i, num := range regs {
strs[i] = names[num]
}
return strings.Join(strs, ",")
}
return names[reg.RegNumber()]
}
func (reg Reg) RegNumber() int {
if reg == None {
return -1
}
return bits.TrailingZeros(uint(reg))
}
func (reg Reg) NumRegs() int {
return bits.OnesCount(uint(reg))
}
func (reg Reg) IsMany() bool {
return bits.OnesCount(uint(reg)) > 1
}
func (reg Reg) RegNumbers() []int {
count := bits.OnesCount(uint(reg))
if count == 0 {
return nil
}
regs := make([]int, count)
for i := range regs {
num := bits.TrailingZeros(uint(reg))
regs[i] = num
reg &^= 1 << num
}
return regs
}
func (reg Reg) IsArgReg() bool {
return reg&argRegMask != 0
}
func (reg Reg) IsSpecialReg() bool {
return reg == GP || reg == SP || reg == RA
}
func (reg Reg) IsSavedReg() bool {
return reg&savedRegMask != 0
}
func (reg Reg) CanAffinity() bool {
return !reg.IsSpecialReg()
}