Searched refs:prev (Results 51 - 75 of 1047) sorted by relevance

1234567891011>>

/external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/lib/tree_adapters/
H A Dhtmlparser2.js17 previousSibling: 'prev',
68 prev: null,
96 prev: null,
106 prev: null,
116 prev: null,
163 var prev = parentNode.children[parentNode.children.length - 1];
165 if (prev) {
166 prev.next = newNode;
167 newNode.prev = prev;
[all...]
/external/icu/icu4c/source/i18n/
H A Dbocsu.cpp90 * code points. Lexical order is preserved if "prev" is always moved
93 * Additionally, "prev" is moved from anywhere in the Unihan
99 u_writeIdenticalLevelRun(UChar32 prev, const UChar *s, int32_t length, icu::ByteSink &sink) { argument
117 if(prev<0x4e00 || prev>=0xa000) {
118 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
124 prev=0x9fff-SLOPE_REACH_POS_2;
131 prev=0;
133 p=u_writeDiff(c-prev,
[all...]
/external/okhttp/okio/okio/src/main/java/okio/
H A DAsyncTimeout.java95 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 !
[all...]
/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/v8/src/
H A Dfunc-name-inferrer.cc54 int pos, const AstString* prev) {
55 if (pos >= names_stack_.length()) return prev;
60 return MakeNameFromStackHelper(pos + 1, prev);
62 if (prev->length() > 0) {
64 if (prev->length() + name->length() + 1 > String::kMaxLength) return prev;
67 curr = ast_value_factory_->NewConsString(prev, curr);
53 MakeNameFromStackHelper( int pos, const AstString* prev) argument
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/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/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/boringssl/src/crypto/x509v3/
H A Dtabtest.c76 int i, prev = -1, bad = 0; local
84 if((*tmp)->ext_nid < prev) bad = 1;
85 prev = (*tmp)->ext_nid;
/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/clang/test/CoverageMapping/
H A Dloopmacro.c14 prev[(s) & WMASK] = match_head = head[ins_h], \
40 int prev[32<<10] = { 0 }; local
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.h112 u32 prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local
113 DCHECK_NE(prev & kWriteLock, 0);
114 (void)prev;
118 u32 prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local
119 if ((prev & kWriteLock) == 0)
125 u32 prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local
126 DCHECK_EQ(prev & kWriteLock, 0);
127 DCHECK_GT(prev & ~kWriteLock, 0);
128 (void)prev;
164 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/src/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/pathops/
H A DSkOpSpan.cpp43 SkOpPtT* SkOpPtT::prev() { function in class:SkOpPtT
54 SkOpPtT* prev = this; local
56 SkOpPtT* next = prev->fNext;
58 prev->removeNext(this);
59 SkASSERT(prev->fNext != prev);
61 return prev;
63 prev = next;
64 } while (prev != this);
150 SkOpPtT* prev local
213 initBase(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) argument
275 SkOpSpan* prev = this->prev(); local
286 init(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) argument
[all...]
/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...]
/external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/
H A DPrimitiveGroup.java71 int prev = -1;
74 if (indices[i] == prev) {
77 prev = -1;
79 prev = indices[i];
/external/linux-tools-perf/src/tools/perf/util/include/linux/
H A Dtypes.h18 struct list_head *next, *prev; member in struct:list_head
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.h27 struct nouveau_heap *prev; member in struct:nouveau_heap
/external/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/skia/src/core/
H A DSkRefDict.cpp46 Impl* prev = NULL; local
57 if (prev) {
58 prev->fNext = rec->fNext;
66 prev = rec;

Completed in 979 milliseconds

1234567891011>>