| /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 | 261 char *cp, *buf, *next; local
279 for (cp = buf; cp && *cp; cp = next ? next+1 : 0) {
282 next = skip_over_word(cp);
284 if (*next == 0)
285 next = 0;
287 *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/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/webkit/Source/JavaScriptCore/yarr/ |
| YarrInterpreter.h | 94 int next; member in struct:JSC::Yarr::ByteTerm::__anon12949::__anon12954
238 term.alternative.next = 0;
247 term.alternative.next = 0;
256 term.alternative.next = 0;
265 term.alternative.next = 0;
274 term.alternative.next = 0;
283 term.alternative.next = 0;
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNode.cpp | 135 RefPtr<Node> next = refChild;
152 // possible that "next" is no longer a child of "this".
155 if (next->parentNode() != this)
166 insertBeforeCommon(next.get(), child);
169 childrenChanged(false, refChildPreviousSibling.get(), next.get(), 1);
228 RefPtr<Node> next = nextChild;
237 insertBeforeCommon(next.get(), child);
267 RefPtr<Node> next = oldChild->nextSibling(); local
318 Node* next; local
320 next = prev->nextSibling()
445 Node* next = child->nextSibling(); local
493 Node* next = oldChild->nextSibling(); local
525 Node* next = n->nextSibling(); local
840 RenderObject *next = 0; local
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| LoopBlinnLocalTriangulator.cpp | 117 // Find the next vertex according to the above rules
122 Vertex* next = tri->nextVertex(v, sideToFill == LoopBlinnConstants::RightSide); local
123 if (!next->marked() && !isSharedEdge(v, next) && (!next->interior() || next->end())) {
124 addInteriorVertex(next);
125 v = next;
|
| /external/wpa_supplicant_6/wpa_supplicant/ |
| scan.c | 52 for (ssid = conf->ssid; ssid; ssid = ssid->next) {
76 ssid = ssid->next;
132 ssid = ssid->next;
135 ssid = ssid->next;
142 ssid = ssid->next;
157 if (ssid->next) {
158 /* Continue from the next SSID on the next attempt. */
251 ssid = ssid->next;
|
| /external/wpa_supplicant_8/src/wps/ |
| http_server.c | 28 struct http_request *next; member in struct:http_request
111 p->next = r->next;
113 srv->requests = r->next;
118 r = r->next;
132 req = req->next;
228 req->next = srv->requests;
|
| /external/zlib/ |
| 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
203 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = here;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /frameworks/base/graphics/java/android/graphics/drawable/ |
| AnimationDrawable.java | 201 int next = mCurFrame+1; local
203 if (next >= N) {
204 next = 0;
206 setFrame(next, unschedule, !mAnimationState.mOneShot || next < (N - 1));
245 while ((type=parser.next()) != XmlPullParser.END_DOCUMENT &&
272 while ((type=parser.next()) == XmlPullParser.TEXT) {
|
| /frameworks/base/libs/utils/ |
| CallStack.cpp | 117 struct mapinfo *next; member in struct:android::MapInfo::mapinfo
131 mi = mi->next;
149 mi->next = 0;
165 mi->next = milist;
185 mapinfo *next = milist->next; local
187 milist = next;
|
| /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...] |
| /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;
|
| /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/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...] |
| /external/icu4c/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/icu4c/samples/uciter8/ |
| uciter8.c | 83 c1=iter1->next(iter1);
84 c2=iter2->next(iter2);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
123 c1=iter1->next(iter1);
124 c2=iter2->next(iter2);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
227 c=iter1->next(iter1);
259 c=iter2->next(iter2)
[all...] |
| /external/icu4c/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...] |
