Searched refs:index (Results 1 - 25 of 29) sorted by path

12

/system/core/adb/
H A Dtransport_local.c423 int index = get_available_local_transport_index_locked(); local
428 } else if (index < 0) {
434 local_transports[index] = t;
/system/core/include/cutils/
H A Darray.h42 /** Gets the pointer at the specified index. */
43 void* arrayGet(Array* array, int index);
45 /** Removes the pointer at the given index and returns it. */
46 void* arrayRemove(Array* array, int index);
48 /** Sets pointer at the given index. Returns old pointer. */
49 void* arraySet(Array* array, int index, void* pointer);
/system/core/include/usbhost/
H A Dusbhost.h184 int index,
/system/core/libcorkscrew/arch-arm/
H A Dbacktrace-arm.c24 * An ELF binary may contain an EXIDX section that provides an index to
152 uint32_t index = (low + high) / 2; local
153 uintptr_t entry = exidx_start + index * 8;
155 ALOGV("XXX low=%u, high=%u, index=%u", low, high, index);
162 high = index;
165 if (index + 1 < exidx_size) {
174 low = index + 1;
189 handler_index = index;
493 for (size_t index
[all...]
/system/core/libcorkscrew/arch-mips/
H A Dbacktrace-mips.c79 for (size_t index = 0; returned_frames < max_depth; index++) {
80 uintptr_t pc = index ? rewind_pc_arch(memory, state->pc) : state->pc;
93 ALOGV("#%d: frame=%p pc=%08x sp=%08x\n", index, frame, frame->absolute_pc, frame->stack_top);
/system/core/libcorkscrew/arch-x86/
H A Dbacktrace-x86.c102 for (size_t index = 0; state->ebp && returned_frames < max_depth; index++) {
104 index ? rewind_pc_arch(memory, state->eip) : state->eip,
/system/core/libctest/
H A Dctest.c62 int index = testSuite->size; local
63 testSuite->testNames[index] = name;
64 testSuite->tests[index] = test;
/system/core/libcutils/
H A Darray.c104 static inline void checkBounds(Array* array, int index) { argument
106 assert(index < array->size);
107 assert(index >= 0);
110 void* arrayGet(Array* array, int index) { argument
111 checkBounds(array, index);
112 return array->contents[index];
115 void* arrayRemove(Array* array, int index) { argument
116 checkBounds(array, index);
118 void* pointer = array->contents[index];
123 if (index !
133 arraySet(Array* array, int index, void* pointer) argument
[all...]
H A Dhashmap.c118 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 Dbuffer.cpp117 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/libpixelflinger/codeflinger/
H A DCodeCache.cpp168 ssize_t index = mCacheData.indexOfKey(key_t(keyBase));
169 if (index >= 0) {
170 const cache_entry_t& e = mCacheData.valueAt(index);
/system/core/libpixelflinger/tinyutils/
H A DKeyedVector.h56 const VALUE& valueAt(size_t index) const;
57 const KEY& keyAt(size_t index) const;
65 VALUE& editValueAt(size_t index);
73 ssize_t replaceValueAt(size_t index, const VALUE& item);
80 ssize_t removeItemsAt(size_t index, size_t count = 1);
123 const VALUE& KeyedVector<KEY,VALUE>::valueAt(size_t index) const {
124 return mVector.itemAt(index).value;
128 const KEY& KeyedVector<KEY,VALUE>::keyAt(size_t index) const {
129 return mVector.itemAt(index).key;
140 VALUE& KeyedVector<KEY,VALUE>::editValueAt(size_t index) { argument
157 replaceValueAt(size_t index, const VALUE& item) argument
171 removeItemsAt(size_t index, size_t count) argument
[all...]
H A DSortedVector.h80 //! finds the index of an item
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;
108 TYPE& editItemAt(size_t index) { argument
109 return *( static_cast<TYPE *>(VectorImpl::editItemLocation(index)) );
120 inline ssize_t removeItemsAt(size_t index, size_t count = 1);
122 inline ssize_t removeAt(size_t index) { retur argument
[all...]
H A DVector.h82 //! read-only access to an item at a given index
83 inline const TYPE& operator [] (size_t index) const;
85 inline const TYPE& itemAt(size_t index) const;
88 //! same as operator [], but allows to access the vector backward (from the end) with a negative index
89 const TYPE& mirrorItemAt(ssize_t index) const;
96 TYPE& editItemAt(size_t index);
104 //! insert another vector at a given index
105 ssize_t insertVectorAt(const Vector<TYPE>& vector, size_t index);
116 inline ssize_t insertAt(size_t index, size_t numItems = 1);
118 ssize_t insertAt(const TYPE& prototype_item, size_t index, size_
141 removeAt(size_t index) argument
237 editItemAt(size_t index) argument
247 insertVectorAt(const Vector<TYPE>& vector, size_t index) argument
257 insertAt(const TYPE& item, size_t index, size_t numItems) argument
272 replaceAt(const TYPE& item, size_t index) argument
277 insertAt(size_t index, size_t numItems) argument
297 replaceAt(size_t index) argument
302 removeItemsAt(size_t index, size_t count) argument
[all...]
H A DVectorImpl.cpp110 ssize_t VectorImpl::insertVectorAt(const VectorImpl& vector, size_t index) argument
112 if (index > size())
114 void* where = _grow(index, vector.size());
118 return where ? index : (ssize_t)NO_MEMORY;
126 ssize_t VectorImpl::insertAt(size_t index, size_t numItems) argument
128 return insertAt(0, index, numItems);
131 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument
133 if (index > size())
135 void* where = _grow(index, numItems);
143 return where ? index
172 replaceAt(size_t index) argument
177 replaceAt(const void* prototype, size_t index) argument
[all...]
H A DVectorImpl.h61 ssize_t insertVectorAt(const VectorImpl& vector, size_t index);
72 ssize_t replaceAt(size_t index);
73 ssize_t replaceAt(const void* item, size_t index);
76 ssize_t removeItemsAt(size_t index, size_t count = 1);
79 const void* itemLocation(size_t index) const;
80 void* editItemLocation(size_t index);
134 //! finds the index of an item
172 ssize_t insertVectorAt(const VectorImpl& vector, size_t index);
176 ssize_t replaceAt(size_t index);
177 ssize_t replaceAt(const void* item, size_t index);
[all...]
/system/core/libusbhost/
H A Dusbhost.c224 D("%s subdirectory %s: index: %d\n", (event->mask & IN_CREATE) ?
504 int index,
519 ctrl.wIndex = index;
500 usb_device_control_transfer(struct usb_device *device, int requestType, int request, int value, int index, void* buffer, int length, unsigned int timeout) argument
/system/core/sh/
H A Deval.c1065 shellexec(argv, envp, path, cmdentry.u.index, vforked);
H A Dexec.c92 short cmdtype; /* index identifying command */
99 STATIC int builtinloc = -1; /* index in path of %builtin, or -1 */
385 idx = cmdp->param.index;
448 entry->u.index = -1;
452 entry->u.index = -1;
456 entry->u.index = 0;
506 prev = cmdp->param.index;
579 cmdp->param.index = idx;
749 cmdp->param.index >= firstchange)
878 entry->u.index
[all...]
H A Dexec.h48 int index; member in union:cmdentry::param
/system/core/toolbox/
H A Dkill.c70 unsigned int index = sorted_signals[i]; local
71 if (index == SENTINEL) {
75 fprintf(stderr, "%2d) SIG%-9s ", i, signals[index].name);
/system/extras/fatblock/
H A Dfatblock.c80 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/extras/libublock/
H A Dublock.c32 uint32_t index; member in struct:ublock_ctx
98 ub_ctx->index = in_h->index;
326 return ub_ctx->index;
/system/media/camera/include/system/
H A Dcamera_metadata.h81 size_t index; member in struct:camera_metadata_entry
100 size_t index; member in struct:camera_metadata_ro_entry
290 * the end of the structure (highest index), so after addition, a
308 * Get metadata entry at position index in the metadata buffer.
310 * src and index are inputs; the passed-in entry is updated with the details of
316 size_t index,
341 * Delete an entry at given index. This is an expensive operation, since it
348 size_t index);
361 size_t index,
/system/media/camera/src/
H A Dcamera_metadata.c29 * array; otherwise, it can found in the parent's data array at index
379 size_t index,
382 if (index >= src->entry_count) return ERROR;
384 camera_metadata_buffer_entry_t *buffer_entry = src->entries + index;
386 entry->index = index;
404 uint32_t index;
416 index = search_entry - src->entries;
419 for (index = 0; index < sr
378 get_camera_metadata_entry(camera_metadata_t *src, size_t index, camera_metadata_entry_t *entry) argument
439 delete_camera_metadata_entry(camera_metadata_t *dst, size_t index) argument
477 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
704 int index = 0; local
[all...]

Completed in 76 milliseconds

12