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
|
/***************************************************************************************************
* Copyright (c) 2017, NVIDIA CORPORATION. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted
* provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice, this list of
* conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
* * Neither the name of the NVIDIA CORPORATION nor the names of its contributors may be used
* to endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TOR (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
**************************************************************************************************/
/*! \file
\brief Defines accessors for loading and storing fragments to memory efficiently.
*/
#pragma once
#include <cutlass/load_store.h>
#include <cutlass/vector.h>
namespace cutlass {
////////////////////////////////////////////////////////////////////////////////////////////////////
template <IteratorFragment::Kind kIteratorFragment,
int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentLoad {};
template <int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentLoad<IteratorFragment::kWmmaMatrix,
kAccessSize,
Scalar_,
Memory_,
FragmentElement_,
kStride> {
/// The output type.
typedef FragmentElement_ AccessType;
/// The load function.
static CUTLASS_DEVICE void load(AccessType& value, Scalar_ const* pointer, int offset) {
value.load(&pointer[offset], kStride);
}
};
template <int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentLoad<IteratorFragment::kScalar,
kAccessSize,
Scalar_,
Memory_,
FragmentElement_,
kStride> {
/// The output type.
typedef typename Vectorize<Scalar_, kAccessSize>::Type AccessType;
/// The load function.
static CUTLASS_DEVICE void load(AccessType& value, Scalar_ const* pointer, int offset) {
Load<Scalar_, kAccessSize, Memory_>::load(value, pointer, offset);
}
};
template <IteratorFragment::Kind kIteratorFragment,
int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentStore {};
template <int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentStore<IteratorFragment::kWmmaMatrix,
kAccessSize,
Scalar_,
Memory_,
FragmentElement_,
kStride> {
/// The input type.
typedef FragmentElement_ AccessType;
/// The store function.
static CUTLASS_DEVICE void store(AccessType const& value, Scalar_* pointer, int offset) {
value.store(&pointer[offset], kStride);
}
};
template <int kAccessSize,
typename Scalar_,
MemorySpace::Kind Memory_,
typename FragmentElement_,
int kStride>
struct FragmentStore<IteratorFragment::kScalar,
kAccessSize,
Scalar_,
Memory_,
FragmentElement_,
kStride> {
/// The input type.
typedef typename Vectorize<Scalar_, kAccessSize>::Type AccessType;
/// The store function.
static CUTLASS_DEVICE void store(AccessType const& value, Scalar_* pointer, int offset) {
Store<Scalar_, kAccessSize, Memory_>::store(value, pointer, offset);
}
};
////////////////////////////////////////////////////////////////////////////////////////////////////
} /// namespace cutlass
|
