-
-
Notifications
You must be signed in to change notification settings - Fork 114
/
compaction.go
64 lines (58 loc) · 1.69 KB
/
compaction.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
// Copyright 2018-2020 Burak Sezer
//
// 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 storage
import (
"log"
)
func (s *Storage) CompactTables() bool {
if len(s.tables) == 1 {
return true
}
var total int
fresh := s.tables[len(s.tables)-1]
for _, old := range s.tables[:len(s.tables)-1] {
// Removing keys while iterating on map is totally safe in Go.
for hkey := range old.hkeys {
entry, _ := old.getRaw(hkey)
err := fresh.putRaw(hkey, entry)
if err == errNotEnoughSpace {
// Create a new table and put the new k/v pair in it.
nt := newTable(s.Inuse() * 2)
s.tables = append(s.tables, nt)
return false
}
if err != nil {
log.Printf("[ERROR] Failed to compact tables. HKey: %d: %v", hkey, err)
}
// Dont check the returned val, it's useless because
// we are sure that the key is already there.
old.delete(hkey)
total++
if total > 1000 {
// It's enough. Don't block the instance.
return false
}
}
}
// Remove empty tables. Keep the last table.
tmp := []*table{s.tables[len(s.tables)-1]}
for _, t := range s.tables[:len(s.tables)-1] {
if len(t.hkeys) == 0 {
continue
}
tmp = append(tmp, t)
}
s.tables = tmp
return true
}