Home
last modified time | relevance | path

Searched refs:List (Results 1 – 25 of 367) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dpragma-loop.cpp15 List[i] = i * 2; in while_test()
27 List[i] = i * 2; in do_test()
41 List[i] = i * 2; in for_test()
48 double List[100]; in for_range_test() local
53 List[i] = i; in for_range_test()
85 List[i] = i; in for_contant_expression_test()
91 List[i] += i; in for_contant_expression_test()
125 List[i] = i; in for_template_constant_expression_test()
131 List[i] += i; in for_template_constant_expression_test()
138 List[i] += i; in for_template_constant_expression_test()
[all …]
H A Dpragma-unroll.cpp7 void while_test(int *List, int Length) { in while_test() argument
14 List[i] = i * 2; in while_test()
20 void do_test(int *List, int Length) { in do_test() argument
27 List[i] = i * 2; in do_test()
38 List[i] = i * 2; in for_test()
45 double List[100]; in for_range_test() local
48 for (int i : List) { in for_range_test()
50 List[i] = i; in for_range_test()
62 List[i] = i * Value; in for_define_test()
73 List[i] = i * Value; in for_template_test()
[all …]
H A Dpragma-gcc-unroll.cpp7 void while_test(int *List, int Length) { in while_test() argument
14 List[i] = i * 2; in while_test()
20 void do_test(int *List, int Length) { in do_test() argument
27 List[i] = i * 2; in do_test()
38 List[i] = i * 2; in for_test()
45 double List[100]; in for_range_test() local
48 for (int i : List) { in for_range_test()
50 List[i] = i; in for_range_test()
62 List[i] = i * Value; in for_define_test()
73 List[i] = i * Value; in for_template_test()
[all …]
H A Dpragma-loop-predicate.cpp3 void test0(int *List, int Length) { in test0() argument
9 List[i] = i * 2; in test0()
18 List[i] = i * 2; in test1()
27 List[i] = i * 2; in test2()
37 List[i] = i * 2; in test3()
48 List[i] = i * 2; in test4()
58 List[i] = i * 2; in test5()
68 List[i] = i * 2; in test6()
79 List[i] = i * 2; in test7()
90 List[i] = i * 2; in test8()
[all …]
H A Dpragma-loop-pr27643.cpp3 void loop1(int *List, int Length) { in loop1() argument
9 List[i] = i * 2; in loop1()
14 void loop2(int *List, int Length) { in loop2() argument
20 List[i] = i * 2; in loop2()
24 void loop3(int *List, int Length) { in loop3() argument
30 List[i] = i * 2; in loop3()
34 void loop4(int *List, int Length) { in loop4() argument
40 List[i] = i * 2; in loop4()
H A Dpragma-pipeline.cpp3 void pipeline_disabled(int *List, int Length, int Value) { in pipeline_disabled() argument
8 List[i] = Value; in pipeline_disabled()
12 void pipeline_not_disabled(int *List, int Length, int Value) { in pipeline_not_disabled() argument
15 List[i] = Value; in pipeline_not_disabled()
19 void pipeline_initiation_interval(int *List, int Length, int Value) { in pipeline_initiation_interval() argument
24 List[i] = Value; in pipeline_initiation_interval()
28 void pipeline_disabled_on_nested_loop(int *List, int Length, int Value) { in pipeline_disabled_on_nested_loop() argument
34 List[i * Length + j] = Value; in pipeline_disabled_on_nested_loop()
H A Dpragma-unroll-and-jam.cpp3 void unroll_and_jam(int *List, int Length, int Value) { in unroll_and_jam() argument
10 List[i * Length + j] = Value; in unroll_and_jam()
15 void unroll_and_jam_count(int *List, int Length, int Value) { in unroll_and_jam_count() argument
22 List[i * Length + j] = Value; in unroll_and_jam_count()
27 void nounroll_and_jam(int *List, int Length, int Value) { in nounroll_and_jam() argument
34 List[i * Length + j] = Value; in nounroll_and_jam()
39 void clang_unroll_plus_nounroll_and_jam(int *List, int Length, int Value) { in clang_unroll_plus_nounroll_and_jam() argument
47 List[i * Length + j] = Value; in clang_unroll_plus_nounroll_and_jam()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DIListTest.cpp29 ilist<Node> List; in TEST() local
30 List.push_back(new Node(1)); in TEST()
32 EXPECT_EQ(nullptr, List.getPrevNode(List.back())); in TEST()
33 EXPECT_EQ(nullptr, List.getNextNode(List.back())); in TEST()
37 EXPECT_EQ(2, List.getNextNode(List.front())->Value); in TEST()
38 EXPECT_EQ(1, List.getPrevNode(List.back())->Value); in TEST()
78 ilist<Node> List; in TEST() local
82 List.splice(List.begin(), List, List.begin()); in TEST()
85 EXPECT_TRUE(std::next(List.begin()) == List.end()); in TEST()
90 List.splice(std::next(List.begin()), List, List.begin()); in TEST()
[all …]
/llvm-project-15.0.7/clang/test/Parser/
H A Dpragma-loop.cpp10 List[i] = i; in test_nontype_template_param()
15 List[i] = i; in test_nontype_template_param()
23 List[i] = i; in test_nontype_template_vectorize()
28 List[i] += i; in test_nontype_template_vectorize()
36 List[i] = i; in test_nontype_template_interleave()
41 List[i] = i; in test_nontype_template_interleave()
49 List[i] = i; in test_nontype_template_char()
57 List[i] = i; in test_nontype_template_bool()
67 List[i] = i; in test_nontype_template_badarg()
76 List[i] = i; in test_type_template_vectorize()
[all …]
H A Dpragma-unroll.cpp11 List[i] = i; in test()
16 List[i] = i; in test()
21 List[i] = i; in test()
26 List[i] = i; in test()
33 List[i] = i; in test()
38 List[i] = i; in test()
48 List[i] = i; in test()
70 List[i] = i; in test()
76 List[i] = i; in test()
82 List[i] = i; in test()
[all …]
H A Dpragma-fp.cpp3 void test_0(int *List, int Length) { in test_0() argument
7 List[i] = i; in test_0()
10 void test_1(int *List, int Length) { in test_1() argument
14 List[i] = i; in test_1()
18 void test_3(int *List, int Length) { in test_3() argument
22 List[i] = i; in test_3()
30 List[i] = i; in test_4()
38 List[i] = i; in test_5()
46 List[i] = i; in test_6()
54 List[i] = i; in test_7()
[all …]
H A Dpragma-unroll-and-jam.cpp6 void test(int *List, int Length, int Value) { in test() argument
12 List[i * Length + j] = Value; in test()
19 List[i * Length + j] = Value; in test()
26 List[i * Length + j] = Value; in test()
35 List[i * Length + j] = Value; in test()
42 List[i * Length + j] = Value; in test()
57 List[i * Length + j] = Value; in test()
65 List[i * Length + j] = Value; in test()
73 List[i * Length + j] = Value; in test()
/llvm-project-15.0.7/clang/test/PCH/
H A Dpragma-loop.cpp33 List[i] = i; in run1()
45 List[i] = i; in run2()
57 List[i] = i; in run3()
66 List[i] = i; in run4()
75 List[i] = i; in run5()
84 List[i] = i; in run6()
94 List[i] = i; in run7()
101 int List[100]; in test() local
105 pt.run1(List, 100); in test()
106 pt.run2(List, 100); in test()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopRotate/
H A Dloopexitinglatch.ll7 %struct.List = type { %struct.List*, i32 }
9 define void @list_add(%struct.List** nocapture %list, %struct.List* %data) {
12 ; CHECK-NEXT: [[TMP0:%.*]] = load %struct.List*, %struct.List** [[LIST:%.*]], align 4
32 ; CHECK-NEXT: [[TMP5]] = load %struct.List*, %struct.List** [[NEXT]], align 4
39 ; CHECK-NEXT: store %struct.List* null, %struct.List** [[NEXT5]], align 4
67 %0 = load %struct.List*, %struct.List** %list, align 4
82 %3 = load %struct.List*, %struct.List** %next, align 4
88 store %struct.List* %data, %struct.List** %next.lcssa, align 4
90 store %struct.List* null, %struct.List** %next5, align 4
104 store %struct.List* %data, %struct.List** %next9, align 4
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DAllocatorList.h48 list_type List; variable
133 : AllocatorT(std::move(X.getAlloc())), List(std::move(X.List)) {} in AllocatorList()
136 List.cloneFrom(X.List, Cloner(*this), Disposer(*this)); in AllocatorList()
141 List = std::move(X.List);
147 List.cloneFrom(X.List, Cloner(*this), Disposer(*this));
154 List.swap(RHS.List); in swap()
158 bool empty() { return List.empty(); } in empty()
159 size_t size() { return List.size(); } in size()
174 T &back() { return List.back().V; } in back()
206 void pop_back() { List.eraseAndDispose(--List.end(), Disposer(*this)); } in pop_back()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2009-05-11-CodePlacementCrash.ll3 %struct.List = type { %struct.List*, i32 }
4 @Node5 = external constant %struct.List ; <%struct.List*> [#uses=1]
12 %CurL.02 = phi %struct.List* [ @Node5, %entry ], [ %2, %bb3 ] ; <%struct.List*> [#uses=1]
13 %PrevL.01 = phi %struct.List* [ null, %entry ], [ %CurL.02, %bb3 ] ; <%struct.List*> [#uses=1]
14 %0 = icmp eq %struct.List* %PrevL.01, null ; <i1> [#uses=1]
23 %2 = load %struct.List*, %struct.List** null, align 4 ; <%struct.List*> [#uses=2]
24 %phitmp = icmp eq %struct.List* %2, null ; <i1> [#uses=1]
H A D2009-08-21-PostRAKill3.ll7 %struct.Hosp = type { i32, i32, i32, %struct.List, %struct.List, %struct.List, %struct.List }
8 %struct.List = type { %struct.List*, %struct.Patient*, %struct.List* }
10 %struct.Village = type { [4 x %struct.Village*], %struct.Village*, %struct.List, %struct.Hosp, i32,…
22 …ntptr %struct.Village, %struct.Village* %0, i32 0, i32 3, i32 6, i32 0 ; <%struct.List**> [#uses=1]
23 store %struct.List* null, %struct.List** %1
24 …ntptr %struct.Village, %struct.Village* %0, i32 0, i32 3, i32 6, i32 2 ; <%struct.List**> [#uses=1]
25 store %struct.List* null, %struct.List** %2
/llvm-project-15.0.7/llvm/lib/Target/SystemZ/
H A DSystemZProcessors.td24 def : ProcessorModel<"z10", NoSchedModel, Arch8SupportedFeatures.List>;
26 def : ProcessorModel<"arch9", Z196Model, Arch9SupportedFeatures.List>;
27 def : ProcessorModel<"z196", Z196Model, Arch9SupportedFeatures.List>;
32 def : ProcessorModel<"arch11", Z13Model, Arch11SupportedFeatures.List>;
33 def : ProcessorModel<"z13", Z13Model, Arch11SupportedFeatures.List>;
35 def : ProcessorModel<"arch12", Z14Model, Arch12SupportedFeatures.List>;
36 def : ProcessorModel<"z14", Z14Model, Arch12SupportedFeatures.List>;
38 def : ProcessorModel<"arch13", Z15Model, Arch13SupportedFeatures.List>;
39 def : ProcessorModel<"z15", Z15Model, Arch13SupportedFeatures.List>;
41 def : ProcessorModel<"arch14", Z16Model, Arch14SupportedFeatures.List>;
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/
H A D2009-08-04-SubregLoweringBug2.ll4 %struct.Hosp = type { i32, i32, i32, %struct.List, %struct.List, %struct.List, %struct.List }
5 %struct.List = type { %struct.List*, %struct.Patient*, %struct.List* }
7 …%struct.Village = type { [4 x %struct.Village*], %struct.Village*, %struct.List, %struct.Hosp, i32…
9 define %struct.List* @sim(%struct.Village* %village) nounwind {
26 ret %struct.List* null
35 ret %struct.List* null
38 ret %struct.List* null
41 ret %struct.List* undef
H A D2009-08-04-SubregLoweringBug3.ll4 %struct.Hosp = type { i32, i32, i32, %struct.List, %struct.List, %struct.List, %struct.List }
5 %struct.List = type { %struct.List*, %struct.Patient*, %struct.List* }
7 …%struct.Village = type { [4 x %struct.Village*], %struct.Village*, %struct.List, %struct.Hosp, i32…
9 define %struct.List* @sim(%struct.Village* %village) nounwind {
38 ret %struct.List* null
47 ret %struct.List* null
50 ret %struct.List* null
53 ret %struct.List* undef
/llvm-project-15.0.7/clang/unittests/Tooling/Syntax/
H A DTreeTest.cpp233 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
246 EXPECT_EQ(dumpNodes(List->getElementsAsNodes()), "['a', 'b', 'c']"); in TEST_P()
254 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
274 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
286 EXPECT_EQ(dumpNodes(List->getElementsAsNodes()), "['a', 'b', 'c']"); in TEST_P()
294 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
317 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
331 EXPECT_EQ(dumpNodes(List->getElementsAsNodes()), "['a', 'b', 'c']"); in TEST_P()
342 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
366 auto *List = dyn_cast<syntax::List>(syntax::createTree( in TEST_P() local
[all …]
/llvm-project-15.0.7/clang/test/AST/
H A Dast-print-pragmas.cpp7 void test(int *List, int Length) { in test() argument
13 List[i] = i * 2; in test()
23 List[i] = i * 2; in test()
33 List[i] = i * 2; in test()
43 List[i] = i * 2; in test()
58 List[i] = i * 2; in test()
73 List[i] = i * 2; in test()
79 void test_nontype_template_param(int *List, int Length) { in test_nontype_template_param() argument
82 List[i] = i; in test_nontype_template_param()
89 void test_templates(int *List, int Length) { in test_templates() argument
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DScopedPrinter.h261 printListImpl(Label, List); in printList()
265 printListImpl(Label, List); in printList()
269 printListImpl(Label, List); in printList()
273 printListImpl(Label, List); in printList()
277 printListImpl(Label, List); in printList()
288 printListImpl(Label, List); in printList()
292 printListImpl(Label, List); in printList()
296 printListImpl(Label, List); in printList()
307 printListImpl(Label, List); in printList()
590 printListImpl(Label, List); in printList()
[all …]
/llvm-project-15.0.7/clang/test/Modules/Inputs/
H A Dtemplates-right.h8 template<typename T> class List; variable
9 template<> class List<bool> {
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; in defineListDoubleRight()
42 List<long> ll; in defineListLongRight()
/llvm-project-15.0.7/lldb/test/Shell/SymbolFile/PDB/Inputs/
H A DUdtLayoutTest.cpp47 class List { class
49 List() = default;
50 List(List *p, List *n, C v) : Prev(p), Next(n), Value(v) {} in List() function in List
53 List *Prev = nullptr;
54 List *Next = nullptr;
59 List ls[16]; in main()

12345678910>>...15