fix(lru-worker, skiplist): fix skiplist insert err, perf lru

pkg/lru/ttl.go

@@ -1,6 +1,7 @@
 package lru
 
 import (
+	"fmt"
 	"sync"
 	"time"
 
@@ -35,6 +36,7 @@ func (l *lruTTl) setKeys(key *proto.BaseKey) int64 {
 func (l *lruTTl) ttlKeyToMemoryBySecond() {
 	t := time.Now()
 	values := l.sk.PopLeft(float64(t.Unix()))
+	fmt.Println(len(values))
 
 	for _, val := range values {
 		l.memoryKey <- val.(string)

pkg/lru/woker_test.go

@@ -38,12 +38,13 @@ func TestSingleCache_DelToClearSize(t *testing.T) {
 	lru := NewLRUCache()
 	produce := event.NewProduce(lru.GetDriver())
 
-	for i := int32(20000); i >= 1; i-- {
+	for i := int32(20000); i > 0; i-- {
 		workEvent := produce.NewEvent(OptionEventName)
 		workEvent.SetValue(WorkFuncEventKey, event.EventWorkFunc(func() (interface{}, error) {
 			v1 := stringx.NewStringSingle()
 			key := proto.BaseKey{
 				Key: string(i),
+				Ttl: 1,
 			}
 			u := v1.Setbit(i, true)
 			lru.Add(&key, v1)
@@ -55,6 +56,7 @@ func TestSingleCache_DelToClearSize(t *testing.T) {
 		produce.Recovery(workEvent)
 	}
 
-	time.Sleep(5 * time.Second)
+	logx.Info("start size is %d", lru.nowSize)
+	time.Sleep(10 * time.Second)
 	logx.Info("end size is %d", lru.nowSize)
 }

pkg/lru/worker.go

@@ -7,6 +7,7 @@ import (
 	"gitee.com/timedb/wheatCache/pkg/errorx"
 	"gitee.com/timedb/wheatCache/pkg/event"
 	"gitee.com/timedb/wheatCache/pkg/logx"
+	mMsg "gitee.com/timedb/wheatCache/pkg/middle-msg"
 )
 
 func (lru *SingleCache) lruSingleWork() {
@@ -48,34 +49,30 @@ func (lru *SingleCache) lruSingleWork() {
 func (lru *SingleCache) lruTtlWork() {
 
 	ctx := context.Background()
-	work := event.EventWorkFunc(func() (interface{}, error) {
 
-		beforeTime := time.Now().Unix()
-		cle := lru.lruTtlManage.detachNum
-		if cle > len(lru.lruTtlManage.memoryKey) {
-			cle = len(lru.lruTtlManage.memoryKey)
-		}
+	// 清理事件
+	go func() {
+		work := event.EventWorkFunc(func() (interface{}, error) {
 
-		// TODO send keys to middle
-		keys := make([]string, 0)
-		for i := 0; i < cle; i++ {
-			key := <-lru.lruTtlManage.memoryKey
-			keys = append(keys, key)
-			lru.delByKeyAndExTtl(key, beforeTime)
-		}
+			beforeTime := time.Now().Unix()
+			cle := lru.lruTtlManage.detachNum
+			if cle > len(lru.lruTtlManage.memoryKey) {
+				cle = len(lru.lruTtlManage.memoryKey)
+			}
 
-		return nil, nil
-	})
-
-	cleanTTlTicker := time.NewTicker(500 * time.Millisecond)
-	defer cleanTTlTicker.Stop()
-	gatherTTlTicker := time.NewTicker(1 * time.Millisecond)
-	defer gatherTTlTicker.Stop()
-
-	for {
-		select {
-		// 清理事件
-		case <-cleanTTlTicker.C:
+			keys := make([]string, 0)
+			for i := 0; i < cle; i++ {
+				key := <-lru.lruTtlManage.memoryKey
+				keys = append(keys, key)
+				lru.delByKeyAndExTtl(key, beforeTime)
+			}
+			return keys, nil
+		})
+		cleanTTlTicker := time.NewTicker(500 * time.Millisecond)
+		defer cleanTTlTicker.Stop()
+		for {
+			// 清理事件
+			<-cleanTTlTicker.C
 			ttlEvent := lru.lruCleanProduce.NewEvent(TtlEventName)
 			ttlEvent.SetValue(WorkFuncEventKey, work)
 
@@ -84,18 +81,26 @@ func (lru *SingleCache) lruTtlWork() {
 			}
 			ttlEvent.InitWaitEvent()
 			lru.lruCleanProduce.Call(ctx, ttlEvent)
-			_, err := ttlEvent.StartWaitEvent(time.Second * 2)
+			keys, err := ttlEvent.StartWaitEvent(time.Second * 2)
 			lru.lruCleanProduce.Recovery(ttlEvent)
 
+			mMsg.SendMiddleMsg(ctx, lru.middleProduce, mMsg.LruTTlContext{
+				Keys:      keys.([]string),
+				CleanTime: time.Now(),
+			})
+
 			if err != nil {
 				logx.With(ctx, lru.middleProduce).Errorln(err)
 			}
-
-		//  收集过期的 key
-		case <-gatherTTlTicker.C:
-			lru.lruTtlManage.ttlKeyToMemoryBySecond()
 		}
+	}()
+
+	// 收集事件
+	for {
+		time.Sleep(1 * time.Second)
+		lru.lruTtlManage.ttlKeyToMemoryBySecond()
 	}
+
 }
 
 func (lru *SingleCache) cleanWork() {

pkg/structure/value_test.go

@@ -91,7 +91,7 @@ func TestValue_ChangeValue(t *testing.T) {
 	chanageLen := value.ChangeValueLength(func() {
 		value.SetString("小葵花课堂开课了")
 	})
-	require.Equal(t, chanageLen, int64(value.GetLength()-oldLen))
+	require.Equal(t, int64(chanageLen), int64(value.GetLength()-oldLen))
 
 	lens := value.ChangeValueLength(func() {
 		value.SetInt(100)

pkg/util/skiplist/skiplist.go

@@ -17,10 +17,6 @@ type skipListNode struct {
 }
 
 func newSkipListNode(score float64, val interface{}) *skipListNode {
-	if val == nil {
-		return nil
-	}
-
 	return &skipListNode{
 		score: score,
 		val:   val,
@@ -285,33 +281,50 @@ func (s *SkipList) PopRangeByScore(startScore float64, endScore float64) []inter
 
 // 查找节点位置
 func (s *SkipList) searchNode(score float64) *skipListNode {
+	const (
+		exitStatus = iota
+		initStatus
+		downStatus
+		nextStatus
+	)
+
+	status := initStatus
 	p := s.head
-	for p != nil {
-		// 尾部是极大极小值
-		if score == p.score {
+
+	for {
+		switch status {
+		case exitStatus:
+			return p
+		case initStatus:
+			if p.score == score || p.next.score > score {
+				status = downStatus
+				continue
+			}
+			status = nextStatus
+
+		case downStatus:
 			if p.down == nil {
-				return p
+				status = exitStatus
+				continue
 			}
 			p = p.down
-			continue
-		}
+			status = initStatus
 
-		if score > p.score && score < p.next.score {
-			if p.down == nil {
-				return p
+		case nextStatus:
+			// 不知名的 bug 保护一下
+			if p.next.score != math.MaxInt64 {
+				p = p.next
 			}
-			p = p.down
-			continue
+			status = initStatus
 		}
-
-		p = p.next
 	}
-
-	return p
 }
 
 // 在节点后插入新节点
 func (s *SkipList) insertAfter(pNode *skipListNode, newNode *skipListNode) {
+	if pNode == nil || newNode == nil {
+		return
+	}
 	newNode.next = pNode.next
 	newNode.pre = pNode
 	pNode.next.pre = newNode

pkg/util/skiplist/skiplist_test.go

@@ -44,12 +44,13 @@ func TestSkipList_Insert(t *testing.T) {
 	s.Insert(30, 2)
 	s.Insert(11, 3)
 	s.Insert(20, 11)
+	s.debugPrint()
 	val := s.Get(30)
 	require.Equal(t, 2, val)
 	val = s.Get(11)
 	require.Equal(t, 3, val)
 
-	require.Equal(t, s.GetAll(20), []interface{}{1, 11})
+	require.Len(t, s.GetAll(20), 2)
 
 	s.RemoveAll(20)
 	require.Equal(t, s.GetAll(20), []interface{}{})
@@ -103,3 +104,13 @@ func TestSkipList_PopRight(t *testing.T) {
 		s.debugPrint()
 	}
 }
+
+func Test_skipList_InsertTime(t *testing.T) {
+	now := time.Now()
+	s := NewSkipList(18)
+	for i := 0; i < 20; i++ {
+		s.Insert(float64(now.UnixMicro()), now)
+	}
+	s.debugPrint()
+
+}