squall/cutlass
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

Profiler docs and argument update for raster order (#1667)

Browse Source
This commit is contained in:
dePaul Miller 2024-07-31 13:40:10 -07:00 committed by GitHub
parent fbd116c0e5
commit 8b2a0408bd
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
2 changed files with 8 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
media/docs/profiler.md
View File

@ -210,8 +210,8 @@ GEMM
[int] --inst_k,--instruction-shape::k Math instruction shape in the K dimension
[int] --min_cc,--minimum-compute-capability Minimum device compute capability
[int] --max_cc,--maximum-compute-capability Maximum device compute capability
[enum] --raster_order={H|M|N} If supported by kernel, sets the tile raster direction
[int] --swizzle_size If supported by kernel, sets the 2D tile swizzle extent
[enum] --raster_order={heuristic|H|along_m|M|along_n|N} If supported by kernel, sets the tile raster direction
[int] --swizzle_size={1,2,4,8} If supported by kernel, sets the 2D tile swizzle extent (In Hopper, other values will be rounded down to the nearest supported value)
Examples:
Profile a particular problem size:

10
tools/library/src/util.cu
View File

@ -1010,12 +1010,13 @@ ConvKind from_string<ConvKind>(std::string const &str) {
static struct {
char const *text;
char const *pretty;
char const *character;
RasterOrder enumerant;
}
RasterOrder_enumerants[] = {
{"along_n", "<along_n>", RasterOrder::kAlongN},
{"along_m", "<along_m>", RasterOrder::kAlongM},
{"heuristic", "<heuristic>", RasterOrder::kHeuristic},
{"along_n", "<along_n>", "N", RasterOrder::kAlongN},
{"along_m", "<along_m>", "M", RasterOrder::kAlongM},
{"heuristic", "<heuristic>", "H", RasterOrder::kHeuristic},
};
/// Converts a RasterOrder enumerant to a string
@ -1042,7 +1043,8 @@ RasterOrder from_string<RasterOrder>(std::string const &str) {
for (auto const & possible : RasterOrder_enumerants) {
if ((str.compare(possible.text) == 0) ||
(str.compare(possible.pretty) == 0)) {
(str.compare(possible.pretty) == 0) ||
(str.compare(possible.character) == 0)) {
return possible.enumerant;
}
}