| /prebuilt/ndk/android-ndk-r6/platforms/android-3/arch-arm/usr/include/linux/raid/ |
| xor.h | 20 struct xor_block_template *next; member in struct:xor_block_template
|
| /prebuilt/ndk/android-ndk-r6/platforms/android-3/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/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/ |
| config_none.c | 48 for (ssid = config->ssid; ssid; ssid = ssid->next) {
52 for (blob = config->blobs; blob; blob = blob->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 | 48 for (ssid = config->ssid; ssid; ssid = ssid->next) {
52 for (blob = config->blobs; blob; blob = blob->next) {
|
| /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/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) {
|
| /external/skia/samplecode/ |
| SampleGM.cpp | 22 GM* next() { function in class:Iter
25 fReg = fReg->next();
36 reg = reg->next();
52 fGM = fIter.next();
73 if (evt.isType("next-gm")) {
75 if (!(fGM = fIter.next())) {
77 fGM = fIter.next();
92 (new SkEvent("next-gm"))->post(this->getSinkID(), 1500);
|
| /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();
|
| /cts/tests/tests/text/src/android/text/cts/ |
| TextUtils_SimpleStringSplitterTest.java | 61 simpleStringSplitter.next();
64 simpleStringSplitter.next();
88 assertEquals("hello", iterator.next());
90 assertEquals("world", iterator.next());
96 notes = "Test next method",
97 method = "next",
106 assertEquals("first", simpleStringSplitter.next());
107 assertEquals(" second", simpleStringSplitter.next());
109 simpleStringSplitter.next();
117 notes = "Test next method"
[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/webkit/Source/WebCore/platform/ |
| Arena.cpp | 98 pool->first.next = NULL;
144 } while( NULL != (a = a->next) );
151 for ( a = arena_freelist; a != NULL ; p = a, a = a->next ) {
154 arena_freelist = a->next;
156 p->next = a->next;
162 a->next = pool->current->next;
163 pool->current->next = a;
165 if ( 0 == pool->first.next )
[all...] |
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 37 bool next() { function in class:SkNWayCanvas::Iter
54 while (iter.next()) {
63 while (iter.next()) {
71 while (iter.next()) {
79 while (iter.next()) {
87 while (iter.next()) {
95 while (iter.next()) {
103 while (iter.next()) {
111 while (iter.next()) {
119 while (iter.next()) {
[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...] |
| /external/oprofile/libutil++/ |
| string_manip.cpp | 57 string next; local
64 next += sep;
66 next += '\\';
69 result.push_back(next);
71 next.erase(next.begin(), next.end());
73 next += ch;
77 if (!next.empty())
78 result.push_back(next);
[all...] |
| /external/valgrind/main/drd/ |
| drd_bitmap2_node.c | 48 struct block_allocator_chunk* next; member in struct:block_allocator_chunk
79 p->next = s_first;
81 p->next->prev = p;
107 s_first = p->next;
109 p->prev->next = p->next;
110 if (p->next)
111 p->next->prev = p->prev;
135 for (p = s_first; p; p = p->next)
160 for (p = s_first; p; p = p->next)
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| SerializationHandleMap.java | 71 * Returns the index where the key is found at, or the index of the next
81 * Found the key, or the next empty spot (which means key is not
126 int index, next, hash; local
129 index = next = findIndex(key, keys);
142 next = (next + 2) % length;
143 object = keys[next];
150 if (next < index) {
151 hashedOk = hashedOk || (hash <= next);
153 hashedOk = hashedOk && (hash <= next);
[all...] |
| /external/opencv/cv/src/ |
| cvemd.cpp | 69 struct CvNode1D *next; member in struct:CvNode1D
77 struct CvNode2D *next[2]; /* next row & next column */ member in struct:CvNode2D
595 u0_head.next = u;
598 u[i].next = u + i + 1;
600 u[ssize - 1].next = 0;
601 u1_head.next = 0;
603 v0_head.next = ssize > 1 ? v + 1 : 0;
606 v[i].next = v + i + 1
[all...] |
