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

123

/system/extras/fatblock/
H A Dfdpool.h22 struct pooled_fd *next; member in struct:pooled_fd
H A Dfatblock.h40 struct extent *next; member in struct:extent
H A Dfdpool.c31 .next = &fdpool_head
38 struct pooled_fd *next = prev->next; local
42 prev->next = node;
44 node->next = next;
45 next->prev = node;
53 struct pooled_fd *next = node->next; local
56 assert(next);
[all...]
/system/core/include/cutils/
H A Dconfig_utils.h29 cnode *next; member in struct:cnode
H A Dlist.h28 struct listnode *next; member in struct:listnode
37 .next = &name, \
42 for (node = (list)->next; node != (list); node = node->next)
51 #define list_empty(list) ((list) == (list)->next)
52 #define list_head(list) ((list)->next)
/system/core/sh/
H A Dalias.h40 struct alias *next; member in struct:alias
H A Dexpand.h38 struct strlist *next; member in struct:strlist
H A Dredir.c80 struct redirtab *next; member in struct:redirtab
126 sv->next = redirlist;
129 for (n = redir ; n ; n = n->nfile.next) {
316 redirlist = rp->next;
357 for (rp = redirlist ; rp ; rp = rp->next) {
H A Dvar.h53 struct var *next; /* next entry in hash list */ member in struct:var
64 struct localvar *next; /* next local variable in list */ member in struct:localvar
/system/core/adb/
H A Dfdevent.h69 fdevent *next; member in struct:fdevent
H A Dusb_windows.c38 usb_handle *next; member in struct:usb_handle
62 .next = &handle_list,
121 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) {
158 handle->next = &handle_list;
160 handle->prev->next = handle;
161 handle->next->prev = handle;
197 ret->next = ret;
381 if ((handle->next != handle) && (handle->prev != handle)) {
382 handle->next
[all...]
/system/core/include/corkscrew/
H A Dmap_info.h31 struct map_info* next; member in struct:map_info
66 /* Flushes the cached memory map so the next call to
/system/core/libzipfile/
H A Dprivate.h18 struct Zipentry* next; member in struct:Zipentry
H A Dzipfile.c35 Zipentry* next = entry->next; local
37 entry = next;
51 entry = entry->next;
143 entry = entry->next;
156 entry = entry->next;
/system/core/toolbox/
H A Dreadtty.c29 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 Dprotocol.c47 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/libcorkscrew/
H A Dmap_info.c82 mi->next = milist;
146 mi->next = milist;
159 map_info_t* next = milist->next; local
161 milist = next;
168 mi = mi->next;
/system/core/libcutils/
H A Dconfig_utils.c44 for(node = root->first_child; node; node = node->next)
58 root->last_child->next = node;
119 char next; member in struct:__anon165
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 Ddir_hash.c119 struct list *next; member in struct:list
153 struct list *next; local
154 for (f = list; f != NULL; f = next) {
155 next = f->next;
168 node->next = list;
174 for (f = list; f != NULL; f = f->next) {
183 struct list *next; local
184 for (f = list; f != NULL; f = f->next) {
185 next
211 struct list *next; local
237 struct list *next; local
249 struct list *next; local
287 struct list *next; local
305 struct list *next; local
324 struct list *next; local
[all...]
H A Dhashmap.c31 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 Dsched_policy.c174 char *next = lineBuf; local
180 if (!strsep(&next, ":")) {
184 if (!(subsys = strsep(&next, ":"))) {
193 if (!(grp = strsep(&next, ":"))) {
/system/core/include/diskconfig/
H A Ddiskconfig.h100 struct write_list *next; member in struct:write_list
/system/core/include/utils/
H A DBasicHashtable.h68 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 DLruCache.h57 bool next() { function in class:android::LruCache::Iterator
58 mIndex = mCache.mTable->next(mIndex);
/system/core/init/
H A Dinit.h52 struct socketinfo *next; member in struct:socketinfo
61 struct svcenvinfo *next; member in struct:svcenvinfo

Completed in 221 milliseconds

123