mirror of
https://gitee.com/milvus-io/milvus.git
synced 2026-01-07 19:31:51 +08:00
232 lines
6.5 KiB
C++
232 lines
6.5 KiB
C++
// Copyright (C) 2019-2020 Zilliz. All rights reserved.
|
|
//
|
|
// Licensed 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
|
|
|
|
#pragma once
|
|
|
|
#include <fcntl.h>
|
|
#include <fmt/core.h>
|
|
#include <google/protobuf/text_format.h>
|
|
#include <sys/mman.h>
|
|
#include <unistd.h>
|
|
|
|
#include <cstring>
|
|
#include <filesystem>
|
|
#include <memory>
|
|
#include <string>
|
|
#include <string_view>
|
|
#include <vector>
|
|
|
|
#include "common/Consts.h"
|
|
#include "common/FieldMeta.h"
|
|
#include "common/LoadInfo.h"
|
|
#include "common/Types.h"
|
|
#include "exceptions/EasyAssert.h"
|
|
#include "knowhere/dataset.h"
|
|
#include "knowhere/expected.h"
|
|
#include "simdjson.h"
|
|
|
|
namespace milvus {
|
|
#define FIELD_DATA(data_array, type) \
|
|
(data_array->scalars().type##_data().data())
|
|
|
|
#define VEC_FIELD_DATA(data_array, type) \
|
|
(data_array->vectors().type##_vector().data())
|
|
|
|
inline DatasetPtr
|
|
GenDataset(const int64_t nb, const int64_t dim, const void* xb) {
|
|
return knowhere::GenDataSet(nb, dim, xb);
|
|
}
|
|
|
|
inline const float*
|
|
GetDatasetDistance(const DatasetPtr& dataset) {
|
|
return dataset->GetDistance();
|
|
}
|
|
|
|
inline const int64_t*
|
|
GetDatasetIDs(const DatasetPtr& dataset) {
|
|
return dataset->GetIds();
|
|
}
|
|
|
|
inline int64_t
|
|
GetDatasetRows(const DatasetPtr& dataset) {
|
|
return dataset->GetRows();
|
|
}
|
|
|
|
inline const void*
|
|
GetDatasetTensor(const DatasetPtr& dataset) {
|
|
return dataset->GetTensor();
|
|
}
|
|
|
|
inline int64_t
|
|
GetDatasetDim(const DatasetPtr& dataset) {
|
|
return dataset->GetDim();
|
|
}
|
|
|
|
inline const size_t*
|
|
GetDatasetLims(const DatasetPtr& dataset) {
|
|
return dataset->GetLims();
|
|
}
|
|
|
|
inline bool
|
|
PrefixMatch(const std::string_view str, const std::string_view prefix) {
|
|
auto ret = strncmp(str.data(), prefix.data(), prefix.length());
|
|
if (ret != 0) {
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
inline DatasetPtr
|
|
GenIdsDataset(const int64_t count, const int64_t* ids) {
|
|
auto ret_ds = std::make_shared<Dataset>();
|
|
ret_ds->SetRows(count);
|
|
ret_ds->SetDim(1);
|
|
ret_ds->SetIds(ids);
|
|
ret_ds->SetIsOwner(false);
|
|
return ret_ds;
|
|
}
|
|
|
|
inline DatasetPtr
|
|
GenResultDataset(const int64_t nq,
|
|
const int64_t topk,
|
|
const int64_t* ids,
|
|
const float* distance) {
|
|
auto ret_ds = std::make_shared<Dataset>();
|
|
ret_ds->SetRows(nq);
|
|
ret_ds->SetDim(topk);
|
|
ret_ds->SetIds(ids);
|
|
ret_ds->SetDistance(distance);
|
|
ret_ds->SetIsOwner(true);
|
|
return ret_ds;
|
|
}
|
|
|
|
inline bool
|
|
PostfixMatch(const std::string_view str, const std::string_view postfix) {
|
|
if (postfix.length() > str.length()) {
|
|
return false;
|
|
}
|
|
|
|
int offset = str.length() - postfix.length();
|
|
auto ret = strncmp(str.data() + offset, postfix.data(), postfix.length());
|
|
if (ret != 0) {
|
|
return false;
|
|
}
|
|
//
|
|
// int i = postfix.length() - 1;
|
|
// int j = str.length() - 1;
|
|
// for (; i >= 0; i--, j--) {
|
|
// if (postfix[i] != str[j]) {
|
|
// return false;
|
|
// }
|
|
// }
|
|
return true;
|
|
}
|
|
|
|
inline int64_t
|
|
upper_align(int64_t value, int64_t align) {
|
|
Assert(align > 0);
|
|
auto groups = value / align + (value % align != 0);
|
|
return groups * align;
|
|
}
|
|
|
|
inline int64_t
|
|
upper_div(int64_t value, int64_t align) {
|
|
Assert(align > 0);
|
|
auto groups = value / align + (value % align != 0);
|
|
return groups;
|
|
}
|
|
|
|
inline bool
|
|
IsMetricType(const std::string_view str,
|
|
const knowhere::MetricType& metric_type) {
|
|
return !strcasecmp(str.data(), metric_type.c_str());
|
|
}
|
|
|
|
inline bool
|
|
IsFloatMetricType(const knowhere::MetricType& metric_type) {
|
|
return IsMetricType(metric_type, knowhere::metric::L2) ||
|
|
IsMetricType(metric_type, knowhere::metric::IP) ||
|
|
IsMetricType(metric_type, knowhere::metric::COSINE);
|
|
}
|
|
|
|
inline bool
|
|
PositivelyRelated(const knowhere::MetricType& metric_type) {
|
|
return IsMetricType(metric_type, knowhere::metric::IP) ||
|
|
IsMetricType(metric_type, knowhere::metric::COSINE);
|
|
}
|
|
|
|
inline std::string
|
|
KnowhereStatusString(knowhere::Status status) {
|
|
switch (status) {
|
|
case knowhere::Status::invalid_args:
|
|
return "invalid args";
|
|
case knowhere::Status::invalid_param_in_json:
|
|
return "invalid param in json";
|
|
case knowhere::Status::out_of_range_in_json:
|
|
return "out of range in json";
|
|
case knowhere::Status::type_conflict_in_json:
|
|
return "type conflict in json";
|
|
case knowhere::Status::invalid_metric_type:
|
|
return "invalid metric type";
|
|
case knowhere::Status::empty_index:
|
|
return "empty index";
|
|
case knowhere::Status::not_implemented:
|
|
return "not implemented";
|
|
case knowhere::Status::index_not_trained:
|
|
return "index not trained";
|
|
case knowhere::Status::index_already_trained:
|
|
return "index already trained";
|
|
case knowhere::Status::faiss_inner_error:
|
|
return "faiss inner error";
|
|
case knowhere::Status::hnsw_inner_error:
|
|
return "hnsw inner error";
|
|
case knowhere::Status::malloc_error:
|
|
return "malloc error";
|
|
case knowhere::Status::diskann_inner_error:
|
|
return "diskann inner error";
|
|
case knowhere::Status::diskann_file_error:
|
|
return "diskann file error";
|
|
case knowhere::Status::invalid_value_in_json:
|
|
return "invalid value in json";
|
|
case knowhere::Status::arithmetic_overflow:
|
|
return "arithmetic overflow";
|
|
case knowhere::Status::raft_inner_error:
|
|
return "raft inner error";
|
|
case knowhere::Status::invalid_binary_set:
|
|
return "invalid binary set";
|
|
default:
|
|
return "unexpected status";
|
|
}
|
|
}
|
|
|
|
inline std::vector<IndexType>
|
|
DISK_INDEX_LIST() {
|
|
static std::vector<IndexType> ret{
|
|
knowhere::IndexEnum::INDEX_DISKANN,
|
|
};
|
|
return ret;
|
|
}
|
|
|
|
template <typename T>
|
|
inline bool
|
|
is_in_list(const T& t, std::function<std::vector<T>()> list_func) {
|
|
auto l = list_func();
|
|
return std::find(l.begin(), l.end(), t) != l.end();
|
|
}
|
|
|
|
inline bool
|
|
is_in_disk_list(const IndexType& index_type) {
|
|
return is_in_list<IndexType>(index_type, DISK_INDEX_LIST);
|
|
}
|
|
|
|
} // namespace milvus
|