| /system/core/toolbox/grep/ |
| D | queue.c | 62 struct qentry *item; in enqueue() local
64 item = grep_malloc(sizeof(struct qentry)); in enqueue()
65 item->data.dat = grep_malloc(sizeof(char) * x->len); in enqueue()
66 item->data.len = x->len; in enqueue()
67 item->data.line_no = x->line_no; in enqueue()
68 item->data.off = x->off; in enqueue()
69 memcpy(item->data.dat, x->dat, x->len); in enqueue()
70 item->data.file = x->file; in enqueue()
72 STAILQ_INSERT_TAIL(&queue, item, list); in enqueue()
75 item = dequeue(); in enqueue()
[all …]
|
| /system/extras/fatblock/ |
| D | import.c | 151 struct item { struct
154 struct item *next; argument
158 static struct item *free_items_head; argument
160 static struct item *alloc_item(void) in alloc_item()
162 struct item *item; in alloc_item() local
165 item = free_items_head; in alloc_item()
166 free_items_head = item->next; in alloc_item()
168 item = malloc(sizeof(struct item)); in alloc_item()
172 return item; in alloc_item()
175 static void free_item(struct item *item) in free_item() argument
[all …]
|
| /system/core/libcutils/ |
| D | list.c | 25 void list_add_tail(struct listnode *head, struct listnode *item) in list_add_tail() argument
27 item->next = head; in list_add_tail()
28 item->prev = head->prev; in list_add_tail()
29 head->prev->next = item; in list_add_tail()
30 head->prev = item; in list_add_tail()
33 void list_remove(struct listnode *item) in list_remove() argument
35 item->next->prev = item->prev; in list_remove()
36 item->prev->next = item->next; in list_remove()
|
| /system/core/libdiskconfig/ |
| D | write_lst.c | 32 struct write_list *item; in alloc_wl() local
34 if (!(item = malloc(sizeof(struct write_list) + data_len))) { in alloc_wl()
39 item->len = data_len; in alloc_wl()
40 return item; in alloc_wl()
44 free_wl(struct write_list *item) in free_wl() argument
46 if (item) in free_wl()
47 free(item); in free_wl()
51 wlist_add(struct write_list **lst, struct write_list *item) in wlist_add() argument
53 item->next = (*lst); in wlist_add()
54 *lst = item; in wlist_add()
[all …]
|
| D | config_mbr.c | 74 struct write_list *item; in mk_pri_pentry() local
82 if (!(item = alloc_wl(sizeof(struct pc_partition)))) { in mk_pri_pentry()
91 item->offset = (loff_t)((uint32_t)((uint8_t *)(&mbr->ptable[pnum]))); in mk_pri_pentry()
94 pentry = (struct pc_partition *) &item->data; in mk_pri_pentry()
129 return item; in mk_pri_pentry()
144 struct write_list *item; in mk_ext_pentry() local
148 if (!(item = alloc_wl(sizeof(struct pc_boot_record)))) { in mk_ext_pentry()
155 item->offset = ((loff_t)(*lba)) * dinfo->sect_size; in mk_ext_pentry()
158 ebr = (struct pc_boot_record *) &item->data; in mk_ext_pentry()
203 return item; in mk_ext_pentry()
[all …]
|
| /system/core/libpixelflinger/tinyutils/ |
| D | VectorImpl.h | 66 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1);
69 void push(const void* item);
71 ssize_t add(const void* item);
73 ssize_t replaceAt(const void* item, size_t index);
89 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
110 inline void _do_splat(void* dest, const void* item, size_t num) const;
135 ssize_t indexOf(const void* item) const;
138 size_t orderOf(const void* item) const;
141 ssize_t add(const void* item);
148 ssize_t remove(const void* item);
[all …]
|
| D | VectorImpl.cpp | 131 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) in insertAt() argument
137 if (item) { in insertAt()
138 _do_splat(where, item, numItems); in insertAt()
157 void VectorImpl::push(const void* item) in push() argument
159 insertAt(item, size()); in push()
167 ssize_t VectorImpl::add(const void* item) in add() argument
169 return insertAt(item, size()); in add()
182 void* item = editItemLocation(index); in replaceAt() local
183 if (item == 0) in replaceAt()
185 _do_destroy(item, 1); in replaceAt()
[all …]
|
| D | SortedVector.h | 81 ssize_t indexOf(const TYPE& item) const;
84 size_t orderOf(const TYPE& item) const;
105 ssize_t add(const TYPE& item);
128 virtual void do_splat(void* dest, const void* item, size_t num) const;
206 ssize_t SortedVector<TYPE>::add(const TYPE& item) { in add() argument
207 return SortedVectorImpl::add(&item); in add()
211 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const { in indexOf() argument
212 return SortedVectorImpl::indexOf(&item); in indexOf()
216 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const { in orderOf() argument
217 return SortedVectorImpl::orderOf(&item); in orderOf()
[all …]
|
| D | Vector.h | 124 void push(const TYPE& item);
128 ssize_t add(const TYPE& item);
132 ssize_t replaceAt(const TYPE& item, size_t index);
157 virtual void do_splat(void* dest, const void* item, size_t num) const;
257 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) { in insertAt() argument
258 return VectorImpl::insertAt(&item, index, numItems); in insertAt()
262 void Vector<TYPE>::push(const TYPE& item) { in push() argument
263 return VectorImpl::push(&item); in push()
267 ssize_t Vector<TYPE>::add(const TYPE& item) { in add() argument
268 return VectorImpl::add(&item); in add()
[all …]
|
| D | KeyedVector.h | 71 ssize_t add(const KEY& key, const VALUE& item);
72 ssize_t replaceValueFor(const KEY& key, const VALUE& item);
73 ssize_t replaceValueAt(size_t index, const VALUE& item);
157 ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) { in replaceValueAt() argument
159 mVector.editValueAt(index).value = item; in replaceValueAt()
|
| /system/core/adb/ |
| D | adb_auth_client.c | 96 struct listnode *item; in free_keys() local
99 item = list_head(list); in free_keys()
100 list_remove(item); in free_keys()
101 free(node_to_item(item, struct adb_public_key, node)); in free_keys()
138 struct listnode *item; in adb_auth_verify() local
145 list_for_each(item, &key_list) { in adb_auth_verify()
146 key = node_to_item(item, struct adb_public_key, node); in adb_auth_verify()
|
| D | adb_auth_host.c | 361 struct listnode *item; in adb_auth_nextkey() local
369 list_for_each(item, &key_list) { in adb_auth_nextkey()
370 if (item == current) { in adb_auth_nextkey()
372 if (item->next == &key_list) in adb_auth_nextkey()
374 return item->next; in adb_auth_nextkey()
|
| D | fdevent.h | 53 void fdevent_remove(fdevent *item);
|
| D | sysdeps.h | 189 void fdevent_remove(fdevent *item);
|
| /system/core/include/cutils/ |
| D | list.h | 48 void list_add_tail(struct listnode *list, struct listnode *item);
49 void list_remove(struct listnode *item);
|
| /system/core/include/diskconfig/ |
| 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/toolbox/ |
| D | dynarray.c | 46 dynarray_append( dynarray_t *a, void* item ) in dynarray_append() argument
51 a->items[a->count++] = item; in dynarray_append()
|
| D | dynarray.h | 18 void dynarray_append( dynarray_t *a, void* item );
|
| /system/core/fastboot/ |
| D | fastboot.c | 92 char *find_item(const char *item, const char *product) in find_item() argument
98 if(!strcmp(item,"boot")) { in find_item()
100 } else if(!strcmp(item,"recovery")) { in find_item()
102 } else if(!strcmp(item,"system")) { in find_item()
104 } else if(!strcmp(item,"userdata")) { in find_item()
106 } else if(!strcmp(item,"cache")) { in find_item()
108 } else if(!strcmp(item,"info")) { in find_item()
111 fprintf(stderr,"unknown partition '%s'\n", item); in find_item()
|
| /system/core/logcat/ |
| D | event.logtags | 75 50000 menu_item_selected (Menu type where 0 is options and 1 is context|1|5),(Menu item title|3)
|