Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
78 lines
2.9 KiB
78 lines
2.9 KiB
/* |
|
* Copyright (c) 2009-2021, Google LLC |
|
* All rights reserved. |
|
* |
|
* 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 LLC 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 Google LLC 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. |
|
*/ |
|
|
|
// These functions are only used by generated code. |
|
|
|
#ifndef UPB_COLLECTIONS_MAP_GENCODE_UTIL_H_ |
|
#define UPB_COLLECTIONS_MAP_GENCODE_UTIL_H_ |
|
|
|
#include "upb/collections/map_internal.h" |
|
|
|
// Must be last. |
|
#include "upb/port/def.inc" |
|
|
|
#ifdef __cplusplus |
|
extern "C" { |
|
#endif |
|
|
|
// Message map operations, these get the map from the message first. |
|
|
|
UPB_INLINE void _upb_msg_map_key(const void* msg, void* key, size_t size) { |
|
const upb_tabent* ent = (const upb_tabent*)msg; |
|
uint32_t u32len; |
|
upb_StringView k; |
|
k.data = upb_tabstr(ent->key, &u32len); |
|
k.size = u32len; |
|
_upb_map_fromkey(k, key, size); |
|
} |
|
|
|
UPB_INLINE void _upb_msg_map_value(const void* msg, void* val, size_t size) { |
|
const upb_tabent* ent = (const upb_tabent*)msg; |
|
upb_value v = {ent->val.val}; |
|
_upb_map_fromvalue(v, val, size); |
|
} |
|
|
|
UPB_INLINE void _upb_msg_map_set_value(void* msg, const void* val, |
|
size_t size) { |
|
upb_tabent* ent = (upb_tabent*)msg; |
|
// This is like _upb_map_tovalue() except the entry already exists |
|
// so we can reuse the allocated upb_StringView for string fields. |
|
if (size == UPB_MAPTYPE_STRING) { |
|
upb_StringView* strp = (upb_StringView*)(uintptr_t)ent->val.val; |
|
memcpy(strp, val, sizeof(*strp)); |
|
} else { |
|
memcpy(&ent->val.val, val, size); |
|
} |
|
} |
|
|
|
#ifdef __cplusplus |
|
} /* extern "C" */ |
|
#endif |
|
|
|
#include "upb/port/undef.inc" |
|
|
|
#endif /* UPB_COLLECTIONS_MAP_GENCODE_UTIL_H_ */
|
|
|