<ahref="predicate__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-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="l0
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1ConstIterator_html_a3d06715a77740034697686a7977cb685"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1ConstIterator.html#a3d06715a77740034697686a7977cb685">cutlass::PredicateVector::ConstIterator::operator!=</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool operator!=(ConstIterator const &it) const</div><divclass="ttdoc">Returns false if iterators point to the same bit. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:229</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_aab9de134132c62de1c062ca57582cdbc"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#aab9de134132c62de1c062ca57582cdbc">cutlass::PredicateVector::operator|=</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE PredicateVector & operator|=(PredicateVector const &predicates)</div><divclass="ttdoc">Computes the union of two identical predicate vectors. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:385</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_1_1TrivialIterator_html_ad24e9b451064e99fb19955f772c30e6a"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector_1_1TrivialIterator.html#ad24e9b451064e99fb19955f772c30e6a">cutlass::PredicateVector::TrivialIterator::operator++</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE TrivialIterator & operator++()</div><divclass="ttdoc">Pre-increment. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:324</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a1c4fe2bec906cd7937428ed6561ac79a"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a1c4fe2bec906cd7937428ed6561ac79a">cutlass::PredicateVector::is_zero</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool is_zero() const</div><divclass="ttdoc">Returns true if entire predicate array is zero. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:394</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_afe85a07b9f311327c6bf04e3a5f94e5a"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#afe85a07b9f311327c6bf04e3a5f94e5a">cutlass::PredicateVector::Storage</a></div><divclass="ttdeci">uint32_t Storage</div><divclass="ttdoc">Storage type of individual elements. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:116</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_1_1TrivialIterator_html_a3adf0440f9a0143a61b43d39c3f03721"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector_1_1TrivialIterator.html#a3adf0440f9a0143a61b43d39c3f03721">cutlass::PredicateVector::TrivialIterator::TrivialIterator</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE TrivialIterator(PredicateVector const &_vec)</div><divclass="ttdoc">Constructs an iterator from a PredicateVector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:320</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1ConstIterator_html_a2763012a9284e97650b14e20c5668286"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1ConstIterator.html#a2763012a9284e97650b14e20c5668286">cutlass::PredicateVector::ConstIterator::operator--</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE ConstIterator & operator--()</div><divclass="ttdoc">Pre-decrement. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:202</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_ab870e074b33c598f69fe11e104615c5a"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#ab870e074b33c598f69fe11e104615c5a">cutlass::PredicateVector::kBytes</a></div><divclass="ttdeci">static int const kBytes</div><divclass="ttdoc">Number of bytes needed. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:125</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_aeb7f9226a4fa49d06500c3c83958dc41"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#aeb7f9226a4fa49d06500c3c83958dc41">cutlass::PredicateVector::const_begin</a></div><divclass="ttdeci">CUTLASS_DEVICE ConstIterator const_begin() const</div><divclass="ttdoc">Returns a ConstIterator. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:417</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1ConstIterator_html_a590e4f4533c87162c0b79e8d876a8fda"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1ConstIterator.html#a590e4f4533c87162c0b79e8d876a8fda">cutlass::PredicateVector::ConstIterator::ConstIterator</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE ConstIterator(PredicateVector const &_vec, int _start=0)</div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:191</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_ac8eca7087d1f7575b0c6beeb5f907bfd"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#ac8eca7087d1f7575b0c6beeb5f907bfd">cutlass::PredicateVector::at</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool at(int idx) const</div><divclass="ttdoc">Accesses a bit within the predicate vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:357</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1ConstIterator_html_a10ee4bb2f206432aa5ee1a83cb046b70"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1ConstIterator.html#a10ee4bb2f206432aa5ee1a83cb046b70">cutlass::PredicateVector::ConstIterator::operator++</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE ConstIterator & operator++()</div><divclass="ttdoc">Pre-increment. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:195</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateTileAdapter_html_a72669300eb0bd18ea8124f780862a0e4"><divclass="ttname"><ahref="structcutlass_1_1PredicateTileAdapter.html#a72669300eb0bd18ea8124f780862a0e4">cutlass::PredicateTileAdapter::PredicateVector</a></div><divclass="ttdeci">PredicateVector_ PredicateVector</div><divclass="ttdoc">The vector of predicates. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:441</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateTileAdapter_html"><divclass="ttname"><ahref="structcutlass_1_1PredicateTileAdapter.html">cutlass::PredicateTileAdapter</a></div><divclass="ttdoc">Adapter to enable random access to predicates via logical coordinate within a tile. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:439</div></div>
<divclass="ttc"id="structcutlass_1_1ComputeOffsetFromShape_html_a7bc0bc7e03cd974a05d00e98a72ee78b"><divclass="ttname"><ahref="structcutlass_1_1ComputeOffsetFromShape.html#a7bc0bc7e03cd974a05d00e98a72ee78b">cutlass::ComputeOffsetFromShape::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:181</div></div>
<divclass="ttc"id="platform_8h_html"><divclass="ttname"><ahref="platform_8h.html">platform.h</a></div><divclass="ttdoc">C++ features that may be otherwise unimplemented for CUDA device functions. </div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1Iterator_html_a5c5266fcef67c7b263682c4bc4a5000e"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1Iterator.html#a5c5266fcef67c7b263682c4bc4a5000e">cutlass::PredicateVector::Iterator::operator==</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool operator==(Iterator const &it) const</div><divclass="ttdoc">Returns true if iterators point to the same bit. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:289</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateTileAdapter_html_a7d54e877bca2e840c142293b4826e986"><divclass="ttname"><ahref="structcutlass_1_1PredicateTileAdapter.html#a7d54e877bca2e840c142293b4826e986">cutlass::PredicateTileAdapter::at</a></div><divclass="ttdeci">CUTLASS_DEVICE bool at(int d, int h, int w, int c) const</div><divclass="ttdoc">Get the value at location (d, h, w, c). </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:454</div></div>
<divclass="ttc"id="structcutlass_1_1ConstPredicateTileAdapter_html_a9e5651009a7b8df9960527c18c7b05dd"><divclass="ttname"><ahref="structcutlass_1_1ConstPredicateTileAdapter.html#a9e5651009a7b8df9960527c18c7b05dd">cutlass::ConstPredicateTileAdapter::at</a></div><divclass="ttdeci">CUTLASS_DEVICE bool at(int d, int h, int w, int c) const</div><divclass="ttdoc">Get the value at location (d, h, w, c). </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:486</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1Iterator_html_a69fb5b24eeb43331b7401768e8584e61"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1Iterator.html#a69fb5b24eeb43331b7401768e8584e61">cutlass::PredicateVector::Iterator::operator--</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE Iterator & operator--()</div><divclass="ttdoc">Pre-decrement. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:266</div></div>
<divclass="ttc"id="structcutlass_1_1ConstPredicateTileAdapter_html_ab9143288811a1262f7007f1b76b32e8f"><divclass="ttname"><ahref="structcutlass_1_1ConstPredicateTileAdapter.html#ab9143288811a1262f7007f1b76b32e8f">cutlass::ConstPredicateTileAdapter::PredicateVector</a></div><divclass="ttdeci">PredicateVector_ PredicateVector</div><divclass="ttdoc">The vector of predicates. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:472</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a3dd9aeba8f3cbe7a8198d68d91a0bbb9"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a3dd9aeba8f3cbe7a8198d68d91a0bbb9">cutlass::PredicateVector::operator &=</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE PredicateVector & operator &=(PredicateVector const &predicates)</div><divclass="ttdoc">Computes the intersection of two identical predicate vectors. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:376</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a840985438ac8306ec680eb20edd4e5c5"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a840985438ac8306ec680eb20edd4e5c5">cutlass::PredicateVector::operator[]</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool operator[](int idx) const</div><divclass="ttdoc">Accesses a bit within the predicate vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:354</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a236bd1a822479750a809452fd58dd917"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a236bd1a822479750a809452fd58dd917">cutlass::PredicateVector::fill</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE void fill(bool value=true)</div><divclass="ttdoc">Fills all predicates with a given value. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:344</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_afff3a2142d9853606d6ad7c3a459f492"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#afff3a2142d9853606d6ad7c3a459f492">cutlass::PredicateVector::kPredicates</a></div><divclass="ttdeci">static int const kPredicates</div><divclass="ttdoc">Number of bits stored by the PredicateVector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:107</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_ad9493fc80fdc33330cc15641779cc275"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#ad9493fc80fdc33330cc15641779cc275">cutlass::PredicateVector::end</a></div><divclass="ttdeci">CUTLASS_DEVICE Iterator end()</div><divclass="ttdoc">Returns an iterator. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:413</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a1387c4a964f971ed4611d750a09ec0b5"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a1387c4a964f971ed4611d750a09ec0b5">cutlass::PredicateVector::kPredicatesPerByte</a></div><divclass="ttdeci">static int const kPredicatesPerByte</div><divclass="ttdoc">Number of bits stored within each byte of the predicate bit vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:110</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html">cutlass::PredicateVector</a></div><divclass="ttdoc">Statically sized array of bits implementing. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:105</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a734bbfaf3829f73ef0b44fa7db4ccd42"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a734bbfaf3829f73ef0b44fa7db4ccd42">cutlass::PredicateVector::kWordCount</a></div><divclass="ttdeci">static int const kWordCount</div><divclass="ttdoc">Number of storage elements needed. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:128</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_ab931610bc07ee0e87bb4d9a4d53a2321"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#ab931610bc07ee0e87bb4d9a4d53a2321">cutlass::PredicateVector::const_end</a></div><divclass="ttdeci">CUTLASS_DEVICE ConstIterator const_end() const</div><divclass="ttdoc">Returns a ConstIterator. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:421</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a062fa8a8df725ef08ced2ffcca8336af"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a062fa8a8df725ef08ced2ffcca8336af">cutlass::PredicateVector::set</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE void set(int idx, bool value=true)</div><divclass="ttdoc">Set a bit within the predicate vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:365</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1ConstIterator_html_aa2d03d88ac23051803d010f78157c357"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1ConstIterator.html#aa2d03d88ac23051803d010f78157c357">cutlass::PredicateVector::ConstIterator::operator==</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool operator==(ConstIterator const &it) const</div><divclass="ttdoc">Returns true if iterators point to the same bit. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:225</div></div>
<divclass="ttc"id="classcutlass_1_1PredicateVector_1_1Iterator_html_a08cb4d1395b88a4451fbb1a27e010887"><divclass="ttname"><ahref="classcutlass_1_1PredicateVector_1_1Iterator.html#a08cb4d1395b88a4451fbb1a27e010887">cutlass::PredicateVector::Iterator::operator!=</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE bool operator!=(Iterator const &it) const</div><divclass="ttdoc">Returns false if iterators point to the same bit. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:293</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_acf848dce84c01453ab8a2d00c8d4f86e"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#acf848dce84c01453ab8a2d00c8d4f86e">cutlass::PredicateVector::kPredicateStart</a></div><divclass="ttdeci">static int const kPredicateStart</div><divclass="ttdoc">First bit withing each byte containing predicates. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:113</div></div>
<divclass="ttc"id="structcutlass_1_1ConstPredicateTileAdapter_html"><divclass="ttname"><ahref="structcutlass_1_1ConstPredicateTileAdapter.html">cutlass::ConstPredicateTileAdapter</a></div><divclass="ttdoc">Adapter to enable random access to predicates via logical coordinate within a tile. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:470</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_1PredicateVector_html_aec1201df19c0ed0516810a3f19353c21"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#aec1201df19c0ed0516810a3f19353c21">cutlass::PredicateVector::PredicateVector</a></div><divclass="ttdeci">CUTLASS_HOST_DEVICE PredicateVector(bool value=true)</div><divclass="ttdoc">Initialize the predicate vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:341</div></div>
<divclass="ttc"id="structcutlass_1_1PredicateVector_html_a649045d8224514a4c28bcaf4b247b4a5"><divclass="ttname"><ahref="structcutlass_1_1PredicateVector.html#a649045d8224514a4c28bcaf4b247b4a5">cutlass::PredicateVector::begin</a></div><divclass="ttdeci">CUTLASS_DEVICE Iterator begin()</div><divclass="ttdoc">Returns an iterator to the start of the bit vector. </div><divclass="ttdef"><b>Definition:</b> predicate_vector.h:409</div></div>
<divclass="ttc"id="cutlass_8h_html"><divclass="ttname"><ahref="cutlass_8h.html">cutlass.h</a></div><divclass="ttdoc">Basic include for CUTLASS macros. </div></div>
