HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 776 - 800 of 7540) sorted by null

<<31323334353637383940>>

  /external/ppp/pppd/plugins/radius/
clientid.c 19 struct map2id_s *next; member in struct:map2id_s
76 p->next = map2id_list;
115 for(p = map2id_list; p; p = p->next)
avpair.c 127 vp->next = (VALUE_PAIR *) NULL;
219 pair->next = (VALUE_PAIR *) NULL;
317 pair->next = NULL;
354 for (; vp != (VALUE_PAIR *) NULL && vp->attribute != attr; vp = vp->next)
381 lp->next = vp;
383 p = p->next;
420 vp = vp->next;
432 this_node = this_node->next;
437 vp = this_node->next;
438 this_node->next = b
457 VALUE_PAIR *next; local
    [all...]
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowSQLiteStatement.java 39 if (resultSet.next()) {
54 rs.next();
67 rs.next();
  /external/smack/src/org/jivesoftware/smackx/muc/
RoomInfo.java 93 this.description = ( descField == null || !(descField.getValues().hasNext()) )? "" : descField.getValues().next();
96 this.subject = ( subjField == null || !(subjField.getValues().hasNext()) ) ? "" : subjField.getValues().next();
100 .next());
  /external/smack/src/org/xbill/DNS/
Compression.java 18 Entry next; field in class:Compression.Entry
47 entry.next = table[row];
63 for (Entry entry = table[row]; entry != null; entry = entry.next) {
  /external/srtp/crypto/include/
crypto_kernel.h 79 struct kernel_cipher_type *next; member in struct:kernel_cipher_type
89 struct kernel_auth_type *next; member in struct:kernel_auth_type
98 struct kernel_debug_module *next; member in struct:kernel_debug_module
  /external/valgrind/main/memcheck/tests/
wrap5.c 12 struct _Lard* next; member in struct:_Lard
26 p->next = lard;
90 p_next = p->next;
  /frameworks/av/include/drm/
DrmConstraints.h 83 const String8& next();
106 String8 next();
119 String8 key = keyIt.next();
DrmMetadata.h 47 const String8& next();
69 String8 next();
82 String8 key = keyIt.next();
  /frameworks/av/media/libstagefright/
MediaBufferGroup.cpp 32 MediaBuffer *next; local
34 buffer = next) {
35 next = buffer->nextBuffer();
  /libcore/luni/src/main/java/java/util/
PropertyResourceBundle.java 93 String next = pEnum.nextElement(); local
94 if (!resources.containsKey(next)) {
95 nextElement = next;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/
emplace_hint.pass.cpp 41 assert(r == next(m.begin()));
43 assert(next(m.begin())->first == 1);
44 assert(next(m.begin())->second == DefaultOnly());
49 assert(r == next(m.begin()));
51 assert(next(m.begin())->first == 1);
52 assert(next(m.begin())->second == DefaultOnly());
107 assert(r == next(m.begin()));
109 assert(next(m.begin())->first == 1);
110 assert(next(m.begin())->second == DefaultOnly());
115 assert(r == next(m.begin()))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/
emplace_hint.pass.cpp 41 assert(r == next(m.begin()));
43 assert(next(m.begin())->first == 1);
44 assert(next(m.begin())->second == DefaultOnly());
49 assert(r == next(m.begin(), 2));
51 assert(next(m.begin(), 2)->first == 1);
52 assert(next(m.begin(), 2)->second == DefaultOnly());
107 assert(r == next(m.begin()));
109 assert(next(m.begin())->first == 1);
110 assert(next(m.begin())->second == DefaultOnly());
115 assert(r == next(m.begin(), 2))
    [all...]
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/utility/
in_place_factory.hpp 61 for(char* next = address = this->BOOST_NESTED_TEMPLATE apply<T>(address);
63 this->BOOST_NESTED_TEMPLATE apply<T>(next = next+sizeof(T));
  /packages/apps/Bluetooth/src/com/android/bluetooth/gatt/
ContextMap.java 128 App entry = i.next();
157 Connection connection = i.next();
172 App entry = i.next();
185 App entry = i.next();
199 Connection connection = i.next();
211 Connection connection = ii.next();
228 Connection connection = i.next();
241 Connection connection = i.next();
251 Connection connection = i.next();
265 App entry = i.next();
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow-inline.h 86 /* Advance the hashtable iterator pointed to by HTI to the next element of the
130 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
158 /* Get the number of the next statement uid to be allocated. */
165 /* Set the number of the next statement uid to be allocated. */
172 /* Set the number of the next statement uid to be allocated. */
204 linknode->prev->next = linknode->next;
205 linknode->next->prev = linknode->prev;
207 linknode->next = NULL;
217 linknode->next = list->next
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow-inline.h 86 /* Advance the hashtable iterator pointed to by HTI to the next element of the
130 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
158 /* Get the number of the next statement uid to be allocated. */
165 /* Set the number of the next statement uid to be allocated. */
172 /* Set the number of the next statement uid to be allocated. */
204 linknode->prev->next = linknode->next;
205 linknode->next->prev = linknode->prev;
207 linknode->next = NULL;
217 linknode->next = list->next
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow-inline.h 86 /* Advance the hashtable iterator pointed to by HTI to the next element of the
130 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
158 /* Get the number of the next statement uid to be allocated. */
165 /* Set the number of the next statement uid to be allocated. */
172 /* Set the number of the next statement uid to be allocated. */
204 linknode->prev->next = linknode->next;
205 linknode->next->prev = linknode->prev;
207 linknode->next = NULL;
217 linknode->next = list->next
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow-inline.h 86 /* Advance the hashtable iterator pointed to by HTI to the next element of the
130 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
158 /* Get the number of the next statement uid to be allocated. */
165 /* Set the number of the next statement uid to be allocated. */
172 /* Set the number of the next statement uid to be allocated. */
204 linknode->prev->next = linknode->next;
205 linknode->next->prev = linknode->prev;
207 linknode->next = NULL;
217 linknode->next = list->next
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
seq_instr.h 31 struct snd_seq_kcluster *next; member in struct:snd_seq_kcluster
46 struct snd_seq_kinstr *next; member in struct:snd_seq_kinstr
86 struct snd_seq_kinstr_ops *next; member in struct:snd_seq_kinstr_ops
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/
seq_instr.h 31 struct snd_seq_kcluster *next; member in struct:snd_seq_kcluster
46 struct snd_seq_kinstr *next; member in struct:snd_seq_kinstr
86 struct snd_seq_kinstr_ops *next; member in struct:snd_seq_kinstr_ops
  /system/core/libdiskconfig/
write_lst.c 53 item->next = (*lst);
63 temp_wr = lst->next;
72 for(; lst; lst = lst->next) {
  /external/chromium_org/third_party/icu/source/test/intltest/
itercoll.cpp 45 * Test for CollationElementIterator previous and next for the whole set of
184 if (U_FAILURE(status) || iter->next(status) != UCOL_NULLORDER) {
234 int32_t c = iter2->next(status);
241 errln("iter2->next() returned an error.");
246 c = iter2->next(status);
277 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
283 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
349 int32_t e0 = i->next(status); // save the first collation element
353 errln("call to i->next() failed. err=%s", u_errorName(status));
365 i->next(status); // but only use up half of i
    [all...]
  /external/icu4c/test/intltest/
itercoll.cpp 45 * Test for CollationElementIterator previous and next for the whole set of
184 if (U_FAILURE(status) || iter->next(status) != UCOL_NULLORDER) {
234 int32_t c = iter2->next(status);
241 errln("iter2->next() returned an error.");
246 c = iter2->next(status);
277 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
283 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
349 int32_t e0 = i->next(status); // save the first collation element
353 errln("call to i->next() failed. err=%s", u_errorName(status));
365 i->next(status); // but only use up half of i
    [all...]
  /external/qemu/telephony/
sysdeps_posix.c 86 SysChannel next; member in struct:SysChannelRec_
110 _s_free_channels = channel->next;
111 channel->next = NULL;
135 channel->next = _s_free_channels;
157 pnode = &node->next;
159 *pnode = channel->next;
160 channel->next = NULL;
168 channel->next = _s_channels;
186 _s_channels0[nn].next = &_s_channels0[nn+1];
316 SysTimer next; member in struct:SysTimerRec_
    [all...]

Completed in 728 milliseconds

<<31323334353637383940>>