Searched defs:next (Results 1 - 25 of 51) sorted by relevance

123

/system/core/fastbootd/commands/
H A D	virtual_partitions.h	38 struct virtual_partition *next; member in struct:virtual_partition
/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/core/adb/
H A D	fdevent.h	69 fdevent *next; member in struct:fdevent
H A D	usb_windows.c	39 usb_handle *next; member in struct:usb_handle 63 .next = &handle_list, 122 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) { 159 handle->next = &handle_list; 161 handle->prev->next = handle; 162 handle->next->prev = handle; 198 ret->next = ret; 382 if ((handle->next != handle) && (handle->prev != handle)) { 383 handle->next [all...]
/system/extras/ext4_utils/
H A D	allocate.h	37 struct block_allocation* next; member in struct:block_allocation
/system/core/libbacktrace/
H A D	map_info.c	81 mi->next = milist; 147 mi->next = milist; 160 backtrace_map_info_t* next = milist->next; local 162 milist = next; 170 mi = mi->next;
/system/core/libzipfile/
H A D	private.h	18 struct Zipentry* next; member in struct:Zipentry
H A D	zipfile.c	35 Zipentry* next = entry->next; local 37 entry = next; 51 entry = entry->next; 142 entry = entry->next; 155 entry = entry->next;
/system/core/toolbox/
H A D	readtty.c	29 char *next; local 32 next = strchr(map[i].chars, current); 33 if(next && next[1]) 34 return next[1]; 44 char *next; local 47 next = strchr(map[i].chars+1, current); 48 if(next && next[-1]) 49 return next[ [all...]
/system/core/fastbootd/
H A D	protocol.c	47 struct fastboot_cmd *next; member in struct:fastboot_cmd 54 struct fastboot_var *next; member in struct:fastboot_var 70 cmd->next = cmdlist; 84 var->next = varlist; 93 for (var = varlist; var; var = var->next) { 157 for (cmd = cmdlist; cmd; cmd = cmd->next) {
/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:__anon156 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	dir_hash.c	119 struct list *next; member in struct:list 153 struct list *next; local 154 for (f = list; f != NULL; f = next) { 155 next = f->next; 169 node->next = list; 175 for (f = list; f != NULL; f = f->next) { 184 struct list *next; local 185 for (f = list; f != NULL; f = f->next) { 186 next 212 struct list *next; local 238 struct list *next; local 250 struct list *next; local 288 struct list *next; local 306 struct list *next; local 325 struct list *next; local [all...]
H A D	hashmap.c	31 Entry* next; member in struct:Entry 117 Entry* next = entry->next; local 119 entry->next = newBuckets[index]; 121 entry = next; 145 Entry* next = entry->next; local 147 entry = next; 174 entry->next = NULL; 216 // Move to next entr 313 Entry *next = entry->next; local [all...]
H A D	sched_policy.c	174 char *next = lineBuf; local 180 if (!strsep(&next, ":")) { 184 if (!(subsys = strsep(&next, ":"))) { 193 if (!(grp = strsep(&next, ":"))) {
/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	BasicHashtable.h	68 ssize_t next(ssize_t index) const; 131 // Returns the increment to add to a bucket index to seek to the next bucket 138 // Returns the index of the next bucket that is in the collision chain 255 /* Returns the index of the next entry in the hashtable given the index of a previous entry. 258 * If the given index is not -1, then returns the index of the next entry in the hashtable, 264 inline ssize_t next(ssize_t index) const { function in class:android::BasicHashtable 265 return BasicHashtableImpl::next(index); 270 * otherwise returns the index of the next matching entry. 302 * to continue iterating over the hashtable using next() or find().
H A D	LruCache.h	58 bool next() { function in class:android::LruCache::Iterator 59 mIndex = mCache.mTable->next(mIndex);
/system/core/init/
H A D	init.h	56 struct socketinfo *next; member in struct:socketinfo 66 struct svcenvinfo *next; member in struct:svcenvinfo
/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	BasicHashtable.cpp	101 ssize_t BasicHashtableImpl::next(ssize_t index) const { function in class:android::BasicHashtableImpl
H A D	LinearAllocator.cpp	88 Page* next() { return mNextPage; } function in class:android::LinearAllocator::Page 89 void setNext(Page* next) { mNextPage = next; } argument 124 Page* next = p->next(); local 128 p = next;
H A D	VectorImpl.cpp	195 void* next = reinterpret_cast<char*>(array) + mItemSize*(i); local 197 _do_destroy(next, 1); 198 _do_copy(next, curr, 1); 199 next = curr; 204 _do_destroy(next, 1); 205 _do_copy(next, temp, 1);
/system/core/run-as/
H A D	package.c	329 * it will be caught in the next conditional. 457 /* find end of current line and start of next one */ 459 const char* next = (end < buffer_end) ? end + 1 : buffer_end; local 525 p = next;
/system/extras/f2fs_utils/
H A D	f2fs_ioutils.c	93 struct buf_item *next; member in struct:buf_item 111 buf_list = buf_list->next; 132 bi->next = buf_list;

Completed in 524 milliseconds

123

Indexes created Thu Nov 06 06:13:30 CET 2014