| /external/qemu/ |
| qlist.c | 70 QTAILQ_INSERT_TAIL(&qlist->head, entry, next);
84 QTAILQ_FOREACH(entry, &qlist->head, next)
98 QTAILQ_REMOVE(&qlist->head, entry, next);
150 QTAILQ_FOREACH_SAFE(entry, &qlist->head, next, next_entry) {
151 QTAILQ_REMOVE(&qlist->head, entry, next);
|
| /frameworks/av/services/audioflinger/ |
| StateQueue.cpp | 61 const T *next = (const T *) android_atomic_acquire_load((volatile int32_t *) &mNext); local
62 if (next != mCurrent) {
63 mAck = next; // no additional barrier needed
64 mCurrent = next;
69 return next;
|
| /hardware/ti/omap3/dspbridge/inc/ |
| drv.h | 186 struct NODE_RES_OBJECT *next; member in struct:NODE_RES_OBJECT
197 struct DMM_RES_OBJECT *next; member in struct:DMM_RES_OBJECT
208 struct DSPHEAP_RES_OBJECT *next; member in struct:DSPHEAP_RES_OBJECT
217 struct STRM_RES_OBJECT *next; member in struct:STRM_RES_OBJECT
233 /* Pointer to next process context
235 struct PROCESS_CONTEXT *next; member in struct:PROCESS_CONTEXT
371 * Returns the Ptr to the Next Device Object from the the List
378 * dwDevObject: Ptr to the Next Dev Object as a DWORD
379 * 0: If it fail to get the next Dev Object.
387 * Returns the Ptr to the Next Device Extension from the the Lis
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 91 * - There is exactly one (last) Node with a null next reference,
150 volatile Node<E> next; field in class:ConcurrentLinkedQueue.Node
185 (k.getDeclaredField("next"));
198 * - (tmp = head).next != tmp || tmp != head
208 * node with node.next == null) can be reached in O(1) time.
216 * - tail.next may or may not be self-pointing to tail.
278 * Returns the successor of p, or the head node if p.next has been
283 Node<E> next = p.next; local
284 return (p == next) ? head : next
463 Node<E> next = succ(p); local
691 Node<E> next = succ(p); local
703 public E next() { method in class:ConcurrentLinkedQueue.Itr
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| arg.hpp | 34 typedef arg<2> next; typedef in struct:arg
52 typedef arg<3> next; typedef in struct:arg
70 typedef arg<4> next; typedef in struct:arg
88 typedef arg<5> next; typedef in struct:arg
106 typedef arg<6> next; typedef in struct:arg
|
| fold_impl.hpp | 50 typedef typename mpl::next<iter0>::type iter1;
68 typedef typename mpl::next<iter0>::type iter1;
70 typedef typename mpl::next<iter1>::type iter2;
88 typedef typename mpl::next<iter0>::type iter1;
90 typedef typename mpl::next<iter1>::type iter2;
92 typedef typename mpl::next<iter2>::type iter3;
110 typedef typename mpl::next<iter0>::type iter1;
112 typedef typename mpl::next<iter1>::type iter2;
114 typedef typename mpl::next<iter2>::type iter3;
116 typedef typename mpl::next<iter3>::type iter4
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_backend_impl.cc | 245 MemEntryImpl* next = rankings_.GetNext(NULL); local
250 while (next) {
251 MemEntryImpl* node = next;
252 next = rankings_.GetNext(next);
294 MemEntryImpl* next = rankings_.GetPrev(NULL); local
296 DCHECK(next);
299 while (current_size_ > target_size && next) {
300 MemEntryImpl* node = next;
301 next = rankings_.GetPrev(next)
[all...] |
| /external/chromium_org/base/android/javatests/src/org/chromium/base/ |
| ObserverListTest.java | 155 assertTrue(5 == it.next());
157 assertTrue(15 == it.next());
172 it.next();
191 assertTrue(5 == it.next());
193 assertTrue(10 == it.next());
195 assertTrue(15 == it.next());
201 assertTrue(5 == it.next());
203 assertTrue(10 == it.next());
205 assertTrue(15 == it.next());
214 assertTrue(10 == it.next());
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_stipple.c | 15 * next paragraph) shall be included in all copies or substantial portions
107 stage->next->line( stage->next, &newprim );
179 stage->next->reset_stipple_counter( stage->next );
187 stage->next->point(stage->next, header);
195 stage->next->tri(stage->next, header);
218 stage->next->flush( stage->next, flags )
[all...] |
| draw_pipe_offset.c | 15 * next paragraph) shall be included in all copies or substantial portions
106 stage->next->tri( stage->next, header );
146 stage->next->flush( stage->next, flags );
152 stage->next->reset_stipple_counter( stage->next );
174 offset->stage.next = NULL;
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_tree_grafting.cpp | 11 * The above copyright notice and this permission notice (including the next
224 sig_iter.next();
315 for (ir_instruction *ir = (ir_instruction *)start->next;
316 ir != bb_last->next;
317 ir = (ir_instruction *)ir->next) {
339 ir_instruction *ir, *next; local
341 for (ir = bb_first, next = (ir_instruction *)ir->next;
342 ir != bb_last->next;
343 ir = next, next = (ir_instruction *)ir->next)
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkTInternalLList.h | 53 T* next = entry->fNext; local
56 prev->fNext = next;
58 fHead = next;
60 if (NULL != next) {
61 next->fPrev = prev;
156 T* next = existingEntry->fNext; local
158 newEntry->fNext = next;
159 if (NULL == next) {
163 next->fPrev = newEntry;
202 * Return the next/previous element in the list or NULL if at the end
204 T* next() { function in class:SkTInternalLList::Iter
[all...] |
| /external/elfutils/libelf/ |
| elf_end.c | 114 parent->state.ar.children = elf->next;
119 while (child->next != elf)
120 child = child->next;
122 child->next = elf->next;
146 Elf_Data_Chunk *next = rawchunks->next; local
150 rawchunks = next;
190 runp = scn->data_list.next;
194 runp = runp->next;
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| PeekingIteratorTest.java | 130 assertEquals("next() should still return first element after peeking",
131 "A", peekingIterator.next());
137 assertEquals("next() should still return middle element after peeking",
138 "B", peekingIterator.next());
144 assertEquals("next() should still return last element after peeking",
145 "C", peekingIterator.next());
149 fail("Should throw exception if no next to peek()");
153 fail("Should continue to throw exception if no next to peek()");
156 peekingIterator.next();
157 fail("next() should still throw exception after the end of iteration")
202 public E next() { method in class:PeekingIteratorTest.ThrowsAtEndIterator
[all...] |
| /external/icu4c/test/intltest/ |
| ucharstrietest.cpp | 236 // with next() and current().
338 // The first string (before next()) will be empty.
342 void next() { function in class:__anon21851::Generator
374 gen.next();
401 UStringTrieResult result=trie->next(x.getBuffer(), x.length());
403 errln("next(%d chars U+%04X U+%04X)!=hasValue or "
404 "next()!=current() or getValue() wrong "
408 gen.next();
472 trie->next(u_j);
473 trie->next(u_a)
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| SafeArrayList.java | 49 * case by buffering them as a normal ArrayList until the next time the contents
237 Object o1 = i1.next();
238 Object o2 = i2.next();
344 private int next; field in class:SafeArrayList.ArrayIterator
349 this.next = index;
354 return next != array.length;
357 public E next() { method in class:SafeArrayList.ArrayIterator
360 lastReturned = next++;
365 return next != 0;
371 lastReturned = --next;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_stipple.c | 15 * next paragraph) shall be included in all copies or substantial portions
107 stage->next->line( stage->next, &newprim );
179 stage->next->reset_stipple_counter( stage->next );
187 stage->next->point(stage->next, header);
195 stage->next->tri(stage->next, header);
218 stage->next->flush( stage->next, flags )
[all...] |
| /external/mesa3d/src/glsl/ |
| opt_tree_grafting.cpp | 11 * The above copyright notice and this permission notice (including the next
224 sig_iter.next();
315 for (ir_instruction *ir = (ir_instruction *)start->next;
316 ir != bb_last->next;
317 ir = (ir_instruction *)ir->next) {
339 ir_instruction *ir, *next; local
341 for (ir = bb_first, next = (ir_instruction *)ir->next;
342 ir != bb_last->next;
343 ir = next, next = (ir_instruction *)ir->next)
[all...] |
| /external/skia/include/core/ |
| SkTInternalLList.h | 53 T* next = entry->fNext; local
56 prev->fNext = next;
58 fHead = next;
60 if (NULL != next) {
61 next->fPrev = prev;
156 T* next = existingEntry->fNext; local
158 newEntry->fNext = next;
159 if (NULL == next) {
163 next->fPrev = newEntry;
202 * Return the next/previous element in the list or NULL if at the end
204 T* next() { function in class:SkTInternalLList::Iter
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Atlas.java | 235 * the next bitmap.
257 Cell next; field in class:Atlas.SlicePolicy.Cell
275 mRoot.next = first;
281 Cell cell = mRoot.next;
290 cell = cell.next;
419 prev.next = first;
424 prev.next = second;
425 second.next = cell.next;
427 prev.next = cell.next
[all...] |
| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 96 while (i.next()) {
103 BufferBlock* next = block->next; local
105 block = next;
112 while (i.next()) {
145 block->next = mFreeBlocks;
191 block = block->next;
211 previous->next = block->next;
213 mFreeBlocks = block->next;
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 39 double[] next = null; local
48 next = points[pivot + 1];
49 if (x <= next[0]) {
51 double x2 = next[0];
53 double y2 = next[1];
70 curve[i][0] = (float) (next[0]);
71 curve[i][1] = (float) (next[1]);
79 double[] next = null; local
90 next = mPoints[pivot + 1];
92 double x2 = next[0]
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/contenttype/parser/ |
| ContentTypeParser.java | 189 if ((oldToken = token).next != null) token = token.next;
190 else token = token.next = token_source.getNextToken();
202 if (token.next != null) token = token.next;
203 else token = token.next = token_source.getNextToken();
212 if (t.next != null) t = t.next;
213 else t = t.next = token_source.getNextToken();
219 if ((jj_nt=token.next) == null
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/ |
| UiElementPullParserTest.java | 179 assertEquals(XmlPullParser.START_TAG, parser.next());
188 assertEquals(XmlPullParser.START_TAG, parser.next());
194 assertEquals(XmlPullParser.END_TAG, parser.next());
197 assertEquals(XmlPullParser.START_TAG, parser.next());
206 assertEquals(XmlPullParser.START_TAG, parser.next());
212 assertEquals(XmlPullParser.END_TAG, parser.next());
215 assertEquals(XmlPullParser.START_TAG, parser.next());
221 assertEquals(XmlPullParser.END_TAG, parser.next());
224 assertEquals(XmlPullParser.END_TAG, parser.next());
228 assertEquals(XmlPullParser.END_TAG, parser.next());
[all...] |
| /bionic/libc/upstream-netbsd/libc/gen/ |
| popen.c | 68 struct pid *next; member in struct:pid
131 for (old = pidlist; old; old = old->next)
178 cur->next = pidlist;
202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
214 pidlist = cur->next;
216 last->next = cur->next;
|
