| /external/oprofile/module/x86/ |
| op_nmi.c | 310 static int pmc_add_sysctls(ctl_table * next)
312 ctl_table * start = next;
318 next->ctl_name = 1;
319 next->procname = names[i];
320 next->mode = 0755;
325 next->child = tab;
334 next++;
340 next = start;
342 kfree(next->child);
343 next++
[all...] |
| /frameworks/base/core/java/com/android/internal/widget/ |
| PasswordEntryKeyboardHelper.java | 251 Keyboard next = null; local
253 next = mSymbolsKeyboard;
255 next = mQwertyKeyboard;
257 if (next != null) {
258 mKeyboardView.setKeyboard(next);
273 PasswordEntryKeyboard next = null; local
278 next = isAlphaMode ? mQwertyKeyboardShifted : mSymbolsKeyboardShifted;
281 next = isAlphaMode ? mQwertyKeyboardShifted : mSymbolsKeyboardShifted;
284 next = isAlphaMode ? mQwertyKeyboard : mSymbolsKeyboard;
286 if (next != null)
[all...] |
| /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...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| page_heap.cc | 79 ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST);
80 return Carve(ll->next, n);
85 ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST);
86 return Carve(ll->next, n);
115 for (Span* span = large_.normal.next;
117 span = span->next) {
129 for (Span* span = large_.returned.next;
131 span = span->next) {
226 Span* next = GetDescriptor(p+n); local
227 if (next != NULL && next->location == span->location)
[all...] |
| /external/qemu/proxy/ |
| proxy_common.c | 71 conn->next = NULL;
233 conn->next = after->next;
234 after->next->prev = conn;
235 after->next = conn;
242 conn->prev->next = conn->next;
243 conn->next->prev = conn->prev;
245 conn->next = conn->prev = conn;
263 s_connections->next = s_connections
291 ProxyConnection* next = conn->next; local
435 ProxyConnection* next = conn->next; local
454 ProxyConnection* next = conn->next; local
[all...] |
| /frameworks/native/libs/binder/ |
| MemoryDealer.cpp | 64 newNode->next = node->next;
65 if (node->next == 0) mLast = newNode;
66 else node->next->prev = newNode;
67 node->next = newNode;
72 newNode->next = node;
74 else node->prev->next = newNode;
81 newNode->prev = newNode->next = 0;
84 newNode->next = mFirst;
95 newNode->next = 0
148 mutable chunk_t* next; member in struct:android::SimpleBestFitAllocator::chunk_t
[all...] |
| /external/dhcpcd/ |
| ipv6rs.c | 237 if (ifp->ras == NULL || ifp->ras->next == NULL)
242 ifp->ras = ifp->ras->next;
243 sorted->next = NULL;
244 for (rap = ifp->ras; rap && (ran = rap->next, 1); rap = ran) {
247 rap->next = sorted;
252 for (rat = sorted; rat->next; rat = rat->next) {
253 if (timercmp(&rap->received, &rat->next->received, <)) {
254 rap->next = rat->next;
685 struct timeval now, lt, expire, next; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MapMakerInternalMap.java | 356 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
357 return new StrongEntry<K, V>(key, hash, next);
363 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
364 return new StrongExpirableEntry<K, V>(key, hash, next);
378 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
379 return new StrongEvictableEntry<K, V>(key, hash, next);
393 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
394 return new StrongExpirableEvictableEntry<K, V>(key, hash, next);
410 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
411 return new SoftEntry<K, V>(segment.keyReferenceQueue, key, hash, next);
1037 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.StrongEntry
1291 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.SoftEntry
1549 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.WeakEntry
2631 ReferenceEntry<K, V> next = head.getNext(); local
3200 ReferenceEntry<K, V> next = head.getNextEvictable(); local
3206 ReferenceEntry<K, V> next = head.getNextEvictable(); local
3220 ReferenceEntry<K, V> next = e.getNextEvictable(); local
3252 ReferenceEntry<K, V> next = e.getNextEvictable(); local
[all...] |
| Iterators.java | 70 public Object next() {
93 @Override public Object next() {
127 public T next() { method in class:Iterators
128 return iterator.next();
152 iterator.next();
165 if (iterator.next() == null) {
171 if (element.equals(iterator.next())) {
193 if (elementsToRemove.contains(removeFrom.next())) {
217 if (predicate.apply(removeFrom.next())) {
239 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| LinkedHashMapTest.java | 225 Map.Entry m = (Map.Entry) i.next();
242 s1.remove(m2.entrySet().iterator().next());
243 assertEquals("jumbo", s1.iterator().next().getKey());
260 assertNull("Failed with null key", m.keySet().iterator().next());
267 Integer remove1 = (Integer) it.next();
270 Integer remove2 = (Integer) it.next();
276 assertTrue("Wrong result", it.next().equals(list.get(0)));
278 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
285 Integer remove3 = (Integer) it2.next();
286 Integer next; local
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Iterators.java | 68 public Object next() {
91 @Override public Object next() {
125 public T next() { method in class:Iterators
126 return iterator.next();
150 iterator.next();
163 if (iterator.next() == null) {
169 if (element.equals(iterator.next())) {
191 if (elementsToRemove.contains(removeFrom.next())) {
215 if (predicate.apply(removeFrom.next())) {
237 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| hash.c | 40 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
200 xmlHashEntryPtr iter, next; local
238 table->table[key].next = NULL;
242 iter = oldtable[i].next;
244 next = iter->next;
254 table->table[key].next = NULL;
257 iter->next = table->table[key].next;
258 table->table[key].next = iter
291 xmlHashEntryPtr next; local
832 xmlHashEntryPtr next; local
906 xmlHashEntryPtr next; local
946 xmlHashEntryPtr next; local
[all...] |
| /external/libxml2/ |
| hash.c | 60 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
236 xmlHashEntryPtr iter, next; local
274 table->table[key].next = NULL;
278 iter = oldtable[i].next;
280 next = iter->next;
290 table->table[key].next = NULL;
293 iter->next = table->table[key].next;
294 table->table[key].next = iter
327 xmlHashEntryPtr next; local
868 xmlHashEntryPtr next; local
942 xmlHashEntryPtr next; local
982 xmlHashEntryPtr next; local
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SortedMapInterfaceTest.java | 86 K prior = iterator.next();
89 K current = iterator.next();
143 K expected = map.keySet().iterator().next();
249 K first = iterator.next();
250 K second = iterator.next();
268 Entry<K, V> firstEntry = iterator.next();
269 Entry<K, V> secondEntry = iterator.next();
270 Entry<K, V> thirdEntry = iterator.next();
290 Entry<K, V> firstEntry = iterator.next();
291 Entry<K, V> secondEntry = iterator.next();
[all...] |
| /external/nist-sip/java/gov/nist/core/ |
| GenericObjectList.java | 130 GenericObject obj = (GenericObject) ((GenericObject) iter.next())
183 protected GenericObject next(ListIterator iterator) { method in class:GenericObjectList
185 return (GenericObject) iterator.next();
198 return (GenericObject) myListIterator.next();
205 * Fetch the next object from the list based on the default list iterator
207 protected GenericObject next() { method in class:GenericObjectList
212 return (GenericObject) myListIterator.next();
285 obj = next();
333 GenericObject outerObj = (GenericObject) it1.next();
335 Object innerObj = it2.next();
[all...] |
| /external/openssh/ |
| monitor_mm.c | 58 RB_GENERATE(mmtree, mm_share, next, mm_compare)
121 struct mm_share *mms, *next; local
123 for (mms = RB_ROOT(head); mms; mms = next) {
124 next = RB_NEXT(mmtree, head, mms);
231 if (RB_LEFT(prev, next)) {
232 prev = RB_LEFT(prev, next);
233 while (RB_RIGHT(prev, next))
234 prev = RB_RIGHT(prev, next);
236 if (RB_PARENT(prev, next) &&
237 (prev == RB_RIGHT(RB_PARENT(prev, next), next))
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 84 * self-link implicitly means to advance to head.next.
96 * - this Node, meaning the successor is head.next
99 Node<E> next; field in class:LinkedBlockingQueue.Node
118 * Invariant: last.next == null
168 // assert last.next == null;
169 last = last.next = node;
181 Node<E> first = h.next;
182 h.next = h; // help GC
478 Node<E> first = head.next;
493 // p.next is not changed, to allow iterators that ar
794 public E next() { method in class:LinkedBlockingQueue.Itr
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| code.c | 154 struct BitMap *next; member in struct:BitMap
173 b->next = BitMap_first;
181 for(b = BitMap_first; b; b = b->next){
191 for(b = BitMap_first; b; b = b->next){
209 for(m = 0x80; b && m; b = b->next, m >>= 1){
227 for(b = BitMap_first; b; b = b->next){
313 /* do not read next char if match */
394 State *from, State *next, int *readCh){
398 if(s[1].to == next && n == 3){
403 genGoTo(o, from, next, readCh, "\t")
[all...] |
| /cts/tools/tradefed-host/tests/src/com/android/cts/tradefed/result/ |
| TestResultsTest.java | 67 TestPackageResult pkg = parser.getPackages().iterator().next();
94 TestPackageResult pkg = parser.getPackages().iterator().next();
95 TestSuite comSuite = pkg.getTestSuites().iterator().next();
97 TestSuite exampleSuite = comSuite.getTestSuites().iterator().next();
99 TestCase exampleCase = exampleSuite.getTestCases().iterator().next();
101 Test exampleTest = exampleCase.getTests().iterator().next();
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| ServiceLoaderTest.java | 86 assertEquals("ImplementationOfService", itr.next().myNameIs());
98 assertEquals("ImplementationOfService", ((Service) itr.next())
111 itr.next();
137 itr.next();
161 itr.next();
187 assertEquals("ImplementationOfService", ((Service) itr.next())
196 itr.next();
207 .next()).myNameIs());
214 String name = ((ServiceMoreThanOne) itr.next()).myNameIs();
217 ((ServiceMoreThanOne) itr.next()).myNameIs())
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisIterator.java | 33 * Get the next node in the iteration.
35 * @return The next node handle in the iteration, or END.
37 public int next(); method in interface:DTMAxisIterator
60 * Remembers the current node for the next call to gotoMark().
71 * i.e. subsequent call to next() should return END.
81 * i.e. subsequent call to next() should return END.
|
| /external/chromium/net/data/cache_tests/bad_rankings3/ |
| contents.txt | 17 next entry: 0x0
26 next: 0x90000000
34 next entry: 0x0
43 next: 0x90000000
51 next entry: 0x0
60 next: 0x90000002
|
| /external/chromium_org/net/data/cache_tests/bad_rankings3/ |
| contents.txt | 17 next entry: 0x0
26 next: 0x90000000
34 next entry: 0x0
43 next: 0x90000000
51 next entry: 0x0
60 next: 0x90000002
|
| /external/chromium_org/third_party/icu/source/common/ |
| uenumimp.h | 61 * This function returns the next element as a UChar *,
67 * @return next element as UChar *,
78 * This function returns the next element as a char *,
84 * @return next element as char *,
124 UEnumNext *next; member in struct:UEnumeration
145 * when a UEnumeration is defined with 'next' pointing to this
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| two_level_iterator.cc | 31 virtual void Next();
112 void TwoLevelIterator::Next() {
114 data_iter_.Next();
127 // Move to next block
132 index_iter_.Next();
140 // Move to next block
|
