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// Must be included last.
38#include <google/protobuf/port_def.inc>
39
40#ifdef SWIG
41#error "You cannot SWIG proto headers"
42#endif
43
44namespace google {
45namespace protobuf {
46namespace internal {
47
48template <size_t doublewords>
49class HasBits {
50 public:
51 PROTOBUF_NDEBUG_INLINE constexpr HasBits() : has_bits_{} {}
52
53 PROTOBUF_NDEBUG_INLINE void Clear() {
54 memset(has_bits_, 0, sizeof(has_bits_));
55 }
56
57 PROTOBUF_NDEBUG_INLINE uint32_t& operator[](int index) {
58 return has_bits_[index];
59 }
60
61 PROTOBUF_NDEBUG_INLINE const uint32_t& operator[](int index) const {
62 return has_bits_[index];
63 }
64
65 bool operator==(const HasBits<doublewords>& rhs) const {
66 return memcmp(has_bits_, rhs.has_bits_, sizeof(has_bits_)) == 0;
67 }
68
69 bool operator!=(const HasBits<doublewords>& rhs) const {
70 return !(*this == rhs);
71 }
72
73 void Or(const HasBits<doublewords>& rhs) {
74 for (size_t i = 0; i < doublewords; i++) has_bits_[i] |= rhs[i];
75 }
76
77 bool empty() const;
78
79 private:
80 uint32_t has_bits_[doublewords];
81};
82
83template <>
84inline bool HasBits<1>::empty() const {
85 return !has_bits_[0];
86}
87
88template <>
89inline bool HasBits<2>::empty() const {
90 return !(has_bits_[0] | has_bits_[1]);
91}
92
93template <>
94inline bool HasBits<3>::empty() const {
95 return !(has_bits_[0] | has_bits_[1] | has_bits_[2]);
96}
97
98template <>
99inline bool HasBits<4>::empty() const {
100 return !(has_bits_[0] | has_bits_[1] | has_bits_[2] | has_bits_[3]);
101}
102
103template <size_t doublewords>
104inline bool HasBits<doublewords>::empty() const {
105 for (size_t i = 0; i < doublewords; ++i) {
106 if (has_bits_[i]) return false;
107 }
108 return true;
109}
110
111} // namespace internal
112} // namespace protobuf
113} // namespace google
114
115#include <google/protobuf/port_undef.inc>
116
117#endif // GOOGLE_PROTOBUF_HAS_BITS_H__
118