Home
last modified time | relevance | path

Searched refs:comp (Results 1 – 25 of 154) sorted by relevance

1234567

/llvm-project-15.0.7/flang/runtime/
H A Dderived.cpp27 const auto &comp{ in Initialize() local
33 j * byteStride + comp.offset())}; in Initialize()
55 comp.derivedType() && !comp.derivedType()->noInitializationNeeded()) { in Initialize()
73 comp.rank(), extent); in Initialize()
85 const auto &comp{ in Initialize() local
89 j * byteStride + comp.offset)}; in Initialize()
90 pptr = comp.procInitialization; in Initialize()
171 const auto &comp{ in Finalize() local
187 comp.derivedType() && !comp.derivedType()->noFinalizationNeeded()) { in Finalize()
202 comp.rank(), extent); in Finalize()
[all …]
H A Dassign.cpp185 const auto &comp{ in Assign() local
188 switch (comp.genre()) { in Assign()
190 if (comp.category() == TypeCategory::Derived) { in Assign()
197 comp.CreatePointerDescriptor( in Assign()
202 std::size_t componentByteSize{comp.SizeInBytes(to)}; in Assign()
205 std::memmove(to.Element<char>(toAt) + comp.offset(), in Assign()
212 std::size_t componentByteSize{comp.SizeInBytes(to)}; in Assign()
215 std::memmove(to.Element<char>(toAt) + comp.offset(), in Assign()
216 from.Element<const char>(fromAt) + comp.offset(), in Assign()
225 to.Element<char>(toAt) + comp.offset())}; in Assign()
[all …]
/llvm-project-15.0.7/clang/test/OpenMP/
H A Dteams_codegen.cpp26 int comp = 1; in teams_argument_global_local() local
34 ++comp; in teams_argument_global_local()
41 ++comp; in teams_argument_global_local()
49 ++comp; in teams_argument_global_local()
56 ++comp; in teams_argument_global_local()
65 ++comp; in teams_argument_global_local()
77 return comp; in teams_argument_global_local()
119 ++comp; in teams_template_arg()
128 ++comp; in teams_template_arg()
164 ++comp; in foo()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.clamp/
H A Dclamp.comp.pass.cpp72 assert(eq(std::clamp(x, y, z, comp), x)); in main()
73 assert(eq(std::clamp(y, x, z, comp), y)); in main()
81 assert(eq(std::clamp(x, y, z, comp), x)); in main()
82 assert(eq(std::clamp(y, x, z, comp), y)); in main()
90 assert(eq(std::clamp(x, y, z, comp), x)); in main()
91 assert(eq(std::clamp(z, y, x, comp), z)); in main()
99 assert(eq(std::clamp(x, y, z, comp), x)); in main()
100 assert(eq(std::clamp(y, x, z, comp), x)); in main()
108 assert(eq(std::clamp(x, y, z, comp), y)); in main()
109 assert(eq(std::clamp(y, x, z, comp), y)); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/support/
H A Dpointer_comparison_test_helper.h26 Compare comp; in do_pointer_comparison_test() local
37 assert(comp(lhs, rhs) == ucomp(lhs_uint, rhs_uint)); in do_pointer_comparison_test()
44 void do_pointer_comparison_test(Comp comp) { in do_pointer_comparison_test() argument
55 assert(comp(lhs, rhs) == comp(lhs_uint, rhs_uint)); in do_pointer_comparison_test()
56 assert(comp(lhs_void, rhs_void) == comp(lhs_uint, rhs_uint)); in do_pointer_comparison_test()
/llvm-project-15.0.7/llvm/test/tools/llvm-dwarfdump/X86/
H A Dsources.test43 # RUN: yaml2obj --docnum=2 %s -o %t.comp-dir.o
44 # RUN: llvm-dwarfdump --show-sources %t.comp-dir.o 2>&1 | \
78 - CStr: /comp/first
83 - CStr: /comp/second
86 # RUN: -DFIRST_NAME=first.c -DFIRST_COMP_DIR=/comp/first \
88 # RUN: -o %t.comp-dir-rel-name.o %s
94 # CU-COMP-DIR-REL-NAME-NEXT: /comp/second[[SEP]]second.c
163 # LINE-TABLE-ABS: /comp/first[[SEP:[/\\]]]first.c
164 # LINE-TABLE-ABS-NEXT: /comp/second[[SEP]]second.c
181 IncludeDirs: [/comp/first]
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons.alloc/
H A Dctor_alloc.pass.cpp29 test(const value_compare& comp, const test_allocator<int>& a) in test()
30 : base(comp, c, a) {} in test()
31 test(const value_compare& comp, const container_type& container, in test()
32 const test_allocator<int>& a) : base(comp, container, a) {} in test()
34 test(const value_compare& comp, container_type&& container, in test()
35 const test_allocator<int>& a) : base(comp, std::move(container), a) {} in test()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dnth_element.pass.cpp76 … Iterator1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
82 … Iterator1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
92 Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
103 std::nth_element(first1, mid1, last1, comp); in operator ()()
104 std::nth_element(exec, first2, mid2, last2, comp); in operator ()()
109 …EXPECT_TRUE(std::find_first_of(first2, mid2, mid2, last2, [comp](T& x, T& y) { return comp(y, x); … in operator ()()
123 test_by_type(Generator1 generator1, Generator2 generator2, Compare comp) in test_by_type() argument
135 generator1, generator2, comp); in test_by_type()
138 generator1, generator2, comp); in test_by_type()
141 generator1, generator2, comp); in test_by_type()
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.heap.operations/
H A Dis_heap.pass.cpp96 test_is_heap_by_type(Comp comp) in test_is_heap_by_type() argument
105 invoke_on_all_policies(test_is_heap(), in.begin(), in.end(), comp); in test_is_heap_by_type()
107 std::make_heap(in.begin(), in.begin() + n / 4, comp); in test_is_heap_by_type()
108 invoke_on_all_policies(test_is_heap(), in.cbegin(), in.cend(), comp); in test_is_heap_by_type()
110 std::make_heap(in.begin(), in.begin() + n / 3, comp); in test_is_heap_by_type()
111 invoke_on_all_policies(test_is_heap(), in.begin(), in.end(), comp); in test_is_heap_by_type()
113 std::make_heap(in.begin(), in.end(), comp); in test_is_heap_by_type()
114 invoke_on_all_policies(test_is_heap(), in.cbegin(), in.cend(), comp); in test_is_heap_by_type()
118 invoke_on_all_policies(test_is_heap(), in.begin(), in.end(), comp); in test_is_heap_by_type()
/llvm-project-15.0.7/libcxx/include/
H A Dqueue124 Compare comp;
522 {c = __q.c; comp = __q.comp; return *this;}
529 : c(_VSTD::move(__q.c)), comp(_VSTD::move(__q.comp)) {}
702 comp(__comp)
714 comp(__comp)
727 comp(__comp)
739 comp(__comp)
802 comp(__q.comp)
828 comp(_VSTD::move(__q.comp))
841 comp()
[all …]
H A Dalgorithm465 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
862 Comp comp = {}, Proj1 proj1 = {},
899 set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
913 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
1614 min(const T& a, const T& b, Compare comp);
1622 min(initializer_list<T> t, Compare comp);
1644 max(const T& a, const T& b, Compare comp);
1652 max(initializer_list<T> t, Compare comp);
1668 minmax(const T& a, const T& b, Compare comp);
1676 minmax(initializer_list<T> t, Compare comp);
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dminmax_element_comp.pass.cpp31 Compare comp; in test() local
32 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); in test()
37 assert(!comp(*j, *p.first)); in test()
38 assert(!comp(*p.second, *j)); in test()
77 Compare comp; in test() local
78 std::pair<Iter, Iter> p = std::minmax_element(Iter(a), Iter(a+N), comp); in test()
H A Dranges.minmax.pass.cpp112 constexpr bool comp(S rhs) const { return i < rhs.i; } in test_2_arguments() function
115 auto ret = std::ranges::minmax(a[0], a[1], &S::comp); in test_2_arguments()
177 constexpr bool comp(S rhs) const { return i < rhs.i; } in test_initializer_list() function
179 auto ret = std::ranges::minmax({S {1}, S {2}, S {3}, S {4}}, &S::comp); in test_initializer_list()
298 constexpr bool comp(S rhs) const { return i < rhs.i; } in test_range() function
301 auto ret = std::ranges::minmax(a, &S::comp); in test_range()
309 int comp; in test_range() member
313 auto ret = std::ranges::minmax(a, {}, &S::comp); in test_range()
314 assert(ret.min.comp == 0); in test_range()
315 assert(ret.max.comp == 0); in test_range()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.merge/
H A Dinplace_merge.pass.cpp28 Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
35 … BiDirIt1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
45 Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
55 std::inplace_merge(first1, mid1, last1, comp); in operator ()()
56 std::inplace_merge(exec, first2, mid2, last2, comp); in operator ()()
70 test_by_type(Generator1 generator1, Generator2 generator2, Compare comp) in test_by_type() argument
82 generator1, generator2, comp); in test_by_type()
86 generator1, generator2, comp); in test_by_type()
90 generator1, generator2, comp); in test_by_type()
H A Dmerge.pass.cpp28 OutputIterator out_first, OutputIterator out_last, Compare comp) in operator ()()
32 const auto res = merge(exec, first1, last1, first2, last2, out_first, comp); in operator ()()
34 EXPECT_TRUE(is_sorted(out_first, res, comp), "wrong result from merge with predicate"); in operator ()()
35 …EXPECT_TRUE(includes(out_first, res, first1, last1, comp), "first sequence is not a part of result… in operator ()()
36 …EXPECT_TRUE(includes(out_first, res, first2, last2, comp), "second sequence is not a part of resul… in operator ()()
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dwarn-max-unsigned-zero.cpp50 #define comp(x,y) std::max(x, y) macro
52 int b = comp(0, 1);
53 int c = comp(0u, 1u);
54 int d = comp(2u, 0u);
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dset.pass.cpp60 Compare comp) in operator ()()
70 auto expect_res = std::set_union(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
71 auto res = std::set_union(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
90 Compare comp) in operator ()()
100 auto expect_res = std::set_intersection(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
101 auto res = std::set_intersection(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
120 Compare comp) in operator ()()
130 auto expect_res = std::set_difference(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
131 auto res = std::set_difference(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
150 Compare comp) in operator ()()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dranges_pop_heap.pass.cpp41 …HasPopHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, co…
52 concept HasPopHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
129 auto comp = std::ranges::greater{}; in test()
132 auto last = std::ranges::pop_heap(in.begin(), in.end(), comp); in test()
135 assert(std::is_heap(in.begin(), in.end() - 1, comp)); in test()
140 auto last = std::ranges::pop_heap(in, comp); in test()
143 assert(std::is_heap(in.begin(), in.end() - 1, comp)); in test()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A Dsimple_ilist.h258 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
264 template <class Compare> void sort(Compare comp);
270 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { in merge() argument
276 if (comp(*RI, *LI)) { in merge()
279 RI = std::find_if(RI, RE, [&](reference RV) { return !comp(RV, *LI); }); in merge()
292 void simple_ilist<T, Options...>::sort(Compare comp) { in sort() argument
307 sort(comp); in sort()
308 RHS.sort(comp); in sort()
309 merge(RHS, comp); in sort()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dranges_includes.pass.cpp47 …requires(Iter1&& iter1, Sent1&& sent1, Iter2&& iter2, Sent2&& sent2, Comp&& comp, Proj1&& proj1, P…
53 std::forward<Comp>(comp),
83 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
87 std::forward<Comp>(comp),
252 const auto comp = [](const Data& x, const Data& y) { return x.data < y.data; }; in test() local
257 auto result = std::ranges::includes(r1.begin(), r1.end(), r2.begin(), r2.end(), comp); in test()
263 auto result = std::ranges::includes(r1, r2, comp); in test()
297 constexpr auto comp() { in test() function
327 …r1.begin(), r1.end(), r2.begin(), r2.end(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()… in test()
338 …auto result = std::ranges::includes(r1, r2, compProjs.comp(), compProjs.proj1(), compProjs.proj2()… in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
H A Dranges_sort_heap.pass.cpp41 …asSortHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, co…
52 concept HasSortHeapR = requires(Range range, Comp comp) { std::ranges::make_heap(range, comp); };
127 auto comp = std::ranges::greater{}; in test()
128 assert(std::is_heap(input.begin(), input.end(), comp)); in test()
132 auto last = std::ranges::sort_heap(in.begin(), in.end(), comp); in test()
139 auto last = std::ranges::sort_heap(in, comp); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dranges_unique.pass.cpp37 requires(Iter&& iter, Sent&& sent, Comp&& comp, Proj&& proj) {
39 …std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Comp>(comp), std::forward<Proj>(p…
56 requires(Range&& range, Comp&& comp, Proj&& proj) {
57 …std::ranges::unique(std::forward<Range>(range), std::forward<Comp>(comp), std::forward<Proj>(proj)…
163 const auto comp = [](const Data& x, const Data& y) { return x.data == y.data; }; in test() local
168 auto result = std::ranges::unique(in.begin(), in.end(), comp); in test()
169 … assert(std::ranges::equal(in.begin(), result.begin(), expected.begin(), expected.end(), comp)); in test()
176 auto result = std::ranges::unique(in, comp); in test()
177 … assert(std::ranges::equal(in.begin(), result.begin(), expected.begin(), expected.end(), comp)); in test()
/llvm-project-15.0.7/libcxx/test/std/thread/thread.barrier/
H A Dcompletion.pass.cpp27 auto comp = [&]() noexcept { x += 1; }; in main() local
28 std::barrier<decltype(comp)> b(2, comp); in main()
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/readability/
H A Dstring-compare.cpp26 std::string comp() { in comp() function
79 if (comp().compare(str1) == 0) { in Test()
83 if (str1.compare(comp()) == 0) { in Test()
87 if (str1.compare(comp())) { in Test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/
H A Dranges_equal_range.pass.cpp39 requires(Iter&& iter, Sent&& sent, const T& value, Comp&& comp, Proj&& proj) {
44 std::forward<Comp>(comp),
61 requires(R&& r, const T& value, Comp&& comp, Proj&& proj) {
62 std::ranges::equal_range(std::forward<R>(r), value, comp, proj);
181 const auto comp = [](const Data& x, const Data& y) { return x.data < y.data; }; in test() local
184 auto result = std::ranges::equal_range(in.begin(), in.end(), value, comp); in test()
192 auto result = std::ranges::equal_range(in, value, comp); in test()

1234567