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
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
|
/*
* Copyright © 2012 Intel Corporation
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
*
* Author: Benjamin Segovia <benjamin.segovia@intel.com>
*/
#include "cl_kernel.h"
#include "cl_program.h"
#include "cl_device_id.h"
#include "cl_context.h"
#include "cl_alloc.h"
#include "cl_utils.h"
#include "cl_khr_icd.h"
#include "CL/cl.h"
#include "CL/cl_intel.h"
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <assert.h>
static void
cl_program_release_sources(cl_program p)
{
if (p->source) {
cl_free(p->source);
p->source = NULL;
}
}
static void
cl_program_release_binary(cl_program p)
{
if (p->binary) {
cl_free(p->binary);
p->binary = NULL;
}
}
LOCAL void
cl_program_delete(cl_program p)
{
uint32_t ref, i;
if (p == NULL)
return;
/* We are not done with it yet */
if ((ref = atomic_dec(&p->ref_n)) > 1) return;
/* Destroy the sources and binary if still allocated */
cl_program_release_sources(p);
cl_program_release_binary(p);
/* Release the build options. */
if (p->build_opts) {
cl_free(p->build_opts);
p->build_opts = NULL;
}
/* Remove it from the list */
assert(p->ctx);
pthread_mutex_lock(&p->ctx->program_lock);
if (p->prev)
p->prev->next = p->next;
if (p->next)
p->next->prev = p->prev;
if (p->prev == NULL && p->next == NULL)
p->ctx->programs = NULL;
pthread_mutex_unlock(&p->ctx->program_lock);
cl_free(p->bin); /* Free the blob */
for (i = 0; i < p->ker_n; ++i) /* Free the kernels */
cl_kernel_delete(p->ker[i]);
cl_free(p->ker);
/* Program belongs to their parent context */
cl_context_delete(p->ctx);
/* Free the program as allocated by the compiler */
if (p->opaque) gbe_program_delete(p->opaque);
p->magic = CL_MAGIC_DEAD_HEADER; /* For safety */
cl_free(p);
}
LOCAL cl_program
cl_program_new(cl_context ctx)
{
cl_program p = NULL;
/* Allocate the structure */
TRY_ALLOC_NO_ERR (p, CALLOC(struct _cl_program));
SET_ICD(p->dispatch)
p->ref_n = 1;
p->magic = CL_MAGIC_PROGRAM_HEADER;
p->ctx = ctx;
/* The queue also belongs to its context */
cl_context_add_ref(ctx);
exit:
return p;
error:
cl_program_delete(p);
goto exit;
}
LOCAL void
cl_program_add_ref(cl_program p)
{
assert(p);
atomic_inc(&p->ref_n);
}
static cl_int
cl_program_load_gen_program(cl_program p)
{
cl_int err = CL_SUCCESS;
uint32_t i;
assert(p->opaque != NULL);
p->ker_n = gbe_program_get_kernel_num(p->opaque);
/* Allocate the kernel array */
TRY_ALLOC (p->ker, CALLOC_ARRAY(cl_kernel, p->ker_n));
for (i = 0; i < p->ker_n; ++i) {
const gbe_kernel opaque = gbe_program_get_kernel(p->opaque, i);
assert(opaque != NULL);
TRY_ALLOC (p->ker[i], cl_kernel_new(p));
cl_kernel_setup(p->ker[i], opaque);
}
error:
return err;
}
LOCAL cl_program
cl_program_create_from_binary(cl_context ctx,
cl_uint num_devices,
const cl_device_id * devices,
const size_t * lengths,
const unsigned char ** binaries,
cl_int * binary_status,
cl_int * errcode_ret)
{
cl_program program = NULL;
cl_int err = CL_SUCCESS;
assert(ctx);
INVALID_DEVICE_IF (num_devices != 1);
INVALID_DEVICE_IF (devices == NULL);
INVALID_DEVICE_IF (devices[0] != ctx->device);
INVALID_VALUE_IF (binaries == NULL);
INVALID_VALUE_IF (lengths == NULL);
if (binaries[0] == NULL) {
err = CL_INVALID_VALUE;
if (binary_status)
binary_status[0] = CL_INVALID_VALUE;
goto error;
}
if (lengths[0] == 0) {
err = CL_INVALID_VALUE;
if (binary_status)
binary_status[0] = CL_INVALID_VALUE;
goto error;
}
program = cl_program_new(ctx);
// TODO: Need to check the binary format here to return CL_INVALID_BINARY.
TRY_ALLOC(program->binary, cl_calloc(lengths[0], sizeof(char)));
memcpy(program->binary, binaries[0], lengths[0]);
program->binary_sz = lengths[0];
program->source_type = FROM_BINARY;
if (binary_status)
binary_status[0] = CL_SUCCESS;
exit:
if (errcode_ret)
*errcode_ret = err;
return program;
error:
cl_program_delete(program);
program = NULL;
goto exit;
return CL_SUCCESS;
}
LOCAL cl_program
cl_program_create_from_llvm(cl_context ctx,
cl_uint num_devices,
const cl_device_id *devices,
const char *file_name,
cl_int *errcode_ret)
{
cl_program program = NULL;
cl_int err = CL_SUCCESS;
assert(ctx);
INVALID_DEVICE_IF (num_devices != 1);
INVALID_DEVICE_IF (devices == NULL);
INVALID_DEVICE_IF (devices[0] != ctx->device);
INVALID_VALUE_IF (file_name == NULL);
program = cl_program_new(ctx);
program->opaque = gbe_program_new_from_llvm(file_name, 0, NULL, NULL);
if (UNLIKELY(program->opaque == NULL)) {
err = CL_INVALID_PROGRAM;
goto error;
}
/* Create all the kernels */
TRY (cl_program_load_gen_program, program);
program->source_type = FROM_LLVM;
exit:
if (errcode_ret)
*errcode_ret = err;
return program;
error:
cl_program_delete(program);
program = NULL;
goto exit;
}
LOCAL cl_program
cl_program_create_from_source(cl_context ctx,
cl_uint count,
const char **strings,
const size_t *lengths,
cl_int *errcode_ret)
{
cl_program program = NULL;
cl_int err = CL_SUCCESS;
cl_uint i;
int32_t * lens = NULL;
int32_t len_total = 0;
assert(ctx);
char * p = NULL;
// the real compilation step will be done at build time since we do not have
// yet the compilation options
program = cl_program_new(ctx);
TRY_ALLOC (lens, cl_calloc(count, sizeof(int32_t)));
for (i = 0; i < (int) count; ++i) {
size_t len;
if (lengths == NULL || lengths[i] == 0)
len = strlen(strings[i]);
else
len = lengths[i];
lens[i] = len;
len_total += len;
}
TRY_ALLOC(program->source, cl_calloc(len_total+1, sizeof(char)));
p = program->source;
for (i = 0; i < (int) count; ++i) {
memcpy(p, strings[i], lens[i]);
p += lens[i];
}
*p = '\0';
program->source_type = FROM_SOURCE;
exit:
cl_free(lens);
lens = NULL;
if (errcode_ret)
*errcode_ret = err;
return program;
error:
cl_program_delete(program);
program = NULL;
goto exit;
}
LOCAL cl_int
cl_program_build(cl_program p, const char *options)
{
cl_int err = CL_SUCCESS;
int i = 0;
int copyed = 0;
if (options) {
if(p->build_opts == NULL || strcmp(options, p->build_opts) != 0) {
if(p->build_opts) {
cl_free(p->build_opts);
p->build_opts = NULL;
}
TRY_ALLOC (p->build_opts, cl_calloc(strlen(options) + 1, sizeof(char)));
memcpy(p->build_opts, options, strlen(options));
p->source_type = p->source ? FROM_SOURCE : p->binary ? FROM_BINARY : FROM_LLVM;
}
}
if (options == NULL && p->build_opts) {
p->source_type = p->source ? FROM_SOURCE : p->binary ? FROM_BINARY : FROM_LLVM;
cl_free(p->build_opts);
p->build_opts = NULL;
}
if (p->source_type == FROM_SOURCE) {
p->opaque = gbe_program_new_from_source(p->source, 0, options, NULL, NULL);
if (UNLIKELY(p->opaque == NULL)) {
err = CL_BUILD_PROGRAM_FAILURE;
goto error;
}
/* Create all the kernels */
TRY (cl_program_load_gen_program, p);
p->source_type = FROM_LLVM;
} else if (p->source_type == FROM_BINARY) {
p->opaque = gbe_program_new_from_binary(p->binary, p->binary_sz);
if (UNLIKELY(p->opaque == NULL)) {
err = CL_BUILD_PROGRAM_FAILURE;
goto error;
}
/* Create all the kernels */
TRY (cl_program_load_gen_program, p);
p->source_type = FROM_LLVM;
}
for (i = 0; i < p->ker_n; i ++) {
const gbe_kernel opaque = gbe_program_get_kernel(p->opaque, i);
p->bin_sz += gbe_kernel_get_code_size(opaque);
}
TRY_ALLOC (p->bin, cl_calloc(p->bin_sz, sizeof(char)));
for (i = 0; i < p->ker_n; i ++) {
const gbe_kernel opaque = gbe_program_get_kernel(p->opaque, i);
size_t sz = gbe_kernel_get_code_size(opaque);
memcpy(p->bin + copyed, gbe_kernel_get_code(opaque), sz);
copyed += sz;
}
error:
p->is_built = 1;
return err;
}
LOCAL cl_kernel
cl_program_create_kernel(cl_program p, const char *name, cl_int *errcode_ret)
{
cl_kernel from = NULL, to = NULL;
cl_int err = CL_SUCCESS;
uint32_t i = 0;
/* Find the program first */
for (i = 0; i < p->ker_n; ++i) {
assert(p->ker[i]);
const char *ker_name = cl_kernel_get_name(p->ker[i]);
if (strcmp(ker_name, name) == 0) {
from = p->ker[i];
break;
}
}
/* We were not able to find this named kernel */
if (UNLIKELY(from == NULL)) {
err = CL_INVALID_KERNEL_NAME;
goto error;
}
TRY_ALLOC(to, cl_kernel_dup(from));
exit:
if (errcode_ret)
*errcode_ret = err;
return to;
error:
cl_kernel_delete(to);
to = NULL;
goto exit;
}
LOCAL cl_int
cl_program_create_kernels_in_program(cl_program p, cl_kernel* ker)
{
int i = 0;
if(ker == NULL)
return CL_SUCCESS;
for (i = 0; i < p->ker_n; ++i) {
TRY_ALLOC_NO_ERR(ker[i], cl_kernel_dup(p->ker[i]));
}
return CL_SUCCESS;
error:
do {
cl_kernel_delete(ker[i]);
ker[i--] = NULL;
} while(i > 0);
return CL_OUT_OF_HOST_MEMORY;
}
|