/system/core/toolbox/upstream-netbsd/usr.bin/grep/ |
H A D | queue.c | 62 struct qentry *item; local 64 item = grep_malloc(sizeof(struct qentry)); 65 item->data.dat = grep_malloc(sizeof(char) * x->len); 66 item->data.len = x->len; 67 item->data.line_no = x->line_no; 68 item->data.off = x->off; 69 memcpy(item->data.dat, x->dat, x->len); 70 item->data.file = x->file; 72 STAILQ_INSERT_TAIL(&queue, item, list); 75 item 84 struct qentry *item; local 98 struct qentry *item; local 110 struct qentry *item; local [all...] |
/system/core/include/cutils/ |
H A D | list.h | 58 static inline void list_add_tail(struct listnode *head, struct listnode *item) argument 60 item->next = head; 61 item->prev = head->prev; 62 head->prev->next = item; 63 head->prev = item; 66 static inline void list_add_head(struct listnode *head, struct listnode *item) argument 68 item->next = head->next; 69 item->prev = head; 70 head->next->prev = item; 71 head->next = item; 74 list_remove(struct listnode *item) argument [all...] |
/system/core/libdiskconfig/ |
H A D | write_lst.c | 32 struct write_list *item; local 34 if (!(item = malloc(sizeof(struct write_list) + data_len))) { 39 item->len = data_len; 40 return item; 44 free_wl(struct write_list *item) argument 46 if (item) 47 free(item); 51 wlist_add(struct write_list **lst, struct write_list *item) argument 53 item->next = (*lst); 54 *lst = item; [all...] |
H A D | config_mbr.c | 74 struct write_list *item; local 82 if (!(item = alloc_wl(sizeof(struct pc_partition)))) { 91 item->offset = (loff_t)((uintptr_t)((uint8_t *)(&mbr->ptable[pnum]))); 94 pentry = (struct pc_partition *) &item->data; 129 return item; 144 struct write_list *item; local 148 if (!(item = alloc_wl(sizeof(struct pc_boot_record)))) { 155 item->offset = ((loff_t)(*lba)) * dinfo->sect_size; 158 ebr = (struct pc_boot_record *) &item->data; 203 return item; 214 struct write_list *item; local [all...] |
/system/core/include/utils/ |
H A D | VectorImpl.h | 77 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1); 80 void push(const void* item); 82 ssize_t add(const void* item); 84 ssize_t replaceAt(const void* item, size_t index); 105 virtual void do_splat(void* dest, const void* item, size_t num) const = 0; 116 inline void _do_splat(void* dest, const void* item, size_t num) const; 140 //! finds the index of an item 141 ssize_t indexOf(const void* item) const; 143 //! finds where this item should be inserted 144 size_t orderOf(const void* item) cons [all...] |
H A D | SortedVector.h | 84 //! finds the index of an item 85 ssize_t indexOf(const TYPE& item) const; 87 //! finds where this item should be inserted 88 size_t orderOf(const TYPE& item) const; 95 //! read-only access to an item at a given index 106 //! add an item in the right place (and replace the one that is there) 107 ssize_t add(const TYPE& item); 109 //! editItemAt() MUST NOT change the order of this item 118 //! removes an item 123 //! remove one item 206 add(const TYPE& item) argument 231 remove(const TYPE& item) argument 258 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
H A D | Vector.h | 102 //! read-only access to an item at a given index 113 //! copy-on write support, grants write access to an item 141 //! insert one or several items initialized from a prototype item 145 //! pushes an item initialized with its default constructor 147 //! pushes an item on the top of the stack 148 void push(const TYPE& item); 149 //! same as push() but returns the index the item was added at (or an error) 151 //! same as push() but returns the index the item was added at (or an error) 152 ssize_t add(const TYPE& item); 153 //! replace an item wit 194 push_back(const TYPE& item) argument 195 push_front(const TYPE& item) argument 327 insertAt(const TYPE& item, size_t index, size_t numItems) argument 332 push(const TYPE& item) argument 337 add(const TYPE& item) argument 342 replaceAt(const TYPE& item, size_t index) argument 404 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
H A D | KeyedVector.h | 85 ssize_t add(const KEY& key, const VALUE& item); 86 ssize_t replaceValueFor(const KEY& key, const VALUE& item); 87 ssize_t replaceValueAt(size_t index, const VALUE& item); 188 ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) { 190 mVector.editItemAt(index).value = item;
|
/system/core/libpixelflinger/codeflinger/tinyutils/ |
H A D | VectorImpl.h | 75 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1); 78 void push(const void* item); 80 ssize_t add(const void* item); 82 ssize_t replaceAt(const void* item, size_t index); 98 virtual void do_splat(void* dest, const void* item, size_t num) const = 0; 119 inline void _do_splat(void* dest, const void* item, size_t num) const; 143 //! finds the index of an item 144 ssize_t indexOf(const void* item) const; 146 //! finds where this item should be inserted 147 size_t orderOf(const void* item) cons [all...] |
H A D | VectorImpl.cpp | 133 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument 139 if (item) { 140 _do_splat(where, item, numItems); 159 void VectorImpl::push(const void* item) argument 161 insertAt(item, size()); 169 ssize_t VectorImpl::add(const void* item) argument 171 return insertAt(item, size()); 184 void* item = editItemLocation(index); 185 if (item == 0) 187 _do_destroy(item, 405 _do_splat(void* dest, const void* item, size_t num) const argument 459 _indexOrderOf(const void* item, size_t* order) const argument 485 add(const void* item) argument 532 remove(const void* item) argument [all...] |
H A D | SortedVector.h | 81 //! finds the index of an item 82 ssize_t indexOf(const TYPE& item) const; 84 //! finds where this item should be inserted 85 size_t orderOf(const TYPE& item) const; 92 //! read-only access to an item at a given index 105 //! add an item in the right place (and replace the one that is there) 106 ssize_t add(const TYPE& item); 108 //! editItemAt() MUST NOT change the order of this item 117 //! removes an item 122 //! remove one item [all...] |
H A D | Vector.h | 91 //! read-only access to an item at a given index 104 //! copy-on write support, grants write access to an item 126 //! insert on onr several items initialized from a prototype item 130 //! pushes an item initialized with its default constructor 132 //! pushes an item on the top of the stack 133 void push(const TYPE& item); 134 //! same as push() but returns the index the item was added at (or an error) 136 //! same as push() but returns the index the item was added at (or an error) 137 ssize_t add(const TYPE& item); 138 //! replace an item wit 266 insertAt(const TYPE& item, size_t index, size_t numItems) argument 271 push(const TYPE& item) argument 276 add(const TYPE& item) argument 281 replaceAt(const TYPE& item, size_t index) argument 333 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
H A D | KeyedVector.h | 80 ssize_t add(const KEY& key, const VALUE& item); 81 ssize_t replaceValueFor(const KEY& key, const VALUE& item); 82 ssize_t replaceValueAt(size_t index, const VALUE& item); 166 ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) { argument 168 mVector.editValueAt(index).value = item;
|
/system/bt/osi/src/ |
H A D | thread.c | 139 // Queue item is freed either when the queue itself is destroyed 140 // or when the item is removed from the queue for dispatch. 141 work_item_t *item = (work_item_t *)osi_malloc(sizeof(work_item_t)); local 142 if (!item) { 146 item->func = func; 147 item->context = context; 148 fixed_queue_enqueue(thread->work_queue, item); 199 // work item and then joining the thread. 201 work_item_t *item = fixed_queue_try_dequeue(thread->work_queue); local 202 while (item 219 work_item_t *item = fixed_queue_dequeue(queue); local [all...] |
/system/core/libutils/ |
H A D | VectorImpl.cpp | 140 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument 146 if (item) { 147 _do_splat(where, item, numItems); 176 void* item = reinterpret_cast<char*>(array) + mItemSize*(i); local 178 if (cmp(curr, item, state) > 0) { 186 item = reinterpret_cast<char*>(array) + mItemSize*(i); 192 _do_copy(temp, item, 1); 229 void VectorImpl::push(const void* item) argument 231 insertAt(item, size()); 239 ssize_t VectorImpl::add(const void* item) argument 258 void* item = editItemLocation(index); local [all...] |
/system/core/adb/ |
H A D | adb_auth_client.cpp | 101 struct listnode *item; local 104 item = list_head(list); 105 list_remove(item); 106 free(node_to_item(item, struct adb_public_key, node)); 143 struct listnode *item; local 152 list_for_each(item, &key_list) { 153 adb_public_key* key = node_to_item(item, struct adb_public_key, node);
|
H A D | fdevent.h | 53 void fdevent_remove(fdevent *item);
|
H A D | adb_auth_host.cpp | 392 struct listnode *item; local 400 list_for_each(item, &key_list) { 401 if (item == current) { 402 /* current is the last item, we tried all the keys */ 403 if (item->next == &key_list) 405 return item->next;
|
/system/core/include/diskconfig/ |
H A D | diskconfig.h | 108 void free_wl(struct write_list *item); 109 struct write_list *wlist_add(struct write_list **lst, struct write_list *item);
|
/system/core/fastboot/ |
H A D | fastboot.cpp | 100 char *find_item(const char *item, const char *product) argument 106 if(!strcmp(item,"boot")) { 108 } else if(!strcmp(item,"recovery")) { 110 } else if(!strcmp(item,"system")) { 112 } else if(!strcmp(item,"vendor")) { 114 } else if(!strcmp(item,"userdata")) { 116 } else if(!strcmp(item,"cache")) { 118 } else if(!strcmp(item,"info")) { 121 fprintf(stderr,"unknown partition '%s'\n", item);
|
/system/security/keystore/include/keystore/ |
H A D | IKeystoreService.h | 143 virtual int32_t get(const String16& name, uint8_t** item, size_t* itemLength) = 0; 145 virtual int32_t insert(const String16& name, const uint8_t* item, size_t itemLength, int uid,
|
/system/extras/perfprofd/quipper/ |
H A D | perf_reader.cc | 1221 uint32_t item; local 1222 if (!ReadDataFromBuffer(data, sizeof(item), "uint32_t data", &offset, 1223 &item)) 1227 ByteSwap(&item); 1229 uint32_data.data.push_back(item); 1243 uint64_t item; local 1244 if (!ReadDataFromBuffer(data, sizeof(item), "uint64_t data", &offset, 1245 &item)) 1249 ByteSwap(&item); 1251 uint64_data.data.push_back(item); [all...] |
/system/core/libsync/tests/ |
H A D | sync_test.cpp | 597 for (auto& item: fenceMap) { 602 timelines[item.first].inc(item.second);
|
/system/core/adb/tests/ |
H A D | test_adb.py | 239 for item in out: 240 if re.match(r"[\d+\.]*\d", item):
|
/system/security/keystore/ |
H A D | IKeystoreService.cpp | 421 virtual int32_t get(const String16& name, uint8_t** item, size_t* itemLength) argument 436 *item = (uint8_t*) malloc(ulen); 437 if (*item != NULL) { 438 memcpy(*item, buf, ulen); 454 virtual int32_t insert(const String16& name, const uint8_t* item, size_t itemLength, int uid, argument 462 memcpy(buf, item, itemLength); 653 sp<KeystoreArg> item = *it; local 654 size_t keyLength = item->size(); 657 memcpy(buf, item->data(), keyLength);
|