| /prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-arm/usr/include/linux/raid/ |
| xor.h | 20 struct xor_block_template *next; member in struct:xor_block_template
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-x86/usr/include/linux/raid/ |
| xor.h | 20 struct xor_block_template *next; member in struct:xor_block_template
|
| /system/extras/fatblock/ |
| fdpool.h | 22 struct pooled_fd *next; member in struct:pooled_fd
|
| /external/webkit/Source/WebCore/plugins/win/ |
| PluginMessageThrottlerWin.cpp | 56 m_inlineMessages[i].next = &m_inlineMessages[i + 1];
57 m_inlineMessages[NumInlineMessages - 1].next = 0;
63 PluginMessage* next; local
65 for (PluginMessage* message = m_front; message; message = next) {
66 next = message->next;
79 message->next = 0;
82 m_back->next = message;
104 m_front = m_front->next;
130 m_freeInlineMessages = message->next;
[all...] |
| /dalvik/vm/mterp/x86-atom/ |
| zcmp.S | 33 j${revcmp} ${opcode}_2f # goto next instruction or branch
43 FINISH_RB %edx, %ecx # jump to next instruction
50 movzbl 4(rPC), %edx # grab the next opcode
53 jmp *dvmAsmInstructionJmpTable(, %edx, 4) # jump to next instruction
|
| OP_CMPL_FLOAT.S | 41 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
50 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
55 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
59 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
63 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ReverseAxesWalker.java | 70 * Get the next node in document order on the axes.
72 * @return the next node in document order on the axes, or null.
79 int next = m_iterator.next(); local
84 if (DTM.NULL == next)
87 return next;
150 int next; local
152 while (DTM.NULL != (next = clone.nextNode()))
213 int next; local
215 while (DTM.NULL != (next = clone.nextNode())
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingIterator.java | 47 public T next() { method in class:ForwardingIterator
48 return delegate().next();
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AtomicDouble.java | 96 long next = doubleToRawLongBits(newValue); local
97 value = next;
108 // long next = doubleToRawLongBits(newValue);
109 // updater.lazySet(this, next);
119 long next = doubleToRawLongBits(newValue); local
120 return longBitsToDouble(updater.getAndSet(this, next));
171 long next = doubleToRawLongBits(nextVal); local
172 if (updater.compareAndSet(this, current, next)) {
189 long next = doubleToRawLongBits(nextVal); local
190 if (updater.compareAndSet(this, current, next)) {
[all...] |
| /external/hamcrest/src/org/hamcrest/internal/ |
| SelfDescribingValueIterator.java | 18 public SelfDescribing next() { method in class:SelfDescribingValueIterator
19 return new SelfDescribingValue<T>(values.next());
|
| /external/libusb-compat/examples/ |
| lsusb.c | 33 for (bus = busses; bus; bus = bus->next) {
35 for (dev = bus->devices; dev; dev = dev->next) {
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PVisitedNetworkIDParser.java | 135 char next = this.lexer.getNextChar(); local
136 if (next == '\"') {
139 } else if (next == '\0') {
141 } else if (next == '\\') {
142 retval.append(next);
143 next = this.lexer.getNextChar();
144 retval.append(next);
146 retval.append(next);
|
| /external/qemu/ |
| notify.c | 34 Notifier *notifier, *next; local
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
| /external/wpa_supplicant_6/wpa_supplicant/ |
| config_none.c | 48 for (ssid = config->ssid; ssid; ssid = ssid->next) {
52 for (blob = config->blobs; blob; blob = blob->next) {
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| config_none.c | 42 for (ssid = config->ssid; ssid; ssid = ssid->next) {
46 for (blob = config->blobs; blob; blob = blob->next) {
|
| /frameworks/base/core/java/android/os/ |
| MessageQueue.java | 44 // Indicates whether next() is blocked waiting in pollOnce() with a non-zero timeout.
47 // The next barrier token.
117 final Message next() { method in class:MessageQueue
132 // Try to retrieve the next message. Return if found.
137 // Stalled by a barrier. Find the next asynchronous message in the queue.
140 msg = msg.next;
145 // Next message is not ready. Set a timeout to wake up when it is ready.
151 prevMsg.next = msg.next;
153 mMessages = msg.next;
[all...] |
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
38 // node = node->next()) {
72 // A. Doubly-linked lists are made up of nodes that contain "next" and
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
116 LinkNode<T>* next() const { function in class:base::LinkNode
132 void set(LinkNode<T>* prev, LinkNode<T>* next) {
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| UnmodifiableListIteratorTest.java | 38 assertEquals("a", iterator.next());
49 assertEquals("a", iterator.next());
50 assertEquals("b", iterator.next());
62 assertEquals("a", iterator.next());
63 assertEquals("b", iterator.next());
81 public String next() { method
|
| /external/icu4c/layout/ |
| LEInsertionList.cpp | 17 InsertionRecord *next; member in struct:InsertionRecord
41 head = head->next;
73 insertion->next = NULL;
74 tail->next = insertion;
78 insertion->next = head;
87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {
|
| /libcore/luni/src/main/java/java/util/ |
| AbstractSequentialList.java | 44 int next = it.nextIndex(); local
46 it.add(colIt.next());
48 return next != it.nextIndex();
54 return listIterator(location).next();
72 E result = it.next();
86 E result = it.next();
|
| /external/valgrind/main/coregrind/m_gdbserver/ |
| inferiors.c | 44 new_inferior->next = NULL;
46 list->tail->next = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next; local
58 next = cur->next;
60 cur = next;
79 list->head = entry->next;
86 while (*cur && (*cur)->next != entry)
87 cur = &(*cur)->next;
92 (*cur)->next = entry->next
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicIntegerFieldUpdater.java | 147 int next = current + 1; local
148 if (compareAndSet(obj, current, next))
163 int next = current - 1; local
164 if (compareAndSet(obj, current, next))
180 int next = current + delta; local
181 if (compareAndSet(obj, current, next))
196 int next = current + 1; local
197 if (compareAndSet(obj, current, next))
198 return next;
212 int next = current - 1 local
229 int next = current + delta; local
[all...] |
| /external/elfutils/src/ |
| ldscript.y | 186 if ($3 != $3->next)
188 $3->next->group_start = 1;
205 $2->next = $1->next;
206 $$ = $1->next = $2;
221 $$->val.section.input = $3->next;
227 $3->next = NULL;
235 $$->val.section.input->next = NULL;
261 $2->next = $1->next;
[all...] |
| /external/skia/third_party/glu/libtess/ |
| mesh.c | 87 * Note that the prev pointer is stored in Sym->next.
89 ePrev = eNext->Sym->next;
90 eSym->next = ePrev;
91 ePrev->Sym->next = e;
92 e->next = eNext;
93 eNext->Sym->next = eSym;
149 vPrev->next = vNew;
150 vNew->next = vNext;
182 fPrev->next = fNew;
183 fNew->next = fNext
[all...] |
| /external/libxml2/ |
| list.c | 33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)->prev = lkNew
430 xmlLinkPtr next = lk->next; local
[all...] |
