| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 * the prev/next entries already!
41 struct list_head * prev,
44 next->prev = add;
46 add->prev = prev;
47 prev->next = add;
73 __list_add(add, head->prev, head)
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
| AtomicLongFieldUpdater.java | 174 long prev; local
176 prev = get(obj);
177 } while (!compareAndSet(obj, prev, newValue));
178 return prev;
189 long prev, next; local
191 prev = get(obj);
192 next = prev + 1;
193 } while (!compareAndSet(obj, prev, next));
194 return prev;
205 long prev, next local
222 long prev, next; local
238 long prev, next; local
254 long prev, next; local
271 long prev, next; local
291 long prev, next; local
311 long prev, next; local
336 long prev, next; local
361 long prev, next; local
[all...] |
| /external/fio/ |
| flist.h | 22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev; member in struct:flist_head
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
47 struct flist_head *prev,
50 next->prev = new_entry;
52 new_entry->prev = prev;
53 prev->next = new_entry;
73 __flist_add(new_entry, head->prev, head)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /external/libdrm/ |
| util_double_list.h | 43 struct list_head *prev; member in struct:list_head
49 item->prev = item;
55 item->prev = list;
57 list->next->prev = item;
64 item->prev = list->prev;
65 list->prev->next = item;
66 list->prev = item;
71 to->prev = from->prev;
[all...] |
| /external/selinux/policycoreutils/setsebool/ |
| setsebool-bash-completion.sh | 30 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
33 if [ "$verb" = "" -a "$prev" = "setsebool" -o "$prev" = "-P" ]; then
43 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
46 if [ "$verb" = "" -a "$prev" == "getsebool" ]; then
50 if [ "$verb" = "" -a "$prev" != "-a" ]; then
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| next_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| prev_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| prev_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /toolchain/binutils/binutils-2.27/config/ |
| bootstrap-asan.mk | 9 -B$$r/prev-$(TARGET_SUBDIR)/libsanitizer/ \
10 -B$$r/prev-$(TARGET_SUBDIR)/libsanitizer/asan/ \
11 -B$$r/prev-$(TARGET_SUBDIR)/libsanitizer/asan/.libs
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| get_pred_adv_b_add.cpp | 83 uint8 *prev, /* i */
96 offset = width - B_SIZE; /* offset for prev */
99 tmp = (uintptr_t)prev & 0x3;
106 *((uint32*)(pred_block += offset2)) = *((uint32*)prev);
107 *((uint32*)(pred_block += 4)) = *((uint32*)(prev + 4));
108 prev += width;
114 prev--; /* word-aligned */
118 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */
119 word2 = *((uint32*)(prev += 4)); /* read 4 bytes, b8 b7 b6 b5 */
124 word1 = *((uint32*)(prev += 4)); /* b12 b11 b10 b9 *
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/crashers/ |
| borrowed_ref_1.py | 26 prev = None
variable
29 prev = (prev,)
variable in class:D
|
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 77 heap->next->prev = r;
78 r->prev = heap;
106 new->prev = r->prev;
107 if (r->prev)
108 r->prev->next = new;
116 if (r->prev && !r->prev->in_use) {
117 r->prev->next = r->next;
119 r->next->prev = r->prev
[all...] |
| /external/python/cpython2/Lib/test/crashers/ |
| borrowed_ref_1.py | 26 prev = None variable
29 prev = (prev,) variable in class:D
|
| /external/syslinux/core/thread/ |
| exit_thread.c | 14 curr->list.prev->next = curr->list.next;
15 curr->list.next->prev = curr->list.prev;
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| cirlist.c | 43 cl->head->prev = cl->head;
48 assert(cl->head->prev == cl->head);
50 cl->head->prev = new;
52 new->prev = cl->head;
55 assert(cl->head->prev != cl->head);
58 new->prev = (cl->head)->prev;
59 cl->head->prev->next = new;
60 cl->head->prev = new;
78 assert(cl->head->prev == cl->head)
[all...] |
| /prebuilts/go/darwin-x86/src/syscall/ |
| mksysnum_linux.pl | 33 my $prev;
44 $prev = $2;
48 $prev = $2;
52 fmt($1, $prev+$2)
|
| /prebuilts/go/linux-x86/src/syscall/ |
| mksysnum_linux.pl | 33 my $prev;
44 $prev = $2;
48 $prev = $2;
52 fmt($1, $prev+$2)
|
| /tools/dexter/slicer/export/slicer/ |
| intrusive_list.h | 26 // (It works for any type T which has T* next, prev fields)
56 p_ = p_->prev;
88 assert(p->prev == nullptr);
90 p->prev = pos->prev;
92 assert(pos->prev == nullptr);
95 assert(pos->prev != nullptr);
96 p->prev->next = p;
99 pos->prev = p;
106 assert(p->prev == nullptr)
[all...] |
| /external/libopus/src/ |
| opus_multistream.c | 57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev)
60 i = (prev<0) ? 0 : prev+1;
69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev)
72 i = (prev<0) ? 0 : prev+1;
81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev)
84 i = (prev<0) ? 0 : prev+1;
|
| /external/mesa3d/src/util/ |
| list.h | 48 struct list_head *prev; member in struct:list_head
54 item->prev = item;
60 item->prev = list;
62 list->next->prev = item;
69 item->prev = list->prev;
70 list->prev->next = item;
71 list->prev = item;
81 to->prev = from->prev;
[all...] |
