/external/squashfs-tools/squashfs-tools/ |
D | caches-queues-lists.h | 30 entry->NAME##_next = *list; \ 32 (*list)->NAME##_prev->NAME##_next = 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; \ 51 *list = entry->NAME##_next; \ 53 entry->NAME##_prev = entry->NAME##_next = NULL; \ 62 entry->LINK##_next = container->hash_table[hash]; \ [all …]
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/js/src/internal/ |
D | LinkedList.kt | 19 @PublishedApi internal var _next = this variable in kotlinx.coroutines.internal.LinkedListNode 23 public inline val nextNode get() = _next 29 node._next = this in addLast() 31 prev._next = node in addLast() 38 val next = this._next in remove() 39 prev._next = next in remove() 46 if (_next !== this) return false in addOneIfEmpty() 77 val next = _next in removeFirstOrNull() 84 val next = _next in removeFirstIfIsInstanceOfOrPeekIf() 155 public val isEmpty get() = _next === this [all …]
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/native/src/internal/ |
D | LinkedList.kt | 19 @PublishedApi internal var _next = this variable in kotlinx.coroutines.internal.LinkedListNode 23 public inline val nextNode get() = _next 29 node._next = this in addLast() 31 prev._next = node in addLast() 38 val next = this._next in remove() 39 prev._next = next in remove() 46 if (_next !== this) return false in addOneIfEmpty() 77 val next = _next in removeFirstOrNull() 84 val next = _next in removeFirstIfIsInstanceOfOrPeekIf() 155 public val isEmpty get() = _next === this [all …]
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/src/internal/ |
D | LockFreeLinkedList.kt | 62 private val _next = atomic<Any>(this) // Node | Removed | OpDescriptor in <lambda>() constant 78 if (update != null && affected._next.compareAndSet( this, update)) { in <lambda>() 95 _next.loop { next -> in <lambda>() 121 node._next.lazySet(this) in <lambda>() 125 if (_next.compareAndSet(this, node)) { in <lambda>() 212 node._next.lazySet(next) in <lambda>() 213 if (!_next.compareAndSet(next, node)) return false in <lambda>() 223 node._next.lazySet(next) in <lambda>() 225 if (!_next.compareAndSet(next, condAdd)) return UNDECIDED in <lambda>() 251 if (_next.compareAndSet(next, removed)) { in <lambda>() [all …]
|
/external/kmod/libkmod/python/kmod/ |
D | list.pyx | 29 self._next = NULL 36 self._next = self.list 40 if self._next is NULL: 43 mli.list = self._next 44 self._next = _libkmod_h.kmod_list_next(self.list, self._next)
|
/external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/deser/ |
D | CyclicTypesDeserTest.java | 17 Bean _next; field in CyclicTypesDeserTest.Bean 22 public void setNext(Bean b) { _next = b; } in setNext() 71 Bean last = first._next; in testLinked() 74 assertNull(last._next); in testLinked()
|
/external/jackson-databind/src/main/java/com/fasterxml/jackson/databind/util/ |
D | PrimitiveArrayBuilder.java | 155 Node<T> _next; field in PrimitiveArrayBuilder.Node 172 public Node<T> next() { return _next; } in next() 176 if (_next != null) { // sanity check in linkNext() 179 _next = next; in linkNext()
|
D | TokenBuffer.java | 2052 protected Segment _next; field in TokenBuffer.Segment 2100 public Segment next() { return _next; } in next() 2118 _next = new Segment(); in append() 2119 _next.set(0, tokenType); in append() 2120 return _next; in append() 2130 _next = new Segment(); in append() 2131 _next.set(0, tokenType, objectId, typeId); in append() 2132 return _next; in append() 2141 _next = new Segment(); in append() 2142 _next.set(0, tokenType, value); in append() [all …]
|
/external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/ser/ |
D | CyclicTypeSerTest.java | 21 Bean _next; field in CyclicTypeSerTest.Bean 25 _next = next; in Bean() 29 public Bean getNext() { return _next; } in getNext() 32 public void assignNext(Bean n) { _next = n; } in assignNext()
|
/external/antlr/runtime/C/src/ |
D | antlr3rewritestreams.c | 45 static void * _next (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream); 231 stream->_next = _next; in antlr3RewriteRuleElementStreamNewAE() 579 el = stream->_next(stream); in nextTree() 585 el = stream->_next(stream); in nextTree() 594 return stream->_next(stream); in nextToken() 610 el = (pANTLR3_BASE_TREE)stream->_next(stream); in next() 615 return stream->_next(stream); in next() 625 _next (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream) in _next() function 769 …R3_BASE_TREE)stream->adaptor->create(stream->adaptor, (pANTLR3_COMMON_TOKEN)stream->_next(stream)); in nextNodeToken() 775 return (pANTLR3_BASE_TREE)stream->_next(stream); in nextNodeNode() [all …]
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/common/src/internal/ |
D | ConcurrentLinkedList.kt | 94 private val _next = atomic<Any?>(null) constant 98 private val nextOrClosed get() = _next.value 118 fun trySetNext(value: N): Boolean = _next.compareAndSet(null, value) in trySetNext() 135 fun markAsClosed() = _next.compareAndSet(null, CLOSED) in markAsClosed() 159 if (prev !== null) prev._next.value = next in markAsClosed()
|
/external/tinyxml2/ |
D | tinyxml2.cpp | 770 _prev( 0 ), _next( 0 ), in XMLNode() 832 _firstChild = _firstChild->_next; in Unlink() 839 child->_prev->_next = child->_next; in Unlink() 841 if ( child->_next ) { in Unlink() 842 child->_next->_prev = child->_prev; in Unlink() 844 child->_next = 0; in Unlink() 857 TIXMLASSERT(node->_next == 0); in DeleteChild() 874 TIXMLASSERT( _lastChild->_next == 0 ); in InsertEndChild() 875 _lastChild->_next = addThis; in InsertEndChild() 879 addThis->_next = 0; in InsertEndChild() [all …]
|
/external/grpc-grpc/src/python/grpcio_testing/grpc_testing/_server/ |
D | _service.py | 24 def _next(self): member in _RequestIterator 39 return self._next() 42 return self._next()
|
/external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/ |
D | RewriteRuleElementStream.js | 82 el = this._next(); 86 el = this._next(); 96 _next: function() {
|
D | RewriteRuleTokenStream.js | 10 var t = this._next(); 15 return this._next();
|
D | RewriteRuleSubtreeStream.js | 27 el = this._next(); 31 el = this._next();
|
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
D | RewriteRuleElementStream.java | 141 Object el = _next(); in nextTree() 145 Object el = _next(); in nextTree() 155 protected Object _next() { in _next() method in RewriteRuleElementStream
|
D | RewriteRuleTokenStream.java | 58 Token t = (Token)_next(); in nextNode() 63 return (Token)_next(); in nextToken()
|
D | RewriteRuleSubtreeStream.java | 73 Object el = _next(); in nextNode() 77 Object tree = _next(); in nextNode()
|
/external/antlr/runtime/Cpp/include/ |
D | antlr3rewritestreams.inl | 136 RewriteRuleElementStream<ImplTraits, SuperType>::_next() function in RewriteRuleElementStream 197 el = this->_next(); 203 el = this->_next(); 211 return this->_next(); 223 el = this->_next(); 226 return this->_next(); 289 return BaseType::m_adaptor->create(this->_next());
|
/external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/bench/ |
D | jsmin.py | 96 def _next(self): member in JavascriptMinify 148 self.theB = self._next() 168 self.theB = self._next()
|
/external/grpc-grpc/src/python/grpcio_tests/tests/unit/ |
D | _channel_close_test.py | 64 def _next(self): member in _Pipe 74 return self._next() 77 return self._next()
|
/external/grpc-grpc/src/python/grpcio_tests/tests/testing/ |
D | _client_application.py | 74 def _next(self): member in _Pipe 85 return self._next() 88 return self._next()
|
/external/antlr/runtime/ObjC/Framework/ |
D | RewriteRuleNodeStream.m | 58 return [treeAdaptor dupNode:[self _next]]; 60 return [self _next];
|
/external/grpc-grpc/src/python/grpcio/grpc/_cython/_cygrpc/ |
D | completion_queue.pyx.pxi | 23 cdef grpc_event _next(grpc_completion_queue *c_completion_queue, deadline): function 66 cdef grpc_event c_event = _next(c_completion_queue, deadline) 95 return self._interpret_event(_next(self.c_completion_queue, deadline))
|