// Protocol Buffers - Google's data interchange format // Copyright 2008 Google Inc. All rights reserved. // https://developers.google.com/protocol-buffers/ // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * 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. // * Neither the name of Google Inc. 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 // OWNER 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. // This file contains declarations needed in generated headers for messages // that use tail-call table parsing. Everything in this file is for internal // use only. #ifndef GOOGLE_PROTOBUF_GENERATED_MESSAGE_TCTABLE_DECL_H__ #define GOOGLE_PROTOBUF_GENERATED_MESSAGE_TCTABLE_DECL_H__ #include <array> #include <cstddef> #include <cstdint> #include <type_traits> #include <google/protobuf/message_lite.h> #include <google/protobuf/parse_context.h> // Must come last: #include <google/protobuf/port_def.inc> namespace google { namespace protobuf { namespace internal { // Additional information about this field: struct TcFieldData { … }; struct TcParseTableBase; // TailCallParseFunc is the function pointer type used in the tailcall table. TailCallParseFunc; namespace field_layout { struct Offset { … }; } // namespace field_layout #if defined(_MSC_VER) && !defined(_WIN64) #pragma warning(push) // TcParseTableBase is intentionally overaligned on 32 bit targets. #pragma warning(disable : 4324) #endif // Base class for message-level table with info for the tail-call parser. struct alignas(uint64_t) TcParseTableBase { … }; #if defined(_MSC_VER) && !defined(_WIN64) #pragma warning(pop) #endif static_assert …; static_assert …; template <size_t kFastTableSizeLog2, size_t kNumFieldEntries = 0, size_t kNumFieldAux = 0, size_t kNameTableSize = 0, size_t kFieldLookupSize = 2> struct TcParseTable { … }; // Partial specialization: if there are no aux entries, there will be no array. // In C++, arrays cannot have length 0, but (C++11) std::array<T, 0> is valid. // However, different implementations have different sizeof(std::array<T, 0>). // Skipping the member makes offset computations portable. TcParseTable<kFastTableSizeLog2, kNumFieldEntries, 0, kNameTableSize, kFieldLookupSize>; // Partial specialization: if there are no fields at all, then we can save space // by skipping the field numbers and entries. TcParseTable<0, 0, 0, kNameTableSize, kFieldLookupSize>; static_assert …; static_assert …; } // namespace internal } // namespace protobuf } // namespace google #include <google/protobuf/port_undef.inc> #endif // GOOGLE_PROTOBUF_GENERATED_MESSAGE_TCTABLE_DECL_H__