| /libcore/luni/src/main/java/java/util/ |
| Hashtable.java | 268 e != null; e = e.next) {
292 e != null; e = e.next) {
318 for (HashtableEntry e = tab[i]; e != null; e = e.next) {
368 for (HashtableEntry<K, V> e = first; e != null; e = e.next) {
404 for (HashtableEntry<K, V> e = first; e != null; e = e.next) {
460 HashtableEntry<K, V> oldNext = e.next;
464 e.next = newNext;
524 for (HashtableEntry<K,V> n = e.next; n != null; e = n, n = n.next) {
530 broken.next = n
663 HashtableEntry<K, V> next; field in class:Hashtable.HashtableEntry
714 HashtableEntry<K, V> next = null; local
733 HashtableEntry<K, V> next = entryToReturn.next; local
747 HashtableEntry<K, V> next = entryToReturn.next; local
768 public K next() { return nextEntry().key; } method in class:Hashtable.KeyIterator
773 public V next() { return nextEntry().value; } method in class:Hashtable.ValueIterator
778 public Entry<K, V> next() { return nextEntry(); } method in class:Hashtable.EntryIterator
[all...] |
| WeakHashMap.java | 64 Entry<K, V> next; field in class:WeakHashMap.Entry
144 // ensure key of next entry is not gc'ed
149 nextEntry = nextEntry.next;
153 public R next() { method in class:WeakHashMap.HashIterator
157 nextEntry = currentEntry.next;
462 entry = entry.next;
471 entry = entry.next;
485 entry = entry.next;
494 entry = entry.next;
519 entry = entry.next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/ |
| glcpp-parse.y | 12 * The above copyright notice and this permission notice (including the next
612 node->next = NULL;
617 list->tail->next = node;
632 for (i = 0, node = list->head; node; i++, node = node->next) {
652 for (node = list->head; node; node = node->next)
671 node_a = node_a->next, node_b = node_b->next)
703 node->next = NULL;
708 list->tail->next = node;
723 for (node = list->head; node; node = node->next)
[all...] |
| /external/mesa3d/src/glsl/glcpp/ |
| glcpp-parse.y | 12 * The above copyright notice and this permission notice (including the next
612 node->next = NULL;
617 list->tail->next = node;
632 for (i = 0, node = list->head; node; i++, node = node->next) {
652 for (node = list->head; node; node = node->next)
671 node_a = node_a->next, node_b = node_b->next)
703 node->next = NULL;
708 list->tail->next = node;
723 for (node = list->head; node; node = node->next)
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| dict.c | 72 struct _xmlDictEntry *next; member in struct:_xmlDictEntry
82 xmlDictStringsPtr next; member in struct:_xmlDictStrings
171 pool = pool->next;
188 pool->next = dict->strings;
233 pool = pool->next;
250 pool->next = dict->strings;
529 xmlDictEntryPtr iter, next; local
581 dict->dict[key].next = NULL;
591 entry->next = dict->dict[key].next;
662 xmlDictEntryPtr next; local
[all...] |
| /external/libxml2/ |
| dict.c | 94 struct _xmlDictEntry *next; member in struct:_xmlDictEntry
104 xmlDictStringsPtr next; member in struct:_xmlDictStrings
198 pool = pool->next;
215 pool->next = dict->strings;
260 pool = pool->next;
277 pool->next = dict->strings;
562 xmlDictEntryPtr iter, next; local
614 dict->dict[key].next = NULL;
624 entry->next = dict->dict[key].next;
695 xmlDictEntryPtr next; local
[all...] |
| /system/core/sh/ |
| expand.c | 81 struct ifsregion *next; /* next region in list */ member in struct:ifsregion
141 ifsfirst.next = NULL;
164 exparg.lastp = &sp->next;
224 argbackq = argbackq->next;
309 while (ifsfirst.next != NULL) {
312 ifsp = ifsfirst.next->next;
313 ckfree(ifsfirst.next);
314 ifsfirst.next = ifsp
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLCollection.cpp | 309 element = ElementTraversal::next(*element, &root);
316 Element* next = ¤t; local
318 next = ElementTraversal::next(*next, root);
319 } while (next && !isMatchingElement(nodeList, next));
320 return next;
327 Element* next = ¤tElement;
328 while ((next = nextMatchingElement(nodeList, *next, root)))
538 Element* next = ¤t; local
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| ieee802_11_auth.c | 35 struct hostapd_cached_radius_acl *next; member in struct:hostapd_cached_radius_acl
51 struct hostapd_acl_query_data *next; member in struct:hostapd_acl_query_data
71 acl_cache = acl_cache->next;
92 copy_from = copy_from->next;
93 copy_to = &((*copy_to)->next);
111 for (entry = hapd->acl_cache; entry; entry = entry->next) {
296 query = query->next;
327 query->next = hapd->acl_queries;
353 prev->next = entry->next;
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedTransferQueue.java | 127 * first unmatched node on match and CASing the next field of the
178 * pointer updates: Threads may sometimes shortcut the "next" link
184 * of costly-to-reclaim garbage caused by the sequential "next"
192 * pointer, we set the "next" link of the previous head to point
196 * adds some further complexity to traversal: If any "next"
325 * to be removed, we can unsplice s by CASing the next field of
330 * (i.e., with null next), then it is pinned as the target node
423 volatile Node next; field in class:LinkedTransferQueue.Node
521 (k.getDeclaredField("next"));
592 Node n = q.next; // update by 2 unless singleto
735 Node next = p.next; local
867 public final E next() { method in class:LinkedTransferQueue.Itr
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| IdentityHashMap2Test.java | 157 "value", values.iterator().next());
159 "key", keys.iterator().next());
166 "value2", values2.iterator().next());
172 "key2", key2.iterator().next());
215 Map.Entry m = (Map.Entry) i.next();
266 assertNull("Failed with null key", m.keySet().iterator().next());
273 Integer remove1 = (Integer) it.next();
276 Integer remove2 = (Integer) it.next();
282 assertTrue("Wrong result", it.next().equals(list.get(0)));
284 assertTrue("Wrong contents", map.keySet().iterator().next().equals
292 Integer next; local
[all...] |
| /external/chromium_org/third_party/libusb/src/libusb/ |
| libusbi.h | 74 struct list_head *prev, *next; member in struct:list_head
92 for (pos = list_entry((head)->next, type, member); \
94 pos = list_entry(pos->member.next, type, member))
97 for (pos = list_entry((head)->next, type, member), \
98 n = list_entry(pos->member.next, type, member); \
100 pos = n, n = list_entry(n->member.next, type, member))
102 #define list_empty(entry) ((entry)->next == (entry))
106 entry->prev = entry->next = entry;
111 entry->next = head->next;
[all...] |
| /external/qemu/ |
| console.h | 52 QTAILQ_ENTRY(QEMUPutKBDEntry) next; member in struct:QEMUPutKBDEntry
58 QTAILQ_ENTRY(QEMUPutLEDEntry) next; member in struct:QEMUPutLEDEntry
188 struct DisplayChangeListener *next; member in struct:DisplayChangeListener
200 struct DisplayUpdateListener *next; member in struct:DisplayUpdateListener
223 struct DisplayState *next; member in struct:DisplayState
270 dcl->next = ds->listeners;
277 dul->next = ds->update_listeners;
289 dcl = dcl->next;
295 dul = dul->next;
309 dcl = dcl->next;
[all...] |
| /external/zlib/src/ |
| gzread.c | 156 state->x.next = state->out;
158 memcpy(state->x.next, strm->next_in, strm->avail_in);
168 On return, state->x.have and state->x.next point to the just decompressed
170 the next gzip stream or raw data, once state->x.have is depleted. Returns 0
210 state->x.next = strm->next_out - state->x.have;
243 state->x.next = state->out;
269 state->x.next += n;
332 memcpy(buf, state->x.next, n);
333 state->x.next += n;
408 return *(state->x.next)++
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| IdentityHashMapTest.java | 146 "value", values.iterator().next());
148 "key", keys.iterator().next());
155 "value2", values2.iterator().next());
161 "key2", key2.iterator().next());
204 Map.Entry m = (Map.Entry) i.next();
255 assertNull("Failed with null key", m.keySet().iterator().next());
262 Integer remove1 = (Integer) it.next();
265 Integer remove2 = (Integer) it.next();
271 assertTrue("Wrong result", it.next().equals(list.get(0)));
273 assertTrue("Wrong contents", map.keySet().iterator().next().equals
281 Integer next; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| DescendantIterator.java | 161 * Returns the next node in the set and advances the position of the
165 * @return The next <code>Node</code> in the set being iterated over, or
182 int next; local
208 next = m_lastFetched = (DTM.NULL == m_lastFetched)
210 : m_traverser.next(m_context, m_lastFetched);
214 next = m_lastFetched = (DTM.NULL == m_lastFetched)
216 : m_traverser.next(m_context, m_lastFetched,
220 if (DTM.NULL != next)
222 if(DTMIterator.FILTER_ACCEPT == acceptNode(next))
230 while (next != DTM.NULL)
[all...] |
| MatchPatternIterator.java | 185 * Get the next node via getNextXXX. Bottlenecked for derived class override.
186 * @return The next node on the axis, or DTM.NULL.
192 : m_traverser.next(m_context, m_lastFetched);
197 * Returns the next node in the set and advances the position of the
200 * @return The next <code>Node</code> in the set being iterated over, or
208 int next; local
235 next = getNextNode();
237 if (DTM.NULL != next)
239 if(DTMIterator.FILTER_ACCEPT == acceptNode(next, m_execContext))
247 while (next != DTM.NULL)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ContainerNodeAlgorithms.h | 88 GenericNode* next; local
92 next = n->nextSibling();
95 head = next;
96 if (next == 0)
159 GenericNode* next = 0; local
160 for (GenericNode* n = container.firstChild(); n; n = next) {
163 next = n->nextSibling();
166 container.setFirstChild(next);
167 if (next)
168 next->setPreviousSibling(0)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| ShapeInterval.h | 110 const_iterator next = (bNext == b.end() || (aNext != a.end() && aNext->x1() < bNext->x1())) ? aNext++ : bNext++; local
111 if (result.isEmpty() || !result.last().overlaps(*next))
112 result.append(*next);
114 result.last().setX2(std::max<T>(result.last().x2(), next->x2()));
135 const_iterator next = (bNext == b.end() || (aNext != a.end() && aNext->x1() < bNext->x1())) ? aNext++ : bNext++; local
136 if (working->overlaps(*next)) {
137 result.append(working->intersect(*next));
138 if (next->x2() > working->x2())
139 working = next;
141 working = next;
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_sync.cc | 45 tab_[i].val = tmp->next;
88 for (res = b->ListHead(); res; res = res->next) {
109 for (SyncVar *res = p->val; res; res = res->next) {
124 for (; res; res = res->next) {
130 res->next = p->val;
161 SyncVar **prev = &res->next;
167 *prev = res->next;
170 prev = &res->next;
195 *prev = res->next;
198 prev = &res->next;
[all...] |
| /external/dnsmasq/src/ |
| log.c | 49 struct log_entry *next; member in struct:log_entry
89 free_entries->next = NULL;
142 entries = tmp->next;
143 tmp->next = free_entries;
207 stop trying until the next call to my_syslog()
232 /* try again on next syslog() call */
318 free_entries = entry->next;
327 entry->next = NULL;
333 for (tmp = entries; tmp->next; tmp = tmp->next);
[all...] |
| /external/icu4c/test/intltest/ |
| bytestrietest.cpp | 227 // with next() and current().
315 trie->next('j');
316 trie->next('a');
317 trie->next('n');
318 // hasUniqueValue() directly after next()
323 trie->next('u');
327 if(trie->next('n')!=USTRINGTRIE_INTERMEDIATE_VALUE || 6!=trie->getValue()) {
336 trie->next('u');
353 trie->next('j');
354 trie->next('a')
[all...] |
| /external/ipsec-tools/src/racoon/ |
| sainfo.c | 217 struct sainfo *s, *next; local
219 for (s = LIST_FIRST(&sitree); s; s = next) {
220 next = LIST_NEXT(s, chain);
248 struct sainfoalg *a, *next; local
250 for (a = alg; a; a = next) {
251 next = a->next;
263 for (a = *head; a && a->next; a = a->next)
266 a->next = new
[all...] |
| /external/qemu/android/ |
| boot-properties.c | 37 struct BootProperty* next; member in struct:BootProperty
50 prop->next = NULL;
65 /* address to store pointer to next new list element */
76 BootProperty *next = NULL; local
78 next = p->next;
80 p = next;
128 _boot_properties_tail = &prop->next;
247 for (; p; p = p->next) {
262 for ( ; p; p = p->next) {
[all...] |
| /external/qemu/telephony/ |
| sysdeps_qemu.c | 54 SysTimer next; member in struct:SysTimerRec_
67 _s_timers0[nn].next = _s_timers0 + (nn+1);
78 _s_free_timers = timer->next;
79 timer->next = NULL;
94 timer->next = _s_free_timers;
159 SysChannel next; member in struct:SysChannelRec_
173 _s_channels0[nn].next = _s_channels0 + (nn+1);
183 _s_free_channels = channel->next;
184 channel->next = NULL;
199 channel->next = _s_free_channels
[all...] |
