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

/system/core/toolbox/upstream-netbsd/usr.bin/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)((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/cutils/
H A Dlist.h58 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/bt/osi/src/
H A Dthread.c139 // 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 item->func = func;
143 item->context = context;
144 fixed_queue_enqueue(thread->work_queue, item);
211 // work item and then joining the thread.
213 work_item_t *item = fixed_queue_try_dequeue(thread->work_queue); local
214 while (item && count <= fixed_queue_capacity(thread->work_queue)) {
215 item
232 work_item_t *item = fixed_queue_dequeue(queue); local
[all...]
/system/core/libcutils/
H A Dandroid_reboot.c83 mntent_list* item = (mntent_list*)calloc(1, sizeof(mntent_list)); local
84 item->entry = *mentry;
85 item->entry.mnt_fsname = strdup(mentry->mnt_fsname);
86 item->entry.mnt_dir = strdup(mentry->mnt_dir);
87 item->entry.mnt_type = strdup(mentry->mnt_type);
88 item->entry.mnt_opts = strdup(mentry->mnt_opts);
89 list_add_tail(rw_entries, &item->list);
100 mntent_list* item = node_to_item(node, mntent_list, list); local
101 free(item->entry.mnt_fsname);
102 free(item
113 mntent_list* item = node_to_item(node, mntent_list, list); local
177 mntent_list* item = find_item(&rw_entries, mentry->mnt_fsname); local
195 mntent_list* item = node_to_item(node, mntent_list, list); local
202 mntent_list* item = node_to_item(node, mntent_list, list); local
[all...]
/system/core/adb/
H A Dadb_auth_client.cpp102 struct listnode *item; local
105 item = list_head(list);
106 list_remove(item);
107 free(node_to_item(item, struct adb_public_key, node));
144 struct listnode *item; local
153 list_for_each(item, &key_list) {
154 adb_public_key* key = node_to_item(item, struct adb_public_key, node);
H A Dadb_auth_host.cpp368 struct listnode *item; local
376 list_for_each(item, &key_list) {
377 if (item == current) {
378 /* current is the last item, we tried all the keys */
379 if (item->next == &key_list)
381 return item->next;
/system/core/include/utils/
H A DSortedVector.h84 //! 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 DVector.h102 //! 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...]
/system/core/libutils/
H A DVectorImpl.cpp147 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) argument
153 if (item) {
154 _do_splat(where, item, numItems);
183 void* item = reinterpret_cast<char*>(array) + mItemSize*(i); local
185 if (cmp(curr, item, state) > 0) {
193 item = reinterpret_cast<char*>(array) + mItemSize*(i);
199 _do_copy(temp, item, 1);
239 void VectorImpl::push(const void* item) argument
241 insertAt(item, size());
249 ssize_t VectorImpl::add(const void* item) argument
268 void* item = editItemLocation(index); local
[all...]
/system/extras/simpleperf/
H A Dcmd_report.cpp257 " -n Print the sample count for each item.\n"
471 PidItem* item = new PidItem; local
472 displayable_items_.push_back(std::unique_ptr<Displayable>(item));
473 comparable_items_.push_back(item);
475 TidItem* item = new TidItem; local
476 displayable_items_.push_back(std::unique_ptr<Displayable>(item));
477 comparable_items_.push_back(item);
479 CommItem* item = new CommItem; local
480 displayable_items_.push_back(std::unique_ptr<Displayable>(item));
481 comparable_items_.push_back(item);
483 DsoItem* item = new DsoItem; local
487 SymbolItem* item = new SymbolItem; local
491 DsoFromItem* item = new DsoFromItem; local
495 DsoToItem* item = new DsoToItem; local
499 SymbolFromItem* item = new SymbolFromItem; local
503 SymbolToItem* item = new SymbolToItem; local
718 auto& item = displayable_items_[i]; local
729 auto& item = displayable_items_[i]; local
[all...]
/system/security/keystore/
H A DIKeystoreService.cpp483 virtual int32_t get(const String16& name, int32_t uid, uint8_t** item, size_t* itemLength) argument
499 *item = (uint8_t*) malloc(ulen);
500 if (*item != NULL) {
501 memcpy(*item, buf, ulen);
517 virtual int32_t insert(const String16& name, const uint8_t* item, size_t itemLength, int uid, argument
525 memcpy(buf, item, itemLength);
716 sp<KeystoreArg> item = *it; local
717 size_t keyLength = item->size();
720 memcpy(buf, item->data(), keyLength);
H A Dkey_store_service.cpp66 int32_t KeyStoreService::get(const String16& name, int32_t uid, uint8_t** item, argument
78 *item = NULL;
83 *item = (uint8_t*)malloc(keyBlob.getLength());
84 memcpy(*item, keyBlob.getValue(), keyBlob.getLength());
90 int32_t KeyStoreService::insert(const String16& name, const uint8_t* item, size_t itemLength, argument
102 Blob keyBlob(item, itemLength, NULL, 0, ::TYPE_GENERIC);
/system/core/fastboot/
H A Dfastboot.cpp137 std::string find_item(const char* item, const char* product) { argument
140 if(!strcmp(item,"boot")) {
142 } else if(!strcmp(item,"recovery")) {
144 } else if(!strcmp(item,"system")) {
146 } else if(!strcmp(item,"vendor")) {
148 } else if(!strcmp(item,"userdata")) {
150 } else if(!strcmp(item,"cache")) {
152 } else if(!strcmp(item,"info")) {
155 fprintf(stderr,"unknown partition '%s'\n", item);
/system/extras/perfprofd/quipper/
H A Dperf_reader.cc1221 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...]

Completed in 504 milliseconds