/system/core/include/cutils/ |
H A D | config_utils.h | 29 cnode *next; member in struct:cnode
|
H A D | list.h | 28 struct listnode *next; member in struct:listnode 37 .next = &name, \ 42 for (node = (list)->next; node != (list); node = node->next) 48 for (node = (list)->next, n = node->next; \ 50 node = n, n = node->next) 54 node->next = node; 60 item->next = head; 62 head->prev->next [all...] |
/system/update_engine/payload_consumer/ |
H A D | bzip_extent_writer.h | 37 explicit BzipExtentWriter(std::unique_ptr<ExtentWriter> next) argument 38 : next_(std::move(next)) {
|
/system/core/adb/ |
H A D | fdevent.h | 34 fdevent *next; member in struct:fdevent
|
H A D | socket.h | 35 asocket *next; member in struct:asocket
|
H A D | usb_windows.cpp | 48 usb_handle *next; member in struct:usb_handle 72 .next = &handle_list, 128 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) { 165 handle->next = &handle_list; 167 handle->prev->next = handle; 168 handle->next->prev = handle; 279 ret->next = ret; 513 if ((handle->next != handle) && (handle->prev != handle)) { 514 handle->next [all...] |
/system/extras/perfprofd/quipper/kernel-headers/tools/perf/util/include/linux/ |
H A D | types.h | 14 *** Any manual change here will be lost the next time this script will 31 struct list_head * next, * prev; member in struct:list_head 39 struct hlist_node * next, * * pprev; member in struct:hlist_node
|
/system/extras/perfprofd/quipper/original-kernel-headers/tools/perf/util/include/linux/ |
H A D | types.h | 18 struct list_head *next, *prev; member in struct:list_head 26 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/system/bt/btif/src/ |
H A D | btif_uid.c | 33 struct uid_set_node_t* next; member in struct:uid_set_node_t 53 node = node->next; 66 node = node->next; 72 node->next = set->head; 108 node = node->next; 124 node = node->next;
|
/system/core/libmemunreachable/ |
H A D | LinkedList.h | 43 LinkedList<T> *next() { return next_; } function in class:LinkedList
|
/system/bt/embdrv/sbc/decoder/srce/ |
H A D | framing.c | 111 INLINE OI_CHAR crc_iterate(OI_UINT8 oldcrc, OI_UINT8 next) argument 115 idx = oldcrc^next; 126 INLINE OI_CHAR crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) argument 130 idx = (oldcrc ^ next) >> 4; 143 INLINE OI_UINT8 crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) argument 145 return (oldcrc << 4) ^ crc8_narrow[(oldcrc^next) >> 4]; 149 INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) argument 151 crc = (crc << 4) ^ crc8_narrow[(crc^next) >> 4]; 152 crc = (crc << 4) ^ crc8_narrow[((crc>>4)^next)&0xf]; 158 INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) argument [all...] |
/system/core/libpackagelistparser/ |
H A D | packagelistparser.c | 96 char *next; local 122 next = buf; 124 cur = strsep(&next, " \t\r\n"); 126 errmsg = "Could not get next token for \"package name\""; 135 cur = strsep(&next, " \t\r\n"); 137 errmsg = "Could not get next token for field \"uid\""; 158 cur = strsep(&next, " \t\r\n"); 160 errmsg = "Could not get next token for field \"debuggable\""; 178 cur = strsep(&next, " \t\r\n"); 180 errmsg = "Could not get next toke [all...] |
/system/bt/osi/src/ |
H A D | list.c | 8 struct list_node_t *next; member in struct:list_node_t 98 node->next = prev_node->next; 100 prev_node->next = node; 114 node->next = list->head; 130 node->next = NULL; 136 list->tail->next = node; 151 list_node_t *next = list_free_node_(list, list->head); local 153 list->tail = next; 154 list->head = next; 183 list_node_t *next = node->next; local 215 list_node_t *next = node->next; local [all...] |
/system/core/libcutils/ |
H A D | config_utils.c | 44 for(node = root->first_child; node; node = node->next) 58 root->last_child->next = node; 119 char next; member in struct:__anon1610 130 if(cs->next != 0) { 131 c = cs->next; 132 cs->next = 0; 212 cs->next = *data; 297 cs.next = 0; 326 cur = cur->next;
|
H A D | hashmap.c | 31 Entry* next; member in struct:Entry 120 Entry* next = entry->next; local 122 entry->next = newBuckets[index]; 124 entry = next; 148 Entry* next = entry->next; local 150 entry = next; 181 entry->next = NULL; 223 // Move to next entr 320 Entry *next = entry->next; local [all...] |
H A D | sched_policy.c | 179 char *next = lineBuf; local 185 if (!strsep(&next, ":")) { 189 if (!(found_subsys = strsep(&next, ":"))) { 198 if (!(grp = strsep(&next, ":"))) {
|
/system/extras/ext4_utils/ |
H A D | allocate.h | 28 struct region *next; member in struct:region 43 struct block_allocation* next; member in struct:block_allocation
|
/system/bt/bta/hf_client/ |
H A D | bta_hf_client_at.h | 85 struct queued_at_cmd *next; member in struct:queued_at_cmd
|
/system/core/include/diskconfig/ |
H A D | diskconfig.h | 100 struct write_list *next; member in struct:write_list
|
/system/core/include/utils/ |
H A D | LruCache.h | 102 // while (it.next()) { 111 bool next() { function in class:android::LruCache::Iterator
|
/system/core/libsparse/ |
H A D | backed_block.c | 46 struct backed_block *next; member in struct:backed_block 62 return bb->next; 135 struct backed_block *next = bb->next; local 137 bb = next; 155 for (end = start; end && end->next; end = end->next) 166 from->data_blocks = end->next; 168 for (bb = from->data_blocks; bb; bb = bb->next) { 169 if (bb->next [all...] |
/system/core/libutils/ |
H A D | VectorImpl.cpp | 202 void* next = reinterpret_cast<char*>(array) + mItemSize*(i); local 204 _do_destroy(next, 1); 205 _do_copy(next, curr, 1); 206 next = curr; 214 _do_destroy(next, 1); 215 _do_copy(next, temp, 1);
|
/system/core/run-as/ |
H A D | package.c | 336 * it will be caught in the next conditional. 464 /* find end of current line and start of next one */ 466 const char* next = (end < buffer_end) ? end + 1 : buffer_end; local 545 p = next;
|
/system/extras/f2fs_utils/ |
H A D | f2fs_ioutils.c | 92 struct buf_item *next; member in struct:buf_item 113 buf_list = buf_list->next; 134 bi->next = buf_list;
|
/system/extras/latencytop/ |
H A D | latencytop.c | 35 struct latency_entry *next; member in struct:latency_entry 277 free_entries = free_entries->next; 290 e->next = free_entries; 302 e = e->next; 360 e->next = head; 378 e = e->next; 389 e = e->next;
|