fix(pkg/store): remove useless ringbuffer array

Author: mmeloni

pkg/store/store.go

@@ -259,7 +259,7 @@ func (t *Store) itemAt(readTs uint64) (index uint64, key, value []byte, err erro
 	// cache reference lookup
 	t.tree.RLock()
 	defer t.tree.RUnlock()
-	if key := t.tree.rcaches[0].Get(index); key != nil {
+	if key := t.tree.rcache.Get(index); key != nil {
 		refkey = key.([]byte)
 	}
 
@@ -627,7 +627,7 @@ func (t *Store) GetTree() *schema.Tree {
 				var value []byte
 				value = h.(*[sha256.Size]byte)[:]
 				if l == 0 {
-					value = t.tree.rcaches[l].Get(i).([]byte)
+					value = t.tree.rcache.Get(i).([]byte)
 				}
 				memnode := &schema.Node{}
 				memhash, memrefk, _ := decodeRefTreeKey(value)

pkg/store/treestore.go

@@ -125,7 +125,7 @@ type treeStore struct {
 	db          *badger.DB
 	log         logger.Logger
 	caches      [256]ring.Buffer
-	rcaches     [256]ring.Buffer
+	rcache      ring.Buffer
 	cPos        [256]uint64
 	cSize       uint64
 	sync.RWMutex
@@ -183,7 +183,7 @@ func (t *treeStore) makeCaches() {
 			size = 64
 		}
 	}
-	t.rcaches[0] = ring.NewRingBuffer(t.cSize + 2)
+	t.rcache = ring.NewRingBuffer(t.cSize + 2)
 }
 
 // Close closes a treeStore. All pending items will be processed and flushed.
@@ -278,7 +278,7 @@ func (t *treeStore) worker() {
 			// insertion order index reference creation
 			c := refTreeKey(*item.h, *item.r)
 			// insertion order index cache save
-			t.rcaches[0].Set(item.ts-1, c)
+			t.rcache.Set(item.ts-1, c)
 
 			merkletree.AppendHash(t, item.h)
 			if t.w%2 == 0 && (t.w-t.lastFlushed) >= t.cSize/2 {
@@ -340,7 +340,7 @@ func (t *treeStore) flush() {
 				value = h.(*[sha256.Size]byte)[:]
 				// retrieving insertion order index reference from buffer ring
 				if l == 0 {
-					value = t.rcaches[l].Get(i).([]byte)
+					value = t.rcache.Get(i).([]byte)
 				}
 				// fmt.Printf("Storing [l=%d, i=%d]\n", l, i)
 				entry := badger.Entry{