| /external/fsck_msdos/ |
| fat.c | 138 checkclnum(struct bootblock *boot, int fat, cl_t cl, cl_t *next)
140 if (*next >= (CLUST_RSRVD&boot->ClustMask))
141 *next |= ~boot->ClustMask;
142 if (*next == CLUST_FREE) {
146 if (*next == CLUST_BAD) {
150 if (*next < CLUST_FIRST
151 || (*next >= boot->NumClusters && *next < CLUST_EOFS)) {
154 *next < CLUST_RSRVD ? "out of range" : "reserved",
155 *next&boot->ClustMask)
[all...] |
| /external/qemu/ |
| iohandler.c | 41 QLIST_ENTRY(IOHandlerRecord) next;
59 QLIST_FOREACH(ioh, &io_handlers, next) {
66 QLIST_FOREACH(ioh, &io_handlers, next) {
71 QLIST_INSERT_HEAD(&io_handlers, ioh, next);
95 QLIST_FOREACH(ioh, &io_handlers, next) {
118 QLIST_FOREACH_SAFE(ioh, &io_handlers, next, pioh) {
128 QLIST_REMOVE(ioh, next);
140 QLIST_ENTRY(ChildProcessRecord) next;
155 ChildProcessRecord *rec, *next; local
157 QLIST_FOREACH_SAFE(rec, &child_watches, next, next)
[all...] |
| /external/bison/lib/ |
| hash.c | 186 while (cursor = cursor->next, cursor)
218 while (cursor = cursor->next, cursor)
262 for (cursor = bucket; cursor; cursor = cursor->next)
307 /* Find next entry in the same bucket. */
308 for (cursor = bucket; cursor; cursor = cursor->next)
309 if (cursor->data == entry && cursor->next)
310 return cursor->next->data;
337 for (cursor = bucket; cursor; cursor = cursor->next)
369 for (cursor = bucket; cursor; cursor = cursor->next)
614 struct hash_entry *next; local
652 struct hash_entry *next; local
769 struct hash_entry *next = bucket->next; local
794 struct hash_entry *next = cursor->next; local
824 struct hash_entry *next; local
[all...] |
| /external/elfutils/src/ |
| ldscript.y | 170 if ($3 != $3->next)
172 $3->next->group_start = 1;
187 $2->next = $1->next;
188 $$ = $1->next = $2;
203 $$->val.section.input = $3->next;
209 $3->next = NULL;
217 $$->val.section.input->next = NULL;
243 $2->next = $1->next;
[all...] |
| /external/quake/quake/src/QW/client/ |
| zone.c | 34 struct memblock_s *next, *prev; member in struct:memblock_s
80 zone->blocklist.next = zone->blocklist.prev = block =
87 block->prev = block->next = &zone->blocklist;
118 other->next = block->next;
119 other->next->prev = other;
125 other = block->next;
127 { // merge the next free block onto the end
129 block->next = other->next;
317 hunk_t *h, *next, *endlow, *starthigh, *endhigh; local
567 struct cache_system_s *prev, *next; member in struct:cache_system_s
[all...] |
| r_edge.c | 170 edge_head.next).
179 next_edge = edgestoadd->next;
183 edgelist=edgelist->next;
186 edgelist=edgelist->next;
189 edgelist=edgelist->next;
192 edgelist=edgelist->next;
197 edgestoadd->next = edgelist;
199 edgelist->prev->next = edgestoadd;
219 pedge->next->prev = pedge->prev;
220 pedge->prev->next = pedge->next
[all...] |
| /external/quake/quake/src/WinQuake/ |
| zone.cpp | 34 struct memblock_s *next, *prev; member in struct:memblock_s
80 zone->blocklist.next = zone->blocklist.prev = block =
87 block->prev = block->next = &zone->blocklist;
118 other->next = block->next;
119 other->next->prev = other;
125 other = block->next;
127 { // merge the next free block onto the end
129 block->next = other->next;
317 hunk_t *h, *next, *endlow, *starthigh, *endhigh; local
562 struct cache_system_s *prev, *next; member in struct:cache_system_s
[all...] |
| /external/chromium/testing/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/e2fsprogs/lib/e2p/ |
| mntopts.c | 98 char *cp, *buf, *next; local
111 next = skip_over_word(cp);
112 if (*next == 0)
113 next = 0;
115 *next = 0;
138 cp = next ? next+1 : 0;
|
| /external/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode * next() { return next_; } function in class:QueueNode
58 const QueueNode * next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E> * next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode * next() { return next_; } function in class:QueueNode
58 const QueueNode * next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E> * next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| ContainerNodeAlgorithms.h | 50 GenericNode* next; local
54 next = n->nextSibling();
57 head = next;
58 if (next == 0)
117 GenericNode* next = 0; local
118 for (GenericNode* n = container->firstChild(); n != 0; n = next) {
121 next = n->nextSibling();
|
| /external/wpa_supplicant_6/wpa_supplicant/ |
| blacklist.c | 36 e = e->next;
77 e->next = wpa_s->blacklist;
100 wpa_s->blacklist = e->next;
102 prev->next = e->next;
110 e = e->next;
128 e = e->next;
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| blacklist.c | 36 e = e->next;
77 e->next = wpa_s->blacklist;
100 wpa_s->blacklist = e->next;
102 prev->next = e->next;
110 e = e->next;
128 e = e->next;
|
| /libcore/luni/src/main/java/java/sql/ |
| SQLException.java | 35 * <li>The next exception in the chain.</li>
48 private SQLException next = null; field in class:SQLException
196 return next;
220 if (next != null) {
221 next.setNextException(ex);
223 next = ex;
247 public Throwable next() { method in class:SQLException.InternalIterator
252 current = current.next;
|
| /external/oprofile/libop/ |
| op_alloc_counter.c | 24 struct list_head next; member in struct:counter_arc_head
31 /** the next counter allowed for this event */
32 struct list_head next; member in struct:counter_arc
56 list_init(&ctr_arc[i].next);
69 list_add_tail(&arc->next, &ctr_arc[i].next);
90 list_for_each_safe(pos, pos2, &ctr_arc[i].next) {
91 counter_arc * arc = list_entry(pos, counter_arc, next);
92 list_del(&arc->next);
135 if((&ctr_arc[depth].next)->next == &ctr_arc[depth].next)
[all...] |
| /sdk/emulator/qtools/ |
| hash_table.h | 16 entry *next; member in struct:HashTable::entry
67 entry_type *ptr, *next; local
70 // Save the next pointer before deleting each entry so that we
72 for (ptr = table_[ii]; ptr; ptr = next) {
73 next = ptr->next;
103 for (entry_type *ptr = table_[pos]; ptr; ptr = ptr->next) {
119 ptr->next = table_[pos];
134 for (entry_type *ptr = table_[pos]; ptr; prev = ptr, ptr = ptr->next) {
137 table_[pos] = ptr->next;
[all...] |
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| StringCharacterIteratorTest.java | 129 sci1.next();
131 sci0.next();
167 fixture.next();
181 fixture.next();
192 assertEquals("Wrong next char", 't', it1.next());
254 fixture.next();
266 * @tests java.text.StringCharacterIterator.next()
271 assertEquals('i', fixture.next());
273 assertEquals('x', fixture.next());
[all...] |
| /external/skia/src/core/ |
| SkDrawing.cpp | 42 while ((child = iter.next()) != NULL) {
58 SkDrawing* next = NULL; local
63 next = fNextSibling;
67 fParent->fFirstChild = next;
139 SkDrawing* SkDrawing::B2FIter::next() { function in class:SkDrawing::B2FIter
143 SkDrawing* next = fChild->fNextSibling; local
144 if (next == fFirstChild) {
145 next = NULL;
147 fChild = next;
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RegionIteratorTest.java | 41 method = "next",
51 regionIterator.next(null);
55 assertTrue(regionIterator.next(rect));
61 assertFalse(regionIterator.next(rect));
72 assertTrue(regionIterator.next(rect));
77 assertTrue(regionIterator.next(rect));
82 assertTrue(regionIterator.next(rect));
88 assertFalse(regionIterator.next(rect));
99 assertTrue(regionIterator.next(rect));
104 assertTrue(regionIterator.next(rect))
[all...] |
| /external/e2fsprogs/lib/ss/ |
| get_readline.c | 47 char *tmp, *cp, *next; local
63 for (cp = tmp; cp; cp = next) {
64 next = strchr(cp, ':');
65 if (next)
66 *next++ = 0;
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| ContactParser.java | 61 final char next = lexer.lookAhead(1); local
62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
| /frameworks/base/core/java/android/os/ |
| MessageQueue.java | 39 // Indicates whether next() is blocked waiting in pollOnce() with a non-zero timeout.
110 final Message next() { method in class:MessageQueue
121 // Try to retrieve the next message. Return if found.
128 mMessages = msg.next;
129 msg.next = null;
208 msg.next = p;
215 p = p.next;
217 msg.next = prev.next;
218 prev.next = msg
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| ListResourceBundle.java | 63 String next = pEnum.nextElement(); local
64 if (!table.containsKey(next)) {
65 nextElement = next;
81 return local.next();
101 return it.next();
|
| /sdk/monkeyrunner/test/com/android/monkeyrunner/ |
| MonkeyRunnerOptionsTest.java | 48 assertEquals("arg1", i.next());
49 assertEquals("arg2", i.next());
56 assertEquals("--arg1", options.getArguments().iterator().next());
66 assertEquals("arg1", i.next());
67 assertEquals("--debug=True", i.next());
|
