/external/chromium_org/ui/app_list/search/ |
H A D | term_break_iterator.h | 40 size_t prev() const { return prev_; } function in class:app_list::TermBreakIterator
|
/external/chromium_org/v8/src/base/ |
H A D | atomicops_internals_arm64_gcc.h | 28 Atomic32 prev; local 33 "ldxr %w[prev], %[ptr] \n\t" // Load the previous value. 34 "cmp %w[prev], %w[old_value] \n\t" 39 : [prev]"=&r" (prev), 47 return prev; 105 Atomic32 prev; local 107 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); 110 return prev; 116 Atomic32 prev; local 178 Atomic64 prev; local 255 Atomic64 prev; local 266 Atomic64 prev; local [all...] |
H A D | atomicops_internals_mips64_gcc.h | 49 Atomic32 prev, tmp; local 53 "ll %0, %5\n" // prev = *ptr 54 "bne %0, %3, 2f\n" // if (prev != old_value) goto 2 61 : "=&r" (prev), "=m" (*ptr), "=&r" (tmp) 64 return prev; 186 Atomic64 prev, tmp; local 190 "lld %0, %5\n" // prev = *ptr 191 "bne %0, %3, 2f\n" // if (prev != old_value) goto 2 198 : "=&r" (prev), "=m" (*ptr), "=&r" (tmp) 201 return prev; [all...] |
H A D | atomicops_internals_mips_gcc.h | 26 Atomic32 prev, tmp; local 30 "ll %0, 0(%4)\n" // prev = *ptr 31 "bne %0, %2, 2f\n" // if (prev != old_value) goto 2 38 : "=&r" (prev), "=&r" (tmp) 41 return prev;
|
H A D | atomicops_internals_x86_gcc.h | 33 Atomic32 prev; local 35 : "=a" (prev) 38 return prev; 165 Atomic64 prev; local 167 : "=a" (prev) 170 return prev;
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-atomicops.cc | 115 AtomicType prev = NoBarrier_CompareAndSwap(&value, 0, 1); local 117 CHECK_EQU(0, prev); 124 prev = NoBarrier_CompareAndSwap(&value, 0, 5); 126 CHECK_EQU(k_test_val, prev); 129 prev = NoBarrier_CompareAndSwap(&value, k_test_val, 5); 131 CHECK_EQU(k_test_val, prev);
|
H A D | test-threads.cc | 162 ThreadIdValidationThread* prev = NULL; local 165 new ThreadIdValidationThread(prev, &refs, i, &semaphore); 167 prev = newThread; 170 prev->Start();
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_atomic_msvc.h | 177 u8 prev; local 183 mov prev, al local 185 if (prev == cmpv) 187 *cmp = prev; 196 uptr prev = (uptr)_InterlockedCompareExchangePointer( local 198 if (prev == cmpv) 200 *cmp = prev; 209 u16 prev = (u16)_InterlockedCompareExchange16( local 211 if (prev == cmpv) 213 *cmp = prev; 222 u32 prev = (u32)_InterlockedCompareExchange( local 235 u64 prev = (u64)_InterlockedCompareExchange64( local [all...] |
/external/e2fsprogs/lib/blkid/ |
H A D | 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, hea 40 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument 83 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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 21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 32 * the prev/next entries already! 35 struct list_head * prev, 38 next->prev = new; 40 new->prev = prev; 41 prev->next = new; 57 __list_add(new, head->prev, hea 34 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument 67 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/f2fs-tools/include/ |
H A D | list.h | 14 struct list_head *next, *prev; member in struct:list_head 25 list->prev = list; 29 struct list_head *prev, 32 next->prev = new; 34 new->prev = prev; 35 prev->next = new; 45 __list_add(new, head->prev, head); 48 static inline void __list_del(struct list_head * prev, struct list_head * next) argument 50 next->prev 28 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument [all...] |
/external/fio/ |
H A D | 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, hea 46 __flist_add(struct flist_head *new_entry, struct flist_head *prev, struct flist_head *next) argument 83 __flist_del(struct flist_head *prev, struct flist_head * next) argument 122 __flist_splice(const struct flist_head *list, struct flist_head *prev, struct flist_head *next) argument [all...] |
/external/freetype/src/cache/ |
H A D | 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/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
H A D | 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/icu/icu4c/source/i18n/ |
H A D | nortrans.cpp | 139 int32_t prev = start; local 151 start=prev; 160 text.handleReplaceBetween(prev, start, normalized); 163 int32_t delta = normalized.length() - (start - prev);
|
/external/libnl/include/netlink/ |
H A D | 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; 27 __nl_list_add(struct nl_list_head *obj, struct nl_list_head *prev, struct nl_list_head *next) argument [all...] |
/external/libvpx/libvpx/vpx_mem/include/ |
H A D | vpx_mem_tracker.h | 31 struct mem_block *prev, member in struct:mem_block
|
/external/ltrace/sysdeps/linux-gnu/ |
H A D | events.c | 82 Event * prev = delayed_events; local 84 for (event = prev; event != NULL; ) { 87 prev = event; 100 end_delayed_events = prev; 104 prev->next = event->next;
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | 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/drivers/llvmpipe/ |
H A D | lp_state_setup.h | 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
|
/external/mesa3d/src/gallium/winsys/svga/drm/ |
H A D | vmw_fence.c | 177 int32_t prev = old; local 180 old = prev; 181 prev = p_atomic_cmpxchg(&vfence->signalled, old, old | vflags); 182 } while (prev != old); 221 int32_t prev = old; local 224 old = prev; 225 prev = p_atomic_cmpxchg(&vfence->signalled, old, old | vflags); 226 } while (prev != old);
|
/external/mesa3d/src/mesa/state_tracker/ |
H A D | st_atom.c | 186 struct st_state_flags examined, prev; local 188 prev = *state; 209 /* generated = (prev ^ state) 213 xor_states(&generated, &prev, state); 215 prev = *state;
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | AnnotationWriter.java | 84 AnnotationWriter prev;
field in class:AnnotationWriter 267 aw.prev = last;
276 aw = aw.prev;
304 aw.prev = last;
312 aw = aw.prev;
|
/external/openssl/crypto/aes/ |
H A D | aes_ige.c | 223 unsigned char prev[AES_BLOCK_SIZE]; local 247 memcpy(prev, in, AES_BLOCK_SIZE); 248 iv2 = prev; 273 memcpy(prev, tmp, AES_BLOCK_SIZE); 274 iv2 = prev;
|
/external/oprofile/libutil/ |
H A D | op_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 37 ptr->prev = ptr; 44 * the prev/next entries already! 47 struct list_head * prev, 50 next->prev = new_entry; 52 new_entry->prev = prev; 53 prev->next = new_entry; 79 __list_add(new_entry, head->prev, hea 46 __list_add(struct list_head * new_entry, struct list_head * prev, struct list_head * next) argument 89 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |