Searched defs:item (Results 1 - 11 of 11) sorted by relevance

/system/core/libcutils/
H A Dlist.c25 void list_add_tail(struct listnode *head, struct listnode *item) argument
27 item->next = head;
28 item->prev = head->prev;
29 head->prev->next = item;
30 head->prev = item;
33 void list_remove(struct listnode *item) argument
35 item->next->prev = item->prev;
36 item->prev->next = item
[all...]
/system/core/toolbox/grep/
H A Dqueue.c62 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/libdiskconfig/
H A Dwrite_lst.c32 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 Dconfig_mbr.c74 struct write_list *item; local
82 if (!(item = alloc_wl(sizeof(struct pc_partition)))) {
91 item->offset = (loff_t)((uint32_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;
[all...]
/system/core/adb/
H A Dadb_auth_client.c96 struct listnode *item; local
99 item = list_head(list);
100 list_remove(item);
101 free(node_to_item(item, struct adb_public_key, node));
138 struct listnode *item; local
145 list_for_each(item, &key_list) {
146 key = node_to_item(item, struct adb_public_key, node);
H A Dadb_auth_host.c361 struct listnode *item; local
369 list_for_each(item, &key_list) {
370 if (item == current) {
371 /* current is the last item, we tried all the keys */
372 if (item->next == &key_list)
374 return item->next;
/system/core/libpixelflinger/tinyutils/
H A DKeyedVector.h71 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) { argument
159 mVector.editValueAt(index).value = item;
H A DVector.h82 //! read-only access to an item at a given index
95 //! copy-on write support, grants write access to an item
117 //! insert on onr several items initialized from a prototype item
121 //! pushes an item initialized with its default constructor
123 //! pushes an item on the top of the stack
124 void push(const TYPE& item);
125 //! same as push() but returns the index the item was added at (or an error)
127 //! same as push() but returns the index the item was added at (or an error)
128 ssize_t add(const TYPE& item);
129 //! replace an item wit
257 insertAt(const TYPE& item, size_t index, size_t numItems) argument
262 push(const TYPE& item) argument
267 add(const TYPE& item) argument
272 replaceAt(const TYPE& item, size_t index) argument
324 do_splat(void* dest, const void* item, size_t num) const argument
[all...]
H A DVectorImpl.cpp131 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument
137 if (item) {
138 _do_splat(where, item, numItems);
157 void VectorImpl::push(const void* item) argument
159 insertAt(item, size());
167 ssize_t VectorImpl::add(const void* item) argument
169 return insertAt(item, size());
182 void* item = editItemLocation(index);
183 if (item == 0)
185 _do_destroy(item,
[all...]
/system/extras/fatblock/
H A Dimport.c151 struct item { struct
154 struct item *next;
158 static struct item *free_items_head;
160 static struct item *alloc_item(void)
162 struct item *item; local
165 item = free_items_head;
166 free_items_head = item->next;
168 item = malloc(sizeof(struct item));
175 free_item(struct item *item) argument
210 struct item *item; local
[all...]
/system/core/fastboot/
H A Dfastboot.c92 char *find_item(const char *item, const char *product) argument
98 if(!strcmp(item,"boot")) {
100 } else if(!strcmp(item,"recovery")) {
102 } else if(!strcmp(item,"system")) {
104 } else if(!strcmp(item,"userdata")) {
106 } else if(!strcmp(item,"cache")) {
108 } else if(!strcmp(item,"info")) {
111 fprintf(stderr,"unknown partition '%s'\n", item);

Completed in 82 milliseconds