Files
milvus/internal/datanode/compactor/compactor_common.go
T
Jamesandxiaofanluan 37f3a829e7 fix: make local storage keys complete paths at every layer (#53145)
issue: #53051, #53052, #53152

## Summary

Align local storage around one path contract: a key is a complete
absolute filesystem path, and the local loon/Arrow filesystem is rooted
at `/`. Previously, some writers used `minio.rootPath` while others
supplied complete local paths to an already-prefixed filesystem, placing
files in different physical locations from those expected by readers and
GC.

Remote keys remain complete bucket-relative object keys; their
filesystem-root convention is unchanged.

## Changes

- Unify Go/C++ local filesystem roots and StorageV3 manifest-base
construction across writers. Preserve the existing base/version pair
when continuing a growing-source manifest.
- Fix local JSON/TEXT stats reads, rejected-stats cleanup, and explore
temporary paths. Exercise resolved V3 stats paths through the actual
`LocalChunkManager.MultiRead` interface.
- Resolve legacy local manifest bases in loaded metadata and locally
referenced snapshots, without eager catalog or manifest-file writes.
Preserve manifest CAS compatibility and pathless V3 summaries;
copy/restore writes use the target storage root.
- Require an absolute, nonempty `localStorage.path` at initialization,
including on remote deployments where it is a cache directory. Freeze
forbidden parameters against configuration-source refresh while
retaining explicit runtime/test overrides, and derive mmap, pprof, and
disk-capacity defaults from the same canonical startup value.
- Make segment deletion prefixes segment-boundary aware, retain
root/identity and snapshot checks, and add BM25 orphan scanning. These
shared GC changes also apply to remote storage; this PR does not claim
every remote code path is untouched.
- Remove the local test-only root override and unused local-only
property initialization chain; use the production storage-config
initialization path.

## Automatic local upgrade

Let `R = localStorage.path` and `M = minio.rootPath`. Before standalone
components start, local deployments check the known legacy locations:

| Existing data | Upgrade handling |
| --- | --- |
| Canonical files under `R/<layout>` | Leave in place. |
| Double-root files under `R/<R-without-leading-slash>/<layout>` | Move
into `R/<layout>` for `insert_log`, `text_log`, `json_stats`,
`index_files`, and `index_v1`. |
| Recognized late-2.6 unified packed indexes under the process CWD |
Move into the corresponding directory under `R`, if visible to the new
process. |
| Legacy manifest base `M/insert_log/<c>/<p>/<s>`, with files under
`R/M/insert_log/<c>/<p>/<s>` | **Do not move the files.** Resolve the
loaded manifest base to that existing absolute location. New segment
layouts use the canonical root; updates to an existing legacy manifest
can retain its base. |

Migration prefers directory/subtree rename and recursively merges
overlapping directories. Cross-filesystem moves fall back to
copy-then-remove. Existing same-name files cause a conflict rather than
content comparison or overwrite, except a published copy recognized as
this migration's own interrupted work. The copy path synchronizes the
file and target directory chain before deleting the source.

Remaining sources are rediscovered on retry; empty legacy directories
are pruned. Once migrated, restarts probe the known old locations
without rescanning canonical data. The initial pass walks legacy file
metadata but does not hash file contents. There is no configured
migration timeout. SIGTERM/SIGINT cancels the migration and prevents
etcd or components from starting; directory walks and cross-filesystem
copies observe cancellation between filesystem reads. A canceled partial
copy is never published and is recopied from the intact source on the
next start.

No user migration script, offline command, reverse migration, journal,
or backup is provided. Successfully moved sources are removed.

## Compatibility and limits

- Preserve the absolute local root, data mounts, and legacy
`minio.rootPath` when upgrading. Canonical 2.6 data stays in place;
misplaced late-2.6 indexes and affected 3.0.0/3.0.1 layouts are handled
as above. Relative roots from older versions are unsupported.
- Automatic migration is standalone/local-only. If old CWD indexes
disappeared with an old container, they cannot be discovered:
preserve/make those files visible or rebuild the derived indexes.
Cross-filesystem copy has no configured timeout and can extend the first
startup, but a shutdown signal cancels it and the next start resumes
from the remaining source.
- Downgrade to the affected old layout is unsupported after migration.
Symlink layouts require manual resolution.
- Known legacy LOB/orphan GC gaps under `R/M/insert_log`, pending old
external-refresh paths, and rare interrupted-copy publication residue
remain outside scope. This is not a claim that every historical file is
recovered or reclaimable.

## Validation

At head `898dba4b41`, `ci-v2/build-ut-cov` passed Build, Code Check,
Integration UT, Go UT, and C++ UT (9,145/9,145). Diff coverage was 100%
for C++ and 81.2% for Go; total patch coverage was 82.8%.

Focused local tests for canonical/frozen `localStorage.path` derivation
and migration cancellation/deadline/copy recovery passed with `-tags
dynamic,test -gcflags='all=-N -l' -count=1`, and `git diff --check`
passed before publication. Full paramtable execution remains locally
blocked by tests attempting to create `/var/lib/milvus/data`;
roles/native-dependent Go tests remain build-blocked by local C++
header/library mismatches. A real 3.0.0/3.0.1 version-to-version upgrade
was not executed locally. `ci-v2/e2e-default` and `ci-v2/go-sdk` are
still pending for this head.

Signed-off-by: xiaofanluan <[email protected]>
Co-authored-by: xiaofanluan <[email protected]>
2026-09-17 09:43:08 +08:00

610 lines
21 KiB
Go

// Licensed to the LF AI & Data foundation under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package compactor
import (
"context"
"fmt"
"sort"
"strconv"
"sync"
"time"
"github.com/samber/lo"
"go.opentelemetry.io/otel"
"golang.org/x/sync/errgroup"
"google.golang.org/protobuf/proto"
"github.com/milvus-io/milvus-proto/go-api/v3/commonpb"
"github.com/milvus-io/milvus-proto/go-api/v3/schemapb"
"github.com/milvus-io/milvus/internal/allocator"
"github.com/milvus-io/milvus/internal/compaction"
"github.com/milvus-io/milvus/internal/datanode/util"
"github.com/milvus-io/milvus/internal/metastore/kv/binlog"
"github.com/milvus-io/milvus/internal/storage"
"github.com/milvus-io/milvus/internal/storagev2/packed"
"github.com/milvus-io/milvus/internal/util/analyzer"
"github.com/milvus-io/milvus/internal/util/fileresource"
"github.com/milvus-io/milvus/internal/util/hookutil"
"github.com/milvus-io/milvus/internal/util/indexcgowrapper"
"github.com/milvus-io/milvus/pkg/v3/common"
"github.com/milvus-io/milvus/pkg/v3/mlog"
"github.com/milvus-io/milvus/pkg/v3/proto/datapb"
"github.com/milvus-io/milvus/pkg/v3/proto/indexcgopb"
"github.com/milvus-io/milvus/pkg/v3/proto/indexpb"
"github.com/milvus-io/milvus/pkg/v3/util/merr"
"github.com/milvus-io/milvus/pkg/v3/util/metautil"
"github.com/milvus-io/milvus/pkg/v3/util/tsoutil"
"github.com/milvus-io/milvus/pkg/v3/util/typeutil"
)
const compactionBatchSize = 100
func createTextIndex(ctx context.Context,
cm storage.ChunkManager,
plan *datapb.CompactionPlan,
compactionParams compaction.Params,
storageVersion int64,
collectionID int64,
partitionID int64,
segmentID int64,
taskID int64,
segment *datapb.CompactionSegment,
) (map[int64]*datapb.TextIndexStats, error) {
log := mlog.With(
mlog.FieldCollectionID(collectionID),
mlog.FieldPartitionID(partitionID),
mlog.FieldSegmentID(segmentID),
)
fieldBinlogs := lo.GroupBy(segment.GetInsertLogs(), func(binlog *datapb.FieldBinlog) int64 {
return binlog.GetFieldID()
})
getInsertFiles := func(fieldID int64) ([]string, error) {
if storageVersion == storage.StorageV2 || storageVersion == storage.StorageV3 {
return []string{}, nil
}
binlogs, ok := fieldBinlogs[fieldID]
if !ok {
return nil, merr.WrapErrParameterInvalidMsg("field binlog not found for field %d", fieldID)
}
result := make([]string, 0, len(binlogs))
for _, binlog := range binlogs {
for _, file := range binlog.GetBinlogs() {
result = append(result, metautil.BuildInsertLogPath(compactionParams.StorageConfig.GetRootPath(),
collectionID, partitionID, segmentID, fieldID, file.GetLogID()))
}
}
return result, nil
}
newStorageConfig, err := util.ParseStorageConfig(compactionParams.StorageConfig)
if err != nil {
return nil, err
}
pluginContext, err := hookutil.GetCPluginContext(plan.GetPluginContext(), collectionID)
if err != nil {
return nil, err
}
var (
mu sync.Mutex
textIndexLogs = make(map[int64]*datapb.TextIndexStats)
)
eg, egCtx := errgroup.WithContext(ctx)
var analyzerExtraInfo string
if len(plan.GetFileResources()) > 0 && fileresource.GlobalFileManager.Mode() == fileresource.RefMode {
err := fileresource.GlobalFileManager.Download(ctx, cm, plan.GetFileResources()...)
if err != nil {
return nil, err
}
defer fileresource.GlobalFileManager.Release(plan.GetFileResources()...)
analyzerExtraInfo, err = analyzer.BuildExtraResourceInfo(compactionParams.StorageConfig.GetRootPath(), plan.GetFileResources())
if err != nil {
return nil, err
}
}
for _, field := range plan.GetSchema().GetFields() {
field := field
h := typeutil.CreateFieldSchemaHelper(field)
if !h.EnableMatch() {
continue
}
log.Info(ctx, "field enable match, ready to create text index", mlog.Int64("field id", field.GetFieldID()))
eg.Go(func() error {
files, err := getInsertFiles(field.GetFieldID())
if err != nil {
return err
}
statsBasePath := metautil.BuildTextIndexPrefix(compactionParams.StorageConfig.GetRootPath(),
plan.GetPlanID(), 0, collectionID, partitionID, segmentID, field.GetFieldID())
if segment.GetManifest() != "" {
basePath, _, err := packed.UnmarshalManifestPath(segment.GetManifest())
if err != nil {
return merr.Wrap(err, "failed to unmarshal manifest path for text_index basePath")
}
statsBasePath = fmt.Sprintf("%s/_stats/text_index.%d", basePath, field.GetFieldID())
}
buildIndexParams := &indexcgopb.BuildIndexInfo{
BuildID: taskID,
CollectionID: collectionID,
PartitionID: partitionID,
SegmentID: segmentID,
IndexVersion: 0,
InsertFiles: files,
FieldSchema: field,
StorageConfig: newStorageConfig,
CurrentScalarIndexVersion: common.ClampScalarIndexVersion(plan.GetCurrentScalarIndexVersion()),
StorageVersion: storageVersion,
Manifest: segment.GetManifest(),
StatsBasePath: statsBasePath,
StoragePluginContext: pluginContext,
IndexParams: []*commonpb.KeyValuePair{
{Key: "index_type", Value: "INVERTED"},
{Key: "is_text_match", Value: "true"},
},
}
if len(analyzerExtraInfo) > 0 {
buildIndexParams.AnalyzerExtraInfo = analyzerExtraInfo
}
if storageVersion == storage.StorageV2 || storageVersion == storage.StorageV3 {
buildIndexParams.SegmentInsertFiles = util.GetSegmentInsertFiles(
segment.GetInsertLogs(),
compactionParams.StorageConfig,
collectionID,
partitionID,
segmentID)
}
index, err := indexcgowrapper.CreateIndex(egCtx, buildIndexParams)
if err != nil {
return err
}
defer index.Delete()
indexStats, err := index.UpLoad()
if err != nil {
return err
}
uploaded := make(map[string]int64)
for _, info := range indexStats.GetSerializedIndexInfos() {
uploaded[info.FileName] = info.FileSize
}
statsFiles := metautil.BuildStatsFilePaths(statsBasePath, lo.Keys(uploaded))
mu.Lock()
totalSize := lo.SumBy(lo.Values(uploaded), func(fileSize int64) int64 { return fileSize })
textIndexLogs[field.GetFieldID()] = &datapb.TextIndexStats{
FieldID: field.GetFieldID(),
Version: 0,
BuildID: taskID,
Files: statsFiles,
LogSize: totalSize,
MemorySize: totalSize,
CurrentScalarIndexVersion: common.ClampScalarIndexVersion(plan.GetCurrentScalarIndexVersion()),
}
mu.Unlock()
log.Info(ctx, "field enable match, create text index done",
mlog.FieldSegmentID(segmentID),
mlog.Int64("field id", field.GetFieldID()),
mlog.Strings("files", statsFiles),
)
return nil
})
}
if err := eg.Wait(); err != nil {
return nil, err
}
return textIndexLogs, nil
}
// V1 readers do not share compaction's schema-reconciliation contract, so filter physical fields before opening them.
func newCompactionSegmentRecordReader(ctx context.Context, segment *datapb.CompactionSegmentBinlogs, schema *schemapb.CollectionSchema, storageConfig *indexpb.StorageConfig, opts ...storage.RwOption) (storage.RecordReader, map[int64]struct{}, error) {
existingFields, err := compactionSegmentStorageFields(segment, storageConfig)
if err != nil {
return nil, nil, err
}
return newCompactionSegmentRecordReaderWithFields(ctx, segment, schema, storageConfig, existingFields, opts...)
}
func newTextDecodedCompactionSegmentRecordReader(
ctx context.Context,
segment *datapb.CompactionSegmentBinlogs,
schema *schemapb.CollectionSchema,
storageConfig *indexpb.StorageConfig,
textColumnConfigs []packed.TextColumnConfig,
opts ...storage.RwOption,
) (storage.RecordReader, map[int64]struct{}, error) {
if segment.GetManifest() == "" || len(textColumnConfigs) == 0 {
return newCompactionSegmentRecordReader(ctx, segment, schema, storageConfig, opts...)
}
existingFields, err := compactionSegmentStorageFields(segment, storageConfig)
if err != nil {
return nil, nil, err
}
readSchema := compactionReadSchema(schema, existingFields)
reader, err := storage.NewTextDecodedManifestRecordReader(
ctx,
segment.GetManifest(),
readSchema,
textColumnConfigs,
append(opts, storage.WithPresentFields(existingFields))...,
)
return reader, existingFields, err
}
func compactionSegmentStorageFields(segment *datapb.CompactionSegmentBinlogs, storageConfig *indexpb.StorageConfig) (map[int64]struct{}, error) {
if segment.GetManifest() != "" {
return packed.GetManifestFieldIDs(segment.GetManifest(), storageConfig)
}
return compactionSegmentBinlogFields(segment), nil
}
func compactionSegmentBinlogFields(segment *datapb.CompactionSegmentBinlogs) map[int64]struct{} {
fields := make(map[int64]struct{})
for _, fieldBinlog := range segment.GetFieldBinlogs() {
if len(fieldBinlog.GetChildFields()) == 0 {
fields[fieldBinlog.GetFieldID()] = struct{}{}
continue
}
for _, childFieldID := range fieldBinlog.GetChildFields() {
fields[childFieldID] = struct{}{}
}
}
return fields
}
func collectionSchemaFields(schema *schemapb.CollectionSchema) map[int64]struct{} {
fields := make(map[int64]struct{}, typeutil.GetTotalFieldsNum(schema))
for _, field := range typeutil.GetAllFieldSchemas(schema) {
fields[field.GetFieldID()] = struct{}{}
}
return fields
}
func droppedSchemaFieldIDs(schema *schemapb.CollectionSchema, existingFields map[int64]struct{}) []int64 {
targetFields := collectionSchemaFields(schema)
dropped := make([]int64, 0)
for fieldID := range existingFields {
if fieldID < common.StartOfUserFieldID {
continue
}
if _, ok := targetFields[fieldID]; !ok {
dropped = append(dropped, fieldID)
}
}
sort.Slice(dropped, func(i, j int) bool { return dropped[i] < dropped[j] })
return dropped
}
func segmentDroppedFieldIDs(schema *schemapb.CollectionSchema, segment *datapb.CompactionSegmentBinlogs, storageConfig *indexpb.StorageConfig) ([]int64, error) {
existingFields, err := compactionSegmentStorageFields(segment, storageConfig)
if err != nil {
return nil, err
}
return droppedSchemaFieldIDs(schema, existingFields), nil
}
func newCompactionSegmentRecordReaderWithFields(ctx context.Context, segment *datapb.CompactionSegmentBinlogs, schema *schemapb.CollectionSchema, storageConfig *indexpb.StorageConfig, existingFields map[int64]struct{}, opts ...storage.RwOption) (storage.RecordReader, map[int64]struct{}, error) {
readSchema := compactionReadSchema(schema, existingFields)
if segment.GetManifest() != "" {
// existingFields is already the manifest's physically-present field set
// (compactionSegmentStorageFields called GetManifestFieldIDs on the same
// manifest); hand it over so the reader does not re-open the manifest.
reader, err := storage.NewManifestRecordReader(ctx, segment.GetManifest(), readSchema,
append(opts, storage.WithPresentFields(existingFields))...)
return reader, existingFields, err
}
// Keep the complete packed path vector: V2 file metadata addresses column
// groups by path index, and the packed reader projects readSchema internally.
// V1 binlogs are independent per-field files and must still be filtered because
// its reader does not safely ignore blobs whose field is absent from readSchema.
fieldBinlogs := lo.Compact(segment.GetFieldBinlogs())
if segment.GetStorageVersion() == storage.StorageV1 {
fieldBinlogs = filterV1CompactionFieldBinlogs(fieldBinlogs, collectionSchemaFields(readSchema))
}
rootPath := ""
if storageConfig != nil {
rootPath = storageConfig.GetRootPath()
}
if err := binlog.DecompressBinLogWithRootPath(rootPath, storage.InsertBinlog,
segment.GetCollectionID(), segment.GetPartitionID(), segment.GetSegmentID(), fieldBinlogs); err != nil {
return nil, nil, err
}
reader, err := storage.NewBinlogRecordReader(ctx, fieldBinlogs, readSchema, opts...)
return reader, existingFields, err
}
func compactionReadSchema(schema *schemapb.CollectionSchema, existingFields map[int64]struct{}) *schemapb.CollectionSchema {
if schema == nil {
return nil
}
readSchema := proto.Clone(schema).(*schemapb.CollectionSchema)
fields := make([]*schemapb.FieldSchema, 0, len(readSchema.GetFields()))
for _, field := range readSchema.GetFields() {
if compactionFieldReadable(field, existingFields) {
fields = append(fields, field)
}
}
readSchema.Fields = fields
// StructArray fields are physically indivisible. Keep every child in the
// read schema so a partially-present struct cannot be hidden by projection;
// schema-bump preflight rejects that state before the reader is opened.
return readSchema
}
// compactionFieldReadable keeps a field in the read schema when it is
// physically present, or when the reader layer can synthesize it (absent
// ordinary fields are reader-filled with default/null). Only function outputs
// missing from storage are excluded: storage cannot synthesize them and the
// RecordMaterializer computes them instead.
func compactionFieldReadable(field *schemapb.FieldSchema, existingFields map[int64]struct{}) bool {
if _, ok := existingFields[field.GetFieldID()]; ok {
return true
}
return !field.GetIsFunctionOutput()
}
// validateSchemaBumpIntegrity checks the persisted schema against the physical
// field set during schema-bump preflight. Function output ownership is
// represented both by FunctionSchema.OutputFieldIds and
// FieldSchema.IsFunctionOutput, so the two representations must agree and each
// output field must have exactly one owning function.
// StructArray fields are physically all-or-nothing and cannot contain function
// outputs, which are top-level fields by schema contract.
func validateSchemaBumpIntegrity(schema *schemapb.CollectionSchema, existingFields map[int64]struct{}) (map[int64]struct{}, error) {
declaredFunctionOutputs := make(map[int64]struct{})
outputOwners := make(map[int64]int)
topLevelFields := make(map[int64]*schemapb.FieldSchema, len(schema.GetFields()))
for _, field := range schema.GetFields() {
topLevelFields[field.GetFieldID()] = field
}
for functionIndex, functionSchema := range schema.GetFunctions() {
for _, outputFieldID := range functionSchema.GetOutputFieldIds() {
if ownerIndex, duplicate := outputOwners[outputFieldID]; duplicate {
if ownerIndex == functionIndex {
return nil, merr.WrapErrDataIntegrityMsg(
"function %s declares output field %d more than once",
functionSchema.GetName(), outputFieldID)
}
return nil, merr.WrapErrDataIntegrityMsg(
"function output field %d is declared by both function %s and function %s",
outputFieldID, schema.GetFunctions()[ownerIndex].GetName(), functionSchema.GetName())
}
outputOwners[outputFieldID] = functionIndex
declaredFunctionOutputs[outputFieldID] = struct{}{}
field, ok := topLevelFields[outputFieldID]
if !ok {
if typeutil.GetField(schema, outputFieldID) != nil {
return nil, merr.WrapErrDataIntegrityMsg(
"function %s output field %d must be a top-level field",
functionSchema.GetName(), outputFieldID)
}
return nil, merr.WrapErrDataIntegrityMsg(
"function %s output field %d not found in persisted schema",
functionSchema.GetName(), outputFieldID)
}
if !field.GetIsFunctionOutput() {
return nil, merr.WrapErrDataIntegrityMsg(
"function %s output field %d is not marked as a function output",
functionSchema.GetName(), outputFieldID)
}
}
}
for _, field := range schema.GetFields() {
if !field.GetIsFunctionOutput() {
continue
}
if _, hasProducer := declaredFunctionOutputs[field.GetFieldID()]; !hasProducer {
return nil, merr.WrapErrDataIntegrityMsg(
"function output field %d has no producing function", field.GetFieldID())
}
}
for _, structField := range schema.GetStructArrayFields() {
presentChildren := 0
for _, childField := range structField.GetFields() {
if childField.GetIsFunctionOutput() {
return nil, merr.WrapErrDataIntegrityMsg(
"struct array field %d child field %d cannot be a function output",
structField.GetFieldID(), childField.GetFieldID())
}
if _, present := existingFields[childField.GetFieldID()]; present {
presentChildren++
}
}
if presentChildren != 0 && presentChildren != len(structField.GetFields()) {
return nil, merr.WrapErrDataIntegrityMsg(
"struct array field %d is partially present: %d of %d children exist",
structField.GetFieldID(), presentChildren, len(structField.GetFields()))
}
}
return declaredFunctionOutputs, nil
}
func filterV1CompactionFieldBinlogs(fieldBinlogs []*datapb.FieldBinlog, readFields map[int64]struct{}) []*datapb.FieldBinlog {
filtered := make([]*datapb.FieldBinlog, 0, len(fieldBinlogs))
for _, fieldBinlog := range fieldBinlogs {
if fieldBinlog == nil {
continue
}
if _, ok := readFields[fieldBinlog.GetFieldID()]; ok {
filtered = append(filtered, fieldBinlog)
}
}
return filtered
}
type EntityFilter struct {
deletedPkTs map[interface{}]typeutil.Timestamp // pk2ts
ttl int64 // nanoseconds
currentTime time.Time
expiredCount int
deletedCount int
}
func newEntityFilter(deletedPkTs map[interface{}]typeutil.Timestamp, ttl int64, currTime time.Time) *EntityFilter {
if deletedPkTs == nil {
deletedPkTs = make(map[interface{}]typeutil.Timestamp)
}
return &EntityFilter{
deletedPkTs: deletedPkTs,
ttl: ttl,
currentTime: currTime,
}
}
func (filter *EntityFilter) Filtered(pk any, ts typeutil.Timestamp) bool {
if filter.isEntityDeleted(pk, ts) {
filter.deletedCount++
return true
}
// Filtering expired entity
if filter.isEntityExpired(ts) {
filter.expiredCount++
return true
}
return false
}
func (filter *EntityFilter) GetExpiredCount() int {
return filter.expiredCount
}
func (filter *EntityFilter) GetDeletedCount() int {
return filter.deletedCount
}
func (filter *EntityFilter) GetDeltalogDeleteCount() int {
return len(filter.deletedPkTs)
}
func (filter *EntityFilter) GetMissingDeleteCount() int {
diff := filter.GetDeltalogDeleteCount() - filter.GetDeletedCount()
if diff <= 0 {
diff = 0
}
return diff
}
func (filter *EntityFilter) isEntityDeleted(pk interface{}, pkTs typeutil.Timestamp) bool {
if deleteTs, ok := filter.deletedPkTs[pk]; ok {
// insert task and delete task has the same ts when upsert
// here should be < instead of <=
// to avoid the upsert data to be deleted after compact
if pkTs < deleteTs {
return true
}
}
return false
}
func (filter *EntityFilter) isEntityExpired(entityTs typeutil.Timestamp) bool {
// entity expire is not enabled if duration <= 0
if filter.ttl <= 0 {
return false
}
entityTime, _ := tsoutil.ParseTS(entityTs)
// this dur can represents 292 million years before or after 1970, enough for milvus
// ttl calculation
dur := filter.currentTime.UnixMilli() - entityTime.UnixMilli()
// filter.ttl is nanoseconds
return filter.ttl/int64(time.Millisecond) <= dur
}
// TODO: remove, used in test only
func serializeWrite(ctx context.Context, allocator allocator.Interface, writer *SegmentWriter) (kvs map[string][]byte, fieldBinlogs map[int64]*datapb.FieldBinlog, err error) {
_, span := otel.Tracer(typeutil.DataNodeRole).Start(ctx, "serializeWrite")
defer span.End()
blobs, tr, err := writer.SerializeYield()
startID, _, err := allocator.Alloc(uint32(len(blobs)))
if err != nil {
return nil, nil, err
}
kvs = make(map[string][]byte)
fieldBinlogs = make(map[int64]*datapb.FieldBinlog)
for i := range blobs {
// Blob Key is generated by Serialize from int64 fieldID in collection schema, which won't raise error in ParseInt
fID, _ := strconv.ParseInt(blobs[i].GetKey(), 10, 64)
key, _ := binlog.BuildLogPath(storage.InsertBinlog, writer.GetCollectionID(), writer.GetPartitionID(), writer.GetSegmentID(), fID, startID+int64(i))
kvs[key] = blobs[i].GetValue()
fieldBinlogs[fID] = &datapb.FieldBinlog{
FieldID: fID,
Binlogs: []*datapb.Binlog{
{
LogSize: int64(len(blobs[i].GetValue())),
MemorySize: blobs[i].GetMemorySize(),
LogPath: key,
EntriesNum: blobs[i].RowNum,
TimestampFrom: tr.GetMinTimestamp(),
TimestampTo: tr.GetMaxTimestamp(),
},
},
}
}
return
}
func getTTLFieldID(schema *schemapb.CollectionSchema) int64 {
ttlFieldName := ""
for _, pair := range schema.GetProperties() {
if pair.GetKey() == common.CollectionTTLFieldKey {
ttlFieldName = pair.GetValue()
break
}
}
if ttlFieldName == "" {
return -1
}
for _, field := range schema.GetFields() {
if field.GetName() == ttlFieldName && field.GetDataType() == schemapb.DataType_Timestamptz {
return field.GetFieldID()
}
}
return -1
}