2023-06-20 07:55:12 +02:00
|
|
|
package logstorage
|
|
|
|
|
|
|
|
import (
|
|
|
|
"sync"
|
|
|
|
|
|
|
|
"github.com/VictoriaMetrics/VictoriaMetrics/lib/bytesutil"
|
|
|
|
"github.com/VictoriaMetrics/VictoriaMetrics/lib/encoding"
|
|
|
|
"github.com/VictoriaMetrics/VictoriaMetrics/lib/logger"
|
|
|
|
)
|
|
|
|
|
2024-05-14 01:49:20 +02:00
|
|
|
// The number of blocks to search at once by a single worker
|
|
|
|
//
|
|
|
|
// This number must be increased on systems with many CPU cores in order to amortize
|
|
|
|
// the overhead for passing the blockSearchWork to worker goroutines.
|
|
|
|
const blockSearchWorksPerBatch = 64
|
|
|
|
|
2023-06-20 07:55:12 +02:00
|
|
|
type blockSearchWork struct {
|
|
|
|
// p is the part where the block belongs to.
|
|
|
|
p *part
|
|
|
|
|
2024-05-12 16:33:29 +02:00
|
|
|
// so contains search options for the block search.
|
2023-06-20 07:55:12 +02:00
|
|
|
so *searchOptions
|
|
|
|
|
|
|
|
// bh is the header of the block to search.
|
|
|
|
bh blockHeader
|
|
|
|
}
|
|
|
|
|
2024-05-14 01:49:20 +02:00
|
|
|
func (bsw *blockSearchWork) reset() {
|
|
|
|
bsw.p = nil
|
|
|
|
bsw.so = nil
|
|
|
|
bsw.bh.reset()
|
|
|
|
}
|
|
|
|
|
|
|
|
type blockSearchWorkBatch struct {
|
|
|
|
bsws []blockSearchWork
|
|
|
|
}
|
|
|
|
|
|
|
|
func (bswb *blockSearchWorkBatch) reset() {
|
|
|
|
bsws := bswb.bsws
|
|
|
|
for i := range bsws {
|
|
|
|
bsws[i].reset()
|
|
|
|
}
|
|
|
|
bswb.bsws = bsws[:0]
|
|
|
|
}
|
|
|
|
|
|
|
|
func getBlockSearchWorkBatch() *blockSearchWorkBatch {
|
|
|
|
v := blockSearchWorkBatchPool.Get()
|
|
|
|
if v == nil {
|
|
|
|
return &blockSearchWorkBatch{
|
|
|
|
bsws: make([]blockSearchWork, 0, blockSearchWorksPerBatch),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return v.(*blockSearchWorkBatch)
|
|
|
|
}
|
|
|
|
|
|
|
|
func putBlockSearchWorkBatch(bswb *blockSearchWorkBatch) {
|
|
|
|
bswb.reset()
|
|
|
|
blockSearchWorkBatchPool.Put(bswb)
|
|
|
|
}
|
|
|
|
|
|
|
|
var blockSearchWorkBatchPool sync.Pool
|
|
|
|
|
|
|
|
func (bswb *blockSearchWorkBatch) appendBlockSearchWork(p *part, so *searchOptions, bh *blockHeader) bool {
|
|
|
|
bsws := bswb.bsws
|
|
|
|
|
|
|
|
bsws = append(bsws, blockSearchWork{
|
|
|
|
p: p,
|
|
|
|
so: so,
|
|
|
|
})
|
|
|
|
bsw := &bsws[len(bsws)-1]
|
2023-06-20 07:55:12 +02:00
|
|
|
bsw.bh.copyFrom(bh)
|
2024-05-14 01:49:20 +02:00
|
|
|
|
|
|
|
bswb.bsws = bsws
|
|
|
|
|
|
|
|
return len(bsws) < cap(bsws)
|
2023-06-20 07:55:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func getBlockSearch() *blockSearch {
|
|
|
|
v := blockSearchPool.Get()
|
|
|
|
if v == nil {
|
|
|
|
return &blockSearch{}
|
|
|
|
}
|
|
|
|
return v.(*blockSearch)
|
|
|
|
}
|
|
|
|
|
|
|
|
func putBlockSearch(bs *blockSearch) {
|
|
|
|
bs.reset()
|
2024-09-24 20:51:13 +02:00
|
|
|
|
|
|
|
// reset seenStreams before returning bs to the pool in order to reduce memory usage.
|
|
|
|
bs.seenStreams = nil
|
|
|
|
|
2023-06-20 07:55:12 +02:00
|
|
|
blockSearchPool.Put(bs)
|
|
|
|
}
|
|
|
|
|
|
|
|
var blockSearchPool sync.Pool
|
|
|
|
|
|
|
|
type blockSearch struct {
|
|
|
|
// bsw is the actual work to perform on the given block pointed by bsw.ph
|
|
|
|
bsw *blockSearchWork
|
|
|
|
|
|
|
|
// br contains result for the search in the block after search() call
|
|
|
|
br blockResult
|
|
|
|
|
|
|
|
// timestampsCache contains cached timestamps for the given block.
|
|
|
|
timestampsCache *encoding.Int64s
|
|
|
|
|
|
|
|
// bloomFilterCache contains cached bloom filters for requested columns in the given block
|
|
|
|
bloomFilterCache map[string]*bloomFilter
|
|
|
|
|
|
|
|
// valuesCache contains cached values for requested columns in the given block
|
|
|
|
valuesCache map[string]*stringBucket
|
|
|
|
|
|
|
|
// sbu is used for unmarshaling local columns
|
|
|
|
sbu stringsBlockUnmarshaler
|
|
|
|
|
|
|
|
// csh is the columnsHeader associated with the given block
|
|
|
|
csh columnsHeader
|
2024-05-12 16:33:29 +02:00
|
|
|
|
|
|
|
// a is used for storing unmarshaled data in csh
|
|
|
|
a arena
|
2024-06-11 17:50:32 +02:00
|
|
|
|
2024-09-24 20:51:13 +02:00
|
|
|
// seenStreams contains seen streamIDs for the recent searches.
|
|
|
|
// It is used for speeding up fetching _stream column.
|
|
|
|
seenStreams map[u128]string
|
2023-06-20 07:55:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func (bs *blockSearch) reset() {
|
|
|
|
bs.bsw = nil
|
|
|
|
bs.br.reset()
|
|
|
|
|
|
|
|
if bs.timestampsCache != nil {
|
|
|
|
encoding.PutInt64s(bs.timestampsCache)
|
|
|
|
bs.timestampsCache = nil
|
|
|
|
}
|
|
|
|
|
|
|
|
bloomFilterCache := bs.bloomFilterCache
|
|
|
|
for k, bf := range bloomFilterCache {
|
|
|
|
putBloomFilter(bf)
|
|
|
|
delete(bloomFilterCache, k)
|
|
|
|
}
|
|
|
|
|
|
|
|
valuesCache := bs.valuesCache
|
|
|
|
for k, values := range valuesCache {
|
|
|
|
putStringBucket(values)
|
|
|
|
delete(valuesCache, k)
|
|
|
|
}
|
|
|
|
|
|
|
|
bs.sbu.reset()
|
|
|
|
bs.csh.reset()
|
2024-05-12 16:33:29 +02:00
|
|
|
bs.a.reset()
|
2024-09-24 20:51:13 +02:00
|
|
|
|
|
|
|
// Do not reset seenStreams, since its' lifetime is managed by blockResult.addStreamColumn() code.
|
2023-06-20 07:55:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func (bs *blockSearch) partPath() string {
|
|
|
|
return bs.bsw.p.path
|
|
|
|
}
|
|
|
|
|
2024-05-20 04:08:30 +02:00
|
|
|
func (bs *blockSearch) search(bsw *blockSearchWork, bm *bitmap) {
|
2023-06-20 07:55:12 +02:00
|
|
|
bs.reset()
|
|
|
|
|
|
|
|
bs.bsw = bsw
|
|
|
|
|
2024-05-12 16:33:29 +02:00
|
|
|
bs.csh.initFromBlockHeader(&bs.a, bsw.p, &bsw.bh)
|
2023-06-20 07:55:12 +02:00
|
|
|
|
|
|
|
// search rows matching the given filter
|
2024-05-20 04:08:30 +02:00
|
|
|
bm.init(int(bsw.bh.rowsCount))
|
2023-06-20 07:55:12 +02:00
|
|
|
bm.setBits()
|
2024-05-20 04:08:30 +02:00
|
|
|
bs.bsw.so.filter.applyToBlockSearch(bs, bm)
|
2023-06-20 07:55:12 +02:00
|
|
|
|
|
|
|
if bm.isZero() {
|
2024-05-12 16:33:29 +02:00
|
|
|
// The filter doesn't match any logs in the current block.
|
2023-06-20 07:55:12 +02:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2024-05-20 04:08:30 +02:00
|
|
|
bs.br.mustInit(bs, bm)
|
|
|
|
|
2023-06-20 07:55:12 +02:00
|
|
|
// fetch the requested columns to bs.br.
|
2024-05-12 16:33:29 +02:00
|
|
|
if bs.bsw.so.needAllColumns {
|
2024-09-25 16:16:53 +02:00
|
|
|
bs.br.initAllColumns()
|
2024-05-12 16:33:29 +02:00
|
|
|
} else {
|
2024-09-25 16:16:53 +02:00
|
|
|
bs.br.initRequestedColumns()
|
2023-06-20 07:55:12 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-05-12 16:33:29 +02:00
|
|
|
func (csh *columnsHeader) initFromBlockHeader(a *arena, p *part, bh *blockHeader) {
|
2023-06-20 07:55:12 +02:00
|
|
|
bb := longTermBufPool.Get()
|
|
|
|
columnsHeaderSize := bh.columnsHeaderSize
|
|
|
|
if columnsHeaderSize > maxColumnsHeaderSize {
|
|
|
|
logger.Panicf("FATAL: %s: columns header size cannot exceed %d bytes; got %d bytes", p.path, maxColumnsHeaderSize, columnsHeaderSize)
|
|
|
|
}
|
|
|
|
bb.B = bytesutil.ResizeNoCopyMayOverallocate(bb.B, int(columnsHeaderSize))
|
|
|
|
p.columnsHeaderFile.MustReadAt(bb.B, int64(bh.columnsHeaderOffset))
|
|
|
|
|
2024-05-12 16:33:29 +02:00
|
|
|
if err := csh.unmarshal(a, bb.B); err != nil {
|
2023-06-20 07:55:12 +02:00
|
|
|
logger.Panicf("FATAL: %s: cannot unmarshal columns header: %s", p.path, err)
|
|
|
|
}
|
|
|
|
longTermBufPool.Put(bb)
|
|
|
|
}
|
|
|
|
|
|
|
|
// getBloomFilterForColumn returns bloom filter for the given ch.
|
|
|
|
//
|
|
|
|
// The returned bloom filter belongs to bs, so it becomes invalid after bs reset.
|
|
|
|
func (bs *blockSearch) getBloomFilterForColumn(ch *columnHeader) *bloomFilter {
|
|
|
|
bf := bs.bloomFilterCache[ch.name]
|
|
|
|
if bf != nil {
|
|
|
|
return bf
|
|
|
|
}
|
|
|
|
|
|
|
|
p := bs.bsw.p
|
|
|
|
|
|
|
|
bloomFilterFile := p.fieldBloomFilterFile
|
|
|
|
if ch.name == "" {
|
|
|
|
bloomFilterFile = p.messageBloomFilterFile
|
|
|
|
}
|
|
|
|
|
|
|
|
bb := longTermBufPool.Get()
|
|
|
|
bloomFilterSize := ch.bloomFilterSize
|
|
|
|
if bloomFilterSize > maxBloomFilterBlockSize {
|
|
|
|
logger.Panicf("FATAL: %s: bloom filter block size cannot exceed %d bytes; got %d bytes", bs.partPath(), maxBloomFilterBlockSize, bloomFilterSize)
|
|
|
|
}
|
|
|
|
bb.B = bytesutil.ResizeNoCopyMayOverallocate(bb.B, int(bloomFilterSize))
|
|
|
|
bloomFilterFile.MustReadAt(bb.B, int64(ch.bloomFilterOffset))
|
|
|
|
bf = getBloomFilter()
|
|
|
|
if err := bf.unmarshal(bb.B); err != nil {
|
|
|
|
logger.Panicf("FATAL: %s: cannot unmarshal bloom filter: %s", bs.partPath(), err)
|
|
|
|
}
|
|
|
|
longTermBufPool.Put(bb)
|
|
|
|
|
|
|
|
if bs.bloomFilterCache == nil {
|
|
|
|
bs.bloomFilterCache = make(map[string]*bloomFilter)
|
|
|
|
}
|
|
|
|
bs.bloomFilterCache[ch.name] = bf
|
|
|
|
return bf
|
|
|
|
}
|
|
|
|
|
|
|
|
// getValuesForColumn returns block values for the given ch.
|
|
|
|
//
|
|
|
|
// The returned values belong to bs, so they become invalid after bs reset.
|
|
|
|
func (bs *blockSearch) getValuesForColumn(ch *columnHeader) []string {
|
|
|
|
values := bs.valuesCache[ch.name]
|
|
|
|
if values != nil {
|
|
|
|
return values.a
|
|
|
|
}
|
|
|
|
|
|
|
|
p := bs.bsw.p
|
|
|
|
|
|
|
|
valuesFile := p.fieldValuesFile
|
|
|
|
if ch.name == "" {
|
|
|
|
valuesFile = p.messageValuesFile
|
|
|
|
}
|
|
|
|
|
|
|
|
bb := longTermBufPool.Get()
|
|
|
|
valuesSize := ch.valuesSize
|
|
|
|
if valuesSize > maxValuesBlockSize {
|
|
|
|
logger.Panicf("FATAL: %s: values block size cannot exceed %d bytes; got %d bytes", bs.partPath(), maxValuesBlockSize, valuesSize)
|
|
|
|
}
|
|
|
|
bb.B = bytesutil.ResizeNoCopyMayOverallocate(bb.B, int(valuesSize))
|
|
|
|
valuesFile.MustReadAt(bb.B, int64(ch.valuesOffset))
|
|
|
|
|
|
|
|
values = getStringBucket()
|
|
|
|
var err error
|
|
|
|
values.a, err = bs.sbu.unmarshal(values.a[:0], bb.B, bs.bsw.bh.rowsCount)
|
|
|
|
longTermBufPool.Put(bb)
|
|
|
|
if err != nil {
|
|
|
|
logger.Panicf("FATAL: %s: cannot unmarshal column %q: %s", bs.partPath(), ch.name, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if bs.valuesCache == nil {
|
|
|
|
bs.valuesCache = make(map[string]*stringBucket)
|
|
|
|
}
|
|
|
|
bs.valuesCache[ch.name] = values
|
|
|
|
return values.a
|
|
|
|
}
|
|
|
|
|
|
|
|
// getTimestamps returns timestamps for the given bs.
|
|
|
|
//
|
|
|
|
// The returned timestamps belong to bs, so they become invalid after bs reset.
|
|
|
|
func (bs *blockSearch) getTimestamps() []int64 {
|
|
|
|
timestamps := bs.timestampsCache
|
|
|
|
if timestamps != nil {
|
|
|
|
return timestamps.A
|
|
|
|
}
|
|
|
|
|
|
|
|
p := bs.bsw.p
|
|
|
|
|
|
|
|
bb := longTermBufPool.Get()
|
|
|
|
th := &bs.bsw.bh.timestampsHeader
|
|
|
|
blockSize := th.blockSize
|
|
|
|
if blockSize > maxTimestampsBlockSize {
|
|
|
|
logger.Panicf("FATAL: %s: timestamps block size cannot exceed %d bytes; got %d bytes", bs.partPath(), maxTimestampsBlockSize, blockSize)
|
|
|
|
}
|
|
|
|
bb.B = bytesutil.ResizeNoCopyMayOverallocate(bb.B, int(blockSize))
|
|
|
|
p.timestampsFile.MustReadAt(bb.B, int64(th.blockOffset))
|
|
|
|
|
|
|
|
rowsCount := int(bs.bsw.bh.rowsCount)
|
|
|
|
timestamps = encoding.GetInt64s(rowsCount)
|
|
|
|
var err error
|
|
|
|
timestamps.A, err = encoding.UnmarshalTimestamps(timestamps.A[:0], bb.B, th.marshalType, th.minTimestamp, rowsCount)
|
|
|
|
longTermBufPool.Put(bb)
|
|
|
|
if err != nil {
|
|
|
|
logger.Panicf("FATAL: %s: cannot unmarshal timestamps: %s", bs.partPath(), err)
|
|
|
|
}
|
|
|
|
bs.timestampsCache = timestamps
|
|
|
|
return timestamps.A
|
|
|
|
}
|
|
|
|
|
|
|
|
// mustReadBlockHeaders reads ih block headers from p, appends them to dst and returns the result.
|
|
|
|
func (ih *indexBlockHeader) mustReadBlockHeaders(dst []blockHeader, p *part) []blockHeader {
|
|
|
|
bbCompressed := longTermBufPool.Get()
|
|
|
|
indexBlockSize := ih.indexBlockSize
|
|
|
|
if indexBlockSize > maxIndexBlockSize {
|
|
|
|
logger.Panicf("FATAL: %s: index block size cannot exceed %d bytes; got %d bytes", p.indexFile.Path(), maxIndexBlockSize, indexBlockSize)
|
|
|
|
}
|
|
|
|
bbCompressed.B = bytesutil.ResizeNoCopyMayOverallocate(bbCompressed.B, int(indexBlockSize))
|
|
|
|
p.indexFile.MustReadAt(bbCompressed.B, int64(ih.indexBlockOffset))
|
|
|
|
|
|
|
|
bb := longTermBufPool.Get()
|
|
|
|
var err error
|
|
|
|
bb.B, err = encoding.DecompressZSTD(bb.B, bbCompressed.B)
|
|
|
|
longTermBufPool.Put(bbCompressed)
|
|
|
|
if err != nil {
|
|
|
|
logger.Panicf("FATAL: %s: cannot decompress indexBlock read at offset %d with size %d: %s", p.indexFile.Path(), ih.indexBlockOffset, ih.indexBlockSize, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
dst, err = unmarshalBlockHeaders(dst, bb.B)
|
|
|
|
longTermBufPool.Put(bb)
|
|
|
|
if err != nil {
|
|
|
|
logger.Panicf("FATAL: %s: cannot unmarshal block headers read at offset %d with size %d: %s", p.indexFile.Path(), ih.indexBlockOffset, ih.indexBlockSize, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return dst
|
|
|
|
}
|
2024-09-24 20:51:13 +02:00
|
|
|
|
|
|
|
// getStreamStr returns _stream value for the given block at bs.
|
|
|
|
func (bs *blockSearch) getStreamStr() string {
|
|
|
|
sid := bs.bsw.bh.streamID.id
|
|
|
|
streamStr := bs.seenStreams[sid]
|
|
|
|
if streamStr != "" {
|
|
|
|
// Fast path - streamStr is found in the seenStreams.
|
|
|
|
return streamStr
|
|
|
|
}
|
|
|
|
|
|
|
|
// Slow path - load streamStr from the storage.
|
|
|
|
streamStr = bs.getStreamStrSlow()
|
|
|
|
if streamStr != "" {
|
|
|
|
// Store the found streamStr in seenStreams.
|
|
|
|
if len(bs.seenStreams) > 20_000 {
|
|
|
|
bs.seenStreams = nil
|
|
|
|
}
|
|
|
|
if bs.seenStreams == nil {
|
|
|
|
bs.seenStreams = make(map[u128]string)
|
|
|
|
}
|
|
|
|
bs.seenStreams[sid] = streamStr
|
|
|
|
}
|
|
|
|
return streamStr
|
|
|
|
}
|
|
|
|
|
|
|
|
func (bs *blockSearch) getStreamStrSlow() string {
|
|
|
|
bb := bbPool.Get()
|
|
|
|
defer bbPool.Put(bb)
|
|
|
|
|
|
|
|
bb.B = bs.bsw.p.pt.idb.appendStreamTagsByStreamID(bb.B[:0], &bs.bsw.bh.streamID)
|
|
|
|
if len(bb.B) == 0 {
|
|
|
|
// Couldn't find stream tags by sid. This may be the case when the corresponding log stream
|
|
|
|
// was recently registered and its tags aren't visible to search yet.
|
|
|
|
// The stream tags must become visible in a few seconds.
|
|
|
|
// See https://github.com/VictoriaMetrics/VictoriaMetrics/issues/6042
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
|
|
|
|
st := GetStreamTags()
|
|
|
|
mustUnmarshalStreamTags(st, bb.B)
|
|
|
|
bb.B = st.marshalString(bb.B[:0])
|
|
|
|
PutStreamTags(st)
|
|
|
|
|
|
|
|
return string(bb.B)
|
|
|
|
}
|