|
| 1 | +#include "bench.h" |
| 2 | +#include "ipp.h" |
| 3 | + |
| 4 | +template <typename T, class... Args> |
| 5 | +static void ippsort(benchmark::State &state, Args &&...args) |
| 6 | +{ |
| 7 | + auto args_tuple = std::make_tuple(std::move(args)...); |
| 8 | + size_t arrsize = std::get<0>(args_tuple); |
| 9 | + /* IPP set up */ |
| 10 | + int bufsize = 10; |
| 11 | + if constexpr (std::is_same_v<T, float>) { |
| 12 | + ippsSortRadixGetBufferSize(arrsize, ipp32f, &bufsize); |
| 13 | + } |
| 14 | + else if constexpr (std::is_same_v<T, double>) { |
| 15 | + ippsSortRadixGetBufferSize(arrsize, ipp64f, &bufsize); |
| 16 | + } |
| 17 | + unsigned char *temp = new unsigned char[bufsize]; |
| 18 | + |
| 19 | + // Get args |
| 20 | + std::string arrtype = std::get<1>(args_tuple); |
| 21 | + // set up array |
| 22 | + std::vector<T> arr = get_array<T>(arrtype, arrsize); |
| 23 | + std::vector<T> arr_bkp = arr; |
| 24 | + // benchmark |
| 25 | + for (auto _ : state) { |
| 26 | + if constexpr (std::is_same_v<T, float>) { |
| 27 | + ippsSortRadixAscend_32f_I(arr.data(), arrsize, temp); |
| 28 | + } |
| 29 | + else if constexpr (std::is_same_v<T, double>) { |
| 30 | + ippsSortRadixAscend_64f_I(arr.data(), arrsize, temp); |
| 31 | + } |
| 32 | + state.PauseTiming(); |
| 33 | + arr = arr_bkp; |
| 34 | + state.ResumeTiming(); |
| 35 | + } |
| 36 | +} |
| 37 | + |
| 38 | +BENCH_SORT(ippsort, uint64_t) |
| 39 | +BENCH_SORT(ippsort, int64_t) |
| 40 | +BENCH_SORT(ippsort, uint32_t) |
| 41 | +BENCH_SORT(ippsort, int32_t) |
| 42 | +BENCH_SORT(ippsort, double) |
| 43 | +BENCH_SORT(ippsort, float) |
0 commit comments