/external/libunwind/src/mi/ |
H A D | dyn-cancel.c | 36 di->prev->next = di->next; 38 _U_dyn_info_list.first = di->next; 40 if (di->next) 41 di->next->prev = di->prev; 45 di->next = di->prev = NULL;
|
/external/okhttp/okio/okio/src/main/java/okio/ |
H A D | SegmentPool.java | 28 static Segment next; field in class:SegmentPool 38 if (next != null) { 39 Segment result = next; 40 next = result.next; 41 result.next = null; 50 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException(); 55 segment.next = next; 57 next [all...] |
/external/libusb-compat/libusb/ |
H A D | usbi.h | 28 ent->next = begin; \ 29 ent->next->prev = ent; \ 31 ent->next = NULL; \ 39 ent->prev->next = ent->next; \ 41 begin = ent->next; \ 42 if (ent->next) \ 43 ent->next->prev = ent->prev; \ 45 ent->next = NULL; \
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); 28 assert(i == next(c.cbefore_begin(), 4)); 30 assert(*next(c.begin(), 0) == 0); 31 assert(*next(c.begin(), 1) == 1); 32 assert(*next(c.begin(), 2) == 2); 33 assert(*next(c.begin(), 3) == 3); 34 assert(*next(c.begin(), 4) == 4); 35 assert(*next(c.begin(), 5) == 5); 36 assert(*next( [all...] |
H A D | resize_size_value.pass.cpp | 35 assert(*next(c.begin(), 0) == 0); 36 assert(*next(c.begin(), 1) == 1); 37 assert(*next(c.begin(), 2) == 2); 41 assert(*next(c.begin(), 0) == 0); 42 assert(*next(c.begin(), 1) == 1); 43 assert(*next(c.begin(), 2) == 2); 44 assert(*next(c.begin(), 3) == 10); 45 assert(*next(c.begin(), 4) == 10); 46 assert(*next(c.begin(), 5) == 10); 50 assert(*next( [all...] |
/external/ImageMagick/MagickCore/ |
H A D | linked-list.c | 66 *next;
78 *next;
117 *next;
123 next=(ElementInfo *) AcquireMagickMemory(sizeof(*next));
124 if (next == (ElementInfo *) NULL)
126 next->value=(void *) value;
127 next->next=(ElementInfo *) NULL;
129 if (list_info->next 64 *next; member in struct:_ElementInfo 76 *next; member in struct:_LinkedListInfo 114 *next; local 171 *next; local 225 *next; local 385 *next; local 450 *next; local 555 *next; local 669 *next; local 761 *next; local 833 *next; local 921 *next; local [all...] |
/external/ltp/tools/pounder21/ |
H A D | proclist.c | 30 item->next = NULL; 36 while (curr->next != NULL) { 37 curr = curr->next; 40 item->next = NULL; 41 curr->next = item; 53 list->head = item->next; 54 item->next = NULL; 59 curr = list->head->next; 63 curr = curr->next; 70 prev->next [all...] |
/external/libdrm/ |
H A D | libdrm_lists.h | 23 * next paragraph) shall be included in all copies or substantial portions 37 struct _drmMMListHead *next; member in struct:_drmMMListHead 43 (__item)->next = (__item); \ 49 (__item)->next = (__list)->next; \ 50 (__list)->next->prev = (__item); \ 51 (__list)->next = (__item); \ 56 (__item)->next = (__list); \ 58 (__list)->prev->next = (__item); \ 64 (__item)->prev->next [all...] |
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | insert_iter_iter.pass.cpp | 44 assert(*next(m.begin(), 0) == 1); 45 assert(*next(m.begin(), 1) == 1); 46 assert(*next(m.begin(), 2) == 1); 47 assert(*next(m.begin(), 3) == 2); 48 assert(*next(m.begin(), 4) == 2); 49 assert(*next(m.begin(), 5) == 2); 50 assert(*next(m.begin(), 6) == 3); 51 assert(*next(m.begin(), 7) == 3); 52 assert(*next(m.begin(), 8) == 3); 74 assert(*next( [all...] |
H A D | erase_iter_iter.pass.cpp | 40 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/std/containers/associative/multiset/multiset.cons/ |
H A D | iter_iter.pass.cpp | 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 1); 45 assert(*next(m.begin(), 2) == 1); 46 assert(*next(m.begin(), 3) == 2); 47 assert(*next(m.begin(), 4) == 2); 48 assert(*next(m.begin(), 5) == 2); 49 assert(*next(m.begin(), 6) == 3); 50 assert(*next(m.begin(), 7) == 3); 51 assert(*next(m.begin(), 8) == 3); 72 assert(*next( [all...] |
/external/libcxx/test/std/containers/associative/set/ |
H A D | erase_key.pass.cpp | 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(m.begin(), 6) == 7); 50 assert(*next(m.begin(), 7) == 8); 55 assert(*next(m.begin(), 0) == 1); 56 assert(*next( [all...] |
H A D | erase_iter_iter.pass.cpp | 40 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/std/containers/associative/map/map.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 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 == 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...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 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 == 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 D | erase_iter.pass.cpp | 49 I i = m.erase(next(m.cbegin(), 3)); 51 assert(i == next(m.begin(), 3)); 54 assert(next(m.begin())->first == 1); 55 assert(next(m.begin())->second == 1.5); 56 assert(next(m.begin(), 2)->first == 1); 57 assert(next(m.begin(), 2)->second == 2); 58 assert(next(m.begin(), 3)->first == 2); 59 assert(next(m.begin(), 3)->second == 1.5); 60 assert(next(m.begin(), 4)->first == 2); 61 assert(next( [all...] |
/external/ltp/utils/ffsb-6.0-rc2/ |
H A D | list.c | 11 list->next = list; 16 struct list_head *prev, struct list_head *next) 18 next->prev = new; 19 new->next = next; 21 prev->next = new; 24 void __list_del(struct list_head *prev, struct list_head *next) argument 26 next->prev = prev; 27 prev->next = next; 15 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument [all...] |
/external/iptables/libiptc/ |
H A D | linux_list.h | 48 * 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/libnetfilter_conntrack/include/internal/ |
H A D | linux_list.h | 53 * sometimes we already know the next/prev entries and we can 59 struct list_head *next, *prev; member in struct:list_head 68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 75 * the prev/next entries already! 79 struct list_head *next) 81 next->prev = new; 82 new->next = next; 84 prev->next = new; 97 __list_add(new, head, head->next); 77 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 119 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument 179 __list_del(struct list_head * prev, struct list_head * next) argument 284 struct list_head *next = head->next; local 519 struct hlist_node *next, **pprev; member in struct:hlist_node 539 struct hlist_node *next = n->next; local 631 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 640 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/libnfnetlink/include/ |
H A D | linux_list.h | 52 * sometimes we already know the next/prev entries and we can 58 struct list_head *next, *prev; member in struct:list_head 67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 74 * the prev/next entries already! 78 struct list_head *next) 80 next->prev = new; 81 new->next = next; 83 prev->next = new; 96 __list_add(new, head, head->next); 76 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 118 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument 178 __list_del(struct list_head * prev, struct list_head * next) argument 283 struct list_head *next = head->next; local 518 struct hlist_node *next, **pprev; member in struct:hlist_node 538 struct hlist_node *next = n->next; local 630 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 639 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 D | DTMAxisTraverser.java | 38 * 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/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | UForwardCharacterIterator.java | 35 * <p>ForwardCharacterIterator provides next() to access 53 * while((c=it.next())!=UForwardCharacterIterator.DONE) { 69 * Returns the UTF16 code unit at index, and increments to the next 73 * @return the next UTF16 code unit, or DONE if the index is at the limit 76 public int next(); method in interface:UForwardCharacterIterator 79 * Returns the code point at index, and increments to the next code 82 * <code>next()</code>. Otherwise the iterator is incremented past 85 * @return the next codepoint in text, or DONE if the index is at
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | UForwardCharacterIterator.java | 34 * <p>ForwardCharacterIterator provides next() to access 52 * while((c=it.next())!=UForwardCharacterIterator.DONE) { 69 * Returns the UTF16 code unit at index, and increments to the next 73 * @return the next UTF16 code unit, or DONE if the index is at the limit 77 public int next(); method in interface:UForwardCharacterIterator 80 * Returns the code point at index, and increments to the next code 83 * <code>next()</code>. Otherwise the iterator is incremented past 86 * @return the next codepoint in text, or DONE if the index is at
|
/external/mockito/src/main/java/org/mockito/internal/progress/ |
H A D | SequenceNumber.java | 11 public static synchronized int next() { method in class:SequenceNumber
|
/external/owasp/sanitizer/src/main/org/owasp/html/ |
H A D | TokenStream.java | 32 HtmlToken next(); method in interface:TokenStream
|