1 /*
2 * Copyright (c) 2009-2021, Google LLC
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * * Neither the name of Google LLC nor the
13 * names of its contributors may be used to endorse or promote products
14 * derived from this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL Google LLC BE LIABLE FOR ANY DIRECT,
20 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
27
28 #include <string.h>
29
30 #include "upb/collections/array_internal.h"
31
32 // Must be last.
33 #include "upb/port/def.inc"
34
35 const char _upb_Array_CTypeSizeLg2Table[] = {
36 [kUpb_CType_Bool] = 0,
37 [kUpb_CType_Float] = 2,
38 [kUpb_CType_Int32] = 2,
39 [kUpb_CType_UInt32] = 2,
40 [kUpb_CType_Enum] = 2,
41 [kUpb_CType_Message] = UPB_SIZE(2, 3),
42 [kUpb_CType_Double] = 3,
43 [kUpb_CType_Int64] = 3,
44 [kUpb_CType_UInt64] = 3,
45 [kUpb_CType_String] = UPB_SIZE(3, 4),
46 [kUpb_CType_Bytes] = UPB_SIZE(3, 4),
47 };
48
upb_Array_New(upb_Arena * a,upb_CType type)49 upb_Array* upb_Array_New(upb_Arena* a, upb_CType type) {
50 return _upb_Array_New(a, 4, _upb_Array_CTypeSizeLg2(type));
51 }
52
upb_Array_Size(const upb_Array * arr)53 size_t upb_Array_Size(const upb_Array* arr) { return arr->size; }
54
upb_Array_Get(const upb_Array * arr,size_t i)55 upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i) {
56 upb_MessageValue ret;
57 const char* data = _upb_array_constptr(arr);
58 int lg2 = arr->data & 7;
59 UPB_ASSERT(i < arr->size);
60 memcpy(&ret, data + (i << lg2), 1 << lg2);
61 return ret;
62 }
63
upb_Array_Set(upb_Array * arr,size_t i,upb_MessageValue val)64 void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val) {
65 char* data = _upb_array_ptr(arr);
66 int lg2 = arr->data & 7;
67 UPB_ASSERT(i < arr->size);
68 memcpy(data + (i << lg2), &val, 1 << lg2);
69 }
70
upb_Array_Append(upb_Array * arr,upb_MessageValue val,upb_Arena * arena)71 bool upb_Array_Append(upb_Array* arr, upb_MessageValue val, upb_Arena* arena) {
72 UPB_ASSERT(arena);
73 if (!upb_Array_Resize(arr, arr->size + 1, arena)) {
74 return false;
75 }
76 upb_Array_Set(arr, arr->size - 1, val);
77 return true;
78 }
79
upb_Array_Move(upb_Array * arr,size_t dst_idx,size_t src_idx,size_t count)80 void upb_Array_Move(upb_Array* arr, size_t dst_idx, size_t src_idx,
81 size_t count) {
82 const int lg2 = arr->data & 7;
83 char* data = _upb_array_ptr(arr);
84 memmove(&data[dst_idx << lg2], &data[src_idx << lg2], count << lg2);
85 }
86
upb_Array_Insert(upb_Array * arr,size_t i,size_t count,upb_Arena * arena)87 bool upb_Array_Insert(upb_Array* arr, size_t i, size_t count,
88 upb_Arena* arena) {
89 UPB_ASSERT(arena);
90 UPB_ASSERT(i <= arr->size);
91 UPB_ASSERT(count + arr->size >= count);
92 const size_t oldsize = arr->size;
93 if (!upb_Array_Resize(arr, arr->size + count, arena)) {
94 return false;
95 }
96 upb_Array_Move(arr, i + count, i, oldsize - i);
97 return true;
98 }
99
100 /*
101 * i end arr->size
102 * |------------|XXXXXXXX|--------|
103 */
upb_Array_Delete(upb_Array * arr,size_t i,size_t count)104 void upb_Array_Delete(upb_Array* arr, size_t i, size_t count) {
105 const size_t end = i + count;
106 UPB_ASSERT(i <= end);
107 UPB_ASSERT(end <= arr->size);
108 upb_Array_Move(arr, i, end, arr->size - end);
109 arr->size -= count;
110 }
111
upb_Array_Resize(upb_Array * arr,size_t size,upb_Arena * arena)112 bool upb_Array_Resize(upb_Array* arr, size_t size, upb_Arena* arena) {
113 const size_t oldsize = arr->size;
114 if (UPB_UNLIKELY(!_upb_Array_ResizeUninitialized(arr, size, arena))) {
115 return false;
116 }
117 const size_t newsize = arr->size;
118 if (newsize > oldsize) {
119 const int lg2 = arr->data & 7;
120 char* data = _upb_array_ptr(arr);
121 memset(data + (oldsize << lg2), 0, (newsize - oldsize) << lg2);
122 }
123 return true;
124 }
125
126 // EVERYTHING BELOW THIS LINE IS INTERNAL - DO NOT USE /////////////////////////
127
_upb_array_realloc(upb_Array * arr,size_t min_capacity,upb_Arena * arena)128 bool _upb_array_realloc(upb_Array* arr, size_t min_capacity, upb_Arena* arena) {
129 size_t new_capacity = UPB_MAX(arr->capacity, 4);
130 int elem_size_lg2 = arr->data & 7;
131 size_t old_bytes = arr->capacity << elem_size_lg2;
132 size_t new_bytes;
133 void* ptr = _upb_array_ptr(arr);
134
135 // Log2 ceiling of size.
136 while (new_capacity < min_capacity) new_capacity *= 2;
137
138 new_bytes = new_capacity << elem_size_lg2;
139 ptr = upb_Arena_Realloc(arena, ptr, old_bytes, new_bytes);
140 if (!ptr) return false;
141
142 arr->data = _upb_tag_arrptr(ptr, elem_size_lg2);
143 arr->capacity = new_capacity;
144 return true;
145 }
146