Searched refs:prev (Results 1 - 25 of 33) sorted by relevance

12

/system/core/libcutils/
H A Dlist.c22 node->prev = node;
28 item->prev = head->prev;
29 head->prev->next = item;
30 head->prev = item;
35 item->next->prev = item->prev;
36 item->prev->next = item->next;
/system/core/include/cutils/
H A Datomic-arm.h101 int32_t prev, status; local
107 : "=&r" (prev), "=&r" (status), "+m"(*ptr)
111 return prev != old_value;
118 int32_t prev, status; local
119 prev = *ptr;
124 prev = *ptr;
125 } while (prev == old_value);
155 int32_t prev, tmp, status; local
161 : "=&r" (prev), "=&r" (tmp),
166 return prev;
172 int32_t prev, status; local
197 int32_t prev, tmp, status; local
213 int32_t prev, status; local
228 int32_t prev, tmp, status; local
244 int32_t prev, status; local
[all...]
H A Datomic-mips.h77 int32_t prev, status; local
80 " ll %[prev], (%[ptr])\n"
82 " bne %[prev], %[old], 9f\n"
86 : [prev] "=&r" (prev), [status] "=&r" (status)
90 return prev != old_value;
114 int32_t prev, status; local
118 " ll %[prev], (%[ptr])\n"
120 : [prev] "=&r" (prev), [statu
131 int32_t prev, status; local
157 int32_t prev, status; local
173 int32_t prev, status; local
[all...]
H A Datomic-x86.h77 int32_t prev; local
79 : "=a" (prev)
82 return prev != old_value;
124 int32_t prev, status; local
126 prev = *ptr;
127 status = android_atomic_cas(prev, prev & value, ptr);
129 return prev;
134 int32_t prev, status; local
136 prev
[all...]
H A Dlist.h29 struct listnode *prev; member in struct:listnode
38 .prev = &name, \
45 for (node = (list)->prev; node != (list); node = node->prev)
53 #define list_tail(list) ((list)->prev)
/system/extras/fatblock/
H A Dfdpool.c30 .prev = &fdpool_head,
37 struct pooled_fd *prev = &fdpool_head; local
38 struct pooled_fd *next = prev->next;
42 prev->next = node;
43 node->prev = prev;
45 next->prev = node;
52 struct pooled_fd *prev = node->prev; local
55 assert(prev);
[all...]
H A Dfdpool.h21 struct pooled_fd *prev; member in struct:pooled_fd
/system/core/adb/
H A Djdwp_service.c107 JdwpProcess* prev; member in struct:JdwpProcess
164 proc->prev->next = proc->next;
165 proc->next->prev = proc->prev;
207 proc->prev = proc;
222 proc->prev = proc->next->prev;
224 proc->prev->next = proc;
225 proc->next->prev = proc;
628 JdwpTracker* prev; member in struct:JdwpTracker
[all...]
H A Dusb_windows.c35 usb_handle *prev; member in struct:usb_handle
61 .prev = &handle_list,
159 handle->prev = handle_list.prev;
160 handle->prev->next = handle;
161 handle->next->prev = handle;
198 ret->prev = ret;
381 if ((handle->next != handle) && (handle->prev != handle)) {
382 handle->next->prev = handle->prev;
[all...]
H A Dusb_libusb.c45 usb_handle *prev; member in struct:usb_handle
63 .prev = &handle_list,
213 h->next->prev = h->prev;
214 h->prev->next = h->next;
215 h->prev = NULL;
237 h->next->prev = h->prev;
238 h->prev->next = h->next;
239 h->prev
[all...]
H A Dtransport.c32 .prev = &transport_list,
594 t->next->prev = t->prev;
595 t->prev->next = t->next;
651 t->prev = transport_list.prev;
652 t->next->prev = t;
653 t->prev->next = t;
656 t->disconnects.next = t->disconnects.prev = &t->disconnects;
733 dis->prev
[all...]
H A Dfdevent.h70 fdevent *prev; member in struct:fdevent
H A Dfdevent.c99 .prev = &list_pending,
479 node->prev = list->prev;
480 node->prev->next = node;
481 list->prev = node;
486 node->prev->next = node->next;
487 node->next->prev = node->prev;
489 node->prev = 0;
500 list->next->prev
[all...]
H A Dadb.h79 asocket *prev; member in struct:asocket
149 adisconnect* prev; member in struct:adisconnect
174 atransport *prev; member in struct:atransport
225 alistener *prev; member in struct:alistener
H A Dusb_linux.c52 usb_handle *prev; member in struct:usb_handle
81 .prev = &handle_list,
547 h->next->prev = h->prev;
548 h->prev->next = h->next;
549 h->prev = 0;
667 usb->prev = handle_list.prev;
668 usb->prev->next = usb;
669 usb->next->prev
[all...]
H A Dsockets.c50 .prev = &local_socket_list,
59 .prev = &local_socket_closing_list,
83 s->prev = s->next->prev;
84 s->prev->next = s;
85 s->next->prev = s;
102 if (s->prev && s->next)
104 s->prev->next = s->next;
105 s->next->prev = s->prev;
[all...]
/system/core/libpixelflinger/tinyutils/
H A DSharedBuffer.cpp95 int32_t prev = 1; local
96 if (onlyOwner() || ((prev = android_atomic_dec(&mRefs)) == 1)) {
102 return prev;
/system/core/sh/
H A Dmemalloc.c111 struct stack_block *prev; member in struct:stack_block
138 sp->prev = stackp;
184 stackp = sp->prev;
216 stackp = sp->prev;
219 sp->prev = stackp;
H A Dinput.c75 struct strpush *prev; /* preceding string on stack */ member in struct:strpush
89 struct parsefile *prev; /* preceding file on stack */ member in struct:parsefile
394 sp->prev = parsefile->strpush;
421 parsefile->strpush = sp->prev;
510 pf->prev = parsefile;
513 pf->basestrpush.prev = NULL;
530 parsefile = pf->prev;
H A Dvar.c433 struct var *vp, **prev; local
436 for (prev = vpp ; (vp = *prev) != NULL ; ) {
438 *prev = vp->next;
448 prev = &vp->next;
/system/extras/showmap/
H A Dshowmap.c40 static int parse_header(const char* line, const mapinfo* prev, mapinfo** mi) { argument
59 if (prev && start == prev->end && is_library(prev->name)) {
63 strlcpy(name, prev->name, sizeof(name));
124 mapinfo *prev = NULL; local
147 if (prev) {
148 prev->next = map;
156 prev = current;
/system/core/toolbox/
H A Dcat.c55 int ch, gobble, line, prev; local
59 for (prev = '\n'; (ch = getc(fp)) != EOF; prev = ch) {
60 if (prev == '\n') {
/system/extras/showslab/
H A Dshowslab.c62 struct slab_info *head = NULL, *p = NULL, *prev = NULL; local
104 head = prev = p;
141 prev->next = p;
142 prev = p;
/system/extras/ext4_utils/
H A Dallocate.c43 struct region *prev; member in struct:region
78 if (reg->prev)
79 reg->prev->next = reg->next;
82 reg->next->prev = reg->prev;
88 list->last = reg->prev;
91 reg->prev = NULL;
101 reg->prev = NULL;
104 reg->prev = list->last;
257 struct region *reg = alloc->list.last->prev;
[all...]
/system/core/debuggerd/
H A Dtombstone.c356 map_info_t *prev = NULL; local
362 /* map would be between "prev" and this entry */
368 prev = map;
373 * Show "next" then "match" then "prev" so that the addresses appear in
386 if (prev != NULL) {
387 _LOG(log, false, " %08x-%08x %s\n", prev->start, prev->end, prev->name);

Completed in 151 milliseconds

12