/external/wpa_supplicant_8/hostapd/src/eap_server/ |
H A D | eap_server_methods.c | 28 for (m = eap_methods; m; m = m->next) { 48 for (m = eap_methods; m; m = m->next) { 116 for (m = eap_methods; m; m = m->next) { 127 last->next = method; 147 eap_methods = eap_methods->next; 171 for (m = eap_methods; m; m = m->next) {
|
/external/wpa_supplicant_8/src/eap_server/ |
H A D | eap_server_methods.c | 28 for (m = eap_methods; m; m = m->next) { 48 for (m = eap_methods; m; m = m->next) { 116 for (m = eap_methods; m; m = m->next) { 127 last->next = method; 147 eap_methods = eap_methods->next; 171 for (m = eap_methods; m; m = m->next) {
|
/external/wpa_supplicant_8/wpa_supplicant/src/eap_server/ |
H A D | eap_server_methods.c | 28 for (m = eap_methods; m; m = m->next) { 48 for (m = eap_methods; m; m = m->next) { 116 for (m = eap_methods; m; m = m->next) { 127 last->next = method; 147 eap_methods = eap_methods->next; 171 for (m = eap_methods; m; m = m->next) {
|
/external/autotest/client/profilers/powertop/src/ |
H A D | suggestions.c | 43 struct suggestion *next; member in struct:suggestion 66 struct suggestion *next; local 67 next = ptr->next; 71 ptr = next; 96 new->next = suggestions; 139 ptr = ptr->next; 150 for (ptr = suggestions; ptr; ptr = ptr->next)
|
/external/curl/src/ |
H A D | slist_wc.c | 57 list->last->next = new_item; 58 list->last = list->last->next;
|
/external/dhcpcd-6.8.2/ |
H A D | control.h | 37 TAILQ_ENTRY(fd_data) next; member in struct:fd_data 45 TAILQ_ENTRY(fd_list) next; member in struct:fd_list
|
/external/e2fsprogs/misc/ |
H A D | fsck.h | 48 struct fs_info *next; member in struct:fs_info 66 struct fsck_instance *next; member in struct:fsck_instance
|
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
H A D | XMLTokener.java | 68 c = next(); 84 * Get the next XML outer token, trimming whitespace. There are two kinds 96 c = next(); 115 c = next(); 121 * Return the next entity. These entities are translated to Characters: 130 char c = next(); 146 * Returns the next XML meta token. This is used for skipping over <!...> 158 c = next(); 179 c = next(); 189 c = next(); [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | TransformedIterator.java | 47 public final T next() { method in class:TransformedIterator 48 return transform(backingIterator.next());
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
H A D | AtomicDoubleArray.java | 101 long next = doubleToRawLongBits(newValue); 102 longs.set(i, next); 114 // long next = doubleToRawLongBits(newValue); 115 // longs.lazySet(i, next); 127 long next = doubleToRawLongBits(newValue); 128 return longBitsToDouble(longs.getAndSet(i, next)); 184 long next = doubleToRawLongBits(nextVal); 185 if (longs.compareAndSet(i, current, next)) { 203 long next = doubleToRawLongBits(nextVal); 204 if (longs.compareAndSet(i, current, next)) { [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | UnmodifiableIteratorTest.java | 44 public String next() { 53 assertEquals("a", iterator.next());
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | RangeDateRule.java | 95 Range next = rangeAt(index); 97 while (result == null && next != null && !next.start.after(end)) 99 Range r = next; 100 next = rangeAt(index+1); 103 Date e = (next != null && !next.start.after(end)) ? next.start
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | RangeDateRule.java | 99 Range next = rangeAt(index); 101 while (result == null && next != null && !next.start.after(end)) 103 Range r = next; 104 next = rangeAt(index+1); 107 Date e = (next != null && !next.start.after(end)) ? next.start
|
/external/kmod/libkmod/ |
H A D | libkmod-list.c | 32 node->next = node; 47 list->prev->next = node; 49 node->next = list; 54 if (node->prev == node || node->next == node) 57 node->prev->next = node->next; 58 node->next->prev = node->prev; 60 return node->next; 72 node->next = list->next; [all...] |
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | initializer_list_compare_alloc.pass.cpp | 43 assert(*next(m.begin()) == V(2, 1)); 44 assert(*next(m.begin(), 2) == V(3, 1)); 67 assert(*next(m.begin()) == V(2, 1)); 68 assert(*next(m.begin(), 2) == V(3, 1)); 93 assert(*next(m.begin()) == V(2, 1)); 94 assert(*next(m.begin(), 2) == V(3, 1)); 117 assert(*next(m.begin()) == V(2, 1)); 118 assert(*next(m.begin(), 2) == V(3, 1));
|
/external/libcxx/test/std/containers/associative/set/set.cons/ |
H A D | copy.pass.cpp | 48 assert(*next(m.begin()) == 2); 49 assert(*next(m.begin(), 2) == 3); 56 assert(*next(mo.begin()) == 2); 57 assert(*next(mo.begin(), 2) == 3); 83 assert(*next(m.begin()) == 2); 84 assert(*next(m.begin(), 2) == 3); 91 assert(*next(mo.begin()) == 2); 92 assert(*next(mo.begin(), 2) == 3);
|
H A D | copy_assign.pass.cpp | 48 assert(*next(m.begin()) == 2); 49 assert(*next(m.begin(), 2) == 3); 56 assert(*next(mo.begin()) == 2); 57 assert(*next(mo.begin(), 2) == 3); 98 assert(*next(m.begin()) == 2); 99 assert(*next(m.begin(), 2) == 3); 106 assert(*next(mo.begin()) == 2); 107 assert(*next(mo.begin(), 2) == 3);
|
H A D | iter_iter_comp.pass.cpp | 45 assert(*next(m.begin()) == 2); 46 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | splice_after_range.pass.cpp | 93 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2), 94 next(c2.cbefore_begin(), f), next(c2.cbefore_begin(), l)); 109 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1), 110 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l)); 117 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1), 118 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l)); 137 c1.splice_after(next(c [all...] |
/external/libnl/lib/ |
H A D | hashtable.c | 66 node = node->next; 98 node = node->next; 130 node = node->next; 143 node->next = ht->nodes[key_hash]; 177 ht->nodes[key_hash] = node->next; 179 prev->next = node->next; 186 node = node->next;
|
/external/openssh/ |
H A D | monitor_mm.h | 32 RB_ENTRY(mm_share) next; member in struct:mm_share 46 RB_PROTOTYPE(mmtree, mm_share, next, mm_compare)
|
/external/selinux/restorecond/ |
H A D | stringslist.c | 45 ptr = ptr->next; 51 newptr->next = ptr; 53 prev->next = newptr; 65 ptr = ptr->next; 76 ptr = ptr->next; 86 from = from->next; 87 to = to->next; 98 ptr = ptr->next;
|
/external/syslinux/com32/lib/ |
H A D | onexit.c | 15 for (ap = __atexit_list; ap; ap = ap->next) { 32 as->next = __atexit_list;
|
/external/syslinux/com32/lib/syslinux/ |
H A D | memscan.c | 44 list_add(&entry->next, &syslinux_memscan_head); 68 list_for_each_entry(entry, &syslinux_memscan_head, next) {
|
/external/syslinux/core/lwip/src/core/ |
H A D | timers.c | 275 timeout->next = NULL; 292 timeout->next = next_timeout; 295 for(t = next_timeout; t != NULL; t = t->next) { 297 if (t->next == NULL || t->next->time > timeout->time) { 298 if (t->next != NULL) { 299 t->next->time -= timeout->time; 301 timeout->next = t->next; 302 t->next [all...] |