| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
| o64loop.asm | 2 o64 loop next
3 next: label
|
| /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...] |
| 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(m.begin(), 6) == 7)
[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...] |
| 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(m.begin(), 6) == 7)
[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...] |
| resize_size_value.pass.cpp | 30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
36 assert(*next(c.begin(), 0) == 0);
37 assert(*next(c.begin(), 1) == 1);
38 assert(*next(c.begin(), 2) == 2);
39 assert(*next(c.begin(), 3) == 10);
40 assert(*next(c.begin(), 4) == 10);
41 assert(*next(c.begin(), 5) == 10);
45 assert(*next(c.begin(), 0) == 0)
[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/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();
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 11 * 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->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/libcxx/test/containers/associative/map/map.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| /external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| erase_iter.pass.cpp | 41 I i = m.erase(next(m.cbegin(), 3));
43 assert(i == next(m.begin(), 3));
46 assert(next(m.begin())->first == 1);
47 assert(next(m.begin())->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 2);
51 assert(next(m.begin(), 3)->second == 1.5);
52 assert(next(m.begin(), 4)->first == 2);
53 assert(next(m.begin(), 4)->second == 2)
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 11 * 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->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/iptables/libiptc/ |
| 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);
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
[all...] |
