/system/core/toolbox/upstream-netbsd/usr.bin/grep/ |
H A D | queue.c | 62 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/include/cutils/ |
H A D | list.h | 58 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/core/libcutils/include/cutils/ |
H A D | list.h | 58 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/core/libcutils/include_vndk/cutils/ |
H A D | list.h | 58 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/core/libdiskconfig/ |
H A D | write_lst.c | 32 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 D | config_mbr.c | 73 struct write_list *item; local 81 if (!(item = alloc_wl(sizeof(struct pc_partition)))) { 90 item->offset = (loff_t)((uintptr_t)((uint8_t *)(&mbr->ptable[pnum]))); 93 pentry = (struct pc_partition *) &item->data; 128 return item; 143 struct write_list *item; local 147 if (!(item = alloc_wl(sizeof(struct pc_boot_record)))) { 154 item->offset = ((loff_t)(*lba)) * dinfo->sect_size; 157 ebr = (struct pc_boot_record *) &item->data; 202 return item; 213 struct write_list *item; local [all...] |
/system/extras/perfprofd/scripts/ |
H A D | sorted_collection.py | 28 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): 74 k = self._key(item) 77 return item in self._items[i:j] 79 def index(self, item) [all...] |
/system/core/include/utils/ |
H A D | VectorImpl.h | 77 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; 140 //! finds the index of an item 141 ssize_t indexOf(const void* item) const; 143 //! finds where this item should be inserted 144 size_t orderOf(const void* item) cons [all...] |
H A D | SortedVector.h | 85 //! finds the index of an item 86 ssize_t indexOf(const TYPE& item) const; 88 //! finds where this item should be inserted 89 size_t orderOf(const TYPE& item) const; 96 //! read-only access to an item at a given index 107 //! add an item in the right place (and replace the one that is there) 108 ssize_t add(const TYPE& item); 110 //! editItemAt() MUST NOT change the order of this item 119 //! removes an item 124 //! remove one item 220 add(const TYPE& item) argument 245 remove(const TYPE& item) argument 272 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
H A D | Vector.h | 116 //! read-only access to an item at a given index 127 //! copy-on write support, grants write access to an item 155 //! insert one or several items initialized from a prototype item 159 //! pushes an item initialized with its default constructor 161 //! pushes an item on the top of the stack 162 void push(const TYPE& item); 163 //! same as push() but returns the index the item was added at (or an error) 165 //! same as push() but returns the index the item was added at (or an error) 166 ssize_t add(const TYPE& item); 167 //! replace an item wit 208 push_back(const TYPE& item) argument 209 push_front(const TYPE& item) argument 337 insertAt(const TYPE& item, size_t index, size_t numItems) argument 342 push(const TYPE& item) argument 347 add(const TYPE& item) argument 352 replaceAt(const TYPE& item, size_t index) argument 414 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
/system/core/libutils/include/utils/ |
H A D | VectorImpl.h | 77 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; 140 //! finds the index of an item 141 ssize_t indexOf(const void* item) const; 143 //! finds where this item should be inserted 144 size_t orderOf(const void* item) cons [all...] |
H A D | SortedVector.h | 85 //! finds the index of an item 86 ssize_t indexOf(const TYPE& item) const; 88 //! finds where this item should be inserted 89 size_t orderOf(const TYPE& item) const; 96 //! read-only access to an item at a given index 107 //! add an item in the right place (and replace the one that is there) 108 ssize_t add(const TYPE& item); 110 //! editItemAt() MUST NOT change the order of this item 119 //! removes an item 124 //! remove one item 220 add(const TYPE& item) argument 245 remove(const TYPE& item) argument 272 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
H A D | Vector.h | 116 //! read-only access to an item at a given index 127 //! copy-on write support, grants write access to an item 155 //! insert one or several items initialized from a prototype item 159 //! pushes an item initialized with its default constructor 161 //! pushes an item on the top of the stack 162 void push(const TYPE& item); 163 //! same as push() but returns the index the item was added at (or an error) 165 //! same as push() but returns the index the item was added at (or an error) 166 ssize_t add(const TYPE& item); 167 //! replace an item wit 208 push_back(const TYPE& item) argument 209 push_front(const TYPE& item) argument 337 insertAt(const TYPE& item, size_t index, size_t numItems) argument 342 push(const TYPE& item) argument 347 add(const TYPE& item) argument 352 replaceAt(const TYPE& item, size_t index) argument 414 do_splat(void* dest, const void* item, size_t num) const argument [all...] |
/system/bt/packet/avrcp/ |
H A D | get_folder_items.cc | 64 for (const auto& item : items_) { 65 len += item.size(); 89 for (const auto& item : items_) { 90 PushMediaListItem(pkt, item); 96 bool GetFolderItemsResponseBuilder::AddMediaPlayer(MediaPlayerItem item) { argument 99 if (size() + item.size() > mtu_) return false; 101 items_.push_back(MediaListItem(item)); 105 bool GetFolderItemsResponseBuilder::AddSong(MediaElementItem item) { argument 108 if (size() + item.size() > mtu_) return false; 110 items_.push_back(MediaListItem(item)); 114 AddFolder(FolderItem item) argument 123 PushMediaListItem( const std::shared_ptr<::bluetooth::Packet>& pkt, const MediaListItem& item) argument 139 PushMediaPlayerItem( const std::shared_ptr<::bluetooth::Packet>& pkt, const MediaPlayerItem& item) argument 183 PushFolderItem( const std::shared_ptr<::bluetooth::Packet>& pkt, const FolderItem& item) argument 200 PushMediaElementItem( const std::shared_ptr<::bluetooth::Packet>& pkt, const MediaElementItem& item) argument [all...] |
H A D | get_folder_items.h | 38 // Returns false if adding an item would exceed the MTU 39 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/boottime_tools/bootanalyze/ |
H A D | bootanalyze.py | 81 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[ [all...] |
/system/extras/simpleperf/ |
H A D | SampleDisplayer.h | 207 Item item; local 208 item.name = name; 209 item.width = name.size(); 210 item.func = func; 211 item.func_with_info = nullptr; 212 display_v_.push_back(item); 217 Item item; local 218 item.name = name; 219 item.width = name.size(); 220 item 240 auto& item = display_v_[i]; local 251 auto& item = display_v_[i]; local [all...] |
/system/tools/hidl/c2hal/test/ |
H A D | build_all.py | 75 for item in listdir(path): 76 if not isfile(path_join(path, item)): 79 if not item.endswith(".h"): 82 yield item
|
/system/libhidl/base/ |
H A D | SynchronizedQueue.h | 34 /* Gets an item from the front of the queue. 36 * Blocks until the item is available. 40 /* Puts an item onto the end of the queue. 42 bool push(const T& item); 79 T item = mQueue.front(); local 82 return item; 86 bool SynchronizedQueue<T>::push(const T &item) { argument 91 mQueue.push(item);
|
/system/bt/osi/src/ |
H A D | thread.cc | 134 // Queue item is freed either when the queue itself is destroyed 135 // or when the item is removed from the queue for dispatch. 136 work_item_t* item = (work_item_t*)osi_malloc(sizeof(work_item_t)); local 137 item->func = func; 138 item->context = context; 139 fixed_queue_enqueue(thread->work_queue, item); 226 // work item and then joining the thread. 228 work_item_t* item = local 230 while (item && count <= fixed_queue_capacity(thread->work_queue)) { 231 item 250 work_item_t* item = static_cast<work_item_t*>(fixed_queue_dequeue(queue)); local [all...] |
/system/core/libutils/ |
H A D | VectorImpl.cpp | 147 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/security/keystore/ |
H A D | KeystoreArguments.cpp | 51 for (sp<KeystoreArg> item : args) { 52 size_t keyLength = item->size(); 55 memcpy(buf, item->data(), keyLength);
|
/system/tools/hidl/c2hal/ |
H A D | Scope.h | 36 void enter(std::string name, T item); 48 void Scope<T>::enter(std::string name, T item) { argument 56 mScopeContents[name] = item;
|
/system/bt/include/hardware/avrcp/ |
H A D | avrcp_common.h | 261 // Truncate the name and attribute fields so that we don't have a single item 305 MediaListItem(MediaPlayerItem item) : type_(PLAYER), player_(item) {} argument 307 MediaListItem(FolderItem item) : type_(FOLDER), folder_(item) {} argument 309 MediaListItem(MediaElementItem item) : type_(SONG), song_(item) {} argument 311 MediaListItem(const MediaListItem& item) { argument 312 type_ = item.type_; 313 switch (item [all...] |
/system/bt/osi/include/ |
H A D | leaky_bonded_queue.h | 29 * - LeakyLondedQueue<T> is a fixed size queue that leaks oldest item when 50 * Add item NEW_ITEM to the underlining queue. If the queue is full, pop 51 * the oldest item 55 * Add item NEW_ITEM to the underlining queue. If the queue is full, dequeue 56 * the oldest item and returns it to the caller. Return nullptr otherwise. 60 * Dequeues the oldest item from the queue. Return nullptr if queue is empty 81 // Put item in unique_ptr so that they get freed automatically when poped or 115 std::unique_ptr<T> item = std::move(queue_.front()); local 117 old_item = item.release(); 127 std::unique_ptr<T> item local [all...] |