Eric Salo
2 years ago
committed by
Copybara-Service
parent
115b878a5c
commit
fd14316f38
26 changed files with 323 additions and 289 deletions
@ -0,0 +1,82 @@ |
||||
/*
|
||||
* 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_ARRAY_H_ |
||||
#define UPB_COLLECTIONS_ARRAY_H_ |
||||
|
||||
#include "upb/collections/message_value.h" |
||||
|
||||
// Must be last.
|
||||
#include "upb/port_def.inc" |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
/* 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 number of elements in 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); |
||||
|
||||
#ifdef __cplusplus |
||||
} /* extern "C" */ |
||||
#endif |
||||
|
||||
#include "upb/port_undef.inc" |
||||
|
||||
#endif /* UPB_COLLECTIONS_ARRAY_H_ */ |
||||
@ -0,0 +1,116 @@ |
||||
/*
|
||||
* 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_MAP_H_ |
||||
#define UPB_COLLECTIONS_MAP_H_ |
||||
|
||||
#include "upb/collections/message_value.h" |
||||
|
||||
// Must be last.
|
||||
#include "upb/port_def.inc" |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
/* 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); |
||||
|
||||
typedef enum { |
||||
// LINT.IfChange
|
||||
kUpb_MapInsertStatus_Inserted = 0, |
||||
kUpb_MapInsertStatus_Replaced = 1, |
||||
kUpb_MapInsertStatus_OutOfMemory = 2, |
||||
// LINT.ThenChange(//depot/google3/third_party/upb/upb/msg_internal.h)
|
||||
} upb_MapInsertStatus; |
||||
|
||||
/* Sets the given key to the given value, returning whether the key was inserted
|
||||
* or replaced. If the key was inserted, then any existing iterators will be |
||||
* invalidated. */ |
||||
upb_MapInsertStatus upb_Map_Insert(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, upb_Arena* arena); |
||||
|
||||
/* Sets the given key to the given value. Returns false if memory allocation
|
||||
* failed. If the key is newly inserted, then any existing iterators will be |
||||
* invalidated. */ |
||||
UPB_INLINE bool upb_Map_Set(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, upb_Arena* arena) { |
||||
return upb_Map_Insert(map, key, val, arena) != |
||||
kUpb_MapInsertStatus_OutOfMemory; |
||||
} |
||||
|
||||
/* 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_MAP_H_ */ |
||||
@ -1,89 +0,0 @@ |
||||
/*
|
||||
* 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/internal/array.h" |
||||
|
||||
#include <string.h> |
||||
|
||||
// Must be last.
|
||||
#include "upb/port_def.inc" |
||||
|
||||
bool _upb_array_realloc(upb_Array* arr, size_t min_capacity, upb_Arena* arena) { |
||||
size_t new_capacity = UPB_MAX(arr->capacity, 4); |
||||
int elem_size_lg2 = arr->data & 7; |
||||
size_t old_bytes = arr->capacity << elem_size_lg2; |
||||
size_t new_bytes; |
||||
void* ptr = _upb_array_ptr(arr); |
||||
|
||||
/* Log2 ceiling of size. */ |
||||
while (new_capacity < min_capacity) new_capacity *= 2; |
||||
|
||||
new_bytes = new_capacity << elem_size_lg2; |
||||
ptr = upb_Arena_Realloc(arena, ptr, old_bytes, new_bytes); |
||||
|
||||
if (!ptr) { |
||||
return false; |
||||
} |
||||
|
||||
arr->data = _upb_tag_arrptr(ptr, elem_size_lg2); |
||||
arr->capacity = new_capacity; |
||||
return true; |
||||
} |
||||
|
||||
static upb_Array* getorcreate_array(upb_Array** arr_ptr, int elem_size_lg2, |
||||
upb_Arena* arena) { |
||||
upb_Array* arr = *arr_ptr; |
||||
if (!arr) { |
||||
arr = _upb_Array_New(arena, 4, elem_size_lg2); |
||||
if (!arr) return NULL; |
||||
*arr_ptr = arr; |
||||
} |
||||
return arr; |
||||
} |
||||
|
||||
void* _upb_Array_Resize_fallback(upb_Array** arr_ptr, size_t size, |
||||
int elem_size_lg2, upb_Arena* arena) { |
||||
upb_Array* arr = getorcreate_array(arr_ptr, elem_size_lg2, arena); |
||||
return arr && _upb_Array_Resize(arr, size, arena) ? _upb_array_ptr(arr) |
||||
: NULL; |
||||
} |
||||
|
||||
bool _upb_Array_Append_fallback(upb_Array** arr_ptr, const void* value, |
||||
int elem_size_lg2, upb_Arena* arena) { |
||||
upb_Array* arr = getorcreate_array(arr_ptr, elem_size_lg2, arena); |
||||
if (!arr) return false; |
||||
|
||||
size_t elems = arr->size; |
||||
|
||||
if (!_upb_Array_Resize(arr, elems + 1, arena)) { |
||||
return false; |
||||
} |
||||
|
||||
char* data = _upb_array_ptr(arr); |
||||
memcpy(data + (elems << elem_size_lg2), value, 1 << elem_size_lg2); |
||||
return true; |
||||
} |
||||
Loading…
Reference in new issue