| /external/valgrind/main/memcheck/tests/ |
| wrap8.c | 20 struct _Lard* next; member in struct:_Lard
33 p->next = lard;
97 p_next = p->next;
|
| /external/webp/src/enc/ |
| token.c | 56 const VP8Tokens* const next = p->next_; local
58 p = next;
222 const VP8Tokens* const next = p->next_; local
223 const int N = (next == NULL) ? b->left_ : 0;
235 p = next;
|
| /external/wpa_supplicant_8/src/ap/ |
| preauth_auth.c | 33 struct rsn_preauth_interface *next; member in struct:rsn_preauth_interface
121 piface->next = hapd->preauth_iface;
141 piface = piface->next;
241 piface = piface->next;
|
| /external/wpa_supplicant_8/src/drivers/ |
| driver_ndis.h | 21 struct ndis_pmkid_entry *next; member in struct:ndis_pmkid_entry
|
| /external/wpa_supplicant_8/src/eap_server/ |
| eap_sim_db.h | 68 struct eap_sim_reauth *next; member in struct:eap_sim_reauth
|
| /external/wpa_supplicant_8/src/rsn_supp/ |
| pmksa_cache.h | 16 struct rsn_pmksa_cache_entry *next; member in struct:rsn_pmksa_cache_entry
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| ibss_rsn.h | 30 struct ibss_rsn_peer *next; member in struct:ibss_rsn_peer
|
| /external/zlib/src/contrib/infback9/ |
| inftree9.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
145 filled is at next and has curr index bits. The code being used is huff
197 next = *table; /* current table to fill in */
231 next[(huff >> drop) + fill] = this;
245 /* go to next symbol, update count, len */
259 next += 1U << curr;
261 /* determine length of next table */
281 (*table)[low].val = (unsigned short)(next - *table)
[all...] |
| /external/zlib/src/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
203 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = here;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /frameworks/av/media/libeffects/factory/ |
| EffectsFactory.h | 32 struct list_elem_s *next; member in struct:list_elem_s
41 struct list_sub_elem_s *next; member in struct:list_sub_elem_s
|
| /frameworks/base/core/java/android/os/ |
| Broadcaster.java | 44 r.next = r;
54 r = r.next;
64 reg.next = r;
66 r.prev.next = reg;
113 r = r.next;
160 r = r.next;
185 r = r.next;
204 Registration next; field in class:Broadcaster.Registration
|
| /frameworks/base/core/tests/coretests/src/android/util/ |
| LongSparseLongArrayTest.java | 107 keys.next();
109 return keys.next();
|
| /frameworks/opt/vcard/tests/src/com/android/vcard/tests/testutils/ |
| ExportTestProvider.java | 61 public Entity next() { method in class:ExportTestProvider.MockEntityIterator
62 return mIterator.next();
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/luni/tests/java/util/ |
| ScannerParseLargeFileBenchmarkTest.java | 36 scanner.next();
|
| /libcore/luni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 39 * Returns the next available reference from the queue, removing it in the
42 * @return the next available reference, or {@code null} if no reference is
67 * Returns the next available reference from the queue, removing it in the
77 * Returns the next available reference from the queue, removing it in the
84 * @return the next available reference, or {@code null} if no reference
153 Reference<?> next = unenqueued.pendingNext; local
155 list.pendingNext = next;
|
| /libcore/luni/src/main/java/java/text/ |
| BreakIterator.java | 58 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that
70 * text and the user calls {@code next()}, or when the current position is the
125 * for (int end = boundary.next(); end != BreakIterator.DONE; start = end, end = boundary.next()) {
154 * int end = boundary.next();
187 * Find the next word:
195 * int current = wb.next();
202 * current = wb.next();
214 * next. With the word-break iterator, the characters between two boundaries
217 * the beginning of a word: If the characters between this boundary and the next
449 public abstract int next(); method in class:BreakIterator
460 public abstract int next(int n); method in class:BreakIterator
[all...] |
| RuleBasedBreakIterator.java | 66 @Override public int next() { method in class:RuleBasedBreakIterator
67 return wrapped.next();
70 @Override public int next(int n) { method in class:RuleBasedBreakIterator
71 return wrapped.next(n);
|
| StringCharacterIterator.java | 211 * @return the character at the next index, or {@code DONE} if the next
214 public char next() { method in class:StringCharacterIterator
|
| /libcore/luni/src/main/java/java/util/ |
| Random.java | 89 protected synchronized int next(int bits) { method in class:Random
98 return next(1) != 0;
123 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53));
131 return (next(24) / 16777216f);
166 return next(32);
178 return (int) ((n * (long) next(31)) >> 31);
182 bits = next(31);
192 return ((long) next(32) << 32) + next(32)
[all...] |
| /libcore/luni/src/main/java/libcore/icu/ |
| NativeCollation.java | 38 public static native int next(long address); method in class:NativeCollation
|
| /libcore/luni/src/main/java/org/apache/harmony/security/asn1/ |
| DerInputStream.java | 51 public int next() throws IOException { method in class:DerInputStream
52 int tag = super.next();
|
| /libcore/luni/src/main/native/ |
| java_io_File.cpp | 104 // Returns the next filename, or NULL.
105 const char* next() { function in class:ScopedReaddir
146 while ((filename = dir.next()) != NULL) {
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldAndroidPipedStreamTest.java | 65 assertEquals(readByte, (byte) fib.next());
79 int toWrite = fib.next();
143 assertEquals("Error at " + countRead, fib.next(), readInt);
159 int toWrite = fib.next();
230 int toWrite = fib.next();
267 assertEquals("Error at " + i, readInt, fib.next());
275 public int next() { method in class:OldAndroidPipedStreamTest.Fibonacci
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| CollectionsTest.java | 53 i.next();
76 i.next();
|
| /libcore/support/src/test/java/tests/support/ |
| Support_ListTest.java | 119 elem = li.next();
130 assertTrue("listIterator(1)", li.next() == list.get(1));
152 assertTrue("list iterator next(): " + i, li.next() == list
158 assertTrue("list iterator next() exception: " + i, exception);
160 assertTrue("list iterator next() exception: " + i, !exception);
194 Object next = li.next(); local
195 assertTrue("list iterator add(), next(): " + next, next == list.get(1))
[all...] |
