| /art/test/utils/python/testgen/ |
| utils.py | 74 prev = list(prevt)
75 yield tuple([1] + prev)
76 for i in range(len(prev)):
77 prev[i] += 1
78 yield tuple(prev)
79 prev[i] -= 1
|
| /external/iproute2/include/ |
| list.h | 12 struct list_head *next, *prev; member in struct:list_head
18 list->prev = list;
22 struct list_head *prev,
25 next->prev = new;
27 new->prev = prev;
28 prev->next = new;
38 __list_add(new, head->prev, head);
41 static inline void __list_del(struct list_head *prev, struct list_head *next)
43 next->prev = prev
[all...] |
| /external/kmod/libkmod/ |
| libkmod-list.c | 33 node->prev = node;
46 node->prev = list->prev;
47 list->prev->next = node;
48 list->prev = node;
54 if (node->prev == node || node->next == node)
57 node->prev->next = node->next;
58 node->next->prev = node->prev;
71 node->prev = list
[all...] |
| /bionic/libc/bionic/ |
| pthread_atfork.cpp | 37 atfork_t* prev; member in struct:atfork_t
59 for (atfork_t* it = last_; it != nullptr; it = it->prev) {
66 entry->prev = last_;
67 if (entry->prev != nullptr) {
68 entry->prev->next = entry;
92 if (entry->prev != nullptr) {
93 entry->prev->next = entry->next;
99 entry->next->prev = entry->prev;
101 last_ = entry->prev;
[all...] |
| /external/icu/icu4c/source/i18n/ |
| bocsu.cpp | 92 * code points. Lexical order is preserved if "prev" is always moved
95 * Additionally, "prev" is moved from anywhere in the Unihan
101 u_writeIdenticalLevelRun(UChar32 prev, const UChar *s, int32_t length, icu::ByteSink &sink) {
119 if(prev<0x4e00 || prev>=0xa000) {
120 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
126 prev=0x9fff-SLOPE_REACH_POS_2;
133 prev=0;
135 p=u_writeDiff(c-prev, p)
[all...] |
| /libcore/luni/src/main/java/java/lang/ref/ |
| FinalizerReference.java | 36 private FinalizerReference<?> prev; field in class:FinalizerReference
58 reference.prev = null;
61 head.prev = reference;
70 FinalizerReference<?> prev = reference.prev; local
72 reference.prev = null;
73 if (prev != null) {
74 prev.next = next;
79 next.prev = prev;
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
| AtomicReferenceFieldUpdater.java | 189 V prev; local
191 prev = get(obj);
192 } while (!compareAndSet(obj, prev, newValue));
193 return prev;
208 V prev, next; local
210 prev = get(obj);
211 next = updateFunction.apply(prev);
212 } while (!compareAndSet(obj, prev, next));
213 return prev;
228 V prev, next local
253 V prev, next; local
278 V prev, next; local
[all...] |
| /external/okhttp/okio/okio/src/main/java/okio/ |
| AsyncTimeout.java | 95 for (AsyncTimeout prev = head; true; prev = prev.next) {
96 if (prev.next == null || remainingNanos < prev.next.remainingNanos(now)) {
97 node.next = prev.next;
98 prev.next = node;
99 if (prev == head) {
117 for (AsyncTimeout prev = head; prev != null; prev = prev.next)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| unlink.c | 27 struct ext2_dir_entry *prev; member in struct:link_struct
41 struct ext2_dir_entry *prev; local
43 prev = ls->prev;
44 ls->prev = dirent;
61 prev->rec_len += dirent->rec_len;
91 ls.prev = 0;
|
| /external/honggfuzz/libhfuzz/ |
| instrument.c | 77 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, pos); local
78 if (!prev) {
92 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, ret); local
93 if (!prev) {
104 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
105 if (prev < v) {
107 ATOMIC_POST_ADD(feedback->pidFeedbackCmp[my_thread_no], v - prev);
114 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
115 if (prev < v) {
117 ATOMIC_POST_ADD(feedback->pidFeedbackCmp[my_thread_no], v - prev);
124 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
134 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
162 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
197 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, pos); local
209 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, pos); local
265 bool prev = ATOMIC_XCHG(feedback->pcGuardMap[*guard], true); local
275 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); local
[all...] |
| /external/libcxx/test/std/iterators/iterator.primitives/iterator.operations/ |
| prev.pass.cpp | 13 // Iter prev(Iter x, Iter::difference_type n = 1);
24 assert(std::prev(i, n) == x);
26 It (*prev)(It, typename std::iterator_traits<It>::difference_type) = std::prev;
27 assert(prev(i, n) == x);
34 assert(std::prev(i) == x);
42 return std::prev(i, n) == x;
49 return std::prev(i) == x;
|
| /external/v8/src/parsing/ |
| func-name-inferrer.cc | 61 int pos, const AstString* prev) {
62 if (pos >= names_stack_.length()) return prev;
67 return MakeNameFromStackHelper(pos + 1, prev);
69 if (prev->length() > 0) {
71 if (prev->length() + name->length() + 1 > String::kMaxLength) return prev;
74 curr = ast_value_factory_->NewConsString(prev, curr);
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| motion_comp.cpp | 351 UChar *prev, /* i */
366 tmp = (uintptr_t)prev & 0x3;
371 prev -= lx;
375 *((ULong*)(rec += 16)) = *((ULong*)(prev += lx));
376 *((ULong*)(rec + 4)) = *((ULong*)(prev + 4));
382 prev--; /* word-aligned */
384 prev -= lx;
388 word1 = *((ULong*)(prev += lx)); /* read 4 bytes, b4 b3 b2 b1 */
389 word2 = *((ULong*)(prev + 4)); /* read 4 bytes, b8 b7 b6 b5 */
394 word1 = *((ULong*)(prev + 8)); /* b12 b11 b10 b9 *
[all...] |
| /external/freetype/src/cache/ |
| ftcmru.c | 37 FTC_MruNode last = first->prev;
58 first->prev = node;
61 node->prev = last;
66 node->prev = node;
83 FTC_MruNode prev, next, last; local
102 prev = node->prev;
105 prev->next = next;
106 next->prev = prev;
126 FTC_MruNode prev, next; local
[all...] |
| /external/iptables/libiptc/ |
| linux_list.h | 48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
73 struct list_head *prev,
76 next->prev = new;
78 new->prev = prev;
79 prev->next = new;
105 __list_add(new, head->prev, head)
[all...] |
| /external/libnetfilter_conntrack/include/internal/ |
| linux_list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct list_head *next, *prev; member in struct:list_head
68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
75 * the prev/next entries already!
78 struct list_head *prev,
81 next->prev = new;
83 new->prev = prev;
84 prev->next = new;
110 __list_add(new, head->prev, head)
[all...] |
| /external/libnfnetlink/include/ |
| linux_list.h | 52 * sometimes we already know the next/prev entries and we can
58 struct list_head *next, *prev; member in struct:list_head
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 * the prev/next entries already!
77 struct list_head *prev,
80 next->prev = new;
82 new->prev = prev;
83 prev->next = new;
109 __list_add(new, head->prev, head)
[all...] |
| /external/wayland/tests/ |
| list-test.c | 38 assert(list.prev == &list);
55 assert(list.prev == &e.link);
57 assert(e.link.prev == &list);
86 wl_list_insert(list.prev, &e1.link);
87 wl_list_insert(list.prev, &e2.link);
88 wl_list_insert(list.prev, &e3.link);
89 wl_list_insert(list.prev, &e4.link);
141 wl_list_insert(list.prev, &e2.link);
142 wl_list_insert(list.prev, &e3.link);
163 wl_list_insert(list.prev, &e2.link)
[all...] |
| /external/expat/tests/ |
| memcheck.c | 45 struct allocation_entry * prev; member in struct:allocation_entry
76 entry->prev = NULL;
79 entry->prev = alloc_tail;
114 if (entry->prev != NULL)
115 entry->prev->next = entry->next;
119 entry->next->prev = entry->prev;
163 entry->prev = NULL;
166 entry->prev = alloc_tail;
|
| /external/v8/src/crankshaft/ |
| hydrogen-store-elimination.cc | 62 HStoreNamedField* prev = unobserved_.at(i); local
63 if (aliasing_->MustAlias(object, prev->object()->ActualValue()) &&
64 prev->CanBeReplacedWith(store)) {
66 prev->DeleteAndReplaceWith(NULL);
68 prev->id(), store->id()));
86 HStoreNamedField* prev = unobserved_.at(i); local
87 if (aliasing_->MayAlias(object, prev->object()->ActualValue()) &&
88 load->access().Equals(prev->access())) {
89 TRACE(("-- Observed store S%d by load L%d\n", prev->id(), load->id()));
|
| /external/skia/include/private/ |
| SkWeakRefCnt.h | 87 int32_t prev = fRefCnt.load(std::memory_order_relaxed); local
89 if (0 == prev) {
92 } while(!fRefCnt.compare_exchange_weak(prev, prev+1, std::memory_order_acquire,
94 return prev;
|
| /external/skqp/include/private/ |
| SkWeakRefCnt.h | 87 int32_t prev = fRefCnt.load(std::memory_order_relaxed); local
89 if (0 == prev) {
92 } while(!fRefCnt.compare_exchange_weak(prev, prev+1, std::memory_order_acquire,
94 return prev;
|
| /external/compiler-rt/test/tsan/ |
| barrier.cc | 21 int *prev = data[i % 2]; local
23 int left = idx - 1 >= 0 ? prev[idx - 1] : 0;
24 int right = idx + 1 < kSize ? prev[idx + 1] : 0;
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| GroupedLinkedMap.java | 50 LinkedEntry<K, V> last = head.prev;
66 last = last.prev;
91 entry.prev = head;
99 entry.prev = head.prev;
105 entry.next.prev = entry;
106 entry.prev.next = entry;
110 entry.prev.next = entry.next;
111 entry.next.prev = entry.prev;
118 LinkedEntry<K, V> prev; field in class:GroupedLinkedMap.LinkedEntry
[all...] |
| /external/syslinux/core/thread/ |
| timeout.c | 30 block->list.next->prev = block->list.prev;
31 block->list.prev->next = block->list.next;
|
