Protobuf Team
3 years ago
committed by
Copybara-Service
parent
5f627b69e5
commit
823ed18316
5 changed files with 371 additions and 269 deletions
@ -0,0 +1,191 @@ |
|||||||
|
/*
|
||||||
|
* 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. |
||||||
|
*/ |
||||||
|
|
||||||
|
#include "upb/collections.h" |
||||||
|
|
||||||
|
#include <string.h> |
||||||
|
|
||||||
|
#include "upb/msg.h" |
||||||
|
#include "upb/port_def.inc" |
||||||
|
#include "upb/table_internal.h" |
||||||
|
|
||||||
|
/* Strings/bytes are special-cased in maps. */ |
||||||
|
static char _upb_CTypeo_mapsize[12] = { |
||||||
|
0, |
||||||
|
1, /* kUpb_CType_Bool */ |
||||||
|
4, /* kUpb_CType_Float */ |
||||||
|
4, /* kUpb_CType_Int32 */ |
||||||
|
4, /* kUpb_CType_UInt32 */ |
||||||
|
4, /* kUpb_CType_Enum */ |
||||||
|
sizeof(void*), /* kUpb_CType_Message */ |
||||||
|
8, /* kUpb_CType_Double */ |
||||||
|
8, /* kUpb_CType_Int64 */ |
||||||
|
8, /* kUpb_CType_UInt64 */ |
||||||
|
0, /* kUpb_CType_String */ |
||||||
|
0, /* kUpb_CType_Bytes */ |
||||||
|
}; |
||||||
|
|
||||||
|
static const char _upb_CTypeo_sizelg2[12] = { |
||||||
|
0, |
||||||
|
0, /* kUpb_CType_Bool */ |
||||||
|
2, /* kUpb_CType_Float */ |
||||||
|
2, /* kUpb_CType_Int32 */ |
||||||
|
2, /* kUpb_CType_UInt32 */ |
||||||
|
2, /* kUpb_CType_Enum */ |
||||||
|
UPB_SIZE(2, 3), /* kUpb_CType_Message */ |
||||||
|
3, /* kUpb_CType_Double */ |
||||||
|
3, /* kUpb_CType_Int64 */ |
||||||
|
3, /* kUpb_CType_UInt64 */ |
||||||
|
UPB_SIZE(3, 4), /* kUpb_CType_String */ |
||||||
|
UPB_SIZE(3, 4), /* kUpb_CType_Bytes */ |
||||||
|
}; |
||||||
|
|
||||||
|
/** upb_Array *****************************************************************/ |
||||||
|
|
||||||
|
upb_Array* upb_Array_New(upb_Arena* a, upb_CType type) { |
||||||
|
return _upb_Array_New(a, 4, _upb_CTypeo_sizelg2[type]); |
||||||
|
} |
||||||
|
|
||||||
|
size_t upb_Array_Size(const upb_Array* arr) { return arr->len; } |
||||||
|
|
||||||
|
upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i) { |
||||||
|
upb_MessageValue ret; |
||||||
|
const char* data = _upb_array_constptr(arr); |
||||||
|
int lg2 = arr->data & 7; |
||||||
|
UPB_ASSERT(i < arr->len); |
||||||
|
memcpy(&ret, data + (i << lg2), 1 << lg2); |
||||||
|
return ret; |
||||||
|
} |
||||||
|
|
||||||
|
void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val) { |
||||||
|
char* data = _upb_array_ptr(arr); |
||||||
|
int lg2 = arr->data & 7; |
||||||
|
UPB_ASSERT(i < arr->len); |
||||||
|
memcpy(data + (i << lg2), &val, 1 << lg2); |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_Array_Append(upb_Array* arr, upb_MessageValue val, upb_Arena* arena) { |
||||||
|
if (!upb_Array_Resize(arr, arr->len + 1, arena)) { |
||||||
|
return false; |
||||||
|
} |
||||||
|
upb_Array_Set(arr, arr->len - 1, val); |
||||||
|
return true; |
||||||
|
} |
||||||
|
|
||||||
|
void upb_Array_Move(upb_Array* arr, size_t dst_idx, size_t src_idx, |
||||||
|
size_t count) { |
||||||
|
char* data = _upb_array_ptr(arr); |
||||||
|
int lg2 = arr->data & 7; |
||||||
|
memmove(&data[dst_idx << lg2], &data[src_idx << lg2], count << lg2); |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_Array_Insert(upb_Array* arr, size_t i, size_t count, |
||||||
|
upb_Arena* arena) { |
||||||
|
UPB_ASSERT(i <= arr->len); |
||||||
|
UPB_ASSERT(count + arr->len >= count); |
||||||
|
size_t oldsize = arr->len; |
||||||
|
if (!upb_Array_Resize(arr, arr->len + count, arena)) { |
||||||
|
return false; |
||||||
|
} |
||||||
|
upb_Array_Move(arr, i + count, i, oldsize - i); |
||||||
|
return true; |
||||||
|
} |
||||||
|
|
||||||
|
/*
|
||||||
|
* i end arr->len |
||||||
|
* |------------|XXXXXXXX|--------| |
||||||
|
*/ |
||||||
|
void upb_Array_Delete(upb_Array* arr, size_t i, size_t count) { |
||||||
|
size_t end = i + count; |
||||||
|
UPB_ASSERT(i <= end); |
||||||
|
UPB_ASSERT(end <= arr->len); |
||||||
|
upb_Array_Move(arr, i, end, arr->len - end); |
||||||
|
arr->len -= count; |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_Array_Resize(upb_Array* arr, size_t size, upb_Arena* arena) { |
||||||
|
return _upb_Array_Resize(arr, size, arena); |
||||||
|
} |
||||||
|
|
||||||
|
/** upb_Map *******************************************************************/ |
||||||
|
|
||||||
|
upb_Map* upb_Map_New(upb_Arena* a, upb_CType key_type, upb_CType value_type) { |
||||||
|
return _upb_Map_New(a, _upb_CTypeo_mapsize[key_type], |
||||||
|
_upb_CTypeo_mapsize[value_type]); |
||||||
|
} |
||||||
|
|
||||||
|
size_t upb_Map_Size(const upb_Map* map) { return _upb_Map_Size(map); } |
||||||
|
|
||||||
|
bool upb_Map_Get(const upb_Map* map, upb_MessageValue key, |
||||||
|
upb_MessageValue* val) { |
||||||
|
return _upb_Map_Get(map, &key, map->key_size, val, map->val_size); |
||||||
|
} |
||||||
|
|
||||||
|
void upb_Map_Clear(upb_Map* map) { _upb_Map_Clear(map); } |
||||||
|
|
||||||
|
bool upb_Map_Set(upb_Map* map, upb_MessageValue key, upb_MessageValue val, |
||||||
|
upb_Arena* arena) { |
||||||
|
return _upb_Map_Set(map, &key, map->key_size, &val, map->val_size, arena); |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_Map_Delete(upb_Map* map, upb_MessageValue key) { |
||||||
|
return _upb_Map_Delete(map, &key, map->key_size); |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_MapIterator_Next(const upb_Map* map, size_t* iter) { |
||||||
|
return _upb_map_next(map, iter); |
||||||
|
} |
||||||
|
|
||||||
|
bool upb_MapIterator_Done(const upb_Map* map, size_t iter) { |
||||||
|
upb_strtable_iter i; |
||||||
|
UPB_ASSERT(iter != kUpb_Map_Begin); |
||||||
|
i.t = &map->table; |
||||||
|
i.index = iter; |
||||||
|
return upb_strtable_done(&i); |
||||||
|
} |
||||||
|
|
||||||
|
/* Returns the key and value for this entry of the map. */ |
||||||
|
upb_MessageValue upb_MapIterator_Key(const upb_Map* map, size_t iter) { |
||||||
|
upb_strtable_iter i; |
||||||
|
upb_MessageValue ret; |
||||||
|
i.t = &map->table; |
||||||
|
i.index = iter; |
||||||
|
_upb_map_fromkey(upb_strtable_iter_key(&i), &ret, map->key_size); |
||||||
|
return ret; |
||||||
|
} |
||||||
|
|
||||||
|
upb_MessageValue upb_MapIterator_Value(const upb_Map* map, size_t iter) { |
||||||
|
upb_strtable_iter i; |
||||||
|
upb_MessageValue ret; |
||||||
|
i.t = &map->table; |
||||||
|
i.index = iter; |
||||||
|
_upb_map_fromvalue(upb_strtable_iter_value(&i), &ret, map->val_size); |
||||||
|
return ret; |
||||||
|
} |
||||||
|
|
||||||
|
/* void upb_MapIterator_SetValue(upb_Map *map, size_t iter, upb_MessageValue
|
||||||
|
* value); */ |
||||||
@ -0,0 +1,156 @@ |
|||||||
|
/*
|
||||||
|
* 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. |
||||||
|
*/ |
||||||
|
|
||||||
|
#ifndef UPB_COLLECTIONS_H_ |
||||||
|
#define UPB_COLLECTIONS_H_ |
||||||
|
|
||||||
|
#include "google/protobuf/descriptor.upb.h" |
||||||
|
#include "upb/port_def.inc" |
||||||
|
|
||||||
|
#ifdef __cplusplus |
||||||
|
extern "C" { |
||||||
|
#endif |
||||||
|
|
||||||
|
typedef union { |
||||||
|
bool bool_val; |
||||||
|
float float_val; |
||||||
|
double double_val; |
||||||
|
int32_t int32_val; |
||||||
|
int64_t int64_val; |
||||||
|
uint32_t uint32_val; |
||||||
|
uint64_t uint64_val; |
||||||
|
const upb_Map* map_val; |
||||||
|
const upb_Message* msg_val; |
||||||
|
const upb_Array* array_val; |
||||||
|
upb_StringView str_val; |
||||||
|
} upb_MessageValue; |
||||||
|
|
||||||
|
typedef union { |
||||||
|
upb_Map* map; |
||||||
|
upb_Message* msg; |
||||||
|
upb_Array* array; |
||||||
|
} upb_MutableMessageValue; |
||||||
|
|
||||||
|
/** upb_Array *****************************************************************/ |
||||||
|
|
||||||
|
/* Creates a new array on the given arena that holds elements of this type. */ |
||||||
|
upb_Array* upb_Array_New(upb_Arena* a, upb_CType type); |
||||||
|
|
||||||
|
/* Returns the size of the array. */ |
||||||
|
size_t upb_Array_Size(const upb_Array* arr); |
||||||
|
|
||||||
|
/* Returns the given element, which must be within the array's current size. */ |
||||||
|
upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i); |
||||||
|
|
||||||
|
/* Sets the given element, which must be within the array's current size. */ |
||||||
|
void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val); |
||||||
|
|
||||||
|
/* Appends an element to the array. Returns false on allocation failure. */ |
||||||
|
bool upb_Array_Append(upb_Array* array, upb_MessageValue val, upb_Arena* arena); |
||||||
|
|
||||||
|
/* Moves elements within the array using memmove(). Like memmove(), the source
|
||||||
|
* and destination elements may be overlapping. */ |
||||||
|
void upb_Array_Move(upb_Array* array, size_t dst_idx, size_t src_idx, |
||||||
|
size_t count); |
||||||
|
|
||||||
|
/* Inserts one or more empty elements into the array. Existing elements are
|
||||||
|
* shifted right. The new elements have undefined state and must be set with |
||||||
|
* `upb_Array_Set()`. |
||||||
|
* REQUIRES: `i <= upb_Array_Size(arr)` */ |
||||||
|
bool upb_Array_Insert(upb_Array* array, size_t i, size_t count, |
||||||
|
upb_Arena* arena); |
||||||
|
|
||||||
|
/* Deletes one or more elements from the array. Existing elements are shifted
|
||||||
|
* left. |
||||||
|
* REQUIRES: `i + count <= upb_Array_Size(arr)` */ |
||||||
|
void upb_Array_Delete(upb_Array* array, size_t i, size_t count); |
||||||
|
|
||||||
|
/* Changes the size of a vector. New elements are initialized to empty/0.
|
||||||
|
* Returns false on allocation failure. */ |
||||||
|
bool upb_Array_Resize(upb_Array* array, size_t size, upb_Arena* arena); |
||||||
|
|
||||||
|
/** upb_Map *******************************************************************/ |
||||||
|
|
||||||
|
/* Creates a new map on the given arena with the given key/value size. */ |
||||||
|
upb_Map* upb_Map_New(upb_Arena* a, upb_CType key_type, upb_CType value_type); |
||||||
|
|
||||||
|
/* Returns the number of entries in the map. */ |
||||||
|
size_t upb_Map_Size(const upb_Map* map); |
||||||
|
|
||||||
|
/* Stores a value for the given key into |*val| (or the zero value if the key is
|
||||||
|
* not present). Returns whether the key was present. The |val| pointer may be |
||||||
|
* NULL, in which case the function tests whether the given key is present. */ |
||||||
|
bool upb_Map_Get(const upb_Map* map, upb_MessageValue key, |
||||||
|
upb_MessageValue* val); |
||||||
|
|
||||||
|
/* Removes all entries in the map. */ |
||||||
|
void upb_Map_Clear(upb_Map* map); |
||||||
|
|
||||||
|
/* Sets the given key to the given value. Returns true if this was a new key in
|
||||||
|
* the map, or false if an existing key was replaced. */ |
||||||
|
bool upb_Map_Set(upb_Map* map, upb_MessageValue key, upb_MessageValue val, |
||||||
|
upb_Arena* arena); |
||||||
|
|
||||||
|
/* Deletes this key from the table. Returns true if the key was present. */ |
||||||
|
bool upb_Map_Delete(upb_Map* map, upb_MessageValue key); |
||||||
|
|
||||||
|
/* Map iteration:
|
||||||
|
* |
||||||
|
* size_t iter = kUpb_Map_Begin; |
||||||
|
* while (upb_MapIterator_Next(map, &iter)) { |
||||||
|
* upb_MessageValue key = upb_MapIterator_Key(map, iter); |
||||||
|
* upb_MessageValue val = upb_MapIterator_Value(map, iter); |
||||||
|
* |
||||||
|
* // If mutating is desired.
|
||||||
|
* upb_MapIterator_SetValue(map, iter, value2); |
||||||
|
* } |
||||||
|
*/ |
||||||
|
|
||||||
|
/* Advances to the next entry. Returns false if no more entries are present. */ |
||||||
|
bool upb_MapIterator_Next(const upb_Map* map, size_t* iter); |
||||||
|
|
||||||
|
/* Returns true if the iterator still points to a valid entry, or false if the
|
||||||
|
* iterator is past the last element. It is an error to call this function with |
||||||
|
* kUpb_Map_Begin (you must call next() at least once first). */ |
||||||
|
bool upb_MapIterator_Done(const upb_Map* map, size_t iter); |
||||||
|
|
||||||
|
/* Returns the key and value for this entry of the map. */ |
||||||
|
upb_MessageValue upb_MapIterator_Key(const upb_Map* map, size_t iter); |
||||||
|
upb_MessageValue upb_MapIterator_Value(const upb_Map* map, size_t iter); |
||||||
|
|
||||||
|
/* Sets the value for this entry. The iterator must not be done, and the
|
||||||
|
* iterator must not have been initialized const. */ |
||||||
|
void upb_MapIterator_SetValue(upb_Map* map, size_t iter, |
||||||
|
upb_MessageValue value); |
||||||
|
|
||||||
|
#ifdef __cplusplus |
||||||
|
} /* extern "C" */ |
||||||
|
#endif |
||||||
|
|
||||||
|
#include "upb/port_undef.inc" |
||||||
|
|
||||||
|
#endif /* UPB_COLLECTIONS_H_ */ |
||||||
Loading…
Reference in new issue