Searched defs:List (Results 1 - 25 of 180) sorted by relevance

12345678

/external/clang/test/CodeGenCXX/
H A Dpragma-loop-safety.cpp4 void vectorize_test(int *List, int Length) { argument
20 List[i] = i * 2;
27 void interleave_test(int *List, int Length) { argument
43 List[i] = i * 2;
H A Dconstructor-template.cpp22 template <typename T> class List { class
24 List(){ } // List<BinomialNode<int>*>::List() remains undefined. function in class:List
25 ~List() {}
39 List<BinomialNode<T>*> nodes;
H A Dpragma-unroll.cpp4 void while_test(int *List, int Length) { argument
11 List[i] = i * 2;
17 void do_test(int *List, int Length) { argument
24 List[i] = i * 2;
30 void for_test(int *List, int Length) { argument
35 List[i] = i * 2;
42 double List[100]; local
45 for (int i : List) {
47 List[i] = i;
54 void for_define_test(int *List, in argument
65 for_template_test(A *List, int Length, A Value) argument
76 for_template_define_test(A *List, int Length, A Value) argument
89 template_test(double *List, int Length) argument
[all...]
/external/clang/test/Misc/
H A Dast-print-pragmas-xfail.cpp6 void run1(int *List, int Length) { argument
18 List[i] = i;
H A Dast-print-pragmas.cpp10 void test(int *List, int Length) { argument
16 List[i] = i * 2;
29 List[i] = i * 2;
42 List[i] = i * 2;
48 void test_nontype_template_param(int *List, int Length) { argument
51 List[i] = i;
58 void test_templates(int *List, int Length) { argument
59 test_nontype_template_param<2, 4>(List, Length);
/external/clang/test/Parser/
H A Dpragma-loop-safety.cpp6 void test(int *List, int Length) { argument
12 List[i] = i;
25 List[i] = i;
33 List[i] = i;
H A Dpragma-unroll.cpp6 void test(int *List, int Length) { argument
11 List[i] = i;
16 List[i] = i;
21 List[i] = i;
26 List[i] = i;
33 List[i] = i;
38 List[i] = i;
48 List[i] = i;
61 List[i] = i;
67 List[
[all...]
H A Dpragma-loop.cpp7 void test_nontype_template_param(int *List, int Length) { argument
10 List[i] = i;
15 List[i] = i;
20 void test_nontype_template_vectorize(int *List, int Length) { argument
23 List[i] = i;
28 List[i] += i;
33 void test_nontype_template_interleave(int *List, int Length) { argument
36 List[i] = i;
41 List[i] = i;
46 void test_nontype_template_char(int *List, in argument
54 test_nontype_template_bool(int *List, int Length) argument
62 test_nontype_template_badarg(int *List, int Length) argument
71 test_type_template_vectorize(int *List, int Length) argument
79 test(int *List, int Length) argument
[all...]
/external/deqp/executor/
H A DxeTestCaseResult.cpp59 List::List (void) function in class:xe::ri::List
63 List::~List (void)
/external/clang/test/CodeGen/
H A Ddisable-tail-calls.c3 typedef struct List { struct
4 struct List *next;
6 } List; typedef in typeref:struct:List
8 // CHECK-LABEL: define %struct.List* @find
9 List *find(List *head, int data) {
14 // CHECK: call %struct.List* @find
H A Dtypes.c25 struct List { struct
30 struct List returned;
33 void test3(struct List a) {
/external/swiftshader/third_party/LLVM/unittests/ADT/
H A DilistTest.cpp27 ilist<Node> List; local
28 List.push_back(Node(1));
29 EXPECT_EQ(1, List.back().Value);
30 EXPECT_EQ(0, List.back().getPrevNode());
31 EXPECT_EQ(0, List.back().getNextNode());
33 List.push_back(Node(2));
34 EXPECT_EQ(2, List.back().Value);
35 EXPECT_EQ(2, List.front().getNextNode()->Value);
36 EXPECT_EQ(1, List.back().getPrevNode()->Value);
38 const ilist<Node> &ConstList = List;
[all...]
/external/llvm/unittests/ADT/
H A DilistTest.cpp30 ilist<Node> List; local
31 List.push_back(Node(1));
32 EXPECT_EQ(1, List.back().Value);
33 EXPECT_EQ(nullptr, List.getPrevNode(List.back()));
34 EXPECT_EQ(nullptr, List.getNextNode(List.back()));
36 List.push_back(Node(2));
37 EXPECT_EQ(2, List.back().Value);
38 EXPECT_EQ(2, List
48 ilist<Node> List; local
60 List.splice(std::next(List.begin()), List, List.begin()); local
68 ilist<Node> List; local
[all...]
/external/autotest/client/cros/cellular/pseudomodem/
H A Dmessaging.py26 def List(self): member in class:Messaging
/external/clang/test/PCH/
H A Dpragma-loop.cpp29 inline void run1(int *List, int Length) { argument
35 List[i] = i;
40 inline void run2(int *List, int Length) { argument
47 List[i] = i;
52 inline void run3(int *List, int Length) { argument
59 List[i] = i;
64 inline void run4(int *List, int Length) { argument
68 List[i] = i;
73 inline void run5(int *List, int Length) { argument
77 List[
82 run6(int *List, int Length) argument
92 run7(int *List, int Length) argument
103 int List[100]; local
[all...]
/external/llvm/lib/IR/
H A DModuleSummaryIndex.cpp27 GlobalValueSummaryList &List = OtherGlobalValSummaryLists.second; local
31 assert(List.size() == 1);
32 std::unique_ptr<GlobalValueSummary> Summary = std::move(List.front());
/external/llvm/unittests/Support/
H A DSpecialCaseListTest.cpp21 std::unique_ptr<SpecialCaseList> makeSpecialCaseList(StringRef List, argument
23 std::unique_ptr<MemoryBuffer> MB = MemoryBuffer::getMemBuffer(List);
27 std::unique_ptr<SpecialCaseList> makeSpecialCaseList(StringRef List) { argument
29 auto SCL = makeSpecialCaseList(List, Error);
/external/v8/src/
H A Dlist.h30 // class AllocationPolicy = FreeStoreAllocationPolicy> class List;
32 class List { class in namespace:v8::internal
34 explicit List(AllocationPolicy allocator = AllocationPolicy()) { function in class:v8::internal::List
37 INLINE(explicit List(int capacity,
41 INLINE(~List()) { DeleteData(data_); }
94 void AddAll(const List<T, AllocationPolicy>& other,
144 INLINE(void Swap(List<T, AllocationPolicy>* list));
190 // List must be full already.
200 DISALLOW_COPY_AND_ASSIGN(List);
205 size_t GetMemoryUsedByList(const List< argument
[all...]
/external/clang/test/Modules/Inputs/
H A Dtemplates-left.h7 template<typename T> class List;
8 template<> class List<bool> { class
22 constexpr unsigned List<int>::*size_left = &List<int>::size;
23 List<int> list_left = { 0, 8 };
24 typedef List<int> ListInt_left;
38 List<double> ld;
H A Dtemplates-right.h8 template<typename T> class List;
9 template<> class List<bool> { class
21 constexpr unsigned List<int>::*size_right = &List<int>::size;
22 List<int> list_right = { 0, 12 };
23 typedef List<int> ListInt_right;
36 List<double> ld;
42 List<long> ll;
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DTestEnumMapGenerator.java23 import java.util.List;
82 List<Entry<AnEnum, String>> insertionOrder) {
81 order( List<Entry<AnEnum, String>> insertionOrder) argument
H A DTestStringMapGenerator.java21 import java.util.List;
83 List<Entry<String, String>> insertionOrder) {
82 order( List<Entry<String, String>> insertionOrder) argument
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DTestStringBiMapGenerator.java24 import java.util.List;
87 List<Entry<String, String>> insertionOrder) {
86 order( List<Entry<String, String>> insertionOrder) argument
/external/libcxx/test/std/containers/sequences/list/list.ops/
H A Dremove.pass.cpp67 typedef std::list<int, Alloc> List; typedef
70 List c(a1, a1 + 4, Alloc::create());
72 assert(c == List(a2, a2 + 3, Alloc::create()));
/external/llvm/include/llvm/ADT/
H A Dilist_node.h1 //==-- llvm/ADT/ilist_node.h - Intrusive Linked List Helper ------*- C++ -*-==//
97 const auto &List = local
99 return List.getPrevNode(*static_cast<NodeTy *>(this));
110 const auto &List = local
112 return List.getNextNode(*static_cast<NodeTy *>(this));

Completed in 692 milliseconds

12345678