| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| ServiceLoaderTest.java | 86 assertEquals("ImplementationOfService", itr.next().myNameIs());
98 assertEquals("ImplementationOfService", ((Service) itr.next())
111 itr.next();
137 itr.next();
161 itr.next();
187 assertEquals("ImplementationOfService", ((Service) itr.next())
196 itr.next();
207 .next()).myNameIs());
214 String name = ((ServiceMoreThanOne) itr.next()).myNameIs();
217 ((ServiceMoreThanOne) itr.next()).myNameIs())
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrAllocPool.cpp | 20 static Block* Create(size_t size, Block* next) {
24 block->fNext = next;
71 Block* next = block->fNext; local
73 block = next;
96 Block* next = fBlock->fNext; local
98 fBlock = next;
|
| /external/e2fsprogs/debugfs/ |
| ncheck.c | 105 goto next;
111 goto next;
114 goto next;
122 goto next;
131 goto next;
137 next:
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedBytes.java | 127 int next = toInt(array[i]); local
128 if (next < min) {
129 min = next;
147 int next = toInt(array[i]); local
148 if (next > max) {
149 max = next;
|
| UnsignedInts.java | 86 int next = flip(array[i]); local
87 if (next < min) {
88 min = next;
106 int next = flip(array[i]); local
107 if (next > max) {
108 max = next;
|
| /external/qemu/ |
| async.c | 124 QEMUBH *next; member in struct:QEMUBH
133 bh->next = async_context->first_bh;
144 for (bh = async_context->first_bh; bh; bh = bh->next) {
159 *bhp = bh->next;
162 bhp = &bh->next;
201 for (bh = async_context->first_bh; bh; bh = bh->next) {
|
| /external/skia/src/gpu/ |
| GrAllocPool.cpp | 20 static Block* Create(size_t size, Block* next) {
24 block->fNext = next;
71 Block* next = block->fNext; local
73 block = next;
96 Block* next = fBlock->fNext; local
98 fBlock = next;
|
| /external/tcpdump/ |
| print-igrp.c | 84 u_int nint, nsys, next; local
94 next = EXTRACT_16BITS(&hdr->ig_nx);
103 next);
115 } else if (next > 0) {
118 --next;
126 if (nint == 0 && nsys == 0 && next == 0)
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| Semaphore.java | 161 int next = current + releases; local
162 if (next < current) // overflow
164 if (compareAndSetState(current, next))
172 int next = current - reductions; local
173 if (next > current) // underflow
175 if (compareAndSetState(current, next))
266 * semaphore and the current thread is next to be assigned a permit; or
296 * semaphore and the current thread is next to be assigned a permit.
351 * semaphore and the current thread is next to be assigned a permit; or
414 * methods for this semaphore, the current thread is next to be assigne
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
49 assert(i == next(l1.begin()));
69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
79 assert(i == next(l1.begin()));
99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| emplace_hint.pass.cpp | 43 assert(r == next(c.begin()));
50 assert(r == next(c.begin()));
54 r = next(r, 2);
75 assert(r == next(c.begin()));
82 assert(r == next(c.begin()));
86 r = next(r, 2);
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| plurrule.cpp | 312 while (lastChain->next !=NULL) {
313 lastChain = lastChain->next;
316 while (orNode->next != NULL) {
317 orNode = orNode->next;
319 orNode->next= new OrConstraint();
320 orNode=orNode->next;
321 orNode->next=NULL;
359 while (ruleChain->next!=NULL){
360 ruleChain=ruleChain->next;
362 ruleChain=ruleChain->next=new RuleChain()
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| cache.cc | 29 LRUHandle* next; member in struct:leveldb::__anon14430::LRUHandle
40 if (next == this) {
118 LRUHandle* next = h->next_hash; local
123 h = next;
164 // lru.prev is newest entry, lru.next is oldest entry.
173 lru_.next = &lru_;
178 for (LRUHandle* e = lru_.next; e != &lru_; ) {
179 LRUHandle* next = e->next; local
182 e = next;
[all...] |
| /external/libusb/libusb/ |
| libusbi.h | 40 struct list_head *prev, *next; member in struct:list_head
57 for (pos = list_entry((head)->next, typeof(*pos), member); \
59 pos = list_entry(pos->member.next, typeof(*pos), member))
62 for (pos = list_entry((head)->next, typeof(*pos), member), \
63 n = list_entry(pos->member.next, typeof(*pos), member); \
65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
67 #define list_empty(entry) ((entry)->next == (entry))
71 entry->prev = entry->next = entry;
76 entry->next = head->next;
[all...] |
| /external/openssh/ |
| monitor_mm.c | 58 RB_GENERATE(mmtree, mm_share, next, mm_compare)
121 struct mm_share *mms, *next; local
123 for (mms = RB_ROOT(head); mms; mms = next) {
124 next = RB_NEXT(mmtree, head, mms);
231 if (RB_LEFT(prev, next)) {
232 prev = RB_LEFT(prev, next);
233 while (RB_RIGHT(prev, next))
234 prev = RB_RIGHT(prev, next);
236 if (RB_PARENT(prev, next) &&
237 (prev == RB_RIGHT(RB_PARENT(prev, next), next))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/dropbear/ |
| cli-runopts.c | 75 char ** next = 0; local
78 int nextiskey = 0; /* A flag if the next argument is a keyfile */
139 if (next) {
141 *next = argv[i];
142 if (*next == NULL) {
145 next = NULL;
157 next = &cli_opts.remoteport;
195 next = &cli_opts.username;
219 next = &dummy;
227 if (next && strlen(argv[i]) > 2)
[all...] |
| /external/elfutils/libebl/ |
| eblstrtab.c | 76 struct Ebl_Strent *next; member in struct:Ebl_Strent
86 struct memoryblock *next; member in struct:memoryblock
145 newmem->next = st->memory;
162 mb = mb->next;
192 newstr->next = NULL;
260 for (struct Ebl_Strent *subs = (*sep)->next; subs != NULL;
261 subs = subs->next)
277 newstr->next = (*sep)->next;
278 (*sep)->next = newstr
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/ppp/pppd/plugins/radius/ |
| dict.c | 98 vdict->next = vendor_dictionaries;
201 attr->next = vdict->attributes;
204 attr->next = dictionary_attributes;
262 dval->next = dictionary_values;
306 attr = attr->next;
318 attr = attr->next;
344 attr = attr->next;
355 attr = attr->next;
357 dict = dict->next;
382 val = val->next;
[all...] |
| /external/smack/src/org/jivesoftware/smack/provider/ |
| ProviderManager.java | 174 parser.next();
175 parser.next();
177 parser.next();
178 parser.next();
180 parser.next();
181 parser.next();
207 parser.next();
208 parser.next();
210 parser.next();
211 parser.next();
[all...] |
| /external/valgrind/main/coregrind/ |
| m_hashtable.c | 47 UInt iterChain; // next chain to be traversed by the iterator
128 VgHashNode* next = node->next; local
130 node->next = chains[chain];
132 node = next;
146 node->next = table->chains[chain];
166 curr = curr->next;
183 *prev_next_ptr = curr->next;
187 prev_next_ptr = &(curr->next);
188 curr = curr->next;
[all...] |
| /external/wpa_supplicant_8/src/radius/ |
| radius_client.c | 108 * next_try - Time for the next transmission attempt
118 * next_wait - Next retransmission wait time in seconds
140 * next - Next message in the list
142 struct radius_msg_list *next; member in struct:radius_msg_list
226 * next_radius_identifier - Next RADIUS message identifier to use
395 prev->next = entry->next;
397 radius->msgs = entry->next;
400 entry = entry->next;
433 struct hostapd_radius_server *next, *old; local
457 struct hostapd_radius_server *next, *old; local
[all...] |
