| /external/squashfs-tools/squashfs-tools/ |
| D | caches-queues-lists.h | 31 entry->NAME##_prev = (*list)->NAME##_prev; \
32 (*list)->NAME##_prev->NAME##_next = entry; \
33 (*list)->NAME##_prev = entry; \
36 entry->NAME##_prev = entry->NAME##_next = entry; \
43 if(entry->NAME##_prev == entry && entry->NAME##_next == entry) { \
46 } else if(entry->NAME##_prev != NULL && entry->NAME##_next != NULL) { \
48 entry->NAME##_next->NAME##_prev = entry->NAME##_prev; \
49 entry->NAME##_prev->NAME##_next = entry->NAME##_next; \
53 entry->NAME##_prev = entry->NAME##_next = NULL; \
64 entry->LINK##_prev = NULL; \
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/js/src/internal/ |
| D | LinkedList.kt | 20 @PublishedApi internal var _prev = this variable in kotlinx.coroutines.internal.LinkedListNode
24 public inline val prevNode get() = _prev
28 val prev = this._prev in addLast()
30 node._prev = prev in addLast()
32 this._prev = node in addLast()
37 val prev = this._prev in remove()
40 next._prev = prev in remove()
58 if (!predicate(_prev)) return false in addLastIfPrev()
68 if (!predicate(_prev)) return false in addLastIfPrevAndIf()
98 override val affectedNode: Node get() = queue._prev
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/native/src/internal/ |
| D | LinkedList.kt | 20 @PublishedApi internal var _prev = this variable in kotlinx.coroutines.internal.LinkedListNode
24 public inline val prevNode get() = _prev
28 val prev = this._prev in addLast()
30 node._prev = prev in addLast()
32 this._prev = node in addLast()
37 val prev = this._prev in remove()
40 next._prev = prev in remove()
58 if (!predicate(_prev)) return false in addLastIfPrev()
68 if (!predicate(_prev)) return false in addLastIfPrevAndIf()
98 override val affectedNode: Node get() = queue._prev
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/src/internal/ |
| D | LockFreeLinkedList.kt | 63 private val _prev = atomic(this) // Node to the left (cannot be marked as removed) in <lambda>() constant
110 get() = correctPrev(null) ?: findPrevNonRemoved(_prev.value) in <lambda>()
114 return findPrevNonRemoved(current._prev.value) in <lambda>()
120 node._prev.lazySet(this) in <lambda>()
211 node._prev.lazySet(this) in <lambda>()
222 node._prev.lazySet(this) in <lambda>()
316 assert { node._next.value === node && node._prev.value === node } in <lambda>()
339 node._prev.compareAndSet(node, affected) in <lambda>()
542 next._prev.loop { nextPrev -> in <lambda>()
544 if (next._prev.compareAndSet(nextPrev, this)) { in <lambda>()
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/common/src/internal/ |
| D | ConcurrentLinkedList.kt | 96 private val _prev = atomic(prev) constant
125 val prev: N? get() = _prev.value in trySetNext()
130 fun cleanPrev() { _prev.lazySet(null) } in trySetNext()
158 next._prev.value = prev in markAsClosed()
171 cur = cur._prev.value
|
| /external/llvm-project/llvm/test/MC/MachO/ |
| D | darwin-x86_64-reloc.s | 33 _prev: label
42 .quad L1 - _prev
|
| /external/llvm/test/MC/MachO/ |
| D | darwin-x86_64-reloc.s | 33 _prev: label
42 .quad L1 - _prev
|
| /external/tinyxml2/ |
| D | tinyxml2.cpp | 770 _prev( 0 ), _next( 0 ), in XMLNode()
835 _lastChild = _lastChild->_prev; in Unlink()
838 if ( child->_prev ) { in Unlink()
839 child->_prev->_next = child->_next; in Unlink()
842 child->_next->_prev = child->_prev; in Unlink()
845 child->_prev = 0; in Unlink()
856 TIXMLASSERT(node->_prev == 0); in DeleteChild()
876 addThis->_prev = _lastChild; in InsertEndChild()
885 addThis->_prev = 0; in InsertEndChild()
904 TIXMLASSERT( _firstChild->_prev == 0 ); in InsertFirstChild()
[all …]
|
| D | tinyxml2.h | 800 return _prev; in PreviousSibling()
804 return _prev; in PreviousSibling()
956 XMLNode* _prev; variable
|
| /external/fastrpc/inc/ |
| D | uthash.h | 271 char *_prev; \
278 _prev = NULL; \
280 if (_prev != (char*)(_thh->hh_prev)) { \
282 _thh->hh_prev, _prev ); \
285 _prev = (char*)(_thh); \
300 _prev = NULL; \
304 if (_prev !=(char*)(_thh->prev)) { \
306 _thh->prev, _prev ); \
308 _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \
|
| /external/libdrm/intel/ |
| D | uthash.h | 406 char *_prev; \
411 _prev = NULL; \
413 if (_prev != (char*)(_thh->hh_prev)) { \
415 _thh->hh_prev, _prev ); \
418 _prev = (char*)(_thh); \
433 _prev = NULL; \
437 if (_prev !=(char*)(_thh->prev)) { \
439 _thh->prev, _prev ); \
441 _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \
|
| /external/rust/crates/quote/src/ |
| D | spanned.rs | 39 iter.fold(None, |_prev, next| Some(next)) in join_spans()
|
| /external/sfntly/cpp/src/test/tinyxml/ |
| D | tinyxml.h | 619 TiXmlNode* PreviousSibling( const char *_prev ) { in PreviousSibling() argument
620 …return const_cast< TiXmlNode* >( (const_cast< const TiXmlNode* >(this))->PreviousSibling( _prev ) … in PreviousSibling()
|
| /external/rust/crates/parking_lot_core/src/ |
| D | parking_lot.rs | 41 _prev: *const HashTable, field
60 _prev: prev, in new()
|