| /external/chromium_org/third_party/skia/src/core/ |
| SkRefDict.cpp | 46 Impl* prev = NULL; local
57 if (prev) {
58 prev->fNext = rec->fNext;
66 prev = rec;
|
| SkLazyFnPtr.h | 54 F prev = (F)sk_atomic_cas(&fPtr, NULL, (void*)fn); local
56 // If prev != NULL, someone snuck in and set fPtr concurrently.
57 // If prev == NULL, we did write fn to fPtr.
58 return prev != NULL ? prev : fn;
|
| /external/chromium_org/v8/src/ |
| hydrogen-escape-analysis.h | 33 HCapturedObject* NewState(HInstruction* prev);
34 HCapturedObject* NewStateForAllocation(HInstruction* prev);
35 HCapturedObject* NewStateForLoopHeader(HInstruction* prev, HCapturedObject*);
36 HCapturedObject* NewStateCopy(HInstruction* prev, HCapturedObject* state);
|
| func-name-inferrer.cc | 56 Handle<String> prev) {
57 if (pos >= names_stack_.length()) return prev;
62 return MakeNameFromStackHelper(pos + 1, prev);
64 if (prev->length() > 0) {
66 if (prev->length() + name->length() + 1 > String::kMaxLength) return prev;
70 curr = factory->NewConsString(prev, curr).ToHandleChecked();
|
| hydrogen-store-elimination.cc | 61 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()));
|
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| AtomicDoubleTest.java | 100 double prev = Math.E; local
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; local
139 AtomicDouble at = new AtomicDouble(prev);
141 assertBitEquals(prev, at.get());
143 assertBitEquals(prev, at.get())
156 double prev = Math.E; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
| types.h | 18 struct list_head *next, *prev; member in struct:list_head
|
| /external/skia/samplecode/ |
| TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|
| /external/skia/src/core/ |
| SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
| SkRefDict.cpp | 46 Impl* prev = NULL; local
57 if (prev) {
58 prev->fNext = rec->fNext;
66 prev = rec;
|
| SkLazyFnPtr.h | 54 F prev = (F)sk_atomic_cas(&fPtr, NULL, (void*)fn); local
56 // If prev != NULL, someone snuck in and set fPtr concurrently.
57 // If prev == NULL, we did write fn to fPtr.
58 return prev != NULL ? prev : fn;
|
| /external/chromium_org/base/ |
| atomicops_internals_arm64_gcc.h | 38 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/third_party/protobuf/src/google/protobuf/stubs/ |
| atomicops_internals_arm64_gcc.h | 55 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/libunwind/src/mi/ |
| dyn-cancel.c | 35 if (di->prev)
36 di->prev->next = di->next;
41 di->next->prev = di->prev;
45 di->next = di->prev = NULL;
|
| /frameworks/base/core/jni/android/graphics/ |
| AutoDecodeCancel.cpp | 35 AutoDecoderCancel* prev = fPrev; local
38 if (prev) {
39 SkASSERT(prev->fNext == this);
40 prev->fNext = next;
47 next->fPrev = prev;
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| rankings.cc | 258 if (head.Data()->prev != my_head.value() && // Normal path.
259 head.Data()->prev != node->address().value()) { // FinishInsert().
264 head.Data()->prev = node->address().value();
271 node->Data()->prev = node->address().value();
294 // y, prev is x and next is z):
304 // 3. a(x, b), r(a, b), b(a, y), head(x), tail(y) prev.Store()
311 // 4. r(0, 0), b(b, y), head(b), tail(y) prev.Store()
316 // 3. a(x, a), r(a, r), head(x), tail(a) prev.Store()
320 node->Data()->next, node->Data()->prev, list);
326 Addr prev_addr(node->Data()->prev);
833 CacheAddr prev = forward ? node->Data()->prev : node->Data()->next; local
[all...] |
| /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...] |
| dct.h | 80 void idct_rowzmv(Short *srce, UChar *rec, UChar *prev, Int lx);
81 void idct_row0zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
82 void idct_row1zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
83 void idct_row2zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
84 void idct_row3zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
85 void idct_row4zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
86 void idct_row0x40zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
87 void idct_row0x20zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
88 void idct_row0x10zmv(Short *blk, UChar *rec, UChar *prev, Int lx);
89 void idct_row0xCCzmv(Short *blk, UChar *rec, UChar *prev, Int lx)
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| InsnList.java | 228 next.prev = insn;
232 AbstractInsnNode prev = location.prev;
local
233 insn.prev = prev;
234 if (prev != null) {
235 prev.next = insn;
247 location.prev = null;
269 insn.prev = last;
297 elem.prev = last;
435 AbstractInsnNode prev = location.prev; local
468 AbstractInsnNode prev = location .prev; local
496 AbstractInsnNode prev = insn.prev; local
567 AbstractInsnNode prev; field in class:InsnList.InsnListIterator
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
| lru_cache.py | 30 self.prev = None
61 self._last.prev = None
63 node.prev = self._first
82 next_last.prev = None
84 next_first.prev = self._first
92 node.next.prev = node.prev
93 node.prev.next = node.next
94 node.prev = self._first
108 self._first = node.prev
[all...] |
| /external/libcxxabi/src/ |
| fallback_malloc.ipp | 87 heap_node *p, *prev;
95 for (p = freelist, prev = 0;
96 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {
109 if (prev == 0)
112 prev->next_node = p->next_node;
125 struct heap_node *p, *prev;
133 for (p = freelist, prev = 0;
134 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {
154 if ( prev == 0 ) {
159 prev->next_node = offset_from_node(cp)
[all...] |
| /frameworks/base/libs/hwui/ |
| DamageAccumulator.cpp | 43 DirtyStack* prev; member in struct:android::uirenderer::DirtyStack
51 mHead->prev = mHead;
56 if (currentFrame->prev != currentFrame) {
57 computeTransformImpl(currentFrame->prev, outMatrix);
83 nextFrame->prev = mHead;
103 LOG_ALWAYS_FATAL_IF(mHead->prev == mHead, "Cannot pop the root frame!");
105 mHead = mHead->prev;
144 while (frame->prev != frame) {
145 frame = frame->prev;
155 while (frame->prev != frame)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/ |
| fallback_malloc.ipp | 87 heap_node *p, *prev;
95 for (p = freelist, prev = 0;
96 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {
109 if (prev == 0)
112 prev->next_node = p->next_node;
125 struct heap_node *p, *prev;
133 for (p = freelist, prev = 0;
134 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {
154 if ( prev == 0 ) {
159 prev->next_node = offset_from_node(cp)
[all...] |
| /bionic/libc/bionic/ |
| pthread_internals.cpp | 40 thread->next->prev = thread->prev;
42 if (thread->prev != NULL) {
43 thread->prev->next = thread->next;
60 thread->prev = NULL;
62 thread->next->prev = thread;
|
| /bionic/libc/private/ |
| bionic_atomic_arm64.h | 46 int32_t prev, status; local
52 : "=&r" (prev), "=&r" (status), "+o" (*ptr)
55 return prev;
60 int32_t prev, tmp, status; local
66 : "=&r" (prev), "=&r" (tmp), "=&r" (status), "+m"(*ptr)
69 return prev;
|
