Searched refs:next (Results 26 - 50 of 5321) sorted by relevance

1234567891011>>

/external/mesa3d/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next
101 struct intel_resolve_map *next = head->next; local
[all...]
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
H A Dresize_size_value.pass.cpp30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
36 assert(*next(c.begin(), 0) == 0);
37 assert(*next(c.begin(), 1) == 1);
38 assert(*next(c.begin(), 2) == 2);
39 assert(*next(c.begin(), 3) == 10);
40 assert(*next(c.begin(), 4) == 10);
41 assert(*next(c.begin(), 5) == 10);
45 assert(*next(
[all...]
/external/libcxx/test/containers/associative/multiset/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
42 assert(i == next(m.begin(), 5));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(
[all...]
H A Derase_key.pass.cpp44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(
[all...]
/external/libcxx/test/containers/associative/set/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
42 assert(i == next(m.begin(), 5));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(
[all...]
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/
H A Derase_iter.pass.cpp41 I i = m.erase(next(m.cbegin(), 3));
43 assert(i == next(m.begin(), 3));
46 assert(next(m.begin())->first == 1);
47 assert(next(m.begin())->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 2);
51 assert(next(m.begin(), 3)->second == 1.5);
52 assert(next(m.begin(), 4)->first == 2);
53 assert(next(
[all...]
H A Derase_key.pass.cpp44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(
[all...]
/external/iptables/libiptc/
H A Dlinux_list.h48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
174 __list_del(struct list_head * prev, struct list_head * next) argument
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/
H A DDTMAxisTraverser.java38 * nodeHandle=myTraverser.next(myContext,nodeHandle))
61 return next(context, context);
80 return next(context, context, extendedTypeID);
84 * Traverse to the next node after the current node.
94 * @return the next node in the iteration, or DTM.NULL.
97 public abstract int next(int context, int current); method in class:DTMAxisTraverser
100 * Traverse to the next node after the current node that is matched
112 * @return the next node in the iteration, or DTM.NULL.
115 public abstract int next(int context, int current, int extendedTypeID); method in class:DTMAxisTraverser
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DIntIterator.java25 * Checks to see if the iterator has a next value.
27 * @return true if next() will succeed
32 * Returns the next value in the iterator.
34 * @return next value
35 * @throws java.util.NoSuchElementException if no next element exists
37 int next(); method in interface:IntIterator
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/
H A Dlist.h18 begin->prev->next = end->next;
19 end->next->prev = begin->prev;
28 for (; pos != (head); pos = pos->next)
/external/mockito/src/org/mockito/internal/progress/
H A DSequenceNumber.java11 public static synchronized int next() { method in class:SequenceNumber
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DTokenStream.java32 HtmlToken next(); method in interface:TokenStream
/external/clang/test/CodeGenCXX/
H A Dfunction-template-specialization.cpp3 T* next(T* ptr, const U& diff);
6 T* next(T* ptr, const U& diff) { function
12 iptr = next(iptr, diff);
15 fptr = next(fptr, diff);
19 T* next(T* ptr, const U& diff);
22 iptr = next(iptr, diff);
25 dptr = next(dptr, diff);
/external/libcxx/test/containers/associative/map/map.modifiers/
H A Derase_key.pass.cpp45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(
[all...]
H A Derase_iter.pass.cpp40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 5);
50 assert(next(m.begin(), 3)->second == 5.5);
51 assert(next(m.begin(), 4)->first == 6);
52 assert(next(
[all...]
/external/libvpx/libvpx/third_party/nestegg/halloc/src/
H A Dhlist.h32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dkernel-list.h9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
32 * the prev/next entries already!
36 struct list_head * next)
38 next->prev = new;
39 new->next = next;
41 prev->next = new;
49 __list_add(new, head, head->next);
34 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
67 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/elfutils/0.153/lib/
H A Dlist.h57 assert (_newp->next == NULL); \
60 (first) = _newp->next = _newp->previous = _newp; \
63 _newp->next = (first); \
65 _newp->previous->next = _newp->next->previous = _newp; \
76 || ({ __typeof (elem) _runp = first->next; \
81 _runp = _runp->next; \
83 if (unlikely (_elem->next == _elem)) \
87 _elem->next->previous = _elem->previous; \
88 _elem->previous->next
[all...]
/external/f2fs-tools/include/
H A Dlist.h14 struct list_head *next, *prev; member in struct:list_head
24 list->next = list;
30 struct list_head *next)
32 next->prev = new;
33 new->next = next;
35 prev->next = new;
40 __list_add(new, head, head->next);
48 static inline void __list_del(struct list_head * prev, struct list_head * next) argument
50 next
28 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_simple_list.h47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dsimple_list.h45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_simple_list.h47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next
[all...]
/external/mesa3d/src/mesa/main/
H A Dsimple_list.h45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next
[all...]
/external/libcxx/test/containers/associative/multiset/multiset.cons/
H A Dcopy.pass.cpp46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2);
52 assert(*next(m.begin(), 6) == 3);
53 assert(*next(m.begin(), 7) == 3);
54 assert(*next(m.begin(), 8) == 3);
60 assert(*next(m
[all...]

Completed in 672 milliseconds

1234567891011>>