-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathpredictor.go
69 lines (56 loc) · 1.22 KB
/
predictor.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
package fpc
type predictorClass uint8
const (
fcmPredictor predictorClass = iota
dfcmPredictor
)
type predictor interface {
predict() (predicted uint64)
update(actual uint64)
}
type fcm struct {
table []uint64
size uint64
lastHash uint64
}
func newFCM(size uint) *fcm {
// size must be a power of two
return &fcm{
table: make([]uint64, size, size),
size: uint64(size),
}
}
func (f *fcm) hash(actual uint64) uint64 {
return ((f.lastHash << 6) ^ (actual >> 48)) & (f.size - 1)
}
func (f *fcm) predict() uint64 {
return f.table[f.lastHash]
}
func (f *fcm) update(actual uint64) {
f.table[f.lastHash] = actual
f.lastHash = f.hash(actual)
}
type dfcm struct {
table []uint64
size uint64
lastHash uint64
lastValue uint64
}
func newDFCM(size uint) *dfcm {
// size must be a power of two
return &dfcm{
table: make([]uint64, size, size),
size: uint64(size),
}
}
func (d *dfcm) hash(actual uint64) uint64 {
return ((d.lastHash << 2) ^ ((actual - d.lastValue) >> 40)) & (d.size - 1)
}
func (d *dfcm) predict() uint64 {
return d.table[d.lastHash] + d.lastValue
}
func (d *dfcm) update(actual uint64) {
d.table[d.lastHash] = actual - d.lastValue
d.lastHash = d.hash(actual)
d.lastValue = actual
}