| /external/clang/test/Analysis/ |
| D | traversal-algorithm.mm | 54 // DFS-next:33 ForStmt
55 // DFS-next:37 ObjCForCollectionStmt
56 // DFS-next:44 CXXForRangeStmt
57 // DFS-next:44 CXXForRangeStmt
58 // DFS-next:44 CXXForRangeStmt
59 // DFS-next:44 CXXForRangeStmt
60 // DFS-next:--END PATH--
61 // DFS-next:37 ObjCForCollectionStmt
62 // DFS-next:37 ObjCForCollectionStmt
63 // DFS-next:44 CXXForRangeStmt
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| D | erase_iter.pass.cpp | 41 I i = m.erase(next(m.cbegin(), 3)); in main()
43 assert(i == next(m.begin(), 3)); in main()
46 assert(next(m.begin())->first == 1); in main()
47 assert(next(m.begin())->second == 1.5); in main()
48 assert(next(m.begin(), 2)->first == 1); in main()
49 assert(next(m.begin(), 2)->second == 2); in main()
50 assert(next(m.begin(), 3)->first == 2); in main()
51 assert(next(m.begin(), 3)->second == 1.5); in main()
52 assert(next(m.begin(), 4)->first == 2); in main()
53 assert(next(m.begin(), 4)->second == 2); in main()
[all …]
|
| D | erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1); in main()
45 assert(next(m.begin(), 0)->second == 1); in main()
46 assert(next(m.begin(), 1)->first == 1); in main()
47 assert(next(m.begin(), 1)->second == 1.5); in main()
48 assert(next(m.begin(), 2)->first == 1); in main()
49 assert(next(m.begin(), 2)->second == 2); in main()
50 assert(next(m.begin(), 3)->first == 3); in main()
51 assert(next(m.begin(), 3)->second == 1); in main()
52 assert(next(m.begin(), 4)->first == 3); in main()
53 assert(next(m.begin(), 4)->second == 1.5); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
49 assert(next(m.begin(), 3)->first == 4); in main()
50 assert(next(m.begin(), 3)->second == 4.5); in main()
51 assert(next(m.begin(), 4)->first == 5); in main()
52 assert(next(m.begin(), 4)->second == 5.5); in main()
53 assert(next(m.begin(), 5)->first == 6); in main()
54 assert(next(m.begin(), 5)->second == 6.5); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| D | erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); in main()
28 assert(i == next(c.cbefore_begin(), 4)); in main()
30 assert(*next(c.begin(), 0) == 0); in main()
31 assert(*next(c.begin(), 1) == 1); in main()
32 assert(*next(c.begin(), 2) == 2); in main()
33 assert(*next(c.begin(), 3) == 3); in main()
34 assert(*next(c.begin(), 4) == 4); in main()
35 assert(*next(c.begin(), 5) == 5); in main()
36 assert(*next(c.begin(), 6) == 6); in main()
37 assert(*next(c.begin(), 7) == 7); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
49 assert(*next(m.begin(), 6) == 7); in main()
50 assert(*next(m.begin(), 7) == 8); in main()
[all …]
|
| D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
48 assert(*next(m.begin(), 5) == 7); in main()
49 assert(*next(m.begin(), 6) == 8); in main()
51 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| D | equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0)); in main()
45 assert(r.second == next(m.begin(), 0)); in main()
47 assert(r.first == next(m.begin(), 0)); in main()
48 assert(r.second == next(m.begin(), 3)); in main()
50 assert(r.first == next(m.begin(), 3)); in main()
51 assert(r.second == next(m.begin(), 3)); in main()
53 assert(r.first == next(m.begin(), 3)); in main()
54 assert(r.second == next(m.begin(), 6)); in main()
56 assert(r.first == next(m.begin(), 6)); in main()
57 assert(r.second == next(m.begin(), 6)); in main()
[all …]
|
| D | erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3); in main()
45 assert(*next(m.begin(), 1) == 3); in main()
46 assert(*next(m.begin(), 2) == 3); in main()
47 assert(*next(m.begin(), 3) == 5); in main()
48 assert(*next(m.begin(), 4) == 5); in main()
49 assert(*next(m.begin(), 5) == 5); in main()
50 assert(*next(m.begin(), 6) == 7); in main()
51 assert(*next(m.begin(), 7) == 7); in main()
52 assert(*next(m.begin(), 8) == 7); in main()
57 assert(*next(m.begin(), 0) == 3); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
49 assert(*next(m.begin(), 6) == 7); in main()
50 assert(*next(m.begin(), 7) == 8); in main()
[all …]
|
| D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
48 assert(*next(m.begin(), 5) == 7); in main()
49 assert(*next(m.begin(), 6) == 8); in main()
51 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| D | equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
52 assert(r.first == next(m.begin(), 3)); in main()
53 assert(r.second == next(m.begin(), 4)); in main()
55 assert(r.first == next(m.begin(), 4)); in main()
56 assert(r.second == next(m.begin(), 5)); in main()
[all …]
|
| D | erase_key.pass.cpp | 43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
49 assert(*next(m.begin(), 6) == 7); in main()
50 assert(*next(m.begin(), 7) == 8); in main()
55 assert(*next(m.begin(), 0) == 1); in main()
56 assert(*next(m.begin(), 1) == 2); in main()
[all …]
|
| D | upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1)); in main()
45 assert(r == next(m.begin(), 2)); in main()
47 assert(r == next(m.begin(), 3)); in main()
49 assert(r == next(m.begin(), 4)); in main()
51 assert(r == next(m.begin(), 5)); in main()
53 assert(r == next(m.begin(), 6)); in main()
55 assert(r == next(m.begin(), 7)); in main()
57 assert(r == next(m.begin(), 8)); in main()
59 assert(r == next(m.begin(), 0)); in main()
61 assert(r == next(m.begin(), 1)); in main()
[all …]
|
| D | lower_bound.pass.cpp | 45 assert(r == next(m.begin())); in main()
47 assert(r == next(m.begin(), 2)); in main()
49 assert(r == next(m.begin(), 3)); in main()
51 assert(r == next(m.begin(), 4)); in main()
53 assert(r == next(m.begin(), 5)); in main()
55 assert(r == next(m.begin(), 6)); in main()
57 assert(r == next(m.begin(), 7)); in main()
59 assert(r == next(m.begin(), 0)); in main()
61 assert(r == next(m.begin(), 1)); in main()
63 assert(r == next(m.begin(), 2)); in main()
[all …]
|
| /external/selinux/libsepol/cil/test/unit/ |
| D | test_cil_resolve_ast.c | 145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_roleallow()
165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_srcdecl_neg()
184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_tgtdecl_neg()
204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_classmapping_anon()
228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro()
232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro()
235 args->callstack = test_db->ast->root->cl_head->next->next->next; in test_cil_resolve_classmapping_anon_inmacro()
237 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next->next->cl_head, args); in test_cil_resolve_classmapping_anon_inmacro()
263 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro_neg()
267 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro_neg()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| D | equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
52 assert(r.first == next(m.begin(), 3)); in main()
53 assert(r.second == next(m.begin(), 4)); in main()
55 assert(r.first == next(m.begin(), 4)); in main()
56 assert(r.second == next(m.begin(), 5)); in main()
[all …]
|
| D | upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1)); in main()
45 assert(r == next(m.begin(), 2)); in main()
47 assert(r == next(m.begin(), 3)); in main()
49 assert(r == next(m.begin(), 4)); in main()
51 assert(r == next(m.begin(), 5)); in main()
53 assert(r == next(m.begin(), 6)); in main()
55 assert(r == next(m.begin(), 7)); in main()
57 assert(r == next(m.begin(), 8)); in main()
59 assert(r == next(m.begin(), 0)); in main()
61 assert(r == next(m.begin(), 1)); in main()
[all …]
|
| D | lower_bound.pass.cpp | 45 assert(r == next(m.begin())); in main()
47 assert(r == next(m.begin(), 2)); in main()
49 assert(r == next(m.begin(), 3)); in main()
51 assert(r == next(m.begin(), 4)); in main()
53 assert(r == next(m.begin(), 5)); in main()
55 assert(r == next(m.begin(), 6)); in main()
57 assert(r == next(m.begin(), 7)); in main()
59 assert(r == next(m.begin(), 0)); in main()
61 assert(r == next(m.begin(), 1)); in main()
63 assert(r == next(m.begin(), 2)); in main()
[all …]
|
| /external/iptables/libiptc/ |
| D | linux_list.h | 54 struct list_head *next, *prev; member
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 struct list_head *next) in __list_add() argument
76 next->prev = new; in __list_add()
77 new->next = next; in __list_add()
79 prev->next = new; in __list_add()
92 __list_add(new, head, head->next); in list_add()
115 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
117 new->next = next; in __list_add_rcu()
120 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); in main()
42 assert(i == next(m.begin(), 3)); in main()
45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
49 assert(next(m.begin(), 3)->first == 5); in main()
50 assert(next(m.begin(), 3)->second == 5.5); in main()
51 assert(next(m.begin(), 4)->first == 6); in main()
52 assert(next(m.begin(), 4)->second == 6.5); in main()
[all …]
|
| D | erase_key.pass.cpp | 45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
49 assert(next(m.begin(), 3)->first == 4); in main()
50 assert(next(m.begin(), 3)->second == 4.5); in main()
51 assert(next(m.begin(), 4)->first == 5); in main()
52 assert(next(m.begin(), 4)->second == 5.5); in main()
53 assert(next(m.begin(), 5)->first == 6); in main()
54 assert(next(m.begin(), 5)->second == 6.5); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
49 assert(next(m.begin(), 3)->first == 4); in main()
50 assert(next(m.begin(), 3)->second == 4.5); in main()
51 assert(next(m.begin(), 4)->first == 5); in main()
52 assert(next(m.begin(), 4)->second == 5.5); in main()
53 assert(next(m.begin(), 5)->first == 6); in main()
54 assert(next(m.begin(), 5)->second == 6.5); in main()
[all …]
|
| /external/linux-tools-perf/src/include/linux/ |
| D | list.h | 26 list->next = list; in INIT_LIST_HEAD()
39 struct list_head *next) in __list_add() argument
41 next->prev = new; in __list_add()
42 new->next = next; in __list_add()
44 prev->next = new; in __list_add()
49 struct list_head *next);
62 __list_add(new, head, head->next); in list_add()
86 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
88 next->prev = prev; in __list_del()
89 prev->next = next; in __list_del()
[all …]
|
| /external/libdrm/ |
| D | libdrm_lists.h | 37 struct _drmMMListHead *next; member
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; \
65 (__item)->next->prev = (__item)->prev; \
70 (__item)->prev->next = (__item)->next; \
[all …]
|