Home
last modified time | relevance | path

Searched refs:item (Results 1 – 25 of 28) sorted by relevance

12

/system/core/toolbox/grep/
Dqueue.c62 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/
Dimport.c151 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/
Dlist.c25 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/
Dwrite_lst.c32 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 …]
Dconfig_mbr.c74 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/include/utils/
DVectorImpl.h77 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;
141 ssize_t indexOf(const void* item) const;
144 size_t orderOf(const void* item) const;
147 ssize_t add(const void* item);
154 ssize_t remove(const void* item);
[all …]
DSortedVector.h85 ssize_t indexOf(const TYPE& item) const;
88 size_t orderOf(const TYPE& item) const;
107 ssize_t add(const TYPE& item);
130 virtual void do_splat(void* dest, const void* item, size_t num) const;
206 ssize_t SortedVector<TYPE>::add(const TYPE& item) {
207 return SortedVectorImpl::add(&item);
211 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const {
212 return SortedVectorImpl::indexOf(&item);
216 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const {
217 return SortedVectorImpl::orderOf(&item);
[all …]
DVector.h148 void push(const TYPE& item);
152 ssize_t add(const TYPE& item);
156 ssize_t replaceAt(const TYPE& item, size_t index);
194 inline void push_back(const TYPE& item) { insertAt(item, size(), 1); } in push_back() argument
195 inline void push_front(const TYPE& item) { insertAt(item, 0, 1); } in push_front() argument
205 virtual void do_splat(void* dest, const void* item, size_t num) const;
327 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) {
328 return VectorImpl::insertAt(&item, index, numItems);
332 void Vector<TYPE>::push(const TYPE& item) {
333 return VectorImpl::push(&item);
[all …]
DKeyedVector.h85 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/
DVectorImpl.h75 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;
144 ssize_t indexOf(const void* item) const;
147 size_t orderOf(const void* item) const;
150 ssize_t add(const void* item);
157 ssize_t remove(const void* item);
[all …]
DVectorImpl.cpp133 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) in insertAt() argument
139 if (item) { in insertAt()
140 _do_splat(where, item, numItems); in insertAt()
159 void VectorImpl::push(const void* item) in push() argument
161 insertAt(item, size()); in push()
169 ssize_t VectorImpl::add(const void* item) in add() argument
171 return insertAt(item, size()); in add()
184 void* item = editItemLocation(index); in replaceAt() local
185 if (item == 0) in replaceAt()
187 _do_destroy(item, 1); in replaceAt()
[all …]
DSortedVector.h82 ssize_t indexOf(const TYPE& item) const;
85 size_t orderOf(const TYPE& item) const;
106 ssize_t add(const TYPE& item);
129 virtual void do_splat(void* dest, const void* item, size_t num) const;
207 ssize_t SortedVector<TYPE>::add(const TYPE& item) { in add() argument
208 return SortedVectorImpl::add(&item); in add()
212 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const { in indexOf() argument
213 return SortedVectorImpl::indexOf(&item); in indexOf()
217 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const { in orderOf() argument
218 return SortedVectorImpl::orderOf(&item); in orderOf()
[all …]
DVector.h133 void push(const TYPE& item);
137 ssize_t add(const TYPE& item);
141 ssize_t replaceAt(const TYPE& item, size_t index);
166 virtual void do_splat(void* dest, const void* item, size_t num) const;
266 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) { in insertAt() argument
267 return VectorImpl::insertAt(&item, index, numItems); in insertAt()
271 void Vector<TYPE>::push(const TYPE& item) { in push() argument
272 return VectorImpl::push(&item); in push()
276 ssize_t Vector<TYPE>::add(const TYPE& item) { in add() argument
277 return VectorImpl::add(&item); in add()
[all …]
DKeyedVector.h80 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) { in replaceValueAt() argument
168 mVector.editValueAt(index).value = item; in replaceValueAt()
/system/core/libutils/
DVectorImpl.cpp140 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) in insertAt() argument
146 if (item) { in insertAt()
147 _do_splat(where, item, numItems); in insertAt()
176 void* item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort() local
178 if (cmp(curr, item, state) > 0) { in sort()
186 item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort()
192 _do_copy(temp, item, 1); in sort()
229 void VectorImpl::push(const void* item) in push() argument
231 insertAt(item, size()); in push()
239 ssize_t VectorImpl::add(const void* item) in add() argument
[all …]
/system/core/adb/
Dadb_auth_client.c99 struct listnode *item; in free_keys() local
102 item = list_head(list); in free_keys()
103 list_remove(item); in free_keys()
104 free(node_to_item(item, struct adb_public_key, node)); in free_keys()
141 struct listnode *item; in adb_auth_verify() local
151 list_for_each(item, &key_list) { in adb_auth_verify()
152 key = node_to_item(item, struct adb_public_key, node); in adb_auth_verify()
Dadb_auth_host.c361 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()
Dfdevent.h53 void fdevent_remove(fdevent *item);
/system/core/include/cutils/
Dlist.h48 void list_add_tail(struct listnode *list, struct listnode *item);
49 void list_remove(struct listnode *item);
/system/core/include/diskconfig/
Ddiskconfig.h108 void free_wl(struct write_list *item);
109 struct write_list *wlist_add(struct write_list **lst, struct write_list *item);
/system/core/toolbox/
Ddynarray.c46 dynarray_append( dynarray_t *a, void* item ) in dynarray_append() argument
51 a->items[a->count++] = item; in dynarray_append()
Ddynarray.h18 void dynarray_append( dynarray_t *a, void* item );
/system/core/fastboot/
Dfastboot.c122 char *find_item(const char *item, const char *product) in find_item() argument
128 if(!strcmp(item,"boot")) { in find_item()
130 } else if(!strcmp(item,"recovery")) { in find_item()
132 } else if(!strcmp(item,"system")) { in find_item()
134 } else if(!strcmp(item,"userdata")) { in find_item()
136 } else if(!strcmp(item,"cache")) { in find_item()
138 } else if(!strcmp(item,"info")) { in find_item()
141 fprintf(stderr,"unknown partition '%s'\n", item); in find_item()
/system/security/keystore/include/keystore/
DIKeystoreService.h74 virtual int32_t get(const String16& name, uint8_t** item, size_t* itemLength) = 0;
76 virtual int32_t insert(const String16& name, const uint8_t* item, size_t itemLength, int uid,
/system/security/keystore/
DIKeystoreService.cpp74 virtual int32_t get(const String16& name, uint8_t** item, size_t* itemLength) in get() argument
89 *item = (uint8_t*) malloc(ulen); in get()
90 if (*item != NULL) { in get()
91 memcpy(*item, buf, ulen); in get()
107 virtual int32_t insert(const String16& name, const uint8_t* item, size_t itemLength, int uid, in insert() argument
115 memcpy(buf, item, itemLength); in insert()
300 sp<KeystoreArg> item = *it; in generate() local
301 size_t keyLength = item->size(); in generate()
304 memcpy(buf, item->data(), keyLength); in generate()

12