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.
191 lines
6.2 KiB
191 lines
6.2 KiB
4 years ago
|
/*
|
||
4 years ago
|
* Copyright (c) 2009-2021, Google LLC
|
||
4 years ago
|
* 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.
|
||
|
*/
|
||
|
|
||
|
/*
|
||
|
* Internal implementation details of the decoder that are shared between
|
||
|
* decode.c and decode_fast.c.
|
||
|
*/
|
||
4 years ago
|
|
||
|
#ifndef UPB_DECODE_INT_H_
|
||
|
#define UPB_DECODE_INT_H_
|
||
|
|
||
4 years ago
|
#include <setjmp.h>
|
||
|
|
||
4 years ago
|
#include "upb/msg_internal.h"
|
||
|
#include "upb/upb_internal.h"
|
||
4 years ago
|
|
||
|
/* Must be last. */
|
||
|
#include "upb/port_def.inc"
|
||
|
|
||
4 years ago
|
#define DECODE_NOGROUP (uint32_t)-1
|
||
4 years ago
|
|
||
4 years ago
|
typedef struct upb_decstate {
|
||
4 years ago
|
const char *end; /* Can read up to 16 bytes slop beyond this. */
|
||
|
const char *limit_ptr; /* = end + UPB_MIN(limit, 0) */
|
||
4 years ago
|
upb_msg *unknown_msg; /* If non-NULL, add unknown data at buffer flip. */
|
||
|
const char *unknown; /* Start of unknown data. */
|
||
4 years ago
|
int limit; /* Submessage limit relative to end. */
|
||
4 years ago
|
int depth;
|
||
4 years ago
|
uint32_t end_group; /* field number of END_GROUP tag, else DECODE_NOGROUP */
|
||
4 years ago
|
bool alias;
|
||
|
char patch[32];
|
||
|
upb_arena arena;
|
||
4 years ago
|
jmp_buf err;
|
||
|
} upb_decstate;
|
||
|
|
||
4 years ago
|
/* Error function that will abort decoding with longjmp(). We can't declare this
|
||
|
* UPB_NORETURN, even though it is appropriate, because if we do then compilers
|
||
|
* will "helpfully" refuse to tailcall to it
|
||
|
* (see: https://stackoverflow.com/a/55657013), which will defeat a major goal
|
||
|
* of our optimizations. That is also why we must declare it in a separate file,
|
||
|
* otherwise the compiler will see that it calls longjmp() and deduce that it is
|
||
|
* noreturn. */
|
||
4 years ago
|
const char *fastdecode_err(upb_decstate *d);
|
||
|
|
||
4 years ago
|
extern const uint8_t upb_utf8_offsets[];
|
||
|
|
||
|
UPB_INLINE
|
||
|
bool decode_verifyutf8_inl(const char *buf, int len) {
|
||
|
int i, j;
|
||
|
uint8_t offset;
|
||
|
|
||
|
i = 0;
|
||
|
while (i < len) {
|
||
|
offset = upb_utf8_offsets[(uint8_t)buf[i]];
|
||
|
if (offset == 0 || i + offset > len) {
|
||
|
return false;
|
||
|
}
|
||
|
for (j = i + 1; j < i + offset; j++) {
|
||
|
if ((buf[j] & 0xc0) != 0x80) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
i += offset;
|
||
|
}
|
||
|
return i == len;
|
||
|
}
|
||
|
|
||
4 years ago
|
/* x86-64 pointers always have the high 16 bits matching. So we can shift
|
||
|
* left 8 and right 8 without loss of information. */
|
||
|
UPB_INLINE intptr_t decode_totable(const upb_msglayout *tablep) {
|
||
|
return ((intptr_t)tablep << 8) | tablep->table_mask;
|
||
|
}
|
||
|
|
||
|
UPB_INLINE const upb_msglayout *decode_totablep(intptr_t table) {
|
||
4 years ago
|
return (const upb_msglayout*)(table >> 8);
|
||
4 years ago
|
}
|
||
4 years ago
|
|
||
4 years ago
|
UPB_INLINE
|
||
|
const char *decode_isdonefallback_inl(upb_decstate *d, const char *ptr,
|
||
|
int overrun) {
|
||
|
if (overrun < d->limit) {
|
||
|
/* Need to copy remaining data into patch buffer. */
|
||
|
UPB_ASSERT(overrun < 16);
|
||
4 years ago
|
if (d->unknown_msg) {
|
||
|
if (!_upb_msg_addunknown(d->unknown_msg, d->unknown, ptr - d->unknown,
|
||
|
&d->arena)) {
|
||
|
return NULL;
|
||
|
}
|
||
|
d->unknown = &d->patch[0] + overrun;
|
||
|
}
|
||
4 years ago
|
memset(d->patch + 16, 0, 16);
|
||
|
memcpy(d->patch, d->end, 16);
|
||
|
ptr = &d->patch[0] + overrun;
|
||
|
d->end = &d->patch[16];
|
||
|
d->limit -= 16;
|
||
|
d->limit_ptr = d->end + d->limit;
|
||
|
d->alias = false;
|
||
|
UPB_ASSERT(ptr < d->limit_ptr);
|
||
|
return ptr;
|
||
|
} else {
|
||
|
return NULL;
|
||
|
}
|
||
|
}
|
||
|
|
||
4 years ago
|
const char *decode_isdonefallback(upb_decstate *d, const char *ptr,
|
||
|
int overrun);
|
||
|
|
||
4 years ago
|
UPB_INLINE
|
||
4 years ago
|
bool decode_isdone(upb_decstate *d, const char **ptr) {
|
||
4 years ago
|
int overrun = *ptr - d->end;
|
||
|
if (UPB_LIKELY(*ptr < d->limit_ptr)) {
|
||
|
return false;
|
||
|
} else if (UPB_LIKELY(overrun == d->limit)) {
|
||
|
return true;
|
||
|
} else {
|
||
|
*ptr = decode_isdonefallback(d, *ptr, overrun);
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
|
||
4 years ago
|
UPB_INLINE
|
||
4 years ago
|
const char *fastdecode_tagdispatch(upb_decstate *d, const char *ptr,
|
||
|
upb_msg *msg, intptr_t table,
|
||
|
uint64_t hasbits, uint32_t tag) {
|
||
|
const upb_msglayout *table_p = decode_totablep(table);
|
||
|
uint8_t mask = table;
|
||
|
uint64_t data;
|
||
|
size_t idx = tag & mask;
|
||
4 years ago
|
UPB_ASSUME((idx & 7) == 0);
|
||
4 years ago
|
idx >>= 3;
|
||
|
data = table_p->fasttable[idx].field_data ^ tag;
|
||
|
return table_p->fasttable[idx].field_parser(d, ptr, msg, table, hasbits, data);
|
||
|
}
|
||
|
|
||
4 years ago
|
UPB_INLINE uint32_t fastdecode_loadtag(const char* ptr) {
|
||
4 years ago
|
uint16_t tag;
|
||
|
memcpy(&tag, ptr, 2);
|
||
|
return tag;
|
||
|
}
|
||
|
|
||
4 years ago
|
UPB_INLINE void decode_checklimit(upb_decstate *d) {
|
||
|
UPB_ASSERT(d->limit_ptr == d->end + UPB_MIN(0, d->limit));
|
||
|
}
|
||
|
|
||
4 years ago
|
UPB_INLINE int decode_pushlimit(upb_decstate *d, const char *ptr, int size) {
|
||
|
int limit = size + (int)(ptr - d->end);
|
||
|
int delta = d->limit - limit;
|
||
4 years ago
|
decode_checklimit(d);
|
||
4 years ago
|
d->limit = limit;
|
||
|
d->limit_ptr = d->end + UPB_MIN(0, limit);
|
||
4 years ago
|
decode_checklimit(d);
|
||
4 years ago
|
return delta;
|
||
|
}
|
||
|
|
||
4 years ago
|
UPB_INLINE void decode_poplimit(upb_decstate *d, const char *ptr,
|
||
|
int saved_delta) {
|
||
|
UPB_ASSERT(ptr - d->end == d->limit);
|
||
4 years ago
|
decode_checklimit(d);
|
||
4 years ago
|
d->limit += saved_delta;
|
||
|
d->limit_ptr = d->end + UPB_MIN(0, d->limit);
|
||
4 years ago
|
decode_checklimit(d);
|
||
4 years ago
|
}
|
||
|
|
||
4 years ago
|
#include "upb/port_undef.inc"
|
||
|
|
||
|
#endif /* UPB_DECODE_INT_H_ */
|