Sha256: ee7bf1b6561e6c22e439484041ffc1702a0f0e3acb38adcc65208b482c9a0835
Contents?: true
Size: 1.67 KB
Versions: 6
Compression:
Stored size: 1.67 KB
Contents
// Protocol Buffers - Google's data interchange format // Copyright 2023 Google LLC. All rights reserved. // // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file or at // https://developers.google.com/open-source/licenses/bsd #ifndef UPB_MINI_TABLE_INTERNAL_ENUM_H_ #define UPB_MINI_TABLE_INTERNAL_ENUM_H_ #include <stdint.h> // Must be last. #include "upb/port/def.inc" struct upb_MiniTableEnum { uint32_t UPB_PRIVATE(mask_limit); // Highest that can be tested with mask. uint32_t UPB_PRIVATE(value_count); // Number of values after the bitfield. uint32_t UPB_PRIVATE(data)[]; // Bitmask + enumerated values follow. }; #ifdef __cplusplus extern "C" { #endif UPB_API_INLINE bool upb_MiniTableEnum_CheckValue( const struct upb_MiniTableEnum* e, uint32_t val) { if (UPB_LIKELY(val < 64)) { const uint64_t mask = e->UPB_PRIVATE(data)[0] | ((uint64_t)e->UPB_PRIVATE(data)[1] << 32); const uint64_t bit = 1ULL << val; return (mask & bit) != 0; } if (UPB_LIKELY(val < e->UPB_PRIVATE(mask_limit))) { const uint32_t mask = e->UPB_PRIVATE(data)[val / 32]; const uint32_t bit = 1ULL << (val % 32); return (mask & bit) != 0; } // OPT: binary search long lists? const uint32_t* start = &e->UPB_PRIVATE(data)[e->UPB_PRIVATE(mask_limit) / 32]; const uint32_t* limit = &e->UPB_PRIVATE( data)[e->UPB_PRIVATE(mask_limit) / 32 + e->UPB_PRIVATE(value_count)]; for (const uint32_t* p = start; p < limit; p++) { if (*p == val) return true; } return false; } #ifdef __cplusplus } /* extern "C" */ #endif #include "upb/port/undef.inc" #endif /* UPB_MINI_TABLE_INTERNAL_ENUM_H_ */
Version data entries
6 entries across 6 versions & 1 rubygems