// MIT License
//
// Copyright (c) 2020-2024 Advanced Micro Devices, Inc. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

#include "common_benchmark_header.hpp"

#include <memory>
#include <type_traits>

// HIP API
#include "hipcub/device/device_radix_sort.hpp"

#ifndef DEFAULT_N
const size_t DEFAULT_N = 1024 * 1024 * 32;
#endif

const unsigned int batch_size  = 10;
const unsigned int warmup_size = 5;

template<class Key>
std::vector<Key> generate_keys(size_t size)
{
    using key_type = Key;

    if(std::is_floating_point<key_type>::value)
    {
        return benchmark_utils::get_random_data<key_type>(size,
                                                          (key_type)-1000,
                                                          (key_type) + 1000,
                                                          size);
    } else
    {
        return benchmark_utils::get_random_data<key_type>(size,
                                                          std::numeric_limits<key_type>::min(),
                                                          std::numeric_limits<key_type>::max(),
                                                          size);
    }
}

template<bool Descending, class Key>
auto invoke_sort_keys(void*       d_temp_storage,
                      size_t&     temp_storage_bytes,
                      Key*        d_keys_input,
                      Key*        d_keys_output,
                      size_t      size,
                      hipStream_t stream)
    -> std::enable_if_t<!Descending && !benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortKeys(d_temp_storage,
                                             temp_storage_bytes,
                                             d_keys_input,
                                             d_keys_output,
                                             size,
                                             0,
                                             sizeof(Key) * 8,
                                             stream);
}

template<bool Descending, class Key>
auto invoke_sort_keys(void*       d_temp_storage,
                      size_t&     temp_storage_bytes,
                      Key*        d_keys_input,
                      Key*        d_keys_output,
                      size_t      size,
                      hipStream_t stream)
    -> std::enable_if_t<Descending && !benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortKeysDescending(d_temp_storage,
                                                       temp_storage_bytes,
                                                       d_keys_input,
                                                       d_keys_output,
                                                       size,
                                                       0,
                                                       sizeof(Key) * 8,
                                                       stream);
}

template<bool Descending, class Key>
auto invoke_sort_keys(void*       d_temp_storage,
                      size_t&     temp_storage_bytes,
                      Key*        d_keys_input,
                      Key*        d_keys_output,
                      size_t      size,
                      hipStream_t stream)
    -> std::enable_if_t<!Descending && benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortKeys(d_temp_storage,
                                             temp_storage_bytes,
                                             d_keys_input,
                                             d_keys_output,
                                             size,
                                             benchmark_utils::custom_type_decomposer<Key>{},
                                             stream);
}

template<bool Descending, class Key>
auto invoke_sort_keys(void*       d_temp_storage,
                      size_t&     temp_storage_bytes,
                      Key*        d_keys_input,
                      Key*        d_keys_output,
                      size_t      size,
                      hipStream_t stream)
    -> std::enable_if_t<Descending && benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortKeysDescending(
        d_temp_storage,
        temp_storage_bytes,
        d_keys_input,
        d_keys_output,
        size,
        benchmark_utils::custom_type_decomposer<Key>{},
        stream);
}

template<class Key, bool Descending = false>
void run_sort_keys_benchmark(benchmark::State&                 state,
                             hipStream_t                       stream,
                             size_t                            size,
                             std::shared_ptr<std::vector<Key>> keys_input)
{
    using key_type = Key;
    key_type* d_keys_input;
    key_type* d_keys_output;
    HIP_CHECK(hipMalloc(&d_keys_input, size * sizeof(key_type)));
    HIP_CHECK(hipMalloc(&d_keys_output, size * sizeof(key_type)));
    HIP_CHECK(hipMemcpy(d_keys_input,
                        keys_input->data(),
                        size * sizeof(key_type),
                        hipMemcpyHostToDevice));

    void*  d_temporary_storage     = nullptr;
    size_t temporary_storage_bytes = 0;
    HIP_CHECK(invoke_sort_keys<Descending>(d_temporary_storage,
                                           temporary_storage_bytes,
                                           d_keys_input,
                                           d_keys_output,
                                           size,
                                           stream));

    HIP_CHECK(hipMalloc(&d_temporary_storage, temporary_storage_bytes));
    HIP_CHECK(hipDeviceSynchronize());

    // Warm-up
    for(size_t i = 0; i < warmup_size; i++)
    {
        HIP_CHECK(invoke_sort_keys<Descending>(d_temporary_storage,
                                               temporary_storage_bytes,
                                               d_keys_input,
                                               d_keys_output,
                                               size,
                                               stream));
    }
    HIP_CHECK(hipDeviceSynchronize());

    for(auto _ : state)
    {
        auto start = std::chrono::high_resolution_clock::now();

        for(size_t i = 0; i < batch_size; i++)
        {
            HIP_CHECK(invoke_sort_keys<Descending>(d_temporary_storage,
                                                   temporary_storage_bytes,
                                                   d_keys_input,
                                                   d_keys_output,
                                                   size,
                                                   stream));
        }
        HIP_CHECK(hipDeviceSynchronize());

        auto end = std::chrono::high_resolution_clock::now();
        auto elapsed_seconds
            = std::chrono::duration_cast<std::chrono::duration<double>>(end - start);
        state.SetIterationTime(elapsed_seconds.count());
    }
    state.SetBytesProcessed(state.iterations() * batch_size * size * sizeof(key_type));
    state.SetItemsProcessed(state.iterations() * batch_size * size);

    HIP_CHECK(hipFree(d_temporary_storage));
    HIP_CHECK(hipFree(d_keys_input));
    HIP_CHECK(hipFree(d_keys_output));
}

template<bool Descending, class Key, class Value>
auto invoke_sort_pairs(void*       d_temp_storage,
                       size_t&     temp_storage_bytes,
                       Key*        d_keys_input,
                       Key*        d_keys_output,
                       Value*      d_values_input,
                       Value*      d_values_output,
                       size_t      size,
                       hipStream_t stream)
    -> std::enable_if_t<!Descending && !benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortPairs(d_temp_storage,
                                              temp_storage_bytes,
                                              d_keys_input,
                                              d_keys_output,
                                              d_values_input,
                                              d_values_output,
                                              size,
                                              0,
                                              sizeof(Key) * 8,
                                              stream);
}

template<bool Descending, class Key, class Value>
auto invoke_sort_pairs(void*       d_temp_storage,
                       size_t&     temp_storage_bytes,
                       Key*        d_keys_input,
                       Key*        d_keys_output,
                       Value*      d_values_input,
                       Value*      d_values_output,
                       size_t      size,
                       hipStream_t stream)
    -> std::enable_if_t<Descending && !benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortPairsDescending(d_temp_storage,
                                                        temp_storage_bytes,
                                                        d_keys_input,
                                                        d_keys_output,
                                                        d_values_input,
                                                        d_values_output,
                                                        size,
                                                        0,
                                                        sizeof(Key) * 8,
                                                        stream);
}

template<bool Descending, class Key, class Value>
auto invoke_sort_pairs(void*       d_temp_storage,
                       size_t&     temp_storage_bytes,
                       Key*        d_keys_input,
                       Key*        d_keys_output,
                       Value*      d_values_input,
                       Value*      d_values_output,
                       size_t      size,
                       hipStream_t stream)
    -> std::enable_if_t<!Descending && benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortPairs(d_temp_storage,
                                              temp_storage_bytes,
                                              d_keys_input,
                                              d_keys_output,
                                              d_values_input,
                                              d_values_output,
                                              size,
                                              benchmark_utils::custom_type_decomposer<Key>{},
                                              stream);
}

template<bool Descending, class Key, class Value>
auto invoke_sort_pairs(void*       d_temp_storage,
                       size_t&     temp_storage_bytes,
                       Key*        d_keys_input,
                       Key*        d_keys_output,
                       Value*      d_values_input,
                       Value*      d_values_output,
                       size_t      size,
                       hipStream_t stream)
    -> std::enable_if_t<Descending && benchmark_utils::is_custom_type<Key>::value, hipError_t>
{
    return hipcub::DeviceRadixSort::SortPairsDescending(
        d_temp_storage,
        temp_storage_bytes,
        d_keys_input,
        d_keys_output,
        d_values_input,
        d_values_output,
        size,
        benchmark_utils::custom_type_decomposer<Key>{},
        stream);
}

template<class Key, class Value, bool Descending = false>
void run_sort_pairs_benchmark(benchmark::State&                 state,
                              hipStream_t                       stream,
                              size_t                            size,
                              std::shared_ptr<std::vector<Key>> keys_input)
{
    using key_type   = Key;
    using value_type = Value;
    std::vector<value_type> values_input(size);
    for(size_t i = 0; i < size; i++)
    {
        values_input[i] = value_type(i);
    }

    key_type* d_keys_input;
    key_type* d_keys_output;
    HIP_CHECK(hipMalloc(&d_keys_input, size * sizeof(key_type)));
    HIP_CHECK(hipMalloc(&d_keys_output, size * sizeof(key_type)));
    HIP_CHECK(hipMemcpy(d_keys_input,
                        keys_input->data(),
                        size * sizeof(key_type),
                        hipMemcpyHostToDevice));

    value_type* d_values_input;
    value_type* d_values_output;
    HIP_CHECK(hipMalloc(&d_values_input, size * sizeof(value_type)));
    HIP_CHECK(hipMalloc(&d_values_output, size * sizeof(value_type)));
    HIP_CHECK(hipMemcpy(d_values_input,
                        values_input.data(),
                        size * sizeof(value_type),
                        hipMemcpyHostToDevice));

    void*  d_temporary_storage     = nullptr;
    size_t temporary_storage_bytes = 0;
    HIP_CHECK(invoke_sort_pairs<Descending>(d_temporary_storage,
                                            temporary_storage_bytes,
                                            d_keys_input,
                                            d_keys_output,
                                            d_values_input,
                                            d_values_output,
                                            size,
                                            stream));

    HIP_CHECK(hipMalloc(&d_temporary_storage, temporary_storage_bytes));
    HIP_CHECK(hipDeviceSynchronize());

    // Warm-up
    for(size_t i = 0; i < warmup_size; i++)
    {
        HIP_CHECK(invoke_sort_pairs<Descending>(d_temporary_storage,
                                                temporary_storage_bytes,
                                                d_keys_input,
                                                d_keys_output,
                                                d_values_input,
                                                d_values_output,
                                                size,
                                                stream));
    }
    HIP_CHECK(hipDeviceSynchronize());

    for(auto _ : state)
    {
        auto start = std::chrono::high_resolution_clock::now();

        for(size_t i = 0; i < batch_size; i++)
        {
            HIP_CHECK(invoke_sort_pairs<Descending>(d_temporary_storage,
                                                    temporary_storage_bytes,
                                                    d_keys_input,
                                                    d_keys_output,
                                                    d_values_input,
                                                    d_values_output,
                                                    size,
                                                    stream));
        }
        HIP_CHECK(hipDeviceSynchronize());

        auto end = std::chrono::high_resolution_clock::now();
        auto elapsed_seconds
            = std::chrono::duration_cast<std::chrono::duration<double>>(end - start);
        state.SetIterationTime(elapsed_seconds.count());
    }
    state.SetBytesProcessed(state.iterations() * batch_size * size
                            * (sizeof(key_type) + sizeof(value_type)));
    state.SetItemsProcessed(state.iterations() * batch_size * size);

    HIP_CHECK(hipFree(d_temporary_storage));
    HIP_CHECK(hipFree(d_keys_input));
    HIP_CHECK(hipFree(d_keys_output));
    HIP_CHECK(hipFree(d_values_input));
    HIP_CHECK(hipFree(d_values_output));
}

#define CREATE_SORT_KEYS_BENCHMARK(Key)                                                 \
    {                                                                                   \
        auto keys_input = std::make_shared<std::vector<Key>>(generate_keys<Key>(size)); \
        benchmarks.push_back(benchmark::RegisterBenchmark(                              \
            std::string("device_radix_sort_keys_ascending"                              \
                        "<key_data_type:" #Key ">.")                                    \
                .c_str(),                                                               \
            [=](benchmark::State& state)                                                \
            { run_sort_keys_benchmark<Key>(state, stream, size, keys_input); }));       \
        benchmarks.push_back(benchmark::RegisterBenchmark(                              \
            std::string("device_radix_sort_keys_descending"                             \
                        "<key_data_type:" #Key ">.")                                    \
                .c_str(),                                                               \
            [=](benchmark::State& state)                                                \
            { run_sort_keys_benchmark<Key, true>(state, stream, size, keys_input); })); \
    }

#define CREATE_SORT_PAIRS_BENCHMARK(Key, Value)                                                 \
    {                                                                                           \
        auto keys_input = std::make_shared<std::vector<Key>>(generate_keys<Key>(size));         \
        benchmarks.push_back(benchmark::RegisterBenchmark(                                      \
            std::string("device_radix_sort_pairs_ascending"                                     \
                        "<key_data_type:" #Key ",value_data_type:" #Value ">.")                 \
                .c_str(),                                                                       \
            [=](benchmark::State& state)                                                        \
            { run_sort_pairs_benchmark<Key, Value>(state, stream, size, keys_input); }));       \
        benchmarks.push_back(benchmark::RegisterBenchmark(                                      \
            std::string("device_radix_sort_pairs_descending"                                    \
                        "<key_data_type:" #Key ",value_data_type:" #Value ">.")                 \
                .c_str(),                                                                       \
            [=](benchmark::State& state)                                                        \
            { run_sort_pairs_benchmark<Key, Value, true>(state, stream, size, keys_input); })); \
    }

void add_sort_keys_benchmarks(std::vector<benchmark::internal::Benchmark*>& benchmarks,
                              hipStream_t                                   stream,
                              size_t                                        size)
{
    using custom_int_t = benchmark_utils::custom_type<int>;
    CREATE_SORT_KEYS_BENCHMARK(int)
    CREATE_SORT_KEYS_BENCHMARK(long long)
    CREATE_SORT_KEYS_BENCHMARK(int8_t)
    CREATE_SORT_KEYS_BENCHMARK(uint8_t)
    CREATE_SORT_KEYS_BENCHMARK(short)
    CREATE_SORT_KEYS_BENCHMARK(custom_int_t)
}

void add_sort_pairs_benchmarks(std::vector<benchmark::internal::Benchmark*>& benchmarks,
                               hipStream_t                                   stream,
                               size_t                                        size)
{
    using custom_float2      = benchmark_utils::custom_type<float, float>;
    using custom_double2     = benchmark_utils::custom_type<double, double>;
    using custom_char_double = benchmark_utils::custom_type<char, double>;
    using custom_double_char = benchmark_utils::custom_type<double, char>;
    using custom_int_t       = benchmark_utils::custom_type<int>;

    CREATE_SORT_PAIRS_BENCHMARK(int, float)
    CREATE_SORT_PAIRS_BENCHMARK(int, double)
    CREATE_SORT_PAIRS_BENCHMARK(int, custom_float2)
    CREATE_SORT_PAIRS_BENCHMARK(int, custom_double2)
    CREATE_SORT_PAIRS_BENCHMARK(int, custom_char_double)
    CREATE_SORT_PAIRS_BENCHMARK(int, custom_double_char)

    CREATE_SORT_PAIRS_BENCHMARK(long long, float)
    CREATE_SORT_PAIRS_BENCHMARK(long long, double)
    CREATE_SORT_PAIRS_BENCHMARK(long long, custom_float2)
    CREATE_SORT_PAIRS_BENCHMARK(long long, custom_char_double)
    CREATE_SORT_PAIRS_BENCHMARK(long long, custom_double_char)
    CREATE_SORT_PAIRS_BENCHMARK(long long, custom_double2)

    CREATE_SORT_PAIRS_BENCHMARK(int8_t, int8_t)
    CREATE_SORT_PAIRS_BENCHMARK(uint8_t, uint8_t)

    CREATE_SORT_PAIRS_BENCHMARK(custom_int_t, float)
}

int main(int argc, char* argv[])
{
    cli::Parser parser(argc, argv);
    parser.set_optional<size_t>("size", "size", DEFAULT_N, "number of values");
    parser.set_optional<int>("trials", "trials", -1, "number of iterations");
    parser.run_and_exit_if_error();

    // Parse argv
    benchmark::Initialize(&argc, argv);
    const size_t size   = parser.get<size_t>("size");
    const int    trials = parser.get<int>("trials");

    std::cout << "benchmark_device_radix_sort" << std::endl;

    // HIP
    hipStream_t     stream = 0; // default
    hipDeviceProp_t devProp;
    int             device_id = 0;
    HIP_CHECK(hipGetDevice(&device_id));
    HIP_CHECK(hipGetDeviceProperties(&devProp, device_id));
    std::cout << "[HIP] Device name: " << devProp.name << std::endl;

    // Add benchmarks
    std::vector<benchmark::internal::Benchmark*> benchmarks;
    add_sort_keys_benchmarks(benchmarks, stream, size);
    add_sort_pairs_benchmarks(benchmarks, stream, size);

    // Use manual timing
    for(auto& b : benchmarks)
    {
        b->UseManualTime();
        b->Unit(benchmark::kMillisecond);
    }

    // Force number of iterations
    if(trials > 0)
    {
        for(auto& b : benchmarks)
        {
            b->Iterations(trials);
        }
    }

    // Run benchmarks
    benchmark::RunSpecifiedBenchmarks();
    return 0;
}
