/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 | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than 59 u_int8_t *next; local 62 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize); 65 if (next - cs->c_buf + wordsize > cs->c_len) 68 return next; 98 u_int8_t *next; local 100 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL) 103 *u = EXTRACT_LE_64BITS(next); 106 cs->c_next = next + sizeof(*u); 114 u_int8_t *next; local 130 u_int8_t *next; local [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | InsnList.java | 133 i = i.next;
172 insn = insn.next;
206 elem = elem.next;
225 AbstractInsnNode next = location.next;
226 insn.next = next;
227 if (next != null) {
228 next.prev = insn;
235 prev.next 566 AbstractInsnNode next; field in class:InsnList.InsnListIterator 583 public Object next() { method in class:InsnList.InsnListIterator [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/toybox/lib/ |
H A D | llist.c | 3 * Linked list structures have a next pointer as their first element. 48 void **next = (void **)*llist; local 49 *llist = *next; 51 return (void *)next; 58 if (dlist->next == dlist) *pdlist = 0; 60 dlist->next->prev = dlist->prev; 61 dlist->prev->next = *pdlist = dlist->next; 70 new->next = *list; 72 (*list)->prev->next [all...] |
/external/v8/test/mjsunit/es6/regress/ |
H A D | regress-2681.js | 43 assertEquals({ value: 1, done: false }, o.next()); 47 assertEquals({ value: 2, done: false }, o.next()); 48 assertEquals({ value: undefined, done: true }, o.next());
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0)); 45 assert(r.second == next(m.begin(), 0)); 47 assert(r.first == next(m.begin(), 0)); 48 assert(r.second == next(m.begin(), 3)); 50 assert(r.first == next(m.begin(), 3)); 51 assert(r.second == next(m.begin(), 3)); 53 assert(r.first == next(m.begin(), 3)); 54 assert(r.second == next(m.begin(), 6)); 56 assert(r.first == next(m.begin(), 6)); 57 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/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
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/chromium-trace/trace-viewer/third_party/Paste/paste/util/ |
H A D | filemixin.py | 28 def next(self): member in class:FileMixin 36 next = self.read(1) 37 if not next: 39 output.append(next) 42 if next == '\n':
|
/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/lldb/test/functionalities/recursion/ |
H A D | main.cpp | 17 node* next; member in struct:node 18 node () : value(1),next(NULL) {} 19 node (int v) : value(v), next(NULL) {} 30 root->next = new node(++countdown); 31 root = root->next;
|
/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/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/lldb/test/python_api/type/ |
H A D | main.cpp | 14 Task *next; member in class:Task 17 next(n) 31 task_head->next = task1; 32 task1->next = task2; 33 task2->next = task4; 34 task4->next = task5; 41 t = t->next;
|
/external/dhcpcd/ |
H A D | if-pref.c | 81 if (!ifaces || !ifaces->next) 84 ifaces = ifaces->next; 85 sorted->next = NULL; 86 for (ifp = ifaces; ifp && (ifn = ifp->next, 1); ifp = ifn) { 89 ifp->next = sorted; 94 for (ift = sorted; ift->next; ift = ift->next) { 95 if (ifcmp(ifp, ift->next) == -1) { 96 ifp->next = ift->next; [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | 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 [all...] |
/external/v8/src/ |
H A D | unbound-queue-inl.h | 16 : value(value), next(NULL) { 20 Node* next; member in struct:v8::internal::UnboundQueue::Node 40 first_ = tmp->next; 48 Node* next = reinterpret_cast<Node*>(divider_)->next; 49 *rec = next->value; 50 base::Release_Store(÷r_, reinterpret_cast<base::AtomicWord>(next)); 57 Node*& next = reinterpret_cast<Node*>(last_)->next; local 58 next [all...] |
/external/v8/test/mjsunit/tools/ |
H A D | consarray.js | 40 assertEquals(1, arr1.next()); 49 assertEquals(2, arr1.next()); 51 assertEquals(3, arr1.next()); 53 assertEquals(4, arr1.next()); 55 assertEquals(5, arr1.next()); 57 assertEquals(6, arr1.next()); 59 assertEquals(7, arr1.next());
|