| /external/qemu/hw/ |
| goldfish_device.c | 78 dev->next = NULL;
80 last_device->next = dev;
109 s->current = s->current->next;
115 s->current = s->current->next;
146 dev = dev->next;
|
| /external/qemu/ |
| vl-android-ui.c | 73 struct IOHandlerRecord *next; member in struct:IOHandlerRecord
111 pioh = &ioh->next;
116 *pioh = ioh->next;
121 for(ioh = first_io_handler; ioh != NULL; ioh = ioh->next) {
126 ioh->next = first_io_handler;
|
| /external/tinyxml/ |
| tinyxml.cpp | 151 next = 0;
163 node = node->next;
184 node = node->next;
198 node->next = 0;
201 lastChild->next = node;
230 node->next = beforeThis;
234 beforeThis->prev->next = node;
257 node->next = afterThis->next;
258 if ( afterThis->next )
[all...] |
| /external/webkit/Source/JavaScriptCore/heap/ |
| HandleHeap.cpp | 66 for (Node* node = m_strongList.begin(); node != end; node = node->next())
75 for (Node* node = m_weakList.begin(); node != end; node = node->next()) {
96 m_nextToFinalize = node->next();
105 if (m_nextToFinalize != node->next()) // Owner deallocated node.
143 for (Node* node = m_strongList.begin(); node != end; node = node->next()) {
|
| MarkedSpace.cpp | 65 MarkedBlock* next; local
66 for (MarkedBlock* block = blocks.head(); block; block = next) {
67 next = block->next();
77 for (MarkedBlock*& block = sizeClass.nextBlock ; block; block = block->next()) {
|
| /external/webkit/Source/WebCore/editing/ |
| BreakBlockquoteCommand.cpp | 99 pos = pos.next();
162 Node *next = moveNode->nextSibling(); local
165 moveNode = next;
180 Node *next = moveNode->nextSibling(); local
183 moveNode = next;
|
| /external/wpa_supplicant/ |
| crypto_gnutls.c | 41 u8 pkey[8], next, tmp; local
45 next = 0;
48 pkey[i] = (tmp >> i) | next | 1;
49 next = tmp << (7 - i);
51 pkey[i] = next | 1;
|
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_server/ |
| eap_methods.c | 34 for (m = eap_methods; m; m = m->next) {
54 for (m = eap_methods; m; m = m->next) {
119 for (m = eap_methods; m; m = m->next) {
128 last->next = method;
301 eap_methods = eap_methods->next;
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_nss.c | 60 u8 pkey[8], next, tmp; local
64 next = 0;
67 pkey[i] = (tmp >> i) | next | 1;
68 next = tmp << (7 - i);
70 pkey[i] = next | 1;
|
| /frameworks/base/core/tests/coretests/src/android/widget/listview/arrowscroll/ |
| ListOfItemsShorterThanScreenTest.java | 52 final View next = mListView.getChildAt(1); local
53 assertFalse(next.isSelected());
57 next.getTop());
61 assertTrue(next.isSelected());
62 assertEquals("next selected item shouldn't have moved",
64 next.getTop());
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/alsa/ |
| conf.h | 158 * \param next Iterator variable for the next node.
163 #define snd_config_for_each(pos, next, node) \
164 for (pos = snd_config_iterator_first(node), next = snd_config_iterator_next(pos); pos != snd_config_iterator_end(node); pos = next, next = snd_config_iterator_next(pos))
186 snd_devname_t *next; /**< Next pointer */ member in struct:snd_devname
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| LinkedHashMapTest.java | 218 Map.Entry m = (Map.Entry) i.next();
239 assertNull("Failed with null key", m.keySet().iterator().next());
246 Integer remove1 = (Integer) it.next();
249 Integer remove2 = (Integer) it.next();
255 assertTrue("Wrong result", it.next().equals(list.get(0)));
257 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
264 Integer remove3 = (Integer) it2.next();
265 Integer next; local
267 next = new Integer(4);
269 next = new Integer(1)
[all...] |
| /external/dbus/dbus/ |
| dbus-list.c | 114 link->next = link;
119 link->next = before_this_link;
122 link->prev->next = link;
137 link->next = link;
143 link->next = after_this_link->next;
144 after_this_link->next = link;
145 link->next->prev = link;
169 * Gets the next link in the list, or #NULL if
184 * @returns the next link, or %NULL if none
557 DBusList *next = _dbus_list_get_next_link (list, link); local
799 DBusList *next = _dbus_list_get_next_link (list, link); local
1259 DBusList *next = _dbus_list_get_next_link (&list2, link2); local
1279 DBusList *next = _dbus_list_get_next_link (&list1, link1); local
[all...] |
| /external/opencv/cv/src/ |
| cvapprox.cpp | 52 struct _CvPtInfo *next; member in struct:_CvPtInfo
113 temp.next = 0;
140 current = current->next = array + i;
151 current->next = 0;
154 current = temp.next;
240 current = current->next;
245 current = temp.next;
273 prev_current->next = current->next;
278 current = current->next;
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 90 * <p>We also use "next" links to implement blocking mechanics.
92 * predecessor signals the next node to wake up by traversing
93 * next link to determine which thread it is. Determination of
95 * the "next" fields of their predecessors. This is solved
98 * (Or, said differently, the next-links are an optimization
141 * waitStatus value to indicate the next acquireShared should
200 * assign next field of a predecessor until after attachment,
201 * so seeing a null next field does not necessarily mean that
202 * node is at end of queue. However, if a next field appears
204 * double-check. The next field of cancelled nodes is set t
208 volatile Node next; field in class:AbstractQueuedLongSynchronizer.Node
521 Node next = node.next; local
1637 Node next = first.nextWaiter; local
1662 Node next = t.nextWaiter; local
[all...] |
| AbstractQueuedSynchronizer.java | 46 * mechanical sense that when a shared mode acquire succeeds, the next
321 * <p>We also use "next" links to implement blocking mechanics.
323 * predecessor signals the next node to wake up by traversing
324 * next link to determine which thread it is. Determination of
326 * the "next" fields of their predecessors. This is solved
329 * (Or, said differently, the next-links are an optimization
372 * waitStatus value to indicate the next acquireShared should
431 * assign next field of a predecessor until after attachment,
432 * so seeing a null next field does not necessarily mean that
433 * node is at end of queue. However, if a next field appear
439 volatile Node next; field in class:AbstractQueuedSynchronizer.Node
752 Node next = node.next; local
1867 Node next = first.nextWaiter; local
1892 Node next = t.nextWaiter; local
[all...] |
| /development/tools/apkcheck/src/com/android/apkcheck/ |
| ApkCheck.java | 232 PackageInfo pubPkgInfo = pkgIter.next();
236 ClassInfo pubClassInfo = classIter.next();
254 PackageInfo apkPkgInfo = pkgIter.next();
266 ClassInfo apkClassInfo = classIter.next();
318 FieldInfo apkFieldInfo = fieldIter.next();
334 MethodInfo apkMethodInfo = methodIter.next();
395 PackageInfo pkgInfo = iter.next();
404 ClassInfo classInfo = iter.next();
413 FieldInfo fieldInfo = fieldIter.next();
418 MethodInfo methInfo = methIter.next();
[all...] |
| /external/libxml2/include/libxml/ |
| schemasInternals.h | 151 struct _xmlSchemaAnnot *next; member in struct:_xmlSchemaAnnot
250 struct _xmlSchemaAttribute *next; /* the next attribute (not used?) */ member in struct:_xmlSchemaAttribute
279 struct _xmlSchemaAttributeLink *next;/* the next attribute link ... */ member in struct:_xmlSchemaAttributeLink
297 struct _xmlSchemaWildcardNs *next;/* the next constraint link ... */ member in struct:_xmlSchemaWildcardNs
363 struct _xmlSchemaAttribute *next;/* the next attribute if in a group ... */ member in struct:_xmlSchemaAttributeGroup
388 struct _xmlSchemaTypeLink *next;/* the next type link ... * member in struct:_xmlSchemaTypeLink
399 struct _xmlSchemaFacetLink *next;\/* the next facet link ... *\/ member in struct:_xmlSchemaFacetLink
604 struct _xmlSchemaType *next; \/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaType
767 struct _xmlSchemaType *next; \/* Not used? *\/ member in struct:_xmlSchemaElement
825 struct _xmlSchemaFacet *next;\/* the next type if in a sequence ... *\/ member in struct:_xmlSchemaFacet
[all...] |
| /external/qemu/android/ |
| config.c | 39 for(node = root->first_child; node; node = node->next) {
49 root->last_child->next = node;
135 char next; member in struct:__anon9211
147 if(cs->next != 0) {
148 c = cs->next;
149 cs->next = 0;
240 cs->next = *data;
323 cs.next = 0;
454 for (child = node->first_child; child; child = child->next)
472 for (child = root->first_child; child; child = child->next)
[all...] |
| /external/valgrind/main/callgrind/ |
| context.c | 94 Context **new_table, *curr, *next; local
111 next = curr->next;
115 curr->next = new_table[new_idx];
117 if (curr->next) {
119 if (curr->next->next)
123 curr = next;
221 cxt->next = cxts.table[idx];
263 cxt = cxt->next;
[all...] |
| /external/webkit/Source/JavaScriptCore/profiler/ |
| ProfileNode.cpp | 182 ProfileNode* next = m_nextSibling; local
183 if (!next)
185 while (ProfileNode* firstChild = next->firstChild())
186 next = firstChild;
187 return next;
202 ProfileNode* next;
203 for (next = m_parent->nextSibling(); !next; next = nextParent->nextSibling()) {
209 return next;
[all...] |
| /external/webkit/Source/WebCore/css/ |
| SVGCSSParser.cpp | 98 m_valueList->next();
174 m_valueList->next();
189 if (m_valueList->next() && parseColorFromValue(m_valueList->current(), c)) {
197 m_valueList->next();
209 m_valueList->next();
224 m_valueList->next();
265 m_valueList->next();
307 m_valueList->next();
329 value = m_valueList->next();
331 value = m_valueList->next();
[all...] |
| /external/zlib/examples/ |
| gzjoin.c | 80 unsigned left; /* bytes remaining at next */
81 unsigned char *next; /* next byte to read */ member in struct:__anon14274
113 in->next = in->buf;
128 in->next = in->buf;
140 in->left ? (in->left--, *(in->next)++) : \
165 in->next += skip;
197 in->next += skip;
260 strm->next_in = in->next;
348 /* find the next last-block bit *
[all...] |
| zran.c | 90 struct point *next; local
108 next = realloc(index->list, sizeof(struct point) * index->size);
109 if (next == NULL) {
113 index->list = next;
117 next = index->list + index->have;
118 next->bits = bits;
119 next->in = in;
120 next->out = out;
122 memcpy(next->window, window + WINSIZE - left, left);
124 memcpy(next->window + left, window, WINSIZE - left)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| AbstractList.java | 52 public E next() { method in class:AbstractList.SimpleListIterator
199 public E next() { method in class:AbstractList.SubAbstractList.SubAbstractListIterator
201 return iterator.next();
451 add(location++, it.next());
493 Object e1 = it1.next(), e2 = it2.next();
527 Object object = it.next();
546 if (object.equals(it.next())) {
552 if (it.next() == null) {
657 it.next();
[all...] |
