| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mmix/ |
| list-pseudoints.l | 1 GAS for MMIX .*/list-pseudoints.s page 1
13 GAS for MMIX .*/list-pseudoints.s page 2
17 .*/list-pseudoints.s:1 .text:0000000000000000 start
18 .*/list-pseudoints.s:3 .text:0000000000000004 start2
|
| list-textfirst.l | 1 GAS for MMIX .*/list-textfirst\.s page 1
11 GAS for MMIX .*/list-textfirst\.s page 2
15 .*/list-textfirst\.s:2 \.data:0000000000000000 here
16 .*/list-textfirst\.s:5 \.text:0000000000000000 there
|
| /external/google-breakpad/src/client/mac/handler/ |
| breakpad_nlist_64.h | 8 // notice, this list of conditions and the following disclaimer.
10 // copyright notice, this list of conditions and the following disclaimer
39 struct nlist *list,
43 struct nlist_64 *list,
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.cons/ |
| db_copy.pass.cpp | 10 // <list>
12 // list(list&& c);
17 #include <list>
23 std::list<int> l1;
25 std::list<int>::iterator i = l1.begin();
26 std::list<int> l2 = l1;
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int> l2(a1, a1+3);
26 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int> l2(a1, a1+3);
26 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int> l2(a1, a1+3);
26 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| insert_iter_iter_iter_db1.pass.cpp | 10 // <list>
19 #include <list>
27 std::list<int> v(100);
28 std::list<int> v2(100);
31 std::list<int>::iterator i = v.insert(next(v2.cbegin(), 10),
|
| pop_back_db1.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> c(a, a+3);
26 assert(c == std::list<int>(a, a+2));
28 assert(c == std::list<int>(a, a+1));
|
| erase_iter_db1.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| insert_iter_rvalue_db1.pass.cpp | 10 // <list>
17 #include <list>
23 std::list<int> v1(3);
24 std::list<int> v2(3);
|
| insert_iter_value_db1.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> v1(3);
25 std::list<int> v2(3);
|
| /external/libcxx/test/libcxx/experimental/memory/memory.resource.aliases/ |
| header_list_libcpp_version.pass.cpp | 12 // <experimental/list>
14 #include <experimental/list>
|
| /external/libcxx/test/std/experimental/optional/optional.syn/ |
| optional_includes_initializer_list.pass.cpp | 21 std::initializer_list<int> list;
|
| /external/selinux/libsepol/cil/src/ |
| cil_list.c | 8 * this list of conditions and the following disclaimer.
11 * this list of conditions and the following disclaimer in the documentation
47 void cil_list_init(struct cil_list **list, enum cil_flavor flavor)
53 *list = new_list;
56 void cil_list_destroy(struct cil_list **list, unsigned destroy_data)
58 if (*list == NULL) {
62 struct cil_list_item *item = (*list)->head;
75 free(*list);
76 *list = NULL;
98 void cil_list_append(struct cil_list *list, enum cil_flavor flavor, void *data
[all...] |
| /external/syslinux/core/thread/ |
| exit_thread.c | 13 /* Remove from the linked list */
14 curr->list.prev->next = curr->list.next;
15 curr->list.next->prev = curr->list.prev;
23 * curr isn't part of the linked list anymore, as long as
24 * curr->list.next is still valid.
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/optional/optional.syn/ |
| optional_includes_initializer_list.pass.cpp | 21 std::initializer_list<int> list;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/memory/memory.resource.aliases/ |
| header_list_libcpp_version.pass.cpp | 12 // <experimental/list>
14 #include <experimental/list>
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/optional/optional.syn/ |
| optional_includes_initializer_list.pass.cpp | 21 std::initializer_list<int> list;
|
| /system/core/libcutils/include/cutils/ |
| list.h | 41 #define list_for_each(node, list) \
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \
45 for (node = (list)->prev; node != (list); node = node->prev)
47 #define list_for_each_safe(node, n, list) \
48 for (node = (list)->next, n = node->next; \
49 node != (list); \
80 #define list_empty(list) ((list) == (list)->next
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/h/ |
| sorlist.h | 43 extern void *slist_iterate(SList *list, SList **);
44 extern void slist_add( SList **list, void *e );
45 extern void slist_free(SList *list);
|
| /external/dagger2/compiler/src/it/functional-tests/src/main/java/test/ |
| ChildIntegerModule.java | 6 import java.util.List;
9 class ChildIntegerModule extends ParentModule<Integer, String, List<Integer>> {
15 @Provides List<Integer> provideListOfInteger() {
16 List<Integer> list = new ArrayList<>(); local
17 list.add(2);
18 return list;
|
| /external/fio/ |
| cgroup.h | 9 void cgroup_kill(struct flist_head *list);
13 static inline int cgroup_setup(struct thread_data *td, struct flist_head *list,
24 static inline void cgroup_kill(struct flist_head *list)
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.ops/ |
| db_splice_pos_list.pass.cpp | 10 // <list>
12 // void splice(const_iterator position, list& x);
17 #include <list>
24 std::list<int> v1(3);
25 std::list<int> v2(3);
|
