Searched refs:next (Results 1 - 25 of 4746) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/
H A Do64loop.asm2 o64 loop next
3 next: label
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dsyscall_iterator_unittest.cc17 uint32_t next = iter.Next(); local
21 SANDBOX_ASSERT(next == 0);
23 for (uint32_t last = next; !iter.Done(); last = next) {
24 next = iter.Next();
25 SANDBOX_ASSERT(last < next);
28 SANDBOX_ASSERT(next == 0xFFFFFFFFu);
34 uint32_t next = iter.Next();
41 SANDBOX_ASSERT(next == MIN_SYSCALL);
42 for (uint32_t last = next; nex
[all...]
/external/srec/config/en.us/dictionary/
H A Dcmu2nuance.cpp78 const char* next = 0; local
80 (next=xlate(p, "AA1 R", ")r")) || // odd AA D
81 (next=xlate(p, "AA0", "o")) || // odd AA D
82 (next=xlate(p, "AA1", "o")) || // odd AA D
83 (next=xlate(p, "AA2", "o")) || // odd AA D
85 (next=xlate(p, "AE0", "a")) || // at AE T
86 (next=xlate(p, "AE1", "a")) || // at AE T
87 (next=xlate(p, "AE2", "a")) || // at AE T
89 // (next=xlate(p, "AH0 L", "L")) || // drops accuracy by 1%
90 (next
[all...]
/external/libusb-compat/libusb/
H A Dusbi.h28 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/elfutils/libdwfl/
H A Ddwfl_end.c62 Dwfl_Module *next = dwfl->modulelist; local
63 while (next != NULL)
65 Dwfl_Module *dead = next;
66 next = dead->next;
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/
H A Dptw32_tkAssocDestroy.c65 ThreadKeyAssoc * prev, * next; local
69 next = assoc->nextKey;
72 prev->nextKey = next;
74 if (next != NULL)
76 next->prevKey = prev;
82 assoc->thread->keys = next;
87 * Thread is exiting and we're deleting the assoc to be processed next.
90 assoc->thread->nextAssoc = next;
95 next = assoc->nextThread;
98 prev->nextThread = next;
[all...]
/external/qemu/android/utils/
H A Dlist.h19 * - List entries contain references to the next, and the previous entry in the
22 * in its 'next' reference, and the "list head" references the "last" entry in
24 * - The list is empty if its 'next' and 'previous' references are addressing the
30 ACList* next; member in struct:ACList
39 list->next = list->prev = list;
46 return list->next == list;
53 ACList* const next = list->next; local
54 entry->next = next;
75 ACList* const next = entry->next; local
[all...]
/external/chromium_org/third_party/npapi/npspy/extern/nspr/
H A Dprclist.h46 PRCList *next; member in struct:PRCListStr
55 (_e)->next = (_l); \
57 (_l)->prev->next = (_e); \
66 (_e)->next = (_l)->next; \
68 (_l)->next->prev = (_e); \
69 (_l)->next = (_e); \
76 ((_e)->next)
94 #define PR_LIST_HEAD(_l) (_l)->next
102 (_e)->prev->next
[all...]
/external/clang/test/CodeGen/
H A Ddebug-info-var-location.c9 struct s *next; member in struct:s
16 struct s *sp = s->next;
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/
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/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
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/chromium_org/third_party/mesa/src/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/mesa3d/src/mesa/drivers/dri/i915/
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/mesa3d/src/mesa/drivers/dri/i965/
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/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/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/util/include/linux/
H A Dlist.h26 begin->prev->next = end->next;
27 end->next->prev = begin->prev;
36 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/chromium_org/third_party/WebKit/Source/wtf/
H A DDecimalNumber.cpp105 LChar* next = buffer; local
113 *next++ = '-';
114 *next++ = '0';
115 *next++ = '.';
117 *next++ = '0';
119 *next++ = m_significand[i];
121 return next - buffer;
131 *next++ = '-';
133 *next++ = m_significand[i];
135 *next
161 LChar* next = buffer; local
[all...]
/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/libvpx/libvpx/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
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
37 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
70 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/elfutils/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...]

Completed in 1887 milliseconds

1234567891011>>