Loading core/src/scheduler/job/SearchJob.h +4 −0 Original line number Diff line number Diff line Loading @@ -90,6 +90,10 @@ class SearchJob : public Job { return index_files_; } std::mutex& mutex() { return mutex_; } private: uint64_t topk_ = 0; uint64_t nq_ = 0; Loading core/src/scheduler/task/SearchTask.cpp +4 −1 Original line number Diff line number Diff line Loading @@ -219,8 +219,11 @@ XSearchTask::Execute() { // step 3: pick up topk result auto spec_k = index_engine_->Count() < topk ? index_engine_->Count() : topk; { std::unique_lock<std::mutex> lock(search_job->mutex()); XSearchTask::MergeTopkToResultSet(output_ids, output_distance, spec_k, nq, topk, metric_l2, search_job->GetResult()); } span = rc.RecordSection(hdr + ", reduce topk"); // search_job->AccumReduceCost(span); Loading Loading
core/src/scheduler/job/SearchJob.h +4 −0 Original line number Diff line number Diff line Loading @@ -90,6 +90,10 @@ class SearchJob : public Job { return index_files_; } std::mutex& mutex() { return mutex_; } private: uint64_t topk_ = 0; uint64_t nq_ = 0; Loading
core/src/scheduler/task/SearchTask.cpp +4 −1 Original line number Diff line number Diff line Loading @@ -219,8 +219,11 @@ XSearchTask::Execute() { // step 3: pick up topk result auto spec_k = index_engine_->Count() < topk ? index_engine_->Count() : topk; { std::unique_lock<std::mutex> lock(search_job->mutex()); XSearchTask::MergeTopkToResultSet(output_ids, output_distance, spec_k, nq, topk, metric_l2, search_job->GetResult()); } span = rc.RecordSection(hdr + ", reduce topk"); // search_job->AccumReduceCost(span); Loading