/system/core/toolbox/ |
H A D | readlink.c | 63 int index = optind; local 64 if (argc - index != 1) {
|
H A D | kill.c | 70 unsigned int index = sorted_signals[i]; local 71 if (index == SENTINEL) { 75 fprintf(stderr, "%2d) SIG%-9s ", i, signals[index].name);
|
/system/core/sh/ |
H A D | exec.h | 48 int index; member in union:cmdentry::param
|
/system/core/libpixelflinger/codeflinger/tinyutils/ |
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 | 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 | 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...] |
/system/core/libctest/ |
H A D | ctest.c | 62 int index = testSuite->size; local 63 testSuite->testNames[index] = name; 64 testSuite->tests[index] = test;
|
/system/core/libutils/ |
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 | 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 | BlobCache.cpp | 84 ssize_t index = mCacheEntries.indexOf(dummyEntry); local 85 if (index < 0) { 110 sp<Blob> oldValueBlob(mCacheEntries[index].getValue()); 124 mCacheEntries.editItemAt(index).setValue(valueBlob); 142 ssize_t index = mCacheEntries.indexOf(dummyEntry); local 143 if (index < 0) { 150 sp<Blob> valueBlob(mCacheEntries[index].getValue());
|
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 | String8.cpp | 455 int32_t String8::getUtf32At(size_t index, size_t *next_index) const argument 457 return utf32_from_utf8_at(mString, length(), index, next_index);
|
/system/extras/fatblock/ |
H A D | fatblock.c | 80 static int set_ums_file(int index) argument 94 WARN("writing '/dev/block/ublock%d' to %s.\n", index, filename); 96 fprintf(file, "/dev/block/ublock%d", index); 154 int index; local 182 index = ublock_index(ub); 183 if (index < 0) 184 DIE("fatblock: invalid ublock index %d; aborting\n", index); 186 INFO("fatblock: block device ublock%d created\n", index); 187 set_ums_file(index); [all...] |
/system/media/camera/include/system/ |
H A D | camera_metadata.h | 81 size_t index; member in struct:camera_metadata_entry 100 size_t index; member in struct:camera_metadata_ro_entry 319 * the end of the structure (highest index), so after addition, a 337 * Get metadata entry at position index in the metadata buffer. 339 * src and index are inputs; the passed-in entry is updated with the details of 345 size_t index, 370 * Delete an entry at given index. This is an expensive operation, since it 377 size_t index); 390 size_t index,
|
/system/core/adb/ |
H A D | transport_local.c | 426 int index = get_available_local_transport_index_locked(); local 431 } else if (index < 0) { 437 local_transports[index] = t;
|
/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 | LruCache.h | 62 size_t index() const { function in class:android::LruCache::Iterator 124 ssize_t index = mTable->find(-1, hash, key); local 125 if (index == -1) { 128 Entry& entry = mTable->editEntryAt(index); 141 ssize_t index = mTable->find(-1, hash, key); local 142 if (index >= 0) { 151 index = mTable->add(hash, initEntry); 152 Entry& entry = mTable->editEntryAt(index); 160 ssize_t index = mTable->find(-1, hash, key); local 161 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...] |
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...] |
/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/core/libpixelflinger/ |
H A D | buffer.cpp | 117 int32_t index = x + (s->stride * y); local 118 uint8_t* const data = s->data + index * f->size; 174 int32_t index = x + (s->stride * y); local 175 uint8_t* const data = s->data + index * f->size;
|
/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...] |
H A D | LruCache_test.cpp | 193 int index = random() % kNumKeys; local 194 uint32_t key = hash_int(index); 197 EXPECT_EQ(strings[index], val); 200 cache.put(key, strings[index]);
|
/system/extras/libublock/ |
H A D | ublock.c | 32 uint32_t index; member in struct:ublock_ctx 98 ub_ctx->index = in_h->index; 326 return ub_ctx->index;
|
/system/extras/ksmutils/ |
H A D | ksminfo.c | 346 int index; local 374 index = snprintf(suffix, sizeof(suffix), ":%d", 377 index += snprintf(suffix + index, sizeof(suffix) - index, "[%d]",
|