|
| 1 | +// RUN: %clangxx %s -o %t1.out -lOpenCL -lsycl |
| 2 | +// RUN: env SYCL_DEVICE_TYPE=HOST %t1.out |
| 3 | +// RUN: %clangxx -fsycl %s -o %t2.out -lOpenCL |
| 4 | +// RUN: env SYCL_DEVICE_TYPE=HOST %t2.out |
| 5 | +// RUN: %CPU_RUN_PLACEHOLDER %t2.out |
| 6 | +// RUN: %GPU_RUN_PLACEHOLDER %t2.out |
| 7 | +// RUN: %ACC_RUN_PLACEHOLDER %t2.out |
| 8 | + |
| 9 | +#include <CL/sycl.hpp> |
| 10 | + |
| 11 | +#include <cassert> |
| 12 | +#include <memory> |
| 13 | + |
| 14 | +using namespace cl::sycl; |
| 15 | + |
| 16 | +// TODO add cases with dimensions more than 1 |
| 17 | +int main() { |
| 18 | + // Id indexer |
| 19 | + { |
| 20 | + vector_class<int> data(10, -1); |
| 21 | + const range<1> globalRange(6); |
| 22 | + { |
| 23 | + buffer<int, 1> b(data.data(), range<1>(10), |
| 24 | + {property::buffer::use_host_ptr()}); |
| 25 | + queue myQueue; |
| 26 | + myQueue.submit([&](handler &cgh) { |
| 27 | + auto B = b. get_access<access::mode::read_write>(cgh); |
| 28 | + cgh.parallel_for<class id1>(globalRange, |
| 29 | + [=](id<1> index) { B[index] = index[0]; }); |
| 30 | + }); |
| 31 | + } |
| 32 | + for (int i = 0; i < data.size(); i++) { |
| 33 | + const int id = data[i]; |
| 34 | + if (i < globalRange[0]) { |
| 35 | + assert(id == i); |
| 36 | + } else { |
| 37 | + assert(id == -1); |
| 38 | + } |
| 39 | + } |
| 40 | + } |
| 41 | + // Item indexer without offset |
| 42 | + { |
| 43 | + vector_class<int2> data(10, int2{-1}); |
| 44 | + const range<1> globalRange(6); |
| 45 | + { |
| 46 | + buffer<int2, 1> b(data.data(), range<1>(10), |
| 47 | + {property::buffer::use_host_ptr()}); |
| 48 | + queue myQueue; |
| 49 | + myQueue.submit([&](handler &cgh) { |
| 50 | + auto B = b. get_access<access::mode::read_write>(cgh); |
| 51 | + cgh.parallel_for<class item1_nooffset>( |
| 52 | + globalRange, [=](item<1, false> index) { |
| 53 | + B[index.get_id()] = int2{index.get_id()[0], index.get_range()[0]}; |
| 54 | + }); |
| 55 | + }); |
| 56 | + } |
| 57 | + for (int i = 0; i < data.size(); i++) { |
| 58 | + const int id = data[i].s0(); |
| 59 | + const int range = data[i].s1(); |
| 60 | + if (i < globalRange[0]) { |
| 61 | + assert(id == i); |
| 62 | + assert(range == globalRange[0]); |
| 63 | + } else { |
| 64 | + assert(id == -1); |
| 65 | + assert(range == -1); |
| 66 | + } |
| 67 | + } |
| 68 | + } |
| 69 | + // Item indexer with offset |
| 70 | + { |
| 71 | + vector_class<int3> data(10, int3{-1}); |
| 72 | + const range<1> globalRange(6); |
| 73 | + const id<1> globalOffset(4); |
| 74 | + { |
| 75 | + buffer<int3, 1> b(data.data(), range<1>(10), |
| 76 | + {property::buffer::use_host_ptr()}); |
| 77 | + queue myQueue; |
| 78 | + myQueue.submit([&](handler &cgh) { |
| 79 | + auto B = b. get_access<access::mode::read_write>(cgh); |
| 80 | + cgh.parallel_for<class item1_offset>( |
| 81 | + globalRange, globalOffset, [=](item<1> index) { |
| 82 | + B[index.get_id()] = int3{index.get_id()[0], index.get_range()[0], |
| 83 | + index.get_offset()[0]}; |
| 84 | + }); |
| 85 | + }); |
| 86 | + } |
| 87 | + for (int i = 0; i < data.size(); i++) { |
| 88 | + const int id = data[i].s0(); |
| 89 | + const int range = data[i].s1(); |
| 90 | + const int offset = data[i].s2(); |
| 91 | + if (i < globalOffset[0]) { |
| 92 | + assert(id == -1); |
| 93 | + assert(range == -1); |
| 94 | + assert(offset == -1); |
| 95 | + } else { |
| 96 | + assert(id == i); |
| 97 | + assert(range == globalRange[0]); |
| 98 | + assert(offset == globalOffset[0]); |
| 99 | + } |
| 100 | + } |
| 101 | + } |
| 102 | + // ND_Item indexer |
| 103 | + { |
| 104 | + vector_class<int3> data(10, int3{-1}); |
| 105 | + const range<1> globalRange(6); |
| 106 | + const range<1> localRange(3); |
| 107 | + const id<1> globalOffset(4); |
| 108 | + const nd_range<1> ndRange(globalRange, localRange, globalOffset); |
| 109 | + { |
| 110 | + buffer<int3, 1> b(data.data(), range<1>(10), |
| 111 | + {property::buffer::use_host_ptr()}); |
| 112 | + queue myQueue; |
| 113 | + myQueue.submit([&](handler &cgh) { |
| 114 | + auto B = b. get_access<access::mode::read_write>(cgh); |
| 115 | + cgh.parallel_for<class item1_nd_range>(ndRange, [=](nd_item<1> index) { |
| 116 | + B[index.get_global_id()] = |
| 117 | + int3{index.get_global_id()[0], index.get_global_range()[0], |
| 118 | + index.get_offset()[0]}; |
| 119 | + }); |
| 120 | + }); |
| 121 | + } |
| 122 | + for (int i = 0; i < data.size(); i++) { |
| 123 | + const int id = data[i].s0(); |
| 124 | + const int range = data[i].s1(); |
| 125 | + const int offset = data[i].s2(); |
| 126 | + if (i < globalOffset[0]) { |
| 127 | + assert(id == -1); |
| 128 | + assert(range == -1); |
| 129 | + assert(offset == -1); |
| 130 | + } else { |
| 131 | + assert(id == i); |
| 132 | + assert(range == globalRange[0]); |
| 133 | + assert(offset == globalOffset[0]); |
| 134 | + } |
| 135 | + } |
| 136 | + } |
| 137 | + return 0; |
| 138 | +} |
0 commit comments