Home
last modified time | relevance | path

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

123

/system/core/toolbox/upstream-netbsd/usr.bin/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/core/libcutils/include_vndk/cutils/
Dlist.h58 static inline void list_add_tail(struct listnode *head, struct listnode *item) in list_add_tail() argument
60 item->next = head; in list_add_tail()
61 item->prev = head->prev; in list_add_tail()
62 head->prev->next = item; in list_add_tail()
63 head->prev = item; in list_add_tail()
66 static inline void list_add_head(struct listnode *head, struct listnode *item) in list_add_head() argument
68 item->next = head->next; in list_add_head()
69 item->prev = head; in list_add_head()
70 head->next->prev = item; in list_add_head()
71 head->next = item; in list_add_head()
[all …]
/system/core/libcutils/include/cutils/
Dlist.h58 static inline void list_add_tail(struct listnode *head, struct listnode *item) in list_add_tail() argument
60 item->next = head; in list_add_tail()
61 item->prev = head->prev; in list_add_tail()
62 head->prev->next = item; in list_add_tail()
63 head->prev = item; in list_add_tail()
66 static inline void list_add_head(struct listnode *head, struct listnode *item) in list_add_head() argument
68 item->next = head->next; in list_add_head()
69 item->prev = head; in list_add_head()
70 head->next->prev = item; in list_add_head()
71 head->next = item; in list_add_head()
[all …]
/system/extras/perfprofd/scripts/
Dsorted_collection.py28 decorated = sorted((key(item), item) for item in iterable)
29 self._keys = [k for k, item in decorated]
30 self._items = [item for k, item in decorated]
73 def __contains__(self, item): argument
74 k = self._key(item)
77 return item in self._items[i:j]
79 def index(self, item): argument
81 k = self._key(item)
84 return self._items[i:j].index(item) + i
86 def count(self, item): argument
[all …]
/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.c73 struct write_list *item; in mk_pri_pentry() local
81 if (!(item = alloc_wl(sizeof(struct pc_partition)))) { in mk_pri_pentry()
90 item->offset = (loff_t)((uintptr_t)((uint8_t *)(&mbr->ptable[pnum]))); in mk_pri_pentry()
93 pentry = (struct pc_partition *) &item->data; in mk_pri_pentry()
128 return item; in mk_pri_pentry()
143 struct write_list *item; in mk_ext_pentry() local
147 if (!(item = alloc_wl(sizeof(struct pc_boot_record)))) { in mk_ext_pentry()
154 item->offset = ((loff_t)(*lba)) * dinfo->sect_size; in mk_ext_pentry()
157 ebr = (struct pc_boot_record *) &item->data; in mk_ext_pentry()
202 return item; in mk_ext_pentry()
[all …]
/system/extras/boottime_tools/bootanalyze/
Dbootanalyze.py81 for item in items:
82 kv = item.split("=")
176 for item in shutdown_event_all.items():
177 num_runs = len(item[1])
179 item[0], sum(item[1])/num_runs, stddev(item[1]),\
180 "*time taken" if item[0].startswith("init.") else "",\
184 for item in shutdown_timing_event_all.items():
185 num_runs = len(item[1])
187 item[0], sum(item[1])/num_runs, stddev(item[1]),\
188 "*time taken" if item[0].startswith("init.") else "",\
[all …]
/system/bt/packet/avrcp/
Dget_folder_items.cc64 for (const auto& item : items_) { in size() local
65 len += item.size(); in size()
89 for (const auto& item : items_) { in Serialize() local
90 PushMediaListItem(pkt, item); in Serialize()
96 bool GetFolderItemsResponseBuilder::AddMediaPlayer(MediaPlayerItem item) { in AddMediaPlayer() argument
99 if (size() + item.size() > mtu_) return false; in AddMediaPlayer()
101 items_.push_back(MediaListItem(item)); in AddMediaPlayer()
105 bool GetFolderItemsResponseBuilder::AddSong(MediaElementItem item) { in AddSong() argument
108 if (size() + item.size() > mtu_) return false; in AddSong()
110 items_.push_back(MediaListItem(item)); in AddSong()
[all …]
Dget_folder_items.h39 bool AddMediaPlayer(MediaPlayerItem item);
40 bool AddSong(MediaElementItem item);
41 bool AddFolder(FolderItem item);
60 const MediaListItem& item);
62 const MediaPlayerItem& item);
64 const MediaElementItem& item);
66 const FolderItem& item);
/system/extras/simpleperf/
DSampleDisplayer.h207 Item item; in AddDisplayFunction() local
208 item.name = name; in AddDisplayFunction()
209 item.width = name.size(); in AddDisplayFunction()
210 item.func = func; in AddDisplayFunction()
211 item.func_with_info = nullptr; in AddDisplayFunction()
212 display_v_.push_back(item); in AddDisplayFunction()
217 Item item; in AddDisplayFunction() local
218 item.name = name; in AddDisplayFunction()
219 item.width = name.size(); in AddDisplayFunction()
220 item.func = nullptr; in AddDisplayFunction()
[all …]
Dgenerate_event_type_table.py174 for item in raw_types:
176 event_type_name = "raw-" + item[1]
177 event_config = '0x%x' % item[0]
178 description = item[2]
/system/core/libutils/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.h86 ssize_t indexOf(const TYPE& item) const;
89 size_t orderOf(const TYPE& item) const;
108 ssize_t add(const TYPE& item);
148 virtual void do_splat(void* dest, const void* item, size_t num) const;
220 ssize_t SortedVector<TYPE>::add(const TYPE& item) { in add() argument
221 return SortedVectorImpl::add(&item); in add()
225 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const { in indexOf() argument
226 return SortedVectorImpl::indexOf(&item); in indexOf()
230 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const { in orderOf() argument
231 return SortedVectorImpl::orderOf(&item); in orderOf()
[all …]
DVector.h162 void push(const TYPE& item);
166 ssize_t add(const TYPE& item);
170 ssize_t replaceAt(const TYPE& item, size_t index);
208 inline void push_back(const TYPE& item) { insertAt(item, size(), 1); } in push_back() argument
209 inline void push_front(const TYPE& item) { insertAt(item, 0, 1); } in push_front() argument
219 virtual void do_splat(void* dest, const void* item, size_t num) const;
337 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) { in insertAt() argument
338 return VectorImpl::insertAt(&item, index, numItems); in insertAt()
342 void Vector<TYPE>::push(const TYPE& item) { in push() argument
343 return VectorImpl::push(&item); in push()
[all …]
/system/bt/osi/src/
Dthread.cc136 work_item_t* item = (work_item_t*)osi_malloc(sizeof(work_item_t)); in thread_post() local
137 item->func = func; in thread_post()
138 item->context = context; in thread_post()
139 fixed_queue_enqueue(thread->work_queue, item); in thread_post()
228 work_item_t* item = in run_thread() local
230 while (item && count <= fixed_queue_capacity(thread->work_queue)) { in run_thread()
231 item->func(item->context); in run_thread()
232 osi_free(item); in run_thread()
233 item = in run_thread()
250 work_item_t* item = static_cast<work_item_t*>(fixed_queue_dequeue(queue)); in work_queue_read_cb() local
[all …]
/system/core/libutils/
DVectorImpl.cpp147 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) in insertAt() argument
153 if (item) { in insertAt()
154 _do_splat(where, item, numItems); in insertAt()
183 void* item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort() local
185 if (cmp(curr, item, state) > 0) { in sort()
193 item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort()
199 _do_copy(temp, item, 1); in sort()
239 void VectorImpl::push(const void* item) in push() argument
241 insertAt(item, size()); in push()
249 ssize_t VectorImpl::add(const void* item) in add() argument
[all …]
/system/extras/boottime_tools/io_analysis/
Dcheck_io_trace_all.py101 key = lambda item: item[1], reverse = True))
108 key = lambda item: item[1], reverse = True))
190 key = lambda item: item[1].total_reads + item[1].total_writes, reverse = True))
199 key = lambda item: item[1].total_writes, reverse = True))
208 key = lambda item: item[1], reverse = True))
215 key = lambda item: item[1], reverse = True))
290 key = lambda item: item[0], reverse = False))
293 key = lambda item: item[1], reverse = True))
296 key = lambda item: item[1], reverse = True))
299 key = lambda item: item[0], reverse = False))
[all …]
/system/bt/include/hardware/avrcp/
Davrcp_common.h305 MediaListItem(MediaPlayerItem item) : type_(PLAYER), player_(item) {} in MediaListItem()
307 MediaListItem(FolderItem item) : type_(FOLDER), folder_(item) {} in MediaListItem()
309 MediaListItem(MediaElementItem item) : type_(SONG), song_(item) {} in MediaListItem()
311 MediaListItem(const MediaListItem& item) { in MediaListItem()
312 type_ = item.type_; in MediaListItem()
313 switch (item.type_) { in MediaListItem()
315 new (&player_) MediaPlayerItem(item.player_); in MediaListItem()
318 new (&folder_) FolderItem(item.folder_); in MediaListItem()
321 new (&song_) MediaElementItem(item.song_); in MediaListItem()
/system/libhidl/base/
DSynchronizedQueue.h42 bool push(const T& item);
79 T item = mQueue.front(); in wait_pop() local
82 return item; in wait_pop()
86 bool SynchronizedQueue<T>::push(const T &item) { in push() argument
91 mQueue.push(item); in push()
/system/tools/hidl/c2hal/test/
Dbuild_all.py75 for item in listdir(path):
76 if not isfile(path_join(path, item)):
79 if not item.endswith(".h"):
82 yield item
/system/tools/aidl/
Daidl.cpp149 for (const auto& item : doc->GetParcelables()) { in check_filenames() local
150 success &= check_filename(filename, item->GetPackage(), item->GetName(), in check_filenames()
151 item->GetLine()); in check_filenames()
167 for (const auto& item : doc->GetParcelables()) { in gather_types() local
168 success &= types->AddParcelableType(*item, filename); in gather_types()
377 for (const auto& item : items) { in check_and_assign_method_ids() local
378 if (item->HasId()) { in check_and_assign_method_ids()
381 if (usedIds.find(item->GetId()) != usedIds.end()) { in check_and_assign_method_ids()
385 filename, item->GetLine(), in check_and_assign_method_ids()
386 item->GetId(), item->GetName().c_str()); in check_and_assign_method_ids()
[all …]
/system/security/keystore/
DKeystoreArguments.cpp51 for (sp<KeystoreArg> item : args) { in writeToParcel()
52 size_t keyLength = item->size(); in writeToParcel()
55 memcpy(buf, item->data(), keyLength); in writeToParcel()
/system/tools/hidl/c2hal/
DScope.h36 void enter(std::string name, T item);
48 void Scope<T>::enter(std::string name, T item) { in enter() argument
56 mScopeContents[name] = item; in enter()
/system/bt/osi/include/
Dleaky_bonded_queue.h115 std::unique_ptr<T> item = std::move(queue_.front()); in EnqueueWithPop() local
117 old_item = item.release(); in EnqueueWithPop()
127 std::unique_ptr<T> item = std::move(queue_.front()); in Dequeue() local
129 return item.release(); in Dequeue()
/system/netd/server/dns/
DLockedQueue.h33 void push(T item) { in push() argument
35 mQueue.push_front(std::move(item)); in push()

123