/** * Copyright (C) 2020-present MongoDB, Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the Server Side Public License, version 1, * as published by MongoDB, Inc. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * Server Side Public License for more details. * * You should have received a copy of the Server Side Public License * along with this program. If not, see * . * * As a special exception, the copyright holders give permission to link the * code of portions of this program with the OpenSSL library under certain * conditions as described in each individual source file and distribute * linked combinations including the program with the OpenSSL library. You * must comply with the Server Side Public License in all respects for * all of the code used other than as permitted herein. If you modify file(s) * with this exception, you may extend this exception to your version of the * file(s), but you are not obligated to do so. If you do not wish to do so, * delete this exception statement from your version. If you delete this * exception statement from all source files in the program, then also delete * it in the license file. */ #pragma once #include "mongo/db/query/plan_ranker.h" #include "mongo/db/query/sbe_stage_builder.h" namespace mongo::sbe::plan_ranker { /** * Structure with data needed to execute the multi-planning trial period for a single SBE candidate * plan. */ struct CandidatePlanData { stage_builder::PlanStageData stageData; std::unique_ptr tracker; value::SlotAccessor* resultAccessor = nullptr; value::SlotAccessor* recordIdAccessor = nullptr; bool open = false; }; using CandidatePlan = mongo::plan_ranker::BaseCandidatePlan, std::pair>, CandidatePlanData>; /** * A factory function to create a plan ranker for an SBE plan stage stats tree. */ std::unique_ptr> makePlanScorer( const QuerySolution* solution); /** * Helper to calculate productivity if you already know the advances and reads. */ double calculateProductivity(size_t advances, size_t numReads); } // namespace mongo::sbe::plan_ranker