| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 75 r->next = heap->next;
76 if (heap->next)
77 heap->next->prev = r;
79 heap->next = r;
85 heap = heap->next;
103 if (r->next && !r->next->in_use) {
104 struct nouveau_heap *new = r->next;
108 r->prev->next = new
[all...] |
| /hardware/intel/img/libdrm/libdrm/nouveau/ |
| nouveau_resource.c | 66 r->next = heap->next;
67 if (heap->next)
68 heap->next->prev = r;
70 heap->next = r;
76 heap = heap->next;
94 if (r->next && !r->next->in_use) {
95 struct nouveau_resource *new = r->next;
99 r->prev->next = new
[all...] |
| /external/chromium_org/components/enhanced_bookmarks/ |
| item_position_unittest.cc | 18 ItemPosition next = ItemPosition::CreateBefore(current); local
19 EXPECT_LT(next.ToString(), current.ToString());
20 current = next;
29 ItemPosition next = ItemPosition::CreateAfter(current); local
30 EXPECT_GT(next.ToString(), current.ToString());
31 current = next;
41 ItemPosition next = ItemPosition::CreateBetween(before, after); local
42 EXPECT_GT(next.ToString(), before.ToString());
43 EXPECT_LT(next.ToString(), after.ToString());
44 after = next;
54 ItemPosition next = ItemPosition::CreateBetween(before, after); local
67 ItemPosition next = ItemPosition::CreateBetween(before, after); local
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 16 struct dl_list *next; member in struct:dl_list
22 list->next = list;
28 item->next = list->next;
30 list->next->prev = item;
31 list->next = item;
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
43 item->next = NULL
[all...] |
| /external/libcxx/test/containers/associative/set/ |
| equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 1));
46 assert(r.first == next(m.begin(), 1));
47 assert(r.second == next(m.begin(), 2));
49 assert(r.first == next(m.begin(), 2));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 4));
55 assert(r.first == next(m.begin(), 4));
56 assert(r.second == next(m.begin(), 5))
[all...] |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 1));
46 assert(r.first == next(m.begin(), 1));
47 assert(r.second == next(m.begin(), 2));
49 assert(r.first == next(m.begin(), 2));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 4));
55 assert(r.first == next(m.begin(), 4));
56 assert(r.second == next(m.begin(), 5))
[all...] |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next = from->next
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next = from->next
[all...] |
| /external/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 0));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 0));
78 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 6));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 9));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 3));
78 assert(r == next(m.begin(), 3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 0));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 0));
78 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 6));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 9));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 3));
78 assert(r == next(m.begin(), 3))
[all...] |
| /external/yaffs2/yaffs2/ |
| devextras.h | 49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
77 struct list_head *next)
79 next->prev = new;
80 new->next = next;
82 prev->next = new;
95 __list_add(new, head, head->next);
[all...] |
| /external/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
| pqueue.c | 77 item->next = NULL;
113 for (curr = pq->items; curr; curr = curr->next) {
128 item = item->next;
143 *item = (*item)->next;
149 pitem *curr, *next; local
156 for (curr = NULL, next = pq->items; next != NULL;
157 curr = next, next = next->next)
[all...] |
| /cts/common/host-side/native-scanner/tests/src/com/android/compatibility/common/scanner/ |
| NativeScannerTest.java | 37 assertEquals("suite:TestSuite", it.next());
38 assertEquals("case:FakeTestCase", it.next());
39 assertEquals("test:FakeTestName", it.next());
51 assertEquals("suite:TestSuite", it.next());
52 assertEquals("case:Case1", it.next());
53 assertEquals("test:Test1", it.next());
54 assertEquals("test:Test2", it.next());
55 assertEquals("case:Case2", it.next());
56 assertEquals("test:Test3", it.next());
57 assertEquals("test:Test4", it.next());
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Random.java | 96 protected synchronized int next(int bits) { method in class:Random
105 return next(1) != 0;
130 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53));
138 return (next(24) / 16777216f);
173 return next(32);
185 return (int) ((n * (long) next(31)) >> 31);
189 bits = next(31);
199 return ((long) next(32) << 32) + next(32)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| advance_forward.hpp | 31 typedef typename next<iter0>::type iter1;
42 typedef typename next<iter0>::type iter1;
43 typedef typename next<iter1>::type iter2;
54 typedef typename next<iter0>::type iter1;
55 typedef typename next<iter1>::type iter2;
56 typedef typename next<iter2>::type iter3;
67 typedef typename next<iter0>::type iter1;
68 typedef typename next<iter1>::type iter2;
69 typedef typename next<iter2>::type iter3;
70 typedef typename next<iter3>::type iter4
[all...] |
| /external/libcxx/test/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| /libcore/luni/src/test/java/libcore/xml/ |
| PullParserDtdTest.java | 41 while (parser.next() != XmlPullParser.END_DOCUMENT) {
64 assertEquals(XmlPullParser.START_TAG, parser.next());
65 assertEquals(XmlPullParser.TEXT, parser.next());
67 assertEquals(XmlPullParser.END_TAG, parser.next());
68 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
76 assertEquals(XmlPullParser.START_TAG, parser.next());
77 assertEquals(XmlPullParser.TEXT, parser.next());
79 assertEquals(XmlPullParser.END_TAG, parser.next());
80 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
86 assertEquals(XmlPullParser.START_TAG, parser.next());
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| /external/linux-tools-perf/perf-3.12.0/include/linux/ |
| list.h | 14 * sometimes we already know the next/prev entries and we can
26 list->next = list;
34 * the prev/next entries already!
39 struct list_head *next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
49 struct list_head *next);
62 __list_add(new, head, head->next);
206 struct list_head *next = head->next; local
588 struct hlist_node *next = n->next; local
[all...] |
| /external/chromium_org/third_party/skia/src/views/ |
| SkTagList.cpp | 38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
45 *head = next;
50 rec = next;
58 SkTagList* next = rec->fNext;
60 rec = next;
|
