| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
| o64loop.asm | 2 o64 loop next
3 next: label
|
| /external/srec/config/en.us/dictionary/ |
| cmu2nuance.cpp | 78 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=xlate(p, "AH0 N", "~")) || // hut HH AH T - from jea
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| syscall_iterator_unittest.cc | 20 uint32_t next = iter.Next(); local
24 SANDBOX_ASSERT(next == 0);
26 for (uint32_t last = next; !iter.Done(); last = next) {
27 next = iter.Next();
28 SANDBOX_ASSERT(last < next);
31 SANDBOX_ASSERT(next == 0xFFFFFFFFu);
38 uint32_t next = iter.Next()
[all...] |
| /external/libunwind/src/mi/ |
| 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/src/main/java/okio/ |
| SegmentPool.java | 30 private Segment next; field in class:SegmentPool
40 if (next != null) {
41 Segment result = next;
42 next = result.next;
43 result.next = null;
52 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException();
56 segment.next = next;
58 next = segment
[all...] |
| /external/libusb-compat/libusb/ |
| 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/elfutils/0.153/libdwfl/ |
| dwfl_end.c | 62 Dwfl_Module *next = dwfl->modulelist; local
63 while (next != NULL)
65 Dwfl_Module *dead = next;
66 next = dead->next;
|
| /external/libcxx/test/containers/associative/multiset/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
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) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| 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(m.begin(), 0) == 1)
[all...] |
| /external/libcxx/test/containers/associative/set/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
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) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| 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(m.begin(), 1) == 2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
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) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| 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(m.begin(), 0) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
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) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| 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(m.begin(), 1) == 2)
[all...] |
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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(c.begin(), 6) == 6)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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(c.begin(), 6) == 6)
[all...] |
| /hardware/intel/img/libdrm/libdrm/ |
| 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 = (__item)->next;
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| ptw32_tkAssocDestroy.c | 65 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/ |
| list.h | 23 * - List entries contain references to the next, and the previous entry in the
26 * in its 'next' reference, and the "list head" references the "last" entry in
28 * - The list is empty if its 'next' and 'previous' references are addressing the
33 /* Next entry in the list */
34 ACList* next; member in struct:ACList
43 list->next = list->prev = list;
50 return list->next == list;
57 ACList* const next = list->next; local
58 entry->next = next
79 ACList* const next = entry->next; local
[all...] |
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| prclist.h | 46 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 = (_e)->next;
[all...] |
| /external/clang/test/CodeGen/ |
| debug-info-var-location.c | 5 // CHECK-NEXT: byte 145
10 struct s *next; member in struct:s
17 struct s *sp = s->next;
|
| /external/libcxx/test/containers/associative/multiset/multiset.cons/ |
| 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(m.begin(), 0) == 1)
[all...] |
| /external/lldb/test/api/multithreaded/ |
| inferior.cpp | 6 int next() { function
15 i = next();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| 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(m.begin(), 0) == 1)
[all...] |
