HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 1426 - 1450 of 7540) sorted by null

<<51525354555657585960>>

  /external/chromium_org/v8/src/
hydrogen-representation-changes.cc 37 HInstruction* next = NULL; local
39 next = use_value->block()->predecessors()->at(use_index)->end();
41 next = HInstruction::cast(use_value);
71 new_value->InsertBefore(next);
190 HInstruction* next = current->next(); local
192 current = next;
  /external/dnsmasq/src/
dhcp.c 217 for (tmp = daemon->dhcp_except; tmp; tmp = tmp->next)
234 for (context = daemon->dhcp; context; context = context->next)
373 for (context = daemon->dhcp; context; context = context->next)
496 for (config = configs; config; config = config->next)
512 for (; check; check = check->next)
516 for (tmp1 = pool; tmp1; tmp1 = tmp1->next)
523 for (tmp1 = pool; tmp1; tmp1 = tmp1->next)
592 for (count = 0, r = daemon->ping_results; r; r = r->next)
609 victim->next = daemon->ping_results;
652 for (conf_addr = config->hwaddr; conf_addr; conf_addr = conf_addr->next)
    [all...]
cache.c 183 cache_tail->next = crecp;
187 crecp->next = NULL;
193 crecp->name.bname->next = big_free;
204 crecp->next = cache_head;
215 crecp->prev->next = crecp->next;
217 cache_head = crecp->next;
219 if (crecp->next)
220 crecp->next->prev = crecp->prev;
342 in which can the next cache_start_insert cleans things up. *
505 struct crec *next, **up, **insert = NULL, **chainp = &ans; local
    [all...]
  /external/dropbear/
dropbearkey.c 93 char ** next = 0; local
109 if (next) {
110 *next = argv[i];
111 next = NULL;
118 next = &filename;
121 next = &typetext;
124 next = &sizetext;
  /external/e2fsprogs/lib/e2p/
feature.c 262 char *cp, *buf, *next; local
280 for (cp = buf; cp && *cp; cp = next ? next+1 : 0) {
283 next = skip_over_word(cp);
285 if (*next == 0)
286 next = 0;
288 *next = 0;
  /external/e2fsprogs/lib/et/
error_message.c 125 for (et = _et_list; et; et = et->next) {
137 for (et = _et_dynamic_list; et; et = et->next) {
255 el->next = _et_dynamic_list;
284 el2->next = el->next;
286 _et_dynamic_list = el->next;
297 el = el->next;
  /external/e2fsprogs/misc/
e2initrd_helper.c 61 struct fs_info *next; member in struct:fs_info
181 char *word, *next; local
188 next = skip_over_word(word);
189 if (*next)
190 *next++ = 0;
191 *buf = next;
275 fs->next = NULL;
  /external/libxslt/libxslt/
attrvt.c 39 struct _xsltAttrVT *next; /* next xsltAttrVT */ member in struct:_xsltAttrVT
78 cur->next = style->attVTs;
126 xsltAttrVTPtr cur = (xsltAttrVTPtr) avt, next; local
129 next = cur->next;
131 cur = next;
137 * @ val: the value to be set to the next available segment
182 (attr->children->next != NULL)) {
  /external/llvm/lib/Support/
CrashRecoveryContext.cpp 79 i = tmp->next;
111 cleanup->next = head;
120 head = cleanup->next;
125 cleanup->prev->next = cleanup->next;
126 if (cleanup->next)
127 cleanup->next->prev = cleanup->prev;
  /external/mesa3d/src/glsl/
opt_function_inlining.cpp 11 * The above copyright notice and this permission notice (including the next
92 assert(ret->next->is_tail_sentinel());
157 sig_param_iter.next();
158 param_iter.next();
187 param_iter.next();
188 sig_param_iter.next();
215 param_iter.next();
216 sig_param_iter.next();
  /external/qemu/
input.c 56 QTAILQ_INSERT_TAIL(&kbd_handlers, s, next);
64 QTAILQ_FOREACH_SAFE(cursor, &kbd_handlers, next, cursor_next) {
66 QTAILQ_REMOVE(&kbd_handlers, cursor, next);
139 QTAILQ_INSERT_TAIL(&led_handlers, s, next);
147 QTAILQ_REMOVE(&led_handlers, entry, next);
154 QTAILQ_FOREACH(cursor, &kbd_handlers, next) {
163 QTAILQ_FOREACH(cursor, &led_handlers, next) {
qdict.c 114 QLIST_FOREACH(entry, &qdict->table[bucket], next)
146 QLIST_INSERT_HEAD(&qdict->table[bucket], entry, next);
361 QLIST_FOREACH(entry, &qdict->table[i], next)
388 * qdict_next(): Return next qdict entry in an iteration.
394 ret = QLIST_NEXT(entry, next);
428 QLIST_REMOVE(entry, next);
448 QDictEntry *tmp = QLIST_NEXT(entry, next);
449 QLIST_REMOVE(entry, next);
  /external/wpa_supplicant_8/src/wps/
http_server.c 22 struct http_request *next; member in struct:http_request
105 p->next = r->next;
107 srv->requests = r->next;
112 r = r->next;
126 req = req->next;
222 req->next = srv->requests;
  /frameworks/base/graphics/java/android/graphics/drawable/
AnimationDrawable.java 211 int next = mCurFrame+1; local
213 if (next >= N) {
214 next = 0;
216 setFrame(next, unschedule, !mAnimationState.mOneShot || next < (N - 1));
257 while ((type=parser.next()) != XmlPullParser.END_DOCUMENT &&
284 while ((type=parser.next()) == XmlPullParser.TEXT) {
  /libcore/luni/src/test/java/libcore/java/io/
OldAndroidPipedStreamTest.java 65 assertEquals(readByte, (byte) fib.next());
79 int toWrite = fib.next();
143 assertEquals("Error at " + countRead, fib.next(), readInt);
159 int toWrite = fib.next();
230 int toWrite = fib.next();
267 assertEquals("Error at " + i, readInt, fib.next());
275 public int next() { method in class:OldAndroidPipedStreamTest.Fibonacci
  /libcore/luni/src/test/java/tests/java/sql/
UpdateFunctionalityTest.java 69 while (userTab.next()) {
117 while (result.next()) {
142 while (result.next()) {
175 while (result.next()) {
206 while (result.next()) {
241 // while (result.next()) {
252 // while (result.next()) {
281 // while (result.next()) {
308 while (result.next()) {
340 while (result.next()) {
    [all...]
  /ndk/sources/host-tools/make-3.81/
file.c 294 while (deps->next != 0)
295 deps = deps->next;
296 deps->next = from_file->deps;
438 for (dp = new; dp->next != NULL; dp = dp->next)
440 dp->next = ood;
443 for (; ood != NULL; ood = ood->next)
473 for (d = old; d != 0; d = d->next)
565 dp = new = new->next;
567 dp = dl->next = dp->next
    [all...]
  /packages/apps/Browser/src/com/android/browser/
TabScrollView.java 248 int next = -1; local
250 next = mSelected;
252 next = count - i - 1;
253 if (next <= mSelected && next > 0) {
254 next--;
257 return next;
  /packages/apps/Calendar/src/com/android/calendar/
DayFragment.java 198 DayView next = (DayView) mViewSwitcher.getNextView(); local
200 next.setFirstVisibleHour(currentView.getFirstVisibleHour());
203 next.setSelected(goToTime, ignoreTime, animateToday);
204 next.reloadEvents();
206 next.requestFocus();
207 next.updateTitle();
208 next.restartCurrentTimeUpdates();
  /external/expat/lib/
xmlparse.c 218 struct block *next; member in struct:block
294 struct open_internal_entity *next; member in struct:open_internal_entity
328 const char *s, const char *next);
333 const char *end, int tok, const char *next, const char **nextPtr,
945 openEntityList = openEntity->next;
946 openEntity->next = freeInternalEntities;
2133 const char *next = start; \/* XmlContentTok doesn't always set the last arg *\/ local
2174 const char *next = start; \/* XmlContentTok doesn't always set the last arg *\/ local
2255 const char *next = s; \/* XmlContentTok doesn't always set the last arg *\/ local
3216 const char *next; local
3336 const char *next; local
3593 const char *next = start; local
3658 const char *next = s; local
3700 const char *next = s; local
3737 const char *next = s; local
4736 const char *next = NULL; local
4799 const char *next; local
4859 const char *next; local
4944 const char *next; local
5109 const char *next; local
6278 int next; local
    [all...]
  /external/bison/lib/
bitset.c 224 /* Find next bit set in SRC starting from and including BITNO.
230 bitset_bindex next = bitno; local
232 if (!bitset_list (src, &val, 1, &next))
252 bitset_bindex next = bitno; local
254 if (!bitset_list_reverse (src, &val, 1, &next))
281 bitset_bindex next = 0; local
283 if (bitset_list (src, val, 2, &next) != 1)
368 bitset_bindex next; local
376 next = 0;
377 for (count = 0; (num = bitset_list (src, list, BITSET_LIST_SIZE, &next));
    [all...]
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
CMSUtils.java 77 X509Certificate c = (X509Certificate)it.next();
107 X509CertificateHolder c = (X509CertificateHolder)it.next();
129 X509AttributeCertificateHolder attrCert = (X509AttributeCertificateHolder)it.next();
151 X509CRL c = (X509CRL)it.next();
181 X509CRLHolder c = (X509CRLHolder)it.next();
201 // ASN1Encodable info = (ASN1Encodable)it.next();
226 v.add((ASN1Encodable)it.next());
238 v.add((ASN1Encodable)it.next());
339 DigestCalculator digest = (DigestCalculator)it.next();
351 SignerInfoGenerator signerGen = (SignerInfoGenerator)it.next();
    [all...]
  /external/chromium_org/third_party/icu/source/common/
uloc_tag.c 21 struct VariantListEntry *next; member in struct:VariantListEntry
28 struct ExtensionListEntry *next; member in struct:ExtensionListEntry
421 var->next = NULL;
432 prev->next = var;
433 var->next = NULL;
441 prev->next = var;
443 var->next = cur;
452 cur = cur->next;
465 ext->next = NULL;
476 prev->next = ext
1644 int16_t next; local
    [all...]
  /external/chromium_org/third_party/icu/source/test/thaitest/
thaitest.cpp 46 // return next break position
47 int32_t next();
232 nextSpaceBreak = spaceIter.next();
233 nextBreak = breakIter->next();
250 nextSpaceBreak = spaceIter.next();
254 nextBreak = breakIter->next();
412 int32_t nextbreak = breakIter->next();
522 * Return the next break, counting words and spaces.
524 int32_t SpaceBreakIterator::next() function in class:SpaceBreakIterator
532 nextBreak = fBreakIter->next();
    [all...]
  /external/e2fsprogs/e2fsck/
dict.c 158 dnode_t *first, *next; local
163 while (first && (next = dict_next(dict, first))) {
164 if (dict->compare(first->key, next->key) > 0)
166 first = next;
169 while (first && (next = dict_next(dict, first))) {
170 if (dict->compare(first->key, next->key) >= 0)
172 first = next;
681 dnode_t *next = dict_next(dict, delete); local
682 dnode_t *nextparent = next->parent;
683 dnode_color_t nextcolor = next->color
1032 dnode_t *node = dict_first(dict), *next; local
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next; local
1192 dnode_t *next = dict_next(dest, leftnode); local
1203 dnode_t *next = dict_next(source, rightnode); local
    [all...]

Completed in 701 milliseconds

<<51525354555657585960>>