| /external/ipsec-tools/src/racoon/ |
| isakmp_unity.c | 297 netentry = netentry->next;
314 for (nentry = *list; nentry != NULL; nentry = nentry->next)
330 nentry->next = NULL;
340 while (tmpentry->next != NULL)
341 tmpentry = tmpentry->next;
342 tmpentry->next = nentry;
361 netentry = netentry->next;
387 netentry = netentry->next;
414 netentry = netentry->next;
|
| /external/oprofile/daemon/liblegacy/ |
| opd_proc.c | 80 list_add(&proc->next, &opd_procs[proc_hash(tid)]);
94 proc = list_entry(pos, struct opd_proc, next);
97 list_del(&proc->next);
98 list_add(&proc->next, &opd_procs[hash]);
173 struct opd_map * map = list_entry(pos, struct opd_map, next);
268 struct opd_map * map = list_entry(pos, struct opd_map, next);
308 /* proc->name will be set when the next mapping occurs */
350 list_entry(pos, struct opd_proc, next);
367 list_del(&proc->next);
419 struct opd_map * map = list_entry(pos, struct opd_map, next);
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| ap_list.c | 33 * list and tail->next = NULL. Entries are moved to the head of the list
77 ap->next = iface->ap_list;
85 iface->ap_list = ap->next;
87 ap->prev->next = ap->next;
89 if (ap->next)
90 ap->next->prev = ap->prev;
172 ap = ap->next;
192 s = s->next;
366 ap = ap->next;
[all...] |
| /bionic/libc/bionic/ |
| malloc_debug_leak.c | 126 entry = entry->next;
157 entry->next = gHashTable.slots[slot];
165 if (entry->next != NULL) {
166 entry->next->prev = entry;
188 e1 = e1->next;
199 HashEntry* next = entry->next; local
201 if (prev != NULL) entry->prev->next = next;
202 if (next != NULL) entry->next->prev = prev
[all...] |
| /bionic/libc/kernel/common/linux/ |
| dm-ioctl.h | 47 uint32_t next; member in struct:dm_target_spec
61 uint32_t next; member in struct:dm_name_list
66 uint32_t next; member in struct:dm_target_versions
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| DashPathEffectTest.java | 78 if (iterator.next()) {
105 next(); method
110 * Determine whether to draw the current pixel and move on to the next.
112 boolean next() { method in class:DashPathEffectTest.PatternIterator
|
| /development/ndk/platforms/android-3/include/linux/ |
| dm-ioctl.h | 47 uint32_t next; member in struct:dm_target_spec
61 uint32_t next; member in struct:dm_name_list
66 uint32_t next; member in struct:dm_target_versions
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractListTest.java | 70 Object obj = i.next();
85 it.next();
87 it.next();
103 assertTrue("Should have next", lit.hasNext());
104 tempValue = (Integer) lit.next();
105 assertTrue("next returned wrong value. Wanted 3, got: " + tempValue,
113 lit2.next();
151 lit.next();
153 lit.next();
248 it.next();
[all...] |
| WeakHashMapTest.java | 181 Map.Entry<Object, Object> entry = it.next();
201 .next(), entrySet.iterator().next());
208 it.next();
212 it.next();
222 it.next();
229 it.next();
252 Map.Entry entry = (Map.Entry) it.next();
356 Object key = it.next();
381 iter.next();
[all...] |
| /external/apache-harmony/security/src/test/api/java.injected/java/security/ |
| SecureRandomTest.java | 58 if (sr.next(1) != 1 || sr.next(2) != 3 || sr.next(3) != 7) {
59 fail("next failed");
|
| /external/bison/src/ |
| nullable.c | 40 struct rule_list *next; member in struct:rule_list
98 p->next = rsets[*rp - ntokens];
119 for (p = rsets[*s1++ - ntokens]; p; p = p->next)
|
| /external/bluetooth/glib/gio/inotify/ |
| inotify-missing.c | 110 for (l = missing_sub_list; l; l = l->next)
131 for (l = nolonger_missing; l ; l = l->next)
161 for (l = missing_sub_list; l; l = l->next)
|
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXPolicyNode.java | 140 _expectedPolicies.add(new String((String)_iter.next()));
147 _policyQualifiers.add(new String((String)_iter.next()));
161 PKIXPolicyNode _child = ((PKIXPolicyNode)_iter.next()).copy();
|
| /external/chromium/base/ |
| tracked_objects_unittest.cc | 28 EXPECT_TRUE(!data->next());
44 EXPECT_TRUE(!data->next());
67 EXPECT_TRUE(!data->next());
|
| /external/chromium/net/disk_cache/ |
| mem_entry_impl.h | 66 MemEntryImpl* next() const { function in class:disk_cache::MemEntryImpl
74 void set_next(MemEntryImpl* next) {
75 next_ = next;
|
| /external/dbus/dbus/ |
| dbus-list.h | 37 DBusList *next; /**< Next list node. */ member in struct:DBusList
93 #define _dbus_list_get_next_link(list, link) ((link)->next == *(list) ? NULL : (link)->next)
|
| /external/e2fsprogs/e2fsck/ |
| mtrace.h | 142 size_t next; /* Index of next free cluster. */ member in struct:__anon5322::__anon5326
166 struct list *next; member in struct:list
176 struct alignlist *next; member in struct:alignlist
|
| /external/e2fsprogs/misc/ |
| fsck.c | 182 char *word, *next; local
189 next = skip_over_word(word);
190 if (*next)
191 *next++ = 0;
192 *buf = next;
259 fs->next = NULL;
264 filesys_last->next = fs;
373 for (fs = filesys_info; fs; fs = fs->next) {
388 for (fs = filesys_info; fs; fs = fs->next) {
421 for (inst = instance_list; inst; inst = inst->next) {
[all...] |
| /external/elfutils/libdw/ |
| dwarf_getaranges.c | 27 struct arangelist *next; member in struct:arangelist
109 /* Round the address to the next multiple of 2*address_size. */
151 new_arange->next = arangelist;
178 arangelist = arangelist->next;
|
| dwarf_getsrclines.c | 29 struct filelist *next; member in struct:filelist
35 struct linelist *next; member in struct:linelist
57 new_line->next = linelist; \
128 /* The next element of the header is the version identifier. */
136 /* Next comes the header length. */
144 /* Next the minimum instruction length. */
174 struct dirlist *next; member in struct:dirlist
179 .next = NULL
195 new_dir->next = dirlist;
209 dirlist = dirlist->next;
[all...] |
| /external/elfutils/src/ |
| ld.h | 57 /* The next file given at the command line. */
58 struct usedfiles *next; member in struct:usedfiles
64 explain why we cannot simply use the 'next' pointer and have a
67 group, contains the only existing pointer to the next file we
69 'next' pointer in a single-linked list. Therefore we cannot
170 /* Pointer to next section which is put in the given output
172 struct scninfo *next; member in struct:usedfiles::scninfo
258 /* The next path to search. */
259 struct pathelement *next; member in struct:pathelement
447 /* Pointer to next/previous symbol on whatever list the symbol is. *
448 struct symbol *next; member in struct:symbol
464 struct filename_list *next; member in struct:filename_list
544 struct input_rule *next; member in struct:input_rule
573 struct output_rule *next; member in struct:output_rule
582 struct output_segment *next; member in struct:output_segment
608 struct id_list *next; member in struct:id_list
615 struct version *next; member in struct:version
952 struct member *next; member in struct:ld_state::scngroup::member
956 struct scngroup *next; member in struct:ld_state::scngroup
[all...] |
| /external/guava/src/com/google/common/collect/ |
| MapMaker.java | 355 int hash, ReferenceEntry<K, V> next) {
356 return (next == null)
358 : new LinkedWeakEntry<K, V>(internals, key, hash, next);
384 int hash, ReferenceEntry<K, V> next) {
385 return (next == null)
387 : new LinkedSoftEntry<K, V>(internals, key, hash, next);
413 int hash, ReferenceEntry<K, V> next) {
414 return (next == null)
417 internals, key, hash, next);
453 int hash, ReferenceEntry<K, V> next);
924 final ReferenceEntry<K, V> next; field in class:MapMaker.LinkedStrongEntry
982 final ReferenceEntry<K, V> next; field in class:MapMaker.LinkedSoftEntry
1040 final ReferenceEntry<K, V> next; field in class:MapMaker.LinkedWeakEntry
[all...] |
| /external/icu4c/samples/break/ |
| break.cpp | 47 for (int32_t end = boundary.next();
49 start = end, end = boundary.next())
71 int32_t end = boundary.next();
|
| /external/iproute2/include/ |
| iptables.h | 29 struct iptables_rule_match *next; member in struct:iptables_rule_match
37 struct iptables_match *next; member in struct:iptables_match
90 struct iptables_target *next; member in struct:iptables_target
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Analyzer.java | 141 queue.add(iter.next());
171 iter.next();
194 // Merge the state before the jsr into the next instruction
202 // Can advance to next instruction
260 iter.next();
261 int next = iter.lookAhead(); local
263 iter.next();
265 return next;
306 private void mergeJsr(IntQueue queue, Frame frame, Subroutine sub, int pos, int next) throws BadBytecode {
310 Frame old = frames[next];
[all...] |
