Cutlass
CUDA Templates for Linear Algebra Subroutines and Solvers
tile.h
Go to the documentation of this file.
1 /***************************************************************************************************
2  * Copyright (c) 2017-2018, NVIDIA CORPORATION. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without modification, are permitted
5  * provided that the following conditions are met:
6  * * Redistributions of source code must retain the above copyright notice, this list of
7  * conditions and the following disclaimer.
8  * * Redistributions in binary form must reproduce the above copyright notice, this list of
9  * conditions and the following disclaimer in the documentation and/or other materials
10  * provided with the distribution.
11  * * Neither the name of the NVIDIA CORPORATION nor the names of its contributors may be used
12  * to endorse or promote products derived from this software without specific prior written
13  * permission.
14  *
15  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
16  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
17  * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE
18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
19  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
20  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
21  * STRICT LIABILITY, OR TOR (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
22  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
23  *
24  **************************************************************************************************/
28 #pragma once
29 
30 #include <cutlass/shape.h>
31 
32 namespace cutlass {
33 
35 
36 // The following functor reshapes a tile of data. The goal is to have at least kAccessSize in
37 // the inner-most dimension. If the user respects that constraint, there is nothing to be done. If
38 // that's not the case, this functor will correct that and "extract" the right number of elements
39 // from the next dimension.
40 
41 template <typename Tile_, int kAccessSize_, bool = (Tile_::kC < kAccessSize_)>
42 struct ReshapeTile {
43  typedef Tile_ Tile;
44 };
45 
46 template <typename Tile_, int kAccessSize_>
48  // Make sure the W dimension of the tile is large enough.
49  static_assert(Tile_::kW >= kAccessSize_, "The W dimension is too small");
50  // Make sure the dimension can be divided by the number of scalars.
51  static_assert(Tile_::kW % kAccessSize_ == 0, "Not supported");
52  // Collapse the W dimension.
53  typedef Shape<Tile_::kD, Tile_::kH, Tile_::kW / kAccessSize_, kAccessSize_> Tile;
54 };
55 
57 
58 } // namespace cutlass
Definition: convert.h:34
A Shape implementing Layout Concept describing the dimensions of a cube.
Definition: shape.h:63
Shape< Tile_::kD, Tile_::kH, Tile_::kW/kAccessSize_, kAccessSize_ > Tile
Definition: tile.h:49
#define static_assert(__e, __m)
Definition: nv_std.h:167
Defines Shape implementing the Layout concept for representing a 4D hypercube of objects.