The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2005 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #define LOG_TAG "Vector" |
| 18 | |
| 19 | #include <string.h> |
| 20 | #include <stdlib.h> |
| 21 | #include <stdio.h> |
| 22 | |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 23 | #include <cutils/log.h> |
| 24 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 25 | #include <utils/Errors.h> |
| 26 | #include <utils/SharedBuffer.h> |
| 27 | #include <utils/VectorImpl.h> |
| 28 | |
| 29 | /*****************************************************************************/ |
| 30 | |
| 31 | |
| 32 | namespace android { |
| 33 | |
| 34 | // ---------------------------------------------------------------------------- |
| 35 | |
| 36 | const size_t kMinVectorCapacity = 4; |
| 37 | |
| 38 | static inline size_t max(size_t a, size_t b) { |
| 39 | return a>b ? a : b; |
| 40 | } |
| 41 | |
| 42 | // ---------------------------------------------------------------------------- |
| 43 | |
| 44 | VectorImpl::VectorImpl(size_t itemSize, uint32_t flags) |
| 45 | : mStorage(0), mCount(0), mFlags(flags), mItemSize(itemSize) |
| 46 | { |
| 47 | } |
| 48 | |
| 49 | VectorImpl::VectorImpl(const VectorImpl& rhs) |
| 50 | : mStorage(rhs.mStorage), mCount(rhs.mCount), |
| 51 | mFlags(rhs.mFlags), mItemSize(rhs.mItemSize) |
| 52 | { |
| 53 | if (mStorage) { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 54 | SharedBuffer::bufferFromData(mStorage)->acquire(); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 55 | } |
| 56 | } |
| 57 | |
| 58 | VectorImpl::~VectorImpl() |
| 59 | { |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 60 | ALOGW_IF(mCount, |
| 61 | "[%p] subclasses of VectorImpl must call finish_vector()" |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 62 | " in their destructor. Leaking %d bytes.", |
| 63 | this, (int)(mCount*mItemSize)); |
| 64 | // We can't call _do_destroy() here because the vtable is already gone. |
| 65 | } |
| 66 | |
| 67 | VectorImpl& VectorImpl::operator = (const VectorImpl& rhs) |
| 68 | { |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 69 | LOG_ALWAYS_FATAL_IF(mItemSize != rhs.mItemSize, |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 70 | "Vector<> have different types (this=%p, rhs=%p)", this, &rhs); |
| 71 | if (this != &rhs) { |
| 72 | release_storage(); |
| 73 | if (rhs.mCount) { |
| 74 | mStorage = rhs.mStorage; |
| 75 | mCount = rhs.mCount; |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 76 | SharedBuffer::bufferFromData(mStorage)->acquire(); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 77 | } else { |
| 78 | mStorage = 0; |
| 79 | mCount = 0; |
| 80 | } |
| 81 | } |
| 82 | return *this; |
| 83 | } |
| 84 | |
| 85 | void* VectorImpl::editArrayImpl() |
| 86 | { |
| 87 | if (mStorage) { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 88 | SharedBuffer* sb = SharedBuffer::bufferFromData(mStorage)->attemptEdit(); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 89 | if (sb == 0) { |
| 90 | sb = SharedBuffer::alloc(capacity() * mItemSize); |
| 91 | if (sb) { |
| 92 | _do_copy(sb->data(), mStorage, mCount); |
| 93 | release_storage(); |
| 94 | mStorage = sb->data(); |
| 95 | } |
| 96 | } |
| 97 | } |
| 98 | return mStorage; |
| 99 | } |
| 100 | |
| 101 | size_t VectorImpl::capacity() const |
| 102 | { |
| 103 | if (mStorage) { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 104 | return SharedBuffer::bufferFromData(mStorage)->size() / mItemSize; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 105 | } |
| 106 | return 0; |
| 107 | } |
| 108 | |
| 109 | ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index) |
| 110 | { |
Jeff Brown | 9efaaa4 | 2010-06-16 01:53:36 -0700 | [diff] [blame] | 111 | return insertArrayAt(vector.arrayImpl(), index, vector.size()); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 112 | } |
| 113 | |
| 114 | ssize_t VectorImpl::appendVector(const VectorImpl& vector) |
| 115 | { |
| 116 | return insertVectorAt(vector, size()); |
| 117 | } |
| 118 | |
Jeff Brown | 9efaaa4 | 2010-06-16 01:53:36 -0700 | [diff] [blame] | 119 | ssize_t VectorImpl::insertArrayAt(const void* array, size_t index, size_t length) |
| 120 | { |
| 121 | if (index > size()) |
| 122 | return BAD_INDEX; |
| 123 | void* where = _grow(index, length); |
| 124 | if (where) { |
| 125 | _do_copy(where, array, length); |
| 126 | } |
| 127 | return where ? index : (ssize_t)NO_MEMORY; |
| 128 | } |
| 129 | |
| 130 | ssize_t VectorImpl::appendArray(const void* array, size_t length) |
| 131 | { |
| 132 | return insertArrayAt(array, size(), length); |
| 133 | } |
| 134 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 135 | ssize_t VectorImpl::insertAt(size_t index, size_t numItems) |
| 136 | { |
| 137 | return insertAt(0, index, numItems); |
| 138 | } |
| 139 | |
| 140 | ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) |
| 141 | { |
| 142 | if (index > size()) |
| 143 | return BAD_INDEX; |
| 144 | void* where = _grow(index, numItems); |
| 145 | if (where) { |
| 146 | if (item) { |
| 147 | _do_splat(where, item, numItems); |
| 148 | } else { |
| 149 | _do_construct(where, numItems); |
| 150 | } |
| 151 | } |
| 152 | return where ? index : (ssize_t)NO_MEMORY; |
| 153 | } |
| 154 | |
| 155 | static int sortProxy(const void* lhs, const void* rhs, void* func) |
| 156 | { |
| 157 | return (*(VectorImpl::compar_t)func)(lhs, rhs); |
| 158 | } |
| 159 | |
| 160 | status_t VectorImpl::sort(VectorImpl::compar_t cmp) |
| 161 | { |
| 162 | return sort(sortProxy, (void*)cmp); |
| 163 | } |
| 164 | |
| 165 | status_t VectorImpl::sort(VectorImpl::compar_r_t cmp, void* state) |
| 166 | { |
| 167 | // the sort must be stable. we're using insertion sort which |
| 168 | // is well suited for small and already sorted arrays |
| 169 | // for big arrays, it could be better to use mergesort |
| 170 | const ssize_t count = size(); |
| 171 | if (count > 1) { |
| 172 | void* array = const_cast<void*>(arrayImpl()); |
| 173 | void* temp = 0; |
| 174 | ssize_t i = 1; |
| 175 | while (i < count) { |
| 176 | void* item = reinterpret_cast<char*>(array) + mItemSize*(i); |
| 177 | void* curr = reinterpret_cast<char*>(array) + mItemSize*(i-1); |
| 178 | if (cmp(curr, item, state) > 0) { |
| 179 | |
| 180 | if (!temp) { |
| 181 | // we're going to have to modify the array... |
| 182 | array = editArrayImpl(); |
| 183 | if (!array) return NO_MEMORY; |
| 184 | temp = malloc(mItemSize); |
| 185 | if (!temp) return NO_MEMORY; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 186 | item = reinterpret_cast<char*>(array) + mItemSize*(i); |
| 187 | curr = reinterpret_cast<char*>(array) + mItemSize*(i-1); |
Mathias Agopian | 15d0edc | 2010-03-29 13:45:18 -0700 | [diff] [blame] | 188 | } else { |
| 189 | _do_destroy(temp, 1); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 190 | } |
| 191 | |
| 192 | _do_copy(temp, item, 1); |
| 193 | |
| 194 | ssize_t j = i-1; |
| 195 | void* next = reinterpret_cast<char*>(array) + mItemSize*(i); |
| 196 | do { |
Mathias Agopian | 15d0edc | 2010-03-29 13:45:18 -0700 | [diff] [blame] | 197 | _do_destroy(next, 1); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 198 | _do_copy(next, curr, 1); |
| 199 | next = curr; |
| 200 | --j; |
| 201 | curr = reinterpret_cast<char*>(array) + mItemSize*(j); |
| 202 | } while (j>=0 && (cmp(curr, temp, state) > 0)); |
| 203 | |
Mathias Agopian | 15d0edc | 2010-03-29 13:45:18 -0700 | [diff] [blame] | 204 | _do_destroy(next, 1); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 205 | _do_copy(next, temp, 1); |
| 206 | } |
| 207 | i++; |
| 208 | } |
| 209 | |
| 210 | if (temp) { |
| 211 | _do_destroy(temp, 1); |
| 212 | free(temp); |
| 213 | } |
| 214 | } |
| 215 | return NO_ERROR; |
| 216 | } |
| 217 | |
| 218 | void VectorImpl::pop() |
| 219 | { |
| 220 | if (size()) |
| 221 | removeItemsAt(size()-1, 1); |
| 222 | } |
| 223 | |
| 224 | void VectorImpl::push() |
| 225 | { |
| 226 | push(0); |
| 227 | } |
| 228 | |
| 229 | void VectorImpl::push(const void* item) |
| 230 | { |
| 231 | insertAt(item, size()); |
| 232 | } |
| 233 | |
| 234 | ssize_t VectorImpl::add() |
| 235 | { |
| 236 | return add(0); |
| 237 | } |
| 238 | |
Jeff Brown | 9efaaa4 | 2010-06-16 01:53:36 -0700 | [diff] [blame] | 239 | ssize_t VectorImpl::add(const void* item) |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 240 | { |
Jeff Brown | 9efaaa4 | 2010-06-16 01:53:36 -0700 | [diff] [blame] | 241 | return insertAt(item, size()); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 242 | } |
| 243 | |
| 244 | ssize_t VectorImpl::replaceAt(size_t index) |
| 245 | { |
| 246 | return replaceAt(0, index); |
| 247 | } |
| 248 | |
| 249 | ssize_t VectorImpl::replaceAt(const void* prototype, size_t index) |
| 250 | { |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 251 | ALOG_ASSERT(index<size(), |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 252 | "[%p] replace: index=%d, size=%d", this, (int)index, (int)size()); |
| 253 | |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 254 | if (index >= size()) { |
| 255 | return BAD_INDEX; |
| 256 | } |
| 257 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 258 | void* item = editItemLocation(index); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 259 | if (item != prototype) { |
| 260 | if (item == 0) |
| 261 | return NO_MEMORY; |
| 262 | _do_destroy(item, 1); |
| 263 | if (prototype == 0) { |
| 264 | _do_construct(item, 1); |
| 265 | } else { |
| 266 | _do_copy(item, prototype, 1); |
| 267 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 268 | } |
| 269 | return ssize_t(index); |
| 270 | } |
| 271 | |
| 272 | ssize_t VectorImpl::removeItemsAt(size_t index, size_t count) |
| 273 | { |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 274 | ALOG_ASSERT((index+count)<=size(), |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 275 | "[%p] remove: index=%d, count=%d, size=%d", |
| 276 | this, (int)index, (int)count, (int)size()); |
| 277 | |
| 278 | if ((index+count) > size()) |
| 279 | return BAD_VALUE; |
| 280 | _shrink(index, count); |
| 281 | return index; |
| 282 | } |
| 283 | |
| 284 | void VectorImpl::finish_vector() |
| 285 | { |
| 286 | release_storage(); |
| 287 | mStorage = 0; |
| 288 | mCount = 0; |
| 289 | } |
| 290 | |
| 291 | void VectorImpl::clear() |
| 292 | { |
| 293 | _shrink(0, mCount); |
| 294 | } |
| 295 | |
| 296 | void* VectorImpl::editItemLocation(size_t index) |
| 297 | { |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 298 | ALOG_ASSERT(index<capacity(), |
Mathias Agopian | 266a7d6 | 2011-07-11 16:26:18 -0700 | [diff] [blame] | 299 | "[%p] editItemLocation: index=%d, capacity=%d, count=%d", |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 300 | this, (int)index, (int)capacity(), (int)mCount); |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 301 | |
| 302 | if (index < capacity()) { |
| 303 | void* buffer = editArrayImpl(); |
| 304 | if (buffer) { |
| 305 | return reinterpret_cast<char*>(buffer) + index*mItemSize; |
| 306 | } |
| 307 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 308 | return 0; |
| 309 | } |
| 310 | |
| 311 | const void* VectorImpl::itemLocation(size_t index) const |
| 312 | { |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 313 | ALOG_ASSERT(index<capacity(), |
Mathias Agopian | 266a7d6 | 2011-07-11 16:26:18 -0700 | [diff] [blame] | 314 | "[%p] itemLocation: index=%d, capacity=%d, count=%d", |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 315 | this, (int)index, (int)capacity(), (int)mCount); |
| 316 | |
Mathias Agopian | bdf73c7 | 2012-08-09 19:39:15 -0700 | [diff] [blame] | 317 | if (index < capacity()) { |
| 318 | const void* buffer = arrayImpl(); |
| 319 | if (buffer) { |
| 320 | return reinterpret_cast<const char*>(buffer) + index*mItemSize; |
| 321 | } |
| 322 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 323 | return 0; |
| 324 | } |
| 325 | |
| 326 | ssize_t VectorImpl::setCapacity(size_t new_capacity) |
| 327 | { |
| 328 | size_t current_capacity = capacity(); |
| 329 | ssize_t amount = new_capacity - size(); |
| 330 | if (amount <= 0) { |
| 331 | // we can't reduce the capacity |
| 332 | return current_capacity; |
| 333 | } |
| 334 | SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); |
| 335 | if (sb) { |
| 336 | void* array = sb->data(); |
| 337 | _do_copy(array, mStorage, size()); |
| 338 | release_storage(); |
| 339 | mStorage = const_cast<void*>(array); |
| 340 | } else { |
| 341 | return NO_MEMORY; |
| 342 | } |
| 343 | return new_capacity; |
| 344 | } |
| 345 | |
Jesse Hall | b73559d | 2013-03-11 10:16:48 -0700 | [diff] [blame] | 346 | ssize_t VectorImpl::resize(size_t size) { |
| 347 | ssize_t result = NO_ERROR; |
| 348 | if (size > mCount) { |
| 349 | result = insertAt(mCount, size - mCount); |
| 350 | } else if (size < mCount) { |
| 351 | result = removeItemsAt(size, mCount - size); |
| 352 | } |
| 353 | return result < 0 ? result : size; |
| 354 | } |
| 355 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 356 | void VectorImpl::release_storage() |
| 357 | { |
| 358 | if (mStorage) { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 359 | const SharedBuffer* sb = SharedBuffer::bufferFromData(mStorage); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 360 | if (sb->release(SharedBuffer::eKeepStorage) == 1) { |
| 361 | _do_destroy(mStorage, mCount); |
| 362 | SharedBuffer::dealloc(sb); |
| 363 | } |
| 364 | } |
| 365 | } |
| 366 | |
| 367 | void* VectorImpl::_grow(size_t where, size_t amount) |
| 368 | { |
Steve Block | b37fbe9 | 2011-10-20 11:56:00 +0100 | [diff] [blame] | 369 | // ALOGV("_grow(this=%p, where=%d, amount=%d) count=%d, capacity=%d", |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 370 | // this, (int)where, (int)amount, (int)mCount, (int)capacity()); |
| 371 | |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 372 | ALOG_ASSERT(where <= mCount, |
Jeff Brown | aa5daed | 2011-07-13 22:22:02 -0700 | [diff] [blame] | 373 | "[%p] _grow: where=%d, amount=%d, count=%d", |
| 374 | this, (int)where, (int)amount, (int)mCount); // caller already checked |
| 375 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 376 | const size_t new_size = mCount + amount; |
| 377 | if (capacity() < new_size) { |
| 378 | const size_t new_capacity = max(kMinVectorCapacity, ((new_size*3)+1)/2); |
Steve Block | b37fbe9 | 2011-10-20 11:56:00 +0100 | [diff] [blame] | 379 | // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 380 | if ((mStorage) && |
| 381 | (mCount==where) && |
| 382 | (mFlags & HAS_TRIVIAL_COPY) && |
| 383 | (mFlags & HAS_TRIVIAL_DTOR)) |
| 384 | { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 385 | const SharedBuffer* cur_sb = SharedBuffer::bufferFromData(mStorage); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 386 | SharedBuffer* sb = cur_sb->editResize(new_capacity * mItemSize); |
Shuo Gao | eb0eb4f | 2013-10-17 11:36:11 +0800 | [diff] [blame] | 387 | if (sb) { |
| 388 | mStorage = sb->data(); |
| 389 | } else { |
| 390 | return NULL; |
| 391 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 392 | } else { |
| 393 | SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); |
| 394 | if (sb) { |
| 395 | void* array = sb->data(); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 396 | if (where != 0) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 397 | _do_copy(array, mStorage, where); |
| 398 | } |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 399 | if (where != mCount) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 400 | const void* from = reinterpret_cast<const uint8_t *>(mStorage) + where*mItemSize; |
| 401 | void* dest = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize; |
| 402 | _do_copy(dest, from, mCount-where); |
| 403 | } |
| 404 | release_storage(); |
| 405 | mStorage = const_cast<void*>(array); |
Shuo Gao | eb0eb4f | 2013-10-17 11:36:11 +0800 | [diff] [blame] | 406 | } else { |
| 407 | return NULL; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 408 | } |
| 409 | } |
| 410 | } else { |
Mathias Agopian | 03b168a | 2012-05-17 16:52:21 -0700 | [diff] [blame] | 411 | void* array = editArrayImpl(); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 412 | if (where != mCount) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 413 | const void* from = reinterpret_cast<const uint8_t *>(array) + where*mItemSize; |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 414 | void* to = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize; |
| 415 | _do_move_forward(to, from, mCount - where); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 416 | } |
| 417 | } |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 418 | mCount = new_size; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 419 | void* free_space = const_cast<void*>(itemLocation(where)); |
| 420 | return free_space; |
| 421 | } |
| 422 | |
| 423 | void VectorImpl::_shrink(size_t where, size_t amount) |
| 424 | { |
| 425 | if (!mStorage) |
| 426 | return; |
| 427 | |
Steve Block | b37fbe9 | 2011-10-20 11:56:00 +0100 | [diff] [blame] | 428 | // ALOGV("_shrink(this=%p, where=%d, amount=%d) count=%d, capacity=%d", |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 429 | // this, (int)where, (int)amount, (int)mCount, (int)capacity()); |
| 430 | |
Steve Block | ae07445 | 2012-01-09 18:35:44 +0000 | [diff] [blame] | 431 | ALOG_ASSERT(where + amount <= mCount, |
Jeff Brown | aa5daed | 2011-07-13 22:22:02 -0700 | [diff] [blame] | 432 | "[%p] _shrink: where=%d, amount=%d, count=%d", |
| 433 | this, (int)where, (int)amount, (int)mCount); // caller already checked |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 434 | |
| 435 | const size_t new_size = mCount - amount; |
| 436 | if (new_size*3 < capacity()) { |
| 437 | const size_t new_capacity = max(kMinVectorCapacity, new_size*2); |
Steve Block | b37fbe9 | 2011-10-20 11:56:00 +0100 | [diff] [blame] | 438 | // ALOGV("shrink vector %p, new_capacity=%d", this, (int)new_capacity); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 439 | if ((where == new_size) && |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 440 | (mFlags & HAS_TRIVIAL_COPY) && |
| 441 | (mFlags & HAS_TRIVIAL_DTOR)) |
| 442 | { |
Mathias Agopian | e79aadd | 2012-08-31 16:20:23 -0700 | [diff] [blame] | 443 | const SharedBuffer* cur_sb = SharedBuffer::bufferFromData(mStorage); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 444 | SharedBuffer* sb = cur_sb->editResize(new_capacity * mItemSize); |
Shuo Gao | eb0eb4f | 2013-10-17 11:36:11 +0800 | [diff] [blame] | 445 | if (sb) { |
| 446 | mStorage = sb->data(); |
| 447 | } else { |
| 448 | return; |
| 449 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 450 | } else { |
| 451 | SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); |
| 452 | if (sb) { |
| 453 | void* array = sb->data(); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 454 | if (where != 0) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 455 | _do_copy(array, mStorage, where); |
| 456 | } |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 457 | if (where != new_size) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 458 | const void* from = reinterpret_cast<const uint8_t *>(mStorage) + (where+amount)*mItemSize; |
| 459 | void* dest = reinterpret_cast<uint8_t *>(array) + where*mItemSize; |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 460 | _do_copy(dest, from, new_size - where); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 461 | } |
| 462 | release_storage(); |
| 463 | mStorage = const_cast<void*>(array); |
Shuo Gao | eb0eb4f | 2013-10-17 11:36:11 +0800 | [diff] [blame] | 464 | } else{ |
| 465 | return; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 466 | } |
| 467 | } |
| 468 | } else { |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 469 | void* array = editArrayImpl(); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 470 | void* to = reinterpret_cast<uint8_t *>(array) + where*mItemSize; |
| 471 | _do_destroy(to, amount); |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 472 | if (where != new_size) { |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 473 | const void* from = reinterpret_cast<uint8_t *>(array) + (where+amount)*mItemSize; |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 474 | _do_move_backward(to, from, new_size - where); |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 475 | } |
| 476 | } |
Jeff Brown | bbbd761 | 2011-07-14 00:29:49 -0700 | [diff] [blame] | 477 | mCount = new_size; |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 478 | } |
| 479 | |
| 480 | size_t VectorImpl::itemSize() const { |
| 481 | return mItemSize; |
| 482 | } |
| 483 | |
| 484 | void VectorImpl::_do_construct(void* storage, size_t num) const |
| 485 | { |
| 486 | if (!(mFlags & HAS_TRIVIAL_CTOR)) { |
| 487 | do_construct(storage, num); |
| 488 | } |
| 489 | } |
| 490 | |
| 491 | void VectorImpl::_do_destroy(void* storage, size_t num) const |
| 492 | { |
| 493 | if (!(mFlags & HAS_TRIVIAL_DTOR)) { |
| 494 | do_destroy(storage, num); |
| 495 | } |
| 496 | } |
| 497 | |
| 498 | void VectorImpl::_do_copy(void* dest, const void* from, size_t num) const |
| 499 | { |
| 500 | if (!(mFlags & HAS_TRIVIAL_COPY)) { |
| 501 | do_copy(dest, from, num); |
| 502 | } else { |
| 503 | memcpy(dest, from, num*itemSize()); |
| 504 | } |
| 505 | } |
| 506 | |
| 507 | void VectorImpl::_do_splat(void* dest, const void* item, size_t num) const { |
| 508 | do_splat(dest, item, num); |
| 509 | } |
| 510 | |
| 511 | void VectorImpl::_do_move_forward(void* dest, const void* from, size_t num) const { |
| 512 | do_move_forward(dest, from, num); |
| 513 | } |
| 514 | |
| 515 | void VectorImpl::_do_move_backward(void* dest, const void* from, size_t num) const { |
| 516 | do_move_backward(dest, from, num); |
| 517 | } |
| 518 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 519 | /*****************************************************************************/ |
| 520 | |
| 521 | SortedVectorImpl::SortedVectorImpl(size_t itemSize, uint32_t flags) |
| 522 | : VectorImpl(itemSize, flags) |
| 523 | { |
| 524 | } |
| 525 | |
| 526 | SortedVectorImpl::SortedVectorImpl(const VectorImpl& rhs) |
| 527 | : VectorImpl(rhs) |
| 528 | { |
| 529 | } |
| 530 | |
| 531 | SortedVectorImpl::~SortedVectorImpl() |
| 532 | { |
| 533 | } |
| 534 | |
| 535 | SortedVectorImpl& SortedVectorImpl::operator = (const SortedVectorImpl& rhs) |
| 536 | { |
| 537 | return static_cast<SortedVectorImpl&>( VectorImpl::operator = (static_cast<const VectorImpl&>(rhs)) ); |
| 538 | } |
| 539 | |
| 540 | ssize_t SortedVectorImpl::indexOf(const void* item) const |
| 541 | { |
| 542 | return _indexOrderOf(item); |
| 543 | } |
| 544 | |
| 545 | size_t SortedVectorImpl::orderOf(const void* item) const |
| 546 | { |
| 547 | size_t o; |
| 548 | _indexOrderOf(item, &o); |
| 549 | return o; |
| 550 | } |
| 551 | |
| 552 | ssize_t SortedVectorImpl::_indexOrderOf(const void* item, size_t* order) const |
| 553 | { |
Nick Kralevich | 1f28698 | 2015-08-22 14:27:03 -0700 | [diff] [blame^] | 554 | if (order) *order = 0; |
| 555 | if (isEmpty()) { |
| 556 | return NAME_NOT_FOUND; |
| 557 | } |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 558 | // binary search |
| 559 | ssize_t err = NAME_NOT_FOUND; |
| 560 | ssize_t l = 0; |
| 561 | ssize_t h = size()-1; |
| 562 | ssize_t mid; |
| 563 | const void* a = arrayImpl(); |
| 564 | const size_t s = itemSize(); |
| 565 | while (l <= h) { |
| 566 | mid = l + (h - l)/2; |
| 567 | const void* const curr = reinterpret_cast<const char *>(a) + (mid*s); |
| 568 | const int c = do_compare(curr, item); |
| 569 | if (c == 0) { |
| 570 | err = l = mid; |
| 571 | break; |
| 572 | } else if (c < 0) { |
| 573 | l = mid + 1; |
| 574 | } else { |
| 575 | h = mid - 1; |
| 576 | } |
| 577 | } |
| 578 | if (order) *order = l; |
| 579 | return err; |
| 580 | } |
| 581 | |
| 582 | ssize_t SortedVectorImpl::add(const void* item) |
| 583 | { |
| 584 | size_t order; |
| 585 | ssize_t index = _indexOrderOf(item, &order); |
| 586 | if (index < 0) { |
| 587 | index = VectorImpl::insertAt(item, order, 1); |
| 588 | } else { |
| 589 | index = VectorImpl::replaceAt(item, index); |
| 590 | } |
| 591 | return index; |
| 592 | } |
| 593 | |
| 594 | ssize_t SortedVectorImpl::merge(const VectorImpl& vector) |
| 595 | { |
| 596 | // naive merge... |
| 597 | if (!vector.isEmpty()) { |
| 598 | const void* buffer = vector.arrayImpl(); |
| 599 | const size_t is = itemSize(); |
| 600 | size_t s = vector.size(); |
| 601 | for (size_t i=0 ; i<s ; i++) { |
| 602 | ssize_t err = add( reinterpret_cast<const char*>(buffer) + i*is ); |
| 603 | if (err<0) { |
| 604 | return err; |
| 605 | } |
| 606 | } |
| 607 | } |
| 608 | return NO_ERROR; |
| 609 | } |
| 610 | |
| 611 | ssize_t SortedVectorImpl::merge(const SortedVectorImpl& vector) |
| 612 | { |
| 613 | // we've merging a sorted vector... nice! |
| 614 | ssize_t err = NO_ERROR; |
| 615 | if (!vector.isEmpty()) { |
| 616 | // first take care of the case where the vectors are sorted together |
| 617 | if (do_compare(vector.itemLocation(vector.size()-1), arrayImpl()) <= 0) { |
| 618 | err = VectorImpl::insertVectorAt(static_cast<const VectorImpl&>(vector), 0); |
| 619 | } else if (do_compare(vector.arrayImpl(), itemLocation(size()-1)) >= 0) { |
| 620 | err = VectorImpl::appendVector(static_cast<const VectorImpl&>(vector)); |
| 621 | } else { |
| 622 | // this could be made a little better |
| 623 | err = merge(static_cast<const VectorImpl&>(vector)); |
| 624 | } |
| 625 | } |
| 626 | return err; |
| 627 | } |
| 628 | |
| 629 | ssize_t SortedVectorImpl::remove(const void* item) |
| 630 | { |
| 631 | ssize_t i = indexOf(item); |
| 632 | if (i>=0) { |
| 633 | VectorImpl::removeItemsAt(i, 1); |
| 634 | } |
| 635 | return i; |
| 636 | } |
| 637 | |
The Android Open Source Project | cbb1011 | 2009-03-03 19:31:44 -0800 | [diff] [blame] | 638 | /*****************************************************************************/ |
| 639 | |
| 640 | }; // namespace android |
| 641 | |