1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/*------------------------------------------------------------------------------------------------*/
/* Copyright (C) by the DBCSR developers group - All rights reserved */
/* This file is part of the DBCSR library. */
/* */
/* For information on the license, see the LICENSE file. */
/* For further information please visit https://dbcsr.cp2k.org */
/* SPDX-License-Identifier: GPL-2.0+ */
/*------------------------------------------------------------------------------------------------*/
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <array>
#include <utility>
#include "libsmm_acc_benchmark.h"
#include "libsmm_acc.h"
/****************************************************************************\
\brief Checks correctness of all libsmm transpose kernels
\****************************************************************************/
int main(int argc, char** argv) {
DBCSR_MARK_USED(argc);
DBCSR_MARK_USED(argv);
TransposeLauncher launcher_tr = libsmm_acc_transpose_d;
char buffer[1000];
char* kernel_descr[1] = {buffer};
// Get all blocksizes available in libsmm
std::vector<Triplet> libsmm_acc_triplets;
extern const std::unordered_map<Triplet, KernelParameters> ht;
get_libsmm_acc_triplets(libsmm_acc_triplets, ht);
int n_triplets = libsmm_acc_triplets.size();
int max_m = 0, max_n = 0, max_k = 0;
for (int i = 0; i < n_triplets; i++) {
max_m = std::max(max_n, libsmm_acc_triplets[i][0]);
max_n = std::max(max_m, libsmm_acc_triplets[i][1]);
max_k = std::max(max_k, libsmm_acc_triplets[i][2]);
}
libsmm_acc_benchmark_t* handle;
libsmm_acc_benchmark_init(&handle, test, max_m, max_n, max_k);
// Get (m,n) pairs to test transposition
std::vector<std::pair<int, int>> libsmm_acc_transpose_pairs;
for (int i = 0; i < n_triplets; i++) {
int m = libsmm_acc_triplets[i][0];
int n = libsmm_acc_triplets[i][1];
int k = libsmm_acc_triplets[i][2];
libsmm_acc_transpose_pairs.push_back(std::make_pair(m, k));
libsmm_acc_transpose_pairs.push_back(std::make_pair(k, n));
}
std::sort(libsmm_acc_transpose_pairs.begin(), libsmm_acc_transpose_pairs.end(), [](std::pair<int, int> a, std::pair<int, int> b) {
return (a.first > b.first) || (a.first == b.first && a.second > b.second);
});
auto last = std::unique(libsmm_acc_transpose_pairs.begin(), libsmm_acc_transpose_pairs.end());
libsmm_acc_transpose_pairs.erase(last, libsmm_acc_transpose_pairs.end());
int n_pairs = libsmm_acc_transpose_pairs.size();
printf("# libsmm_acc has %d blocksizes for transposition\n", n_pairs);
// Sort (m,n) pairs in growing order
std::sort(
libsmm_acc_transpose_pairs.begin(), libsmm_acc_transpose_pairs.end(), [](std::pair<int, int> mn1, std::pair<int, int> mn2) {
if (mn1.first != mn2.first) {
return mn1.first < mn2.first;
}
else {
return mn1.second < mn2.second;
}
});
int errors = 0;
for (int i = 0; i < n_pairs; i++) {
int m = libsmm_acc_transpose_pairs[i].first;
int n = libsmm_acc_transpose_pairs[i].second;
sprintf(buffer, "%d x %d", m, n);
errors += libsmm_acc_benchmark_transpose(handle, m, n, &launcher_tr, kernel_descr);
}
libsmm_acc_benchmark_finalize(handle);
printf("# Done, found %d transpose errors.\n", errors);
return errors;
}
|
