-
Notifications
You must be signed in to change notification settings - Fork 0
/
statlinked.go
159 lines (135 loc) · 2.9 KB
/
statlinked.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
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
package filersync
import (
"io"
"sync"
// "os"
)
type StatLinked struct {
stat StatSlice
statL sync.RWMutex
addfunc func()
increasefunc func(*Stat, int64)
}
func NewStatLinked(paths []string) (sl *StatLinked, err error) {
sl = &StatLinked {
}
err = sl.UpdatePath(paths)
if err != nil { return }
return
}
func (sl *StatLinked) SetOnSizeIncrease(f func(*Stat, int64)) {
sl.increasefunc = f
}
func (sl *StatLinked) search(s *Stat) (idx int) {
for idx, i := range sl.stat {
if i.Inode() == s.Inode() { return idx }
}
return -1
}
func (sl *StatLinked) Search(s *Stat) (idx int) {
sl.statL.RLock()
defer sl.statL.RUnlock()
return sl.search(s)
}
type Increase struct {
stat *Stat
size int64
}
func (sl *StatLinked) UpdatePath(paths []string) (err error) {
stats := make(StatSlice, len(paths))
for idx, path := range paths {
stats[idx], err = getStat(path)
if err != nil { return }
}
needNotify := false
increase := make([]Increase, len(stats))
length := 0
sl.statL.Lock()
for _, s := range stats {
idx := sl.search(s)
if idx >= 0 {
olds := sl.stat[idx]
if olds.Size < s.Size {
increase[length] = Increase{s, s.Size}
}
sl.stat[idx] = s
} else {
sl.stat = append(sl.stat, s)
needNotify = true
}
}
sl.stat.Sort()
sl.statL.Unlock()
if length > 0 && sl.increasefunc != nil {
for _, v := range increase[:length] {
sl.increasefunc(v.stat, v.size)
}
}
if needNotify && sl.addfunc != nil {
sl.addfunc()
}
return
}
func (sl *StatLinked) SetOnAdded(f func()) {
sl.addfunc = f
}
func (sl *StatLinked) Find(s *Stat) (ns *Stat, ok bool) {
last, err := sl.Last()
if err != nil { return }
if s.SameIno(last) { return last, true }
for ! s.SameIno(last) {
last, err = sl.Prev(last)
if err != nil { return }
}
return last, true
}
func (sl *StatLinked) Prev(s *Stat) (ns *Stat, err error) {
sl.statL.RLock()
defer sl.statL.RUnlock()
err = io.EOF
for idx, i := range sl.stat {
if i.Inode() == s.Inode() || s.MBefore(i) {
if idx > 0 { return sl.stat[idx-1], nil }
return
}
}
return
}
func (sl *StatLinked) Next(s *Stat) (ns *Stat, err error) {
sl.statL.RLock()
defer sl.statL.RUnlock()
err = io.EOF
for idx, i := range sl.stat {
if i.Inode() == s.Inode() {
if len(sl.stat) > idx + 1 {
return sl.stat[idx+1], nil
}
return
}
if s.MBefore(i) { return i, nil }
}
err = io.EOF
return
}
func (sl *StatLinked) First() (s *Stat, err error) {
sl.statL.RLock()
defer sl.statL.RUnlock()
err = io.EOF
if len(sl.stat) == 0 { return }
return sl.stat[0], nil
}
func (sl *StatLinked) Last() (s *Stat, err error) {
sl.statL.RLock()
defer sl.statL.RUnlock()
err = io.EOF
if len(sl.stat) == 0 { return }
return sl.stat[len(sl.stat)-1], nil
}
func (sl *StatLinked) Remove(s *Stat) (ok bool) {
idx := sl.Search(s)
if idx < 0 { return }
sl.statL.Lock()
defer sl.statL.Unlock()
sl.stat = append(sl.stat[:idx], sl.stat[idx+1:]...)
return true
}