<ahref="fragment_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-2018, 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="structcutlass_1_1FragmentIterator_html_a8608dd815ed4906d8c82c41a10df23e2"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#a8608dd815ed4906d8c82c41a10df23e2">cutlass::FragmentIterator::valid</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool valid(int d, int h, int w, int c) const</div><divclass="ttdoc">Is the iterator valid? </div><divclass="ttdef"><b>Definition:</b> fragment.h:217</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentConstIterator_html_a004fabc9caa6924f3fb4badcbb19e88f"><divclass="ttname"><ahref="structcutlass_1_1FragmentConstIterator.html#a004fabc9caa6924f3fb4badcbb19e88f">cutlass::FragmentConstIterator::kElementsPerAccess</a></div><divclass="ttdeci">static int const kElementsPerAccess</div><divclass="ttdoc">The number of elements per access. </div><divclass="ttdef"><b>Definition:</b> fragment.h:239</div></div>
<divclass="ttc"id="structcutlass_1_1Fragment_html_a32f7ff86b73576a15c5ddaa40c4e0a95"><divclass="ttname"><ahref="structcutlass_1_1Fragment.html#a32f7ff86b73576a15c5ddaa40c4e0a95">cutlass::Fragment::This_</a></div><divclass="ttdeci">Fragment< Element_, kElements_ > This_</div><divclass="ttdoc">Make sure the alignment makes sense wrt the size of elements. </div><divclass="ttdef"><b>Definition:</b> fragment.h:101</div></div>
<divclass="ttc"id="structcutlass_1_1Fragment_html_a7795c5cf4d5626ff125abd5e8f156e9b"><divclass="ttname"><ahref="structcutlass_1_1Fragment.html#a7795c5cf4d5626ff125abd5e8f156e9b">cutlass::Fragment::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE Element const & operator[](int i) const</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:143</div></div>
<divclass="ttc"id="structcutlass_1_1Fragment_html_a2b9a64391d00ef23dd8d456c2337fa60"><divclass="ttname"><ahref="structcutlass_1_1Fragment.html#a2b9a64391d00ef23dd8d456c2337fa60">cutlass::Fragment::kElements</a></div><divclass="ttdeci">static int const kElements</div><divclass="ttdoc">The number of elements. </div><divclass="ttdef"><b>Definition:</b> fragment.h:110</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentConstIterator_html_a527100e34ed700787b1419157710dbb2"><divclass="ttname"><ahref="structcutlass_1_1FragmentConstIterator.html#a527100e34ed700787b1419157710dbb2">cutlass::FragmentConstIterator::Iterations</a></div><divclass="ttdeci">Iterations_ Iterations</div><divclass="ttdoc">The number of iterations. </div><divclass="ttdef"><b>Definition:</b> fragment.h:232</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_a35b721563536ab2c5dbab0f5de1c2b43"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#a35b721563536ab2c5dbab0f5de1c2b43">cutlass::FragmentIterator::at</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType const & at(int d, int h, int w, int c=0) const</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:195</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_a4324ae522c6463e66a64f05d2e58b5f0"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#a4324ae522c6463e66a64f05d2e58b5f0">cutlass::FragmentIterator::Iterations</a></div><divclass="ttdeci">Iterations_ Iterations</div><divclass="ttdoc">The number of iterations. </div><divclass="ttdef"><b>Definition:</b> fragment.h:174</div></div>
<divclass="ttc"id="structcutlass_1_1Shape_html"><divclass="ttname"><ahref="structcutlass_1_1Shape.html">cutlass::Shape</a></div><divclass="ttdoc">A Shape implementing Layout Concept describing the dimensions of a cube. </div><divclass="ttdef"><b>Definition:</b> shape.h:64</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentConstIterator_html_a6216b58ffe6322f037f1e0a3ffa714c8"><divclass="ttname"><ahref="structcutlass_1_1FragmentConstIterator.html#a6216b58ffe6322f037f1e0a3ffa714c8">cutlass::FragmentConstIterator::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType const & operator[](int i) const</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:263</div></div>
<divclass="ttc"id="structcutlass_1_1Fragment_html_a77ba7cddf7822d64534b019c4ad9732e"><divclass="ttname"><ahref="structcutlass_1_1Fragment.html#a77ba7cddf7822d64534b019c4ad9732e">cutlass::Fragment::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE Element & operator[](int i)</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:140</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_a21877944988f34eb69cb6eefb00c6575"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#a21877944988f34eb69cb6eefb00c6575">cutlass::FragmentIterator::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType const & operator[](int i) const</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:207</div></div>
<divclass="ttc"id="vector_8h_html"><divclass="ttname"><ahref="vector_8h.html">vector.h</a></div><divclass="ttdoc">Defines a 1D vector of elements held in the registers of each thread. </div></div>
<divclass="ttc"id="structcutlass_1_1FragmentConstIterator_html_ac4d601998a84a3eac23e3b7a7c8a935b"><divclass="ttname"><ahref="structcutlass_1_1FragmentConstIterator.html#ac4d601998a84a3eac23e3b7a7c8a935b">cutlass::FragmentConstIterator::valid</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool valid(int d, int h, int w, int c) const</div><divclass="ttdoc">Is the iterator valid? </div><divclass="ttdef"><b>Definition:</b> fragment.h:268</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_a2e93985d759d904ac858054eeaa9e50e"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#a2e93985d759d904ac858054eeaa9e50e">cutlass::FragmentIterator::Strides</a></div><divclass="ttdeci">ShapeStrides< FragmentShape, kElementsPerAccess >::Shape Strides</div><divclass="ttdoc">The linear strides for iterations. </div><divclass="ttdef"><b>Definition:</b> fragment.h:185</div></div>
<divclass="ttc"id="structcutlass_1_1ComputeOffsetFromStrides_html_aa28231590bfa0ced0f317e6a4d52dc1e"><divclass="ttname"><ahref="structcutlass_1_1ComputeOffsetFromStrides.html#aa28231590bfa0ced0f317e6a4d52dc1e">cutlass::ComputeOffsetFromStrides::get</a></div><divclass="ttdeci">static CUTLASS_HOST_DEVICE int get(int d, int h, int w, int c)</div><divclass="ttdef"><b>Definition:</b> shape.h:199</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_ad665745f3d6a3a88d7894fe0fc1bbd3e"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#ad665745f3d6a3a88d7894fe0fc1bbd3e">cutlass::FragmentIterator::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType & operator[](int i)</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:212</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_adb863b44dfbc1fa923625e767f6dd7cd"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#adb863b44dfbc1fa923625e767f6dd7cd">cutlass::FragmentIterator::at</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType & at(int d, int h, int w, int c=0)</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:201</div></div>
<divclass="ttc"id="structcutlass_1_1FragmentIterator_html_ad2c43e30e78e8799df7cb02ac08cee9a"><divclass="ttname"><ahref="structcutlass_1_1FragmentIterator.html#ad2c43e30e78e8799df7cb02ac08cee9a">cutlass::FragmentIterator::kElementsPerAccess</a></div><divclass="ttdeci">static int const kElementsPerAccess</div><divclass="ttdoc">The number of elements per access. </div><divclass="ttdef"><b>Definition:</b> fragment.h:181</div></div>
<divclass="ttc"id="shape_8h_html"><divclass="ttname"><ahref="shape_8h.html">shape.h</a></div><divclass="ttdoc">Defines Shape implementing the Layout concept for representing a 4D hypercube of objects. </div></div>
<divclass="ttc"id="structcutlass_1_1FragmentConstIterator_html_a14f2ad2f9b90aea092ff1836e8fb159d"><divclass="ttname"><ahref="structcutlass_1_1FragmentConstIterator.html#a14f2ad2f9b90aea092ff1836e8fb159d">cutlass::FragmentConstIterator::at</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE AccessType const & at(int d, int h, int w, int c=0) const</div><divclass="ttdoc">The accessor. </div><divclass="ttdef"><b>Definition:</b> fragment.h:257</div></div>
