| /system/core/sh/ |
| var.c | 173 vp->next = *vpp;
183 vps1.next = *vpp;
308 vp->next = *vpp;
325 for (lp = list ; lp ; lp = lp->next) {
336 for (lp = list ; lp ; lp = lp->next)
370 for (sp = cmdenviron ; sp ; sp = sp->next) {
400 for (vp = *vpp ; vp ; vp = vp->next)
406 for (vp = *vpp ; vp ; vp = vp->next)
438 *prev = vp->next;
448 prev = &vp->next;
[all...] |
| /external/dnsmasq/src/ |
| option.c | 508 /* find next comma, split string with zero and eliminate spaces.
587 r->next = daemon->txt;
727 new->netid->next = np;
958 new->netid->next)
962 new->next = daemon->dhcp_match;
968 new->next = daemon->dhcp_opts;
1037 struct list *next; member in struct:list
2540 struct fileread *next; member in struct:fileread
2750 struct dhcp_netid *id, *next; local
[all...] |
| /external/doclava/src/com/google/doclava/ |
| InfoBuilder.java | 136 TypeInfo outerType = it.next();
457 ParseTree child = it.next();
462 it.next();
463 child = it.next();
471 child = it.next();
476 child = it.next();
482 child = it.next();
494 child = it.next();
501 child = it.next();
505 child = it.next();
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseIterators.java | 257 * returned (starting point for the next() search); for single-node
263 * Remembers the current node for the next call to gotoMark().
292 * i.e. subsequent call to next() should return END.
320 * Get the next node in the iteration.
322 * @return The next node handle in the iteration, or END if no more
325 public int next() method in class:DTMDefaultBaseIterators.ChildrenIterator
350 * i.e. subsequent call to next() should return END.
391 * Get the next node in the iteration. In this case, we return
394 * @return The next node handle in the iteration, or END.
396 public int next() method in class:DTMDefaultBaseIterators.ParentIterator
470 public int next() method in class:DTMDefaultBaseIterators.TypedChildrenIterator
559 public int next() method in class:DTMDefaultBaseIterators.NamespaceChildrenIterator
625 public int next() method in class:DTMDefaultBaseIterators.NamespaceIterator
664 public int next() method in class:DTMDefaultBaseIterators.TypedNamespaceIterator
728 public int next() method in class:DTMDefaultBaseIterators.RootIterator
765 public int next() method in class:DTMDefaultBaseIterators.TypedRootIterator
849 public int next() method in class:DTMDefaultBaseIterators.NamespaceAttributeIterator
896 public int next() method in class:DTMDefaultBaseIterators.FollowingSiblingIterator
930 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingSiblingIterator
1002 public int next() method in class:DTMDefaultBaseIterators.AttributeIterator
1065 public int next() method in class:DTMDefaultBaseIterators.TypedAttributeIterator
1150 public int next() method in class:DTMDefaultBaseIterators.PrecedingSiblingIterator
1194 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingSiblingIterator
1349 public int next() method in class:DTMDefaultBaseIterators.PrecedingIterator
1425 public int next() method in class:DTMDefaultBaseIterators.TypedPrecedingIterator
1529 public int next() method in class:DTMDefaultBaseIterators.FollowingIterator
1565 public int next() method in class:DTMDefaultBaseIterators.TypedFollowingIterator
1709 public int next() method in class:DTMDefaultBaseIterators.AncestorIterator
1712 int next = _currentNode; local
1872 public int next() method in class:DTMDefaultBaseIterators.DescendantIterator
1944 public int next() method in class:DTMDefaultBaseIterators.TypedDescendantIterator
1998 public int next() method in class:DTMDefaultBaseIterators.NthDescendantIterator
2134 public int next() method in class:DTMDefaultBaseIterators.SingletonIterator
2170 public int next() method in class:DTMDefaultBaseIterators.TypedSingletonIterator
[all...] |
| ExpandedNameTable.java | 46 /** Next available extended type */
199 for (HashEntry e = m_table[index]; e != null; e = e.next)
260 old = old.next;
266 e.next = m_table[newIndex];
372 * The field next points to the next entry which is hashed into
380 HashEntry next; field in class:ExpandedNameTable.HashEntry
382 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next)
387 this.next = next;
[all...] |
| /external/icu4c/tools/gencase/ |
| store.c | 549 UChar32 next; local
562 next=src+((int16_t)value>>UCASE_DELTA_SHIFT);
563 if(next!=src) {
565 p2.upperCase=p2.titleCase=next;
567 p2.lowerCase=next;
641 UChar32 next; local
663 if((next=p->upperCase)!=0 && next!=c) {
664 set[count++]=next;
666 if((next=p->lowerCase)!=0 && next!=c)
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/dga/ |
| SDL_dgavideo.c | 600 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
611 if ( bucket->next ) {
612 if ( bucket->next->base != bucket->base+bucket->size ) {
613 printf("Warning, corrupt bucket list! (next)\n");
639 bucket->next = NULL;
649 surfaces.next = bucket;
657 bucket = surfaces.next;
660 bucket = bucket->next;
663 surfaces.next = NULL;
684 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| inflate.c | 38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
216 static code *next; local
224 next = fixed;
225 lenfix = next;
227 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
232 distfix = next;
234 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
407 next = strm->next_in; \
418 strm->next_in = next; \
559 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/zlib/ |
| inflate.c | 38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
251 static code *next; local
259 next = fixed;
260 lenfix = next;
262 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
267 distfix = next;
269 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
442 next = strm->next_in; \
453 strm->next_in = next; \
594 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| HashMapTest.java | 152 "value", values.iterator().next());
154 "key", keys.iterator().next());
161 "value2", values2.iterator().next());
167 "key2", key2.iterator().next());
219 Map.Entry m = (Map.Entry) i.next();
245 assertTrue(hm.entrySet().remove(m2.entrySet().iterator().next()));
302 assertNull("Failed with null key", m.keySet().iterator().next());
309 Integer remove1 = (Integer) it.next();
312 Integer remove2 = (Integer) it.next();
318 assertTrue("Wrong result", it.next().equals(list.get(0)))
328 Integer next; local
[all...] |
| /system/core/adb/ |
| sockets.c | 49 .next = &local_socket_list,
58 .next = &local_socket_closing_list,
68 for (s = local_socket_list.next; s != &local_socket_list; s = s->next) {
82 s->next = list;
83 s->prev = s->next->prev;
84 s->prev->next = s;
85 s->next->prev = s;
102 if (s->prev && s->next)
104 s->prev->next = s->next
[all...] |
| /system/core/logcat/ |
| logcat.cpp | 40 queued_entry_t* next; member in struct:queued_entry_t
43 next = NULL;
63 log_device_t* next; member in struct:log_device_t
70 next = NULL;
80 e = &((*e)->next);
82 entry->next = *e;
212 for (*firstdev = NULL; dev != NULL; dev = dev->next) {
236 dev->queue = entry->next;
261 for (dev=devices; dev; dev = dev->next) {
271 for (dev=devices; dev; dev = dev->next) {
[all...] |
| /external/libvpx/vpx_mem/ |
| vpx_mem_tracker.c | 241 p = p->next;
487 struct mem_block *p = (memtrack.head ? memtrack.head->next : NULL);
515 p = p->next;
542 struct mem_block *p = memtrack.head->next;
576 p = p->next;
601 p->prev->next = p;
607 p->next = NULL;
651 p->prev->next = p->next;
653 if (p->next)
[all...] |
| /external/opencv/cvaux/src/ |
| cvbgfg_codebook.cpp | 157 for( e = *cb; e != 0; e = e->next )
187 for( ; e != 0; e = e->next )
200 freeList[i].next = &freeList[i+1];
201 freeList[nblocks-1].next = 0;
204 freeList = freeList->next;
214 e->next = *cb;
275 for( e = *cb; e != 0; e = e->next )
336 for( first.next = e = *cb; e != 0; e = prev->next )
340 prev->next = e->next
[all...] |
| /external/oprofile/module/ia64/ |
| op_pmu.c | 581 pmu_add_sysctls(ctl_table * next)
583 ctl_table * start = next;
588 next->ctl_name = 1;
589 next->procname = names[i];
590 next->mode = 0700;
595 next->child = tab;
604 next++;
610 next = start;
612 kfree(next->child);
613 next++
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| pmksa_cache_auth.c | 84 prev->next = pos->next;
86 pmksa->pmksa = pos->next;
90 pos = pos->next;
104 pmksa->pmksa = entry->next;
198 pos = pos->next;
201 entry->next = pmksa->pmksa;
204 entry->next = prev->next;
205 prev->next = entry
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| HashtableTest.java | 206 iterator.next();
237 // next is removed "9"
257 s2.add(((Map.Entry) i.next()).getValue());
268 ((Map.Entry) ht10.entrySet().iterator().next()).setValue(null);
320 .next().hashCode())
383 iterator.next();
429 Integer remove1 = (Integer) it.next();
431 Integer remove2 = (Integer) it.next();
437 assertTrue("Wrong result", it.next().equals(list.get(0)));
439 assertTrue("Wrong contents", map.keySet().iterator().next().equals
447 Integer next; local
[all...] |
| /external/quake/quake/src/WinQuake/ |
| r_part.cpp | 86 free_particles = p->next;
87 p->next = active_particles;
163 free_particles = p->next;
164 p->next = active_particles;
191 particles[i].next = &particles[i+1];
192 particles[r_numparticles-1].next = NULL;
229 free_particles = p->next;
230 p->next = active_particles;
287 free_particles = p->next;
288 p->next = active_particles
[all...] |
| r_draw.cpp | 237 edge->next = newedges[v];
243 while (pcheck->next && pcheck->next->u < u_check)
244 pcheck = pcheck->next;
245 edge->next = pcheck->next;
246 pcheck->next = edge;
304 R_ClipEdge (pv0, &clipvert, clip->next);
345 R_ClipEdge (&clipvert, pv1, clip->next);
348 } while ((clip = clip->next) != NULL);
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| SimpleDateFormat.java | 285 int next, last = -1, count = 0; local
289 next = (template.charAt(i));
290 if (next == '\'') {
295 if (last == next) {
298 last = next;
304 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z')))
535 int next, last = -1, count = 0; local
[all...] |
| /libcore/luni/src/test/java/libcore/java/sql/ |
| OldResultSetGetterTests.java | 223 assertTrue(res.next());
245 res.next();
279 assertTrue(res.next());
311 assertTrue(res.next());
328 res.next();
361 assertTrue(res.next());
393 assertTrue(res.next());
425 assertTrue(res.next());
447 assertTrue(res.next());
467 assertTrue(res.next());
[all...] |
| /dalvik/vm/mterp/out/ |
| InterpAsm-x86-atom.S | 151 * Fetch the next instruction from rPC into rINST. Does not advance rPC.
159 * Fetch the next instruction from the specified offset. Advances rPC
160 * to point to the next instruction. "_count" is in 16-bit code units.
173 * Fetch the next instruction from an offset specified by _reg. Updates
174 * rPC to point to the next instruction. "_reg" must specify the distance
481 FINISH 1 # jump to next instruction
532 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance
535 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
572 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
575 FGETOP_JMP 2, %eax # jump to next instruction; getop, jm
[all...] |
| /external/chromium/net/disk_cache/ |
| eviction.cc | 116 Rankings::ScopedRankingsBlock next(rankings_,
119 while (header_->num_bytes > target_size && next.get()) {
121 if (!next->HasData())
123 node.reset(next.release());
124 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
290 Rankings::ScopedRankingsBlock next[kListsToSearch]; local
296 next[i].set_rankings(rankings_);
299 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
300 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
313 !NodeIsOldEnough(next[list].get(), 0)
[all...] |
| /external/quake/quake/src/QW/client/ |
| r_draw.c | 237 edge->next = newedges[v];
243 while (pcheck->next && pcheck->next->u < u_check)
244 pcheck = pcheck->next;
245 edge->next = pcheck->next;
246 pcheck->next = edge;
304 R_ClipEdge (pv0, &clipvert, clip->next);
345 R_ClipEdge (&clipvert, pv1, clip->next);
348 } while ((clip = clip->next) != NULL)
[all...] |
| /external/chromium/base/ |
| path_service.cc | 39 struct Provider* next; member in struct:__anon2246::Provider
113 Provider* next = p->next; local
116 p = next;
196 provider = provider->next;
255 p = p->next;
262 p->next = path_data->providers;
|
