/system/core/libpixelflinger/codeflinger/tinyutils/ |
H A D | Vector.h | 91 //! read-only access to an item at a given index 92 inline const TYPE& operator [] (size_t index) const; 94 inline const TYPE& itemAt(size_t index) const; 97 //! same as operator [], but allows to access the vector backward (from the end) with a negative index 98 const TYPE& mirrorItemAt(ssize_t index) const; 105 TYPE& editItemAt(size_t index); 113 //! insert another vector at a given index 114 ssize_t insertVectorAt(const Vector<TYPE>& vector, size_t index); 125 inline ssize_t insertAt(size_t index, size_t numItems = 1); 127 ssize_t insertAt(const TYPE& prototype_item, size_t index, size_ 150 removeAt(size_t index) argument 246 editItemAt(size_t index) argument 256 insertVectorAt(const Vector<TYPE>& vector, size_t index) argument 266 insertAt(const TYPE& item, size_t index, size_t numItems) argument 281 replaceAt(const TYPE& item, size_t index) argument 286 insertAt(size_t index, size_t numItems) argument 306 replaceAt(size_t index) argument 311 removeItemsAt(size_t index, size_t count) argument [all...] |
H A D | VectorImpl.cpp | 112 ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index) argument 114 if (index > size()) 116 void* where = _grow(index, vector.size()); 120 return where ? index : (ssize_t)NO_MEMORY; 128 ssize_t VectorImpl::insertAt(size_t index, size_t numItems) argument 130 return insertAt(0, index, numItems); 133 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument 135 if (index > size()) 137 void* where = _grow(index, numItems); 145 return where ? index 174 replaceAt(size_t index) argument 179 replaceAt(const void* prototype, size_t index) argument 488 ssize_t index = _indexOrderOf(item, &order); local [all...] |
H A D | KeyedVector.h | 65 const VALUE& valueAt(size_t index) const; 66 const KEY& keyAt(size_t index) const; 74 VALUE& editValueAt(size_t index); 82 ssize_t replaceValueAt(size_t index, const VALUE& item); 89 ssize_t removeItemsAt(size_t index, size_t count = 1); 132 const VALUE& KeyedVector<KEY,VALUE>::valueAt(size_t index) const { 133 return mVector.itemAt(index).value; 137 const KEY& KeyedVector<KEY,VALUE>::keyAt(size_t index) const { 138 return mVector.itemAt(index).key; 149 VALUE& KeyedVector<KEY,VALUE>::editValueAt(size_t index) { argument 166 replaceValueAt(size_t index, const VALUE& item) argument 180 removeItemsAt(size_t index, size_t count) argument [all...] |
H A D | SortedVector.h | 81 //! finds the index of an item 92 //! read-only access to an item at a given index 93 inline const TYPE& operator [] (size_t index) const; 95 inline const TYPE& itemAt(size_t index) const; 98 //! same as operator [], but allows to access the vector backward (from the end) with a negative index 99 const TYPE& mirrorItemAt(ssize_t index) const; 109 TYPE& editItemAt(size_t index) { argument 110 return *( static_cast<TYPE *>(VectorImpl::editItemLocation(index)) ); 121 inline ssize_t removeItemsAt(size_t index, size_t count = 1); 123 inline ssize_t removeAt(size_t index) { retur argument [all...] |
H A D | VectorImpl.h | 70 ssize_t insertVectorAt(const VectorImpl& vector, size_t index); 81 ssize_t replaceAt(size_t index); 82 ssize_t replaceAt(const void* item, size_t index); 85 ssize_t removeItemsAt(size_t index, size_t count = 1); 88 const void* itemLocation(size_t index) const; 89 void* editItemLocation(size_t index); 143 //! finds the index of an item 181 ssize_t insertVectorAt(const VectorImpl& vector, size_t index); 185 ssize_t replaceAt(size_t index); 186 ssize_t replaceAt(const void* item, size_t index); [all...] |
/system/core/libutils/tests/ |
H A D | BasicHashtable_test.cpp | 107 static void cookieAt(const BasicHashtable<TKey, TEntry>& h, size_t index, argument 109 uint32_t cookie = h.cookieAt(index); 129 ssize_t index, const TKey& key) { 130 return h.find(index, hash_type(key), key); 136 ssize_t index = find(h, -1, key); local 137 if (index >= 0) { 138 h.removeAt(index); 216 ssize_t index = find(h, -1, 8); local 217 ASSERT_EQ(-1, index); 219 index 128 find(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, ssize_t index, const TKey& key) argument 241 ssize_t index = find(h, -1, int(i)); local 259 ssize_t index = find(h, -1, int(i)); local 270 ssize_t index = find(h, -1, K); local 298 ssize_t index = -1; local [all...] |
/system/core/include/utils/ |
H A D | BasicHashtable.h | 68 ssize_t next(ssize_t index) const; 69 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const; 71 void removeAt(size_t index); 83 inline const Bucket& bucketAt(const void* __restrict__ buckets, size_t index) const { 85 static_cast<const uint8_t*>(buckets) + index * mBucketSize); 88 inline Bucket& bucketAt(void* __restrict__ buckets, size_t index) const { 89 return *reinterpret_cast<Bucket*>(static_cast<uint8_t*>(buckets) + index * mBucketSize); 124 // Returns the index of the first bucket that is in the collision chain 131 // Returns the increment to add to a bucket index to seek to the next bucket 138 // Returns the index o 140 chainSeek(size_t index, size_t increment, size_t count) argument 241 editEntryAt(size_t index) argument 280 find(ssize_t index, hash_t hash, const TKey& key) const argument 307 removeAt(size_t index) argument [all...] |
H A D | Vector.h | 102 //! read-only access to an item at a given index 103 inline const TYPE& operator [] (size_t index) const; 105 inline const TYPE& itemAt(size_t index) const; 114 TYPE& editItemAt(size_t index); 122 //! insert another vector at a given index 123 ssize_t insertVectorAt(const Vector<TYPE>& vector, size_t index); 129 //! insert an array at a given index 130 ssize_t insertArrayAt(const TYPE* array, size_t index, size_t length); 140 inline ssize_t insertAt(size_t index, size_t numItems = 1); 142 ssize_t insertAt(const TYPE& prototype_item, size_t index, size_ 165 removeAt(size_t index) argument 197 ssize_t index = removeItemsAt(pos-array()); local 297 editItemAt(size_t index) argument 307 insertVectorAt(const Vector<TYPE>& vector, size_t index) argument 317 insertArrayAt(const TYPE* array, size_t index, size_t length) argument 327 insertAt(const TYPE& item, size_t index, size_t numItems) argument 342 replaceAt(const TYPE& item, size_t index) argument 347 insertAt(size_t index, size_t numItems) argument 367 replaceAt(size_t index) argument 372 removeItemsAt(size_t index, size_t count) argument [all...] |
H A D | KeyedVector.h | 69 const VALUE& valueAt(size_t index) const; 70 const KEY& keyAt(size_t index) const; 72 const VALUE& operator[] (size_t index) const; 79 VALUE& editValueAt(size_t index); 87 ssize_t replaceValueAt(size_t index, const VALUE& item); 94 ssize_t removeItemsAt(size_t index, size_t count = 1); 149 const VALUE& KeyedVector<KEY,VALUE>::valueAt(size_t index) const { 150 return mVector.itemAt(index).value; 154 const VALUE& KeyedVector<KEY,VALUE>::operator[] (size_t index) const { 155 return valueAt(index); [all...] |
H A D | VectorImpl.h | 70 ssize_t insertVectorAt(const VectorImpl& vector, size_t index); 72 ssize_t insertArrayAt(const void* array, size_t index, size_t length); 83 ssize_t replaceAt(size_t index); 84 ssize_t replaceAt(const void* item, size_t index); 87 ssize_t removeItemsAt(size_t index, size_t count = 1); 90 const void* itemLocation(size_t index) const; 91 void* editItemLocation(size_t index); 140 //! finds the index of an item 168 ssize_t insertVectorAt(const VectorImpl& vector, size_t index); 170 ssize_t insertArrayAt(const void* array, size_t index, size_ [all...] |
H A D | LruCache.h | 63 size_t index() const { function in class:android::LruCache::Iterator 129 ssize_t index = mTable->find(-1, hash, key); local 130 if (index == -1) { 133 Entry& entry = mTable->editEntryAt(index); 146 ssize_t index = mTable->find(-1, hash, key); local 147 if (index >= 0) { 156 index = mTable->add(hash, initEntry); 157 Entry& entry = mTable->editEntryAt(index); 165 ssize_t index = mTable->find(-1, hash, key); local 166 if (index < [all...] |
H A D | SortedVector.h | 84 //! finds the index of an item 95 //! read-only access to an item at a given index 96 inline const TYPE& operator [] (size_t index) const; 98 inline const TYPE& itemAt(size_t index) const; 110 TYPE& editItemAt(size_t index) { argument 111 return *( static_cast<TYPE *>(VectorImpl::editItemLocation(index)) ); 122 inline ssize_t removeItemsAt(size_t index, size_t count = 1); 124 inline ssize_t removeAt(size_t index) { return removeItemsAt(index); } argument 188 const TYPE& SortedVector<TYPE>::operator[](size_t index) cons 236 removeItemsAt(size_t index, size_t count) argument [all...] |
/system/core/libutils/ |
H A D | BasicHashtable.cpp | 101 ssize_t BasicHashtableImpl::next(ssize_t index) const { 103 while (size_t(++index) < mBucketCount) { 104 const Bucket& bucket = bucketAt(mBuckets, index); 106 return index; 113 ssize_t BasicHashtableImpl::find(ssize_t index, hash_t hash, argument 120 if (index < 0) { 121 index = chainStart(hash, mBucketCount); 123 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); 126 return index; 137 index 161 size_t index = chainStart(hash, mBucketCount); local 188 removeAt(size_t index) argument 218 size_t index = chainStart(hash, newBucketCount); local [all...] |
H A D | VectorImpl.cpp | 109 ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index) argument 111 return insertArrayAt(vector.arrayImpl(), index, vector.size()); 119 ssize_t VectorImpl::insertArrayAt(const void* array, size_t index, size_t length) argument 121 if (index > size()) 123 void* where = _grow(index, length); 127 return where ? index : (ssize_t)NO_MEMORY; 135 ssize_t VectorImpl::insertAt(size_t index, size_t numItems) argument 137 return insertAt(0, index, numItems); 140 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument 142 if (index > siz 244 replaceAt(size_t index) argument 249 replaceAt(const void* prototype, size_t index) argument 272 removeItemsAt(size_t index, size_t count) argument 296 editItemLocation(size_t index) argument [all...] |
H A D | BlobCache.cpp | 85 ssize_t index = mCacheEntries.indexOf(dummyEntry); local 86 if (index < 0) { 111 sp<Blob> oldValueBlob(mCacheEntries[index].getValue()); 125 mCacheEntries.editItemAt(index).setValue(valueBlob); 143 ssize_t index = mCacheEntries.indexOf(dummyEntry); local 144 if (index < 0) { 151 sp<Blob> valueBlob(mCacheEntries[index].getValue());
|
H A D | PropertyMap.cpp | 59 ssize_t index = mProperties.indexOfKey(key); local 60 if (index < 0) { 64 outValue = mProperties.valueAt(index);
|
H A D | String8.cpp | 412 ssize_t index = find(other); local 413 if (index < 0) return false; 420 size_t tail = index; 421 while (size_t(index) < len) { 422 ssize_t next = find(other, index + skip); 427 memcpy(buf + tail, buf + index + skip, next - index - skip); 428 tail += next - index - skip; 429 index = next; 488 int32_t String8::getUtf32At(size_t index, size_ argument [all...] |
/system/core/toolbox/ |
H A D | readlink.c | 63 int index = optind; local 64 if (argc - index != 1) {
|
/system/core/libcutils/ |
H A D | hashmap.c | 118 size_t index = calculateIndex(newBucketCount, entry->hash); local 119 entry->next = newBuckets[index]; 120 newBuckets[index] = entry; 191 size_t index = calculateIndex(map->bucketCount, hash); local 193 Entry** p = &(map->buckets[index]); 223 size_t index = calculateIndex(map->bucketCount, hash); local 225 Entry* entry = map->buckets[index]; 238 size_t index = calculateIndex(map->bucketCount, hash); local 240 Entry* entry = map->buckets[index]; 254 size_t index local 286 size_t index = calculateIndex(map->bucketCount, hash); local [all...] |
/system/media/camera/include/system/ |
H A D | camera_metadata.h | 82 size_t index; member in struct:camera_metadata_entry 101 size_t index; member in struct:camera_metadata_ro_entry 334 * the end of the structure (highest index), so after addition, a 356 * Get metadata entry at position index in the metadata buffer. 360 * src and index are inputs; the passed-in entry is updated with the details of 368 size_t index, 372 * Get metadata entry at position index, but disallow editing the data. 376 size_t index, 401 * Delete an entry at given index. This is an expensive operation, since it 408 size_t index); [all...] |
/system/media/camera/tests/ |
H A D | camera_metadata_tests.cpp | 297 size_t index = 0; local 301 index, &entry); 303 EXPECT_EQ(index, (int)entry.index); 308 index++; 311 index, &entry); 313 EXPECT_EQ(index, entry.index); 318 index++; 321 index, [all...] |
/system/media/camera/src/ |
H A D | camera_metadata.c | 38 * array; otherwise, it can found in the parent's data array at index 393 ALOGE("%s: Entry index %zu had bad alignment (address %p)," 402 ALOGE("%s: Entry index %zu had a bad type %d", 412 ALOGE("%s: Entry index %zu had tag type %d, but the type was %d", 427 ALOGE("%s: Entry index %zu had bad data alignment (address %p)," 439 ALOGE("%s: Entry index %zu data ends (%zu) beyond the capacity " 447 ALOGE("%s: Entry index %zu had 0 items, but offset was non-0 " 596 size_t index, 599 if (index >= src->entry_count) return ERROR; 601 camera_metadata_buffer_entry_t *buffer_entry = get_entries(src) + index; 595 get_camera_metadata_entry(camera_metadata_t *src, size_t index, camera_metadata_entry_t *entry) argument 616 get_camera_metadata_ro_entry(const camera_metadata_t *src, size_t index, camera_metadata_ro_entry_t *entry) argument 664 delete_camera_metadata_entry(camera_metadata_t *dst, size_t index) argument 703 update_camera_metadata_entry(camera_metadata_t *dst, size_t index, const void *data, size_t data_count, camera_metadata_entry_t *updated_entry) argument 932 int index = 0; local [all...] |
/system/core/libpixelflinger/codeflinger/ |
H A D | Arm64Disassembler.cpp | 95 static void get_token(const char *instr, uint32_t index, char *token) argument 98 for(i = index, j = 0; i < strlen(instr); ++i) 100 if(instr[index] == '<' && instr[i] == '>') 105 else if(instr[index] != '<' && instr[i] == '<') 297 uint32_t index = 0; local 302 get_token(entry->instr_template, index, token); 312 index += strlen(token); 313 }while(index < length);
|
H A D | CodeCache.cpp | 168 ssize_t index = mCacheData.indexOfKey(key_t(keyBase)); 169 if (index >= 0) { 170 const cache_entry_t& e = mCacheData.valueAt(index);
|
/system/keymaster/ |
H A D | google_keymaster.cpp | 247 unsigned int index; local 248 for (index = 0; index < array_length(supported_export_formats); index++) { 249 if (test_format == supported_export_formats[index]) { 258 unsigned int index; local 259 for (index = 0; index < array_length(supported_import_formats); index++) { 260 if (test_format == supported_import_formats[index]) { [all...] |