/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/media/alsa_utils/ |
H A D | alsa_device_profile.c | 146 size_t index; local 147 for (index = 0; profile->sample_rates[index] != 0; index++) { 148 if (profile->sample_rates[index] == rate) { 172 size_t index; local 173 for (index = 0; profile->formats[index] != PCM_FORMAT_INVALID; index++) { 174 if (profile->formats[index] 222 unsigned index; local 279 unsigned index; local 398 size_t index; local 429 size_t index = 0; local 510 size_t index; local [all...] |
/system/core/libutils/tests/ |
H A D | BasicHashtable_test.cpp | 112 static void cookieAt(const BasicHashtable<TKey, TEntry>& h, size_t index, argument 114 uint32_t cookie = h.cookieAt(index); 134 ssize_t index, const TKey& key) { 135 return h.find(index, hash_type(key), key); 141 ssize_t index = find(h, -1, key); local 142 if (index >= 0) { 143 h.removeAt(index); 221 ssize_t index = find(h, -1, 8); local 222 ASSERT_EQ(-1, index); 224 index 133 find(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, ssize_t index, const TKey& key) argument 246 ssize_t index = find(h, -1, int(i)); local 264 ssize_t index = find(h, -1, int(i)); local 275 ssize_t index = find(h, -1, K); local 303 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...] |
/system/bt/bta/include/ |
H A D | bta_gatts_co.h | 77 extern BOOLEAN bta_gatts_co_load_handle_range(UINT8 index,
|
/system/bt/bta/sys/ |
H A D | bta_sys_conn.c | 123 UINT8 index; local 125 for (index = 0; index < MAX_COLLISION_REG; index++) 127 if ((bta_sys_cb.colli_reg.id[index] == bta_id) || 128 (bta_sys_cb.colli_reg.id[index] == 0)) 130 bta_sys_cb.colli_reg.id[index] = bta_id; 131 bta_sys_cb.colli_reg.p_coll_cback[index] = p_cback; 149 UINT8 index; local 151 for (index [all...] |
/system/bt/stack/btm/ |
H A D | btm_ble_batchscan.c | 179 BTM_TRACE_DEBUG("btm_ble_batchscan_enq_rep_q: index:%d, rep %d, ref %d", 199 int index = 0, len = 0; local 202 for (index = 0; index < BTM_BLE_BATCH_REP_MAIN_Q_SIZE; index++) 204 if (report_format == ble_batchscan_cb.main_rep_q.rep_mode[index]) 208 BTM_TRACE_DEBUG("btm_ble_batchscan_enq_rep_data: index:%d, rep %d, num %d len : %d", 209 index, report_format, num_records, data_len); 211 if (index < BTM_BLE_BATCH_REP_MAIN_Q_SIZE && data_len > 0 && num_records > 0) 213 len = ble_batchscan_cb.main_rep_q.data_len[index]; 249 int index = 0; local 958 int index = 0; local [all...] |
/system/bt/btif/co/ |
H A D | bta_av_co.c | 54 /* Macro to convert audio handle to index and vice versa */ 116 UINT8 sep_info_idx; /* local SEP index (in BTA tables) */ 117 UINT8 seid; /* peer SEP index (in peer tables) */ 249 UINT8 index; local 252 index = BTA_AV_CO_AUDIO_HNDL_TO_INDX(hndl); 255 if (index >= BTA_AV_CO_NUM_ELEMENTS(bta_av_co_cb.peers)) 257 APPL_TRACE_ERROR("bta_av_co_get_peer peer index out of bounds:%d", index); 261 return &bta_av_co_cb.peers[index]; 278 UINT8 *p_protect_info, UINT8 index) 277 bta_av_co_audio_init(UINT8 *p_codec_type, UINT8 *p_codec_info, UINT8 *p_num_protect, UINT8 *p_protect_info, UINT8 index) argument 466 UINT8 index; local 590 UINT8 index; local 1254 UINT8 index; local 1313 int index; local 1354 int index; local 1462 UINT8 index; local 1670 UINT8 index, jndex; local 1795 UINT8 index; local [all...] |
/system/bt/osi/include/ |
H A D | array.h | 38 // Returns a pointer to the |index|th element of |array|. |index| must be less than 40 void *array_at(const array_t *array, size_t index);
|
/system/media/audio_utils/ |
H A D | fifo.c | 45 // Return a new index as the sum of an old index (either mFront or mRear) and a specified increment. 46 static inline int32_t audio_utils_fifo_sum(struct audio_utils_fifo *fifo, int32_t index, argument 51 ALOG_ASSERT((index & mask) < fifo->mFrameCount); 53 if ((index & mask) + increment >= fifo->mFrameCount) { 56 index += increment; 57 ALOG_ASSERT((index & mask) < fifo->mFrameCount); 58 return index; 60 return index + increment;
|
/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/bt/bta/hh/ |
H A D | bta_hh_utils.c | 100 APPL_TRACE_DEBUG("bta_hh_find_cb:: index = %d while max = %d", 115 ** manitainace list, and update control block index map. 122 UINT8 index; local 135 index = p_cb->index; /* Preserve index for this control block */ 142 p_cb->index = index; /* Restore index for this control block */ 483 ** Description convert a HID device handle to the device control block index 491 UINT8 index = BTA_HH_IDX_INVALID; local [all...] |
/system/media/radio/src/ |
H A D | radio_metadata.c | 69 /* do not grow buffer if it can accommodate the new entry plus an additional index entry */ 85 /* move index table */ 134 const unsigned index, 137 unsigned int index_offset = metadata->size_int - index - 1; 141 if (index >= metadata->count) { 241 unsigned int index; local 258 for (index = 0; index < src_metadata_buf->count; index++) { 263 status = radio_metadata_get_at_index(src_metadata, index, 132 get_entry_at_index( const radio_metadata_buffer_t *metadata, const unsigned index, bool check) argument 344 radio_metadata_get_at_index(const radio_metadata_t *metadata, const unsigned int index, radio_metadata_key_t *key, radio_metadata_type_t *type, void **value, unsigned int *size) argument [all...] |