CLBVHDualTreeTraversal.hpp

Go to the documentation of this file.

// -------------------------------------------------------//
//
// SHAMROCK code for hydrodynamics
// Copyright (c) 2021-2026 Timothée David--Cléris <tim.shamrock@proton.me>
// SPDX-License-Identifier: CeCILL Free Software License Agreement v2.1
// Shamrock is licensed under the CeCILL 2.1 License, see LICENSE for more information
//
// -------------------------------------------------------//
 
#pragma once

 
#include "shambackends/DeviceScheduler.hpp"
#include "shambackends/vec.hpp"
#include "shamtree/CompressedLeafBVH.hpp"
#include <string>
#include <vector>
 
namespace shamtree {

    struct DTTResult {
        sham::DeviceBuffer<u32_2> node_interactions_m2l;
        sham::DeviceBuffer<u32_2> node_interactions_p2p;
 
        struct OrderedResult {
            sham::DeviceBuffer<u32> offset_m2l;
            sham::DeviceBuffer<u32> offset_p2p;
        };
 
        std::optional<OrderedResult> ordered_result;
 
        bool is_ordered() const { return ordered_result.has_value(); }
    };

    template<class Tmorton, class Tvec, u32 dim>
    DTTResult clbvh_dual_tree_traversal(
        sham::DeviceScheduler_ptr dev_sched,
        const CompressedLeafBVH<Tmorton, Tvec, dim> &bvh,
        shambase::VecComponent<Tvec> theta_crit,
        bool ordered_result      = false,
        bool allow_leaf_lowering = false);

    namespace impl {

        std::vector<std::string> get_default_impl_list_clbvh_dual_tree_traversal();

        std::string get_current_impl_clbvh_dual_tree_traversal_impl();

        bool is_impl_set_clbvh_dual_tree_traversal();

        void set_impl_clbvh_dual_tree_traversal(const std::string &impl);

        void autoselect_impl_clbvh_dual_tree_traversal(const sham::DeviceScheduler_ptr &dev_sched);
 
    } // namespace impl
 
} // namespace shamtree