<ahref="vector_8h.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">/***************************************************************************************************</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment"> * Copyright (c) 2017-2019, NVIDIA CORPORATION. All rights reserved.</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment"> *</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment"> * Redistribution and use in source and binary forms, with or without modification, are permitted</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment"> * provided that the following conditions are met:</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment"> * * Redistributions of source code must retain the above copyright notice, this list of</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment"> * conditions and the following disclaimer.</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment"> * * Redistributions in binary form must reproduce the above copyright notice, this list of</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment"> * conditions and the following disclaimer in the documentation and/or other materials</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment"> * provided with the distribution.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment"> * * Neither the name of the NVIDIA CORPORATION nor the names of its contributors may be used</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment"> * to endorse or promote products derived from this software without specific prior written</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> <spanclass="comment"> * permission.</span></div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="comment"> *</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR</span></div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> <spanclass="comment"> * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND</span></div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="comment"> * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE</span></div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> <spanclass="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,</span></div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> <spanclass="comment"> * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;</span></div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> <spanclass="comment"> * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,</span></div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="comment"> * STRICT LIABILITY, OR TOR (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE</span></div><divclass="line"><aname="l00022"></a><
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_a98a28ffe4b3919f3c011ddf86fec6e69"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#a98a28ffe4b3919f3c011ddf86fec6e69">cutlass::layout::PackedVectorLayout::kStrideRank</a></div><divclass="ttdeci">static int const kStrideRank</div><divclass="ttdoc">Rank of stride vector. </div><divclass="ttdef"><b>Definition:</b> vector.h:43</div></div>
<divclass="ttc"id="coord_8h_html"><divclass="ttname"><ahref="coord_8h.html">coord.h</a></div><divclass="ttdoc">A Coord is a coordinate of arbitrary rank into a tensor or matrix. </div></div>
<divclass="ttc"id="namespacecutlass_html_a7419519fa453a121dfa5f26bf87318d9"><divclass="ttname"><ahref="namespacecutlass.html#a7419519fa453a121dfa5f26bf87318d9">cutlass::make_Coord</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE Coord< 1 > make_Coord(int _0)</div><divclass="ttdoc">Helper to make a 2-element coordinate. </div><divclass="ttdef"><b>Definition:</b> coord.h:387</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_ab6a6e1023e9c04d60714adbb4d713f17"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#ab6a6e1023e9c04d60714adbb4d713f17">cutlass::layout::PackedVectorLayout::stride</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE Stride stride() const </div><divclass="ttdoc">Returns the stride of the layout. </div><divclass="ttdef"><b>Definition:</b> vector.h:86</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_a527d1f3f293a962aa814ca69a5194b24"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#a527d1f3f293a962aa814ca69a5194b24">cutlass::layout::PackedVectorLayout::kRank</a></div><divclass="ttdeci">static int const kRank</div><divclass="ttdoc">Logical rank of tensor. </div><divclass="ttdef"><b>Definition:</b> vector.h:40</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_a359d91ca6d2cae5994db320edeea686e"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#a359d91ca6d2cae5994db320edeea686e">cutlass::layout::PackedVectorLayout::Index</a></div><divclass="ttdeci">int32_t Index</div><divclass="ttdoc">Index type used for coordinates. </div><divclass="ttdef"><b>Definition:</b> vector.h:46</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_aaa31d06cab1db8ff0c303515396b5b09"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#aaa31d06cab1db8ff0c303515396b5b09">cutlass::layout::PackedVectorLayout::packed</a></div><divclass="ttdeci">static CUTLASS_HOST_DEVICE PackedVectorLayout packed(TensorCoord const &size)</div><divclass="ttdoc">Helper returns a layout to a tightly packed tensor. </div><divclass="ttdef"><b>Definition:</b> vector.h:74</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_a39cc27d637aa946f1515df04972b1885"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#a39cc27d637aa946f1515df04972b1885">cutlass::layout::PackedVectorLayout::operator()</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE LongIndex operator()(TensorCoord const &coord) const </div><divclass="ttdoc">Returns the offset of a coordinate in linear memory. </div><divclass="ttdef"><b>Definition:</b> vector.h:80</div></div>
<divclass="ttc"id="structcutlass_1_1Coord_html"><divclass="ttname"><ahref="structcutlass_1_1Coord.html">cutlass::Coord</a></div><divclass="ttdoc">Statically-sized array specifying Coords within a tensor. </div><divclass="ttdef"><b>Definition:</b> coord.h:43</div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html">cutlass::layout::PackedVectorLayout</a></div><divclass="ttdoc">Tensor layout for densely packed vectors. </div><divclass="ttdef"><b>Definition:</b> vector.h:37</div></div>
<divclass="ttc"id="cutlass_8h_html"><divclass="ttname"><ahref="cutlass_8h.html">cutlass.h</a></div><divclass="ttdoc">Basic include for CUTLASS. </div></div>
<divclass="ttc"id="classcutlass_1_1layout_1_1PackedVectorLayout_html_a20b384f56d697894a75c8f4693155320"><divclass="ttname"><ahref="classcutlass_1_1layout_1_1PackedVectorLayout.html#a20b384f56d697894a75c8f4693155320">cutlass::layout::PackedVectorLayout::capacity</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE LongIndex capacity(TensorCoord const &size) const </div><divclass="ttdoc">Compute the number of contiguous elements needed to store a tensor with the given size...</div><divclass="ttdef"><b>Definition:</b> vector.h:92</div></div>