| /llvm-project-15.0.7/compiler-rt/lib/tsan/tests/unit/ |
| H A D | tsan_ilist_test.cpp | 86 IList<Node, &Node::node2, Parent> list2; in TEST() local 93 list2.PushFront(&nodes[1]); in TEST() 100 EXPECT_EQ(list2.Size(), (size_t)1); in TEST() 101 EXPECT_FALSE(list2.Queued(&nodes[0])); in TEST() 102 EXPECT_TRUE(list2.Queued(&nodes[1])); in TEST() 103 EXPECT_FALSE(list2.Queued(&nodes[2])); in TEST() 108 EXPECT_EQ(list2.Next(&nodes[1]), nullptr); in TEST() 114 EXPECT_EQ(list2.Size(), (size_t)1); in TEST() 115 EXPECT_TRUE(list2.Queued(&nodes[1])); in TEST() 121 EXPECT_EQ(list2.PopBack(), &nodes[1]); in TEST() [all …]
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | filter.td | 23 // CHECK: list2 = []; 31 list<string> list2 = !filter(item, EmptyList, false); 40 // CHECK: list2 = ["bar", "zoo", "snork", "snork", "quux"]; 45 list<string> list2 = !filter(item, WordList, !ne(item, "foo")); 51 // CHECK: list2 = [4, 5, 6, 7, 8]; 55 list<int> list2 = !filter(num, list1, !lt(num, 9));
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_fold.c | 705 list2 = isl_qpolynomial_list_drop(list2, i, 1); in merge_lists() 712 isl_qpolynomial_list_free(list2); in merge_lists() 730 isl_qpolynomial_list *list2; in isl_qpolynomial_fold_fold_on_domain() local 811 isl_qpolynomial_list *list1, *list2; in isl_qpolynomial_fold_add_on_domain() local 1084 isl_qpolynomial_list *list1, *list2; in isl_qpolynomial_fold_fold() local 1293 isl_qpolynomial_list *list1, *list2; in isl_qpolynomial_fold_plain_cmp() local 1360 isl_qpolynomial_list *list1, *list2; in isl_qpolynomial_fold_plain_is_equal() local 1374 list2 = isl_qpolynomial_list_copy(list2); in isl_qpolynomial_fold_plain_is_equal() 1375 list2 = isl_qpolynomial_list_sort(list2, &qpolynomial_cmp, NULL); in isl_qpolynomial_fold_plain_is_equal() 1378 isl_qpolynomial_list_free(list2); in isl_qpolynomial_fold_plain_is_equal() [all …]
|
| H A D | isl_list_templ.c | 622 __isl_take LIST(EL) *list1, __isl_take LIST(EL) *list2) in LIST() 626 for (i = 0; i < list2->n; ++i) in LIST() 628 FN(LIST(EL),free)(list2); in LIST() 638 __isl_take LIST(EL) *list2) in LIST() 644 if (!list1 || !list2) in LIST() 648 return FN(LIST(EL),concat_inplace)(list1, list2); in LIST() 651 res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n); in LIST() 654 for (i = 0; i < list2->n; ++i) in LIST() 655 res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i])); in LIST() 658 FN(LIST(EL),free)(list2); in LIST() [all …]
|
| H A D | isl_ast_graft.c | 1240 __isl_take isl_ast_graft_list *list2, in isl_ast_graft_list_merge() argument 1245 if (!list1 || !list2 || !build) in isl_ast_graft_list_merge() 1247 if (list2->n == 0) { in isl_ast_graft_list_merge() 1248 isl_ast_graft_list_free(list2); in isl_ast_graft_list_merge() 1253 return list2; in isl_ast_graft_list_merge() 1257 for (i = 0; i < list2->n; ++i) { in isl_ast_graft_list_merge() 1259 graft = isl_ast_graft_list_get_ast_graft(list2, i); in isl_ast_graft_list_merge() 1311 if (i < list2->n) in isl_ast_graft_list_merge() 1313 isl_ast_graft_list_free(list2); in isl_ast_graft_list_merge() 1318 isl_ast_graft_list_free(list2); in isl_ast_graft_list_merge()
|
| H A D | isl_pw_union_opt.c | 237 isl_set_list *list2 = data2->cell; in FN() local 261 set = isl_set_list_get_set(list2, j); in FN() 266 isl_set_list_get_set(list2, j)); in FN()
|
| H A D | isl_ast_graft_private.h | 63 __isl_take isl_ast_graft_list *list2,
|
| H A D | isl_aff.c | 3169 __isl_take isl_pw_aff_list *list2, in pw_aff_list_set() argument 3177 if (!list1 || !list2) in pw_aff_list_set() 3181 if (list1->n < 1 || list2->n < 1) in pw_aff_list_set() 3187 for (j = 0; j < list2->n; ++j) { in pw_aff_list_set() 3196 isl_pw_aff_list_free(list2); in pw_aff_list_set() 3200 isl_pw_aff_list_free(list2); in pw_aff_list_set() 3209 __isl_take isl_pw_aff_list *list2) in isl_pw_aff_list_eq_set() argument 3215 __isl_take isl_pw_aff_list *list2) in isl_pw_aff_list_ne_set() argument 3225 __isl_take isl_pw_aff_list *list2) in isl_pw_aff_list_le_set() argument 3231 __isl_take isl_pw_aff_list *list2) in isl_pw_aff_list_lt_set() argument [all …]
|
| H A D | isl_schedule_tree.c | 2145 isl_schedule_tree_list *list1, *list2; in isl_schedule_tree_sequence_splice() local 2165 list2 = isl_schedule_tree_list_copy(tree->children); in isl_schedule_tree_sequence_splice() 2166 list2 = isl_schedule_tree_list_drop(list2, 0, pos + 1); in isl_schedule_tree_sequence_splice() 2169 list1 = isl_schedule_tree_list_concat(list1, list2); in isl_schedule_tree_sequence_splice()
|
| H A D | isl_input.c | 1852 isl_pw_aff_list *list1 = NULL, *list2 = NULL; in add_constraint() local 1870 list2 = accept_affine_list(s, isl_set_get_space(set), v); in add_constraint() 1872 n2 = isl_pw_aff_list_n_pw_aff(list2); in add_constraint() 1881 set = construct_constraints(set, type, list1, list2, rational); in add_constraint() 1883 list1 = list2; in add_constraint() 1896 isl_pw_aff_list_free(list2); in add_constraint()
|
| /llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/google/ |
| H A D | explicit-constructor.cpp | 67 B(const std::initializer_list<unsigned> &list2) {} in B() 101 C(const initializer_list<unsigned> &list2) {} in C() 108 C2(const initializer_list<unsigned> &list2) {} in C2() 119 C3(const std::initializer_list<T*> &list2) {} in C3()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-objcopy/ELF/ |
| H A D | weaken.test | 14 # RUN: echo ".*al # Global + Local == .*al" > %t-list2.txt 15 # RUN: echo "Weak # weak" >> %t-list2.txt 16 # RUN: echo " Gnu.*" >> %t-list2.txt 17 # RUN: llvm-objcopy --regex --weaken-symbols %t-list2.txt %t %t5
|
| H A D | localize.test | 22 # RUN: echo " .*al.* # Global + Local + GlobalCommon " > %t-list2.txt 23 # RUN: echo "Weak" >> %t-list2.txt 24 # RUN: llvm-objcopy --regex --localize-symbols %t-list2.txt %t %t5
|
| H A D | strip-symbol.test | 15 # RUN: echo "b.* # bar & baz" > %t-list2.txt 16 # RUN: llvm-objcopy --regex --strip-symbols %t-list2.txt %t %t7
|
| H A D | globalize.test | 18 # RUN: echo "[GLW].+ # .+ " > %t-list2.txt 19 # RUN: llvm-objcopy --regex --globalize-symbols %t-list2.txt %t %t5
|
| H A D | strip-unneeded.test | 32 # RUN: echo " .* # * - remove all " > %t.list2.txt 33 # RUN: llvm-objcopy --regex --strip-unneeded-symbols %t.list2.txt %t %t6
|
| /llvm-project-15.0.7/llvm/test/Other/ |
| H A D | ResponseFile.ll | 7 ; RUN: echo "-time-passes @%t.list1" | sed -e 's:\\:\\\\:g' > %t.list2 8 ; RUN: llvm-as @%t.list2 -o %t.bc
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/ |
| H A D | 2011-05-26-BranchKillsVreg.ll | 31 %list2.1 = phi i8* [ undef, %if.then419 ], [ %list1.0482, %while.end415 ] 32 tail call void @free(i8* %list2.1)
|
| /llvm-project-15.0.7/libc/cmake/modules/ |
| H A D | LLVMLibCCheckCpuFeatures.cmake | 38 function(_intersection output_var list1 list2) 40 if("${list2}" MATCHES "(^|;)${element}(;|$)")
|
| /llvm-project-15.0.7/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| H A D | p3.cpp | 137 …MoveOnly (&&list2)[1] = {mo}; // expected-error {{call to implicitly-deleted copy constructor}} ex… in test() local
|
| /llvm-project-15.0.7/polly/lib/External/isl/include/isl/ |
| H A D | list.h | 63 __isl_take isl_##EL##_list *list2); \
|
| H A D | aff.h | 472 __isl_take isl_pw_aff_list *list2); 474 __isl_take isl_pw_aff_list *list2); 476 __isl_take isl_pw_aff_list *list2); 478 __isl_take isl_pw_aff_list *list2); 480 __isl_take isl_pw_aff_list *list2); 482 __isl_take isl_pw_aff_list *list2);
|
| /llvm-project-15.0.7/third-party/benchmark/tools/gbench/ |
| H A D | report.py | 113 def intersect(list1, list2): argument 118 return [x for x in list1 if x in list2]
|
| /llvm-project-15.0.7/lldb/third_party/Python/module/unittest2/unittest2/ |
| H A D | case.py | 814 def assertListEqual(self, list1, list2, msg=None): argument 824 self.assertSequenceEqual(list1, list2, msg, seq_type=list)
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-libtool-darwin/ |
| H A D | filelist.test | 108 # RUN: touch %t.list1.txt and %t.list2.txt
|