be/src/exec/scan/split_source_connector.h

Source
// Licensed to the Apache Software Foundation (ASF) 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.

#pragma once

#include <functional>

#include "common/config.h"
#include "core/custom_allocator.h"
#include "runtime/runtime_state.h"
#include "util/client_cache.h"

namespace doris {

/*
 * Multiple scanners within a scan node share a split source.
 * Each scanner call `get_next` to get the next scan range. A fast scanner will immediately obtain
 * the next scan range, so there is no situation of data skewing.
 */
class SplitSourceConnector {
public:
    SplitSourceConnector() = default;
    virtual ~SplitSourceConnector() = default;

    /**
     * Get the next scan range. has_next should be to true to fetch the next scan range.
     * @param has_next whether exists the next scan range
     * @param range the obtained next scan range
     */
    virtual Status get_next(bool* has_next, TFileRangeDesc* range) = 0;

    virtual int num_scan_ranges() = 0;

    virtual TFileScanRangeParams* get_params() = 0;

    virtual bool all_scan_ranges_match(
            const TFileScanRangeParams& params,
            const std::function<bool(const TFileScanRangeParams&, const TFileRangeDesc&)>&
                    predicate) {
        (void)params;
        (void)predicate;
        return false;
    }

protected:
    template <typename T, typename V1 = std::vector<T>, typename V2 = std::vector<T>>
        requires(std::is_same_v<std::remove_cvref_t<V1>,
                                std::vector<T, typename V1::allocator_type>> &&
                 std::is_same_v<std::remove_cvref_t<V2>,
                                std::vector<T, typename V2::allocator_type>>)
    void _merge_ranges(V1& merged_ranges, const V2& scan_ranges) {
        if (scan_ranges.size() <= _max_scanners) {
            merged_ranges.assign(scan_ranges.begin(), scan_ranges.end());
            return;
        }

        // There is no need for the number of scanners to exceed the number of threads in thread pool.
        // scan_ranges is sorted by path(as well as partition path) in FE, so merge scan ranges in order.
        // In the insert statement, reading data in partition order can reduce the memory usage of BE
        // and prevent the generation of smaller tables.
        merged_ranges.resize(_max_scanners);
        int num_ranges = static_cast<int>(scan_ranges.size()) / _max_scanners;
        int num_add_one = static_cast<int>(scan_ranges.size()) - num_ranges * _max_scanners;
        int scan_index = 0;
        int range_index = 0;
        for (int i = 0; i < num_add_one; ++i) {
            merged_ranges[scan_index] = scan_ranges[range_index++];
            auto& ranges =
                    merged_ranges[scan_index++].scan_range.ext_scan_range.file_scan_range.ranges;
            for (int j = 0; j < num_ranges; j++) {
                auto& tmp_merged_ranges =
                        scan_ranges[range_index++].scan_range.ext_scan_range.file_scan_range.ranges;
                ranges.insert(ranges.end(), tmp_merged_ranges.begin(), tmp_merged_ranges.end());
            }
        }
        for (int i = num_add_one; i < _max_scanners; ++i) {
            merged_ranges[scan_index] = scan_ranges[range_index++];
            auto& ranges =
                    merged_ranges[scan_index++].scan_range.ext_scan_range.file_scan_range.ranges;
            for (int j = 0; j < num_ranges - 1; j++) {
                auto& tmp_merged_ranges =
                        scan_ranges[range_index++].scan_range.ext_scan_range.file_scan_range.ranges;
                ranges.insert(ranges.end(), tmp_merged_ranges.begin(), tmp_merged_ranges.end());
            }
        }
        LOG(INFO) << "Merge " << scan_ranges.size() << " scan ranges to " << merged_ranges.size();
    }

protected:
    int _max_scanners;
};

/**
 * The file splits are already assigned in `TFileScanRange.ranges`. Scan node has need to
 * fetch the scan ranges from frontend.
 *
 * In cases where the number of files is small, the splits are directly transmitted to backend.
 */
class LocalSplitSourceConnector : public SplitSourceConnector {
private:
    std::mutex _range_lock;
    DorisVector<TScanRangeParams> _scan_ranges;
    int _scan_index = 0;
    int _range_index = 0;

public:
    LocalSplitSourceConnector(const std::vector<TScanRangeParams>& scan_ranges, int max_scanners) {
        _max_scanners = max_scanners;
        _merge_ranges<TScanRangeParams>(_scan_ranges, scan_ranges);
    }

    Status get_next(bool* has_next, TFileRangeDesc* range) override;

    int num_scan_ranges() override { return static_cast<int>(_scan_ranges.size()); }

    TFileScanRangeParams* get_params() override {
        if (_scan_ranges.size() > 0 &&
            _scan_ranges[0].scan_range.ext_scan_range.file_scan_range.__isset.params) {
            // for compatibility.
            return &_scan_ranges[0].scan_range.ext_scan_range.file_scan_range.params;
        }
        throw Exception(
                Status::FatalError("Unreachable, params is got by file_scan_range_params_map"));
    }

    bool all_scan_ranges_match(
            const TFileScanRangeParams& params,
            const std::function<bool(const TFileScanRangeParams&, const TFileRangeDesc&)>&
                    predicate) override {
        if (_scan_ranges.empty()) {
            return false;
        }
        for (const auto& scan_range : _scan_ranges) {
            const auto& file_scan_range = scan_range.scan_range.ext_scan_range.file_scan_range;
            for (const auto& range : file_scan_range.ranges) {
                if (!predicate(params, range)) {
                    return false;
                }
            }
        }
        return true;
    }
};

/**
 * The file splits are lazily generated in frontend, and saved as a split source in frontend.
 * The scan node needs to fetch file splits from the frontend service. Each split source is identified by
 * a unique ID, and the ID is stored in `TFileScanRange.split_source.split_source_id`
 *
 * In the case of a large number of files, backend can scan data while obtaining splits information.
 */
class RemoteSplitSourceConnector : public SplitSourceConnector {
private:
    std::mutex _range_lock;
    RuntimeState* _state;
    RuntimeProfile::Counter* _get_split_timer;
    int64_t _split_source_id;
    int _num_splits;

    DorisVector<TScanRangeLocations> _scan_ranges;
    bool _last_batch = false;
    int _scan_index = 0;
    int _range_index = 0;

public:
    RemoteSplitSourceConnector(RuntimeState* state, RuntimeProfile::Counter* get_split_timer,
                               int64_t split_source_id, int num_splits, int max_scanners)
            : _state(state),
              _get_split_timer(get_split_timer),
              _split_source_id(split_source_id),
              _num_splits(num_splits) {
        _max_scanners = max_scanners;
    }

    Status get_next(bool* has_next, TFileRangeDesc* range) override;

    /*
     * Remote split source is fetched in batch mode, and the splits are generated while scanning,
     * so the number of scan ranges may not be accurate.
     */
    int num_scan_ranges() override { return _num_splits; }

    TFileScanRangeParams* get_params() override {
        throw Exception(
                Status::FatalError("Unreachable, params is got by file_scan_range_params_map"));
    }
};

} // namespace doris

Coverage Report

Created: 2026-07-05 00:48