/external/fio/lib/ |
H A D | flist_sort.c | 23 tail->next = a; 24 a = a->next; 26 tail->next = b; 27 b = b->next; 29 tail = tail->next; 31 tail->next = a?:b; 32 return head.next; 53 tail->next = a; 55 a = a->next; 57 tail->next [all...] |
/external/clang/test/CodeGen/ |
H A D | disable-tail-calls.c | 4 struct List *next; member in struct:List 15 return find(head->next, data);
|
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1); 46 assert(next(m.begin())->second == 1.5); 47 assert(next(m.begin(), 2)->first == 1); 48 assert(next(m.begin(), 2)->second == 2); 49 assert(next(m.begin(), 3)->first == 2); 50 assert(next(m.begin(), 3)->second == 1); 51 assert(next(m.begin(), 4)->first == 2); 52 assert(next(m.begin(), 4)->second == 1.5); 53 assert(next(m.begin(), 5)->first == 2); 54 assert(next( [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(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); 35 i = c.erase_after(next(c.cbefore_begin(), 0)); 38 assert(*next(c.begin(), 0) == 1); 39 assert(*next(c.begin(), 1) == 2); 40 assert(*next(c.begin(), 2) == 3); 42 i = c.erase_after(next( [all...] |
H A D | resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0); 46 assert(*next(c.begin(), 1) == 1); 47 assert(*next(c.begin(), 2) == 2); 51 assert(*next(c.begin(), 0) == 0); 52 assert(*next(c.begin(), 1) == 1); 53 assert(*next(c.begin(), 2) == 2); 54 assert(*next(c.begin(), 3) == 0); 55 assert(*next(c.begin(), 4) == 0); 56 assert(*next(c.begin(), 5) == 0); 60 assert(*next( [all...] |
H A D | insert_after_init.pass.cpp | 32 assert(i == next(c.before_begin(), 3)); 34 assert(*next(c.begin(), 0) == 0); 35 assert(*next(c.begin(), 1) == 1); 36 assert(*next(c.begin(), 2) == 2); 39 assert(i == next(c.begin(), 2)); 41 assert(*next(c.begin(), 0) == 0); 42 assert(*next(c.begin(), 1) == 3); 43 assert(*next(c.begin(), 2) == 4); 44 assert(*next(c.begin(), 3) == 1); 45 assert(*next( [all...] |
H A D | insert_after_range.pass.cpp | 36 assert(i == next(c.before_begin(), 3)); 38 assert(*next(c.begin(), 0) == 0); 39 assert(*next(c.begin(), 1) == 1); 40 assert(*next(c.begin(), 2) == 2); 43 assert(i == next(c.begin(), 2)); 45 assert(*next(c.begin(), 0) == 0); 46 assert(*next(c.begin(), 1) == 3); 47 assert(*next(c.begin(), 2) == 4); 48 assert(*next(c.begin(), 3) == 1); 49 assert(*next( [all...] |
H A D | insert_after_size_value.pass.cpp | 31 assert(i == next(c.before_begin(), 3)); 33 assert(*next(c.begin(), 0) == 3); 34 assert(*next(c.begin(), 1) == 3); 35 assert(*next(c.begin(), 2) == 3); 38 assert(i == next(c.begin(), 2)); 40 assert(*next(c.begin(), 0) == 3); 41 assert(*next(c.begin(), 1) == 2); 42 assert(*next(c.begin(), 2) == 2); 43 assert(*next(c.begin(), 3) == 3); 44 assert(*next( [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_job_queue.h | 30 // Pointer to the next link in the job queue 31 void *next; member in struct:__anon11950 39 // Pointer to the next link in the job queue 40 void *next; member in struct:__anon11951
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions 161 struct draw_stage *next = draw->pipeline.rasterize; local 167 /* Set the validate's next stage to the rasterize stage, so that it 170 stage->next = next; 196 draw->pipeline.aaline->next = next; 197 next = draw->pipeline.aaline; 202 draw->pipeline.aapoint->next = next; [all...] |
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/serialization/ |
H A D | FwdRef.java | 28 FwdRef next; field in class:FwdRef
|
/external/tcpdump/ |
H A D | cpack.c | 53 /* Advance to the next wordsize boundary. Return NULL if fewer than 60 uint8_t *next; local 63 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize); 66 if (next - cs->c_buf + wordsize > cs->c_len) 69 return next; 99 uint8_t *next; local 101 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL) 104 *u = EXTRACT_LE_64BITS(next); 107 cs->c_next = next + sizeof(*u); 115 uint8_t *next; local 131 uint8_t *next; local [all...] |
/external/libunwind/src/mi/ |
H A D | dyn-register.c | 37 di->next = _U_dyn_info_list.first; 39 if (di->next) 40 di->next->prev = di;
|
/external/llvm/test/CodeGen/SystemZ/Large/ |
H A D | branch-range-02.py | 70 next = 'b%d' % (i + 1) if i + 1 < blocks else 'end' variable 77 print ' br i1 %%atest%d, label %%%s, label %%%s' % (i, other, next) 80 print '%s:' % next
|
/external/syslinux/com32/lib/syslinux/ |
H A D | dump_mmap.c | 43 while (memmap->next) { 45 memmap->next->start - memmap->start, memmap->type); 46 memmap = memmap->next;
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0)); 46 assert(r.second == next(m.begin(), 0)); 48 assert(r.first == next(m.begin(), 0)); 49 assert(r.second == next(m.begin(), 3)); 51 assert(r.first == next(m.begin(), 3)); 52 assert(r.second == next(m.begin(), 3)); 54 assert(r.first == next(m.begin(), 3)); 55 assert(r.second == next(m.begin(), 6)); 57 assert(r.first == next(m.begin(), 6)); 58 assert(r.second == next( [all...] |
/external/blktrace/btt/ |
H A D | list.h | 35 struct list_head *next, *prev; member in struct:list_head 45 list->next = list; 53 * the prev/next entries already! 57 struct list_head *next) 59 next->prev = new; 60 new->next = next; 62 prev->next = new; 75 __list_add(new, head, head->next); 92 * Delete a list entry by making the prev/next entrie 55 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 98 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/fio/ |
H A D | flist.h | 22 * sometimes we already know the next/prev entries and we can 28 struct flist_head *next, *prev; member in struct:flist_head 37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 44 * the prev/next entries already! 48 struct flist_head *next) 50 next->prev = new_entry; 51 new_entry->next = next; 53 prev->next = new_entry; 67 __flist_add(new_entry, head, head->next); 46 __flist_add(struct flist_head *new_entry, struct flist_head *prev, struct flist_head *next) argument 83 __flist_del(struct flist_head *prev, struct flist_head * next) argument 122 __flist_splice(const struct flist_head *list, struct flist_head *prev, struct flist_head *next) argument [all...] |
/external/ltp/utils/ffsb-6.0-rc2/ |
H A D | list.h | 10 struct list_head *next, *prev; member in struct:list_head 15 struct list_head *next); 16 void __list_del(struct list_head *prev, struct list_head *next); 27 for (pos = (head)->next; pos->next, pos != (head); pos = pos->next) 39 for (pos = list_entry((head)->next, typeof(*pos), member); \ 40 pos->member.next, &pos->member != (head); \ 41 pos = list_entry(pos->member.next, typeof(*pos), member)) 44 for (pos = list_entry((head)->next, typeo [all...] |
/external/junit/src/main/java/org/junit/internal/runners/statements/ |
H A D | RunBefores.java | 9 private final Statement next; field in class:RunBefores 15 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) { argument 16 this.next = next; 26 next.evaluate();
|
/external/libnl/include/netlink/ |
H A D | list.h | 17 struct nl_list_head * next; member in struct:nl_list_head 23 list->next = list; 29 struct nl_list_head *next) 31 prev->next = obj; 33 next->prev = obj; 34 obj->next = next; 46 __nl_list_add(obj, head, head->next); 51 obj->next->prev = obj->prev; 52 obj->prev->next 27 __nl_list_add(struct nl_list_head *obj, struct nl_list_head *prev, struct nl_list_head *next) argument [all...] |
/external/slf4j/slf4j-ext/src/main/java/org/slf4j/ |
H A D | NDC.java | 46 int next = size(); 47 MDC.put(PREFIX + next, val); 51 int next = size(); 52 if (next == 0) { 55 int last = next - 1;
|
/external/iproute2/include/ |
H A D | hlist.h | 16 struct hlist_node *next, **pprev; member in struct:hlist_node 21 struct hlist_node *next = n->next; local 23 *pprev = next; 24 if (next) 25 next->pprev = pprev; 31 n->next = first; 33 first->pprev = &n->next; 39 for (pos = (head)->first; pos ; pos = pos->next) 43 for (pos = (head)->first; pos && ({ n = pos->next; [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | function-template-specialization.cpp | 7 T* next(T* ptr, const U& diff); 10 T* next(T* ptr, const U& diff) { function 16 iptr = next(iptr, diff); 19 fptr = next(fptr, diff); 23 T* next(T* ptr, const U& diff); 26 iptr = next(iptr, diff); 29 dptr = next(dptr, diff);
|
/external/libcxx/test/std/containers/associative/map/map.ops/ |
H A D | lower_bound.pass.cpp | 47 assert(r == next(m.begin())); 49 assert(r == next(m.begin(), 2)); 51 assert(r == next(m.begin(), 3)); 53 assert(r == next(m.begin(), 4)); 55 assert(r == next(m.begin(), 5)); 57 assert(r == next(m.begin(), 6)); 59 assert(r == next(m.begin(), 7)); 61 assert(r == next(m.begin(), 0)); 63 assert(r == next(m.begin(), 1)); 65 assert(r == next( [all...] |