github.com/m3db/m3@v1.5.1-0.20231129193456-75a402aa583b/src/dbnode/storage/block/block.go

// Copyright (c) 2016 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.

package block

import (
	"errors"
	"sync"
	"sync/atomic"
	"time"

	"github.com/m3db/m3/src/dbnode/namespace"
	"github.com/m3db/m3/src/dbnode/ts"
	"github.com/m3db/m3/src/dbnode/x/xio"
	"github.com/m3db/m3/src/x/context"
	"github.com/m3db/m3/src/x/ident"
	xtime "github.com/m3db/m3/src/x/time"
)

var (
	errReadFromClosedBlock       = errors.New("attempt to read from a closed block")
	errTriedToMergeBlockFromDisk = errors.New("[invariant violated] tried to merge a block that was retrieved from disk")

	timeZero = xtime.UnixNano(0)
)

type dbBlock struct {
	sync.RWMutex

	nsCtx          namespace.Context
	opts           Options
	startUnixNanos xtime.UnixNano
	segment        ts.Segment
	length         int

	blockSize time.Duration

	lastReadUnixNanos int64

	mergeTarget DatabaseBlock

	seriesID ident.ID

	onEvicted OnEvictedFromWiredList

	// listState contains state that the Wired List requires in order to track a block's
	// position in the wired list. All the state in this struct is "owned" by the wired
	// list and should only be accessed by the Wired List itself. Does not require any
	// synchronization because the WiredList is not concurrent.
	listState listState

	checksum uint32

	wasRetrievedFromDisk bool
	closed               bool
}

type listState struct {
	next                  DatabaseBlock
	prev                  DatabaseBlock
	enteredListAtUnixNano int64
}

// NewDatabaseBlock creates a new DatabaseBlock instance.
func NewDatabaseBlock(
	start xtime.UnixNano,
	blockSize time.Duration,
	segment ts.Segment,
	opts Options,
	nsCtx namespace.Context,
) DatabaseBlock {
	b := &dbBlock{
		nsCtx:          nsCtx,
		opts:           opts,
		startUnixNanos: start,
		blockSize:      blockSize,
		closed:         false,
	}
	if segment.Len() > 0 {
		b.resetSegmentWithLock(segment)
	}
	return b
}

func (b *dbBlock) StartTime() xtime.UnixNano {
	b.RLock()
	start := b.startWithRLock()
	b.RUnlock()
	return start
}

func (b *dbBlock) BlockSize() time.Duration {
	b.RLock()
	size := b.blockSize
	b.RUnlock()
	return size
}

func (b *dbBlock) startWithRLock() xtime.UnixNano {
	return b.startUnixNanos
}

func (b *dbBlock) SetLastReadTime(value xtime.UnixNano) {
	// Use an int64 to avoid needing a write lock for
	// this high frequency called method (i.e. each individual
	// read needing a write lock would be excessive)
	atomic.StoreInt64(&b.lastReadUnixNanos, int64(value))
}

func (b *dbBlock) LastReadTime() xtime.UnixNano {
	return xtime.UnixNano(atomic.LoadInt64(&b.lastReadUnixNanos))
}

func (b *dbBlock) Empty() bool {
	b.RLock()
	empty := b.length == 0
	b.RUnlock()
	return empty
}

func (b *dbBlock) Len() int {
	b.RLock()
	length := b.length
	b.RUnlock()
	return length
}

func (b *dbBlock) Checksum() (uint32, error) {
	b.RLock()
	checksum := b.checksum
	hasMergeTarget := b.mergeTarget != nil
	b.RUnlock()

	if !hasMergeTarget {
		return checksum, nil
	}

	b.Lock()
	defer b.Unlock()
	// Since we released the lock temporarily we need to check again.
	hasMergeTarget = b.mergeTarget != nil
	if !hasMergeTarget {
		return b.checksum, nil
	}

	tempCtx := b.opts.ContextPool().Get()

	stream, err := b.streamWithRLock(tempCtx)
	if err != nil {
		return 0, err
	}

	// This will merge the existing stream with the merge target's stream,
	// as well as recalculate and store the new checksum.
	err = b.forceMergeWithLock(tempCtx, stream)
	if err != nil {
		return 0, err
	}

	return b.checksum, nil
}

func (b *dbBlock) Stream(blocker context.Context) (xio.BlockReader, error) {
	lockUpgraded := false

	b.RLock()
	defer func() {
		if lockUpgraded {
			b.Unlock()
		} else {
			b.RUnlock()
		}
	}()

	if b.closed {
		return xio.EmptyBlockReader, errReadFromClosedBlock
	}

	if b.mergeTarget == nil {
		return b.streamWithRLock(blocker)
	}

	b.RUnlock()
	lockUpgraded = true
	b.Lock()

	// Need to re-check everything since we upgraded the lock.
	if b.closed {
		return xio.EmptyBlockReader, errReadFromClosedBlock
	}

	stream, err := b.streamWithRLock(blocker)
	if err != nil {
		return xio.EmptyBlockReader, err
	}

	if b.mergeTarget == nil {
		return stream, nil
	}

	// This will merge the existing stream with the merge target's stream,
	// as well as recalculate and store the new checksum.
	err = b.forceMergeWithLock(blocker, stream)
	if err != nil {
		return xio.EmptyBlockReader, err
	}

	// This will return a copy of the data so that it is still safe to
	// close the block after calling this method.
	return b.streamWithRLock(blocker)
}

func (b *dbBlock) HasMergeTarget() bool {
	b.RLock()
	hasMergeTarget := b.mergeTarget != nil
	b.RUnlock()
	return hasMergeTarget
}

func (b *dbBlock) WasRetrievedFromDisk() bool {
	b.RLock()
	wasRetrieved := b.wasRetrievedFromDisk
	b.RUnlock()
	return wasRetrieved
}

func (b *dbBlock) Merge(other DatabaseBlock) error {
	b.Lock()
	if b.wasRetrievedFromDisk || other.WasRetrievedFromDisk() {
		// We use Merge to lazily merge blocks that eventually need to be flushed to disk
		// If we try to perform a merge on blocks that were retrieved from disk then we've
		// violated an invariant and probably have a bug that is causing data loss.
		b.Unlock()
		return errTriedToMergeBlockFromDisk
	}

	if b.mergeTarget == nil {
		b.mergeTarget = other
	} else {
		b.mergeTarget.Merge(other)
	}

	b.Unlock()
	return nil
}

func (b *dbBlock) Reset(
	start xtime.UnixNano,
	blockSize time.Duration,
	segment ts.Segment,
	nsCtx namespace.Context,
) {
	b.Lock()
	defer b.Unlock()
	b.resetNewBlockStartWithLock(start, blockSize)
	b.resetSegmentWithLock(segment)
	b.nsCtx = nsCtx
}

func (b *dbBlock) ResetFromDisk(
	start xtime.UnixNano,
	blockSize time.Duration,
	segment ts.Segment,
	id ident.ID,
	nsCtx namespace.Context,
) {
	b.Lock()
	defer b.Unlock()
	b.resetNewBlockStartWithLock(start, blockSize)
	// resetSegmentWithLock sets seriesID to nil
	b.resetSegmentWithLock(segment)
	b.seriesID = id
	b.nsCtx = nsCtx
	b.wasRetrievedFromDisk = true
}

func (b *dbBlock) streamWithRLock(ctx context.Context) (xio.BlockReader, error) {
	start := b.startWithRLock()

	// Take a copy to avoid heavy depends on cycle
	segmentReader := b.opts.SegmentReaderPool().Get()
	data := b.opts.BytesPool().Get(b.segment.Len())
	data.IncRef()
	if b.segment.Head != nil {
		data.AppendAll(b.segment.Head.Bytes())
	}
	if b.segment.Tail != nil {
		data.AppendAll(b.segment.Tail.Bytes())
	}
	data.DecRef()
	checksum := b.segment.CalculateChecksum()
	segmentReader.Reset(ts.NewSegment(data, nil, checksum, ts.FinalizeHead))
	ctx.RegisterFinalizer(segmentReader)

	blockReader := xio.BlockReader{
		SegmentReader: segmentReader,
		Start:         start,
		BlockSize:     b.blockSize,
	}

	return blockReader, nil
}

func (b *dbBlock) forceMergeWithLock(ctx context.Context, stream xio.SegmentReader) error {
	targetStream, err := b.mergeTarget.Stream(ctx)
	if err != nil {
		return err
	}
	start := b.startWithRLock()
	mergedBlockReader := newDatabaseMergedBlockReader(b.nsCtx, start, b.blockSize,
		mergeableStream{stream: stream, finalize: false},       // Should have been marked for finalization by the caller
		mergeableStream{stream: targetStream, finalize: false}, // Already marked for finalization by the Stream() call above
		b.opts)
	mergedSegment, err := mergedBlockReader.Segment()
	if err != nil {
		return err
	}

	b.resetMergeTargetWithLock()
	b.resetSegmentWithLock(mergedSegment)
	return nil
}

func (b *dbBlock) resetNewBlockStartWithLock(start xtime.UnixNano, blockSize time.Duration) {
	b.startUnixNanos = start
	b.blockSize = blockSize
	atomic.StoreInt64(&b.lastReadUnixNanos, 0)
	b.closed = false
	b.resetMergeTargetWithLock()
}

func (b *dbBlock) resetSegmentWithLock(seg ts.Segment) {
	b.segment = seg
	b.length = seg.Len()
	b.checksum = seg.CalculateChecksum()
	b.seriesID = nil
	b.wasRetrievedFromDisk = false
}

func (b *dbBlock) Discard() ts.Segment {
	seg, _ := b.closeAndDiscardConditionally(nil)
	return seg
}

func (b *dbBlock) Close() {
	segment, _ := b.closeAndDiscardConditionally(nil)
	segment.Finalize()
}

func (b *dbBlock) CloseIfFromDisk() bool {
	segment, ok := b.closeAndDiscardConditionally(func(b *dbBlock) bool {
		return b.wasRetrievedFromDisk
	})
	if !ok {
		return false
	}
	segment.Finalize()
	return true
}

func (b *dbBlock) closeAndDiscardConditionally(condition func(b *dbBlock) bool) (ts.Segment, bool) {
	b.Lock()

	if condition != nil && !condition(b) {
		b.Unlock()
		return ts.Segment{}, false
	}

	if b.closed {
		b.Unlock()
		return ts.Segment{}, true
	}

	segment := b.segment
	b.closed = true

	b.resetMergeTargetWithLock()
	b.Unlock()

	if pool := b.opts.DatabaseBlockPool(); pool != nil {
		pool.Put(b)
	}

	return segment, true
}

func (b *dbBlock) resetMergeTargetWithLock() {
	if b.mergeTarget != nil {
		b.mergeTarget.Close()
	}
	b.mergeTarget = nil
}

// Should only be used by the WiredList.
func (b *dbBlock) next() DatabaseBlock {
	return b.listState.next
}

// Should only be used by the WiredList.
func (b *dbBlock) setNext(value DatabaseBlock) {
	b.listState.next = value
}

// Should only be used by the WiredList.
func (b *dbBlock) prev() DatabaseBlock {
	return b.listState.prev
}

// Should only be used by the WiredList.
func (b *dbBlock) setPrev(value DatabaseBlock) {
	b.listState.prev = value
}

// Should only be used by the WiredList.
func (b *dbBlock) enteredListAtUnixNano() int64 {
	return b.listState.enteredListAtUnixNano
}

// Should only be used by the WiredList.
func (b *dbBlock) setEnteredListAtUnixNano(value int64) {
	b.listState.enteredListAtUnixNano = value
}

// wiredListEntry is a snapshot of a subset of the block's state that the WiredList
// uses to determine if a block is eligible for inclusion in the WiredList.
type wiredListEntry struct {
	seriesID             ident.ID
	startTime            xtime.UnixNano
	closed               bool
	wasRetrievedFromDisk bool
}

// wiredListEntry generates a wiredListEntry for the block, and should only
// be used by the WiredList.
func (b *dbBlock) wiredListEntry() wiredListEntry {
	b.RLock()
	result := wiredListEntry{
		closed:               b.closed,
		seriesID:             b.seriesID,
		wasRetrievedFromDisk: b.wasRetrievedFromDisk,
		startTime:            b.startWithRLock(),
	}
	b.RUnlock()
	return result
}

func (b *dbBlock) SetOnEvictedFromWiredList(onEvicted OnEvictedFromWiredList) {
	b.Lock()
	b.onEvicted = onEvicted
	b.Unlock()
}

func (b *dbBlock) OnEvictedFromWiredList() OnEvictedFromWiredList {
	b.RLock()
	onEvicted := b.onEvicted
	b.RUnlock()
	return onEvicted
}

type databaseSeriesBlocks struct {
	elems map[xtime.UnixNano]DatabaseBlock
	min   xtime.UnixNano
	max   xtime.UnixNano
}

// NewDatabaseSeriesBlocks creates a databaseSeriesBlocks instance.
func NewDatabaseSeriesBlocks(capacity int) DatabaseSeriesBlocks {
	return &databaseSeriesBlocks{
		elems: make(map[xtime.UnixNano]DatabaseBlock, capacity),
	}
}

func (dbb *databaseSeriesBlocks) Len() int {
	return len(dbb.elems)
}

func (dbb *databaseSeriesBlocks) AddBlock(block DatabaseBlock) {
	start := block.StartTime()
	if dbb.min.Equal(timeZero) || start.Before(dbb.min) {
		dbb.min = start
	}
	if dbb.max.Equal(timeZero) || start.After(dbb.max) {
		dbb.max = start
	}
	dbb.elems[start] = block
}

func (dbb *databaseSeriesBlocks) AddSeries(other DatabaseSeriesBlocks) {
	if other == nil {
		return
	}
	blocks := other.AllBlocks()
	for _, b := range blocks {
		dbb.AddBlock(b)
	}
}

// MinTime returns the min time of the blocks contained.
func (dbb *databaseSeriesBlocks) MinTime() xtime.UnixNano {
	return dbb.min
}

// MaxTime returns the max time of the blocks contained.
func (dbb *databaseSeriesBlocks) MaxTime() xtime.UnixNano {
	return dbb.max
}

func (dbb *databaseSeriesBlocks) BlockAt(t xtime.UnixNano) (DatabaseBlock, bool) {
	b, ok := dbb.elems[t]
	return b, ok
}

func (dbb *databaseSeriesBlocks) AllBlocks() map[xtime.UnixNano]DatabaseBlock {
	return dbb.elems
}

func (dbb *databaseSeriesBlocks) RemoveBlockAt(t xtime.UnixNano) {
	if _, exists := dbb.elems[t]; !exists {
		return
	}
	delete(dbb.elems, t)
	if dbb.min != t && dbb.max != t {
		return
	}
	dbb.min, dbb.max = timeZero, timeZero
	if len(dbb.elems) == 0 {
		return
	}
	for key := range dbb.elems {
		if dbb.min == timeZero || dbb.min > key {
			dbb.min = key
		}
		if dbb.max == timeZero || dbb.max < key {
			dbb.max = key
		}
	}
}

func (dbb *databaseSeriesBlocks) RemoveAll() {
	for t, block := range dbb.elems {
		block.Close()
		delete(dbb.elems, t)
	}
}

func (dbb *databaseSeriesBlocks) Reset() {
	// Ensure the old, possibly large map is GC'd
	dbb.elems = nil
	dbb.elems = make(map[xtime.UnixNano]DatabaseBlock)
	dbb.min = 0
	dbb.max = 0
}

func (dbb *databaseSeriesBlocks) Close() {
	dbb.RemoveAll()
	// Mark the map as nil to prevent maps that have grown large from wasting
	// space in the pool (Deleting elements from a large map will not cause
	// the underlying resources to shrink)
	dbb.elems = nil
}