mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2024-01-19 02:48:24 +00:00
optimize a little bit
This commit is contained in:
parent
2371770fe8
commit
9d3be33e5c
|
@ -117,14 +117,16 @@ func (cm *CompactMap) Set(key NeedleId, offset Offset, size uint32) (oldOffset O
|
||||||
x := cm.binarySearchCompactSection(key)
|
x := cm.binarySearchCompactSection(key)
|
||||||
if x < 0 {
|
if x < 0 {
|
||||||
//println(x, "creating", len(cm.list), "section, starting", key)
|
//println(x, "creating", len(cm.list), "section, starting", key)
|
||||||
cm.list = append(cm.list, NewCompactSection(key))
|
cs := NewCompactSection(key)
|
||||||
|
cm.list = append(cm.list, cs)
|
||||||
x = len(cm.list) - 1
|
x = len(cm.list) - 1
|
||||||
//keep compact section sorted by start
|
//keep compact section sorted by start
|
||||||
for x > 0 {
|
for x > 0 {
|
||||||
if cm.list[x-1].start > cm.list[x].start {
|
if cm.list[x-1].start > key {
|
||||||
cm.list[x-1], cm.list[x] = cm.list[x], cm.list[x-1]
|
cm.list[x] = cm.list[x-1]
|
||||||
x = x - 1
|
x = x - 1
|
||||||
} else {
|
} else {
|
||||||
|
cm.list[x] = cs
|
||||||
break
|
break
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,15 +1,23 @@
|
||||||
package needle
|
package needle
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"log"
|
|
||||||
"os"
|
|
||||||
"testing"
|
"testing"
|
||||||
|
"os"
|
||||||
|
"log"
|
||||||
|
|
||||||
"github.com/chrislusf/seaweedfs/weed/glog"
|
|
||||||
. "github.com/chrislusf/seaweedfs/weed/storage/types"
|
|
||||||
"github.com/chrislusf/seaweedfs/weed/util"
|
"github.com/chrislusf/seaweedfs/weed/util"
|
||||||
|
. "github.com/chrislusf/seaweedfs/weed/storage/types"
|
||||||
)
|
)
|
||||||
|
|
||||||
|
/*
|
||||||
|
|
||||||
|
To see the memory usage:
|
||||||
|
|
||||||
|
go test -run TestMemoryUsage -memprofile=mem.out
|
||||||
|
go tool pprof needle.test mem.out
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
func TestMemoryUsage(t *testing.T) {
|
func TestMemoryUsage(t *testing.T) {
|
||||||
|
|
||||||
indexFile, ie := os.OpenFile("../../../test/sample.idx", os.O_RDWR|os.O_RDONLY, 0644)
|
indexFile, ie := os.OpenFile("../../../test/sample.idx", os.O_RDWR|os.O_RDONLY, 0644)
|
||||||
|
@ -18,18 +26,16 @@ func TestMemoryUsage(t *testing.T) {
|
||||||
}
|
}
|
||||||
loadNewNeedleMap(indexFile)
|
loadNewNeedleMap(indexFile)
|
||||||
|
|
||||||
|
indexFile.Close()
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func loadNewNeedleMap(file *os.File) {
|
func loadNewNeedleMap(file *os.File) {
|
||||||
m := NewCompactMap()
|
m := NewCompactMap()
|
||||||
bytes := make([]byte, 16*1024)
|
bytes := make([]byte, NeedleEntrySize*1024)
|
||||||
count, e := file.Read(bytes)
|
count, e := file.Read(bytes)
|
||||||
if count > 0 {
|
|
||||||
fstat, _ := file.Stat()
|
|
||||||
glog.V(0).Infoln("Loading index file", fstat.Name(), "size", fstat.Size())
|
|
||||||
}
|
|
||||||
for count > 0 && e == nil {
|
for count > 0 && e == nil {
|
||||||
for i := 0; i < count; i += 16 {
|
for i := 0; i < count; i += NeedleEntrySize {
|
||||||
key := BytesToNeedleId(bytes[i : i+NeedleIdSize])
|
key := BytesToNeedleId(bytes[i : i+NeedleIdSize])
|
||||||
offset := BytesToOffset(bytes[i+NeedleIdSize : i+NeedleIdSize+OffsetSize])
|
offset := BytesToOffset(bytes[i+NeedleIdSize : i+NeedleIdSize+OffsetSize])
|
||||||
size := util.BytesToUint32(bytes[i+NeedleIdSize+OffsetSize : i+NeedleIdSize+OffsetSize+SizeSize])
|
size := util.BytesToUint32(bytes[i+NeedleIdSize+OffsetSize : i+NeedleIdSize+OffsetSize+SizeSize])
|
||||||
|
@ -43,4 +49,38 @@ func loadNewNeedleMap(file *os.File) {
|
||||||
|
|
||||||
count, e = file.Read(bytes)
|
count, e = file.Read(bytes)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
m.report()
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
// report memory usage
|
||||||
|
func (cm *CompactMap) report() {
|
||||||
|
overFlowCount := 0;
|
||||||
|
overwrittenByOverflow := 0;
|
||||||
|
entryCount := 0
|
||||||
|
compactSectionCount := 0
|
||||||
|
compactSectionEntryCount := 0
|
||||||
|
for _, cs := range cm.list {
|
||||||
|
compactSectionCount++
|
||||||
|
cs.RLock()
|
||||||
|
for range cs.overflow {
|
||||||
|
overFlowCount++
|
||||||
|
entryCount++
|
||||||
|
}
|
||||||
|
for _, v := range cs.values {
|
||||||
|
compactSectionEntryCount++
|
||||||
|
if _, found := cs.overflow[v.Key]; !found {
|
||||||
|
entryCount++
|
||||||
|
} else {
|
||||||
|
overwrittenByOverflow++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
cs.RUnlock()
|
||||||
|
}
|
||||||
|
println("overFlowCount", overFlowCount)
|
||||||
|
println("overwrittenByOverflow", overwrittenByOverflow)
|
||||||
|
println("entryCount", entryCount)
|
||||||
|
println("compactSectionCount", compactSectionCount)
|
||||||
|
println("compactSectionEntryCount", compactSectionEntryCount)
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue