// Copyright 2020 The Dawn & Tint Authors // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are met: // // 1. Redistributions of source code must retain the above copyright notice, this // list of conditions and the following disclaimer. // // 2. 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. // // 3. Neither the name of the copyright holder 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 THE COPYRIGHT HOLDER OR CONTRIBUTORS 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 TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #ifndef SRC_DAWN_COMMON_ITYP_BITSET_H_ #define SRC_DAWN_COMMON_ITYP_BITSET_H_ #include "dawn/common/BitSetIterator.h" #include "dawn/common/Platform.h" #include "dawn/common/TypedInteger.h" #include "dawn/common/UnderlyingType.h" namespace dawn { namespace ityp { // ityp::bitset is a helper class that wraps std::bitset with the restriction that // indices must be a particular type |Index|. template <typename Index, size_t N> class bitset : private ::std::bitset<N> { … }; } // namespace ityp // Assume we have bitset of at most 64 bits // Returns i which is the next integer of the index of the highest bit // i == 0 if there is no bit set to true // i == 1 if only the least significant bit (at index 0) is the bit set to true with the // highest index // ... // i == 64 if the most significant bit (at index 64) is the bit set to true with the highest // index template <typename Index, size_t N> Index GetHighestBitIndexPlusOne(const ityp::bitset<Index, N>& bitset) { … } } // namespace dawn #endif // SRC_DAWN_COMMON_ITYP_BITSET_H_