-
Notifications
You must be signed in to change notification settings - Fork 92
Expand file tree
/
Copy pathinline_common.h
More file actions
213 lines (187 loc) · 7.44 KB
/
Copy pathinline_common.h
File metadata and controls
213 lines (187 loc) · 7.44 KB
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
/*
* SPDX-FileCopyrightText: Copyright (c) 2022 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
* SPDX-License-Identifier: Apache-2.0
*
* Licensed 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.
*/
#ifndef INLINE_COMMON_H_
#define INLINE_COMMON_H_
#include "common.h"
#include "error_handling.h"
template <class T> struct PeerValueMatrix {
std::vector<std::optional <T>> m_matrix;
int m_rows, m_columns;
std::string key;
std::vector<std::string> column_labels;
std::vector<std::string> row_labels;
bool pFormatter;
UnitType uType;
// Run-to-run coefficient of variation for this test's measurements (worst
// cell). Populated from the measurement statistics; when set it is emitted
// as the COEFFICIENT_OF_VARIATION stability metric.
std::optional<double> coefficientOfVariation;
PeerValueMatrix(int rows, int columns, std::string key = "", bool pFormatter = gSettings.perfFormatter, UnitType uType = BANDWIDTH): m_matrix(rows * columns), m_rows(rows), m_columns(columns), key(key), pFormatter(pFormatter), uType(uType) {}
std::optional <T> &value(int src, int dst) {
ASSERT(src >= 0 && src < m_rows);
ASSERT(dst >= 0 && dst < m_columns);
return m_matrix[src * m_columns + dst];
}
const std::optional <T> &value(int src, int dst) const {
ASSERT(src >= 0 && src < m_rows);
ASSERT(dst >= 0 && dst < m_columns);
return m_matrix[src * m_columns + dst];
}
void setRowLabels(std::vector<std::string> _row_labels) {
row_labels = _row_labels;
}
void setColumnLabels(std::vector<std::string> _column_labels) {
column_labels = _column_labels;
}
};
template <class T>
std::ostream &operator<<(std::ostream &o, const PeerValueMatrix<T> &matrix) {
// This assumes T is numeric
T maxVal = std::numeric_limits<T>::min();
T minVal = std::numeric_limits<T>::max();
T sum = 0;
int count = 0;
// First square of the table should be blank, calculate and print appropriately many spaces
int columnIdWidth = 2;
for (auto s : matrix.row_labels) {
columnIdWidth = std::max(columnIdWidth, (int) s.size());
}
for (int i = 0; i < columnIdWidth; i++) {
o << " ";
}
for (int currentDevice = 0; currentDevice < matrix.m_columns; currentDevice++) {
if (matrix.column_labels.size() > 0) {
o << std::setw(10) << matrix.column_labels[currentDevice];
} else {
o << std::setw(10) << currentDevice;
}
}
o << std::endl;
for (int currentDevice = 0; currentDevice < matrix.m_rows; currentDevice++) {
if (matrix.row_labels.size() > 0) {
o << std::setw(columnIdWidth) << matrix.row_labels[currentDevice];
} else {
o << std::setw(2) << currentDevice;
}
for (int peer = 0; peer < matrix.m_columns; peer++) {
std::optional <T> val = matrix.value(currentDevice, peer);
if (val) {
o << std::setw(10) << val.value();
} else {
o << std::setw(10) << "N/A";
}
sum += val.value_or(0.0);
maxVal = std::max(maxVal, val.value_or(0.0));
minVal = std::min(minVal, val.value_or(0.0));
if (val.value_or(0.0) > 0) count++;
}
o << std::endl;
}
o << std::endl;
if (matrix.pFormatter) {
o << "&&&& PERF " << matrix.key << " " << sum << getUnitString(matrix.uType) << std::endl;
} else {
o << "SUM " << matrix.key << " " << sum << std::endl;
}
// Report the run-to-run (temporal) coefficient of variation, which measures
// the stability of each measurement across repeated samples. Guard on a
// minimum sample count since the CV is unreliable with few samples.
if (matrix.coefficientOfVariation &&
gSettings.averageLoopCount >= kMinAverageLoopCountForCV) {
o << "COEFFICIENT_OF_VARIATION " << matrix.key << " " << matrix.coefficientOfVariation.value() << "\n";
}
VERBOSE << "MIN " << matrix.key << " " << minVal << '\n';
VERBOSE << "MAX " << matrix.key << " " << maxVal << '\n';
VERBOSE << "AVG " << matrix.key << " " << sum / count << '\n';
return o;
}
// NUMA optimal affinity
inline void setOptimalCpuAffinity(int cudaDeviceID) {
#ifdef _WIN32
// NVML doesn't support setting affinity on Windows
return;
#endif
if (gSettings.disableAffinity) {
return;
}
nvmlDevice_t device;
CUuuid dev_uuid;
std::stringstream s;
std::unordered_set <unsigned char> dashPos {0, 4, 6, 8, 10};
CU_ASSERT(cuDeviceGetUuid(&dev_uuid, cudaDeviceID));
s << "GPU";
for (int i = 0; i < 16; i++) {
if (dashPos.count(i)) {
s << '-';
}
s << std::hex << std::setfill('0') << std::setw(2) << (0xFF & (int)dev_uuid.bytes[i]);
}
NVML_ASSERT(nvmlDeviceGetHandleByUUID(s.str().c_str(), &device));
nvmlReturn_t result = nvmlDeviceSetCpuAffinity(device);
if (result != NVML_ERROR_NOT_SUPPORTED) {
NVML_ASSERT(result);
}
}
inline bool isMemoryOwnedByCUDA(void *memory) {
CUmemorytype memorytype;
CUresult status = cuPointerGetAttribute(&memorytype, CU_POINTER_ATTRIBUTE_MEMORY_TYPE, (CUdeviceptr)memory);
if (status == CUDA_ERROR_INVALID_VALUE) {
return false;
} else {
CU_ASSERT(status);
return true;
}
}
// Format CUDA device UUID as "GPU-xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx" (NVML style).
inline std::string getDeviceUuidString(int deviceOrdinal) {
CUdevice dev;
CUuuid dev_uuid;
CU_ASSERT(cuDeviceGet(&dev, deviceOrdinal));
CU_ASSERT(cuDeviceGetUuid(&dev_uuid, dev));
// Dash positions in the UUID hex string (before bytes 0,4,6,8,10).
static constexpr bool kDashBefore[16] = {1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0};
std::stringstream s;
s << "GPU";
for (int i = 0; i < 16; i++) {
if (kDashBefore[i]) s << '-';
s << std::hex << std::setfill('0') << std::setw(2) << (0xFF & (int)dev_uuid.bytes[i]);
}
return s.str();
}
// Normalize UUID string for comparison: strip optional "GPU-" prefix, lowercase.
inline std::string normalizeUuidString(const std::string& u) {
// Strip "GPU-" prefix (case-insensitive).
std::size_t start = 0;
if (u.size() >= 4 && std::tolower((unsigned char)u[0]) == 'g' &&
std::tolower((unsigned char)u[1]) == 'p' &&
std::tolower((unsigned char)u[2]) == 'u' && u[3] == '-') {
start = 4;
}
std::string out(u, start);
std::transform(out.begin(), out.end(), out.begin(),
[](unsigned char c) { return std::tolower(c); });
return out;
}
// Return device ordinal for the GPU whose UUID matches (or -1 if not found).
inline int getDeviceIndexByUuid(const std::string& uuid, int deviceCount) {
std::string want = normalizeUuidString(uuid);
for (int i = 0; i < deviceCount; i++) {
if (normalizeUuidString(getDeviceUuidString(i)) == want) return i;
}
return -1;
}
#endif // INLINE_COMMON_H_