Searched refs:prev (Results 76 - 100 of 1447) sorted by relevance

1234567891011>>

/external/e2fsprogs/lib/ext2fs/
H A Dunlink.c26 struct ext2_dir_entry *prev; member in struct:link_struct
40 struct ext2_dir_entry *prev; local
42 prev = ls->prev;
43 ls->prev = dirent;
60 prev->rec_len += dirent->rec_len;
90 ls.prev = 0;
/external/chromium_org/third_party/freetype/src/cache/
H A Dftcmru.c37 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/freetype/src/cache/
H A Dftcmru.c37 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/
H A Dlinux_list.h48 * 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, hea
72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
174 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen-store-elimination.cc61 HStoreNamedField* prev = unobserved_.at(i); local
62 if (aliasing_->MustAlias(object, prev->object()->ActualValue()) &&
63 prev->CanBeReplacedWith(store)) {
65 prev->DeleteAndReplaceWith(NULL);
67 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()));
H A Dhydrogen-escape-analysis.h33 HCapturedObject* NewState(HInstruction* prev);
34 HCapturedObject* NewStateForAllocation(HInstruction* prev);
35 HCapturedObject* NewStateForLoopHeader(HInstruction* prev, HCapturedObject*);
36 HCapturedObject* NewStateCopy(HInstruction* prev, HCapturedObject* state);
/external/chromium_org/v8/src/base/
H A Datomicops_internals_arm64_gcc.h28 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...]
/external/chromium_org/components/policy/core/common/
H A Dpolicy_service.cc35 const base::Value* prev = previous.GetValue(it->first); local
37 if (!base::Value::Equals(prev, cur))
38 it->second.Run(prev, cur);
/external/chromium_org/net/disk_cache/blockfile/
H A Drankings.cc260 if (head.Data()->prev != my_head.value() && // Normal path.
261 head.Data()->prev != node->address().value()) { // FinishInsert().
266 head.Data()->prev = node->address().value();
273 node->Data()->prev = node->address().value();
296 // y, prev is x and next is z):
306 // 3. a(x, b), r(a, b), b(a, y), head(x), tail(y) prev.Store()
313 // 4. r(0, 0), b(b, y), head(b), tail(y) prev.Store()
318 // 3. a(x, a), r(a, r), head(x), tail(a) prev.Store()
322 node->Data()->next, node->Data()->prev, list);
328 Addr prev_addr(node->Data()->prev);
747 CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev, CacheRankingsBlock* next, List* list) argument
788 CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next) argument
835 CacheAddr prev = forward ? node->Data()->prev : node->Data()->next; local
[all...]
/external/compiler-rt/test/tsan/
H A Dbarrier.cc18 int *prev = data[i % 2]; local
20 int left = idx - 1 >= 0 ? prev[idx - 1] : 0;
21 int right = idx + 1 < kSize ? prev[idx + 1] : 0;
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DGroupedLinkedMap.java50 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/doclava/src/com/google/doclava/
H A DSourcePositionInfo.java45 char prev = 0;
48 if (c == '\r' || (c == '\n' && prev != '\r')) {
51 prev = c;
61 int prev = 0;
64 if ((c == '\r' && prev != '\n') || (c == '\n')) {
67 prev = c;
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/
H A Dcleanup.c89 pthread_setspecific (ptw32_cleanupKey, (void *) cleanup->prev);
144 cleanup->prev = (ptw32_cleanup_t *) pthread_getspecific (ptw32_cleanupKey);
H A Dpthread_cond_destroy.c202 cv->prev->next = cv->next;
207 ptw32_cond_list_tail = cv->prev;
211 cv->next->prev = cv->prev;
/external/chromium_org/third_party/skia/src/gpu/
H A DGrMemoryPool.cpp81 BlockHeader* prev = block->fPrev; local
83 SkASSERT(prev);
84 prev->fNext = next;
86 next->fPrev = prev;
89 fTail = prev;
124 BlockHeader* prev = NULL; local
129 SkASSERT(prev == block->fPrev);
130 if (prev) {
131 SkASSERT(prev->fNext == block);
156 prev
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.h106 u32 prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local
107 DCHECK_NE(prev & kWriteLock, 0);
108 (void)prev;
112 u32 prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local
113 if ((prev & kWriteLock) == 0)
119 u32 prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local
120 DCHECK_EQ(prev & kWriteLock, 0);
121 DCHECK_GT(prev & ~kWriteLock, 0);
122 (void)prev;
158 u32 prev local
[all...]
H A Dsanitizer_atomic_msvc.h177 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/linux-tools-perf/perf-3.12.0/include/linux/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
27 list->prev = list;
34 * the prev/next entries already!
38 struct list_head *prev,
41 next->prev = new;
43 new->prev = prev;
44 prev->next = new;
48 struct list_head *prev,
76 __list_add(new, head->prev, hea
37 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
86 __list_del(struct list_head * prev, struct list_head * next) argument
273 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
[all...]
/external/skia/src/gpu/
H A DGrMemoryPool.cpp81 BlockHeader* prev = block->fPrev; local
83 SkASSERT(prev);
84 prev->fNext = next;
86 next->fPrev = prev;
89 fTail = prev;
124 BlockHeader* prev = NULL; local
129 SkASSERT(prev == block->fPrev);
130 if (NULL != prev) {
131 SkASSERT(prev->fNext == block);
156 prev
[all...]
/external/chromium_org/base/
H A Datomicops_internals_arm64_gcc.h38 Atomic32 prev; local
43 "ldxr %w[prev], %[ptr] \n\t" // Load the previous value.
44 "cmp %w[prev], %w[old_value] \n\t"
49 : [prev]"=&r" (prev),
57 return prev;
113 Atomic32 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
116 return prev;
123 Atomic32 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
125 return prev;
174 Atomic64 prev; local
249 Atomic64 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
259 Atomic64 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
[all...]
/external/chromium_org/chrome/browser/spellchecker/
H A Dword_trimmer.cc28 word_offset[keep] = iter.prev();
29 if ((*start >= iter.prev() && *start < iter.pos()) ||
30 (end > iter.prev() && end <= iter.pos())) {
40 if (iter.prev() > end && keep) {
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/
H A Dnouveau_heap.h27 struct nouveau_heap *prev; member in struct:nouveau_heap
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
H A Datomicops_internals_arm64_gcc.h55 Atomic32 prev; local
60 "ldxr %w[prev], %[ptr] \n\t" // Load the previous value.
61 "cmp %w[prev], %w[old_value] \n\t"
66 : [prev]"=&r" (prev),
74 return prev;
130 Atomic32 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
133 return prev;
140 Atomic32 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
142 return prev;
191 Atomic64 prev; local
266 Atomic64 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
276 Atomic64 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); local
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkRefDict.cpp46 Impl* prev = NULL; local
57 if (prev) {
58 prev->fNext = rec->fNext;
66 prev = rec;
/external/guava/guava-tests/test/com/google/common/util/concurrent/
H A DAtomicDoubleTest.java100 double prev = Math.E;
102 AtomicDouble at = new AtomicDouble(prev);
104 assertBitEquals(prev, at.get());
106 assertBitEquals(prev, at.get());
107 assertTrue(at.compareAndSet(prev, x));
109 prev = x;
137 double prev = Math.E;
139 AtomicDouble at = new AtomicDouble(prev);
141 assertBitEquals(prev, at.get());
143 assertBitEquals(prev, a
[all...]

Completed in 857 milliseconds

1234567891011>>