| OLD | NEW |
| 1 // Protocol Buffers - Google's data interchange format | 1 // Protocol Buffers - Google's data interchange format |
| 2 // Copyright 2008 Google Inc. All rights reserved. | 2 // Copyright 2008 Google Inc. All rights reserved. |
| 3 // https://developers.google.com/protocol-buffers/ | 3 // https://developers.google.com/protocol-buffers/ |
| 4 // | 4 // |
| 5 // Redistribution and use in source and binary forms, with or without | 5 // Redistribution and use in source and binary forms, with or without |
| 6 // modification, are permitted provided that the following conditions are | 6 // modification, are permitted provided that the following conditions are |
| 7 // met: | 7 // met: |
| 8 // | 8 // |
| 9 // * Redistributions of source code must retain the above copyright | 9 // * Redistributions of source code must retain the above copyright |
| 10 // notice, this list of conditions and the following disclaimer. | 10 // notice, this list of conditions and the following disclaimer. |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 30 | 30 |
| 31 #ifndef GOOGLE_PROTOBUF_ARENA_TEST_UTIL_H__ | 31 #ifndef GOOGLE_PROTOBUF_HAS_BITS_H__ |
| 32 #define GOOGLE_PROTOBUF_ARENA_TEST_UTIL_H__ | 32 #define GOOGLE_PROTOBUF_HAS_BITS_H__ |
| 33 | 33 |
| 34 #include <google/protobuf/stubs/common.h> |
| 34 | 35 |
| 35 namespace google { | 36 namespace google { |
| 36 namespace protobuf { | 37 namespace protobuf { |
| 37 namespace internal { | 38 namespace internal { |
| 38 | 39 |
| 39 class NoHeapChecker { | 40 template<size_t doublewords> |
| 41 class HasBits { |
| 40 public: | 42 public: |
| 41 NoHeapChecker() { | 43 HasBits() GOOGLE_ATTRIBUTE_ALWAYS_INLINE { Clear(); } |
| 42 capture_alloc.Hook(); | 44 |
| 45 void Clear() GOOGLE_ATTRIBUTE_ALWAYS_INLINE { |
| 46 memset(has_bits_, 0, sizeof(has_bits_)); |
| 43 } | 47 } |
| 44 ~NoHeapChecker(); | 48 |
| 49 ::google::protobuf::uint32& operator[](int index) GOOGLE_ATTRIBUTE_ALWAYS_INLI
NE { |
| 50 return has_bits_[index]; |
| 51 } |
| 52 |
| 53 const ::google::protobuf::uint32& operator[](int index) const GOOGLE_ATTRIBUTE
_ALWAYS_INLINE { |
| 54 return has_bits_[index]; |
| 55 } |
| 56 |
| 57 bool operator==(const HasBits<doublewords>& rhs) const { |
| 58 return memcmp(has_bits_, rhs.has_bits_, sizeof(has_bits_)) == 0; |
| 59 } |
| 60 |
| 61 bool operator!=(const HasBits<doublewords>& rhs) const { |
| 62 return !(*this == rhs); |
| 63 } |
| 45 private: | 64 private: |
| 46 class NewDeleteCapture { | 65 ::google::protobuf::uint32 has_bits_[doublewords]; |
| 47 public: | |
| 48 // TOOD(xiaofeng): Implement this for opensource protobuf. | |
| 49 void Hook() {} | |
| 50 void Unhook() {} | |
| 51 int alloc_count() { return 0; } | |
| 52 int free_count() { return 0; } | |
| 53 } capture_alloc; | |
| 54 }; | 66 }; |
| 55 | 67 |
| 56 } // namespace internal | 68 } // namespace internal |
| 57 } // namespace protobuf | 69 } // namespace protobuf |
| 58 | 70 |
| 59 } // namespace google | 71 } // namespace google |
| 60 #endif // GOOGLE_PROTOBUF_ARENA_TEST_UTIL_H__ | 72 #endif // GOOGLE_PROTOBUF_HAS_BITS_H__ |
| OLD | NEW |