| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
204 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = this;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /external/v8/src/ |
| handles-inl.h | 75 prev_next_ = current->next;
86 prev_next_ = current->next;
100 current->next = prev_next_;
124 prev_next_ = current->next;
137 internal::Object** cur = current->next;
139 // Update the current next field, set the value in the created
142 current->next = cur + 1;
157 current->limit = current->next;
|
| /external/zlib/contrib/infback9/ |
| inftree9.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
145 filled is at next and has curr index bits. The code being used is huff
197 next = *table; /* current table to fill in */
231 next[(huff >> drop) + fill] = this;
245 /* go to next symbol, update count, len */
259 next += 1U << curr;
261 /* determine length of next table */
281 (*table)[low].val = (unsigned short)(next - *table)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| 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;
392 coll.add(iter.next());
402 coll.add(iter.next());
481 entry = entry.next;
490 entry = entry.next;
504 entry = entry.next;
[all...] |
| AbstractMap.java | 193 if (key.equals(it.next().getKey())) {
199 if (it.next().getKey() == null) {
217 if (value.equals(it.next().getValue())) {
223 if (it.next().getValue() == null) {
285 Map.Entry<K, V> entry = it.next();
292 Map.Entry<K, V> entry = it.next();
311 result += it.next().hashCode();
350 public K next() {
351 return setIterator.next().getKey();
395 Map.Entry<K, V> entry = it.next();
[all...] |
| Hashtable.java | 269 e != null; e = e.next) {
297 e != null; e = e.next) {
323 for (HashtableEntry e = tab[i]; e != null; e = e.next) {
371 for (HashtableEntry<K, V> e = first; e != null; e = e.next) {
405 for (HashtableEntry<K, V> e = first; e != null; e = e.next) {
461 HashtableEntry<K, V> oldNext = e.next;
465 e.next = newNext;
525 for (HashtableEntry<K,V> n = e.next; n != null; e = n, n = n.next) {
531 broken.next = n
664 HashtableEntry<K, V> next; field in class:Hashtable.HashtableEntry
715 HashtableEntry<K, V> next = null; local
734 HashtableEntry<K, V> next = entryToReturn.next; local
748 HashtableEntry<K, V> next = entryToReturn.next; local
769 public K next() { return nextEntry().key; } method in class:Hashtable.KeyIterator
774 public V next() { return nextEntry().value; } method in class:Hashtable.ValueIterator
779 public Entry<K, V> next() { return nextEntry(); } method in class:Hashtable.EntryIterator
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| TreeMapExtendTest.java | [all...] |
| 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/dnsmasq/src/ |
| dbus.c | 61 struct watch *next; member in struct:watch
69 for (w = daemon->watches; w; w = w->next)
77 w->next = daemon->watches;
88 for (up = &(daemon->watches), w = daemon->watches; w; w = w->next)
91 *up = w->next;
95 up = &(w->next);
110 for (serv = daemon->servers; serv; serv = serv->next)
184 for (serv = daemon->servers; serv; serv = serv->next)
217 serv->next = daemon->servers;
248 tmp = serv->next;
[all...] |
| 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/mesa3d/src/glsl/ |
| ir_reader.cpp | 11 * The above copyright notice and this permission notice (including the next
141 s_expression *base_expr = (s_expression*) type_sym->next;
149 s_int *size = SX_AS_INT(base_expr->next);
215 s_symbol *name = SX_AS_SYMBOL(list->subexpressions.head->next);
229 it.next(); // skip "function" tag
230 it.next(); // skip function name
231 for (/* nothing */; it.has_next(); it.next()) {
260 s_expression *type_expr = (s_expression*) list->subexpressions.head->next;
265 s_list *paramlist = SX_AS_LIST(type_expr->next);
266 s_list *body_list = SX_AS_LIST(type_expr->next->next)
[all...] |
| /external/quake/quake/src/QW/client/ |
| cmd.c | 30 struct cmdalias_s *next; member in struct:cmdalias_s
48 next frame. This allows commands like:
187 // for next frame
346 for (a = cmd_alias ; a ; a=a->next)
359 for (a = cmd_alias ; a ; a=a->next)
371 a->next = cmd_alias;
400 struct cmd_function_s *next; member in struct:cmd_function_s
527 for (cmd=cmd_functions ; cmd ; cmd=cmd->next)
539 cmd->next = cmd_functions;
552 for (cmd=cmd_functions ; cmd ; cmd=cmd->next)
[all...] |
| /external/valgrind/main/callgrind/ |
| bb.c | 70 BB **new_table, *curr, *next; local
87 next = curr->next;
91 curr->next = new_table[new_idx];
93 if (curr->next) {
95 if (curr->next->next)
99 curr = next;
155 bb->next = bbs.table[idx];
189 bb = bb->next;
[all...] |
| /frameworks/base/tools/aidl/ |
| aidl_language_y.y | 56 while (p && p->next) {
57 p=p->next;
60 p->next = (document_item_type*)$2.document_item;
83 b->document_item.next = NULL;
125 c->document_item.next = NULL;
150 while (p && p->next) {
151 p=p->next;
154 p->next = (interface_item_type*)$2.method;
171 method->interface_item.next = NULL;
186 method->interface_item.next = NULL
[all...] |
| /external/bluetooth/glib/glib/ |
| gdataset.c | 61 GData *next; member in struct:_GData
115 list = prev->next;
221 prev->next = list->next;
224 G_DATALIST_SET_POINTER (datalist, list->next);
229 if (!list->next && dataset)
254 list = list->next;
289 list = list->next;
293 list->next = G_DATALIST_GET_POINTER (datalist);
420 for (list = dataset->datalist; list; list = list->next)
471 register GData *list, *next; local
491 register GData *list, *next; local
[all...] |
| /external/zlib/ |
| gzread.c | 66 /* Get next byte from input, or -1 if end or error. */
67 #define NEXT() ((strm->avail_in == 0 && gz_avail(state) == -1) ? -1 : \
81 val = NEXT();
82 val += (unsigned)NEXT() << 8;
83 val += (unsigned long)NEXT() << 16;
84 ch = NEXT();
97 that the next available input data is the raw deflate stream. If direct
161 if (NEXT() != 8) { /* compression method */
165 flags = NEXT();
170 NEXT(); /* modification time *
[all...] |
| /external/elfutils/src/ |
| ldscript.c | 276 /* The size of the maximum gap between one aligned stack and the next. */
306 stack. Advance YYPTR to a properly aligned location for the next
[all...] |
| /external/mesa3d/src/glsl/glcpp/ |
| glcpp-parse.y | 12 * The above copyright notice and this permission notice (including the next
579 node->next = NULL;
584 list->tail->next = node;
599 for (i = 0, node = list->head; node; i++, node = node->next) {
619 for (node = list->head; node; node = node->next)
638 node_a = node_a->next, node_b = node_b->next)
670 node->next = NULL;
675 list->tail->next = node;
690 for (node = list->head; node; node = node->next)
[all...] |
| /external/libxml2/ |
| 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...] |
| /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/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...] |
| /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/ipsec-tools/src/racoon/ |
| sainfo.c | 307 struct sainfo *s, *next; local
309 for (s = LIST_FIRST(&sitree); s; s = next) {
310 next = LIST_NEXT(s, chain);
338 struct sainfoalg *a, *next; local
340 for (a = alg; a; a = next) {
341 next = a->next;
353 for (a = *head; a && a->next; a = a->next)
356 a->next = new
[all...] |
