| /libcore/luni/src/main/java/java/util/prefs/ |
| NodeSet.java | 14 list.add(nodes.next());
|
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| AbstractSessionContext.java | 83 private SSLSession next;
85 if (next != null) {
89 SSLSession session = i.next();
91 next = session;
95 next = null;
100 byte[] id = next.getId();
101 next = null;
127 SSLSession session = i.next();
145 SSLSession session = i.next();
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldMapEntryTest.java | 75 me = (Map.Entry)i.next();
89 Map.Entry me1 = (Map.Entry)i.next();
97 Map.Entry me1 = (Map.Entry)i.next();
108 me = (Map.Entry)i.next();
|
| RandomTest.java | 26 // functioning of next.
31 @Override protected synchronized int next(int bits) { return state.length(); } method in class:RandomTest.MyRandom
|
| /libcore/luni/src/test/java/libcore/util/ |
| CollectionUtilsTest.java | 46 assertEquals("a", i.next());
49 assertEquals("c", i.next());
50 assertEquals("d", i.next());
57 assertEquals("e", i.next());
|
| /libcore/support/src/test/java/tests/support/ |
| Support_UnmodifiableMapTest.java | 65 Map.Entry<?, ?> me = (Map.Entry<?, ?>) entrySetIterator.next();
134 keySet.contains(it.next()));
148 objArray[counter] == it.next());
157 objArray[counter] == it.next());
|
| /ndk/sources/cxx-stl/stlport/src/ |
| cxa.c | 60 struct exit_function_list *next; member in struct:exit_function_list
120 for (l = __exit_funcs; l != NULL; l = l->next) {
136 l->next = __exit_funcs;
171 for (funcs = __exit_funcs; funcs; funcs = funcs->next) {
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| BoxBlurFilter.java | 90 // Slide to the next pixel, adding the new rightmost pixel and
93 int next = in[read + sample(x + RADIUS + 1, width, mode)]; local
94 red += ((next & RED_MASK) - (prev & RED_MASK)) >> RED_MASK_SHIFT;
95 green += ((next & GREEN_MASK) - (prev & GREEN_MASK)) >> GREEN_MASK_SHIFT;
96 blue += (next & BLUE_MASK) - (prev & BLUE_MASK);
|
| /packages/apps/Mms/src/com/android/mms/transaction/ |
| Observable.java | 72 mIterator.next().update(this);
|
| /prebuilt/darwin-x86/toolchain/arm-linux-androideabi-4.4.x/include/ |
| bfdlink.h | 122 struct bfd_link_hash_entry *next;
129 struct bfd_link_hash_entry *next;
136 struct bfd_link_hash_entry *next;
143 struct bfd_link_hash_entry *next;
167 next field in the bfd_link_hash_entry structure. */
209 struct bfd_sym_chain *next;
625 /* Next link_order in chain. */
626 struct bfd_link_order *next;
714 /* Next glob pattern for this version. */
715 struct bfd_elf_version_expr *next;
121 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon17878::__anon17879
128 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon17878::__anon17880
135 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon17878::__anon17881
142 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon17878::__anon17882
208 struct bfd_sym_chain *next; member in struct:bfd_sym_chain
623 struct bfd_link_order *next; member in struct:bfd_link_order
712 struct bfd_elf_version_expr *next; member in struct:bfd_elf_version_expr
745 struct bfd_elf_version_deps *next; member in struct:bfd_elf_version_deps
755 struct bfd_elf_version_tree *next; member in struct:bfd_elf_version_tree
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/include/ |
| bfdlink.h | 122 struct bfd_link_hash_entry *next;
129 struct bfd_link_hash_entry *next;
136 struct bfd_link_hash_entry *next;
143 struct bfd_link_hash_entry *next;
167 next field in the bfd_link_hash_entry structure. */
209 struct bfd_sym_chain *next;
625 /* Next link_order in chain. */
626 struct bfd_link_order *next;
714 /* Next glob pattern for this version. */
715 struct bfd_elf_version_expr *next;
121 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon19301::__anon19302
128 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon19301::__anon19303
135 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon19301::__anon19304
142 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon19301::__anon19305
208 struct bfd_sym_chain *next; member in struct:bfd_sym_chain
623 struct bfd_link_order *next; member in struct:bfd_link_order
712 struct bfd_elf_version_expr *next; member in struct:bfd_elf_version_expr
745 struct bfd_elf_version_deps *next; member in struct:bfd_elf_version_deps
755 struct bfd_elf_version_tree *next; member in struct:bfd_elf_version_tree
[all...] |
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/include/ |
| bfdlink.h | 115 struct bfd_link_hash_entry *next;
122 struct bfd_link_hash_entry *next;
129 struct bfd_link_hash_entry *next;
136 struct bfd_link_hash_entry *next;
169 next field in the bfd_link_hash_entry structure. */
208 struct bfd_sym_chain *next;
586 /* Next link_order in chain. */
587 struct bfd_link_order *next;
675 /* Next glob pattern for this version. */
676 struct bfd_elf_version_expr *next;
114 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon21268::__anon21269
121 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon21268::__anon21270
128 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon21268::__anon21271
135 struct bfd_link_hash_entry *next; member in struct:bfd_link_hash_entry::__anon21268::__anon21272
207 struct bfd_sym_chain *next; member in struct:bfd_sym_chain
584 struct bfd_link_order *next; member in struct:bfd_link_order
673 struct bfd_elf_version_expr *next; member in struct:bfd_elf_version_expr
706 struct bfd_elf_version_deps *next; member in struct:bfd_elf_version_deps
716 struct bfd_elf_version_tree *next; member in struct:bfd_elf_version_tree
[all...] |
| /system/core/include/cutils/ |
| config_utils.h | 29 cnode *next; member in struct:cnode
|
| /system/core/libcutils/ |
| config_utils.c | 44 for(node = root->first_child; node; node = node->next)
58 root->last_child->next = node;
119 char next; member in struct:__anon25779
130 if(cs->next != 0) {
131 c = cs->next;
132 cs->next = 0;
212 cs->next = *data;
297 cs.next = 0;
326 cur = cur->next;
|
| /system/core/libzipfile/ |
| private.h | 18 struct Zipentry* next;
member in struct:Zipentry
|
| /system/extras/ext4_utils/ |
| allocate.c | 41 struct region *next; member in struct:region
78 reg->prev->next = reg->next;
80 if (reg->next)
81 reg->next->prev = reg->prev;
84 list->first = reg->next;
89 reg->next = NULL;
102 list->last->next = reg;
106 reg->next = NULL;
112 for (; reg; reg = reg->next) {
613 struct region *next; local
751 struct region *next = reg->next; local
758 struct region *next = reg->next; local
[all...] |
| /external/quake/quake/src/QW/client/ |
| r_part.c | 81 particles[i].next = &particles[i+1];
82 particles[r_numparticles-1].next = NULL;
119 free_particles = p->next;
120 p->next = active_particles;
150 free_particles = p->next;
151 p->next = active_particles;
194 free_particles = p->next;
195 p->next = active_particles;
247 free_particles = p->next;
248 p->next = active_particles
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 88 * Nodes next v v v v v
100 * basic idea in these lists is to mark the "next" pointers of
108 * use direct CAS'able next pointers. On deletion, instead of
122 * algorithm of changing the next-pointer of a deleted node so
158 * n's next pointer.
160 * 2. CAS n's next pointer to point to a new marker node.
168 * 3. CAS b's next pointer over both n and its marker.
183 * just (b, n, f), although the next field of a marker is
184 * immutable, and once a next field is CAS'ed to point to a
195 * Index levels are maintained as lists with volatile next fields
367 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node
2148 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter
2200 public V next() { method in class:ConcurrentSkipListMap.ValueIterator
2208 public K next() { method in class:ConcurrentSkipListMap.KeyIterator
2216 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator
2953 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter
3030 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator
3038 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator
3046 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator
[all...] |
| /external/dnsmasq/src/ |
| network.c | 64 for (bridge = daemon->bridges; bridge; bridge = bridge->next)
66 for (alias = bridge->alias; alias; alias = alias->next)
92 for (tmp = daemon->if_names; tmp; tmp = tmp->next)
96 for (tmp = daemon->if_addrs; tmp; tmp = tmp->next)
111 for (tmp = daemon->if_except; tmp; tmp = tmp->next)
129 for (iface = *irecp; iface; iface = iface->next)
158 for (lo = daemon->if_names; lo; lo = lo->next)
171 lo->next = daemon->if_names;
180 for (tmp = daemon->dhcp_except; tmp; tmp = tmp->next)
197 iface->next = *irecp
774 char *next = s; local
[all...] |
| /external/libxml2/ |
| schematron.c | 60 node = node->next; \
86 xmlSchematronTestPtr next; /* the next test in the list */ member in struct:_xmlSchematronTest
102 xmlSchematronRulePtr next; /* the next rule in the list */ member in struct:_xmlSchematronRule
103 xmlSchematronRulePtr patnext;/* the next rule in the pattern list */
119 xmlSchematronPatternPtr next;/* the next pattern in the list */ member in struct:_xmlSchematronPattern
340 ret->next = NULL;
346 while (prev->next != NULL
361 xmlSchematronTestPtr next; local
453 xmlSchematronRulePtr next; local
518 xmlSchematronPatternPtr next; local
[all...] |
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 25 VEdge* next = this;
28 prev->fPrev->fNext = next;
29 next->fPrev = prev->fPrev;
31 // insert prev after next
32 prev->fNext = next->fNext;
33 next->fNext->fPrev = prev;
34 next->fNext = prev;
35 prev->fPrev = next;
262 VEdge* next = edge->fNext;
266 edge = next;
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/wps/ |
| wps_upnp.c | 288 a->next->prev = a->prev;
289 a->prev->next = a->next;
291 if (a == a->next) {
296 *listp = a->next;
320 *listp = a->next = a->prev = a;
322 a->next = *listp;
324 a->prev->next = a;
325 a->next->prev = a;
540 s = s_old->next;
[all...] |
| /external/elfutils/src/ |
| ld.c | 214 struct file_list *next; member in struct:file_list
429 while ((runp = runp->next) != h->last);
659 newp->next = NULL;
761 file which is named next. Do this by remembering a pointer to
762 the pointer which will point to the next object. */
848 runp = first = ld_state.needed->next;
852 struct usedfiles *next = runp->next; local
860 runp = next;
980 input_file_list = input_file_list->next;
[all...] |
| /external/chromium/third_party/libevent/ |
| evrpc.c | 124 TAILQ_INSERT_TAIL(head, hook, next);
133 TAILQ_FOREACH(hook, head, next) {
135 TAILQ_REMOVE(head, hook, next);
172 TAILQ_FOREACH(hook, head, next) {
217 TAILQ_INSERT_TAIL(&base->registered_rpcs, rpc, next);
236 TAILQ_FOREACH(rpc, &base->registered_rpcs, next) {
244 TAILQ_REMOVE(&base->registered_rpcs, rpc, next);
416 TAILQ_REMOVE(&pool->requests, request, next);
422 TAILQ_REMOVE(&pool->connections, connection, next);
446 TAILQ_INSERT_TAIL(&pool->connections, connection, next);
[all...] |
| /external/iproute2/tc/ |
| m_ematch.c | 136 for (e = ematch_list; e; e = e->next) {
157 e->next = ematch_list;
178 for (t = tree; t; t = t->next) {
217 if (e->parse_eopt(n, &hdr, t->args->next) < 0)
236 for (t = head; t->next; t = t->next);
237 t->next = tree->child;
244 tree = tree->next;
247 for (i = 0, t = head; t; t = t->next, i++)
250 for (t = head; t; t = t->next)
[all...] |
