mirror of
https://github.com/milvus-io/milvus.git
synced 2026-07-21 10:15:43 +00:00
XuanYang-cnandGitHub
aa8331d4eb
Derive compaction result segment ID reservations from the expected output segment count instead of fixed ranges. - Estimate output segment counts from total input size and target segment size for single, sort, clustering, storage-version-upgrade, force-merge, and schema-version compactions. - Allocate result segment IDs and task metadata IDs in one contiguous RootCoord block, with the result segment range fixed at the front and metadata IDs consumed from the tail. - Add CompactionView helpers for total input size and collection TTL so scheduler submission paths share the same size-based allocation flow. - Reserve result-segment IDs with dataCoord.compaction.preAllocateIDExpansionFactor so result segment and metadata ID preallocation share the existing compaction ID factor. - Update milvus-proto to e90ee63ad3fc for snapshot export and external restore APIs, and refresh affected service mocks. - Validate nil or external force-merge and schema-version collections before ID allocation, and keep compaction-local oversized allocation rejection before RootCoord AllocN. - Keep schema-version compaction on the current BumpSchemaVersion path and preserve the frozen schema captured by the view. - Cover allocation sizing, range layout, defensive returns, force-merge target counts, schema-version submission, and oversized allocation rejection. See also: #49955 Signed-off-by: yangxuan <xuan.yang@zilliz.com> --------- Signed-off-by: yangxuan <xuan.yang@zilliz.com>
75 lines
2.2 KiB
Go
75 lines
2.2 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 allocator
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/cockroachdb/errors"
|
|
|
|
"github.com/milvus-io/milvus/pkg/v3/util/merr"
|
|
)
|
|
|
|
var errIDExhausted = errors.New("ID is exhausted")
|
|
|
|
// NewIDExhaustedError returns a typed error that still carries the allocator
|
|
// exhaustion signal for in-process control flow.
|
|
func NewIDExhaustedError(start, end, count int64) error {
|
|
return merr.WrapErrServiceInternalErr(errIDExhausted, "ID is exhausted, start=%d, end=%d, count=%d", start, end, count)
|
|
}
|
|
|
|
// IsIDExhausted reports whether err came from allocator ID exhaustion.
|
|
func IsIDExhausted(err error) bool {
|
|
return errors.Is(err, errIDExhausted)
|
|
}
|
|
|
|
// localAllocator implements the Interface.
|
|
// It is constructed from a range of IDs.
|
|
// Once all IDs are allocated, an error will be returned.
|
|
type localAllocator struct {
|
|
mu sync.Mutex
|
|
idStart int64
|
|
idEnd int64
|
|
}
|
|
|
|
func NewLocalAllocator(start, end int64) Interface {
|
|
return &localAllocator{
|
|
idStart: start,
|
|
idEnd: end,
|
|
}
|
|
}
|
|
|
|
func (a *localAllocator) Alloc(count uint32) (int64, int64, error) {
|
|
cnt := int64(count)
|
|
if cnt <= 0 {
|
|
return 0, 0, merr.WrapErrParameterInvalidMsg("non-positive count is not allowed, count=%d", cnt)
|
|
}
|
|
a.mu.Lock()
|
|
defer a.mu.Unlock()
|
|
if a.idStart+cnt > a.idEnd {
|
|
return 0, 0, NewIDExhaustedError(a.idStart, a.idEnd, cnt)
|
|
}
|
|
start := a.idStart
|
|
a.idStart += cnt
|
|
return start, start + cnt, nil
|
|
}
|
|
|
|
func (a *localAllocator) AllocOne() (int64, error) {
|
|
start, _, err := a.Alloc(1)
|
|
return start, err
|
|
}
|