2018-05-13 07:11:26 +00:00
|
|
|
package filer2
|
|
|
|
|
2018-05-21 00:06:09 +00:00
|
|
|
import (
|
2018-09-09 23:26:11 +00:00
|
|
|
"fmt"
|
|
|
|
"hash/fnv"
|
2018-05-27 18:52:26 +00:00
|
|
|
"sort"
|
2018-11-18 19:51:38 +00:00
|
|
|
"sync"
|
2018-05-21 00:08:54 +00:00
|
|
|
|
|
|
|
"github.com/chrislusf/seaweedfs/weed/pb/filer_pb"
|
2018-05-21 00:06:09 +00:00
|
|
|
)
|
2018-05-16 07:08:44 +00:00
|
|
|
|
2018-05-21 00:06:09 +00:00
|
|
|
func TotalSize(chunks []*filer_pb.FileChunk) (size uint64) {
|
2018-05-13 07:11:26 +00:00
|
|
|
for _, c := range chunks {
|
|
|
|
t := uint64(c.Offset + int64(c.Size))
|
|
|
|
if size < t {
|
|
|
|
size = t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2018-09-09 23:25:43 +00:00
|
|
|
func ETag(chunks []*filer_pb.FileChunk) (etag string) {
|
|
|
|
if len(chunks) == 1 {
|
|
|
|
return chunks[0].ETag
|
|
|
|
}
|
|
|
|
|
|
|
|
h := fnv.New32a()
|
|
|
|
for _, c := range chunks {
|
|
|
|
h.Write([]byte(c.ETag))
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("%x", h.Sum32())
|
|
|
|
}
|
|
|
|
|
2018-05-21 00:06:09 +00:00
|
|
|
func CompactFileChunks(chunks []*filer_pb.FileChunk) (compacted, garbage []*filer_pb.FileChunk) {
|
2018-05-21 07:00:28 +00:00
|
|
|
|
|
|
|
visibles := nonOverlappingVisibleIntervals(chunks)
|
|
|
|
|
|
|
|
fileIds := make(map[string]bool)
|
|
|
|
for _, interval := range visibles {
|
|
|
|
fileIds[interval.fileId] = true
|
|
|
|
}
|
|
|
|
for _, chunk := range chunks {
|
|
|
|
if found := fileIds[chunk.FileId]; found {
|
|
|
|
compacted = append(compacted, chunk)
|
|
|
|
} else {
|
|
|
|
garbage = append(garbage, chunk)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-21 00:06:09 +00:00
|
|
|
return
|
2018-05-13 07:11:26 +00:00
|
|
|
}
|
2018-05-21 00:06:09 +00:00
|
|
|
|
2018-05-22 10:26:38 +00:00
|
|
|
func FindUnusedFileChunks(oldChunks, newChunks []*filer_pb.FileChunk) (unused []*filer_pb.FileChunk) {
|
|
|
|
|
|
|
|
fileIds := make(map[string]bool)
|
|
|
|
for _, interval := range newChunks {
|
|
|
|
fileIds[interval.FileId] = true
|
|
|
|
}
|
|
|
|
for _, chunk := range oldChunks {
|
|
|
|
if found := fileIds[chunk.FileId]; !found {
|
|
|
|
unused = append(unused, chunk)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2018-05-24 08:22:37 +00:00
|
|
|
type ChunkView struct {
|
|
|
|
FileId string
|
|
|
|
Offset int64
|
|
|
|
Size uint64
|
|
|
|
LogicOffset int64
|
|
|
|
}
|
|
|
|
|
2018-05-28 12:39:12 +00:00
|
|
|
func ViewFromChunks(chunks []*filer_pb.FileChunk, offset int64, size int) (views []*ChunkView) {
|
2018-05-24 05:28:54 +00:00
|
|
|
|
|
|
|
visibles := nonOverlappingVisibleIntervals(chunks)
|
|
|
|
|
|
|
|
stop := offset + int64(size)
|
|
|
|
|
|
|
|
for _, chunk := range visibles {
|
2018-05-25 06:19:56 +00:00
|
|
|
if chunk.start <= offset && offset < chunk.stop && offset < stop {
|
2018-05-24 08:22:37 +00:00
|
|
|
views = append(views, &ChunkView{
|
|
|
|
FileId: chunk.fileId,
|
|
|
|
Offset: offset - chunk.start, // offset is the data starting location in this file id
|
|
|
|
Size: uint64(min(chunk.stop, stop) - offset),
|
|
|
|
LogicOffset: offset,
|
2018-05-24 05:28:54 +00:00
|
|
|
})
|
|
|
|
offset = min(chunk.stop, stop)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return views
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2018-05-21 00:08:54 +00:00
|
|
|
func logPrintf(name string, visibles []*visibleInterval) {
|
2018-05-27 18:56:49 +00:00
|
|
|
/*
|
2018-05-28 06:59:49 +00:00
|
|
|
log.Printf("%s len %d", name, len(visibles))
|
|
|
|
for _, v := range visibles {
|
|
|
|
log.Printf("%s: => %+v", name, v)
|
|
|
|
}
|
2018-05-27 18:56:49 +00:00
|
|
|
*/
|
2018-05-13 07:11:26 +00:00
|
|
|
}
|
2018-05-21 00:06:09 +00:00
|
|
|
|
2018-11-18 19:51:38 +00:00
|
|
|
var bufPool = sync.Pool{
|
|
|
|
New: func() interface{} {
|
|
|
|
return new(visibleInterval)
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
func mergeIntoVisibles(visibles []*visibleInterval, chunk *filer_pb.FileChunk) (newVisibles []*visibleInterval) {
|
2018-11-19 04:31:39 +00:00
|
|
|
|
|
|
|
newV := newVisibleInterval(
|
|
|
|
chunk.Offset,
|
|
|
|
chunk.Offset+int64(chunk.Size),
|
|
|
|
chunk.FileId,
|
|
|
|
chunk.Mtime,
|
|
|
|
)
|
|
|
|
|
|
|
|
length := len(visibles)
|
|
|
|
if length == 0 {
|
|
|
|
return append(visibles, newV)
|
|
|
|
}
|
|
|
|
last := visibles[length-1]
|
|
|
|
if last.stop <= chunk.Offset {
|
|
|
|
return append(visibles, newV)
|
|
|
|
}
|
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
for _, v := range visibles {
|
|
|
|
if v.start < chunk.Offset && chunk.Offset < v.stop {
|
|
|
|
newVisibles = append(newVisibles, newVisibleInterval(
|
|
|
|
v.start,
|
|
|
|
chunk.Offset,
|
|
|
|
v.fileId,
|
|
|
|
v.modifiedTime,
|
|
|
|
))
|
2018-05-21 00:06:09 +00:00
|
|
|
}
|
2018-11-18 18:07:30 +00:00
|
|
|
chunkStop := chunk.Offset + int64(chunk.Size)
|
|
|
|
if v.start < chunkStop && chunkStop < v.stop {
|
|
|
|
newVisibles = append(newVisibles, newVisibleInterval(
|
|
|
|
chunkStop,
|
|
|
|
v.stop,
|
|
|
|
v.fileId,
|
|
|
|
v.modifiedTime,
|
2018-05-21 00:06:09 +00:00
|
|
|
))
|
|
|
|
}
|
2018-11-18 18:07:30 +00:00
|
|
|
if chunkStop < v.start || v.stop <= chunk.Offset {
|
|
|
|
newVisibles = append(newVisibles, v)
|
|
|
|
}
|
2018-05-21 00:06:09 +00:00
|
|
|
}
|
2018-11-19 04:31:39 +00:00
|
|
|
newVisibles = append(newVisibles, newV)
|
|
|
|
|
|
|
|
for i := len(newVisibles) - 1; i > 0; i-- {
|
|
|
|
if newV.start < newVisibles[i-1].start {
|
|
|
|
newVisibles[i] = newVisibles[i-1]
|
|
|
|
} else {
|
|
|
|
newVisibles[i] = newV
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
return
|
|
|
|
}
|
2018-05-21 00:06:09 +00:00
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
func nonOverlappingVisibleIntervals(chunks []*filer_pb.FileChunk) (visibles []*visibleInterval) {
|
2018-05-21 00:06:09 +00:00
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
sort.Slice(chunks, func(i, j int) bool {
|
|
|
|
return chunks[i].Mtime < chunks[j].Mtime
|
|
|
|
})
|
2018-05-21 00:06:09 +00:00
|
|
|
|
2018-11-18 18:07:30 +00:00
|
|
|
for _, chunk := range chunks {
|
|
|
|
visibles = mergeIntoVisibles(visibles, chunk)
|
2018-05-21 00:06:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
logPrintf("visibles", visibles)
|
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// find non-overlapping visible intervals
|
|
|
|
// visible interval map to one file chunk
|
|
|
|
|
|
|
|
type visibleInterval struct {
|
|
|
|
start int64
|
|
|
|
stop int64
|
|
|
|
modifiedTime int64
|
|
|
|
fileId string
|
|
|
|
}
|
|
|
|
|
|
|
|
func newVisibleInterval(start, stop int64, fileId string, modifiedTime int64) *visibleInterval {
|
2018-11-19 04:31:39 +00:00
|
|
|
return &visibleInterval{
|
|
|
|
start: start,
|
|
|
|
stop: stop,
|
|
|
|
fileId: fileId,
|
|
|
|
modifiedTime: modifiedTime,
|
|
|
|
}
|
2018-05-21 00:06:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func min(x, y int64) int64 {
|
|
|
|
if x <= y {
|
|
|
|
return x
|
|
|
|
}
|
|
|
|
return y
|
|
|
|
}
|