| /system/core/include/cutils/ |
| atomic-mips.h | 83 int32_t prev, status; local
86 " ll %[prev], (%[ptr])\n"
88 " bne %[prev], %[old], 9f\n"
92 : [prev] "=&r" (prev), [status] "=&r" (status)
96 return prev != old_value;
122 int32_t prev, status; local
126 " ll %[prev], (%[ptr])\n"
128 : [prev] "=&r" (prev), [status] "=&r" (status
139 int32_t prev, status; local
168 int32_t prev, status; local
185 int32_t prev, status; local
[all...] |
| atomic-x86.h | 83 int32_t prev; local
85 : "=a" (prev)
88 return prev != old_value;
134 int32_t prev, status; local
136 prev = *ptr;
137 status = android_atomic_cas(prev, prev & value, ptr);
139 return prev;
145 int32_t prev, status; local
147 prev = *ptr
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
38 struct list_head * prev,
41 next->prev = new;
43 new->prev = prev;
44 prev->next = new;
60 __list_add(new, head->prev, head)
[all...] |
| /device/asus/flo/camera/QCamera2/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
49 ptr->prev = ptr;
55 struct cam_list *prev = head->prev; local
57 head->prev = item;
59 item->prev = prev;
60 prev->next = item;
67 item->prev = node->prev;
74 struct cam_list *prev = ptr->prev; local
[all...] |
| /hardware/qcom/camera/QCamera2/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
49 ptr->prev = ptr;
55 struct cam_list *prev = head->prev; local
57 head->prev = item;
59 item->prev = prev;
60 prev->next = item;
67 item->prev = node->prev;
74 struct cam_list *prev = ptr->prev; local
[all...] |
| /frameworks/rs/driver/runtime/ |
| rs_core.c | 58 uint32_t prev, status; local
60 prev = *ptr;
61 uint32_t n = min(value, prev);
62 status = rsAtomicCas((volatile int32_t*) ptr, (int32_t) prev, (int32_t)n);
63 } while (status != prev);
64 return prev;
68 int32_t prev, status; local
70 prev = *ptr;
71 int32_t n = min(value, prev);
72 status = rsAtomicCas(ptr, prev, n)
78 uint32_t prev, status; local
88 int32_t prev, status; local
[all...] |
| /bionic/libc/private/ |
| bionic_atomic_mips.h | 44 int32_t prev, status; local
46 " ll %[prev], 0(%[ptr]) \n"
47 " bne %[old_value], %[prev], 2f \n"
51 : [prev]"=&r"(prev), [status]"=&r"(status), "+m"(*ptr)
54 return prev != old_value;
62 int32_t prev, status; local
64 " ll %[prev], 0(%[ptr]) \n"
67 : [prev]"=&r"(prev), [status]"=&r"(status), "+m"(*ptr
77 int32_t prev, status; local
92 int32_t prev, status; local
[all...] |
| /external/qemu/android/utils/ |
| list.h | 32 ACList* prev; member in struct:ACList
39 list->next = list->prev = list;
55 entry->prev = list;
56 next->prev = entry;
63 ACList* const prev = list->prev; local
65 entry->prev = prev;
66 prev->next = entry;
67 list->prev = entry
76 ACList* const prev = entry->prev; local
[all...] |
| /system/extras/fatblock/ |
| fdpool.c | 30 .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...] |
| /system/core/libcutils/ |
| list.c | 22 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;
|
| /device/lge/mako/camera/QCamera/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
49 ptr->prev = ptr;
55 struct cam_list *prev = head->prev; local
57 head->prev = item;
59 item->prev = prev;
60 prev->next = item;
65 struct cam_list *prev = ptr->prev; local
[all...] |
| /external/libnl-headers/netlink/ |
| list.h | 18 struct nl_list_head * prev; member in struct:nl_list_head
24 list->prev = list;
28 struct nl_list_head *prev,
31 prev->next = obj;
32 obj->prev = prev;
33 next->prev = obj;
40 __nl_list_add(obj, head->prev, head);
51 obj->next->prev = obj->prev;
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_rankings.cc | 29 MemEntryImpl* prev = node->prev(); local
36 tail_ = prev;
38 if (prev)
39 prev->set_next(next);
42 next->set_prev(prev);
64 return node->prev();
|
| /external/chromium_org/net/disk_cache/ |
| mem_rankings.cc | 29 MemEntryImpl* prev = node->prev(); local
36 tail_ = prev;
38 if (prev)
39 prev->set_next(next);
42 next->set_prev(prev);
64 return node->prev();
|
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 17 struct dl_list *prev; member in struct:dl_list
23 list->prev = list;
29 item->prev = list;
30 list->next->prev = item;
36 dl_list_add(list->prev, item);
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
44 item->prev = NULL;
74 dl_list_entry((list)->prev, type, member)
[all...] |
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| prclist.h | 47 PRCList *prev; member in struct:PRCListStr
56 (_e)->prev = (_l)->prev; \
57 (_l)->prev->next = (_e); \
58 (_l)->prev = (_e); \
67 (_e)->prev = (_l); \
68 (_l)->next->prev = (_e); \
81 ((_e)->prev)
95 #define PR_LIST_TAIL(_l) (_l)->prev
102 (_e)->prev->next = (_e)->next;
[all...] |
| /external/blktrace/btt/ |
| list.h | 35 struct list_head *next, *prev; member in struct:list_head
46 list->prev = list;
53 * the prev/next entries already!
56 struct list_head *prev,
59 next->prev = new;
61 new->prev = prev;
62 prev->next = new;
88 __list_add(new, head->prev, head);
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /external/chromium_org/third_party/skia/src/views/ |
| SkTagList.cpp | 34 SkTagList* prev = NULL;
42 if (prev)
43 prev->fNext = next;
49 prev = rec;
|
| /external/skia/src/views/ |
| SkTagList.cpp | 34 SkTagList* prev = NULL;
42 if (prev)
43 prev->fNext = next;
49 prev = rec;
|
| /external/bzip2/ |
| format.pl | 43 my ($prev, $curr, $str);
44 $prev = ''; $curr = '';
47 print OUTFILE $prev;
48 $prev = $curr;
52 if ( $prev =~ /<programlisting>$|<screen>$/ ) {
53 chomp $prev;
54 $curr = join( '', $prev, "<![CDATA[", $curr );
55 $prev = '';
59 chomp $prev;
60 $curr = join( '', $prev, "]]>", $curr )
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_double_list.h | 47 struct list_head *prev; member in struct:list_head
53 item->prev = item;
59 item->prev = list;
61 list->next->prev = item;
68 item->prev = list->prev;
69 list->prev->next = item;
70 list->prev = item;
75 to->prev = from->prev;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_double_list.h | 47 struct list_head *prev; member in struct:list_head
53 item->prev = item;
59 item->prev = list;
61 list->next->prev = item;
68 item->prev = list->prev;
69 list->prev->next = item;
70 list->prev = item;
75 to->prev = from->prev;
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.cpp | 37 mir->prev = mir->next = NULL;
40 mir->prev = bb->lastMIRInsn;
52 mir->prev = mir->next = NULL;
54 bb->firstMIRInsn->prev = mir;
56 mir->prev = NULL;
64 newMIR->prev = currentMIR;
70 newMIR->next->prev = newMIR;
86 lir->prev = lir->next = NULL;
89 lir->prev = cUnit->lastLIRInsn;
103 assert(currentLIR->prev != NULL)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| list.h | 29 * contain no data. The head sentinel can be identified by its \c prev
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
45 * - A \c tail pointer that represents the \c prev pointer of the head
48 * - A \c tail_prev pointer that represents the \c prev pointer of the
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
76 struct exec_node *prev; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
115 return prev;
120 return prev;
125 next->prev = prev
[all...] |
| /external/libvpx/libvpx/nestegg/halloc/src/ |
| hlist.h | 38 hlist_item_t ** prev; member in struct:hlist_item
95 i->prev = &i->next;
105 next->prev = &i->next;
107 i->prev = &h->next;
116 next->prev = i->prev;
117 *i->prev = next;
125 *i->prev = i;
126 i->next->prev = &i->next;
132 h->next->prev = &h->next
[all...] |
