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

12

/system/core/include/cutils/
H A Dlist.h29 struct listnode *prev; member in struct:listnode
38 .prev = &name, \
45 for (node = (list)->prev; node != (list); node = node->prev)
55 node->prev = node;
61 item->prev = head->prev;
62 head->prev->next = item;
63 head->prev = item;
69 item->prev
[all...]
H A Datomic-x86.h75 int32_t prev; local
77 : "=a" (prev)
80 return prev != old_value;
126 int32_t prev, status; local
128 prev = *ptr;
129 status = android_atomic_cas(prev, prev & value, ptr);
131 return prev;
137 int32_t prev, status; local
139 prev
[all...]
H A Datomic-x86_64.h83 int32_t prev; local
85 : "=a" (prev)
88 return prev != old_value;
132 int32_t prev, status; local
134 prev = *ptr;
135 status = android_atomic_cas(prev, prev & value, ptr);
137 return prev;
143 int32_t prev, status; local
145 prev
[all...]
H A Datomic-mips.h75 int32_t prev, status; local
78 " ll %[prev], (%[ptr])\n"
80 " bne %[prev], %[old], 9f\n"
84 : [prev] "=&r" (prev), [status] "=&r" (status)
88 return prev != old_value;
114 int32_t prev, status; local
118 " ll %[prev], (%[ptr])\n"
119 " addu %[status], %[prev], %[inc]\n"
121 : [status] "=&r" (status), [prev] "
143 int32_t prev, status; local
160 int32_t prev, status; local
[all...]
H A Datomic-mips64.h68 int32_t prev, status; local
71 " ll %[prev], (%[ptr])\n"
73 " bne %[prev], %[old], 9f\n"
77 : [prev] "=&r" (prev), [status] "=&r" (status)
81 return prev != old_value;
106 int32_t prev, status; local
110 " ll %[prev], (%[ptr])\n"
111 " addu %[status], %[prev], %[inc]\n"
113 : [status] "=&r" (status), [prev] "
135 int32_t prev, status; local
152 int32_t prev, status; local
[all...]
H A Datomic-arm64.h111 int32_t prev, status; local
114 prev = *ptr;
115 status = android_atomic_cas(prev, prev + increment, ptr);
117 return prev;
135 int32_t prev, status; local
138 prev = *ptr;
139 status = android_atomic_cas(prev, prev & value, ptr);
141 return prev;
147 int32_t prev, status; local
[all...]
H A Datomic-arm.h73 int32_t prev, status; local
82 : "=&r" (prev), "=&r" (status), "+m"(*ptr)
86 return prev != old_value;
109 int32_t prev, tmp, status; local
115 : "=&r" (prev), "=&r" (tmp),
120 return prev;
136 int32_t prev, tmp, status; local
142 : "=&r" (prev), "=&r" (tmp),
147 return prev;
153 int32_t prev, tm local
[all...]
/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 Dtransport.c32 .prev = &transport_list,
37 .prev = &pending_list,
599 t->next->prev = t->prev;
600 t->prev->next = t->next;
655 t->next->prev = t->prev;
656 t->prev->next = t->next;
659 t->prev = transport_list.prev;
[all...]
H A Dusb_windows.c37 usb_handle *prev; member in struct:usb_handle
63 .prev = &handle_list,
161 handle->prev = handle_list.prev;
162 handle->prev->next = handle;
163 handle->next->prev = handle;
200 ret->prev = ret;
383 if ((handle->next != handle) && (handle->prev != handle)) {
384 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 Dfdevent.h70 fdevent *prev; member in struct:fdevent
H A Dfdevent.c90 .prev = &list_pending,
470 node->prev = list->prev;
471 node->prev->next = node;
472 list->prev = node;
477 node->prev->next = node->next;
478 node->next->prev = node->prev;
480 node->prev = 0;
491 list->next->prev
[all...]
H A Dadb.h80 asocket *prev; member in struct:asocket
153 adisconnect* prev; member in struct:adisconnect
178 atransport *prev; member in struct:atransport
229 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.c54 .prev = &local_socket_list,
63 .prev = &local_socket_closing_list,
92 s->prev = s->next->prev;
93 s->prev->next = s;
94 s->next->prev = s;
116 if (s->prev && s->next)
118 s->prev->next = s->next;
119 s->next->prev = s->prev;
[all...]
/system/core/libpixelflinger/codeflinger/tinyutils/
H A DSharedBuffer.cpp104 int32_t prev = 1; local
105 if (onlyOwner() || ((prev = android_atomic_dec(&mRefs)) == 1)) {
111 return prev;
/system/core/libutils/
H A DSharedBuffer.cpp102 int32_t prev = 1; local
103 if (onlyOwner() || ((prev = android_atomic_dec(&mRefs)) == 1)) {
109 return prev;
/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));
126 mapinfo *prev = NULL; local
149 if (prev) {
150 prev->next = map;
158 prev = current;
/system/core/libbacktrace/
H A DUnwindPtrace.cpp103 backtrace_frame_data_t* prev = &frames->at(num_frames-1); local
104 prev->stack_size = frame->sp - prev->sp;
H A DUnwindCurrent.cpp134 backtrace_frame_data_t* prev = &frames->at(num_frames-1); local
135 prev->stack_size = frame->sp - prev->sp;
/system/core/toolbox/upstream-netbsd/bin/cat/
H A Dcat.c173 int ch, gobble, line, prev; local
176 for (prev = '\n'; (ch = getc(fp)) != EOF; prev = ch) {
177 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/core/lmkd/
H A Dlmkd.c102 struct adjslot_list *prev; member in struct:adjslot_list
172 new->prev = head;
174 next->prev = new;
180 struct adjslot_list *prev = old->prev; local
182 next->prev = prev;
183 prev->next = next;
187 struct adjslot_list *asl = head->prev;
790 procadjslot_list[i].prev
[all...]
/system/extras/ext4_utils/
H A Dallocate.c30 struct region *prev; member in struct:region
93 if (reg->prev)
94 reg->prev->next = reg->next;
97 reg->next->prev = reg->prev;
103 list->last = reg->prev;
106 reg->prev = NULL;
116 reg->prev = NULL;
119 reg->prev = list->last;
267 struct region *reg = alloc->list.last->prev;
[all...]

Completed in 275 milliseconds

12