mirrors/seaweedfs
1
0
Fork 0
mirror of https://github.com/chrislusf/seaweedfs synced 2024-06-24 11:32:04 +02:00
Code Issues Projects Releases Wiki Activity

reduce logs

Browse source
This commit is contained in:
Chris Lu 2020-01-27 21:20:41 -08:00
parent c8d543ef51
commit f724057051
1 changed files with 3 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
weed/filesys/dirty_page_interval.go
View file

@ -4,8 +4,6 @@ import (
"bytes" "bytes"
"io" "io"
"math" "math"
"github.com/chrislusf/seaweedfs/weed/glog"
) )
type IntervalNode struct { type IntervalNode struct {
@ -31,12 +29,12 @@ func (list *IntervalLinkedList) Size() int64 {
return list.Tail.Offset + list.Tail.Size - list.Head.Offset return list.Tail.Offset + list.Tail.Size - list.Head.Offset
} }
func (list *IntervalLinkedList) addNodeToTail(node *IntervalNode) { func (list *IntervalLinkedList) addNodeToTail(node *IntervalNode) {
glog.V(4).Infof("add to tail [%d,%d) + [%d,%d) => [%d,%d)", list.Head.Offset, list.Tail.Offset+list.Tail.Size, node.Offset, node.Offset+node.Size, list.Head.Offset, node.Offset+node.Size) // glog.V(4).Infof("add to tail [%d,%d) + [%d,%d) => [%d,%d)", list.Head.Offset, list.Tail.Offset+list.Tail.Size, node.Offset, node.Offset+node.Size, list.Head.Offset, node.Offset+node.Size)
list.Tail.Next = node list.Tail.Next = node
list.Tail = node list.Tail = node
} }
func (list *IntervalLinkedList) addNodeToHead(node *IntervalNode) { func (list *IntervalLinkedList) addNodeToHead(node *IntervalNode) {
glog.V(4).Infof("add to head [%d,%d) + [%d,%d) => [%d,%d)", node.Offset, node.Offset+node.Size, list.Head.Offset, list.Tail.Offset+list.Tail.Size, node.Offset, list.Tail.Offset+list.Tail.Size) // glog.V(4).Infof("add to head [%d,%d) + [%d,%d) => [%d,%d)", node.Offset, node.Offset+node.Size, list.Head.Offset, list.Tail.Offset+list.Tail.Size, node.Offset, list.Tail.Offset+list.Tail.Size)
node.Next = list.Head node.Next = list.Head
list.Head = node list.Head = node
} }
@ -91,8 +89,6 @@ func subList(list *IntervalLinkedList, start, stop int64) *IntervalLinkedList {
func (c *ContinuousIntervals) AddInterval(data []byte, offset int64) { func (c *ContinuousIntervals) AddInterval(data []byte, offset int64) {
// TODO AddInterval needs to handle all possible out of order writes
interval := &IntervalNode{Data: data, Offset: offset, Size: int64(len(data))} interval := &IntervalNode{Data: data, Offset: offset, Size: int64(len(data))}
var newLists []*IntervalLinkedList var newLists []*IntervalLinkedList
@ -138,7 +134,7 @@ func (c *ContinuousIntervals) AddInterval(data []byte, offset int64) {
} }
if prevList != nil && nextList != nil { if prevList != nil && nextList != nil {
glog.V(4).Infof("connecting [%d,%d) + [%d,%d) => [%d,%d)", prevList.Head.Offset, prevList.Tail.Offset+prevList.Tail.Size, nextList.Head.Offset, nextList.Tail.Offset+nextList.Tail.Size, prevList.Head.Offset, nextList.Tail.Offset+nextList.Tail.Size) // glog.V(4).Infof("connecting [%d,%d) + [%d,%d) => [%d,%d)", prevList.Head.Offset, prevList.Tail.Offset+prevList.Tail.Size, nextList.Head.Offset, nextList.Tail.Offset+nextList.Tail.Size, prevList.Head.Offset, nextList.Tail.Offset+nextList.Tail.Size)
prevList.Tail.Next = nextList.Head prevList.Tail.Next = nextList.Head
prevList.Tail = nextList.Tail prevList.Tail = nextList.Tail
c.removeList(nextList) c.removeList(nextList)