1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
|
//
// Copyright 2012 Francisco Jerez
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
// OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
#include "api/util.hpp"
#include "core/kernel.hpp"
#include "core/event.hpp"
using namespace clover;
PUBLIC cl_kernel
clCreateKernel(cl_program prog, const char *name,
cl_int *errcode_ret) try {
if (!prog)
throw error(CL_INVALID_PROGRAM);
if (!name)
throw error(CL_INVALID_VALUE);
if (prog->binaries().empty())
throw error(CL_INVALID_PROGRAM_EXECUTABLE);
auto sym = prog->binaries().begin()->second.sym(name);
ret_error(errcode_ret, CL_SUCCESS);
return new kernel(*prog, name, { sym.args.begin(), sym.args.end() });
} catch (module::noent_error &e) {
ret_error(errcode_ret, CL_INVALID_KERNEL_NAME);
return NULL;
} catch(error &e) {
ret_error(errcode_ret, e);
return NULL;
}
PUBLIC cl_int
clCreateKernelsInProgram(cl_program prog, cl_uint count,
cl_kernel *kerns, cl_uint *count_ret) {
if (!prog)
throw error(CL_INVALID_PROGRAM);
if (prog->binaries().empty())
throw error(CL_INVALID_PROGRAM_EXECUTABLE);
auto &syms = prog->binaries().begin()->second.syms;
if (kerns && count < syms.size())
throw error(CL_INVALID_VALUE);
if (kerns)
std::transform(syms.begin(), syms.end(), kerns,
[=](const module::symbol &sym) {
return new kernel(*prog, compat::string(sym.name),
{ sym.args.begin(), sym.args.end() });
});
if (count_ret)
*count_ret = syms.size();
return CL_SUCCESS;
}
PUBLIC cl_int
clRetainKernel(cl_kernel kern) {
if (!kern)
return CL_INVALID_KERNEL;
kern->retain();
return CL_SUCCESS;
}
PUBLIC cl_int
clReleaseKernel(cl_kernel kern) {
if (!kern)
return CL_INVALID_KERNEL;
if (kern->release())
delete kern;
return CL_SUCCESS;
}
PUBLIC cl_int
clSetKernelArg(cl_kernel kern, cl_uint idx, size_t size,
const void *value) try {
if (!kern)
throw error(CL_INVALID_KERNEL);
if (idx >= kern->args.size())
throw error(CL_INVALID_ARG_INDEX);
kern->args[idx]->set(size, value);
return CL_SUCCESS;
} catch(error &e) {
return e.get();
}
PUBLIC cl_int
clGetKernelInfo(cl_kernel kern, cl_kernel_info param,
size_t size, void *buf, size_t *size_ret) {
if (!kern)
return CL_INVALID_KERNEL;
switch (param) {
case CL_KERNEL_FUNCTION_NAME:
return string_property(buf, size, size_ret, kern->name());
case CL_KERNEL_NUM_ARGS:
return scalar_property<cl_uint>(buf, size, size_ret,
kern->args.size());
case CL_KERNEL_REFERENCE_COUNT:
return scalar_property<cl_uint>(buf, size, size_ret,
kern->ref_count());
case CL_KERNEL_CONTEXT:
return scalar_property<cl_context>(buf, size, size_ret,
&kern->prog.ctx);
case CL_KERNEL_PROGRAM:
return scalar_property<cl_program>(buf, size, size_ret,
&kern->prog);
default:
return CL_INVALID_VALUE;
}
}
PUBLIC cl_int
clGetKernelWorkGroupInfo(cl_kernel kern, cl_device_id dev,
cl_kernel_work_group_info param,
size_t size, void *buf, size_t *size_ret) {
if (!kern)
return CL_INVALID_KERNEL;
if ((!dev && kern->prog.binaries().size() != 1) ||
(dev && !kern->prog.binaries().count(dev)))
return CL_INVALID_DEVICE;
switch (param) {
case CL_KERNEL_WORK_GROUP_SIZE:
return scalar_property<size_t>(buf, size, size_ret,
kern->max_block_size());
case CL_KERNEL_COMPILE_WORK_GROUP_SIZE:
return vector_property<size_t>(buf, size, size_ret,
kern->block_size());
case CL_KERNEL_LOCAL_MEM_SIZE:
return scalar_property<cl_ulong>(buf, size, size_ret,
kern->mem_local());
case CL_KERNEL_PREFERRED_WORK_GROUP_SIZE_MULTIPLE:
return scalar_property<size_t>(buf, size, size_ret, 1);
case CL_KERNEL_PRIVATE_MEM_SIZE:
return scalar_property<cl_ulong>(buf, size, size_ret,
kern->mem_private());
default:
return CL_INVALID_VALUE;
}
}
namespace {
///
/// Common argument checking shared by kernel invocation commands.
///
void
kernel_validate(cl_command_queue q, cl_kernel kern,
cl_uint dims, const size_t *grid_offset,
const size_t *grid_size, const size_t *block_size,
cl_uint num_deps, const cl_event *deps,
cl_event *ev) {
if (!q)
throw error(CL_INVALID_COMMAND_QUEUE);
if (!kern)
throw error(CL_INVALID_KERNEL);
if (&kern->prog.ctx != &q->ctx ||
any_of([&](const cl_event ev) {
return &ev->ctx != &q->ctx;
}, deps, deps + num_deps))
throw error(CL_INVALID_CONTEXT);
if (bool(num_deps) != bool(deps) ||
any_of(is_zero<cl_event>, deps, deps + num_deps))
throw error(CL_INVALID_EVENT_WAIT_LIST);
if (any_of([](std::unique_ptr<kernel::argument> &arg) {
return !arg->set();
}, kern->args.begin(), kern->args.end()))
throw error(CL_INVALID_KERNEL_ARGS);
if (!kern->prog.binaries().count(&q->dev))
throw error(CL_INVALID_PROGRAM_EXECUTABLE);
if (dims < 1 || dims > q->dev.max_block_size().size())
throw error(CL_INVALID_WORK_DIMENSION);
if (!grid_size || any_of(is_zero<size_t>, grid_size, grid_size + dims))
throw error(CL_INVALID_GLOBAL_WORK_SIZE);
if (block_size) {
if (any_of([](size_t b, size_t max) {
return b == 0 || b > max;
}, block_size, block_size + dims,
q->dev.max_block_size().begin()))
throw error(CL_INVALID_WORK_ITEM_SIZE);
if (any_of([](size_t b, size_t g) {
return g % b;
}, block_size, block_size + dims, grid_size))
throw error(CL_INVALID_WORK_GROUP_SIZE);
if (fold(std::multiplies<size_t>(), 1u,
block_size, block_size + dims) >
q->dev.max_threads_per_block())
throw error(CL_INVALID_WORK_GROUP_SIZE);
}
}
///
/// Common event action shared by kernel invocation commands.
///
std::function<void (event &)>
kernel_op(cl_command_queue q, cl_kernel kern,
const std::vector<size_t> &grid_offset,
const std::vector<size_t> &grid_size,
const std::vector<size_t> &block_size) {
const std::vector<size_t> reduced_grid_size = map(
std::divides<size_t>(), grid_size.begin(), grid_size.end(),
block_size.begin());
return [=](event &) {
kern->launch(*q, grid_offset, reduced_grid_size, block_size);
};
}
std::vector<size_t>
opt_vector(const size_t *p, unsigned n, size_t x) {
if (p)
return { p, p + n };
else
return { n, x };
}
}
PUBLIC cl_int
clEnqueueNDRangeKernel(cl_command_queue q, cl_kernel kern,
cl_uint dims, const size_t *pgrid_offset,
const size_t *pgrid_size, const size_t *pblock_size,
cl_uint num_deps, const cl_event *deps,
cl_event *ev) try {
auto grid_offset = opt_vector(pgrid_offset, dims, 0);
auto grid_size = opt_vector(pgrid_size, dims, 1);
auto block_size = opt_vector(pblock_size, dims, 1);
kernel_validate(q, kern, dims, pgrid_offset, pgrid_size, pblock_size,
num_deps, deps, ev);
hard_event *hev = new hard_event(
*q, CL_COMMAND_NDRANGE_KERNEL, { deps, deps + num_deps },
kernel_op(q, kern, grid_offset, grid_size, block_size));
ret_object(ev, hev);
return CL_SUCCESS;
} catch(error &e) {
return e.get();
}
PUBLIC cl_int
clEnqueueTask(cl_command_queue q, cl_kernel kern,
cl_uint num_deps, const cl_event *deps,
cl_event *ev) try {
const std::vector<size_t> grid_offset = { 0 };
const std::vector<size_t> grid_size = { 1 };
const std::vector<size_t> block_size = { 1 };
kernel_validate(q, kern, 1, grid_offset.data(), grid_size.data(),
block_size.data(), num_deps, deps, ev);
hard_event *hev = new hard_event(
*q, CL_COMMAND_TASK, { deps, deps + num_deps },
kernel_op(q, kern, grid_offset, grid_size, block_size));
ret_object(ev, hev);
return CL_SUCCESS;
} catch(error &e) {
return e.get();
}
PUBLIC cl_int
clEnqueueNativeKernel(cl_command_queue q, void (*func)(void *),
void *args, size_t args_size,
cl_uint obj_count, const cl_mem *obj_list,
const void **obj_args, cl_uint num_deps,
const cl_event *deps, cl_event *ev) {
return CL_INVALID_OPERATION;
}
|