Home
last modified time | relevance | path

Searched refs:work (Results 1 – 25 of 1203) sorted by relevance

12345678910>>...49

/llvm-project-15.0.7/clang/test/Analysis/
H A Dcxx-for-range.cpp9 work(); in testLoop()
10 work(); in testLoop()
13 work(); in testLoop()
14 work(); in testLoop()
39 work(); in testLoopOpaqueCollection()
40 work(); in testLoopOpaqueCollection()
43 work(); in testLoopOpaqueCollection()
44 work(); in testLoopOpaqueCollection()
74 work(); in testLoopOpaqueIterator()
75 work(); in testLoopOpaqueIterator()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/lsan/
H A Dlsan_mac.cpp140 void (^work)(void));
142 void (^work)(void));
158 GET_LSAN_BLOCK(work);
164 GET_LSAN_BLOCK(work);
169 void (^work)(void)) {
170 GET_LSAN_BLOCK(work);
175 void (^work)(void)) {
176 if (!work) {
180 GET_LSAN_BLOCK(work);
185 void (^work)(void)) {
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
H A Dsort_constexpr.pass.cpp35 T work[N] = {}; in test() local
36 std::copy(orig, orig+N, work); in test()
37 std::sort(Iter(work), Iter(work+N)); in test()
38 assert(std::is_sorted(work, work+N)); in test()
39 assert(std::is_permutation(work, work+N, orig)); in test()
53 T *work[N] = {}; in test_pointers() local
54 std::copy(orig, orig+N, work); in test_pointers()
55 std::sort(Iter(work), Iter(work+N)); in test_pointers()
56 assert(std::is_sorted(work, work+N)); in test_pointers()
57 assert(std::is_permutation(work, work+N, orig)); in test_pointers()
H A Dsort_constexpr_comp.pass.cpp36 T work[N] = {}; in test() local
37 std::copy(orig, orig+N, work); in test()
38 std::sort(Iter(work), Iter(work+N), std::greater<T>()); in test()
39 assert(std::is_sorted(work, work+N, std::greater<T>())); in test()
40 assert(std::is_permutation(work, work+N, orig)); in test()
54 T *work[N] = {}; in test_pointers() local
55 std::copy(orig, orig+N, work); in test_pointers()
56 std::sort(Iter(work), Iter(work+N), std::greater<T*>()); in test_pointers()
57 assert(std::is_sorted(work, work+N, std::greater<T*>())); in test_pointers()
58 assert(std::is_permutation(work, work+N, orig)); in test_pointers()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dpop_heap.pass.cpp28 T work[15] = {9,6,9,5,5, 8,9,1,1,3, 5,3,4,7,2}; in test() local
31 std::pop_heap(Iter(work), Iter(work+i)); in test()
32 assert(std::is_heap(work, work+i-1)); in test()
33 assert(std::max_element(work, work+i-1) == work); in test()
34 assert(std::is_permutation(work, work+15, orig)); in test()
36 assert(std::is_sorted(work, work+15)); in test()
H A Dpop_heap_comp.pass.cpp28 T work[15] = {1,1,2,3,3, 8,4,6,5,5, 5,9,9,7,9}; in test() local
31 std::pop_heap(Iter(work), Iter(work+i), std::greater<T>()); in test()
32 assert(std::is_heap(work, work+i-1, std::greater<T>())); in test()
33 assert(std::min_element(work, work+i-1) == work); in test()
34 assert(std::is_permutation(work, work+15, orig)); in test()
36 assert(std::is_sorted(work, work+15, std::greater<T>())); in test()
/llvm-project-15.0.7/compiler-rt/lib/asan/
H A Dasan_mac.cpp244 void(^work)(void));
246 void(^work)(void));
252 #define GET_ASAN_BLOCK(work) \ argument
258 work(); \
262 dispatch_queue_t dq, void(^work)(void)) {
264 GET_ASAN_BLOCK(work);
271 GET_ASAN_BLOCK(work);
278 GET_ASAN_BLOCK(work);
284 if (!work) {
289 GET_ASAN_BLOCK(work);
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/
H A Dpartial_sort.pass.cpp27 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
30 std::partial_sort(Iter(work), Iter(work+m), Iter(work+n)); in test()
31 assert(std::is_sorted(work, work+m)); in test()
32 assert(std::is_permutation(work, work+n, orig)); in test()
35 assert(m == 0 || !(work[i] < work[m-1])); in test()
37 std::copy(orig, orig+15, work); in test()
H A Dpartial_sort_comp.pass.cpp29 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
32 std::partial_sort(Iter(work), Iter(work+m), Iter(work+n), std::greater<T>()); in test()
33 assert(std::is_sorted(work, work+m, std::greater<T>())); in test()
34 assert(std::is_permutation(work, work+n, orig)); in test()
37 assert(m == 0 || !(work[i] > work[m-1])); in test()
39 std::copy(orig, orig+15, work); in test()
/llvm-project-15.0.7/mlir/test/IR/
H A Dregion.mlir10 {"work"() : () -> ()},
11 {"work"() : () -> ()}
21 {"work"() : () -> ()}
31 {"work"() : () -> ()},
32 {"work"() : () -> ()},
33 {"work"() : () -> ()}
48 "work"() : () -> ()
51 "work"() : () -> ()
54 "work"() : () -> ()
57 "work"() : () -> ()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/
H A Dnth_element.pass.cpp27 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
30 std::nth_element(Iter(work), Iter(work+m), Iter(work+n)); in test()
31 assert(std::is_permutation(work, work+n, orig)); in test()
34 assert(!(work[i] > work[m])); in test()
38 assert(!(work[i] < work[m])); in test()
40 std::copy(orig, orig+15, work); in test()
H A Dnth_element_comp.pass.cpp28 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
31 std::nth_element(Iter(work), Iter(work+m), Iter(work+n), std::greater<T>()); in test()
32 assert(std::is_permutation(work, work+n, orig)); in test()
35 assert(!(work[i] < work[m])); in test()
39 assert(!(work[i] > work[m])); in test()
41 std::copy(orig, orig+15, work); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
H A Dsort_heap.pass.cpp30 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
32 std::make_heap(work, work+n); in test()
33 std::sort_heap(Iter(work), Iter(work+n)); in test()
34 assert(std::is_sorted(work, work+n)); in test()
35 assert(std::is_permutation(work, work+n, orig)); in test()
36 std::copy(orig, orig+n, work); in test()
H A Dsort_heap_comp.pass.cpp30 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
32 std::make_heap(work, work+n, std::greater<T>()); in test()
33 std::sort_heap(Iter(work), Iter(work+n), std::greater<T>()); in test()
34 assert(std::is_sorted(work, work+n, std::greater<T>())); in test()
35 assert(std::is_permutation(work, work+n, orig)); in test()
36 std::copy(orig, orig+n, work); in test()
/llvm-project-15.0.7/clang/test/CodeGenCUDA/
H A Ddevice-var-linkage.cu63 __device__ __host__ int work(int *x);
66 return work(&ev1) + work(&ev2) + work(&sv1) + work(&sv2) in fun1()
68 + work(&ev3) + work(&sv3) in fun1()
/llvm-project-15.0.7/llvm/test/CodeGen/X86/Inputs/
H A Dfsloader.afdo1 work:42380966:1346190
16 6.3584: 278916 work:284547
17 6.4096: 260670 work:249428
24 8.11776: 283590 work:305061
25 8.12288: 279149 work:281368
26 8.13824: 234082 work:225786
/llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/Inputs/
H A Dfsafdo.prof1 work:33383580:1068858
16 6.268435456: 202301 work:198259
17 6.1073741824: 222893 work:231680
24 8.2818572288: 222101 work:238765
25 8.3489660928: 183304 work:181615
26 8.4160749568: 217053 work:218539
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A Dmake_heap.pass.cpp27 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
29 std::make_heap(Iter(work), Iter(work+n)); in test()
30 assert(std::is_heap(work, work+n)); in test()
31 assert(std::is_permutation(work, work+n, orig)); in test()
32 std::copy(orig, orig+n, work); in test()
H A Dmake_heap_comp.pass.cpp28 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
30 std::make_heap(Iter(work), Iter(work+n), std::greater<T>()); in test()
31 assert(std::is_heap(work, work+n, std::greater<T>())); in test()
32 assert(std::is_permutation(work, work+n, orig)); in test()
33 std::copy(orig, orig+n, work); in test()
/llvm-project-15.0.7/clang/test/OpenMP/
H A Dreduction_compound_op.cpp46 void work(Point &P, int N, Point const *Points);
52 work(Red, I, Points); in foo()
56 work(Red, I, Points); in foo()
60 work(Red, I, Points); in foo()
64 work(Red, I, Points); in foo()
68 work(Red, I, Points); in foo()
72 work(Red, I, Points); in foo()
76 work(Red, I, Points); in foo()
80 work(Red, I, Points); in foo()
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dattr-unparseable.ll24 ; CHECK: can't parse first integer attribute amdgpu-flat-work-group-size
29 attributes #3 = {"amdgpu-flat-work-group-size"}
31 ; CHECK: can't parse first integer attribute amdgpu-flat-work-group-size
36 attributes #4 = {"amdgpu-flat-work-group-size"="k"}
38 ; CHECK: can't parse second integer attribute amdgpu-flat-work-group-size
43 attributes #5 = {"amdgpu-flat-work-group-size"="1"}
45 ; CHECK: can't parse second integer attribute amdgpu-flat-work-group-size
50 attributes #6 = {"amdgpu-flat-work-group-size"="1,k"}
52 ; CHECK: can't parse second integer attribute amdgpu-flat-work-group-size
57 attributes #7 = {"amdgpu-flat-work-group-size"="1,2,3"}
/llvm-project-15.0.7/clang/test/CodeGenOpenCL/
H A Damdgpu-attrs.cl152 // X86-NOT: "amdgpu-flat-work-group-size"
158 // CHECK-NOT: "amdgpu-flat-work-group-size"="0,0"
164 // CHECK-DAG: attributes [[FLAT_WORK_GROUP_SIZE_32_64]] = {{.*}} "amdgpu-flat-work-group-size"="32,…
165 // CHECK-DAG: attributes [[FLAT_WORK_GROUP_SIZE_64_64]] = {{.*}} "amdgpu-flat-work-group-size"="64,…
166 // CHECK-DAG: attributes [[FLAT_WORK_GROUP_SIZE_16_128]] = {{.*}} "amdgpu-flat-work-group-size"="16…
168 // CHECK-DAG: attributes [[WAVES_PER_EU_2]] = {{.*}} "amdgpu-flat-work-group-size"="1,256" "amdgpu…
170 // CHECK-DAG: attributes [[WAVES_PER_EU_2_4]] = {{.*}} "amdgpu-flat-work-group-size"="1,256" "amdgp…
171 // CHECK-DAG: attributes [[NUM_SGPR_32]] = {{.*}} "amdgpu-flat-work-group-size"="1,256" "amdgpu-num…
172 // CHECK-DAG: attributes [[NUM_VGPR_64]] = {{.*}} "amdgpu-flat-work-group-size"="1,256" "amdgpu-num…
176 // CHECK-DAG: attributes [[FLAT_WORK_GROUP_SIZE_32_64_NUM_SGPR_32]] = {{.*}} "amdgpu-flat-work-grou…
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dpartial_sort_copy.pass.cpp30 T work[15] = {}; in test() local
33 … OutIter it = std::partial_sort_copy(Iter(orig), Iter(orig+n), OutIter(work), OutIter(work+m)); in test()
35 assert(it == OutIter(work+n)); in test()
36 assert(std::is_permutation(OutIter(work), it, orig)); in test()
38 assert(it == OutIter(work+m)); in test()
40 assert(std::is_sorted(OutIter(work), it)); in test()
41 if (it != OutIter(work)) { in test()
H A Dpartial_sort_copy_comp.pass.cpp33 T work[15] = {}; in test() local
36 …Iter it = std::partial_sort_copy(Iter(orig), Iter(orig+n), OutIter(work), OutIter(work+m), std::gr… in test()
38 assert(it == OutIter(work+n)); in test()
39 assert(std::is_permutation(OutIter(work), it, orig)); in test()
41 assert(it == OutIter(work+m)); in test()
43 assert(std::is_sorted(OutIter(work), it, std::greater<T>())); in test()
44 if (it != OutIter(work)) { in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/
H A Dpush_heap.pass.cpp28 T work[15] = {3,1,4,1,5, 9,2,6,5,3, 5,8,9,7,9}; in test() local
30 std::push_heap(Iter(work), Iter(work+i)); in test()
31 assert(std::is_permutation(work, work+i, orig)); in test()
32 assert(std::is_heap(work, work+i)); in test()

12345678910>>...49