forked from JasonHu520/cubefs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfree_list.go
72 lines (64 loc) · 1.55 KB
/
free_list.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
// Copyright 2018 The CubeFS Authors.
//
// 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 metanode
import (
"container/list"
"sync"
)
type freeList struct {
sync.Mutex
list *list.List
index map[uint64]*list.Element
}
func newFreeList() *freeList {
return &freeList{
list: list.New(),
index: make(map[uint64]*list.Element),
}
}
// Pop removes the first item on the list and returns it.
func (fl *freeList) Pop() (ino uint64) {
fl.Lock()
defer fl.Unlock()
item := fl.list.Front()
if item == nil {
return
}
val := fl.list.Remove(item)
ino = val.(uint64)
delete(fl.index, ino)
return
}
// Push inserts a new item at the back of the list.
func (fl *freeList) Push(ino uint64) {
fl.Lock()
defer fl.Unlock()
if _, ok := fl.index[ino]; !ok {
item := fl.list.PushBack(ino)
fl.index[ino] = item
}
}
func (fl *freeList) Remove(ino uint64) {
fl.Lock()
defer fl.Unlock()
if item, ok := fl.index[ino]; ok {
fl.list.Remove(item)
delete(fl.index, ino)
}
}
func (fl *freeList) Len() int {
fl.Lock()
defer fl.Unlock()
return len(fl.index)
}