| 1 |
// Protocol Buffers - Google's data interchange format |
| 2 |
// Copyright 2008 Google Inc. All rights reserved. |
| 3 |
// https://developers.google.com/protocol-buffers/ |
| 4 |
// |
| 5 |
// Redistribution and use in source and binary forms, with or without |
| 6 |
// modification, are permitted provided that the following conditions are |
| 7 |
// met: |
| 8 |
// |
| 9 |
// * Redistributions of source code must retain the above copyright |
| 10 |
// notice, this list of conditions and the following disclaimer. |
| 11 |
// * Redistributions in binary form must reproduce the above |
| 12 |
// copyright notice, this list of conditions and the following disclaimer |
| 13 |
// in the documentation and/or other materials provided with the |
| 14 |
// distribution. |
| 15 |
// * Neither the name of Google Inc. nor the names of its |
| 16 |
// contributors may be used to endorse or promote products derived from |
| 17 |
// this software without specific prior written permission. |
| 18 |
// |
| 19 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 20 |
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 21 |
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 22 |
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 23 |
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 24 |
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 25 |
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 26 |
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 27 |
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 28 |
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 29 |
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 30 |
|
| 31 |
#ifndef GOOGLE_PROTOBUF_HAS_BITS_H__ |
| 32 |
#define GOOGLE_PROTOBUF_HAS_BITS_H__ |
| 33 |
|
| 34 |
#include <google/protobuf/stubs/common.h> |
| 35 |
#include <google/protobuf/port.h> |
| 36 |
|
| 37 |
#include <google/protobuf/port_def.inc> |
| 38 |
|
| 39 |
#ifdef SWIG |
| 40 |
#error "You cannot SWIG proto headers" |
| 41 |
#endif |
| 42 |
|
| 43 |
namespace google { |
| 44 |
namespace protobuf { |
| 45 |
namespace internal { |
| 46 |
|
| 47 |
template <size_t doublewords> |
| 48 |
class HasBits { |
| 49 |
public: |
| 50 |
constexpr HasBits() PROTOBUF_ALWAYS_INLINE : has_bits_{} {} |
| 51 |
|
| 52 |
void Clear() PROTOBUF_ALWAYS_INLINE { |
| 53 |
memset(has_bits_, 0, sizeof(has_bits_)); |
| 54 |
} |
| 55 |
|
| 56 |
uint32& operator[](int index) PROTOBUF_ALWAYS_INLINE { |
| 57 |
return has_bits_[index]; |
| 58 |
} |
| 59 |
|
| 60 |
const uint32& operator[](int index) const PROTOBUF_ALWAYS_INLINE { |
| 61 |
return has_bits_[index]; |
| 62 |
} |
| 63 |
|
| 64 |
bool operator==(const HasBits<doublewords>& rhs) const { |
| 65 |
return memcmp(has_bits_, rhs.has_bits_, sizeof(has_bits_)) == 0; |
| 66 |
} |
| 67 |
|
| 68 |
bool operator!=(const HasBits<doublewords>& rhs) const { |
| 69 |
return !(*this == rhs); |
| 70 |
} |
| 71 |
|
| 72 |
void Or(const HasBits<doublewords>& rhs) { |
| 73 |
for (size_t i = 0; i < doublewords; i++) has_bits_[i] |= rhs[i]; |
| 74 |
} |
| 75 |
|
| 76 |
bool empty() const; |
| 77 |
|
| 78 |
private: |
| 79 |
uint32 has_bits_[doublewords]; |
| 80 |
}; |
| 81 |
|
| 82 |
template <> |
| 83 |
inline bool HasBits<1>::empty() const { |
| 84 |
return !has_bits_[0]; |
| 85 |
} |
| 86 |
|
| 87 |
template <> |
| 88 |
inline bool HasBits<2>::empty() const { |
| 89 |
return !(has_bits_[0] | has_bits_[1]); |
| 90 |
} |
| 91 |
|
| 92 |
template <> |
| 93 |
inline bool HasBits<3>::empty() const { |
| 94 |
return !(has_bits_[0] | has_bits_[1] | has_bits_[2]); |
| 95 |
} |
| 96 |
|
| 97 |
template <> |
| 98 |
inline bool HasBits<4>::empty() const { |
| 99 |
return !(has_bits_[0] | has_bits_[1] | has_bits_[2] | has_bits_[3]); |
| 100 |
} |
| 101 |
|
| 102 |
template <size_t doublewords> |
| 103 |
inline bool HasBits<doublewords>::empty() const { |
| 104 |
for (size_t i = 0; i < doublewords; ++i) { |
| 105 |
if (has_bits_[i]) return false; |
| 106 |
} |
| 107 |
return true; |
| 108 |
} |
| 109 |
|
| 110 |
} // namespace internal |
| 111 |
} // namespace protobuf |
| 112 |
} // namespace google |
| 113 |
|
| 114 |
#include <google/protobuf/port_undef.inc> |
| 115 |
|
| 116 |
#endif // GOOGLE_PROTOBUF_HAS_BITS_H__ |